| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 9 The ASTVisitor will walk the AST, performing either a preorder or
13 preorder(tree, visitor)
25 child nodes are visited during a preorder walk. (It can't control
59 def preorder(self, tree, visitor, *args): member in class:ASTVisitor
60 """Do preorder walk of tree using visitor"""
106 walker.preorder(tree, visitor)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 9 The ASTVisitor will walk the AST, performing either a preorder or
13 preorder(tree, visitor)
25 child nodes are visited during a preorder walk. (It can't control
59 def preorder(self, tree, visitor, *args): member in class:ASTVisitor
60 """Do preorder walk of tree using visitor"""
106 walker.preorder(tree, visitor)
|
| /bionic/libc/include/ |
| search.h | 16 preorder, enumerator in enum:__anon92
|
| /packages/apps/Mms/src/com/android/mms/dom/ |
| NodeListImpl.java | 92 * A preorder traversal is done in the following order:
95 * <li> Traverse children from left to right in preorder.
98 * @param The root of preorder traversal
115 // ...and visit in preorder the children if we are in deep search
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 199 DFSIterator(Graph *graph, const bool preorder)
210 search(graph->getRoot(), preorder, seq);
220 void search(Graph::Node *node, const bool preorder, const int sequence)
222 if (preorder)
227 search(ei.getNode(), preorder, sequence);
229 if (!preorder)
244 IteratorRef Graph::iteratorDFS(bool preorder)
246 return IteratorRef(new DFSIterator(this, preorder));
249 IteratorRef Graph::safeIteratorDFS(bool preorder)
251 return this->iteratorDFS(preorder);
[all...] |
| nv50_ir_graph.h | 160 IteratorRef iteratorDFS(bool preorder = true);
164 IteratorRef safeIteratorDFS(bool preorder = true);
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 199 DFSIterator(Graph *graph, const bool preorder)
210 search(graph->getRoot(), preorder, seq);
220 void search(Graph::Node *node, const bool preorder, const int sequence)
222 if (preorder)
227 search(ei.getNode(), preorder, sequence);
229 if (!preorder)
244 IteratorRef Graph::iteratorDFS(bool preorder)
246 return IteratorRef(new DFSIterator(this, preorder));
249 IteratorRef Graph::safeIteratorDFS(bool preorder)
251 return this->iteratorDFS(preorder);
[all...] |
| nv50_ir_graph.h | 160 IteratorRef iteratorDFS(bool preorder = true);
164 IteratorRef safeIteratorDFS(bool preorder = true);
|
| /external/llvm/include/llvm/Analysis/ |
| LoopIterator.h | 50 /// preorder visited by DFS. It's postorder number is initially zero and set
83 /// Return true if this block has been preorder visited.
149 /// is contained in the loop and has not been visited, then mark it preorder
152 /// TODO: If anyone is interested, we could record preorder numbers here.
163 assert(DFS.PostNumbers.count(BB) && "Loop DFS skipped preorder");
|
| /bionic/libc/upstream-netbsd/libc/gen/ |
| ftw.c | 66 /* we only visit in preorder */
|
| /libcore/luni/src/test/java/tests/org/w3c/dom/ |
| ElementGetElementsByTagNameNS.java | 12 * encountered in a preorder traversal of the Document tree. Invoke
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeFilter.cs | 70 scalar-vector multiply transformation on the way down (preorder) and
74 executing an action in the preorder position. To get a bottom-up
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeFilter.java | 66 scalar-vector multiply transformation on the way down (preorder) and
70 executing an action in the preorder position. To get a bottom-up
|
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 345 bool (*Visitor)(ModuleFile &M, bool Preorder,
349 // Preorder visitation
350 if (Visitor(M, /*Preorder=*/true, UserData))
366 return Visitor(M, /*Preorder=*/false, UserData);
369 void ModuleManager::visitDepthFirst(bool (*Visitor)(ModuleFile &M, bool Preorder,
|
| /external/clang/include/clang/Serialization/ |
| ModuleManager.h | 240 /// traversing the children (preorder traversal) and after
244 /// module and given a \c Preorder flag that indicates whether we're
251 void visitDepthFirst(bool (*Visitor)(ModuleFile &M, bool Preorder,
|
| /external/chromium_org/ui/views/controls/menu/ |
| menu_model_adapter.h | 83 // Container of ui::MenuModel pointers as encountered by preorder
|
| /libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| documentgetelementsbytagnameNS01.java | 36 * in a preorder traversal of the Document tree.
|
| documentgetelementsbytagnameNS02.java | 36 * in a preorder traversal of the Document tree.
|
| documentgetelementsbytagnameNS03.java | 36 * in a preorder traversal of the Document tree.
|
| documentgetelementsbytagnameNS04.java | 36 * in a preorder traversal of the Document tree.
|
| documentgetelementsbytagnameNS05.java | 36 * in a preorder traversal of the Document tree.
|
| elementgetelementsbytagnamens02.java | 48 * name and namespace URI in the order in which they are encountered in a preorder traversal
|
| elementgetelementsbytagnamens04.java | 35 * order in which they are encountered in a preorder traversal of the Document tree.
|
| elementgetelementsbytagnamens05.java | 48 * order in which they are encountered in a preorder traversal of the Document tree.
|
| getElementsByTagNameNS02.java | 36 * localName and namespaceURI in the order they were encountered in a preorder
|
