HomeSort by relevance Sort by last modified time
    Searched defs:SMALLEST (Results 1 - 2 of 2) sorted by null

  /external/chromium_org/third_party/zlib/
trees.c 430 #define SMALLEST 1
435 * Remove the smallest element from the heap and recreate the heap with
440 top = s->heap[SMALLEST]; \
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
442 pqdownheap(s, tree, SMALLEST); \
455 * exchanging a node with the smallest of its two sons if necessary, stopping
467 /* Set j to the smallest of the two sons: */
475 /* Exchange v with the smallest son */
635 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
674 m = s->heap[SMALLEST]; /* m = node of next least frequency *
    [all...]
  /external/chromium_org/third_party/libaddressinput/src/java/
android.jar 

Completed in 81 milliseconds