/external/python/cpython2/Lib/lib2to3/fixes/ |
H A 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 an [all...] |
H A 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...] |
/external/guice/extensions/persist/test/com/google/inject/persist/jpa/ |
H A D | JpaParentTestEntity.java | 37 private List<JpaTestEntity> children = new ArrayList<JpaTestEntity>(); field in class:JpaParentTestEntity 51 return children; 54 public void setChildren(List<JpaTestEntity> children) { argument 55 this.children = children;
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A 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 class: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() ) { 56 return (Tree)children.get(i); 59 /** Get the children internal List; note that if you directly mess with 63 return children; [all...] |
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
H A 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[ [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A 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 class: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 70 return children; 145 if (children == null || i >= children.Count) 148 return children[ [all...] |
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
H A 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 class:Timeline 123 children.clear(); 145 current.children.add(tween); 158 current.children.add(timeline); 164 * overlap the preceding and following children. 171 current.children.add(Tween.mark().delay(time)); 186 current.children.add(tl); 202 current.children [all...] |
/external/chromium-trace/catapult/common/py_utils/py_utils/refactor/annotated_symbol/ |
H A D | __init__.py | 28 # list of children, and returns an instance of that annotated Symbol. 58 children = map(_AnnotateNode, node.children) 61 annotated_grouping = symbol_type.Annotate(children) 63 children = annotated_grouping 67 annotated_symbol = symbol_type.Annotate(node.type, children) 71 return snippet.Symbol(node.type, children)
|
H A D | import_statement.py | 25 def Annotate(cls, symbol_type, children): 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): 63 return cls(symbol_type, children) 67 return self.children[0].value 71 self.children[0].value = value 75 if len(self.children) < [all...] |
H A 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): 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, cu [all...] |
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/recursive/ |
H A D | Human.java | 27 protected Set<Human> children; field in class:Human 30 children = new HashSet<Human>(); 66 return children; 69 public void setChildren(Set<Human> children) { argument 70 this.children = children;
|
H A D | Human2.java | 27 protected Map<Human2, String> children; field in class:Human2 30 children = new HashMap<Human2, String>(); 66 return children; 69 public void setChildren(Map<Human2, String> children) { argument 70 this.children = children;
|
H A D | Human3.java | 27 protected List<Human3> children; field in class:Human3 30 children = new ArrayList<Human3>(); 66 return children; 69 public void setChildren(List<Human3> children) { argument 70 this.children = children;
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | AntlrRuntime_BaseTreeDebugView.cs | 54 ITree[] children = new ITree[_tree.Children.Count]; 55 _tree.Children.CopyTo(children, 0); 56 return children;
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | CompositeGrammarTree.java | 35 protected List<CompositeGrammarTree> children; field in class:CompositeGrammarTree 50 if ( children==null ) { 51 children = new ArrayList<CompositeGrammarTree>(); 53 children.add(t); 62 for (int i = 0; r==null && children!=null && i < children.size(); i++) { 63 CompositeGrammarTree child = children.get(i); 93 for (int i = 0; n==null && children!=null && i < children.size(); i++) { 94 CompositeGrammarTree child = children [all...] |
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3basetree.c | 75 tree->children = NULL; 101 if (tree->children != NULL) 103 cs = tree->children->size(tree->children); 106 t = (pANTLR3_BASE_TREE) (tree->children->get(tree->children, i)); 121 if ( tree->children == NULL 122 || i >= tree->children->size(tree->children)) 126 return tree->children [all...] |
/external/python/cpython2/Lib/lib2to3/ |
H A 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...] |
H A 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) > [all...] |
/external/valgrind/memcheck/tests/ |
H A D | threadname.c | 16 static pthread_t children[3]; variable 54 r = pthread_create(&children[2], NULL, child_fn_2, NULL); 57 r = pthread_join(children[2], NULL); 69 r = pthread_create(&children[1], NULL, child_fn_1, NULL); 72 r = pthread_join(children[1], NULL); 84 r = pthread_create(&children[0], NULL, child_fn_0, NULL); 87 r = pthread_join(children[0], NULL);
|
/external/deqp/modules/gles2/functional/ |
H A D | es2fShaderExecuteTest.cpp | 58 vector<TestNode*> children = shaderLibrary.loadShaderFile(fileName.c_str()); local 60 for (int i = 0; i < (int)children.size(); i++) 61 addChild(children[i]);
|
/external/droiddriver/src/io/appium/droiddriver/scroll/ |
H A D | SentinelStrategy.java | 47 // Include invisible children by default. 71 protected abstract UiElement getSentinel(List<? extends UiElement> children); 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) { 154 getSentinel(List<? extends UiElement> children) argument [all...] |
/external/doclava/res/assets/templates/ |
H A D | yaml_navtree.cs | 3 # walk the children pages and print them nested below the parent 4 page: the node to insert a label, link and check for children 6 with nesting children on recursion. 7 isRoot: treat this node as if it has children and insert a section node. 13 if:subcount(page.children) || isRoot ?> 16 each:child = page.children?> 19 if:subcount(child.children) ?> 30 pages as children beneath the package summary.
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/recursive/generics/ |
H A D | HumanGen.java | 23 children = new LinkedHashSet<HumanGen>();
|
H A D | HumanGen3.java | 24 children = new ArrayList<HumanGen3>();
|
/external/libxml2/python/tests/ |
H A D | tst.py | 12 root = doc.children 16 child = root.children
|