| Cache<K,V> |
static var MY_CACHE = new Cache( 1000, \ foo -> getBar( foo ) )
|
| Cache.ConcurrentLinkedHashMap<K,V> |
A ConcurrentMap with a doubly-linked list running through its entries.
|
| Cache.ConcurrentLinkedHashMap.Node<K,V> |
A node on the double-linked list.
|
| Cache.ConcurrentLinkedHashMap.SimpleEntry<K,V> |
This duplicates AbstractMap.SimpleEntry until the class is made accessible.
|
| ConcurrentHashSet<K> |
|
| ConcurrentWeakHashMap<K,V> |
A hash table with weak keys, full concurrency of retrievals, and
adjustable expected concurrency for updates.
|
| ConcurrentWeakHashMap.HashEntry<K,V> |
ConcurrentWeakHashMap list entry.
|
| ConcurrentWeakHashMap.Segment<K,V> |
Segments are specialized versions of hash tables.
|
| ConcurrentWeakHashMap.SimpleEntry<K,V> |
|
| ConcurrentWeakHashMap.WeakKeyReference<K> |
A weak-key reference which stores the key hash needed for reclamation.
|
| ConcurrentWeakValueHashMap<K,V> |
Adapted from com.intellij.util.containers.ConcurrentWeakValueHashMap
|
| ConcurrentWeakValueHashMap.MyReference<K,T> |
|
| LockingLazyVar<T> |
|
| LocklessLazyVar<T> |
Implements the lazy initialization pattern.
|