Package it.unimi.dsi.fastutil.objects
Type-specific classes for object elements or keys.
Whenever possible and useful, fastutil
provides both typical
collections, which compare objects using equals()
, and
reference-basedcollections, which use identity (==
). See
the related comments in the overview.
-
Interface Summary Interface Description Object2ByteFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2CharFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2DoubleFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2DoubleMap<K> A type-specificMap
; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.Object2DoubleMap.Entry<K> A type-specificMap.Entry
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2DoubleMap.FastEntrySet<K> An entry set providing fast iteration.Object2DoubleSortedMap<K> A type-specificSortedMap
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2DoubleSortedMap.FastSortedEntrySet<K> A sorted entry set providing fast iteration.Object2FloatFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2IntFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2IntMap<K> A type-specificMap
; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.Object2IntMap.Entry<K> A type-specificMap.Entry
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2IntMap.FastEntrySet<K> An entry set providing fast iteration.Object2IntSortedMap<K> A type-specificSortedMap
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2IntSortedMap.FastSortedEntrySet<K> A sorted entry set providing fast iteration.Object2LongFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2LongMap<K> A type-specificMap
; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.Object2LongMap.Entry<K> A type-specificMap.Entry
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2LongMap.FastEntrySet<K> An entry set providing fast iteration.Object2LongSortedMap<K> A type-specificSortedMap
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2LongSortedMap.FastSortedEntrySet<K> A sorted entry set providing fast iteration.Object2ObjectFunction<K,V> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2ObjectMap<K,V> A type-specificMap
; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.Object2ObjectMap.Entry<K,V> A type-specificMap.Entry
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2ObjectMap.FastEntrySet<K,V> An entry set providing fast iteration.Object2ObjectSortedMap<K,V> A type-specificSortedMap
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2ObjectSortedMap.FastSortedEntrySet<K,V> A sorted entry set providing fast iteration.Object2ReferenceFunction<K,V> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Object2ShortFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectBidirectionalIterable<K> A type-specificIterable
that further strengthens the specification ofIterable.iterator()
.ObjectBidirectionalIterator<K> A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards.ObjectBigList<K> A type-specificBigList
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectBigListIterator<K> A type-specificBigListIterator
.ObjectCollection<K> A type-specificCollection
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectDoublePair<K> A type-specificPair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectIntPair<K> A type-specificPair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectIterable<K> A type-specificIterable
that strengthens that specification ofObjectIterable.iterator()
.ObjectIterator<K> A type-specificIterator
; provides an additional method to avoid (un)boxing, and the possibility to skip elements.ObjectList<K> A type-specificList
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectListIterator<K> A type-specific bidirectional iterator that is also aListIterator
.ObjectLongPair<K> A type-specificPair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectSet<K> A type-specificSet
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectSortedSet<K> A type-specificSortedSet
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectSpliterator<K> A type-specificSpliterator
; provides an additional methods to avoid (un)boxing, and the possibility to skip elements.Reference2ByteFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Reference2CharFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Reference2DoubleFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Reference2FloatFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Reference2IntFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Reference2LongFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Reference2ObjectFunction<K,V> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Reference2ReferenceFunction<K,V> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing.Reference2ShortFunction<K> A type-specificFunction
; provides some additional methods that use polymorphism to avoid (un)boxing. -
Class Summary Class Description AbstractObject2DoubleFunction<K> An abstract class providing basic methods for functions implementing a type-specific interface.AbstractObject2DoubleMap<K> An abstract class providing basic methods for maps implementing a type-specific interface.AbstractObject2DoubleMap.BasicEntry<K> This class provides a basic but complete type-specific entry class for all those maps implementations that do not have entries on their own (e.g., most immutable maps).AbstractObject2DoubleMap.BasicEntrySet<K> This class provides a basic implementation for an Entry set which forwards some queries to the map.AbstractObject2DoubleSortedMap<K> An abstract class providing basic methods for sorted maps implementing a type-specific interface.AbstractObject2IntFunction<K> An abstract class providing basic methods for functions implementing a type-specific interface.AbstractObject2IntMap<K> An abstract class providing basic methods for maps implementing a type-specific interface.AbstractObject2IntMap.BasicEntry<K> This class provides a basic but complete type-specific entry class for all those maps implementations that do not have entries on their own (e.g., most immutable maps).AbstractObject2IntMap.BasicEntrySet<K> This class provides a basic implementation for an Entry set which forwards some queries to the map.AbstractObject2IntSortedMap<K> An abstract class providing basic methods for sorted maps implementing a type-specific interface.AbstractObject2LongFunction<K> An abstract class providing basic methods for functions implementing a type-specific interface.AbstractObject2LongMap<K> An abstract class providing basic methods for maps implementing a type-specific interface.AbstractObject2LongMap.BasicEntry<K> This class provides a basic but complete type-specific entry class for all those maps implementations that do not have entries on their own (e.g., most immutable maps).AbstractObject2LongMap.BasicEntrySet<K> This class provides a basic implementation for an Entry set which forwards some queries to the map.AbstractObject2LongSortedMap<K> An abstract class providing basic methods for sorted maps implementing a type-specific interface.AbstractObject2ObjectFunction<K,V> An abstract class providing basic methods for functions implementing a type-specific interface.AbstractObject2ObjectMap<K,V> An abstract class providing basic methods for maps implementing a type-specific interface.AbstractObject2ObjectMap.BasicEntry<K,V> This class provides a basic but complete type-specific entry class for all those maps implementations that do not have entries on their own (e.g., most immutable maps).AbstractObject2ObjectMap.BasicEntrySet<K,V> This class provides a basic implementation for an Entry set which forwards some queries to the map.AbstractObject2ObjectSortedMap<K,V> An abstract class providing basic methods for sorted maps implementing a type-specific interface.AbstractObjectBidirectionalIterator<K> Deprecated. As of fastutil 8 this class is no longer necessary, as its previous abstract methods are now default methods of the type-specific interface.AbstractObjectBigList<K> An abstract class providing basic methods for big lists implementing a type-specific big list interface.AbstractObjectBigList.ObjectRandomAccessSubList<K> AbstractObjectBigList.ObjectSubList<K> A class implementing a sublist view.AbstractObjectBigListIterator<K> Deprecated. As of fastutil 8 this class is no longer necessary, as its previous abstract methods are now default methods of the type-specific interface.AbstractObjectCollection<K> An abstract class providing basic methods for collections implementing a type-specific interface.AbstractObjectIterator<K> An abstract class facilitating the creation of type-specific iterators.AbstractObjectList<K> An abstract class providing basic methods for lists implementing a type-specific list interface.AbstractObjectList.ObjectRandomAccessSubList<K> AbstractObjectList.ObjectSubList<K> A class implementing a sublist view.AbstractObjectListIterator<K> Deprecated. As of fastutil 8 this class is no longer necessary, as its previous abstract methods are now default methods of the type-specific interface.AbstractObjectSet<K> An abstract class providing basic methods for sets implementing a type-specific interface.AbstractObjectSortedSet<K> An abstract class providing basic methods for sorted sets implementing a type-specific interface.AbstractObjectSpliterator<K> An abstract class facilitating the creation of type-specific iterators.Object2DoubleArrayMap<K> A simple, brute-force implementation of a map based on two parallel backing arrays.Object2DoubleAVLTreeMap<K> A type-specific AVL tree map with a fast, small-footprint implementation.Object2DoubleFunctions A class providing static methods and objects that do useful things with type-specific functions.Object2DoubleFunctions.EmptyFunction<K> An immutable class representing an empty type-specific function.Object2DoubleFunctions.PrimitiveFunction<K> An adapter for mapping generic total functions to partial primitive functions.Object2DoubleFunctions.Singleton<K> An immutable class representing a type-specific singleton function.Object2DoubleFunctions.SynchronizedFunction<K> A synchronized wrapper class for functions.Object2DoubleFunctions.UnmodifiableFunction<K> An unmodifiable wrapper class for functions.Object2DoubleLinkedOpenCustomHashMap<K> A type-specific linked hash map with with a fast, small-footprint implementation.Object2DoubleLinkedOpenHashMap<K> A type-specific linked hash map with with a fast, small-footprint implementation.Object2DoubleMaps A class providing static methods and objects that do useful things with type-specific maps.Object2DoubleMaps.EmptyMap<K> An immutable class representing an empty type-specific map.Object2DoubleMaps.Singleton<K> An immutable class representing a type-specific singleton map.Object2DoubleMaps.SynchronizedMap<K> A synchronized wrapper class for maps.Object2DoubleMaps.UnmodifiableMap<K> An unmodifiable wrapper class for maps.Object2DoubleOpenCustomHashMap<K> A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.Object2DoubleOpenHashMap<K> A type-specific hash map with a fast, small-footprint implementation.Object2DoubleRBTreeMap<K> A type-specific red-black tree map with a fast, small-footprint implementation.Object2DoubleSortedMaps A class providing static methods and objects that do useful things with type-specific sorted maps.Object2DoubleSortedMaps.EmptySortedMap<K> An immutable class representing an empty type-specific sorted map.Object2DoubleSortedMaps.Singleton<K> An immutable class representing a type-specific singleton sorted map.Object2DoubleSortedMaps.SynchronizedSortedMap<K> A synchronized wrapper class for sorted maps.Object2DoubleSortedMaps.UnmodifiableSortedMap<K> An unmodifiable wrapper class for sorted maps.Object2IntArrayMap<K> A simple, brute-force implementation of a map based on two parallel backing arrays.Object2IntAVLTreeMap<K> A type-specific AVL tree map with a fast, small-footprint implementation.Object2IntFunctions A class providing static methods and objects that do useful things with type-specific functions.Object2IntFunctions.EmptyFunction<K> An immutable class representing an empty type-specific function.Object2IntFunctions.PrimitiveFunction<K> An adapter for mapping generic total functions to partial primitive functions.Object2IntFunctions.Singleton<K> An immutable class representing a type-specific singleton function.Object2IntFunctions.SynchronizedFunction<K> A synchronized wrapper class for functions.Object2IntFunctions.UnmodifiableFunction<K> An unmodifiable wrapper class for functions.Object2IntLinkedOpenCustomHashMap<K> A type-specific linked hash map with with a fast, small-footprint implementation.Object2IntLinkedOpenHashMap<K> A type-specific linked hash map with with a fast, small-footprint implementation.Object2IntMaps A class providing static methods and objects that do useful things with type-specific maps.Object2IntMaps.EmptyMap<K> An immutable class representing an empty type-specific map.Object2IntMaps.Singleton<K> An immutable class representing a type-specific singleton map.Object2IntMaps.SynchronizedMap<K> A synchronized wrapper class for maps.Object2IntMaps.UnmodifiableMap<K> An unmodifiable wrapper class for maps.Object2IntOpenCustomHashMap<K> A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.Object2IntOpenHashMap<K> A type-specific hash map with a fast, small-footprint implementation.Object2IntRBTreeMap<K> A type-specific red-black tree map with a fast, small-footprint implementation.Object2IntSortedMaps A class providing static methods and objects that do useful things with type-specific sorted maps.Object2IntSortedMaps.EmptySortedMap<K> An immutable class representing an empty type-specific sorted map.Object2IntSortedMaps.Singleton<K> An immutable class representing a type-specific singleton sorted map.Object2IntSortedMaps.SynchronizedSortedMap<K> A synchronized wrapper class for sorted maps.Object2IntSortedMaps.UnmodifiableSortedMap<K> An unmodifiable wrapper class for sorted maps.Object2LongArrayMap<K> A simple, brute-force implementation of a map based on two parallel backing arrays.Object2LongAVLTreeMap<K> A type-specific AVL tree map with a fast, small-footprint implementation.Object2LongFunctions A class providing static methods and objects that do useful things with type-specific functions.Object2LongFunctions.EmptyFunction<K> An immutable class representing an empty type-specific function.Object2LongFunctions.PrimitiveFunction<K> An adapter for mapping generic total functions to partial primitive functions.Object2LongFunctions.Singleton<K> An immutable class representing a type-specific singleton function.Object2LongFunctions.SynchronizedFunction<K> A synchronized wrapper class for functions.Object2LongFunctions.UnmodifiableFunction<K> An unmodifiable wrapper class for functions.Object2LongLinkedOpenCustomHashMap<K> A type-specific linked hash map with with a fast, small-footprint implementation.Object2LongLinkedOpenHashMap<K> A type-specific linked hash map with with a fast, small-footprint implementation.Object2LongMaps A class providing static methods and objects that do useful things with type-specific maps.Object2LongMaps.EmptyMap<K> An immutable class representing an empty type-specific map.Object2LongMaps.Singleton<K> An immutable class representing a type-specific singleton map.Object2LongMaps.SynchronizedMap<K> A synchronized wrapper class for maps.Object2LongMaps.UnmodifiableMap<K> An unmodifiable wrapper class for maps.Object2LongOpenCustomHashMap<K> A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.Object2LongOpenHashMap<K> A type-specific hash map with a fast, small-footprint implementation.Object2LongRBTreeMap<K> A type-specific red-black tree map with a fast, small-footprint implementation.Object2LongSortedMaps A class providing static methods and objects that do useful things with type-specific sorted maps.Object2LongSortedMaps.EmptySortedMap<K> An immutable class representing an empty type-specific sorted map.Object2LongSortedMaps.Singleton<K> An immutable class representing a type-specific singleton sorted map.Object2LongSortedMaps.SynchronizedSortedMap<K> A synchronized wrapper class for sorted maps.Object2LongSortedMaps.UnmodifiableSortedMap<K> An unmodifiable wrapper class for sorted maps.Object2ObjectArrayMap<K,V> A simple, brute-force implementation of a map based on two parallel backing arrays.Object2ObjectAVLTreeMap<K,V> A type-specific AVL tree map with a fast, small-footprint implementation.Object2ObjectFunctions A class providing static methods and objects that do useful things with type-specific functions.Object2ObjectFunctions.EmptyFunction<K,V> An immutable class representing an empty type-specific function.Object2ObjectFunctions.Singleton<K,V> An immutable class representing a type-specific singleton function.Object2ObjectFunctions.SynchronizedFunction<K,V> A synchronized wrapper class for functions.Object2ObjectFunctions.UnmodifiableFunction<K,V> An unmodifiable wrapper class for functions.Object2ObjectLinkedOpenCustomHashMap<K,V> A type-specific linked hash map with with a fast, small-footprint implementation.Object2ObjectLinkedOpenHashMap<K,V> A type-specific linked hash map with with a fast, small-footprint implementation.Object2ObjectMaps A class providing static methods and objects that do useful things with type-specific maps.Object2ObjectMaps.EmptyMap<K,V> An immutable class representing an empty type-specific map.Object2ObjectMaps.Singleton<K,V> An immutable class representing a type-specific singleton map.Object2ObjectMaps.SynchronizedMap<K,V> A synchronized wrapper class for maps.Object2ObjectMaps.UnmodifiableMap<K,V> An unmodifiable wrapper class for maps.Object2ObjectOpenCustomHashMap<K,V> A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.Object2ObjectOpenHashMap<K,V> A type-specific hash map with a fast, small-footprint implementation.Object2ObjectRBTreeMap<K,V> A type-specific red-black tree map with a fast, small-footprint implementation.Object2ObjectSortedMaps A class providing static methods and objects that do useful things with type-specific sorted maps.Object2ObjectSortedMaps.EmptySortedMap<K,V> An immutable class representing an empty type-specific sorted map.Object2ObjectSortedMaps.Singleton<K,V> An immutable class representing a type-specific singleton sorted map.Object2ObjectSortedMaps.SynchronizedSortedMap<K,V> A synchronized wrapper class for sorted maps.Object2ObjectSortedMaps.UnmodifiableSortedMap<K,V> An unmodifiable wrapper class for sorted maps.ObjectArrayFIFOQueue<K> A type-specific array-based FIFO queue, supporting also deque operations.ObjectArrayIndirectPriorityQueue<K> A type-specific array-based semi-indirect priority queue.ObjectArrayList<K> A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectArrayPriorityQueue<K> A type-specific array-based priority queue.ObjectArrays A class providing static methods and objects that do useful things with type-specific arrays.ObjectArraySet<K> A simple, brute-force implementation of a set based on a backing array.ObjectAVLTreeSet<K> A type-specific AVL tree set with a fast, small-footprint implementation.ObjectBigArrayBigList<K> A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectBigArrays A class providing static methods and objects that do useful things with big arrays.ObjectBigListIterators A class providing static methods and objects that do useful things with type-specific iterators.ObjectBigListIterators.AbstractIndexBasedBigIterator<K> A skeletal implementation for an iterator backed by an index based data store.ObjectBigListIterators.AbstractIndexBasedBigListIterator<K> A skeletal implementation for a list-iterator backed by an index based data store.ObjectBigListIterators.BigListIteratorListIterator<K> A class exposing a list iterator as a big-list iterator..ObjectBigListIterators.EmptyBigListIterator<K> A class returning no elements and a type-specific big list iterator interface.ObjectBigListIterators.UnmodifiableBigListIterator<K> An unmodifiable wrapper class for big list iterators.ObjectBigLists A class providing static methods and objects that do useful things with type-specific big lists.ObjectBigLists.EmptyBigList<K> An immutable class representing an empty type-specific big list.ObjectBigLists.ListBigList<K> A class exposing a list as a big list.ObjectBigLists.Singleton<K> An immutable class representing a type-specific singleton big list.ObjectBigLists.SynchronizedBigList<K> A synchronized wrapper class for big lists.ObjectBigLists.UnmodifiableBigList<K> An unmodifiable wrapper class for big lists.ObjectBigSpliterators A class providing static methods and objects that do useful things with type-specific spliterators on big (potentially greater thenInteger.MAX_VALUE
items long).ObjectBigSpliterators.AbstractIndexBasedSpliterator<K> A skeletal implementation for a spliterator backed by an index based data store.ObjectBigSpliterators.EarlyBindingSizeIndexBasedSpliterator<K> A skeletal implementation for a spliterator backed by an index based data store.ObjectBigSpliterators.LateBindingSizeIndexBasedSpliterator<K> A skeletal implementation for a spliterator backed by an index based data store.ObjectCollections A class providing static methods and objects that do useful things with type-specific collections.ObjectCollections.EmptyCollection<K> An immutable class representing an empty type-specific collection.ObjectCollections.IterableCollection<K> A collection wrapper class for iterables.ObjectComparators A class providing static methods and objects that do useful things with comparators.ObjectDoubleImmutablePair<K> A type-specific immutablePair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectDoubleMutablePair<K> A type-specific mutablePair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectHeapIndirectPriorityQueue<K> A type-specific heap-based indirect priority queue.ObjectHeapPriorityQueue<K> A type-specific heap-based priority queue.ObjectHeaps A class providing static methods and objects that do useful things with heaps.ObjectHeapSemiIndirectPriorityQueue<K> A type-specific heap-based semi-indirect priority queue.ObjectImmutableList<K> A type-specific array-based immutable list; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectIndirectHeaps A class providing static methods and objects that do useful things with indirect heaps.ObjectIntImmutablePair<K> A type-specific immutablePair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectIntMutablePair<K> A type-specific mutablePair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectIterables A class providing static methods and objects that do useful things with type-specific iterables.ObjectIterators A class providing static methods and objects that do useful things with type-specific iterators.ObjectIterators.AbstractIndexBasedIterator<K> A skeletal implementation for an iterator backed by an index-based data store.ObjectIterators.AbstractIndexBasedListIterator<K> A skeletal implementation for a list-iterator backed by an index-based data store.ObjectIterators.EmptyIterator<K> A class returning no elements and a type-specific iterator interface.ObjectIterators.UnmodifiableBidirectionalIterator<K> An unmodifiable wrapper class for bidirectional iterators.ObjectIterators.UnmodifiableIterator<K> An unmodifiable wrapper class for iterators.ObjectIterators.UnmodifiableListIterator<K> An unmodifiable wrapper class for list iterators.ObjectLinkedOpenCustomHashSet<K> A type-specific linked hash set with with a fast, small-footprint implementation.ObjectLinkedOpenHashSet<K> A type-specific linked hash set with with a fast, small-footprint implementation.ObjectLists A class providing static methods and objects that do useful things with type-specific lists.ObjectLists.EmptyList<K> An immutable class representing an empty type-specific list.ObjectLists.Singleton<K> An immutable class representing a type-specific singleton list.ObjectLists.SynchronizedList<K> A synchronized wrapper class for lists.ObjectLists.SynchronizedRandomAccessList<K> A synchronized wrapper class for random-access lists.ObjectLists.UnmodifiableList<K> An unmodifiable wrapper class for lists.ObjectLists.UnmodifiableRandomAccessList<K> An unmodifiable wrapper class for random-access lists.ObjectLongImmutablePair<K> A type-specific immutablePair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectLongMutablePair<K> A type-specific mutablePair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectObjectImmutablePair<K,V> A type-specific immutablePair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectObjectImmutableSortedPair<K extends java.lang.Comparable<K>> A type-specific immutableSortedPair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectObjectMutablePair<K,V> A type-specific mutablePair
; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectOpenCustomHashSet<K> A type-specific hash set with a fast, small-footprint implementation whose hashing strategy is specified at creation time.ObjectOpenHashBigSet<K> A type-specific hash big set with with a fast, small-footprint implementation.ObjectOpenHashSet<K> A type-specific hash set with with a fast, small-footprint implementation.ObjectRBTreeSet<K> A type-specific red-black tree set with a fast, small-footprint implementation.ObjectSemiIndirectHeaps A class providing static methods and objects that do useful things with semi-indirect heaps.ObjectSets A class providing static methods and objects that do useful things with type-specific sets.ObjectSets.EmptySet<K> An immutable class representing the empty set and implementing a type-specific set interface.ObjectSets.Singleton<K> An immutable class representing a type-specific singleton set.ObjectSets.SynchronizedSet<K> A synchronized wrapper class for sets.ObjectSets.UnmodifiableSet<K> An unmodifiable wrapper class for sets.ObjectSortedSets A class providing static methods and objects that do useful things with type-specific sorted sets.ObjectSortedSets.EmptySet<K> An immutable class representing the empty sorted set and implementing a type-specific set interface.ObjectSortedSets.Singleton<K> A class representing a singleton sorted set.ObjectSortedSets.SynchronizedSortedSet<K> A synchronized wrapper class for sorted sets.ObjectSortedSets.UnmodifiableSortedSet<K> An unmodifiable wrapper class for sorted sets.ObjectSpliterators A class providing static methods and objects that do useful things with type-specific spliterators.ObjectSpliterators.AbstractIndexBasedSpliterator<K> A skeletal implementation for a spliterator backed by an index based data store.ObjectSpliterators.EarlyBindingSizeIndexBasedSpliterator<K> A skeletal implementation for a spliterator backed by an index based data store.ObjectSpliterators.EmptySpliterator<K> A class returning no elements and a type-specific spliterator interface.ObjectSpliterators.LateBindingSizeIndexBasedSpliterator<K> A skeletal implementation for a spliterator backed by an index based data store.