Heap.MakeOrdered
module V : OrderedTypeDefault
type elt = V.t
The type of elements of the heap.
type t
The type of heaps.
val create : int -> t
Create a heap with the given initial size.
val is_empty : t -> bool
Is the heap empty ?
val insert : t -> elt -> unit
Insert a new element in the heap.
val pop_min : t -> elt
Remove the minimum element from the heap and return it.
Not_found
if the heap is empty.