| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/policy/ |
| suggest_policy.h | 24 class Traversal;
32 virtual const Traversal *getTraversal() const = 0;
|
| traversal.h | 26 class Traversal {
55 Traversal() {}
56 virtual ~Traversal() {}
59 DISALLOW_COPY_AND_ASSIGN(Traversal);
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
| typing_suggest_policy.h | 29 class Traversal;
38 AK_FORCE_INLINE const Traversal *getTraversal() const {
|
| typing_traversal.h | 27 #include "suggest/core/policy/traversal.h"
34 class TypingTraversal : public Traversal {
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/iterator/detail/ |
| facade_iterator_category.hpp | 73 // Convert an iterator_facade's traversal category, Value parameter,
79 // Otherwise, if Traversal == single_pass_traversal_tag, the following
86 template <class Traversal, class ValueParam, class Reference>
91 , is_convertible<Traversal,forward_traversal_tag>
94 is_convertible<Traversal,random_access_traversal_tag>
97 is_convertible<Traversal,bidirectional_traversal_tag>
104 is_convertible<Traversal, single_pass_traversal_tag>
110 , mpl::identity<Traversal>
133 // old-style category) and Traversal (a pure traversal tag)
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/iterator/ |
| iterator_categories.hpp | 27 // Traversal Categories
70 // Convert a "strictly old-style" iterator category to a traversal
108 template <class Traversal>
111 is_convertible<Traversal,random_access_traversal_tag>
114 is_convertible<Traversal,bidirectional_traversal_tag>
117 is_convertible<Traversal,forward_traversal_tag>
120 is_convertible<Traversal,single_pass_traversal_tag>
123 is_convertible<Traversal,incrementable_traversal_tag>
146 // Convert an iterator category into a traversal tag
150 : mpl::eval_if< // if already convertible to a traversal tag, we're done
[all...] |
| iterator_adaptor.hpp | 175 , class Traversal
200 Traversal
242 // Category - the traversal category of the resulting iterator. If not
257 , class Traversal = use_default
263 Derived, Base, Value, Traversal, Reference, Difference
270 Derived, Base, Value, Traversal, Reference, Difference
287 typedef iterator_adaptor<Derived,Base,Value,Traversal,Reference,Difference> iterator_adaptor_;
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/iterator/ |
| input_iterator_facade.hpp | 59 typename Traversal = single_pass_traversal_tag>
60 class input_iterator_facade : public iterator_facade<Derived,ValueType,Traversal,Reference>
|
| token_iterator.hpp | 182 typename Traversal = forward_traversal_tag>
184 : public input_iterator_facade<Derived,ValueType,Reference,Traversal> {
187 typedef input_iterator_facade<Derived,ValueType,Reference,Traversal> base;
|
| /external/eigen/Eigen/src/Core/ |
| Assign_MKL.h | 70 Traversal = MayLinearize ? LinearVectorizedTraversal
76 template<typename Derived1, typename Derived2, typename UnaryOp, int Traversal, int Unrolling,
77 int VmlTraversal = vml_assign_traits<Derived1, Derived2, UnaryOp>::Traversal >
79 : assign_impl<Derived1, Eigen::CwiseUnaryOp<UnaryOp, Derived2>,Traversal,Unrolling,BuiltIn>
83 template<typename Derived1, typename Derived2, typename UnaryOp, int Traversal, int Unrolling>
84 struct vml_assign_impl<Derived1, Derived2, UnaryOp, Traversal, Unrolling, InnerVectorizedTraversal>
91 // assign_impl<Derived1,Eigen::CwiseUnaryOp<UnaryOp, Derived2>,Traversal,Unrolling,BuiltIn>::run(dst,src);
103 template<typename Derived1, typename Derived2, typename UnaryOp, int Traversal, int Unrolling>
104 struct vml_assign_impl<Derived1, Derived2, UnaryOp, Traversal, Unrolling, LinearVectorizedTraversal>
109 // assign_impl<Derived1,Eigen::CwiseUnaryOp<UnaryOp, Derived2>,Traversal,Unrolling,BuiltIn>::run(dst,src)
[all...] |
| Assign.h | 20 * Part 1 : the logic deciding a strategy for traversal and unrolling *
66 Traversal = int(MayInnerVectorize) ? int(InnerVectorizedTraversal)
71 Vectorized = int(Traversal) == InnerVectorizedTraversal
72 || int(Traversal) == LinearVectorizedTraversal
73 || int(Traversal) == SliceVectorizedTraversal
89 Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTraversal))
95 : int(Traversal) == int(LinearVectorizedTraversal)
97 : int(Traversal) == int(LinearTraversal)
117 EIGEN_DEBUG_VAR(Traversal)
[all...] |
| Redux.h | 46 Traversal = int(MayLinearVectorize) ? int(LinearVectorizedTraversal)
59 UnrollingLimit = EIGEN_UNROLLING_LIMIT * (int(Traversal) == int(DefaultTraversal) ? 1 : int(PacketSize))
163 int Traversal = redux_traits<Func, Derived>::Traversal,
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.h | 40 class Traversal;
46 : TRAVERSAL(suggestPolicy ? suggestPolicy->getTraversal() : nullptr),
78 const Traversal *const TRAVERSAL;
|
| /external/eigen/test/ |
| vectorization_logic.cpp | 32 bool test_assign(const Dst&, const Src&, int traversal, int unrolling)
35 bool res = internal::assign_traits<Dst,Src>::Traversal==traversal
39 std::cerr << " Expected Traversal == " << demangle_traversal(traversal)
40 << " got " << demangle_traversal(internal::assign_traits<Dst,Src>::Traversal) << "\n";
48 bool test_assign(int traversal, int unrolling)
51 bool res = internal::assign_traits<Dst,Src>::Traversal==traversal
55 std::cerr << " Expected Traversal == " << demangle_traversal(traversal
[all...] |
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 91 ASTMatchFinder::TraversalKind Traversal,
98 Traversal(Traversal),
149 if (Traversal ==
205 // Used for updating the depth during traversal.
245 // Returns 'true' if traversal should continue after this function
273 // traversal should continue after this function returns.
289 const ASTMatchFinder::TraversalKind Traversal;
294 // Controls the outermost traversal of the AST and allows to match multiple
382 TraversalKind Traversal, BindKind Bind)
[all...] |
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 455 // Perform a post order CFG traversal of all blocks within this loop,
457 LoopBlocksTraversal Traversal(DFS, LI);
458 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
459 POE = Traversal.end(); POI != POE; ++POI) {
478 // the DFS result cached by Traversal.
734 /// visit blocks during the initial traversal.
736 LoopBlocksTraversal Traversal(*this, LI);
737 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
738 POE = Traversal.end(); POI != POE; ++POI) ;
|
| /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/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 40 // A visitor can control the traversal by overriding the following methods:
48 // The reduceX methods control the kind of traversal (visitor, copy, etc.).
53 class Traversal {
106 // R_Ctx defines a "context" for the traversal, which encodes information
130 // R_SExpr is the result type for a traversal.
173 // Implements a traversal that visits each subexpression, and returns either
176 class VisitReducer : public Traversal<Self, VisitReducerBase>,
|
| /external/eigen/Eigen/src/Core/products/ |
| CoeffBasedProduct.h | 31 template<int Traversal, int UnrollingIndex, typename Lhs, typename Rhs, typename RetScalar>
|
| /external/mdnsresponder/mDNSCore/ |
| mDNSEmbeddedAPI.h | [all...] |
| uDNS.c | 416 #pragma mark - NAT Traversal
554 mDNSexport mStatus mDNS_StartNATOperation_internal(mDNS *const m, NATTraversalInfo *traversal)
558 LogInfo("mDNS_StartNATOperation_internal %p Protocol %d IntPort %d RequestedPort %d NATLease %d", traversal,
559 traversal->Protocol, mDNSVal16(traversal->IntPort), mDNSVal16(traversal->RequestedPort), traversal->NATLease);
561 // Note: It important that new traversal requests are appended at the *end* of the list, not prepended at the start
564 if (traversal == *n)
566 LogMsg("Error! Tried to add a NAT traversal that's already in the active list: request %p Prot %d Int %d TTL %d"
[all...] |
