ContextEntry[] contextEntry = bm.getContext();
BetaConstraints constraints = notNode.getRawConstraints();
FastIterator rightIt = notNode.getRightIterator( rtm );
for ( LeftTuple leftTuple = srcLeftTuples.getUpdateFirst(); leftTuple != null; ) {
LeftTuple next = leftTuple.getStagedNext();
PropagationContext context = leftTuple.getPropagationContext();
RightTuple firstRightTuple = notNode.getFirstRightTuple( leftTuple, rtm, context, rightIt );
// If in memory, remove it, because we'll need to add it anyway if it's not blocked, to ensure iteration order
RightTuple blocker = leftTuple.getBlocker();
if ( blocker == null ) {
ltm.remove( leftTuple );
} else {
// check if we changed bucket
if ( rtm.isIndexed() && !rightIt.isFullIterator() ) {
// if newRightTuple is null, we assume there was a bucket change and that bucket is empty
if ( firstRightTuple == null || firstRightTuple.getMemory() != blocker.getMemory() ) {
removeBlocker( leftTuple, blocker );
blocker = null;
}
}
}
constraints.updateFromTuple( contextEntry,
wm,
leftTuple );
// if we where not blocked before (or changed buckets), or the previous blocker no longer blocks, then find the next blocker
if ( blocker == null || !constraints.isAllowedCachedLeft( contextEntry,
blocker.getFactHandle() ) ) {
if ( blocker != null ) {
// remove previous blocker if it exists, as we know it doesn't block any more
removeBlocker( leftTuple, blocker );
}
// find first blocker, because it's a modify, we need to start from the beginning again
for ( RightTuple newBlocker = firstRightTuple; newBlocker != null; newBlocker = (RightTuple) rightIt.next( newBlocker ) ) {
if ( constraints.isAllowedCachedLeft( contextEntry,
newBlocker.getFactHandle() ) ) {
leftTuple.setBlocker( newBlocker );
newBlocker.addBlocked( leftTuple );
break;
}
}
LeftTuple childLeftTuple = leftTuple.getFirstChild();
if ( leftTuple.getBlocker() != null ) {
// blocked
if ( leftTuple.getFirstChild() != null ) {
// blocked, with previous children, so must have not been previously blocked, so retract
// no need to remove, as we removed at the start
// to be matched against, as it's now blocked
deleteRightChild( childLeftTuple, trgLeftTuples, stagedLeftTuples );
} // else: it's blocked now and no children so blocked before, thus do nothing
} else if ( childLeftTuple == null ) {
// not blocked, with no children, must have been previously blocked so assert
ltm.add( leftTuple ); // add to memory so other fact handles can attempt to match
trgLeftTuples.addInsert( sink.createLeftTuple( leftTuple,
sink,
tupleMemory ) );
} else {
switch ( childLeftTuple.getStagedType() ) {
// handle clash with already staged entries
case LeftTuple.INSERT :
stagedLeftTuples.removeInsert( childLeftTuple );
break;
case LeftTuple.UPDATE :
stagedLeftTuples.removeUpdate( childLeftTuple );
break;
}
// not blocked, with children, so wasn't previous blocked and still isn't so modify
ltm.add( leftTuple ); // add to memory so other fact handles can attempt to match
trgLeftTuples.addUpdate( childLeftTuple );
childLeftTuple.reAddLeft();
}
}
leftTuple.clearStaged();
leftTuple = next;
}