| /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/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
|
| zlibpas.pas | 184 {$L trees.obj}
|
| /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/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/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/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/v8/test/mjsunit/ |
| deep-recursion.js | 29 * @fileoverview Check that flattening deep trees of cons strings does not
|
| /external/v8/test/mjsunit/compiler/ |
| simple-bailouts.js | 40 // trees with <= 4 leaves.
|
| expression-trees.js | 58 // All 429 possible bitwise OR trees with eight leaves.
|
| /prebuilts/sdk/tools/lib/ |
| lombok-ast-0.2.jar | |
| /prebuilts/tools/common/lombok-ast/ |
| lombok-ast-0.2.jar | |
| /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
|
| /external/chromium/chrome/browser/resources/net_internals/ |
| socketpoolwrapper.js | 29 * parent, and groups of nodes from trees with root nodes with the same id are
|
| /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/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| tree.rb | 72 Trees (ASTs), tree structures that reflect the high-level syntactic and semantic
90 (instead of basic tokens), and adds some helper methods for working with trees.
192 = ANTLR Abstract Syntax Trees
195 wraps a token, a list of child trees, and some information about the collective
200 tree nodes as well as the methods trees need to implement.
463 application, building trees with all of this extra information may be
468 the customized lighter-weight trees.
669 trees. Using an adaptor object permits a single recognizer to work with any
671 on customized tree structures. For example, if you want to represent trees using
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.preferences_3.3.0.v20100503.jar | |
| /cts/suite/pts/hostTests/browser/browserlauncher/assets/octane/ |
| splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
288 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
