Searched defs:heap (Results 1 - 4 of 4) sorted by relevance

/ast/src/cmd/pack/
H A Dhuffinit.c33 /* the heap */
52 Heap_t heap[END+2]; local
81 /* put occurring chars in heap with their counts */
87 heap[++n].count = count[i];
88 heap[n].node = i;
93 heapify(heap,i,n);
98 parent[heap[1].node] = ++lastnode;
99 size = heap[1].count;
100 heap[1] = heap[
129 heapify(register Heap_t *heap,register int i,register int n) argument
[all...]
/ast/src/lib/libbz/
H A Dhuffman.c77 zz = z; tmp = heap[zz]; \
78 while (weight[tmp] < weight[heap[zz >> 1]]) { \
79 heap[zz] = heap[zz >> 1]; \
82 heap[zz] = tmp; \
88 zz = z; tmp = heap[zz]; \
93 weight[heap[yy+1]] < weight[heap[yy]]) \
95 if (weight[tmp] < weight[heap[yy]]) break; \
96 heap[z
116 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...]
/ast/src/lib/libz/
H A Ddeflate.h46 /* maximum heap size */
203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
204 int heap_len; /* number of elements in the heap */
206 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
207 * The same heap array is used to build all trees.
/ast/src/cmd/INIT/
H A Dratz.c1256 /* maximum heap size */
1413 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member in struct:internal_state
1414 int heap_len; /* number of elements in the heap */
1416 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
1417 * The same heap array is used to build all trees.

Completed in 4347 milliseconds