Home
last modified time | relevance | path

Searched full:children (Results 1 – 25 of 5128) sorted by relevance

12345678910>>...206

/external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/
DBaseTree.js2 * 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/yapf/yapf/pytree/
Dsplit_penalty.py77 for child in node.children:
87 _SetUnbreakable(node.children[1])
88 if len(node.children) > 4:
90 _SetUnbreakable(node.children[2])
92 _SetUnbreakable(node.children[-2])
101 while pytree_utils.NodeName(node.children[colon_idx]) == 'simple_stmt':
103 _SetUnbreakable(node.children[colon_idx])
105 while colon_idx < len(node.children):
106 if isinstance(node.children[colon_idx], pytree.Leaf):
107 if node.children[colon_idx].value == ':':
[all …]
Dblank_line_calculator.py68 if node.children[0].type == grammar_token.COMMENT:
69 self.last_comment_lineno = node.children[0].lineno
73 self.last_comment_lineno == node.children[0].lineno - 1):
74 _SetNumNewlines(node.children[0], _NO_BLANK_LINES)
76 _SetNumNewlines(node.children[0], self._GetNumNewlines(node))
77 for child in node.children:
86 for child in node.children[index:]:
97 _SetNumNewlines(node.children[0], None)
102 for child in node.children[index:]:
126 Class and function definitions have leading comments as children of the
[all …]
Dsubtype_assigner.py66 for child in node.children:
73 for child in node.children:
77 for child in node.children:
86 for child in node.children:
113 for child in node.children:
120 for child in node.children:
127 for child in node.children:
134 for child in node.children:
142 for child in node.children:
148 for grandchild in child.children:
[all …]
/external/antlr/runtime/ObjC/Framework/
DBaseTree.m70 * 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/antlr/runtime/C/src/
Dantlr3basetree.c75 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/
DBaseTree.java34 * 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 …]
/external/yapf/yapftests/
Dcomment_splicer_test.py32 self._AssertNodeType('COMMENT', node.children[0])
33 node_value = node.children[0].value
54 expr = tree.children[0].children[0]
55 # Check that the expected node is still expr_stmt, but now it has 4 children
58 self.assertEqual(4, len(expr.children))
59 comment_node = expr.children[3]
71 # The comment should've been added to the root's children (now 4, including
73 self.assertEqual(4, len(tree.children))
74 comment_node = tree.children[1]
88 self.assertEqual(4, len(tree.children))
[all …]
Dpytree_utils_test.py57 self.assertEqual(2, len(tree.children))
58 self.assertEqual('simple_stmt', pytree_utils.NodeName(tree.children[0]))
64 self.assertEqual(2, len(tree.children))
65 self.assertEqual('simple_stmt', pytree_utils.NodeName(tree.children[0]))
104 self._simple_tree.children[2])
105 self.assertEqual(4, len(self._simple_tree.children))
107 pytree_utils.NodeName(self._simple_tree.children[2]))
109 pytree_utils.NodeName(self._simple_tree.children[3]))
113 simple_stmt = self._simple_tree.children[2]
114 foo_child = simple_stmt.children[0]
[all …]
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DBaseTree.cs41 * 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/pytorch/test/profiler/
Dprofiler_utils_mock_events.json1 …children": [94242238082288], "parent": null}, {"_name": "torch/testing/_internal/common_utils.py(6… array
/external/icing/icing/result/
Dprojection-tree_test.cc34 EXPECT_THAT(tree.root().children, IsEmpty()); in TEST()
42 ASSERT_THAT(tree.root().children, SizeIs(1)); in TEST()
43 EXPECT_THAT(tree.root().children.at(0).name, Eq("subject")); in TEST()
44 EXPECT_THAT(tree.root().children.at(0).children, IsEmpty()); in TEST()
53 ASSERT_THAT(tree.root().children, SizeIs(2)); in TEST()
55 const ProjectionTree::Node* child0 = &tree.root().children.at(0); in TEST()
56 const ProjectionTree::Node* child1 = &tree.root().children.at(1); in TEST()
62 EXPECT_THAT(child0->children, IsEmpty()); in TEST()
64 EXPECT_THAT(child1->children, IsEmpty()); in TEST()
73 ASSERT_THAT(tree.root().children, SizeIs(2)); in TEST()
[all …]
/external/icing/icing/join/
Daggregation-scorer.cc31 const std::vector<ScoredDocumentHit>& children) override { in GetScore() argument
32 return children.size(); in GetScore()
39 const std::vector<ScoredDocumentHit>& children) override { in GetScore() argument
40 if (children.empty()) { in GetScore()
42 // For non-empty children with negative scores, they are considered "worse in GetScore()
43 // than" 0, so it is correct to return 0 for empty children to assign it a in GetScore()
44 // rank higher than non-empty children with negative scores. in GetScore()
47 return std::min_element(children.begin(), children.end(), in GetScore()
59 const std::vector<ScoredDocumentHit>& children) override { in GetScore() argument
60 if (children.empty()) { in GetScore()
[all …]
/external/mesa3d/meson_to_hermetic/
Dmeson2python.py122 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 …]
/external/chromium-trace/catapult/common/py_utils/py_utils/refactor/annotated_symbol/
Dimport_statement.py30 def Annotate(cls, symbol_type, children): argument
33 return cls(symbol_type, children)
46 # If we have too many children, cut the list down to size.
53 # Modify existing children. This helps preserve comments and spaces.
56 # Add children as needed.
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:
[all …]
/external/rust/android-crates-io/crates/pdl-compiler/src/
Dparser.rs186 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 …]
/external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DBaseTree.as30 * 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/s2-geometry-library-java/tests/com/google/common/geometry/
DS2CellTest.java169 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/pytorch/scripts/compile_tests/
Dcommon.py39 children = list(testcase.iter())
40 assert children[0] is testcase
41 children = children[1:]
42 return condition(children)
46 def condition(children): argument
47 return "skipped" in {child.tag for child in children}
53 def condition(children): argument
54 if len(children) == 0:
56 tags = {child.tag for child in children}
82 def condition(children): argument
[all …]
/external/antlr/tool/src/main/java/org/antlr/tool/
DCompositeGrammarTree.java35 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/yapf/yapf/yapflib/
Didentify_container.py42 for child in node.children:
45 if len(node.children) != 3:
47 if node.children[0].type != grammar_token.LPAR:
50 if pytree_utils.NodeName(node.children[1]) == 'arglist':
51 for child in node.children[1].children:
53 pytree_utils.FirstLeafNode(child), node.children[0])
56 pytree_utils.FirstLeafNode(node.children[1]), node.children[0])
59 for child in node.children:
62 if len(node.children) != 3:
64 if node.children[0].type != grammar_token.LPAR:
[all …]
/external/perfetto/ui/src/widgets/
Dtree.ts35 view({attrs, children}: m.Vnode<TreeAttrs>): m.Children {
40 return m('.pf-tree', {class: classes}, children);
47 left?: m.Children;
50 right?: m.Children;
53 // If the node has no children, this value is never shown.
54 summary?: m.Children;
63 // If this node contains children, this icon is ignored.
76 view(vnode: m.CVnode<TreeNodeAttrs>): m.Children {
78 children, constant
100 hasChildren(vnode) && m('.pf-tree-children', children),
[all …]
/external/rust/android-crates-io/crates/slotmap/examples/
Drand_meld_heap.rs16 children: [HeapKey; 2], field
44 children: [HeapKey::null(), HeapKey::null()], in insert()
56 self.root = self.meld(root.children[0], root.children[1]); in pop()
78 children: [HeapKey::null(), HeapKey::null()], in update_key()
86 // Remove node from heap by merging children and placing them where in unlink_node()
88 let children = self.sm[node].children; in unlink_node() localVariable
91 let melded_children = self.meld(children[0], children[1]); in unlink_node()
97 if parent.children[0] == node { in unlink_node()
98 parent.children[0] = melded_children; in unlink_node()
100 parent.children[1] = melded_children; in unlink_node()
[all …]
/external/tensorflow/tensorflow/tools/common/
Dtraverse.py33 children = tf_inspect.getmembers(root)
38 if enum_member not in children:
39 children.append(enum_member)
40 children = sorted(children)
42 # Children could be missing for one of two reasons:
45 # 2. Children are lazy-loaded.
47 children = []
49 children.append((child_name, getattr(root, child_name)))
51 children = []
54 visit(path, root, children)
[all …]
/external/aws-sdk-java-v2/codegen/src/main/java/software/amazon/awssdk/codegen/poet/rules2/
DRuleSetExpression.java30 private final List<RuleSetExpression> children; field in RuleSetExpression
42 if (!builder.children.isEmpty()) { in RuleSetExpression()
43 Validate.isNull(builder.error, "RuleSet with children cannot have error result"); in RuleSetExpression()
44 Validate.isNull(builder.endpoint, "RuleSet with children cannot have endpoint result"); in RuleSetExpression()
45 this.children = Collections.unmodifiableList(new ArrayList<>(builder.children)); in RuleSetExpression()
50 this.children = null; in RuleSetExpression()
55 this.children = null; in RuleSetExpression()
91 for (RuleSetExpression expr : children) { in appendTo()
128 public List<RuleSetExpression> children() { in children() method in RuleSetExpression
129 return children; in children()
[all …]

12345678910>>...206