Home
last modified time | relevance | path

Searched refs:newChildren (Results 1 – 23 of 23) sorted by relevance

/external/antlr/runtime/C/src/
Dantlr3basetree.c353 pANTLR3_VECTOR newChildren; // Iterator for whatever we are going to add in in replaceChildren() local
367 newChildren = newTree->children; in replaceChildren()
372 newChildren = antlr3VectorNew(1); in replaceChildren()
373 if (newChildren == NULL) in replaceChildren()
378 newChildren->add(newChildren, (void *)newTree, NULL); in replaceChildren()
386 replacingWithHowMany = newChildren->size(newChildren); in replaceChildren()
388 numNewChildren = newChildren->size(newChildren); in replaceChildren()
401 child = (pANTLR3_BASE_TREE) newChildren->get(newChildren, j); in replaceChildren()
416 …parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NUL… in replaceChildren()
439 …parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NUL… in replaceChildren()
[all …]
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DBaseTree.cs285 List<ITree> newChildren = null; in ReplaceChildren()
290 newChildren = baseTree.children; in ReplaceChildren()
292 newChildren = CreateChildrenList(); in ReplaceChildren()
295 newChildren.Add(newTree.GetChild(i)); in ReplaceChildren()
298 newChildren = new List<ITree>(1); in ReplaceChildren()
299 newChildren.Add(newTree); in ReplaceChildren()
301 replacingWithHowMany = newChildren.Count; in ReplaceChildren()
302 int numNewChildren = newChildren.Count; in ReplaceChildren()
308 ITree child = newChildren[j]; in ReplaceChildren()
318 children[startChildIndex + j] = newChildren[j]; in ReplaceChildren()
[all …]
/external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/
DBaseTree.js138 var newChildren = null;
141 newChildren = newTree.children;
144 newChildren = [];
145 newChildren.push(newTree);
147 replacingWithHowMany = newChildren.length;
148 var numNewChildren = newChildren.length;
155 child = newChildren[j];
165 this.children[startChildIndex+j] = newChildren[j];
177 this.children[startChildIndex+j] = newChildren[j];
181 this.children.splice(startChildIndex+j, 0, newChildren[j]);
/external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTree.cs360 IList<ITree> newChildren = null; in ReplaceChildren()
367 newChildren = baseTree.Children; in ReplaceChildren()
371 newChildren = CreateChildrenList(); in ReplaceChildren()
374 newChildren.Add( newTree.GetChild( i ) ); in ReplaceChildren()
379 newChildren = new List<ITree>( 1 ); in ReplaceChildren()
380 newChildren.Add( newTree ); in ReplaceChildren()
382 replacingWithHowMany = newChildren.Count; in ReplaceChildren()
383 int numNewChildren = newChildren.Count; in ReplaceChildren()
391 ITree child = newChildren[j]; in ReplaceChildren()
404 Children[startChildIndex + j] = newChildren[j]; in ReplaceChildren()
[all …]
/external/antlr/tool/src/test/java/org/antlr/test/
DTestTrees.java306 CommonTree newChildren = (CommonTree)adaptor.nil(); in testReplaceOneWithTwoAtLeft() local
307 newChildren.addChild(new CommonTree(new CommonToken(99,"x"))); in testReplaceOneWithTwoAtLeft()
308 newChildren.addChild(new CommonTree(new CommonToken(99,"y"))); in testReplaceOneWithTwoAtLeft()
310 t.replaceChildren(0, 0, newChildren); in testReplaceOneWithTwoAtLeft()
322 CommonTree newChildren = (CommonTree)adaptor.nil(); in testReplaceOneWithTwoAtRight() local
323 newChildren.addChild(new CommonTree(new CommonToken(99,"x"))); in testReplaceOneWithTwoAtRight()
324 newChildren.addChild(new CommonTree(new CommonToken(99,"y"))); in testReplaceOneWithTwoAtRight()
326 t.replaceChildren(2, 2, newChildren); in testReplaceOneWithTwoAtRight()
338 CommonTree newChildren = (CommonTree)adaptor.nil(); in testReplaceOneWithTwoInMiddle() local
339 newChildren.addChild(new CommonTree(new CommonToken(99,"x"))); in testReplaceOneWithTwoInMiddle()
[all …]
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
DITreeFixture.cs339 CommonTree newChildren = (CommonTree)adaptor.Nil(); in testReplaceOneWithTwoAtLeft()
340 newChildren.AddChild(new CommonTree(new CommonToken(99, "x"))); in testReplaceOneWithTwoAtLeft()
341 newChildren.AddChild(new CommonTree(new CommonToken(99, "y"))); in testReplaceOneWithTwoAtLeft()
343 t.ReplaceChildren(0, 0, newChildren); in testReplaceOneWithTwoAtLeft()
358 CommonTree newChildren = (CommonTree)adaptor.Nil(); in testReplaceOneWithTwoAtRight()
359 newChildren.AddChild(new CommonTree(new CommonToken(99, "x"))); in testReplaceOneWithTwoAtRight()
360 newChildren.AddChild(new CommonTree(new CommonToken(99, "y"))); in testReplaceOneWithTwoAtRight()
362 t.ReplaceChildren(2, 2, newChildren); in testReplaceOneWithTwoAtRight()
377 CommonTree newChildren = (CommonTree)adaptor.Nil(); in testReplaceOneWithTwoInMiddle()
378 newChildren.AddChild(new CommonTree(new CommonToken(99, "x"))); in testReplaceOneWithTwoInMiddle()
[all …]
/external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/
DBaseTree.java206 List<Object> newChildren; in replaceChildren() local
209 newChildren = newTree.children; in replaceChildren()
212 newChildren = new ArrayList<Object>(1); in replaceChildren()
213 newChildren.add(newTree); in replaceChildren()
215 replacingWithHowMany = newChildren.size(); in replaceChildren()
216 int numNewChildren = newChildren.size(); in replaceChildren()
222 BaseTree child = (BaseTree)newChildren.get(j); in replaceChildren()
232 children.set(startChildIndex+j, newChildren.get(j)); in replaceChildren()
244 children.set(startChildIndex+j, newChildren.get(j)); in replaceChildren()
248 children.add(startChildIndex+j, newChildren.get(j)); in replaceChildren()
/external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/src/
Dgroup-constructors.js68 _reparent: function(newChildren) { argument
69 scope.removeMulti(newChildren);
70 for (var i = 0; i < newChildren.length; i++) {
71 newChildren[i]._parent = this;
/external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DBaseTree.as166 var newChildren:Array = null;
167 // normalize to a list of children to add: newChildren
169 newChildren = newTree.children;
172 newChildren = new Array();
173 newChildren.push(newTree);
175 replacingWithHowMany = newChildren.length;
176 var numNewChildren:int = newChildren.length;
182 var child:BaseTree = BaseTree(newChildren[j]);
192 children[startChildIndex+j] = newChildren[j];
204 children[startChildIndex+j] = newChildren[j];
[all …]
/external/antlr/runtime/Cpp/include/
Dantlr3commontree.inl191 ChildrenType* newChildren; // Iterator for whatever we are going to add in local
195 newChildren = newTree->get_children_p();
199 newChildren = &newChildren_temp;
200 newChildren->push_back(newTree);
206 replacingWithHowMany = newChildren->size();
208 numNewChildren = newChildren->size();
221 child = newChildren->at(j);
238 parent_children[ startChildIndex + j ] = newChildren->at(j);
262 parent_children[ startChildIndex + j ] = newChildren->at(j);
269 parent_children.push_back( newChildren->at(j) );
/external/antlr/runtime/ObjC/Framework/
DBaseTree.m269 AMutableArray *newChildren = nil;
270 // normalize to a list of children to add: newChildren
272 newChildren = newTree.children;
275 newChildren = [AMutableArray arrayWithCapacity:5];
276 [newChildren addObject:newTree];
278 replacingWithHowMany = [newChildren count];
279 int numNewChildren = [newChildren count];
285 id<BaseTree> child = (id<BaseTree>)[newChildren objectAtIndex:j];
295 … [children replaceObjectAtIndex:startChildIndex+j withObject:[newChildren objectAtIndex:j]];
307 … [children replaceObjectAtIndex:startChildIndex+j withObject:[newChildren objectAtIndex:j]];
[all …]
/external/antlr/runtime/Python/unittests/
Dtesttree.py806 newChildren = self.adaptor.nil()
807 newChildren.addChild(CommonTree(CommonToken(99, text="x")))
808 newChildren.addChild(CommonTree(CommonToken(99, text="y")))
810 t.replaceChildren(0, 0, newChildren)
822 newChildren = self.adaptor.nil()
823 newChildren.addChild(CommonTree(CommonToken(99, text="x")))
824 newChildren.addChild(CommonTree(CommonToken(99, text="y")))
826 t.replaceChildren(2, 2, newChildren)
838 newChildren = self.adaptor.nil()
839 newChildren.addChild(CommonTree(CommonToken(99, text="x")))
[all …]
/external/antlr/runtime/Python3/unittests/
Dtesttree.py797 newChildren = self.adaptor.nil()
798 newChildren.addChild(CommonTree(CommonToken(99, text="x")))
799 newChildren.addChild(CommonTree(CommonToken(99, text="y")))
801 t.replaceChildren(0, 0, newChildren)
813 newChildren = self.adaptor.nil()
814 newChildren.addChild(CommonTree(CommonToken(99, text="x")))
815 newChildren.addChild(CommonTree(CommonToken(99, text="y")))
817 t.replaceChildren(2, 2, newChildren)
829 newChildren = self.adaptor.nil()
830 newChildren.addChild(CommonTree(CommonToken(99, text="x")))
[all …]
/external/cldr/tools/java/org/unicode/cldr/tool/
DShowRegionalVariants.java280 Set<CLDRLocale> newChildren = parentToChildren.get(locale); in showInheritance() local
281 if (newChildren == null) { in showInheritance()
284 showInheritance(newChildren, current, parentToChildren); in showInheritance()
/external/s2-geometry-library-java/src/com/google/common/geometry/
DS2Polygon.java958 List<S2Loop> newChildren = loopMap.get(newLoop); in insertLoop() local
962 if (newChildren == null) { in insertLoop()
963 newChildren = Lists.newArrayList(); in insertLoop()
964 loopMap.put(newLoop, newChildren); in insertLoop()
966 newChildren.add(child); in insertLoop()
/external/angle/src/compiler/translator/TranslatorMetalDirect/
DIntermRebuild.cpp261 TIntermSequence newChildren; in traverseAggregateBaseChildren() local
271 newChildren.push_back(result.mSingle); in traverseAggregateBaseChildren()
279 newChildren.push_back(newNode); in traverseAggregateBaseChildren()
292 *children = std::move(newChildren); in traverseAggregateBaseChildren()
/external/antlr/runtime/Python3/antlr3/
Dtree.py805 newChildren = newTree.children
808 newChildren = [newTree]
810 replacingWithHowMany = len(newChildren)
816 for idx, child in enumerate(newChildren):
828 self.children[startChildIndex:startChildIndex] = newChildren
/external/antlr/runtime/Python/antlr3/
Dtree.py810 newChildren = newTree.children
813 newChildren = [newTree]
815 replacingWithHowMany = len(newChildren)
821 for idx, child in enumerate(newChildren):
833 self.children[startChildIndex:startChildIndex] = newChildren
/external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/
DTestBasic.java1176 Set<String> newChildren = newElement2Children in TestBasicDTDCompatibility() local
1178 if (newChildren == null) { in TestBasicDTDCompatibility()
1185 Set<String> funny = containsInOrder(newChildren, in TestBasicDTDCompatibility()
1190 && newChildren.equals(EMPTY)) { in TestBasicDTDCompatibility()
1196 + "\n\t\tNew:\t" + newChildren); in TestBasicDTDCompatibility()
/external/chromium-trace/catapult/third_party/polymer/components/webcomponentsjs/
DShadowDOM.js3678 var newChildren = this.childNodes;
3681 var splices = spliceDiff.calculateSplices(newChildren, oldChildren);
3688 newChildren[newIndex++].sync(added);
3698 var newChildRenderNode = newChildren[newIndex++];
3706 for (var i = lastIndex; i < newChildren.length; i++) {
3707 newChildren[i].sync(added);
Dwebcomponents.js3685 var newChildren = this.childNodes;
3688 var splices = spliceDiff.calculateSplices(newChildren, oldChildren);
3695 newChildren[newIndex++].sync(added);
3705 var newChildRenderNode = newChildren[newIndex++];
3713 for (var i = lastIndex; i < newChildren.length; i++) {
3714 newChildren[i].sync(added);
/external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/
Dweb-animations-next.min.js.map1 …KeyframeEffect","last","node","constructor","_reparent","_isAncestor","newChildren","_putChild","a…
Dweb-animations-next-lite.min.js.map1 …KeyframeEffect","last","node","constructor","_reparent","_isAncestor","newChildren","_putChild","a…