| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 10 postorder traversal depending on which method is called.
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_next.py | 34 order = "pre" # Pre-order tree traversal
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 10 postorder traversal depending on which method is called.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_next.py | 34 order = "pre" # Pre-order tree traversal
|
| /external/aac/libSBRdec/src/ |
| sbr_dec.h | 178 const int strideIn, /*!< Time data traversal strideIn */
179 const int strideOut, /*!< Time data traversal strideOut */
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| OneStepIterator.java | 41 /** The traversal axis from where the nodes will be filtered. */
44 /** The DTM inner traversal class, that corresponds to the super axis. */
|
| /external/chromium_org/base/ |
| platform_file.h | 133 // traversal ('..') components.
139 // Same as CreatePlatformFile but allows paths with traversal (like \..\)
|
| file_util_posix.cc | 181 FileEnumerator traversal(path, true,
184 for (FilePath current = traversal.Next(); success && !current.empty();
185 current = traversal.Next()) {
186 if (traversal.GetInfo().IsDirectory())
251 FileEnumerator traversal(from_path, recursive, traverse_type);
304 current = traversal.Next();
306 from_stat = traversal.GetInfo().stat();
|
| file_util.h | 87 // This function fails if either path contains traversal components ('..').
101 // This function fails if either path contains traversal components ('..').
142 // This function fails if the |path| contains path traversal components ('..').
442 // Same as Move but allows paths with traversal components.
447 // Same as CopyFile but allows paths with traversal components.
|
| /external/chromium_org/third_party/re2/re2/ |
| walker-inl.h | 88 // Walk state for the entire traversal.
116 // State about a single level in the traversal.
|
| /external/oprofile/pp/ |
| opreport_options.cpp | 121 // to mess up symbol traversal for XML
129 // symbol traversal all library module symbols are
|
| /external/regex-re2/re2/ |
| walker-inl.h | 88 // Walk state for the entire traversal.
116 // State about a single level in the traversal.
|
| /external/chromium/chrome/browser/ |
| browser_focus_uitest.cc | 443 // Focus traversal on a regular page.
466 // Test forward focus traversal.
516 // Now let's try reverse focus traversal.
569 // Focus traversal while an interstitial is showing.
601 // Test forward focus traversal.
644 // Now let's try reverse focus traversal.
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| refactor.py | 239 want a pre-order AST traversal, and post_order is the list that want
240 post-order traversal.
484 def traverse_by(self, fixers, traversal):
491 traversal: a generator that yields AST nodes.
498 for node in traversal:
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| refactor.py | 239 want a pre-order AST traversal, and post_order is the list that want
240 post-order traversal.
484 def traverse_by(self, fixers, traversal):
491 traversal: a generator that yields AST nodes.
498 for node in traversal:
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMIterator.java | 32 * <p>The DTMIterator's traversal semantics, i.e. how it walks the tree,
52 // Constants returned by acceptNode, borrowed from the DOM Traversal chapter
54 // org.w3c.dom.traversal.NodeFilter.FILTER_ACCEPT?
|
| /external/chromium_org/chrome/renderer/safe_browsing/ |
| phishing_dom_feature_extractor.cc | 163 // We're resuming traversal of a frame, so just advance to the next node.
165 // When we resume the traversal, the first call to nextItem() potentially
405 // Keep track of how often frame traversal got "stuck" due to the
|
| /external/chromium_org/third_party/mesa/src/src/mapi/glapi/gen/ |
| glX_server_table.py | 265 # traversal. When accumulator + M = B, where B is the
266 # maximum number of bits in an opcode, the traversal has
267 # reached a leaf node. The traversal starts with the most
|
| /external/chromium_org/v8/src/ |
| hydrogen-bce.cc | 107 // We scan the code with a dominator tree traversal.
113 // traversal.
346 // Implement depth-first traversal with a stack.
|
| /external/clang/docs/tools/ |
| dump_ast_matchers.py | 116 # traversal matcher. By default, matchers that take other matchers as
117 # arguments (and are not node matchers) do traversal. We specifically
313 traversal_matcher_table = sort_table('TRAVERSAL', traversal_matchers)
|
| /external/clang/include/clang/AST/ |
| RecursiveASTVisitor.h | 78 /// \brief A class that does preorder depth-first traversal on the
126 /// traversal strategies. Returning false from one of these overridden
127 /// functions will abort the entire traversal.
483 // class didn't override Traverse* (and thus the traversal is trivial).
833 // ----------------- Type traversal -----------------
[all...] |
| /external/llvm/include/llvm/Support/ |
| Path.h | 34 /// components in \a path. The forward traversal order is as follows:
39 /// The backwards traversal order is the reverse of forward traversal.
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 149 // block, do a forward depth-first traversal to assign postorder numbers
154 // Initialize the worklist with the roots from the backward traversal.
339 // arguments for any new PHIs added in the forward traversal.
|
| /external/mesa3d/src/mapi/glapi/gen/ |
| glX_server_table.py | 265 # traversal. When accumulator + M = B, where B is the
266 # maximum number of bits in an opcode, the traversal has
267 # reached a leaf node. The traversal starts with the most
|
| /external/chromium_org/chrome/browser/ui/ |
| browser_focus_uitest.cc | 436 // Focus traversal on a regular page.
459 // Test forward focus traversal.
509 // Now let's try reverse focus traversal.
562 // Focus traversal while an interstitial is showing.
594 // Test forward focus traversal.
637 // Now let's try reverse focus traversal.
[all...] |
