/external/chromium_org/third_party/bintrees/ |
NEWS.txt | 38 * Pure Python trees are working with Python 3 65 * TreeMixin Class as base for Python-Trees and as Mixin for Cython-Trees
|
/external/chromium_org/third_party/bintrees/bintrees/ |
rbtree.py | 12 # Red black trees are interesting beasts. They're believed to be simpler than 13 # AVL trees (their direct competitor), and at first glance this seems to be the 15 # deletion algorithm, red black trees become very tricky. However, the 18 # case with AVL trees, where only the insertion algorithm can be written top-down. 22 # found that red black trees are best suited to largely random data that has 24 # takes full advantage of the minimal work that red black trees perform to 25 # maintain balance compared to AVL trees and still allows for speedy searches. 27 # Red black trees are popular, as most data structures with a whimsical name. 29 # implemented with a red black tree. Red black trees are also comparable in 30 # speed to AVL trees. While the balance is not quite as good, the work it take [all...] |
__init__.py | 4 # Purpose: binary trees package 15 Python Trees 18 Balanced and unbalance binary trees written in pure Python with a dict-like API. 26 Cython Trees 30 full API of the Python Trees. 126 * intersection(t1, t2, ...) -> Tree with keys *common* to all trees 127 * union(t1, t2, ...) -> Tree with keys from *either* trees
|
/external/zlib/src/watcom/ |
watcom_f.mak | 10 trees.c uncompr.c zutil.c 15 trees.obj uncompr.obj zutil.obj 32 wlib -b -c $(ZLIB_LIB) -+trees.obj -+uncompr.obj -+zutil.obj
|
watcom_l.mak | 10 trees.c uncompr.c zutil.c 15 trees.obj uncompr.obj zutil.obj 32 wlib -b -c $(ZLIB_LIB) -+trees.obj -+uncompr.obj -+zutil.obj
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
Tree.as | 3 * such as CommonTreeNodeStream that work on these kinds of trees. You 4 * don't have to make your trees implement this interface, but if you do, 7 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can 8 * even use Token objects as trees if you add a child list to your tokens.
|
/external/chromium_org/cc/resources/ |
scoped_ui_resource.cc | 9 #include "cc/trees/layer_tree_host.h"
|
/external/chromium_org/cc/test/ |
fake_layer_tree_host_impl.cc | 6 #include "cc/trees/layer_tree_impl.h"
|
fake_scoped_ui_resource.cc | 7 #include "cc/trees/layer_tree_host.h"
|
/external/chromium_org/third_party/WebKit/PerformanceTests/DOM/resources/dom-perf/ |
clonenodes.js | 31 // Tests cloning and appending small and medium DOM trees. 62 var domTree = me.Trees[me.size]; 75 me.Trees[me.size] = domTree; 88 Trees: {}
|
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
inttree.h | 9 * interval trees implemented using red-black-trees as described in
|
/external/guava/guava/src/com/google/common/collect/ |
BstBalancePolicy.java | 22 * A local balancing policy for modified nodes in binary search trees. 25 * @param <N> The type of the nodes in the trees that this {@code BstRebalancePolicy} can
|
/external/valgrind/main/nightly/ |
README.txt | 10 When run, the system checks out two trees: the SVN trunk from 24 hours ago 15 If the two trees are different (i.e. there have been commits in the past 24 21 install" isn't totally broken. After checking both trees, it emails a 25 If the two trees are identical, the tests are not run and no results are 43 to; rather it checks out new trees (within $DIR) and tests them 139 process for each of the two trees. 142 for each of the two trees. The diff between these two files goes in 158 - $DIR/valgrind-old/ and $DIR/valgrind-new/ contain the tested trees (and 165 trees were identical. It will contain a short explanatory message. 177 or both trees. When this happens the email will be sent but it won't b [all...] |
/development/ide/xcode/zlib.xcodeproj/ |
project.pbxproj | 18 FE08AA150944F1E40057213F /* trees.c in Sources */ = {isa = PBXBuildFile; fileRef = FE08AA0A0944F1E40057213F /* trees.c */; }; 27 FE08AA2C0944F2710057213F /* trees.h in Headers */ = {isa = PBXBuildFile; fileRef = FE08AA210944F2710057213F /* trees.h */; }; 69 FE08AA0A0944F1E40057213F /* trees.c */ = {isa = PBXFileReference; fileEncoding = 30; lastKnownFileType = sourcecode.c.c; name = trees.c; path = "../../extlibs/zlib-1.2.3/trees.c"; sourceTree = SOURCE_ROOT; }; 78 FE08AA210944F2710057213F /* trees.h */ = {isa = PBXFileReference; fileEncoding = 30; lastKnownFileType = sourcecode.c.h; name = trees.h; path = "../../extlibs/zlib-1.2.3/trees.h"; sourceTree = SOURCE_ROOT; } [all...] |
/external/chromium_org/cc/ |
cc.target.darwin-arm.mk | 181 cc/trees/damage_tracker.cc \ 182 cc/trees/layer_sorter.cc \ 183 cc/trees/layer_tree_host.cc \ 184 cc/trees/layer_tree_host_common.cc \ 185 cc/trees/layer_tree_host_impl.cc \ 186 cc/trees/layer_tree_impl.cc \ 187 cc/trees/layer_tree_settings.cc \ 188 cc/trees/occlusion_tracker.cc \ 189 cc/trees/proxy.cc \ 190 cc/trees/quad_culler.cc [all...] |
cc.target.darwin-mips.mk | 181 cc/trees/damage_tracker.cc \ 182 cc/trees/layer_sorter.cc \ 183 cc/trees/layer_tree_host.cc \ 184 cc/trees/layer_tree_host_common.cc \ 185 cc/trees/layer_tree_host_impl.cc \ 186 cc/trees/layer_tree_impl.cc \ 187 cc/trees/layer_tree_settings.cc \ 188 cc/trees/occlusion_tracker.cc \ 189 cc/trees/proxy.cc \ 190 cc/trees/quad_culler.cc [all...] |
cc.target.darwin-x86.mk | 181 cc/trees/damage_tracker.cc \ 182 cc/trees/layer_sorter.cc \ 183 cc/trees/layer_tree_host.cc \ 184 cc/trees/layer_tree_host_common.cc \ 185 cc/trees/layer_tree_host_impl.cc \ 186 cc/trees/layer_tree_impl.cc \ 187 cc/trees/layer_tree_settings.cc \ 188 cc/trees/occlusion_tracker.cc \ 189 cc/trees/proxy.cc \ 190 cc/trees/quad_culler.cc [all...] |
cc.target.linux-arm.mk | 181 cc/trees/damage_tracker.cc \ 182 cc/trees/layer_sorter.cc \ 183 cc/trees/layer_tree_host.cc \ 184 cc/trees/layer_tree_host_common.cc \ 185 cc/trees/layer_tree_host_impl.cc \ 186 cc/trees/layer_tree_impl.cc \ 187 cc/trees/layer_tree_settings.cc \ 188 cc/trees/occlusion_tracker.cc \ 189 cc/trees/proxy.cc \ 190 cc/trees/quad_culler.cc [all...] |
cc.target.linux-mips.mk | 181 cc/trees/damage_tracker.cc \ 182 cc/trees/layer_sorter.cc \ 183 cc/trees/layer_tree_host.cc \ 184 cc/trees/layer_tree_host_common.cc \ 185 cc/trees/layer_tree_host_impl.cc \ 186 cc/trees/layer_tree_impl.cc \ 187 cc/trees/layer_tree_settings.cc \ 188 cc/trees/occlusion_tracker.cc \ 189 cc/trees/proxy.cc \ 190 cc/trees/quad_culler.cc [all...] |
cc.target.linux-x86.mk | 181 cc/trees/damage_tracker.cc \ 182 cc/trees/layer_sorter.cc \ 183 cc/trees/layer_tree_host.cc \ 184 cc/trees/layer_tree_host_common.cc \ 185 cc/trees/layer_tree_host_impl.cc \ 186 cc/trees/layer_tree_impl.cc \ 187 cc/trees/layer_tree_settings.cc \ 188 cc/trees/occlusion_tracker.cc \ 189 cc/trees/proxy.cc \ 190 cc/trees/quad_culler.cc [all...] |
/external/antlr/antlr-3.4/runtime/C/include/ |
antlr3rewritestreams.h | 122 /// When constructing trees, sometimes we need to dup a token or AST 124 /// around it. For trees, you must call the adaptor.dupTree(). 128 /// Ensure stream emits trees; tokens must be converted to AST nodes. 144 /// we can't be adding trees; e.g., expr expr. 166 /// This is an implementation of a subtree stream which is a set of trees
|
/external/zlib/src/as400/ |
readme.txt | 80 inftrees.c INFTREES C ZLIB - Generate Huffman trees for efficient decode 81 trees.c TREES C ZLIB - Output deflated data using Huffman coding 92 trees.h TREES C ZLIB - Created automatically with -DGEN_TREES_H
|
/external/zlib/src/contrib/delphi/ |
zlibd32.mak | 22 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj 24 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj 60 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
/external/zlib/src/contrib/pascal/ |
zlibd32.mak | 22 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj 24 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj 60 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
/external/zlib/src/msdos/ |
Makefile.bor | 45 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj 47 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj 83 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|