Package cascading.flow.stream.duct

Examples of cascading.flow.stream.duct.Duct

202
203
204
205
206
207
208
209
210
211
212
    return flowProcess.mergeMapIntoConfig( conf, priorConf );
    }

  private InputSource handleHead( FlowElement source, FlowProcess flowProcess )
    {
    Duct sourceDuct;

    if( source instanceof Tap )
      sourceDuct = createSourceStage( (Tap) source, flowProcess );
    else if( source instanceof Merge )
      sourceDuct = createMergeStage( (Merge) source, IORole.source );
View Full Code Here
205
206
207
208
209
210
211
212
213
214
215
    LinkedList<Duct> successors = new LinkedList<Duct>( Graphs.successorListOf( ductGraph, current ) );
    ListIterator<Duct> iterator = successors.listIterator();

    while( iterator.hasNext() )
      {
      Duct successor = iterator.next();

      if( successor == getHEAD() )
        throw new IllegalStateException( "HEAD may not be next" );

      if( successor == getTAIL() ) // tail is not included, its just a marker
View Full Code Here
224
225
226
227
228
229
230
231
232
233
234
    LinkedList<Duct> predecessors = new LinkedList<Duct>( Graphs.predecessorListOf( ductGraph, current ) );
    ListIterator<Duct> iterator = predecessors.listIterator();

    while( iterator.hasNext() )
      {
      Duct successor = iterator.next();

      if( successor == getTAIL() )
        throw new IllegalStateException( "TAIL may not be successor" );

      if( successor == getHEAD() ) // head is not included, its just a marker
View Full Code Here
258
259
260
261
262
263
264
265
266
267
268
    Set<DuctGraph.Ordinal> edges = ductGraph.outgoingEdgesOf( current );

    if( edges.size() == 0 )
      throw new IllegalStateException( "ducts must have an outgoing edge, current: " + current );

    Duct next = ductGraph.getEdgeTarget( edges.iterator().next() );

    if( current instanceof Gate )
      {
      if( !( current instanceof Window ) ) // just collapse - Merge
        {
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
131
      else if( !isSource && isSink )
        role = IORole.sink;
      else if( isSource && isSink )
        role = IORole.both;

      Duct newRhsDuct = createDuctFor( rhsElement, role );
      Duct rhsDuct = findExisting( newRhsDuct );

      int ordinal = findEdgeOrdinal( lhsDuct, rhsDuct );

      addPath( lhsDuct, ordinal, rhsDuct );
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
    throw new IllegalStateException( "could not find ordinal, too many edges between elements" );
    }

  private Duct createDuctFor( FlowElement element, IORole role )
    {
    Duct rhsDuct;

    if( element instanceof Each )
      {
      Each eachElement = (Each) element;
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
  protected void buildGraph()
    {
    Group group = (Group) Util.getFirst( node.getSourceElements() );

    Duct rhsDuct;

    if( group.isGroupBy() )
      rhsDuct = new HadoopGroupByGate( flowProcess, (GroupBy) group, IORole.source );
    else
      rhsDuct = new HadoopCoGroupGate( flowProcess, (CoGroup) group, IORole.source );
View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
      {
      try
        {
        while( iterator.hasNext() )
          {
          Duct next = iterator.next();

          if( next != streamedHead )
            ( (InputSource) next ).run( null );
          }
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
      {
      try
        {
        while( iterator.hasNext() )
          {
          Duct next = iterator.next();

          if( next != streamedHead )
            ( (SourceStage) next ).run( null );
          }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
  protected void buildGraph()
    {
    for( Object rhsElement : node.getSourceTaps() )
      {
      Duct rhsDuct = new SourceStage( tapFlowProcess( (Tap) rhsElement ), (Tap) rhsElement );

      addHead( rhsDuct );

      handleDuct( (FlowElement) rhsElement, rhsDuct );
      }
View Full Code Here
TOP

Related Classes of cascading.flow.stream.duct.Duct

  • cascading.flow.hadoop.FlowMapper
  • cascading.flow.hadoop.stream.graph.HadoopReduceStreamGraph
  • cascading.flow.local.stream.graph.LocalStepStreamGraph
  • cascading.flow.stream.graph.NodeStreamGraph
  • cascading.flow.stream.graph.StreamGraph
  • cascading.flow.tez.FlowProcessor
  • cascading.flow.tez.stream.graph.Hadoop2TezStreamGraph
    • 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.