Rfc1951.Heap
type priority = int
type 'a queue =
| None
| Node of priority * 'a * 'a queue * 'a queue
val push : 'a queue -> priority -> 'b -> 'c queue
exception Empty
val remove : 'a queue -> 'b queue
val take : 'a queue -> priority * 'b * 'c queue