All Classes and Interfaces
Class
Description
An abstract class providing basic methods for functions 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 functions 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 functions 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 functions 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 functions implementing a type-specific interface.
An abstract class providing basic methods for functions 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
fastutil 8 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 of
fastutil 8 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 facilitating the creation of type-specific iterators.
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.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.
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.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
fastutil 8 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.
Deprecated.
As of
fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the 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 of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.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.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.
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.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.
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.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
fastutil 8 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.
Deprecated.
As of
fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the 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 of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.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.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.
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.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.
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.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
fastutil 8 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.
Deprecated.
As of
fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the 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 of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.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.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.
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.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.
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.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
fastutil 8 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.
Deprecated.
As of
fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the 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 of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.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.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.
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.Deprecated.
As of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of IndirectPriorityQueue.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.
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.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
fastutil 8 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.
Deprecated.
As of
fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the 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 of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.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.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.
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.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.
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.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
fastutil 8 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.
Deprecated.
As of
fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the 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 of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.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.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.
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.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.
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.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
fastutil 8 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 of
fastutil 8 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.
Deprecated.
As of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of PriorityQueue.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.
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.
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.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
fastutil 8 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.
Deprecated.
As of
fastutil 8 this class is no longer necessary, as its only previous abstract
method is now a default method of the 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 of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of the type-specific interface.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.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.
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.Deprecated.
As of
fastutil 8 this class is no longer necessary, as its previous abstract
methods are now default methods of Stack.A class providing static methods and objects that do useful things with arrays.
A bidirectional
Iterator.A class providing static methods and objects that do useful things with big
arrays.
A list with big (i.e., 64-bit) indices.
A list iterator over a
BigList.An object that can swap elements whose positions are specified by longs.
Provides static methods to perform easily binary I/O.
A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Function; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific array-based list; 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 arrays.
A simple, brute-force implementation of a set based on a backing array.
A type-specific
Iterable that further strengthens the specification of Iterable.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 list based on a big array; 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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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
BinaryOperator; provides methods operating both on objects
and on primitives.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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
Comparator; provides methods to compare two primitive types both as objects
and as primitive types.A class providing static methods and objects that do useful things with comparators.
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Hash interface.A type-specific hash strategy.
A type-specific array-based immutable list; provides some additional methods that use polymorphism to avoid (un)boxing.
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Iterable that strengthens that specification of BooleanIterable.iterator() and BooleanIterable.forEach(Consumer).A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific hash set with with a fast, small-footprint implementation.
A type-specific
Predicate; provides methods to test a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Spliterator; 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 type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives.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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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.
Compact storage of big lists of arrays using front-coding (also known as prefix-omission) compression.
Compact storage of lists of arrays using front-coding (also known as prefix-omission) compression.
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-specific
Iterable that further strengthens the specification of Iterable.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 list based on a big array; 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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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
BinaryOperator; provides methods operating both on objects
and on primitives.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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
Comparator; provides methods to compare two primitive types both as objects
and as primitive types.A class providing static methods and objects that do useful things with comparators.
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Hash interface.A type-specific hash strategy.
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
IndirectPriorityQueue.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Iterable that strengthens that specification of ByteIterable.iterator() and ByteIterable.forEach(Consumer).A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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.
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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 set with with a fast, small-footprint implementation.
A type-specific
Predicate; provides methods to test a primitive type both as object
and as primitive.A type-specific
PriorityQueue; 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 priority queues.
A synchronized wrapper class for priority queues.
A type-specific red-black tree set with a fast, small-footprint implementation.
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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.
A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
SortedSet; 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-specific
Spliterator; 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 type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives.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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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.
Compact storage of big lists of arrays using front-coding (also known as prefix-omission) compression.
Compact storage of lists of arrays using front-coding (also known as prefix-omission) compression.
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-specific
Iterable that further strengthens the specification of Iterable.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 list based on a big array; 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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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
BinaryOperator; provides methods operating both on objects
and on primitives.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair.A type-specific
Collection; 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
Comparator; provides methods to compare two primitive types both as objects
and as primitive types.A class providing static methods and objects that do useful things with comparators.
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Hash interface.A type-specific hash strategy.
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
IndirectPriorityQueue.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Iterable that strengthens that specification of CharIterable.iterator() and CharIterable.forEach(Consumer).A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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.
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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 set with with a fast, small-footprint implementation.
A type-specific
Predicate; provides methods to test a primitive type both as object
and as primitive.A type-specific
PriorityQueue; 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 priority queues.
A synchronized wrapper class for priority queues.
A type-specific red-black tree set with a fast, small-footprint implementation.
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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.
A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
SortedSet; 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-specific
Spliterator; 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 type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives.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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Iterable that further strengthens the specification of Iterable.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 list based on a big array; 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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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
BinaryOperator; provides methods operating both on objects
and on primitives.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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
Comparator; provides methods to compare two primitive types both as objects
and as primitive types.A class providing static methods and objects that do useful things with comparators.
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Hash interface.A type-specific hash strategy.
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
IndirectPriorityQueue.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Iterable that strengthens that specification of DoubleIterable.iterator() and DoubleIterable.forEach(Consumer).A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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.
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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
Predicate; provides methods to test a primitive type both as object
and as primitive.A type-specific
PriorityQueue; 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 priority queues.
A synchronized wrapper class for priority queues.
A type-specific red-black tree set with a fast, small-footprint implementation.
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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.
A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
SortedSet; 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-specific
Spliterator; 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 type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives.Lightweight, unsynchronized, aligned input stream buffering class with
true skipping,
measurability,
repositionability
and line reading support.
An enumeration of the supported line terminators.
Lightweight, unsynchronized output stream buffering class with
measurability and
repositionability.
Simple, fast and repositionable byte-array input stream.
Simple, fast byte-array output stream that exposes the backing array.
Simple, fast and repositionable byte array input stream that multiplexes its content among several arrays.
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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Iterable that further strengthens the specification of Iterable.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 list based on a big array; 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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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
BinaryOperator; provides methods operating both on objects
and on primitives.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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
Comparator; provides methods to compare two primitive types both as objects
and as primitive types.A class providing static methods and objects that do useful things with comparators.
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair.A type-specific
Hash interface.A type-specific hash strategy.
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
IndirectPriorityQueue.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Iterable that strengthens that specification of FloatIterable.iterator() and FloatIterable.forEach(Consumer).A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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.
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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
Predicate; provides methods to test a primitive type both as object
and as primitive.A type-specific
PriorityQueue; 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 priority queues.
A synchronized wrapper class for priority queues.
A type-specific red-black tree set with a fast, small-footprint implementation.
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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.
A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
SortedSet; 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-specific
Spliterator; 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 type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives.A function mapping keys into values.
Basic data for all hash-based classes.
A generic hash strategy.
Common code for all hash-based classes.
An indirect priority queue.
A class providing static methods and objects that do useful things with indirect priority queues.
An immutable class representing the empty indirect priority queue.
A synchronized wrapper class for indirect priority queues.
A repositionable
MeasurableInputStream based on
cached data received by a WritableByteChannel whose first bytes can be inspected directly.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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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.
Compact storage of big lists of arrays using front-coding (also known as prefix-omission) compression.
Compact storage of lists of arrays using front-coding (also known as prefix-omission) compression.
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-specific
Iterable that further strengthens the specification of Iterable.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 list based on a big array; 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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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
BinaryOperator; provides methods operating both on objects
and on primitives.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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
Comparator; provides methods to compare two primitive types both as objects
and as primitive types.A class providing static methods and objects that do useful things with comparators.
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Hash interface.A type-specific hash strategy.
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
IndirectPriorityQueue.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair.A type-specific
Iterable that strengthens that specification of IntIterable.iterator() and IntIterable.forEach(Consumer).A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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.
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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
Predicate; provides methods to test a primitive type both as object
and as primitive.A type-specific
PriorityQueue; 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 priority queues.
A synchronized wrapper class for priority queues.
A type-specific red-black tree set with a fast, small-footprint implementation.
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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.
A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
SortedSet; 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-specific
Spliterator; 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 type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives.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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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.
Compact storage of big lists of arrays using front-coding (also known as prefix-omission) compression.
Compact storage of lists of arrays using front-coding (also known as prefix-omission) compression.
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-specific
Iterable that further strengthens the specification of Iterable.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 list based on a big array; 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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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
BinaryOperator; provides methods operating both on objects
and on primitives.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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
Comparator; provides methods to compare two primitive types both as objects
and as primitive types.A class providing static methods and objects that do useful things with comparators.
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Hash interface.A type-specific hash strategy.
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
IndirectPriorityQueue.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Iterable that strengthens that specification of LongIterable.iterator() and LongIterable.forEach(Consumer).A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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.
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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
Predicate; provides methods to test a primitive type both as object
and as primitive.A type-specific
PriorityQueue; 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 priority queues.
A synchronized wrapper class for priority queues.
A type-specific red-black tree set with a fast, small-footprint implementation.
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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.
A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
SortedSet; 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-specific
Spliterator; 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 type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives.An
InputStream that implements also the MeasurableStream interface.An
OutputStream that implements also the MeasurableStream interface.An stream that provides eager access to its length,
and keeps track of the current position (e.g., the number of bytes read so far, or the current
position of the file pointer).
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-specific
Function; 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-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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.
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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.
A type-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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-specific
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Iterable that further strengthens the specification of Iterable.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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Iterable that strengthens that specification of ObjectIterable.iterator().A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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.
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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.
A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
SortedSet; 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-specific
Spliterator; 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 pair of elements.
A priority queue.
A class providing static methods and objects that do useful things with priority queues.
An immutable class representing the empty priority queue.
A synchronized wrapper class for priority queues.
A simple, brute-force implementation of a map based on two parallel backing arrays.
A type-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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
SortedMap; 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-specific
BigList; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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-specific
List; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
SortedSet; 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 basic interface specifying positioning methods for a byte stream.
Static utility method for safe conversions between primitive types.
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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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-specific
Function; 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
Map; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value.A type-specific
Map.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-specific
SortedMap; 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.
Compact storage of big lists of arrays using front-coding (also known as prefix-omission) compression.
Compact storage of lists of arrays using front-coding (also known as prefix-omission) compression.
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-specific
Iterable that further strengthens the specification of Iterable.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 list based on a big array; 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-specific
BigList; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
BigListIterator.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 then
Integer.MAX_VALUE items 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
BinaryOperator; provides methods operating both on objects
and on primitives.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Collection; 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
Comparator; provides methods to compare two primitive types both as objects
and as primitive types.A class providing static methods and objects that do useful things with comparators.
A type-specific
Consumer; provides methods to consume a primitive type both as object
and as primitive.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Hash interface.A type-specific hash strategy.
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
IndirectPriorityQueue.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Iterable that strengthens that specification of ShortIterable.iterator() and ShortIterable.forEach(Consumer).A class providing static methods and objects that do useful things with type-specific iterables.
A type-specific
Iterator; 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.
A type-specific
List; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific bidirectional iterator that is also a
ListIterator.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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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 set with with a fast, small-footprint implementation.
A type-specific
Predicate; provides methods to test a primitive type both as object
and as primitive.A type-specific
PriorityQueue; 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 priority queues.
A synchronized wrapper class for priority queues.
A type-specific red-black tree set with a fast, small-footprint implementation.
A type-specific immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; 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.
A type-specific
Set; 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 immutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific mutable
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
Pair; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific immutable
SortedPair.A type-specific
SortedSet; 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-specific
Spliterator; 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 type-specific
Stack; provides some additional methods that use polymorphism to avoid (un)boxing.A type-specific
UnaryOperator; provides methods operating both on objects
and on primitives.An interface for data structures whose size can exceed
Integer.MAX_VALUE.A pair of sorted elements.
A stack.
An object that can swap elements whose position is specified by integers.
Provides static methods to perform easily textual I/O.
fastutil8 this class is no longer necessary, as its previous abstract methods are now default methods of the type-specific interface.