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

Example 11 with QueryElementNode

use of org.drools.core.reteoo.QueryElementNode 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 12 with QueryElementNode

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

the class LeftTupleIterator method getNextLeftTuple.

public LeftTuple getNextLeftTuple(LeftTupleSource source, LeftTupleSink sink, LeftTuple leftTuple, InternalWorkingMemory wm) {
    if (otnIterator != null) {
        LeftTuple leftParent = leftTuple.getLeftParent();
        while (leftTuple != null) {
            leftTuple = leftTuple.getHandleNext();
            for (; leftTuple != null; leftTuple = leftTuple.getHandleNext()) {
                // Iterate to find the next left tuple for this sink, skip tuples for other sinks due to sharing split
                if (leftTuple.getTupleSink() == sink) {
                    return leftTuple;
                }
            }
        }
        // We have a parent LeftTuple so try there next
        if (leftParent != null) {
            // we know it has to be evalNode query element node
            while (leftParent != null) {
                leftParent = getNextLeftTuple(source.getLeftTupleSource(), (LeftTupleSink) source, leftParent, wm);
                if (leftParent != null) {
                    for (leftTuple = leftParent.getFirstChild(); leftTuple != null; leftTuple = leftTuple.getHandleNext()) {
                        if (leftTuple.getTupleSink() == sink) {
                            return leftTuple;
                        }
                    }
                }
            }
            return null;
        }
        // We have exhausted the current FactHandle, now try the next
        while (otnIterator.hasNext()) {
            InternalFactHandle handle = otnIterator.next();
            leftTuple = handle.findFirstLeftTuple(lt -> lt.getTupleSink() == sink);
            if (leftTuple != null) {
                return leftTuple;
            }
        }
        // We've exhausted this OTN so set the iterator to null
        otnIterator = null;
    } else if (source instanceof AccumulateNode) {
        // when using phreak, accumulate result tuples will not link to leftParent, but to parent instead
        BetaMemory memory = ((AccumulateMemory) wm.getNodeMemory((MemoryFactory) source)).getBetaMemory();
        FastIterator localIt = memory.getLeftTupleMemory().fullFastIterator(leftTuple.getParent());
        LeftTuple childLeftTuple = leftTuple;
        leftTuple = childLeftTuple.getParent();
        while (leftTuple != null) {
            if (childLeftTuple == null) {
                childLeftTuple = leftTuple.getFirstChild();
            } else {
                childLeftTuple = childLeftTuple.getHandleNext();
            }
            for (; childLeftTuple != null; childLeftTuple = childLeftTuple.getHandleNext()) {
                if (childLeftTuple.getTupleSink() == sink) {
                    return childLeftTuple;
                }
            }
            leftTuple = (LeftTuple) localIt.next(leftTuple);
        }
    } else 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(leftTuple.getLeftParent());
        LeftTuple childLeftTuple = leftTuple;
        leftTuple = childLeftTuple.getLeftParent();
        while (leftTuple != null) {
            if (childLeftTuple == null) {
                childLeftTuple = leftTuple.getFirstChild();
            } else {
                childLeftTuple = childLeftTuple.getHandleNext();
            }
            for (; 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);
        if (leftTuple != null) {
            RightTuple rightTuple = leftTuple.getLeftParent().getBlocker();
            FastIterator localIt = memory.getRightTupleMemory().fullFastIterator(rightTuple);
            for (LeftTuple childleftTuple = leftTuple.getHandleNext(); childleftTuple != null; childleftTuple = childleftTuple.getHandleNext()) {
                if (childleftTuple.getTupleSink() == sink) {
                    return childleftTuple;
                }
            }
            leftTuple = leftTuple.getLeftParent();
            // now move onto next RightTuple
            while (rightTuple != null) {
                if (rightTuple.getBlocked() != null) {
                    if (leftTuple != null) {
                        leftTuple = leftTuple.getBlockedNext();
                    } else {
                        leftTuple = rightTuple.getBlocked();
                    }
                    for (; 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 EvalConditionNode || source instanceof QueryElementNode) {
        LeftTuple childLeftTuple = leftTuple;
        if (leftTuple != null) {
            leftTuple = leftTuple.getLeftParent();
            while (leftTuple != null) {
                if (childLeftTuple != null) {
                    childLeftTuple = childLeftTuple.getHandleNext();
                } else {
                    childLeftTuple = leftTuple.getFirstChild();
                }
                for (; childLeftTuple != null; childLeftTuple = childLeftTuple.getHandleNext()) {
                    if (childLeftTuple.getTupleSink() == sink) {
                        return childLeftTuple;
                    }
                }
                leftTuple = getNextLeftTuple(source.getLeftTupleSource(), (LeftTupleSink) source, leftTuple, wm);
            }
        }
    }
    return null;
}