All Classes and Interfaces

Class
Description
An abstract class providing basic methods for sets implementing a type-specific interface.
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
A simple, brute-force implementation of a set based on a backing array.
A type-specific AVL tree set with a fast, small-footprint implementation.
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 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 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 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.