|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
BiMap<K,V> | A bimap (or "bidirectional map") is a map that preserves the uniqueness of its values as well as that of its keys. |
ClassToInstanceMap<B> | A map, each entry of which maps a Java raw type to an instance of that type. |
Constraint<E> | A constraint that an element must satisfy in order to be added to a collection. |
ListMultimap<K,V> | A Multimap that can hold duplicate key-value pairs and that maintains
the insertion ordering of values for a given key. |
MapConstraint<K,V> | A constraint on the keys and values that may be added to a Map or
Multimap . |
Multimap<K,V> | A collection similar to a Map , but which may associate multiple
values with a single key. |
Multiset<E> | A collection that supports order-independent equality, like Set , but
may have duplicate elements. |
Multiset.Entry<E> | An unmodifiable element-count pair for a multiset. |
PeekingIterator<E> | An iterator that supports a one-element lookahead while iterating. |
SerializableComparator<T> | A serializable comparator. |
SetMultimap<K,V> | A Multimap that cannot hold duplicate key-value pairs. |
SortedSetMultimap<K,V> | A SetMultimap whose set of values for a given key are kept sorted;
that is, they comprise a SortedSet . |
Class Summary | |
---|---|
AbstractIterable<E> | Provides an implementation of Object.toString() for Iterable
instances. |
AbstractIterator<T> | This class provides a skeletal implementation of the Iterator
interface, to make this interface easier to implement for certain types of
data sources. |
AbstractMapEntry<K,V> | Implementation of the equals , hashCode , and toString
methods of Entry . |
AbstractMultiset<E> | This class provides a skeletal implementation of the Multiset
interface. |
AbstractMultisetEntry<E> | Implementation of the equals , hashCode , and toString
methods of Multiset.Entry . |
AbstractRemovableIterator<T> | A specialization of AbstractIterator for data sources which can
handle arbitrary removal by element, concurrently with iteration. |
ArrayListMultimap<K,V> | Implementation of Multimap that uses an ArrayList to store
the values for a given key. |
Comparators | Standard comparators and utilities for creating and working with comparators. |
ConcurrentMultiset<E> | A multiset that supports concurrent modifications and that provides atomic
versions of most Multiset operations (exceptions where noted). |
Constraints | Factories and utilities pertaining to the Constraint interface. |
EnumBiMap<K extends Enum<K>,V extends Enum<V>> | A BiMap backed by two EnumMap instances. |
EnumHashBiMap<K extends Enum<K>,V> | A BiMap backed by an EnumMap instance for keys-to-values, and
a HashMap instance for values-to-keys. |
EnumMultiset<E extends Enum<E>> | Multiset implementation backed by an EnumMap . |
ForwardingCollection<E> | A collection which forwards all its method calls to another collection. |
ForwardingConcurrentMap<K,V> | A concurrent map which forwards all its method calls to another concurrent map. |
ForwardingIterator<T> | An iterator which forwards all its method calls to another iterator. |
ForwardingList<E> | A list which forwards all its method calls to another list. |
ForwardingListIterator<E> | A list iterator which forwards all its method calls to another list iterator. |
ForwardingMap<K,V> | A map which forwards all its method calls to another map. |
ForwardingMapEntry<K,V> | A map entry which forwards all its method calls to another map entry. |
ForwardingMultimap<K,V> | A multimap which forwards all its method calls to another multimap. |
ForwardingMultiset<E> | A multiset which forwards all its method calls to another multiset. |
ForwardingObject | An abstract base class for implementing the decorator pattern. |
ForwardingQueue<E> | A queue which forwards all its method calls to another queue. |
ForwardingSet<E> | A set which forwards all its method calls to another set. |
ForwardingSortedMap<K,V> | A sorted map which forwards all its method calls to another sorted map. |
ForwardingSortedSet<E> | A sorted set which forwards all its method calls to another sorted set. |
HashBiMap<K,V> | A BiMap backed by two HashMap instances. |
HashMultimap<K,V> | Implementation of Multimap using hash tables. |
HashMultiset<E> | Multiset implementation backed by a HashMap . |
ImmutableBiMapBuilder<K,V> | A convenient way to populate immutable BiMap instances, especially static-final "constant BiMaps". |
ImmutableCollection<E> | An immutable collection. |
ImmutableList<E> | A high-performance, immutable, random-access List implementation. |
ImmutableMap<K,V> | An immutable, hash-based Map with reliable user-specified iteration
order. |
ImmutableMap.Builder<K,V> | A builder for creating immutable map instances, especially public
static final maps ("constant maps"). |
ImmutableMultimapBuilder<K,V> | A convenient way to populate immutable Multimap instances, especially static-final "constant Multimaps". |
ImmutableSet<E> | A high-performance, immutable, hash-based Set with reliable,
user-specified iteration order. |
ImmutableSortedSet<E> | An immutable SortedSet that stores its elements in a sorted array. |
Iterables | This class contains static utility methods that operate on or return objects
of type Iterable . |
Iterators | This class contains static utility methods that operate on or return objects
of type Iterator . |
LinkedHashMultimap<K,V> | Implementation of Multimap that does not allow duplicate key-value
entries and that returns collections whose iterators follow the ordering in
which the data was added to the multimap. |
LinkedHashMultiset<E> | A Multiset implementation with predictable iteration order. |
LinkedListMultimap<K,V> | An implementation of ListMultimap that supports deterministic
iteration order for both keys and values. |
Lists | Provides static methods for creating List instances easily. |
MapConstraints | Factory and utilities pertaining to the MapConstraint interface. |
Maps | Provides static methods for creating mutable Map instances easily. |
Multimaps | Provides static methods acting on or generating a Multimap . |
Multisets | Provides static utility methods for creating and working with Multiset instances. |
ObjectArrays | Static utility methods pertaining to object arrays. |
Ordering<T> | A base class for Serializable comparators that
provides convenience methods for common uses. |
PrimitiveArrays | Static utility methods pertaining to arrays of Java primitives. |
ReferenceMap<K,V> | A ConcurrentMap implementation that internally utilizes your choice
of strong, soft or weak references for its keys and for its values. |
Sets | Provides static methods for creating mutable Set instances easily and
other static methods for working with sets. |
Sets.SetView<E> | An unmodifiable view of a set which may be backed by other sets; this view will change as the backing sets do. |
TreeMultimap<K,V> | Implementation of Multimap whose keys and values are ordered by their
natural ordering or by supplied comparators. |
TreeMultiset<E> | Multiset implementation backed by a TreeMap. |
This package contains generic collection interfaces and implementations, and other utilities for working with collections.
BiMap
Map
that guarantees the uniqueness of
its values as well as that of its keys. This is sometimes called an
"invertible map," since the restriction on values enables it to support
an inverse view --
which is another instance of BiMap
.
Multiset
Collection
that may contain duplicate
values like a List
, yet has order-independent equality
like a Set
. One typical use for a multiset is to
represent a histogram.
Multimap
Map
, but may contain
multiple entries with the same key. Some behaviors of
Multimap
are left unspecified and are
provided only by the two subtypes mentioned next.
SetMultimap
Multimap
which has
order-independent equality and does not allow duplicate entries; that is,
while a key may appear twice in a SetMultimap
, each must map to a
different value. SetMultimap
takes its name from the fact that
the collection of
values associated with a fixed key fulfills the Set
contract.
ListMultimap
Multimap
which permits
duplicate entries, supports random access of values for a particular key,
and has partially order-dependent equality as defined by
ListMultimap.equals(Object)
. ListMultimap
takes its name from the fact that the collection of values
associated with a fixed key fulfills the List
contract.
SortedSetMultimap
SetMultimap
for which
the collection values associated with a fixed key is a
SortedSet
.
List
ImmutableList
Set
ImmutableSet
Map
ReferenceMap
BiMap
HashBiMap
EnumBiMap
EnumHashBiMap
Multiset
EnumMultiset
HashMultiset
LinkedHashMultiset
TreeMultiset
Multimap
ArrayListMultimap
LinkedListMultimap
HashMultimap
LinkedHashMultimap
TreeMultimap
AbstractIterator
AbstractIterable
AbstractMapEntry
AbstractMultiset
AbstractMultisetEntry
Comparators
Iterators
Iterables
Lists
Maps
Sets
Multisets
Multimaps
ObjectArrays
PrimitiveArrays
ForwardingCollection
ForwardingIterator
ForwardingList
ForwardingListIterator
ForwardingMap
ForwardingMapEntry
ForwardingMultimap
ForwardingMultiset
ForwardingObject
ForwardingQueue
ForwardingSet
ForwardingSortedMap
ForwardingSortedSet
The methods of this package always throw NullPointerException
in response to a null value being supplied
for any parameter that is not explicitly annotated as being @Nullable
.
This package does not support self-containing collections: a collection instance that includes itself, or an object that references itself, as a member. Doing so may lead to undefined behavior. For example, deserialization can generate multiple copies of the self-containing collection. However, no problems will arise when a collection contains an element of the same type, as long as it's a different instance.
|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |