Examples of accept()


Examples of org.apache.drill.common.expression.LogicalExpression.accept()

    ExprParser parser = new ExprParser(tokens);
    LogicalExpression e = parser.parse().e;
    RecordPointer r = new UnbackedRecord();
    r.addField(new SchemaPath("a", ExpressionPosition.UNKNOWN), new IntegerScalar(3));
    SimpleEvaluationVisitor builder = new SimpleEvaluationVisitor(r);
    BasicEvaluator eval = e.accept(builder, null);
    DataValue v = eval.eval();
    System.out.println(v);
  }
 
}
View Full Code Here

Examples of org.apache.drill.common.logical.data.LogicalOperator.accept()

    }
  }

  public void go(DrillRel root) {
    LogicalOperator rootLOP = root.implement(this);
    rootLOP.accept(new AddOpsVisitor(), null);
  }
 
  public LogicalPlan getPlan(){
    if(plan == null){
      plan = planBuilder.build();
View Full Code Here

Examples of org.apache.drill.exec.physical.base.PhysicalOperator.accept()

    PhysicalOperator rootOperator = plan.getSortedOperators(false).iterator().next();
    MakeFragmentsVisitor makeFragmentsVisitor = new MakeFragmentsVisitor();
    Fragment rootFragment;
    try {
      rootFragment = rootOperator.accept(makeFragmentsVisitor, null);
    } catch (FragmentSetupException e) {
      fail("Failure while fragmenting query.", e);
      return;
    }
   
View Full Code Here

Examples of org.apache.droids.helper.factories.URLFiltersFactory.accept()

  
    // TODO -- make the hashvalue for Outlink...
    Map<String,Link> filtered = new LinkedHashMap<String,Link>();
    for( Link outlink : parse.getOutlinks() ) {
      String id = outlink.getId();
      if (filters.accept(id) && !filtered.containsKey(id)) {
      if( linkValidator == null ){
        filtered.put(id,outlink);
      }
      else if( linkValidator.validate( outlink ) ){
        filtered.put(id,outlink);
View Full Code Here

Examples of org.apache.felix.ipojo.manipulator.metadata.annotation.model.literal.AnnotationPlayback.accept()

    public void testSimpleValuesPlayback() throws Exception {

        when(visitor.visitAnnotation(anyString(), anyBoolean())).thenReturn(annotationVisitor);

        AnnotationPlayback playback = new AnnotationPlayback(find(SimpleTypes.class));
        playback.accept(visitor);

        verify(visitor).visitAnnotation(Type.getType(SimpleTypes.class).getDescriptor(),
                                        true);
        verify(annotationVisitor).visitEnd();
View Full Code Here

Examples of org.apache.felix.sigil.common.core.licence.ILicensePolicy.accept()

        VersionRange versions = pi.getVersions();

        // find exact match(es)
        for (ISigilBundle bundle : getBundles())
        {
            if (policy.accept(bundle))
            {
                for (IPackageExport exp : bundle.getBundleInfo().getExports())
                {
                    if (name.equals(exp.getPackageName())
                        && versions.contains(exp.getVersion()))
View Full Code Here

Examples of org.apache.felix.sigil.common.repository.IBundleRepository.accept()

     */
    public void accept(IRepositoryVisitor visitor, int options)
    {
        IBundleRepository delegate = getDelegate();
        if ( delegate != null ) {
            delegate.accept(visitor, options);
        }
    }

    /* (non-Javadoc)
     * @see org.apache.felix.sigil.common.repository.IBundleRepository#addBundleRepositoryListener(org.apache.felix.sigil.common.repository.IBundleRepositoryListener)
View Full Code Here

Examples of org.apache.flink.api.common.Plan.accept()

    try {
     
      Plan plan = getTestPlanRightStatic("");
     
      SourceCollectorVisitor sourceCollector = new SourceCollectorVisitor();
      plan.accept(sourceCollector);
     
      for(GenericDataSourceBase<?, ?> s : sourceCollector.getSources()) {
        if(s.getName().equals("bigFile")) {
          this.setSourceStatistics(s, 10000000, 1000);
        }
View Full Code Here

Examples of org.apache.flink.compiler.dag.OptimizerNode.accept()

    }

    // now that we have all nodes created and recorded which ones consume memory, tell the nodes their minimal
    // guaranteed memory, for further cost estimations. we assume an equal distribution of memory among consumer tasks
   
    rootNode.accept(new IdAndEstimatesVisitor(this.statistics));
   
    // Now that the previous step is done, the next step is to traverse the graph again for the two
    // steps that cannot directly be performed during the plan enumeration, because we are dealing with DAGs
    // rather than a trees. That requires us to deviate at some points from the classical DB optimizer algorithms.
    //
View Full Code Here

Examples of org.apache.flink.compiler.plan.OptimizedPlan.accept()

    NepheleJobGraphGenerator jobGen = new NepheleJobGraphGenerator();
   
    // Compile plan to verify that no error is thrown
    jobGen.compileJobGraph(oPlan);
   
    oPlan.accept(new Visitor<PlanNode>() {
     
      @Override
      public boolean preVisit(PlanNode visitable) {
        if (visitable instanceof SingleInputPlanNode && visitable.getPactContract() instanceof ReduceOperator) {
          for (Channel inConn : visitable.getInputs()) {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.