| /external/v8/test/mjsunit/compiler/ |
| simple-bailouts.js | 40 // trees with <= 4 leaves.
|
| /external/valgrind/main/VEX/priv/ |
| ir_match.c | 56 and expression trees in the obvious way, and dumping any matches
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| coretypes.h | 102 or SYMBOL_REF. This isn't used much, but both trees and RTL refer
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| coretypes.h | 102 or SYMBOL_REF. This isn't used much, but both trees and RTL refer
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| coretypes.h | 102 or SYMBOL_REF. This isn't used much, but both trees and RTL refer
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| coretypes.h | 102 or SYMBOL_REF. This isn't used much, but both trees and RTL refer
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/rb_tree_map_/ |
| rb_tree_.hpp | 38 * Contains an implementation for Red Black trees.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/rb_tree_map_/ |
| rb_tree_.hpp | 38 * Contains an implementation for Red Black trees.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/rb_tree_map_/ |
| rb_tree_.hpp | 38 * Contains an implementation for Red Black trees.
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/xml/etree/ |
| ElementInclude.py | 5 # limited xinclude support for element trees
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/xml/etree/ |
| ElementInclude.py | 5 # limited xinclude support for element trees
|
| /sdk/build/ |
| tools.atree | 111 # We're skipping the build and src/ trees (except for src/proguard/ant/task.properties)
|
| /system/core/sh/ |
| nodetypes | 34 # This file describes the nodes used in parse trees. Unindented lines
|
| /external/chromium_org/cc/trees/ |
| layer_tree_host_impl.cc | 5 #include "cc/trees/layer_tree_host_impl.h"
47 #include "cc/trees/damage_tracker.h"
48 #include "cc/trees/layer_tree_host.h"
49 #include "cc/trees/layer_tree_host_common.h"
50 #include "cc/trees/layer_tree_impl.h"
51 #include "cc/trees/quad_culler.h"
52 #include "cc/trees/single_thread_proxy.h"
53 #include "cc/trees/tree_synchronizer.h"
237 // The layer trees must be destroyed before the layer tree host. We've
[all...] |
| /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
| RopeByteString.java | 81 * with longer strings being encoded in deeper binary trees.
226 * testing trees of specific structure. We are also able to insert empty
284 * balanced is one where sub-trees of balanced trees are not necessarily
647 // BAP95: Concatenate all trees occupying bins representing the length of
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 51 /// How to create and navigate trees. Rather than have a separate factory
67 /// Create a tree node from Token object; for CommonTree type trees,
169 /// for non-flat trees.
171 /// Flat trees such as for lists like "idlist : ID+ ;" are left alone
181 /// For identifying trees. How to identify nodes so we can say "add node
268 /// method right before returning. Flat trees (i.e., lists) will
372 // REWRITING TREES (used by tree parser)
412 /// What adaptor can tell me how to interpret/navigate nodes and trees.
429 /// such as CommonTreeNodeStream that work on these kinds of trees. You
430 /// don't have to make your trees implement this interface, but if you do
[all...] |
| /external/opencv/ml/src/ |
| mlboost.cpp | 933 "Boosted trees can only be used for 2-class classification." );
1038 // the target function values are recalculated for each of the trees
[all...] |
| /external/zlib/src/doc/ |
| rfc1951.txt | 197 and Huffman coding. The Huffman trees for each block are independent
202 Each block consists of two parts: a pair of Huffman code trees that
204 compressed data part. (The Huffman trees themselves are compressed
217 The code trees for each block appear in a compact form just before
546 read representation of code trees (see
809 new block with fresh trees would be useful, or when the block size
[all...] |
| /external/zlib/src/ |
| make_vms.com | 203 $ CALL MAKE trees.OBJ "CC ''CCOPT' trees" -
204 trees.c deflate.h zutil.h zlib.h zconf.h
431 deflate.obj, trees.obj, zutil.obj, inflate.obj, \
469 trees.obj : trees.c deflate.h zutil.h zlib.h zconf.h
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/bin/ |
| i686-linux-c++ | |
| i686-linux-cpp | |
| i686-linux-g++ | |
| i686-linux-gcc | |
| i686-linux-gcc-4.6.x-google | |
| /prebuilts/gcc/linux-x86/mips/mipsel-linux-android-4.6/bin/ |
| mipsel-linux-android-cpp | |
