Examples with NotNode org.drools.core.reteoo.NotNode used on opensource projects

Example 21 with NotNode

use of org.drools.core.reteoo.NotNode in project drools by kiegroup.

the class LeftTupleIterator method getFirstLeftTuple.

public LeftTuple getFirstLeftTuple(LeftTupleSource source, LeftTupleSink sink, InternalWorkingMemory wm) {
    if (source instanceof AccumulateNode) {
        AccumulateMemory accmem = (AccumulateMemory) wm.getNodeMemory((MemoryFactory) source);
        BetaMemory memory = accmem.getBetaMemory();
        FastIterator localIt = memory.getLeftTupleMemory().fullFastIterator();
        Tuple leftTuple = BetaNode.getFirstTuple(memory.getLeftTupleMemory(), localIt);
        if (leftTuple != null) {
            AccumulateContext accctx = (AccumulateContext) leftTuple.getContextObject();
            return accctx.getResultLeftTuple();
        }
        return null;
    }
    if (source instanceof JoinNode || source instanceof NotNode || source instanceof FromNode || source instanceof AccumulateNode) {
        BetaMemory memory;
        FastIterator localIt;
        if (source instanceof FromNode) {
            memory = ((FromMemory) wm.getNodeMemory((MemoryFactory) source)).getBetaMemory();
        } else if (source instanceof AccumulateNode) {
            memory = ((AccumulateMemory) wm.getNodeMemory((MemoryFactory) source)).getBetaMemory();
        } else {
            memory = (BetaMemory) wm.getNodeMemory((MemoryFactory) source);
        }
        localIt = memory.getLeftTupleMemory().fullFastIterator();
        Tuple leftTuple = BetaNode.getFirstTuple(memory.getLeftTupleMemory(), localIt);
        while (leftTuple != null) {
            for (LeftTuple childleftTuple = leftTuple.getFirstChild(); childleftTuple != null; childleftTuple = childleftTuple.getHandleNext()) {
                if (childleftTuple.getTupleSink() == sink) {
                    return childleftTuple;
                }
            }
            leftTuple = (LeftTuple) localIt.next(leftTuple);
        }
    }
    if (source instanceof ExistsNode) {
        BetaMemory memory = (BetaMemory) wm.getNodeMemory((MemoryFactory) source);
        FastIterator localIt = memory.getRightTupleMemory().fullFastIterator();
        RightTuple rightTuple = (RightTuple) BetaNode.getFirstTuple(memory.getRightTupleMemory(), localIt);
        while (rightTuple != null) {
            if (rightTuple.getBlocked() != null) {
                for (LeftTuple leftTuple = rightTuple.getBlocked(); leftTuple != null; leftTuple = leftTuple.getBlockedNext()) {
                    for (LeftTuple childleftTuple = leftTuple.getFirstChild(); childleftTuple != null; childleftTuple = childleftTuple.getHandleNext()) {
                        if (childleftTuple.getTupleSink() == sink) {
                            return childleftTuple;
                        }
                    }
                }
            }
            rightTuple = (RightTuple) localIt.next(rightTuple);
        }
    } else if (source instanceof LeftInputAdapterNode) {
        ObjectSource os = ((LeftInputAdapterNode) source).getParentObjectSource();
        while (!(os instanceof ObjectTypeNode)) {
            os = os.getParentObjectSource();
        }
        ObjectTypeNode otn = (ObjectTypeNode) os;
        otnIterator = wm.getNodeMemory(otn).iterator();
        while (otnIterator.hasNext()) {
            InternalFactHandle handle = otnIterator.next();
            LeftTuple leftTuple = handle.findFirstLeftTuple(lt -> lt.getTupleSink() == sink);
            if (leftTuple != null) {
                return leftTuple;
            }
        }
    } else if (source instanceof EvalConditionNode || source instanceof QueryElementNode) {
        LeftTuple parentLeftTuple = getFirstLeftTuple(source.getLeftTupleSource(), (LeftTupleSink) source, wm);
        while (parentLeftTuple != null) {
            for (LeftTuple leftTuple = parentLeftTuple.getFirstChild(); leftTuple != null; leftTuple = leftTuple.getHandleNext()) {
                if (leftTuple.getTupleSink() == sink) {
                    return leftTuple;
                }
            }
            parentLeftTuple = getNextLeftTuple(source.getLeftTupleSource(), (LeftTupleSink) source, parentLeftTuple, wm);
        }
    }
    return null;
}

Example 22 with NotNode

use of org.drools.core.reteoo.NotNode in project drools by kiegroup.

the class RuleUnlinkingTest method createNetworkNode.

