Tabnine Logo
BulkIterationNode.getIncomingConnection
Code IndexAdd Tabnine to your IDE (free)

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

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

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

  @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

  @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.10

  @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;
  }
}
org.apache.flink.optimizer.dagBulkIterationNodegetIncomingConnection

Popular methods of BulkIterationNode

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

Popular in Java

  • Making http post requests using okhttp
  • getSharedPreferences (Context)
  • getExternalFilesDir (Context)
  • getApplicationContext (Context)
  • DateFormat (java.text)
    Formats or parses dates and times.This class provides factories for obtaining instances configured f
  • LinkedList (java.util)
    Doubly-linked list implementation of the List and Dequeinterfaces. Implements all optional list oper
  • Random (java.util)
    This class provides methods that return pseudo-random values.It is dangerous to seed Random with the
  • TreeMap (java.util)
    Walk the nodes of the tree left-to-right or right-to-left. Note that in descending iterations, next
  • Cipher (javax.crypto)
    This class provides access to implementations of cryptographic ciphers for encryption and decryption
  • SAXParseException (org.xml.sax)
    Encapsulate an XML parse error or warning.> This module, both source code and documentation, is in t
  • 21 Best IntelliJ Plugins
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