| /external/valgrind/main/memcheck/tests/ |
| execve2.vgtest | 2 vgopts: -q --trace-children=yes
|
| file_locking.vgtest | 2 vgopts: -q --trace-children=yes
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| 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]
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| 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 class: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() ) {
56 return (Tree)children.get(i);
59 /** Get the children internal List; note that if you directly mess with
63 return children;
[all...] |
| /packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/ |
| SimpleNode.java | 7 protected Node[] children; field in class:SimpleNode
30 if (children == null) {
31 children = new Node[i + 1];
32 } else if (i >= children.length) {
34 System.arraycopy(children, 0, c, 0, children.length);
35 children = c;
37 children[i] = n;
41 return children[i];
45 return (children == null) ? 0 : children.length
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| 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]
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/META-INF/ |
| eclipse.inf | 2 jarprocessor.exclude.children.sign = true
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.pde.build_3.6.1.R36x_v20100823/META-INF/ |
| eclipse.inf | 2 jarprocessor.exclude.children = true
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.junit_3.8.2.v3_8_2_v20100427-1100/META-INF/ |
| eclipse.inf | 2 jarprocessor.exclude.children.sign = true
|
| /external/valgrind/main/VEX/ |
| HACKING.README | 2 This directory and its children contain LibVEX, a library for dynamic
|
| /external/chromium/chrome/browser/extensions/ |
| extension_bookmarks_unittest.cc | 38 ListValue* children; local
39 tree->GetList(keys::kChildrenKey, &children);
40 ASSERT_EQ(3U, children->GetSize());
48 ListValue* children; local
49 tree->GetList(keys::kChildrenKey, &children);
50 ASSERT_EQ(1U, children->GetSize());
58 ListValue* children; local
59 tree->GetList(keys::kChildrenKey, &children);
60 ASSERT_EQ(4U, children->GetSize());
62 ASSERT_TRUE(children->GetDictionary(1, &digg))
73 ListValue* children; local
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3basetree.c | 75 tree->children = NULL;
101 if (tree->children != NULL)
103 cs = tree->children->size(tree->children);
106 t = (pANTLR3_BASE_TREE) (tree->children->get(tree->children, i));
121 if ( tree->children == NULL
122 || i >= tree->children->size(tree->children))
126 return tree->children->get(tree->children, i)
[all...] |
| /cts/tests/tests/view/src/android/view/animation/cts/ |
| AnimationSetTest.java | 78 List<Animation> children = animationSet.getAnimations(); local
79 assertEquals(SHORT_CHILD_DURATION, children.get(0).getDuration());
80 assertEquals(MEDIUM_CHILD_DURATION, children.get(1).getDuration());
81 assertEquals(LONG_CHILD_DURATION, children.get(2).getDuration());
87 children = animationSet.getAnimations();
88 assertEquals(ANIMATIONSET_DURATION, children.get(0).getDuration());
89 assertEquals(ANIMATIONSET_DURATION, children.get(1).getDuration());
90 assertEquals(ANIMATIONSET_DURATION, children.get(2).getDuration());
115 List<Animation> children = animationSet.getAnimations(); local
116 children.get(0).setFillAfter(true)
132 List<Animation> children = animationSet.getAnimations(); local
153 final List<Animation> children = animationSet.getAnimations(); local
176 final List<Animation> children = animationSet.getAnimations(); local
193 final List<Animation> children = animationSet.getAnimations(); local
203 List<Animation> children = animationSet.getAnimations(); local
222 List<Animation> children = animationSet.getAnimations(); local
239 List<Animation> children = animationSet.getAnimations(); local
266 List<Animation> children = animationSet.getAnimations(); local
307 final List<Animation> children = animationSet.getAnimations(); local
337 final List<Animation> children = animationSet.getAnimations(); local
377 final List<Animation> children = animationSet.getAnimations(); local
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| 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 class: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 {
70 return children;
78 if (Children == null)
81 return Children.Count
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| 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
92 if ( Children == null )
95 return Children.Count;
174 if ( Children == null || i >= Children.Count
[all...] |
| AntlrRuntime_BaseTreeDebugView.cs | 47 public ITree[] Children
51 if (_tree == null || _tree.Children == null)
54 ITree[] children = new ITree[_tree.Children.Count];
55 _tree.Children.CopyTo(children, 0);
56 return children;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| wait.h | 11 #define __WNOTHREAD 0x20000000 /* Don't wait on children of other threads in this group */
12 #define __WALL 0x40000000 /* Wait on all children, regardless of type */
13 #define __WCLONE 0x80000000 /* Wait only on non-SIGCHLD children */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| wait.h | 11 #define __WNOTHREAD 0x20000000 /* Don't wait on children of other threads in this group */
12 #define __WALL 0x40000000 /* Wait on all children, regardless of type */
13 #define __WCLONE 0x80000000 /* Wait only on non-SIGCHLD children */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| wait.h | 11 #define __WNOTHREAD 0x20000000 /* Don't wait on children of other threads in this group */
12 #define __WALL 0x40000000 /* Wait on all children, regardless of type */
13 #define __WCLONE 0x80000000 /* Wait only on non-SIGCHLD children */
|
| /external/doclava/src/com/google/doclava/ |
| NavTree.java | 27 List<Node> children = new ArrayList<Node>(); local
29 children.add(makePackageNode(pkg));
31 Node node = new Node("Reference", dir + "packages.html", children, null);
50 List<Node> children = new ArrayList<Node>(); local
52 addClassNodes(children, "Interfaces", pkg.interfaces());
53 addClassNodes(children, "Classes", pkg.ordinaryClasses());
54 addClassNodes(children, "Enums", pkg.enums());
55 addClassNodes(children, "Exceptions", pkg.exceptions());
56 addClassNodes(children, "Errors", pkg.errors());
58 return new Node(pkg.name(), pkg.htmlPage(), children, pkg.getSince())
62 List<Node> children = new ArrayList<Node>(); local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
| MockNodeList.java | 33 * Constructs a node list from a given children list.
35 * @param children The children list. Can be null.
37 public MockNodeList(MockXmlNode[] children) {
39 if (children != null) {
40 for (MockXmlNode n : children) {
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| CompositeGrammarTree.java | 35 protected List<CompositeGrammarTree> children; field in class:CompositeGrammarTree
50 if ( children==null ) {
51 children = new ArrayList<CompositeGrammarTree>();
53 children.add(t);
62 for (int i = 0; r==null && children!=null && i < children.size(); i++) {
63 CompositeGrammarTree child = children.get(i);
93 for (int i = 0; n==null && children!=null && i < children.size(); i++) {
94 CompositeGrammarTree child = children.get(i)
[all...] |
| /external/chromium/chrome/browser/accessibility/ |
| renderer_accessibility_browsertest.cc | 52 for (size_t i = 0; i < node.children.size(); i++)
53 RecursiveAssertUniqueIds(node.children[i], ids);
119 ASSERT_EQ(1U, tree.children.size());
120 const WebAccessibility& body = tree.children[0];
125 // Check properties of the two children of the BODY element.
126 ASSERT_EQ(2U, body.children.size());
128 const WebAccessibility& button = body.children[0];
141 const WebAccessibility& checkbox = body.children[1];
168 ASSERT_EQ(1U, tree.children.size());
169 const WebAccessibility& body = tree.children[0]
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| 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 {
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
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| NodeListImpl.java | 36 private List<NodeImpl> children; field in class:NodeListImpl
39 children = new ArrayList<NodeImpl>();
43 children = list;
47 children.add(node);
51 return children.size();
55 if (index >= children.size()) {
58 return children.get(index);
|
