| /external/zlib/src/watcom/ |
| 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
|
| 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
|
| /external/opencv/ml/src/ |
| mlrtrees.cpp | 181 // Random trees //
189 trees = NULL;
202 delete trees[k];
203 cvFree( &trees );
322 trees = (CvForestTree**)cvAlloc( sizeof(trees[0])*max_ntrees );
323 memset( trees, 0, sizeof(trees[0])*max_ntrees );
372 trees[ntrees] = new CvForestTree();
373 tree = trees[ntrees]
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/test/ |
| finder.py | 78 self.trees = []
82 self.trees.append(_DirectoryTree(self.filesystem, top_directory, starting_subdirectory))
88 return [tree.top_directory for tree in self.trees if tree.top_directory not in paths]
91 for tree in self.trees:
96 return any(self.filesystem.exists(self.filesystem.join(tree.top_directory, relpath)) for tree in self.trees)
102 for tree in self.trees:
122 _log.error("%s is not in one of the test trees." % arg)
138 for tree in self.trees:
150 for tree in self.trees:
|
| /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/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/chromium_org/third_party/re2/doc/ |
| mksyntaxgo | 25 Package syntax parses regular expressions into parse trees and compiles
26 parse trees into programs. Most clients of regular expressions will use the
|
| /external/libpng/contrib/pngminim/decoder/ |
| makefile | 20 trees$(O) uncompr$(O) zutil$(O)
|
| /external/libpng/contrib/pngminim/encoder/ |
| makefile | 19 trees$(O) uncompr$(O) zutil$(O)
|
| /external/regex-re2/doc/ |
| mksyntaxgo | 25 Package syntax parses regular expressions into parse trees and compiles
26 parse trees into programs. Most clients of regular expressions will use the
|
| /external/srec/seti/sltsEngine/include/ |
| lts_seq_internal.h | 96 /*RT tree is the compact representations of the trees
135 RT_LTREE **trees; member in struct:LTS
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| treemixin.py | 4 # Purpose: treemixin provides top level functions for binary trees
16 Abstract-Base-Class for the pure Python Trees: BinaryTree, AVLTree and RBTree
17 Mixin-Class for the Cython based Trees: FastBinaryTree, FastAVLTree, FastRBTree
127 * intersection(t1, t2, ...) -> Tree with keys *common* to all trees
128 * union(t1, t2, ...) -> Tree with keys from *either* trees
593 def intersection(self, *trees):
594 """ x.intersection(t1, t2, ...) -> Tree, with keys *common* to all trees
597 sets = _build_sets(trees)
601 def union(self, *trees):
602 """ x.union(t1, t2, ...) -> Tree with keys from *either* trees
[all...] |
| /external/libpng/contrib/pngminim/preader/ |
| makefile | 36 trees$(O) uncompr$(O) zutil$(O)
|
| /external/srec/seti/sltsEngine/src/ |
| run_seq_lts.c | 76 static SWIsltsResult free_trees(RT_LTREE **trees, int num_letters, LQUESTION **questions, int num_questions, LM *lm);
504 RT_LTREE ** trees = NULL; local
538 *ptrees = trees = (RT_LTREE**) lts_alloc(*num_letters, sizeof(RT_LTREE*));
539 if (trees == NULL) {
547 trees[let] = tree = (RT_LTREE*) lts_alloc(1, sizeof(RT_LTREE));
603 free_trees(trees, *num_letters, *pquestions, *num_questions, *plm);
613 /* deallocate trees */
614 static SWIsltsResult free_trees(RT_LTREE **trees, int num_letters,
628 if (trees) {
630 if (trees[i])
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/ |
| v3_ncons.c | 71 STACK_OF(GENERAL_SUBTREE) *trees,
177 STACK_OF(GENERAL_SUBTREE) *trees,
182 if (sk_GENERAL_SUBTREE_num(trees) > 0)
184 for(i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++)
186 tree = sk_GENERAL_SUBTREE_value(trees, i);
|
| /external/openssl/crypto/x509v3/ |
| v3_ncons.c | 71 STACK_OF(GENERAL_SUBTREE) *trees,
177 STACK_OF(GENERAL_SUBTREE) *trees,
182 if (sk_GENERAL_SUBTREE_num(trees) > 0)
184 for(i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++)
186 tree = sk_GENERAL_SUBTREE_value(trees, i);
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleSubtreeStream.js | 15 * we can't be adding trees as root; e.g., expr expr.
|
| /external/zlib/ |
| Android.mk | 21 src/trees.c \
|
| /external/chromium_org/v8/test/mjsunit/ |
| deep-recursion.js | 29 * @fileoverview Check that flattening deep trees of cons strings does not
|
