|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use it.unimi.dsi.fastutil.objects | |
---|---|
it.unimi.dsi.fastutil.booleans | Provides type-specific classes for boolean elements or keys. |
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.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. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.booleans | |
---|---|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.bytes | |
---|---|
AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface. |
|
AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ObjectIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ObjectList
A type-specific List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectListIterator
A type-specific bidirectional iterator that is also a ListIterator . |
|
ObjectSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.chars | |
---|---|
AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface. |
|
AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ObjectIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ObjectList
A type-specific List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectListIterator
A type-specific bidirectional iterator that is also a ListIterator . |
|
ObjectSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.doubles | |
---|---|
AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ObjectIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ObjectSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.floats | |
---|---|
AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ObjectIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ObjectSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.ints | |
---|---|
AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface. |
|
AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ObjectIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ObjectList
A type-specific List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectListIterator
A type-specific bidirectional iterator that is also a ListIterator . |
|
ObjectSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.longs | |
---|---|
AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface. |
|
AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ObjectIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ObjectList
A type-specific List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectListIterator
A type-specific bidirectional iterator that is also a ListIterator . |
|
ObjectSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.objects | |
---|---|
AbstractObject2BooleanFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2BooleanMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2BooleanSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2ByteFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2ByteMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2ByteSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2CharFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2CharMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2CharSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2DoubleFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2DoubleMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2DoubleSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2FloatFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2FloatMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2FloatSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2IntFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2IntMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2IntSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2LongFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2LongMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2LongSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2ObjectFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2ObjectMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2ObjectSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2ReferenceFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2ReferenceMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2ReferenceSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObject2ShortFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractObject2ShortMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractObject2ShortSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractObjectBidirectionalIterator
An abstract class facilitating the creation of type-specific bidirectional iterators. |
|
AbstractObjectBigList
An abstract class providing basic methods for big lists implementing a type-specific big list interface. |
|
AbstractObjectBigListIterator
An abstract class facilitating the creation of type-specific big-list iterators. |
|
AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface. |
|
AbstractObjectListIterator
An abstract class facilitating the creation of type-specific list iterators. |
|
AbstractObjectSet
An abstract class providing basic methods for sets implementing a type-specific interface. |
|
AbstractObjectSortedSet
An abstract class providing basic methods for sorted sets implementing a type-specific interface. |
|
AbstractReference2BooleanFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2BooleanMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2BooleanSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2ByteFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2ByteMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2ByteSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2CharFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2CharMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2CharSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2DoubleFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2DoubleMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2DoubleSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2FloatFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2FloatMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2FloatSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2IntFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2IntMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2IntSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2LongFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2LongMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2LongSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2ObjectFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2ObjectMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2ObjectSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2ReferenceFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2ReferenceMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2ReferenceSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReference2ShortFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractReference2ShortMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractReference2ShortSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractReferenceBigList
An abstract class providing basic methods for big lists implementing a type-specific big list interface. |
|
AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractReferenceList
An abstract class providing basic methods for lists implementing a type-specific list interface. |
|
AbstractReferenceSet
An abstract class providing basic methods for sets implementing a type-specific interface. |
|
AbstractReferenceSortedSet
An abstract class providing basic methods for sorted sets implementing a type-specific interface. |
|
Object2BooleanArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2BooleanAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2BooleanFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2BooleanFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2BooleanFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2BooleanFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2BooleanFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2BooleanLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2BooleanMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2BooleanMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2BooleanMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2BooleanMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2BooleanMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2BooleanMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2BooleanMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2BooleanRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2BooleanSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2BooleanSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2BooleanSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2ByteArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2ByteAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2ByteFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2ByteFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2ByteFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2ByteFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2ByteFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2ByteLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2ByteMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2ByteMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2ByteMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2ByteMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2ByteMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2ByteMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2ByteMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2ByteRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2ByteSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2ByteSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2ByteSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2CharArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2CharAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2CharFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2CharFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2CharFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2CharFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2CharFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2CharLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2CharMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2CharMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2CharMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2CharMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2CharMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2CharMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2CharMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2CharRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2CharSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2CharSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2CharSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2DoubleArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2DoubleAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2DoubleFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2DoubleFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2DoubleFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2DoubleFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2DoubleFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2DoubleLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2DoubleMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2DoubleMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2DoubleMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2DoubleMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2DoubleMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2DoubleMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2DoubleMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2DoubleRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2DoubleSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2DoubleSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2DoubleSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2FloatArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2FloatAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2FloatFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2FloatFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2FloatFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2FloatFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2FloatFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2FloatLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2FloatMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2FloatMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2FloatMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2FloatMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2FloatMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2FloatMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2FloatMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2FloatRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2FloatSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2FloatSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2FloatSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2IntArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2IntAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2IntFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2IntFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2IntFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2IntFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2IntFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2IntLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2IntMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2IntMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2IntMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2IntMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2IntMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2IntMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2IntMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2IntRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2IntSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2IntSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2IntSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2LongArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2LongAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2LongFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2LongFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2LongFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2LongFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2LongFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2LongLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2LongMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2LongMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2LongMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2LongMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2LongMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2LongMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2LongMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2LongRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2LongSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2LongSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2LongSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2ObjectArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2ObjectAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2ObjectFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2ObjectFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2ObjectFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2ObjectFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2ObjectFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2ObjectLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2ObjectLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2ObjectMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2ObjectMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2ObjectMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2ObjectMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2ObjectMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2ObjectMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2ObjectMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2ObjectOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2ObjectOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2ObjectRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2ObjectSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2ObjectSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2ObjectSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2ReferenceArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2ReferenceAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2ReferenceFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2ReferenceFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2ReferenceFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2ReferenceFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2ReferenceFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2ReferenceLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2ReferenceLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2ReferenceMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2ReferenceMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2ReferenceMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2ReferenceMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2ReferenceMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2ReferenceMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2ReferenceMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2ReferenceOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2ReferenceOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2ReferenceRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2ReferenceSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2ReferenceSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2ReferenceSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Object2ShortArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Object2ShortAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Object2ShortFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2ShortFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Object2ShortFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Object2ShortFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Object2ShortFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Object2ShortLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Object2ShortMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Object2ShortMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Object2ShortMap.FastEntrySet
An entry set providing fast iteration. |
|
Object2ShortMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Object2ShortMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Object2ShortMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Object2ShortMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Object2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
Object2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Object2ShortRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Object2ShortSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Object2ShortSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Object2ShortSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
ObjectArrayList
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectArraySet
A simple, brute-force implementation of a set based on a backing array. |
|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectBigArrayBigList
A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectBigList
A type-specific BigList ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectBigListIterator
A type-specific BigListIterator . |
|
ObjectBigListIterators.EmptyBigListIterator
A class returning no elements and a type-specific big list iterator interface. |
|
ObjectBigLists.EmptyBigList
An immutable class representing an empty type-specific big list. |
|
ObjectCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ObjectCollections.EmptyCollection
An immutable class representing an empty type-specific collection. |
|
ObjectCollections.SynchronizedCollection
A synchronized wrapper class for collections. |
|
ObjectCollections.UnmodifiableCollection
An unmodifiable wrapper class for collections. |
|
ObjectHeapSemiIndirectPriorityQueue
A type-specific heap-based semi-indirect priority queue. |
|
ObjectIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ObjectIterators.EmptyIterator
A class returning no elements and a type-specific iterator interface. |
|
ObjectLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation. |
|
ObjectLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation. |
|
ObjectList
A type-specific List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectListIterator
A type-specific bidirectional iterator that is also a ListIterator . |
|
ObjectLists.EmptyList
An immutable class representing an empty type-specific list. |
|
ObjectOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
ObjectOpenHashBigSet
A type-specific hash big set with with a fast, small-footprint implementation. |
|
ObjectOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation. |
|
ObjectSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSets.EmptySet
An immutable class representing the empty set and implementing a type-specific set interface. |
|
ObjectSets.Singleton
An immutable class representing a type-specific singleton set. |
|
ObjectSets.SynchronizedSet
A synchronized wrapper class for sets. |
|
ObjectSets.UnmodifiableSet
An unmodifiable wrapper class for sets. |
|
ObjectSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSortedSets.EmptySet
An immutable class representing the empty sorted set and implementing a type-specific set interface. |
|
Reference2BooleanArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2BooleanFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2BooleanFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2BooleanFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2BooleanFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2BooleanFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2BooleanMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2BooleanMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2BooleanMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2BooleanMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2BooleanMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2BooleanMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2BooleanMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2BooleanSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2BooleanSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2BooleanSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2ByteArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2ByteFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2ByteFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2ByteFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2ByteFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2ByteFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2ByteMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2ByteMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2ByteMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2ByteMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2ByteMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2ByteMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2ByteMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2ByteSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2ByteSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2ByteSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2CharArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2CharFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2CharFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2CharFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2CharFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2CharFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2CharMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2CharMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2CharMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2CharMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2CharMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2CharMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2CharMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2CharSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2CharSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2CharSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2DoubleArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2DoubleFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2DoubleFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2DoubleFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2DoubleFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2DoubleFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2DoubleMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2DoubleMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2DoubleMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2DoubleMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2DoubleMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2DoubleMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2DoubleMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2DoubleSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2DoubleSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2DoubleSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2FloatArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2FloatFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2FloatFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2FloatFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2FloatFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2FloatFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2FloatMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2FloatMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2FloatMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2FloatMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2FloatMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2FloatMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2FloatMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2FloatSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2FloatSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2FloatSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2IntArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2IntFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2IntFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2IntFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2IntFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2IntFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2IntMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2IntMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2IntMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2IntMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2IntMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2IntMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2IntMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2IntSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2IntSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2IntSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2LongArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2LongFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2LongFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2LongFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2LongFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2LongFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2LongMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2LongMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2LongMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2LongMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2LongMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2LongMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2LongMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2LongSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2LongSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2LongSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2ObjectArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2ObjectFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2ObjectFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2ObjectFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2ObjectFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2ObjectFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2ObjectLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2ObjectMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2ObjectMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2ObjectMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2ObjectMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2ObjectMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2ObjectMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2ObjectMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2ObjectOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2ObjectSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2ObjectSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2ObjectSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2ReferenceArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2ReferenceFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2ReferenceFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2ReferenceFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2ReferenceFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2ReferenceFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2ReferenceLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2ReferenceMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2ReferenceMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2ReferenceMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2ReferenceMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2ReferenceMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2ReferenceMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2ReferenceMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2ReferenceOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2ReferenceSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2ReferenceSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2ReferenceSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Reference2ShortArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Reference2ShortFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2ShortFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Reference2ShortFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Reference2ShortFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Reference2ShortFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Reference2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Reference2ShortMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Reference2ShortMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Reference2ShortMap.FastEntrySet
An entry set providing fast iteration. |
|
Reference2ShortMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Reference2ShortMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Reference2ShortMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Reference2ShortMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Reference2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Reference2ShortSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Reference2ShortSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Reference2ShortSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
ReferenceArrayList
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceArraySet
A simple, brute-force implementation of a set based on a backing array. |
|
ReferenceBigArrayBigList
A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceBigList
A type-specific BigList ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceBigLists.EmptyBigList
An immutable class representing an empty type-specific big list. |
|
ReferenceCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ReferenceCollections.EmptyCollection
An immutable class representing an empty type-specific collection. |
|
ReferenceCollections.SynchronizedCollection
A synchronized wrapper class for collections. |
|
ReferenceCollections.UnmodifiableCollection
An unmodifiable wrapper class for collections. |
|
ReferenceLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation. |
|
ReferenceList
A type-specific List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceLists.EmptyList
An immutable class representing an empty type-specific list. |
|
ReferenceOpenHashBigSet
A type-specific hash big set with with a fast, small-footprint implementation. |
|
ReferenceOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation. |
|
ReferenceSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceSets.EmptySet
An immutable class representing the empty set and implementing a type-specific set interface. |
|
ReferenceSets.Singleton
An immutable class representing a type-specific singleton set. |
|
ReferenceSets.SynchronizedSet
A synchronized wrapper class for sets. |
|
ReferenceSets.UnmodifiableSet
An unmodifiable wrapper class for sets. |
|
ReferenceSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceSortedSets.EmptySet
An immutable class representing the empty sorted set and implementing a type-specific set interface. |
Classes in it.unimi.dsi.fastutil.objects used by it.unimi.dsi.fastutil.shorts | |
---|---|
AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface. |
|
AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ObjectCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ObjectIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ObjectIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ObjectList
A type-specific List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectListIterator
A type-specific bidirectional iterator that is also a ListIterator . |
|
ObjectSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ObjectSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ReferenceCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |