Lines Matching defs:tree
33 /* node in a kind-of-flattened Huffman tree */
70 Vchtree_t *tree, **sort;
73 if(!(tree = (Vchtree_t*)malloc(nsym*sizeof(Vchtree_t))) ||
80 for(k = 0, f = tree; k < nsym; ++k, ++f, ++c)
99 *runb = (int)(sort[0]-tree);
100 free(tree);
117 /* linear-time construction of a Huffman tree */
129 size[s-tree] -= size[f-tree];
132 /* tree depth for subtree represented by f increases by 1 */
133 size[f-tree] += 1;
171 break; /* tree completed */
183 { if((size[s-tree] += size[s->next-tree]) > c)
184 c = size[s-tree];
185 /**/DEBUG_ASSERT(size[s-tree] > 0 && size[s-tree] <= 32);
188 free(tree);