private NetworkNode createNetworkNode(int id, int type, LeftTupleSource leftTupleSource, RuleImpl rule) {
    MockObjectSource mockObjectSource = new MockObjectSource(8);
    LeftTupleSink networkNode = null;
    switch(type) {
        case JOIN_NODE:
            {
                networkNode = new JoinNode(id, leftTupleSource, mockObjectSource, new EmptyBetaConstraints(), buildContext);
                break;
            }
        case EXISTS_NODE:
            {
                networkNode = new ExistsNode(id, leftTupleSource, mockObjectSource, new EmptyBetaConstraints(), buildContext);
                break;
            }
        case NOT_NODE:
            {
                networkNode = new NotNode(id, leftTupleSource, mockObjectSource, new EmptyBetaConstraints(), buildContext);
                break;
            }
        case RULE_TERMINAL_NODE:
            {
                networkNode = new RuleTerminalNode(id, leftTupleSource, rule, new GroupElement(Type.AND), 0, buildContext);
                break;
            }
    }
    mockObjectSource.attach();
    if (NodeTypeEnums.isLeftTupleSource(networkNode)) {
        ((LeftTupleSource) networkNode).attach(buildContext);
    } else {
        ((RuleTerminalNode) networkNode).attach(buildContext);
    }
    return networkNode;
}

Example 23 with NotNode

use of org.drools.core.reteoo.NotNode in project drools by kiegroup.

the class RuleUnlinkingWithSegmentMemoryTest method createNetworkNode.

private NetworkNode createNetworkNode(int id, int type, LeftTupleSource leftTupleSource, RuleImpl rule) {
    MockObjectSource mockObjectSource = new MockObjectSource(8);
    LeftTupleSink networkNode = null;
    switch(type) {
        case JOIN_NODE:
            {
                networkNode = new JoinNode(id, leftTupleSource, mockObjectSource, new EmptyBetaConstraints(), buildContext);
                break;
            }
        case EXISTS_NODE:
            {
                networkNode = new ExistsNode(id, leftTupleSource, mockObjectSource, new EmptyBetaConstraints(), buildContext);
                break;
            }
        case NOT_NODE:
            {
                networkNode = new NotNode(id, leftTupleSource, mockObjectSource, new EmptyBetaConstraints(), buildContext);
                break;
            }
        case RULE_TERMINAL_NODE:
            {
                networkNode = new RuleTerminalNode(id, leftTupleSource, rule, new GroupElement(Type.AND), 0, buildContext);
                break;
            }
    }
    mockObjectSource.attach();
    if (NodeTypeEnums.isLeftTupleSource(networkNode)) {
        ((LeftTupleSource) networkNode).attach(buildContext);
    } else {
        ((RuleTerminalNode) networkNode).attach(buildContext);
    }
    return networkNode;
}

Example 24 with NotNode

use of org.drools.core.reteoo.NotNode in project drools by kiegroup.

the class BackwardChainingTest method testSubNetworksAndQueries.

