| AbstractConcurrentDoubleKeyMap<K1,K2,V> |
|
| AbstractConcurrentMap<K,V> |
|
| AbstractConcurrentMap.Segment<K,V> |
|
| AbstractConcurrentMapBase |
|
| AbstractConcurrentMapBase.Segment |
|
| ArrayIterator<T> |
|
| ComplexKeyHashMap |
|
| ComplexKeyHashMap.Entry |
|
| DoubleKeyHashMap |
|
| DoubleKeyHashMap.Entry |
|
| FastArray |
|
| HashCodeHelper |
A utility class to help calculate hashcode values
using an algorithm similar to that outlined in
"Effective Java, Joshua Bloch, 2nd Edition".
|
| LazyReference<T> |
Soft reference with lazy initialization under lock
|
| ListHashMap<K,V> |
This represents a
|
| LockableObject |
A bit simplified lock designed to be inherited by.
|
| ManagedConcurrentMap<K,V> |
|
| ManagedConcurrentMap.Entry<K,V> |
|
| ManagedConcurrentMap.EntryWithValue<K,V> |
|
| ManagedConcurrentMap.Segment<K,V> |
|
| ManagedConcurrentValueMap<K,V> |
This is a basic implementation of a map able to forget its values.
|
| ManagedDoubleKeyMap<K1,K2,V> |
|
| ManagedDoubleKeyMap.Entry<K1,K2,V> |
|
| ManagedLinkedList<T> |
This class provides a very simple linked list of memory managed elements.
|
| ManagedReference<T> |
|
| ReferenceBundle |
|
| ReferenceManager |
|
| ReleaseInfo |
Exposes the Groovy release information
|
| SingleKeyHashMap |
|
| SingleKeyHashMap.Entry |
|
| TripleKeyHashMap |
|
| TripleKeyHashMap.Entry |
|