Searched refs:priority_queue (Results 1 – 1 of 1) sorted by relevance
252 struct heap *priority_queue; /* Priority queue of merge tree nodes. */ member3453 heap_free (queue->priority_queue); in queue_destroy()3467 queue->priority_queue = heap_alloc (compare_nodes, 2 * nthreads); in queue_init()3479 heap_insert (queue->priority_queue, node); in queue_insert()3492 while (! (node = heap_remove_top (queue->priority_queue))) in queue_pop()