Package it.unimi.dsi.fastutil.objects
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-based collections, which use identity (==). See the related comments
in the overview.
-
ClassDescriptionAn abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.Deprecated.An abstract class providing basic methods for big lists implementing a type-specific big list interface.A class implementing a sublist view.Deprecated.As of
fastutil8 this class is no longer necessary, as its previous abstract methods are now default methods of the type-specific interface.An abstract class providing basic methods for collections implementing a type-specific interface.An abstract class facilitating the creation of type-specific iterators.An abstract class providing basic methods for lists implementing a type-specific list interface.A class implementing a sublist view.Deprecated.As offastutil8 this class is no longer necessary, as its previous abstract methods are now default methods of the type-specific interface.An abstract class providing basic methods for sets implementing a type-specific interface.An abstract class providing basic methods for sorted sets implementing a type-specific interface.An abstract class facilitating the creation of type-specific iterators.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for functions implementing a type-specific interface.An abstract class providing basic methods for maps implementing a type-specific interface.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).This class provides a basic implementation for an Entry set which forwards some queries to the map.An abstract class providing basic methods for sorted maps implementing a type-specific interface.An abstract class providing basic methods for big lists implementing a type-specific big list interface.A class implementing a sublist view.An abstract class providing basic methods for collections implementing a type-specific interface.An abstract class providing basic methods for lists implementing a type-specific list interface.A class implementing a sublist view.An abstract class providing basic methods for sets implementing a type-specific interface.An abstract class providing basic methods for sorted sets implementing a type-specific interface.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.Object2ObjectMap<K,V> A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.Object2ReferenceMap<K,V> A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specific AVL tree map with a fast, small-footprint implementation.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specific red-black tree map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A type-specific array-based FIFO queue, supporting also deque operations.A type-specific array-based semi-indirect priority queue.A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific array-based priority queue.A class providing static methods and objects that do useful things with type-specific arrays.A simple, brute-force implementation of a set based on a backing array.A type-specific AVL tree set with a fast, small-footprint implementation.A type-specificIterablethat further strengthens the specification ofIterable.iterator().A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements backwards.A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with big arrays.A type-specificBigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificBigListIterator.A class providing static methods and objects that do useful things with type-specific iterators.A skeletal implementation for an iterator backed by an index based data store.A skeletal implementation for a list-iterator backed by an index based data store.A class exposing a list iterator as a big-list iterator..A class returning no elements and a type-specific big list iterator interface.An unmodifiable wrapper class for big list iterators.A class providing static methods and objects that do useful things with type-specific big lists.An immutable class representing an empty type-specific big list.A class exposing a list as a big list.An immutable class representing a type-specific singleton big list.A synchronized wrapper class for big lists.An unmodifiable wrapper class for big lists.A class providing static methods and objects that do useful things with type-specific spliterators on big (potentially greater thenInteger.MAX_VALUEitems long).A skeletal implementation for a spliterator backed by an index based data store.A skeletal implementation for a spliterator backed by an index based data store.A skeletal implementation for a spliterator backed by an index based data store.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificCollection; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific collections.An immutable class representing an empty type-specific collection.A collection wrapper class for iterables.A class providing static methods and objects that do useful things with comparators.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific heap-based indirect priority queue.A type-specific heap-based priority queue.A class providing static methods and objects that do useful things with heaps.A type-specific heap-based semi-indirect priority queue.A type-specific array-based immutable list; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with indirect heaps.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificIterablethat strengthens that specification ofObjectIterable.iterator().A class providing static methods and objects that do useful things with type-specific iterables.A type-specificIterator; provides an additional method to avoid (un)boxing, and the possibility to skip elements.A class providing static methods and objects that do useful things with type-specific iterators.A skeletal implementation for an iterator backed by an index-based data store.A skeletal implementation for a list-iterator backed by an index-based data store.A class returning no elements and a type-specific iterator interface.An unmodifiable wrapper class for bidirectional iterators.An unmodifiable wrapper class for iterators.An unmodifiable wrapper class for list iterators.A type-specific linked hash set with with a fast, small-footprint implementation.A type-specific linked hash set with with a fast, small-footprint implementation.ObjectList<K>A type-specificList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also aListIterator.A class providing static methods and objects that do useful things with type-specific lists.An immutable class representing an empty type-specific list.An immutable class representing a type-specific singleton list.A synchronized wrapper class for lists.A synchronized wrapper class for random-access lists.An unmodifiable wrapper class for lists.An unmodifiable wrapper class for random-access lists.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectObjectImmutableSortedPair<K extends Comparable<K>>A type-specific immutableSortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific hash set with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash big set with with a fast, small-footprint implementation.A type-specific hash set with with a fast, small-footprint implementation.A type-specific red-black tree set with a fast, small-footprint implementation.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.ObjectReferencePair<K,V> A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with semi-indirect heaps.ObjectSet<K>A type-specificSet; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific sets.An immutable class representing the empty set and implementing a type-specific set interface.An immutable class representing a type-specific singleton set.A synchronized wrapper class for sets.An unmodifiable wrapper class for sets.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificSortedSet; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific sorted sets.An immutable class representing the empty sorted set and implementing a type-specific set interface.A class representing a singleton sorted set.A synchronized wrapper class for sorted sets.An unmodifiable wrapper class for sorted sets.A type-specificSpliterator; provides an additional methods to avoid (un)boxing, and the possibility to skip elements.A class providing static methods and objects that do useful things with type-specific spliterators.A skeletal implementation for a spliterator backed by an index based data store.A skeletal implementation for a spliterator backed by an index based data store.A class returning no elements and a type-specific spliterator interface.A skeletal implementation for a spliterator backed by an index based data store.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.Reference2ObjectMap<K,V> A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A simple, brute-force implementation of a map based on two parallel backing arrays.A type-specificFunction; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific functions.An immutable class representing an empty type-specific function.An adapter for mapping generic total functions to partial primitive functions.An immutable class representing a type-specific singleton function.A synchronized wrapper class for functions.An unmodifiable wrapper class for functions.A type-specific linked hash map with with a fast, small-footprint implementation.A type-specificMap; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specificMap.Entry; provides some additional methods that use polymorphism to avoid (un)boxing.An entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific maps.An immutable class representing an empty type-specific map.An immutable class representing a type-specific singleton map.A synchronized wrapper class for maps.An unmodifiable wrapper class for maps.A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.A type-specific hash map with a fast, small-footprint implementation.A type-specificSortedMap; provides some additional methods that use polymorphism to avoid (un)boxing.A sorted entry set providing fast iteration.A class providing static methods and objects that do useful things with type-specific sorted maps.An immutable class representing an empty type-specific sorted map.An immutable class representing a type-specific singleton sorted map.A synchronized wrapper class for sorted maps.An unmodifiable wrapper class for sorted maps.A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.A simple, brute-force implementation of a set based on a backing array.A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificBigList; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific big lists.An immutable class representing an empty type-specific big list.A class exposing a list as a big list.An immutable class representing a type-specific singleton big list.A synchronized wrapper class for big lists.An unmodifiable wrapper class for big lists.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificCollection; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific collections.An immutable class representing an empty type-specific collection.A collection wrapper class for iterables.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific array-based immutable list; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific linked hash set with with a fast, small-footprint implementation.A type-specificList; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific lists.An immutable class representing an empty type-specific list.An immutable class representing a type-specific singleton list.A synchronized wrapper class for lists.A synchronized wrapper class for random-access lists.An unmodifiable wrapper class for lists.An unmodifiable wrapper class for random-access lists.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.ReferenceObjectPair<K,V> A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific hash big set with with a fast, small-footprint implementation.A type-specific hash set with with a fast, small-footprint implementation.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.ReferenceSet<K>A type-specificSet; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific sets.An immutable class representing the empty set and implementing a type-specific set interface.An immutable class representing a type-specific singleton set.A synchronized wrapper class for sets.An unmodifiable wrapper class for sets.A type-specific immutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutablePair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specificSortedSet; provides some additional methods that use polymorphism to avoid (un)boxing.A class providing static methods and objects that do useful things with type-specific sorted sets.An immutable class representing the empty sorted set and implementing a type-specific set interface.A class representing a singleton sorted set.A synchronized wrapper class for sorted sets.An unmodifiable wrapper class for sorted sets.
fastutil8 this class is no longer necessary, as its previous abstract methods are now default methods of the type-specific interface.