MRUAndAllTimeTop_optimized - keep sorted top ten list [1031875]

// synchronized except for iterator
persistable sclass MRUAndAllTimeTop_optimized<A> {
  Map<A, Bool> mru = syncMRUCache(10); // most recently used
  new OptimizedMultiSet<A> allTimeTop;
  int allTimeMaxSize = 100;

  // increase a's score in all time top and move to front int MRU
  synchronized void add(A a) {
    mru.remove(a); // force re-insertion
    mru.put(a, true);
    allTimeTop.add(a);
    allTimeTop.truncate(allTimeMaxSize);
  }
  
  synchronized void addAll(Iterable<A> l) { fOr (A a : l) add(a); }
  
  // may count elements twice
  synchronized int size() {
    ret l(mru) + allTimeTop.uniqueSize();
  }
  
  // interleave latest and most often accessed elements
  // iterator not synchronized
  synchronized ItIt<A> mixedIterator() {
    ret uniqueIterator(roundRobinCombinedIterator(
      reversedIterator(keysList(mru)),
      iterator(allTimeTop.highestFirst())));
  }
  
  toString {
    ret shortClassName(this) + " (" + n2(size()) + ")";
  }
  
  // MRU elements in last access order
  // (These aren't that optimized, really. Should replace
  // LinkedHashMap.)
  Cl<A> recent() {
    ret reversedKeysList(mru);
  }
  
  A mostRecent() {
    ret last(keys(mru));
  }
}

Travelled to 4 computer(s): bhatertpkbcr, ekrmjmnbrukm, mqqgnosmbjvj, pyentgdyhuwx

Snippet ID:	#1031875
Snippet name:	MRUAndAllTimeTop_optimized - keep sorted top ten list
Eternal ID of this version:	#1031875/12
Text MD5:	36cde0f285098a16e614db74876b80de
Transpilation MD5:	b14d5f5e062dba2d25680f21bea61d0d
Author:	stefan
Category:	javax
Type:	JavaX fragment (include)
Public (visible to everyone):	Yes
Archived (hidden from active list):	No
Created/modified:	2022-08-12 03:58:13
Source code size:	1238 bytes / 44 lines
Pitched / IR pitched:	No / No
Views / Downloads:	296 / 556
Version history:	11 change(s)
Referenced in:	[show references]

< > BotCompany Repo | #1031875 // MRUAndAllTimeTop_optimized - keep sorted top ten list

JavaX fragment (include) [tags: use-pretranspiled]

Author comment

1	// synchronized except for iterator
2	persistable sclass MRUAndAllTimeTop_optimized<A> {
3	Map<A, Bool> mru = syncMRUCache(10); // most recently used
4	new OptimizedMultiSet<A> allTimeTop;
5	int allTimeMaxSize = 100;
6
7	// increase a's score in all time top and move to front int MRU
8	synchronized void add(A a) {
9	mru.remove(a); // force re-insertion
10	mru.put(a, true);
11	allTimeTop.add(a);
12	allTimeTop.truncate(allTimeMaxSize);
13	}
14
15	synchronized void addAll(Iterable<A> l) { fOr (A a : l) add(a); }
16
17	// may count elements twice
18	synchronized int size() {
19	ret l(mru) + allTimeTop.uniqueSize();
20	}
21
22	// interleave latest and most often accessed elements
23	// iterator not synchronized
24	synchronized ItIt<A> mixedIterator() {
25	ret uniqueIterator(roundRobinCombinedIterator(
26	reversedIterator(keysList(mru)),
27	iterator(allTimeTop.highestFirst())));
28	}
29
30	toString {
31	ret shortClassName(this) + " (" + n2(size()) + ")";
32	}
33
34	// MRU elements in last access order
35	// (These aren't that optimized, really. Should replace
36	// LinkedHashMap.)
37	Cl<A> recent() {
38	ret reversedKeysList(mru);
39	}
40
41	A mostRecent() {
42	ret last(keys(mru));
43	}
44	}