HomeSort by relevance Sort by last modified time
    Searched full:traversal (Results 176 - 200 of 1617) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/v8/src/compiler/
control-equivalence.h 45 // 1) A breadth-first backwards traversal to determine the set of nodes that
47 // 2) An undirected depth-first backwards traversal that determines class
109 // traversal, edges towards the representative nodes are preferred.
  /development/vndk/tools/header-checker/header-abi-dumper/src/
ast_processing.h 51 // Enable recursive traversal of template instantiations.
  /external/annotation-tools/annotation-file-utilities/
design.tex 36 \item[Inefficient traversal.] The search strategy is
37 generate-and-test: it chooses an AST node in a preorder traversal and
46 the traversal a single pass over the annotations, with limited
165 during (a single) scene traversal; let the scene traversal rather than
166 an AST traversal be the outer loop. Advantages: since insertion is
220 The main loop of the program thus will become a pre-order traversal of
222 traversal will explore corresponding parts of the AST. In other words:
308 The \texttt{AAST}'s pretty-printer will perform an in-order traversal
  /external/apache-xml/src/main/java/org/apache/xpath/patterns/
NodeTest.java 63 * Make sure this does not conflict with {@link org.w3c.dom.traversal.NodeFilter}.
69 * These constants are defined in the {@link org.w3c.dom.traversal.NodeFilter}
72 * @return bitset mainly defined in {@link org.w3c.dom.traversal.NodeFilter}.
81 * These constants are defined in the {@link org.w3c.dom.traversal.NodeFilter}
84 * @param what bitset mainly defined in {@link org.w3c.dom.traversal.NodeFilter}.
195 * @param whatToShow Bit set defined mainly by {@link org.w3c.dom.traversal.NodeFilter}.
208 * @param whatToShow Bit set defined mainly by {@link org.w3c.dom.traversal.NodeFilter}.
264 * @param whatToShow Bit set defined mainly by {@link org.w3c.dom.traversal.NodeFilter}.
280 * @param whatToShow Bit set defined mainly by {@link org.w3c.dom.traversal.NodeFilter}.
  /external/clang/test/Tooling/
clang-check-ast-dump.cpp 53 // Check that traversal continues after the previous construct.
  /external/iptables/libipq/
ipq_set_verdict.3 52 Accept the packet and continue traversal within the kernel.
  /external/kernel-headers/original/uapi/linux/
fcntl.h 85 #define AT_NO_AUTOMOUNT 0x800 /* Suppress terminal automount traversal */
  /external/llvm/include/llvm/ADT/
SCCIterator.h 82 /// A single "visit" within the non-recursive DFS traversal.
85 /// The stack-based DFS traversal; defined below.
88 /// Compute the next SCC using the DFS traversal.
200 // the DFS traversal till the next ++).
  /external/llvm/test/Bitcode/
metadata-function-blocks.ll 19 ; Each node gets a new number. Bottom-up traversal of nodes.
  /external/pdfium/xfa/fxfa/parser/
cxfa_draw.cpp 17 {XFA_Element::Assist, 1, 0}, {XFA_Element::Traversal, 1, 0},
cxfa_exclgroup.cpp 17 {XFA_Element::Traversal, 1, 0}, {XFA_Element::Validate, 1, 0},
  /external/skia/experimental/sksg/
SkSGNode.h 69 kInTraversal_Flag = 1 << 3, // the node is part of a traversal (cycle detection)
  /external/skqp/experimental/sksg/
SkSGNode.h 69 kInTraversal_Flag = 1 << 3, // the node is part of a traversal (cycle detection)
  /external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/
decision_tree.h 25 // Decision tree class to encapsulate tree traversal and mutation logic.
  /external/tensorflow/tensorflow/core/grappler/utils/
traversal.cc 16 #include "tensorflow/core/grappler/utils/traversal.h"
  /external/v8/src/parsing/
parameter-initializer-rewriter.cc 7 #include "src/ast/ast-traversal-visitor.h"
  /frameworks/support/transition/src/main/java/androidx/transition/
ViewGroupOverlayImpl.java 31 * events and do not participate in focus traversal. Overlay views
  /frameworks/support/v7/recyclerview/src/androidTest/java/androidx/recyclerview/widget/
LinearLayoutManagerBaseConfigSetTest.java 163 assertEquals(config + ":\nfirst visible child should match traversal result\n"
168 config + ":\nfirst fully visible child should match traversal result\n"
173 assertEquals(config + ":\nlast visible child should match traversal result\n"
178 config + ":\nlast fully visible child should match traversal result\n"
  /libcore/luni/src/main/java/org/apache/harmony/xml/dom/
DOMImplementationImpl.java 60 // "ElementTraversal" (org.w3c.dom.traversal) versions "1.0"
  /libcore/luni/src/test/java/tests/org/w3c/dom/
ElementGetElementsByTagNameNS.java 12 * encountered in a preorder traversal of the Document tree. Invoke
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
SCCIterator.h 84 /// A single "visit" within the non-recursive DFS traversal.
87 /// The stack-based DFS traversal; defined below.
90 /// Compute the next SCC using the DFS traversal.
202 // the DFS traversal till the next ++).
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/
SCCIterator.h 84 /// A single "visit" within the non-recursive DFS traversal.
87 /// The stack-based DFS traversal; defined below.
90 /// Compute the next SCC using the DFS traversal.
202 // the DFS traversal till the next ++).
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/
SCCIterator.h 84 /// A single "visit" within the non-recursive DFS traversal.
87 /// The stack-based DFS traversal; defined below.
90 /// Compute the next SCC using the DFS traversal.
202 // the DFS traversal till the next ++).
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/
SCCIterator.h 84 /// A single "visit" within the non-recursive DFS traversal.
87 /// The stack-based DFS traversal; defined below.
90 /// Compute the next SCC using the DFS traversal.
202 // the DFS traversal till the next ++).
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/
SCCIterator.h 84 /// A single "visit" within the non-recursive DFS traversal.
87 /// The stack-based DFS traversal; defined below.
90 /// Compute the next SCC using the DFS traversal.
202 // the DFS traversal till the next ++).

Completed in 274 milliseconds

1 2 3 4 5 6 78 91011>>