AbstractBiMap |
A general-purpose bimap implementation using any two backing Map instances.
|
AbstractIndexedListIterator |
This class provides a skeletal implementation of the ListIterator interface across a
fixed number of elements that may be retrieved by position.
|
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 |
|
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 |
|
AbstractSortedKeySortedSetMultimap |
|
AbstractSortedMultiset |
This class provides a skeletal implementation of the SortedMultiset interface.
|
AbstractSortedSetMultimap |
|
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.
|
ArrayListMultimapGwtSerializationDependencies |
A dummy superclass to support GWT serialization of the element types of an ArrayListMultimap .
|
ArrayTable |
Fixed-size Table implementation backed by a two-dimensional array.
|
ArrayTable.ArrayMap |
|
ArrayTable.ColumnMap |
|
ArrayTable.RowMap |
|
BaseImmutableMultimap |
|
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 |
|
ClassToInstanceMap |
A map, each entry of which maps a Java raw type to an
instance of that type.
|
Collections2.FilteredCollection |
|
CollectSpliterators.FlatMapSpliterator |
Implements the Stream#flatMap operation on spliterators.
|
CollectSpliterators.FlatMapSpliterator.Factory |
|
CollectSpliterators.FlatMapSpliteratorOfPrimitive |
Implementation of Stream#flatMap with a primitive spliterator output type.
|
CompactHashMap |
CompactHashMap is an implementation of a Map.
|
CompactHashSet |
CompactHashSet is an implementation of a Set.
|
CompactLinkedHashMap |
CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order,
maintained with a doubly linked list through the entries.
|
CompactLinkedHashSet |
CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that
matches the insertion order.
|
ComparisonChain |
A utility for performing a chained comparison statement.
|
ConcurrentHashMultiset |
A multiset that supports concurrent modifications and that provides atomic versions of most
Multiset operations (exceptions where noted).
|
ContiguousSet |
|
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 |
|
EmptyImmutableListMultimap |
|
EmptyImmutableSetMultimap |
|
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 specialized for enum elements, supporting all single-element operations
in O(1).
|
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 |
|
FilteredKeyMultimap |
|
FilteredKeyMultimap.Entries |
|
FilteredMultimap |
An interface for all filtered multimap types.
|
FilteredSetMultimap |
|
FluentIterable |
A discouraged (but not deprecated) precursor to Java's superior Stream library.
|
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.
|
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.
|
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 |
|
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.
|
GwtTransient |
Private replacement for com.google.gwt.user.client.rpc.GwtTransient to work around
build-system quirks.
|
HashBasedTable |
Implementation of Table using linked hash tables.
|
HashBasedTable.Factory |
|
HashBiMap |
A BiMap backed by two hash tables.
|
HashBiMap.BiEntry |
|
HashMultimap |
Implementation of Multimap using hash tables.
|
HashMultimapGwtSerializationDependencies |
A dummy superclass to support GWT serialization of the element types of a HashMultimap .
|
HashMultiset |
Multiset implementation backed by a HashMap .
|
ImmutableAsList |
|
ImmutableBiMap |
|
ImmutableBiMap.Builder |
A builder for creating immutable bimap instances, especially public static final bimaps
("constant bimaps").
|
ImmutableBiMapFauxverideShim |
|
ImmutableClassToInstanceMap |
|
ImmutableClassToInstanceMap.Builder |
A builder for creating immutable class-to-instance maps.
|
ImmutableCollection |
A Collection whose contents will never change, and which offers a few additional
guarantees detailed below.
|
ImmutableCollection.Builder |
|
ImmutableEntry |
|
ImmutableList |
A List whose contents will never change, with many other important properties detailed at
ImmutableCollection .
|
ImmutableList.Builder |
A builder for creating immutable list instances, especially public static final lists
("constant lists").
|
ImmutableListMultimap |
|
ImmutableListMultimap.Builder |
A builder for creating immutable ListMultimap instances, especially public
static final multimaps ("constant multimaps").
|
ImmutableMap |
A Map whose contents will never change, with many other important properties detailed at
ImmutableCollection .
|
ImmutableMap.Builder |
A builder for creating immutable map instances, especially public static final maps
("constant maps").
|
ImmutableMap.IteratorBasedImmutableMap |
|
ImmutableMap.SerializedForm |
Serialized type for all ImmutableMap instances.
|
ImmutableMapEntry |
Implementation of Entry for ImmutableMap that adds extra methods to traverse hash
buckets for the key and the value.
|
ImmutableMapEntry.NonTerminalImmutableMapEntry |
|
ImmutableMapEntrySet |
|
ImmutableMultimap |
|
ImmutableMultimap.Builder |
A builder for creating immutable multimap instances, especially public static final
multimaps ("constant multimaps").
|
ImmutableMultiset |
|
ImmutableMultiset.Builder |
A builder for creating immutable multiset instances, especially public static final
multisets ("constant multisets").
|
ImmutableMultisetGwtSerializationDependencies |
A dummy superclass to support GWT serialization of the element type of an ImmutableMultiset .
|
ImmutableRangeMap |
|
ImmutableRangeMap.Builder |
A builder for immutable range maps.
|
ImmutableRangeSet |
|
ImmutableRangeSet.Builder |
A builder for immutable range sets.
|
ImmutableSet |
A Set whose contents will never change, with many other important properties detailed at
ImmutableCollection .
|
ImmutableSet.Builder |
A builder for creating ImmutableSet instances.
|
ImmutableSet.Indexed |
|
ImmutableSet.RegularSetBuilderImpl |
Default implementation of the guts of ImmutableSet.Builder, creating an open-addressed hash
table and deduplicating elements as they come, so it only allocates O(max(distinct,
expectedCapacity)) rather than O(calls to add).
|
ImmutableSet.SetBuilderImpl |
Swappable internal implementation of an ImmutableSet.Builder.
|
ImmutableSetMultimap |
|
ImmutableSetMultimap.Builder |
A builder for creating immutable SetMultimap instances, especially public static
final multimaps ("constant multimaps").
|
ImmutableSortedMap |
A NavigableMap whose contents will never change, with many other important properties
detailed at ImmutableCollection .
|
ImmutableSortedMap.Builder |
A builder for creating immutable sorted map instances, especially public static final
maps ("constant maps").
|
ImmutableSortedMapFauxverideShim |
|
ImmutableSortedMultiset |
|
ImmutableSortedMultiset.Builder |
A builder for creating immutable multiset instances, especially public static final
multisets ("constant multisets").
|
ImmutableSortedMultisetFauxverideShim |
|
ImmutableSortedSet |
A NavigableSet whose contents will never change, with many other important properties
detailed at ImmutableCollection .
|
ImmutableSortedSet.Builder |
A builder for creating immutable sorted set instances, especially public static final
sets ("constant sets"), with a given comparator.
|
ImmutableSortedSetFauxverideShim |
|
ImmutableTable |
|
ImmutableTable.Builder |
A builder for creating immutable table instances, especially public static final tables
("constant tables").
|
ImmutableTable.CollectorState |
|
ImmutableTable.MutableCell |
|
ImmutableTable.SerializedForm |
Serialized type for all ImmutableTable instances.
|
IndexedImmutableSet |
|
Interner |
Provides equivalent behavior to String.intern() for other immutable types.
|
Interners.InternerBuilder |
|
Iterators.EmptyModifiableIterator |
This is an enum singleton rather than an anonymous class so ProGuard can figure out it's only
referenced by emptyModifiableIterator().
|
JdkBackedImmutableBiMap |
Implementation of ImmutableBiMap backed by a pair of JDK HashMaps, which have smartness
protecting against hash flooding.
|
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<V> associated with a key, the linked list of insertion-ordered
entries in that Set<V> , and the linked list of entries in the LinkedHashMultimap as a
whole.
|
LinkedHashMultimap.ValueSetLink |
|
LinkedHashMultimapGwtSerializationDependencies |
A dummy superclass to support GWT serialization of the element types of a LinkedHashMultimap .
|
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 |
|
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 that can have keys or values automatically wrapped
in weak references.
|
MapMaker.Dummy |
A dummy singleton value type used by Interners .
|
MapMakerInternalMap |
The concurrent hash map implementation built by MapMaker .
|
MapMakerInternalMap.AbstractSerializationProxy |
The actual object that gets serialized.
|
MapMakerInternalMap.AbstractStrongKeyEntry |
|
MapMakerInternalMap.AbstractWeakKeyEntry |
|
MapMakerInternalMap.DummyInternalEntry |
|
MapMakerInternalMap.HashIterator |
|
MapMakerInternalMap.InternalEntry |
|
MapMakerInternalMap.InternalEntryHelper |
|
MapMakerInternalMap.SafeToArraySet |
|
MapMakerInternalMap.Segment |
Segments are specialized versions of hash tables.
|
MapMakerInternalMap.Strength |
|
MapMakerInternalMap.StrongKeyDummyValueEntry |
|
MapMakerInternalMap.StrongKeyDummyValueEntry.Helper |
|
MapMakerInternalMap.StrongKeyDummyValueSegment |
|
MapMakerInternalMap.StrongKeyStrongValueEntry |
|
MapMakerInternalMap.StrongKeyStrongValueEntry.Helper |
|
MapMakerInternalMap.StrongKeyStrongValueSegment |
|
MapMakerInternalMap.StrongKeyWeakValueEntry |
|
MapMakerInternalMap.StrongKeyWeakValueEntry.Helper |
|
MapMakerInternalMap.StrongKeyWeakValueSegment |
|
MapMakerInternalMap.StrongValueEntry |
|
MapMakerInternalMap.WeakKeyDummyValueEntry |
|
MapMakerInternalMap.WeakKeyDummyValueEntry.Helper |
|
MapMakerInternalMap.WeakKeyDummyValueSegment |
|
MapMakerInternalMap.WeakKeyStrongValueEntry |
|
MapMakerInternalMap.WeakKeyStrongValueEntry.Helper |
|
MapMakerInternalMap.WeakKeyStrongValueSegment |
|
MapMakerInternalMap.WeakKeyWeakValueEntry |
|
MapMakerInternalMap.WeakKeyWeakValueEntry.Helper |
|
MapMakerInternalMap.WeakKeyWeakValueSegment |
|
MapMakerInternalMap.WeakValueEntry |
|
MapMakerInternalMap.WeakValueReference |
A weakly referenced value that also has a reference to its containing entry.
|
MapMakerInternalMap.WriteThroughEntry |
Custom Entry class used by EntryIterator.next(), that relays setValue changes to the underlying
map.
|
Maps.AbstractFilteredMap |
|
Maps.Accumulator |
|
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.IteratorBasedAbstractMap |
|
Maps.KeySet |
|
Maps.MapDifferenceImpl |
|
Maps.NavigableKeySet |
|
Maps.SortedKeySet |
|
Maps.TransformedEntriesMap |
|
Maps.TransformedEntriesSortedMap |
|
Maps.UnmodifiableEntries |
|
Maps.UnmodifiableNavigableMap |
|
Maps.Values |
|
Maps.ViewCachingAbstractMap |
AbstractMap extension that makes it easy to cache customized keySet, values, and
entrySet views.
|
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 |
|
MoreCollectors.ToOptionalState |
This atrocity is here to let us report several of the elements in the stream if there were more
than one, not just two.
|
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 |
|
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 |
|
MultimapBuilder.SortedSetMultimapBuilder |
|
Multimaps.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 |
Implementation of the equals , hashCode , and toString methods of Multiset.Entry .
|
Multisets.DecreasingCount |
|
Multisets.ElementSet |
|
Multisets.EntrySet |
|
Multisets.ImmutableEntry |
|
Multisets.UnmodifiableMultiset |
|
Multisets.ViewMultiset |
An AbstractMultiset with additional default implementations, some of them linear-time
implementations in terms of elementSet and entrySet .
|
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.
|
Range.LowerBoundFn |
|
Range.UpperBoundFn |
|
RangeGwtSerializationDependencies |
A dummy superclass to support GWT serialization of the element type of a Range .
|
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.
|
RegularImmutableBiMap |
Bimap with zero or more mappings.
|
RegularImmutableMap |
|
RegularImmutableSet |
|
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.Accumulator |
|
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 |
|
SortedMultisets.NavigableElementSet |
|
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.
|
Streams.DoubleFunctionWithIndex |
An analogue of DoubleFunction also accepting an index.
|
Streams.FunctionWithIndex |
An analogue of Function also accepting an index.
|
Streams.IntFunctionWithIndex |
An analogue of IntFunction also accepting an index.
|
Streams.LongFunctionWithIndex |
An analogue of LongFunction also accepting an index.
|
Streams.MapWithIndexSpliterator |
|
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 |
|
TopKSelector |
An accumulator that selects the "top" k elements added to it, relative to a provided
comparator.
|
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 |
Deprecated.
|
TreeTraverser.PostOrderNode |
Deprecated.
|
UnmodifiableIterator |
|
UnmodifiableListIterator |
|
UnmodifiableSortedMultiset |
|
UsingToStringOrdering |
An ordering that uses the natural order of the string representation of the values.
|