Package com.google.common.collect
@CheckReturnValue
@NullMarked
package com.google.common.collect
Collection interfaces and implementations, and other utilities for collections. This package is a
part of the open-source Guava library.
The classes in this package include:
Immutable collections
These are collections whose contents will never change. They also offer a few additional guarantees (seeImmutableCollection
for details). Implementations are available for both
the JDK collection types and the Guava collection types (listed below).
Collection types
Multimap
- A new type, which is similar to
Map
, but may contain multiple entries with the same key. Some behaviors ofMultimap
are left unspecified and are provided only by the subtypes mentioned below. ListMultimap
- An extension of
Multimap
which permits duplicate entries, supports random access of values for a particular key, and has partially order-dependent equality as defined byListMultimap.equals(Object)
.ListMultimap
takes its name from the fact that the collection of values associated with a given key fulfills theList
contract. SetMultimap
- An extension of
Multimap
which has order-independent equality and does not allow duplicate entries; that is, while a key may appear twice in aSetMultimap
, each must map to a different value.SetMultimap
takes its name from the fact that the collection of values associated with a given key fulfills theSet
contract. SortedSetMultimap
- An extension of
SetMultimap
for which the collection values associated with a given key is aSortedSet
. BiMap
- An extension of
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 ofBiMap
. Table
- A new type, which is similar to
Map
, but which indexes its values by an ordered pair of keys, a row key and column key. Multiset
- An extension of
Collection
that may contain duplicate values like aList
, yet has order-independent equality like aSet
. One typical use for a multiset is to represent a histogram. ClassToInstanceMap
- An extension of
Map
that associates a raw type with an instance of that type.
Ranges
Classes of static utility methods
Collections2
Comparators
Iterables
Iterators
Lists
Maps
MoreCollectors
Multimaps
Multisets
ObjectArrays
Queues
Sets
Streams
Tables
Abstract implementations
Forwarding collections
We provide implementations of collections that forward all method calls to a delegate collection by default. Subclasses can override one or more methods to implement the decorator pattern. For an example, seeForwardingCollection
.
Other
-
ClassDescriptionThis class provides a skeletal implementation of the
Iterator
interface, to make this interface easier to implement for certain types of data sources.This class provides a skeletal implementation of theIterator
interface for sequences whose next element can always be derived from the previous element.Implementation ofMultimap
that uses anArrayList
to store the values for a given key.ArrayTable<R,C, V> Fixed-sizeTable
implementation backed by a two-dimensional array.A bimap (or "bidirectional map") is a map that preserves the uniqueness of its values as well as that of its keys.Indicates whether an endpoint of some range is contained in the range itself ("closed") or not ("open").A map, each entry of which maps a Java raw type to an instance of that type.Provides static methods for working withCollection
instances.Provides static methods for working withComparator
instances.A utility for performing a chained comparison statement.Deprecated.A multiset that supports concurrent modifications and that provides atomic versions of mostMultiset
operations (exceptions where noted).ContiguousSet<C extends Comparable>A sorted set of contiguous values in a givenDiscreteDomain
.DiscreteDomain<C extends Comparable>A descriptor for a discreteComparable
domain such as allInteger
instances.ABiMap
backed by twoEnumMap
instances.ABiMap
backed by anEnumMap
instance for keys-to-values, and aHashMap
instance for values-to-keys.EnumMultiset<E extends Enum<E>>Multiset implementation specialized for enum elements, supporting all single-element operations in O(1).A non-blocking queue which automatically evicts elements from the head of the queue when attempting to add new elements onto the queue and it is full.A discouraged (but not deprecated) precursor to Java's superiorStream
library.Deprecated.This class has moved tocom.google.common.util.concurrent
.A collection which forwards all its method calls to another collection.A concurrent map which forwards all its method calls to another concurrent map.A deque which forwards all its method calls to another deque.An iterator which forwards all its method calls to another iterator.A list which forwards all its method calls to another list.A list iterator which forwards all its method calls to another list iterator.A list multimap which forwards all its method calls to another list multimap.A map which forwards all its method calls to another map.A map entry which forwards all its method calls to another map entry.A multimap which forwards all its method calls to another multimap.A multiset which forwards all its method calls to another multiset.A navigable map which forwards all its method calls to another navigable map.A navigable set which forwards all its method calls to another navigable set.An abstract base class for implementing the decorator pattern.A queue which forwards all its method calls to another queue.A set which forwards all its method calls to another set.A set multimap which forwards all its method calls to another set multimap.A sorted map which forwards all its method calls to another sorted map.A sorted multiset which forwards all its method calls to another sorted multiset.A sorted set which forwards all its method calls to another sorted set.A sorted set multimap which forwards all its method calls to another sorted set multimap.A table which forwards all its method calls to another table.HashBasedTable<R,C, V> Implementation ofTable
using linked hash tables.ABiMap
backed by two hash tables.Implementation ofMultimap
using hash tables.Multiset implementation backed by aHashMap
.ImmutableBiMap<K,V> ABiMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutable bimap instances, especiallypublic static final
bimaps ("constant bimaps").AClassToInstanceMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutable class-to-instance maps.ACollection
whose contents will never change, and which offers a few additional guarantees detailed below.Abstract base class for builders ofImmutableCollection
types.AList
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutable list instances, especiallypublic static final
lists ("constant lists").AListMultimap
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutableListMultimap
instances, especiallypublic static final
multimaps ("constant multimaps").ImmutableMap<K,V> AMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.ImmutableMap.Builder<K,V> A builder for creating immutable map instances, especiallypublic static final
maps ("constant maps").ImmutableMultimap<K,V> AMultimap
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutable multimap instances, especiallypublic static final
multimaps ("constant multimaps").AMultiset
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutable multiset instances, especiallypublic static final
multisets ("constant multisets").ARangeMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for immutable range maps.ImmutableRangeSet<C extends Comparable>ARangeSet
whose contents will never change, with many other important properties detailed atImmutableCollection
.ImmutableRangeSet.Builder<C extends Comparable<?>>A builder for immutable range sets.ImmutableSet<E>ASet
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creatingImmutableSet
instances.ImmutableSetMultimap<K,V> ASetMultimap
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutableSetMultimap
instances, especiallypublic static final
multimaps ("constant multimaps").ImmutableSortedMap<K,V> ANavigableMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutable sorted map instances, especiallypublic static final
maps ("constant maps").ASortedMultiset
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutable multiset instances, especiallypublic static final
multisets ("constant multisets").ANavigableSet
whose contents will never change, with many other important properties detailed atImmutableCollection
.A builder for creating immutable sorted set instances, especiallypublic static final
sets ("constant sets"), with a given comparator.ImmutableTable<R,C, V> ATable
whose contents will never change, with many other important properties detailed atImmutableCollection
.ImmutableTable.Builder<R,C, V> A builder for creating immutable table instances, especiallypublic static final
tables ("constant tables").Interner<E>Provides similar behavior toString.intern()
for any immutable type.Contains static methods pertaining to instances ofInterner
.Builder forInterner
instances.An assortment of mainly legacy static utility methods that operate on or return objects of typeIterable
.This class contains static utility methods that operate on or return objects of typeIterator
.Implementation ofMultimap
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.AMultiset
implementation with predictable iteration order.An implementation ofListMultimap
that supports deterministic iteration order for both keys and values.AMultimap
that can hold duplicate key-value pairs and that maintains the insertion ordering of values for a given key.Static utility methods pertaining toList
instances.An object representing the differences between two maps.A difference between the mappings from two maps with the same key.A builder ofConcurrentMap
instances that can have keys or values automatically wrapped in weak references.Maps.EntryTransformer<K extends @Nullable Object,V1 extends @Nullable Object, V2 extends @Nullable Object> A transformation of the value of a key-value pair, using both key and value as inputs.A double-ended priority queue, which provides constant-time access to both its least element and its greatest element, as determined by the queue's specified comparator.The builder class used in creation of min-max priority queues.Collectors not present injava.util.stream.Collectors
that are not otherwise associated with acom.google.common
type.A collection that maps keys to values, similar toMap
, but in which each key may be associated with multiple values.An immutable builder forMultimap
instances, letting you independently select the desired behaviors (for example, ordering) of the backing map and value-collections.A specialization ofMultimapBuilder
that generatesListMultimap
instances.An intermediate stage in aMultimapBuilder
in which the key-value collection map implementation has been specified, but the value collection implementation has not.A specialization ofMultimapBuilder
that generatesSetMultimap
instances.A specialization ofMultimapBuilder
that generatesSortedSetMultimap
instances.Provides static methods acting on or generating aMultimap
.A collection that supports order-independent equality, likeSet
, but may have duplicate elements.An unmodifiable element-count pair for a multiset.Provides static utility methods for creating and working withMultiset
instances.A mutable class-to-instance map backed by an arbitrary user-provided map.Static utility methods pertaining to object arrays.A comparator, with additional methods to support common operations.An iterator that supports a one-element lookahead while iterating.Range<C extends Comparable>A range (or "interval") defines the boundaries around a contiguous span of values of someComparable
type; for example, "integers from 1 to 100 inclusive."A mapping from disjoint nonempty ranges to non-null values.RangeSet<C extends Comparable>Interface that extendsTable
and whose rows are sorted.AMultimap
that cannot hold duplicate key-value pairs.Static utility methods pertaining toSet
instances.An unmodifiable view of a set which may be backed by other sets; this view will change as the backing sets do.An object representing the differences between two sorted maps.AMultiset
which maintains the ordering of its elements, according to either their natural order or an explicitComparator
.ASetMultimap
whose set of values for a given key are kept sorted; that is, they comprise aSortedSet
.Static utility methods related toStream
instances.An analogue ofDoubleFunction
also accepting an index.An analogue ofFunction
also accepting an index.An analogue ofIntFunction
also accepting an index.An analogue ofLongFunction
also accepting an index.A collection that associates an ordered pair of keys, called a row key and a column key, with a single value.Row key / column key / value triplet corresponding to a mapping in a table.Provides static methods that involve aTable
.TreeBasedTable<R,C, V> Implementation ofTable
whose row keys and column keys are ordered by their natural ordering or by supplied comparators.Implementation ofMultimap
whose keys and values are ordered by their natural ordering or by supplied comparators.A multiset which maintains the ordering of its elements, according to either their natural order or an explicitComparator
.An implementation ofRangeMap
based on aTreeMap
, supporting all optional operations.TreeRangeSet<C extends Comparable<?>>Deprecated.UseTraverser
instead.An iterator that does not supportUnmodifiableIterator.remove()
.A list iterator that does not supportUnmodifiableIterator.remove()
,UnmodifiableListIterator.add(E)
, orUnmodifiableListIterator.set(E)
.
com.google.common
.