| /frameworks/base/core/tests/overlaytests/ |
| Android.mk | 1 # Dummy makefile to halt recursive directory 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...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisTraverser.java | 48 * By the nature of the stateless traversal, the context node can not be
55 * @param context The context node of this traversal. This is the point
56 * that the traversal starts from.
57 * @return the first node in the traversal.
65 * By the nature of the stateless traversal, the context node can not be
72 * @param context The context node of this traversal. This is the point
73 * of origin for the traversal -- its "root node" or starting point.
76 * @return the first node in the traversal.
86 * @param context The context node of this traversal. This is the point
87 * of origin for the traversal -- its "root node" or starting point
[all...] |
| /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/chromium_org/sync/internal_api/ |
| 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...] |
| /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...] |
| /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...] |
| /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>);
|
| /external/chromium_org/ui/views/ |
| debug_utils.h | 17 // Log the focus traversal hierarchy.
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 184 throw new DTMException(XMLMessages.createXMLMessage(XMLErrorResources.ER_UNKNOWN_AXIS_TYPE, new Object[]{Integer.toString(axis)})); //"Unknown axis traversal type: "+axis);
198 * Implements traversal of the Ancestor access, in reverse document order.
242 * Implements traversal of the Ancestor access, in reverse document order.
248 * By the nature of the stateless traversal, the context node can not be
252 * @param context The context node of this traversal.
254 * @return the first node in the traversal.
262 * By the nature of the stateless traversal, the context node can not be
268 * @param context The context node of this traversal.
271 * @return the first node in the traversal.
281 * Implements traversal of the Attribute acces
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/ls/ |
| LSSerializerFilter.java | 15 import org.w3c.dom.traversal.NodeFilter;
21 * based on the <code>NodeFilter</code> interface defined in [<a href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>DOM Level 2 Traversal and Range</a>]
57 * <br> Unlike [<a href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>DOM Level 2 Traversal and Range</a>]
60 * <br> The constants used here are defined in [<a href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>DOM Level 2 Traversal and Range</a>]
|
| /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...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/wsgiref/ |
| __init__.py | 22 * router -- a simple middleware component that handles URL traversal
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/xml/dom/ |
| NodeFilter.py | 2 # DOM2-Traversal-Range. It contains only constants.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/wsgiref/ |
| __init__.py | 22 * router -- a simple middleware component that handles URL traversal
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/xml/dom/ |
| NodeFilter.py | 2 # DOM2-Traversal-Range. It contains only constants.
|
| /external/chromium_org/remoting/jingle_glue/ |
| network_settings.h | 12 // When hosts are configured with NAT traversal disabled they will
19 // Active NAT traversal using STUN and relay servers.
|
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| NodeFilter.java | 13 package org.w3c.dom.traversal;
21 * node. If the filter says to accept the node, the traversal logic returns
22 * it; otherwise, traversal looks for the next node and pretends that the
32 * <p>See also the <a href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>Document Object Model (DOM) Level 2 Traversal and Range Specification</a>.
76 * or traversal. Since attributes are never children of other nodes,
97 * position of the traversal. Since entities are not part of the
127 * position of the traversal. Since notations are not part of the
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
| typing_suggest_policy.h | 29 class Traversal;
38 AK_FORCE_INLINE const Traversal *getTraversal() const {
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| DOMImplementationSource.java | 33 * the string <code>"XML 3.0 Traversal +Events 2.0"</code> will
35 * 3.0 version, a module that support of the "Traversal" module for
51 * version number. This is something like: "XML 3.0 Traversal +Events
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| TreeWalker2Result.java | 63 * Perform a pre-order traversal non-recursive style.
65 * @param pos Start node for traversal
95 * Start traversal of the tree at the given node
98 * @param node Starting node for traversal
|
| /external/guava/guava/src/com/google/common/collect/ |
| BstInOrderPath.java | 27 * A {@code BstPath} supporting inorder traversal operations.
101 * Returns {@code true} if there is a next path in an in-order traversal in the given direction.
108 * Returns the next path in an in-order traversal in the given direction.
110 * @throws NoSuchElementException if this would be the last path in an in-order traversal
|
