Package de.tsl2.nano.collection

Class Summary

Class	Description
ArrSegList<TARRAY,T>	The segments are object arrays. were created as a base for fast primitive segmentation arrays, but it is not faster than the origin ArrayList.
CollectionUtil	some transformation und filter methods for collections
CyclingIterator<E>	It is an endless looping iterator - useful for switches and more.
Entry<K,V>	part of MapEntrySet. as the hashmap implementation doesn't make Map.Entry serializable, we have to write our own entry class.
ExpiringMap<K,V>	map holding entries with a lifecycle defined by a ExpiringMap.timeout. on adding elements, old elements may be removed.
FilteringIterator<E>	Runtime filtering Iterator.
FloatArray	fast primitive dynamic array using floats. stores array-segments and is about 40% faster as an ArrayList - on a test adding and getting one million floats.
FormTable<H extends Format & Comparable<H>,ID>	Simple extension of TableList to get formatted values.
MapEntrySet<K,V>	Combines the interfaces of List and Map.
PersistableSingelton	simple base class for a stored object as singelton.
PersistentCache	application cache to store simple data. uses an own ReferenceMap with weak keys to avoid out-of-memory errors.
ReferenceMap<K,V>
SegmentList<TARRAY,T>	"@deprecated" please use FloatArray dynamic array using an ArrayList as segmentation store. the segments are object arrays. were created as a base for fast primitive segmentation arrays, but it is not faster than the origin ArrayList. because of constraint java generics, it is not possible to use with primitives.
TableList<H extends Comparable<H>,ID>	Defines a table of values.
TimedReferenceMap<V>	The ReferenceMap of apache commons is overwritten to add temporarily hard references.
TimedReferences<T>	This map holds all new values for a short time after creation - to avoid being deleted to fast in weak-reference maps (see ReferenceMap(SOFT, WEAK)).
TransformingIterator<S,T>	Runtime transforming Iterator.