jadex.rules.rulesystem.rete.nodes.NotNode Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of jadex-rules Show documentation
Show all versions of jadex-rules Show documentation
Jadex Rules is a small lightweight rule engine, which currently
employs the well-known Rete algorithm for highly efficient rule
matching. Jadex rules is therefore similar to other rule engines
like JESS and Drools. Despite the similarities there are also
important differences between these systems:
* Jadex Rules is very small and
intended to be used as component
of other software. Even though rules can be specified in a Java
dialect as well as (a small variation of) the CLIPS language
its primary usage is on the API level. Jadex Rules is currently
the core component of the Jadex BDI reasoning engine.
* Jadex Rules cleanly separates between state and rule representation.
This allows the state implementation as well as the matcher to be
flexibly exchanged. Some experiments have e.g. been conducted with
a Jena representation. Regarding the matcher, it is planned to
support also the Treat algorithm, which has a lower memory footprint
than Rete.
* Jadex Rules pays close attention to rule debugging. The state as
well as the rete engine can be observed at runtime. The rule debugger
provides functionalities to execute a rule program stepwise and also
use rule breakpoints to stop the execution at those points.
package jadex.rules.rulesystem.rete.nodes;
import jadex.rules.rulesystem.AbstractAgenda;
import jadex.rules.rulesystem.rete.Tuple;
import jadex.rules.rulesystem.rete.constraints.ConstraintIndexer;
import jadex.rules.rulesystem.rete.constraints.IConstraintEvaluator;
import jadex.rules.state.IOAVState;
import jadex.rules.state.IProfiler;
import jadex.rules.state.OAVAttributeType;
import java.util.Collection;
import java.util.Iterator;
import java.util.Set;
/**
* A not node lets tuples (from left side) pass,
* when there is no match from the right side.
*/
public class NotNode extends AbstractBetaNode
{
//-------- constructors --------
/**
* Create a new not node.
*/
public NotNode(int nodeid, IConstraintEvaluator[] evaluators, ConstraintIndexer[] indexers)
{
super(nodeid, evaluators, indexers);
}
//-------- tuple consumer interface (left) --------
/**
* Send a tuple to this node.
* @param tuple The tuple.
*/
public void addTuple(Tuple left, IOAVState state, ReteMemory mem, AbstractAgenda agenda)
{
// if(getNodeId()==1137)
// System.out.println(this+".addTuple: "+left);
state.getProfiler().start(IProfiler.TYPE_NODE, this);
state.getProfiler().start(IProfiler.TYPE_NODEEVENT, IProfiler.NODEEVENT_TUPLEADDED);
NotMemory nomem = (NotMemory)mem.getNodeMemory(this);
// Use super implementation to update matches, but don't propagate
nomem.setDelay(true);
super.addTuple(left, state, mem, agenda);
nomem.setDelay(false);
// When no mapping exists, tuple can be propagated.
if(nomem.getMappings(left).isEmpty())
{
nomem.addResultTuple(left);
ITupleConsumerNode[] tcs = tconsumers;
for(int j=0; tcs!=null && j