| /external/chromium_org/v8/test/mjsunit/compiler/ |
| regress-closures-with-eval.js | 32 function walk(v) {
41 return walk(o);
|
| /external/v8/test/mjsunit/compiler/ |
| regress-closures-with-eval.js | 32 function walk(v) {
41 return walk(o);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| __init__.py | 13 walk(ast, visitor, verbose=None)
14 Does a pre-order walk over the ast using the visitor instance.
30 from compiler.visitor import walk namespace
|
| syntax.py | 12 from compiler import ast, walk namespace
16 walk(tree, v)
|
| future.py | 5 from compiler import ast, walk namespace
60 walk(node, p1)
61 walk(node, p2)
66 from compiler import parseFile, walk namespace
72 walk(tree, v)
|
| visitor.py | 7 """Performs a depth-first walk of the AST
9 The ASTVisitor will walk the AST, performing either a preorder or
25 child nodes are visited during a preorder walk. (It can't control
26 the order during a postorder walk, because it is called _after_
27 the walk has occurred.) The ASTVisitor modifies the visitor
60 """Do preorder walk of tree using visitor"""
101 def walk(tree, visitor, walker=None, verbose=None): function
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/email/ |
| iterators.py | 10 'walk',
21 def walk(self):
22 """Walk over the message tree, yielding each subpart.
24 The walk is performed in depth-first order. This method is a
30 for subsubpart in subpart.walk():
42 for subpart in msg.walk():
56 for subpart in msg.walk():
20 def walk(self): function
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| __init__.py | 13 walk(ast, visitor, verbose=None)
14 Does a pre-order walk over the ast using the visitor instance.
30 from compiler.visitor import walk namespace
|
| syntax.py | 12 from compiler import ast, walk namespace
16 walk(tree, v)
|
| future.py | 5 from compiler import ast, walk namespace
60 walk(node, p1)
61 walk(node, p2)
66 from compiler import parseFile, walk namespace
72 walk(tree, v)
|
| visitor.py | 7 """Performs a depth-first walk of the AST
9 The ASTVisitor will walk the AST, performing either a preorder or
25 child nodes are visited during a preorder walk. (It can't control
26 the order during a postorder walk, because it is called _after_
27 the walk has occurred.) The ASTVisitor modifies the visitor
60 """Do preorder walk of tree using visitor"""
101 def walk(tree, visitor, walker=None, verbose=None): function
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/email/ |
| iterators.py | 10 'walk',
21 def walk(self):
22 """Walk over the message tree, yielding each subpart.
24 The walk is performed in depth-first order. This method is a
30 for subsubpart in subpart.walk():
42 for subpart in msg.walk():
56 for subpart in msg.walk():
20 def walk(self): function
|
| /external/chromium/chrome/browser/resources/shared/js/ |
| parse_html_subset.js | 36 function walk(n, f) {
39 walk(n.childNodes[i], f);
59 walk(df, function(node) {
|
| /external/chromium_org/chrome/renderer/resources/extensions/ |
| omnibox_custom_bindings.js | 50 // Recursively walk the tree.
51 function walk(node) {
69 walk(child);
76 walk(child);
79 walk(root);
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/hosted/ |
| json2.js | 410 function walk(holder, key) {
412 // The walk method is used to recursively walk the resulting structure so
419 v = walk(value, k);
469 // In the optional fourth stage, we recursively walk the new structure, passing
473 walk({'': j}, '') : j;
|
| /external/elfutils/libdw/ |
| libdw_visit_scopes.c | 56 enum die_class { ignore, match, match_inline, walk, imported }; enumerator in enum:die_class
85 return walk;
134 case walk:
|
| /external/ppp/pppd/plugins/pppoatm/ |
| text2atm.c | 77 const char *walk; local
83 for (walk = text; *walk; walk++)
84 if (isdigit(*walk)) {
91 if (*walk != ':') {
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| ast.py | 155 for child in walk(node):
203 def walk(node): function
259 The `NodeTransformer` will walk the AST and use the return value of the
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| ast.py | 155 for child in walk(node):
203 def walk(node): function
259 The `NodeTransformer` will walk the AST and use the return value of the
|
| /external/chromium_org/chrome/common/extensions/docs/server2/ |
| file_system.py | 106 def Walk(self, root):
107 '''Recursively walk the directories in a file system, starting with root.
108 Emulates os.walk from the standard os module.
115 def walk(root): function in function:FileSystem.Walk
130 for walkinfo in walk(root + d):
133 for walkinfo in walk(root):
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| string-tagcloud.js | 180 function walk(k, v) {
185 n = walk(i, v[i]);
201 return typeof filter === 'function' ? walk('', j) : j;
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| string-tagcloud.js | 180 function walk(k, v) {
185 n = walk(i, v[i]);
201 return typeof filter === 'function' ? walk('', j) : j;
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
| string-tagcloud.js | 180 function walk(k, v) {
185 n = walk(i, v[i]);
201 return typeof filter === 'function' ? walk('', j) : j;
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpEdgeBuilder.cpp | 34 if (fUnparseable || !walk()) {
142 bool SkOpEdgeBuilder::walk() { function in class:SkOpEdgeBuilder
|
| /external/iproute2/tc/ |
| q_atm.c | 110 char *walk; local
114 for (walk = *argv; *walk; walk++) {
121 if (*walk == '.') continue;
122 if (!isxdigit(walk[0]) || !walk[1] ||
123 !isxdigit(walk[1])) {
127 sscanf(walk,"%2x",&tmp);
129 walk++
[all...] |
