Searched refs:heap_max (Results 1 – 4 of 4) sorted by relevance
512 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */514 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {634 s->heap_len = 0, s->heap_max = HEAP_SIZE;672 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */673 s->heap[--(s->heap_max)] = m;692 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
205 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];
488 int heap_max; /* element of largest frequency */ member2680 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */2682 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {2819 s->heap_len = 0, s->heap_max = HEAP_SIZE;2862 s->heap[--(s->heap_max)] = n;2863 s->heap[--(s->heap_max)] = m;2882 s->heap[--(s->heap_max)] = s->heap[SMALLEST];