| Interface | Description |
|---|---|
| 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.
|
| 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.
|
| Class | Description |
|---|---|
| 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.
|
| AbstractObject2IntSortedMap.KeySetIterator<K> |
A wrapper exhibiting a map iterator as an iterator on keys.
|
| AbstractObject2IntSortedMap.ValuesIterator<K> |
A wrapper exhibiting a map iterator as an iterator on values.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|