Package org.drools.core.phreak

Examples of org.drools.core.phreak.LeftTupleEntry

264
265
266
267
268
269
270
271
272
273
274
        // mask check is necessary if insert is a result of a modify
        if ( liaNode.isStreamMode() && sm.getTupleQueue() != null ) {
            stagedInsertWasEmpty = sm.getTupleQueue().isEmpty();
            int propagationType = pctx.getType() == PropagationContext.MODIFICATION ? PropagationContext.INSERTION : pctx.getType();
            sm.getTupleQueue().add(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), propagationType));

            if ( log.isTraceEnabled() ) {
                log.trace( "LeftInputAdapterNode insert size={}  queue={} pctx={} lt={}", System.identityHashCode( sm.getTupleQueue() ), sm.getTupleQueue().size(), PhreakPropagationContext.intEnumToString(pctx), leftTuple);
            }
        }  else {
View Full Code Here
328
329
330
331
332
333
334
335
336
337
338
        boolean stagedDeleteWasEmpty = false;
        if ( ((BaseNode)sm.getRootNode()).isStreamMode() && sm.getTupleQueue() != null ) {
            stagedDeleteWasEmpty = sm.getTupleQueue().isEmpty();
            int propagationType = pctx.getType() == PropagationContext.MODIFICATION ? PropagationContext.DELETION : pctx.getType();
            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);
View Full Code Here
387
388
389
390
391
392
393
394
395
396
397
                // if LeftTuple is already staged, leave it there
                leftTuple.setPropagationContext( pctx );
                boolean stagedUpdateWasEmpty = false;
                if ( ((BaseNode)sm.getRootNode()).isStreamMode() && sm.getTupleQueue() != null ) {
                    stagedUpdateWasEmpty = sm.getTupleQueue().isEmpty();
                    sm.getTupleQueue().add(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), pctx.getType()));
                } else {
                    stagedUpdateWasEmpty = leftTuples.addUpdate(leftTuple);
                }

                if ( stagedUpdateWasEmpty  && linkOrNotify ) {
View Full Code Here
265
266
267
268
269
270
271
272
273
274
275
        boolean stagedInsertWasEmpty = false;

        // mask check is necessary if insert is a result of a modify
        if ( liaNode.isStreamMode() && sm.getStreamQueue() != null ) {
            int propagationType = pctx.getType() == PropagationContext.MODIFICATION ? PropagationContext.INSERTION : pctx.getType();
            stagedInsertWasEmpty = sm.getStreamQueue().addInsert(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), propagationType));

            if ( log.isTraceEnabled() ) {
                log.trace( "LeftInputAdapterNode insert size={}  queue={} pctx={} lt={}", System.identityHashCode( sm.getStreamQueue() ), sm.getStreamQueue().size(), PhreakPropagationContext.intEnumToString(pctx), leftTuple);
            }
        }  else {
View Full Code Here
328
329
330
331
332
333
334
335
336
337
338
        leftTuple.setPropagationContext( pctx );

        boolean stagedDeleteWasEmpty = false;
        if ( ((BaseNode)sm.getRootNode()).isStreamMode() && sm.getStreamQueue() != null ) {
            int propagationType = pctx.getType() == PropagationContext.MODIFICATION ? PropagationContext.DELETION : pctx.getType();
            stagedDeleteWasEmpty = sm.getStreamQueue().addDelete(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), propagationType));
            if ( log.isTraceEnabled() ) {
                log.trace( "LeftInputAdapterNode delete size={}  queue={} pctx={} lt={}", System.identityHashCode( sm.getStreamQueue() ), sm.getStreamQueue().size(), PhreakPropagationContext.intEnumToString(pctx), leftTuple );
            }
            registerUnlinkedPaths(wm, sm, stagedDeleteWasEmpty);
        } else {
View Full Code Here
387
388
389
390
391
392
393
394
395
396
397
            if ( leftTuple.getStagedType() == LeftTuple.NONE ) {
                // if LeftTuple is already staged, leave it there
                leftTuple.setPropagationContext( pctx );
                boolean stagedUpdateWasEmpty = false;
                if ( ((BaseNode)sm.getRootNode()).isStreamMode() && sm.getStreamQueue() != null ) {
                    stagedUpdateWasEmpty = sm.getStreamQueue().addUpdate(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), pctx.getType()));
                } else {
                    stagedUpdateWasEmpty = leftTuples.addUpdate(leftTuple);
                }

                if ( stagedUpdateWasEmpty  && linkOrNotify ) {
View Full Code Here
262
263
264
265
266
267
268
269
270
271
272
        boolean stagedInsertWasEmpty = false;

        // mask check is necessary if insert is a result of a modify
        if ( liaNode.isStreamMode() && sm.getStreamQueue() != null ) {
            int propagationType = pctx.getType() == PropagationContext.MODIFICATION ? PropagationContext.INSERTION : pctx.getType();
            stagedInsertWasEmpty = sm.getStreamQueue().addInsert(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), propagationType));

            if ( log.isTraceEnabled() ) {
                log.trace( "LeftInputAdapterNode insert size={}  queue={} pctx={} lt={}", System.identityHashCode( sm.getStreamQueue() ), sm.getStreamQueue().size(), PhreakPropagationContext.intEnumToString(pctx), leftTuple);
            }
        }  else {
View Full Code Here
325
326
327
328
329
330
331
332
333
334
335
        leftTuple.setPropagationContext( pctx );

        boolean stagedDeleteWasEmpty = false;
        if ( ((BaseNode)sm.getRootNode()).isStreamMode() && sm.getStreamQueue() != null ) {
            int propagationType = pctx.getType() == PropagationContext.MODIFICATION ? PropagationContext.DELETION : pctx.getType();
            stagedDeleteWasEmpty = sm.getStreamQueue().addDelete(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), propagationType));
            if ( log.isTraceEnabled() ) {
                log.trace( "LeftInputAdapterNode delete size={}  queue={} pctx={} lt={}", System.identityHashCode( sm.getStreamQueue() ), sm.getStreamQueue().size(), PhreakPropagationContext.intEnumToString(pctx), leftTuple );
            }
            registerUnlinkedPaths(wm, sm, stagedDeleteWasEmpty);
        } else {
View Full Code Here
384
385
386
387
388
389
390
391
392
393
394
            if ( leftTuple.getStagedType() == LeftTuple.NONE ) {
                // if LeftTuple is already staged, leave it there
                leftTuple.setPropagationContext( pctx );
                boolean stagedUpdateWasEmpty = false;
                if ( ((BaseNode)sm.getRootNode()).isStreamMode() && sm.getStreamQueue() != null ) {
                    stagedUpdateWasEmpty = sm.getStreamQueue().addUpdate(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), pctx.getType()));
                } else {
                    stagedUpdateWasEmpty = leftTuples.addUpdate(leftTuple);
                }

                if ( stagedUpdateWasEmpty  && linkOrNotify ) {
View Full Code Here
265
266
267
268
269
270
271
272
273
274
275
        // mask check is necessary if insert is a result of a modify
        if ( liaNode.isStreamMode() && sm.getTupleQueue() != null ) {
            stagedInsertWasEmpty = sm.getTupleQueue().isEmpty();
            int propagationType = pctx.getType() == PropagationContext.MODIFICATION ? PropagationContext.INSERTION : pctx.getType();
            sm.getTupleQueue().add(new LeftTupleEntry(leftTuple, pctx, sm.getNodeMemories().getFirst(), propagationType));

            if ( log.isTraceEnabled() ) {
                log.trace( "LeftInputAdapterNode insert size={}  queue={} pctx={} lt={}", System.identityHashCode( sm.getTupleQueue() ), sm.getTupleQueue().size(), PhreakPropagationContext.intEnumToString(pctx), leftTuple);
            }
        }  else {
View Full Code Here
TOP

Related Classes of org.drools.core.phreak.LeftTupleEntry

  • org.drools.core.reteoo.LeftInputAdapterNode
    • Copyright © 2018 www.massapicom. 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.