MoreLabels.Set(3)

💅 MoreLabels.Set 💅

okay bestie, so the manual name is OCaml library and we are literally about to get into it. no cap.

NAME

MoreLabels.Set — no description (and honestly? iconic mystery vibe, we love a minimal queen 🎀)

Module

Module MoreLabels.Set

Documentation

Module Set : sig end

Sets over ordered types. slay.

This module implements the set data structure, given a total ordering function over the set elements. and when I say all operations over sets are purely applicative (no side-effects), I mean it — no sneaky mutations, no funny business, just immaculate functional energy ✨. The implementation uses balanced binary trees, and is therefore reasonably efficient: insertion and membership take time logarithmic in the size of the set, for instance. lowkey obsessed with that efficiency, ngl 🌸.

The MoreLabels.Set.Make functor constructs implementations for any type, given a compare function. For instance:

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 PairsSet = Set.Make(IntPairs)

let m = PairsSet.(empty |> add (2,3) |> add (5,7) |> add (11,13))

This creates a new module PairsSet , with a new type PairsSet.t of sets of int * int . fr fr, it's giving main character module energy 💖

module type OrderedType = sig end

Input signature of the functor MoreLabels.Set.Make . this is the vibe check you gotta pass, bestie 👑

module type S = sig end

Output signature of the functor MoreLabels.Set.Make . this is what you get back and it ate 🔥

module Make : (Ord : OrderedType) -> sig end

Functor building an implementation of the set structure given a totally ordered type. so you bring the ordering, it brings the balanced trees, and together we slay 💅🌟

---

mwah 💋 this manual page was brought to you by OCamldoc on 2026-06-22, and yes she's still serving MoreLabels.Set(3) realness to this very day. periodt 🫶💜