Uses of Annotation Interface
com.google.common.collect.ParametricNullness
Packages that use ParametricNullness
Package
Description
This package contains generic collection interfaces and implementations, and other utilities for
working with 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 AStreams.TemporaryPair.a(package private) final BStreams.TemporaryPair.bprivate final CTables.ImmutableCell.columnKeyprivate final EMultisets.ImmutableEntry.element(package private) final ELists.OnePlusArrayList.first(package private) final ELists.TwoPlusArrayList.first(package private) final KAbstractMapBasedMultimap.WrappedCollection.keyprivate final KCompactHashMap.MapEntry.keyprivate final KFilteredEntryMultimap.ValuePredicate.key(package private) final KFilteredKeyMultimap.AddRejectingList.key(package private) final KFilteredKeyMultimap.AddRejectingSet.key(package private) final KImmutableEntry.keyprivate final KLinkedHashMultimap.ValueSet.key(package private) final KLinkedListMultimap.Node.key(package private) final KLinkedListMultimap.ValueForKeyIterator.keyprivate final VMaps.ValueDifferenceImpl.leftprivate final VMaps.ValueDifferenceImpl.rightprivate final RTables.ImmutableCell.rowKey(package private) final ELists.TwoPlusArrayList.second(package private) final VImmutableEntry.value(package private) VLinkedListMultimap.Node.valueprivate final VTables.ImmutableCell.valueMethods 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) KReturns its input, or throws an exception if this is not a valid key.(package private) K(package private) VAbstractBiMap.checkValue(V value) Returns its input, or throws an exception if this is not a valid value.(package private) VAbstractBiMap.Inverse.checkValue(V value) ForwardingQueue.element()static <T> TReturns the first element initerablethat satisfies the given predicate; use this method only when such an element is known to exist.static <T> TReturns the first element initeratorthat 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 EAbstractIndexedListIterator.get(int index) Returns the element with the specified index.AbstractMapBasedMultimap.WrappedList.get(int index) final EFluentIterable.get(int position) Returns the element at the specified position in this fluent iterable.ForwardingList.get(int index) static <T> TReturns the element at the specified position in an iterable or a default value otherwise.static <T> TReturns the element at the specified position in an iterable.protected TIterators.ArrayItr.get(int index) static <T> TAdvancesiteratorposition + 1times, returning the element at thepositionth position ordefaultValueotherwise.static <T> TAdvancesiteratorposition + 1times, returning the element at thepositionth 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 EMultisets.ImmutableEntry.getElement()(package private) ETreeMultiset.AvlNode.getElement()ForwardingDeque.getFirst()static <T> TReturns the first element initerableordefaultValueif the iterable is empty.(package private) KAbstractMapBasedMultimap.WrappedCollection.getKey()abstract KAbstractMapEntry.getKey()CompactHashMap.MapEntry.getKey()ForwardingMapEntry.getKey()final KImmutableEntry.getKey()LinkedListMultimap.Node.getKey()ForwardingDeque.getLast()static <T> TReturns the last element ofiterableordefaultValueif the iterable is empty.static <T> TReturns the last element ofiterable.static <T> TAdvancesiteratorto the end, returning the last element ordefaultValueif the iterator is empty.static <T> TAdvancesiteratorto the end, returning the last element.private static <T> TIterables.getLastInNonemptyList(List<T> list) static <T> TReturns the next element initeratorordefaultValueif the iterator is empty.static <T> TIterables.getOnlyElement(Iterable<? extends T> iterable, T defaultValue) Returns the single element contained initerable, ordefaultValueif the iterable is empty.static <T> TIterables.getOnlyElement(Iterable<T> iterable) Returns the single element contained initerable.static <T> TIterators.getOnlyElement(Iterator<? extends T> iterator, T defaultValue) Returns the single element contained initerator, ordefaultValueif the iterator is empty.static <T> TIterators.getOnlyElement(Iterator<T> iterator) Returns the single element contained initerator.(package private) abstract TCompactHashMap.Itr.getOutput(int entry) Table.Cell.getRowKey()Returns the row key of this cell.Tables.ImmutableCell.getRowKey()abstract VAbstractMapEntry.getValue()(package private) abstract VArrayTable.ArrayMap.getValue(int index) CompactHashMap.MapEntry.getValue()ForwardingMapEntry.getValue()final VImmutableEntry.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> TComparators.max(T a, T b, Comparator<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> TComparators.min(T a, T b, Comparator<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 EAbstractIndexedListIterator.next()final TAbstractIterator.next()AbstractMapBasedMultimap.WrappedCollection.WrappedIterator.next()AbstractMapBasedMultiset.MapBasedMultisetIterator.next()CompactHashMap.Itr.next()ForwardingIterator.next()Iterators.ConcatenatedIterator.next()Iterators.MergingIterator.next()Iterators.PeekingImpl.next()LinkedListMultimap.DistinctKeyIterator.next()LinkedListMultimap.ValueForKeyIterator.next()Multisets.MultisetIteratorImpl.next()PeekingIterator.next()final TTransformedIterator.next()final TAbstractIterator.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 EAbstractIndexedListIterator.previous()AbstractMapBasedMultimap.WrappedList.WrappedListIterator.previous()ForwardingListIterator.previous()LinkedListMultimap.ValueForKeyIterator.previous()final TTransformedListIterator.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 VAbstractBiMap.removeFromBothMaps(Object key) ForwardingDeque.removeLast()MapDifference.ValueDifference.rightValue()Returns the value from the right map (possibly null).Maps.ValueDifferenceImpl.rightValue()(package private) abstract Vfinal Vprotected EForwardingNavigableSet.standardFirst()protected EForwardingNavigableSet.standardLast()(package private) abstract T(package private) static <T> TNullnessCasts.uncheckedCastNullableTToT(T t) Accepts aTand returns a plainT, without performing any check that that conversion is safe.(package private) static <T> TNullnessCasts.unsafeNull()Returnsnullas any type, even one that does not includenull.Method parameters in com.google.common.collect with annotations of type ParametricNullnessModifier and TypeMethodDescriptionbooleanvoidvoidintAdds a number of occurrences of an element to this multiset.final booleanintbooleanbooleanvoidbooleanbooleanbooleanvoidvoidintbooleanvoidvoidvoidbooleanAdds a single occurrence of the specified element to this multiset.intAdds a number of occurrences of an element to this multiset.intbooleanintfinal booleanDeprecated.Unsupported operation.voidint(package private) TreeMultiset.AvlNode<E>TreeMultiset.AvlNode.add(Comparator<? super E> comparator, E e, int count, int[] result) final voidDeprecated.Unsupported operation.voidvoidprivate 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 specifiednextSiblingelement, or at the end of the list ifnextSiblingis null.private LinkedListMultimap.Node<K,V> Adds a new node for the specified key-value pair before the specifiednextSiblingelement, or at the end of the list ifnextSiblingis null.private TreeMultiset.AvlNode<E>TreeMultiset.AvlNode.addRightChild(E e, int count) boolean(package private) booleanApplies 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) intOrdering.binarySearch(List<? extends T> sortedList, T key) Deprecated.UseCollections.binarySearch(List, Object, Comparator)directly.static <E> intSortedLists.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) KReturns its input, or throws an exception if this is not a valid key.(package private) K(package private) VAbstractBiMap.checkValue(V value) Returns its input, or throws an exception if this is not a valid value.(package private) VAbstractBiMap.Inverse.checkValue(V value) Returns a view of all mappings that have the given column key.intintintintabstract <T> ComparisonChainComparisonChain.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> ComparisonChainComparisonChain.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> ComparisonChainComparisonChain.InactiveComparisonChain.compare(T left, T right, Comparator<T> comparator) <T> ComparisonChainComparisonChain.InactiveComparisonChain.compare(T left, T right, Comparator<T> comparator) intintabstract intabstract intintintstatic <T> T[]ObjectArrays.concat(T[] array, T element) Returns a new array that appendselementtoarray.static <T> T[]ObjectArrays.concat(T element, T[] array) Returns a new array that prependselementtoarray.(package private) boolean(package private) intTreeMultiset.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 ofputthat silently removes any existing entry with the valuevaluebefore proceeding with theBiMap.put(K, V)operation.An alternate form ofputthat silently removes any existing entry with the valuevaluebefore proceeding with theBiMap.put(K, V)operation.Returns a view collection of the values associated withkeyin this multimap, if any.Returns a view collection of the values associated withkeyin this multimap, if any.Returns a view collection of the values associated withkeyin this multimap, if any.Returns a collection view of all values associated with a key.static <T> TReturns the element at the specified position in an iterable or a default value otherwise.static <T> TAdvancesiteratorposition + 1times, returning the element at thepositionth position ordefaultValueotherwise.Returns a view collection of the values associated withkeyin this multimap, if any.Returns a view collection of the values associated withkeyin this multimap, if any.Returns a view collection of the values associated withkeyin this multimap, if any.Returns a view collection of the values associated withkeyin this multimap, if any.Returns a collection view of all values associated with a key.static <T> TReturns the first element initerableordefaultValueif the iterable is empty.static <T> TReturns the last element ofiterableordefaultValueif the iterable is empty.static <T> TAdvancesiteratorto the end, returning the last element ordefaultValueif the iterator is empty.static <T> TReturns the next element initeratorordefaultValueif the iterator is empty.static <T> TIterables.getOnlyElement(Iterable<? extends T> iterable, T defaultValue) Returns the single element contained initerable, ordefaultValueif the iterable is empty.static <T> TIterators.getOnlyElement(Iterator<? extends T> iterator, T defaultValue) Returns the single element contained initerator, ordefaultValueif 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 includingupperBounditself.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) voidCompactHashMap.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) voidCompactHashMap.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) voidCompactHashSet.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) voidCompactLinkedHashMap.insertEntry(int entryIndex, K key, V value, int hash, int mask) (package private) voidCompactLinkedHashMap.insertEntry(int entryIndex, K key, V value, int hash, int mask) (package private) voidCompactLinkedHashSet.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> TComparators.max(T a, T b, Comparator<T> comparator) Returns the maximum of the two values, according to the given comparator.static <T> TComparators.max(T a, T b, Comparator<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) private static <R,C, V> void TableCollectors.mergeTables(Table<R, C, V> table, R row, C column, V value, BinaryOperator<V> mergeFunction) static <T> TComparators.min(T a, T b, Comparator<T> comparator) Returns the minimum of the two values, according to the given comparator.static <T> TComparators.min(T a, T b, Comparator<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.booleanvoidAddselemas a candidate for the topkelements.booleanForwardingDeque.offerFirst(E e) boolean(package private) abstract T(package private) abstract TvoidbooleanStores a key-value pair in the multimap.booleanStores a key-value pair in the multimap.booleanbooleanbooleanbooleanbooleanStores a key-value pair in the multimap.booleanStores a key-value pair in the multimap.booleanbooleanprivate Vprivate VbooleanStores a key-value pair in the multimap.booleanStores a key-value pair in the multimap.booleanStores a key-value pair in this multimap.booleanStores a key-value pair in this multimap.booleanbooleanbooleanbooleanbooleanbooleanAssociates the specified value with the specified keys.Associates the specified value with the specified keys.Associates the specified value with the specified keys.booleanbooleanbooleanStores a key-value pair in this multimap for each ofvalues, all using the same key,key.booleanbooleanbooleanprivate VAbstractBiMap.putInBothMaps(K key, V value, boolean force) private VAbstractBiMap.putInBothMaps(K key, V value, boolean force) private KHashBiMap.putInverse(V value, K key, boolean force) private KHashBiMap.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 voidLinkedListMultimap.removeAllNodes(K key) Removes all nodes for the specified key.private voidAbstractBiMap.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.(package private) abstract <E> intSortedLists.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 booleanprivate booleanvoidvoidvoidvoidfinal voidDeprecated.Unsupported operation.intintbooleanintbooleanintAdds or removes the necessary occurrences of an element such that the element attains the desired count.booleanConditionally 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.intboolean(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) intboolean(package private) static <E> intMultisets.setCountImpl(Multiset<E> self, E element, int count) An implementation ofMultiset.setCount(Object, int).(package private) static <E> booleanMultisets.setCountImpl(Multiset<E> self, E element, int oldCount, int newCount) An implementation ofMultiset.setCount(Object, int, int).(package private) abstract Vfinal V(package private) voidstatic <T> UnmodifiableIterator<T>Iterators.singletonIterator(T value) Returns an iterator containing onlyvalue.protected booleanForwardingList.standardAdd(E element) A sensible default implementation ofForwardingCollection.add(Object), in terms ofForwardingList.add(int, Object).protected booleanForwardingMultiset.standardAdd(E element) A sensible definition ofForwardingCollection.add(Object)in terms ofForwardingMultiset.add(Object, int).protected EForwardingNavigableSet.standardCeiling(E e) A sensible definition ofForwardingNavigableSet.ceiling(E)in terms of theiteratormethod ofForwardingNavigableSet.tailSet(Object, boolean).ForwardingNavigableMap.standardCeilingEntry(K key) A sensible definition ofForwardingNavigableMap.ceilingEntry(K)in terms of thefirstEntry()ofForwardingNavigableMap.tailMap(Object, boolean).protected KForwardingNavigableMap.standardCeilingKey(K key) A sensible definition ofForwardingNavigableMap.ceilingKey(K)in terms ofceilingEntry.protected EForwardingNavigableSet.standardFloor(E e) A sensible definition ofForwardingNavigableSet.floor(E)in terms of thedescendingIteratormethod ofForwardingNavigableSet.headSet(Object, boolean).ForwardingNavigableMap.standardFloorEntry(K key) A sensible definition ofForwardingNavigableMap.floorEntry(K)in terms of thelastEntry()ofForwardingNavigableMap.headMap(Object, boolean).protected KForwardingNavigableMap.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 EForwardingNavigableSet.standardHigher(E e) A sensible definition ofForwardingNavigableSet.higher(E)in terms of theiteratormethod ofForwardingNavigableSet.tailSet(Object, boolean).ForwardingNavigableMap.standardHigherEntry(K key) A sensible definition ofForwardingNavigableMap.higherEntry(K)in terms of thefirstEntry()ofForwardingNavigableMap.tailMap(Object, boolean).protected KForwardingNavigableMap.standardHigherKey(K key) A sensible definition ofForwardingNavigableMap.higherKey(K)in terms ofhigherEntry.protected EForwardingNavigableSet.standardLower(E e) A sensible definition ofForwardingNavigableSet.lower(E)in terms of thedescendingIteratormethod ofForwardingNavigableSet.headSet(Object, boolean).ForwardingNavigableMap.standardLowerEntry(K key) A sensible definition ofForwardingNavigableMap.lowerEntry(K)in terms of thelastEntry()ofForwardingNavigableMap.headMap(Object, boolean).protected KForwardingNavigableMap.standardLowerKey(K key) A sensible definition ofForwardingNavigableMap.lowerKey(K)in terms oflowerEntry.protected booleanForwardingQueue.standardOffer(E e) A sensible definition ofForwardingQueue.offer(E)in terms ofForwardingCollection.add(E).protected intForwardingMultiset.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 booleanForwardingMultiset.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 ofheadMultisetandtailMultiset.protected SortedMultiset<E>ForwardingSortedMultiset.standardSubMultiset(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) A sensible definition ofForwardingSortedMultiset.subMultiset(Object, BoundType, Object, BoundType)in terms ofheadMultisetandtailMultiset.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 theheadSetandtailSetmethods.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 theheadSetandtailSetmethods.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 betweenlowerBoundandupperBound.SortedMultiset.subMultiset(E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) Returns a view of this multiset restricted to the range betweenlowerBoundandupperBound.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 includinglowerBounditself.TreeMultiset.tailMultiset(E lowerBound, BoundType boundType) UnmodifiableSortedMultiset.tailMultiset(E lowerBound, BoundType boundType) (package private) boolean(package private) booleanMultimaps.TransformedEntriesListMultimap.transform(K key, Collection<V1> values) (package private) Collection<V2>Multimaps.TransformedEntriesMultimap.transform(K key, Collection<V1> values) (package private) abstract TMaps.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 voidAbstractBiMap.updateInverseMap(K key, boolean containedKey, V oldValue, V newValue) private voidAbstractBiMap.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) privateValueDifferenceImpl(V left, V right) privateValueDifferenceImpl(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)