| /external/guava/guava/src/com/google/common/graph/ |
| D | Traverser.java | 102 Traversal<N> newTraversal() { in forGraph()
103 return Traversal.inGraph(graph); in forGraph()
190 Traversal<N> newTraversal() {
191 return Traversal.inTree(tree);
361 abstract Traversal<N> newTraversal();
377 private abstract static class Traversal<N> {
380 Traversal(SuccessorsFunction<N> successorFunction) {
384 static <N> Traversal<N> inGraph(SuccessorsFunction<N> graph) {
386 return new Traversal<N>(graph) {
412 static <N> Traversal<N> inTree(SuccessorsFunction<N> tree) {
[all …]
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | Traverser.java | 102 Traversal<N> newTraversal() { in forGraph()
103 return Traversal.inGraph(graph); in forGraph()
190 Traversal<N> newTraversal() {
191 return Traversal.inTree(tree);
361 abstract Traversal<N> newTraversal();
377 private abstract static class Traversal<N> {
380 Traversal(SuccessorsFunction<N> successorFunction) {
384 static <N> Traversal<N> inGraph(SuccessorsFunction<N> graph) {
386 return new Traversal<N>(graph) {
412 static <N> Traversal<N> inTree(SuccessorsFunction<N> tree) {
[all …]
|
| /external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
| D | ObjectGraphMeasurer.java | 198 @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()
|
| D | ObjectVisitor.java | 43 Traversal visit(Chain chain); in visit()
55 enum Traversal { enum
|
| D | ObjectExplorer.java | 106 ObjectVisitor.Traversal traversal = visitor.visit(chain); in exploreObject()
|
| /external/clang/lib/ASTMatchers/ |
| D | ASTMatchFinder.cpp | 91 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::__anonce92447c0111::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/ |
| D | AssignEvaluator.h | 102 …Traversal = int(Dst::SizeAtCompileTime) == 0 ? int(AllAtOnceTraversal) // If compile-size is zero… enumerator
109 Vectorized = int(Traversal) == InnerVectorizedTraversal
110 || int(Traversal) == LinearVectorizedTraversal
111 || int(Traversal) == SliceVectorizedTraversal
114 …typedef typename conditional<int(Traversal)==LinearVectorizedTraversal, LinearPacketType, InnerPac…
118 ActualPacketSize = int(Traversal)==LinearVectorizedTraversal ? LinearPacketSize
130 …Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTrave…
136 : int(Traversal) == int(LinearVectorizedTraversal)
140 : int(Traversal) == int(LinearTraversal)
144 : int(Traversal) == int(SliceVectorizedTraversal)
[all …]
|
| D | Redux.h | 53 Traversal = int(MayLinearVectorize) ? int(LinearVectorizedTraversal) enumerator
62 …UnrollingLimit = EIGEN_UNROLLING_LIMIT * (int(Traversal) == int(DefaultTraversal) ? 1 : int(Packet…
84 …std::cerr << "Traversal" << " = " << Traversal << " (" << demangle_traversal(Traversal) << ")" << … in debug()
186 int Traversal = redux_traits<Func, Evaluator>::Traversal,
|
| D | Assign_MKL.h | 65 Traversal = MightLinearize ? LinearTraversal : DefaultTraversal enumerator
90 …if(vml_assign_traits<DstXprType,SrcXprNested>::Traversal==LinearTraversal) { …
152 …if(vml_assign_traits<DstXprType,SrcXprNested>::Traversal==LinearTraversal) …
|
| /external/eigen/test/ |
| D | vectorization_logic.cpp | 42 bool res = traits::Traversal==traversal; in test_assign()
55 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_assign()
67 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_assign()
76 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_assign()
89 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_redux()
97 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_redux()
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 436 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/android/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 120 enum Traversal { enum in BinaryTreeTraverserBenchmark
150 @Param Traversal traversal;
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 120 enum Traversal { enum in BinaryTreeTraverserBenchmark
150 @Param Traversal traversal;
|
| /external/ipsec-tools/src/racoon/doc/ |
| D | FAQ | 36 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/pdfium/xfa/fxfa/parser/ |
| D | cxfa_traversal.cpp | 31 XFA_Element::Traversal,
|
| D | cxfa_exclgroup.cpp | 17 {XFA_Element::Traversal, 1, {}}, {XFA_Element::Validate, 1, {}},
|
| D | cxfa_draw.cpp | 17 {XFA_Element::Assist, 1, {}}, {XFA_Element::Traversal, 1, {}},
|
| D | cxfa_field.cpp | 18 {XFA_Element::Traversal, 1, {}}, {XFA_Element::Keep, 1, {}},
|
| D | cxfa_subform.cpp | 17 {XFA_Element::Assist, 1, {}}, {XFA_Element::Traversal, 1, {}},
|
| /external/ipsec-tools/src/racoon/samples/ |
| D | racoon.conf.sample-natt | 4 # 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/ |
| D | LoopInfo.cpp | 699 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/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | ReachingDefAnalysis.cpp | 150 LoopTraversal Traversal; in runOnMachineFunction() local
151 LoopTraversal::TraversalOrder TraversedMBBOrder = Traversal.traverse(mf); in runOnMachineFunction()
|
| D | ExecutionDomainFix.cpp | 455 LoopTraversal Traversal; in runOnMachineFunction() local
456 LoopTraversal::TraversalOrder TraversedMBBOrder = Traversal.traverse(mf); in runOnMachineFunction()
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyTraverse.h | 53 class Traversal {
176 class VisitReducer : public Traversal<Self, VisitReducerBase>,
|
| /external/ipsec-tools/ |
| D | NEWS | 123 o Support for NAT Traversal (NAT-T)
|