| /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/webkit/Source/WebCore/dom/ |
| Traversal.cpp | 26 #include "Traversal.h"
33 Traversal::Traversal(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> nodeFilter, bool expandEntityReferences)
41 short Traversal::acceptNode(ScriptState* state, Node* node) const
|
| Traversal.h | 36 class Traversal {
44 Traversal(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilter>, bool expandEntityReferences);
|
| NodeIterator.h | 29 #include "Traversal.h"
37 class NodeIterator : public RefCounted<NodeIterator>, public Traversal {
|
| TreeWalker.h | 29 #include "Traversal.h"
37 class TreeWalker : public RefCounted<TreeWalker>, public Traversal {
|
| NodeIterator.cpp | 75 : Traversal(rootNode, whatToShow, filter, expandEntityReferences)
|
| TreeWalker.cpp | 37 : Traversal(rootNode, whatToShow, filter, expandEntityReferences)
|
| /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"
32 class TypingTraversal : public Traversal {
|
| /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 | 39 class Traversal;
45 : TRAVERSAL(suggestPolicy ? suggestPolicy->getTraversal() : 0),
86 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 | 67 ASTMatchFinder::TraversalKind Traversal,
74 Traversal(Traversal),
119 if (Traversal ==
175 // Used for updating the depth during traversal.
215 // Returns 'true' if traversal should continue after this function
241 // traversal should continue after this function returns.
256 const ASTMatchFinder::TraversalKind Traversal;
261 // Controls the outermost traversal of the AST and allows to match multiple
334 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/llvm/lib/Analysis/ |
| LoopInfo.cpp | 419 // Perform a post order CFG traversal of all blocks within this loop,
421 LoopBlocksTraversal Traversal(DFS, LI);
422 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
423 POE = Traversal.end(); POI != POE; ++POI) {
442 // the DFS result cached by Traversal.
682 /// visit blocks during the initial traversal.
684 LoopBlocksTraversal Traversal(*this, LI);
685 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
686 POE = Traversal.end(); POI != POE; ++POI) ;
|
| /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...] |
| /external/webkit/Source/WebCore/ |
| Android.mk | 205 dom/Traversal.cpp \
[all...] |
