Uses of Annotation Interface
com.google.common.collect.ElementTypesAreNonnullByDefault
Packages that use ElementTypesAreNonnullByDefault
Package
Description
Collection interfaces and implementations, and other utilities for collections.
-
Uses of ElementTypesAreNonnullByDefault in com.google.common.collect
Classes in com.google.common.collect with annotations of type ElementTypesAreNonnullByDefaultModifier and TypeClassDescription(package private) class
AbstractBiMap<K,
V> A general-purpose bimap implementation using any two backingMap
instances.(package private) class
This class provides a skeletal implementation of theListIterator
interface across a fixed number of elements that may be retrieved by position.class
This class provides a skeletal implementation of theIterator
interface, to make this interface easier to implement for certain types of data sources.(package private) class
AbstractListMultimap<K,
V> Basic implementation of theListMultimap
interface.(package private) class
Basic implementation of theMultimap
interface.(package private) class
Basic implementation ofMultiset<E>
backed by an instance ofMap<E, Count>
.(package private) class
AbstractMapEntry<K,
V> Implementation of theequals
,hashCode
, andtoString
methods ofEntry
.(package private) class
AbstractMultimap<K,
V> A skeletonMultimap
implementation, not necessarily in terms of aMap
.(package private) class
This class provides a skeletal implementation of theMultiset
interface.(package private) class
AbstractNavigableMap<K,
V> Skeletal implementation ofNavigableMap
.(package private) class
AbstractRangeSet<C extends Comparable>
A skeletal implementation ofRangeSet
.class
This class provides a skeletal implementation of theIterator
interface for sequences whose next element can always be derived from the previous element.(package private) class
AbstractSetMultimap<K,
V> Basic implementation of theSetMultimap
interface.(package private) class
Basic implementation of aSortedSetMultimap
with a sorted key set.(package private) class
This class provides a skeletal implementation of theSortedMultiset
interface.(package private) class
Basic implementation of theSortedSetMultimap
interface.(package private) class
AbstractTable<R,
C, V> Skeletal, implementation-agnostic implementation of theTable
interface.(package private) final class
An ordering that treats all references as equals, even nulls.final class
ArrayListMultimap<K,
V> Implementation ofMultimap
that uses anArrayList
to store the values for a given key.final class
ArrayTable<R,
C, V> Fixed-sizeTable
implementation backed by a two-dimensional array.(package private) class
A dummy superclass ofImmutableMultimap
that can be instanceof'd without ProGuard retaining additional implementation details ofImmutableMultimap
.interface
BiMap<K,
V> A bimap (or "bidirectional map") is a map that preserves the uniqueness of its values as well as that of its keys.enum
Indicates whether an endpoint of some range is contained in the range itself ("closed") or not ("open").(package private) final class
ByFunctionOrdering<F,
T> An ordering that orders elements by applying an order to the result of a function on those elements.(package private) final class
Implementation ofLists.cartesianProduct(List)
.interface
A map, each entry of which maps a Java raw type to an instance of that type.(package private) final class
Collectors utilities forcommon.collect
internals.final class
Provides static methods for working withCollection
instances.(package private) final class
Precondition checks useful in collection implementations.(package private) final class
Spliterator utilities forcommon.collect
internals.(package private) final class
Helper classes and static methods for implementing compact hash-based collections.(package private) class
CompactHashMap<K,
V> CompactHashMap is an implementation of a Map.(package private) class
CompactHashSet is an implementation of a Set.(package private) class
CompactLinkedHashMap<K,
V> CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order, maintained with a doubly linked list through the entries.(package private) class
CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that matches the insertion order.(package private) final class
An ordering for a pre-existing comparator.final class
Provides static methods for working withComparator
instances.class
A utility for performing a chained comparison statement.(package private) final class
An ordering that tries several comparators in order.class
Deprecated.final class
A multiset that supports concurrent modifications and that provides atomic versions of mostMultiset
operations (exceptions where noted).(package private) final class
An Iterator implementation which draws elements from a queue, removing them from the queue as it iterates.class
ContiguousSet<C extends Comparable>
A sorted set of contiguous values in a givenDiscreteDomain
.(package private) final class
A mutable value of typeint
, for multisets to use in tracking counts of values.(package private) class
Cut<C extends Comparable>
Implementation detail for the internal structure ofRange
instances.(package private) final class
DenseImmutableTable<R,
C, V> ARegularImmutableTable
optimized for dense data.(package private) final class
A descending wrapper around anImmutableSortedMultiset
(package private) final class
Skeletal implementation ofImmutableSortedSet.descendingSet()
.(package private) class
A skeleton implementation of a descending multiset.class
DiscreteDomain<C extends Comparable>
A descriptor for a discreteComparable
domain such as allInteger
instances.(package private) final class
EmptyContiguousSet<C extends Comparable>
An empty contiguous set.(package private) class
Implementation ofImmutableListMultimap
with no entries.(package private) class
Implementation ofImmutableListMultimap
with no entries.final class
ABiMap
backed by twoEnumMap
instances.final class
EnumHashBiMap<K extends Enum<K>,
V> ABiMap
backed by anEnumMap
instance for keys-to-values, and aHashMap
instance for values-to-keys.final class
EnumMultiset<E extends Enum<E>>
Multiset implementation specialized for enum elements, supporting all single-element operations in O(1).final class
A non-blocking queue which automatically evicts elements from the head of the queue when attempting to add new elements onto the queue and it is full.(package private) final class
An ordering that compares objects according to a given order.(package private) class
Implementation ofMultimaps.filterEntries(Multimap, Predicate)
.(package private) final class
Implementation ofMultimaps.filterEntries(SetMultimap, Predicate)
.(package private) final class
Implementation ofMultimaps.filterKeys(ListMultimap, Predicate)
.(package private) class
FilteredKeyMultimap<K,
V> Implementation ofMultimaps.filterKeys(Multimap, Predicate)
.(package private) final class
Implementation ofMultimaps.filterKeys(SetMultimap, Predicate)
.(package private) interface
FilteredMultimap<K,
V> An interface for all filtered multimap types.(package private) final class
Implementation forMultimap.values()
.(package private) interface
FilteredSetMultimap<K,
V> A supertype for filteredSetMultimap
implementations.class
A discouraged (but not deprecated) precursor to Java's superiorStream
library.class
Deprecated.This class has moved tocom.google.common.util.concurrent
.class
A collection which forwards all its method calls to another collection.class
A concurrent map which forwards all its method calls to another concurrent map.class
A deque which forwards all its method calls to another deque.(package private) class
Dummy class that makes the GWT serialization policy happy.(package private) class
Unused stub class, unreferenced under Java and manually emulated under GWT.(package private) class
Unused stub class, unreferenced under Java and manually emulated under GWT.(package private) class
Unused stub class, unreferenced under Java and manually emulated under GWT.class
An iterator which forwards all its method calls to another iterator.class
A list which forwards all its method calls to another list.class
A list iterator which forwards all its method calls to another list iterator.class
A list multimap which forwards all its method calls to another list multimap.class
ForwardingMap<K,
V> A map which forwards all its method calls to another map.class
ForwardingMapEntry<K,
V> A map entry which forwards all its method calls to another map entry.class
ForwardingMultimap<K,
V> A multimap which forwards all its method calls to another multimap.class
A multiset which forwards all its method calls to another multiset.class
A navigable map which forwards all its method calls to another navigable map.class
A navigable set which forwards all its method calls to another navigable set.class
An abstract base class for implementing the decorator pattern.class
A queue which forwards all its method calls to another queue.class
A set which forwards all its method calls to another set.class
A set multimap which forwards all its method calls to another set multimap.class
ForwardingSortedMap<K,
V> A sorted map which forwards all its method calls to another sorted map.class
A sorted multiset which forwards all its method calls to another sorted multiset.class
A sorted set which forwards all its method calls to another sorted set.class
A sorted set multimap which forwards all its method calls to another sorted set multimap.class
ForwardingTable<R,
C, V> A table which forwards all its method calls to another table.(package private) final class
GeneralRange<T>
A generalized interval on any ordering, for internal use.(package private) @interface
Private replacement forinvalid reference
com.google.gwt.user.client.rpc.GwtTransient
class
HashBasedTable<R,
C, V> Implementation ofTable
using linked hash tables.final class
HashBiMap<K,
V> ABiMap
backed by two hash tables.(package private) final class
Static methods for implementing hash-based collections.final class
HashMultimap<K,
V> Implementation ofMultimap
using hash tables.final class
HashMultiset<E>
Multiset implementation backed by aHashMap
.(package private) @interface
Disables Animal Sniffer's checking of compatibility with older versions of Java/Android.(package private) class
List returned byImmutableCollection.asList()
that delegatescontains
checks to the backing collection.class
ImmutableBiMap<K,
V> ABiMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.final class
AClassToInstanceMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
ACollection
whose contents will never change, and which offers a few additional guarantees detailed below.(package private) class
ImmutableEntry<K,
V> An immutableMap.Entry
, used both byMaps.immutableEntry(Object, Object)
and by other parts ofcommon.collect
as a superclass.(package private) final class
ImmutableEnumMap<K extends Enum<K>,
V> Implementation ofImmutableMap
backed by a non-emptyEnumMap
.(package private) final class
ImmutableEnumSet<E extends Enum<E>>
Implementation ofImmutableSet
backed by a non-emptyEnumSet
.class
AList
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
AListMultimap
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
ImmutableMap<K,
V> AMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.(package private) class
ImmutableMapEntry<K,
V> Implementation ofEntry
forImmutableMap
that adds extra methods to traverse hash buckets for the key and the value.(package private) class
ImmutableMapEntrySet<K,
V> entrySet()
implementation forImmutableMap
.(package private) final class
ImmutableMapKeySet<K,
V> keySet()
implementation forImmutableMap
.(package private) final class
ImmutableMapValues<K,
V> values()
implementation forImmutableMap
.class
ImmutableMultimap<K,
V> AMultimap
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
AMultiset
whose contents will never change, with many other important properties detailed atImmutableCollection
.(package private) class
A dummy superclass to support GWT serialization of the element type of anImmutableMultiset
.class
ImmutableRangeMap<K extends Comparable<?>,
V> ARangeMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.final class
ImmutableRangeSet<C extends Comparable>
ARangeSet
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
ImmutableSet<E>
ASet
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
ImmutableSetMultimap<K,
V> ASetMultimap
whose contents will never change, with many other important properties detailed atImmutableCollection
.(package private) final class
List returned byImmutableSortedSet.asList()
when the set isn't empty.final class
ImmutableSortedMap<K,
V> ANavigableMap
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
ASortedMultiset
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
ANavigableSet
whose contents will never change, with many other important properties detailed atImmutableCollection
.class
ImmutableTable<R,
C, V> ATable
whose contents will never change, with many other important properties detailed atImmutableCollection
.(package private) class
interface
Interner<E>
Provides similar behavior toString.intern()
for any immutable type.final class
Contains static methods pertaining to instances ofInterner
.final class
An assortment of mainly legacy static utility methods that operate on or return objects of typeIterable
.final class
This class contains static utility methods that operate on or return objects of typeIterator
.(package private) final class
Implementation of ImmutableBiMap backed by a pair of JDK HashMaps, which have smartness protecting against hash flooding.(package private) final class
Implementation of ImmutableMap backed by a JDK HashMap, which has smartness protecting against hash flooding.(package private) final class
An implementation of ImmutableMultiset backed by a JDK Map and a list of entries.(package private) final class
ImmutableSet implementation backed by a JDK HashSet, used to defend against apparent hash flooding.(package private) final class
An ordering which sorts iterables by comparing corresponding elements pairwise.final class
LinkedHashMultimap<K,
V> Implementation ofMultimap
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.final class
AMultiset
implementation with predictable iteration order.class
LinkedListMultimap<K,
V> An implementation ofListMultimap
that supports deterministic iteration order for both keys and values.interface
ListMultimap<K,
V> AMultimap
that can hold duplicate key-value pairs and that maintains the insertion ordering of values for a given key.final class
Static utility methods pertaining toList
instances.interface
MapDifference<K,
V> An object representing the differences between two maps.final class
A builder ofConcurrentMap
instances that can have keys or values automatically wrapped in weak references.final class
final class
A double-ended priority queue, which provides constant-time access to both its least element and its greatest element, as determined by the queue's specified comparator.final class
Collectors not present injava.util.stream.Collectors
that are not otherwise associated with acom.google.common
type.interface
Multimap<K,
V> A collection that maps keys to values, similar toMap
, but in which each key may be associated with multiple values.class
MultimapBuilder<K0,
V0> An immutable builder forMultimap
instances, letting you independently select the desired behaviors (for example, ordering) of the backing map and value-collections.final class
Provides static methods acting on or generating aMultimap
.interface
Multiset<E>
A collection that supports order-independent equality, likeSet
, but may have duplicate elements.final class
Provides static utility methods for creating and working withMultiset
instances.final class
A mutable class-to-instance map backed by an arbitrary user-provided map.(package private) final class
An ordering that uses the natural order of the values.(package private) final class
A utility method to perform unchecked casts to suppress errors produced by nullness analyses.(package private) final class
An ordering that treatsnull
as less than all other values.(package private) final class
An ordering that treatsnull
as greater than all other values.final class
Static utility methods pertaining to object arrays.class
Ordering<T>
A comparator, with additional methods to support common operations.interface
An iterator that supports a one-element lookahead while iterating.(package private) final class
Methods factored out so that they can be emulated differently in GWT.final class
final class
Range<C extends Comparable>
A range (or "interval") defines the boundaries around a contiguous span of values of someComparable
type; for example, "integers from 1 to 100 inclusive." Note that it is not possible to iterate over these contained values.interface
RangeMap<K extends Comparable,
V> A mapping from disjoint nonempty ranges to non-null values.interface
RangeSet<C extends Comparable>
(package private) final class
RegularContiguousSet<C extends Comparable>
An implementation ofContiguousSet
that contains one or more elements.(package private) class
AnImmutableAsList
implementation specialized for when the delegate collection is already backed by anImmutableList
or array.(package private) class
Bimap with zero or more mappings.(package private) class
Implementation ofImmutableList
backed by a simple array.(package private) final class
RegularImmutableMap<K,
V> Implementation ofImmutableMap
used for 0 entries and for 2+ entries.(package private) class
Implementation ofImmutableMultiset
with zero or more elements.(package private) final class
Implementation ofImmutableSet
with two or more elements.(package private) final class
An immutable sorted multiset with one or more distinct elements.(package private) final class
An immutable sorted set with one or more elements.(package private) class
RegularImmutableTable<R,
C, V> An implementation ofImmutableTable
holding an arbitrary number of cells.(package private) final class
An ordering that uses the reverse of the natural order of the values.(package private) final class
An ordering that uses the reverse of a given order.interface
RowSortedTable<R,
C, V> Interface that extendsTable
and whose rows are sorted.(package private) final class
Provides static methods for serializing collection classes.interface
SetMultimap<K,
V> AMultimap
that cannot hold duplicate key-value pairs.final class
Static utility methods pertaining toSet
instances.(package private) final class
Implementation ofImmutableMap
with exactly one entry.(package private) final class
Implementation ofImmutableList
with exactly one element.(package private) final class
Implementation ofImmutableSet
with exactly one element.(package private) class
SingletonImmutableTable<R,
C, V> An implementation ofImmutableTable
that holds a single cell.(package private) interface
AnIterable
whose elements are sorted relative to aComparator
, typically provided at creation time.(package private) final class
Utilities for dealing with sorted collections of all types.(package private) final class
Static methods pertaining to sortedList
instances.interface
SortedMapDifference<K,
V> An object representing the differences between two sorted maps.interface
AMultiset
which maintains the ordering of its elements, according to either their natural order or an explicitComparator
.(package private) interface
Superinterface ofSortedMultiset
to introduce a bridge method forelementSet()
, to ensure binary compatibility with older Guava versions that specifiedelementSet()
to returnSortedSet
.(package private) final class
Provides static utility methods for creating and working withSortedMultiset
instances.interface
SortedSetMultimap<K,
V> ASetMultimap
whose set of values for a given key are kept sorted; that is, they comprise aSortedSet
.(package private) final class
SparseImmutableTable<R,
C, V> ARegularImmutableTable
optimized for sparse data.(package private) class
StandardRowSortedTable<R,
C, V> Implementation ofTable
whose iteration ordering across row keys is sorted by their natural ordering or by a supplied comparator.(package private) class
StandardTable<R,
C, V> Table
implementation backed by a map that associates row keys with column key / value secondary maps.final class
Static utility methods related toStream
instances.(package private) final class
Synchronized collection views.interface
Table<R,
C, V> A collection that associates an ordered pair of keys, called a row key and a column key, with a single value.(package private) final class
Collectors utilities forcommon.collect.Table
internals.final class
Provides static methods that involve aTable
.(package private) final class
TopKSelector<T>
An accumulator that selects the "top"k
elements added to it, relative to a provided comparator.(package private) class
TransformedIterator<F,
T> An iterator that transforms a backing iterator; for internal use.(package private) class
An iterator that transforms a backing list iterator; for internal use.class
TreeBasedTable<R,
C, V> Implementation ofTable
whose row keys and column keys are ordered by their natural ordering or by supplied comparators.class
TreeMultimap<K,
V> Implementation ofMultimap
whose keys and values are ordered by their natural ordering or by supplied comparators.final class
TreeMultiset<E>
A multiset which maintains the ordering of its elements, according to either their natural order or an explicitComparator
.final class
TreeRangeMap<K extends Comparable,
V> An implementation ofRangeMap
based on aTreeMap
, supporting all optional operations.class
TreeRangeSet<C extends Comparable<?>>
class
Deprecated.UseTraverser
instead.class
An iterator that does not supportUnmodifiableIterator.remove()
.class
A list iterator that does not supportUnmodifiableIterator.remove()
,UnmodifiableListIterator.add(E)
, orUnmodifiableListIterator.set(E)
.(package private) final class
Implementation ofMultisets.unmodifiableSortedMultiset(SortedMultiset)
, split out into its own file so it can be GWT emulated (to deal with the differing elementSet() types in GWT and non-GWT).(package private) final class
An ordering that uses the natural order of the string representation of the values.
com.google.common
.