HomeSort by: relevance | last modified time | path
    Searched defs:SMALLEST (Results 1 - 2 of 2) sorted by relevancy

  /src/common/dist/zlib/
trees.c 480 #define SMALLEST 1
485 * Remove the smallest element from the heap and recreate the heap with
490 top = s->heap[SMALLEST]; \
491 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
492 pqdownheap(s, tree, SMALLEST); \
505 * exchanging a node with the smallest of its two sons if necessary, stopping
513 /* Set j to the smallest of the two sons: */
521 /* Exchange v with the smallest son */
636 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n + 1].
675 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /src/sys/net/
zlib.c 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 *
    [all...]

Completed in 16 milliseconds