49         List<ITree> children;  field in Antlr.Runtime.Tree.BaseTree
70                 return children;
145             if (children == null || i >= children.Count)  in GetChild()
148             return children[i];  in GetChild()
152             foreach (ITree child in children) {  in GetFirstChildWithType()
177 …           if (childTree != null && this.children != null && this.children == childTree.children) {  in AddChild()
182                     if (this.children != null || childTree == null) {  in AddChild()
183                         if (this.children == null)  in AddChild()
184                             this.children = CreateChildrenList();  in AddChild()
190                             this.children.Add(c);  in AddChild()
193                             c.ChildIndex = children.Count - 1;  in AddChild()
198                         this.children = childTree.children;  in AddChild()
204                 if (children == null) {  in AddChild()
205                     children = CreateChildrenList(); // create children list on demand  in AddChild()
207                 children.Add(t);  in AddChild()
209                 t.ChildIndex = children.Count - 1;  in AddChild()
233             if (children == null) {  in SetChild()
234                 children = CreateChildrenList();  in SetChild()
236             children[i] = t;  in SetChild()
247             if (children == null)  in DeleteChild()
250             ITree killed = children[i];  in DeleteChild()
251             children.RemoveAt(i);  in DeleteChild()
279             if (children == null) {  in ReplaceChildren()
289                 if (baseTree != null && baseTree.children != null) {  in ReplaceChildren()
290                     newChildren = baseTree.children;  in ReplaceChildren()
309                     children[i] = child;  in ReplaceChildren()
318                     children[startChildIndex + j] = newChildren[j];  in ReplaceChildren()
323                     children.RemoveAt(indexToDelete);  in ReplaceChildren()
330                     children[startChildIndex + j] = newChildren[j];  in ReplaceChildren()
334                     children.Insert(startChildIndex + j, newChildren[j]);  in ReplaceChildren()
416             if (children == null || children.Count == 0) {  in ToStringTree()
425             for (int i = 0; children != null && i < children.Count; i++) {  in ToStringTree()
426                 ITree t = children[i];  in ToStringTree()