Package com.helger.commons.collection.impl

Class Summary

Class	Description
AbstractSoftMap<K,V>	Soft Map implementation based on http://www.javaspecialists.eu/archive/Issue015.html The entrySet implementation is from org.hypergraphdb.util
AbstractSoftMap.SoftValue<K,V>	We define our own subclass of SoftReference which contains not only the value but also the key to make it easier to find the entry in the HashMap after it's been garbage collected.
AbstractWrappedList<ELEMENTTYPE>	This is a facade for a list.
ComparatorMapEntryKey<KEYTYPE,VALUETYPE>
ComparatorMapEntryKeyComparable<KEYTYPE extends Comparable<? super KEYTYPE>,VALUETYPE>
ComparatorMapEntryValue<KEYTYPE,VALUETYPE>
ComparatorMapEntryValueComparable<KEYTYPE,VALUETYPE extends Comparable<? super VALUETYPE>>
EmptySortedSet<T>	Default implementation of an empty sorted set.
MapEntry<KEYTYPE,VALUETYPE>	Simple implementation of Map.Entry.
NonBlockingStack<ELEMENTTYPE>	A version of a stack that does not use Vector but an ArrayList as the underlying data structure as opposed to Stack.
SafeArrayList<ELEMENTTYPE>	This is a specialized ArrayList that can handle read accesses on list items that are not yet in the container.
SafeVector<ELEMENTTYPE>	This is a specialized Vector that can handle read accesses on list items that are not yet in the container.
SingleElementList<ELEMENTTYPE>	Implementation of the List interface handling exactly one element and no more!
SingleElementMap<KEYTYPE,VALUETYPE>	Map implementation that can only keep 0 or 1 element.
SoftHashMap<K,V>	Soft HashMap implementation based on http://www.javaspecialists.eu/archive/Issue015.html The entrySet implementation is from org.hypergraphdb.util
SoftLinkedHashMap<K,V>	Soft HashMap implementation based on http://www.javaspecialists.eu/archive/Issue015.html The entrySet implementation is from org.hypergraphdb.util