| /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 {
56 Traversal() {}
57 virtual ~Traversal() {}
60 DISALLOW_COPY_AND_ASSIGN(Traversal);
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| Traversal.cpp | 26 #include "core/dom/Traversal.h"
33 Traversal::Traversal(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> nodeFilter)
40 short Traversal::acceptNode(ScriptState* state, Node* node) const
|
| Traversal.h | 36 class Traversal {
41 // |expandEntityReferences| first appeared in "DOM Level 2 Traversal and Range". However, this argument was
47 Traversal(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilter>);
|
| NodeIterator.h | 30 #include "core/dom/Traversal.h"
38 class NodeIterator : public ScriptWrappable, public RefCounted<NodeIterator>, public Traversal {
|
| TreeWalker.h | 30 #include "core/dom/Traversal.h"
38 class TreeWalker : public ScriptWrappable, public RefCounted<TreeWalker>, public 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 {
|
| /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,
|
| /external/chromium_org/sync/internal_api/ |
| change_reorder_buffer.h | 70 class Traversal;
|
| change_reorder_buffer.cc | 24 // Traversal provides a way to collect a set of nodes from the syncable
27 // Traversal starts out empty and is grown by means of the ExpandToInclude
30 class ChangeReorderBuffer::Traversal {
35 Traversal() : top_(kInvalidId) { }
37 // Expand the traversal so that it includes the node indicated by
56 // upwards from |top_| to unite the original traversal with the
81 // Return the top node of the traversal. Use this as a starting point
85 // Return an iterator corresponding to the first child (in the traversal)
94 // Return an iterator corresponding to the last child in the traversal
101 // The topmost point in the directory hierarchy that is in the traversal,
164 Traversal traversal; local
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.h | 39 class Traversal;
45 : TRAVERSAL(suggestPolicy ? suggestPolicy->getTraversal() : 0),
89 const Traversal *const TRAVERSAL;
|
| /external/chromium/chrome/browser/sync/engine/ |
| change_reorder_buffer.cc | 23 // Traversal provides a way to collect a set of nodes from the syncable
26 // Traversal starts out empty and is grown by means of the ExpandToInclude
29 class ChangeReorderBuffer::Traversal {
34 Traversal() : top_(kInvalidId) { }
36 // Expand the traversal so that it includes the node indicated by
55 // upwards from |top_| to unite the original traversal with the
80 // Return the top node of the traversal. Use this as a starting point
84 // Return an iterator corresponding to the first child (in the traversal)
93 // Return an iterator corresponding to the last child in the traversal
100 // The topmost point in the directory hierarchy that is in the traversal,
132 Traversal traversal; local
[all...] |
| change_reorder_buffer.h | 96 class Traversal;
|
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 90 ASTMatchFinder::TraversalKind Traversal,
97 Traversal(Traversal),
148 if (Traversal ==
204 // Used for updating the depth during traversal.
244 // Returns 'true' if traversal should continue after this function
272 // traversal should continue after this function returns.
288 const ASTMatchFinder::TraversalKind Traversal;
293 // Controls the outermost traversal of the AST and allows to match multiple
375 TraversalKind Traversal, BindKind Bind)
[all...] |
| /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/chromium_org/chrome/browser/media_galleries/linux/ |
| mtp_device_object_enumerator_unittest.cc | 46 TEST_F(MTPDeviceObjectEnumeratorTest, Traversal) {
|
| /external/chromium_org/chrome/browser/media_galleries/win/ |
| mtp_device_object_enumerator_unittest.cc | 65 TEST_F(MTPDeviceObjectEnumeratorWinTest, Traversal) {
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 470 // Perform a post order CFG traversal of all blocks within this loop,
472 LoopBlocksTraversal Traversal(DFS, LI);
473 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
474 POE = Traversal.end(); POI != POE; ++POI) {
493 // the DFS result cached by Traversal.
733 /// visit blocks during the initial traversal.
735 LoopBlocksTraversal Traversal(*this, LI);
736 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
737 POE = Traversal.end(); POI != POE; ++POI) ;
|
