Home
last modified time | relevance | path

Searched refs:getChildCount (Results 1 – 25 of 146) sorted by relevance

123456

/external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/
DViewGroupTest.java92 assertThat(root.getChildCount(), equalTo(2)); in testRemoveChildAt()
240 assertThat(root.getChildCount(), equalTo(3)); in testRemoveView()
243 assertThat(root.getChildCount(), equalTo(2)); in testRemoveView()
248 assertThat(root.getChildCount(), equalTo(2)); in testRemoveView()
254 assertThat(root.getChildCount(), equalTo(0)); in testRemoveView()
260 assertThat(root.getChildCount(), equalTo(3)); in testRemoveViewInLayout()
263 assertThat(root.getChildCount(), equalTo(2)); in testRemoveViewInLayout()
268 assertThat(root.getChildCount(), equalTo(2)); in testRemoveViewInLayout()
274 assertThat(root.getChildCount(), equalTo(0)); in testRemoveViewInLayout()
280 assertThat(root.getChildCount(), equalTo(3)); in testRemoveViews()
[all …]
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
DBaseTreeAdaptor.js46 var n = this.getChildCount(t),
107 var nc = newRootTree.getChildCount();
126 if ( r.getChildCount()===0 ) {
129 else if ( r.getChildCount()===1 ) {
192 getChildCount: function(t) {
193 return t.getChildCount();
DBaseTree.js37 getChildCount: function() { method
200 var n = this.getChildCount(),
222 var n = this.getChildCount(),
DCommonTree.js63 if ( this.getChildCount()>0 ) {
73 if ( this.getChildCount()>0 ) {
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DBaseTreeAdaptor.java89 int n = getChildCount(t); in dupTree()
146 int nc = newRootTree.getChildCount(); in becomeRoot()
165 if ( r.getChildCount()==0 ) { in rulePostProcessing()
168 else if ( r.getChildCount()==1 ) { in rulePostProcessing()
233 public int getChildCount(Object t) { in getChildCount() method in BaseTreeAdaptor
234 return ((Tree)t).getChildCount(); in getChildCount()
DTreeIterator.java81 if ( adaptor.getChildCount(tree)>0 ) return true; in hasNext()
88 if ( adaptor.getChildCount(tree)==0 ) { // single node tree (special) in next()
101 if ( adaptor.getChildCount(tree)>0 ) { in next()
110 adaptor.getChildIndex(tree)+1 >= adaptor.getChildCount(parent) ) in next()
DTreeWizard.java192 int n = adaptor.getChildCount(t); in _index()
261 int n = adaptor.getChildCount(t); in _visit()
350 int n1 = adaptor.getChildCount(t1); in _parse()
351 int n2 = tpattern.getChildCount(); in _parse()
418 int n1 = adaptor.getChildCount(t1); in _equals()
419 int n2 = adaptor.getChildCount(t2); in _equals()
DBaseTree.java76 public int getChildCount() { in getChildCount() method in BaseTree
257 int n = getChildCount(); in freshenParentAndChildIndexes()
270 int n = getChildCount(); in freshenParentAndChildIndexesDeeply()
290 int n = this.getChildCount(); in sanityCheckParentAndChildIndexes()
DCommonTree.java94 if ( getChildCount()>0 ) { in getLine()
104 if ( getChildCount()>0 ) { in getCharPositionInLine()
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
DGrammarAST.java330 if (getChildCount() == 0) in getLastChild()
332 return (GrammarAST)getChild(getChildCount() - 1); in getLastChild()
344 return (GrammarAST)parent.getChild(parent.getChildCount() - 1); in getLastSibling()
349 return (GrammarAST[])getChildren().toArray(new GrammarAST[getChildCount()]); in getChildrenAsArray()
361 int count = root.getChildCount(); in descendants()
411 for (int i = 0; i < getChildCount(); i++){ in _findAllType()
490 for (int i = 0; i < t.getChildCount(); i++){ in getChildrenForDupTree()
520 for (int i= 0; i < t.getChildCount(); i++) { in dupTree()
529 if (getChildCount() == 0) return; in setTreeEnclosingRuleNameDeeply()
556 for (int j =0 ; j < getChildCount(); j++) { in getBlockALT()
/external/llvm/tools/llvm-pdbdump/
DTypeDumper.cpp34 Printer << ": (" << Enums->getChildCount() << " items)"; in start()
43 Printer << ": (" << Typedefs->getChildCount() << " items)"; in start()
52 Printer << ": (" << Classes->getChildCount() << " items)"; in start()
DClassDefinitionDumper.cpp41 if (Bases->getChildCount() > 0) { in start()
52 if (++BaseIndex < Bases->getChildCount()) { in start()
62 if (Children->getChildCount() == 0) { in start()
/external/antlr/antlr-3.4/runtime/C/src/
Dantlr3basetreeadaptor.c70 static ANTLR3_UINT32 getChildCount (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t);
144 adaptor->getChildCount = (ANTLR3_UINT32 (*)(pANTLR3_BASE_TREE_ADAPTOR, void *)) in antlr3BaseTreeAdaptorInit()
145 getChildCount; in antlr3BaseTreeAdaptorInit()
177 nCount = adaptor->getChildCount(adaptor, t); in defineDotNodes()
256 nCount = adaptor->getChildCount(adaptor, t); in defineDotEdges()
485 n = adaptor->getChildCount (adaptor, t); in dupTreeTT()
510 n = adaptor->getChildCount(adaptor, tree); in simulateTreeConstruction()
645 if (newRootTree->getChildCount(newRootTree) > 1) in becomeRoot()
715 if (root->getChildCount(root) == 0) in rulePostProcessing()
719 else if (root->getChildCount(root) == 1) in rulePostProcessing()
[all …]
Dantlr3basetree.c37 static ANTLR3_UINT32 getChildCount (pANTLR3_BASE_TREE tree);
62 tree->getChildCount = getChildCount; in antlr3BaseTreeNew()
131 getChildCount (pANTLR3_BASE_TREE tree) in getChildCount() function
475 count = tree->getChildCount(tree); // How many children do we have in freshenPACIndexes()
Dantlr3commontreeadaptor.c55 static ANTLR3_UINT32 getChildCount (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t);
134 cta->baseAdaptor.getChildCount = (ANTLR3_UINT32 (*) (pANTLR3_BASE_TREE_ADAPTOR, void *)) in ANTLR3_TREE_ADAPTORNew()
135 getChildCount; in ANTLR3_TREE_ADAPTORNew()
471 getChildCount (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t) in getChildCount() function
473 return t->getChildCount(t); in getChildCount()
/external/antlr/antlr-3.4/runtime/Python/antlr3/
Dtree.py118 def getChildCount(self): member in Tree
537 def getChildCount(self, t): member in TreeAdaptor
725 def getChildCount(self): member in BaseTree
1012 for i in range(self.getChildCount(t)):
1077 nc = newRoot.getChildCount()
1096 if root.getChildCount() == 0:
1099 elif root.getChildCount() == 1:
1161 def getChildCount(self, t): member in BaseTreeAdaptor
1162 return t.getChildCount()
1273 if self.getChildCount():
[all …]
Dtreewizard.py394 for i in range(self.adaptor.getChildCount(t)):
491 for i in range(self.adaptor.getChildCount(t)):
567 n1 = self.adaptor.getChildCount(t1)
568 n2 = tpattern.getChildCount()
608 n1 = adaptor.getChildCount(t1)
609 n2 = adaptor.getChildCount(t2)
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
DShadowViewAnimator.java26 if (whichChild >= getChildCount()) { in setDisplayedChild()
29 mWhichChild = getChildCount() - 1; in setDisplayedChild()
DShadowViewGroup.java90 int count = getChildCount(); in indexOfChild()
100 public int getChildCount() { in getChildCount() method in ShadowViewGroup
201 for (int i = 0; i < getChildCount(); i++) { in innerText()
/external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/tree/
DANTLRCommonTreeTest.m187 …rtEquals((NSInteger)[parent getChildCount], (NSInteger)1, @"There should be 1 child but there were…
239 …STAssertEquals((NSInteger)[parent getChildCount], (NSInteger)0, @"There were supposed to be no chi…
263 …Equals((NSInteger)[newParent getChildCount], (NSInteger)1, @"Parent should only have 1 child: %d",…
284 …uals((NSInteger)[parent getChildCount], (NSInteger)1, @"There were either no children or more than…
311 …STAssertTrue([parent getChildCount] == 1, @"There were either no children or more than 1: %d", [pa…
430 STAssertEquals((NSInteger)[parent getChildCount], (NSInteger)0, @"Child count should be zero!");
529 …ssertEquals((NSInteger)[parent2 getChildCount], (NSInteger)1, @"Should have one child but has %d",…
549 …ssertEquals((NSInteger)[parent2 getChildCount], (NSInteger)2, @"Should have one child but has %d",…
/external/llvm/include/llvm/DebugInfo/PDB/
DConcreteSymbolEnumerator.h27 uint32_t getChildCount() const override { in getChildCount() function
28 return Enumerator->getChildCount(); in getChildCount()
/external/doclava/src/com/google/doclava/
DInfoBuilder.java382 for (int i = 0; i < tree.getChildCount(); i++) { in parseFile()
393 for (int i = 0; i < tree.getChildCount(); i++) { in buildPackage()
415 for (int j = 0; j < tree.getChildCount(); j++) { in buildQualifiedName()
429 for (int i = 1; i < tree.getChildCount(); i++) { in buildImport()
433 || (i == tree.getChildCount()-1 && ";".equals(part))) { in buildImport()
723 if (child.getChildCount() > 1) { in buildFields()
734 } while (j < child.getChildCount() && !"=".equals(tmp.toString())); in buildFields()
740 if (j < child.getChildCount()) { in buildFields()
780 if (tree.getChildCount() > 1) { in parseExpression()
796 tree = (ParseTree) tree.getChild(tree.getChildCount()-1); in parseExpression()
[all …]
/external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/kdom/
DNode.java74 addChild(getChildCount(), type, child); in addChild()
103 public int getChildCount() { in getChildCount() method in Node
201 int len = getChildCount(); in indexOf()
/external/llvm/lib/DebugInfo/PDB/
DPDBSymbolTypeFunctionSig.cpp37 uint32_t getChildCount() const override { in getChildCount() function in __anon951466f00111::FunctionArgEnumerator
38 return Enumerator->getChildCount(); in getChildCount()
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
DANTLRTreeIterator.m128 if ( [adaptor getChildCount:tree] > 0 ) {
139 if ( [adaptor getChildCount:tree] == 0 ) {
153 if ( [adaptor getChildCount:tree] > 0 ) {
160 while (parent != nil && ([adaptor getChildIndex:tree] + 1) >= [adaptor getChildCount:parent]) {

123456