Efficient priority queues

Implement a generic priority queue data structure based on some mergeable heap.

It should then be trivial to make a generic FIFO queue on top of that (we could also simply use list_t).