Package org.drools.util

Examples of org.drools.util.Iterator

196
197
198
199
200
201
202
203
204
205
206
207
208
209
                           final PropagationContext context,
                           final InternalWorkingMemory workingMemory) {

        final ObjectHashMap memory = (ObjectHashMap) workingMemory.getNodeMemory( this );

        final Iterator it = memory.iterator();

        // iterates over all propagated handles and assert them to the new sink
        for ( ObjectEntry entry = (ObjectEntry) it.next(); entry != null; entry = (ObjectEntry) it.next() ) {
            sink.assertObject( (InternalFactHandle) entry.getValue(),
                               context,
                               workingMemory );
        }
    }
View Full Code Here
218
219
220
221
222
223
224
225
226
227
228
229
       
        if ( !this.isInUse() ) {
            for ( int i = 0, length = workingMemories.length; i < length; i++ ) {
                ObjectHashMap memory = ( ObjectHashMap ) workingMemories[i].getNodeMemory( this );
               
                Iterator it = memory.iterator();
                for ( ObjectEntry entry = (ObjectEntry) it.next(); entry != null; entry = (ObjectEntry) it.next() ) {
                    LeftTuple leftTuple = ( LeftTuple ) entry.getKey();
                    leftTuple.unlinkFromLeftParent();
                    leftTuple.unlinkFromRightParent();                   
                   
                    InternalFactHandle handle = ( InternalFactHandle ) entry.getValue();
View Full Code Here
353
354
355
356
357
358
359
360
361
362
363
364
                            final InternalWorkingMemory[] workingMemories) {
        for ( int i = 0, length = workingMemories.length; i < length; i++ ) {
            final InternalWorkingMemory workingMemory = workingMemories[i];

            final TerminalNodeMemory memory = (TerminalNodeMemory) workingMemory.getNodeMemory( this );
            final Iterator it = memory.getTupleMemory().iterator();
            for ( LeftTuple leftTuple = (LeftTuple) it.next(); leftTuple != null; leftTuple = (LeftTuple) it.next() ) {
                final Activation activation = leftTuple.getActivation();

                if ( activation.isActivated() ) {
                    activation.remove();
                    ((EventSupport) workingMemory).getAgendaEventSupport().fireActivationCancelled( activation,
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
        final int index = fieldIndex.getIndex();

        final List sinks = new ArrayList();

        //iterate twice as custom iterator is immutable
        final Iterator mapIt = this.hashedSinkMap.newIterator();
        for ( ObjectHashMap.ObjectEntry e = (ObjectHashMap.ObjectEntry) mapIt.next(); e != null; ) {

            sinks.add( e.getValue() );
            e = (ObjectHashMap.ObjectEntry) mapIt.next();
        }

        for ( final java.util.Iterator iter = sinks.iterator(); iter.hasNext(); ) {
            final AlphaNode sink = (AlphaNode) iter.next();
            final AlphaNode alphaNode = sink;
View Full Code Here
384
385
386
387
388
389
390
391
392
393
394
395
                }
            }
        }

        if ( this.hashedSinkMap != null ) {
            final Iterator it = this.hashedSinkMap.newIterator();
            for ( ObjectEntry entry = (ObjectEntry) it.next(); entry != null; entry = (ObjectEntry) it.next() ) {
                final ObjectSink sink = (ObjectSink) entry.getValue();
                if (candidate.equals( sink )) {
                    return (BaseNode)sink;
                }
            }
View Full Code Here
412
413
414
415
416
417
418
419
420
421
422
423
                sinks[at++] = sink;
            }
        }

        if ( this.hashedSinkMap != null ) {
            final Iterator it = this.hashedSinkMap.newIterator();
            for ( ObjectEntry entry = (ObjectEntry) it.next(); entry != null; entry = (ObjectEntry) it.next() ) {
                sinks[at++] = (ObjectSink) entry.getValue();
            }
        }
        return sinks;
    }
View Full Code Here
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
                    memory = (( AccumulateMemory )object).betaMemory;
                } else {
                    memory = ( BetaMemory ) object;
                }
               
                Iterator it = memory.getLeftTupleMemory().iterator();
                for ( LeftTuple leftTuple = (LeftTuple) it.next(); leftTuple != null; leftTuple = (LeftTuple) it.next() ) {
                    leftTuple.unlinkFromLeftParent();
                    leftTuple.unlinkFromRightParent();
                }
               
                it = memory.getRightTupleMemory().iterator();
                for ( RightTuple rightTuple = (RightTuple) it.next(); rightTuple != null; rightTuple = (RightTuple) it.next() ) {
                    if ( rightTuple.getBlocked() != null ) {
                        // special case for a not, so unlink left tuple from here, as they aren't in the left memory
                        for ( LeftTuple leftTuple = (LeftTuple)rightTuple.getBlocked(); leftTuple != null; ) {
                            LeftTuple temp = leftTuple.getBlockedNext();
         
View Full Code Here
443
444
445
446
447
448
449
450
451
452
453
454
    public void updateSink(final LeftTupleSink sink,
                           final PropagationContext context,
                           final InternalWorkingMemory workingMemory) {
        final CollectMemory memory = (CollectMemory) workingMemory.getNodeMemory( this );

        final Iterator tupleIter = memory.betaMemory.getLeftTupleMemory().iterator();
        for ( LeftTuple leftTuple = (LeftTuple) tupleIter.next(); leftTuple != null; leftTuple = (LeftTuple) tupleIter.next() ) {
            CollectContext colctx = (CollectContext) memory.betaMemory.getCreatedHandles().get( leftTuple );
            if( colctx.propagated ) {
                sink.assertLeftTuple( new LeftTuple( leftTuple,
                                                     colctx.resultTuple,
                                                     sink,
View Full Code Here
459
460
461
462
463
464
465
466
467
468
469
        }
    }
   
    protected void doRemove(final InternalWorkingMemory workingMemory,
                            final CollectMemory memory) {
          Iterator it = memory.betaMemory.getCreatedHandles().iterator();
          for ( ObjectEntry entry = (ObjectEntry) it.next(); entry != null; entry = (ObjectEntry) it.next() ) {
              CollectContext ctx = ( CollectContext ) entry.getValue();
              workingMemory.getFactHandleFactory().destroyFactHandle( ctx.resultTuple.getFactHandle() );             
          }   
    }   
View Full Code Here
243
244
245
246
247
248
249
250
251
252
253
254
                           final PropagationContext context,
                           final InternalWorkingMemory workingMemory) {

        final EvalMemory memory = (EvalMemory) workingMemory.getNodeMemory( this );

        final Iterator it = memory.tupleMemory.iterator();
        for ( LeftTuple tuple = (LeftTuple) it.next(); tuple != null; tuple = (LeftTuple) it.next() ) {
            sink.assertLeftTuple( tuple,
                                  context,
                                  workingMemory );
        }
    }
View Full Code Here
TOP

Related Classes of org.drools.util.Iterator

  • org.drools.common.ArrayAgendaGroup
  • org.drools.common.RuleFlowGroupImpl
  • org.drools.reteoo.AccumulateNode
  • org.drools.reteoo.AlphaNetworkCompiler
  • org.drools.reteoo.AlphaNode
  • org.drools.reteoo.BetaNode
  • org.drools.reteoo.CollectNode
  • org.drools.reteoo.compiled.ObjectTypeNodeParser
  • org.drools.reteoo.CompositeObjectSinkAdapter
  • org.drools.reteoo.EntryPointNode
    • 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.