Package cascading.flow.planner.iso.subgraph

Examples of cascading.flow.planner.iso.subgraph.Partitions

86
87
88
89
90
91
92
93
94
95
96
97
    return partition( plannerContext, elementGraph, null );
    }

  public Partitions partition( PlannerContext plannerContext, ElementGraph elementGraph, Collection<FlowElement> excludes )
    {
    Partitions partition = getGraphPartitioner().partition( plannerContext, elementGraph, excludes );

    if( partition != null )
      partition.setRulePartitioner( this );

    return partition;
    }
View Full Code Here
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
      for( ElementGraph child : priors )
        {
        ElementGraph priorAnnotated = annotateWithPriors( child, priors );

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

        writeTrace( ruleResult, phase, rule, parent, child, partitions );

        List<ElementGraph> results = makeBoundedOn( ruleResult.getAssemblyGraph(), partitions.getAnnotatedSubGraphs() );

        if( results.isEmpty() )
          continue;

        // ignore annotations on equality, but replace an newer graph with prior
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
      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 );

      List<ElementGraph> results = makeBoundedOn( ruleResult.getAssemblyGraph(), partitions.getAnnotatedSubGraphs() );

      // ignore annotations on equality, but replace an newer graph with prior
      IgnoreAnnotationsHashSet uniques = new IgnoreAnnotationsHashSet( results );

      if( uniques.size() != results.size() )
View Full Code Here
51
52
53
54
55
56
57
    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
86
87
88
89
90
91
92
      EnumMultiMap annotationMap = stepIterator.getAnnotationMap( annotations );

      annotatedSubGraphs.put( next, annotationMap );
      }

    return new Partitions( this, elementGraph, expressionIterator.getContractedGraph(), expressionIterator.getMatches(), annotatedSubGraphs );
    }
View Full Code Here
TOP

Related Classes of cascading.flow.planner.iso.subgraph.Partitions

  • cascading.flow.planner.graph.ElementDirectedGraph
  • cascading.flow.planner.graph.ElementGraph
  • cascading.flow.planner.iso.subgraph.partitioner.ExpressionGraphPartitioner
  • cascading.flow.planner.iso.subgraph.partitioner.WholeGraphPartitioner
  • cascading.flow.planner.rule.RuleExec
  • cascading.flow.planner.rule.RulePartitioner
  • java.io.File
    • 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.