| /external/yapf/yapf/yapflib/ |
| D | split_penalty.py | 71 for child in node.children:
81 _SetUnbreakable(node.children[1])
82 if len(node.children) > 4:
84 _SetUnbreakable(node.children[2])
86 _SetUnbreakable(node.children[-2])
95 while pytree_utils.NodeName(node.children[colon_idx]) == 'simple_stmt':
97 _SetUnbreakable(node.children[colon_idx])
99 while colon_idx < len(node.children):
100 if isinstance(node.children[colon_idx], pytree.Leaf):
101 if node.children[colon_idx].value == ':':
[all …]
|
| D | identify_container.py | 40 for child in node.children:
43 if len(node.children) != 3:
45 if pytree_utils.NodeName(node.children[0]) != 'LPAR':
48 if pytree_utils.NodeName(node.children[1]) == 'arglist':
49 for child in node.children[1].children:
51 pytree_utils.FirstLeafNode(child), node.children[0])
54 pytree_utils.FirstLeafNode(node.children[1]), node.children[0])
57 for child in node.children:
60 if len(node.children) != 3:
62 if pytree_utils.NodeName(node.children[0]) != 'LPAR':
[all …]
|
| D | blank_line_calculator.py | 67 if pytree_utils.NodeName(node.children[0]) == 'COMMENT':
68 self.last_comment_lineno = node.children[0].lineno
72 self.last_comment_lineno == node.children[0].lineno - 1):
73 self._SetNumNewlines(node.children[0], _NO_BLANK_LINES)
75 self._SetNumNewlines(node.children[0], self._GetNumNewlines(node))
76 for child in node.children:
85 for child in node.children[index:]:
96 self._SetNumNewlines(node.children[0], None)
101 for child in node.children[index:]:
135 while pytree_utils.IsCommentStatement(node.children[index]):
[all …]
|
| /external/icing/icing/result/ |
| D | projection-tree_test.cc | 34 EXPECT_THAT(tree.root().children, IsEmpty()); in TEST()
43 ASSERT_THAT(tree.root().children, SizeIs(1)); in TEST()
44 ASSERT_THAT(tree.root().children.at(0).name, Eq("subject")); in TEST()
45 ASSERT_THAT(tree.root().children.at(0).children, IsEmpty()); in TEST()
55 ASSERT_THAT(tree.root().children, SizeIs(2)); in TEST()
56 ASSERT_THAT(tree.root().children.at(0).name, Eq("subject")); in TEST()
57 ASSERT_THAT(tree.root().children.at(0).children, IsEmpty()); in TEST()
58 ASSERT_THAT(tree.root().children.at(1).name, Eq("body")); in TEST()
59 ASSERT_THAT(tree.root().children.at(1).children, IsEmpty()); in TEST()
69 ASSERT_THAT(tree.root().children, SizeIs(2)); in TEST()
[all …]
|
| /external/yapf/yapftests/ |
| D | comment_splicer_test.py | 31 self._AssertNodeType('COMMENT', node.children[0])
32 node_value = node.children[0].value
52 expr = tree.children[0].children[0]
56 self.assertEqual(4, len(expr.children))
57 comment_node = expr.children[3]
71 self.assertEqual(4, len(tree.children))
72 comment_node = tree.children[1]
86 self.assertEqual(4, len(tree.children))
87 self._AssertNodeIsComment(tree.children[1])
101 if_suite = tree.children[0].children[3]
[all …]
|
| D | pytree_utils_test.py | 55 self.assertEqual(2, len(tree.children))
56 self.assertEqual('simple_stmt', pytree_utils.NodeName(tree.children[0]))
62 self.assertEqual(2, len(tree.children))
63 self.assertEqual('simple_stmt', pytree_utils.NodeName(tree.children[0]))
68 self.assertEqual(2, len(tree.children))
69 self.assertEqual('simple_stmt', pytree_utils.NodeName(tree.children[0]))
74 self.assertEqual(2, len(tree.children))
75 self.assertEqual('classdef', pytree_utils.NodeName(tree.children[0]))
106 self._simple_tree.children[2])
107 self.assertEqual(4, len(self._simple_tree.children))
[all …]
|
| /external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| D | BaseTree.js | 13 if ( !this.children || i>=this.children.length ) {
16 return this.children[i];
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;
56 if ( this.children && this.children == childTree.children ) {
60 if ( childTree.children ) {
61 if ( this.children ) { // must copy, this has children already
[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/cpython3/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/antlr/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/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| D | BaseTree.java | 40 protected List<Object> children; field in BaseTree
54 if ( children==null || i>=children.size() ) { in getChild()
57 return (Tree)children.get(i); in getChild()
64 return children; in getChildren()
68 for (int i = 0; children!=null && i < children.size(); i++) { in getFirstChildWithType()
69 Tree t = (Tree) children.get(i); in getFirstChildWithType()
79 if ( children==null ) { in getChildCount()
82 return children.size(); in getChildCount()
100 if ( this.children!=null && this.children == childTree.children ) { in addChild()
104 if ( childTree.children!=null ) { in addChild()
[all …]
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | BaseTree.cs | 49 List<ITree> children; field in Antlr.Runtime.Tree.BaseTree
70 return children;
145 if (children == null || i >= children.Count) in GetChild()
148 return children[i]; in GetChild()
152 foreach (ITree child in children) { in GetFirstChildWithType()
177 … if (childTree != null && this.children != null && this.children == childTree.children) { in AddChild()
182 if (this.children != null || childTree == null) { in AddChild()
183 if (this.children == null) in AddChild()
184 this.children = CreateChildrenList(); in AddChild()
190 this.children.Add(c); in AddChild()
[all …]
|
| /external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
| D | Timeline.java | 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()
171 current.children.add(Tween.mark().delay(time)); in pushPause()
186 current.children.add(tl); in beginSequence()
202 current.children.add(tl); in beginParallel()
224 if (isBuilt) return Collections.unmodifiableList(current.children); in getChildren()
225 else return current.children; in getChildren()
238 for (int i=0; i<children.size(); i++) { in build()
[all …]
|
| /external/antlr/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/python/cpython3/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:
100 if not self.children:
115 node = node.children[0]
119 if len(node.children) <= 2:
121 new_node = reduce_tree(node.children[0], parent)
126 for child in node.children:
127 if node.children.index(child)%2:
[all …]
|
| D | fixer_util.py | 123 children = [Leaf(token.NAME, "from"),
127 imp = Node(syms.import_from, children)
160 if isinstance(node, Node) and node.children == [LParen(), RParen()]:
163 and len(node.children) == 3
164 and isinstance(node.children[0], Leaf)
165 and isinstance(node.children[1], Node)
166 and isinstance(node.children[2], Leaf)
167 and node.children[0].value == "("
168 and node.children[2].value == ")")
173 and len(node.children) > 1
[all …]
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | BaseTree.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 ) {
107 NSLog( @"called dealloc children in BaseTree" );
109 [children release];
116 if ( children == nil || i >= [children count] ) {
119 return (id<BaseTree>)[children objectAtIndex:i];
[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)
127 for child in node.children:
128 if node.children.index(child)%2:
[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 …]
|
| /external/chromium-trace/catapult/common/py_utils/py_utils/refactor/annotated_symbol/ |
| D | import_statement.py | 30 def Annotate(cls, symbol_type, children): argument
33 return cls(symbol_type, children)
64 def Annotate(cls, symbol_type, children): argument
68 return cls(symbol_type, children)
72 return self.children[0].value
76 self.children[0].value = value
80 if len(self.children) < 3:
82 return self.children[2].value
91 if len(self.children) < 3:
94 self.children.append(
[all …]
|
| /external/apache-commons-bcel/src/examples/Mini/ |
| D | SimpleNode.java | 29 protected Node[] children; field in SimpleNode
55 if (children == null) { in jjtAddChild()
56 children = new Node[i + 1]; in jjtAddChild()
57 } else if (i >= children.length) { in jjtAddChild()
59 System.arraycopy(children, 0, c, 0, children.length); in jjtAddChild()
60 children = c; in jjtAddChild()
62 children[i] = n; in jjtAddChild()
66 return children[i]; in jjtGetChild()
70 return (children == null) ? 0 : children.length; in jjtGetNumChildren()
88 if (children != null) { in dump()
[all …]
|
| /external/s2-geometry-library-java/tests/com/google/common/geometry/ |
| D | S2CellTest.java | 169 S2Cell[] children = new S2Cell[4]; in testSubdivide() local
170 for (int i = 0; i < children.length; ++i) { in testSubdivide()
171 children[i] = new S2Cell(); in testSubdivide()
173 assertTrue(cell.subdivide(children)); in testSubdivide()
179 exactArea += children[i].exactArea(); in testSubdivide()
180 approxArea += children[i].approxArea(); in testSubdivide()
181 averageArea += children[i].averageArea(); in testSubdivide()
184 assertEquals(children[i].id(), childId); in testSubdivide()
185 assertTrue(children[i].getCenter().aequal(childId.toPoint(), 1e-15)); in testSubdivide()
187 assertEquals(children[i].face(), direct.face()); in testSubdivide()
[all …]
|
| /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 …]
|