Examples of TupleEntryQueue

Examples of org.drools.core.common.TupleEntryQueue

239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
    }

    public synchronized void reEvaluateNetwork(InternalWorkingMemory wm, LinkedList<StackEntry> outerStack, boolean fireUntilHalt) {
        if (isDirty() || (pmem.getStreamQueue() != null && !pmem.getStreamQueue().isEmpty())) {
            setDirty(false);
            TupleEntryQueue queue = pmem.getStreamQueue() != null ? pmem.getStreamQueue().takeAllForFlushing() : null;

            if ( queue == null || queue.isEmpty() ) {
                NETWORK_EVALUATOR.evaluateNetwork(pmem, outerStack, this, wm);
            } else {
                while (!queue.isEmpty()) {
                    removeQueuedTupleEntry( queue );
                    NETWORK_EVALUATOR.evaluateNetwork(pmem, outerStack, this, wm);
                }
            }
        }
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
            tupleEntry = tupleQueue.remove();
        }
    }

    private List<TupleEntry> flushStreamQueue() {
        TupleEntryQueue tupleQueue = pmem.getStreamQueue().takeAllForFlushing();
        if (tupleQueue == null || tupleQueue.isEmpty()) {
            return Collections.emptyList();
        }
        List<TupleEntry> nonNormalizedDeletes = new ArrayList<TupleEntry>();
        while (!tupleQueue.isEmpty()) {
            TupleEntry tupleEntry = tupleQueue.remove();
            if ( processStreamTupleEntry( tupleQueue, tupleEntry ) ) {
                nonNormalizedDeletes.add(tupleEntry);
            }
        }
        return nonNormalizedDeletes;
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

289
290
291
292
293
294
295
296
297
298
299
        return nonNormalizedDeletes;
    }

    public static void flushTupleQueue( StreamTupleEntryQueue streamQueue ) {
        if ( streamQueue != null ) {
            TupleEntryQueue tupleQueue = streamQueue.takeAllForFlushing();
            while (!tupleQueue.isEmpty()) {
                processStreamTupleEntry( tupleQueue, tupleQueue.remove() );
            }
        }
    }
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
    }

    public synchronized void reEvaluateNetwork(InternalWorkingMemory wm, LinkedList<StackEntry> outerStack, boolean fireUntilHalt) {
        if (isDirty() || (pmem.getStreamQueue() != null && !pmem.getStreamQueue().isEmpty())) {
            setDirty(false);
            TupleEntryQueue queue = pmem.getStreamQueue() != null ? pmem.getStreamQueue().takeAllForFlushing() : null;

            if ( queue == null || queue.isEmpty() ) {
                NETWORK_EVALUATOR.evaluateNetwork(pmem, outerStack, this, wm);
            } else {
                while (!queue.isEmpty()) {
                    removeQueuedTupleEntry( queue );
                    NETWORK_EVALUATOR.evaluateNetwork(pmem, outerStack, this, wm);
                }
            }
        }
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
            tupleEntry = tupleQueue.remove();
        }
    }

    private List<TupleEntry> flushStreamQueue() {
        TupleEntryQueue tupleQueue = pmem.getStreamQueue().takeAllForFlushing();
        if (tupleQueue == null || tupleQueue.isEmpty()) {
            return Collections.emptyList();
        }
        List<TupleEntry> nonNormalizedDeletes = new ArrayList<TupleEntry>();
        while (!tupleQueue.isEmpty()) {
            TupleEntry tupleEntry = tupleQueue.remove();
            if ( processStreamTupleEntry( tupleQueue, tupleEntry ) ) {
                nonNormalizedDeletes.add(tupleEntry);
            }
        }
        return nonNormalizedDeletes;
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

258
259
260
261
262
263
264
265
266
267
268
        return nonNormalizedDeletes;
    }

    public static void flushTupleQueue( StreamTupleEntryQueue streamQueue ) {
        if ( streamQueue != null ) {
            TupleEntryQueue tupleQueue = streamQueue.takeAllForFlushing();
            while (!tupleQueue.isEmpty()) {
                processStreamTupleEntry( tupleQueue, tupleQueue.remove() );
            }
        }
    }
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

100
101
102
103
104
105
106
107
108
109
110
        while (true) {
            nodeTypesInSegment = updateNodeTypesMask(tupleSource, nodeTypesInSegment);
            if ( tupleSource.isStreamMode() && smem.getTupleQueue() == null ) {
                // need to make sure there is one Queue, for the rule, when a stream mode node is found.

                TupleEntryQueue queue = initAndGetTupleQueue(tupleSource, wm);
                smem.setTupleQueue( queue );
            }
            if (NodeTypeEnums.isBetaNode(tupleSource)) {
                allLinkedTestMask = processBetaNode(tupleSource, wm, smem, nodePosMask, allLinkedTestMask, updateNodeBit);
            } else {
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

476
477
478
479
480
481
482
483
484
485
486
            }
        }  else {
            sink = (LeftTupleSink)node;
        }

        TupleEntryQueue queue = null;
        if (NodeTypeEnums.RightInputAdaterNode == sink.getType()) {
            RightInputAdapterNode rian = (RightInputAdapterNode) sink;
            RiaNodeMemory riaMem =  (RiaNodeMemory) wm.getNodeMemory((MemoryFactory)sink);
            RiaPathMemory pmem = riaMem.getRiaPathMemory();
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

367
368
369
370
371
372
373
374
375
376
377
                }
            }

            if ( hasQueue && smem.getTupleQueue() == null ) {
                // need to make sure there is one Queue, for the rule, when a stream mode node is found.
                TupleEntryQueue queue = SegmentUtilities.initAndGetTupleQueue(smem.getTipNode(), wm);
                smem.setTupleQueue( queue );
            }

            if (hasSyncStagedLeftTuple) {
                smem.setStagedTuples( new SynchronizedLeftTupleSets() );
View Full Code Here

Examples of org.drools.core.common.TupleEntryQueue

185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
    }

    public synchronized void reEvaluateNetwork(InternalWorkingMemory wm, LinkedList<StackEntry> outerStack, boolean fireUntilHalt) {
        if (isDirty() || (pmem.getTupleQueue() != null && !pmem.getTupleQueue().isEmpty())) {
            setDirty(false);
            TupleEntryQueue queue = pmem.getTupleQueue() != null ? pmem.getTupleQueue().takeAll() : null;

            if ( queue == null || queue.isEmpty() ) {
                NETWORK_EVALUATOR.evaluateNetwork(pmem, outerStack, this, wm);
            } else {
                while (!queue.isEmpty()) {
                    removeQueuedTupleEntry( queue );
                    NETWORK_EVALUATOR.evaluateNetwork(pmem, outerStack, this, wm);
                }
            }
        }
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.