| /external/toolchain-utils/binary_search_tool/full_bisect_test/ |
| inorder_norecurse.c.good | 38 printf ("in-order traversal, without recursion: \n");
|
| preorder_norecurse.c.good | 28 printf ("pre-order traversal, without recursion: \n");
|
| /external/v8/src/ast/ |
| ast-function-literal-id-reindexer.h | 8 #include "src/ast/ast-traversal-visitor.h"
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.h | 40 class Traversal;
46 : TRAVERSAL(suggestPolicy ? suggestPolicy->getTraversal() : nullptr),
78 const Traversal *const TRAVERSAL;
|
| suggest.cpp | 27 #include "suggest/core/policy/traversal.h"
54 const float maxSpatialDistance = TRAVERSAL->getMaxSpatialDistance();
57 pointerIds, maxSpatialDistance, TRAVERSAL->getMaxPointerCount());
92 traverseSession->resetCache(TRAVERSAL->getMaxCacheSize(traverseSession->getInputSize(),
94 TRAVERSAL->getTerminalCacheSize());
109 DicNodeVector childDicNodes(TRAVERSAL->getDefaultExpandDicNodeSize());
113 const bool shouldDepthLevelCache = TRAVERSAL->shouldDepthLevelCache(traverseSession);
130 TRAVERSAL->canDoLookAheadCorrection(traverseSession, &dicNode);
137 TRAVERSAL->shouldNodeLevelCache(traverseSession, &dicNode);
161 const bool allowsErrorCorrections = TRAVERSAL->allowsErrorCorrections(&dicNode)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/wsgiref/ |
| __init__.py | 22 * router -- a simple middleware component that handles URL traversal
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/xml/dom/ |
| NodeFilter.py | 2 # DOM2-Traversal-Range. It contains only constants.
|
| /prebuilts/gdb/linux-x86/lib/python2.7/wsgiref/ |
| __init__.py | 22 * router -- a simple middleware component that handles URL traversal
|
| /prebuilts/gdb/linux-x86/lib/python2.7/xml/dom/ |
| NodeFilter.py | 2 # DOM2-Traversal-Range. It contains only constants.
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/wsgiref/ |
| __init__.py | 22 * router -- a simple middleware component that handles URL traversal
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/xml/dom/ |
| NodeFilter.py | 2 # DOM2-Traversal-Range. It contains only constants.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/wsgiref/ |
| __init__.py | 22 * router -- a simple middleware component that handles URL traversal
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/xml/dom/ |
| NodeFilter.py | 2 # DOM2-Traversal-Range. It contains only constants.
|
| /external/annotation-tools/annotation-file-utilities/src/annotator/find/ |
| package-info.java | 11 * pre-order traversal of the AST to find insertion positions, followed
14 * node encountered during the traversal, the program checks the
|
| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_traversal.cpp | 22 constexpr wchar_t kName[] = L"traversal";
31 XFA_Element::Traversal,
|
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| NodeFilter.java | 13 package org.w3c.dom.traversal;
21 * node. If the filter says to accept the node, the traversal logic returns
22 * it; otherwise, traversal looks for the next node and pretends that the
32 * <p>See also the <a href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>Document Object Model (DOM) Level 2 Traversal and Range Specification</a>.
76 * or traversal. Since attributes are never children of other nodes,
97 * position of the traversal. Since entities are not part of the
127 * position of the traversal. Since notations are not part of the
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
| typing_suggest_policy.h | 29 class Traversal;
38 AK_FORCE_INLINE const Traversal *getTraversal() const {
|
| /external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
| ObjectExplorer.java | 39 * A depth-first object graph explorer. The traversal starts at a root (an
41 * primitive value, excluding static fields from the traversal. The traversal
44 * also return a value at the end of the traversal.
52 * {@link ObjectVisitor} to both control the traversal and return a value.
57 * @param <T> the type of the value obtained (after the traversal) by the
64 * traversal
74 * {@link ObjectVisitor} to both control the traversal and return a value.
88 * @param <T> the type of the value obtained (after the traversal) by the
95 * @return whatever value is returned by the visitor at the end of the traversal
106 ObjectVisitor.Traversal traversal = visitor.visit(chain); local
[all...] |
| /external/eigen/test/ |
| vectorization_logic.cpp | 30 bool test_assign(const Dst&, const Src&, int traversal, int unrolling)
33 bool res = traits::Traversal==traversal;
45 std::cerr << " Expected Traversal == " << demangle_traversal(traversal)
46 << " got " << demangle_traversal(traits::Traversal) << "\n";
54 bool test_assign(int traversal, int unrolling)
57 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling;
65 std::cerr << " Expected Traversal == " << demangle_traversal(traversal
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/ |
| DOMImplementationSource.java | 33 * the string <code>"XML 3.0 Traversal +Events 2.0"</code> will
35 * 3.0 version, a module that support of the "Traversal" module for
51 * version number. This is something like: "XML 3.0 Traversal +Events
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| TreeWalker2Result.java | 63 * Perform a pre-order traversal non-recursive style.
65 * @param pos Start node for traversal
95 * Start traversal of the tree at the given node
98 * @param node Starting node for traversal
|
| /external/clang/test/Analysis/ |
| retain-release-cache-out.m | 4 // checkers, testing that the traversal order in the CFG does not affect the
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| cfa.h | 52 /// @param[in] work_list Set of blocks visited in the the depth first traversal
61 /// @brief Depth first traversal starting from the \p entry BasicBlock
63 /// This function performs a depth first traversal from the \p entry
72 /// CFG following preorder traversal semantics
74 /// CFG following postorder traversal semantics
76 /// encountered during a traversal
97 /// @param[in] postorder A vector of blocks in post order traversal order
145 /// being processed in the traversal
196 // in the forward traversal.
209 // Only consider nodes reachable in the forward traversal
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/ |
| Node.java | 697 private Iterator<Node> treeIterator(TreeTraversal traversal) {
698 switch(traversal) {
710 throw new IllegalArgumentException("Unknown traversal choice.");
714 private Iterable<Node> treeIterable(TreeTraversal traversal) {
715 return () -> treeIterator(traversal);
719 * Make a stream of nodes using traversal algorithm "traversal".
721 public Stream<Node> stream(TreeTraversal traversal) {
722 return StreamSupport.stream(Spliterators.spliteratorUnknownSize(treeIterator(traversal), NONNULL | DISTINCT), false);
726 * Make a stream of nodes using pre-order traversal
[all...] |
| /external/vboot_reference/futility/ |
| traversal.h | 56 /* Current activity during traversal */
77 /* These are invoked by the traversal. They also return nonzero on error. */
|
