| /external/antlr/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/yapf/yapf/yapflib/ |
| 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 …]
|
| 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 …]
|
| D | blank_line_calculator.py | 69 if node.children[0].type == grammar_token.COMMENT:
70 self.last_comment_lineno = node.children[0].lineno
74 self.last_comment_lineno == node.children[0].lineno - 1):
75 _SetNumNewlines(node.children[0], _NO_BLANK_LINES)
77 _SetNumNewlines(node.children[0], self._GetNumNewlines(node))
78 for child in node.children:
87 for child in node.children[index:]:
98 _SetNumNewlines(node.children[0], None)
103 for child in node.children[index:]:
127 Class and function definitions have leading comments as children of the
[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/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 | 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 …]
|
| /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]
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 …]
|
| 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/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/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 …]
|
| /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 …]
|
| /external/icing/icing/result/ |
| D | projection-tree_test.cc | 34 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/ |
| D | aggregation-scorer.cc | 31 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/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/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 …]
|
| /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 …]
|
| /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)
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/antlr/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/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/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/perfetto/ui/src/frontend/widgets/ |
| D | tree.ts | 37 view({attrs, children}: m.Vnode<TreeAttrs>): m.Children {
44 return m('.pf-ptree-grid', {class: className}, children);
46 return m('.pf-ptree', {class: className}, children);
56 left?: m.Children;
59 right?: m.Children;
62 // If the node has no children, this value is never shown.
63 summary?: m.Children;
73 view(vnode: m.CVnode<TreeNodeAttrs>): m.Children {
106 const {children} = vnode; constant
109 '.pf-tree-children',
[all …]
|
| /external/rust/crates/tokio-util/src/sync/cancellation_token/ |
| D | tree_node.rs | 7 //! children.
56 children: vec![], in new()
76 children: Vec<Arc<TreeNode>>, field
92 // need no connection to parents or children any more. in child_node()
98 children: vec![], in child_node()
109 parent_idx: locked_parent.children.len(), in child_node()
110 children: vec![], in child_node()
117 locked_parent.children.push(child.clone()); in child_node()
122 /// Disconnects the given parent from all of its children.
126 for child in std::mem::take(&mut node.children) { in disconnect_children()
[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 …]
|