Lines Matching defs:SMALLEST
424 #define SMALLEST 1
429 * Remove the smallest element from the heap and recreate the heap with
434 top = s->heap[SMALLEST]; \
435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
436 pqdownheap(s, tree, SMALLEST); \
449 * exchanging a node with the smallest of its two sons if necessary, stopping
461 /* Set j to the smallest of the two sons: */
469 /* Exchange v with the smallest son */
629 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
668 m = s->heap[SMALLEST]; /* m = node of next least frequency */
685 s->heap[SMALLEST] = node++;
686 pqdownheap(s, tree, SMALLEST);
690 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
