| /development/tools/idegen/src/ |
| Configuration.java | 72 traverse(new File("."), sourceRoots, jarFiles, excludedDirs, excludes); method
95 // TODO: Traverse all vendor-specific directories.
114 private static void traverse(File directory, Set<File> sourceRoots, method in class:Configuration
160 // Traverse nested directories.
167 traverse(file, sourceRoots, jarFiles, excludedDirs, method
|
| /external/v8/test/cctest/ |
| test-strings.cc | 3 // Check that we can traverse very deep stacks of ConsStrings using
201 static void Traverse(Handle<String> s1, Handle<String> s2) {
231 TEST(Traverse) {
244 Traverse(flat, symmetric);
246 Traverse(flat, left_asymmetric);
248 Traverse(flat, right_asymmetric);
261 Traverse(flat, left_asymmetric);
265 Traverse(flat, right_asymmetric);
269 Traverse(flat, symmetric);
|
| /external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
| OutputGLSL.cpp | 401 node->getCondition()->traverse(this);
403 node->getTrueBlock()->traverse(this);
405 node->getFalseBlock()->traverse(this);
411 node->getCondition()->traverse(this);
444 node->traverse(this);
484 // Traverse function parameters.
488 params->traverse(this);
490 // Traverse function body.
620 node->getInit()->traverse(this);
624 node->getCondition()->traverse(this)
[all...] |
| Compiler.cpp | 181 root->traverse(&validate);
188 root->traverse(&collect);
|
| parseConst.cpp | 132 (*p)->traverse(this);
233 root->traverse(&it);
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| TreeWalker2Result.java | 69 public void traverse(int pos) throws org.xml.sax.SAXException method in class:TreeWalker2Result
74 super.traverse(pos);
|
| /external/v8/test/mjsunit/tools/ |
| profile_view.js | 72 view.traverse(fillFlatTree);
89 view.traverse(fillFlatTree);
|
| /bionic/libc/string/ |
| strlcpy.c | 42 /* Not enough room in dst, add NUL and traverse rest of src */
|
| /external/llvm/lib/Support/ |
| regstrlcpy.c | 43 /* Not enough room in dst, add NUL and traverse rest of src */
|
| /external/llvm/test/CodeGen/ARM/ |
| 2011-04-27-IfCvtBug.ll | 4 ; successors) and use inverse depth first search to traverse the BBs. However
|
| /frameworks/base/packages/SettingsProvider/res/values/ |
| defaults.xml | 85 <!-- DPAD/Trackball UP - traverse previous on current axis and send an event. -->
87 <!-- DPAD/Trackball DOWN - traverse next on current axis and send an event. -->
89 <!-- DPAD/Trackball LEFT - traverse previous on the character navigation axis and send event. -->
91 <!-- DPAD/Trackball RIGHT - traverse next on the character navigation axis end send event. -->
|
| /external/e2fsprogs/lib/blkid/ |
| blkidP.h | 32 * We can traverse all of the tags by bid_tags (linking to the tag bit_names).
86 * We can traverse all of the found devices via bic_list.
87 * We can traverse all of the tag types by bic_tags, which hold empty tags
|
| /external/v8/tools/ |
| profile_view.js | 52 callTree.traverse(function(node, viewParent) {
125 this.traverse(function (node) {
136 ProfileView.prototype.traverse = function(f) {
|
| profile.js | 267 this.topDownTree_.traverse(f);
277 this.bottomUpTree_.traverse(f);
556 this.traverse(function(node, parent) {
585 * callTree.traverse(function(node, parentClone) {
595 CallTree.prototype.traverse = function(f) {
619 function traverse(node) {
621 node.forEachChild(traverse);
624 traverse(this.root_);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentNavigableMap.java | 97 * and guarantees to traverse elements as they existed upon
118 * and guarantees to traverse elements as they existed upon
141 * and guarantees to traverse elements as they existed upon
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 90 // traverse the singly-linked list of entries in the bucket:
114 // traverse the singly-linked list of entries in the bucket:
133 // traverse the singly-linked list of entries in the bucket:
177 // traverse the singly-linked list of entries in the bucket:
220 // traverse the singly-linked list of entries in the bucket:
|
| ObjectIntMap.java | 95 // traverse the singly-linked list of entries in the bucket:
123 // traverse the singly-linked list of entries in the bucket:
170 // traverse the singly-linked list of entries in the bucket:
216 // traverse the singly-linked list of entries in the bucket:
|
| /bionic/libc/wchar/ |
| wcslcpy.c | 61 /* Not enough room in dst, add NUL and traverse rest of src */
|
| /external/chromium/third_party/libevent/ |
| strlcpy.c | 66 /* Not enough room in dst, add NUL and traverse rest of src */
|
| /system/core/libcutils/ |
| memory.c | 81 /* Not enough room in dst, add NUL and traverse rest of src */
|
| /packages/inputmethods/LatinIME/native/src/ |
| unigram_dictionary.cpp | 534 // we want to traverse its children (or if the length match, evaluate its frequency).
546 // If we had a match and the word has children, we want to traverse them. We don't have
547 // to traverse words longer than the one we are searching for, since they will not match
548 // anyway, so don't traverse unless inputIndex < length.
584 // ProcessCurrentNode returns a boolean telling whether to traverse children nodes or not.
589 // If the return value is true, then the caller must proceed to traverse the children of this
658 // "don't traverse children".
686 // This character matched the typed character (enough to traverse the node at least)
689 // the node, output the siblings position, and return false "don't traverse children".
711 // Now we finished processing this node, and we want to traverse children. If there are n
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemCopyOf.java | 170 tw.traverse(child);
179 tw.traverse(pos);
|
| /external/chromium/chrome/browser/sync/glue/ |
| autofill_model_associator.h | 131 // profiles. There is a Traverse* method for each of these.
145 // Once the above traversals are complete, we traverse the sync model to
|
| /external/chromium/chrome/browser/ui/cocoa/applescript/ |
| bookmark_folder_applescript.mm | 179 // Traverse through all the child nodes till the required node is found and
192 // Traverse through all the child nodes till the required node is found and
|
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| PODIntervalTree.h | 123 // See whether we need to traverse the left subtree.
135 // See whether we need to traverse the right subtree.
|
