HomeSort by relevance Sort by last modified time
    Searched full:traversal (Results 26 - 50 of 888) sorted by null

12 3 4 5 6 7 8 91011>>

  /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
  /external/vboot_reference/futility/
traversal.h 56 /* Current activity during traversal */
77 /* These are invoked by the traversal. They also return nonzero on error. */
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/iterator/
input_iterator_facade.hpp 59 typename Traversal = single_pass_traversal_tag>
60 class input_iterator_facade : public iterator_facade<Derived,ValueType,Traversal,Reference>
  /external/guava/guava/src/com/google/common/collect/
TreeTraverser.java 64 * traversal. That is, each node's subtrees are traversed after the node itself is returned.
66 * <p>No guarantees are made about the behavior of the traversal when nodes change while
114 * traversal. That is, each node's subtrees are traversed before the node itself is returned.
116 * <p>No guarantees are made about the behavior of the traversal when nodes change while
174 * traversal. That is, all the nodes of depth 0 are returned, then depth 1, then 2, and so on.
176 * <p>No guarantees are made about the behavior of the traversal when nodes change while
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
TreeTraverser.java 56 * traversal. That is, each node's subtrees are traversed after the node itself is returned.
58 * <p>No guarantees are made about the behavior of the traversal when nodes change while
106 * traversal. That is, each node's subtrees are traversed before the node itself is returned.
108 * <p>No guarantees are made about the behavior of the traversal when nodes change while
166 * traversal. That is, all the nodes of depth 0 are returned, then depth 1, then 2, and so on.
168 * <p>No guarantees are made about the behavior of the traversal when nodes change while
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/iterator/
iterator_adaptor.hpp 175 , class Traversal
200 Traversal
242 // Category - the traversal category of the resulting iterator. If not
257 , class Traversal = use_default
263 Derived, Base, Value, Traversal, Reference, Difference
270 Derived, Base, Value, Traversal, Reference, Difference
287 typedef iterator_adaptor<Derived,Base,Value,Traversal,Reference,Difference> iterator_adaptor_;
  /external/apache-xml/src/main/java/org/apache/xml/utils/
TreeWalker.java 141 * Perform a pre-order traversal non-recursive style.
145 * traversal, startDocument and endDocument will always be issued to the
148 * @param pos Node in the tree where to start traversal
162 * Perform a pre-order traversal non-recursive style.
167 * @param pos Node in the tree where to start traversal
211 * Perform a pre-order traversal non-recursive style.
215 * traversal, startDocument and endDocument will always be issued to the
218 * @param pos Node in the tree where to start traversal
219 * @param top Node in the tree where to end traversal
  /prebuilts/tools/common/m2/repository/org/apache/maven/shared/maven-dependency-tree/2.1/
maven-dependency-tree-2.1.jar 
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DTMNodeIterator.java 29 import org.w3c.dom.traversal.NodeFilter;
52 * filter directly into the traversal object, getNodeFilter() is not
59 public class DTMNodeIterator implements org.w3c.dom.traversal.NodeIterator
92 // org.w3c.dom.traversal.NodeFilter API follows
119 * built stateful XPath-based filtering directly into the traversal
  /external/guava/guava-tests/benchmark/com/google/common/collect/
