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

1 23 4 5 6 7 8 91011>>

  /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
  /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
  /external/swiftshader/src/OpenGL/compiler/
parseConst.cpp 19 // the traversal
60 // The rest of the file are the traversal functions. The last one
61 // is the one that starts the traversal.
63 // Return true from interior nodes to have the external traversal
235 // This function is the one to call externally to start the traversal.
  /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...]
  /external/tensorflow/tensorflow/tools/common/
traverse.py 79 Cycles (determined by reference equality, `is`) stop the traversal. A stack of
88 root: A python object with which to start the traversal.
90 called for each object found in the traversal.
public_api.py 15 """Visitor restricting traversal to only the public tensorflow API."""
50 # Each entry maps a module path to a name to ignore in traversal.
78 This map can be edited, but it should not be edited once traversal has
90 This map can be edited, but it should not be edited once traversal has
  /external/python/cpython2/Doc/library/
dbhash.rst 83 method and the :meth:`!next` method. The traversal is ordered by the databases
90 Return the last key/value pair in a database traversal. This may be used to
91 begin a reverse-order traversal; see :meth:`previous`.
96 Returns the key next key/value pair in a database traversal. The following code
107 Returns the previous key/value pair in a forward-traversal of the database. In
109 traversal.
  /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/libnetfilter_conntrack/include/internal/
linux_list.h 142 * the _rcu list-traversal primitives, such as
163 * the _rcu list-traversal primitives, such as
204 * lockfree traversal.
214 * the _rcu list-traversal primitives, such as
447 * This list-traversal primitive may safely run concurrently with
449 * as long as the traversal is guarded by rcu_read_lock().
466 * This list-traversal primitive may safely run concurrently with
468 * as long as the traversal is guarded by rcu_read_lock().
480 * This list-traversal primitive may safely run concurrently with
482 * as long as the traversal is guarded by rcu_read_lock()
    [all...]
  /external/libnfnetlink/include/
linux_list.h 141 * the _rcu list-traversal primitives, such as
162 * the _rcu list-traversal primitives, such as
203 * lockfree traversal.
213 * the _rcu list-traversal primitives, such as
446 * This list-traversal primitive may safely run concurrently with
448 * as long as the traversal is guarded by rcu_read_lock().
465 * This list-traversal primitive may safely run concurrently with
467 * as long as the traversal is guarded by rcu_read_lock().
479 * This list-traversal primitive may safely run concurrently with
481 * as long as the traversal is guarded by rcu_read_lock()
    [all...]
  /external/eigen/Eigen/src/Core/
AssignEvaluator.h 22 * Part 1 : the logic deciding a strategy for traversal and unrolling *
58 // TODO distinguish between linear traversal and inner-traversals
100 Traversal = int(MayLinearVectorize) && (LinearPacketSize>InnerPacketSize) ? int(LinearVectorizedTraversal)
106 Vectorized = int(Traversal) == InnerVectorizedTraversal
107 || int(Traversal) == LinearVectorizedTraversal
108 || int(Traversal) == SliceVectorizedTraversal
111 typedef typename conditional<int(Traversal)==LinearVectorizedTraversal, LinearPacketType, InnerPacketType>::type PacketType;
115 ActualPacketSize = int(Traversal)==LinearVectorizedTraversal ? LinearPacketSize
127 Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTraversal)
    [all...]
  /device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/
BaseOrderedCollectionRedBlackTreeLib.inf 9 # tree. Complete ordered traversal takes O(n) time.
BaseOrderedCollectionRedBlackTreeLib.uni 10 // tree. Complete ordered traversal takes O(n) time.
  /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/hamcrest/hamcrest-core/src/main/java/org/hamcrest/core/
IsCollectionContaining.java 61 * <code>itemMatcher</code>. Whilst matching, the traversal of the examined {@link Iterable}
76 * <code>item</code>. Whilst matching, the traversal of the examined {@link Iterable}
92 * matcher from the specified <code>itemMatchers</code>. Whilst matching, each traversal of
115 * item from the specified <code>items</code>. Whilst matching, each traversal of the
  /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
  /external/llvm/test/Bitcode/
mdnodes-distinct-nodes-break-cycles.ll 7 ; entry point is !2, a naive post-order traversal would give !3, !1, !2; but
  /frameworks/native/services/surfaceflinger/
LayerVector.h 30 * to track layers they own sorted according to Z-order. Provides traversal

Completed in 229 milliseconds

1 23 4 5 6 7 8 91011>>