heap_t 230 lib/q.c void heap_init(heap_t*h,int elem_size, int(*compare)(const void *, const void *)) heap_t 232 lib/q.c memset(h, 0, sizeof(heap_t)); heap_t 239 lib/q.c heap_t* heap_new(int elem_size, int(*compare)(const void *, const void *)) heap_t 241 lib/q.c heap_t*h = malloc(sizeof(heap_t)); heap_t 245 lib/q.c heap_t* heap_clone(heap_t*o) heap_t 247 lib/q.c heap_t*h = malloc(sizeof(heap_t)); heap_t 248 lib/q.c memcpy(h, o, sizeof(heap_t)); heap_t 257 lib/q.c void heap_clear(heap_t*h) heap_t 266 lib/q.c void heap_destroy(heap_t*h) heap_t 275 lib/q.c static void up(heap_t*h, int node) heap_t 288 lib/q.c static void down(heap_t*h, int node) heap_t 307 lib/q.c void heap_put(heap_t*h, void*e) heap_t 322 lib/q.c int heap_size(heap_t*h) heap_t 326 lib/q.c void* heap_peek(heap_t*h) heap_t 332 lib/q.c void* heap_chopmax(heap_t*h) heap_t 341 lib/q.c void heap_dump(heap_t*h, FILE*fi) heap_t 352 lib/q.c void** heap_flatten(heap_t*h) heap_t 238 lib/q.h void heap_init(heap_t*h,int elem_size, int(*compare)(const void *, const void *)); heap_t 239 lib/q.h heap_t* heap_new(int elem_size, int(*compare)(const void *, const void *)); heap_t 240 lib/q.h heap_t* heap_clone(heap_t*o); heap_t 241 lib/q.h void heap_clear(heap_t*h); heap_t 242 lib/q.h void heap_destroy(heap_t*h); heap_t 243 lib/q.h void heap_put(heap_t*h, void*e); heap_t 244 lib/q.h int heap_size(heap_t*h); heap_t 245 lib/q.h void* heap_peek(heap_t*h); heap_t 246 lib/q.h void* heap_chopmax(heap_t*h); heap_t 247 lib/q.h void heap_dump(heap_t*h, FILE*fi); heap_t 248 lib/q.h void** heap_flatten(heap_t*h);