|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
Object.toString() for Iterable
instances.Iterator
interface, to make this interface easier to implement for certain types of
data sources.equals, hashCode, and toString
methods of Entry.Multiset
interface.equals, hashCode, and toString
methods of Multiset.Entry.AbstractIterator for data sources which can
handle arbitrary removal by element, concurrently with iteration.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.
Arrays.asList(T...).
Arrays.asList(T...).
Arrays.asList(T...).
Arrays.asList(T...).
Arrays.asList(T...).
Arrays.asList(T...).
Arrays.asList(T...).
Arrays.asList(T...).
Searches
sortedList for key using the binary search algorithm.
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.
RuntimeException if the specified key or value is
illegal.
Collection instances.Comparators.naturalOrder() when the natural ordering of the
elements is used.
byte values.
char values.
short values.
int values.
long values.
double values.
float values.
boolean values.
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.
Multiset operations (exceptions where noted).value for any input.
Constraint interface.true if this collection contains the specified element.
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 all of the elements in the
specified collection.
true if this multiset contains at least one occurrence of
each element in the specified collection.
true if map contains an entry mapping key
to value.
true if the multimap contains the specified key-value pair.
true if the multimap contains any values for the specified
key.
true if this map contains a mapping 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.
true if this map maps one or more keys to the specified
value.
map.
map.
multimap.
Comparator.
element in this multiset.
HashMultiset using the default initial
capacity.
HashMultiset with the specified expected number
of distinct elements.
HashMultiset containing the specified elements.
AbstractMultiset.elementSet.
iterable.
iterable.
If the element set supports any removal operations, these necessarily cause all occurrences of the removed element(s) to be removed from the multiset. Implementations are not expected to support the add operations, although this is possible.
A common use for the element set is to find the number of distinct
elements in the multiset: elementSet().size().
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.EnumMultiset.
EnumMultiset containing the specified elements.
Function.
Predicate.
Map.Entry.equals(java.lang.Object).
Multiset.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.
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.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.
put that silently removes any existing entry
with the value value before proceeding with the BiMap.put(K, V)
operation.
comparator.
Enumeration to the Iterator interface.
Collection view of the given Iterable, or
the Iterable itself if it is already a Collection (in which
case the rest of this documentation does not apply).
Map<String, String> from a Properties instance.
iterator position + 1 times, returning the element
at the positionth position.
null if
this map contains no mapping for the key.
null if no
entry for this class is present.
iterable.
iterator to the end, returning the last element.
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().
Multiset.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.List instance containing the given elements.
List instance containing the given elements.
List instance containing the given elements.
List instance with no elements.
List instance with a single element.
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.SortedSet that stores its elements in a sorted array.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.
ArrayListMultimap that's the inverse of the provided
multimap.
HashMultimap that's the inverse of the provided multimap.
TreeMultimap that's the inverse of the provided multimap.
true if the multimap contains no key-value pairs.
true if this map contains no key-value mappings.
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 the object being
tested refers to the same object as the given target or both are null.
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 (16 distinct elements) and load factor (0.75).
LinkedHashMultiset with the specified
expected number of distinct elements and the default load factor (0.75).
LinkedHashMultiset containing the specified
elements.
Multimap that can hold duplicate key-value pairs and that maintains
the insertion ordering of values for a given key.List instances.Map or
Multimap.MapConstraint interface.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 with the given initial capacity.
ArrayList instance with the given expected size.
ClassToInstanceMap instance backed by a HashMap using the default initial capacity and load factor.
ClassToInstanceMap instance backed by a given empty
backingMap.
ConcurrentHashMap instance.
EnumBiMap using the specified key and value
types.
EnumHashBiMap using the specified key type.
EnumMap instance.
EnumMultiset.
EnumMultiset containing the specified elements.
EnumMultiset containing the specified elements.
EnumSet instance containing the given elements.
HashBiMap with the default initial capacity
(16).
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.
HashMultiset using the default initial capacity
(16 distinct elements).
HashMultiset containing the specified elements, using the
default initial capacity (16 distinct elements).
HashMultiset containing the specified elements.
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.
Set that uses identity to determine equality.
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.
LinkedList instance containing the given elements.
LinkedList instance containing the given elements.
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 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.
TreeMultiset instance.
TreeMultiset instance, sorted according to the
specified comparator.
TreeSet instance sorted by the natural sort
ordering of its elements.
TreeSet instance containing the given elements sorted by
their natural ordering.
TreeSet instance containing the given elements sorted by
their natural ordering.
TreeSet instance containing the given elements sorted by
their natural ordering.
TreeSet instance with the given comparator.
TreeSet instance containing the given elements sorted by
the given comparator.
TreeSet instance containing the given elements sorted by
the given comparator.
TreeSet instance containing the given elements sorted by
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 greater than all other
values and uses the given comparator to compare non-null values.
null as less than all other
values and uses comparator to compare non-null values.
null as less than all other values
and uses this ordering to compare non-null values.
null as greater than all other
values and uses this ordering to compare non-null values.
Object.instance.
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.
Serializable comparators that
provides convenience methods for common uses.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.
ConcurrentMap implementation that internally utilizes your choice
of strong, soft or weak references for its keys and for its values.element from the backing data source.
element, or
makes no change if this is not possible.
reverse of this ordering.
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.iterable.
iterator.
iterable that skips its first
numberToSkip elements.
next() on iterator, either numberToSkip times
or until hasNext() returns false, whichever comes first.
Sorts list according
to this ordering.
SetMultimap whose set of values for a given key are kept sorted;
that is, they comprise a SortedSet.toString().
fromIndex, inclusive, and toIndex, exclusive.
ListMultimap backed by the
specified multimap.
SetMultimap backed by the
specified multimap.
SortedSetMultimap backed by
the specified multimap.
toString() on its argument.
Boolean instances into a new array of
primitive booleans.
Byte instances into a new array of
primitive bytes.
Character instances into a new array of
primitive chars.
Double instances into a new array of
primitive doubles.
Float instances into a new array of
primitive floats.
Integer instances into a new array of
primitive ints.
Long instances into a new array of
primitive longs.
Short instances into a new array of
primitive shorts.
{key}={value}.
toString method.
iterable, with the format
[e1, e2, ..., en].
iterator, with the format
[e1, e2, ..., en].
toString() on its argument.
toString().
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.
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||