Package cascading.flow.planner.graph

Examples of cascading.flow.planner.graph.ElementGraph

339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
    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();

      List<ElementGraph> results = new ArrayList<>();

      for( ElementGraph child : children )
        {
        Transformed transformed = transformer.transform( plannerContext, child );

        writeTrace( ruleResult, phase, (Rule) transformer, parent, child, transformed );

        ElementGraph endGraph = transformed.getEndGraph();

        if( endGraph != null )
          results.add( endGraph );
        else
          results.add( child );
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
    Transformed contractedTransformed = graphTransformer.transform( plannerContext, rootGraph ); // contracted graph transform

    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
61
62
63
64
65
66
67
68
69
    Transformed child = graphTransformer.transform( transformed.getPlannerContext(), graph );

    transformed.addChildTransform( child );

    ElementGraph endGraph = child.getEndGraph();

    return makeAnnotated( endGraph );
    }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
      }

    if( LOG.isDebugEnabled() )
      LOG.debug( "preparing match within: {}", this.getClass().getSimpleName() );

    ElementGraph prepared = prepareForMatch( transformed, graph );

    if( LOG.isDebugEnabled() )
      LOG.debug( "completed match within: {}, with result: {}", this.getClass().getSimpleName(), prepared != null );

    if( prepared == null )
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
    if( isDisabled() )
      return;

    for( int i = 0; i < flowElementGraphs.size(); i++ )
      {
      ElementGraph flowElementGraph = flowElementGraphs.get( i );
      String name = String.format( "%02d-%s-%s-%04d.dot", phase.ordinal(), phase, subName, i );

      File file = new File( getTracePath(), name );

      LOG.info( "writing phase step trace: {}, to: {}", name, file );

      flowElementGraph.writeDOT( file.toString() );
      }
    }
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
        if( pipelineGraphs == null )
          continue;

        for( int i = 0; i < pipelineGraphs.size(); i++ )
          {
          ElementGraph flowElementGraph = pipelineGraphs.get( i );
          String name = String.format( "%02d-%s-%s-%04d-%04d-%04d.dot", phase.ordinal(), phase, subName, stepCount, nodeCount, i );

          File file = new File( getTracePath(), name );

          LOG.info( "writing phase node pipeline trace: {}, to: {}", name, file );

          flowElementGraph.writeDOT( file.toString() );
          }

        nodeCount++;
        }
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
      {
      List<? extends ElementGraph> flowElementGraphs = entry.getValue();

      for( int i = 0; i < flowElementGraphs.size(); i++ )
        {
        ElementGraph flowElementGraph = flowElementGraphs.get( i );
        String name = String.format( "%02d-%s-%s-%04d-%04d.dot", phase.ordinal(), phase, subName, stepCount, i );

        File file = new File( getTracePath(), name );

        LOG.info( "writing phase node trace: {}, to: {}", name, file );

        flowElementGraph.writeDOT( file.toString() );
        }

      stepCount++;
      }
    }
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
    SubGraphIterator stepIterator = wrapIterator( expressionIterator );

    while( stepIterator.hasNext() )
      {
      ElementGraph next = stepIterator.next();
      EnumMultiMap annotationMap = stepIterator.getAnnotationMap( annotations );

      annotatedSubGraphs.put( next, annotationMap );
      }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
    }

  @Override
  public ElementGraph next()
    {
    ElementGraph next = parentIterator.next();

    if( hasNext() )
      {
      maskedElements.addAll( next.vertexSet() );
      maskedScopes.addAll( next.edgeSet() ); // catches case with no elements on path

      return next;
      }

    maskedElements.removeAll( next.vertexSet() );
    maskedScopes.removeAll( next.edgeSet() );

    return new ElementMaskSubGraph( parentIterator.getElementGraph(), maskedElements, maskedScopes );
    }
View Full Code Here
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
    try
      {
      if( !hasNext() )
        throw new NoSuchElementException();

      ElementGraph contractedMatchedGraph = match.getMatchedGraph();

      Set<FlowElement> excludes = new HashSet<>( getContractedGraph().vertexSet() );

      excludes.removeAll( contractedMatchedGraph.vertexSet() );

      return asSubGraph( elementGraph, contractedMatchedGraph, excludes );
      }
    finally
      {
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.