Searched refs:preorder (Results 1 - 9 of 9) sorted by relevance
/external/toolchain-utils/binary_search_tool/full_bisect_test/ |
H A D | build.sh | 15 gcc -c preorder.c -o work/preorder.o 21 gcc -o bin-trees work/main.o work/preorder.o work/inorder.o work/build.o work/preorder_norecurse.o work/inorder_norecurse.o work/stack.o
|
H A D | chromeos_build.sh | 15 x86_64-cros-linux-gnu-gcc -c preorder.c -o work/preorder.o 21 x86_64-cros-linux-gnu-gcc -o bin-trees work/main.o work/preorder.o work/inorder.o work/build.o work/preorder_norecurse.o work/inorder_norecurse.o work/stack.o
|
/external/libmicrohttpd/src/microhttpd/ |
H A D | tsearch.h | 27 preorder, enumerator in enum:__anon11736
|
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
H A D | nv50_ir_graph.cpp | 199 DFSIterator(Graph *graph, const bool preorder) argument 210 search(graph->getRoot(), preorder, seq); 220 void search(Graph::Node *node, const bool preorder, const int sequence) argument 222 if (preorder) 227 search(ei.getNode(), preorder, sequence); 229 if (!preorder) 244 IteratorRef Graph::iteratorDFS(bool preorder) argument 246 return IteratorRef(new DFSIterator(this, preorder)); 249 IteratorRef Graph::safeIteratorDFS(bool preorder) argument 251 return this->iteratorDFS(preorder); [all...] |
H A D | nv50_ir_graph.h | 160 IteratorRef iteratorDFS(bool preorder = true); 164 IteratorRef safeIteratorDFS(bool preorder = true);
|
/external/python/cpython2/Lib/compiler/ |
H A D | 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)
|
/external/clang/utils/ |
H A D | FindSpecRefs | 795 def preorder(node,parents=(),first=True): function 800 for item in preorder(c, parents+(node,)): 858 for path in preorder(node,first=False):
|
/external/python/cpython2/Parser/ |
H A D | spark.py | 713 # back onto the default() method if the n_* can't be found. The preorder 717 # preorder traversal. Node type is determined via the typestring() method. 733 def preorder(self, node=None): member in class:GenericASTTraversal 748 self.preorder(kid)
|
/external/annotation-tools/annotation-file-utilities/ |
H A D | design.tex | 37 generate-and-test: it chooses an AST node in a preorder traversal and
|
Completed in 753 milliseconds