Home
last modified time | relevance | path

Searched refs:Traversal (Results 1 – 25 of 51) sorted by relevance

123

/external/guava/android/guava/src/com/google/common/graph/
DTraverser.java100 Traversal<N> newTraversal() { in forGraph()
101 return Traversal.inGraph(graph); in forGraph()
188 Traversal<N> newTraversal() {
189 return Traversal.inTree(tree);
359 abstract Traversal<N> newTraversal();
375 private abstract static class Traversal<N> {
378 Traversal(SuccessorsFunction<N> successorFunction) {
382 static <N> Traversal<N> inGraph(SuccessorsFunction<N> graph) {
384 return new Traversal<N>(graph) {
400 static <N> Traversal<N> inTree(SuccessorsFunction<N> tree) {
[all …]
/external/guava/guava/src/com/google/common/graph/
DTraverser.java100 Traversal<N> newTraversal() { in forGraph()
101 return Traversal.inGraph(graph); in forGraph()
188 Traversal<N> newTraversal() {
189 return Traversal.inTree(tree);
359 abstract Traversal<N> newTraversal();
375 private abstract static class Traversal<N> {
378 Traversal(SuccessorsFunction<N> successorFunction) {
382 static <N> Traversal<N> inGraph(SuccessorsFunction<N> graph) {
384 return new Traversal<N>(graph) {
400 static <N> Traversal<N> inTree(SuccessorsFunction<N> tree) {
[all …]
/external/llvm-project/clang/include/clang/AST/
DASTNodeTraverser.h73 TraversalKind Traversal = TraversalKind::TK_AsIs; variable
84 void SetTraversalKind(TraversalKind TK) { Traversal = TK; } in SetTraversalKind()
85 TraversalKind GetTraversalKind() const { return Traversal; } in GetTraversalKind()
88 if (Traversal == TK_IgnoreUnlessSpelledInSource && D->isImplicit()) in Visit()
107 if (Traversal != TK_AsIs) { in Visit()
126 switch (Traversal) {
147 if (Traversal == TK_IgnoreUnlessSpelledInSource &&
189 if (Traversal == TK_IgnoreUnlessSpelledInSource && !Init->isWritten()) in Visit()
407 if (Traversal == TK_IgnoreUnlessSpelledInSource && D->isDefaulted()) in VisitFunctionDecl()
426 if (Traversal == TK_IgnoreUnlessSpelledInSource && D->isCXXForRangeDecl()) in VisitVarDecl()
[all …]
DParentMapContext.h60 TraversalKind getTraversalKind() const { return Traversal; } in getTraversalKind()
61 void setTraversalKind(TraversalKind TK) { Traversal = TK; } in setTraversalKind()
70 TraversalKind Traversal = TK_AsIs; variable
/external/caliper/caliper/src/main/java/com/google/caliper/memory/
DObjectVisitor.java43 Traversal visit(Chain chain); in visit()
55 enum Traversal { enum
DObjectGraphMeasurer.java198 @Override public Traversal visit(Chain chain) { in visit()
201 return Traversal.SKIP; in visit()
211 return Traversal.EXPLORE; in visit()
213 return Traversal.SKIP; in visit()
/external/clang/lib/ASTMatchers/
DASTMatchFinder.cpp91 ASTMatchFinder::TraversalKind Traversal, in MatchChildASTVisitor() argument
98 Traversal(Traversal), in MatchChildASTVisitor()
149 if (Traversal == in TraverseStmt()
286 const ASTMatchFinder::TraversalKind Traversal; member in clang::ast_matchers::internal::__anon5fe87f1e0111::MatchChildASTVisitor
379 TraversalKind Traversal, BindKind Bind) { in memoizedMatchesRecursively() argument
382 return matchesRecursively(Node, Matcher, Builder, MaxDepth, Traversal, in memoizedMatchesRecursively()
400 MaxDepth, Traversal, Bind); in memoizedMatchesRecursively()
413 TraversalKind Traversal, BindKind Bind) { in matchesRecursively() argument
415 &Matcher, this, Builder, MaxDepth, Traversal, Bind); in matchesRecursively()
427 TraversalKind Traversal, in matchesChildOf() argument
[all …]
/external/eigen/Eigen/src/Core/
DAssignEvaluator.h100 …Traversal = int(MayLinearVectorize) && (LinearPacketSize>InnerPacketSize) ? int(LinearVectorizedTr… enumerator
106 Vectorized = int(Traversal) == InnerVectorizedTraversal
107 || int(Traversal) == LinearVectorizedTraversal
108 || int(Traversal) == SliceVectorizedTraversal
111 …typedef typename conditional<int(Traversal)==LinearVectorizedTraversal, LinearPacketType, InnerPac…
115 ActualPacketSize = int(Traversal)==LinearVectorizedTraversal ? LinearPacketSize
127 …Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTrave…
133 : int(Traversal) == int(LinearVectorizedTraversal)
137 : int(Traversal) == int(LinearTraversal)
141 : int(Traversal) == int(SliceVectorizedTraversal)
[all …]
DAssign_MKL.h65 Traversal = MightLinearize ? LinearTraversal : DefaultTraversal enumerator
89 …if(vml_assign_traits<DstXprType,SrcXprNested>::Traversal==LinearTraversal) { …
150 …if(vml_assign_traits<DstXprType,SrcXprNested>::Traversal==LinearTraversal) …
DRedux.h47 Traversal = int(MayLinearVectorize) ? int(LinearVectorizedTraversal) enumerator
56 …UnrollingLimit = EIGEN_UNROLLING_LIMIT * (int(Traversal) == int(DefaultTraversal) ? 1 : int(Packet…
76 EIGEN_DEBUG_VAR(Traversal) in debug()
180 int Traversal = redux_traits<Func, Derived>::Traversal,
/external/eigen/test/
Dvectorization_logic.cpp33 bool res = traits::Traversal==traversal; in test_assign()
46 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_assign()
57 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_assign()
66 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_assign()
79 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_redux()
87 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_redux()
/external/llvm/lib/Analysis/
DLoopInfo.cpp436 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents() local
437 for (BasicBlock *POI : Traversal) { in updateBlockParents()
726 LoopBlocksTraversal Traversal(*this, LI); in perform() local
727 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(), in perform()
728 POE = Traversal.end(); POI != POE; ++POI) ; in perform()
/external/guava/guava-tests/benchmark/com/google/common/collect/
DBinaryTreeTraverserBenchmark.java120 enum Traversal { enum in BinaryTreeTraverserBenchmark
150 @Param Traversal traversal;
/external/guava/android/guava-tests/benchmark/com/google/common/collect/
DBinaryTreeTraverserBenchmark.java120 enum Traversal { enum in BinaryTreeTraverserBenchmark
150 @Param Traversal traversal;
/external/pdfium/xfa/fxfa/parser/
Dcxfa_traversal.cpp31 XFA_Element::Traversal, in CXFA_Traversal()
Dcxfa_draw.cpp17 {XFA_Element::Assist, 1, 0}, {XFA_Element::Traversal, 1, 0},
Dcxfa_exclgroup.cpp17 {XFA_Element::Traversal, 1, 0}, {XFA_Element::Validate, 1, 0},
Dcxfa_field.cpp18 {XFA_Element::Traversal, 1, 0}, {XFA_Element::Keep, 1, 0},
Dcxfa_subform.cpp17 {XFA_Element::Assist, 1, 0}, {XFA_Element::Traversal, 1, 0},
/external/ipsec-tools/src/racoon/doc/
DFAQ36 Enable NAT-Traversal. This needs kernel support, which is
37 available on Linux. On NetBSD, NAT-Traversal kernel support
41 using NAT-Traversal might infringe a patent.
/external/ipsec-tools/src/racoon/samples/
Dracoon.conf.sample-natt4 # This file can be used as a template for NAT-Traversal setups.
34 # whom it does NAT-Traversal.
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DLoopInfo.cpp699 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents() local
700 for (BasicBlock *POI : Traversal) { in updateBlockParents()
1109 LoopBlocksTraversal Traversal(*this, LI); in perform() local
1110 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(), in perform()
1111 POE = Traversal.end(); in perform()
/external/llvm-project/llvm/lib/Analysis/
DLoopInfo.cpp721 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents() local
722 for (BasicBlock *POI : Traversal) { in updateBlockParents()
1130 LoopBlocksTraversal Traversal(*this, LI); in perform() local
1131 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(), in perform()
1132 POE = Traversal.end(); in perform()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DReachingDefAnalysis.cpp150 LoopTraversal Traversal; in runOnMachineFunction() local
151 LoopTraversal::TraversalOrder TraversedMBBOrder = Traversal.traverse(mf); in runOnMachineFunction()
/external/llvm-project/clang/lib/ASTMatchers/
DASTMatchFinder.cpp69 TraversalKind Traversal = TK_AsIs; member
73 return std::tie(Traversal, Type, MatcherID, Node, BoundNodes) < in operator <()
74 std::tie(Other.Traversal, Other.Type, Other.MatcherID, Other.Node, in operator <()
480 Key.Traversal = Ctx.getParentMapContext().getTraversalKind(); in memoizedMatchesRecursively()
827 Keys.back().Traversal = Ctx.getParentMapContext().getTraversalKind(); in matchesAnyAncestorOf()

123