BulkIterationNode
Code IndexAdd Codota to your IDE (free)

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

  • Common ways to obtain BulkIterationNode
private void myMethod () {
BulkIterationNode b =
  • new BulkIterationNode((BulkIterationBase<?>)c)
  • BulkIterationPlanNode bulkIterationPlanNode;(BulkIterationNode) bulkIterationPlanNode.template
  • GraphCreatingVisitor graphCreatingVisitor;Object key;(BulkIterationNode) graphCreatingVisitor.parent.con2node.get(key)
  • Smart code suggestions by Codota
}
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_2.11

@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

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

  • Finding current android device location
  • getSharedPreferences (Context)
  • runOnUiThread (Activity)
  • notifyDataSetChanged (ArrayAdapter)
  • RandomAccessFile (java.io)
    Allows reading from and writing to a file in a random-access manner. This is different from the uni-
  • HttpURLConnection (java.net)
    An URLConnection for HTTP (RFC 2616 [http://tools.ietf.org/html/rfc2616]) used to send and receive d
  • MalformedURLException (java.net)
    This exception is thrown when a program attempts to create an URL from an incorrect specification.
  • Stack (java.util)
    Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of objects. It enables u
  • LogFactory (org.apache.commons.logging)
    Factory for creating Log instances, with discovery and configuration features similar to that employ
  • Scheduler (org.quartz)
    This is the main interface of a Quartz Scheduler. A Scheduler maintains a registry of org.quartz.Job

For IntelliJ IDEA,
Android Studio or Eclipse

  • Search for JavaScript code betaCodota IntelliJ IDEA pluginCodota Android Studio pluginCode IndexSign in
  • EnterpriseFAQAboutBlogContact Us
  • Plugin user guideTerms of usePrivacy policyCodeboxFind Usages
Add Codota to your IDE (free)