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

<<11121314151617181920>>

  /system/netd/server/
NetdConstants.cpp 161 * directory traversal.
  /external/apache-xml/src/main/java/org/apache/xpath/patterns/
StepPattern.java 50 * @param whatToShow Bit set defined mainly by {@link org.w3c.dom.traversal.NodeFilter}.
69 * @param whatToShow Bit set defined mainly by {@link org.w3c.dom.traversal.NodeFilter}.
236 * @return true if traversal outside the context node's subtree can occur.
  /external/clang/include/clang/AST/
RecursiveASTVisitor.h 75 /// \brief A class that does preorder depth-first traversal on the
123 /// traversal strategies. Returning false from one of these overridden
124 /// functions will abort the entire traversal.
    [all...]
  /external/libavc/encoder/
ih264e_core_coding.h 532 * The traversal of 4x4 subblocks in the 16x16 macroblock is as per the scan order
561 * The traversal of 4x4 subblocks in the 16x16 macroblock is as per the scan order
591 * The traversal of 4x4 subblocks in the 8x8 macroblock is as per the scan order
  /external/llvm/lib/Transforms/Scalar/
StructurizeCFG.cpp 294 // The reverse post-order traversal of the list gives us an ordering close
341 // This pass originally used a post-order traversal and then operated on
342 // the list in reverse. Now that we are using a reverse post-order traversal
  /external/v8/src/crankshaft/
hydrogen-gvn.cc 677 // traversal of the dominator tree done during GVN (the stack is handled
789 // This is a recursive traversal of the dominator tree but it has been turned
835 // Instruction was unlinked during graph traversal.
  /external/v8/tools/
profile.js 289 * Performs a BF traversal of the top down call graph.
299 * Performs a BF traversal of the bottom up call graph.
694 * Performs an indepth call graph traversal.
  /frameworks/base/cmds/uiautomator/library/core-src/com/android/uiautomator/core/
UiDevice.java 160 * Retrieves the text from the last UI traversal event received.
171 * @return text of the last traversal event, else return an empty string
180 * Clears the text from the last UI traversal event.
  /libcore/ojluni/src/test/java/util/stream/bootlib/java/util/stream/
SpliteratorTestHelper.java 335 // Full traversal using tryAdvance
341 // Full traversal using forEach
347 // Full traversal using tryAdvance then forEach
  /libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/
SpliteratorTestHelper.java 335 // Full traversal using tryAdvance
341 // Full traversal using forEach
347 // Full traversal using tryAdvance then forEach
  /prebuilts/tools/common/m2/repository/org/apache/maven/plugins/maven-dependency-plugin/2.8/
maven-dependency-plugin-2.8.jar 
  /external/valgrind/coregrind/
m_oset.c 392 /* Free all the AvlNodes. This is a post-order traversal, because we */
799 // The iterator is implemented using in-order traversal with an explicit
800 // stack, which lets us do the traversal one step at a time and remember
823 // This in-order traversal requires each node to be pushed and popped
929 // This is a recursive in-order traversal.
  /external/mdnsresponder/mDNSCore/
mDNSEmbeddedAPI.h     [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentSkipListMap.java 66 * of elements requires a traversal of the elements, and so may report
67 * inaccurate results if this collection is modified during traversal.
136 * traversal. Even if marked references were better supported by
137 * JVMs, traversal using this technique might still be faster
149 * markers are rarely encountered during traversal and are
198 * thread noticed during a traversal a node with null value and
230 * simplifications of retry logic. Traversal restarts are
238 * deletion here require a separate traversal pass occurring after
280 * had macros.) Instead, some traversal code is interleaved within
624 /* ---------------- Traversal -------------- *
    [all...]
ConcurrentLinkedDeque.java 40 * of elements requires a traversal of the elements, and so may report
41 * inaccurate results if this collection is modified during traversal.
168 * traversals, e.g. we guarantee that a traversal will never visit
170 * traversal that runs out of elements will be able to see more
198 * restart traversal from tail.
781 * the given collection, added in traversal order of the
    [all...]
  /libcore/ojluni/src/main/java/java/util/prefs/
AbstractPreferences.java     [all...]
  /external/libxml2/
xpath.c     [all...]
  /external/fonttools/Lib/fontTools/ttLib/tables/
otBase.py 276 # Get worst case by adding up all the item lengths, depth first traversal.
352 # list of tables in depth-first traversal order.
354 # We do the traversal in reverse order at each level, in order to
  /external/replicaisland/src/com/replica/replicaisland/
CollisionSystem.java 320 * The Bresenham line algorithm is used for the actual traversal, but the action taken at each
592 * the ray until the traversal is completed or visit() returns false.
606 * segment in any tile of the ray's path is found to be intersecting with the ray, traversal
    [all...]
  /frameworks/base/core/java/android/view/
Choreographer.java 168 "input", "animation", "traversal", "commit"
184 * Callback type: Traversal callback. Handles layout and draw. Runs
192 * Runs after traversal completes. The {@link #getFrameTime() frame time} reported
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
LinkedHashMapTest.java 555 /* fetch the even numbered entries to affect traversal order */
614 /* fetch the even numbered entries to affect traversal order */
670 // fetch the even numbered entries to affect traversal order
    [all...]
  /art/test/964-default-iface-init-generated/util-src/
generate_java.py 287 Performs depth-first traversal of the interface tree this interface is the
  /build/core/tasks/check_boot_jars/
package_whitelist.txt 66 org\.w3c\.dom\.traversal
  /cts/hostsidetests/atrace/src/android/atrace/cts/
AtraceHostTest.java 242 "traversal",
  /external/aac/libMpegTPDec/src/
tpdec_lib.cpp 586 /* No further frame traversal possible. */
825 /* Frame traversal */
869 /* Restore context in case of ECD frame traversal */
899 /* Return to last good frame in case of frame traversal but not ECD. */
    [all...]

Completed in 666 milliseconds

<<11121314151617181920>>