Type of elements

Heap of elt, whose priority is increased or decreased incrementally (see decrease for instance)

Create a heap

decrease h x decreases the value associated to x within h

increase h x increases the value associated to x within h

Number of integers within the heap

Clear the content of the heap

Insert a new element into the heap

Remove and return the integer that has the lowest value from the heap

• raises Not_found

  if the heap is empty

Filter out values that don't satisfy the predicate