All Classes Interface Summary Class Summary Enum Summary
| Class |
Description |
| AbstractBooleanBidirectionalIterator |
Deprecated.
|
| AbstractBooleanBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractBooleanBigList.BooleanSubList |
A class implementing a sublist view.
|
| AbstractBooleanBigListIterator |
Deprecated.
|
| AbstractBooleanCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractBooleanIterator |
Deprecated.
|
| AbstractBooleanList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractBooleanList.BooleanSubList |
A class implementing a sublist view.
|
| AbstractBooleanListIterator |
Deprecated.
|
| AbstractBooleanSet |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractBooleanStack |
Deprecated.
|
| AbstractByte2BooleanFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2BooleanMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2BooleanMap.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).
|
| AbstractByte2BooleanMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2BooleanSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| 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.
|
| AbstractByte2FloatFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2FloatMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2FloatMap.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).
|
| AbstractByte2FloatMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2FloatSortedMap |
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.
|
| AbstractByte2ShortFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractByte2ShortMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractByte2ShortMap.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).
|
| AbstractByte2ShortMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractByte2ShortSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractByteBidirectionalIterator |
Deprecated.
|
| AbstractByteBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractByteBigList.ByteSubList |
A class implementing a sublist view.
|
| AbstractByteBigListIterator |
Deprecated.
|
| AbstractByteCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractByteComparator |
Deprecated.
|
| AbstractByteIterator |
Deprecated.
|
| AbstractByteList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractByteList.ByteSubList |
A class implementing a sublist view.
|
| AbstractByteListIterator |
Deprecated.
|
| AbstractBytePriorityQueue |
Deprecated.
|
| 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.
|
| AbstractByteStack |
Deprecated.
|
| AbstractChar2BooleanFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2BooleanMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2BooleanMap.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).
|
| AbstractChar2BooleanMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2BooleanSortedMap |
An abstract class providing basic methods for sorted maps implementing a 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.
|
| AbstractChar2FloatFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2FloatMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2FloatMap.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).
|
| AbstractChar2FloatMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2FloatSortedMap |
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.
|
| AbstractChar2ShortFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractChar2ShortMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractChar2ShortMap.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).
|
| AbstractChar2ShortMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractChar2ShortSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractCharBidirectionalIterator |
Deprecated.
|
| AbstractCharBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractCharBigList.CharSubList |
A class implementing a sublist view.
|
| AbstractCharBigListIterator |
Deprecated.
|
| AbstractCharCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractCharComparator |
Deprecated.
|
| AbstractCharIterator |
Deprecated.
|
| AbstractCharList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractCharList.CharSubList |
A class implementing a sublist view.
|
| AbstractCharListIterator |
Deprecated.
|
| AbstractCharPriorityQueue |
Deprecated.
|
| 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.
|
| AbstractCharStack |
Deprecated.
|
| AbstractDouble2BooleanFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2BooleanMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2BooleanMap.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).
|
| AbstractDouble2BooleanMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2BooleanSortedMap |
An abstract class providing basic methods for sorted maps implementing a 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.
|
| AbstractDouble2DoubleFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2DoubleMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2DoubleMap.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).
|
| AbstractDouble2DoubleMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2DoubleSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDouble2FloatFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2FloatMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2FloatMap.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).
|
| AbstractDouble2FloatMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2FloatSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDouble2IntFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2IntMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2IntMap.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).
|
| AbstractDouble2IntMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2IntSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDouble2LongFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2LongMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2LongMap.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).
|
| AbstractDouble2LongMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2LongSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDouble2ObjectFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2ObjectMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2ObjectMap.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).
|
| AbstractDouble2ObjectMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2ObjectSortedMap<V> |
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.
|
| AbstractDouble2ShortFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2ShortMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2ShortMap.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).
|
| AbstractDouble2ShortMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractDouble2ShortSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDoubleBidirectionalIterator |
Deprecated.
|
| AbstractDoubleBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractDoubleBigList.DoubleSubList |
A class implementing a sublist view.
|
| AbstractDoubleBigListIterator |
Deprecated.
|
| AbstractDoubleCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractDoubleComparator |
Deprecated.
|
| AbstractDoubleIterator |
Deprecated.
|
| AbstractDoubleList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractDoubleList.DoubleSubList |
A class implementing a sublist view.
|
| AbstractDoubleListIterator |
Deprecated.
|
| AbstractDoublePriorityQueue |
Deprecated.
|
| AbstractDoubleSet |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractDoubleSortedSet |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractDoubleStack |
Deprecated.
|
| AbstractFloat2BooleanFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2BooleanMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2BooleanMap.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).
|
| AbstractFloat2BooleanMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2BooleanSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2ByteFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2ByteMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2ByteMap.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).
|
| AbstractFloat2ByteMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2ByteSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2CharFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2CharMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2CharMap.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).
|
| AbstractFloat2CharMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2CharSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2DoubleFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2DoubleMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2DoubleMap.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).
|
| AbstractFloat2DoubleMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2DoubleSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2FloatFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2FloatMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2FloatMap.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).
|
| AbstractFloat2FloatMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2FloatSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2IntFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2IntMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2IntMap.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).
|
| AbstractFloat2IntMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2IntSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2LongFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2LongMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2LongMap.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).
|
| AbstractFloat2LongMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2LongSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2ObjectFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2ObjectMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2ObjectMap.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).
|
| AbstractFloat2ObjectMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2ObjectSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2ReferenceFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2ReferenceMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2ReferenceMap.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).
|
| AbstractFloat2ReferenceMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2ReferenceSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloat2ShortFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractFloat2ShortMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractFloat2ShortMap.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).
|
| AbstractFloat2ShortMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractFloat2ShortSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractFloatBidirectionalIterator |
Deprecated.
|
| AbstractFloatBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractFloatBigList.FloatSubList |
A class implementing a sublist view.
|
| AbstractFloatBigListIterator |
Deprecated.
|
| AbstractFloatCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractFloatComparator |
Deprecated.
|
| AbstractFloatIterator |
Deprecated.
|
| AbstractFloatList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractFloatList.FloatSubList |
A class implementing a sublist view.
|
| AbstractFloatListIterator |
Deprecated.
|
| AbstractFloatPriorityQueue |
Deprecated.
|
| AbstractFloatSet |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractFloatSortedSet |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractFloatStack |
Deprecated.
|
| AbstractIndirectPriorityQueue<K> |
Deprecated.
|
| AbstractInt2BooleanFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2BooleanMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2BooleanMap.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).
|
| AbstractInt2BooleanMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2BooleanSortedMap |
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.
|
| AbstractInt2DoubleFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2DoubleMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2DoubleMap.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).
|
| AbstractInt2DoubleMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2DoubleSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2FloatFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2FloatMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2FloatMap.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).
|
| AbstractInt2FloatMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2FloatSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2IntFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2IntMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2IntMap.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).
|
| AbstractInt2IntMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2IntSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2LongFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2LongMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2LongMap.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).
|
| AbstractInt2LongMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2LongSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2ObjectFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2ObjectMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2ObjectMap.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).
|
| AbstractInt2ObjectMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2ObjectSortedMap<V> |
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.
|
| AbstractInt2ShortFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2ShortMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2ShortMap.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).
|
| AbstractInt2ShortMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractInt2ShortSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractIntBidirectionalIterator |
Deprecated.
|
| AbstractIntBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractIntBigList.IntSubList |
A class implementing a sublist view.
|
| AbstractIntBigListIterator |
Deprecated.
|
| AbstractIntCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractIntComparator |
Deprecated.
|
| AbstractIntIterator |
Deprecated.
|
| AbstractIntList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractIntList.IntSubList |
A class implementing a sublist view.
|
| AbstractIntListIterator |
Deprecated.
|
| AbstractIntPriorityQueue |
Deprecated.
|
| AbstractIntSet |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractIntSortedSet |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractIntStack |
Deprecated.
|
| AbstractLong2BooleanFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2BooleanMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2BooleanMap.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).
|
| AbstractLong2BooleanMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2BooleanSortedMap |
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.
|
| AbstractLong2DoubleFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2DoubleMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2DoubleMap.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).
|
| AbstractLong2DoubleMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2DoubleSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractLong2FloatFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2FloatMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2FloatMap.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).
|
| AbstractLong2FloatMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2FloatSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractLong2IntFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2IntMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2IntMap.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).
|
| AbstractLong2IntMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2IntSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractLong2LongFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2LongMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2LongMap.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).
|
| AbstractLong2LongMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2LongSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractLong2ObjectFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2ObjectMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2ObjectMap.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).
|
| AbstractLong2ObjectMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2ObjectSortedMap<V> |
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.
|
| AbstractLong2ShortFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractLong2ShortMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractLong2ShortMap.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).
|
| AbstractLong2ShortMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractLong2ShortSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractLongBidirectionalIterator |
Deprecated.
|
| AbstractLongBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractLongBigList.LongSubList |
A class implementing a sublist view.
|
| AbstractLongBigListIterator |
Deprecated.
|
| AbstractLongCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractLongComparator |
Deprecated.
|
| AbstractLongIterator |
Deprecated.
|
| AbstractLongList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractLongList.LongSubList |
A class implementing a sublist view.
|
| AbstractLongListIterator |
Deprecated.
|
| AbstractLongPriorityQueue |
Deprecated.
|
| AbstractLongSet |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractLongSortedSet |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractLongStack |
Deprecated.
|
| AbstractObject2BooleanFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2BooleanMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2BooleanMap.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).
|
| AbstractObject2BooleanMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2BooleanSortedMap<K> |
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.
|
| AbstractObject2DoubleFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2DoubleMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2DoubleMap.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).
|
| AbstractObject2DoubleMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2DoubleSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2FloatFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2FloatMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2FloatMap.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).
|
| AbstractObject2FloatMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2FloatSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2IntFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2IntMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2IntMap.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).
|
| AbstractObject2IntMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2IntSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2LongFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2LongMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2LongMap.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).
|
| AbstractObject2LongMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2LongSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2ObjectFunction<K,V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2ObjectMap<K,V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2ObjectMap.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).
|
| AbstractObject2ObjectMap.BasicEntrySet<K,V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2ObjectSortedMap<K,V> |
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.
|
| AbstractObject2ShortFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2ShortMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2ShortMap.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).
|
| AbstractObject2ShortMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractObject2ShortSortedMap<K> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObjectBidirectionalIterator<K> |
Deprecated.
|
| AbstractObjectBigList<K> |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractObjectBigList.ObjectSubList<K> |
A class implementing a sublist view.
|
| AbstractObjectBigListIterator<K> |
Deprecated.
|
| AbstractObjectCollection<K> |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator<K> |
Deprecated.
|
| AbstractObjectList<K> |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractObjectList.ObjectSubList<K> |
A class implementing a sublist view.
|
| AbstractObjectListIterator<K> |
Deprecated.
|
| AbstractObjectSet<K> |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractObjectSortedSet<K> |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractPriorityQueue<K> |
Deprecated.
|
| AbstractReference2BooleanFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2BooleanMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2BooleanMap.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).
|
| AbstractReference2BooleanMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2BooleanSortedMap<K> |
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.
|
| AbstractReference2FloatFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2FloatMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2FloatMap.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).
|
| AbstractReference2FloatMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2FloatSortedMap<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.
|
| AbstractReference2ShortFunction<K> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2ShortMap<K> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2ShortMap.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).
|
| AbstractReference2ShortMap.BasicEntrySet<K> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractReference2ShortSortedMap<K> |
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.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.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.
|
| AbstractShort2BooleanFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2BooleanMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2BooleanMap.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).
|
| AbstractShort2BooleanMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2BooleanSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2ByteFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2ByteMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2ByteMap.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).
|
| AbstractShort2ByteMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2ByteSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2CharFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2CharMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2CharMap.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).
|
| AbstractShort2CharMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2CharSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2DoubleFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2DoubleMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2DoubleMap.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).
|
| AbstractShort2DoubleMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2DoubleSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2FloatFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2FloatMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2FloatMap.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).
|
| AbstractShort2FloatMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2FloatSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2IntFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2IntMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2IntMap.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).
|
| AbstractShort2IntMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2IntSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2LongFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2LongMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2LongMap.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).
|
| AbstractShort2LongMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2LongSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2ObjectFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2ObjectMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2ObjectMap.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).
|
| AbstractShort2ObjectMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2ObjectSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2ReferenceFunction<V> |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2ReferenceMap<V> |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2ReferenceMap.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).
|
| AbstractShort2ReferenceMap.BasicEntrySet<V> |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2ReferenceSortedMap<V> |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShort2ShortFunction |
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractShort2ShortMap |
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractShort2ShortMap.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).
|
| AbstractShort2ShortMap.BasicEntrySet |
This class provides a basic implementation for an Entry set which forwards some queries to the map.
|
| AbstractShort2ShortSortedMap |
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractShortBidirectionalIterator |
Deprecated.
|
| AbstractShortBigList |
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractShortBigList.ShortSubList |
A class implementing a sublist view.
|
| AbstractShortBigListIterator |
Deprecated.
|
| AbstractShortCollection |
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractShortComparator |
Deprecated.
|
| AbstractShortIterator |
Deprecated.
|
| AbstractShortList |
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractShortList.ShortSubList |
A class implementing a sublist view.
|
| AbstractShortListIterator |
Deprecated.
|
| AbstractShortPriorityQueue |
Deprecated.
|
| AbstractShortSet |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractShortSortedSet |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractShortStack |
Deprecated.
|
| AbstractStack<K> |
Deprecated.
|
| Arrays |
A class providing static methods and objects that do useful things with arrays.
|
| BidirectionalIterator<K> |
|
| BigArrays |
A class providing static methods and objects that do useful things with big
arrays.
|
| BigList<K> |
A list with big (i.e., 64-bit) indices.
|
| BigListIterator<K> |
|
| BigSwapper |
An object that can swap elements whose positions are specified by longs.
|
| BinIO |
Provides static methods to perform easily binary I/O.
|
| BooleanArrayList |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| BooleanArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| BooleanArraySet |
A simple, brute-force implementation of a set based on a backing array.
|
| BooleanBidirectionalIterable |
|
| BooleanBidirectionalIterator |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| BooleanBigArrayBigList |
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| BooleanBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| BooleanBigList |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| BooleanBigListIterator |
|
| BooleanBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| BooleanBigListIterators.BigListIteratorListIterator |
A class exposing a list iterator as a big-list iterator..
|
| BooleanBigListIterators.EmptyBigListIterator |
A class returning no elements and a type-specific big list iterator interface.
|
| BooleanBigListIterators.UnmodifiableBigListIterator |
An unmodifiable wrapper class for big list iterators.
|
| BooleanBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| BooleanBigLists.EmptyBigList |
An immutable class representing an empty type-specific big list.
|
| BooleanBigLists.ListBigList |
A class exposing a list as a big list.
|
| BooleanBigLists.Singleton |
An immutable class representing a type-specific singleton big list.
|
| BooleanBigLists.SynchronizedBigList |
A synchronized wrapper class for big lists.
|
| BooleanBigLists.UnmodifiableBigList |
An unmodifiable wrapper class for big lists.
|
| BooleanCollection |
A type-specific Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| BooleanCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| BooleanCollections.EmptyCollection |
An immutable class representing an empty type-specific collection.
|
| BooleanCollections.IterableCollection |
A collection wrapper class for iterables.
|
| BooleanCollections.SynchronizedCollection |
A synchronized wrapper class for collections.
|
| BooleanCollections.UnmodifiableCollection |
An unmodifiable wrapper class for collections.
|
| BooleanComparator |
A type-specific Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| BooleanComparators |
A class providing static methods and objects that do useful things with comparators.
|
| BooleanConsumer |
A type-specific Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| BooleanHash |
A type-specific Hash interface. |
| BooleanHash.Strategy |
A type-specific hash strategy.
|
| BooleanIterable |
|
| BooleanIterator |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| BooleanIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| BooleanIterators.EmptyIterator |
A class returning no elements and a type-specific iterator interface.
|
| BooleanIterators.UnmodifiableBidirectionalIterator |
An unmodifiable wrapper class for bidirectional iterators.
|
| BooleanIterators.UnmodifiableIterator |
An unmodifiable wrapper class for iterators.
|
| BooleanIterators.UnmodifiableListIterator |
An unmodifiable wrapper class for list iterators.
|
| BooleanList |
A type-specific List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| BooleanListIterator |
A type-specific bidirectional iterator that is also a ListIterator. |
| BooleanLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| BooleanLists.EmptyList |
An immutable class representing an empty type-specific list.
|
| BooleanLists.Singleton |
An immutable class representing a type-specific singleton list.
|
| BooleanLists.SynchronizedList |
A synchronized wrapper class for lists.
|
| BooleanLists.SynchronizedRandomAccessList |
A synchronized wrapper class for random-access lists.
|
| BooleanLists.UnmodifiableList |
An unmodifiable wrapper class for lists.
|
| BooleanLists.UnmodifiableRandomAccessList |
An unmodifiable wrapper class for random-access lists.
|
| BooleanOpenHashSet |
A type-specific hash set with with a fast, small-footprint implementation.
|
| BooleanSet |
A type-specific Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| BooleanSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| BooleanSets.EmptySet |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| BooleanSets.Singleton |
An immutable class representing a type-specific singleton set.
|
| BooleanSets.SynchronizedSet |
A synchronized wrapper class for sets.
|
| BooleanSets.UnmodifiableSet |
An unmodifiable wrapper class for sets.
|
| BooleanStack |
A type-specific Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2BooleanArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2BooleanAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2BooleanFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2BooleanFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Byte2BooleanFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2BooleanFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Byte2BooleanFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Byte2BooleanFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Byte2BooleanLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2BooleanMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2BooleanMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2BooleanMap.FastEntrySet |
An entry set providing fast iteration.
|
| Byte2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2BooleanMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Byte2BooleanMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Byte2BooleanMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Byte2BooleanMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Byte2BooleanOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Byte2BooleanOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2BooleanRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2BooleanSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2BooleanSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Byte2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2BooleanSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Byte2BooleanSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2BooleanSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Byte2BooleanSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Byte2DoubleFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Byte2FloatArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2FloatAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2FloatFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2FloatFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Byte2FloatFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2FloatFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Byte2FloatFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Byte2FloatFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Byte2FloatLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2FloatMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2FloatMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2FloatMap.FastEntrySet |
An entry set providing fast iteration.
|
| Byte2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2FloatMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Byte2FloatMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Byte2FloatMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Byte2FloatMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Byte2FloatOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Byte2FloatOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2FloatRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2FloatSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2FloatSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Byte2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2FloatSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Byte2FloatSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2FloatSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Byte2FloatSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Byte2IntFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Byte2LongFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Byte2ObjectFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Byte2ShortArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Byte2ShortAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Byte2ShortFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Byte2ShortFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Byte2ShortFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Byte2ShortFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Byte2ShortFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Byte2ShortFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Byte2ShortLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Byte2ShortMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Byte2ShortMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Byte2ShortMap.FastEntrySet |
An entry set providing fast iteration.
|
| Byte2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Byte2ShortMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Byte2ShortMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Byte2ShortMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Byte2ShortMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Byte2ShortOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Byte2ShortOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Byte2ShortRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Byte2ShortSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Byte2ShortSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Byte2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Byte2ShortSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Byte2ShortSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Byte2ShortSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Byte2ShortSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| ByteArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| 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 |
|
| 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.
|
| ByteBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| ByteBigList |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ByteBigListIterator |
|
| ByteBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| 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.
|
| 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.
|
| ByteCollections.SynchronizedCollection |
A synchronized wrapper class for collections.
|
| ByteCollections.UnmodifiableCollection |
An unmodifiable wrapper class for collections.
|
| 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. |
| 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.
|
| ByteIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| ByteIndirectPriorityQueue |
|
| ByteIterable |
|
| ByteIterator |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ByteIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| ByteStack |
A type-specific Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2BooleanArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2BooleanAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2BooleanFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2BooleanFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Char2BooleanFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2BooleanFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Char2BooleanFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Char2BooleanFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Char2BooleanLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2BooleanMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2BooleanMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2BooleanMap.FastEntrySet |
An entry set providing fast iteration.
|
| Char2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2BooleanMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Char2BooleanMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Char2BooleanMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Char2BooleanMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Char2BooleanOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Char2BooleanOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2BooleanRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2BooleanSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2BooleanSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Char2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2BooleanSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Char2BooleanSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Char2BooleanSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Char2BooleanSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Char2DoubleFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Char2FloatArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2FloatAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2FloatFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2FloatFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Char2FloatFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2FloatFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Char2FloatFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Char2FloatFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Char2FloatLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2FloatMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2FloatMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2FloatMap.FastEntrySet |
An entry set providing fast iteration.
|
| Char2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2FloatMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Char2FloatMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Char2FloatMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Char2FloatMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Char2FloatOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Char2FloatOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2FloatRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2FloatSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2FloatSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Char2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2FloatSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Char2FloatSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Char2FloatSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Char2FloatSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Char2IntFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Char2LongFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Char2ObjectFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Char2ShortArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Char2ShortAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Char2ShortFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Char2ShortFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Char2ShortFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Char2ShortFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Char2ShortFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Char2ShortFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Char2ShortLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Char2ShortMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Char2ShortMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Char2ShortMap.FastEntrySet |
An entry set providing fast iteration.
|
| Char2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Char2ShortMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Char2ShortMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Char2ShortMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Char2ShortMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Char2ShortOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Char2ShortOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Char2ShortRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Char2ShortSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Char2ShortSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Char2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Char2ShortSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Char2ShortSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Char2ShortSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Char2ShortSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| CharArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| 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 |
|
| 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.
|
| CharBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| CharBigList |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| CharBigListIterator |
|
| CharBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| 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.
|
| 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.
|
| CharCollections.SynchronizedCollection |
A synchronized wrapper class for collections.
|
| CharCollections.UnmodifiableCollection |
An unmodifiable wrapper class for collections.
|
| 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. |
| 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.
|
| CharIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| CharIndirectPriorityQueue |
|
| CharIterable |
|
| CharIterator |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| CharIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| CharStack |
A type-specific Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2BooleanArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2BooleanAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2BooleanFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2BooleanFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Double2BooleanFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2BooleanFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Double2BooleanFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Double2BooleanFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Double2BooleanLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2BooleanMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2BooleanMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2BooleanMap.FastEntrySet |
An entry set providing fast iteration.
|
| Double2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2BooleanMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Double2BooleanMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Double2BooleanMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Double2BooleanMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Double2BooleanOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Double2BooleanOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2BooleanRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2BooleanSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2BooleanSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Double2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2BooleanSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Double2BooleanSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Double2BooleanSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Double2BooleanSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Double2ByteFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Double2CharFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Double2DoubleArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2DoubleAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2DoubleFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2DoubleFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Double2DoubleFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2DoubleFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Double2DoubleFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Double2DoubleFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Double2DoubleLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2DoubleMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2DoubleMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2DoubleMap.FastEntrySet |
An entry set providing fast iteration.
|
| Double2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2DoubleMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Double2DoubleMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Double2DoubleMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Double2DoubleMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Double2DoubleOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Double2DoubleOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2DoubleRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2DoubleSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2DoubleSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Double2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2DoubleSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Double2DoubleSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Double2DoubleSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Double2DoubleSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Double2FloatArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2FloatAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2FloatFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2FloatFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Double2FloatFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2FloatFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Double2FloatFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Double2FloatFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Double2FloatLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2FloatMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2FloatMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2FloatMap.FastEntrySet |
An entry set providing fast iteration.
|
| Double2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2FloatMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Double2FloatMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Double2FloatMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Double2FloatMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Double2FloatOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Double2FloatOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2FloatRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2FloatSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2FloatSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Double2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2FloatSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Double2FloatSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Double2FloatSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Double2FloatSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Double2IntArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2IntAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2IntFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2IntFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Double2IntFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2IntFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Double2IntFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Double2IntFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Double2IntLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2IntMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2IntMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2IntMap.FastEntrySet |
An entry set providing fast iteration.
|
| Double2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2IntMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Double2IntMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Double2IntMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Double2IntMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Double2IntOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Double2IntOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2IntRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2IntSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2IntSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Double2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2IntSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Double2IntSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Double2IntSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Double2IntSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Double2LongArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2LongAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2LongFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2LongFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Double2LongFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2LongFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Double2LongFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Double2LongFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Double2LongLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2LongMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2LongMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2LongMap.FastEntrySet |
An entry set providing fast iteration.
|
| Double2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2LongMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Double2LongMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Double2LongMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Double2LongMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Double2LongOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Double2LongOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2LongRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2LongSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2LongSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Double2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2LongSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Double2LongSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Double2LongSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Double2LongSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Double2ObjectArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2ObjectAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2ObjectFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2ObjectFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Double2ObjectFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2ObjectFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Double2ObjectFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Double2ObjectFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Double2ObjectLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2ObjectMap<V> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2ObjectMap.Entry<V> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2ObjectMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Double2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2ObjectMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Double2ObjectMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Double2ObjectMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Double2ObjectMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Double2ObjectOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Double2ObjectOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2ObjectRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2ObjectSortedMap<V> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ObjectSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Double2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2ObjectSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Double2ObjectSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Double2ObjectSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Double2ObjectSortedMaps.UnmodifiableSortedMap<V> |
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.
|
| Double2ReferenceFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Double2ShortArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2ShortAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2ShortFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Double2ShortFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Double2ShortFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Double2ShortFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Double2ShortFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Double2ShortFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Double2ShortLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2ShortMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2ShortMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2ShortMap.FastEntrySet |
An entry set providing fast iteration.
|
| Double2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Double2ShortMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Double2ShortMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Double2ShortMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Double2ShortMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Double2ShortOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Double2ShortOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2ShortRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2ShortSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ShortSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Double2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Double2ShortSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Double2ShortSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Double2ShortSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Double2ShortSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| DoubleArrayFIFOQueue |
A type-specific array-based FIFO queue, supporting also deque operations.
|
| DoubleArrayIndirectPriorityQueue |
A type-specific array-based semi-indirect priority queue.
|
| DoubleArrayList |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| DoubleArrayPriorityQueue |
A type-specific array-based priority queue.
|
| DoubleArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| DoubleArraySet |
A simple, brute-force implementation of a set based on a backing array.
|
| DoubleAVLTreeSet |
A type-specific AVL tree set with a fast, small-footprint implementation.
|
| DoubleBidirectionalIterable |
|
| DoubleBidirectionalIterator |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| DoubleBigArrayBigList |
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| DoubleBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| DoubleBigList |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleBigListIterator |
|
| DoubleBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| DoubleBigListIterators.BigListIteratorListIterator |
A class exposing a list iterator as a big-list iterator..
|
| DoubleBigListIterators.EmptyBigListIterator |
A class returning no elements and a type-specific big list iterator interface.
|
| DoubleBigListIterators.UnmodifiableBigListIterator |
An unmodifiable wrapper class for big list iterators.
|
| DoubleBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| DoubleBigLists.EmptyBigList |
An immutable class representing an empty type-specific big list.
|
| DoubleBigLists.ListBigList |
A class exposing a list as a big list.
|
| DoubleBigLists.Singleton |
An immutable class representing a type-specific singleton big list.
|
| DoubleBigLists.SynchronizedBigList |
A synchronized wrapper class for big lists.
|
| DoubleBigLists.UnmodifiableBigList |
An unmodifiable wrapper class for big lists.
|
| DoubleCollection |
A type-specific Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| DoubleCollections.EmptyCollection |
An immutable class representing an empty type-specific collection.
|
| DoubleCollections.IterableCollection |
A collection wrapper class for iterables.
|
| DoubleCollections.SynchronizedCollection |
A synchronized wrapper class for collections.
|
| DoubleCollections.UnmodifiableCollection |
An unmodifiable wrapper class for collections.
|
| DoubleComparator |
A type-specific Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| DoubleComparators |
A class providing static methods and objects that do useful things with comparators.
|
| DoubleConsumer |
A type-specific Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| DoubleHash |
A type-specific Hash interface. |
| DoubleHash.Strategy |
A type-specific hash strategy.
|
| DoubleHeapIndirectPriorityQueue |
A type-specific heap-based indirect priority queue.
|
| DoubleHeapPriorityQueue |
A type-specific heap-based priority queue.
|
| DoubleHeaps |
A class providing static methods and objects that do useful things with heaps.
|
| DoubleHeapSemiIndirectPriorityQueue |
A type-specific heap-based semi-indirect priority queue.
|
| DoubleIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| DoubleIndirectPriorityQueue |
|
| DoubleIterable |
|
| DoubleIterator |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| DoubleIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| DoubleIterators.EmptyIterator |
A class returning no elements and a type-specific iterator interface.
|
| DoubleIterators.UnmodifiableBidirectionalIterator |
An unmodifiable wrapper class for bidirectional iterators.
|
| DoubleIterators.UnmodifiableIterator |
An unmodifiable wrapper class for iterators.
|
| DoubleIterators.UnmodifiableListIterator |
An unmodifiable wrapper class for list iterators.
|
| DoubleLinkedOpenCustomHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| DoubleLinkedOpenHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| DoubleList |
A type-specific List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleListIterator |
A type-specific bidirectional iterator that is also a ListIterator. |
| DoubleLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| DoubleLists.EmptyList |
An immutable class representing an empty type-specific list.
|
| DoubleLists.Singleton |
An immutable class representing a type-specific singleton list.
|
| DoubleLists.SynchronizedList |
A synchronized wrapper class for lists.
|
| DoubleLists.SynchronizedRandomAccessList |
A synchronized wrapper class for random-access lists.
|
| DoubleLists.UnmodifiableList |
An unmodifiable wrapper class for lists.
|
| DoubleLists.UnmodifiableRandomAccessList |
An unmodifiable wrapper class for random-access lists.
|
| DoubleOpenCustomHashSet |
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| DoubleOpenHashBigSet |
A type-specific hash big set with with a fast, small-footprint implementation.
|
| DoubleOpenHashSet |
A type-specific hash set with with a fast, small-footprint implementation.
|
| DoublePriorityQueue |
A type-specific PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoublePriorityQueues |
A class providing static methods and objects that do useful things with type-specific priority queues.
|
| DoublePriorityQueues.SynchronizedPriorityQueue |
A synchronized wrapper class for priority queues.
|
| DoubleRBTreeSet |
A type-specific red-black tree set with a fast, small-footprint implementation.
|
| DoubleSemiIndirectHeaps |
A class providing static methods and objects that do useful things with semi-indirect heaps.
|
| DoubleSet |
A type-specific Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| DoubleSets.EmptySet |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| DoubleSets.Singleton |
An immutable class representing a type-specific singleton set.
|
| DoubleSets.SynchronizedSet |
A synchronized wrapper class for sets.
|
| DoubleSets.UnmodifiableSet |
An unmodifiable wrapper class for sets.
|
| DoubleSortedSet |
A type-specific SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| DoubleSortedSets.EmptySet |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| DoubleSortedSets.Singleton |
A class representing a singleton sorted set.
|
| DoubleSortedSets.SynchronizedSortedSet |
A synchronized wrapper class for sorted sets.
|
| DoubleSortedSets.UnmodifiableSortedSet |
An unmodifiable wrapper class for sorted sets.
|
| DoubleStack |
A type-specific Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| FastBufferedInputStream |
|
| FastBufferedInputStream.LineTerminator |
An enumeration of the supported line terminators.
|
| FastBufferedOutputStream |
|
| FastByteArrayInputStream |
Simple, fast and repositionable byte-array input stream.
|
| FastByteArrayOutputStream |
Simple, fast byte-array output stream that exposes the backing array.
|
| FastMultiByteArrayInputStream |
Simple, fast and repositionable byte array input stream that multiplexes its content among several arrays.
|
| Float2BooleanArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2BooleanAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2BooleanFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2BooleanFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Float2BooleanFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2BooleanFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Float2BooleanFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Float2BooleanFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Float2BooleanLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2BooleanMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2BooleanMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2BooleanMap.FastEntrySet |
An entry set providing fast iteration.
|
| Float2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2BooleanMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Float2BooleanMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Float2BooleanMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Float2BooleanMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Float2BooleanOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2BooleanOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2BooleanRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2BooleanSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2BooleanSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Float2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2BooleanSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Float2BooleanSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Float2BooleanSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Float2BooleanSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Float2ByteArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2ByteAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2ByteFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2ByteFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Float2ByteFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2ByteFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Float2ByteFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Float2ByteFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Float2ByteLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2ByteMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2ByteMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2ByteMap.FastEntrySet |
An entry set providing fast iteration.
|
| Float2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2ByteMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Float2ByteMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Float2ByteMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Float2ByteMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Float2ByteOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2ByteOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2ByteRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2ByteSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ByteSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Float2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2ByteSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Float2ByteSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Float2ByteSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Float2ByteSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Float2CharArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2CharAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2CharFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2CharFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Float2CharFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2CharFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Float2CharFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Float2CharFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Float2CharLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2CharMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2CharMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2CharMap.FastEntrySet |
An entry set providing fast iteration.
|
| Float2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2CharMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Float2CharMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Float2CharMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Float2CharMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Float2CharOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2CharOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2CharRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2CharSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2CharSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Float2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2CharSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Float2CharSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Float2CharSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Float2CharSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Float2DoubleArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2DoubleAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2DoubleFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2DoubleFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Float2DoubleFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2DoubleFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Float2DoubleFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Float2DoubleFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Float2DoubleLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2DoubleMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2DoubleMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2DoubleMap.FastEntrySet |
An entry set providing fast iteration.
|
| Float2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2DoubleMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Float2DoubleMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Float2DoubleMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Float2DoubleMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Float2DoubleOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2DoubleOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2DoubleRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2DoubleSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2DoubleSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Float2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2DoubleSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Float2DoubleSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Float2DoubleSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Float2DoubleSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Float2FloatArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2FloatAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2FloatFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2FloatFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Float2FloatFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2FloatFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Float2FloatFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Float2FloatFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Float2FloatLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2FloatMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2FloatMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2FloatMap.FastEntrySet |
An entry set providing fast iteration.
|
| Float2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2FloatMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Float2FloatMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Float2FloatMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Float2FloatMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Float2FloatOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2FloatOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2FloatRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2FloatSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2FloatSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Float2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2FloatSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Float2FloatSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Float2FloatSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Float2FloatSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Float2IntArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2IntAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2IntFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2IntFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Float2IntFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2IntFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Float2IntFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Float2IntFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Float2IntLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2IntMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2IntMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2IntMap.FastEntrySet |
An entry set providing fast iteration.
|
| Float2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2IntMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Float2IntMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Float2IntMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Float2IntMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Float2IntOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2IntOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2IntRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2IntSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2IntSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Float2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2IntSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Float2IntSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Float2IntSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Float2IntSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Float2LongArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2LongAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2LongFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2LongFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Float2LongFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2LongFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Float2LongFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Float2LongFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Float2LongLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2LongMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2LongMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2LongMap.FastEntrySet |
An entry set providing fast iteration.
|
| Float2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2LongMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Float2LongMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Float2LongMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Float2LongMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Float2LongOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2LongOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2LongRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2LongSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2LongSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Float2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2LongSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Float2LongSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Float2LongSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Float2LongSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Float2ObjectArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2ObjectAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2ObjectFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2ObjectFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Float2ObjectFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2ObjectFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Float2ObjectFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Float2ObjectFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Float2ObjectLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2ObjectMap<V> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2ObjectMap.Entry<V> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2ObjectMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Float2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2ObjectMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Float2ObjectMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Float2ObjectMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Float2ObjectMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Float2ObjectOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2ObjectOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2ObjectRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2ObjectSortedMap<V> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ObjectSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Float2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2ObjectSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Float2ObjectSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Float2ObjectSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Float2ObjectSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| Float2ReferenceArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2ReferenceAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2ReferenceFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2ReferenceFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Float2ReferenceFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2ReferenceFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Float2ReferenceFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Float2ReferenceFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Float2ReferenceLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2ReferenceMap<V> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2ReferenceMap.Entry<V> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2ReferenceMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Float2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2ReferenceMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Float2ReferenceMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Float2ReferenceMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Float2ReferenceMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Float2ReferenceOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2ReferenceOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2ReferenceRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2ReferenceSortedMap<V> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ReferenceSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Float2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2ReferenceSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Float2ReferenceSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Float2ReferenceSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Float2ReferenceSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| Float2ShortArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Float2ShortAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Float2ShortFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Float2ShortFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Float2ShortFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Float2ShortFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Float2ShortFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Float2ShortFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Float2ShortLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Float2ShortMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Float2ShortMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Float2ShortMap.FastEntrySet |
An entry set providing fast iteration.
|
| Float2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Float2ShortMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Float2ShortMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Float2ShortMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Float2ShortMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Float2ShortOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Float2ShortOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Float2ShortRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Float2ShortSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Float2ShortSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Float2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Float2ShortSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Float2ShortSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Float2ShortSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Float2ShortSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| FloatArrayFIFOQueue |
A type-specific array-based FIFO queue, supporting also deque operations.
|
| FloatArrayIndirectPriorityQueue |
A type-specific array-based semi-indirect priority queue.
|
| FloatArrayList |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| FloatArrayPriorityQueue |
A type-specific array-based priority queue.
|
| FloatArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| FloatArraySet |
A simple, brute-force implementation of a set based on a backing array.
|
| FloatAVLTreeSet |
A type-specific AVL tree set with a fast, small-footprint implementation.
|
| FloatBidirectionalIterable |
|
| FloatBidirectionalIterator |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| FloatBigArrayBigList |
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| FloatBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| FloatBigList |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| FloatBigListIterator |
|
| FloatBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| FloatBigListIterators.BigListIteratorListIterator |
A class exposing a list iterator as a big-list iterator..
|
| FloatBigListIterators.EmptyBigListIterator |
A class returning no elements and a type-specific big list iterator interface.
|
| FloatBigListIterators.UnmodifiableBigListIterator |
An unmodifiable wrapper class for big list iterators.
|
| FloatBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| FloatBigLists.EmptyBigList |
An immutable class representing an empty type-specific big list.
|
| FloatBigLists.ListBigList |
A class exposing a list as a big list.
|
| FloatBigLists.Singleton |
An immutable class representing a type-specific singleton big list.
|
| FloatBigLists.SynchronizedBigList |
A synchronized wrapper class for big lists.
|
| FloatBigLists.UnmodifiableBigList |
An unmodifiable wrapper class for big lists.
|
| FloatCollection |
A type-specific Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| FloatCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| FloatCollections.EmptyCollection |
An immutable class representing an empty type-specific collection.
|
| FloatCollections.IterableCollection |
A collection wrapper class for iterables.
|
| FloatCollections.SynchronizedCollection |
A synchronized wrapper class for collections.
|
| FloatCollections.UnmodifiableCollection |
An unmodifiable wrapper class for collections.
|
| FloatComparator |
A type-specific Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| FloatComparators |
A class providing static methods and objects that do useful things with comparators.
|
| FloatConsumer |
A type-specific Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| FloatHash |
A type-specific Hash interface. |
| FloatHash.Strategy |
A type-specific hash strategy.
|
| FloatHeapIndirectPriorityQueue |
A type-specific heap-based indirect priority queue.
|
| FloatHeapPriorityQueue |
A type-specific heap-based priority queue.
|
| FloatHeaps |
A class providing static methods and objects that do useful things with heaps.
|
| FloatHeapSemiIndirectPriorityQueue |
A type-specific heap-based semi-indirect priority queue.
|
| FloatIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| FloatIndirectPriorityQueue |
|
| FloatIterable |
|
| FloatIterator |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| FloatIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| FloatIterators.EmptyIterator |
A class returning no elements and a type-specific iterator interface.
|
| FloatIterators.UnmodifiableBidirectionalIterator |
An unmodifiable wrapper class for bidirectional iterators.
|
| FloatIterators.UnmodifiableIterator |
An unmodifiable wrapper class for iterators.
|
| FloatIterators.UnmodifiableListIterator |
An unmodifiable wrapper class for list iterators.
|
| FloatLinkedOpenCustomHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| FloatLinkedOpenHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| FloatList |
A type-specific List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| FloatListIterator |
A type-specific bidirectional iterator that is also a ListIterator. |
| FloatLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| FloatLists.EmptyList |
An immutable class representing an empty type-specific list.
|
| FloatLists.Singleton |
An immutable class representing a type-specific singleton list.
|
| FloatLists.SynchronizedList |
A synchronized wrapper class for lists.
|
| FloatLists.SynchronizedRandomAccessList |
A synchronized wrapper class for random-access lists.
|
| FloatLists.UnmodifiableList |
An unmodifiable wrapper class for lists.
|
| FloatLists.UnmodifiableRandomAccessList |
An unmodifiable wrapper class for random-access lists.
|
| FloatOpenCustomHashSet |
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| FloatOpenHashBigSet |
A type-specific hash big set with with a fast, small-footprint implementation.
|
| FloatOpenHashSet |
A type-specific hash set with with a fast, small-footprint implementation.
|
| FloatPriorityQueue |
A type-specific PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing. |
| FloatPriorityQueues |
A class providing static methods and objects that do useful things with type-specific priority queues.
|
| FloatPriorityQueues.SynchronizedPriorityQueue |
A synchronized wrapper class for priority queues.
|
| FloatRBTreeSet |
A type-specific red-black tree set with a fast, small-footprint implementation.
|
| FloatSemiIndirectHeaps |
A class providing static methods and objects that do useful things with semi-indirect heaps.
|
| FloatSet |
A type-specific Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| FloatSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| FloatSets.EmptySet |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| FloatSets.Singleton |
An immutable class representing a type-specific singleton set.
|
| FloatSets.SynchronizedSet |
A synchronized wrapper class for sets.
|
| FloatSets.UnmodifiableSet |
An unmodifiable wrapper class for sets.
|
| FloatSortedSet |
A type-specific SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| FloatSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| FloatSortedSets.EmptySet |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| FloatSortedSets.Singleton |
A class representing a singleton sorted set.
|
| FloatSortedSets.SynchronizedSortedSet |
A synchronized wrapper class for sorted sets.
|
| FloatSortedSets.UnmodifiableSortedSet |
An unmodifiable wrapper class for sorted sets.
|
| FloatStack |
A type-specific Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Function<K,V> |
A function mapping keys into values.
|
| Hash |
Basic data for all hash-based classes.
|
| Hash.Strategy<K> |
A generic hash strategy.
|
| HashCommon |
Common code for all hash-based classes.
|
| IndirectPriorityQueue<K> |
An indirect priority queue.
|
| IndirectPriorityQueues |
A class providing static methods and objects that do useful things with indirect priority queues.
|
| IndirectPriorityQueues.EmptyIndirectPriorityQueue |
An immutable class representing the empty indirect priority queue.
|
| IndirectPriorityQueues.SynchronizedIndirectPriorityQueue<K> |
A synchronized wrapper class for indirect priority queues.
|
| InspectableFileCachedInputStream |
|
| Int2BooleanArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2BooleanAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2BooleanFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2BooleanFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Int2BooleanFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2BooleanFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Int2BooleanFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Int2BooleanFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Int2BooleanLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2BooleanMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2BooleanMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2BooleanMap.FastEntrySet |
An entry set providing fast iteration.
|
| Int2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2BooleanMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Int2BooleanMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Int2BooleanMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Int2BooleanMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Int2BooleanOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Int2BooleanOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2BooleanRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2BooleanSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2BooleanSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Int2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2BooleanSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Int2BooleanSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Int2BooleanSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Int2BooleanSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Int2ByteFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Int2CharFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Int2DoubleArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2DoubleAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2DoubleFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2DoubleFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Int2DoubleFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2DoubleFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Int2DoubleFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Int2DoubleFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Int2DoubleLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2DoubleMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2DoubleMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2DoubleMap.FastEntrySet |
An entry set providing fast iteration.
|
| Int2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2DoubleMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Int2DoubleMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Int2DoubleMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Int2DoubleMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Int2DoubleOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Int2DoubleOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2DoubleRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2DoubleSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2DoubleSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Int2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2DoubleSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Int2DoubleSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Int2DoubleSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Int2DoubleSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Int2FloatArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2FloatAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2FloatFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2FloatFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Int2FloatFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2FloatFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Int2FloatFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Int2FloatFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Int2FloatLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2FloatMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2FloatMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2FloatMap.FastEntrySet |
An entry set providing fast iteration.
|
| Int2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2FloatMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Int2FloatMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Int2FloatMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Int2FloatMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Int2FloatOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Int2FloatOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2FloatRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2FloatSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2FloatSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Int2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2FloatSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Int2FloatSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Int2FloatSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Int2FloatSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Int2IntArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2IntAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2IntFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2IntFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Int2IntFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2IntFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Int2IntFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Int2IntFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Int2IntLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2IntMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2IntMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2IntMap.FastEntrySet |
An entry set providing fast iteration.
|
| Int2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2IntMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Int2IntMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Int2IntMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Int2IntMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Int2IntOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Int2IntOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2IntRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2IntSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2IntSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Int2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2IntSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Int2IntSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Int2IntSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Int2IntSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Int2LongArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2LongAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2LongFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2LongFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Int2LongFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2LongFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Int2LongFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Int2LongFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Int2LongLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2LongMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2LongMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2LongMap.FastEntrySet |
An entry set providing fast iteration.
|
| Int2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2LongMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Int2LongMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Int2LongMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Int2LongMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Int2LongOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Int2LongOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2LongRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2LongSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2LongSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Int2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2LongSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Int2LongSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Int2LongSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Int2LongSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Int2ObjectArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2ObjectAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2ObjectFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2ObjectFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Int2ObjectFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2ObjectFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Int2ObjectFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Int2ObjectFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Int2ObjectLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2ObjectMap<V> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2ObjectMap.Entry<V> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2ObjectMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Int2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2ObjectMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Int2ObjectMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Int2ObjectMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Int2ObjectMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Int2ObjectOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Int2ObjectOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2ObjectRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2ObjectSortedMap<V> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ObjectSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Int2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2ObjectSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Int2ObjectSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Int2ObjectSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Int2ObjectSortedMaps.UnmodifiableSortedMap<V> |
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.
|
| Int2ReferenceFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Int2ShortArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2ShortAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2ShortFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Int2ShortFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Int2ShortFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Int2ShortFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Int2ShortFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Int2ShortFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Int2ShortLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2ShortMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2ShortMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2ShortMap.FastEntrySet |
An entry set providing fast iteration.
|
| Int2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Int2ShortMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Int2ShortMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Int2ShortMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Int2ShortMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Int2ShortOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Int2ShortOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2ShortRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2ShortSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ShortSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Int2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Int2ShortSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Int2ShortSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Int2ShortSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Int2ShortSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| IntArrayFIFOQueue |
A type-specific array-based FIFO queue, supporting also deque operations.
|
| IntArrayFrontCodedBigList |
Compact storage of big lists of arrays using front coding.
|
| IntArrayFrontCodedList |
Compact storage of lists of arrays using front coding.
|
| IntArrayIndirectPriorityQueue |
A type-specific array-based semi-indirect priority queue.
|
| IntArrayList |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| IntArrayPriorityQueue |
A type-specific array-based priority queue.
|
| IntArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| IntArraySet |
A simple, brute-force implementation of a set based on a backing array.
|
| IntAVLTreeSet |
A type-specific AVL tree set with a fast, small-footprint implementation.
|
| IntBidirectionalIterable |
|
| IntBidirectionalIterator |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| IntBigArrayBigList |
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| IntBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| IntBigList |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntBigListIterator |
|
| IntBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| IntBigListIterators.BigListIteratorListIterator |
A class exposing a list iterator as a big-list iterator..
|
| IntBigListIterators.EmptyBigListIterator |
A class returning no elements and a type-specific big list iterator interface.
|
| IntBigListIterators.UnmodifiableBigListIterator |
An unmodifiable wrapper class for big list iterators.
|
| IntBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| IntBigLists.EmptyBigList |
An immutable class representing an empty type-specific big list.
|
| IntBigLists.ListBigList |
A class exposing a list as a big list.
|
| IntBigLists.Singleton |
An immutable class representing a type-specific singleton big list.
|
| IntBigLists.SynchronizedBigList |
A synchronized wrapper class for big lists.
|
| IntBigLists.UnmodifiableBigList |
An unmodifiable wrapper class for big lists.
|
| IntCollection |
A type-specific Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| IntCollections.EmptyCollection |
An immutable class representing an empty type-specific collection.
|
| IntCollections.IterableCollection |
A collection wrapper class for iterables.
|
| IntCollections.SynchronizedCollection |
A synchronized wrapper class for collections.
|
| IntCollections.UnmodifiableCollection |
An unmodifiable wrapper class for collections.
|
| IntComparator |
A type-specific Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| IntComparators |
A class providing static methods and objects that do useful things with comparators.
|
| IntConsumer |
A type-specific Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| IntHash |
A type-specific Hash interface. |
| IntHash.Strategy |
A type-specific hash strategy.
|
| IntHeapIndirectPriorityQueue |
A type-specific heap-based indirect priority queue.
|
| IntHeapPriorityQueue |
A type-specific heap-based priority queue.
|
| IntHeaps |
A class providing static methods and objects that do useful things with heaps.
|
| IntHeapSemiIndirectPriorityQueue |
A type-specific heap-based semi-indirect priority queue.
|
| IntIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| IntIndirectPriorityQueue |
|
| IntIterable |
|
| IntIterator |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| IntIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| IntIterators.EmptyIterator |
A class returning no elements and a type-specific iterator interface.
|
| IntIterators.UnmodifiableBidirectionalIterator |
An unmodifiable wrapper class for bidirectional iterators.
|
| IntIterators.UnmodifiableIterator |
An unmodifiable wrapper class for iterators.
|
| IntIterators.UnmodifiableListIterator |
An unmodifiable wrapper class for list iterators.
|
| IntLinkedOpenCustomHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| IntLinkedOpenHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| IntList |
A type-specific List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntListIterator |
A type-specific bidirectional iterator that is also a ListIterator. |
| IntLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| IntLists.EmptyList |
An immutable class representing an empty type-specific list.
|
| IntLists.Singleton |
An immutable class representing a type-specific singleton list.
|
| IntLists.SynchronizedList |
A synchronized wrapper class for lists.
|
| IntLists.SynchronizedRandomAccessList |
A synchronized wrapper class for random-access lists.
|
| IntLists.UnmodifiableList |
An unmodifiable wrapper class for lists.
|
| IntLists.UnmodifiableRandomAccessList |
An unmodifiable wrapper class for random-access lists.
|
| IntOpenCustomHashSet |
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| IntOpenHashBigSet |
A type-specific hash big set with with a fast, small-footprint implementation.
|
| IntOpenHashSet |
A type-specific hash set with with a fast, small-footprint implementation.
|
| IntPriorityQueue |
A type-specific PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntPriorityQueues |
A class providing static methods and objects that do useful things with type-specific priority queues.
|
| IntPriorityQueues.SynchronizedPriorityQueue |
A synchronized wrapper class for priority queues.
|
| IntRBTreeSet |
A type-specific red-black tree set with a fast, small-footprint implementation.
|
| IntSemiIndirectHeaps |
A class providing static methods and objects that do useful things with semi-indirect heaps.
|
| IntSet |
A type-specific Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| IntSets.EmptySet |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| IntSets.Singleton |
An immutable class representing a type-specific singleton set.
|
| IntSets.SynchronizedSet |
A synchronized wrapper class for sets.
|
| IntSets.UnmodifiableSet |
An unmodifiable wrapper class for sets.
|
| IntSortedSet |
A type-specific SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| IntSortedSets.EmptySet |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| IntSortedSets.Singleton |
A class representing a singleton sorted set.
|
| IntSortedSets.SynchronizedSortedSet |
A synchronized wrapper class for sorted sets.
|
| IntSortedSets.UnmodifiableSortedSet |
An unmodifiable wrapper class for sorted sets.
|
| IntStack |
A type-specific Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2BooleanArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2BooleanAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2BooleanFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2BooleanFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Long2BooleanFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2BooleanFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Long2BooleanFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Long2BooleanFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Long2BooleanLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2BooleanMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2BooleanMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2BooleanMap.FastEntrySet |
An entry set providing fast iteration.
|
| Long2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2BooleanMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Long2BooleanMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Long2BooleanMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Long2BooleanMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Long2BooleanOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Long2BooleanOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2BooleanRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2BooleanSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2BooleanSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Long2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2BooleanSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Long2BooleanSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Long2BooleanSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Long2BooleanSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Long2ByteFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Long2CharFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Long2DoubleArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2DoubleAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2DoubleFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2DoubleFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Long2DoubleFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2DoubleFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Long2DoubleFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Long2DoubleFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Long2DoubleLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2DoubleMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2DoubleMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2DoubleMap.FastEntrySet |
An entry set providing fast iteration.
|
| Long2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2DoubleMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Long2DoubleMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Long2DoubleMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Long2DoubleMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Long2DoubleOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Long2DoubleOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2DoubleRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2DoubleSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2DoubleSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Long2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2DoubleSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Long2DoubleSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Long2DoubleSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Long2DoubleSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Long2FloatArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2FloatAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2FloatFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2FloatFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Long2FloatFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2FloatFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Long2FloatFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Long2FloatFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Long2FloatLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2FloatMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2FloatMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2FloatMap.FastEntrySet |
An entry set providing fast iteration.
|
| Long2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2FloatMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Long2FloatMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Long2FloatMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Long2FloatMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Long2FloatOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Long2FloatOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2FloatRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2FloatSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2FloatSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Long2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2FloatSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Long2FloatSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Long2FloatSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Long2FloatSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Long2IntArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2IntAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2IntFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2IntFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Long2IntFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2IntFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Long2IntFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Long2IntFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Long2IntLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2IntMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2IntMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2IntMap.FastEntrySet |
An entry set providing fast iteration.
|
| Long2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2IntMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Long2IntMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Long2IntMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Long2IntMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Long2IntOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Long2IntOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2IntRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2IntSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2IntSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Long2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2IntSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Long2IntSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Long2IntSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Long2IntSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Long2LongArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2LongAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2LongFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2LongFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Long2LongFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2LongFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Long2LongFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Long2LongFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Long2LongLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2LongMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2LongMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2LongMap.FastEntrySet |
An entry set providing fast iteration.
|
| Long2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2LongMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Long2LongMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Long2LongMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Long2LongMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Long2LongOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Long2LongOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2LongRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2LongSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2LongSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Long2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2LongSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Long2LongSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Long2LongSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Long2LongSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Long2ObjectArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2ObjectAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2ObjectFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2ObjectFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Long2ObjectFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2ObjectFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Long2ObjectFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Long2ObjectFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Long2ObjectLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2ObjectMap<V> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2ObjectMap.Entry<V> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2ObjectMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Long2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2ObjectMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Long2ObjectMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Long2ObjectMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Long2ObjectMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Long2ObjectOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Long2ObjectOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2ObjectRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2ObjectSortedMap<V> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2ObjectSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Long2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2ObjectSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Long2ObjectSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Long2ObjectSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Long2ObjectSortedMaps.UnmodifiableSortedMap<V> |
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.
|
| Long2ReferenceFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Long2ShortArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Long2ShortAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Long2ShortFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Long2ShortFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Long2ShortFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Long2ShortFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Long2ShortFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Long2ShortFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Long2ShortLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Long2ShortMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Long2ShortMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Long2ShortMap.FastEntrySet |
An entry set providing fast iteration.
|
| Long2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Long2ShortMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Long2ShortMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Long2ShortMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Long2ShortMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Long2ShortOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Long2ShortOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Long2ShortRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Long2ShortSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Long2ShortSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Long2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Long2ShortSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Long2ShortSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Long2ShortSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Long2ShortSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| LongArrayFIFOQueue |
A type-specific array-based FIFO queue, supporting also deque operations.
|
| LongArrayFrontCodedBigList |
Compact storage of big lists of arrays using front coding.
|
| LongArrayFrontCodedList |
Compact storage of lists of arrays using front coding.
|
| LongArrayIndirectPriorityQueue |
A type-specific array-based semi-indirect priority queue.
|
| LongArrayList |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| LongArrayPriorityQueue |
A type-specific array-based priority queue.
|
| LongArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| LongArraySet |
A simple, brute-force implementation of a set based on a backing array.
|
| LongAVLTreeSet |
A type-specific AVL tree set with a fast, small-footprint implementation.
|
| LongBidirectionalIterable |
|
| LongBidirectionalIterator |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| LongBigArrayBigList |
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| LongBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| LongBigList |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongBigListIterator |
|
| LongBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| LongBigListIterators.BigListIteratorListIterator |
A class exposing a list iterator as a big-list iterator..
|
| LongBigListIterators.EmptyBigListIterator |
A class returning no elements and a type-specific big list iterator interface.
|
| LongBigListIterators.UnmodifiableBigListIterator |
An unmodifiable wrapper class for big list iterators.
|
| LongBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| LongBigLists.EmptyBigList |
An immutable class representing an empty type-specific big list.
|
| LongBigLists.ListBigList |
A class exposing a list as a big list.
|
| LongBigLists.Singleton |
An immutable class representing a type-specific singleton big list.
|
| LongBigLists.SynchronizedBigList |
A synchronized wrapper class for big lists.
|
| LongBigLists.UnmodifiableBigList |
An unmodifiable wrapper class for big lists.
|
| LongCollection |
A type-specific Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| LongCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| LongCollections.EmptyCollection |
An immutable class representing an empty type-specific collection.
|
| LongCollections.IterableCollection |
A collection wrapper class for iterables.
|
| LongCollections.SynchronizedCollection |
A synchronized wrapper class for collections.
|
| LongCollections.UnmodifiableCollection |
An unmodifiable wrapper class for collections.
|
| LongComparator |
A type-specific Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| LongComparators |
A class providing static methods and objects that do useful things with comparators.
|
| LongConsumer |
A type-specific Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| LongHash |
A type-specific Hash interface. |
| LongHash.Strategy |
A type-specific hash strategy.
|
| LongHeapIndirectPriorityQueue |
A type-specific heap-based indirect priority queue.
|
| LongHeapPriorityQueue |
A type-specific heap-based priority queue.
|
| LongHeaps |
A class providing static methods and objects that do useful things with heaps.
|
| LongHeapSemiIndirectPriorityQueue |
A type-specific heap-based semi-indirect priority queue.
|
| LongIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| LongIndirectPriorityQueue |
|
| LongIterable |
|
| LongIterator |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| LongIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| LongIterators.EmptyIterator |
A class returning no elements and a type-specific iterator interface.
|
| LongIterators.UnmodifiableBidirectionalIterator |
An unmodifiable wrapper class for bidirectional iterators.
|
| LongIterators.UnmodifiableIterator |
An unmodifiable wrapper class for iterators.
|
| LongIterators.UnmodifiableListIterator |
An unmodifiable wrapper class for list iterators.
|
| LongLinkedOpenCustomHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| LongLinkedOpenHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| LongList |
A type-specific List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongListIterator |
A type-specific bidirectional iterator that is also a ListIterator. |
| LongLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| LongLists.EmptyList |
An immutable class representing an empty type-specific list.
|
| LongLists.Singleton |
An immutable class representing a type-specific singleton list.
|
| LongLists.SynchronizedList |
A synchronized wrapper class for lists.
|
| LongLists.SynchronizedRandomAccessList |
A synchronized wrapper class for random-access lists.
|
| LongLists.UnmodifiableList |
An unmodifiable wrapper class for lists.
|
| LongLists.UnmodifiableRandomAccessList |
An unmodifiable wrapper class for random-access lists.
|
| LongOpenCustomHashSet |
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| LongOpenHashBigSet |
A type-specific hash big set with with a fast, small-footprint implementation.
|
| LongOpenHashSet |
A type-specific hash set with with a fast, small-footprint implementation.
|
| LongPriorityQueue |
A type-specific PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongPriorityQueues |
A class providing static methods and objects that do useful things with type-specific priority queues.
|
| LongPriorityQueues.SynchronizedPriorityQueue |
A synchronized wrapper class for priority queues.
|
| LongRBTreeSet |
A type-specific red-black tree set with a fast, small-footprint implementation.
|
| LongSemiIndirectHeaps |
A class providing static methods and objects that do useful things with semi-indirect heaps.
|
| LongSet |
A type-specific Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| LongSets.EmptySet |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| LongSets.Singleton |
An immutable class representing a type-specific singleton set.
|
| LongSets.SynchronizedSet |
A synchronized wrapper class for sets.
|
| LongSets.UnmodifiableSet |
An unmodifiable wrapper class for sets.
|
| LongSortedSet |
A type-specific SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| LongSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| LongSortedSets.EmptySet |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| LongSortedSets.Singleton |
A class representing a singleton sorted set.
|
| LongSortedSets.SynchronizedSortedSet |
A synchronized wrapper class for sorted sets.
|
| LongSortedSets.UnmodifiableSortedSet |
An unmodifiable wrapper class for sorted sets.
|
| LongStack |
A type-specific Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| MeasurableInputStream |
|
| MeasurableOutputStream |
|
| MeasurableStream |
An stream that provides eager access to its length,
and keeps track of the current position (e.g., the number of bytes read so far, or the current
position of the file pointer).
|
| Object2BooleanArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2BooleanAVLTreeMap<K> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2BooleanFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2BooleanFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Object2BooleanFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Object2BooleanFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Object2BooleanFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Object2BooleanFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Object2BooleanLinkedOpenCustomHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2BooleanLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2BooleanMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2BooleanMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2BooleanMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Object2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2BooleanMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Object2BooleanMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Object2BooleanMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Object2BooleanMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Object2BooleanOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Object2BooleanOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2BooleanRBTreeMap<K> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2BooleanSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2BooleanSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Object2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2BooleanSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Object2BooleanSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2BooleanSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Object2BooleanSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Object2ByteFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Object2CharFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Object2DoubleArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2DoubleAVLTreeMap<K> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2DoubleFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2DoubleFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Object2DoubleFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Object2DoubleFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Object2DoubleFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Object2DoubleFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Object2DoubleLinkedOpenCustomHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2DoubleLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2DoubleMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2DoubleMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2DoubleMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Object2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2DoubleMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Object2DoubleMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Object2DoubleMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Object2DoubleMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Object2DoubleOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Object2DoubleOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2DoubleRBTreeMap<K> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2DoubleSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2DoubleSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Object2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2DoubleSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Object2DoubleSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2DoubleSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Object2DoubleSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Object2FloatArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2FloatAVLTreeMap<K> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2FloatFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2FloatFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Object2FloatFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Object2FloatFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Object2FloatFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Object2FloatFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Object2FloatLinkedOpenCustomHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2FloatLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2FloatMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2FloatMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2FloatMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Object2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2FloatMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Object2FloatMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Object2FloatMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Object2FloatMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Object2FloatOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Object2FloatOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2FloatRBTreeMap<K> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2FloatSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2FloatSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Object2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2FloatSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Object2FloatSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2FloatSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Object2FloatSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Object2IntArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2IntAVLTreeMap<K> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2IntFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2IntFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Object2IntFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Object2IntFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Object2IntFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Object2IntFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Object2IntLinkedOpenCustomHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2IntLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2IntMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2IntMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2IntMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Object2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2IntMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Object2IntMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Object2IntMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Object2IntMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Object2IntOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Object2IntOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2IntRBTreeMap<K> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2IntSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2IntSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Object2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2IntSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Object2IntSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2IntSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Object2IntSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Object2LongArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2LongAVLTreeMap<K> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2LongFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2LongFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Object2LongFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Object2LongFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Object2LongFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Object2LongFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Object2LongLinkedOpenCustomHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2LongLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2LongMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2LongMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2LongMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Object2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2LongMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Object2LongMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Object2LongMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Object2LongMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Object2LongOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Object2LongOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2LongRBTreeMap<K> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2LongSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2LongSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Object2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2LongSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Object2LongSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2LongSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Object2LongSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Object2ObjectArrayMap<K,V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2ObjectAVLTreeMap<K,V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2ObjectFunction<K,V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2ObjectFunctions.EmptyFunction<K,V> |
An immutable class representing an empty type-specific function.
|
| Object2ObjectFunctions.Singleton<K,V> |
An immutable class representing a type-specific singleton function.
|
| Object2ObjectFunctions.SynchronizedFunction<K,V> |
A synchronized wrapper class for functions.
|
| Object2ObjectFunctions.UnmodifiableFunction<K,V> |
An unmodifiable wrapper class for functions.
|
| Object2ObjectLinkedOpenCustomHashMap<K,V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ObjectLinkedOpenHashMap<K,V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ObjectMap<K,V> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2ObjectMap.Entry<K,V> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2ObjectMap.FastEntrySet<K,V> |
An entry set providing fast iteration.
|
| Object2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2ObjectMaps.EmptyMap<K,V> |
An immutable class representing an empty type-specific map.
|
| Object2ObjectMaps.Singleton<K,V> |
An immutable class representing a type-specific singleton map.
|
| Object2ObjectMaps.SynchronizedMap<K,V> |
A synchronized wrapper class for maps.
|
| Object2ObjectMaps.UnmodifiableMap<K,V> |
An unmodifiable wrapper class for maps.
|
| Object2ObjectOpenCustomHashMap<K,V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Object2ObjectOpenHashMap<K,V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2ObjectRBTreeMap<K,V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2ObjectSortedMap<K,V> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ObjectSortedMap.FastSortedEntrySet<K,V> |
A sorted entry set providing fast iteration.
|
| Object2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2ObjectSortedMaps.EmptySortedMap<K,V> |
An immutable class representing an empty type-specific sorted map.
|
| Object2ObjectSortedMaps.Singleton<K,V> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2ObjectSortedMaps.SynchronizedSortedMap<K,V> |
A synchronized wrapper class for sorted maps.
|
| Object2ObjectSortedMaps.UnmodifiableSortedMap<K,V> |
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.
|
| Object2ReferenceFunction<K,V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Object2ShortArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2ShortAVLTreeMap<K> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2ShortFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Object2ShortFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Object2ShortFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Object2ShortFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Object2ShortFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Object2ShortFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Object2ShortLinkedOpenCustomHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ShortLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ShortMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2ShortMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2ShortMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Object2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Object2ShortMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Object2ShortMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Object2ShortMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Object2ShortMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Object2ShortOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Object2ShortOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2ShortRBTreeMap<K> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2ShortSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ShortSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Object2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Object2ShortSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Object2ShortSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Object2ShortSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Object2ShortSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| ObjectArrayFIFOQueue<K> |
A type-specific array-based FIFO queue, supporting also deque operations.
|
| ObjectArrayIndirectPriorityQueue<K> |
A type-specific array-based semi-indirect priority queue.
|
| ObjectArrayList<K> |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ObjectArrayPriorityQueue<K> |
A type-specific array-based priority queue.
|
| ObjectArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| ObjectArraySet<K> |
A simple, brute-force implementation of a set based on a backing array.
|
| ObjectAVLTreeSet<K> |
A type-specific AVL tree set with a fast, small-footprint implementation.
|
| ObjectBidirectionalIterable<K> |
|
| ObjectBidirectionalIterator<K> |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectBigArrayBigList<K> |
A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ObjectBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| ObjectBigList<K> |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectBigListIterator<K> |
|
| ObjectBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| ObjectBigListIterators.BigListIteratorListIterator<K> |
A class exposing a list iterator as a big-list iterator..
|
| ObjectBigListIterators.EmptyBigListIterator<K> |
A class returning no elements and a type-specific big list iterator interface.
|
| ObjectBigListIterators.UnmodifiableBigListIterator<K> |
An unmodifiable wrapper class for big list iterators.
|
| ObjectBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| ObjectBigLists.EmptyBigList<K> |
An immutable class representing an empty type-specific big list.
|
| ObjectBigLists.ListBigList<K> |
A class exposing a list as a big list.
|
| ObjectBigLists.Singleton<K> |
An immutable class representing a type-specific singleton big list.
|
| ObjectBigLists.SynchronizedBigList<K> |
A synchronized wrapper class for big lists.
|
| ObjectBigLists.UnmodifiableBigList<K> |
An unmodifiable wrapper class for big lists.
|
| ObjectCollection<K> |
A type-specific Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| ObjectCollections.EmptyCollection<K> |
An immutable class representing an empty type-specific collection.
|
| ObjectCollections.IterableCollection<K> |
A collection wrapper class for iterables.
|
| ObjectCollections.SynchronizedCollection<K> |
A synchronized wrapper class for collections.
|
| ObjectCollections.UnmodifiableCollection<K> |
An unmodifiable wrapper class for collections.
|
| ObjectComparators |
A class providing static methods and objects that do useful things with comparators.
|
| ObjectHeapIndirectPriorityQueue<K> |
A type-specific heap-based indirect priority queue.
|
| ObjectHeapPriorityQueue<K> |
A type-specific heap-based priority queue.
|
| ObjectHeaps |
A class providing static methods and objects that do useful things with heaps.
|
| ObjectHeapSemiIndirectPriorityQueue<K> |
A type-specific heap-based semi-indirect priority queue.
|
| ObjectIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| ObjectIterable<K> |
|
| ObjectIterator<K> |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| ObjectIterators.EmptyIterator<K> |
A class returning no elements and a type-specific iterator interface.
|
| ObjectIterators.UnmodifiableBidirectionalIterator<K> |
An unmodifiable wrapper class for bidirectional iterators.
|
| ObjectIterators.UnmodifiableIterator<K> |
An unmodifiable wrapper class for iterators.
|
| ObjectIterators.UnmodifiableListIterator<K> |
An unmodifiable wrapper class for list iterators.
|
| ObjectLinkedOpenCustomHashSet<K> |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ObjectLinkedOpenHashSet<K> |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ObjectList<K> |
A type-specific List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectListIterator<K> |
A type-specific bidirectional iterator that is also a ListIterator. |
| ObjectLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| ObjectLists.EmptyList<K> |
An immutable class representing an empty type-specific list.
|
| ObjectLists.Singleton<K> |
An immutable class representing a type-specific singleton list.
|
| ObjectLists.SynchronizedList<K> |
A synchronized wrapper class for lists.
|
| ObjectLists.SynchronizedRandomAccessList<K> |
A synchronized wrapper class for random-access lists.
|
| ObjectLists.UnmodifiableList<K> |
An unmodifiable wrapper class for lists.
|
| ObjectLists.UnmodifiableRandomAccessList<K> |
An unmodifiable wrapper class for random-access lists.
|
| ObjectOpenCustomHashSet<K> |
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| ObjectOpenHashBigSet<K> |
A type-specific hash big set with with a fast, small-footprint implementation.
|
| ObjectOpenHashSet<K> |
A type-specific hash set with with a fast, small-footprint implementation.
|
| ObjectRBTreeSet<K> |
A type-specific red-black tree set with a fast, small-footprint implementation.
|
| ObjectSemiIndirectHeaps |
A class providing static methods and objects that do useful things with semi-indirect heaps.
|
| ObjectSet<K> |
A type-specific Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| ObjectSets.EmptySet<K> |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| ObjectSets.Singleton<K> |
An immutable class representing a type-specific singleton set.
|
| ObjectSets.SynchronizedSet<K> |
A synchronized wrapper class for sets.
|
| ObjectSets.UnmodifiableSet<K> |
An unmodifiable wrapper class for sets.
|
| ObjectSortedSet<K> |
A type-specific SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| ObjectSortedSets.EmptySet<K> |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| ObjectSortedSets.Singleton<K> |
A class representing a singleton sorted set.
|
| ObjectSortedSets.SynchronizedSortedSet<K> |
A synchronized wrapper class for sorted sets.
|
| ObjectSortedSets.UnmodifiableSortedSet<K> |
An unmodifiable wrapper class for sorted sets.
|
| PriorityQueue<K> |
A priority queue.
|
| PriorityQueues |
A class providing static methods and objects that do useful things with priority queues.
|
| PriorityQueues.EmptyPriorityQueue |
An immutable class representing the empty priority queue.
|
| PriorityQueues.SynchronizedPriorityQueue<K> |
A synchronized wrapper class for priority queues.
|
| Reference2BooleanArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2BooleanFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2BooleanFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Reference2BooleanFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Reference2BooleanFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Reference2BooleanFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Reference2BooleanFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Reference2BooleanLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2BooleanMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2BooleanMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2BooleanMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Reference2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2BooleanMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Reference2BooleanMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Reference2BooleanMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Reference2BooleanMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Reference2BooleanOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Reference2BooleanOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2BooleanSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2BooleanSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Reference2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2BooleanSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2BooleanSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2BooleanSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Reference2BooleanSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| Reference2DoubleFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Reference2FloatArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2FloatFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2FloatFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Reference2FloatFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Reference2FloatFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Reference2FloatFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Reference2FloatFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Reference2FloatLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2FloatMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2FloatMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2FloatMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Reference2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2FloatMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Reference2FloatMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Reference2FloatMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Reference2FloatMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Reference2FloatOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Reference2FloatOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2FloatSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2FloatSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Reference2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2FloatSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2FloatSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2FloatSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Reference2FloatSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| Reference2IntArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2IntFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Reference2LongFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Reference2ObjectFunction<K,V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.
|
| Reference2ShortArrayMap<K> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2ShortFunction<K> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Reference2ShortFunctions.EmptyFunction<K> |
An immutable class representing an empty type-specific function.
|
| Reference2ShortFunctions.PrimitiveFunction<K> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Reference2ShortFunctions.Singleton<K> |
An immutable class representing a type-specific singleton function.
|
| Reference2ShortFunctions.SynchronizedFunction<K> |
A synchronized wrapper class for functions.
|
| Reference2ShortFunctions.UnmodifiableFunction<K> |
An unmodifiable wrapper class for functions.
|
| Reference2ShortLinkedOpenHashMap<K> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2ShortMap<K> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2ShortMap.Entry<K> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2ShortMap.FastEntrySet<K> |
An entry set providing fast iteration.
|
| Reference2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Reference2ShortMaps.EmptyMap<K> |
An immutable class representing an empty type-specific map.
|
| Reference2ShortMaps.Singleton<K> |
An immutable class representing a type-specific singleton map.
|
| Reference2ShortMaps.SynchronizedMap<K> |
A synchronized wrapper class for maps.
|
| Reference2ShortMaps.UnmodifiableMap<K> |
An unmodifiable wrapper class for maps.
|
| Reference2ShortOpenCustomHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Reference2ShortOpenHashMap<K> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2ShortSortedMap<K> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ShortSortedMap.FastSortedEntrySet<K> |
A sorted entry set providing fast iteration.
|
| Reference2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Reference2ShortSortedMaps.EmptySortedMap<K> |
An immutable class representing an empty type-specific sorted map.
|
| Reference2ShortSortedMaps.Singleton<K> |
An immutable class representing a type-specific singleton sorted map.
|
| Reference2ShortSortedMaps.SynchronizedSortedMap<K> |
A synchronized wrapper class for sorted maps.
|
| Reference2ShortSortedMaps.UnmodifiableSortedMap<K> |
An unmodifiable wrapper class for sorted maps.
|
| 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.
|
| 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.
|
| ReferenceCollections.SynchronizedCollection<K> |
A synchronized wrapper class for collections.
|
| ReferenceCollections.UnmodifiableCollection<K> |
An unmodifiable wrapper class for collections.
|
| 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.
|
| 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.
|
| 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.
|
| RepositionableStream |
A basic interface specifying positioning methods for a byte stream.
|
| SafeMath |
|
| Short2BooleanArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2BooleanAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2BooleanFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2BooleanFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2BooleanFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Short2BooleanFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2BooleanFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Short2BooleanFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Short2BooleanFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Short2BooleanLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2BooleanMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2BooleanMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2BooleanMap.FastEntrySet |
An entry set providing fast iteration.
|
| Short2BooleanMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2BooleanMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Short2BooleanMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Short2BooleanMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Short2BooleanMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Short2BooleanOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2BooleanOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2BooleanRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2BooleanSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2BooleanSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Short2BooleanSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2BooleanSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Short2BooleanSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Short2BooleanSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Short2BooleanSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Short2ByteArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2ByteAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2ByteFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ByteFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2ByteFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Short2ByteFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2ByteFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Short2ByteFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Short2ByteFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Short2ByteLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2ByteMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2ByteMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2ByteMap.FastEntrySet |
An entry set providing fast iteration.
|
| Short2ByteMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2ByteMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Short2ByteMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Short2ByteMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Short2ByteMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Short2ByteOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2ByteOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2ByteRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2ByteSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ByteSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Short2ByteSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2ByteSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Short2ByteSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Short2ByteSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Short2ByteSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Short2CharArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2CharAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2CharFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2CharFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2CharFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Short2CharFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2CharFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Short2CharFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Short2CharFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Short2CharLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2CharMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2CharMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2CharMap.FastEntrySet |
An entry set providing fast iteration.
|
| Short2CharMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2CharMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Short2CharMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Short2CharMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Short2CharMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Short2CharOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2CharOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2CharRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2CharSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2CharSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Short2CharSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2CharSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Short2CharSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Short2CharSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Short2CharSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Short2DoubleArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2DoubleAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2DoubleFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2DoubleFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2DoubleFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Short2DoubleFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2DoubleFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Short2DoubleFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Short2DoubleFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Short2DoubleLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2DoubleMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2DoubleMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2DoubleMap.FastEntrySet |
An entry set providing fast iteration.
|
| Short2DoubleMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2DoubleMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Short2DoubleMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Short2DoubleMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Short2DoubleMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Short2DoubleOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2DoubleOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2DoubleRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2DoubleSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2DoubleSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Short2DoubleSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2DoubleSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Short2DoubleSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Short2DoubleSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Short2DoubleSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Short2FloatArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2FloatAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2FloatFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2FloatFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2FloatFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Short2FloatFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2FloatFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Short2FloatFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Short2FloatFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Short2FloatLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2FloatMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2FloatMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2FloatMap.FastEntrySet |
An entry set providing fast iteration.
|
| Short2FloatMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2FloatMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Short2FloatMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Short2FloatMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Short2FloatMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Short2FloatOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2FloatOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2FloatRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2FloatSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2FloatSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Short2FloatSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2FloatSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Short2FloatSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Short2FloatSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Short2FloatSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Short2IntArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2IntAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2IntFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2IntFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2IntFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Short2IntFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2IntFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Short2IntFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Short2IntFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Short2IntLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2IntMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2IntMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2IntMap.FastEntrySet |
An entry set providing fast iteration.
|
| Short2IntMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2IntMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Short2IntMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Short2IntMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Short2IntMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Short2IntOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2IntOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2IntRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2IntSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2IntSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Short2IntSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2IntSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Short2IntSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Short2IntSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Short2IntSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Short2LongArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2LongAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2LongFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2LongFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2LongFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Short2LongFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2LongFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Short2LongFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Short2LongFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Short2LongLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2LongMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2LongMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2LongMap.FastEntrySet |
An entry set providing fast iteration.
|
| Short2LongMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2LongMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Short2LongMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Short2LongMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Short2LongMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Short2LongOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2LongOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2LongRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2LongSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2LongSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Short2LongSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2LongSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Short2LongSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Short2LongSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Short2LongSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| Short2ObjectArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2ObjectAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2ObjectFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ObjectFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2ObjectFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Short2ObjectFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2ObjectFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Short2ObjectFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Short2ObjectFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Short2ObjectLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2ObjectMap<V> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2ObjectMap.Entry<V> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2ObjectMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Short2ObjectMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2ObjectMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Short2ObjectMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Short2ObjectMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Short2ObjectMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Short2ObjectOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2ObjectOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2ObjectRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2ObjectSortedMap<V> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ObjectSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Short2ObjectSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2ObjectSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Short2ObjectSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Short2ObjectSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Short2ObjectSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| Short2ReferenceArrayMap<V> |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2ReferenceAVLTreeMap<V> |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2ReferenceFunction<V> |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ReferenceFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2ReferenceFunctions.EmptyFunction<V> |
An immutable class representing an empty type-specific function.
|
| Short2ReferenceFunctions.PrimitiveFunction<V> |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2ReferenceFunctions.Singleton<V> |
An immutable class representing a type-specific singleton function.
|
| Short2ReferenceFunctions.SynchronizedFunction<V> |
A synchronized wrapper class for functions.
|
| Short2ReferenceFunctions.UnmodifiableFunction<V> |
An unmodifiable wrapper class for functions.
|
| Short2ReferenceLinkedOpenHashMap<V> |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2ReferenceMap<V> |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2ReferenceMap.Entry<V> |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2ReferenceMap.FastEntrySet<V> |
An entry set providing fast iteration.
|
| Short2ReferenceMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2ReferenceMaps.EmptyMap<V> |
An immutable class representing an empty type-specific map.
|
| Short2ReferenceMaps.Singleton<V> |
An immutable class representing a type-specific singleton map.
|
| Short2ReferenceMaps.SynchronizedMap<V> |
A synchronized wrapper class for maps.
|
| Short2ReferenceMaps.UnmodifiableMap<V> |
An unmodifiable wrapper class for maps.
|
| Short2ReferenceOpenCustomHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2ReferenceOpenHashMap<V> |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2ReferenceRBTreeMap<V> |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2ReferenceSortedMap<V> |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ReferenceSortedMap.FastSortedEntrySet<V> |
A sorted entry set providing fast iteration.
|
| Short2ReferenceSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2ReferenceSortedMaps.EmptySortedMap<V> |
An immutable class representing an empty type-specific sorted map.
|
| Short2ReferenceSortedMaps.Singleton<V> |
An immutable class representing a type-specific singleton sorted map.
|
| Short2ReferenceSortedMaps.SynchronizedSortedMap<V> |
A synchronized wrapper class for sorted maps.
|
| Short2ReferenceSortedMaps.UnmodifiableSortedMap<V> |
An unmodifiable wrapper class for sorted maps.
|
| Short2ShortArrayMap |
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Short2ShortAVLTreeMap |
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Short2ShortFunction |
A type-specific Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ShortFunctions |
A class providing static methods and objects that do useful things with type-specific functions.
|
| Short2ShortFunctions.EmptyFunction |
An immutable class representing an empty type-specific function.
|
| Short2ShortFunctions.PrimitiveFunction |
An adapter for mapping generic total functions to partial primitive functions.
|
| Short2ShortFunctions.Singleton |
An immutable class representing a type-specific singleton function.
|
| Short2ShortFunctions.SynchronizedFunction |
A synchronized wrapper class for functions.
|
| Short2ShortFunctions.UnmodifiableFunction |
An unmodifiable wrapper class for functions.
|
| Short2ShortLinkedOpenHashMap |
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Short2ShortMap |
A type-specific Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Short2ShortMap.Entry |
A type-specific Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Short2ShortMap.FastEntrySet |
An entry set providing fast iteration.
|
| Short2ShortMaps |
A class providing static methods and objects that do useful things with type-specific maps.
|
| Short2ShortMaps.EmptyMap |
An immutable class representing an empty type-specific map.
|
| Short2ShortMaps.Singleton |
An immutable class representing a type-specific singleton map.
|
| Short2ShortMaps.SynchronizedMap |
A synchronized wrapper class for maps.
|
| Short2ShortMaps.UnmodifiableMap |
An unmodifiable wrapper class for maps.
|
| Short2ShortOpenCustomHashMap |
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| Short2ShortOpenHashMap |
A type-specific hash map with a fast, small-footprint implementation.
|
| Short2ShortRBTreeMap |
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Short2ShortSortedMap |
A type-specific SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Short2ShortSortedMap.FastSortedEntrySet |
A sorted entry set providing fast iteration.
|
| Short2ShortSortedMaps |
A class providing static methods and objects that do useful things with type-specific sorted maps.
|
| Short2ShortSortedMaps.EmptySortedMap |
An immutable class representing an empty type-specific sorted map.
|
| Short2ShortSortedMaps.Singleton |
An immutable class representing a type-specific singleton sorted map.
|
| Short2ShortSortedMaps.SynchronizedSortedMap |
A synchronized wrapper class for sorted maps.
|
| Short2ShortSortedMaps.UnmodifiableSortedMap |
An unmodifiable wrapper class for sorted maps.
|
| ShortArrayFIFOQueue |
A type-specific array-based FIFO queue, supporting also deque operations.
|
| ShortArrayFrontCodedBigList |
Compact storage of big lists of arrays using front coding.
|
| ShortArrayFrontCodedList |
Compact storage of lists of arrays using front coding.
|
| ShortArrayIndirectPriorityQueue |
A type-specific array-based semi-indirect priority queue.
|
| ShortArrayList |
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ShortArrayPriorityQueue |
A type-specific array-based priority queue.
|
| ShortArrays |
A class providing static methods and objects that do useful things with type-specific arrays.
|
| ShortArraySet |
A simple, brute-force implementation of a set based on a backing array.
|
| ShortAVLTreeSet |
A type-specific AVL tree set with a fast, small-footprint implementation.
|
| ShortBidirectionalIterable |
|
| ShortBidirectionalIterator |
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ShortBigArrayBigList |
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ShortBigArrays |
A class providing static methods and objects that do useful things with big arrays. |
| ShortBigList |
A type-specific BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ShortBigListIterator |
|
| ShortBigListIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| ShortBigListIterators.BigListIteratorListIterator |
A class exposing a list iterator as a big-list iterator..
|
| ShortBigListIterators.EmptyBigListIterator |
A class returning no elements and a type-specific big list iterator interface.
|
| ShortBigListIterators.UnmodifiableBigListIterator |
An unmodifiable wrapper class for big list iterators.
|
| ShortBigLists |
A class providing static methods and objects that do useful things with type-specific big lists.
|
| ShortBigLists.EmptyBigList |
An immutable class representing an empty type-specific big list.
|
| ShortBigLists.ListBigList |
A class exposing a list as a big list.
|
| ShortBigLists.Singleton |
An immutable class representing a type-specific singleton big list.
|
| ShortBigLists.SynchronizedBigList |
A synchronized wrapper class for big lists.
|
| ShortBigLists.UnmodifiableBigList |
An unmodifiable wrapper class for big lists.
|
| ShortCollection |
A type-specific Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ShortCollections |
A class providing static methods and objects that do useful things with type-specific collections.
|
| ShortCollections.EmptyCollection |
An immutable class representing an empty type-specific collection.
|
| ShortCollections.IterableCollection |
A collection wrapper class for iterables.
|
| ShortCollections.SynchronizedCollection |
A synchronized wrapper class for collections.
|
| ShortCollections.UnmodifiableCollection |
An unmodifiable wrapper class for collections.
|
| ShortComparator |
A type-specific Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| ShortComparators |
A class providing static methods and objects that do useful things with comparators.
|
| ShortConsumer |
A type-specific Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| ShortHash |
A type-specific Hash interface. |
| ShortHash.Strategy |
A type-specific hash strategy.
|
| ShortHeapIndirectPriorityQueue |
A type-specific heap-based indirect priority queue.
|
| ShortHeapPriorityQueue |
A type-specific heap-based priority queue.
|
| ShortHeaps |
A class providing static methods and objects that do useful things with heaps.
|
| ShortHeapSemiIndirectPriorityQueue |
A type-specific heap-based semi-indirect priority queue.
|
| ShortIndirectHeaps |
A class providing static methods and objects that do useful things with indirect heaps.
|
| ShortIndirectPriorityQueue |
|
| ShortIterable |
|
| ShortIterator |
A type-specific Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ShortIterators |
A class providing static methods and objects that do useful things with type-specific iterators.
|
| ShortIterators.EmptyIterator |
A class returning no elements and a type-specific iterator interface.
|
| ShortIterators.UnmodifiableBidirectionalIterator |
An unmodifiable wrapper class for bidirectional iterators.
|
| ShortIterators.UnmodifiableIterator |
An unmodifiable wrapper class for iterators.
|
| ShortIterators.UnmodifiableListIterator |
An unmodifiable wrapper class for list iterators.
|
| ShortLinkedOpenCustomHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ShortLinkedOpenHashSet |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ShortList |
A type-specific List; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ShortListIterator |
A type-specific bidirectional iterator that is also a ListIterator. |
| ShortLists |
A class providing static methods and objects that do useful things with type-specific lists.
|
| ShortLists.EmptyList |
An immutable class representing an empty type-specific list.
|
| ShortLists.Singleton |
An immutable class representing a type-specific singleton list.
|
| ShortLists.SynchronizedList |
A synchronized wrapper class for lists.
|
| ShortLists.SynchronizedRandomAccessList |
A synchronized wrapper class for random-access lists.
|
| ShortLists.UnmodifiableList |
An unmodifiable wrapper class for lists.
|
| ShortLists.UnmodifiableRandomAccessList |
An unmodifiable wrapper class for random-access lists.
|
| ShortOpenCustomHashSet |
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time. |
| ShortOpenHashSet |
A type-specific hash set with with a fast, small-footprint implementation.
|
| ShortPriorityQueue |
A type-specific PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ShortPriorityQueues |
A class providing static methods and objects that do useful things with type-specific priority queues.
|
| ShortPriorityQueues.SynchronizedPriorityQueue |
A synchronized wrapper class for priority queues.
|
| ShortRBTreeSet |
A type-specific red-black tree set with a fast, small-footprint implementation.
|
| ShortSemiIndirectHeaps |
A class providing static methods and objects that do useful things with semi-indirect heaps.
|
| ShortSet |
A type-specific Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ShortSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| ShortSets.EmptySet |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| ShortSets.Singleton |
An immutable class representing a type-specific singleton set.
|
| ShortSets.SynchronizedSet |
A synchronized wrapper class for sets.
|
| ShortSets.UnmodifiableSet |
An unmodifiable wrapper class for sets.
|
| ShortSortedSet |
A type-specific SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ShortSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| ShortSortedSets.EmptySet |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| ShortSortedSets.Singleton |
A class representing a singleton sorted set.
|
| ShortSortedSets.SynchronizedSortedSet |
A synchronized wrapper class for sorted sets.
|
| ShortSortedSets.UnmodifiableSortedSet |
An unmodifiable wrapper class for sorted sets.
|
| ShortStack |
A type-specific Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Size64 |
|
| Stack<K> |
A stack.
|
| Swapper |
An object that can swap elements whose position is specified by integers.
|
| TextIO |
Provides static methods to perform easily textual I/O.
|