Module Pqueue.MakeMax

Functor building an implementation of the max-priority queue structure given a totally ordered type for elements.

Parameters

module E : OrderedType

module E: OrderedType

Signature

type t

type t;

val create : unit -> t

let create: unit => t;

val length : t -> int

let length: t => int;

val is_empty : t -> bool

let is_empty: t => bool;

val add : t -> E.t -> unit

let add: t => E.t => unit;

val add_iter : t -> ((E.t -> unit) -> 'x -> unit) -> 'x -> unit

let add_iter: t => ((E.t => unit) => 'x => unit) => 'x => unit;

val max_elt : t -> E.t option

let max_elt: t => option(E.t);

val get_max_elt : t -> E.t

let get_max_elt: t => E.t;

val pop_max : t -> E.t option

let pop_max: t => option(E.t);

val remove_max : t -> unit

let remove_max: t => unit;

val clear : t -> unit

let clear: t => unit;

val copy : t -> t

let copy: t => t;

val of_array : E.t array -> t

let of_array: array(E.t) => t;

val of_list : E.t list -> t

let of_list: list(E.t) => t;

val of_iter : ((E.t -> unit) -> 'x -> unit) -> 'x -> t

let of_iter: ((E.t => unit) => 'x => unit) => 'x => t;

val iter_unordered : (E.t -> unit) -> t -> unit

let iter_unordered: (E.t => unit) => t => unit;

val fold_unordered : ('acc -> E.t -> 'acc) -> 'acc -> t -> 'acc

let fold_unordered: ('acc => E.t => 'acc) => 'acc => t => 'acc;