/// <summary>
/// 移除规则
///
/// 先找到规则链，存放在栈
/// 再从最后一个开始移除，一直到第一个
/// </summary>
/// <param name="conditions">Conditions.</param>
public void RemoveRule(int[] conditions)
{
if (conditions == null || conditions.Length == 0)
{
return;
}
Stack <RuleNode> ruleStack = new Stack <RuleNode> ();
RuleNode lastNode = _Root;
ruleStack.Push(lastNode);
int len = conditions.Length - 1;
for (int i = 0; i < len; i++)
{
lastNode = lastNode.FindChild(conditions [i]);
if (lastNode == null)
{
return;
}
ruleStack.Push(lastNode);
}
while (ruleStack.Count > 0)
{
RuleNode node = ruleStack.Pop();
RuleNode child = node.FindChild(conditions [len]);
node.RemoveChild(child);
len--;
}
}
/// <summary>
/// 匹配规则
/// -1 表示未设置
/// </summary>
/// <param name="conditions">Conditions.</param>
public int Match(int[] conditions)
{
if (conditions == null || conditions.Length == 0)
{
return(INVALID_RESULT);
}
RuleNode lastNode = _Root;
for (int i = 0; i < conditions.Length; i++)
{
lastNode = lastNode.FindChild(conditions [i]);
if (lastNode == null)
{
return(INVALID_RESULT);
}
}
return(lastNode.Result);
}
/// <summary>
/// 添加规则
/// </summary>
/// <param name="conditions">Conditions.</param>
/// <param name="result">Result.</param>
public void AddRule(int[] conditions, int result)
{
if (conditions == null || conditions.Length == 0)
{
return;
}
RuleNode lastNode = _Root;
for (int i = 0; i < conditions.Length; i++)
{
RuleNode tempNode = lastNode.FindChild(conditions [i]);
if (tempNode == null)
{
tempNode = new RuleNode();
tempNode.Condition = conditions [i];
lastNode.AddChild(tempNode);
}
lastNode = tempNode;
}
lastNode.Result = result;
}