Searched refs:SMALLEST (Results 1 – 3 of 3) sorted by relevance
424 #define SMALLEST 1 macro434 top = s->heap[SMALLEST]; \435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \436 pqdownheap(s, tree, SMALLEST); \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];
424 #define SMALLEST 1 macro434 top = s->heap[SMALLEST]; \435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \436 pqdownheap(s, tree, SMALLEST); \668 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()685 s->heap[SMALLEST] = node++; in build_tree()686 pqdownheap(s, tree, SMALLEST); in build_tree()690 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/ ...