Uses of Annotation Interface
com.google.common.collect.ParametricNullness
Packages that use ParametricNullness
Package
Description
Collection interfaces and implementations, and other utilities for collections.
-
Uses of ParametricNullness in com.google.common.collect
Fields in com.google.common.collect with annotations of type ParametricNullnessModifier and TypeFieldDescription(package private) final A
Streams.TemporaryPair.a
(package private) final B
Streams.TemporaryPair.b
private final C
Tables.ImmutableCell.columnKey
private final E
Multisets.ImmutableEntry.element
(package private) final E
Lists.OnePlusArrayList.first
(package private) final E
Lists.TwoPlusArrayList.first
(package private) final K
AbstractMapBasedMultimap.WrappedCollection.key
private final K
CompactHashMap.MapEntry.key
private final K
FilteredEntryMultimap.ValuePredicate.key
(package private) final K
FilteredKeyMultimap.AddRejectingList.key
(package private) final K
FilteredKeyMultimap.AddRejectingSet.key
(package private) final K
ImmutableEntry.key
private final K
LinkedHashMultimap.ValueSet.key
(package private) final K
LinkedListMultimap.Node.key
(package private) final K
LinkedListMultimap.ValueForKeyIterator.key
private final V
Maps.ValueDifferenceImpl.left
private final V
Maps.ValueDifferenceImpl.right
private final R
Tables.ImmutableCell.rowKey
(package private) final E
Lists.TwoPlusArrayList.second
(package private) final V
ImmutableEntry.value
(package private) V
LinkedListMultimap.Node.value
private final V
Tables.ImmutableCell.value
Methods in com.google.common.collect with annotations of type ParametricNullnessModifier and TypeMethodDescriptionStreams.DoubleFunctionWithIndex.apply
(double from, long index) Applies this function to the given argument and its index within a stream.Applies this function to the given argument and its index within a stream.Streams.IntFunctionWithIndex.apply
(int from, long index) Applies this function to the given argument and its index within a stream.Streams.LongFunctionWithIndex.apply
(long from, long index) Applies this function to the given argument and its index within a stream.(package private) K
Returns its input, or throws an exception if this is not a valid key.(package private) K
(package private) V
AbstractBiMap.checkValue
(V value) Returns its input, or throws an exception if this is not a valid value.(package private) V
AbstractBiMap.Inverse.checkValue
(V value) ForwardingQueue.element()
static <T> T
Returns the first element initerable
that satisfies the given predicate; use this method only when such an element is known to exist.static <T> T
Returns the first element initerator
that satisfies the given predicate; use this method only when such an element is known to exist.AbstractMapBasedMultimap.SortedKeySet.first()
AbstractMapBasedMultimap.WrappedSortedSet.first()
ForwardingSortedSet.first()
Maps.FilteredEntrySortedMap.SortedKeySet.first()
Maps.SortedKeySet.first()
Sets.DescendingSet.first()
Sets.FilteredSortedSet.first()
SortedMultisets.ElementSet.first()
AbstractMapBasedMultimap.SortedAsMap.firstKey()
AbstractNavigableMap.firstKey()
ForwardingSortedMap.firstKey()
Maps.DescendingMap.firstKey()
Maps.FilteredEntrySortedMap.firstKey()
Maps.SortedAsMapView.firstKey()
Maps.TransformedEntriesSortedMap.firstKey()
protected abstract E
AbstractIndexedListIterator.get
(int index) Returns the element with the specified index.AbstractMapBasedMultimap.WrappedList.get
(int index) final E
FluentIterable.get
(int position) Returns the element at the specified position in this fluent iterable.ForwardingList.get
(int index) static <T> T
Returns the element at the specified position in an iterable or a default value otherwise.static <T> T
Returns the element at the specified position in an iterable.protected T
Iterators.ArrayItr.get
(int index) static <T> T
Advancesiterator
position + 1
times, returning the element at theposition
th position ordefaultValue
otherwise.static <T> T
Advancesiterator
position + 1
times, returning the element at theposition
th position.Lists.AbstractListWrapper.get
(int index) Lists.OnePlusArrayList.get
(int index) Lists.ReverseList.get
(int index) Lists.TransformingRandomAccessList.get
(int index) Lists.TwoPlusArrayList.get
(int index) Table.Cell.getColumnKey()
Returns the column key of this cell.Tables.ImmutableCell.getColumnKey()
Multiset.Entry.getElement()
Returns the multiset element corresponding to this entry.final E
Multisets.ImmutableEntry.getElement()
(package private) E
TreeMultiset.AvlNode.getElement()
ForwardingDeque.getFirst()
static <T> T
Returns the first element initerable
ordefaultValue
if the iterable is empty.(package private) K
AbstractMapBasedMultimap.WrappedCollection.getKey()
abstract K
AbstractMapEntry.getKey()
CompactHashMap.MapEntry.getKey()
ForwardingMapEntry.getKey()
final K
ImmutableEntry.getKey()
LinkedListMultimap.Node.getKey()
ForwardingDeque.getLast()
static <T> T
Returns the last element ofiterable
ordefaultValue
if the iterable is empty.static <T> T
Returns the last element ofiterable
.static <T> T
Advancesiterator
to the end, returning the last element ordefaultValue
if the iterator is empty.static <T> T
Advancesiterator
to the end, returning the last element.private static <T> T
Iterables.getLastInNonemptyList
(List<T> list) static <T> T
Returns the next element initerator
ordefaultValue
if the iterator is empty.static <T> T
Iterables.getOnlyElement
(Iterable<? extends T> iterable, T defaultValue) Returns the single element contained initerable
, ordefaultValue
if the iterable is empty.static <T> T
Iterables.getOnlyElement
(Iterable<T> iterable) Returns the single element contained initerable
.static <T> T
Iterators.getOnlyElement
(Iterator<? extends T> iterator, T defaultValue) Returns the single element contained initerator
, ordefaultValue
if the iterator is empty.static <T> T
Iterators.getOnlyElement
(Iterator<T> iterator) Returns the single element contained initerator
.(package private) abstract T
CompactHashMap.Itr.getOutput
(int entry) Table.Cell.getRowKey()
Returns the row key of this cell.Tables.ImmutableCell.getRowKey()
abstract V
AbstractMapEntry.getValue()
(package private) abstract V
ArrayTable.ArrayMap.getValue
(int index) CompactHashMap.MapEntry.getValue()
ForwardingMapEntry.getValue()
final V
ImmutableEntry.getValue()
LinkedListMultimap.Node.getValue()
Table.Cell.getValue()
Returns the value of this cell.Tables.ImmutableCell.getValue()
AbstractMapBasedMultimap.SortedKeySet.last()
AbstractMapBasedMultimap.WrappedSortedSet.last()
ForwardingSortedSet.last()
Maps.FilteredEntrySortedMap.SortedKeySet.last()
Maps.SortedKeySet.last()
Sets.DescendingSet.last()
Sets.FilteredNavigableSet.last()
Sets.FilteredSortedSet.last()
SortedMultisets.ElementSet.last()
AbstractMapBasedMultimap.SortedAsMap.lastKey()
AbstractNavigableMap.lastKey()
ForwardingSortedMap.lastKey()
Maps.DescendingMap.lastKey()
Maps.FilteredEntrySortedMap.lastKey()
Maps.SortedAsMapView.lastKey()
Maps.TransformedEntriesSortedMap.lastKey()
MapDifference.ValueDifference.leftValue()
Returns the value from the left map (possibly null).Maps.ValueDifferenceImpl.leftValue()
static <T> T
Comparators.max
(T a, T b, Comparator<? super T> comparator) Returns the maximum of the two values, according to the given comparator.<E extends T>
EOrdering.max
(E a, E b) Returns the greater of the two values according to this ordering.<E extends T>
EOrdering.max
(E a, E b, E c, E... rest) Returns the greatest of the specified values according to this ordering.<E extends T>
EReturns the greatest of the specified values according to this ordering.<E extends T>
EReturns the greatest of the specified values according to this ordering.static <T> T
Comparators.min
(T a, T b, Comparator<? super T> comparator) Returns the minimum of the two values, according to the given comparator.<E extends T>
EOrdering.min
(E a, E b) Returns the lesser of the two values according to this ordering.<E extends T>
EOrdering.min
(E a, E b, E c, E... rest) Returns the least of the specified values according to this ordering.<E extends T>
EReturns the least of the specified values according to this ordering.<E extends T>
EReturns the least of the specified values according to this ordering.final E
AbstractIndexedListIterator.next()
final T
AbstractIterator.next()
AbstractMapBasedMultimap.Itr.next()
AbstractMapBasedMultimap.WrappedCollection.WrappedIterator.next()
AbstractMapBasedMultiset.MapBasedMultisetIterator.next()
CompactHashMap.Itr.next()
ForwardingIterator.next()
Iterators.ConcatenatedIterator.next()
Iterators.MergingIterator.next()
Iterators.PeekingImpl.next()
Iterators.SingletonIterator.next()
LinkedListMultimap.DistinctKeyIterator.next()
LinkedListMultimap.ValueForKeyIterator.next()
Multisets.MultisetIteratorImpl.next()
PeekingIterator.next()
final T
TransformedIterator.next()
final T
AbstractIterator.peek()
Returns the next element in the iteration without advancing the iteration, according to the contract ofPeekingIterator.peek()
.Iterators.PeekingImpl.peek()
PeekingIterator.peek()
Returns the next element in the iteration, without advancing the iteration.ForwardingDeque.pop()
final E
AbstractIndexedListIterator.previous()
AbstractMapBasedMultimap.WrappedList.WrappedListIterator.previous()
ForwardingListIterator.previous()
LinkedListMultimap.ValueForKeyIterator.previous()
final T
TransformedListIterator.previous()
AbstractMapBasedMultimap.WrappedList.remove
(int index) ForwardingList.remove
(int index) ForwardingQueue.remove()
Lists.AbstractListWrapper.remove
(int index) Lists.ReverseList.remove
(int index) Lists.TransformingRandomAccessList.remove
(int index) ForwardingDeque.removeFirst()
private V
AbstractBiMap.removeFromBothMaps
(Object key) ForwardingDeque.removeLast()
MapDifference.ValueDifference.rightValue()
Returns the value from the right map (possibly null).Maps.ValueDifferenceImpl.rightValue()
(package private) abstract V
final V
protected E
ForwardingNavigableSet.standardFirst()
protected E
ForwardingNavigableSet.standardLast()
(package private) abstract T
Maps.EntryTransformer.transformEntry
(K key, V1 value) Determines an output value based on a key-value pair.(package private) static <T> T
NullnessCasts.uncheckedCastNullableTToT
(T t) Accepts a@Nullable T
and returns a plainT
, without performing any check that that conversion is safe.(package private) static <T> T
NullnessCasts.unsafeNull()
Returnsnull
as any type, even one that does not includenull
.Method parameters in com.google.common.collect with annotations of type ParametricNullnessModifier and TypeMethodDescriptionboolean
void
void
int
Adds a number of occurrences of an element to this multiset.final boolean
int
boolean
boolean
void
boolean
boolean
boolean
void
void
int
boolean
void
void
void
boolean
Adds a single occurrence of the specified element to this multiset.int
Adds a number of occurrences of an element to this multiset.int
boolean
int
final boolean
Deprecated.Unsupported operation.int
void
int
(package private) TreeMultiset.AvlNode
<E> TreeMultiset.AvlNode.add
(Comparator<? super E> comparator, E e, int count, int[] result) final void
Deprecated.Unsupported operation.void
void
private TreeMultiset.AvlNode
<E> TreeMultiset.AvlNode.addLeftChild
(E e, int count) private LinkedListMultimap.Node
<K, V> Adds a new node for the specified key-value pair before the specifiednextSibling
element, or at the end of the list ifnextSibling
is null.private LinkedListMultimap.Node
<K, V> Adds a new node for the specified key-value pair before the specifiednextSibling
element, or at the end of the list ifnextSibling
is null.private TreeMultiset.AvlNode
<E> TreeMultiset.AvlNode.addRightChild
(E e, int count) boolean
(package private) boolean
Applies this function to the given argument and its index within a stream.static <E> List
<E> Lists.asList
(E first, E[] rest) Returns an unmodifiable list containing the specified first element and backed by the specified array of additional elements.static <E> List
<E> Lists.asList
(E first, E second, E[] rest) Returns an unmodifiable list containing the specified first and second element, and backed by the specified array of additional elements.static <E> List
<E> Lists.asList
(E first, E second, E[] rest) Returns an unmodifiable list containing the specified first and second element, and backed by the specified array of additional elements.(package private) static <K,
V1, V2>
Function<V1, V2> Maps.asValueToValueFunction
(Maps.EntryTransformer<? super K, V1, V2> transformer, K key) int
Ordering.binarySearch
(List<? extends T> sortedList, T key) Deprecated.UseCollections.binarySearch(List, Object, Comparator)
directly.static <E> int
SortedLists.binarySearch
(List<? extends E> list, E key, Comparator<? super E> comparator, SortedLists.KeyPresentBehavior presentBehavior, SortedLists.KeyAbsentBehavior absentBehavior) Searches the specified list for the specified object using the binary search algorithm.static <E,
K> int SortedLists.binarySearch
(List<E> list, Function<? super E, K> keyFunction, K key, Comparator<? super K> keyComparator, SortedLists.KeyPresentBehavior presentBehavior, SortedLists.KeyAbsentBehavior absentBehavior) Binary searches the list for the specified key, using the specified key function.private TreeMultiset.AvlNode
<E> TreeMultiset.AvlNode.ceiling
(Comparator<? super E> comparator, E e) AbstractMapBasedMultimap.NavigableAsMap.ceilingEntry
(K key) AbstractNavigableMap.ceilingEntry
(K key) ForwardingNavigableMap.ceilingEntry
(K key) Maps.DescendingMap.ceilingEntry
(K key) Maps.TransformedEntriesNavigableMap.ceilingEntry
(K key) Maps.UnmodifiableNavigableMap.ceilingEntry
(K key) AbstractMapBasedMultimap.NavigableAsMap.ceilingKey
(K key) AbstractNavigableMap.ceilingKey
(K key) ForwardingNavigableMap.ceilingKey
(K key) Maps.DescendingMap.ceilingKey
(K key) Maps.TransformedEntriesNavigableMap.ceilingKey
(K key) Maps.UnmodifiableNavigableMap.ceilingKey
(K key) (package private) K
Returns its input, or throws an exception if this is not a valid key.(package private) K
(package private) V
AbstractBiMap.checkValue
(V value) Returns its input, or throws an exception if this is not a valid value.(package private) V
AbstractBiMap.Inverse.checkValue
(V value) Returns a view of all mappings that have the given column key.int
int
int
int
abstract <T> ComparisonChain
ComparisonChain.compare
(T left, T right, Comparator<T> comparator) Compares two objects using a comparator, if the result of this comparison chain has not already been determined.abstract <T> ComparisonChain
ComparisonChain.compare
(T left, T right, Comparator<T> comparator) Compares two objects using a comparator, if the result of this comparison chain has not already been determined.<T> ComparisonChain
ComparisonChain.InactiveComparisonChain.compare
(T left, T right, Comparator<T> comparator) <T> ComparisonChain
ComparisonChain.InactiveComparisonChain.compare
(T left, T right, Comparator<T> comparator) int
int
abstract int
abstract int
int
int
static <T> T[]
ObjectArrays.concat
(T[] array, T element) Returns a new array that appendselement
toarray
.static <T> T[]
ObjectArrays.concat
(T element, T[] array) Returns a new array that prependselement
toarray
.(package private) boolean
(package private) int
TreeMultiset.AvlNode.count
(Comparator<? super E> comparator, E e) (package private) static <V> MapDifference.ValueDifference
<V> Maps.ValueDifferenceImpl.create
(V left, V right) (package private) static <V> MapDifference.ValueDifference
<V> Maps.ValueDifferenceImpl.create
(V left, V right) (package private) Collection
<V> AbstractMapBasedMultimap.createCollection
(K key) Creates the collection of values for an explicitly provided key.(package private) Collection
<V> LinkedHashMultimap.createCollection
(K key) Creates the collection of values for an explicitly provided key.(package private) Collection
<V> TreeMultimap.createCollection
(K key) (package private) static <T> GeneralRange
<T> GeneralRange.downTo
(Comparator<? super T> comparator, T endpoint, BoundType boundType) Returns everything above the endpoint relative to the specified comparator, with the specified endpoint behavior.private TreeMultiset.AvlNode
<E> TreeMultiset.AvlNode.floor
(Comparator<? super E> comparator, E e) AbstractMapBasedMultimap.NavigableAsMap.floorEntry
(K key) AbstractNavigableMap.floorEntry
(K key) ForwardingNavigableMap.floorEntry
(K key) Maps.DescendingMap.floorEntry
(K key) Maps.TransformedEntriesNavigableMap.floorEntry
(K key) Maps.UnmodifiableNavigableMap.floorEntry
(K key) An alternate form ofput
that silently removes any existing entry with the valuevalue
before proceeding with theBiMap.put(K, V)
operation.An alternate form ofput
that silently removes any existing entry with the valuevalue
before proceeding with theBiMap.put(K, V)
operation.Returns a view collection of the values associated withkey
in this multimap, if any.Returns a view collection of the values associated withkey
in this multimap, if any.Returns a view collection of the values associated withkey
in this multimap, if any.Returns a collection view of all values associated with a key.static <T> T
Returns the element at the specified position in an iterable or a default value otherwise.static <T> T
Advancesiterator
position + 1
times, returning the element at theposition
th position ordefaultValue
otherwise.Returns a view collection of the values associated withkey
in this multimap, if any.Returns a view collection of the values associated withkey
in this multimap, if any.Returns a view collection of the values associated withkey
in this multimap, if any.Returns a view collection of the values associated withkey
in this multimap, if any.Returns a collection view of all values associated with a key.static <T> T
Returns the first element initerable
ordefaultValue
if the iterable is empty.static <T> T
Returns the last element ofiterable
ordefaultValue
if the iterable is empty.static <T> T
Advancesiterator
to the end, returning the last element ordefaultValue
if the iterator is empty.static <T> T
Returns the next element initerator
ordefaultValue
if the iterator is empty.static <T> T
Iterables.getOnlyElement
(Iterable<? extends T> iterable, T defaultValue) Returns the single element contained initerable
, ordefaultValue
if the iterable is empty.static <T> T
Iterators.getOnlyElement
(Iterator<? extends T> iterator, T defaultValue) Returns the single element contained initerator
, ordefaultValue
if the iterator is empty.private Collection
<V> AbstractMapBasedMultimap.getOrCreateCollection
(K key) DescendingMultiset.headMultiset
(E toElement, BoundType boundType) ForwardingSortedMultiset.headMultiset
(E upperBound, BoundType boundType) SortedMultiset.headMultiset
(E upperBound, BoundType boundType) Returns a view of this multiset restricted to the elements less thanupperBound
, optionally includingupperBound
itself.TreeMultiset.headMultiset
(E upperBound, BoundType boundType) UnmodifiableSortedMultiset.headMultiset
(E upperBound, BoundType boundType) AbstractMapBasedMultimap.NavigableAsMap.higherEntry
(K key) AbstractNavigableMap.higherEntry
(K key) ForwardingNavigableMap.higherEntry
(K key) Maps.DescendingMap.higherEntry
(K key) Maps.TransformedEntriesNavigableMap.higherEntry
(K key) Maps.UnmodifiableNavigableMap.higherEntry
(K key) static <R,
C, V> Table.Cell <R, C, V> Tables.immutableCell
(R rowKey, C columnKey, V value) Returns an immutable cell with the specified row key, column key, and value.static <R,
C, V> Table.Cell <R, C, V> Tables.immutableCell
(R rowKey, C columnKey, V value) Returns an immutable cell with the specified row key, column key, and value.static <R,
C, V> Table.Cell <R, C, V> Tables.immutableCell
(R rowKey, C columnKey, V value) Returns an immutable cell with the specified row key, column key, and value.static <K,
V> Map.Entry <K, V> Maps.immutableEntry
(K key, V value) Returns an immutable map entry with the specified key and value.static <K,
V> Map.Entry <K, V> Maps.immutableEntry
(K key, V value) Returns an immutable map entry with the specified key and value.static <E> Multiset.Entry
<E> Multisets.immutableEntry
(E e, int n) Returns an immutable multiset entry with the specified element and count.(package private) void
CompactHashMap.insertEntry
(int entryIndex, K key, V value, int hash, int mask) Creates a fresh entry with the specified object at the specified position in the entry arrays.(package private) void
CompactHashMap.insertEntry
(int entryIndex, K key, V value, int hash, int mask) Creates a fresh entry with the specified object at the specified position in the entry arrays.(package private) void
CompactHashSet.insertEntry
(int entryIndex, E object, int hash, int mask) Creates a fresh entry with the specified object at the specified position in the entry arrays.(package private) void
CompactLinkedHashMap.insertEntry
(int entryIndex, K key, V value, int hash, int mask) (package private) void
CompactLinkedHashMap.insertEntry
(int entryIndex, K key, V value, int hash, int mask) (package private) void
CompactLinkedHashSet.insertEntry
(int entryIndex, E object, int hash, int mask) AbstractMapBasedMultimap.NavigableAsMap.lowerEntry
(K key) AbstractNavigableMap.lowerEntry
(K key) ForwardingNavigableMap.lowerEntry
(K key) Maps.DescendingMap.lowerEntry
(K key) Maps.TransformedEntriesNavigableMap.lowerEntry
(K key) Maps.UnmodifiableNavigableMap.lowerEntry
(K key) static <T> T
Comparators.max
(T a, T b, Comparator<? super T> comparator) Returns the maximum of the two values, according to the given comparator.static <T> T
Comparators.max
(T a, T b, Comparator<? super T> comparator) Returns the maximum of the two values, according to the given comparator.<E extends T>
EOrdering.max
(E a, E b) Returns the greater of the two values according to this ordering.<E extends T>
EOrdering.max
(E a, E b) Returns the greater of the two values according to this ordering.<E extends T>
EOrdering.max
(E a, E b, E c, E... rest) Returns the greatest of the specified values according to this ordering.<E extends T>
EOrdering.max
(E a, E b, E c, E... rest) Returns the greatest of the specified values according to this ordering.<E extends T>
EOrdering.max
(E a, E b, E c, E... rest) Returns the greatest of the specified values according to this ordering.<E extends T>
EReverseOrdering.max
(E a, E b) <E extends T>
EReverseOrdering.max
(E a, E b) <E extends T>
EReverseOrdering.max
(E a, E b, E c, E... rest) <E extends T>
EReverseOrdering.max
(E a, E b, E c, E... rest) <E extends T>
EReverseOrdering.max
(E a, E b, E c, E... rest) private static <R,
C, V> void TableCollectors.mergeTables
(Table<R, C, V> table, R row, C column, V value, BinaryOperator<V> mergeFunction) private static <R,
C, V> void TableCollectors.mergeTables
(Table<R, C, V> table, R row, C column, V value, BinaryOperator<V> mergeFunction) static <T> T
Comparators.min
(T a, T b, Comparator<? super T> comparator) Returns the minimum of the two values, according to the given comparator.static <T> T
Comparators.min
(T a, T b, Comparator<? super T> comparator) Returns the minimum of the two values, according to the given comparator.<E extends T>
EOrdering.min
(E a, E b) Returns the lesser of the two values according to this ordering.<E extends T>
EOrdering.min
(E a, E b) Returns the lesser of the two values according to this ordering.<E extends T>
EOrdering.min
(E a, E b, E c, E... rest) Returns the least of the specified values according to this ordering.<E extends T>
EOrdering.min
(E a, E b, E c, E... rest) Returns the least of the specified values according to this ordering.<E extends T>
EOrdering.min
(E a, E b, E c, E... rest) Returns the least of the specified values according to this ordering.<E extends T>
EReverseOrdering.min
(E a, E b) <E extends T>
EReverseOrdering.min
(E a, E b) <E extends T>
EReverseOrdering.min
(E a, E b, E c, E... rest) <E extends T>
EReverseOrdering.min
(E a, E b, E c, E... rest) <E extends T>
EReverseOrdering.min
(E a, E b, E c, E... rest) static <E> FluentIterable
<E> FluentIterable.of
(E element, E... elements) Returns a fluent iterable containing the specified elements in order.boolean
void
Addselem
as a candidate for the topk
elements.boolean
ForwardingDeque.offerFirst
(E e) boolean
(package private) abstract T
(package private) abstract T
void
boolean
Stores a key-value pair in the multimap.boolean
Stores a key-value pair in the multimap.boolean
boolean
boolean
boolean
boolean
Stores a key-value pair in the multimap.boolean
Stores a key-value pair in the multimap.boolean
boolean
private V
private V
boolean
Stores a key-value pair in the multimap.boolean
Stores a key-value pair in the multimap.boolean
Stores a key-value pair in this multimap.boolean
Stores a key-value pair in this multimap.boolean
boolean
boolean
boolean
boolean
boolean
boolean
boolean
Associates the specified value with the specified keys.Associates the specified value with the specified keys.Associates the specified value with the specified keys.boolean
boolean
boolean
Stores a key-value pair in this multimap for each ofvalues
, all using the same key,key
.boolean
boolean
boolean
boolean
private V
AbstractBiMap.putInBothMaps
(K key, V value, boolean force) private V
AbstractBiMap.putInBothMaps
(K key, V value, boolean force) <T extends B>
TClassToInstanceMap.putInstance
(Class<T> type, T value) Maps the specified class to the specified value.<T extends B>
TMutableClassToInstanceMap.putInstance
(Class<T> type, T value) private K
HashBiMap.putInverse
(V value, K key, boolean force) private K
HashBiMap.putInverse
(V value, K key, boolean force) (package private) static <T> GeneralRange
<T> GeneralRange.range
(Comparator<? super T> comparator, T lower, BoundType lowerType, T upper, BoundType upperType) Returns everything between the endpoints relative to the specified comparator, with the specified endpoint behavior.(package private) static <T> GeneralRange
<T> GeneralRange.range
(Comparator<? super T> comparator, T lower, BoundType lowerType, T upper, BoundType upperType) Returns everything between the endpoints relative to the specified comparator, with the specified endpoint behavior.(package private) TreeMultiset.AvlNode
<E> TreeMultiset.AvlNode.remove
(Comparator<? super E> comparator, E e, int count, int[] result) private void
LinkedListMultimap.removeAllNodes
(K key) Removes all nodes for the specified key.private void
AbstractBiMap.removeFromInverseMap
(V oldValue) AbstractListMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.AbstractMapBasedMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.AbstractMultimap.replaceValues
(K key, Iterable<? extends V> values) AbstractSetMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.AbstractSortedSetMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.FilteredEntrySetMultimap.replaceValues
(K key, Iterable<? extends V> values) FilteredKeyListMultimap.replaceValues
(K key, Iterable<? extends V> values) FilteredKeySetMultimap.replaceValues
(K key, Iterable<? extends V> values) ForwardingListMultimap.replaceValues
(K key, Iterable<? extends V> values) ForwardingMultimap.replaceValues
(K key, Iterable<? extends V> values) ForwardingSetMultimap.replaceValues
(K key, Iterable<? extends V> values) ForwardingSortedSetMultimap.replaceValues
(K key, Iterable<? extends V> values) LinkedHashMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.LinkedListMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.ListMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.Multimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.Multimaps.MapMultimap.replaceValues
(K key, Iterable<? extends V> values) Multimaps.TransformedEntriesListMultimap.replaceValues
(K key, Iterable<? extends V2> values) Multimaps.TransformedEntriesMultimap.replaceValues
(K key, Iterable<? extends V2> values) Multimaps.UnmodifiableListMultimap.replaceValues
(K key, Iterable<? extends V> values) Multimaps.UnmodifiableMultimap.replaceValues
(K key, Iterable<? extends V> values) Multimaps.UnmodifiableSetMultimap.replaceValues
(K key, Iterable<? extends V> values) Multimaps.UnmodifiableSortedSetMultimap.replaceValues
(K key, Iterable<? extends V> values) SetMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.SortedSetMultimap.replaceValues
(K key, Iterable<? extends V> values) Stores a collection of values with the same key, replacing any existing values for that key.Synchronized.SynchronizedMultimap.replaceValues
(K key, Iterable<? extends V> values) (package private) abstract <E> int
SortedLists.KeyPresentBehavior.resultIndex
(Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) Returns a view of all mappings that have the given row key.private boolean
private boolean
void
void
void
void
final void
Deprecated.Unsupported operation.int
int
boolean
int
boolean
int
Adds or removes the necessary occurrences of an element such that the element attains the desired count.boolean
Conditionally sets the count of an element to a new value, as described inMultiset.setCount(Object, int)
, provided that the element has the expected current count.int
boolean
int
boolean
(package private) TreeMultiset.AvlNode
<E> TreeMultiset.AvlNode.setCount
(Comparator<? super E> comparator, E e, int count, int[] result) (package private) TreeMultiset.AvlNode
<E> TreeMultiset.AvlNode.setCount
(Comparator<? super E> comparator, E e, int expectedCount, int newCount, int[] result) int
boolean
(package private) static <E> int
Multisets.setCountImpl
(Multiset<E> self, E element, int count) An implementation ofMultiset.setCount(Object, int)
.(package private) static <E> boolean
Multisets.setCountImpl
(Multiset<E> self, E element, int oldCount, int newCount) An implementation ofMultiset.setCount(Object, int, int)
.(package private) abstract V
final V
(package private) void
static <T> UnmodifiableIterator
<T> Iterators.singletonIterator
(T value) Returns an iterator containing onlyvalue
.protected boolean
ForwardingList.standardAdd
(E element) A sensible default implementation ofForwardingCollection.add(Object)
, in terms ofForwardingList.add(int, Object)
.protected boolean
ForwardingMultiset.standardAdd
(E element) A sensible definition ofForwardingCollection.add(Object)
in terms ofForwardingMultiset.add(Object, int)
.protected E
ForwardingNavigableSet.standardCeiling
(E e) A sensible definition ofForwardingNavigableSet.ceiling(E)
in terms of theiterator
method ofForwardingNavigableSet.tailSet(Object, boolean)
.ForwardingNavigableMap.standardCeilingEntry
(K key) A sensible definition ofForwardingNavigableMap.ceilingEntry(K)
in terms of thefirstEntry()
ofForwardingNavigableMap.tailMap(Object, boolean)
.protected K
ForwardingNavigableMap.standardCeilingKey
(K key) A sensible definition ofForwardingNavigableMap.ceilingKey(K)
in terms ofceilingEntry
.protected E
ForwardingNavigableSet.standardFloor
(E e) A sensible definition ofForwardingNavigableSet.floor(E)
in terms of thedescendingIterator
method ofForwardingNavigableSet.headSet(Object, boolean)
.ForwardingNavigableMap.standardFloorEntry
(K key) A sensible definition ofForwardingNavigableMap.floorEntry(K)
in terms of thelastEntry()
ofForwardingNavigableMap.headMap(Object, boolean)
.protected K
ForwardingNavigableMap.standardFloorKey
(K key) A sensible definition ofForwardingNavigableMap.floorKey(K)
in terms offloorEntry
.ForwardingNavigableMap.standardHeadMap
(K toKey) A sensible definition ofForwardingSortedMap.headMap(Object)
in terms ofForwardingNavigableMap.headMap(Object, boolean)
.ForwardingNavigableSet.standardHeadSet
(E toElement) A sensible definition ofForwardingSortedSet.headSet(Object)
in terms of theForwardingNavigableSet.headSet(Object, boolean)
method.protected E
ForwardingNavigableSet.standardHigher
(E e) A sensible definition ofForwardingNavigableSet.higher(E)
in terms of theiterator
method ofForwardingNavigableSet.tailSet(Object, boolean)
.ForwardingNavigableMap.standardHigherEntry
(K key) A sensible definition ofForwardingNavigableMap.higherEntry(K)
in terms of thefirstEntry()
ofForwardingNavigableMap.tailMap(Object, boolean)
.protected K
ForwardingNavigableMap.standardHigherKey
(K key) A sensible definition ofForwardingNavigableMap.higherKey(K)
in terms ofhigherEntry
.protected E
ForwardingNavigableSet.standardLower
(E e) A sensible definition ofForwardingNavigableSet.lower(E)
in terms of thedescendingIterator
method ofForwardingNavigableSet.headSet(Object, boolean)
.ForwardingNavigableMap.standardLowerEntry
(K key) A sensible definition ofForwardingNavigableMap.lowerEntry(K)
in terms of thelastEntry()
ofForwardingNavigableMap.headMap(Object, boolean)
.protected K
ForwardingNavigableMap.standardLowerKey
(K key) A sensible definition ofForwardingNavigableMap.lowerKey(K)
in terms oflowerEntry
.protected boolean
ForwardingQueue.standardOffer
(E e) A sensible definition ofForwardingQueue.offer(E)
in terms ofForwardingCollection.add(E)
.protected int
ForwardingMultiset.standardSetCount
(E element, int count) A sensible definition ofForwardingMultiset.setCount(Object, int)
in terms ofForwardingMultiset.count(Object)
,ForwardingMultiset.add(Object, int)
, andForwardingMultiset.remove(Object, int)
.protected boolean
ForwardingMultiset.standardSetCount
(E element, int oldCount, int newCount) A sensible definition ofForwardingMultiset.setCount(Object, int, int)
in terms ofForwardingMultiset.count(Object)
andForwardingMultiset.setCount(Object, int)
.ForwardingNavigableMap.standardSubMap
(K fromKey, K toKey) A sensible definition ofForwardingSortedMap.subMap(Object, Object)
in terms ofForwardingNavigableMap.subMap(Object, boolean, Object, boolean)
.ForwardingNavigableMap.standardSubMap
(K fromKey, K toKey) A sensible definition ofForwardingSortedMap.subMap(Object, Object)
in terms ofForwardingNavigableMap.subMap(Object, boolean, Object, boolean)
.protected SortedMultiset
<E> ForwardingSortedMultiset.standardSubMultiset
(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) A sensible definition ofForwardingSortedMultiset.subMultiset(Object, BoundType, Object, BoundType)
in terms ofheadMultiset
andtailMultiset
.protected SortedMultiset
<E> ForwardingSortedMultiset.standardSubMultiset
(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) A sensible definition ofForwardingSortedMultiset.subMultiset(Object, BoundType, Object, BoundType)
in terms ofheadMultiset
andtailMultiset
.protected NavigableSet
<E> ForwardingNavigableSet.standardSubSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) A sensible definition ofForwardingNavigableSet.subSet(Object, boolean, Object, boolean)
in terms of theheadSet
andtailSet
methods.protected NavigableSet
<E> ForwardingNavigableSet.standardSubSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) A sensible definition ofForwardingNavigableSet.subSet(Object, boolean, Object, boolean)
in terms of theheadSet
andtailSet
methods.ForwardingNavigableSet.standardSubSet
(E fromElement, E toElement) A sensible definition ofForwardingSortedSet.subSet(Object, Object)
in terms of theForwardingNavigableSet.subSet(Object, boolean, Object, boolean)
method.ForwardingNavigableSet.standardSubSet
(E fromElement, E toElement) A sensible definition ofForwardingSortedSet.subSet(Object, Object)
in terms of theForwardingNavigableSet.subSet(Object, boolean, Object, boolean)
method.ForwardingSortedSet.standardSubSet
(E fromElement, E toElement) A sensible default implementation ofForwardingSortedSet.subSet(Object, Object)
in terms ofForwardingSortedSet.headSet(Object)
andForwardingSortedSet.tailSet(Object)
.ForwardingSortedSet.standardSubSet
(E fromElement, E toElement) A sensible default implementation ofForwardingSortedSet.subSet(Object, Object)
in terms ofForwardingSortedSet.headSet(Object)
andForwardingSortedSet.tailSet(Object)
.ForwardingNavigableMap.standardTailMap
(K fromKey) A sensible definition ofForwardingSortedMap.tailMap(Object)
in terms ofForwardingNavigableMap.tailMap(Object, boolean)
.ForwardingNavigableSet.standardTailSet
(E fromElement) A sensible definition ofForwardingSortedSet.tailSet(Object)
in terms of theForwardingNavigableSet.tailSet(Object, boolean)
method.AbstractMapBasedMultimap.NavigableAsMap.subMap
(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) AbstractMapBasedMultimap.NavigableAsMap.subMap
(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) Maps.FilteredEntryNavigableMap.subMap
(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) Maps.FilteredEntryNavigableMap.subMap
(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) Maps.TransformedEntriesNavigableMap.subMap
(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) Maps.TransformedEntriesNavigableMap.subMap
(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) Maps.UnmodifiableNavigableMap.subMap
(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) Maps.UnmodifiableNavigableMap.subMap
(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) AbstractSortedMultiset.subMultiset
(E fromElement, BoundType fromBoundType, E toElement, BoundType toBoundType) AbstractSortedMultiset.subMultiset
(E fromElement, BoundType fromBoundType, E toElement, BoundType toBoundType) DescendingMultiset.subMultiset
(E fromElement, BoundType fromBoundType, E toElement, BoundType toBoundType) DescendingMultiset.subMultiset
(E fromElement, BoundType fromBoundType, E toElement, BoundType toBoundType) ForwardingSortedMultiset.subMultiset
(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) ForwardingSortedMultiset.subMultiset
(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) SortedMultiset.subMultiset
(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) Returns a view of this multiset restricted to the range betweenlowerBound
andupperBound
.SortedMultiset.subMultiset
(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) Returns a view of this multiset restricted to the range betweenlowerBound
andupperBound
.UnmodifiableSortedMultiset.subMultiset
(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) UnmodifiableSortedMultiset.subMultiset
(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) AbstractMapBasedMultimap.NavigableKeySet.subSet
(K fromElement, boolean fromInclusive, K toElement, boolean toInclusive) AbstractMapBasedMultimap.NavigableKeySet.subSet
(K fromElement, boolean fromInclusive, K toElement, boolean toInclusive) AbstractMapBasedMultimap.WrappedNavigableSet.subSet
(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) AbstractMapBasedMultimap.WrappedNavigableSet.subSet
(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) ForwardingNavigableSet.subSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) ForwardingNavigableSet.subSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) Sets.FilteredNavigableSet.subSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) Sets.FilteredNavigableSet.subSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) Sets.UnmodifiableNavigableSet.subSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) Sets.UnmodifiableNavigableSet.subSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) SortedMultisets.NavigableElementSet.subSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) SortedMultisets.NavigableElementSet.subSet
(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) DescendingMultiset.tailMultiset
(E fromElement, BoundType boundType) ForwardingSortedMultiset.tailMultiset
(E lowerBound, BoundType boundType) SortedMultiset.tailMultiset
(E lowerBound, BoundType boundType) Returns a view of this multiset restricted to the elements greater thanlowerBound
, optionally includinglowerBound
itself.TreeMultiset.tailMultiset
(E lowerBound, BoundType boundType) UnmodifiableSortedMultiset.tailMultiset
(E lowerBound, BoundType boundType) (package private) boolean
(package private) boolean
Multimaps.TransformedEntriesListMultimap.transform
(K key, Collection<V1> values) (package private) Collection
<V2> Multimaps.TransformedEntriesMultimap.transform
(K key, Collection<V1> values) (package private) abstract T
Maps.EntryTransformer.transformEntry
(K key, V1 value) Determines an output value based on a key-value pair.Maps.EntryTransformer.transformEntry
(K key, V1 value) Determines an output value based on a key-value pair.private void
AbstractBiMap.updateInverseMap
(K key, boolean containedKey, V oldValue, V newValue) private void
AbstractBiMap.updateInverseMap
(K key, boolean containedKey, V oldValue, V newValue) (package private) static <T> GeneralRange
<T> GeneralRange.upTo
(Comparator<? super T> comparator, T endpoint, BoundType boundType) Returns everything below the endpoint relative to the specified comparator, with the specified endpoint behavior.(package private) Collection
<V> AbstractListMultimap.wrapCollection
(K key, Collection<V> collection) (package private) Collection
<V> AbstractMapBasedMultimap.wrapCollection
(K key, Collection<V> collection) Generates a decorated collection that remains consistent with the values in the multimap for the provided key.(package private) Collection
<V> AbstractSetMultimap.wrapCollection
(K key, Collection<V> collection) (package private) Collection
<V> AbstractSortedSetMultimap.wrapCollection
(K key, Collection<V> collection) (package private) Collection
<V> Multimaps.CustomMultimap.wrapCollection
(K key, Collection<V> collection) (package private) Collection
<V> Multimaps.CustomSetMultimap.wrapCollection
(K key, Collection<V> collection) AbstractMapBasedMultimap.wrapList
(K key, List<V> list, AbstractMapBasedMultimap<K, V>.WrappedCollection ancestor) Constructor parameters in com.google.common.collect with annotations of type ParametricNullnessModifierConstructorDescription(package private)
AddRejectingList
(K key) (package private)
AddRejectingSet
(K key) (package private)
(package private)
(package private)
(package private)
ImmutableCell
(R rowKey, C columnKey, V value) (package private)
ImmutableCell
(R rowKey, C columnKey, V value) (package private)
ImmutableCell
(R rowKey, C columnKey, V value) (package private)
ImmutableEntry
(K key, V value) (package private)
ImmutableEntry
(K key, V value) (package private)
ImmutableEntry
(E element, int count) (package private)
(package private)
(package private)
OnePlusArrayList
(E first, E[] rest) (package private)
RandomAccessWrappedList
(K key, List<V> delegate, AbstractMapBasedMultimap<K, V>.WrappedCollection ancestor) (package private)
TemporaryPair
(A a, B b) (package private)
TemporaryPair
(A a, B b) (package private)
TwoPlusArrayList
(E first, E second, E[] rest) (package private)
TwoPlusArrayList
(E first, E second, E[] rest) private
ValueDifferenceImpl
(V left, V right) private
ValueDifferenceImpl
(V left, V right) (package private)
ValueEntry
(K key, V value, int smearedValueHash, LinkedHashMultimap.ValueEntry<K, V> nextInValueBucket) (package private)
ValueEntry
(K key, V value, int smearedValueHash, LinkedHashMultimap.ValueEntry<K, V> nextInValueBucket) (package private)
ValueForKeyIterator
(K key) Constructs a new iterator over all values for the specified key.ValueForKeyIterator
(K key, int index) Constructs a new iterator over all values for the specified key starting at the specified index.(package private)
ValuePredicate
(K key) (package private)
(package private)
WrappedCollection
(K key, Collection<V> delegate, AbstractMapBasedMultimap<K, V>.WrappedCollection ancestor) (package private)
WrappedList
(K key, List<V> delegate, AbstractMapBasedMultimap<K, V>.WrappedCollection ancestor) (package private)
WrappedNavigableSet
(K key, NavigableSet<V> delegate, AbstractMapBasedMultimap<K, V>.WrappedCollection ancestor) (package private)
WrappedSet
(K key, Set<V> delegate) (package private)
WrappedSortedSet
(K key, SortedSet<V> delegate, AbstractMapBasedMultimap<K, V>.WrappedCollection ancestor)