/haiku-fatelf/src/libs/ncurses/ncurses/trace/ |
H A D | trace_tries.c | 45 recur_tries(struct tries *tree, unsigned level) argument 50 while (tree != 0) { 51 if ((buffer[level] = tree->ch) == 0) 54 if (tree->value != 0) { 55 _tracef("%5d: %s (%s)", tree->value, 56 _nc_visbuf((char *) buffer), keyname(tree->value)); 58 if (tree->child) 59 recur_tries(tree->child, level + 1); 60 tree = tree 65 _nc_trace_tries(struct tries *tree) argument [all...] |
/haiku-fatelf/src/libs/ncurses/ncurses/base/ |
H A D | tries.c | 36 ** Functions to manage the tree of partial-completions for keycodes. 49 _nc_expand_try(struct tries *tree, unsigned short code, int *count, size_t len) argument 51 struct tries *ptr = tree; 82 * Remove a code from the specified tree, freeing the unused nodes. Returns 86 _nc_remove_key(struct tries **tree, unsigned short code) argument 88 T((T_CALLED("_nc_remove_key(%p,%d)"), tree, code)); 93 while (*tree != 0) { 94 if (_nc_remove_key(&(*tree)->child, code)) { 97 if ((*tree)->value == code) { 98 if ((*tree) 118 _nc_remove_string(struct tries **tree, const char *string) argument [all...] |
/haiku-fatelf/src/add-ons/translators/icns/openjpeg/ |
H A D | tgt.c | 36 Tag-tree coder interface 46 opj_tgt_tree_t *tree = NULL; local 51 tree = (opj_tgt_tree_t *) opj_malloc(sizeof(opj_tgt_tree_t)); 52 if(!tree) return NULL; 53 tree->numleafsh = numleafsh; 54 tree->numleafsv = numleafsv; 59 tree->numnodes = 0; 64 tree->numnodes += n; 69 if (tree->numnodes == 0) { 70 opj_free(tree); 111 tgt_destroy(opj_tgt_tree_t *tree) argument 116 tgt_reset(opj_tgt_tree_t *tree) argument 129 tgt_setvalue(opj_tgt_tree_t *tree, int leafno, int value) argument 138 tgt_encode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold) argument 178 tgt_decode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold) argument [all...] |
H A D | tgt.h | 36 @brief Implementation of a tag-tree coder (TGT) 38 The functions in TGT.C have for goal to realize a tag-tree coder. The functions in TGT.C 42 /** @defgroup TGT TGT - Implementation of a tag-tree coder */ 56 Tag tree 69 Create a tag-tree 70 @param numleafsh Width of the array of leafs of the tree 71 @param numleafsv Height of the array of leafs of the tree 72 @return Returns a new tag-tree if successful, returns NULL otherwise 76 Destroy a tag-tree, liberating memory 77 @param tree Ta [all...] |
/haiku-fatelf/headers/cpp/ |
H A D | map.h | 30 #include <tree.h>
|
H A D | multimap.h | 30 #include <tree.h>
|
H A D | multiset.h | 30 #include <tree.h>
|
H A D | set.h | 30 #include <tree.h>
|
/haiku-fatelf/src/bin/gawk/ |
H A D | profile.c | 2 * profile.c - gawk parse tree pretty-printer with counts 35 static void tree_eval P((NODE *tree)); 36 static void parenthesize P((NODETYPE parent_type, NODE *tree)); 37 static void eval_condition P((NODE *tree)); 38 static void pp_op_assign P((NODE *tree)); 39 static void pp_func_call P((NODE *tree)); 40 static void pp_match_op P((NODE *tree)); 42 static void pp_print_stmt P((const char *command, NODE *tree)); 43 static void pp_delete P((NODE *tree)); 45 static void pp_getline P((NODE *tree)); 159 pprint(register NODE *volatile tree) argument 433 tree_eval(register NODE *tree) argument 694 eval_condition(register NODE *tree) argument 719 pp_op_assign(register NODE *tree) argument 910 pp_match_op(register NODE *tree) argument 951 pp_redir(register NODE *tree, enum redir_placement dir) argument 1003 pp_list(register NODE *tree) argument 1021 pp_print_stmt(const char *command, register NODE *tree) argument 1049 pp_delete(register NODE *tree) argument 1089 pp_getline(register NODE *tree) argument 1124 pp_builtin(register NODE *tree) argument 1137 pp_func_call(NODE *tree) argument 1421 parenthesize(NODETYPE parent_type, NODE *tree) argument [all...] |
H A D | ext.c | 45 do_ext(NODE *tree) argument 67 obj = tree_eval(tree->lnode); 77 fun = tree_eval(tree->rnode->lnode); 87 return (*func)(tree, dl); 142 get_argument(NODE *tree, int i) argument 146 if (i < 0 || i >= tree->param_cnt) 149 tree = stack_ptr[i]; 150 if (tree->lnode == Nnull_string) 153 if (tree->type == Node_array_ref) { 154 tree 167 set_value(NODE *tree) argument 181 do_ext(NODE *tree) argument [all...] |
H A D | eval.c | 2 * eval.c - gawk parse tree interpreter 32 static int eval_condition P((NODE *tree)); 33 static NODE *op_assign P((NODE *tree)); 34 static NODE *func_call P((NODE *tree)); 35 static NODE *match_op P((NODE *tree)); 335 interpret(register NODE *volatile tree) argument 344 int volatile traverse = TRUE; /* True => loop thru tree (Node_rule_list) */ 350 if (tree == NULL) 352 sourceline = tree->source_line; 353 source = tree 798 r_tree_eval(register NODE *tree, int iscond) argument 1160 eval_condition(register NODE *tree) argument 1264 op_assign(register NODE *tree) argument 1611 func_call(NODE *tree) argument 1920 match_op(register NODE *tree) argument [all...] |
/haiku-fatelf/src/add-ons/translators/jpeg2000/libjasper/ |
H A D | jpc_tagtree.h | 135 /* The maximum allowable depth for a tag tree. */ 143 * Tag tree node. 163 * Tag tree. 174 /* The total number of nodes in the tree. */ 186 /* Create a tag tree. */ 189 /* Destroy a tag tree. */ 190 void jpc_tagtree_destroy(jpc_tagtree_t *tree); 192 /* Copy data from one tag tree to another. */ 195 /* Reset the tag tree state. */ 196 void jpc_tagtree_reset(jpc_tagtree_t *tree); [all...] |
H A D | jpc_tagtree.c | 142 /* Create a tag tree. */ 151 jpc_tagtree_t *tree; local 160 if (!(tree = jpc_tagtree_alloc())) { 163 tree->numleafsh_ = numleafsh; 164 tree->numleafsv_ = numleafsv; 173 tree->numnodes_ += n; 177 if (!(tree->nodes_ = jas_malloc(tree->numnodes_ * sizeof(jpc_tagtreenode_t)))) { 181 /* Initialize the parent links for all nodes in the tree. */ 183 node = tree 218 jpc_tagtree_destroy(jpc_tagtree_t *tree) argument 228 jpc_tagtree_t *tree; local 271 jpc_tagtree_reset(jpc_tagtree_t *tree) argument 290 jpc_tagtree_setvalue(jpc_tagtree_t *tree, jpc_tagtreenode_t *leaf, int value) argument 305 jpc_tagtree_getleaf(jpc_tagtree_t *tree, int n) argument 312 jpc_tagtree_encode(jpc_tagtree_t *tree, jpc_tagtreenode_t *leaf, int threshold, jpc_bitstream_t *out) argument 369 jpc_tagtree_decode(jpc_tagtree_t *tree, jpc_tagtreenode_t *leaf, int threshold, jpc_bitstream_t *in) argument 419 jpc_tagtree_dump(jpc_tagtree_t *tree, FILE *out) argument [all...] |
/haiku-fatelf/src/kits/network/libbind/include/isc/ |
H A D | tree.h | 0 /* tree.h - declare structures used by tree library 4 * vix 27jun86 [broken out of tree.c] 6 * $Id: tree.h,v 1.3 2005/04/27 04:56:18 sra Exp $ 47 tree; typedef in typeref:struct:tree_s 50 void tree_init __P((tree **)); 51 tree_t tree_srch __P((tree **, int (*)(), tree_t)); 52 tree_t tree_add __P((tree **, int (*)(), tree_t, void (*)())); 53 int tree_delete __P((tree **, int (*)(), tree_t, void (*)())); 54 int tree_trav __P((tree **, in [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/googlefs/ |
H A D | query.c | 20 void free_query_tree(query_exp *tree) argument 22 if (!tree) 24 if (tree->op >= B_AND) { 25 free_query_tree(tree->lv.exp); 26 free_query_tree(tree->rv.exp); 28 free(tree->lv.str); 29 free(tree->rv.str); 30 free(tree); 113 static const char *parse_qs_r(const char *query, query_exp *tree) argument 119 status_t query_parse(const char *query, query_exp **tree) argument 152 dump_query_tree(query_exp *tree, int indent) argument 173 query_exp *tree; local [all...] |
/haiku-fatelf/src/bin/findutils/find/ |
H A D | tree.c | 0 /* tree.c -- helper functions to build and evaluate the expression tree. 40 /* Return a pointer to a tree that represents the 124 at *INPUT, building the rest of the expression tree to return. 127 of the expression tree. 141 struct predicate *tree; /* The new tree we are building. */ 145 tree = head; 161 (*input)->pred_left = tree; 162 tree 140 struct predicate *tree; /* The new tree we are building. */ local 429 mark_stat(struct predicate *tree) argument 465 mark_type(struct predicate *tree) argument [all...] |
/haiku-fatelf/src/tools/docbook/libxml2/include/libxml/ |
H A D | xinclude.h | 17 #include <libxml/tree.h> 98 xmlXIncludeProcessTree (xmlNodePtr tree); 100 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, 114 xmlNodePtr tree);
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-Windows/ |
H A D | ubi_AVLtree.cpp | 12 * This file implements the core of the height-balanced (AVL) tree management
44 * included by all of the binary tree files.
48 * of tree types by simply changing a header. Unfortunately, the
50 * conflict if used together. You must either choose a single tree
81 * I have tested the fix by loading the tree with over 44 thousand names,
83 * and then walking the tree recursively to verify that the balance factor of
118 * standard API to all existing tree modules. Until now, each of the three
133 * exactly which tree model you wanted to use. If you wanted to be able to
172 * rotations and reconnect all tree pointers that might get confused by the
187 * Input: p - Pointer to the root of a tree (possibl [all...] |
/haiku-fatelf/src/kits/network/libbind/isc/ |
H A D | tree.c | 2 static const char rcsid[] = "$Id: tree.c,v 1.4 2005/04/27 04:56:39 sra Exp $"; 6 * tree - balanced binary tree library 13 * vix 02feb86 [added tree balancing from wirth "a+ds=p" p. 220-221] 42 # define DEBUG_DOMAIN "tree" 53 #include <isc/tree.h> 92 static tree * sprout(tree **, tree_t, int *, int (*)(), void (*)()); 93 static int delete(tree **, int (*)(), tree_t, void (*)(), int *, int *); 94 static void del(tree **, in [all...] |
/haiku-fatelf/src/bin/gzip/ |
H A D | trees.c | 18 * Each code tree is stored in the ZIP file in a compressed form 166 ush dad; /* father node in Huffman tree */ 179 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 180 local ct_data near dyn_dtree[2*D_CODES+1]; /* distance tree */ 183 /* The static literal tree. Since the bit lengths are imposed, there is no 185 * The codes 286 and 287 are needed to build a canonical tree (see ct_init 190 /* The static distance tree. (Actually a trivial tree since all codes use 195 /* Huffman tree for the bit lengths */ 198 ct_data near *dyn_tree; /* the dynamic tree */ 486 ct_data near *tree = desc->dyn_tree; local 612 ct_data near *tree = desc->dyn_tree; local [all...] |
/haiku-fatelf/src/bin/zip/ |
H A D | trees.c | 30 * Each code tree is stored in the ZIP file in a compressed form 44 * left-to-right output (useful for code strings from the tree routines), 219 ush dad; /* father node in Huffman tree */ 232 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 233 local ct_data near dyn_dtree[2*D_CODES+1]; /* distance tree */ 236 /* The static literal tree. Since the bit lengths are imposed, there is no 238 * The codes 286 and 287 are needed to build a canonical tree (see ct_init 243 /* The static distance tree. (Actually a trivial tree since all codes use 248 /* Huffman tree fo 633 ct_data near *tree = desc->dyn_tree; local 759 ct_data near *tree = desc->dyn_tree; local [all...] |
/haiku-fatelf/src/libs/ncurses/ncurses/tinfo/ |
H A D | add_tries.c | 36 ** Add keycode/string to tries-tree. 48 _nc_add_to_try(struct tries **tree, const char *str, unsigned short code) argument 57 if ((*tree) != 0) { 58 ptr = savedptr = (*tree); 89 } else { /* (*tree) == 0 :: First sequence to be added */ 90 savedptr = ptr = (*tree) = typeCalloc(struct tries, 1);
|
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/ |
H A D | preproc.h | 14 #include <libxml/tree.h>
|
H A D | xslt.h | 13 #include <libxml/tree.h>
|
/haiku-fatelf/src/libs/pdflib/libs/flate/ |
H A D | trees.c | 12 * Each code tree is stored in a compressed form which is itself 92 /* The static literal tree. Since the bit lengths are imposed, there is no 94 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 99 /* The static distance tree. (Actually a trivial tree since all codes use 123 const ct_data *static_tree; /* static tree or NULL */ 126 int elems; /* max number of elements in the tree */ 145 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 149 local void scan_tree OF((deflate_state *s, ct_data *tree, in 457 pqdownheap( deflate_state *s, ct_data *tree, int k) argument 496 ct_data *tree = desc->dyn_tree; local 579 gen_codes( ct_data *tree, int max_code, ushf *bl_count) argument 625 ct_data *tree = desc->dyn_tree; local 708 scan_tree( deflate_state *s, ct_data *tree, int max_code) argument 753 send_tree( deflate_state *s, ct_data *tree, int max_code) argument [all...] |