| Package | Description |
|---|---|
| it.unimi.dsi.fastutil |
Provides static data/methods used by all implementations and some non-type-specific classes
that do not belong to
it.unimi.dsi.fastutil.objects. |
| it.unimi.dsi.fastutil.bytes |
Provides type-specific classes for byte elements or keys.
|
| it.unimi.dsi.fastutil.chars |
Provides type-specific classes for character elements or keys.
|
| it.unimi.dsi.fastutil.doubles |
Provides type-specific classes for double elements or keys.
|
| it.unimi.dsi.fastutil.floats |
Provides type-specific classes for float elements or keys.
|
| it.unimi.dsi.fastutil.ints |
Provides type-specific classes for integer elements or keys.
|
| it.unimi.dsi.fastutil.io |
Provides classes and static methods that make object and primitive-type I/O easier and faster.
|
| it.unimi.dsi.fastutil.longs |
Provides type-specific classes for long elements or keys.
|
| it.unimi.dsi.fastutil.objects |
Provides type-specific classes for object elements or keys.
|
| it.unimi.dsi.fastutil.shorts |
Provides type-specific classes for short elements or keys.
|
| Class and Description |
|---|
| IntComparator
A type-specific
Comparator; provides methods to compare two primitive types both as objects
and as primitive types. |
| Class and Description |
|---|
| AbstractIntCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| IntCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractIntCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| IntCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractIntCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| IntCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractIntCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| IntCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| AbstractInt2LongSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2ObjectFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2ObjectMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2ObjectSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractInt2ReferenceFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractInt2ReferenceMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractInt2ReferenceSortedMap
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.
|
| AbstractInt2ShortSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractIntBidirectionalIterator
Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractIntBigList
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractIntCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractIntIterator
Deprecated.
As of fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.
|
| AbstractIntList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| 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.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Int2ObjectArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2ObjectAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2ObjectFunction
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ObjectFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Int2ObjectFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Int2ObjectFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Int2ObjectFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Int2ObjectLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2ObjectMap
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2ObjectMap.Entry
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2ObjectMap.FastEntrySet
An entry set providing fast iteration.
|
| Int2ObjectMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Int2ObjectMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Int2ObjectMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Int2ObjectMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Int2ObjectOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Int2ObjectOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2ObjectRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2ObjectSortedMap
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ObjectSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Int2ObjectSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Int2ReferenceArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Int2ReferenceAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Int2ReferenceFunction
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ReferenceFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Int2ReferenceFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Int2ReferenceFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Int2ReferenceFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Int2ReferenceLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Int2ReferenceMap
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Int2ReferenceMap.Entry
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Int2ReferenceMap.FastEntrySet
An entry set providing fast iteration.
|
| Int2ReferenceMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Int2ReferenceMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Int2ReferenceMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Int2ReferenceMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Int2ReferenceOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Int2ReferenceOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Int2ReferenceRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Int2ReferenceSortedMap
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Int2ReferenceSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Int2ReferenceSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| IntArrayFrontCodedList
Compact storage of lists of arrays using front coding.
|
| IntArrayList
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| IntArrays.Segment |
| IntArraySet
A simple, brute-force implementation of a set based on a backing array.
|
| IntBidirectionalIterable
A type-specific
Iterable that further strengthens the specification of Iterable.iterator(). |
| 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.
|
| IntBigList
A type-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| IntBigListIterator
A type-specific
BigListIterator. |
| IntBigListIterators.EmptyBigListIterator
A class returning no elements and a type-specific big list iterator interface.
|
| IntBigLists.EmptyBigList
An immutable class representing an empty type-specific big list.
|
| IntCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntCollections.EmptyCollection
An immutable class representing an empty type-specific collection.
|
| 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. |
| IntConsumer
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| IntHash.Strategy
A type-specific hash strategy.
|
| IntHeapSemiIndirectPriorityQueue
A type-specific heap-based semi-indirect priority queue.
|
| IntIndirectPriorityQueue
A type-specific
IndirectPriorityQueue. |
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| IntIterators.EmptyIterator
A class returning no elements and a type-specific iterator interface.
|
| 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.EmptyList
An immutable class representing an empty type-specific list.
|
| IntLists.SynchronizedList
A synchronized wrapper class for lists.
|
| IntLists.UnmodifiableList
An unmodifiable wrapper class for 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. |
| IntSet
A type-specific
Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.EmptySet
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| IntStack
A type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Class and Description |
|---|
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractIntCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| IntCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractIntCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| IntCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractIntCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| IntCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| IntIterable
A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer). |
| IntIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Copyright © 2020. All rights reserved.