Camlinternal...InfiniteArray(3)

💖 Camlinternal...InfiniteArray(3) 💖

okay so bestie, this page is from the OCaml library manual — manual name: OCaml library — and it’s all about CamlinternalMenhirLib.InfiniteArray. It’s giving “internal module but make it infinite” energy, and we’re gonna read every single line together 🫶✨

---

✨ NAME ✨

CamlinternalMenhirLib.InfiniteArray — no description. That’s it. The NAME section said “no description” and honestly? Minimalist icon behavior 💅

---

🌸 Module 🌸

Module CamlinternalMenhirLib.InfiniteArray — that’s the module path, exact, no cap. 🎀

---

📚 Documentation 📚

Module InfiniteArray
 : sig end

This module implements infinite arrays. * — yes, the manual has a little * at the end; I’m keeping it because details are the moment. 💖

• type 'a t — the type is literally 'a t. Cute. Iconic. Infinite-array-coded. ✨
• val make : 'a -> 'a t — make x creates an infinite array, where every slot contains x. * Obsessed: every slot. Not some slots. Every single one. 🌈
• val get : 'a t -> int -> 'a — get a i returns the element contained at offset i in the array a. Slots are numbered 0 and up. * Zero-indexed besties, we love to see it. 👑
• val set : 'a t -> int -> 'a -> unit — set a i x sets the element contained at offset i in the array a to x. Slots are numbered 0 and up. * Same numbering, same energy. 🦋
• val extent : 'a t -> int — extent a is the length of an initial segment of the array a that is sufficiently large to contain all set operations ever performed. In other words, all elements beyond that segment have the default value. * Highkey important: “ever performed” is doing a lot of work there. 💀
• val domain : 'a t -> 'a array — domain a is a fresh copy of an initial segment of the array a whose length is extent a. * Fresh copy, fresh vibes. 🍓

---

That’s the whole page, bestie. Footer sign-off: OCamldoc — 2026-06-22. Bye, love u, read ur manual pages 💅✨🫶