Searched refs:heap_max (Results 1 – 16 of 16) sorted by relevance
508 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */510 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {630 s->heap_len = 0, s->heap_max = HEAP_SIZE;668 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */669 s->heap[--(s->heap_max)] = m;688 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
211 int heap_max; /* element of largest frequency */ member
516 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {638 s->heap_len = 0, s->heap_max = HEAP_SIZE;676 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */677 s->heap[--(s->heap_max)] = m;696 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
205 int heap_max; /* element of largest frequency */ member
756 IN assertion: the fields freq and dad are set, heap[heap_max] and