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

1 2 3 4 5 6 7 891011>>

  /prebuilts/clang/host/darwin-x86/clang-4639204/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-4691093/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/linux-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/linux-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/linux-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/linux-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/linux-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 ++).
  /prebuilts/clang/host/linux-x86/clang-4639204/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/linux-x86/clang-4691093/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 ++).
  /cts/tests/accessibilityservice/res/values/
strings.xml 132 <!-- String title of the accessibility text traversal test activity. -->
133 <string name="accessibility_text_traversal_test_activity">Accessibility text traversal test</string>
  /external/annotation-tools/scene-lib/src/annotations/el/
TypeASTMapper.java 64 * traversal.
68 // list during the traversal.
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeFilter.cs 45 rule application strategy and a ``down then up'' tree traversal
68 pattern matcher is the actual tree traversal. We have to get the
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeFilter.java 41 rule application strategy and a ``down then up'' tree traversal
64 pattern matcher is the actual tree traversal. We have to get the
  /external/apache-xml/src/main/java/org/apache/xpath/objects/
XObjectFactory.java 150 else if (val instanceof org.w3c.dom.traversal.NodeIterator)
152 result = new XNodeSetForDOM((org.w3c.dom.traversal.NodeIterator)val, xctxt);
  /external/eigen/Eigen/src/SparseLU/
SparseLU_heap_relax_snode.h 75 // Identify the relaxed supernodes by postorder traversal of the etree
117 } // End postorder traversal of the etree
  /external/eigen/unsupported/Eigen/
BVH 55 * for traversal. To abstract from the query, the query is responsible for keeping track of results.
57 * To be used in the algorithms, a hierarchy must implement the following traversal mechanism (see KdBVH for a sample implementation): \code
  /external/llvm/include/llvm/Analysis/
CaptureTracking.h 58 /// tooManyUses - The depth of traversal has breached a limit. There may be
70 /// use U. Return true to stop the traversal or false to continue looking
  /external/llvm/lib/Analysis/
LoopInfo.cpp 434 // Perform a post order CFG traversal of all blocks within this loop,
436 LoopBlocksTraversal Traversal(DFS, LI);
437 for (BasicBlock *POI : Traversal) {
456 // the DFS result cached by Traversal.
724 /// visit blocks during the initial traversal.
726 LoopBlocksTraversal Traversal(*this, LI);
727 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
728 POE = Traversal.end(); POI != POE; ++POI) ;
  /external/mdnsresponder/mDNSCore/
uDNS.h 83 extern mStatus mDNS_StartNATOperation_internal(mDNS *const m, NATTraversalInfo *traversal);
123 // NAT traversal
  /external/skia/src/gpu/glsl/
GrGLSLFragmentProcessor.h 166 * Pre-order traversal of a GLSLFP hierarchy, or of multiple trees with roots in an array of
167 * GLSLFPS. This agrees with the traversal order of GrFragmentProcessor::Iter
  /external/skqp/src/gpu/glsl/
GrGLSLFragmentProcessor.h 166 * Pre-order traversal of a GLSLFP hierarchy, or of multiple trees with roots in an array of
167 * GLSLFPS. This agrees with the traversal order of GrFragmentProcessor::Iter
  /external/swiftshader/src/OpenGL/compiler/
IntermTraverse.cpp 32 // Traversal functions for terminals are straighforward....
105 // Visit the node after the children, if requested and the traversal
  /external/vboot_reference/futility/
traversal.c 13 #include "traversal.h"
95 /* This are the expected areas, in order of traversal. */
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/
typing_traversal.h 27 #include "suggest/core/policy/traversal.h"
34 class TypingTraversal : public Traversal {
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
CaptureTracking.h 58 /// tooManyUses - The depth of traversal has breached a limit. There may be
70 /// use U. Return true to stop the traversal or false to continue looking

Completed in 777 milliseconds

1 2 3 4 5 6 7 891011>>