@Internal public class InputOrderCalculator extends InputPriorityGraphGenerator
InputPriorityGraphGenerator
.
This class only calculates the input order for the given boundary nodes and will throw exception when a conflict is detected.
graph
Constructor and Description |
---|
InputOrderCalculator(ExecNode<?> root,
Set<ExecNode<?>> boundaries,
InputProperty.DamBehavior safeDamBehavior)
Create a
InputOrderCalculator for the given ExecNode sub-graph. |
Modifier and Type | Method and Description |
---|---|
Map<ExecNode<?>,Integer> |
calculate() |
protected void |
resolveInputPriorityConflict(ExecNode<?> node,
int higherInput,
int lowerInput) |
createTopologyGraph
public InputOrderCalculator(ExecNode<?> root, Set<ExecNode<?>> boundaries, InputProperty.DamBehavior safeDamBehavior)
InputOrderCalculator
for the given ExecNode
sub-graph.root
- the output node of the sub-graphboundaries
- the first layer of nodes on the input side of the sub-graphsafeDamBehavior
- when checking for conflicts we'll ignore the edges with InputProperty.DamBehavior
stricter or equal than thisprotected void resolveInputPriorityConflict(ExecNode<?> node, int higherInput, int lowerInput)
resolveInputPriorityConflict
in class InputPriorityGraphGenerator
Copyright © 2014–2024 The Apache Software Foundation. All rights reserved.