if(selectedCandidate == null && getSolutionSetDeltaPlanNode() != null && getSolutionSetDeltaPlanNode() .branchPlan != null){ selectedCandidate = getSolutionSetDeltaPlanNode().branchPlan.get(brancher);
PlanNode solutionSetDelta = iterationNode.getSolutionSetDeltaPlanNode();
DumpableNode<?> solutionDelta = node instanceof WorksetIterationNode ? ((WorksetIterationNode) node).getSolutionSetDelta() : ((WorksetIterationPlanNode) node).getSolutionSetDeltaPlanNode();
if (wspn.getSolutionSetDeltaPlanNode() == pred || wspn.getNextWorkSetPlanNode() == pred) { chaining = false;
@Override public boolean preVisit(PlanNode visitable) { if (visitable instanceof WorksetIterationPlanNode) { PlanNode deltaNode = ((WorksetIterationPlanNode) visitable).getSolutionSetDeltaPlanNode(); //get the CoGroup DualInputPlanNode dpn = (DualInputPlanNode) deltaNode.getInputs().iterator().next().getSource(); Channel in1 = dpn.getInput1(); Channel in2 = dpn.getInput2(); Assert.assertTrue(in1.getLocalProperties().getOrdering() == null); Assert.assertTrue(in2.getLocalProperties().getOrdering() != null); Assert.assertTrue(in2.getLocalProperties().getOrdering().getInvolvedIndexes().contains(0)); Assert.assertTrue(in1.getShipStrategy() == ShipStrategyType.FORWARD); Assert.assertTrue(in2.getShipStrategy() == ShipStrategyType.PARTITION_HASH); return false; } return true; }
final PlanNode solutionDeltaNode = iterNode.getSolutionSetDeltaPlanNode();
throw new CompilerException("Optimizer cannot compile a workset iteration step function where the next workset is produced by a Union node."); if (iterationNode.getSolutionSetDeltaPlanNode() instanceof NAryUnionPlanNode) { throw new CompilerException("Optimizer cannot compile a workset iteration step function where the solution set delta is produced by a Union node."); traverse(iterationNode.getSolutionSetDeltaPlanNode()); traverse(iterationNode.getNextWorkSetPlanNode());
SingleInputPlanNode solutionDeltaNoop = (SingleInputPlanNode) iterNode.getSolutionSetDeltaPlanNode();
if(selectedCandidate == null && getSolutionSetDeltaPlanNode() != null && getSolutionSetDeltaPlanNode() .branchPlan != null){ selectedCandidate = getSolutionSetDeltaPlanNode().branchPlan.get(brancher);
if(selectedCandidate == null && getSolutionSetDeltaPlanNode() != null && getSolutionSetDeltaPlanNode() .branchPlan != null){ selectedCandidate = getSolutionSetDeltaPlanNode().branchPlan.get(brancher);
if(selectedCandidate == null && getSolutionSetDeltaPlanNode() != null && getSolutionSetDeltaPlanNode() .branchPlan != null){ selectedCandidate = getSolutionSetDeltaPlanNode().branchPlan.get(brancher);
if(selectedCandidate == null && getSolutionSetDeltaPlanNode() != null && getSolutionSetDeltaPlanNode() .branchPlan != null){ selectedCandidate = getSolutionSetDeltaPlanNode().branchPlan.get(brancher);
PlanNode solutionSetDelta = iterationNode.getSolutionSetDeltaPlanNode();
if (wspn.getSolutionSetDeltaPlanNode() == pred || wspn.getNextWorkSetPlanNode() == pred) { chaining = false;
if (wspn.getSolutionSetDeltaPlanNode() == pred || wspn.getNextWorkSetPlanNode() == pred) { chaining = false;
if (wspn.getSolutionSetDeltaPlanNode() == pred || wspn.getNextWorkSetPlanNode() == pred) { chaining = false;
if (wspn.getSolutionSetDeltaPlanNode() == pred || wspn.getNextWorkSetPlanNode() == pred) { chaining = false;
final PlanNode solutionDeltaNode = iterNode.getSolutionSetDeltaPlanNode();
final PlanNode solutionDeltaNode = iterNode.getSolutionSetDeltaPlanNode();
throw new CompilerException("Optimizer cannot compile a workset iteration step function where the next workset is produced by a Union node."); if (iterationNode.getSolutionSetDeltaPlanNode() instanceof NAryUnionPlanNode) { throw new CompilerException("Optimizer cannot compile a workset iteration step function where the solution set delta is produced by a Union node."); traverse(iterationNode.getSolutionSetDeltaPlanNode()); traverse(iterationNode.getNextWorkSetPlanNode());