Package org.drools.core.util.index

Examples of org.drools.core.util.index.LeftTupleList

3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
                                  LeftTupleSink sink,
                                  InternalWorkingMemory wm,
                                  LeftTupleSets srcLeftTuples,
                                  LeftTupleSets trgLeftTuples, RuleNetworkEvaluatorActivation activation) {
            ConditionalBranchEvaluator branchEvaluator = branchNode.getBranchEvaluator();
            LeftTupleList tupleList = activation.getLeftTupleList();

            for (LeftTuple leftTuple = srcLeftTuples.getInsertFirst(); leftTuple != null; ) {
                LeftTuple next = leftTuple.getStagedNext();

                boolean breaking = false;
                ConditionalExecution conditionalExecution = branchEvaluator.evaluate(leftTuple, wm, cbm.context);

                boolean useLeftMemory = useLeftMemory(branchNode, leftTuple);

                if (conditionalExecution != null) {
                    RuleTerminalNode rtn = (RuleTerminalNode) conditionalExecution.getSink().getFirstLeftTupleSink();
                    LeftTuple branchedLeftTuple = rtn.createLeftTuple(leftTuple,
                                                                      rtn,
                                                                      leftTuple.getPropagationContext(), useLeftMemory);

                    leftTuple.setObject(branchedLeftTuple);

                    //rtn.assertLeftTuple(branchedLeftTuple, leftTuple.getPropagationContext(), wm);
                    tupleList.add(branchedLeftTuple);

                    breaking = conditionalExecution.isBreaking();
                }

                if (!breaking) {
View Full Code Here
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
                                  InternalWorkingMemory wm,
                                  LeftTupleSets srcLeftTuples,
                                  LeftTupleSets trgLeftTuples,
                                  LeftTupleSets stagedLeftTuples, RuleNetworkEvaluatorActivation activation) {
            ConditionalBranchEvaluator branchEvaluator = branchNode.getBranchEvaluator();
            LeftTupleList tupleList = activation.getLeftTupleList();

            for (LeftTuple leftTuple = srcLeftTuples.getUpdateFirst(); leftTuple != null; ) {
                LeftTuple next = leftTuple.getStagedNext();

                LeftTuple rtnLeftTuple = (LeftTuple) leftTuple.getObject();
                LeftTuple mainLeftTuple = leftTuple.getFirstChild();

                RuleTerminalNode oldRtn = null;
                if (rtnLeftTuple != null) {
                    oldRtn = (RuleTerminalNode) rtnLeftTuple.getSink();
                }

                ConditionalExecution conditionalExecution = branchEvaluator.evaluate(leftTuple, wm, cbm.context);

                RuleTerminalNode newRtn = null;
                boolean breaking = false;
                if (conditionalExecution != null) {
                    newRtn = (RuleTerminalNode) conditionalExecution.getSink().getFirstLeftTupleSink();
                    breaking = conditionalExecution.isBreaking();
                }

                // Handle conditional branches
                if (oldRtn != null) {
                    if (newRtn == null) {
                        // old exits, new does not, so delete
                        if ( rtnLeftTuple.getMemory() != null ) {
                            tupleList.remove(rtnLeftTuple);
                        }
                        oldRtn.retractLeftTuple(rtnLeftTuple, rtnLeftTuple.getPropagationContext(), wm);

                    } else if (newRtn == oldRtn) {
                        // old and new on same branch, so update
                        if ( rtnLeftTuple.getMemory() != null ) {
                            tupleList.remove(rtnLeftTuple); // must be removed before it can bereadded
                        }
                        tupleList.add(rtnLeftTuple);
                        //oldRtn.modifyLeftTuple(rtnLeftTuple, rtnLeftTuple.getPropagationContext(), wm);

                    } else {
                        // old and new on different branches, delete one and insert the other
                        if ( rtnLeftTuple.getMemory() != null ) {
                            tupleList.remove(rtnLeftTuple);
                        }
                        oldRtn.retractLeftTuple(rtnLeftTuple, rtnLeftTuple.getPropagationContext(), wm);

                        rtnLeftTuple = newRtn.createLeftTuple(leftTuple,
                                                              newRtn,
                                                              leftTuple.getPropagationContext(), true);

                        leftTuple.setObject(rtnLeftTuple);
                        tupleList.add(rtnLeftTuple);
                        //newRtn.assertLeftTuple(rtnLeftTuple, rtnLeftTuple.getPropagationContext(), wm);
                    }

                } else if (newRtn != null) {
                    // old does not exist, new exists, so insert
                    rtnLeftTuple = newRtn.createLeftTuple(leftTuple,
                                                          newRtn,
                                                          leftTuple.getPropagationContext(), true);

                    leftTuple.setObject(rtnLeftTuple);
                    //newRtn.assertLeftTuple(rtnLeftTuple, rtnLeftTuple.getPropagationContext(), wm);
                    tupleList.add(rtnLeftTuple);
                }

                // Handle main branch
                if (mainLeftTuple != null) {
                    switch (mainLeftTuple.getStagedType()) {
View Full Code Here
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
                                  ConditionalBranchMemory cbm,
                                  InternalWorkingMemory wm,
                                  LeftTupleSets srcLeftTuples,
                                  LeftTupleSets trgLeftTuples,
                                  LeftTupleSets stagedLeftTuples, RuleNetworkEvaluatorActivation activation) {
            LeftTupleList tupleList = activation.getLeftTupleList();

            for (LeftTuple leftTuple = srcLeftTuples.getDeleteFirst(); leftTuple != null; ) {
                LeftTuple next = leftTuple.getStagedNext();

                LeftTuple rtnLeftTuple = (LeftTuple) leftTuple.getObject();
                LeftTuple mainLeftTuple = leftTuple.getFirstChild();

                if (rtnLeftTuple != null) {
                    RuleTerminalNode rtn = (RuleTerminalNode) rtnLeftTuple.getSink();
                    if ( rtnLeftTuple.getMemory() != null ) {
                        tupleList.remove(rtnLeftTuple);
                    }
                    rtn.retractLeftTuple(rtnLeftTuple,
                                         rtnLeftTuple.getPropagationContext(),
                                         wm);
                }
View Full Code Here
347
348
349
350
351
352
353
        private LeftTupleList leftTuples;
        private SegmentMemory memory;


        public TimerNodeMemory() {
            this.leftTuples = new LeftTupleList();
        }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
        return true;
    }

    public BetaMemory createBetaMemory(final RuleBaseConfiguration config,
                                       final short nodeType) {
        final BetaMemory memory = new BetaMemory( config.isSequential() ? null : new LeftTupleList(),
                                                  new RightTupleList(),
                                                  this.createContext(),
                                                  nodeType );

        return memory;
View Full Code Here
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
     * Helper method
     */
    public Map getActivationParameters(Activation activation) {
        if (activation instanceof RuleAgendaItem) {
            RuleAgendaItem ruleAgendaItem = (RuleAgendaItem)activation;
            LeftTupleList tupleList = ruleAgendaItem.getRuleExecutor().getLeftTupleList();
            Map result = new TreeMap();
            int i = 0;
            for (LeftTuple tuple = tupleList.getFirst(); tuple != null; tuple = (LeftTuple) tuple.getNext()) {
                Map params = getActivationParameters(tuple);
                result.put("Parameters set [" + i++ + "]", (Map.Entry[]) params.entrySet().toArray(new Map.Entry[params.size()]));
            }
            return result;
        } else {
View Full Code Here
498
499
500
501
502
503
504
505
506
507
508
            this.betaConstraints.resetTuple( memory.betaMemory.getContext() );
        }
    }

    public Memory createMemory(final RuleBaseConfiguration config) {
        BetaMemory beta = new BetaMemory( new LeftTupleList(),
                                          null,
                                          this.betaConstraints.createContext(),
                                          NodeTypeEnums.FromNode );
        return new FromMemory( beta,
                               this.dataProvider.createContext(),
View Full Code Here
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
            Activation act = ( Activation ) match;
            if ( act.isRuleAgendaItem() ) {
                // The lazy RuleAgendaItem must be fully evaluated, to see if there is a rule match
                RuleAgendaItem ruleAgendaItem = (RuleAgendaItem) act;
                ruleAgendaItem.getRuleExecutor().evaluateNetwork(workingMemory);
                LeftTupleList list = ruleAgendaItem.getRuleExecutor().getLeftTupleList();
                for (RuleTerminalNodeLeftTuple lt = (RuleTerminalNodeLeftTuple) list.getFirst(); lt != null; lt = (RuleTerminalNodeLeftTuple) lt.getNext()) {
                    if ( ruleName.equals( lt.getRule().getName() ) ) {
                        if ( checkProcessInstance( lt, processInstanceId ) ) {
                            return true;
                        }
                    }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
    public RuleExecutor(final PathMemory pmem,
            RuleAgendaItem ruleAgendaItem,
            boolean declarativeAgendaEnabled) {
        this.pmem = pmem;
        this.ruleAgendaItem = ruleAgendaItem;
        this.tupleList = new LeftTupleList();
        this.declarativeAgendaEnabled = declarativeAgendaEnabled;
        if (ruleAgendaItem.getRule().getSalience().isDynamic()) {
            queue = new BinaryHeapQueue(SalienceComparator.INSTANCE);
        }
    }
View Full Code Here
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
            Activation act = ( Activation ) match;
            if ( act.isRuleAgendaItem() ) {
                // The lazy RuleAgendaItem must be fully evaluated, to see if there is a rule match
                RuleAgendaItem ruleAgendaItem = (RuleAgendaItem) act;
                ruleAgendaItem.getRuleExecutor().evaluateNetwork(workingMemory);
                LeftTupleList list = ruleAgendaItem.getRuleExecutor().getLeftTupleList();
                for (RuleTerminalNodeLeftTuple lt = (RuleTerminalNodeLeftTuple) list.getFirst(); lt != null; lt = (RuleTerminalNodeLeftTuple) lt.getNext()) {
                    if ( ruleName.equals( lt.getRule().getName() ) ) {
                        if ( checkProcessInstance( lt, processInstanceId ) ) {
                            return true;
                        }
                    }
View Full Code Here
TOP

Related Classes of org.drools.core.util.index.LeftTupleList

  • org.drools.common.BaseBetaConstraintsTest
  • org.drools.common.EmptyBetaConstraints
  • org.drools.core.common.AbstractWorkingMemory
  • org.drools.core.common.BaseBetaConstraintsTest
  • org.drools.core.common.DefaultAgenda
  • org.drools.core.common.EmptyBetaConstraints
  • org.drools.core.common.PhreakActiveActivationIterator
  • org.drools.core.impl.StatefulKnowledgeSessionImpl
  • org.drools.core.phreak.PhreakTimerNode
  • org.drools.core.phreak.PhreakTimerNode$TimerNodeJob
    • 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.