public Node[] GetOpenNodes()
{
Node[] output = new Node[openNodes.Count];
for (int i = 0; i < output.Length; i++)
{
output[i] = openNodes[i];
}
return output;
}
Node root; ///TICK NODE
#endregion Fields
#region Constructors
public Tree(Node root)
{
this.root = root;
}
public MemProbabilistic(Node[] children)
: base(children)
{
}
public MemPriority(Node[] children)
: base(children)
{
}
public Sequence(Node[] children)
: base(children)
{
}
public Compositor(Node[] children)
{
this.children = children;
}
public void TickNode(Node node)
{
//debug
}
public void OpenNode(Node node)
{
//debug
}
public void EnterNode(Node node)
{
nodeCount++;
openNodes.Add(node);
}
public void ExitNode(Node node)
{
//debug
}
public void CloseNode(Node node)
{
//debug
openNodes.Remove(node);
}
public TimeLimit(float limit, Node child)
: base(child)
{
this.limit = limit;
}
public Inverter(Node child)
: base(child)
{
}
public Decorator(Node child)
{
this.child = child;
}
public Inverter(Node node)
{
this.node = node;
}