| /external/antlr/antlr-3.4/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/antlr/antlr-3.4/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 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.
53 if ( children==null || i>=children.size() ) { in getChild()
56 return (Tree)children.get(i); in getChild()
59 /** Get the children internal List; note that if you directly mess with
63 return children; in getChildren()
67 for (int i = 0; children!=null && i < children.size(); i++) { in getFirstChildWithType()
[all …]
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| D | ANTLRBaseTree.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 ) [children release];
111 if ( children == nil || i >= [children count] ) {
114 return (id<ANTLRBaseTree>)[children objectAtIndex:i];
117 /** Get the children internal List; note that if you directly mess with
120 - (AMutableArray *) children
[all …]
|
| /external/antlr/antlr-3.4/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/antlr-3.4/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/chromium-trace/catapult/tracing/tracing/base/ |
| D | multi_dimensional_view_test.html | 56 var expectedStructureChildren = expectedStructureNode.children;
76 // Check the children.
77 var expectedStructureChildNodes = expectedStructureNode.children;
78 var actualTreeChildNodes = actualTreeNode.children;
103 // Check that the expected structure doesn't contain two children with
255 // there is no need to visit its children.
266 // children.
268 node.children.forEach(function(singleDimensionChildren) {
355 // Node children.
356 var children = node.children;
[all …]
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | BaseTree.cs | 42 * actually have any user data. ANTLR v3 uses a list of children approach
44 * an empty node whose children represent the list. An empty, but
60 * as there are no fields other than the children list, which cannot
61 * be copied as the children are not considered part of this node.
69 * Get the children internal List; note that if you directly mess with
73 public virtual IList<ITree> Children property in Antlr.Runtime.Tree.BaseTree
92 if ( Children == null )
95 return Children.Count;
174 if ( Children == null || i >= Children.Count ) in GetChild()
177 return Children[i]; in GetChild()
[all …]
|
| /external/chromium-trace/catapult/tracing/tracing/ui/analysis/ |
| D | memory_dump_heap_details_pane_test.html | 259 checkRows(columns, row.subRows, expectedRowStructure.children);
328 generator.push('children: ');
422 children: [
428 children: [
434 children: [
446 children: [
466 children: [
498 children: [
532 children: [
538 children: [
[all …]
|
| /external/libweave/src/notification/ |
| D | xml_node_unittest.cc | 76 EXPECT_TRUE(node_->children().empty()); in TEST_F()
94 EXPECT_EQ(1u, node_->children().size()); in TEST_F()
95 EXPECT_EQ("child", node_->children().front()->name()); in TEST_F()
96 EXPECT_EQ(node_.get(), GetParent(*node_->children().front().get())); in TEST_F()
159 auto children = node_->FindChildren("node3", false); in TEST_F() local
160 ASSERT_EQ(1u, children.size()); in TEST_F()
161 EXPECT_EQ("node3", children[0]->name()); in TEST_F()
162 EXPECT_EQ("6", children[0]->GetAttributeOrEmpty("id")); in TEST_F()
164 children = node_->FindChildren("node3", true); in TEST_F()
165 ASSERT_EQ(4u, children.size()); in TEST_F()
[all …]
|
| /external/chromium-trace/catapult/catapult_base/catapult_base/refactor/annotated_symbol/ |
| D | import_statement.py | 25 def Annotate(cls, symbol_type, children): argument
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): argument
63 return cls(symbol_type, children)
67 return self.children[0].value
71 self.children[0].value = value
75 if len(self.children) < 3:
[all …]
|
| 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): argument
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, cut the list down to size.
67 # Modify existing children. This helps preserve comments and spaces.
[all …]
|
| /external/antlr/antlr-3.4/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/chromium-trace/catapult/third_party/vinn/third_party/parse5/lib/tree_adapters/ |
| D | htmlparser2.js | 15 childNodes: 'children',
32 var children = this.children;
33 return children && children[0] || null;
37 var children = this.children;
38 return children && children[children.length - 1] || null;
70 children: [] property
94 children: [], property
127 for (var i = 0; i < document.children.length; i++) {
128 if (document.children[i].type === 'directive' && document.children[i].name === '!doctype') {
129 doctypeNode = document.children[i];
[all …]
|
| /external/antlr/antlr-3.4/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/chromium-trace/catapult/catapult_base/catapult_base/refactor/ |
| D | snippet.py | 34 def children(self): member in Snippet
35 """Return a list of this node's children."""
58 for child in self.children:
63 for child in self.children:
76 raise ValueError('%s is not in %s. Children are: %s' %
77 (snippet_type, self, self.children))
81 for child in self.children:
85 for child in self.children:
129 def children(self): member in TokenSnippet
157 def __init__(self, symbol_type, children): argument
[all …]
|
| /external/chromium-trace/catapult/tracing/tracing/model/ |
| D | global_memory_dump_test.html | 184 * children: List of tree recipes for child MADs (no children if undefined).
235 if (treeRecipe.children !== undefined) {
236 treeRecipe.children.forEach(function(childTreeRecipe) {
237 // Virtual children are added during size calculation.
243 dump.children.push(childDump);
306 'children': [
320 'children': [
355 assert.lengthOf(dump.children, expectedChildrenCount);
400 var isolate1Dump = v8Dump.children[0];
403 var isolate3Dump = v8Dump.children[1];
[all …]
|
| /external/elfutils/tests/ |
| D | run-show-abbrev.sh | 24 abbrev[0]: code = 1, tag = 17, children = 1
32 abbrev[19]: code = 2, tag = 46, children = 1
43 abbrev[44]: code = 3, tag = 46, children = 1
51 abbrev[63]: code = 4, tag = 24, children = 0
52 abbrev[68]: code = 5, tag = 46, children = 1
59 abbrev[85]: code = 6, tag = 36, children = 0
63 abbrev[96]: code = 7, tag = 52, children = 0
70 abbrev[0]: code = 1, tag = 17, children = 1
78 abbrev[19]: code = 2, tag = 46, children = 0
88 abbrev[42]: code = 3, tag = 36, children = 0
[all …]
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/recursive/ |
| D | HumanTest.java | 54 String etalon = Util.getLocalResource("recursive/no-children-1.yaml"); in testNoChildren()
83 String etalon = Util.getLocalResource("recursive/no-children-1-pretty.yaml"); in testNoChildrenPretty()
125 Set<Human> children = new LinkedHashSet<Human>(2); in testChildren() local
126 children.add(son); in testChildren()
127 children.add(daughter); in testChildren()
128 father.setChildren(children); in testChildren()
129 mother.setChildren(children); in testChildren()
134 String etalon = Util.getLocalResource("recursive/with-children.yaml"); in testChildren()
137 humanDescription.putMapPropertyType("children", Human.class, Object.class); in testChildren()
195 Set<Human> children = new LinkedHashSet<Human>(2); in testChildrenPretty() local
[all …]
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/recursive/generics/ |
| D | HumanGenericsTest.java | 60 String etalon = Util.getLocalResource("recursive/generics/no-children-1.yaml"); in testNoChildren()
94 String etalon = Util.getLocalResource("recursive/generics/no-children-2.yaml"); in testNoChildren2()
140 Set<HumanGen> children = new LinkedHashSet<HumanGen>(2); in testChildren() local
141 children.add(son); in testChildren()
142 children.add(daughter); in testChildren()
143 father.setChildren(children); in testChildren()
144 mother.setChildren(children); in testChildren()
149 humanDescription.putMapPropertyType("children", HumanGen.class, Object.class); in testChildren()
155 String etalon = Util.getLocalResource("recursive/generics/with-children.yaml"); in testChildren()
213 HashMap<HumanGen2, String> children = new LinkedHashMap<HumanGen2, String>(2); in testChildren2() local
[all …]
|
| /external/droiddriver/src/io/appium/droiddriver/scroll/ |
| D | SentinelStrategy.java | 47 // Include invisible children by default. in Getter()
71 protected abstract UiElement getSentinel(List<? extends UiElement> children); in getSentinel() 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) {
118 return children.size() < 2 ? null : children.get(children.size() - 2);
132 protected UiElement getSentinel(List<? extends UiElement> children) {
133 return children.size() <= 1 ? null : children.get(1);
[all …]
|
| /external/deqp/external/vulkancts/framework/vulkan/ |
| D | vkBinaryRegistry.cpp | 144 std::vector<SparseIndexNode*> children; member
158 for (size_t ndx = 0; ndx < children.size(); ndx++) in ~SparseIndexNode()
159 delete children[ndx]; in ~SparseIndexNode()
177 for (size_t childNdx = 0; childNdx < group->children.size(); childNdx++) in addToSparseIndex()
179 if (group->children[childNdx]->word == curWord) in addToSparseIndex()
181 child = group->children[childNdx]; in addToSparseIndex()
190 group->children.reserve(group->children.size()+1); in addToSparseIndex()
191 group->children.push_back(new SparseIndexNode(curWord, numWords == 1 ? index : 0)); in addToSparseIndex()
193 child = group->children.back(); in addToSparseIndex()
208 for (size_t childNdx = 0; childNdx < group->children.size(); childNdx++) in normalizeSparseIndex()
[all …]
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/db/ |
| D | AbstractResults.java | 24 * Each results gives access to specific children depending on model.
41 List children; field in AbstractResults
47 this.children = new ArrayList(); in AbstractResults()
53 this.children = new ArrayList(); in AbstractResults()
63 int size = this.children.size(); in addChild()
65 Object results = this.children.get(i); in addChild()
67 this.children.add(i, child); in addChild()
72 this.children.add(child); in addChild()
105 * Return an array built on the current results children list.
107 * @return An array of the children list
[all …]
|
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| D | ShadowViewGroup.java | 21 private List<View> children = new ArrayList<View>(); field in ShadowViewGroup
32 for (View child : children) { in findViewById()
48 for (View child : children) { in findViewWithTag()
66 children.add(child); in addView()
68 children.add(index, child); in addView()
92 if (children.get(i) == child) { in indexOfChild()
101 return children.size(); in getChildCount()
106 if( index >= children.size() ){ return null; } in getChildAt()
107 return children.get(index); in getChildAt()
112 for (View child : children) { in removeAllViews()
[all …]
|
| /external/chromium-trace/catapult/tracing/tracing/ui/base/ |
| D | table_test.html | 47 var firstColumnHeader = table.$.head.children[0].children[0];
58 assert.lengthOf(table.$.body.children, 0);
84 var firstColumnHeader = table.$.head.children[0].children[0];
88 assert.lengthOf(table.$.body.children, 1);
124 assert.lengthOf(table.$.body.children, 2);
167 assert.equal(table.$.body.children.length, 2);
168 assert.equal(table.$.foot.children.length, 2);
451 assert.equal(table.$.head.children.length, 0);
458 assert.equal(table.$.head.children.length, 0);
523 var h1FirstCol = table1.$.head.children[0].children[0];
[all …]
|
| /external/guice/lib/build/ |
| D | safesax.jar | ... .lang.String getMessage ()
}
safesax/Children$Child.class
Children.java
package safesax
safesax ... |