Package fr.univNantes.intcolls

Class Summary
ArrayIntList This class implements a List by an Array of integer.
ArrayIntListIterator Iterator implementation of ArrayIntList
ArrayLongList This class implements a List by an Array of integer.
ArrayLongListIterator Iterator implementation for ArrayLongList
BinaryIntSet This class implements a NavigableSet on a faster manner than HashSet or TreeSet do.
BinaryIntSetIterator Iterator implementation for the BinaryIntSet class.
BinaryIntSetIterator.Context Context class
BinaryLongSet This class implements a NavigableSet on a faster manner than HashSet or TreeSet do.
BinaryLongSetIterator Iterator specialized for a BinaryLongSet.
BinaryLongSetIterator.Context Context class
ConcurrentBinaryIntSet Concurrent version of BinaryIntSet.
ConcurrentBinaryLongSet Concurrent version of BinaryLongSet Concurrency is enforced by the following features : synchronisation on Block elements usage of an AtomicInteger to store set size usage of a ConcurrentSkipMap to store blocks indexed by their block number
DescendingNavigableMap<K,V> This class implements a reverse order navigable map.
DescendingNavigableSet<E> Descending Navigable Set This class implements a NavigableSet with a reverse (descending) order.
DualArrayIntMap<V> This class is a specialized map with integer keys.
DualArrayIntMap.DAIMValueCollection<V> Describes a Set view overs values
DualArrayLongMap<V> This class is a specialized map with long integer keys.
DualArrayLongMap.DALMValueCollection<V> Describes a Set view overs values
NavigableMapEntrySet<K,V> Implements a simple NavigableSet over entries of a NavigableMap.
NavigableMapKeySet<K,V> Implements a simple NavigableSet over keys of a NavigableMap
NavigableMapSubMap<K,V> Implements a simple subset of a NavigableSet.
NavigableSetIterator<E> Iterator over a BinaryIntSet
NavigableSetSubSet<E> Implements a simple subset of a NavigableSet