Package cascading.flow.planner.graph

Examples of cascading.flow.planner.graph.ElementGraph

44
45
46
47
48
49
50
51
52
53
54
public class GraphFinderTest extends CascadingTestCase
  {
  @Test
  public void testFind()
    {
    ElementGraph graph = new HashJoinSameSourceGraph();

    graph = new ContractedTransformer( new SyncPipeExpressionGraph() ).transform( graph ).getEndGraph();

    FlowElementExpression SHARED_TAP = new FlowElementExpression( Tap.class, TypeExpression.Topo.SplitOnly );
    FlowElementExpression SHARED_HASHJOIN = new FlowElementExpression( HashJoin.class );
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
    }

  @Test
  public void testFind2()
    {
    ElementGraph graph = new HashJoinSameSourceGraph();

    graph = new ContractedTransformer( new SyncPipeExpressionGraph() ).transform( graph ).getEndGraph();

    FlowElementExpression sharedTap = new FlowElementExpression( Tap.class, TypeExpression.Topo.SplitOnly );
    FlowElementExpression sharedHashJoin = new FlowElementExpression( HashJoin.class );
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
  @Test
  public void testFindAllOnPrimary()
    {
//    ElementGraph graph = new HashJoinSameSourceGraph();
    ElementGraph graph = new JoinAroundJoinRightMostGraph();
    graph.writeDOT( getPlanPath() + "/full.dot" );

//    graph = new ContractedTransform( new SyncPipeExpressionGraph() ).transform( graph ).getEndGraph();
    graph = new ContractedTransformer( new NoGroupTapExpressionGraph() ).transform( graph ).getEndGraph();

    graph.writeDOT( getPlanPath() + "/contracted.dot" );

    ExpressionGraph expressionGraph = new ExpressionGraph()
      .arc(
        new FlowElementExpression( Tap.class ),
        ScopeExpression.ALL,
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
  @Test
  public void testFindAllMatched()
    {
//    ElementGraph graph = new HashJoinSameSourceGraph();
    ElementGraph graph = new JoinAroundJoinRightMostGraph();
    graph.writeDOT( getPlanPath() + "/full.dot" );

//    graph = new ContractedTransform( new SyncPipeExpressionGraph() ).transform( graph ).getEndGraph();
    graph = new ContractedTransformer( new NoGroupTapExpressionGraph() ).transform( graph ).getEndGraph();

    graph.writeDOT( getPlanPath() + "/contracted.dot" );

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

    GraphFinder graphFinder = new GraphFinder( expressionGraph );
View Full Code Here
197
198
199
200
201
202
203
204
205
206
207
208
209
    RemoveBranchGraphTransformer removeTransformer = new RemoveBranchGraphTransformer( new TestMalformedJoinExpressionGraph() );

    int count = 0;
    while( iterator.hasNext() )
      {
      ElementGraph next = iterator.next();
      assertNotNull( next );
      next.writeDOT( getPlanPath() + "/pipeline/" + count + "-graph.dot" );

      Transformed<ElementGraph> result = removeTransformer.transform( next );

      result.getEndGraph().writeDOT( getPlanPath() + "/pipeline/" + count + "-cleaned-graph.dot" );
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
308
309
    iterator.getContractedGraph().writeDOT( getPlanPath() + "/node-contracted.dot" );

    int count = 0;
    while( iterator.hasNext() && count < 10 )
      {
      ElementGraph next = iterator.next();
      assertNotNull( next );
      next.writeDOT( getPlanPath() + "/pipeline/" + count + "-graph.dot" );

      count++;
      }

    assertEquals( "wrong number of sub-graphs", numSubGraphs, count );
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
  @Override
  public Transformed<ElementGraph> transform( PlannerContext plannerContext, ElementGraph rootGraph )
    {
    Transformed<ElementGraph> result = new Transformed<>( plannerContext, this, rootGraph );

    ElementGraph graphCopy = rootGraph.copyGraph();

    Transformed<ElementGraph> transformed = graphTransformer.transform( plannerContext, graphCopy );

    result.addChildTransform( transformed );
View Full Code Here
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
    Map<ElementGraph, List<? extends ElementGraph>> subGraphs = new LinkedHashMap<>();

    for( Map.Entry<ElementGraph, List<? extends ElementGraph>> entry : priorResults.entrySet() )
      {
      ElementGraph parent = entry.getKey();
      List<? extends ElementGraph> priors = entry.getValue();

      List<ElementGraph> resultChildren = new ArrayList<>( priors );

      Set<FlowElement> exclusions = getExclusions( priors, partitioner.getAnnotationExcludes() );

      for( ElementGraph child : priors )
        {
        ElementGraph priorAnnotated = annotateWithPriors( child, priors );

        Partitions partitions = partitioner.partition( plannerContext, priorAnnotated, exclusions );

        writeTrace( ruleResult, phase, rule, parent, child, partitions );
View Full Code Here
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
    Map<ElementGraph, List<? extends ElementGraph>> subGraphs = new LinkedHashMap<>();

    for( Map.Entry<ElementGraph, List<? extends ElementGraph>> entry : priorResults.entrySet() )
      {
      ElementGraph parent = entry.getKey();
      List<? extends ElementGraph> priors = entry.getValue();

      Set<FlowElement> exclusions = getExclusions( priors, partitioner.getAnnotationExcludes() );
      ElementGraph priorAnnotated = annotateWithPriors( parent, priors );

      Partitions partitions = partitioner.partition( plannerContext, priorAnnotated, exclusions );

      writeTrace( ruleResult, phase, rule, parent, null, partitions );
View Full Code Here
312
313
314
315
316
317
318
319
320
321
322
    Map<ElementGraph, List<? extends ElementGraph>> levelResults = ruleResult.getLevelResults( phase.getLevel() );

    for( Map.Entry<ElementGraph, List<? extends ElementGraph>> entry : levelResults.entrySet() )
      {
      ElementGraph parent = entry.getKey(); // null for root case
      List<? extends ElementGraph> children = entry.getValue();

      for( ElementGraph child : children )
        {
        Asserted asserted = rule.assertion( plannerContext, child );
View Full Code Here
TOP

Related Classes of cascading.flow.planner.graph.ElementGraph

  • cascading.flow.iso.GraphFinderTest
  • cascading.flow.iso.IsomorphismTest
  • cascading.flow.planner.iso.subgraph.iterator.ExpressionSubGraphIterator
  • cascading.flow.planner.iso.subgraph.iterator.IncludeRemainderSubGraphIterator
  • cascading.flow.planner.iso.subgraph.partitioner.ExpressionGraphPartitioner
  • cascading.flow.planner.iso.subgraph.Partitions
  • cascading.flow.planner.iso.transformer.AnnotateGraphTransformer
  • cascading.flow.planner.iso.transformer.RecursiveGraphTransformer
  • cascading.flow.planner.iso.transformer.SubGraphTransformer
  • cascading.flow.planner.process.FlowStepGraph
    • 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.