| /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/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/common/py_utils/py_utils/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/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 …]
|
| /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/common/py_utils/py_utils/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/ltp/testcases/kernel/syscalls/getrusage/ |
| D | getrusage03.c | 122 * expect: initial.children ~= 100MB, child.children = 0 */
128 tst_resm(TINFO, "initial.children = %ld", ru.ru_maxrss); in inherit_fork2()
130 tst_resm(TPASS, "initial.children ~= 100MB"); in inherit_fork2()
132 tst_resm(TFAIL, "initial.children !~= 100MB"); in inherit_fork2()
139 tst_resm(TINFO, "child.children = %ld", ru.ru_maxrss); in inherit_fork2()
147 check_return(WEXITSTATUS(status), "child.children == 0", in inherit_fork2()
148 "child.children != 0"); in inherit_fork2()
181 * expect: post_wait.children ~= 300MB */
187 tst_resm(TINFO, "initial.children = %ld", ru.ru_maxrss); in grandchild_maxrss()
207 tst_resm(TINFO, "post_wait.children = %ld", ru.ru_maxrss); in grandchild_maxrss()
[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/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_broadcast/ |
| D | 2-3.c | 54 for (_nch = 0; _nch < children.nb; _nch++) \
55 kill(children.ch[_nch].p, SIGKILL); \
62 for (_nch = 0; _nch < children.nb; _nch++) \
63 kill(children.ch[_nch].p, SIGKILL); \
164 } children; variable
436 /* Create all the children */ in main()
437 for (children.nb = 0; children.nb < NCHILDREN; children.nb++) { in main()
441 (children.ch[children.nb].t), in main()
447 children.ch[children.nb].p = fork(); in main()
448 if (children.ch[children.nb].p == 0) { in main()
[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/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/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | Trie.h | 64 NodeVectorType Children; variable
71 if (Children.empty()) in addEdge()
72 Children.push_back(N); in addEdge()
74 iterator I = std::lower_bound(Children.begin(), Children.end(), in addEdge()
77 Children.insert(I, N); in addEdge()
83 iterator I = std::lower_bound(Children.begin(), Children.end(), in setEdge()
85 assert(I != Children.end() && "Node does not exists!"); in setEdge()
124 << "Children:\n"; in dump()
126 for (iterator I = Children.begin(), E = Children.end(); I != E; ++I) in dump()
133 iterator I = std::lower_bound(Children.begin(), Children.end(), in getEdge()
[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/eigen/unsupported/Eigen/src/BVH/ |
| D | KdBVH.h | 98 children.clear();
114 children.reserve(2 * n - 2);
130 …ode, on exit, \a outVBegin and \a outVEnd range over the indices of the volume children of the node
131 * and \a outOBegin and \a outOEnd range over the object children of the node */
146 if(children[idx + 1] < numBoxes) { //second index is always bigger
147 outVBegin = &(children[idx]);
151 else if(children[idx] >= numBoxes) { //if both children are objects
153 outOBegin = &(objects[children[idx] - numBoxes]);
156 outVBegin = &(children[idx]);
158 outOBegin = &(objects[children[idx + 1] - numBoxes]);
[all …]
|
| /external/guice/lib/build/ |
| D | safesax.jar | ... .lang.String getMessage ()
}
safesax/Children$Child.class
Children.java
package safesax
safesax ... |
| /external/doclava/src/com/google/doclava/ |
| D | NavTree.java | 29 List<Node> children = new ArrayList<Node>(); in writeNavTree() local
31 children.add(makePackageNode(pkg)); in writeNavTree()
33 Node node = new Node("Reference", dir + refPrefix + "packages.html", children, null); in writeNavTree()
142 data = makeYamlHDF(cl2, base + ".children." + j, data); in makeYamlHDF()
151 List<Node> children = new ArrayList<Node>(); in makePackageNode() local
153 addClassNodes(children, "Annotations", pkg.annotations()); in makePackageNode()
154 addClassNodes(children, "Interfaces", pkg.interfaces()); in makePackageNode()
155 addClassNodes(children, "Classes", pkg.ordinaryClasses()); in makePackageNode()
156 addClassNodes(children, "Enums", pkg.enums()); in makePackageNode()
157 addClassNodes(children, "Exceptions", pkg.exceptions()); in makePackageNode()
[all …]
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| D | XMPNode.java | 47 private List children = null; field in XMPNode
101 children = null; in clear()
142 * <em>Note:</em> The node children are indexed from [1..size]!
158 * <em>Note:</em> The node children are indexed from [1..size]!
181 * If its a schema node and doesn't have any children anymore, its deleted.
193 * Removes the children list if this node has no children anymore;
194 * checks if the provided node is a schema node and doesn't have any children anymore,
199 if (children.isEmpty()) in cleanupChildren()
201 children = null; in cleanupChildren()
207 * Removes all children from the node.
[all …]
|