org.apache.flink.runtime.managementgraph

Class ManagementGraphIterator

java.lang.Object

org.apache.flink.runtime.managementgraph.ManagementGraphIterator

All Implemented Interfaces:

Iterator<ManagementVertex>

public final class ManagementGraphIterator
extends Object
implements Iterator<ManagementVertex>

This class provides an implementation of the Iterator interface which allows to traverse a management graph and visit every reachable vertex exactly once. The order in which the vertices are visited corresponds to the order of their discovery in a depth first search.

This class is not thread-safe.

Constructor Summary

Constructors

Constructor and Description
ManagementGraphIterator(ManagementGraph managementGraph, boolean forward) Creates a new management graph iterator.
ManagementGraphIterator(ManagementGraph managementGraph, int startStage, boolean confinedToStage, boolean forward) Creates a new management graph iterator.
ManagementGraphIterator(ManagementGraph managementGraph, ManagementVertex startVertex, boolean forward) Creates a new management graph iterator.

Method Summary

Methods

Modifier and Type	Method and Description
boolean	hasNext()
ManagementVertex	next()
void	remove()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ManagementGraphIterator

public ManagementGraphIterator(ManagementGraph managementGraph,
                       boolean forward)

Creates a new management graph iterator.

Parameters:

managementGraph - the management graph that should be traversed

forward - true if the graph should be traversed in correct order, false to traverse it in reverse order

ManagementGraphIterator

public ManagementGraphIterator(ManagementGraph managementGraph,
                       int startStage,
                       boolean confinedToStage,
                       boolean forward)

Creates a new management graph iterator.

Parameters:

managementGraph - the management graph that should be traversed

startStage - the index of the stage of the graph where the traversal is supposed to begin

confinedToStage - false if the graph iterator is allowed to traverse to upper (in case of reverse order traversal lower) stages, true otherwise.

forward - true if the graph should be traversed in correct order, false to traverse it in reverse order

ManagementGraphIterator

public ManagementGraphIterator(ManagementGraph managementGraph,
                       ManagementVertex startVertex,
                       boolean forward)

Creates a new management graph iterator. This constructor can be used to traverse only specific parts of the graph starting at startVertex. The iterator will not switch to the next input/output vertex of an output/input vertex has been reached.

Parameters:

managementGraph - the management graph that should be traversed

startVertex - the vertex to start the traversal from

forward - true if the graph should be traversed in correct order, false to reverse it in reverse order

Method Detail

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<ManagementVertex>

next

public ManagementVertex next()

Specified by:

next in interface Iterator<ManagementVertex>

remove

public void remove()

Specified by:

remove in interface Iterator<ManagementVertex>