Package org.drools.core.common

Examples of org.drools.core.common.RightTupleSets.addUpdate()

660
661
662
663
664
665
666
667
668
669
670
        for (LeftTuple leftTuple = srcTuples.getUpdateFirst(); leftTuple != null; ) {
            LeftTuple next = leftTuple.getStagedNext();

            RightTuple rightTuple = (RightTuple) leftTuple.getObject();
            RightTupleSets rightTuples = bm.getStagedRightTuples();
            rightTuples.addUpdate(rightTuple);

            if (bns != null) {
                // Add peered RightTuples, they are attached to FH - unlink LeftTuples that has a peer ref
                for (int i = 0; i < length; i++) {
                    rightTuple = rightTuple.getHandleNext();
View Full Code Here
667
668
669
670
671
672
673
674
675
676
677
            if (bns != null) {
                // Add peered RightTuples, they are attached to FH - unlink LeftTuples that has a peer ref
                for (int i = 0; i < length; i++) {
                    rightTuple = rightTuple.getHandleNext();
                    rightTuples = bms[i].getStagedRightTuples();
                    rightTuples.addUpdate(rightTuple);
                }
            }

            leftTuple.clearStaged();
            leftTuple = next;
View Full Code Here
393
394
395
396
397
398
399
400
401
402
403
        boolean stagedUpdateWasEmpty = false;
        if ( streamMode ) {
            stagedUpdateWasEmpty = memory.getSegmentMemory().getTupleQueue().isEmpty();
            memory.getSegmentMemory().getTupleQueue().add(new RightTupleEntry(rightTuple, rightTuple.getPropagationContext(), memory ));
        } else {
            stagedUpdateWasEmpty = stagedRightTuples.addUpdate( rightTuple );
        }

        if ( stagedUpdateWasEmpty  ) {
            memory.getSegmentMemory().notifyRuleLinkSegment( wm );
        }
View Full Code Here
371
372
373
374
375
376
377
378
379
380
381
           memory.getSegmentMemory().notifyRuleLinkSegment( wm );
       }
      
       if ( rightTuple.getStagedType() == LeftTuple.NONE ) {
           // only stage, if it's not already staged
           stagedRightTuples.addUpdate( rightTuple );
       }      
   }     
   

    public boolean isRightInputIsRiaNode() {
View Full Code Here
617
618
619
620
621
622
623
624
625
626
627
                case LeftTuple.UPDATE: {
                    rightTuples.removeUpdate(rightTuple);
                    break;
                }
            }
            rightTuples.addUpdate(rightTuple);

            if (bns != null) {
                // Add peered RightTuples, they are attached to FH - unlink LeftTuples that has a peer ref
                for (int i = 0; i < length; i++) {
                    rightTuple = rightTuple.getHandleNext();
View Full Code Here
634
635
636
637
638
639
640
641
642
643
644
                        case LeftTuple.UPDATE: {
                            rightTuples.removeUpdate(rightTuple);
                            break;
                        }
                    }
                    rightTuples.addUpdate(rightTuple);
                }
            }

            leftTuple.clearStaged();
            leftTuple = next;
View Full Code Here
387
388
389
390
391
392
393
394
395
396
397
        if ( streamMode ) {
            stagedUpdateWasEmpty = memory.getSegmentMemory().getTupleQueue().isEmpty();
            PropagationContext pctx = rightTuple.getPropagationContext();
            memory.getSegmentMemory().getTupleQueue().add(new RightTupleEntry(rightTuple, pctx, memory, pctx.getType()));
        } else {
            stagedUpdateWasEmpty = stagedRightTuples.addUpdate( rightTuple );
        }

        if ( stagedUpdateWasEmpty  ) {
            memory.setNodeDirty( wm );
        }
View Full Code Here
489
490
491
492
493
494
495
496
497
498
499
                        case PropagationContext.INSERTION:
                        case PropagationContext.RULE_ADDITION:
                            rightTuples.addInsert( rightTuple );
                            break;
                        case PropagationContext.MODIFICATION:
                            rightTuples.addUpdate( rightTuple );
                            break;
                        case PropagationContext.DELETION:
                        case PropagationContext.RULE_REMOVAL:
                             rightTuples.addDelete( rightTuple );
                        break;
View Full Code Here
711
712
713
714
715
716
717
718
719
720
721
                case LeftTuple.UPDATE: {
                    rightTuples.removeUpdate(rightTuple);
                    break;
                }
            }
            rightTuples.addUpdate(rightTuple);

            if (bns != null) {
                // Add peered RightTuples, they are attached to FH - unlink LeftTuples that has a peer ref
                for (int i = 0; i < length; i++) {
                    rightTuple = rightTuple.getHandleNext();
View Full Code Here
728
729
730
731
732
733
734
735
736
737
738
                        case LeftTuple.UPDATE: {
                            rightTuples.removeUpdate(rightTuple);
                            break;
                        }
                    }
                    rightTuples.addUpdate(rightTuple);
                }
            }

            leftTuple.clearStaged();
            leftTuple = 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.