OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Traversal
(Results
1 - 8
of
8
) sorted by null
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/policy/
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);
/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
...]
/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/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
...]
Completed in 335 milliseconds