BatHeap (u.c54fcfcc5a7ff0c09beed4cdb8d1b2da.batteries.3.9.0.doc.batteries.unthreaded.BatHeap)

Sourcetype +'a t

Heap of elements that are compared with Pervasives.compare.

Sourceval size : 'a t -> int

Number of elements in the heap. O(1)

Construction

Sourceval empty : 'a t

The empty heap.

Sourceval insert : 'a t -> 'a -> 'a t

Insert an element into the heap. Duplicates are kept. O(log m)

Sourceval add : 'a -> 'a t -> 'a t

add x h is the same as insert h x. This function is intended to be used with fold_right.

Sourceval merge : 'a t -> 'a t -> 'a t

Merge two heaps. O(log m)

Sourceval find_min : 'a t -> 'a

Find the minimal element of the heap. O(1)

Sourceval del_min : 'a t -> 'a t

Delete the minimal element of the heap. O(log n)

Sourceval of_list : 'a list -> 'a t

Build a heap from a given list. O(n log n)

Sourceval to_list : 'a t -> 'a list

Enumerate the elements of the heap. O(n log n)

Sourceval elems : 'a t -> 'a list

Sourceval of_enum : 'a BatEnum.t -> 'a t

Build a heap from an enumeration. Consumes the enumeration. O(n log n)

Sourceval enum : 'a t -> 'a BatEnum.t

Enumerate the elements of the heap in heap order. O(log n) per BatEnum.get.

val print : 
  ?first:string ->
  ?last:string ->
  ?sep:string ->
  ('a, 'b) BatIO.printer ->
  ('a t, 'b) BatIO.printer

Print the contents of the heap in heap order. O(n log n)

Sourcemodule type H = sig ... end

The result of Make

Sourcemodule Make (Ord : BatInterfaces.OrderedType) : H with type elem = Ord.t

Functorized heaps over arbitrary orderings. All the functions have the same complexity as the non-functorized versions.