Package cascading.flow.planner.graph

Examples of cascading.flow.planner.graph.ElementDirectedGraph

369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
    if( priorResults == null )
      return elementGraph;

    // the results are sub-graphs of the elementGraph, so guaranteed to exist in graph

    AnnotatedGraph resultGraph = new ElementDirectedGraph( elementGraph );

    for( ElementGraph result : priorResults )
      {
      if( !( result instanceof AnnotatedGraph ) || !( (AnnotatedGraph) result ).hasAnnotations() )
        continue;

      EnumMultiMap<FlowElement> annotations = ( (AnnotatedGraph) result ).getAnnotations();

      resultGraph.getAnnotations().addAll( annotations );
      }

    return (ElementGraph) resultGraph;
    }
View Full Code Here
49
50
51
52
53
54
55
56
57
    // need a safe copy
    if( elementGraph.containsVertex( Extent.head ) )
      elementGraph = new ElementMaskSubGraph( elementGraph, Extent.head, Extent.tail );

    annotatedSubGraphs.put( new ElementDirectedGraph( elementGraph ), new EnumMultiMap() );

    return new Partitions( this, elementGraph, annotatedSubGraphs );
    }
View Full Code Here
49
50
51
52
53
54
55
56
57
    {
    this.plannerContext = plannerContext;
    this.graphTransformer = graphTransformer;

    if( plannerContext.isTracingEnabled() )
      beginGraph = new ElementDirectedGraph( beginGraph );

    this.beginGraph = beginGraph;
    }
View Full Code Here
61
62
63
64
65
66
67
68
69
    this.plannerContext = plannerContext;
    this.graphTransformer = graphTransformer;
    this.expressionGraph = expressionGraph;

    if( plannerContext.isTracingEnabled() )
      beginGraph = new ElementDirectedGraph( beginGraph );

    this.beginGraph = beginGraph;
    }
View Full Code Here
132
133
134
135
136
137
138
  void addRecursionTransform( ElementGraph transformed )
    {
    recursionCount++;

    if( plannerContext.isTracingEnabled() )
      getRecursions().add( new ElementDirectedGraph( transformed ) );
    }
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
    for( int i = 0; i < subGraphs.size(); i++ )
      {
      ElementGraph subGraph = subGraphs.get( i );

      // want to write annotations with elements
      new ElementDirectedGraph( subGraph, annotatedSubGraphs.get( subGraph ) ).writeDOT( new File( path, makeFileName( count, i, "partition-result-sub-graph" ) ).toString() );

      if( contractedMatches.size() < i )
        contractedMatches.get( i ).getMatchedGraph().writeDOT( new File( path, makeFileName( count, i, "partition-contracted-graph" ) ).toString() );
      }
    }
View Full Code Here
TOP

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

  • cascading.flow.planner.iso.subgraph.partitioner.WholeGraphPartitioner
  • cascading.flow.planner.iso.subgraph.Partitions
  • cascading.flow.planner.iso.transformer.Transformed
  • cascading.flow.planner.rule.RuleExec
  • cascading.util.EnumMultiMap
    • 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.