Package | Description |
---|---|
com.google.common.collect |
This package contains generic collection interfaces and implementations, and other utilities for
working with collections.
|
com.google.common.graph |
An API for representing graph (node and edge) data.
|
Modifier and Type | Class and Description |
---|---|
(package private) class |
AbstractIndexedListIterator<E>
This class provides a skeletal implementation of the
ListIterator interface across a
fixed number of elements that may be retrieved by position. |
class |
AbstractIterator<T>
This class provides a skeletal implementation of the
Iterator interface, to make this
interface easier to implement for certain types of data sources. |
class |
AbstractSequentialIterator<T>
This class provides a skeletal implementation of the
Iterator interface for sequences
whose next element can always be derived from the previous element. |
private static class |
Collections2.OrderedPermutationIterator<E> |
private static class |
Collections2.PermutationIterator<E> |
(package private) class |
ConsumingQueueIterator<T>
An Iterator implementation which draws elements from a queue, removing them from the queue as it
iterates.
|
private static class |
Iterators.ArrayItr<T> |
private static class |
Iterators.MergingIterator<T>
An iterator that performs a lazy N-way merge, calculating the next value each time the iterator
is polled.
|
private class |
StandardTable.Column.EntrySetIterator |
private class |
StandardTable.ColumnKeyIterator |
private class |
TreeTraverser.BreadthFirstIterator
Deprecated.
|
private class |
TreeTraverser.PostOrderIterator
Deprecated.
|
private class |
TreeTraverser.PreOrderIterator
Deprecated.
|
class |
UnmodifiableListIterator<E>
A list iterator that does not support
remove() , UnmodifiableListIterator.add(E) , or UnmodifiableListIterator.set(E) . |
Modifier and Type | Method and Description |
---|---|
(package private) UnmodifiableIterator<Table.Cell<R,C,V>> |
ImmutableTable.cellIterator() |
abstract UnmodifiableIterator<E> |
ImmutableSortedSet.descendingIterator() |
UnmodifiableIterator<C> |
ImmutableRangeSet.AsSet.descendingIterator() |
UnmodifiableIterator<E> |
RegularImmutableSortedSet.descendingIterator() |
UnmodifiableIterator<E> |
DescendingImmutableSortedSet.descendingIterator() |
UnmodifiableIterator<C> |
RegularContiguousSet.descendingIterator() |
UnmodifiableIterator<C> |
EmptyContiguousSet.descendingIterator() |
(package private) static <T> UnmodifiableIterator<T> |
Iterators.emptyIterator()
Returns the empty iterator.
|
(package private) abstract UnmodifiableIterator<java.util.Map.Entry<K,V>> |
ImmutableMap.IteratorBasedImmutableMap.entryIterator() |
(package private) UnmodifiableIterator<java.util.Map.Entry<K,ImmutableSet<V>>> |
ImmutableMap.MapViewOfValuesAsSingletonSets.entryIterator() |
(package private) UnmodifiableIterator<java.util.Map.Entry<K,V>> |
ImmutableMultimap.entryIterator() |
(package private) UnmodifiableIterator<java.util.Map.Entry<K,V>> |
ImmutableEnumMap.entryIterator() |
(package private) UnmodifiableIterator<java.util.Map.Entry<K,V>> |
DenseImmutableTable.ImmutableArrayMap.entryIterator() |
static <T> UnmodifiableIterator<T> |
Iterators.filter(java.util.Iterator<?> unfiltered,
java.lang.Class<T> desiredType)
Returns a view of
unfiltered containing all elements that are of the type desiredType . |
static <T> UnmodifiableIterator<T> |
Iterators.filter(java.util.Iterator<T> unfiltered,
Predicate<? super T> retainIfTrue)
Returns a view of
unfiltered containing all elements that satisfy the input predicate
retainIfTrue . |
static <T> UnmodifiableIterator<T> |
Iterators.forArray(T... array)
Returns an iterator containing the elements of
array in order. |
static <T> UnmodifiableIterator<T> |
Iterators.forEnumeration(java.util.Enumeration<T> enumeration)
Adapts an
Enumeration to the Iterator interface. |
abstract UnmodifiableIterator<E> |
ImmutableCollection.iterator()
Returns an unmodifiable iterator across the elements in this collection.
|
UnmodifiableIterator<E> |
SingletonImmutableList.iterator() |
UnmodifiableIterator<java.util.Map.Entry<K,V>> |
ImmutableSetMultimap.EntrySet.iterator() |
abstract UnmodifiableIterator<E> |
ImmutableSortedSet.iterator() |
UnmodifiableIterator<C> |
ImmutableRangeSet.AsSet.iterator() |
abstract UnmodifiableIterator<E> |
ImmutableSet.iterator() |
UnmodifiableIterator<E> |
ImmutableSet.Indexed.iterator() |
UnmodifiableIterator<E> |
Multisets.FilteredMultiset.iterator() |
UnmodifiableIterator<java.util.Map.Entry<K,V>> |
ImmutableMultimap.EntryCollection.iterator() |
UnmodifiableIterator<V> |
ImmutableMultimap.Values.iterator() |
UnmodifiableIterator<E> |
RegularImmutableSortedSet.iterator() |
UnmodifiableIterator<E> |
ImmutableList.iterator() |
UnmodifiableIterator<E> |
ImmutableEnumSet.iterator() |
UnmodifiableIterator<java.util.Map.Entry<K,V>> |
ImmutableMapEntrySet.RegularEntrySet.iterator() |
UnmodifiableIterator<K> |
ImmutableMapKeySet.iterator() |
UnmodifiableIterator<java.util.Map.Entry<V,K>> |
RegularImmutableBiMap.Inverse.InverseEntrySet.iterator() |
UnmodifiableIterator<E> |
DescendingImmutableSortedSet.iterator() |
UnmodifiableIterator<E> |
SingletonImmutableSet.iterator() |
UnmodifiableIterator<E> |
IndexedImmutableSet.iterator() |
UnmodifiableIterator<C> |
RegularContiguousSet.iterator() |
UnmodifiableIterator<E> |
RegularImmutableSet.iterator() |
UnmodifiableIterator<E> |
ImmutableMultiset.iterator() |
UnmodifiableIterator<C> |
EmptyContiguousSet.iterator() |
UnmodifiableIterator<V> |
ImmutableMapValues.iterator() |
abstract UnmodifiableIterator<E> |
Sets.SetView.iterator()
Scope the return type to
UnmodifiableIterator to ensure this is an unmodifiable view. |
(package private) UnmodifiableIterator<K> |
ImmutableMap.keyIterator() |
(package private) UnmodifiableIterator<K> |
ImmutableEnumMap.keyIterator() |
static <T> UnmodifiableIterator<T> |
Iterators.mergeSorted(java.lang.Iterable<? extends java.util.Iterator<? extends T>> iterators,
java.util.Comparator<? super T> comparator)
Returns an iterator over the merged contents of all given
iterators , traversing every
element of the input iterators. |
static <T> UnmodifiableIterator<java.util.List<T>> |
Iterators.paddedPartition(java.util.Iterator<T> iterator,
int size)
Divides an iterator into unmodifiable sublists of the given size, padding the final iterator
with null values if necessary.
|
static <T> UnmodifiableIterator<java.util.List<T>> |
Iterators.partition(java.util.Iterator<T> iterator,
int size)
Divides an iterator into unmodifiable sublists of the given size (the final list may be
smaller).
|
private static <T> UnmodifiableIterator<java.util.List<T>> |
Iterators.partitionImpl(java.util.Iterator<T> iterator,
int size,
boolean pad) |
(package private) UnmodifiableIterator<T> |
TreeTraverser.postOrderIterator(T root)
Deprecated.
|
(package private) UnmodifiableIterator<T> |
TreeTraverser.preOrderIterator(T root)
Deprecated.
|
static <T> UnmodifiableIterator<T> |
Iterators.singletonIterator(T value)
Returns an iterator containing only
value . |
(package private) static <K,V> UnmodifiableIterator<java.util.Map.Entry<K,V>> |
Maps.unmodifiableEntryIterator(java.util.Iterator<java.util.Map.Entry<K,V>> entryIterator) |
static <T> UnmodifiableIterator<T> |
Iterators.unmodifiableIterator(java.util.Iterator<? extends T> iterator)
Returns an unmodifiable view of
iterator . |
static <T> UnmodifiableIterator<T> |
Iterators.unmodifiableIterator(UnmodifiableIterator<T> iterator)
Deprecated.
no need to use this
|
(package private) UnmodifiableIterator<V> |
ImmutableMultimap.valueIterator() |
Modifier and Type | Method and Description |
---|---|
static <T> UnmodifiableIterator<T> |
Iterators.unmodifiableIterator(UnmodifiableIterator<T> iterator)
Deprecated.
no need to use this
|
Modifier and Type | Class and Description |
---|---|
(package private) class |
EndpointPairIterator<N>
A class to facilitate the set returned by
Graph.edges() . |
private static class |
EndpointPairIterator.Directed<N>
If the graph is directed, each ordered [source, target] pair will be visited once if there is
an edge connecting them.
|
private static class |
EndpointPairIterator.Undirected<N>
If the graph is undirected, each unordered [node, otherNode] pair (except self-loops) will be
visited twice if there is an edge connecting them.
|
Modifier and Type | Method and Description |
---|---|
UnmodifiableIterator<E> |
MultiEdgesConnecting.iterator() |
UnmodifiableIterator<N> |
EndpointPair.iterator()
Iterates in the order
EndpointPair.nodeU() , EndpointPair.nodeV() . |
UnmodifiableIterator<E> |
EdgesConnecting.iterator() |