Examples of addDelete()

Examples of org.drools.common.LeftTupleSets.addDelete()

335
336
337
338
339
340
341
342
343
344
345
                if ( sm.getStagedLeftTuples().deleteSize() == 0 ) {
                    // staged is empty, so notify rule, to force re-evaluation
                    sm.notifyRuleLinkSegment( wm );
                }
                leftTuple.setPropagationContext( context );
                leftTuples.addDelete( leftTuple );
            }
        }

        if ( lm.getAndDecreaseCounter() == 1 ) {
            lm.unlinkNode( wm );
View Full Code Here

Examples of org.drools.common.RightTupleSets.addDelete()

359
360
361
362
363
364
365
366
367
368
369
        } else if ( stagedRightTuples.deleteSize() == 0 ) {
            // nothing staged before, notify rule, so it can evaluate network
            memory.getSegmentMemory().notifyRuleLinkSegment( wm );
        }
       
        stagedRightTuples.addDelete( rightTuple );
    }  
   
    public void doUpdateRightTuple(final RightTuple rightTuple,
                                    final InternalWorkingMemory wm,
                                    final BetaMemory memory) {
View Full Code Here

Examples of org.drools.common.StagedLeftTuples.addDelete()

51
52
53
54
55
56
57
58
59
60
61
                                break;
                            case LeftTuple.UPDATE:
                                stagedLeftTuples.removeUpdate( peer );
                                break;
                        } 
                        stagedLeftTuples.addDelete( peer );
                        smem = smem.getNext();
                    }
                }
            }
            firstSmem.getStagedLeftTuples().addAllDeletes( leftTuples.getDeleteFirst() );
View Full Code Here

Examples of org.drools.common.StagedRightTuples.addDelete()

325
326
327
328
329
330
331
332
333
334
335
                    break;
                case LeftTuple.UPDATE:
                    stagedRightTuples.removeUpdate( rightTuple );
                    break;
            } 
            stagedRightTuples.addDelete( rightTuple );        
            if ( bm.getDecAndGetCounter() == 0 && !isRightInputIsRiaNode() ) {
                bm.unlinkNode( workingMemory );           
            }             
            return;
        }
View Full Code Here

Examples of org.drools.common.StagedRightTuples.addDelete()

224
225
226
227
228
229
230
231
232
233
234
                    break;
                case LeftTuple.UPDATE:
                    stagedRightTuples.removeUpdate( rightTuple );
                    break;
            } 
            stagedRightTuples.addDelete( rightTuple );        
            if ( memory.getDecAndGetCounter() == 0 && !isRightInputIsRiaNode() ) {
                memory.unlinkNode( workingMemory );           
            }             
            return;
        }     
View Full Code Here

Examples of org.drools.common.StagedRightTuples.addDelete()

221
222
223
224
225
226
227
228
229
230
231
                    break;
                case LeftTuple.UPDATE:
                    stagedRightTuples.removeUpdate( rightTuple );
                    break;
            } 
            stagedRightTuples.addDelete( rightTuple );
           
            if (  memory.getDecAndGetCounter() == 0 && !isRightInputIsRiaNode() && isEmptyBetaConstraints()  ) {
                // NotNodes can only be unlinked, if they have no variable constraints
                // unlink node. Ignore right input adapters, as these will link the betanode via the RiaRuleSegments
                memory.linkNode( workingMemory );
View Full Code Here

Examples of org.drools.core.common.LeftTupleSets.addDelete()

406
407
408
409
410
411
412
413
414
415
416
                    break;
                case LeftTuple.UPDATE :
                    leftTuples.removeUpdate( childLeftTuple );
                    break;
            }
            leftTuples.addDelete( childLeftTuple  );
            childLeftTuple.unlinkFromRightParent();
            childLeftTuple.unlinkFromLeftParent();
        }

        public void rowUpdated(final Rule rule,
View Full Code Here

Examples of org.drools.core.common.LeftTupleSets.addDelete()

333
334
335
336
337
338
339
340
341
342
343
            sm.getTupleQueue().add(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), propagationType));
            if ( log.isTraceEnabled() ) {
                log.trace( "LeftInputAdapterNode delete size={}  queue={} pctx={} lt={}", System.identityHashCode( sm.getTupleQueue() ), sm.getTupleQueue().size(), PhreakPropagationContext.intEnumToString(pctx), leftTuple );
            }
        } else {
            stagedDeleteWasEmpty = leftTuples.addDelete(leftTuple);
        }

        if (  stagedDeleteWasEmpty && linkOrNotify ) {
            // staged is empty, so notify rule, to force re-evaluation
            lm.setNodeDirty(wm);
View Full Code Here

Examples of org.drools.core.common.LeftTupleSets.addDelete()

224
225
226
227
228
229
230
231
232
233
234
                        tuples.addUpdate(tupleEntry.getLeftTuple());
                        break;
                    case PropagationContext.DELETION:
                    case PropagationContext.EXPIRATION:
                    case PropagationContext.RULE_REMOVAL:
                        tuples.addDelete(tupleEntry.getLeftTuple());
                        break;
                }
            } else {
                BetaMemory bm = (BetaMemory) tupleEntry.getNodeMemory();
                tupleEntry.getRightTuple().setPropagationContext(tupleEntry.getPropagationContext());
View Full Code Here

Examples of org.drools.core.common.LeftTupleSets.addDelete()

224
225
226
227
228
229
230
231
232
233
234
                        tuples.addUpdate(tupleEntry.getLeftTuple());
                        break;
                    case PropagationContext.DELETION:
                    case PropagationContext.EXPIRATION:
                    case PropagationContext.RULE_REMOVAL:
                        tuples.addDelete(tupleEntry.getLeftTuple());
                        break;
                }
            } else {
                BetaMemory bm = (BetaMemory) tupleEntry.getNodeMemory();
                tupleEntry.getRightTuple().setPropagationContext(tupleEntry.getPropagationContext());
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.