| /external/freetype/src/gzip/ |
| D | infblock.c | 75 ZFREE(z, s->sub.trees.blens); in inflate_blocks_reset()
218 s->sub.trees.table = t = (uInt)b & 0x3fff; in inflate_blocks()
229 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL) in inflate_blocks()
235 s->sub.trees.index = 0; in inflate_blocks()
239 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10)) in inflate_blocks()
242 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7; in inflate_blocks()
245 while (s->sub.trees.index < 19) in inflate_blocks()
246 s->sub.trees.blens[border[s->sub.trees.index++]] = 0; in inflate_blocks()
247 s->sub.trees.bb = 7; in inflate_blocks()
248 t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb, in inflate_blocks()
[all …]
|
| /external/opencv/ml/src/ |
| D | mlrtrees.cpp | 189 trees = NULL; in CvRTrees()
202 delete trees[k]; in clear()
203 cvFree( &trees ); in clear()
322 trees = (CvForestTree**)cvAlloc( sizeof(trees[0])*max_ntrees ); in grow_forest()
323 memset( trees, 0, sizeof(trees[0])*max_ntrees ); in grow_forest()
372 trees[ntrees] = new CvForestTree(); in grow_forest()
373 tree = trees[ntrees]; in grow_forest()
525 result += trees[i]->predict( sample1, missing1 ) == in get_proximity()
526 trees[i]->predict( sample2, missing2 ) ? 1 : 0; in get_proximity()
551 CvDTreeNode* predicted_node = trees[k]->predict( sample, missing ); in predict()
[all …]
|
| /external/zlib/src/msdos/ |
| D | Makefile.tc | 30 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
32 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.o…
68 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| D | 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.o…
83 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| D | Makefile.msc | 41 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
77 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| /external/zlib/src/win32/ |
| D | Makefile.bor | 28 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
31 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.o…
71 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| D | Makefile.msc | 37 gzwrite.obj infback.obj inflate.obj inftrees.obj inffast.obj trees.obj uncompr.obj zutil.obj
118 trees.obj: $(TOP)/trees.c $(TOP)/zutil.h $(TOP)/zlib.h $(TOP)/zconf.h $(TOP)/deflate.h $(TOP)/trees…
|
| /external/zlib/src/contrib/delphi/ |
| D | 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.o…
60 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| /external/zlib/src/contrib/pascal/ |
| D | 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.o…
60 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| /external/zlib/src/watcom/ |
| D | 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
|
| D | 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/opencv3/modules/flann/include/opencv2/flann/ |
| D | miniflann.hpp | 81 KDTreeIndexParams(int trees=4);
91 CompositeIndexParams(int trees = 4, int branching = 32, int iterations = 11,
104 …n::flann_centers_init_t centers_init = cvflann::FLANN_CENTERS_RANDOM, int trees = 4, int leaf_size…
|
| D | composite_index.h | 47 CompositeIndexParams(int trees = 4, int branching = 32, int iterations = 11,
52 (*this)["trees"] = trees;
|
| /external/valgrind/nightly/ |
| D | 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
93 to compare the performances between the 2 trees).
151 process for each of the two trees.
154 for each of the two trees. The diff between these two files goes in
170 - $DIR/valgrind-old/ and $DIR/valgrind-new/ contain the tested trees (and
177 trees were identical. It will contain a short explanatory message.
[all …]
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| D | 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/libpng/contrib/pngminim/encoder/ |
| D | makefile | 32 trees$(C) zutil$(C)
36 ZH = zlib.h crc32.h deflate.h trees.h zutil.h
51 trees$(O) zutil$(O)
|
| /external/zlib/src/amiga/ |
| D | Makefile.sas | 17 uncompr.o deflate.o trees.o zutil.o inflate.o infback.o inftrees.o inffast.o
66 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
|
| D | Makefile.pup | 18 uncompr.o deflate.o trees.o zutil.o inflate.o infback.o inftrees.o inffast.o
67 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
|
| /external/boringssl/src/crypto/x509v3/ |
| D | v3_ncons.c | 74 STACK_OF(GENERAL_SUBTREE) *trees,
180 STACK_OF(GENERAL_SUBTREE) *trees, in do_i2r_name_constraints()
185 if (sk_GENERAL_SUBTREE_num(trees) > 0) in do_i2r_name_constraints()
187 for(i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++) in do_i2r_name_constraints()
189 tree = sk_GENERAL_SUBTREE_value(trees, i); in do_i2r_name_constraints()
|
| /external/zlib/src/ |
| D | Makefile.in | 57 OBJZ = adler32.o crc32.o deflate.o infback.o inffast.o inflate.o inftrees.o trees.o zutil.o
61 PIC_OBJZ = adler32.lo crc32.lo deflate.lo infback.lo inffast.lo inflate.lo inftrees.lo trees.lo zut…
278 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
288 trees.lo: deflate.h zutil.h zlib.h zconf.h trees.h
|
| /external/zlib/src/old/ |
| D | Makefile.riscos | 19 @.o.infblock @.o.infcodes @.o.inffast @.o.inflate @.o.inftrees @.o.infutil @.o.trees \
23 @.o.trees @.o.uncompr @.o.zutil
|
| /external/regex-re2/doc/ |
| D | 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/deqp/external/zlib/ |
| D | CMakeLists.txt | 42 ${ZLIB_ABS_PATH}/trees.c
43 ${ZLIB_ABS_PATH}/trees.h
|
| /external/opencv3/3rdparty/zlib/ |
| D | CMakeLists.txt | 55 trees.h
71 trees.c
|
| /external/zlib/src/old/os2/ |
| D | Makefile.os2 | 45 OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
134 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
|