|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use com.google.common.collect | |
---|---|
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.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. |
Classes in com.google.common.collect used by com.google.common.cache | |
---|---|
ForwardingObject
An abstract base class for implementing the decorator pattern. |
|
ImmutableMap
An immutable, hash-based Map with reliable user-specified iteration
order. |
Classes in com.google.common.collect used by com.google.common.collect | |
---|---|
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. |
|
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"). |
|
ClassToInstanceMap
A map, each entry of which maps a Java raw type to an instance of that type. |
|
ComparisonChain
A utility for performing a "lazy" chained comparison statement, which performs comparisons only until it finds a nonzero result. |
|
ComputationException
Wraps an exception that occurred during a computation. |
|
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. |
|
ContiguousSet
A sorted set of contiguous values in a given DiscreteDomain . |
|
DiscreteDomain
A descriptor for a discrete Comparable domain such as all
Integer s. |
|
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 . |
|
FluentIterable
FluentIterable provides a rich interface for manipulating Iterable s in a chained
fashion. |
|
ForwardingCollection
A collection which forwards all its method calls to another collection. |
|
ForwardingIterator
An iterator which forwards all its method calls to another 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. |
|
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. |
|
GenericMapMaker
A class exactly like MapMaker , except restricted in the types of maps it can build. |
|
HashBasedTable
Implementation of Table using hash tables. |
|
HashBiMap
A BiMap backed by two HashMap instances. |
|
HashMultimap
Implementation of Multimap using hash tables. |
|
HashMultiset
Multiset implementation backed by a HashMap . |
|
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.Builder
Abstract base class for builders of ImmutableCollection types. |
|
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"). |
|
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"). |
|
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"). |
|
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"). |
|
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. |
|
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. |
|
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. |
|
LinkedHashMultiset
A Multiset implementation with predictable iteration order. |
|
LinkedListMultimap
An implementation of ListMultimap that supports deterministic
iteration order for both keys and values. |
|
ListMultimap
A Multimap that can hold duplicate key-value pairs and that maintains
the insertion ordering of values for a given key. |
|
MapConstraint
A constraint on the keys and values that may be added to a Map or
Multimap . |
|
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
|
|
Maps.EntryTransformer
A transformation of the value of a key-value pair, using both key and value as inputs. |
|
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. |
|
Multimap
A collection that maps keys to values, similar to Map , but in which
each key may be associated with multiple values. |
|
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. |
|
MutableClassToInstanceMap
A mutable class-to-instance map backed by an arbitrary user-provided map. |
|
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 unless an appropriate DiscreteDomain can be provided to the asSet method. |
|
RowSortedTable
Interface that extends Table and whose rows are sorted. |
|
SetMultimap
A Multimap that cannot hold duplicate key-value pairs. |
|
Sets.SetView
An unmodifiable view of a set which may be backed by other sets; this view will change as the backing sets do. |
|
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 . |
|
SortedSetMultimap
A SetMultimap whose set of values for a given key are kept sorted;
that is, they comprise a SortedSet . |
|
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. |
|
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 . |
|
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) . |
Classes in com.google.common.collect used by com.google.common.net | |
---|---|
ImmutableList
A high-performance, immutable, random-access List implementation. |
|
ImmutableListMultimap
An immutable ListMultimap with reliable user-specified key and value
iteration order. |
|
Multimap
A collection that maps keys to values, similar to Map , but in which
each key may be associated with multiple values. |
Classes in com.google.common.collect used by com.google.common.reflect | |
---|---|
ForwardingCollection
A collection which forwards all its method calls to another collection. |
|
ForwardingMap
A map which forwards all its method calls to another map. |
|
ForwardingObject
An abstract base class for implementing the decorator pattern. |
|
ForwardingSet
A set which forwards all its method calls to another set. |
Classes in com.google.common.collect used by com.google.common.util.concurrent | |
---|---|
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. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |