Examples of cascading.flow.FlowElement

cascading.flow.FlowElement
Interface FlowElement is a utility interface used internally to simplify DAG management. It is not intended for users to interact with these methods directly.

      {
      List<FlowElement> pathVertexList = Graphs.getPathVertexList( path );


      for( int i = 1; i < pathVertexList.size() - 1; i++ ) // skip the from and to, its a Tap or Group
        {
        FlowElement flowElement = pathVertexList.get( i );


        if( flowElement instanceof Tap || flowElement instanceof Group )
          {
          results.remove( path );
          break;

View Full Code Here

    for( Scope incoming : incomingScopes )
      {
      Set<Scope> outgoingScopes = elementGraph.outgoingEdgesOf( flowElement );


      // source -> incoming -> flowElement -> outgoing -> target
      FlowElement source = elementGraph.getEdgeSource( incoming );


      for( Scope outgoing : outgoingScopes )
        {
        FlowElement target = elementGraph.getEdgeTarget( outgoing );


        boolean isNonBlocking = outgoing.isNonBlocking();


        if( isJoin )
          isNonBlocking = isNonBlocking && incoming.isNonBlocking();

View Full Code Here


    elementGraph.addEdge( previousElement, flowElement, new Scope( name ) );


    for( Scope scope : outgoing )
      {
      FlowElement target = elementGraph.getEdgeTarget( scope );
      Scope foundScope = elementGraph.removeEdge( previousElement, target ); // remove scope


      if( foundScope != scope )
        throw new IllegalStateException( "did not remove proper scope" );

View Full Code Here


    graph.addEdge( flowElement, nextElement, new Scope( name ) );


    for( Scope scope : incoming )
      {
      FlowElement target = graph.getEdgeSource( scope );
      Scope foundScope = graph.removeEdge( target, nextElement ); // remove scope


      if( foundScope != scope )
        throw new IllegalStateException( "did not remove proper scope" );

View Full Code Here

    if( !elementGraph.containsVertex( replaceWith ) )
      elementGraph.addVertex( replaceWith );


    for( Scope scope : incoming )
      {
      FlowElement source = elementGraph.getEdgeSource( scope );
      elementGraph.removeEdge( source, replace ); // remove scope


      // drop edge between, if any
      if( source != replaceWith )
        elementGraph.addEdge( source, replaceWith, scope ); // add scope back
      }


    for( Scope scope : outgoing )
      {
      FlowElement target = elementGraph.getEdgeTarget( scope );
      elementGraph.removeEdge( replace, target ); // remove scope


      // drop edge between, if any
      if( target != replaceWith )
        elementGraph.addEdge( replaceWith, target, scope ); // add scope back

View Full Code Here


  private static Pipe find( String name, Iterator<FlowElement> iterator )
    {
    while( iterator.hasNext() )
      {
      FlowElement flowElement = iterator.next();


      if( flowElement instanceof Pipe && ( (Pipe) flowElement ).getName().equals( name ) )
        return (Pipe) flowElement;
      }

View Full Code Here

    return true;
    }


  private static void walkDown( Set<FlowElement> branch, ElementGraph elementGraph, FlowElement flowElement )
    {
    FlowElement current;
    current = flowElement;


    while( true )
      {
      if( !branch.contains( current ) && ( elementGraph.inDegreeOf( current ) != 1 || elementGraph.outDegreeOf( current ) != 1 ) )
        break;


      branch.add( current );


      FlowElement element = elementGraph.getEdgeTarget( getFirst( elementGraph.outgoingEdgesOf( current ) ) );


      if( element instanceof Extent || branch.contains( element ) )
        break;


      current = element;

View Full Code Here

      }
    }


  private static void walkUp( Set<FlowElement> branch, ElementGraph elementGraph, FlowElement flowElement )
    {
    FlowElement current = flowElement;


    while( true )
      {
      if( elementGraph.inDegreeOf( current ) != 1 || elementGraph.outDegreeOf( current ) != 1 )
        break;


      branch.add( current );


      FlowElement element = elementGraph.getEdgeSource( getFirst( elementGraph.incomingEdgesOf( current ) ) );


      if( element instanceof Extent || branch.contains( element ) )
        break;


      current = element;

View Full Code Here

    Set<String> checkpointNames = new HashSet<String>();


    // need to verify that only Extent instances are origins in this graph. Otherwise a Tap was not properly connected
    TopologicalOrderIterator<FlowElement, Scope> iterator = getTopologicalIterator();


    FlowElement flowElement = null;


    while( iterator.hasNext() )
      {
      try
        {

View Full Code Here

    {
    DepthFirstIterator<FlowElement, Scope> iterator = getDepthFirstIterator();


    while( iterator.hasNext() )
      {
      FlowElement element = iterator.next();


      if( !( element instanceof Pipe ) )
        continue;


      Pipe pipe = (Pipe) element;

View Full Code Here

0 1 2 3

TOP

Related Classes of cascading.flow.FlowElement

cascading.flow.hadoop.BuildJobsHadoopPlatformTest

cascading.flow.hadoop.planner.rule.scopeexpression.EquivalentTapsScopeExpression

cascading.flow.planner.BaseFlowStep

cascading.flow.planner.ElementGraph

cascading.flow.planner.graph.ElementGraphs

cascading.flow.planner.graph.ElementMultiGraph

cascading.flow.planner.graph.FlowElementGraph

cascading.flow.planner.iso.finder.GraphFinder

cascading.flow.planner.iso.finder.Match

cascading.flow.planner.iso.finder.State

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.