| /aosp_15_r20/prebuilts/go/linux-x86/src/cmd/vendor/golang.org/x/tools/go/ast/astutil/ |
| D | enclosing.go | 40 // overlaps multiple children of path[0], or if it contains only
50 // z-assignment statement, because it spans three of its children (:=,
82 children := childrenOf(node)
83 l := len(children)
84 for i, child := range children {
93 augPos = children[i-1].End() // start of preceding whitespace
96 nextChildPos := children[i+1].Pos()
113 // Does [start, end) overlap multiple children?
132 return false // inexact: overlaps multiple children
180 // childrenOf returns the direct non-nil children of ast.Node n.
[all …]
|
| /aosp_15_r20/external/yapf/yapf/yapflib/ |
| H A D | split_penalty.py | 79 for child in node.children:
89 _SetUnbreakable(node.children[1])
90 if len(node.children) > 4:
92 _SetUnbreakable(node.children[2])
94 _SetUnbreakable(node.children[-2])
103 while pytree_utils.NodeName(node.children[colon_idx]) == 'simple_stmt':
105 _SetUnbreakable(node.children[colon_idx])
107 while colon_idx < len(node.children):
108 if isinstance(node.children[colon_idx], pytree.Leaf):
109 if node.children[colon_idx].value == ':':
[all …]
|
| H A D | subtype_assigner.py | 67 for child in node.children:
73 for child in node.children:
83 for child in node.children:
108 for child in node.children:
115 for child in node.children:
122 for child in node.children:
129 for child in node.children:
137 for child in node.children:
143 for grandchild in child.children:
148 for child in node.children:
[all …]
|
| /aosp_15_r20/external/antlr/runtime/ObjC/Framework/ |
| H A 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 …]
|
| /aosp_15_r20/external/pytorch/test/profiler/ |
| H A D | profiler_utils_mock_events.json | 1 …children": [94242238082288], "parent": null}, {"_name": "torch/testing/_internal/common_utils.py(6… array
|
| /aosp_15_r20/external/antlr/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[i];
38 if ( !this.children ) {
41 return this.children.length;
[all …]
|
| /aosp_15_r20/external/antlr/runtime/C/src/ |
| H A 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 …]
|
| /aosp_15_r20/external/antlr/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<Object> 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.
54 if ( children==null || i>=children.size() ) { in getChild()
57 return (Tree)children.get(i); in getChild()
60 /** Get the children internal List; note that if you directly mess with
64 return children; in getChildren()
68 for (int i = 0; children!=null && i < children.size(); i++) { in getFirstChildWithType()
[all …]
|
| /aosp_15_r20/external/antlr/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 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 …]
|
| /aosp_15_r20/cts/tests/tests/view/src/android/view/animation/cts/ |
| H A D | AnimationSetTest.java | 106 List<Animation> children = animationSet.getAnimations(); in testInitialize() local
107 assertEquals(SHORT_CHILD_DURATION, children.get(0).getDuration()); in testInitialize()
108 assertEquals(MEDIUM_CHILD_DURATION, children.get(1).getDuration()); in testInitialize()
109 assertEquals(LONG_CHILD_DURATION, children.get(2).getDuration()); in testInitialize()
115 children = animationSet.getAnimations(); in testInitialize()
116 assertEquals(ANIMATIONSET_DURATION, children.get(0).getDuration()); in testInitialize()
117 assertEquals(ANIMATIONSET_DURATION, children.get(1).getDuration()); in testInitialize()
118 assertEquals(ANIMATIONSET_DURATION, children.get(2).getDuration()); in testInitialize()
144 List<Animation> children = animationSet.getAnimations(); in testSetFillAfter() local
145 children.get(0).setFillAfter(true); in testSetFillAfter()
[all …]
|
| /aosp_15_r20/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 …]
|
| /aosp_15_r20/external/yapf/yapftests/ |
| H A 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]
53 # Check that the expected node is still expr_stmt, but now it has 4 children
56 self.assertEqual(4, len(expr.children))
57 comment_node = expr.children[3]
69 # The comment should've been added to the root's children (now 4, including
71 self.assertEqual(4, len(tree.children))
72 comment_node = tree.children[1]
86 self.assertEqual(4, len(tree.children))
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/pdl-compiler/src/ |
| D | parser.rs | 186 fn children(self) -> NodeIterator<'i>; in children() method
203 fn children(self) -> NodeIterator<'i> { in children() method
319 let mut children = node.children(); in parse_constraint() localVariable
320 let id = parse_identifier(&mut children)?; in parse_constraint()
321 let (tag_id, value) = parse_identifier_or_integer(&mut children)?; in parse_constraint()
331 .map_or(Ok(vec![]), |n| n.children().map(|n| parse_constraint(n, context)).collect()) in parse_constraint_list_opt()
339 let mut children = node.children(); in parse_enum_value() localVariable
340 let id = parse_identifier(&mut children)?; in parse_enum_value()
341 let value = parse_integer(&mut children)?; in parse_enum_value()
351 .map_or(Ok(vec![]), |n| n.children().map(|n| parse_enum_value(n, context)).collect()) in parse_enum_value_list_opt()
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/python3/lib/python3.11/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 …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/python3/lib/python3.11/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 …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/python3/lib/python3.11/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 …]
|
| /aosp_15_r20/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 …]
|
| /aosp_15_r20/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 …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/python3/lib/python3.11/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 …]
|
| /aosp_15_r20/external/mesa3d/meson_to_hermetic/ |
| H A D | meson2python.py | 122 for child in tree.children:
137 assert len(tree.children) == 3
138 lhs = self.visit(tree.children[0])
139 rhs = self.visit(tree.children[2])
144 assert len(tree.children) == 3
145 lhs = self.visit(tree.children[0])
146 rhs = self.visit(tree.children[2])
151 assert len(tree.children) == 3
152 expr = self.visit(tree.children[0])
153 first = self.visit(tree.children[1])
[all …]
|
| /aosp_15_r20/external/s2-geometry-library-java/tests/com/google/common/geometry/ |
| H A 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 …]
|
| /aosp_15_r20/packages/modules/StatsD/statsd/tests/condition/ |
| D | CombinationConditionTracker_test.cpp | 31 vector<int> children; in TEST() local
32 children.push_back(0); in TEST()
33 children.push_back(1); in TEST()
34 children.push_back(2); in TEST()
41 EXPECT_EQ(evaluateCombinationCondition(children, operation, conditionResults), in TEST()
49 vector<int> children; in TEST() local
50 children.push_back(0); in TEST()
51 children.push_back(1); in TEST()
52 children.push_back(2); in TEST()
59 EXPECT_FALSE(evaluateCombinationCondition(children, operation, conditionResults)); in TEST()
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/python3/lib/python3.11/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)
125 #skip odd children('|' tokens)
126 for child in node.children:
[all …]
|
| /aosp_15_r20/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)
125 #skip odd children('|' tokens)
126 for child in node.children:
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/python3/lib/python3.11/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)
125 #skip odd children('|' tokens)
126 for child in node.children:
[all …]
|