Identifiable.Map.T(3)

okay so bestie, this is Identifiable.Map.T(3) from the OCaml library manual β€” yes, the OCaml library manual, and this page is short but very real. πŸ’…βœ¨

πŸ’– NAME πŸ’–

  • Identifiable.Map.T β€” no description. (Yes bestie, the page literally says β€œno description” πŸ˜­πŸ’€)

πŸ¦‹ Module πŸ¦‹

The module is Identifiable.Map.T. That’s the whole vibe check here, periodt. πŸ‘‘

🌸 Documentation 🌸

🫢 Module T 🫢

Module T : Map.OrderedType

πŸŽ€ type t πŸŽ€

type t

The type of the map keys. Lowkey simple, highkey important β€” t is the key type. πŸ‘‘

πŸ’… val compare πŸ’…

val compare : t -> t -> int

compare is a total ordering function over the keys. It’s a two-argument function f such that:

  • f e1 e2 is zero if the keys e1 and e2 are equal,
  • f e1 e2 is strictly negative if e1 is smaller than e2,
  • f e1 e2 is strictly positive if e1 is greater than e2.

Example: a suitable ordering function is the generic structural comparison function compare. That’s the example, bestie β€” not me making stuff up. ✨


Okay that’s the whole page. It was a tiny one, but we ate. This manual came from OCamldoc and is dated 2026-06-22 β€” source/version and date, slay, bye! πŸ’–πŸŽ€

πŸ“¦ where this page comes from