com.phoenixst.plexus.util
public class FilteredEdgeIterator extends FilteredIterator
Iterator
. Because this class
must advance the underlying Iterator
to function
properly, implementing FilteredEdgeIterator may delegate to Graph.removeEdge( edge )
in some situations.
Since: 1.0
Version: $Revision: 1.9 $
Constructor Summary | |
---|---|
FilteredEdgeIterator(Iterator edgeIter, Predicate edgePredicate)
Creates a new FilteredEdgeIterator which will
throw an IllegalStateException if
remove() is called after hasNext()
without an intervening call to next() . | |
FilteredEdgeIterator(Graph graph, Iterator edgeIter, Predicate edgePredicate)
Creates a new FilteredEdgeIterator which will
have FilteredEdgeIterator delegate to Graph.removeEdge( edge ) if necessary. |
Method Summary | |
---|---|
protected void | remove(Object object)
If the Graph specified in the constructor is not
null , this implementation will delegate to Graph.removeEdge( edge ) (which may
invalidate this Iterator ). |
FilteredEdgeIterator
which will
throw an IllegalStateException
if
remove()
is called after hasNext()
without an intervening call to next()
.FilteredEdgeIterator
which will
have FilteredEdgeIterator delegate to Graph.removeEdge( edge )
if necessary. Depending upon the
Graph
implementation, this may invalidate this
Iterator
.Graph
specified in the constructor is not
null
, this implementation will delegate to Graph.removeEdge( edge )
(which may
invalidate this Iterator
). If the
Graph
specified in the constructor is
null
, or if the other constructor is used, this
implementation throws an IllegalStateException
.
Description copied from class: FilteredIterator
{@inheritDoc }