Examples of org.drools.reteoo.LeftTupleSinkNodeList

org.drools.reteoo.LeftTupleSinkNodeList

This is a simple linked linked implementation. Each node must implement LinkedListNode

 so that it references the node before and after it. This way a node can be removed without having to scan the list to find it. This class does not provide an Iterator implementation as its designed for efficiency and not genericity. There are a number of ways to iterate the list.  Simple iterator: 
 for ( LinkedListNode node = list.getFirst(); node != null; node =  node.getNext() ) { } 
 Iterator that pops the first entry:  for ( LinkedListNode node = list.removeFirst(); node != null; node = list.removeFirst() ) { } 
@author Mark Proctor
@author Bob McWhirter

    public static void propagate(SegmentMemory sourceSegment, StagedLeftTuples stagedLeftTuples, InternalWorkingMemory wm) {
        LeftTupleSource source = sourceSegment.getTipNode();
        
        if ( sourceSegment.isEmpty() ) {
            // We know it's a Composite  
            LeftTupleSinkNodeList list = ((CompositeLeftTupleSinkAdapter)source.getSinkPropagator()).getRawSinks();
            for (LeftTupleSinkNode sink = list.getFirst(); sink != null; sink = sink.getNextLeftTupleSinkNode() ) {
                Memory memory = wm.getNodeMemories().getNodeMemory( ( MemoryFactory ) sink );
                SegmentMemory smem = memory.getSegmentMemory();
                sourceSegment.add( smem );
            }
        }

View Full Code Here

TOP

Related Classes of org.drools.reteoo.LeftTupleSinkNodeList

org.drools.phreak.SegmentPropagator

java.util.NoSuchElementException

java.util.Iterator

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.