| /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/ |
| ConfigResults.java | 86 int size = this.children.size();
89 BuildResults buildResults = (BuildResults) this.children.get(i);
141 BuildResults buildResults = (BuildResults) this.children.get(i);
160 BuildResults buildResults = (BuildResults) this.children.get(i);
179 AbstractResults buildResults = (AbstractResults) this.children.get(i);
218 BuildResults buildResults = (BuildResults) this.children.get(i);
432 BuildResults buildResults = (BuildResults) this.children.get(i);
475 BuildResults buildResults = (BuildResults) this.children.get(i);
493 this.baseline = (lastBaseline == null) ? (BuildResults) this.children.get(0) : lastBaseline;
497 BuildResults previous = (BuildResults) this.children.get(idx--)
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/ |
| FusionDictionary.java | 86 * A group of characters, with a frequency, shortcut targets, bigrams, and children.
91 * of the trie trie; as such, it can be a terminal, and it can have children.
95 * bigrams, but a non-terminal may not. Moreover, children, if present, are null.
118 final ArrayList<WeightedString> bigrams, final int frequency, final Node children) {
123 mChildren = children;
643 // if (!isEqual(aGroup.children, bGroup.children)) return false;
654 // if (null != group.children) {
655 // String pseudoHash = getPseudoHash(group.children);
663 // if (isEqual(group.children, similar))
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/animation/ |
| FixedGridLayout.java | 26 * A layout that arranges its children in a grid. The size of the
68 // clipping transitioning children
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| BaseTreeAdaptor.cs | 142 * in list children of t. Warning: if t has no children, but child does
143 * and child isNil then you can decide it is ok to move children to t via
144 * t.children = child.children; i.e., without copying the array. Just
158 * If oldRoot is a nil root, just copy or move the children to newRoot.
182 * children; i.e., you don't have to copy the list. We are
209 // is a flat list (i.e., nil-rooted tree). All children of oldRoot
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRTreeParser.h | 63 * entire tree if node has children. If children, scan until
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRTreeParser.h | 63 * entire tree if node has children. If children, scan until
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRTreeParser.h | 63 * entire tree if node has children. If children, scan until
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRBaseTreeAdaptor.m | 133 * in list children of t. Warning: if t has no children, but child does
134 * and child isNil then you can decide it is ok to move children to t via
135 * t.children = child.children; i.e., without copying the array. Just
146 /** If oldRoot is a nil root, just copy or move the children to newRoot.
168 * children; i.e., you don't have to copy the list. We are
190 // is a flat list (i.e., nil-rooted tree). All children of oldRoot
|
| ANTLRTreeParser.h | 63 * entire tree if node has children. If children, scan until
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| constants.rb | 69 # children of a node
72 # Imaginary tree-navigation token type indicating a descent into the children of a node
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemApplyImport.java | 98 * @param newChild New element to append to this element's children list
100 * @return null, xsl:apply-Imports cannot have children
|
| ElemFallback.java | 81 * children, then the content of each of the xsl:fallback children
|
| /external/chromium/chrome/browser/extensions/ |
| extension_bookmark_manager_api.cc | 91 ListValue* children = new ListValue(); local
93 AddNodeToList(children, *node.GetChild(i));
94 dict->Set(keys::kChildrenKey, children);
111 ListValue* children = new ListValue(); local
112 for (size_t i = 0; i < element.children.size(); ++i)
113 AddElementToList(children, element.children[i]);
114 dict->Set(keys::kChildrenKey, children);
|
| /external/chromium/chrome/browser/resources/gpu_internals/ |
| timeline.js | 202 for (var i = 0; i < this.tracks_.children.length; ++i) {
203 var track = this.tracks_.children[i];
220 for (var i = 0; i < this.tracks_.children.length; ++i) {
221 this.tracks_.children[i].redraw();
226 for (var cI = 0; cI < this.tracks_.children.length; ++cI) {
227 var child = this.tracks_.children[cI];
395 for (i = 0; i < this.tracks_.children.length; ++i) {
396 var track = this.tracks_.children[i];
|
| /external/chromium/chrome/browser/safe_browsing/ |
| malware_details.h | 101 // relationship. |parent| and |tagname| can be empty, |children| can be NULL.
105 const std::vector<GURL>* children);
|
| /external/chromium/chrome/browser/sync/engine/ |
| change_reorder_buffer.h | 29 // (b) For Updated and/or Added items, parents appear before their children.
38 // its children.
|
| /external/clang/include/clang/AST/ |
| EvaluatedExprVisitor.h | 72 /// \brief The basis case walks all of the children of the statement or
75 for (Stmt::child_range C = S->children(); C; ++C)
|
| /external/quake/quake/src/QW/server/ |
| worlda.s | 100 // num = node->children[1];
102 // num = node->children[0];
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| ObjectManager.java | 21 * an object manager invokes update on its children. ObjectManagers themselves are derived from
24 * children).
|
| /external/skia/include/utils/ |
| SkLayer.h | 49 // children
89 after this layer draws (but before its children draw).
|
| /external/valgrind/main/coregrind/ |
| m_options.c | 251 /*=== --trace-children= support ===*/
269 This involves considering --trace-children=,
270 --trace-children-skip=, --trace-children-skip-by-arg=, and the name
283 // If --trace-children=no, the answer is simply NO.
289 // by --trace-children-skip=.
314 // by --trace-children-skip-by-arg=.
342 // --trace-children=yes, and this particular executable isn't
|
| /external/webkit/LayoutTests/dom/html/level1/core/ |
| hc_elementgetelementsbytagnameaccessnodelist.js | 79 of all descendant Elements in the order the children
86 "5" in the order the children were encountered.
|
| hc_elementgetelementsbytagnamespecialvalue.js | 84 The method should return all the descendant children(6)
85 in the order the children were encountered.
|
| hc_nodeappendchildinvalidnodetype.js | 80 a type that does not allow children of the type "newChild"
84 created Attr node. An Element node cannot have children
|
| hc_nodechildnodesappendchild.js | 79 is live. Changes on the node's children are immediately
82 Create a NodeList of the children of the second employee
|
