- addAsDependencyToAllLeafNodes(T) - Method in class com.github.dexecutor.executor.DefaultDependentTasksExecutor
-
- addAsDependencyToAllLeafNodes(T) - Method in interface com.github.dexecutor.executor.DependentTasksExecutor
-
Adds the node as dependent on all leaf nodes (currently), meaning all leaf nodes would be evaluated first and then the given node
- addDependency(T, T) - Method in class com.github.dexecutor.executor.DefaultDependentTasksExecutor
-
- addDependency(T, T) - Method in interface com.github.dexecutor.executor.DependentTasksExecutor
-
Add Two dependent nodes into the graph, creating the nodes if not already present
- addDependency(T, T) - Method in class com.github.dexecutor.executor.graph.DefaultGraph
-
- addDependency(T, T) - Method in interface com.github.dexecutor.executor.graph.Graph
-
Should add the two nodes in the datastructure in such a way that evalFirstValue should be evaluated before evalAfterValue.
- addInComingNode(Graph.Node<T>) - Method in class com.github.dexecutor.executor.graph.Graph.Node
-
Add the given node, to the set of incoming nodes
- addIndependent(T) - Method in class com.github.dexecutor.executor.DefaultDependentTasksExecutor
-
- addIndependent(T) - Method in interface com.github.dexecutor.executor.DependentTasksExecutor
-
Add a node as independent, it does not require any dependent node
- addIndependent(T) - Method in class com.github.dexecutor.executor.graph.DefaultGraph
-
- addIndependent(T) - Method in interface com.github.dexecutor.executor.graph.Graph
-
Adds the given node to the datastructure whith out any dependency
Nodes should be created only if it is not already added.
- addOutGoingNode(Graph.Node<T>) - Method in class com.github.dexecutor.executor.graph.Graph.Node
-
add the given to the set of out going nodes
- allNodes() - Method in class com.github.dexecutor.executor.graph.DefaultGraph
-
- allNodes() - Method in interface com.github.dexecutor.executor.graph.Graph
-
Returns all nodes in this graph