Searched refs:heap_max (Results 1 – 5 of 5) 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];
209 int heap_max; /* element of largest frequency */ member
326 int heap_max; /* element of largest frequency */ member1870 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */1872 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {1992 s->heap_len = 0, s->heap_max = HEAP_SIZE;2030 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */2031 s->heap[--(s->heap_max)] = m;2049 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
486 int heap_max; /* element of largest frequency */ member2678 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */2680 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {2817 s->heap_len = 0, s->heap_max = HEAP_SIZE;2860 s->heap[--(s->heap_max)] = n;2861 s->heap[--(s->heap_max)] = m;2880 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
1415 int heap_max; /* element of largest frequency */ member