Searched refs:childTree (Results 1 – 11 of 11) sorted by relevance
54 var childTree = t, n, i, c;55 if ( childTree.isNil() ) { // t is an empty node possibly with children56 if ( this.children && this.children == childTree.children ) {60 if ( childTree.children ) {62 n = childTree.children.length;64 c = childTree.children[i];74 this.children = childTree.children;84 childTree.setParent(this);85 childTree.setChildIndex(this.children.length-1);
98 BaseTree childTree = (BaseTree)t; in addChild() local99 if ( childTree.isNil() ) { // t is an empty node possibly with children in addChild()100 if ( this.children!=null && this.children == childTree.children ) { in addChild()104 if ( childTree.children!=null ) { in addChild()106 int n = childTree.children.size(); in addChild()108 Tree c = (Tree)childTree.children.get(i); in addChild()118 this.children = childTree.children; in addChild()128 childTree.setParent(this); in addChild()129 childTree.setChildIndex(children.size()-1); in addChild()
176 BaseTree childTree = t as BaseTree; in AddChild()177 … if (childTree != null && this.children != null && this.children == childTree.children) { in AddChild()182 if (this.children != null || childTree == null) { in AddChild()198 this.children = childTree.children; in AddChild()
210 BaseTree childTree = t as BaseTree; in AddChild()211 … if ( childTree != null && this.Children != null && this.Children == childTree.Children ) in AddChild()218 if ( this.Children != null || childTree == null ) in AddChild()238 this.Children = childTree.Children; in AddChild()
261 foreach (ITree childTree in Children) in SetUnknownTokenBoundaries()263 CommonTree commonTree = childTree as CommonTree; in SetUnknownTokenBoundaries()
323 ITree childTree = GetTree(child); in SetChild()324 tree.SetChild(i, childTree); in SetChild()
86 var childTree:BaseTree = BaseTree(t);87 if ( childTree.isNil ) { // t is an empty node possibly with children88 if ( this._children!=null && this._children == childTree._children ) {91 // just add all of childTree's children to this92 if ( childTree._children!=null ) {94 var n:int = childTree._children.length;96 var c:Tree = Tree(childTree._children[i]);106 this._children = childTree.children;116 childTree.parent = this;117 childTree.childIndex = children.length-1;
173 id<BaseTree> childTree = (id<BaseTree>) t;174 if ( [childTree isNil] ) { // t is an empty node possibly with children175 if ( children != nil && children == childTree.children ) {178 // just add all of childTree's children to this179 if ( childTree.children != nil ) {181 int n = [childTree.children count];183 id<BaseTree> c = (id<BaseTree>)[childTree.children objectAtIndex:i];193 children = childTree.children;203 [childTree setParent:(id<BaseTree>)self];204 [childTree setChildIndex:[children count]-1];
725 def addChild(self, childTree): argument736 if childTree is None:739 if childTree.isNil():742 if self.children is childTree.children:746 for idx, child in enumerate(childTree.children):750 self.children += childTree.children754 self.children.append(childTree)755 childTree.parent = self756 childTree.childIndex = len(self.children) - 1
729 def addChild(self, childTree): argument740 if childTree is None:743 if childTree.isNil():746 if self.children is childTree.children:750 for idx, child in enumerate(childTree.children):754 self.children += childTree.children758 self.children.append(childTree)759 childTree.parent = self760 childTree.childIndex = len(self.children) - 1
184 auto childTree = in buildPredicateTree() local186 rootNode->children.push_back(childTree); in buildPredicateTree()