Package org.drools.common

Examples of org.drools.common.Memory

59
60
61
62
63
64
65
66
67
    public void setTipNode(LeftTupleSource tipNode) {
        this.tipNode = tipNode;
    }

    public Memory createNodeMemory(MemoryFactory memoryFactory, InternalWorkingMemory wm) {
        Memory memory = wm.getNodeMemory( memoryFactory );       
        nodeMemories.add( memory );
        return memory;
    }
View Full Code Here
159
160
161
162
163
164
165
166
167
168
169
        StagedLeftTuples trgTuples = new StagedLeftTuples();
        StagedLeftTuples srcTuples = smem.getStagedLeftTuples();
        pLiaNode.doNode( liaNode, liaNodeMemory, wm, srcTuples, trgTuples );

        LeftTupleSource node = null;
        Memory nodeMem = null;
        if ( liaNode == smem.getTipNode() ) {
            // Segment only contains LiaNode, so need to propagate peers
            SegmentPropagator.propagate( smem, trgTuples, wm );
            smem = smems[smemIndex]; // 1
            nodeMem = smem.getNodeMemories().getFirst();
View Full Code Here
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
        InternalWorkingMemory wm = context.wm;
        NodeMemories memories = wm.getNodeMemories();
        // only some of the node memories require special serialization handling
        // so we iterate over all of them and process only those that require it
        for( int i = 0; i < memories.length(); i++ ) {
            Memory memory = memories.peekNodeMemory( i );
            // some nodes have no memory, so we need to check for nulls
            if( memory != null ) {
                ProtobufMessages.NodeMemory _node = null;
                switch( memory.getNodeType() ) {
                    case NodeTypeEnums.AccumulateNode : {
                        _node = writeAccumulateNodeMemory( i, memory );
                        break;
                    }
                    case NodeTypeEnums.RightInputAdaterNode : {
View Full Code Here
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
        InternalWorkingMemory wm = context.wm;
        NodeMemories memories = wm.getNodeMemories();
        // only some of the node memories require special serialization handling
        // so we iterate over all of them and process only those that require it
        for( int i = 0; i < memories.length(); i++ ) {
            Memory memory = memories.peekNodeMemory( i );
            // some nodes have no memory, so we need to check for nulls
            if( memory != null ) {
                ProtobufMessages.NodeMemory _node = null;
                switch( memory.getNodeType() ) {
                    case NodeTypeEnums.AccumulateNode : {
                        _node = writeAccumulateNodeMemory( i, memory );
                        break;
                    }
                    case NodeTypeEnums.RightInputAdaterNode : {
View Full Code Here
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
        InternalWorkingMemory wm = context.wm;
        NodeMemories memories = wm.getNodeMemories();
        // only some of the node memories require special serialization handling
        // so we iterate over all of them and process only those that require it
        for (int i = 0; i < memories.length(); i++) {
            Memory memory = memories.peekNodeMemory(i);
            // some nodes have no memory, so we need to check for nulls
            if (memory != null) {
                ProtobufMessages.NodeMemory _node = null;
                switch (memory.getNodeType()) {
                    case NodeTypeEnums.AccumulateNode: {
                        _node = writeAccumulateNodeMemory(i, memory);
                        break;
                    }
                    case NodeTypeEnums.RightInputAdapterNode: {
View Full Code Here
392
393
394
395
396
397
398
399
400
401
402
     */
    public void updateSink( final LeftTupleSink sink,
                            final PropagationContext context,
                            final InternalWorkingMemory workingMemory ) {

        Memory m = workingMemory.getNodeMemory( this );
        BetaMemory memory = null;
        if (m instanceof BetaMemory) {
            memory = (BetaMemory) m;
        } else {
            workingMemory.getNodeMemory( this );
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33
       
        if ( sourceSegment.isEmpty() ) {
            // We know it's a Composite 
            LeftTupleSinkNodeList list = ((CompositeLeftTupleSinkAdapter)source.getSinkPropagator()).getRawSinks();
            for (LeftTupleSinkNode sink = list.getFirst(); sink != null; sink = sink.getNextLeftTupleSinkNode() ) {
                Memory memory = wm.getNodeMemories().getNodeMemory( ( MemoryFactory ) sink );
                SegmentMemory smem = memory.getSegmentMemory();
                sourceSegment.add( smem );
            }
        }
               
        processPeers(sourceSegment, stagedLeftTuples);
View Full Code Here
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
        InternalWorkingMemory wm = context.wm;
        NodeMemories memories = wm.getNodeMemories();
        // only some of the node memories require special serialization handling
        // so we iterate over all of them and process only those that require it
        for (int i = 0; i < memories.length(); i++) {
            Memory memory = memories.peekNodeMemory(i);
            // some nodes have no memory, so we need to check for nulls
            if (memory != null) {
                ProtobufMessages.NodeMemory _node = null;
                switch (memory.getNodeType()) {
                    case NodeTypeEnums.AccumulateNode: {
                        _node = writeAccumulateNodeMemory(i, memory);
                        break;
                    }
                    case NodeTypeEnums.RightInputAdapterNode: {
View Full Code Here
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
    InternalWorkingMemory wm = context.wm;
    NodeMemories memories = wm.getNodeMemories();
    // only some of the node memories require special serialization handling
    // so we iterate over all of them and process only those that require it
    for (int i = 0; i < memories.length(); i++) {
      Memory memory = memories.peekNodeMemory(i);
      // some nodes have no memory, so we need to check for nulls
      if (memory != null) {
        ProtobufMessages.NodeMemory _node = null;
        switch (memory.getNodeType()) {
        case NodeTypeEnums.AccumulateNode: {
          _node = writeAccumulateNodeMemory(i, memory);
          break;
        }
        case NodeTypeEnums.RightInputAdaterNode: {
View Full Code Here
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
        InternalWorkingMemory wm = context.wm;
        NodeMemories memories = wm.getNodeMemories();
        // only some of the node memories require special serialization handling
        // so we iterate over all of them and process only those that require it
        for ( int i = 0; i < memories.length(); i++ ) {
            Memory memory = memories.peekNodeMemory( i );
            // some nodes have no memory, so we need to check for nulls
            if ( memory != null ) {
                ProtobufMessages.NodeMemory _node = null;
                switch ( memory.getNodeType() ) {
                    case NodeTypeEnums.AccumulateNode : {
                        _node = writeAccumulateNodeMemory( i, memory );
                        break;
                    }
                    case NodeTypeEnums.RightInputAdaterNode : {
View Full Code Here
TOP

Related Classes of org.drools.common.Memory

  • org.drools.marshalling.impl.ProtobufOutputMarshaller
  • org.drools.phreak.RuleNetworkEvaluatorActivation
  • org.drools.phreak.SegmentPropagator
  • org.drools.phreak.SegmentUtilities
  • org.drools.reteoo.JoinNode
  • org.drools.reteoo.SegmentMemory
    • 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.