Exemple #1
0
 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;
 }
Exemple #7
0
 public void TickNode(Node node)
 {
     //debug
 }
Exemple #8
0
 public void OpenNode(Node node)
 {
     //debug
 }
Exemple #9
0
 public void EnterNode(Node node)
 {
     nodeCount++;
     openNodes.Add(node);
 }
Exemple #10
0
 public void ExitNode(Node node)
 {
     //debug
 }
Exemple #11
0
 public void CloseNode(Node node)
 {
     //debug
     openNodes.Remove(node);
 }
Exemple #12
0
 public TimeLimit(float limit, Node child)
     : base(child)
 {
     this.limit = limit;
 }
Exemple #13
0
 public Inverter(Node child)
     : base(child)
 {
 }
Exemple #14
0
 public Decorator(Node child)
 {
     this.child = child;
 }
 public Inverter(Node node)
 {
     this.node = node;
 }