| /prebuilts/ndk/current/platforms/android-24/arch-mips/usr/include/ |
| search.h | 17 postorder, enumerator in enum:__anon65955
|
| /prebuilts/ndk/current/platforms/android-24/arch-mips64/usr/include/ |
| search.h | 17 postorder, enumerator in enum:__anon66733
|
| /prebuilts/ndk/current/platforms/android-24/arch-x86/usr/include/ |
| search.h | 17 postorder, enumerator in enum:__anon67510
|
| /prebuilts/ndk/current/platforms/android-24/arch-x86_64/usr/include/ |
| search.h | 17 postorder, enumerator in enum:__anon68288
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| search.h | 48 postorder, enumerator in enum:__anon42432
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeFilter.cs | 71 we need to reduce multiply-by-zero subtrees on the way up (postorder).
75 visitor, we execute an action in the postorder position. ANTLR
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeFilter.java | 67 we need to reduce multiply-by-zero subtrees on the way up (postorder).
71 visitor, we execute an action in the postorder position. ANTLR
|
| /external/elfutils/libdw/ |
| dwarf_getscopes.c | 117 /* Postorder visitor: first (innermost) call wins. */
178 of the postorder traversal. */
|
| /external/llvm/tools/opt/ |
| PrintSCC.cpp | 76 errs() << "SCCs for Function " << F.getName() << " in PostOrder:";
96 errs() << "SCCs for the program in PostOrder:";
|
| /bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
| tsearch.c | 104 (*action)(root, postorder, level);
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 78 * So if this gives nonreversed postorder traversal, I get the order
|
| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 1 //===- llvm/ADT/PostOrderIterator.h - PostOrder iterator --------*- C++ -*-===//
186 // Provide global definitions of external postorder iterators...
232 // Provide global definitions of external inverse postorder iterators...
266 // with a postorder iterator to build the data structures). The moral of this
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 50 int BlkNum; // Postorder number.
151 // block, do a forward depth-first traversal to assign postorder numbers
168 // All the successors have been handled; assign the postorder number.
200 /// tree until it finds a common dominator of both. It uses the postorder
|
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 429 /// Add a single Block to its ancestor loops in PostOrder. If the block is a
430 /// subloop header, add the subloop to its parent in PostOrder, then reverse the
443 // For convenience, Blocks and Subloops are inserted in postorder. Reverse
455 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
465 /// 3) Reverse-inserted in the loop in postorder following forward DFS.
473 // Postorder traversal of the dominator tree.
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU.h | 411 * - Postorder the elimination tree and the column permutation
448 // In symmetric mode, do not do postorder here
455 // Renumber etree in postorder
461 // Postmultiply A*Pc by post, i.e reorder the matrix according to the postorder of the etree
466 // Combine the two permutations : postorder the permutation for future use
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMTreeWalker.java | 99 * (postorder) are invoked for each node as we traverse over them,
149 * (postorder) are invoked for each node as we traverse over them,
|
| /bionic/libc/include/ |
| fts.h | 92 #define FTS_DP 6 /* postorder directory */
|
| /bionic/tests/ |
| search_test.cpp | 65 if (order == postorder || order == leaf) {
|
| /development/ndk/platforms/android-21/include/ |
| fts.h | 92 #define FTS_DP 6 /* postorder directory */
|
| /development/ndk/platforms/android-8/include/ |
| fts.h | 92 #define FTS_DP 6 /* postorder directory */
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| CompositeGrammarTree.java | 115 /** Return a postorder list of grammars; root is last in list */
|
| /external/eigen/bench/ |
| sparse_cholesky.cpp | 176 c.postorder = 0;
|
| /external/guava/guava/src/com/google/common/collect/ |
| TreeTraverser.java | 44 * <p>can be iterated over in preorder (hdabcegf), postorder (abcdefgh), or breadth-first order
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeTraverser.java | 40 * can be iterated over in preorder (hdabcegf), postorder (abcdefgh), or breadth-first order
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/ |
| fts.h | 97 #define FTS_DP 6 /* postorder directory */
|
