Pqueue.MakeMinPoly(3)

💖 Pqueue.MakeMinPoly(3) 💖

okay so this is the OCaml library page for Pqueue.MakeMinPoly(3), and it's giving “tiny module page, big functor energy.” No cap, we're keeping every signature and every detail, just with better vibes. 💅

---

🌸 NAME 🌸

Pqueue.MakeMinPoly — bestie, it's a functor building an implementation of min-priority queues given a totally ordered type for the elements. That's the whole name-section tea. periodt. ✨

🦋 Module 🦋

Module Pqueue.MakeMinPoly

that's the module path, iconic and exact. 🫶

🎀 Documentation 🎀

okay so the module shape is literally:

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

Functor building an implementation of min-priority queues given a totally ordered type for the elements. (Yes, same energy as NAME, because that's what the page says. 💖)

Parameters:

• "E" — Pqueue.OrderedPolyType

Types:

• type 'a t
• type 'a elt

Vals:

these signatures are sacred, so here they are exactly — no renaming, no merging, no invented behavior, just the full roster. slay. 👑

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

---

kisses and OCamldoc sparkles 💖 — this was the Pqueue.MakeMinPoly(3) page, dated 2026-06-22, with the footer mentioned right here instead of copied: source/version OCamldoc, date 2026-06-22, page Pqueue.MakeMinPoly(3). bye bestie! 💅✨