Package cascading.flow.planner.iso.finder

Examples of cascading.flow.planner.iso.finder.Match


      .arcs( SHARED_TAP, SHARED_HASHJOIN )
      .arcs( SHARED_TAP, SHARED_HASHJOIN );

    GraphFinder graphFinder = new GraphFinder( expressionGraph );

    Match match = graphFinder.findFirstMatch( graph );

    match.getMatchedGraph().writeDOT( getPlanPath() + "/match.dot" );
    }
View Full Code Here


    ExpressionGraph expressionGraph = new ExpressionGraph()
      .arc( sharedTap, ScopeExpression.ALL, sharedHashJoin );

    GraphFinder graphFinder = new GraphFinder( expressionGraph );

    Match match = graphFinder.findFirstMatch( graph );

    match.getMatchedGraph().writeDOT( getPlanPath() + "/match.dot" );
    }
View Full Code Here

        new FlowElementExpression( ElementCapture.Primary, HashJoin.class )
      );

    GraphFinder graphFinder = new GraphFinder( expressionGraph );

    Match match = graphFinder.findAllMatchesOnPrimary( graph );

    match.getMatchedGraph().writeDOT( getPlanPath() + "/match.dot" );
    }
View Full Code Here

    ExpressionGraph expressionGraph = new ExpressionGraph( new FlowElementExpression( ElementCapture.Primary, Tap.class ) );

    GraphFinder graphFinder = new GraphFinder( expressionGraph );

    Match match = graphFinder.findAllMatches( graph );

    match.getMatchedGraph().writeDOT( getPlanPath() + "/match.dot" );
    }
View Full Code Here

    transformed.addChildTransform( contractedTransformed );

    // apply contracted sub-graph matcher to get the bounded sub-graph of the original graph
    ElementGraph contractedGraph = contractedTransformed.getEndGraph();

    Match match = findAllPrimaries ? subGraphFinder.findAllMatches( plannerContext, contractedGraph ) : subGraphFinder.findFirstMatch( plannerContext, contractedGraph );

    if( !match.foundMatch() )
      return transformed;

    ElementGraph contractedSubGraph = match.getMatchedGraph();

    ElementSubGraph resultSubGraph = asSubGraphOf( rootGraph, contractedSubGraph ); // the bounded sub-graph of the rootGraph

    transformed.setEndGraph( resultSubGraph );
View Full Code Here

    if( prepared == null )
      return graph;

    Set<FlowElement> exclusions = addExclusions( graph );

    Match match;

    if( LOG.isDebugEnabled() )
      LOG.debug( "performing match within: {}, using recursion: {}", this.getClass().getSimpleName(), !findAllPrimaries );

    // for trivial cases, disable recursion and capture all primaries initially
View Full Code Here

    Transformed<E> transform = transform( plannerContext, graph );

    if( transform != null && transform.getEndGraph() != null )
      graph = transform.getEndGraph();

    Match match = finder.findFirstMatch( plannerContext, graph );

    Asserted asserted = new Asserted( plannerContext, this, graph, message, match );

    if( transform != null )
      asserted.addChildTransform( transform );
View Full Code Here

    EnumMultiMap annotationsMap = new EnumMultiMap();

    if( annotations.length == 0 )
      return annotationsMap;

    Match match = getLastMatch();

    for( ElementAnnotation annotation : annotations )
      annotationsMap.addAll( annotation.getAnnotation(), match.getCapturedElements( annotation.getCapture() ) );

    return annotationsMap;
    }
View Full Code Here

TOP

Related Classes of cascading.flow.planner.iso.finder.Match

Copyright © 2018 www.massapicom. 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.