BinaryTreeTraverserBenchmark.java 134 enum Traversal {
166 Traversal traversal; field in class:BinaryTreeTraverserBenchmark
176 this.view = traversal.view(
181 @Benchmark int traversal(int reps) { method in class:BinaryTreeTraverserBenchmark
  /libcore/ojluni/src/main/java/java/util/
Spliterator.java 45 * manner, are unlikely to benefit from parallelism. Traversal
61 * {@code ORDERED}, traversal methods must conform to their documented ordering.
70 * point of first traversal, first split, or first query for estimated size,
78 * bulk traversal method ({@link #forEachRemaining forEachRemaining()}) of a
79 * Spliterator may optimize traversal and check for structural interference
86 * that would be encountered in a successful traversal. However, even when not
99 * of splitting and traversal is undefined if two or more threads operate
105 * traversal has begun.
121 * Traversal of primitive values using boxing-based methods
130 * parallel traversal in addition to sequential traversal, by supportin
    [all...]
  /prebuilts/tools/common/m2/repository/org/apache/maven/shared/maven-dependency-tree/1.2/
maven-dependency-tree-1.2.jar 
  /external/iptables/libiptc/
linux_list.h 137 * the _rcu list-traversal primitives, such as
158 * the _rcu list-traversal primitives, such as
199 * lockfree traversal.
209 * the _rcu list-traversal primitives, such as
442 * This list-traversal primitive may safely run concurrently with
444 * as long as the traversal is guarded by rcu_read_lock().
461 * This list-traversal primitive may safely run concurrently with
463 * as long as the traversal is guarded by rcu_read_lock().
475 * This list-traversal primitive may safely run concurrently with
477 * as long as the traversal is guarded by rcu_read_lock()
    [all...]
  /external/eigen/Eigen/src/Core/
Assign.h 20 * Part 1 : the logic deciding a strategy for traversal and unrolling *
66 Traversal = int(MayInnerVectorize) ? int(InnerVectorizedTraversal)
71 Vectorized = int(Traversal) == InnerVectorizedTraversal
72 || int(Traversal) == LinearVectorizedTraversal
73 || int(Traversal) == SliceVectorizedTraversal
89 Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTraversal))
95 : int(Traversal) == int(LinearVectorizedTraversal)
97 : int(Traversal) == int(LinearTraversal)
117 EIGEN_DEBUG_VAR(Traversal)
    [all...]
  /external/elfutils/libdw/
dwarf_getscopes.c 47 /* Preorder visitor: prune the traversal if this DIE does not contain PC. */
83 /* Preorder visitor for second partial traversal after finding a
166 instance. Now return out of the traversal back to the scope
178 of the postorder traversal. */
  /external/iptables/extensions/
libip6t_REJECT.man 4 so it is a terminating TARGET, ending rule traversal.
libipt_REJECT.man 4 so it is a terminating TARGET, ending rule traversal.
libipt_ULOG.man 8 Like LOG, this is a "non-terminating target", i.e. rule traversal
  /libcore/luni/src/main/java/org/w3c/dom/traversal/
NodeIterator.java 13 package org.w3c.dom.traversal;
25 * document-order traversal of a document subtree. Instances of these
28 * <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>.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/
fcntl.h 48 #define AT_NO_AUTOMOUNT 0x800 /* Suppress terminal automount traversal */
  /libcore/ojluni/src/main/java/java/util/stream/
ForEachOps.java 41 * traversal (elements are provided to the {@code Consumer} as soon as they are
42 * available), and ordered traversal (elements are provided to the
51 * {@code Consumer} will be relayed to the caller and traversal will be
66 * @param ordered whether an ordered traversal is requested
82 * @param ordered whether an ordered traversal is requested
97 * @param ordered whether an ordered traversal is requested
112 * @param ordered whether an ordered traversal is requested
124 * whatever thread they become available. If the traversal is unordered,
323 * processed according to an in-order traversal of the computation tree.
334 * traversal
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/dtm/
DTMFilter.java 48 * will appear in the first position of the iteration or traversal.
75 * node will appear in the first position of the traversal. Since
115 * traversal. Since notations are not part of the document tree, they do
124 * conflict with {@link org.w3c.dom.traversal.NodeFilter}.
135 * {@link org.w3c.dom.traversal.NodeFilter}.
  /external/caliper/caliper/src/main/java/com/google/caliper/memory/
ObjectGraphMeasurer.java 170 * to forbid the traversal to traverse the given object
198 @Override public Traversal visit(Chain chain) {
201 return Traversal.SKIP;
211 return Traversal.EXPLORE;
213 return Traversal.SKIP;
  /external/v8/test/cctest/
log-eq-of-logging-and-traversal.js 62 // traversal.
106 if (line === "test-traversal-done,\"\"") break;
145 // functions traversal may erroneously recognize them as functions, so we are
146 // expecting more functions in traversal vs. logging.
148 // than traversal.

Completed in 1528 milliseconds

12 3 4 5 6 7 8 91011>>