@Test(timeout = 10000)
public void testSubNetworksAndQueries() {
    final String drl = "" + "package org.drools.compiler.test  \n" + "import java.util.List\n" + "import java.util.ArrayList\n" + "import java.util.Map\n" + "import java.util.HashMap\n" + "global List list\n" + "dialect \"mvel\"\n" + "\n" + "declare Location\n" + "    thing : String \n" + "    location : String \n" + "end" + "\n" + "declare Edible\n" + "   thing : String\n" + "end" + "\n" + "query whereFood( String x, String y ) \n" + "    Location(x, y;) Edible(x;) \n" + "end\n" + "\n" + "query look(String place, List food ) \n" + "    $s : String() // just here to give a OTN lookup point\n" + "    food := List() from accumulate( whereFood(thing, place;) ," + "                                    collectList( thing ) )\n" + "    exists( whereFood(thing, place;) )\n" + "    not( whereFood(thing, place;) and\n " + "         String( this == $s ) from thing )\n" + "end\n" + "\n" + "rule init when\n" + "then\n" + "        \n" + "        insert( new Location(\"apple\", \"kitchen\") );\n" + "        insert( new Location(\"crackers\", \"kitchen\") );\n" + "        insert( new Location(\"broccoli\", \"kitchen\") );\n" + "        insert( new Location(\"computer\", \"office\") );\n" + "        insert( new Edible(\"apple\") );\n" + "        insert( new Edible(\"crackers\") );\n" + "end\n" + "";
    final KieBase kbase = KieBaseUtil.getKieBaseFromKieModuleFromDrl("backward-chaining-test", kieBaseTestConfiguration, drl);
    // Get the accumulate node, so we can test it's memory later
    // now check beta memory was correctly cleared
    final List<ObjectTypeNode> nodes = ((RuleBase) kbase).getRete().getObjectTypeNodes();
    ObjectTypeNode node = null;
    for (final ObjectTypeNode n : nodes) {
        if (((ClassObjectType) n.getObjectType()).getClassType() == String.class) {
            node = n;
            break;
        }
    }
    assertNotNull(node);
    final BetaNode stringBetaNode = (BetaNode) node.getObjectSinkPropagator().getSinks()[0];
    final QueryElementNode queryElementNode1 = (QueryElementNode) stringBetaNode.getSinkPropagator().getSinks()[0];
    final RightInputAdapterNode riaNode1 = (RightInputAdapterNode) queryElementNode1.getSinkPropagator().getSinks()[0];
    final AccumulateNode accNode = (AccumulateNode) riaNode1.getObjectSinkPropagator().getSinks()[0];
    final QueryElementNode queryElementNode2 = (QueryElementNode) accNode.getSinkPropagator().getSinks()[0];
    final RightInputAdapterNode riaNode2 = (RightInputAdapterNode) queryElementNode2.getSinkPropagator().getSinks()[0];
    final ExistsNode existsNode = (ExistsNode) riaNode2.getObjectSinkPropagator().getSinks()[0];
    final QueryElementNode queryElementNode3 = (QueryElementNode) existsNode.getSinkPropagator().getSinks()[0];
    final FromNode fromNode = (FromNode) queryElementNode3.getSinkPropagator().getSinks()[0];
    final RightInputAdapterNode riaNode3 = (RightInputAdapterNode) fromNode.getSinkPropagator().getSinks()[0];
    final NotNode notNode = (NotNode) riaNode3.getObjectSinkPropagator().getSinks()[0];
    final KieSession ksession = kbase.newKieSession();
    try {
        final InternalWorkingMemory wm = ((StatefulKnowledgeSessionImpl) ksession);
        final AccumulateNode.AccumulateMemory accMemory = (AccumulateNode.AccumulateMemory) wm.getNodeMemory(accNode);
        final BetaMemory existsMemory = (BetaMemory) wm.getNodeMemory(existsNode);
        final FromNode.FromMemory fromMemory = (FromNode.FromMemory) wm.getNodeMemory(fromNode);
        final BetaMemory notMemory = (BetaMemory) wm.getNodeMemory(notNode);
        final List<Map<String, Object>> list = new ArrayList<>();
        ksession.setGlobal("list", list);
        final FactHandle fh = ksession.insert("bread");
        ksession.fireAllRules();
        final List food = new ArrayList();
        // Execute normal query and check no subnetwork tuples are left behind
        QueryResults results = ksession.getQueryResults("look", "kitchen", Variable.v);
        assertEquals(1, results.size());
        for (final org.kie.api.runtime.rule.QueryResultsRow row : results) {
            food.addAll((Collection) row.get("food"));
        }
        assertEquals(2, food.size());
        assertContains(new String[] { "crackers", "apple" }, food);
        assertEquals(0, accMemory.getBetaMemory().getRightTupleMemory().size());
        assertEquals(0, existsMemory.getRightTupleMemory().size());
        assertEquals(0, fromMemory.getBetaMemory().getLeftTupleMemory().size());
        assertEquals(0, notMemory.getRightTupleMemory().size());
        // Now execute an open query and ensure the memory is left populated
        food.clear();
        final List foodUpdated = new ArrayList();
        final LiveQuery query = ksession.openLiveQuery("look", new Object[] { "kitchen", Variable.v }, new ViewChangedEventListener() {

            public void rowUpdated(final Row row) {
                foodUpdated.addAll((Collection) row.get("food"));
            }

            public void rowDeleted(final Row row) {
            }

            public void rowInserted(final Row row) {
                food.addAll((Collection) row.get("food"));
            }
        });
        assertEquals(2, food.size());
        assertContains(new String[] { "crackers", "apple" }, food);
        assertEquals(2, accMemory.getBetaMemory().getRightTupleMemory().size());
        // This is zero, as it's held directly on the LeftTuple context
        assertEquals(0, existsMemory.getRightTupleMemory().size());
        assertEquals(2, fromMemory.getBetaMemory().getLeftTupleMemory().size());
        assertEquals(0, notMemory.getRightTupleMemory().size());
        food.clear();
        // Now try again, make sure it only delete's it's own tuples
        results = ksession.getQueryResults("look", "kitchen", Variable.v);
        assertEquals(1, results.size());
        for (final org.kie.api.runtime.rule.QueryResultsRow row : results) {
            food.addAll((Collection) row.get("food"));
        }
        assertEquals(2, food.size());
        assertContains(new String[] { "crackers", "apple" }, food);
        assertEquals(2, accMemory.getBetaMemory().getRightTupleMemory().size());
        // This is zero, as it's held directly on the LeftTuple context
        assertEquals(0, existsMemory.getRightTupleMemory().size());
        assertEquals(2, fromMemory.getBetaMemory().getLeftTupleMemory().size());
        assertEquals(0, notMemory.getRightTupleMemory().size());
        food.clear();
        // do an update and check it's  still memory size 2
        // however this time the food should be empty, as 'crackers' now blocks the not.
        ksession.update(fh, "crackers");
        ksession.fireAllRules();
        assertEquals(2, accMemory.getBetaMemory().getRightTupleMemory().size());
        assertEquals(1, existsMemory.getLeftTupleMemory().size());
        // This is zero, as it's held directly on the LeftTuple context
        assertEquals(0, existsMemory.getRightTupleMemory().size());
        assertEquals(2, fromMemory.getBetaMemory().getLeftTupleMemory().size());
        // This is zero, as it's held directly on the LeftTuple context
        assertEquals(0, notMemory.getRightTupleMemory().size());
        assertEquals(0, foodUpdated.size());
        // do an update and check it's  still memory size 2
        // this time
        ksession.update(fh, "oranges");
        ksession.fireAllRules();
        assertEquals(2, accMemory.getBetaMemory().getRightTupleMemory().size());
        assertEquals(1, existsMemory.getLeftTupleMemory().size());
        // This is zero, as it's held directly on the LeftTuple context
        assertEquals(0, existsMemory.getRightTupleMemory().size());
        assertEquals(2, fromMemory.getBetaMemory().getLeftTupleMemory().size());
        assertEquals(0, notMemory.getRightTupleMemory().size());
        assertEquals(2, food.size());
        assertContains(new String[] { "crackers", "apple" }, food);
        // Close the open
        query.close();
        assertEquals(0, accMemory.getBetaMemory().getRightTupleMemory().size());
        assertEquals(0, existsMemory.getRightTupleMemory().size());
        assertEquals(0, fromMemory.getBetaMemory().getLeftTupleMemory().size());
        assertEquals(0, notMemory.getRightTupleMemory().size());
    } finally {
        ksession.dispose();
    }
}

