congrats Icon
New! Tabnine Pro 14-day free trial
Start a free trial
Tabnine Logo
BulkIterationNode
Code IndexAdd Tabnine to your IDE (free)

How to use
BulkIterationNode
in
org.apache.flink.optimizer.dag

Best Java code snippets using org.apache.flink.optimizer.dag.BulkIterationNode (Showing top 20 results out of 315)

origin: apache/flink

n = new BulkIterationNode((BulkIterationBase<?>) c);
p.setParallelism(containingIterationNode.getParallelism());
n = p;
origin: apache/flink

final BulkIterationBase<?> iter = iterNode.getIterationContract();
  iterNode.getParallelism(), defaultDataExchangeMode, closure);
iterNode.setPartialSolution(partialSolution);
iterNode.setNextPartialSolution(rootOfStepFunction, terminationCriterion);
StaticDynamicPathIdentifier identifier = new StaticDynamicPathIdentifier(iterNode.getCostWeight());
iterNode.acceptForStepFunction(identifier);
origin: apache/flink

@Override
public void computeUnclosedBranchStack() {
  if (this.openBranches != null) {
    return;
  }
  // the resulting branches are those of the step function
  // because the BulkPartialSolution takes the input's branches
  addClosedBranches(getSingleRootOfStepFunction().closedBranchingNodes);
  List<UnclosedBranchDescriptor> result = getSingleRootOfStepFunction().openBranches;
  this.openBranches = (result == null || result.isEmpty()) ? Collections.<UnclosedBranchDescriptor>emptyList() : result;
}
origin: apache/flink

  @Override
  public void computeUnclosedBranchStack() {
    if (this.openBranches != null) {
      return;
    }

    OptimizerNode inputToIteration = this.iterationNode.getPredecessorNode();
    
    addClosedBranches(inputToIteration.closedBranchingNodes);
    List<UnclosedBranchDescriptor> fromInput = inputToIteration.getBranchesForParent(this.iterationNode.getIncomingConnection());
    this.openBranches = (fromInput == null || fromInput.isEmpty()) ? Collections.<UnclosedBranchDescriptor>emptyList() : fromInput;
  }
}
origin: apache/flink

  ((BulkIterationNode) node).getNextPartialSolution() :
  ((BulkIterationPlanNode) node).getRootOfStepFunction();
((BulkIterationNode) node).getPartialSolution() :
((BulkIterationPlanNode) node).getPartialSolutionPlanNode();
origin: apache/flink

public BulkIterationBase<?> getIterationContract() {
  return (BulkIterationBase<?>) getOperator();
}

origin: apache/flink

