| /frameworks/base/cmds/statsd/tests/condition/ |
| CombinationConditionTracker_test.cpp | 30 vector<int> children; local
31 children.push_back(0);
32 children.push_back(1);
33 children.push_back(2);
40 EXPECT_EQ(evaluateCombinationCondition(children, operation, conditionResults),
47 vector<int> children; local
48 children.push_back(0);
49 children.push_back(1);
50 children.push_back(2);
57 EXPECT_FALSE(evaluateCombinationCondition(children, operation, conditionResults))
71 vector<int> children; local
95 vector<int> children; local
112 vector<int> children; local
137 vector<int> children; local
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRBaseTree.h | 31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRBaseTree.h | 31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRBaseTree.h | 31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRBaseTree.h | 42 - (AMutableArray *)children;
48 // is nil, add all children of t to this' children.
58 // Indicates the node is a nil node but may still have children, meaning
79 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
98 @property (retain) AMutableArray *children; variable
105 __strong AMutableArray *children; variable
117 - (AMutableArray *)children;
125 // is nil, add all children of t to this' children
173 @property (retain) AMutableArray *children; variable
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| TreeTraverser.java | 58 * Returns the children of the specified node. Must not contain null.
60 public abstract Iterable<T> children(T root); method in class:TreeTraverser
67 * iteration is in progress or when the iterators generated by {@link #children} are advanced.
104 Iterator<T> childItr = children(result).iterator();
117 * iteration is in progress or when the iterators generated by {@link #children} are advanced.
168 return new PostOrderNode<T>(t, children(t).iterator());
177 * iteration is in progress or when the iterators generated by {@link #children} are advanced.
211 Iterables.addAll(queue, children(result));
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeTraverser.java | 50 * Returns the children of the specified node. Must not contain null.
52 public abstract Iterable<T> children(T root); method in class:TreeTraverser
59 * iteration is in progress or when the iterators generated by {@link #children} are advanced.
96 Iterator<T> childItr = children(result).iterator();
109 * iteration is in progress or when the iterators generated by {@link #children} are advanced.
160 return new PostOrderNode<T>(t, children(t).iterator());
169 * iteration is in progress or when the iterators generated by {@link #children} are advanced.
203 for (T child : children(result)) {
|
| /external/deqp/modules/gles2/functional/ |
| es2fShaderExecuteTest.cpp | 58 vector<TestNode*> children = shaderLibrary.loadShaderFile(fileName.c_str()); local
60 for (int i = 0; i < (int)children.size(); i++)
61 addChild(children[i]);
|
| /external/turbine/java/com/google/turbine/binder/bound/ |
| BoundClass.java | 42 ImmutableMap<String, ClassSymbol> children(); method in interface:BoundClass
|
| /external/valgrind/memcheck/tests/ |
| threadname.c | 16 static pthread_t children[3]; variable
54 r = pthread_create(&children[2], NULL, child_fn_2, NULL);
57 r = pthread_join(children[2], NULL);
69 r = pthread_create(&children[1], NULL, child_fn_1, NULL);
72 r = pthread_join(children[1], NULL);
84 r = pthread_create(&children[0], NULL, child_fn_0, NULL);
87 r = pthread_join(children[0], NULL);
|
| /frameworks/base/services/core/java/com/android/server/firewall/ |
| FilterList.java | 27 protected final ArrayList<Filter> children = new ArrayList<Filter>(); field in class:FilterList
39 children.add(filter);
|
| /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);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
91 // Provide iterator ranges for the graph traits nodes and children
107 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
91 // Provide iterator ranges for the graph traits nodes and children
107 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| GraphTraits.h | 34 // typedef ChildIteratorType - Type used to iterate over children in graph,
86 // Provide iterator ranges for the graph traits nodes and children
102 children(const typename GraphTraits<GraphType>::NodeRef &G) { function in namespace:llvm
|
