Package | Description |
---|---|
com.github.dexecutor.core | |
com.github.dexecutor.core.graph |
Modifier and Type | Method and Description |
---|---|
Node<T,R> |
DexecutorState.getGraphNode(T id)
Returns the node with the given id
|
Node<T,R> |
DefaultDexecutorState.getGraphNode(T id) |
Modifier and Type | Method and Description |
---|---|
Collection<Node<T,R>> |
DexecutorState.getDiscontinuedNodes() |
Collection<Node<T,R>> |
DefaultDexecutorState.getDiscontinuedNodes() |
Set<Node<T,R>> |
DexecutorState.getInitialNodes()
Returns the Set of nodes for which there is no incoming dependencies.
|
Set<Node<T,R>> |
DefaultDexecutorState.getInitialNodes() |
Collection<Node<T,R>> |
DexecutorState.getProcessedNodes() |
Collection<Node<T,R>> |
DefaultDexecutorState.getProcessedNodes() |
Modifier and Type | Method and Description |
---|---|
void |
DexecutorState.markProcessingDone(Node<T,R> node)
Mark the
node as processed. |
void |
DefaultDexecutorState.markProcessingDone(Node<T,R> node) |
boolean |
DexecutorState.shouldProcess(Node<T,R> node) |
boolean |
DefaultDexecutorState.shouldProcess(Node<T,R> node) |
Modifier and Type | Method and Description |
---|---|
void |
DexecutorState.processAfterNoError(Collection<Node<T,R>> nodes)
Add to existing collection of discontinued nodes to be processed later, if system come to valid state.
|
void |
DefaultDexecutorState.processAfterNoError(Collection<Node<T,R>> nodes) |
Modifier and Type | Method and Description |
---|---|
Node<T,R> |
DefaultDag.get(T id) |
Node<T,R> |
Dag.get(T id)
Returns the node with the given id
|
Modifier and Type | Method and Description |
---|---|
Collection<Node<T,R>> |
DefaultDag.allNodes() |
Collection<Node<T,R>> |
Dag.allNodes()
Returns all nodes in this graph
|
Set<Node<T,R>> |
Node.getInComingNodes() |
Set<Node<T,R>> |
DefaultDag.getInitialNodes() |
Set<Node<T,R>> |
Dag.getInitialNodes()
Returns the Set of nodes for which there is no incoming dependencies.
|
Set<Node<T,R>> |
DefaultDag.getLeafNodes() |
Set<Node<T,R>> |
Dag.getLeafNodes()
Retruns the set of nodes for which there is no outgoing dependencies.
|
Set<Node<T,R>> |
Node.getOutGoingNodes() |
protected List<List<List<Node<T,R>>>> |
BaseTraversar.traverseLevelOrder(Dag<T,R> graph) |
Modifier and Type | Method and Description |
---|---|
void |
Node.addInComingNode(Node<T,R> node)
Add the given node, to the set of incoming nodes
|
void |
Node.addOutGoingNode(Node<T,R> node)
add the given to the set of out going nodes
|
Modifier and Type | Method and Description |
---|---|
protected void |
BaseTraversar.printGraph(List<List<Node<T,R>>> list,
Writer writer) |
Copyright © 2016 Dexecutor. All rights reserved.