MoreLabels.Map(3)

🌸 NAME 🌸

MoreLabels.Map — no description. And yes bestie, this whole page is MoreLabels.Map(3), the manual page for the MoreLabels.Map module. Not a single description in sight, and honestly? Iconic.

---

🎀 MODULE 🎀

Module MoreLabels.Map

---

💅 DOCUMENTATION 💅

🦋 Module Map : sig end 🦋

Okay so this is all about association tables over ordered types. This module implements applicative association tables — also known as finite maps or dictionaries — given a total ordering function over the keys. All operations over maps are purely applicative (no side-effects) — zero drama, zero mutation. The implementation uses balanced binary trees, and therefore searching and insertion take time logarithmic in the size of the map. Slay.

For instance, check this out:

module IntPairs =
  struct
    type t = int * int
    let compare (x0,y0) (x1,y1) =
      match Stdlib.compare x0 x1 with
          0 -> Stdlib.compare y0 y1
        | c -> c
  end

module PairsMap = Map.Make(IntPairs)

let m = PairsMap.(empty |> add (0,1) "hello" |> add (1,0) "world")

So this creates a new module PairsMap, with a new type 'a PairsMap.t of maps from int * int to 'a. In this example, m contains string values so its type is string PairsMap.t. Bestie, that type check is chef’s kiss 💋👑

• module type OrderedType = sig end — Input signature of the functor MoreLabels.Map.Make. 💖
• module type S = sig end — Output signature of the functor MoreLabels.Map.Make. ✨
• module Make : (Ord : OrderedType) -> sig end — Functor building an implementation of the map structure given a totally ordered type. 👑

---

xoxo, your OCaml bestie 💖 — this page is from OCamldoc, dated 2026-06-22. periodt.