| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/stlport/stlport/ |
| printers.py | 93 # Walk down to left-most child in right subtree.
98 # Walk up to first parent reached via left subtree.
|
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/stlport/stlport/ |
| printers.py | 94 # Walk down to left-most child in right subtree.
99 # Walk up to first parent reached via left subtree.
|
| /dalvik/vm/interp/ |
| Jit.cpp | 568 * Walk the bucket chain to find an exact match for our PC and trace/method
582 * slot in the chain. Possibly continue the chain walk in case
611 /* Linear walk to find a free cell and add it to the end */
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 365 /// walk recursively from start until stop. You can always return
721 /// Walk tree with depth-first-search and fill nodes buffer.
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Grammar.java | 484 * Computed during NFA to DFA conversion. Just walk accept states
943 /** Walk the list of options, altering this Grammar object according
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| CodeGenerator.java | 268 /** Given the grammar to which we are attached, walk the AST associated
271 * Finally, walk the AST again to generate code.
416 // Walk the AST holding the input grammar, this time generating code
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SelectorChecker.cpp | 97 // CrossesBoundary means we don't care any context.scope. So we can walk up from a shadow root to its shadow host.
101 // If context.scope is not a shadow host, we cannot walk up from a shadow root to its shadow host.
105 // If behaviorAtBoundary is StaysWithInTreeScope, we cannot walk up from a shadow root to its shadow host.
[all...] |
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| Blend.cpp | 830 // Walk the Region of interest and populate the pyramid
914 // Walk the Region of interest and populate the pyramid
[all...] |
| /art/runtime/gc/space/ |
| dlmalloc_space.cc | 466 void DlMallocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg),
|
| /art/runtime/ |
| thread.cc | [all...] |
| zip_archive.cc | 513 // Walk through the central directory, adding entries to the hash
|
| /cts/libs/json/src/com/android/json/stream/ |
| JsonWriter.java | 34 * writer as you walk the structure's contents, nesting arrays and objects as
|
| /cts/tools/dasm/src/java_cup/ |
| lalr_item.java | 240 /* walk down the rhs and bail if we get a non-nullable symbol */
|
| /dalvik/vm/analysis/ |
| VfyBasicBlock.cpp | 334 * computation at each step, we just walk the "try" list in parallel.
|
| /development/samples/ApiDemos/src/com/example/android/apis/ |
| Shakespeare.java | 48 "Over whose acres walk'd those blessed feet" +
|
| /development/samples/ApiDemos/src/com/example/android/apis/view/ |
| List6.java | 169 "Over whose acres walk'd those blessed feet" +
|
| /development/samples/Support13Demos/src/com/example/android/supportv13/ |
| Shakespeare.java | 48 "Over whose acres walk'd those blessed feet" +
|
| /development/samples/Support4Demos/src/com/example/android/supportv4/ |
| Shakespeare.java | 48 "Over whose acres walk'd those blessed feet" +
|
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
| gUnitBaseTest.java | 366 // Walk resulting tree; create tree nodes stream first
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| LegacyCommonTokenStream.cs | 175 * Walk past any token not on the channel the parser is listening to.
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRBufferedTreeNodeStream.m | 512 // walk nodes looking for aStart
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LL1Analyzer.java | 86 // walk every rule in this grammar and compare FIRST set with
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| BitSet.java | 102 // walk set and add each interval
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 649 * <p>%OPT% An XPath-like search (walk up DOM to root, tracking path;
650 * walk down DTM reconstructing path) might be considerably faster
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| VariableStack.java | 506 // prefix resolver, and then walk backwards in document order, searching
|
