/external/antlr/antlr-3.4/runtime/C/src/ |
D | antlr3basetree.c | 349 pANTLR3_VECTOR newChildren; // Iterator for whatever we are going to add in in replaceChildren() local 363 newChildren = newTree->children; in replaceChildren() 368 newChildren = antlr3VectorNew(1); in replaceChildren() 369 if (newChildren == NULL) in replaceChildren() 374 newChildren->add(newChildren, (void *)newTree, NULL); in replaceChildren() 382 replacingWithHowMany = newChildren->size(newChildren); in replaceChildren() 384 numNewChildren = newChildren->size(newChildren); in replaceChildren() 397 child = (pANTLR3_BASE_TREE) newChildren->get(newChildren, j); in replaceChildren() 412 …parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NUL… in replaceChildren() 435 …parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NUL… in replaceChildren() [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
D | BaseTree.cs | 336 IList<ITree> newChildren = null; in ReplaceChildren() 343 newChildren = baseTree.Children; in ReplaceChildren() 347 newChildren = CreateChildrenList(); in ReplaceChildren() 350 newChildren.Add( newTree.GetChild( i ) ); in ReplaceChildren() 355 newChildren = new List<ITree>( 1 ); in ReplaceChildren() 356 newChildren.Add( newTree ); in ReplaceChildren() 358 replacingWithHowMany = newChildren.Count; in ReplaceChildren() 359 int numNewChildren = newChildren.Count; in ReplaceChildren() 367 ITree child = newChildren[j]; in ReplaceChildren() 380 Children[startChildIndex + j] = newChildren[j]; in ReplaceChildren() [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
D | BaseTree.cs | 285 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/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
D | BaseTree.js | 138 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/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
D | BaseTree.java | 193 List newChildren = null; in replaceChildren() local 196 newChildren = newTree.children; in replaceChildren() 199 newChildren = new ArrayList(1); in replaceChildren() 200 newChildren.add(newTree); in replaceChildren() 202 replacingWithHowMany = newChildren.size(); in replaceChildren() 203 int numNewChildren = newChildren.size(); in replaceChildren() 209 BaseTree child = (BaseTree)newChildren.get(j); in replaceChildren() 219 children.set(startChildIndex+j, newChildren.get(j)); in replaceChildren() 231 children.set(startChildIndex+j, newChildren.get(j)); in replaceChildren() 235 children.add(startChildIndex+j, newChildren.get(j)); in replaceChildren()
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
D | ITreeFixture.cs | 339 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/antlr-3.4/tool/src/test/java/org/antlr/test/ |
D | TestTrees.java | 309 CommonTree newChildren = (CommonTree)adaptor.nil(); in testReplaceOneWithTwoAtLeft() local 310 newChildren.addChild(new CommonTree(new CommonToken(99,"x"))); in testReplaceOneWithTwoAtLeft() 311 newChildren.addChild(new CommonTree(new CommonToken(99,"y"))); in testReplaceOneWithTwoAtLeft() 313 t.replaceChildren(0, 0, newChildren); in testReplaceOneWithTwoAtLeft() 325 CommonTree newChildren = (CommonTree)adaptor.nil(); in testReplaceOneWithTwoAtRight() local 326 newChildren.addChild(new CommonTree(new CommonToken(99,"x"))); in testReplaceOneWithTwoAtRight() 327 newChildren.addChild(new CommonTree(new CommonToken(99,"y"))); in testReplaceOneWithTwoAtRight() 329 t.replaceChildren(2, 2, newChildren); in testReplaceOneWithTwoAtRight() 341 CommonTree newChildren = (CommonTree)adaptor.nil(); in testReplaceOneWithTwoInMiddle() local 342 newChildren.addChild(new CommonTree(new CommonToken(99,"x"))); in testReplaceOneWithTwoInMiddle() [all …]
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
D | BaseTree.as | 166 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/chromium_org/third_party/WebKit/Source/core/inspector/ |
D | DOMPatchSupport.h | 66 …tMap> diff(const Vector<OwnPtr<Digest> >& oldChildren, const Vector<OwnPtr<Digest> >& newChildren); 67 …t Vector<OwnPtr<Digest> >& oldChildren, const Vector<OwnPtr<Digest> >& newChildren, ExceptionState…
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
D | ANTLRBaseTree.m | 264 AMutableArray *newChildren = nil; 265 // normalize to a list of children to add: newChildren 267 newChildren = newTree.children; 270 newChildren = [AMutableArray arrayWithCapacity:5]; 271 [newChildren addObject:newTree]; 273 replacingWithHowMany = [newChildren count]; 274 int numNewChildren = [newChildren count]; 280 id<ANTLRBaseTree> child = (id<ANTLRBaseTree>)[newChildren objectAtIndex:j]; 290 … [children replaceObjectAtIndex:startChildIndex+j withObject:[newChildren objectAtIndex:j]]; 302 … [children replaceObjectAtIndex:startChildIndex+j withObject:[newChildren objectAtIndex:j]]; [all …]
|
/external/antlr/antlr-3.4/runtime/Python/unittests/ |
D | testtree.py | 806 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/chromium_org/third_party/WebKit/Source/platform/graphics/ |
D | GraphicsLayer.cpp | 166 bool GraphicsLayer::setChildren(const GraphicsLayerVector& newChildren) in setChildren() argument 169 if (newChildren == m_children) in setChildren() 174 size_t listSize = newChildren.size(); in setChildren() 176 addChildInternal(newChildren[i]); in setChildren()
|
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
D | tree.py | 810 newChildren = newTree.children 813 newChildren = [newTree] 815 replacingWithHowMany = len(newChildren) 821 for idx, child in enumerate(newChildren): 833 self.children[startChildIndex:startChildIndex] = newChildren
|
/external/chromium_org/third_party/polymer/components-chromium/platform/ |
D | platform.js.map | 1 …newChildren = this.childNodes;\n // plain array of real nodes.\n var oldChildren = getCh…
|
/external/chromium_org/third_party/polymer_legacy/platform/ |
D | platform.js.map | 1 …newChildren = this.childNodes;\n // plain array of real nodes.\n var oldChildren = getCh…
|
/external/chromium_org/third_party/polymer/components/platform/ |
D | platform.js.map | 1 …newChildren = this.childNodes;\n // plain array of real nodes.\n var oldChildren = getCh…
|