@Override
public void computeInterestingPropertiesForInputs(CostEstimator estimator) {
  final InterestingProperties intProps = getInterestingProperties().clone();
origin: apache/flink

if (nextPartialSolution.getParallelism() != getParallelism() ||
  nextPartialSolution == partialSolution || nextPartialSolution instanceof BinaryUnionNode)
  noop.setParallelism(getParallelism());
origin: apache/flink

final int maxNumIterations = bulkNode.getIterationNode().getIterationContract().getMaximumNumberOfIterations();
if (maxNumIterations < 1) {
  throw new CompilerException("Cannot create bulk iteration with unspecified maximum number of iterations.");
AggregatorRegistry aggs = bulkNode.getIterationNode().getIterationContract().getAggregators();
Collection<AggregatorWithName<?>> allAggregators = aggs.getAllRegisteredAggregators();
origin: org.apache.flink/flink-optimizer

  @Override
  public void computeUnclosedBranchStack() {
    if (this.openBranches != null) {
      return;
    }

    OptimizerNode inputToIteration = this.iterationNode.getPredecessorNode();
    
    addClosedBranches(inputToIteration.closedBranchingNodes);
    List<UnclosedBranchDescriptor> fromInput = inputToIteration.getBranchesForParent(this.iterationNode.getIncomingConnection());
    this.openBranches = (fromInput == null || fromInput.isEmpty()) ? Collections.<UnclosedBranchDescriptor>emptyList() : fromInput;
  }
}
origin: org.apache.flink/flink-optimizer

  ((BulkIterationNode) node).getNextPartialSolution() :
  ((BulkIterationPlanNode) node).getRootOfStepFunction();
((BulkIterationNode) node).getPartialSolution() :
((BulkIterationPlanNode) node).getPartialSolutionPlanNode();
origin: apache/flink

BulkIterationPlanNode node = new BulkIterationPlanNode(this, this.getOperator().getName(), in, pspn, candidate);
GlobalProperties gProps = candidate.getGlobalProperties().clone();
LocalProperties lProps = candidate.getLocalProperties().clone();
for (PlanNode terminationCandidate : terminationCriterionCandidates) {
  if (singleRoot.areBranchCompatible(candidate, terminationCandidate)) {
    BulkIterationPlanNode node = new BulkIterationPlanNode(this, "BulkIteration ("+this.getOperator().getName()+")", in, pspn, candidate, terminationCandidate);
    GlobalProperties gProps = candidate.getGlobalProperties().clone();
    LocalProperties lProps = candidate.getLocalProperties().clone();
origin: com.alibaba.blink/flink-optimizer

@Override
public void computeInterestingPropertiesForInputs(CostEstimator estimator) {
  final InterestingProperties intProps = getInterestingProperties().clone();
origin: com.alibaba.blink/flink-optimizer

if (nextPartialSolution.getParallelism() != getParallelism() ||
  nextPartialSolution == partialSolution || nextPartialSolution instanceof BinaryUnionNode)
  noop.setParallelism(getParallelism());
origin: org.apache.flink/flink-optimizer

final int maxNumIterations = bulkNode.getIterationNode().getIterationContract().getMaximumNumberOfIterations();
if (maxNumIterations < 1) {
  throw new CompilerException("Cannot create bulk iteration with unspecified maximum number of iterations.");
AggregatorRegistry aggs = bulkNode.getIterationNode().getIterationContract().getAggregators();
Collection<AggregatorWithName<?>> allAggregators = aggs.getAllRegisteredAggregators();
origin: org.apache.flink/flink-optimizer

final BulkIterationBase<?> iter = iterNode.getIterationContract();
  iterNode.getParallelism(), defaultDataExchangeMode, closure);
iterNode.setPartialSolution(partialSolution);
iterNode.setNextPartialSolution(rootOfStepFunction, terminationCriterion);
StaticDynamicPathIdentifier identifier = new StaticDynamicPathIdentifier(iterNode.getCostWeight());
iterNode.acceptForStepFunction(identifier);
origin: org.apache.flink/flink-optimizer

@Override
public void computeUnclosedBranchStack() {
  if (this.openBranches != null) {
    return;
  }
  // the resulting branches are those of the step function
  // because the BulkPartialSolution takes the input's branches
  addClosedBranches(getSingleRootOfStepFunction().closedBranchingNodes);
  List<UnclosedBranchDescriptor> result = getSingleRootOfStepFunction().openBranches;
  this.openBranches = (result == null || result.isEmpty()) ? Collections.<UnclosedBranchDescriptor>emptyList() : result;
}
origin: com.alibaba.blink/flink-optimizer

  @Override
  public void computeUnclosedBranchStack() {
    if (this.openBranches != null) {
      return;
    }

    OptimizerNode inputToIteration = this.iterationNode.getPredecessorNode();
    
    addClosedBranches(inputToIteration.closedBranchingNodes);
    List<UnclosedBranchDescriptor> fromInput = inputToIteration.getBranchesForParent(this.iterationNode.getIncomingConnection());
    this.openBranches = (fromInput == null || fromInput.isEmpty()) ? Collections.<UnclosedBranchDescriptor>emptyList() : fromInput;
  }
}
origin: org.apache.flink/flink-optimizer_2.11

n = new BulkIterationNode((BulkIterationBase<?>) c);
p.setParallelism(containingIterationNode.getParallelism());
n = p;
origin: com.alibaba.blink/flink-optimizer

  ((BulkIterationNode) node).getNextPartialSolution() :
  ((BulkIterationPlanNode) node).getRootOfStepFunction();
((BulkIterationNode) node).getPartialSolution() :
((BulkIterationPlanNode) node).getPartialSolutionPlanNode();
org.apache.flink.optimizer.dagBulkIterationNode

Javadoc

A node in the optimizer's program representation for a bulk iteration.

Most used methods

  • <init>
    Creates a new node for the bulk iteration.
  • acceptForStepFunction
  • addClosedBranches
  • getCostWeight
  • getIncomingConnection
  • getInterestingProperties
  • getIterationContract
  • getNextPartialSolution
    Gets the nextPartialSolution from this BulkIterationNode.
  • getOperator
  • getParallelism
  • getPartialSolution
    Gets the partialSolution from this BulkIterationNode.
  • getPredecessorNode
  • getPartialSolution,
  • getPredecessorNode,
  • getSingleRootOfStepFunction,
  • setNextPartialSolution,
  • setPartialSolution

Popular in Java

  • Start an intent from android
  • getResourceAsStream (ClassLoader)
  • getSupportFragmentManager (FragmentActivity)
  • getSharedPreferences (Context)
  • Graphics2D (java.awt)
    This Graphics2D class extends the Graphics class to provide more sophisticated control overgraphics
  • Charset (java.nio.charset)
    A charset is a named mapping between Unicode characters and byte sequences. Every Charset can decode
  • BitSet (java.util)
    The BitSet class implements abit array [http://en.wikipedia.org/wiki/Bit_array]. Each element is eit
  • Deque (java.util)
    A linear collection that supports element insertion and removal at both ends. The name deque is shor
  • Timer (java.util)
    Timers schedule one-shot or recurring TimerTask for execution. Prefer java.util.concurrent.Scheduled
  • BasicDataSource (org.apache.commons.dbcp)
    Basic implementation of javax.sql.DataSource that is configured via JavaBeans properties. This is no
  • Top plugins for WebStorm
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyStudentsTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now