|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
Iterator
interface, to make this interface easier to implement for certain types of
data sources.equals, hashCode, and toString
methods of Entry.element to the ImmutableList.
element to the ImmutableSet.
elements to the ImmutableSet,
ignoring duplicate elements (only the first duplicate element is added).
element to the ImmutableSortedSet.
elements to the ImmutableSortedSet,
ignoring duplicate elements (only the first duplicate element is added).
elements to the ImmutableList.
elements to the ImmutableSet,
ignoring duplicate elements (only the first duplicate element is added).
elements to the ImmutableSet,
ignoring duplicate elements (only the first duplicate element is added).
elements to the ImmutableSortedSet,
ignoring duplicate elements (only the first duplicate element is added).
elements to the ImmutableSortedSet,
ignoring duplicate elements (only the first duplicate element is added).
iterable to collection.
iterator to collection.
true if every element in iterable satisfies the
predicate.
true if every element returned by iterator
satisfies the given predicate.
false.
true.
true if each of its
components evaluates to true.
true if each of its
components evaluates to true.
true if both of its
components evaluate to true.
true if one or more elements in iterable satisfy
the predicate.
true if one or more elements returned by iterator
satisfy the given predicate.
F, resulting in an object
of type T.
Multimap that uses an ArrayList to store
the values for a given key.ArrayListMultimap.
ArrayListMultimap with the expected number of
distinct keys and the expected number of values per distinct key.
ArrayListMultimap with the same mappings as the
specified Multimap.
Iterator to the Enumeration interface.
Searches
sortedList for key using the binary search algorithm.
ImmutableList based on the contents of
the Builder.
ImmutableSet based on the contents of
the Builder.
ImmutableSortedSet based on the contents
of the Builder and its comparator.
ConcurrentMap, backed by the given strategy, that
supports atomic, on-demand computation of values.
ImmutableSortedSet.naturalOrder(), which offers better type-safety.
Iterable object passed as a parameter to the
calling method is not null and contains no null elements.
Iterable object passed as a parameter to the
calling method is not null and contains no null elements.
Iterable object passed as a parameter to the
calling method is not null and contains no null elements.
RuntimeException if the specified element is
illegal.
index specifies a valid element in an array,
list or string of size size.
index specifies a valid element in an array,
list or string of size size.
RuntimeException if the specified key or value is
illegal.
index specifies a valid position in an array,
list or string of size size.
index specifies a valid position in an array,
list or string of size size.
start and end specify a valid positions
in an array, list or string of size size, and are in order.
Collection instances.Ordering.natural() when the natural ordering of the
elements is used.
EnumSet consisting of all enum values that are not in
the specified collection.
EnumSet consisting of all enum values that are not in
the specified collection.
this, but which
in the event of a "tie", then delegates to secondaryComparator.
element to array.
element to array.
Multiset operations (exceptions where noted).value for any input.
Constraint interface.true if iterable contains element; that is,
any object for while equals(element) is true.
true if iterator contains element.
true if this multiset contains at least one occurrence of
each element in the specified collection.
true if the multimap contains the specified key-value pair.
true if the multimap contains any values for the specified
key.
true if iterable contains at least one null
element.
true if iterator contains at least one null
element.
true if the multimap contains the specified value for any
key.
map.
map.
multimap.
Comparator.
element in this multiset.
ConcurrentMultiset using the default initial
capacity, load factor, and concurrency settings.
ConcurrentMultiset containing the specified elements,
using the default initial capacity, load factor, and concurrency settings.
EnumBiMap using the specified key and value
types.
EnumHashBiMap using the specified key type.
EnumMultiset.
EnumMultiset containing the specified elements.
HashBiMap with the default initial capacity
(16).
HashMultiset using the default initial
capacity.
HashMultiset with the specified expected number
of distinct elements.
HashMultiset containing the specified elements.
LinkedHashMultiset using the default initial
capacity.
LinkedHashMultiset with the specified expected
number of distinct elements.
LinkedHashMultiset containing the specified elements.
Set for use by ForwardingMap.entrySet().
Set for use by ForwardingMap.keySet().
Collection for use by ForwardingMap.values().
CustomConcurrentHashMap.Strategy to add support for computing values on-demand.iterable.
iterable.
Iterable.
Iterator.
ListIterator.
computeNext must invoke this method when
there are no elements left in the iteration.
Multiset.Entry instances, each providing an element of the multiset and
the count of that element.
BiMap backed by two EnumMap instances.BiMap backed by an EnumMap instance for keys-to-values, and
a HashMap instance for values-to-keys.EnumMap.Function.
Predicate.
Map.Entry.equals(java.lang.Object).
unfiltered that satisfy a predicate.
unfiltered that satisfy a predicate.
type in unfiltered.
unfiltered that satisfy a predicate.
type in unfiltered.
unfiltered that satisfy a predicate.
unfiltered that satisfy a
predicate.
unfiltered whose keys
satisfy a predicate.
unfiltered whose values
satisfy a predicate.
finalizeReferent() method which a
background thread invokes after the garbage collector reclaims the
referent.FinalizableReference.finalizeReferent() on
them.finalizeReferent() method which a background
thread invokes after the garbage collector reclaims the referent.finalizeReferent() method which a background
thread invokes after the garbage collector reclaims the referent.iterable that satisfies the given
predicate.
iterator that satisfies the given
predicate.
null, if
either is, or otherwise throws a NullPointerException.
array in order.
array in order.
put that silently removes any existing entry
with the value value before proceeding with the BiMap.put(K, V)
operation.
Enumeration to the Iterator interface.
comparator.
Map<String, String> from a Properties instance.
iterator position + 1 times, returning the element
at the positionth position.
CustomConcurrentHashMap.Strategy.newEntry(K, int, E))
when the given entry was created.
null if no
entry for this class is present.
iterable.
iterator to the end, returning the last element.
CustomConcurrentHashMap.Strategy.newEntry(K, int, E) when the given entry was
created.
iterable.
iterable, or defaultValue if the iterable is empty.
iterator.
iterator, or defaultValue if the iterator is empty.
BiMap backed by two HashMap instances.map.
Map.Entry.hashCode().
Multimap using hash tables.HashMultimap.
HashMultimap with the same mappings as the specified
Multimap.
HashMap.HashMultiset using the default initial
capacity.
BiMap with reliable user-specified iteration order.public
static final bimaps ("constant bimaps").List implementation.public static final lists ("constant lists").Map with reliable user-specified iteration
order.public
static final maps ("constant maps").ListMultimap with reliable user-specified key and value
iteration order.public static final multimaps ("constant multimaps").Set with reliable, user-specified
iteration order.public static final sets ("constant sets").SortedSet that stores its elements in a sorted array.public static final sets ("constant sets"), with a given
comparator.true if the object reference
being tested is a member of the given collection.
ListMultimap that contains the results of applying
a specified function to each item in an Iterable of values.
Multimap by applying a
specified function to each item in an Iterable of values.
source into dest, with
its key and value reversed.
true if the multimap contains no key-value pairs.
true if the object being
tested equals() the given target or both are null.
true if the object reference
being tested is null.
true if each element in iterable after the first is
greater than or equal to the element that preceded it, according to this
ordering.
true if the object being
tested refers to the same object as the given target or both are null.
true if each element in iterable after the first is
strictly greater than the element that preceded it, according to
this ordering.
Iterable.Iterator.tokens, converted to strings if
necessary, separated by delimiter.
tokens, converted to strings if
necessary, separated by delimiter.
tokens, converted to strings if
necessary, separated by delimiter.
tokens, converted to strings if
necessary, separated by delimiter.
map, with entries
separated by entryDelimiter, and keys and values separated with
keyValueSeparator.
tokens to appendable, separated by
delimiter.
tokens to appendable, separated by
delimiter.
tokens to appendable, separated by
delimiter.
tokens to appendable, separated by
delimiter.
map to appendable, with entries
separated by entryDelimiter, and keys and values separated with
keyValueSeparator.
IOException from the supplied
Appendable.null
indicating that natural ordering is used.
limitSize elements of the given
iterable.
limitSize elements of the
given iterator.
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.
LinkedHashMultimap with the same mappings as the
specified Multimap.
Multiset implementation with predictable iteration order.LinkedHashMultiset using the default initial
capacity.
ListMultimap that supports deterministic
iteration order for both keys and values.LinkedListMultimap.
LinkedListMultimap with the same mappings as the
specified Multimap.
Multimap that can hold duplicate key-value pairs and that maintains
the insertion ordering of values for a given key.List instances.CustomConcurrentHashMap.Builder.buildComputingMap(
CustomConcurrentHashMap.ComputingStrategy,
com.google.common.base.Function).
Map or
Multimap.MapConstraint interface.ConcurrentMap builder, providing any combination of these
features: soft or weak keys, soft or weak values, timed expiration, and on-demand
computation of values.MapMaker instance with default settings,
including strong keys, strong values, and no automatic expiration.
Map instances.get() and returns that value on subsequent calls to
get().
Map, but which may associate multiple
values with a single key.Multimap.Set, but
may have duplicate elements.Multiset instances.ArrayList instance.
ArrayList instance containing the given elements.
ArrayList instance containing the given elements.
ArrayList instance containing the given elements.
ArrayListMultimap instance.
ArrayListMultimap instance initialized with all elements
from the supplied Multimap.
ArrayList instance backed by an array of the
exact size specified; equivalent to
ArrayList.ArrayList(int).
ArrayList instance sized appropriately to hold an
estimated number of elements without resizing.
ClassToInstanceMap instance backed by a HashMap using the default initial capacity and load factor.
ClassToInstanceMap instance backed by a given empty
backingMap.
EnumMap instance.
EnumMap initialized from the specified map.
EnumSet instance containing the given elements.
HashMap instance.
HashMap instance with the same mappings as the specified
map.
HashMap instance with enough capacity to hold the
specified number of elements without rehashing.
HashMultimap instance.
HashMultimap instance initialized with all elements from
the supplied Multimap.
HashSet instance.
HashSet instance containing the given elements.
HashSet instance containing the given elements.
HashSet instance containing the given elements.
HashSet instance with enough capacity to hold the
specified number of elements without rehashing.
IdentityHashMap instance.
LinkedHashMap instance.
LinkedHashMap instance with the same
mappings as the specified map.
LinkedHashMultimap instance.
LinkedHashMultimap instance initialized with all elements
from the supplied Multimap.
LinkedHashSet instance.
LinkedHashSet instance containing the given elements.
LinkedList instance.
LinkedList instance containing the given elements.
LinkedListMultimap instance.
LinkedListMultimap instance initialized with all elements
from the supplied Multimap.
ListMultimap that uses the provided map and factory.
Multimap that uses the provided map and factory.
SetMultimap that uses the provided map and factory.
SortedSetMultimap that uses the provided map and
factory.
TreeMap instance using the natural ordering of its
elements.
TreeMap instance with the same mappings as the specified
map and using the same ordering as the specified map.
TreeMap instance using the given comparator.
TreeMultimap instance using the natural ordering
of keys and values.
TreeMultimap with the same mappings as the specified
Multimap.
TreeMultimap instance using explicit comparators.
TreeMultimap instance using explicit comparators,
initialized with all elements from the supplied Multimap.
TreeSet instance sorted by the natural sort
ordering of its elements.
TreeSet instance containing the given elements sorted by
their natural ordering.
TreeSet instance with the given comparator.
true if the given predicate
evaluates to false.
true if the object reference
being tested is not null.
null is an acceptable value for that parameter.null as less than all other values
and uses this to compare non-null values.
null as greater than all other
values and uses this ordering to compare non-null values.
Object.instance.
F which orders elements by first applying
a function to them, then comparing those results using this.
true if any one of its
components evaluates to true.
true if any one of its
components evaluates to true.
true if either of its
components evaluates to true.
PeekingIterator.peek().
PeekingIterator.
Predicate instances.key with value in the built bimap.
key with value in the built map.
map's keys and values in the built bimap.
map's keys and values in the built map.
element, or
makes no change if this is not possible.
Ordering equivalent to
Collections.reverseOrder(Comparator).
element such that the ConcurrentMultiset.count(java.lang.Object)
of the element becomes count.
element to newCount, but
only if the count is currently oldCount.
Multimap that cannot hold duplicate key-value pairs.Set instances.value.
iterable.
iterator.
iterable that skips its first
numberToSkip elements.
next() on iterator, either numberToSkip times
or until hasNext() returns false, whichever comes first.
SoftReference (by default, strong references
are used).
SoftReference (by default, strong references
are used).
SetMultimap whose set of values for a given key are kept sorted;
that is, they comprise a SortedSet.fromIndex, inclusive, and toIndex, exclusive.
ListMultimap backed by the
specified multimap.
SetMultimap backed by the
specified multimap.
SortedSetMultimap backed by
the specified multimap.
get() method synchronizes on
delegate before calling it, making it thread-safe.
toString() on its argument.
{key}={value}.
toString method.
iterable, with the format
[e1, e2, ..., en].
iterator, with the format
[e1, e2, ..., en].
toString on the map returned by Multimap.asMap().
toString() on its argument.
function to each element of fromIterable.
function to each element of fromIterator.
function to each element of fromList.
Multimap whose keys and values are ordered by their
natural ordering or by supplied comparators.TreeMultimap using the natural ordering of the
key and value classes.
TreeMultimap with explicit comparators.
TreeMultimap with the same mappings as the specified
multimap.
TreeMultimap with explicit comparators and the same
mappings as the specified multimap.
TreeMap.ArrayListMultimap, if feasible.
Map.values() are the given
elements in the given order, and each key is the product of invoking a
supplied function on its corresponding value.
iterable.
iterator.
UnmodifiableIterator.remove().ListMultimap.
SetMultimap.
SortedSetMultimap.
null
indicating that natural ordering is used.
CustomConcurrentHashMap.ComputingStrategy.compute(K, E, com.google.common.base.Function) if necessary.
WeakReference (by default, strong references
are used).
WeakReference (by default, strong references
are used).
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||