/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
D | BaseTree.js | 2 * actually have any user data. ANTLR v3 uses a list of children approach 4 * an empty node whose children represent the list. An empty, but 13 if ( !this.children || i>=this.children.length ) { 16 return this.children[i]; 19 /** Get the children internal List; note that if you directly mess with 23 return this.children; 28 for (i = 0; this.children && i < this.children.length; i++) { 29 t = this.children[i]; 38 if ( !this.children ) { 41 return this.children.length; [all …]
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
D | BaseTree.java | 34 * actually have any user data. ANTLR v3 uses a list of children approach 36 * an empty node whose children represent the list. An empty, but 40 protected List children; field in BaseTree 46 * as there are no fields other than the children list, which cannot 47 * be copied as the children are not considered part of this node. 53 if ( children==null || i>=children.size() ) { in getChild() 56 return (Tree)children.get(i); in getChild() 59 /** Get the children internal List; note that if you directly mess with 63 return children; in getChildren() 67 for (int i = 0; children!=null && i < children.size(); i++) { in getFirstChildWithType() [all …]
|
/external/antlr/antlr-3.4/runtime/C/src/ |
D | antlr3basetree.c | 75 tree->children = NULL; in antlr3BaseTreeNew() 101 if (tree->children != NULL) in getFirstChildWithType() 103 cs = tree->children->size(tree->children); in getFirstChildWithType() 106 t = (pANTLR3_BASE_TREE) (tree->children->get(tree->children, i)); in getFirstChildWithType() 121 if ( tree->children == NULL in getChild() 122 || i >= tree->children->size(tree->children)) in getChild() 126 return tree->children->get(tree->children, i); in getChild() 133 if (tree->children == NULL) in getChildCount() 139 return tree->children->size(tree->children); in getChildCount() 156 if (child->children != NULL && child->children == tree->children) in addChild() [all …]
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
D | ANTLRBaseTree.m | 70 * as there are no fields other than the children list, which cannot 71 * be copied as the children are not considered part of this node. 82 children = nil; 92 // children = [[AMutableArray arrayWithCapacity:5] retain]; 93 // [children addObject:node]; 105 if ( children ) [children release]; 111 if ( children == nil || i >= [children count] ) { 114 return (id<ANTLRBaseTree>)[children objectAtIndex:i]; 117 /** Get the children internal List; note that if you directly mess with 120 - (AMutableArray *) children [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
D | BaseTree.cs | 41 * actually have any user data. ANTLR v3 uses a list of children approach 43 * an empty node whose children represent the list. An empty, but 49 List<ITree> children; field in Antlr.Runtime.Tree.BaseTree 56 * as there are no fields other than the children list, which cannot 57 * be copied as the children are not considered part of this node. 64 * Get the children internal List; note that if you directly mess with 68 public virtual IList<ITree> Children { property in Antlr.Runtime.Tree.BaseTree 70 return children; 78 if (Children == null) 81 return Children.Count; [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
D | BaseTree.cs | 42 * actually have any user data. ANTLR v3 uses a list of children approach 44 * an empty node whose children represent the list. An empty, but 60 * as there are no fields other than the children list, which cannot 61 * be copied as the children are not considered part of this node. 69 * Get the children internal List; note that if you directly mess with 73 public virtual IList<ITree> Children property in Antlr.Runtime.Tree.BaseTree 92 if ( Children == null ) 95 return Children.Count; 174 if ( Children == null || i >= Children.Count ) in GetChild() 177 return Children[i]; in GetChild() [all …]
|
/external/python/cpython2/Lib/lib2to3/fixes/ |
D | fix_metaclass.py | 32 for node in parent.children: 35 elif node.type == syms.simple_stmt and node.children: 36 expr_node = node.children[0] 37 if expr_node.type == syms.expr_stmt and expr_node.children: 38 left_side = expr_node.children[0] 49 for node in cls_node.children: 55 for i, node in enumerate(cls_node.children): 63 while cls_node.children[i+1:]: 64 move_node = cls_node.children[i+1] 76 for semi_ind, node in enumerate(stmt_node.children): [all …]
|
D | fix_itertools_imports.py | 16 if imports.type == syms.import_as_name or not imports.children: 17 children = [imports] 19 children = imports.children 20 for child in children[::2]: 29 name_node = child.children[0] 40 children = imports.children[:] or [imports] 42 for child in children: 48 while children and children[-1].type == token.COMMA: 49 children.pop().remove() 52 if (not (imports.children or getattr(imports, 'value', None)) or
|
/external/python/cpython2/Lib/compiler/ |
D | ast.py | 154 children = [] 155 children.append(self.test) 156 children.append(self.fail) 157 return tuple(children) 176 children = [] 177 children.extend(flatten(self.nodes)) 178 children.append(self.expr) 179 return tuple(children) 290 children = [] 291 children.append(self.node) [all …]
|
/external/python/cpython2/Lib/lib2to3/ |
D | btm_utils.py | 24 self.children = [] 42 if len(node.alternatives) == len(node.children): 56 if len(node.group) == len(node.children): 98 for child in self.children: 101 if not self.children: 116 node = node.children[0] 120 if len(node.children) <= 2: 122 new_node = reduce_tree(node.children[0], parent) 126 #skip odd children('|' tokens) 127 for child in node.children: [all …]
|
D | fixer_util.py | 125 children = [Leaf(token.NAME, u"from"), 129 imp = Node(syms.import_from, children) 139 if isinstance(node, Node) and node.children == [LParen(), RParen()]: 142 and len(node.children) == 3 143 and isinstance(node.children[0], Leaf) 144 and isinstance(node.children[1], Node) 145 and isinstance(node.children[2], Leaf) 146 and node.children[0].value == u"(" 147 and node.children[2].value == u")") 152 and len(node.children) > 1 [all …]
|
D | pytree.py | 46 children = () # Tuple of subnodes variable in Base 140 for ch in self.parent.children: 142 assert not found, (self.parent.children, self, new) 148 assert found, (self.children, self, new) 150 self.parent.children = l_children 159 if not node.children: 161 node = node.children[0] 172 parent's children before it was removed. 175 for i, node in enumerate(self.parent.children): 178 del self.parent.children[i] [all …]
|
D | patcomp.py | 76 node = node.children[0] # Avoid unneeded recursion 79 # Skip the odd children since they are just '|' tokens 80 alts = [self.compile_node(ch) for ch in node.children[::2]] 87 units = [self.compile_node(ch) for ch in node.children] 94 pattern = self.compile_basic(node.children[1:]) 101 nodes = node.children 115 children = repeat.children 116 child = children[0] 124 assert children[-1].type == token.RBRACE 125 assert len(children) in (3, 5) [all …]
|
/external/chromium-trace/catapult/common/py_utils/py_utils/refactor/annotated_symbol/ |
D | import_statement.py | 25 def Annotate(cls, symbol_type, children): argument 28 return cls(symbol_type, children) 41 # If we have too many children, cut the list down to size. 48 # Modify existing children. This helps preserve comments and spaces. 51 # Add children as needed. 59 def Annotate(cls, symbol_type, children): argument 63 return cls(symbol_type, children) 67 return self.children[0].value 71 self.children[0].value = value 75 if len(self.children) < 3: [all …]
|
D | reference.py | 25 if not nodes[0].children or nodes[0].children[0].type != token.NAME: 33 if len(nodes[i].children) != 2: 35 if (nodes[i].children[0].type != token.DOT or 36 nodes[i].children[1].type != token.NAME): 43 def __init__(self, children): argument 44 super(Reference, self).__init__(-1, children) 53 for child in self.children 54 for token_snippet in child.children) 60 # If we have too many children, cut the list down to size. 67 # Modify existing children. This helps preserve comments and spaces. [all …]
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
D | BaseTree.as | 30 * actually have any user data. ANTLR v3 uses a list of children approach 32 * an empty node whose children represent the list. An empty, but 39 * as there are no fields other than the children list, which cannot 40 * be copied as the children are not considered part of this node. 52 /** Get the children internal List; note that if you directly mess with 55 public function get children():Array { property in org.antlr.runtime.tree.BaseTree 78 * Warning: if t has no children, but child does 79 * and child isNil then this routine moves children to t via 80 * t.children = child.children; i.e., without copying the array. 87 if ( childTree.isNil ) { // t is an empty node possibly with children [all …]
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
D | CompositeGrammarTree.java | 35 protected List<CompositeGrammarTree> children; field in CompositeGrammarTree 50 if ( children==null ) { in addChild() 51 children = new ArrayList<CompositeGrammarTree>(); in addChild() 53 children.add(t); in addChild() 62 for (int i = 0; r==null && children!=null && i < children.size(); i++) { in getRule() 63 CompositeGrammarTree child = children.get(i); in getRule() 93 for (int i = 0; n==null && children!=null && i < children.size(); i++) { in findNode() 94 CompositeGrammarTree child = children.get(i); in findNode() 108 for (int i = 0; n==null && children!=null && i < children.size(); i++) { in findNode() 109 CompositeGrammarTree child = children.get(i); in findNode() [all …]
|
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
D | Timeline.java | 80 * Creates a new timeline with a 'sequence' behavior. Its children will 90 * Creates a new timeline with a 'parallel' behavior. Its children will be 105 private final List<BaseTween<?>> children = new ArrayList<BaseTween<?>>(10); field in Timeline 123 children.clear(); in reset() 145 current.children.add(tween); in push() 158 current.children.add(timeline); in push() 164 * overlap the preceding and following children. 171 current.children.add(Tween.mark().delay(time)); in pushPause() 186 current.children.add(tl); in beginSequence() 202 current.children.add(tl); in beginParallel() [all …]
|
/external/chromium-trace/catapult/common/py_utils/py_utils/refactor/ |
D | snippet.py | 34 def children(self): member in Snippet 35 """Return a list of this node's children.""" 58 for child in self.children: 63 for child in self.children: 76 raise ValueError('%s is not in %s. Children are: %s' % 77 (snippet_type, self, self.children)) 81 for child in self.children: 85 for child in self.children: 129 def children(self): member in TokenSnippet 157 def __init__(self, symbol_type, children): argument [all …]
|
/external/ltp/testcases/kernel/syscalls/getrusage/ |
D | getrusage03.c | 122 * expect: initial.children ~= 100MB, child.children = 0 */ 128 tst_resm(TINFO, "initial.children = %ld", ru.ru_maxrss); in inherit_fork2() 130 tst_resm(TPASS, "initial.children ~= 100MB"); in inherit_fork2() 132 tst_resm(TFAIL, "initial.children !~= 100MB"); in inherit_fork2() 139 tst_resm(TINFO, "child.children = %ld", ru.ru_maxrss); in inherit_fork2() 147 check_return(WEXITSTATUS(status), "child.children == 0", in inherit_fork2() 148 "child.children != 0"); in inherit_fork2() 181 * expect: post_wait.children ~= 300MB */ 187 tst_resm(TINFO, "initial.children = %ld", ru.ru_maxrss); in grandchild_maxrss() 207 tst_resm(TINFO, "post_wait.children = %ld", ru.ru_maxrss); in grandchild_maxrss() [all …]
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/recursive/ |
D | HumanTest.java | 54 String etalon = Util.getLocalResource("recursive/no-children-1.yaml"); in testNoChildren() 83 String etalon = Util.getLocalResource("recursive/no-children-1-pretty.yaml"); in testNoChildrenPretty() 125 Set<Human> children = new LinkedHashSet<Human>(2); in testChildren() local 126 children.add(son); in testChildren() 127 children.add(daughter); in testChildren() 128 father.setChildren(children); in testChildren() 129 mother.setChildren(children); in testChildren() 134 String etalon = Util.getLocalResource("recursive/with-children.yaml"); in testChildren() 137 humanDescription.putMapPropertyType("children", Human.class, Object.class); in testChildren() 195 Set<Human> children = new LinkedHashSet<Human>(2); in testChildrenPretty() local [all …]
|
/external/elfutils/tests/ |
D | run-show-abbrev.sh | 24 abbrev[0]: code = 1, tag = 17, children = 1 32 abbrev[19]: code = 2, tag = 46, children = 1 43 abbrev[44]: code = 3, tag = 46, children = 1 51 abbrev[63]: code = 4, tag = 24, children = 0 52 abbrev[68]: code = 5, tag = 46, children = 1 59 abbrev[85]: code = 6, tag = 36, children = 0 63 abbrev[96]: code = 7, tag = 52, children = 0 70 abbrev[0]: code = 1, tag = 17, children = 1 78 abbrev[19]: code = 2, tag = 46, children = 0 88 abbrev[42]: code = 3, tag = 36, children = 0 [all …]
|
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_broadcast/ |
D | 2-3.c | 54 for (_nch = 0; _nch < children.nb; _nch++) \ 55 kill(children.ch[_nch].p, SIGKILL); \ 62 for (_nch = 0; _nch < children.nb; _nch++) \ 63 kill(children.ch[_nch].p, SIGKILL); \ 164 } children; variable 436 /* Create all the children */ in main() 437 for (children.nb = 0; children.nb < NCHILDREN; children.nb++) { in main() 441 (children.ch[children.nb].t), in main() 447 children.ch[children.nb].p = fork(); in main() 448 if (children.ch[children.nb].p == 0) { in main() [all …]
|
/external/droiddriver/src/io/appium/droiddriver/scroll/ |
D | SentinelStrategy.java | 47 // Include invisible children by default. in Getter() 71 protected abstract UiElement getSentinel(List<? extends UiElement> children); in getSentinel() argument 82 protected UiElement getSentinel(List<? extends UiElement> children) { 83 return children.isEmpty() ? null : children.get(0); 96 protected UiElement getSentinel(List<? extends UiElement> children) { 97 return children.isEmpty() ? null : children.get(children.size() - 1); 117 protected UiElement getSentinel(List<? extends UiElement> children) { 118 return children.size() < 2 ? null : children.get(children.size() - 2); 132 protected UiElement getSentinel(List<? extends UiElement> children) { 133 return children.size() <= 1 ? null : children.get(1); [all …]
|
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
D | ShadowViewGroup.java | 21 private List<View> children = new ArrayList<View>(); field in ShadowViewGroup 32 for (View child : children) { in findViewById() 48 for (View child : children) { in findViewWithTag() 66 children.add(child); in addView() 68 children.add(index, child); in addView() 92 if (children.get(i) == child) { in indexOfChild() 101 return children.size(); in getChildCount() 106 if( index >= children.size() ){ return null; } in getChildAt() 107 return children.get(index); in getChildAt() 112 for (View child : children) { in removeAllViews() [all …]
|