Home | History | Annotate | Download | only in net

Lines Matching defs:SMALLEST

2522 #define SMALLEST 1
2527  * Remove the smallest element from the heap and recreate the heap with
2532     top = s->heap[SMALLEST]; \
2533     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2534     pqdownheap(s, tree, SMALLEST); \
2547  * exchanging a node with the smallest of its two sons if necessary, stopping
2558         /* Set j to the smallest of the two sons: */
2566         /* Exchange v with the smallest son */
2723      * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
2762         m = s->heap[SMALLEST]; /* m = node of next least frequency */
2778         s->heap[SMALLEST] = node++;
2779         pqdownheap(s, tree, SMALLEST);
2783     s->heap[--(s->heap_max)] = s->heap[SMALLEST];