| /external/chromium/chrome/browser/sync/glue/ |
| autofill_profile_model_associator.h | 132 // Once the above traversals are complete, we traverse the sync model to
|
| /external/chromium/chrome/browser/sync/syncable/ |
| nigori_util.cc | 180 // Traverse the children.
|
| /external/chromium/chrome/common/extensions/docs/examples/api/bookmarks/basic/ |
| popup.html | 17 // Traverse the bookmark tree, and print the folder and nodes.
|
| /external/chromium/net/base/ |
| network_change_notifier_win.cc | 87 // the earlier code would traverse the entire list and pass LUP_FLUSHPREVIOUS
|
| /external/chromium_org/cc/debug/ |
| debug_rect_history.cc | 66 // not. Therefore we traverse recursively over all layers, not just the render
|
| /external/chromium_org/chrome/renderer/net/ |
| renderer_net_predictor.h | 11 // to traverse a link.
|
| /external/chromium_org/native_client_sdk/src/libraries/nacl_io/ |
| mount_mem.cc | 54 // Starting at the root, traverse the path parts.
|
| /external/chromium_org/third_party/WebKit/ManualTests/inspector/ |
| debugger-watch-expressions.html | 52 <li><p>Close down the browser, start it back up, traverse to a web site,
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| ContainerNodeAlgorithms.cpp | 140 // If we overcount it's safe, but not optimal because it means we'll traverse
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/ |
| ForLoopUnroll.cpp | 152 root->traverse(&marker);
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/depgraph/ |
| DependencyGraphBuilder.h | 162 void build(TIntermNode* intermNode) { intermNode->traverse(this); }
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| free_list.h | 69 // We only have time to do minimal checking. We don't traverse the list, but
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| hamt.h | 90 /** Traverse over all keys in HAMT, calling function on each data item.
|
| /external/chromium_org/tools/grit/grit/format/policy_templates/ |
| policy_template_generator.py | 14 This class is used to traverse a JSON structure from a .json template
|
| /external/chromium_org/ui/views/focus/ |
| focus_search.h | 29 // - |root| is the root of the view hierarchy to traverse. Focus will be
|
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| focus_manager.js | 64 // Create a TreeWalker object to traverse the DOM from |focusableDiv|.
|
| /external/eigen/doc/ |
| I15_StorageOrders.dox | 80 - Algorithms that traverse a matrix row by row will go faster when the matrix is stored in row-major order
|
| /external/emma/core/java12/com/vladium/util/ |
| SoftValueMap.java | 168 // traverse the singly-linked list of entries in the bucket:
237 // traverse the singly-linked list of entries in the bucket:
306 // traverse the singly-linked list of entries in the bucket:
557 // traverse the singly-linked list of entries in the bucket:
|
| /external/ipsec-tools/src/racoon/ |
| rsalist.c | 158 /* Always traverse the whole list */
|
| /external/kernel-headers/original/linux/ |
| proc_fs.h | 121 * "struct proc_dir_entry" tree to traverse the filesystem.
|
| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 112 /// There is no need to traverse the free lists, pulling all the objects into
|
| Recycler.h | 95 /// There is no need to traverse the free list, pulling all the objects into
|
| /frameworks/base/services/input/ |
| PointerController.h | 48 /* Gets the bounds of the region that the pointer can traverse.
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| Directory.h | 99 * \brief A DirIterator object can traverse all entries in a Directory
|
| /frameworks/compile/mclinker/lib/LD/ |
| GroupReader.cpp | 119 // after read in all the archives, traverse the archive list in a loop until
|
