Uses of Class
com.google.common.collect.AbstractIterator
-
Packages that use AbstractIterator 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. -
-
Uses of AbstractIterator in com.google.common.collect
Subclasses of AbstractIterator in com.google.common.collect Modifier and Type Class Description 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 class
StandardTable.Column.EntrySetIterator
private class
StandardTable.ColumnKeyIterator
private class
TreeTraverser.PostOrderIterator
Deprecated. -
Uses of AbstractIterator in com.google.common.graph
Subclasses of AbstractIterator in com.google.common.graph Modifier and Type Class Description (package private) class
EndpointPairIterator<N>
A class to facilitate the set returned byGraph.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.private class
Traverser.GraphTraverser.DepthFirstIterator
private class
Traverser.TreeTraverser.DepthFirstPostOrderIterator
-