Package | Description |
---|---|
com.google.common.cache |
This package contains caching utilities.
|
com.google.common.collect |
This package contains generic collection interfaces and implementations, and
other utilities for working with collections.
|
com.google.common.eventbus |
The EventBus allows publish-subscribe-style communication between components
without requiring the components to explicitly register with one another
(and thus be aware of each other).
|
com.google.common.io |
This package contains utility methods and classes for working with Java I/O;
for example input streams, output streams, readers, writers, and files.
|
com.google.common.net |
This package contains utility methods and classes for working with net
addresses (numeric IP and domain names).
|
com.google.common.reflect |
This package contains utilities to work with Java reflection.
|
com.google.common.util.concurrent |
Concurrency utilities.
|
com.google.thirdparty.publicsuffix |
Class and Description |
---|
ForwardingObject
An abstract base class for implementing the decorator pattern.
|
ImmutableMap
An immutable, hash-based
Map with reliable user-specified iteration
order. |
Class and Description |
---|
AbstractBiMap
A general-purpose bimap implementation using any two backing
Map
instances. |
AbstractIterator
This class provides a skeletal implementation of the
Iterator
interface, to make this interface easier to implement for certain types of
data sources. |
AbstractIterator.State |
AbstractListMultimap
Basic implementation of the
ListMultimap interface. |
AbstractMapBasedMultimap
Basic implementation of the
Multimap interface. |
AbstractMapBasedMultimap.AsMap |
AbstractMapBasedMultimap.KeySet |
AbstractMapBasedMultimap.SortedAsMap |
AbstractMapBasedMultimap.SortedKeySet |
AbstractMapBasedMultimap.WrappedCollection
Collection decorator that stays in sync with the multimap values for a key.
|
AbstractMapBasedMultimap.WrappedCollection.WrappedIterator
Collection iterator for
WrappedCollection . |
AbstractMapBasedMultimap.WrappedList
List decorator that stays in sync with the multimap values for a key.
|
AbstractMapBasedMultimap.WrappedSortedSet
SortedSet decorator that stays in sync with the multimap values for a key.
|
AbstractMapBasedMultiset
Basic implementation of
Multiset<E> backed by an instance of Map<E, Count> . |
AbstractMapEntry
Implementation of the
equals , hashCode , and toString
methods of Entry . |
AbstractMultimap
A skeleton
Multimap implementation, not necessarily in terms of a Map . |
AbstractMultimap.Entries |
AbstractMultiset
This class provides a skeletal implementation of the
Multiset
interface. |
AbstractMultiset.EntrySet |
AbstractNavigableMap
Skeletal implementation of
NavigableMap . |
AbstractRangeSet
A skeletal implementation of
RangeSet . |
AbstractSetMultimap
Basic implementation of the
SetMultimap interface. |
AbstractSortedKeySortedSetMultimap
Basic implementation of a
SortedSetMultimap with a sorted key set. |
AbstractSortedMultiset
This class provides a skeletal implementation of the
SortedMultiset interface. |
AbstractSortedSetMultimap
Basic implementation of the
SortedSetMultimap interface. |
AbstractTable
Skeletal, implementation-agnostic implementation of the
Table interface. |
AllEqualOrdering
An ordering that treats all references as equals, even nulls.
|
ArrayListMultimap
Implementation of
Multimap that uses an ArrayList to store
the values for a given key. |
ArrayTable
Fixed-size
Table implementation backed by a two-dimensional array. |
ArrayTable.ArrayMap |
ArrayTable.ColumnMap |
ArrayTable.RowMap |
BiMap
A bimap (or "bidirectional map") is a map that preserves the uniqueness of
its values as well as that of its keys.
|
BoundType
Indicates whether an endpoint of some range is contained in the range itself ("closed") or not
("open").
|
CartesianList
Implementation of
Lists.cartesianProduct(List) . |
ClassToInstanceMap
A map, each entry of which maps a Java
raw type to an instance of that type.
|
Collections2.FilteredCollection |
ComparisonChain
A utility for performing a chained comparison statement.
|
ComputingConcurrentHashMap
Adds computing functionality to
MapMakerInternalMap . |
ComputingConcurrentHashMap.ComputingSegment |
ComputingConcurrentHashMap.ComputingValueReference |
ConcurrentHashMultiset
A multiset that supports concurrent modifications and that provides atomic versions of most
Multiset operations (exceptions where noted). |
Constraint
A constraint that an element must satisfy in order to be added to a
collection.
|
Constraints.ConstrainedList |
ContiguousSet
A sorted set of contiguous values in a given
DiscreteDomain . |
Count
A mutable value of type
int , for multisets to use in tracking counts of values. |
Cut
Implementation detail for the internal structure of
Range instances. |
Cut.AboveAll |
Cut.BelowAll |
DenseImmutableTable.ImmutableArrayMap
An immutable map implementation backed by an indexed nullable array.
|
DescendingMultiset
A skeleton implementation of a descending multiset.
|
DiscreteDomain
A descriptor for a discrete
Comparable domain such as all
Integer instances. |
DiscreteDomain.BigIntegerDomain |
DiscreteDomain.IntegerDomain |
DiscreteDomain.LongDomain |
EmptyImmutableBiMap
Bimap with no mappings.
|
EmptyImmutableListMultimap
Implementation of
ImmutableListMultimap with no entries. |
EmptyImmutableSet
An empty immutable set.
|
EmptyImmutableSetMultimap
Implementation of
ImmutableListMultimap with no entries. |
EnumBiMap
A
BiMap backed by two EnumMap instances. |
EnumHashBiMap
A
BiMap backed by an EnumMap instance for keys-to-values, and
a HashMap instance for values-to-keys. |
EnumMultiset
Multiset implementation backed by an
EnumMap . |
EvictingQueue
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.
|
FilteredEntryMultimap
Implementation of
Multimaps.filterEntries(Multimap, Predicate) . |
FilteredKeyMultimap
Implementation of
Multimaps.filterKeys(Multimap, Predicate) . |
FilteredKeyMultimap.Entries |
FilteredMultimap
An interface for all filtered multimap types.
|
FilteredSetMultimap
A supertype for filtered
SetMultimap implementations. |
FluentIterable
FluentIterable provides a rich interface for manipulating Iterable instances in a
chained fashion. |
ForwardingCollection
A collection which forwards all its method calls to another collection.
|
ForwardingConcurrentMap
A concurrent map which forwards all its method calls to another concurrent
map.
|
ForwardingDeque
A deque which forwards all its method calls to another deque.
|
ForwardingIterator
An iterator which forwards all its method calls to another iterator.
|
ForwardingList
A list which forwards all its method calls to another list.
|
ForwardingListIterator
A list iterator which forwards all its method calls to another list
iterator.
|
ForwardingMap
A map which forwards all its method calls to another map.
|
ForwardingMultimap
A multimap which forwards all its method calls to another multimap.
|
ForwardingMultiset
A multiset which forwards all its method calls to another multiset.
|
ForwardingNavigableSet
A navigable set which forwards all its method calls to another navigable set.
|
ForwardingObject
An abstract base class for implementing the decorator pattern.
|
ForwardingQueue
A queue which forwards all its method calls to another queue.
|
ForwardingSet
A set which forwards all its method calls to another set.
|
ForwardingSetMultimap
A set multimap which forwards all its method calls to another set multimap.
|
ForwardingSortedMap
A sorted map which forwards all its method calls to another sorted map.
|
ForwardingSortedSet
A sorted set which forwards all its method calls to another sorted set.
|
ForwardingTable
A table which forwards all its method calls to another table.
|
GeneralRange
A generalized interval on any ordering, for internal use.
|
GenericMapMaker
Deprecated.
This class existed only to support the generic paramterization necessary for the
caching functionality in
MapMaker . That functionality has been moved to CacheBuilder , which is a properly generified class and thus needs no
"Generic" equivalent; simple use CacheBuilder naturally. For general migration
instructions, see the MapMaker Migration
Guide. |
GenericMapMaker.NullListener
Deprecated.
|
GwtTransient
Private replacement for
com.google.gwt.user.client.rpc.GwtTransient
to work around build-system quirks. |
HashBasedTable
Implementation of
Table using hash tables. |
HashBasedTable.Factory |
HashBiMap
A
BiMap backed by two hash tables. |
HashBiMap.BiEntry |
HashMultimap
Implementation of
Multimap using hash tables. |
HashMultiset
Multiset implementation backed by a
HashMap . |
ImmutableAsList
List returned by
ImmutableCollection.asList that delegates contains checks
to the backing collection. |
ImmutableBiMap
An immutable
BiMap with reliable user-specified iteration order. |
ImmutableBiMap.Builder
A builder for creating immutable bimap instances, especially
public
static final bimaps ("constant bimaps"). |
ImmutableClassToInstanceMap
A class-to-instance map backed by an
ImmutableMap . |
ImmutableClassToInstanceMap.Builder
A builder for creating immutable class-to-instance maps.
|
ImmutableCollection
An immutable collection.
|
ImmutableCollection.ArrayBasedBuilder |
ImmutableCollection.Builder
Abstract base class for builders of
ImmutableCollection types. |
ImmutableEntry |
ImmutableList
A high-performance, immutable, random-access
List implementation. |
ImmutableList.Builder
A builder for creating immutable list instances, especially
public
static final lists ("constant lists"). |
ImmutableListMultimap
An immutable
ListMultimap with reliable user-specified key and value
iteration order. |
ImmutableListMultimap.Builder
A builder for creating immutable
ListMultimap instances, especially
public static final multimaps ("constant multimaps"). |
ImmutableMap
An immutable, hash-based
Map with reliable user-specified iteration
order. |
ImmutableMap.Builder
A builder for creating immutable map instances, especially
public
static final maps ("constant maps"). |
ImmutableMap.SerializedForm
Serialized type for all ImmutableMap instances.
|
ImmutableMapEntry
Implementation of
Map.Entry for ImmutableMap that adds extra methods to traverse
hash buckets for the key and the value. |
ImmutableMapEntry.TerminalEntry |
ImmutableMapEntrySet
entrySet() implementation for ImmutableMap . |
ImmutableMultimap
An immutable
Multimap . |
ImmutableMultimap.Builder
A builder for creating immutable multimap instances, especially
public static final multimaps ("constant multimaps"). |
ImmutableMultiset
An immutable hash-based multiset.
|
ImmutableMultiset.Builder
A builder for creating immutable multiset instances, especially
public static final multisets ("constant multisets"). |
ImmutableRangeMap
An immutable implementation of
RangeMap , supporting all query operations efficiently. |
ImmutableRangeMap.Builder
A builder for immutable range maps.
|
ImmutableRangeSet
An efficient immutable implementation of a
RangeSet . |
ImmutableRangeSet.Builder
A builder for immutable range sets.
|
ImmutableSet
A high-performance, immutable
Set with reliable, user-specified
iteration order. |
ImmutableSet.Builder
A builder for creating immutable set instances, especially
public
static final sets ("constant sets"). |
ImmutableSetMultimap
An immutable
SetMultimap with reliable user-specified key and value
iteration order. |
ImmutableSetMultimap.Builder
A builder for creating immutable
SetMultimap instances, especially
public static final multimaps ("constant multimaps"). |
ImmutableSortedMap
An immutable
SortedMap . |
ImmutableSortedMap.Builder
A builder for creating immutable sorted map instances, especially
public static final maps ("constant maps"). |
ImmutableSortedMapFauxverideShim
"Overrides" the
ImmutableMap static methods that lack
ImmutableSortedMap equivalents with deprecated, exception-throwing
versions. |
ImmutableSortedMultiset
An immutable
SortedMultiset that stores its elements in a sorted array. |
ImmutableSortedMultiset.Builder
A builder for creating immutable multiset instances, especially
public static final
multisets ("constant multisets"). |
ImmutableSortedMultisetFauxverideShim
"Overrides" the
ImmutableMultiset static methods that lack
ImmutableSortedMultiset equivalents with deprecated, exception-throwing versions. |
ImmutableSortedSet
An immutable
SortedSet that stores its elements in a sorted array. |
ImmutableSortedSet.Builder
A builder for creating immutable sorted set instances, especially
public static final sets ("constant sets"), with a given comparator. |
ImmutableSortedSetFauxverideShim
"Overrides" the
ImmutableSet static methods that lack
ImmutableSortedSet equivalents with deprecated, exception-throwing
versions. |
ImmutableTable
An immutable
Table with reliable user-specified iteration order. |
ImmutableTable.Builder
A builder for creating immutable table instances, especially
public
static final tables ("constant tables"). |
Interner
Provides equivalent behavior to
String.intern() for other immutable
types. |
Interners.WeakInterner.Dummy |
LinkedHashMultimap
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. |
LinkedHashMultimap.ValueEntry
LinkedHashMultimap entries are in no less than three coexisting linked lists:
a bucket in the hash table for a Set
|
LinkedHashMultimap.ValueSetLink |
LinkedHashMultiset
A
Multiset implementation with predictable iteration order. |
LinkedListMultimap
An implementation of
ListMultimap that supports deterministic
iteration order for both keys and values. |
LinkedListMultimap.KeyList |
LinkedListMultimap.Node |
ListMultimap
A
Multimap that can hold duplicate key-value pairs and that maintains
the insertion ordering of values for a given key. |
Lists.AbstractListWrapper |
Lists.Partition |
Lists.ReverseList |
MapConstraint
A constraint on the keys and values that may be added to a
Map or
Multimap . |
MapConstraints.ConstrainedEntries |
MapConstraints.ConstrainedMap |
MapConstraints.ConstrainedMultimap |
MapConstraints.ConstrainedSetMultimap |
MapConstraints.NotNullMapConstraint |
MapDifference
An object representing the differences between two maps.
|
MapDifference.ValueDifference
A difference between the mappings from two maps with the same key.
|
MapMaker
A builder of
ConcurrentMap instances having any combination of the following features:
keys or values automatically wrapped in weak or soft references
notification of evicted (or otherwise removed) entries
on-demand computation of values for keys not already present
|
MapMaker.NullConcurrentMap
A map that is always empty and evicts on insertion.
|
MapMaker.RemovalCause
The reason why an entry was removed.
|
MapMaker.RemovalListener
An object that can receive a notification when an entry is removed from a map.
|
MapMaker.RemovalNotification
A notification of the removal of a single entry.
|
MapMakerInternalMap
The concurrent hash map implementation built by
MapMaker . |
MapMakerInternalMap.AbstractSerializationProxy
The actual object that gets serialized.
|
MapMakerInternalMap.EntryFactory
Creates new entries.
|
MapMakerInternalMap.HashIterator |
MapMakerInternalMap.NullEntry |
MapMakerInternalMap.ReferenceEntry
An entry in a reference map.
|
MapMakerInternalMap.Segment
Segments are specialized versions of hash tables.
|
MapMakerInternalMap.SoftEntry
Used for softly-referenced keys.
|
MapMakerInternalMap.Strength |
MapMakerInternalMap.StrongEntry
Used for strongly-referenced keys.
|
MapMakerInternalMap.ValueReference
A reference to a value.
|
MapMakerInternalMap.WeakEntry
Used for weakly-referenced keys.
|
MapMakerInternalMap.WriteThroughEntry
Custom Entry class used by EntryIterator.next(), that relays setValue changes to the
underlying map.
|
Maps.AbstractFilteredMap |
Maps.AsMapView |
Maps.DescendingMap |
Maps.EntryFunction |
Maps.EntrySet |
Maps.EntryTransformer
A transformation of the value of a key-value pair, using both key and value
as inputs.
|
Maps.FilteredEntryBiMap |
Maps.FilteredEntryMap |
Maps.FilteredEntryMap.KeySet |
Maps.FilteredEntryNavigableMap |
Maps.FilteredEntrySortedMap |
Maps.ImprovedAbstractMap
AbstractMap extension that implements AbstractMap.isEmpty() as entrySet().isEmpty() instead of size() == 0 to speed up
implementations where size() is O(n), and it delegates the isEmpty() methods of its key set and value collection to this
implementation. |
Maps.KeySet |
Maps.MapDifferenceImpl |
Maps.NavigableKeySet |
Maps.SortedKeySet |
Maps.TransformedEntriesMap |
Maps.TransformedEntriesSortedMap |
Maps.UnmodifiableEntries |
Maps.UnmodifiableNavigableMap |
Maps.Values |
MinMaxPriorityQueue
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.
|
MinMaxPriorityQueue.Builder
The builder class used in creation of min-max priority queues.
|
MinMaxPriorityQueue.Heap
Each instance of MinMaxPriortyQueue encapsulates two instances of Heap:
a min-heap and a max-heap.
|
MinMaxPriorityQueue.MoveDesc |
Multimap
A collection that maps keys to values, similar to
Map , but in which
each key may be associated with multiple values. |
MultimapBuilder
A builder for a multimap implementation that allows customization of the backing map and value
collection implementations used in a particular multimap.
|
MultimapBuilder.LinkedListSupplier |
MultimapBuilder.ListMultimapBuilder
A specialization of
MultimapBuilder that generates ListMultimap instances. |
MultimapBuilder.MultimapBuilderWithKeys
An intermediate stage in a
MultimapBuilder in which the key-value collection map
implementation has been specified, but the value collection implementation has not. |
MultimapBuilder.SetMultimapBuilder
A specialization of
MultimapBuilder that generates SetMultimap instances. |
MultimapBuilder.SortedSetMultimapBuilder
A specialization of
MultimapBuilder that generates SortedSetMultimap instances. |
Multimaps.Entries
A skeleton implementation of
Multimap.entries() . |
Multimaps.Keys |
Multimaps.TransformedEntriesMultimap |
Multimaps.UnmodifiableMultimap |
Multimaps.UnmodifiableSetMultimap |
Multiset
A collection that supports order-independent equality, like
Set , but
may have duplicate elements. |
Multiset.Entry
An unmodifiable element-count pair for a multiset.
|
Multisets.AbstractEntry |
Multisets.ElementSet |
Multisets.EntrySet |
Multisets.UnmodifiableMultiset |
MutableClassToInstanceMap
A mutable class-to-instance map backed by an arbitrary user-provided map.
|
NaturalOrdering
An ordering that uses the natural order of the values.
|
Ordering
A comparator, with additional methods to support common operations.
|
PeekingIterator
An iterator that supports a one-element lookahead while iterating.
|
Range
A range (or "interval") defines the boundaries around a contiguous span of values of some
Comparable type; for example, "integers from 1 to 100 inclusive." Note that it is not
possible to iterate over these contained values. |
RangeMap
A mapping from disjoint nonempty ranges to non-null values.
|
RangeSet |
RegularImmutableAsList
An
ImmutableAsList implementation specialized for when the delegate collection is
already backed by an ImmutableList or array. |
RegularImmutableSortedSet
An immutable sorted set with one or more elements.
|
RegularImmutableTable
An implementation of
ImmutableTable holding an arbitrary number of
cells. |
ReverseNaturalOrdering
An ordering that uses the reverse of the natural order of the values.
|
RowSortedTable
Interface that extends
Table and whose rows are sorted. |
Serialization.FieldSetter |
SetMultimap
A
Multimap that cannot hold duplicate key-value pairs. |
Sets.DescendingSet |
Sets.FilteredSet |
Sets.FilteredSortedSet |
Sets.ImprovedAbstractSet
AbstractSet substitute without the potentially-quadratic
removeAll implementation. |
Sets.SetView
An unmodifiable view of a set which may be backed by other sets; this view
will change as the backing sets do.
|
Sets.UnmodifiableNavigableSet |
SortedIterable
An
Iterable whose elements are sorted relative to a Comparator , typically
provided at creation time. |
SortedLists.KeyAbsentBehavior
A specification for which index to return if the list contains no elements that compare as
equal to the key.
|
SortedLists.KeyPresentBehavior
A specification for which index to return if the list contains at least one element that
compares as equal to the key.
|
SortedMapDifference
An object representing the differences between two sorted maps.
|
SortedMultiset
A
Multiset which maintains the ordering of its elements, according to
either their natural order or an explicit Comparator . |
SortedMultisetBridge
Superinterface of
SortedMultiset to introduce a bridge method for
elementSet() , to ensure binary compatibility with older Guava versions
that specified elementSet() to return SortedSet . |
SortedMultisets.ElementSet
A skeleton implementation for
SortedMultiset.elementSet() . |
SortedMultisets.NavigableElementSet
A skeleton navigable implementation for
SortedMultiset.elementSet() . |
SortedSetMultimap
A
SetMultimap whose set of values for a given key are kept sorted;
that is, they comprise a SortedSet . |
StandardRowSortedTable
Implementation of
Table whose iteration ordering across row keys is
sorted by their natural ordering or by a supplied comparator. |
StandardTable
Table implementation backed by a map that associates row keys with
column key / value secondary maps. |
StandardTable.ColumnMap |
StandardTable.Row |
StandardTable.RowMap |
StandardTable.TableSet
Abstract set whose
isEmpty() returns whether the table is empty and
whose clear() clears all table mappings. |
Synchronized.SynchronizedCollection |
Synchronized.SynchronizedList |
Synchronized.SynchronizedMap |
Synchronized.SynchronizedMultimap |
Synchronized.SynchronizedObject |
Synchronized.SynchronizedQueue |
Synchronized.SynchronizedSet |
Synchronized.SynchronizedSetMultimap |
Synchronized.SynchronizedSortedMap |
Synchronized.SynchronizedSortedSet |
Table
A collection that associates an ordered pair of keys, called a row key and a
column key, with a single value.
|
Table.Cell
Row key / column key / value triplet corresponding to a mapping in a table.
|
Tables.AbstractCell |
Tables.UnmodifiableTable |
TransformedIterator
An iterator that transforms a backing iterator; for internal use.
|
TreeBasedTable
Implementation of
Table whose row keys and column keys are ordered
by their natural ordering or by supplied comparators. |
TreeMultimap
Implementation of
Multimap whose keys and values are ordered by
their natural ordering or by supplied comparators. |
TreeMultiset
A multiset which maintains the ordering of its elements, according to either their natural order
or an explicit
Comparator . |
TreeMultiset.Aggregate
A function which can be summed across a subtree.
|
TreeMultiset.AvlNode |
TreeMultiset.Reference |
TreeRangeMap
An implementation of
RangeMap based on a TreeMap , supporting
all optional operations. |
TreeRangeMap.RangeMapEntry |
TreeRangeSet
An implementation of
RangeSet backed by a TreeMap . |
TreeTraverser
Views elements of a type
T as nodes in a tree, and provides methods to traverse the trees
induced by this traverser. |
TreeTraverser.PostOrderNode |
UnmodifiableIterator
An iterator that does not support
UnmodifiableIterator.remove() . |
UnmodifiableListIterator
A list iterator that does not support
UnmodifiableIterator.remove() , UnmodifiableListIterator.add(E) , or
UnmodifiableListIterator.set(E) . |
UnmodifiableSortedMultiset
Implementation of
Multisets.unmodifiableSortedMultiset(SortedMultiset) ,
split out into its own file so it can be GWT emulated (to deal with the differing
elementSet() types in GWT and non-GWT). |
UsingToStringOrdering
An ordering that uses the natural order of the string representation of the
values.
|
WellBehavedMap
Workaround for
EnumMap bug.
|
Class and Description |
---|
ImmutableList
A high-performance, immutable, random-access
List implementation. |
Multimap
A collection that maps keys to values, similar to
Map , but in which
each key may be associated with multiple values. |
SetMultimap
A
Multimap that cannot hold duplicate key-value pairs. |
Class and Description |
---|
ImmutableList
A high-performance, immutable, random-access
List implementation. |
ImmutableSet
A high-performance, immutable
Set with reliable, user-specified
iteration order. |
TreeTraverser
Views elements of a type
T as nodes in a tree, and provides methods to traverse the trees
induced by this traverser. |
Class and Description |
---|
ImmutableList
A high-performance, immutable, random-access
List implementation. |
ImmutableListMultimap
An immutable
ListMultimap with reliable user-specified key and value
iteration order. |
ImmutableMultiset
An immutable hash-based multiset.
|
Multimap
A collection that maps keys to values, similar to
Map , but in which
each key may be associated with multiple values. |
Class and Description |
---|
ForwardingCollection
A collection which forwards all its method calls to another collection.
|
ForwardingMap
A map which forwards all its method calls to another map.
|
ForwardingMapEntry
A map entry which forwards all its method calls to another map entry.
|
ForwardingObject
An abstract base class for implementing the decorator pattern.
|
ForwardingSet
A set which forwards all its method calls to another set.
|
ImmutableList
A high-performance, immutable, random-access
List implementation. |
ImmutableMap
An immutable, hash-based
Map with reliable user-specified iteration
order. |
ImmutableMap.Builder
A builder for creating immutable map instances, especially
public
static final maps ("constant maps"). |
ImmutableSet
A high-performance, immutable
Set with reliable, user-specified
iteration order. |
ImmutableSortedSet
An immutable
SortedSet that stores its elements in a sorted array. |
ImmutableSortedSet.Builder
A builder for creating immutable sorted set instances, especially
public static final sets ("constant sets"), with a given comparator. |
Class and Description |
---|
ForwardingCollection
A collection which forwards all its method calls to another collection.
|
ForwardingObject
An abstract base class for implementing the decorator pattern.
|
ForwardingQueue
A queue which forwards all its method calls to another queue.
|
ImmutableCollection
An immutable collection.
|
ImmutableList
A high-performance, immutable, random-access
List implementation. |
ImmutableMap
An immutable, hash-based
Map with reliable user-specified iteration
order. |
ImmutableMultimap
An immutable
Multimap . |
Multiset
A collection that supports order-independent equality, like
Set , but
may have duplicate elements. |
Ordering
A comparator, with additional methods to support common operations.
|
SetMultimap
A
Multimap that cannot hold duplicate key-value pairs. |
Class and Description |
---|
ImmutableMap
An immutable, hash-based
Map with reliable user-specified iteration
order. |
ImmutableMap.Builder
A builder for creating immutable map instances, especially
public
static final maps ("constant maps"). |