|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use it.unimi.dsi.fastutil.bytes | |
---|---|
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. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.bytes | |
---|---|
AbstractByte2BooleanFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2BooleanMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2BooleanSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2ByteFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2ByteMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2ByteSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2CharFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2CharMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2CharSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2DoubleFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2DoubleMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2DoubleSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2FloatFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2FloatMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2FloatSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2IntFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2IntMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2IntSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2LongFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2LongMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2LongSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2ObjectFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2ObjectMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2ObjectSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2ReferenceFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2ReferenceMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2ReferenceSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByte2ShortFunction
An abstract class providing basic methods for functions implementing a type-specific interface. |
|
AbstractByte2ShortMap
An abstract class providing basic methods for maps implementing a type-specific interface. |
|
AbstractByte2ShortSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface. |
|
AbstractByteBidirectionalIterator
An abstract class facilitating the creation of type-specific bidirectional iterators. |
|
AbstractByteBigList
An abstract class providing basic methods for big lists implementing a type-specific big list interface. |
|
AbstractByteBigListIterator
An abstract class facilitating the creation of type-specific big-list iterators. |
|
AbstractByteCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractByteIterator
An abstract class facilitating the creation of type-specific iterators. |
|
AbstractByteList
An abstract class providing basic methods for lists implementing a type-specific list interface. |
|
AbstractByteListIterator
An abstract class facilitating the creation of type-specific list iterators. |
|
AbstractBytePriorityQueue
An abstract class providing basic methods for priority queues implementing a type-specific interface. |
|
AbstractByteSet
An abstract class providing basic methods for sets implementing a type-specific interface. |
|
AbstractByteSortedSet
An abstract class providing basic methods for sorted sets implementing a type-specific interface. |
|
Byte2BooleanArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2BooleanAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2BooleanFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2BooleanFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2BooleanFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2BooleanFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2BooleanFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2BooleanMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2BooleanMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2BooleanMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2BooleanMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2BooleanMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2BooleanMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2BooleanMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2BooleanRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2BooleanSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2BooleanSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2BooleanSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2ByteArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2ByteAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2ByteFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2ByteFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2ByteFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2ByteFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2ByteFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2ByteMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2ByteMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2ByteMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2ByteMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2ByteMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2ByteMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2ByteMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2ByteRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2ByteSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2ByteSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2ByteSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2CharArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2CharAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2CharFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2CharFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2CharFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2CharFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2CharFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2CharMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2CharMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2CharMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2CharMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2CharMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2CharMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2CharMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2CharRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2CharSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2CharSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2CharSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2DoubleArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2DoubleAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2DoubleFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2DoubleFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2DoubleFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2DoubleFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2DoubleFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2DoubleMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2DoubleMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2DoubleMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2DoubleMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2DoubleMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2DoubleMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2DoubleMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2DoubleRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2DoubleSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2DoubleSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2DoubleSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2FloatArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2FloatAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2FloatFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2FloatFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2FloatFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2FloatFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2FloatFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2FloatMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2FloatMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2FloatMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2FloatMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2FloatMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2FloatMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2FloatMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2FloatRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2FloatSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2FloatSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2FloatSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2IntArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2IntAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2IntFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2IntFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2IntFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2IntFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2IntFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2IntMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2IntMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2IntMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2IntMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2IntMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2IntMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2IntMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2IntRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2IntSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2IntSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2IntSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2LongArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2LongAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2LongFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2LongFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2LongFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2LongFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2LongFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2LongMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2LongMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2LongMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2LongMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2LongMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2LongMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2LongMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2LongRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2LongSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2LongSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2LongSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2ObjectArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2ObjectAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2ObjectFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2ObjectFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2ObjectFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2ObjectFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2ObjectFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2ObjectLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2ObjectMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2ObjectMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2ObjectMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2ObjectMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2ObjectMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2ObjectMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2ObjectMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2ObjectOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2ObjectRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2ObjectSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2ObjectSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2ObjectSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2ReferenceArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2ReferenceAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2ReferenceFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2ReferenceFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2ReferenceFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2ReferenceFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2ReferenceFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2ReferenceLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2ReferenceMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2ReferenceMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2ReferenceMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2ReferenceMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2ReferenceMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2ReferenceMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2ReferenceMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2ReferenceOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2ReferenceRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2ReferenceSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2ReferenceSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2ReferenceSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
Byte2ShortArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays. |
|
Byte2ShortAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation. |
|
Byte2ShortFunction
A type-specific Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2ShortFunctions.EmptyFunction
An immutable class representing an empty type-specific function. |
|
Byte2ShortFunctions.Singleton
An immutable class representing a type-specific singleton function. |
|
Byte2ShortFunctions.SynchronizedFunction
A synchronized wrapper class for functions. |
|
Byte2ShortFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions. |
|
Byte2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation. |
|
Byte2ShortMap
A type-specific Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
|
Byte2ShortMap.Entry
A type-specific Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
Byte2ShortMap.FastEntrySet
An entry set providing fast iteration. |
|
Byte2ShortMaps.EmptyMap
An immutable class representing an empty type-specific map. |
|
Byte2ShortMaps.Singleton
An immutable class representing a type-specific singleton map. |
|
Byte2ShortMaps.SynchronizedMap
A synchronized wrapper class for maps. |
|
Byte2ShortMaps.UnmodifiableMap
An unmodifiable wrapper class for maps. |
|
Byte2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation. |
|
Byte2ShortRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation. |
|
Byte2ShortSortedMap
A type-specific SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
Byte2ShortSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration. |
|
Byte2ShortSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map. |
|
ByteArrayFrontCodedList
Compact storage of lists of arrays using front coding. |
|
ByteArrayList
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ByteArraySet
A simple, brute-force implementation of a set based on a backing array. |
|
ByteBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards. |
|
ByteBigArrayBigList
A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ByteBigList
A type-specific BigList ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ByteBigListIterator
A type-specific BigListIterator . |
|
ByteBigListIterators.EmptyBigListIterator
A class returning no elements and a type-specific big list iterator interface. |
|
ByteBigLists.EmptyBigList
An immutable class representing an empty type-specific big list. |
|
ByteCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ByteCollections.EmptyCollection
An immutable class representing an empty type-specific collection. |
|
ByteCollections.SynchronizedCollection
A synchronized wrapper class for collections. |
|
ByteCollections.UnmodifiableCollection
An unmodifiable wrapper class for collections. |
|
ByteComparator
A type-specific Comparator ; provides methods to compare two primitive types both as objects
and as primitive types. |
|
ByteHash.Strategy
A type-specific hash strategy. |
|
ByteHeapSemiIndirectPriorityQueue
A type-specific heap-based semi-indirect priority queue. |
|
ByteIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
ByteIterators.EmptyIterator
A class returning no elements and a type-specific iterator interface. |
|
ByteLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation. |
|
ByteLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation. |
|
ByteList
A type-specific List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ByteListIterator
A type-specific bidirectional iterator that is also a ListIterator . |
|
ByteLists.EmptyList
An immutable class representing an empty type-specific list. |
|
ByteOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy is specified at creation time. |
|
ByteOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation. |
|
BytePriorityQueue
A type-specific PriorityQueue ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ByteSet
A type-specific Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ByteSets.EmptySet
An immutable class representing the empty set and implementing a type-specific set interface. |
|
ByteSets.Singleton
An immutable class representing a type-specific singleton set. |
|
ByteSets.SynchronizedSet
A synchronized wrapper class for sets. |
|
ByteSets.UnmodifiableSet
An unmodifiable wrapper class for sets. |
|
ByteSortedSet
A type-specific SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
|
ByteSortedSets.EmptySet
An immutable class representing the empty sorted set and implementing a type-specific set interface. |
|
ByteStack
A type-specific Stack ; provides some additional methods that use polymorphism to avoid (un)boxing. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.chars | |
---|---|
AbstractByteCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractByteIterator
An abstract class facilitating the creation of type-specific iterators. |
|
ByteCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ByteIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.doubles | |
---|---|
AbstractByteCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractByteIterator
An abstract class facilitating the creation of type-specific iterators. |
|
ByteCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ByteIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.floats | |
---|---|
AbstractByteCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractByteIterator
An abstract class facilitating the creation of type-specific iterators. |
|
ByteCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ByteIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.ints | |
---|---|
AbstractByteCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractByteIterator
An abstract class facilitating the creation of type-specific iterators. |
|
ByteCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ByteIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.io | |
---|---|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.longs | |
---|---|
AbstractByteCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractByteIterator
An abstract class facilitating the creation of type-specific iterators. |
|
ByteCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ByteIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.objects | |
---|---|
AbstractByteCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractByteIterator
An abstract class facilitating the creation of type-specific iterators. |
|
ByteCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ByteIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
Classes in it.unimi.dsi.fastutil.bytes used by it.unimi.dsi.fastutil.shorts | |
---|---|
AbstractByteCollection
An abstract class providing basic methods for collections implementing a type-specific interface. |
|
AbstractByteIterator
An abstract class facilitating the creation of type-specific iterators. |
|
ByteCollection
A type-specific Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
|
ByteIterable
A type-specific Iterable that strengthens that specification of Iterable.iterator() . |
|
ByteIterator
A type-specific Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |