本文整理了Java中org.apache.flink.api.common.operators.Operator.accept()方法的一些代码示例，展示了Operator.accept()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Operator.accept()方法的具体详情如下：
包路径：org.apache.flink.api.common.operators.Operator
类名称：Operator
方法名：accept

Operator.accept介绍

暂无

代码示例

代码示例来源：origin: apache/flink

@Override
public void accept(Visitor<Operator<?>> visitor) {
  boolean descend = visitor.preVisit(this);
  if (descend) {
    this.input1.accept(visitor);
    this.input2.accept(visitor);
    for (Operator<?> c : this.broadcastInputs.values()) {
      c.accept(visitor);
    }
    visitor.postVisit(this);
  }
}

代码示例来源：origin: apache/flink

/**
 * Accepts the visitor and applies it this instance. The visitors pre-visit method is called and, if returning 
 * <tt>true</tt>, the visitor is recursively applied on the single input. After the recursion returned,
 * the post-visit method is called.
 * 
 * @param visitor The visitor.
 *  
 * @see org.apache.flink.util.Visitable#accept(org.apache.flink.util.Visitor)
 */
@Override
public void accept(Visitor<Operator<?>> visitor) {
  if (visitor.preVisit(this)) {
    this.input.accept(visitor);
    for (Operator<?> c : this.broadcastInputs.values()) {
      c.accept(visitor);
    }
    visitor.postVisit(this);
  }
}

代码示例来源：origin: apache/flink

/**
 * Accepts the visitor and applies it this instance. This method applies the visitor in a depth-first traversal.
 * The visitors pre-visit method is called and, if returning 
 * <tt>true</tt>, the visitor is recursively applied on the single input. After the recursion returned,
 * the post-visit method is called.
 * 
 * @param visitor The visitor.
 *  
 * @see org.apache.flink.util.Visitable#accept(org.apache.flink.util.Visitor)
 */
@Override
public void accept(Visitor<Operator<?>> visitor) {
  boolean descend = visitor.preVisit(this);
  if (descend) {
    this.input.accept(visitor);
    visitor.postVisit(this);
  }
}

代码示例来源：origin: apache/flink

@Override
public boolean preVisit(Operator<?> visitable) {
  if(visitable instanceof GenericDataSourceBase) {
    sources.add((GenericDataSourceBase<?, ?>) visitable);
  }
  else if(visitable instanceof BulkIterationBase) {
    ((BulkIterationBase<?>) visitable).getNextPartialSolution().accept(this);
  }
  return true;
}

代码示例来源：origin: apache/flink

@Override
public boolean preVisit(Operator<?> visitable) {
  if (this.seen.add(visitable)) {
    // add to  the map
    final String name = visitable.getName();
    List<Operator<?>> list = this.map.get(name);
    if (list == null) {
      list = new ArrayList<Operator<?>>(2);
      this.map.put(name, list);
    }
    list.add(visitable);
    
    // recurse into bulk iterations
    if (visitable instanceof BulkIterationBase) {
      ((BulkIterationBase) visitable).getNextPartialSolution().accept(this);
    } else if (visitable instanceof DeltaIterationBase) {
      ((DeltaIterationBase) visitable).getSolutionSetDelta().accept(this);
      ((DeltaIterationBase) visitable).getNextWorkset().accept(this);
    }
    
    return true;
  } else {
    return false;
  }
}

代码示例来源：origin: apache/flink

iteration.getSolutionSetDelta().accept(dynCollector);
iteration.getNextWorkset().accept(dynCollector);

代码示例来源：origin: apache/flink

iteration.getNextPartialSolution().accept(dynCollector);
if (iteration.getTerminationCriterion() != null) {
  iteration.getTerminationCriterion().accept(dynCollector);

代码示例来源：origin: apache/flink

iter.getNextPartialSolution().accept(recursiveCreator);
    iter.getTerminationCriterion().accept(recursiveCreator);
    terminationCriterion = recursiveCreator.con2node.get(iter.getTerminationCriterion());
  iter.getNextWorkset().accept(wsf);
  if (!wsf.hasFoundWorkset()) {
    throw new CompilerException("In the given program, the next workset does not depend on the workset. " +
iter.getSolutionSetDelta().accept(recursiveCreator);
iter.getNextWorkset().accept(recursiveCreator);

代码示例来源：origin: com.alibaba.blink/flink-core

@Override
public void accept(Visitor<Operator<?>> visitor) {
  boolean descend = visitor.preVisit(this);
  if (descend) {
    this.input1.accept(visitor);
    this.input2.accept(visitor);
    for (Operator<?> c : this.broadcastInputs.values()) {
      c.accept(visitor);
    }
    visitor.postVisit(this);
  }
}

代码示例来源：origin: org.apache.flink/flink-core

@Override
public void accept(Visitor<Operator<?>> visitor) {
  boolean descend = visitor.preVisit(this);
  if (descend) {
    this.input1.accept(visitor);
    this.input2.accept(visitor);
    for (Operator<?> c : this.broadcastInputs.values()) {
      c.accept(visitor);
    }
    visitor.postVisit(this);
  }
}

代码示例来源：origin: org.apache.flink/flink-core

/**
 * Accepts the visitor and applies it this instance. The visitors pre-visit method is called and, if returning 
 * <tt>true</tt>, the visitor is recursively applied on the single input. After the recursion returned,
 * the post-visit method is called.
 * 
 * @param visitor The visitor.
 *  
 * @see org.apache.flink.util.Visitable#accept(org.apache.flink.util.Visitor)
 */
@Override
public void accept(Visitor<Operator<?>> visitor) {
  if (visitor.preVisit(this)) {
    this.input.accept(visitor);
    for (Operator<?> c : this.broadcastInputs.values()) {
      c.accept(visitor);
    }
    visitor.postVisit(this);
  }
}

代码示例来源：origin: com.alibaba.blink/flink-core

/**
 * Accepts the visitor and applies it this instance. The visitors pre-visit method is called and, if returning 
 * <tt>true</tt>, the visitor is recursively applied on the single input. After the recursion returned,
 * the post-visit method is called.
 * 
 * @param visitor The visitor.
 *  
 * @see org.apache.flink.util.Visitable#accept(org.apache.flink.util.Visitor)
 */
@Override
public void accept(Visitor<Operator<?>> visitor) {
  if (visitor.preVisit(this)) {
    this.input.accept(visitor);
    for (Operator<?> c : this.broadcastInputs.values()) {
      c.accept(visitor);
    }
    visitor.postVisit(this);
  }
}

代码示例来源：origin: com.alibaba.blink/flink-core

/**
 * Accepts the visitor and applies it this instance. This method applies the visitor in a depth-first traversal.
 * The visitors pre-visit method is called and, if returning 
 * <tt>true</tt>, the visitor is recursively applied on the single input. After the recursion returned,
 * the post-visit method is called.
 * 
 * @param visitor The visitor.
 *  
 * @see org.apache.flink.util.Visitable#accept(org.apache.flink.util.Visitor)
 */
@Override
public void accept(Visitor<Operator<?>> visitor) {
  boolean descend = visitor.preVisit(this);
  if (descend) {
    this.input.accept(visitor);
    visitor.postVisit(this);
  }
}

代码示例来源：origin: org.apache.flink/flink-core

/**
 * Accepts the visitor and applies it this instance. This method applies the visitor in a depth-first traversal.
 * The visitors pre-visit method is called and, if returning 
 * <tt>true</tt>, the visitor is recursively applied on the single input. After the recursion returned,
 * the post-visit method is called.
 * 
 * @param visitor The visitor.
 *  
 * @see org.apache.flink.util.Visitable#accept(org.apache.flink.util.Visitor)
 */
@Override
public void accept(Visitor<Operator<?>> visitor) {
  boolean descend = visitor.preVisit(this);
  if (descend) {
    this.input.accept(visitor);
    visitor.postVisit(this);
  }
}

代码示例来源：origin: org.apache.flink/flink-core

iteration.getSolutionSetDelta().accept(dynCollector);
iteration.getNextWorkset().accept(dynCollector);

代码示例来源：origin: com.alibaba.blink/flink-core

iteration.getSolutionSetDelta().accept(dynCollector);
iteration.getNextWorkset().accept(dynCollector);

代码示例来源：origin: org.apache.flink/flink-core

iteration.getNextPartialSolution().accept(dynCollector);
if (iteration.getTerminationCriterion() != null) {
  iteration.getTerminationCriterion().accept(dynCollector);

代码示例来源：origin: com.alibaba.blink/flink-core

iteration.getNextPartialSolution().accept(dynCollector);
if (iteration.getTerminationCriterion() != null) {
  iteration.getTerminationCriterion().accept(dynCollector);

代码示例来源：origin: org.apache.flink/flink-optimizer

iter.getNextPartialSolution().accept(recursiveCreator);
    iter.getTerminationCriterion().accept(recursiveCreator);
    terminationCriterion = recursiveCreator.con2node.get(iter.getTerminationCriterion());
  iter.getNextWorkset().accept(wsf);
  if (!wsf.hasFoundWorkset()) {
    throw new CompilerException("In the given program, the next workset does not depend on the workset. " +
iter.getSolutionSetDelta().accept(recursiveCreator);
iter.getNextWorkset().accept(recursiveCreator);

代码示例来源：origin: org.apache.flink/flink-optimizer_2.10

iter.getNextPartialSolution().accept(recursiveCreator);
    iter.getTerminationCriterion().accept(recursiveCreator);
    terminationCriterion = recursiveCreator.con2node.get(iter.getTerminationCriterion());
  iter.getNextWorkset().accept(wsf);
  if (!wsf.hasFoundWorkset()) {
    throw new CompilerException("In the given program, the next workset does not depend on the workset. " +
iter.getSolutionSetDelta().accept(recursiveCreator);
iter.getNextWorkset().accept(recursiveCreator);