Uses of Class
org.apache.flink.compiler.dag.OptimizerNode.UnclosedBranchDescriptor

Packages that use OptimizerNode.UnclosedBranchDescriptor

Package	Description
org.apache.flink.compiler.dag

Uses of OptimizerNode.UnclosedBranchDescriptor in org.apache.flink.compiler.dag

Fields in org.apache.flink.compiler.dag with type parameters of type OptimizerNode.UnclosedBranchDescriptor

Modifier and Type	Field and Description
protected List<OptimizerNode.UnclosedBranchDescriptor>	OptimizerNode.openBranches

Methods in org.apache.flink.compiler.dag that return types with arguments of type OptimizerNode.UnclosedBranchDescriptor

Modifier and Type	Method and Description
protected List<OptimizerNode.UnclosedBranchDescriptor>	OptimizerNode.computeUnclosedBranchStackForBroadcastInputs(List<OptimizerNode.UnclosedBranchDescriptor> branchesSoFar)
protected List<OptimizerNode.UnclosedBranchDescriptor>	OptimizerNode.getBranchesForParent(PactConnection toParent)
protected List<OptimizerNode.UnclosedBranchDescriptor>	DataSinkNode.getBranchesForParent(PactConnection parent)
List<OptimizerNode.UnclosedBranchDescriptor>	OptimizerNode.getOpenBranches()

Method parameters in org.apache.flink.compiler.dag with type arguments of type OptimizerNode.UnclosedBranchDescriptor

Modifier and Type	Method and Description
protected List<OptimizerNode.UnclosedBranchDescriptor>	OptimizerNode.computeUnclosedBranchStackForBroadcastInputs(List<OptimizerNode.UnclosedBranchDescriptor> branchesSoFar)
protected boolean	OptimizerNode.mergeLists(List<OptimizerNode.UnclosedBranchDescriptor> child1open, List<OptimizerNode.UnclosedBranchDescriptor> child2open, List<OptimizerNode.UnclosedBranchDescriptor> result) The node IDs are assigned in graph-traversal order (pre-order), hence, each list is sorted by ID in ascending order and all consecutive lists start with IDs in ascending order.
protected boolean	OptimizerNode.mergeLists(List<OptimizerNode.UnclosedBranchDescriptor> child1open, List<OptimizerNode.UnclosedBranchDescriptor> child2open, List<OptimizerNode.UnclosedBranchDescriptor> result) The node IDs are assigned in graph-traversal order (pre-order), hence, each list is sorted by ID in ascending order and all consecutive lists start with IDs in ascending order.
protected boolean	OptimizerNode.mergeLists(List<OptimizerNode.UnclosedBranchDescriptor> child1open, List<OptimizerNode.UnclosedBranchDescriptor> child2open, List<OptimizerNode.UnclosedBranchDescriptor> result) The node IDs are assigned in graph-traversal order (pre-order), hence, each list is sorted by ID in ascending order and all consecutive lists start with IDs in ascending order.
protected void	OptimizerNode.removeClosedBranches(List<OptimizerNode.UnclosedBranchDescriptor> openList)