How to use

acceptForStepFunction

method

in

org.apache.flink.optimizer.dag.IterationNode

  @Override
  public void postVisit(OptimizerNode node) {
    // if required, recurse into the step function
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }
  }
}

  @Override
  public void postVisit(OptimizerNode node) {
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }

    node.computeUnclosedBranchStack();
  }
}

  @Override
  public void postVisit(OptimizerNode visitable) {
    // the node ids
    visitable.initId(this.id++);

    // connections need to figure out their maximum path depths
    for (DagConnection conn : visitable.getIncomingConnections()) {
      conn.initMaxDepth();
    }
    for (DagConnection conn : visitable.getBroadcastConnections()) {
      conn.initMaxDepth();
    }

    // the estimates
    visitable.computeOutputEstimates(this.statistics);

    // if required, recurse into the step function
    if (visitable instanceof IterationNode) {
      ((IterationNode) visitable).acceptForStepFunction(this);
    }
  }
}

  @Override
  public void postVisit(OptimizerNode node) {
    // if required, recurse into the step function
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }
  }
}

  @Override
  public void postVisit(OptimizerNode node) {
    // if required, recurse into the step function
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }
  }
}

  @Override
  public void postVisit(OptimizerNode node) {
    // if required, recurse into the step function
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }
  }
}

  @Override
  public void postVisit(OptimizerNode node) {
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }

    node.computeUnclosedBranchStack();
  }
}

  @Override
  public void postVisit(OptimizerNode node) {
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }

    node.computeUnclosedBranchStack();
  }
}

  @Override
  public void postVisit(OptimizerNode node) {
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }

    node.computeUnclosedBranchStack();
  }
}

  @Override
  public void postVisit(OptimizerNode node) {
    if (node instanceof IterationNode) {
      ((IterationNode) node).acceptForStepFunction(this);
    }

    node.computeUnclosedBranchStack();
  }
}

  @Override
  public void postVisit(OptimizerNode visitable) {
    // the node ids
    visitable.initId(this.id++);

    // connections need to figure out their maximum path depths
    for (DagConnection conn : visitable.getIncomingConnections()) {
      conn.initMaxDepth();
    }
    for (DagConnection conn : visitable.getBroadcastConnections()) {
      conn.initMaxDepth();
    }

    // the estimates
    visitable.computeOutputEstimates(this.statistics);

    // if required, recurse into the step function
    if (visitable instanceof IterationNode) {
      ((IterationNode) visitable).acceptForStepFunction(this);
    }
  }
}

  @Override
  public void postVisit(OptimizerNode visitable) {
    // the node ids
    visitable.initId(this.id++);

    // connections need to figure out their maximum path depths
    for (DagConnection conn : visitable.getIncomingConnections()) {
      conn.initMaxDepth();
    }
    for (DagConnection conn : visitable.getBroadcastConnections()) {
      conn.initMaxDepth();
    }

    // the estimates
    visitable.computeOutputEstimates(this.statistics);

    // if required, recurse into the step function
    if (visitable instanceof IterationNode) {
      ((IterationNode) visitable).acceptForStepFunction(this);
    }
  }
}

  @Override
  public void postVisit(OptimizerNode visitable) {
    // the node ids
    visitable.initId(this.id++);

    // connections need to figure out their maximum path depths
    for (DagConnection conn : visitable.getIncomingConnections()) {
      conn.initMaxDepth();
    }
    for (DagConnection conn : visitable.getBroadcastConnections()) {
      conn.initMaxDepth();
    }

    // the estimates
    visitable.computeOutputEstimates(this.statistics);

    // if required, recurse into the step function
    if (visitable instanceof IterationNode) {
      ((IterationNode) visitable).acceptForStepFunction(this);
    }
  }
}

  @Override
  public void postVisit(OptimizerNode visitable) {
    // the node ids
    visitable.initId(this.id++);

    // connections need to figure out their maximum path depths
    for (DagConnection conn : visitable.getIncomingConnections()) {
      conn.initMaxDepth();
    }
    for (DagConnection conn : visitable.getBroadcastConnections()) {
      conn.initMaxDepth();
    }

    // the estimates
    visitable.computeOutputEstimates(this.statistics);

    // if required, recurse into the step function
    if (visitable instanceof IterationNode) {
      ((IterationNode) visitable).acceptForStepFunction(this);
    }
  }
}