public override void compileSingleCE(Rule.IRule rule)
{
ICondition[] conds = rule.Conditions;
ObjectCondition oc = (ObjectCondition)conds[0];
if (oc.Negated)
{
// the ObjectCondition is negated, so we need to
// handle it appropriate. This means we need to
// Add a LIANode to _IntialFact and attach a NOTNode
// to the LIANode.
ObjectTypeNode otn = (ObjectTypeNode)ruleCompiler.Inputnodes.Get(ruleCompiler.Engine.InitFact);
LIANode lianode = ruleCompiler.findLIANode(otn);
NotJoin njoin = new NotJoin(ruleCompiler.Engine.nextNodeId());
njoin.Bindings = new Binding[0];
lianode.addSuccessorNode(njoin, ruleCompiler.Engine, ruleCompiler.Memory);
// Add the join to the rule object
rule.addJoinNode(njoin);
oc.LastNode.addSuccessorNode(njoin, ruleCompiler.Engine, ruleCompiler.Memory);
}
else if (oc.Nodes.Count == 0)
{
// this means the rule has a binding, but no conditions
ObjectTypeNode otn = ruleCompiler.findObjectTypeNode(oc.TemplateName);
LIANode lianode = new LIANode(ruleCompiler.Engine.nextNodeId());
otn.addSuccessorNode(lianode, ruleCompiler.Engine, ruleCompiler.Memory);
rule.Conditions[0].addNode(lianode);
}
}
public void testCreateNode2()
{
// first create a rule engine instance
Rete engine = new Rete();
NotJoin bn = new NotJoin(engine.nextNodeId());
Assert.IsNotNull(bn);
// create a defclass
Defclass dc = new Defclass(typeof(TestBean2));
// create deftemplate
Deftemplate dtemp = dc.createDeftemplate("testBean2");
Assert.IsNotNull(dtemp);
Binding[] binds = new Binding[1];
Binding b1 = new Binding();
b1.LeftIndex = (0);
b1.IsObjectVar = (false);
b1.LeftRow = (0);
b1.RightIndex = (0);
b1.VarName = ("var1");
binds[0] = b1;
// set the binding
bn.Bindings = (binds);
engine.close();
}
public void testCreateNode()
{
Rete engine = new Rete();
NotJoin bn = new NotJoin(engine.nextNodeId());
Assert.IsNotNull(bn);
engine.close();
}
public void testAssertLeftOne()
{
// first create a rule engine instance
Rete engine = new Rete();
NotJoin bn = new NotJoin(engine.nextNodeId());
Assert.IsNotNull(bn);
// create a defclass
Defclass dc = new Defclass(typeof(TestBean2));
// create deftemplate
Deftemplate dtemp = dc.createDeftemplate("testBean2");
Assert.IsNotNull(dtemp);
Binding[] binds = new Binding[1];
Binding b1 = new Binding();
b1.LeftIndex = (0);
b1.IsObjectVar = (false);
b1.LeftRow = (0);
b1.RightIndex = (0);
b1.VarName = ("var1");
binds[0] = b1;
// set the binding
bn.Bindings = (binds);
TestBean2 bean = new TestBean2();
bean.Attr1 = ("random1");
bean.Attr2 = (101);
short s = 10001;
bean.Attr3 = (s);
long l = 10101018;
bean.Attr4 = (l);
bean.Attr5 = (1010101);
bean.Attr6 = (1001.1001);
IFact f1 = dtemp.createFact(bean, dc, engine.nextFactId());
try
{
bn.assertLeft(new Index(new IFact[] { f1 }), engine, engine.WorkingMemory);
IGenericMap <Object, Object> bmem = (IGenericMap <Object, Object>)engine.WorkingMemory.getBetaLeftMemory(bn);
Assert.AreEqual(1, bmem.Count);
}
catch (AssertException e)
{
Console.WriteLine(e.Message);
}
engine.close();
}
/// <summary> method compiles ObjectConditions, which include NOTCE
/// </summary>
public override BaseJoin compileJoin(ICondition condition, int position, Rule.IRule rule)
{
Binding[] binds = getBindings(condition, rule, position);
ObjectCondition oc = (ObjectCondition)condition;
BaseJoin joinNode = null;
//deal with the CE which is not NOT CE.
if (!oc.Negated)
{
if (binds.Length > 0 && oc.HasPredicateJoin)
{
joinNode = new PredicateBNode(ruleCompiler.Engine.nextNodeId());
}
else if (binds.Length > 0 && oc.HasNotEqual)
{
joinNode = new HashedNotEqBNode(ruleCompiler.Engine.nextNodeId());
}
else if (binds.Length > 0)
{
joinNode = new HashedEqBNode(ruleCompiler.Engine.nextNodeId());
}
else if (binds.Length == 0)
{
joinNode = new ZJBetaNode(ruleCompiler.Engine.nextNodeId());
}
}
//deal with the CE which is NOT CE.
if (oc.Negated)
{
if (binds.Length > 0 && oc.HasPredicateJoin)
{
joinNode = new NotJoin(ruleCompiler.Engine.nextNodeId());
}
else if (oc.HasNotEqual)
{
joinNode = new HashedNotEqNJoin(ruleCompiler.Engine.nextNodeId());
}
else
{
joinNode = new HashedEqNJoin(ruleCompiler.Engine.nextNodeId());
}
}
if (joinNode != null)
{
joinNode.Bindings = binds;
}
return(joinNode);
}
public void testPropogateNoMatch()
{
Console.WriteLine("testPropogateNoMatch");
// first create a rule engine instance
Rete engine = new Rete();
NotJoin nj = new NotJoin(engine.nextNodeId());
HashedEqBNode bn2 = new HashedEqBNode(engine.nextNodeId());
Assert.IsNotNull(nj);
// create a defclass
Defclass dc = new Defclass(typeof(TestBean2));
// create deftemplate
Deftemplate dtemp = dc.createDeftemplate("testBean2");
Assert.IsNotNull(dtemp);
Binding[] binds = new Binding[1];
Binding b1 = new Binding();
b1.LeftIndex = (0);
b1.IsObjectVar = (false);
b1.LeftRow = (0);
b1.RightIndex = (0);
b1.VarName = ("var1");
binds[0] = b1;
Binding[] binds2 = new Binding[1];
Binding b2 = new Binding();
b2.LeftIndex = (1);
b2.IsObjectVar = (false);
b2.LeftRow = (0);
b2.RightIndex = (1);
b2.VarName = ("var2");
binds2[0] = b2;
// set the binding
nj.Bindings = (binds);
bn2.Bindings = (binds2);
// now add the second Not to the first
try
{
nj.addSuccessorNode(bn2, engine, engine.WorkingMemory);
}
catch (AssertException e)
{
Console.WriteLine(e.Message);
}
int count = 10;
ArrayList data = new ArrayList();
for (int idx = 0; idx < count; idx++)
{
TestBean2 bean = new TestBean2();
bean.Attr1 = ("random" + idx);
bean.Attr2 = (101 + idx);
short s = 10001;
bean.Attr3 = (s);
long l = 10101018 + idx;
bean.Attr4 = (l);
bean.Attr5 = (1010101);
bean.Attr6 = (1001.1001);
IFact fact = dtemp.createFact(bean, dc, engine.nextFactId());
data.Add(fact);
}
IEnumerator itr = data.GetEnumerator();
while (itr.MoveNext())
{
try
{
IFact f1 = (IFact)itr.Current;
nj.assertLeft(new Index(new IFact[] { f1 }), engine, engine.WorkingMemory);
nj.assertRight(f1, engine, engine.WorkingMemory);
}
catch (AssertException e)
{
Console.WriteLine(e.Message);
}
}
IGenericMap <IFact, IFact> rbmem = (IGenericMap <IFact, IFact>)engine.WorkingMemory.getBetaRightMemory(nj);
Assert.AreEqual(count, rbmem.Count);
IGenericMap <Object, Object> lbmem = (IGenericMap <Object, Object>)engine.WorkingMemory.getBetaLeftMemory(nj);
Assert.AreEqual(count, lbmem.Count);
// now check the BetaMemory has matches
Console.WriteLine(nj.toPPString());
IEnumerator mitr = lbmem.Values.GetEnumerator();
while (mitr.MoveNext())
{
IBetaMemory btm = (IBetaMemory)mitr.Current;
Assert.AreEqual(0, btm.matchCount());
Console.WriteLine("match count=" + btm.matchCount() +
" - " + btm.toPPString());
}
IGenericMap <Object, Object> lbmem2 = (IGenericMap <Object, Object>)engine.WorkingMemory.getBetaLeftMemory(bn2);
Assert.AreEqual(count, lbmem2.Count);
Console.WriteLine(bn2.toPPString());
IEnumerator mitr2 = lbmem2.Values.GetEnumerator();
engine.close();
// TODO need to update the test to check the match count
// by getting the right memory
}
public void testPropogateChange()
{
Console.WriteLine("testPropogateChange");
// first create a rule engine instance
Rete engine = new Rete();
NotJoin nj = new NotJoin(engine.nextNodeId());
HashedEqBNode bn2 = new HashedEqBNode(engine.nextNodeId());
Assert.IsNotNull(nj);
// create a defclass
Defclass dc = new Defclass(typeof(TestBean2));
// create deftemplate
Deftemplate dtemp = dc.createDeftemplate("testBean2");
Assert.IsNotNull(dtemp);
Binding[] binds = new Binding[1];
Binding b1 = new Binding();
b1.LeftIndex = (0);
b1.IsObjectVar = (false);
b1.LeftRow = (0);
b1.RightIndex = (0);
b1.VarName = ("var1");
binds[0] = b1;
Binding[] binds2 = new Binding[1];
Binding b2 = new Binding();
b2.LeftIndex = (1);
b2.IsObjectVar = (false);
b2.LeftRow = (0);
b2.RightIndex = (1);
b2.VarName = ("var2");
binds2[0] = b2;
// set the binding
nj.Bindings = (binds);
bn2.Bindings = (binds2);
// now add the second Not to the first
try
{
nj.addSuccessorNode(bn2, engine, engine.WorkingMemory);
}
catch (AssertException e)
{
Console.WriteLine(e.Message);
}
int count = 2;
ArrayList data = new ArrayList();
for (int idx = 0; idx < count; idx++)
{
TestBean2 bean = new TestBean2();
bean.Attr1 = ("random");
bean.Attr2 = (101 + idx);
short s = 10001;
bean.Attr3 = (s);
long l = 10101018 + idx;
bean.Attr4 = (l);
bean.Attr5 = (1010101);
bean.Attr6 = (1001.1001);
IFact fact = dtemp.createFact(bean, dc, engine.nextFactId());
data.Add(fact);
}
IEnumerator itr = data.GetEnumerator();
while (itr.MoveNext())
{
try
{
IFact f1 = (IFact)itr.Current;
nj.assertLeft(new Index(new IFact[] { f1 }), engine, engine.WorkingMemory);
}
catch (AssertException e)
{
Console.WriteLine(e.Message);
}
}
IGenericMap <Object, Object> lbmem = (IGenericMap <Object, Object>)engine.WorkingMemory.getBetaLeftMemory(nj);
Assert.AreEqual(count, lbmem.Count);
IGenericMap <Object, Object> lbmem2 = (IGenericMap <Object, Object>)engine.WorkingMemory.getBetaLeftMemory(bn2);
Assert.AreEqual(2, lbmem2.Count);
itr = data.GetEnumerator();
while (itr.MoveNext())
{
try
{
IFact f1 = (IFact)itr.Current;
nj.assertRight(f1, engine, engine.WorkingMemory);
}
catch (AssertException e)
{
Console.WriteLine(e.Message);
}
}
IGenericMap <IFact, IFact> rbmem = (IGenericMap <IFact, IFact>)engine.WorkingMemory.getBetaRightMemory(nj);
Assert.AreEqual(count, rbmem.Count);
// once the facts are asserted to the right, there should be no
// facts in successor. this makes sure that assertRight correctly
// results in a retract.
lbmem2 = (IGenericMap <Object, Object>)engine.WorkingMemory.getBetaLeftMemory(bn2);
Assert.AreEqual(0, lbmem2.Count);
engine.close();
}
public void testMatch()
{
// first create a rule engine instance
Rete engine = new Rete();
NotJoin bn = new NotJoin(engine.nextNodeId());
Assert.IsNotNull(bn);
// create a defclass
Defclass dc = new Defclass(typeof(TestBean2));
// create deftemplate
Deftemplate dtemp = dc.createDeftemplate("testBean2");
Assert.IsNotNull(dtemp);
Binding[] binds = new Binding[1];
Binding b1 = new Binding();
b1.LeftIndex = (0);
b1.IsObjectVar = (false);
b1.LeftRow = (0);
b1.RightIndex = (0);
b1.VarName = ("var1");
binds[0] = b1;
// set the binding
bn.Bindings = (binds);
int count = 10;
ArrayList data = new ArrayList();
for (int idx = 0; idx < count; idx++)
{
TestBean2 bean = new TestBean2();
bean.Attr1 = ("random");
bean.Attr2 = (101);
short s = 10001;
bean.Attr3 = (s);
long l = 10101018;
bean.Attr4 = (l);
bean.Attr5 = (1010101);
bean.Attr6 = (1001.1001);
IFact fact = dtemp.createFact(bean, dc, engine.nextFactId());
data.Add(fact);
}
IEnumerator itr = data.GetEnumerator();
while (itr.MoveNext())
{
try
{
IFact f1 = (IFact)itr.Current;
bn.assertLeft(new Index(new IFact[] { f1 }), engine, engine.WorkingMemory);
bn.assertRight(f1, engine, engine.WorkingMemory);
}
catch (AssertException e)
{
Console.WriteLine(e.Message);
}
}
IGenericMap <IFact, IFact> rbmem = (IGenericMap <IFact, IFact>)engine.WorkingMemory.getBetaRightMemory(bn);
Assert.AreEqual(count, rbmem.Count);
IGenericMap <Object, Object> lbmem = (IGenericMap <Object, Object>)engine.WorkingMemory.getBetaLeftMemory(bn);
Assert.AreEqual(count, lbmem.Count);
// now check the BetaMemory has matches
Console.WriteLine(bn.toPPString());
IEnumerator mitr = lbmem.Values.GetEnumerator();
while (mitr.MoveNext())
{
IBetaMemory btm = (IBetaMemory)mitr.Current;
Assert.AreEqual(9, btm.matchCount());
Console.WriteLine("match count=" + btm.matchCount() +
" - " + btm.toPPString());
}
engine.close();
}
public override void compileSingleCE(Rule.IRule rule)
{
ICondition[] conds = rule.Conditions;
ObjectCondition oc = (ObjectCondition) conds[0];
if (oc.Negated)
{
// the ObjectCondition is negated, so we need to
// handle it appropriate. This means we need to
// Add a LIANode to _IntialFact and attach a NOTNode
// to the LIANode.
ObjectTypeNode otn = (ObjectTypeNode) ruleCompiler.Inputnodes.Get(ruleCompiler.Engine.InitFact);
LIANode lianode = ruleCompiler.findLIANode(otn);
NotJoin njoin = new NotJoin(ruleCompiler.Engine.nextNodeId());
njoin.Bindings = new Binding[0];
lianode.addSuccessorNode(njoin, ruleCompiler.Engine, ruleCompiler.Memory);
// Add the join to the rule object
rule.addJoinNode(njoin);
oc.LastNode.addSuccessorNode(njoin, ruleCompiler.Engine, ruleCompiler.Memory);
}
else if (oc.Nodes.Count == 0)
{
// this means the rule has a binding, but no conditions
ObjectTypeNode otn = ruleCompiler.findObjectTypeNode(oc.TemplateName);
LIANode lianode = new LIANode(ruleCompiler.Engine.nextNodeId());
otn.addSuccessorNode(lianode, ruleCompiler.Engine, ruleCompiler.Memory);
rule.Conditions[0].addNode(lianode);
}
}
/// <summary> method compiles ObjectConditions, which include NOTCE
/// </summary>
public override BaseJoin compileJoin(ICondition condition, int position, Rule.IRule rule)
{
Binding[] binds = getBindings(condition, rule, position);
ObjectCondition oc = (ObjectCondition) condition;
BaseJoin joinNode = null;
//deal with the CE which is not NOT CE.
if (!oc.Negated)
{
if (binds.Length > 0 && oc.HasPredicateJoin)
{
joinNode = new PredicateBNode(ruleCompiler.Engine.nextNodeId());
}
else if (binds.Length > 0 && oc.HasNotEqual)
{
joinNode = new HashedNotEqBNode(ruleCompiler.Engine.nextNodeId());
}
else if (binds.Length > 0)
{
joinNode = new HashedEqBNode(ruleCompiler.Engine.nextNodeId());
}
else if (binds.Length == 0)
{
joinNode = new ZJBetaNode(ruleCompiler.Engine.nextNodeId());
}
}
//deal with the CE which is NOT CE.
if (oc.Negated)
{
if (binds.Length > 0 && oc.HasPredicateJoin)
{
joinNode = new NotJoin(ruleCompiler.Engine.nextNodeId());
}
else if (oc.HasNotEqual)
{
joinNode = new HashedNotEqNJoin(ruleCompiler.Engine.nextNodeId());
}
else
{
joinNode = new HashedEqNJoin(ruleCompiler.Engine.nextNodeId());
}
}
if (joinNode != null)
joinNode.Bindings = binds;
return joinNode;
}
