| /external/pixman/pixman/ |
| pixman-gradient-walker.c | 32 _pixman_gradient_walker_init (pixman_gradient_walker_t *walker,
36 walker->num_stops = gradient->n_stops;
37 walker->stops = gradient->stops;
38 walker->left_x = 0;
39 walker->right_x = 0x10000;
40 walker->a_s = 0.0f;
41 walker->a_b = 0.0f;
42 walker->r_s = 0.0f;
43 walker->r_b = 0.0f;
44 walker->g_s = 0.0f
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeRenderingTraversal.cpp | 53 ComposedShadowTreeWalker walker(node, ComposedShadowTreeWalker::CrossUpperBoundary, ComposedShadowTreeWalker::CanStartFromShadowBoundary);
54 ContainerNode* found = toContainerNode(walker.traverseParent(walker.get(), details));
60 ComposedShadowTreeWalker walker(node);
62 walker.parent();
63 walker.firstChild();
65 walker.nextSibling();
67 if (walker.get() || node->isAfterPseudoElement())
68 return walker.get();
70 Node* parent = walker.traverseParent(node)
98 ComposedShadowTreeWalker walker = ComposedShadowTreeWalker(node, ComposedShadowTreeWalker::DoNotCrossUpperBoundary); local
105 ComposedShadowTreeWalker walker = ComposedShadowTreeWalker(node, ComposedShadowTreeWalker::DoNotCrossUpperBoundary); local
112 ComposedShadowTreeWalker walker = ComposedShadowTreeWalker(node, ComposedShadowTreeWalker::DoNotCrossUpperBoundary); local
119 ComposedShadowTreeWalker walker = ComposedShadowTreeWalker(node, ComposedShadowTreeWalker::DoNotCrossUpperBoundary); local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| WalkingIterator.java | 83 * Get the analysis bits for this walker, as defined in the WalkerFactory.
91 AxesWalker walker = m_firstWalker; local
93 while (null != walker)
95 int bit = walker.getAnalysisBits();
97 walker = walker.getNextWalker();
206 * Get the head of the walker list.
208 * @return The head of the walker list, or null
218 * Set the head of the walker list.
220 * @param walker Should be a valid AxesWalker
262 AxesWalker walker = m_firstWalker; local
290 AxesWalker walker = m_firstWalker; local
[all...] |
| AxesWalker.java | 65 * walker in the op map.
101 * Do a deep clone of this walker, including next and previous walkers.
173 * Detaches the walker from the set which it iterated over, releasing
200 * Get the analysis bits for this walker, as defined in the WalkerFactory.
230 XSLMessages.createXPATHMessage(XPATHErrorResources.ER_SETTING_WALKER_ROOT_TO_NULL, null)); //"\n !!!! Error! Setting the root of a walker to null!!!");
256 * Set the next walker in the location step chain.
259 * @param walker Reference to AxesWalker derivative, or may be null.
261 public void setNextWalker(AxesWalker walker)
263 m_nextWalker = walker;
267 * Get the next walker in the location step chain
356 AxesWalker walker = wi().getLastUsedWalker(); local
417 AxesWalker walker; local
[all...] |
| WalkingIteratorSorted.java | 98 AxesWalker walker = m_firstWalker; local
102 for(int i = 0; null != walker; i++)
104 int axis = walker.getAxis();
106 if(walker.isDocOrdered())
114 walker = walker.getNextWalker();
117 boolean isLastWalker = (null == walker.getNextWalker());
120 if(walker.isDocOrdered() && (axis == Axis.DESCENDANT ||
148 // AxesWalker walker = m_firstWalker;
152 // for(int i = 0; null != walker; i++
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
| main.m | 24 // SimpleCTP *walker = [[SimpleCTP alloc] initWithTreeNodeStream:treeStream];
25 // [walker program];
32 // [walker release];
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
| Main.java | 17 LangDumpDecl walker = new LangDumpDecl(nodes); local
18 walker.decl();
|
| main.m | 26 LangDumpDecl walker = new LangDumpDecl(nodes);
27 walker.decl();
50 LangDumpDecl *walker = [LangDumpDecl newLangDumpDecl:nodes];
51 [walker decl];
|
| /external/chromium_org/third_party/re2/re2/testing/ |
| null_walker.cc | 7 #include "re2/walker-inl.h"
11 // Null walker. For benchmarking the walker itself.
13 class NullWalker : public Regexp::Walker<bool> {
|
| /external/regex-re2/re2/testing/ |
| null_walker.cc | 7 #include "re2/walker-inl.h"
11 // Null walker. For benchmarking the walker itself.
13 class NullWalker : public Regexp::Walker<bool> {
|
| /external/valgrind/main/memcheck/tests/ |
| vcpu_fbench.stdout.exp | 1 Ready to begin John Walker's floating point accuracy
|
| /external/libusb/ |
| AUTHORS | 17 Rob Walker
|
| /external/chromium_org/third_party/re2/re2/ |
| walker-inl.h | 22 template<typename T> class Regexp::Walker {
24 Walker();
25 virtual ~Walker();
95 DISALLOW_EVIL_CONSTRUCTORS(Walker);
98 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re,
104 template<typename T> T Regexp::Walker<T>::PostVisit(Regexp* re,
112 template<typename T> T Regexp::Walker<T>::Copy(T arg) {
132 template<typename T> Regexp::Walker<T>::Walker() {
137 template<typename T> Regexp::Walker<T>::~Walker()
[all...] |
| /external/regex-re2/re2/ |
| walker-inl.h | 22 template<typename T> class Regexp::Walker {
24 Walker();
25 virtual ~Walker();
95 DISALLOW_EVIL_CONSTRUCTORS(Walker);
98 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re,
104 template<typename T> T Regexp::Walker<T>::PostVisit(Regexp* re,
112 template<typename T> T Regexp::Walker<T>::Copy(T arg) {
132 template<typename T> Regexp::Walker<T>::Walker() {
137 template<typename T> Regexp::Walker<T>::~Walker()
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/ |
| basic.rb | 39 walker = FlatListWalker::TreeParser.new( nodes )
40 walker.a
41 walker.output.should == "abc, 34"
75 walker = SimpleTreeWalker::TreeParser.new( nodes )
76 walker.a
77 walker.output.should == "abc, 34"
114 walker = FlatVsTreeDecisionWalker::TreeParser.new( nodes )
115 walker.a
116 walker.output.should == "^(a 1)b 2\n"
152 walker = FlatVsTreeDecision2Walker::TreeParser.new( nodes
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t047treeparser.py | 66 walker = self.getWalker(nodes)
67 walker.program()
69 # FIXME: need to crosscheck with Java target (compile walker with
73 walker.traces,
115 walker = self.getWalker(nodes)
116 r = walker.variable()
|
| /external/chromium_org/third_party/sqlite/src/src/ |
| walker.c | 39 int sqlite3WalkExpr(Walker *pWalker, Expr *pExpr){
62 int sqlite3WalkExprList(Walker *pWalker, ExprList *p){
79 int sqlite3WalkSelectExpr(Walker *pWalker, Select *p){
97 int sqlite3WalkSelectFrom(Walker *pWalker, Select *p){
121 ** If the Walker does not have an xSelectCallback() then this routine
124 int sqlite3WalkSelect(Walker *pWalker, Select *p){
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 101 def walk(tree, visitor, walker=None, verbose=None):
102 if walker is None:
103 walker = _walker()
105 walker.VERBOSE = verbose
106 walker.preorder(tree, visitor)
107 return walker.visitor
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 101 def walk(tree, visitor, walker=None, verbose=None):
102 if walker is None:
103 walker = _walker()
105 walker.VERBOSE = verbose
106 walker.preorder(tree, visitor)
107 return walker.visitor
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/ |
| tree-rewrite.rb | 1012 walker = FlatListWalker::TreeParser.new( nodes )
1013 result = walker.a
1026 walker = SimpleTreeWalker::TreeParser.new( nodes )
1027 result = walker.a
1040 walker = CombinedRewriteAndAutoWalker::TreeParser.new( nodes )
1041 result = walker.a.tree
1050 walker = CombinedRewriteAndAutoWalker::TreeParser.new( nodes )
1051 result = walker.a.tree
1063 walker = AvoidDupWalker::TreeParser.new( nodes )
1064 result = walker.
[all...] |
| /external/chromium_org/third_party/bintrees/bintrees/ |
| qavltree.pyx | 52 cdef cWalker walker
53 walker = cWalker()
54 walker.set_tree(self._root)
55 return walker
|
| qbintree.pyx | 52 cdef cWalker walker
53 walker = cWalker()
54 walker.set_tree(self._root)
55 return walker
|
| qrbtree.pyx | 52 cdef cWalker walker
53 walker = cWalker()
54 walker.set_tree(self._root)
55 return walker
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
| next_prior.hpp | 3 // (C) Copyright Dave Abrahams and Daniel Walker 1999-2003. Distributed under the Boost
10 // 13 Dec 2003 Added next(x, n) and prior(x, n) (Daniel Walker)
|
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| t047treeparser.html | 103 var walker = new TWalker(nodes);
104 walker.program();
106 assertArrayEquals(walker.traces, traces);
118 var walker = new TWalker(nodes);
119 r = walker.variable();
|
