Pqueue.MakeMinPoly(3) OCaml library Pqueue.MakeMinPoly(3)

# [NAME](#NAME)

Pqueue.MakeMinPoly - Functor building an implementation of min-priority queues given a totally ordered type for the elements.

# [Module](#Module)

Module Pqueue.MakeMinPoly

# [Documentation](#Documentation)

Module **MakeMinPoly**  
: **(E : OrderedPolyType) -> sig end**

Functor building an implementation of min-priority queues given a totally ordered type for the elements.

**Parameters:**

"E"

**Pqueue.OrderedPolyType**

*type* **'a** *t*

*type* **'a** *elt*

*val create* : **unit -> 'a t**

*val length* : **'a t -> int**

*val is\_empty* : **'a t -> bool**

*val add* : **'a t -> 'a elt -> unit**

*val add\_iter* : **'a t ->** **(('a elt -> unit) -> 'x -> unit) -> 'x -> unit**

*val min\_elt* : **'a t -> 'a elt option**

*val get\_min\_elt* : **'a t -> 'a elt**

*val pop\_min* : **'a t -> 'a elt option**

*val remove\_min* : **'a t -> unit**

*val clear* : **'a t -> unit**

*val copy* : **'a t -> 'a t**

*val of\_array* : **'a elt array -> 'a t**

*val of\_list* : **'a elt list -> 'a t**

*val of\_iter* : **(('a elt -> unit) -> 'x -> unit) -> 'x -> 'a t**

*val iter\_unordered* : **('a elt -> unit) -> 'a t -> unit**

*val fold\_unordered* : **('acc -> 'a elt -> 'acc) ->** **'acc -> 'a t -> 'acc**

2026-10-01 OCamldoc

---

Document: Pqueue.MakeMinPoly(3o) from ocaml 5.5.1-r1 (Chainguard OS)
Source: https://github.com/ocaml/ocaml