| Package | Description |
|---|---|
| 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 |
|---|
| AbstractDoubleCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| DoubleCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractDoubleCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| DoubleCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| 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.
|
| AbstractDouble2LongSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDouble2ObjectFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2ObjectMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2ObjectSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDouble2ReferenceFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractDouble2ReferenceMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractDouble2ReferenceSortedMap
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.
|
| AbstractDouble2ShortSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractDoubleBidirectionalIterator
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.
|
| AbstractDoubleBigList
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractDoubleCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractDoubleIterator
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.
|
| AbstractDoubleList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| 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.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Double2ObjectArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2ObjectAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2ObjectFunction
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ObjectFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Double2ObjectFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Double2ObjectFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Double2ObjectFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Double2ObjectLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2ObjectMap
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2ObjectMap.Entry
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2ObjectMap.FastEntrySet
An entry set providing fast iteration.
|
| Double2ObjectMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Double2ObjectMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Double2ObjectMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Double2ObjectMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Double2ObjectOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Double2ObjectOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2ObjectRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2ObjectSortedMap
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ObjectSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Double2ObjectSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Double2ReferenceArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Double2ReferenceAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Double2ReferenceFunction
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ReferenceFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Double2ReferenceFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Double2ReferenceFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Double2ReferenceFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Double2ReferenceLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Double2ReferenceMap
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Double2ReferenceMap.Entry
A type-specific
Map.Entry; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Double2ReferenceMap.FastEntrySet
An entry set providing fast iteration.
|
| Double2ReferenceMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Double2ReferenceMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Double2ReferenceMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Double2ReferenceMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Double2ReferenceOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Double2ReferenceOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Double2ReferenceRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Double2ReferenceSortedMap
A type-specific
SortedMap; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Double2ReferenceSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Double2ReferenceSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| 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.EmptyFunction
An immutable class representing an empty type-specific function.
|
| 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.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.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| DoubleArrayList
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| DoubleArrays.Segment |
| DoubleArraySet
A simple, brute-force implementation of a set based on a backing array.
|
| DoubleBidirectionalIterable
A type-specific
Iterable that further strengthens the specification of Iterable.iterator(). |
| 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.
|
| DoubleBigList
A type-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing. |
| DoubleBigListIterator
A type-specific
BigListIterator. |
| DoubleBigListIterators.EmptyBigListIterator
A class returning no elements and a type-specific big list iterator interface.
|
| DoubleBigLists.EmptyBigList
An immutable class representing an empty type-specific big list.
|
| DoubleCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleCollections.EmptyCollection
An immutable class representing an empty type-specific collection.
|
| 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. |
| DoubleConsumer
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive. |
| DoubleHash.Strategy
A type-specific hash strategy.
|
| DoubleHeapSemiIndirectPriorityQueue
A type-specific heap-based semi-indirect priority queue.
|
| DoubleIndirectPriorityQueue
A type-specific
IndirectPriorityQueue. |
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| DoubleIterators.EmptyIterator
A class returning no elements and a type-specific iterator interface.
|
| 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.EmptyList
An immutable class representing an empty type-specific list.
|
| DoubleLists.SynchronizedList
A synchronized wrapper class for lists.
|
| DoubleLists.UnmodifiableList
An unmodifiable wrapper class for 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. |
| DoubleSet
A type-specific
Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| 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.EmptySet
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| DoubleStack
A type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Class and Description |
|---|
| AbstractDoubleCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| DoubleCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractDoubleCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| DoubleCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractDoubleCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| DoubleCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractDoubleCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| DoubleCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractDoubleCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| DoubleCollection
A type-specific
Collection; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| DoubleIterable
A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer). |
| DoubleIterator
A type-specific
Iterator; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Copyright © 2020. All rights reserved.