Examples of vertexSet()

Examples of cascading.cascade.planner.TapGraph.vertexSet()

466
467
468
469
470
471
472
473
474
475
476
  public Collection<Tap> getSourceTaps()
    {
    TapGraph tapGraph = getTapGraph();
    Set<Tap> taps = new HashSet<Tap>();

    for( Tap tap : tapGraph.vertexSet() )
      {
      if( tapGraph.inDegreeOf( tap ) == 0 )
        taps.add( tap );
      }
View Full Code Here

Examples of cascading.cascade.planner.TapGraph.vertexSet()

491
492
493
494
495
496
497
498
499
500
501
  public Collection<Tap> getSinkTaps()
    {
    TapGraph tapGraph = getTapGraph();
    Set<Tap> taps = new HashSet<Tap>();

    for( Tap tap : tapGraph.vertexSet() )
      {
      if( tapGraph.outDegreeOf( tap ) == 0 )
        taps.add( tap );
      }
View Full Code Here

Examples of cascading.cascade.planner.TapGraph.vertexSet()

525
526
527
528
529
530
531
532
533
534
535
   * @return Collection<Flow>
   */
  public Collection<Tap> getIntermediateTaps()
    {
    TapGraph tapGraph = getTapGraph();
    Set<Tap> taps = new HashSet<Tap>( tapGraph.vertexSet() );

    taps.removeAll( getSourceTaps() );
    taps.removeAll( getSinkTaps() );

    return taps;
View Full Code Here

Examples of cascading.flow.iso.graph.StandardElementGraph.vertexSet()

91
92
93
94
95
96
97
98
99
100
101
    standardElementGraph.writeDOT( getPlanPath() + "/standard-before.dot" );

    Pipe pipe = ElementGraphs.findFirstPipeNamed( standardElementGraph, "remove" );

    int size = standardElementGraph.vertexSet().size();
    ElementGraphs.removeBranchContaining( standardElementGraph, pipe );

    standardElementGraph.writeDOT( getPlanPath() + "/standard-after.dot" );

    assertEquals( size - 3, standardElementGraph.vertexSet().size() );
View Full Code Here

Examples of cascading.flow.iso.graph.StandardElementGraph.vertexSet()

96
97
98
99
100
101
102
103
104
105
106
    int size = standardElementGraph.vertexSet().size();
    ElementGraphs.removeBranchContaining( standardElementGraph, pipe );

    standardElementGraph.writeDOT( getPlanPath() + "/standard-after.dot" );

    assertEquals( size - 3, standardElementGraph.vertexSet().size() );
    }

  @Test
  public void testRemoveBetweenBranchInclusive()
    {
View Full Code Here

Examples of cascading.flow.iso.graph.StandardElementGraph.vertexSet()

109
110
111
112
113
114
115
116
117
118
119
    standardElementGraph.writeDOT( getPlanPath() + "/standard-before.dot" );

    Pipe before = ElementGraphs.findFirstPipeNamed( standardElementGraph, "before" );
    Pipe after = ElementGraphs.findLastPipeNamed( standardElementGraph, "after" );

    int size = standardElementGraph.vertexSet().size();
    ElementGraphs.removeBranchBetween( standardElementGraph, before, after, true );

    standardElementGraph.writeDOT( getPlanPath() + "/standard-after.dot" );

    assertEquals( size - 7, standardElementGraph.vertexSet().size() );
View Full Code Here

Examples of cascading.flow.iso.graph.StandardElementGraph.vertexSet()

114
115
116
117
118
119
120
121
122
123
124
    int size = standardElementGraph.vertexSet().size();
    ElementGraphs.removeBranchBetween( standardElementGraph, before, after, true );

    standardElementGraph.writeDOT( getPlanPath() + "/standard-after.dot" );

    assertEquals( size - 7, standardElementGraph.vertexSet().size() );
    }

  @Test
  public void testRemoveBetweenBranchExclusive()
    {
View Full Code Here

Examples of cascading.flow.iso.graph.StandardElementGraph.vertexSet()

127
128
129
130
131
132
133
134
135
136
137
    standardElementGraph.writeDOT( getPlanPath() + "/standard-before.dot" );

    Pipe before = ElementGraphs.findFirstPipeNamed( standardElementGraph, "last*upper2" );
    Pipe after = ElementGraphs.findFirstPipeNamed( standardElementGraph, "after*last" );

    int size = standardElementGraph.vertexSet().size();
    ElementGraphs.removeBranchBetween( standardElementGraph, before, after, false );

    standardElementGraph.writeDOT( getPlanPath() + "/standard-after.dot" );

    assertEquals( size - 7, standardElementGraph.vertexSet().size() );
View Full Code Here

Examples of cascading.flow.iso.graph.StandardElementGraph.vertexSet()

132
133
134
135
136
137
138
139
140
141
142
    int size = standardElementGraph.vertexSet().size();
    ElementGraphs.removeBranchBetween( standardElementGraph, before, after, false );

    standardElementGraph.writeDOT( getPlanPath() + "/standard-after.dot" );

    assertEquals( size - 7, standardElementGraph.vertexSet().size() );
    }

  @Test
  public void testSubGraphIterator()
    {
View Full Code Here

Examples of cascading.flow.planner.graph.ElementGraph.vertexSet()

76
77
78
79
80
81
82
83
84
85
86
    {
    ElementGraph next = parentIterator.next();

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

      return next;
      }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.