# Package org.codehaus.groovy.util

- Interface Summary
  Interface | Description
  --- | ---
  AbstractConcurrentMap.Entry<K,V> |
  AbstractConcurrentMapBase.Entry<V> |
  ComplexKeyHashMap.EntryIterator |
  Finalizable |
  Reference<T,V extends Finalizable> |
  SingleKeyHashMap.Copier |

- Class Summary
  Class | Description
  --- | ---
  AbstractConcurrentMap<K,V> |
  AbstractConcurrentMap.Segment<K,V> |
  AbstractConcurrentMapBase |
  AbstractConcurrentMapBase.Segment |
  ArrayIterator<T> |
  CharSequenceReader | `Reader` implementation that can read from String, StringBuffer, StringBuilder, CharBuffer or GString.
  ComplexKeyHashMap |
  ComplexKeyHashMap.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".
  IteratorBufferedIterator<T> | An implementation for BufferedIterator wraps Iterator.
  LazyReference<T> | Soft reference with lazy initialization under lock
  ListBufferedIterator<T> | An implementation for BufferedIterator wraps ListIterator.
  ListHashMap<K,V> | This class represents a `Map` that is optimized for a small number of entries.
  LockableObject | A bit simplified lock designed to be inherited by.
  ManagedConcurrentLinkedQueue<T> | A queue that stores values wrapped in a Reference, the type of which is determined by the provided `ReferenceBundle`.
  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.
  ManagedLinkedList<T> | Deprecated replaced by `ManagedConcurrentLinkedQueue`
  ManagedReference<T> |
  ReferenceBundle |
  ReferenceManager |
  ReleaseInfo | Exposes the Groovy release information
  SingleKeyHashMap |
  SingleKeyHashMap.Entry |
  TripleKeyHashMap |
  TripleKeyHashMap.Entry |
  URLStreams |

- Enum Summary
  Enum | Description
  --- | ---
  ReferenceType |