All Classes
| Class | Description |
|---|---|
| AbstractByte2ByteFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2ByteMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2ByteMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractByte2ByteMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2ByteSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractByte2CharFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2CharMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2CharMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractByte2CharMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2CharSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractByte2DoubleFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2DoubleMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2DoubleMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractByte2DoubleMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2DoubleSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractByte2IntFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2IntMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2IntMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractByte2IntMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2IntSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractByte2LongFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2LongMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2LongMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractByte2LongMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2LongSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractByte2ObjectFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2ObjectMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2ObjectMap.BasicEntry<V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractByte2ObjectMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2ObjectSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractByte2ReferenceFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2ReferenceMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2ReferenceMap.BasicEntry<V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractByte2ReferenceMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2ReferenceSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractByteBidirectionalIterator | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractByteBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractByteBigList.ByteRandomAccessSubList | |
| AbstractByteBigList.ByteSubList |
A class implementing a sublist view.
|
| AbstractByteBigListIterator | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractByteCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractByteComparator | Deprecated.
As of fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the type-specific interface.
|
| AbstractByteIterator |
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractByteList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractByteList.ByteRandomAccessSubList | |
| AbstractByteList.ByteSubList |
A class implementing a sublist view.
|
| AbstractByteListIterator | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractBytePriorityQueue | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractByteSet |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractByteSortedSet |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractByteSpliterator |
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractByteStack | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractChar2ByteFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2ByteMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2ByteMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractChar2ByteMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2ByteSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractChar2CharFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2CharMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2CharMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractChar2CharMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2CharSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractChar2DoubleFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2DoubleMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2DoubleMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractChar2DoubleMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2DoubleSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractChar2IntFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2IntMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2IntMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractChar2IntMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2IntSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractChar2LongFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2LongMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2LongMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractChar2LongMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2LongSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractChar2ObjectFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2ObjectMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2ObjectMap.BasicEntry<V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractChar2ObjectMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2ObjectSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractChar2ReferenceFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2ReferenceMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2ReferenceMap.BasicEntry<V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractChar2ReferenceMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2ReferenceSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractCharBidirectionalIterator | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractCharBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractCharBigList.CharRandomAccessSubList | |
| AbstractCharBigList.CharSubList |
A class implementing a sublist view.
|
| AbstractCharBigListIterator | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractCharCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractCharComparator | Deprecated.
As of fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the type-specific interface.
|
| AbstractCharIterator |
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractCharList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractCharList.CharRandomAccessSubList | |
| AbstractCharList.CharSubList |
A class implementing a sublist view.
|
| AbstractCharListIterator | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractCharPriorityQueue | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractCharSet |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractCharSortedSet |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractCharSpliterator |
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractCharStack | Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractDouble2ByteFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2ByteMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2ByteMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractDouble2ByteMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2ByteSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDouble2CharFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2CharMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2CharMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractDouble2CharMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2CharSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDouble2ReferenceFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2ReferenceMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2ReferenceMap.BasicEntry<V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractDouble2ReferenceMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2ReferenceSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2ByteFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2ByteMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2ByteMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractInt2ByteMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2ByteSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2CharFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2CharMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2CharMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractInt2CharMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2CharSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2ReferenceFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2ReferenceMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2ReferenceMap.BasicEntry<V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractInt2ReferenceMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2ReferenceSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractLong2ByteFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2ByteMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2ByteMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractLong2ByteMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2ByteSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractLong2CharFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2CharMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2CharMap.BasicEntry |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractLong2CharMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2CharSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractLong2ReferenceFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2ReferenceMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2ReferenceMap.BasicEntry<V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractLong2ReferenceMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2ReferenceSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2ByteFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2ByteMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2ByteMap.BasicEntry<K> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractObject2ByteMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2ByteSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2CharFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2CharMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2CharMap.BasicEntry<K> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractObject2CharMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2CharSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2ReferenceFunction<K,V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2ReferenceMap<K,V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2ReferenceMap.BasicEntry<K,V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractObject2ReferenceMap.BasicEntrySet<K,V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2ReferenceSortedMap<K,V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2ByteFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2ByteMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2ByteMap.BasicEntry<K> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractReference2ByteMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2ByteSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2CharFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2CharMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2CharMap.BasicEntry<K> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractReference2CharMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2CharSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2DoubleFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2DoubleMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2DoubleMap.BasicEntry<K> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractReference2DoubleMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2DoubleSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2IntFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2IntMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2IntMap.BasicEntry<K> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractReference2IntMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2IntSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2LongFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2LongMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2LongMap.BasicEntry<K> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractReference2LongMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2LongSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2ObjectFunction<K,V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2ObjectMap<K,V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2ObjectMap.BasicEntry<K,V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractReference2ObjectMap.BasicEntrySet<K,V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2ObjectSortedMap<K,V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2ReferenceFunction<K,V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2ReferenceMap<K,V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2ReferenceMap.BasicEntry<K,V> |
This class provides a basic but complete type-specific entry class for all those maps implementations
that do not have entries on their own (e.g., most immutable maps).
|
| AbstractReference2ReferenceMap.BasicEntrySet<K,V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2ReferenceSortedMap<K,V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReferenceBigList<K> |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractReferenceBigList.ReferenceRandomAccessSubList<K> | |
| AbstractReferenceBigList.ReferenceSubList<K> |
A class implementing a sublist view.
|
| AbstractReferenceCollection<K> |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractReferenceList<K> |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractReferenceList.ReferenceRandomAccessSubList<K> | |
| AbstractReferenceList.ReferenceSubList<K> |
A class implementing a sublist view.
|
| AbstractReferenceSet<K> |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractReferenceSortedSet<K> |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| Byte2ByteArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2ByteAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2ByteFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2ByteFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Byte2ByteFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2ByteFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Byte2ByteFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Byte2ByteFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Byte2ByteLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2ByteMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2ByteMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2ByteMap.FastEntrySet |
An entry set providing fast iteration.
|
| Byte2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2ByteMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Byte2ByteMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Byte2ByteMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Byte2ByteMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Byte2ByteOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Byte2ByteOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2ByteRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2ByteSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2ByteSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Byte2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2ByteSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Byte2ByteSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2ByteSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Byte2ByteSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Byte2CharArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2CharAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2CharFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2CharFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Byte2CharFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2CharFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Byte2CharFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Byte2CharFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Byte2CharLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2CharMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2CharMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2CharMap.FastEntrySet |
An entry set providing fast iteration.
|
| Byte2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2CharMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Byte2CharMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Byte2CharMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Byte2CharMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Byte2CharOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Byte2CharOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2CharRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2CharSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2CharSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Byte2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2CharSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Byte2CharSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2CharSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Byte2CharSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Byte2DoubleArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2DoubleAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2DoubleFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Byte2DoubleFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2DoubleFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Byte2DoubleFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Byte2DoubleFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Byte2DoubleLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2DoubleMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2DoubleMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2DoubleMap.FastEntrySet |
An entry set providing fast iteration.
|
| Byte2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2DoubleMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Byte2DoubleMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Byte2DoubleMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Byte2DoubleMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Byte2DoubleOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Byte2DoubleOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2DoubleRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2DoubleSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2DoubleSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Byte2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2DoubleSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Byte2DoubleSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2DoubleSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Byte2DoubleSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Byte2FloatFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2IntArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2IntAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2IntFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Byte2IntFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2IntFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Byte2IntFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Byte2IntFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Byte2IntLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2IntMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2IntMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2IntMap.FastEntrySet |
An entry set providing fast iteration.
|
| Byte2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2IntMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Byte2IntMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Byte2IntMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Byte2IntMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Byte2IntOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Byte2IntOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2IntRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2IntSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2IntSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Byte2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2IntSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Byte2IntSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2IntSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Byte2IntSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Byte2LongArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2LongAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2LongFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Byte2LongFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2LongFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Byte2LongFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Byte2LongFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Byte2LongLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2LongMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2LongMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2LongMap.FastEntrySet |
An entry set providing fast iteration.
|
| Byte2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2LongMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Byte2LongMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Byte2LongMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Byte2LongMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Byte2LongOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Byte2LongOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2LongRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2LongSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2LongSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Byte2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2LongSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Byte2LongSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2LongSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Byte2LongSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Byte2ObjectArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2ObjectAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2ObjectFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Byte2ObjectFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2ObjectFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Byte2ObjectFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Byte2ObjectFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Byte2ObjectLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2ObjectMap<V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2ObjectMap.Entry<V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2ObjectMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Byte2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2ObjectMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Byte2ObjectMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Byte2ObjectMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Byte2ObjectMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Byte2ObjectOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Byte2ObjectOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2ObjectRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2ObjectSortedMap<V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2ObjectSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Byte2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2ObjectSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Byte2ObjectSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2ObjectSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Byte2ObjectSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| Byte2ReferenceArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2ReferenceAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2ReferenceFunction<V> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2ReferenceFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Byte2ReferenceFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2ReferenceFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Byte2ReferenceFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Byte2ReferenceFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Byte2ReferenceLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2ReferenceMap<V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2ReferenceMap.Entry<V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2ReferenceMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Byte2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2ReferenceMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Byte2ReferenceMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Byte2ReferenceMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Byte2ReferenceMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Byte2ReferenceOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Byte2ReferenceOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2ReferenceRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2ReferenceSortedMap<V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2ReferenceSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Byte2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2ReferenceSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Byte2ReferenceSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2ReferenceSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Byte2ReferenceSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| Byte2ShortFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteArrayFIFOQueue |
A type-specific array-based FIFO queue, supporting also deque operations.
|
| ByteArrayFrontCodedBigList |
Compact storage of big lists of arrays using front coding.
|
| ByteArrayFrontCodedList |
Compact storage of lists of arrays using front coding.
|
| ByteArrayIndirectPriorityQueue |
A type-specific array-based semi-indirect priority queue.
|
| ByteArrayList |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ByteArrayPriorityQueue |
A type-specific array-based priority queue.
|
| ByteArraySet |
A simple, brute-force implementation of a set based on a backing array.
|
| ByteAVLTreeSet |
A type-specific AVL tree set with a fast, small-footprint implementation.
|
| ByteBidirectionalIterable |
A type-specific
Iterable that further strengthens the specification of Iterable.iterator(). |
| ByteBidirectionalIterator |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ByteBigArrayBigList |
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ByteBigList |
A type-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteBigListIterator |
A type-specific
BigListIterator. |
| ByteBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| ByteBigListIterators.AbstractIndexBasedBigIterator |
A skeletal implementation for an iterator backed by an index based data store.
|
| ByteBigListIterators.AbstractIndexBasedBigListIterator |
A skeletal implementation for a list-iterator backed by an index based data store.
|
| ByteBigListIterators.BigListIteratorListIterator |
A class exposing a list iterator as a big-list iterator..
|
| ByteBigListIterators.EmptyBigListIterator |
A class returning no elements and a type-specific big list iterator interface.
|
| ByteBigListIterators.UnmodifiableBigListIterator |
An unmodifiable wrapper class for big list iterators.
|
| ByteBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| ByteBigLists.EmptyBigList |
An immutable class representing an empty type-specific big list.
|
| ByteBigLists.ListBigList |
A class exposing a list as a big list.
|
| ByteBigLists.Singleton |
An immutable class representing a type-specific singleton big list.
|
| ByteBigLists.SynchronizedBigList |
A synchronized wrapper class for big lists.
|
| ByteBigLists.UnmodifiableBigList |
An unmodifiable wrapper class for big lists.
|
| ByteBigSpliterators |
A class providing static methods and objects that do useful things with type-specific spliterators on
big (potentially greater then
Integer.MAX_VALUE items long). |
| ByteBigSpliterators.AbstractIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| ByteBigSpliterators.EarlyBindingSizeIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| ByteBigSpliterators.LateBindingSizeIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| ByteBinaryOperator |
A type-specific
BinaryOperator; provides methods operating both on objects
and on primitives. |
| ByteByteImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteByteImmutableSortedPair |
A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteByteMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteBytePair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteByteSortedPair |
A type-specific immutable
SortedPair. |
| ByteCharImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteCharMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteCharPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteCollection |
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ByteCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| ByteCollections.EmptyCollection |
An immutable class representing an empty type-specific collection.
|
| ByteCollections.IterableCollection |
A collection wrapper class for iterables.
|
| ByteComparator |
A type-specific
Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| ByteComparators |
A class providing static methods and objects that do useful things with comparators.
|
| ByteConsumer |
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| ByteDoubleImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteDoubleMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteDoublePair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteHash |
A type-specific
Hash interface. |
| ByteHash.Strategy |
A type-specific hash strategy.
|
| ByteHeapIndirectPriorityQueue |
A type-specific heap-based indirect priority queue.
|
| ByteHeapPriorityQueue |
A type-specific heap-based priority queue.
|
| ByteHeaps |
A class providing static methods and objects that do useful things with heaps.
|
| ByteHeapSemiIndirectPriorityQueue |
A type-specific heap-based semi-indirect priority queue.
|
| ByteImmutableList |
A type-specific array-based immutable list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ByteIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| ByteIndirectPriorityQueue |
A type-specific
IndirectPriorityQueue. |
| ByteIntImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteIntMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteIntPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteIterables |
A class providing static methods and objects that do useful things with type-specific iterables.
|
| ByteIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| ByteIterators.AbstractIndexBasedIterator |
A skeletal implementation for an iterator backed by an index-based data store.
|
| ByteIterators.AbstractIndexBasedListIterator |
A skeletal implementation for a list-iterator backed by an index-based data store.
|
| ByteIterators.EmptyIterator |
A class returning no elements and a type-specific iterator interface.
|
| ByteIterators.UnmodifiableBidirectionalIterator |
An unmodifiable wrapper class for bidirectional iterators.
|
| ByteIterators.UnmodifiableIterator |
An unmodifiable wrapper class for iterators.
|
| ByteIterators.UnmodifiableListIterator |
An unmodifiable wrapper class for list iterators.
|
| ByteLinkedOpenCustomHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ByteLinkedOpenHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ByteList |
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteListIterator |
A type-specific bidirectional iterator that is also a
ListIterator. |
| ByteLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| ByteLists.EmptyList |
An immutable class representing an empty type-specific list.
|
| ByteLists.Singleton |
An immutable class representing a type-specific singleton list.
|
| ByteLists.SynchronizedList |
A synchronized wrapper class for lists.
|
| ByteLists.SynchronizedRandomAccessList |
A synchronized wrapper class for random-access lists.
|
| ByteLists.UnmodifiableList |
An unmodifiable wrapper class for lists.
|
| ByteLists.UnmodifiableRandomAccessList |
An unmodifiable wrapper class for random-access lists.
|
| ByteLongImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteLongMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteLongPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteObjectImmutablePair<V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteObjectMutablePair<V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteObjectPair<V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteOpenCustomHashSet |
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| ByteOpenHashSet |
A type-specific hash set with with a fast, small-footprint implementation.
|
| BytePredicate |
A type-specific
Predicate; provides methods to test a primitive type both as object
and as primitive. |
| BytePriorityQueue |
A type-specific
PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing. |
| BytePriorityQueues |
A class providing static methods and objects that do useful things with type-specific priority queues.
|
| BytePriorityQueues.SynchronizedPriorityQueue |
A synchronized wrapper class for priority queues.
|
| ByteRBTreeSet |
A type-specific red-black tree set with a fast, small-footprint implementation.
|
| ByteReferenceImmutablePair<V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteReferenceMutablePair<V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteReferencePair<V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteSemiIndirectHeaps |
A class providing static methods and objects that do useful things with semi-indirect heaps.
|
| ByteSet |
A type-specific
Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| ByteSets.EmptySet |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| ByteSets.Singleton |
An immutable class representing a type-specific singleton set.
|
| ByteSets.SynchronizedSet |
A synchronized wrapper class for sets.
|
| ByteSets.UnmodifiableSet |
An unmodifiable wrapper class for sets.
|
| ByteSortedSet |
A type-specific
SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| ByteSortedSets.EmptySet |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| ByteSortedSets.Singleton |
A class representing a singleton sorted set.
|
| ByteSortedSets.SynchronizedSortedSet |
A synchronized wrapper class for sorted sets.
|
| ByteSortedSets.UnmodifiableSortedSet |
An unmodifiable wrapper class for sorted sets.
|
| ByteSpliterators |
A class providing static methods and objects that do useful things with type-specific spliterators.
|
| ByteSpliterators.AbstractIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| ByteSpliterators.EarlyBindingSizeIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| ByteSpliterators.EmptySpliterator |
A class returning no elements and a type-specific spliterator interface.
|
| ByteSpliterators.LateBindingSizeIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| ByteStack |
A type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteUnaryOperator |
A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives. |
| Char2ByteArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2ByteAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2ByteFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2ByteFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Char2ByteFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2ByteFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Char2ByteFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Char2ByteFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Char2ByteLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2ByteMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2ByteMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2ByteMap.FastEntrySet |
An entry set providing fast iteration.
|
| Char2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2ByteMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Char2ByteMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Char2ByteMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Char2ByteMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Char2ByteOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Char2ByteOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2ByteRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2ByteSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2ByteSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Char2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2ByteSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Char2ByteSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Char2ByteSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Char2ByteSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Char2CharArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2CharAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2CharFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2CharFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Char2CharFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2CharFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Char2CharFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Char2CharFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Char2CharLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2CharMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2CharMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2CharMap.FastEntrySet |
An entry set providing fast iteration.
|
| Char2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2CharMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Char2CharMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Char2CharMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Char2CharMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Char2CharOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Char2CharOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2CharRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2CharSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2CharSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Char2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2CharSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Char2CharSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Char2CharSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Char2CharSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Char2DoubleArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2DoubleAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2DoubleFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Char2DoubleFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2DoubleFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Char2DoubleFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Char2DoubleFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Char2DoubleLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2DoubleMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2DoubleMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2DoubleMap.FastEntrySet |
An entry set providing fast iteration.
|
| Char2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2DoubleMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Char2DoubleMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Char2DoubleMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Char2DoubleMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Char2DoubleOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Char2DoubleOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2DoubleRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2DoubleSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2DoubleSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Char2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2DoubleSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Char2DoubleSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Char2DoubleSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Char2DoubleSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Char2FloatFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2IntArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2IntAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2IntFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Char2IntFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2IntFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Char2IntFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Char2IntFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Char2IntLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2IntMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2IntMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2IntMap.FastEntrySet |
An entry set providing fast iteration.
|
| Char2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2IntMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Char2IntMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Char2IntMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Char2IntMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Char2IntOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Char2IntOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2IntRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2IntSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2IntSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Char2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2IntSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Char2IntSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Char2IntSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Char2IntSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Char2LongArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2LongAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2LongFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Char2LongFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2LongFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Char2LongFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Char2LongFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Char2LongLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2LongMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2LongMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2LongMap.FastEntrySet |
An entry set providing fast iteration.
|
| Char2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2LongMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Char2LongMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Char2LongMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Char2LongMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Char2LongOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Char2LongOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2LongRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2LongSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2LongSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Char2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2LongSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Char2LongSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Char2LongSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Char2LongSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Char2ObjectArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2ObjectAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2ObjectFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Char2ObjectFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2ObjectFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Char2ObjectFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Char2ObjectFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Char2ObjectLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2ObjectMap<V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2ObjectMap.Entry<V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2ObjectMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Char2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2ObjectMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Char2ObjectMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Char2ObjectMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Char2ObjectMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Char2ObjectOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Char2ObjectOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2ObjectRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2ObjectSortedMap<V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2ObjectSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Char2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2ObjectSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Char2ObjectSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Char2ObjectSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Char2ObjectSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| Char2ReferenceArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2ReferenceAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2ReferenceFunction<V> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2ReferenceFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Char2ReferenceFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2ReferenceFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Char2ReferenceFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Char2ReferenceFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Char2ReferenceLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2ReferenceMap<V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2ReferenceMap.Entry<V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2ReferenceMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Char2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2ReferenceMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Char2ReferenceMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Char2ReferenceMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Char2ReferenceMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Char2ReferenceOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Char2ReferenceOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2ReferenceRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2ReferenceSortedMap<V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2ReferenceSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Char2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2ReferenceSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Char2ReferenceSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Char2ReferenceSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Char2ReferenceSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| Char2ShortFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharArrayFIFOQueue |
A type-specific array-based FIFO queue, supporting also deque operations.
|
| CharArrayFrontCodedBigList |
Compact storage of big lists of arrays using front coding.
|
| CharArrayFrontCodedList |
Compact storage of lists of arrays using front coding.
|
| CharArrayIndirectPriorityQueue |
A type-specific array-based semi-indirect priority queue.
|
| CharArrayList |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| CharArrayPriorityQueue |
A type-specific array-based priority queue.
|
| CharArraySet |
A simple, brute-force implementation of a set based on a backing array.
|
| CharAVLTreeSet |
A type-specific AVL tree set with a fast, small-footprint implementation.
|
| CharBidirectionalIterable |
A type-specific
Iterable that further strengthens the specification of Iterable.iterator(). |
| CharBidirectionalIterator |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| CharBigArrayBigList |
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| CharBigList |
A type-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharBigListIterator |
A type-specific
BigListIterator. |
| CharBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| CharBigListIterators.AbstractIndexBasedBigIterator |
A skeletal implementation for an iterator backed by an index based data store.
|
| CharBigListIterators.AbstractIndexBasedBigListIterator |
A skeletal implementation for a list-iterator backed by an index based data store.
|
| CharBigListIterators.BigListIteratorListIterator |
A class exposing a list iterator as a big-list iterator..
|
| CharBigListIterators.EmptyBigListIterator |
A class returning no elements and a type-specific big list iterator interface.
|
| CharBigListIterators.UnmodifiableBigListIterator |
An unmodifiable wrapper class for big list iterators.
|
| CharBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| CharBigLists.EmptyBigList |
An immutable class representing an empty type-specific big list.
|
| CharBigLists.ListBigList |
A class exposing a list as a big list.
|
| CharBigLists.Singleton |
An immutable class representing a type-specific singleton big list.
|
| CharBigLists.SynchronizedBigList |
A synchronized wrapper class for big lists.
|
| CharBigLists.UnmodifiableBigList |
An unmodifiable wrapper class for big lists.
|
| CharBigSpliterators |
A class providing static methods and objects that do useful things with type-specific spliterators on
big (potentially greater then
Integer.MAX_VALUE items long). |
| CharBigSpliterators.AbstractIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| CharBigSpliterators.EarlyBindingSizeIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| CharBigSpliterators.LateBindingSizeIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| CharBinaryOperator |
A type-specific
BinaryOperator; provides methods operating both on objects
and on primitives. |
| CharByteImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharByteMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharBytePair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharCharImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharCharImmutableSortedPair |
A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharCharMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharCharPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharCharSortedPair |
A type-specific immutable
SortedPair. |
| CharCollection |
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| CharCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| CharCollections.EmptyCollection |
An immutable class representing an empty type-specific collection.
|
| CharCollections.IterableCollection |
A collection wrapper class for iterables.
|
| CharComparator |
A type-specific
Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| CharComparators |
A class providing static methods and objects that do useful things with comparators.
|
| CharConsumer |
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| CharDoubleImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharDoubleMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharDoublePair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharHash |
A type-specific
Hash interface. |
| CharHash.Strategy |
A type-specific hash strategy.
|
| CharHeapIndirectPriorityQueue |
A type-specific heap-based indirect priority queue.
|
| CharHeapPriorityQueue |
A type-specific heap-based priority queue.
|
| CharHeaps |
A class providing static methods and objects that do useful things with heaps.
|
| CharHeapSemiIndirectPriorityQueue |
A type-specific heap-based semi-indirect priority queue.
|
| CharImmutableList |
A type-specific array-based immutable list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| CharIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| CharIndirectPriorityQueue |
A type-specific
IndirectPriorityQueue. |
| CharIntImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharIntMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharIntPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharIterables |
A class providing static methods and objects that do useful things with type-specific iterables.
|
| CharIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| CharIterators.AbstractIndexBasedIterator |
A skeletal implementation for an iterator backed by an index-based data store.
|
| CharIterators.AbstractIndexBasedListIterator |
A skeletal implementation for a list-iterator backed by an index-based data store.
|
| CharIterators.EmptyIterator |
A class returning no elements and a type-specific iterator interface.
|
| CharIterators.UnmodifiableBidirectionalIterator |
An unmodifiable wrapper class for bidirectional iterators.
|
| CharIterators.UnmodifiableIterator |
An unmodifiable wrapper class for iterators.
|
| CharIterators.UnmodifiableListIterator |
An unmodifiable wrapper class for list iterators.
|
| CharLinkedOpenCustomHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| CharLinkedOpenHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| CharList |
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharListIterator |
A type-specific bidirectional iterator that is also a
ListIterator. |
| CharLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| CharLists.EmptyList |
An immutable class representing an empty type-specific list.
|
| CharLists.Singleton |
An immutable class representing a type-specific singleton list.
|
| CharLists.SynchronizedList |
A synchronized wrapper class for lists.
|
| CharLists.SynchronizedRandomAccessList |
A synchronized wrapper class for random-access lists.
|
| CharLists.UnmodifiableList |
An unmodifiable wrapper class for lists.
|
| CharLists.UnmodifiableRandomAccessList |
An unmodifiable wrapper class for random-access lists.
|
| CharLongImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharLongMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharLongPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharObjectImmutablePair<V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharObjectMutablePair<V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharObjectPair<V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharOpenCustomHashSet |
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| CharOpenHashSet |
A type-specific hash set with with a fast, small-footprint implementation.
|
| CharPredicate |
A type-specific
Predicate; provides methods to test a primitive type both as object
and as primitive. |
| CharPriorityQueue |
A type-specific
PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharPriorityQueues |
A class providing static methods and objects that do useful things with type-specific priority queues.
|
| CharPriorityQueues.SynchronizedPriorityQueue |
A synchronized wrapper class for priority queues.
|
| CharRBTreeSet |
A type-specific red-black tree set with a fast, small-footprint implementation.
|
| CharReferenceImmutablePair<V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharReferenceMutablePair<V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharReferencePair<V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharSemiIndirectHeaps |
A class providing static methods and objects that do useful things with semi-indirect heaps.
|
| CharSet |
A type-specific
Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| CharSets.EmptySet |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| CharSets.Singleton |
An immutable class representing a type-specific singleton set.
|
| CharSets.SynchronizedSet |
A synchronized wrapper class for sets.
|
| CharSets.UnmodifiableSet |
An unmodifiable wrapper class for sets.
|
| CharSortedSet |
A type-specific
SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| CharSortedSets.EmptySet |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| CharSortedSets.Singleton |
A class representing a singleton sorted set.
|
| CharSortedSets.SynchronizedSortedSet |
A synchronized wrapper class for sorted sets.
|
| CharSortedSets.UnmodifiableSortedSet |
An unmodifiable wrapper class for sorted sets.
|
| CharSpliterators |
A class providing static methods and objects that do useful things with type-specific spliterators.
|
| CharSpliterators.AbstractIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| CharSpliterators.EarlyBindingSizeIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| CharSpliterators.EmptySpliterator |
A class returning no elements and a type-specific spliterator interface.
|
| CharSpliterators.LateBindingSizeIndexBasedSpliterator |
A skeletal implementation for a spliterator backed by an index based data store.
|
| CharStack |
A type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharUnaryOperator |
A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives. |
| Double2ByteArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2ByteAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2ByteFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Double2ByteFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2ByteFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Double2ByteFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Double2ByteFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Double2ByteLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2ByteMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2ByteMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2ByteMap.FastEntrySet |
An entry set providing fast iteration.
|
| Double2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2ByteMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Double2ByteMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Double2ByteMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Double2ByteMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Double2ByteOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Double2ByteOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2ByteRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2ByteSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ByteSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Double2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2ByteSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Double2ByteSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Double2ByteSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Double2ByteSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Double2CharArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2CharAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2CharFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Double2CharFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2CharFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Double2CharFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Double2CharFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Double2CharLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2CharMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2CharMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2CharMap.FastEntrySet |
An entry set providing fast iteration.
|
| Double2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2CharMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Double2CharMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Double2CharMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Double2CharMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Double2CharOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Double2CharOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2CharRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2CharSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2CharSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Double2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2CharSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Double2CharSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Double2CharSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Double2CharSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Double2ReferenceArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2ReferenceAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2ReferenceFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Double2ReferenceFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2ReferenceFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Double2ReferenceFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Double2ReferenceFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Double2ReferenceLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2ReferenceMap<V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2ReferenceMap.Entry<V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2ReferenceMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Double2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2ReferenceMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Double2ReferenceMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Double2ReferenceMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Double2ReferenceMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Double2ReferenceOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Double2ReferenceOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2ReferenceRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2ReferenceSortedMap<V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ReferenceSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Double2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2ReferenceSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Double2ReferenceSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Double2ReferenceSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Double2ReferenceSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| DoubleByteImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleByteMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleBytePair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleCharImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleCharMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleCharPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleReferenceImmutablePair<V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleReferenceMutablePair<V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleReferencePair<V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ByteFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2CharFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ReferenceFunction<V> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ByteArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2ByteAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2ByteFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Int2ByteFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2ByteFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Int2ByteFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Int2ByteFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Int2ByteLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2ByteMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2ByteMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2ByteMap.FastEntrySet |
An entry set providing fast iteration.
|
| Int2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2ByteMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Int2ByteMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Int2ByteMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Int2ByteMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Int2ByteOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Int2ByteOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2ByteRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2ByteSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ByteSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Int2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2ByteSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Int2ByteSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Int2ByteSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Int2ByteSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Int2CharArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2CharAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2CharFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Int2CharFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2CharFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Int2CharFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Int2CharFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Int2CharLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2CharMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2CharMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2CharMap.FastEntrySet |
An entry set providing fast iteration.
|
| Int2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2CharMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Int2CharMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Int2CharMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Int2CharMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Int2CharOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Int2CharOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2CharRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2CharSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2CharSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Int2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2CharSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Int2CharSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Int2CharSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Int2CharSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Int2ReferenceArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2ReferenceAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2ReferenceFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Int2ReferenceFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2ReferenceFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Int2ReferenceFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Int2ReferenceFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Int2ReferenceLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2ReferenceMap<V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2ReferenceMap.Entry<V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2ReferenceMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Int2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2ReferenceMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Int2ReferenceMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Int2ReferenceMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Int2ReferenceMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Int2ReferenceOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Int2ReferenceOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2ReferenceRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2ReferenceSortedMap<V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ReferenceSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Int2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2ReferenceSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Int2ReferenceSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Int2ReferenceSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Int2ReferenceSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| IntByteImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntByteMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntBytePair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntCharImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntCharMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntCharPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntReferenceImmutablePair<V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntReferenceMutablePair<V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntReferencePair<V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2ByteArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2ByteAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2ByteFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Long2ByteFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2ByteFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Long2ByteFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Long2ByteFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Long2ByteLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2ByteMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2ByteMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2ByteMap.FastEntrySet |
An entry set providing fast iteration.
|
| Long2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2ByteMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Long2ByteMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Long2ByteMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Long2ByteMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Long2ByteOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Long2ByteOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2ByteRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2ByteSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2ByteSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Long2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2ByteSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Long2ByteSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Long2ByteSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Long2ByteSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Long2CharArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2CharAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2CharFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Long2CharFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2CharFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Long2CharFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Long2CharFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Long2CharLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2CharMap |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2CharMap.Entry |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2CharMap.FastEntrySet |
An entry set providing fast iteration.
|
| Long2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2CharMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Long2CharMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Long2CharMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Long2CharMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Long2CharOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Long2CharOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2CharRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2CharSortedMap |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2CharSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Long2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2CharSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Long2CharSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Long2CharSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Long2CharSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Long2ReferenceArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2ReferenceAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2ReferenceFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Long2ReferenceFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2ReferenceFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Long2ReferenceFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Long2ReferenceFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Long2ReferenceLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2ReferenceMap<V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2ReferenceMap.Entry<V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2ReferenceMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Long2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2ReferenceMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Long2ReferenceMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Long2ReferenceMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Long2ReferenceMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Long2ReferenceOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Long2ReferenceOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2ReferenceRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2ReferenceSortedMap<V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2ReferenceSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Long2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2ReferenceSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Long2ReferenceSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Long2ReferenceSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Long2ReferenceSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| LongByteImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongByteMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongBytePair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongCharImmutablePair |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongCharMutablePair |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongCharPair |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongReferenceImmutablePair<V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongReferenceMutablePair<V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongReferencePair<V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ByteArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2ByteAVLTreeMap<K> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2ByteFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Object2ByteFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Object2ByteFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Object2ByteFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Object2ByteFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Object2ByteLinkedOpenCustomHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ByteLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ByteMap<K> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2ByteMap.Entry<K> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2ByteMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Object2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2ByteMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Object2ByteMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Object2ByteMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Object2ByteMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Object2ByteOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2ByteOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2ByteRBTreeMap<K> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2ByteSortedMap<K> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ByteSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Object2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2ByteSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Object2ByteSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2ByteSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Object2ByteSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Object2CharArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2CharAVLTreeMap<K> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2CharFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Object2CharFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Object2CharFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Object2CharFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Object2CharFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Object2CharLinkedOpenCustomHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2CharLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2CharMap<K> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2CharMap.Entry<K> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2CharMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Object2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2CharMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Object2CharMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Object2CharMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Object2CharMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Object2CharOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2CharOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2CharRBTreeMap<K> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2CharSortedMap<K> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2CharSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Object2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2CharSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Object2CharSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2CharSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Object2CharSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Object2ReferenceArrayMap<K,V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2ReferenceAVLTreeMap<K,V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2ReferenceFunctions.EmptyFunction<K,V> |
An immutable class representing an empty type-specific function.
|
| Object2ReferenceFunctions.Singleton<K,V> |
An immutable class representing a type-specific singleton function.
|
| Object2ReferenceFunctions.SynchronizedFunction<K,V> |
A synchronized wrapper class for functions.
|
| Object2ReferenceFunctions.UnmodifiableFunction<K,V> |
An unmodifiable wrapper class for functions.
|
| Object2ReferenceLinkedOpenCustomHashMap<K,V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ReferenceLinkedOpenHashMap<K,V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ReferenceMap<K,V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2ReferenceMap.Entry<K,V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2ReferenceMap.FastEntrySet<K,V> |
An entry set providing fast iteration.
|
| Object2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2ReferenceMaps.EmptyMap<K,V> |
An immutable class representing an empty type-specific map.
|
| Object2ReferenceMaps.Singleton<K,V> |
An immutable class representing a type-specific singleton map.
|
| Object2ReferenceMaps.SynchronizedMap<K,V> |
A synchronized wrapper class for maps.
|
| Object2ReferenceMaps.UnmodifiableMap<K,V> |
An unmodifiable wrapper class for maps.
|
| Object2ReferenceOpenCustomHashMap<K,V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2ReferenceOpenHashMap<K,V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2ReferenceRBTreeMap<K,V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2ReferenceSortedMap<K,V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ReferenceSortedMap.FastSortedEntrySet<K,V> |
A sorted entry set providing fast iteration.
|
| Object2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2ReferenceSortedMaps.EmptySortedMap<K,V> |
An immutable class representing an empty type-specific sorted map.
|
| Object2ReferenceSortedMaps.Singleton<K,V> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2ReferenceSortedMaps.SynchronizedSortedMap<K,V> |
A synchronized wrapper class for sorted maps.
|
| Object2ReferenceSortedMaps.UnmodifiableSortedMap<K,V> |
An unmodifiable wrapper class for sorted maps.
|
| ObjectByteImmutablePair<K> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectByteMutablePair<K> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectBytePair<K> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectCharImmutablePair<K> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectCharMutablePair<K> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectCharPair<K> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectReferenceImmutablePair<K,V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectReferenceMutablePair<K,V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectReferencePair<K,V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ByteArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2ByteFunction<K> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2ByteFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Reference2ByteFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Reference2ByteFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Reference2ByteFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Reference2ByteFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Reference2ByteLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2ByteMap<K> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2ByteMap.Entry<K> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2ByteMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Reference2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2ByteMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Reference2ByteMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Reference2ByteMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Reference2ByteMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Reference2ByteOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2ByteOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2ByteSortedMap<K> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ByteSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Reference2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2ByteSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2ByteSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2ByteSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Reference2ByteSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Reference2CharArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2CharFunction<K> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2CharFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Reference2CharFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Reference2CharFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Reference2CharFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Reference2CharFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Reference2CharLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2CharMap<K> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2CharMap.Entry<K> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2CharMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Reference2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2CharMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Reference2CharMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Reference2CharMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Reference2CharMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Reference2CharOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2CharOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2CharSortedMap<K> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2CharSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Reference2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2CharSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2CharSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2CharSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Reference2CharSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Reference2DoubleArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2DoubleFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Reference2DoubleFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Reference2DoubleFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Reference2DoubleFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Reference2DoubleFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Reference2DoubleLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2DoubleMap<K> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2DoubleMap.Entry<K> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2DoubleMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Reference2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2DoubleMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Reference2DoubleMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Reference2DoubleMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Reference2DoubleMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Reference2DoubleOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2DoubleOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2DoubleSortedMap<K> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2DoubleSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Reference2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2DoubleSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2DoubleSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2DoubleSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Reference2DoubleSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Reference2FloatFunction<K> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2IntArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2IntFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Reference2IntFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Reference2IntFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Reference2IntFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Reference2IntFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Reference2IntLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2IntMap<K> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2IntMap.Entry<K> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2IntMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Reference2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2IntMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Reference2IntMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Reference2IntMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Reference2IntMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Reference2IntOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2IntOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2IntSortedMap<K> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2IntSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Reference2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2IntSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2IntSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2IntSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Reference2IntSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Reference2LongArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2LongFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Reference2LongFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Reference2LongFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Reference2LongFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Reference2LongFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Reference2LongLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2LongMap<K> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2LongMap.Entry<K> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2LongMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Reference2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2LongMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Reference2LongMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Reference2LongMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Reference2LongMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Reference2LongOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2LongOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2LongSortedMap<K> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2LongSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Reference2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2LongSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2LongSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2LongSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Reference2LongSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Reference2ObjectArrayMap<K,V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2ObjectFunctions.EmptyFunction<K,V> |
An immutable class representing an empty type-specific function.
|
| Reference2ObjectFunctions.Singleton<K,V> |
An immutable class representing a type-specific singleton function.
|
| Reference2ObjectFunctions.SynchronizedFunction<K,V> |
A synchronized wrapper class for functions.
|
| Reference2ObjectFunctions.UnmodifiableFunction<K,V> |
An unmodifiable wrapper class for functions.
|
| Reference2ObjectLinkedOpenHashMap<K,V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2ObjectMap<K,V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2ObjectMap.Entry<K,V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2ObjectMap.FastEntrySet<K,V> |
An entry set providing fast iteration.
|
| Reference2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2ObjectMaps.EmptyMap<K,V> |
An immutable class representing an empty type-specific map.
|
| Reference2ObjectMaps.Singleton<K,V> |
An immutable class representing a type-specific singleton map.
|
| Reference2ObjectMaps.SynchronizedMap<K,V> |
A synchronized wrapper class for maps.
|
| Reference2ObjectMaps.UnmodifiableMap<K,V> |
An unmodifiable wrapper class for maps.
|
| Reference2ObjectOpenCustomHashMap<K,V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2ObjectOpenHashMap<K,V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2ObjectSortedMap<K,V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ObjectSortedMap.FastSortedEntrySet<K,V> |
A sorted entry set providing fast iteration.
|
| Reference2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2ObjectSortedMaps.EmptySortedMap<K,V> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2ObjectSortedMaps.Singleton<K,V> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2ObjectSortedMaps.SynchronizedSortedMap<K,V> |
A synchronized wrapper class for sorted maps.
|
| Reference2ObjectSortedMaps.UnmodifiableSortedMap<K,V> |
An unmodifiable wrapper class for sorted maps.
|
| Reference2ReferenceArrayMap<K,V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2ReferenceFunction<K,V> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2ReferenceFunctions.EmptyFunction<K,V> |
An immutable class representing an empty type-specific function.
|
| Reference2ReferenceFunctions.Singleton<K,V> |
An immutable class representing a type-specific singleton function.
|
| Reference2ReferenceFunctions.SynchronizedFunction<K,V> |
A synchronized wrapper class for functions.
|
| Reference2ReferenceFunctions.UnmodifiableFunction<K,V> |
An unmodifiable wrapper class for functions.
|
| Reference2ReferenceLinkedOpenHashMap<K,V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2ReferenceMap<K,V> |
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2ReferenceMap.Entry<K,V> |
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2ReferenceMap.FastEntrySet<K,V> |
An entry set providing fast iteration.
|
| Reference2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2ReferenceMaps.EmptyMap<K,V> |
An immutable class representing an empty type-specific map.
|
| Reference2ReferenceMaps.Singleton<K,V> |
An immutable class representing a type-specific singleton map.
|
| Reference2ReferenceMaps.SynchronizedMap<K,V> |
A synchronized wrapper class for maps.
|
| Reference2ReferenceMaps.UnmodifiableMap<K,V> |
An unmodifiable wrapper class for maps.
|
| Reference2ReferenceOpenCustomHashMap<K,V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2ReferenceOpenHashMap<K,V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2ReferenceSortedMap<K,V> |
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ReferenceSortedMap.FastSortedEntrySet<K,V> |
A sorted entry set providing fast iteration.
|
| Reference2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2ReferenceSortedMaps.EmptySortedMap<K,V> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2ReferenceSortedMaps.Singleton<K,V> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2ReferenceSortedMaps.SynchronizedSortedMap<K,V> |
A synchronized wrapper class for sorted maps.
|
| Reference2ReferenceSortedMaps.UnmodifiableSortedMap<K,V> |
An unmodifiable wrapper class for sorted maps.
|
| Reference2ShortFunction<K> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceArrayList<K> |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ReferenceArraySet<K> |
A simple, brute-force implementation of a set based on a backing array.
|
| ReferenceBigArrayBigList<K> |
A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ReferenceBigList<K> |
A type-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| ReferenceBigLists.EmptyBigList<K> |
An immutable class representing an empty type-specific big list.
|
| ReferenceBigLists.ListBigList<K> |
A class exposing a list as a big list.
|
| ReferenceBigLists.Singleton<K> |
An immutable class representing a type-specific singleton big list.
|
| ReferenceBigLists.SynchronizedBigList<K> |
A synchronized wrapper class for big lists.
|
| ReferenceBigLists.UnmodifiableBigList<K> |
An unmodifiable wrapper class for big lists.
|
| ReferenceByteImmutablePair<K> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceByteMutablePair<K> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceBytePair<K> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCharImmutablePair<K> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCharMutablePair<K> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCharPair<K> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCollection<K> |
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ReferenceCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| ReferenceCollections.EmptyCollection<K> |
An immutable class representing an empty type-specific collection.
|
| ReferenceCollections.IterableCollection<K> |
A collection wrapper class for iterables.
|
| ReferenceDoubleImmutablePair<K> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceDoubleMutablePair<K> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceDoublePair<K> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceImmutableList<K> |
A type-specific array-based immutable list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ReferenceIntImmutablePair<K> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceIntMutablePair<K> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceIntPair<K> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceLinkedOpenHashSet<K> |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ReferenceList<K> |
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| ReferenceLists.EmptyList<K> |
An immutable class representing an empty type-specific list.
|
| ReferenceLists.Singleton<K> |
An immutable class representing a type-specific singleton list.
|
| ReferenceLists.SynchronizedList<K> |
A synchronized wrapper class for lists.
|
| ReferenceLists.SynchronizedRandomAccessList<K> |
A synchronized wrapper class for random-access lists.
|
| ReferenceLists.UnmodifiableList<K> |
An unmodifiable wrapper class for lists.
|
| ReferenceLists.UnmodifiableRandomAccessList<K> |
An unmodifiable wrapper class for random-access lists.
|
| ReferenceLongImmutablePair<K> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceLongMutablePair<K> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceLongPair<K> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceObjectImmutablePair<K,V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceObjectMutablePair<K,V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceObjectPair<K,V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceOpenHashBigSet<K> |
A type-specific hash big set with with a fast, small-footprint implementation.
|
| ReferenceOpenHashSet<K> |
A type-specific hash set with with a fast, small-footprint implementation.
|
| ReferenceReferenceImmutablePair<K,V> |
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceReferenceMutablePair<K,V> |
A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceReferencePair<K,V> |
A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceSet<K> |
A type-specific
Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| ReferenceSets.EmptySet<K> |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| ReferenceSets.Singleton<K> |
An immutable class representing a type-specific singleton set.
|
| ReferenceSets.SynchronizedSet<K> |
A synchronized wrapper class for sets.
|
| ReferenceSets.UnmodifiableSet<K> |
An unmodifiable wrapper class for sets.
|
| ReferenceSortedSet<K> |
A type-specific
SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| ReferenceSortedSets.EmptySet<K> |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| ReferenceSortedSets.Singleton<K> |
A class representing a singleton sorted set.
|
| ReferenceSortedSets.SynchronizedSortedSet<K> |
A synchronized wrapper class for sorted sets.
|
| ReferenceSortedSets.UnmodifiableSortedSet<K> |
An unmodifiable wrapper class for sorted sets.
|
| Short2ByteFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2CharFunction |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ReferenceFunction<V> |
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |