Implementation of Multimap that uses an ArrayList to store the values for a given
key.
Fixed-size
Table 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.
A utility for performing a chained comparison statement.
A multiset that supports concurrent modifications and that provides atomic versions of most
Multiset operations (exceptions where noted).
A descriptor for a
discrete Comparable domain such as all
Integer
instances.
A BiMap backed by two EnumMap instances.
A BiMap backed by an EnumMap instance for keys-to-values, and a HashMap
instance for values-to-keys.
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 superior
Stream library.
A collection which forwards all its method calls to another collection.
A deque which forwards all its method calls to another deque.
An iterator which forwards all its method calls to another iterator.
A map which forwards all its method calls to another map.
A multimap which forwards all its method calls to another multimap.
A multiset which forwards all its method calls to another multiset.
A navigable set which forwards all its method calls to another navigable set.
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 set which forwards all its method calls to another sorted set.
Implementation of
Table using linked hash tables.
A
BiMap backed by two hash tables.
Implementation of
Multimap using hash tables.
Multiset implementation backed by a
HashMap.
A builder for creating immutable bimap instances, especially public static final bimaps
("constant bimaps").
A builder for creating immutable class-to-instance maps.
A
Collection whose contents will never change, and which offers a few additional
guarantees detailed below.
A builder for creating immutable list instances, especially public static final lists
("constant lists").
A builder for creating immutable ListMultimap instances, especially public
static final multimaps ("constant multimaps").
A builder for creating immutable map instances, especially public static final maps
("constant maps").
A builder for creating immutable multimap instances, especially public static final
multimaps ("constant multimaps").
A builder for creating immutable multiset instances, especially public static final
multisets ("constant multisets").
A builder for immutable range maps.
A builder for immutable range sets.
A builder for creating ImmutableSet instances.
A builder for creating immutable SetMultimap instances, especially public static
final multimaps ("constant multimaps").
A builder for creating immutable sorted map instances, especially public static final
maps ("constant maps").
A builder for creating immutable multiset instances, especially public static final
multisets ("constant multisets").
A builder for creating immutable sorted set instances, especially public static final
sets ("constant sets"), with a given comparator.
A builder for creating immutable table instances, especially public static final tables
("constant tables").
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.
A Multiset implementation with predictable iteration order.
An implementation of ListMultimap that supports deterministic iteration order for both
keys and values.
A Multimap that can hold duplicate key-value pairs and that maintains the insertion
ordering of values for a given key.
An object representing the differences between two maps.
A difference between the mappings from two maps with the same key.
A builder of
ConcurrentMap instances that can have keys or values automatically wrapped
in
weak references.
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.
A collection that maps keys to values, similar to
Map, but in which each key may be
associated with
multiple values.
An immutable builder for
Multimap instances, letting you independently select the desired
behaviors (for example, ordering) of the backing map and value-collections.
An intermediate stage in a
MultimapBuilder in which the key-value collection map
implementation has been specified, but the value collection implementation has not.
A collection that supports order-independent equality, like
Set, but may have duplicate
elements.
An unmodifiable element-count pair for a multiset.
A mutable class-to-instance map backed by an arbitrary user-provided map.
A comparator, with additional methods to support common operations.
An iterator that supports a one-element lookahead while iterating.
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.
A mapping from disjoint nonempty ranges to non-null values.
Interface that extends Table and whose rows are sorted.
A Multimap that cannot hold duplicate key-value pairs.
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.
A
Multiset which maintains the ordering of its elements, according to either their
natural order or an explicit
Comparator.
A
SetMultimap whose set of values for a given key are kept sorted; that is, they comprise
a
SortedSet.
An analogue of
Function 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.
Implementation of Table whose row keys and column keys are ordered by their natural
ordering or by supplied comparators.
Implementation of Multimap 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 explicit
Comparator.
An implementation of RangeMap based on a TreeMap, supporting all optional
operations.
dev.mccue.guava.graph.Traverserinstead.