Example 25 with NotNode

use of org.drools.core.reteoo.NotNode in project drools by kiegroup.

the class LinkingTest method testNotNodeDoesNotUnlinksWithConstriants.

@Test
public void testNotNodeDoesNotUnlinksWithConstriants() {
    String str = "";
    str += "package org.kie \n";
    str += "import " + A.class.getCanonicalName() + "\n";
    str += "import " + B.class.getCanonicalName() + "\n";
    str += "import " + C.class.getCanonicalName() + "\n";
    str += "import " + X.class.getCanonicalName() + "\n";
    str += "import " + E.class.getCanonicalName() + "\n";
    str += "import " + F.class.getCanonicalName() + "\n";
    str += "import " + G.class.getCanonicalName() + "\n";
    str += "global java.util.List list \n";
    str += "rule rule1 when \n";
    str += "   $a : A() \n";
    str += "   not B( value == $a.value ) \n";
    str += "   $c : C() \n";
    str += "then \n";
    str += "  list.add( 'x' ); \n";
    str += "end \n";
    KieBase kbase = KieBaseUtil.getKieBaseFromKieModuleFromDrl("test", kieBaseTestConfiguration, str);
    ObjectTypeNode aotn = getObjectTypeNode(kbase, A.class);
    InternalWorkingMemory wm = ((StatefulKnowledgeSessionImpl) kbase.newKieSession());
    List list = new ArrayList();
    wm.setGlobal("list", list);
    LeftInputAdapterNode aNode = (LeftInputAdapterNode) aotn.getObjectSinkPropagator().getSinks()[0];
    NotNode bNode = (NotNode) aNode.getSinkPropagator().getSinks()[0];
    JoinNode cNode = (JoinNode) bNode.getSinkPropagator().getSinks()[0];
    SegmentUtilities.createSegmentMemory(cNode, wm);
    LiaNodeMemory amem = (LiaNodeMemory) wm.getNodeMemory(aNode);
    // Only NotNode is linked in
    assertEquals(2, amem.getSegmentMemory().getLinkedNodeMask());
    FactHandle fha = wm.insert(new A());
    FactHandle fhb = wm.insert(new B(1));
    FactHandle fhc = wm.insert(new C());
    wm.flushPropagations();
    // All nodes are linked in
    assertEquals(7, amem.getSegmentMemory().getLinkedNodeMask());
    // NotNode does not unlink, due to variable constraint
    wm.retract(fhb);
    wm.flushPropagations();
    assertEquals(7, amem.getSegmentMemory().getLinkedNodeMask());
}