@promptctl/rich-js 0.7.0 → 0.9.0

package/dist/core/oklch.js

@@ -67,11 +67,26 @@ function clamp01(v) {
 // Small tolerance so float-fuzz at the gamut edge doesn't trigger needless
 // chroma reduction on colors that are already representable.
 const GAMUT_EPS = 1e-4;
-// [LAW:one-source-of-truth] Below this chroma a color is treated as
-// achromatic, and hue is pinned to 0 so round-trips stay stable. Used
-// by `fromRgba` (after polar conversion) and `applyKey` (after chroma
-// scaling collapses C toward 0). Same threshold both places.
+// [LAW:one-source-of-truth] Below this chroma a color is achromatic and its
+// hue is pinned to 0 so round-trips stay stable — the one threshold every
+// chroma reader here shares.
 const ACHROMATIC_EPS = 1e-7;
+// The one spelling of that pin: every producer of an `Oklch` (`fromRgba`,
+// `applyKey`, `mix`) passes its result's chroma and hue through here, so a
+// gray from any of them carries the same hue. The constructor does not —
+// it passes intermediates through by contract. [LAW:single-enforcer]
+const hueOf = (c, h) => (c < ACHROMATIC_EPS ? 0 : h);
+// Endpoint-exact: `t = 0` returns `a` and `t = 1` returns `b` bit-for-bit,
+// which `a + (b - a) * t` does not (the subtraction rounds). One shape for
+// every axis `mix` interpolates. [LAW:one-source-of-truth]
+const lerp = (a, b, t) => a * (1 - t) + b * t;
+// Hue into [0, 360). Exact on a hue already there (fmod is exact), and exact
+// on `x - 360` for a representable x (the sum is x itself), which is what
+// `mix` relies on. One spelling for every producer. [LAW:one-source-of-truth]
+const wrapHue = (h) => {
+    const w = h % 360;
+    return w < 0 ? w + 360 : w;
+};
 function inGamut(r, g, b) {
     return (r >= -GAMUT_EPS && r <= 1 + GAMUT_EPS &&
         g >= -GAMUT_EPS && g <= 1 + GAMUT_EPS &&
@@ -128,12 +143,8 @@ export class Oklch {
         const aLab = 1.9779984951 * lCube - 2.4285922050 * mCube + 0.4505937099 * sCube;
         const bLab = 0.0259040371 * lCube + 0.7827717662 * mCube - 0.8086757660 * sCube;
         const C = Math.sqrt(aLab * aLab + bLab * bLab);
-        let H = Math.atan2(bLab, aLab) * (180 / Math.PI);
-        if (H < 0)
-            H += 360;
-        if (C < ACHROMATIC_EPS)
-            H = 0;
-        return new Oklch(L, C, H, a);
+        const H = wrapHue(Math.atan2(bLab, aLab) * (180 / Math.PI));
+        return new Oklch(L, C, hueOf(C, H), a);
     }
     /**
      * Polar → OKLab → linear → sRGB (with chroma-bisection gamut clamping).
@@ -169,14 +180,47 @@ export class Oklch {
             return this;
         const newL = clamp01(this.l * k.lightnessScale + k.lightnessShift);
         const newC = Math.max(0, this.c * k.chromaScale);
-        let newH = (this.h + k.hueShift) % 360;
-        if (newH < 0)
-            newH += 360;
-        // Same achromatic convention as fromRgba: collapsed chroma → pinned hue,
-        // so applyKey({chromaScale:0}).toRgba() → fromRgba round-trips stably.
-        if (newC < ACHROMATIC_EPS)
-            newH = 0;
-        return new Oklch(newL, newC, newH, this.alpha);
+        const newH = wrapHue(this.h + k.hueShift);
+        return new Oklch(newL, newC, hueOf(newC, newH), this.alpha);
+    }
+    /**
+     * The color `t` of the way from this one toward `toward`, in OKLCH.
+     * `t = 0` is this color, `t = 1` is `toward`; pure.
+     *
+     * Lightness, chroma and alpha interpolate linearly. Hue takes the shorter
+     * arc around the wheel, so blue → red passes through magenta rather than
+     * sweeping across green. An achromatic endpoint has no hue of its own —
+     * `fromRgba` pins it to 0, which is red — so it adopts the other
+     * endpoint's hue (CSS Color 4's "powerless" rule): gray → red stays a red
+     * that gains chroma, instead of rotating through the wheel from 0°.
+     *
+     * `t` must lie in [0, 1]: this is interpolation, not extrapolation, and a
+     * `t` outside it (NaN included) is a RangeError, never a colour off the
+     * far end of the segment. [LAW:no-silent-failure]
+     *
+     * [LAW:one-source-of-truth] Achromatic means the same `ACHROMATIC_EPS`
+     * that `fromRgba` and `applyKey` pin hue by, so a gray produced by either
+     * is a gray here — and the result's hue goes through the same `hueOf`, so
+     * a gray produced HERE (t = 0 from a gray, t = 1 toward one) is a gray
+     * there too.
+     */
+    mix(toward, t) {
+        if (!(t >= 0 && t <= 1)) {
+            throw new RangeError(`Oklch.mix: t must be in [0, 1]; got ${t}`);
+        }
+        const thisHasHue = this.c >= ACHROMATIC_EPS;
+        const towardHasHue = toward.c >= ACHROMATIC_EPS;
+        const fromH = wrapHue(thisHasHue ? this.h : towardHasHue ? toward.h : 0);
+        const toH = wrapHue(towardHasHue ? toward.h : fromH);
+        // Shorter arc: endpoints more than half a turn apart lerp across 0°, the
+        // larger one taken a turn down. `x - 360` for x ≥ 180 is exact
+        // (Sterbenz), so the endpoints survive the shift and the wrap bit-for-bit
+        // — an addition of 360 would not.
+        const arc = toH - fromH;
+        const fromU = arc < -180 ? fromH - 360 : fromH;
+        const toU = arc > 180 ? toH - 360 : toH;
+        const c = lerp(this.c, toward.c, t);
+        return new Oklch(lerp(this.l, toward.l, t), c, hueOf(c, wrapHue(lerp(fromU, toU, t))), lerp(this.alpha, toward.alpha, t));
     }
     /** Linear-sRGB coordinates for an explicit (l, C, h). Pure; `toRgba` passes
      * already-normalized values so this never sees out-of-range inputs. */

package/dist/core/oklch.js.map

@@ -1 +1 @@
-{"version":3,"file":"oklch.js","sourceRoot":"","sources":["../../src/core/oklch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AA2BvC,MAAM,CAAC,MAAM,QAAQ,GAAa,MAAM,CAAC,MAAM,CAAC;IAC9C,QAAQ,EAAE,CAAC;IACX,WAAW,EAAE,CAAC;IACd,cAAc,EAAE,CAAC;IACjB,cAAc,EAAE,CAAC;CAClB,CAAC,CAAC;AAEH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAa,MAAM,CAAC,MAAM,CAAC;IACtD,QAAQ,EAAE,CAAC;IACX,WAAW,EAAE,CAAC;IACd,cAAc,EAAE,CAAC,CAAC;IAClB,cAAc,EAAE,CAAC;CAClB,CAAC,CAAC;AAEH;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,CAAW;IACvC,OAAO,CACL,CAAC,CAAC,QAAQ,GAAG,GAAG,KAAK,CAAC,IAAI,4CAA4C;QACtE,CAAC,CAAC,WAAW,KAAK,CAAC;QACnB,CAAC,CAAC,cAAc,KAAK,CAAC;QACtB,CAAC,CAAC,cAAc,KAAK,CAAC,CACvB,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,qCAAqC;AACrC,8EAA8E;AAE9E,SAAS,YAAY,CAAC,CAAS;IAC7B,OAAO,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,YAAY,CAAC,CAAS;IAC7B,OAAO,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;AAC3E,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,2EAA2E;AAC3E,6DAA6D;AAC7D,MAAM,SAAS,GAAG,IAAI,CAAC;AAEvB,oEAAoE;AACpE,sEAAsE;AACtE,sEAAsE;AACtE,6DAA6D;AAC7D,MAAM,cAAc,GAAG,IAAI,CAAC;AAE5B,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC9C,OAAO,CACL,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS;QACrC,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS;QACrC,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CACtC,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,0BAA0B;AAC1B,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,KAAK;IAEL;IACA;IACA;IACA;IAJX,YACW,CAAS,EACT,CAAS,EACT,CAAS,EACT,QAAgB,CAAC;QAHjB,MAAC,GAAD,CAAC,CAAQ;QACT,MAAC,GAAD,CAAC,CAAQ;QACT,MAAC,GAAD,CAAC,CAAQ;QACT,UAAK,GAAL,KAAK,CAAY;QAE1B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACtD,MAAM,IAAI,UAAU,CAAC,qDAAqD,KAAK,EAAE,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;IAED,oFAAoF;IACpF,MAAM,CAAC,QAAQ,CAAC,KAAgB;QAC9B,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC;QACtC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAE3B,MAAM,KAAK,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,CAAC;QAExE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE/B,MAAM,CAAC,GAAI,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,CAAC;QAC9E,MAAM,IAAI,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,CAAC;QAChF,MAAM,IAAI,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,CAAC;QAEhF,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,IAAI,GAAG,CAAC;QACpB,IAAI,CAAC,GAAG,cAAc;YAAE,CAAC,GAAG,CAAC,CAAC;QAE9B,OAAO,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;OAMG;IACH,MAAM;QACJ,0EAA0E;QAC1E,2EAA2E;QAC3E,2EAA2E;QAC3E,2EAA2E;QAC3E,qDAAqD;QACrD,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACtD,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACtD,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACtD,OAAO,IAAI,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,CAAW;QAClB,IAAI,aAAa,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QACjD,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;QACvC,IAAI,IAAI,GAAG,CAAC;YAAE,IAAI,IAAI,GAAG,CAAC;QAC1B,yEAAyE;QACzE,uEAAuE;QACvE,IAAI,IAAI,GAAG,cAAc;YAAE,IAAI,GAAG,CAAC,CAAC;QACpC,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IAED;2EACuE;IAC/D,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACjD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEhC,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,GAAG,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC;QAC5D,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,GAAG,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC;QAC5D,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,GAAG,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC;QAE5D,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;QAEpC,OAAO;YACL,CAAC,EAAE,CAAC,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK;YACtE,CAAC,EAAE,CAAC,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK;YACtE,CAAC,EAAE,CAAC,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK;SACvE,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QACpD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC1C,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAAE,EAAE,GAAG,GAAG,CAAC;;gBAC5C,EAAE,GAAG,GAAG,CAAC;QAChB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;CACF"}
+{"version":3,"file":"oklch.js","sourceRoot":"","sources":["../../src/core/oklch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AA2BvC,MAAM,CAAC,MAAM,QAAQ,GAAa,MAAM,CAAC,MAAM,CAAC;IAC9C,QAAQ,EAAE,CAAC;IACX,WAAW,EAAE,CAAC;IACd,cAAc,EAAE,CAAC;IACjB,cAAc,EAAE,CAAC;CAClB,CAAC,CAAC;AAEH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAa,MAAM,CAAC,MAAM,CAAC;IACtD,QAAQ,EAAE,CAAC;IACX,WAAW,EAAE,CAAC;IACd,cAAc,EAAE,CAAC,CAAC;IAClB,cAAc,EAAE,CAAC;CAClB,CAAC,CAAC;AAEH;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,CAAW;IACvC,OAAO,CACL,CAAC,CAAC,QAAQ,GAAG,GAAG,KAAK,CAAC,IAAI,4CAA4C;QACtE,CAAC,CAAC,WAAW,KAAK,CAAC;QACnB,CAAC,CAAC,cAAc,KAAK,CAAC;QACtB,CAAC,CAAC,cAAc,KAAK,CAAC,CACvB,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,qCAAqC;AACrC,8EAA8E;AAE9E,SAAS,YAAY,CAAC,CAAS;IAC7B,OAAO,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,YAAY,CAAC,CAAS;IAC7B,OAAO,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;AAC3E,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,2EAA2E;AAC3E,6DAA6D;AAC7D,MAAM,SAAS,GAAG,IAAI,CAAC;AAEvB,4EAA4E;AAC5E,0EAA0E;AAC1E,6BAA6B;AAC7B,MAAM,cAAc,GAAG,IAAI,CAAC;AAE5B,0EAA0E;AAC1E,2EAA2E;AAC3E,yEAAyE;AACzE,qEAAqE;AACrE,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE7E,2EAA2E;AAC3E,2EAA2E;AAC3E,2DAA2D;AAC3D,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAE9E,6EAA6E;AAC7E,0EAA0E;AAC1E,8EAA8E;AAC9E,MAAM,OAAO,GAAG,CAAC,CAAS,EAAU,EAAE;IACpC,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IAClB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7B,CAAC,CAAC;AAEF,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC9C,OAAO,CACL,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS;QACrC,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS;QACrC,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CACtC,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,0BAA0B;AAC1B,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,KAAK;IAEL;IACA;IACA;IACA;IAJX,YACW,CAAS,EACT,CAAS,EACT,CAAS,EACT,QAAgB,CAAC;QAHjB,MAAC,GAAD,CAAC,CAAQ;QACT,MAAC,GAAD,CAAC,CAAQ;QACT,MAAC,GAAD,CAAC,CAAQ;QACT,UAAK,GAAL,KAAK,CAAY;QAE1B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACtD,MAAM,IAAI,UAAU,CAAC,qDAAqD,KAAK,EAAE,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;IAED,oFAAoF;IACpF,MAAM,CAAC,QAAQ,CAAC,KAAgB;QAC9B,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC;QACtC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAE3B,MAAM,KAAK,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,YAAY,GAAG,EAAE,CAAC;QAExE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE/B,MAAM,CAAC,GAAI,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,CAAC;QAC9E,MAAM,IAAI,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,CAAC;QAChF,MAAM,IAAI,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,CAAC;QAEhF,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAE5D,OAAO,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;OAMG;IACH,MAAM;QACJ,0EAA0E;QAC1E,2EAA2E;QAC3E,2EAA2E;QAC3E,2EAA2E;QAC3E,qDAAqD;QACrD,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACtD,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACtD,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACtD,OAAO,IAAI,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,CAAW;QAClB,IAAI,aAAa,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC1C,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9D,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,GAAG,CAAC,MAAa,EAAE,CAAS;QAC1B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,UAAU,CAAC,uCAAuC,CAAC,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,IAAI,cAAc,CAAC;QAC5C,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,IAAI,cAAc,CAAC;QAChD,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACrD,yEAAyE;QACzE,+DAA+D;QAC/D,0EAA0E;QAC1E,kCAAkC;QAClC,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAC;QACxB,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/C,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACxC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,OAAO,IAAI,KAAK,CACd,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EACzB,CAAC,EACD,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EACtC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAClC,CAAC;IACJ,CAAC;IAED;2EACuE;IAC/D,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACjD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEhC,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,GAAG,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC;QAC5D,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,GAAG,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC;QAC5D,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,GAAG,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC;QAE5D,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;QAEpC,OAAO;YACL,CAAC,EAAE,CAAC,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK;YACtE,CAAC,EAAE,CAAC,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK;YACtE,CAAC,EAAE,CAAC,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,KAAK;SACvE,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QACpD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC1C,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAAE,EAAE,GAAG,GAAG,CAAC;;gBAC5C,EAAE,GAAG,GAAG,CAAC;QAChB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;CACF"}

package/dist/core/pretty.d.ts

@@ -0,0 +1,122 @@
+/**
+ * Pretty — formats JavaScript data structures with highlighting.
+ *
+ * Lives in `core/` beside `markup` and `emoji` because it does their job: turn
+ * foreign input into `RichText`. It composes no other renderable — the trait
+ * every file in `renderables/` shares and this one does not — and its imports
+ * are core primitives only. `Console.print` accepts `unknown` and must turn any
+ * of it into something renderable, so the formatter has to sit where `console`
+ * can reach it without an upward edge. [LAW:one-way-deps]
+ *
+ * Two traversals share this file, and the split is the whole design. `_format`
+ * lays a value out across lines; `_oneLine` answers only "does this fit on one
+ * line, and if so what is it?". They meet at `_shape`, which describes a
+ * container without committing to either layout. One traversal answering both
+ * questions is what made this formatter exponential: every child was rendered
+ * once to probe it and again to place it, so a node at depth d was visited 2^d
+ * times.
+ */
+import { Segment } from "./segment.js";
+import type { Highlighter } from "./highlighter.js";
+import type { Renderable, Measurable, RenderOptions } from "./protocol.js";
+export interface PrettyOptions {
+    indent?: number;
+    expandAll?: boolean;
+    maxLength?: number;
+    maxString?: number;
+    /**
+     * How many levels of nesting to descend before eliding. Unbounded by default.
+     *
+     * `Console.print` supplies a bound because it formats whatever it is handed;
+     * a caller constructing a `Pretty` has seen their data and can say what they
+     * want. Past the cap a container renders as `[...]`, `{...}`, `Map {...}` or
+     * `Set {...}` — visible, so the reader knows the value continues.
+     */
+    maxDepth?: number;
+    indentGuides?: boolean;
+    /**
+     * Who colours the formatted text. Defaults to a `ReprHighlighter`.
+     *
+     * Passed rather than imported so a caller's choice survives. `Console.print`
+     * routes data arguments through here, and its `highlight` flag and custom
+     * `highlighter` have to reach the output the same way they reach a printed
+     * string — a `Pretty` reaching for its own singleton would silently outrank
+     * both. `NullHighlighter` is the "none" case.
+     */
+    highlighter?: Highlighter;
+}
+export declare class Pretty implements Renderable, Measurable {
+    readonly data: unknown;
+    readonly indent: number;
+    readonly expandAll: boolean;
+    readonly maxLength: number | undefined;
+    readonly maxString: number | undefined;
+    readonly maxDepth: number;
+    readonly indentGuides: boolean;
+    readonly highlighter: Highlighter;
+    constructor(data: unknown, options?: PrettyOptions);
+    render(options: RenderOptions): Iterable<Segment>;
+    measure(_options: RenderOptions): {
+        minimum: number;
+        maximum: number;
+    };
+    /**
+     * The text a value shows without being reflected on, or `null` when it is an
+     * object and the shape arms own it.
+     *
+     * Every kind answered here renders the same wherever it sits — no
+     * indentation, no width to fit — which is why one method serves both
+     * traversals.
+     */
+    private _scalar;
+    /**
+     * A container, or the text standing in for one that is empty or past the
+     * depth cap.
+     *
+     * `positions` is a thunk because both of those answers are reachable from
+     * `size` alone, and reaching a position is not free: a `Map` or `Set` reaches
+     * its own through an iterator, so enumerating one only to elide it drains a
+     * container to print `Set {...}`. `size` also says how many positions were
+     * dropped, which is where the elision marker comes from — one derivation, so
+     * the count and the bound cannot disagree.
+     */
+    private _container;
+    /**
+     * The brackets and positions of an object, layout-free. See `Shape`.
+     *
+     * `bound` is the most positions the caller could ever use. Laying out passes
+     * `Infinity`, because it prints every position it is handed. A probe passes
+     * what is left of its line, which is already more positions than a fitting
+     * one could hold — `SEPARATOR` charges two cells apiece, so a container with
+     * more positions than `budget` overruns however narrow its contents are.
+     * Reaching past it only ever feeds a join that returns `null`, and reaching a
+     * position is what drains a `Map` or `Set`.
+     */
+    private _shape;
+    /** The laid-out form of a value, expanded across lines wherever one line will not do. */
+    private _format;
+    /** The arms for a non-null object, with `value` already on the open path. */
+    private _formatObject;
+    /** One position, with every value in it laid out. */
+    private _expandSlot;
+    /** The one-line form of a value, or `null` when it will not fit `at.budget`. */
+    private _oneLine;
+    /**
+     * A container's positions on one line, or `null` as soon as they overrun.
+     *
+     * The budget is spent as it goes and each position is asked for only what is
+     * left, so a subtree that has already outgrown the line is abandoned where it
+     * outgrew it rather than formatted in full and then measured.
+     *
+     * The brackets are charged before anything is read, and that ordering is what
+     * bounds the traversal: a budget checked only against the finished text still
+     * reads the whole subtree to produce text it then throws away. Charged first,
+     * every level costs at least the two cells of its own brackets, so a probe
+     * descends at most `budget / 2` levels however deep the data goes.
+     */
+    private _joinOneLine;
+    /** One position on one line, or `null` when any value in it will not fit. */
+    private _slotOneLine;
+    private _addIndentGuides;
+}
+//# sourceMappingURL=pretty.d.ts.map

package/dist/core/pretty.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pretty.d.ts","sourceRoot":"","sources":["../../src/core/pretty.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAGvC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EACV,UAAU,EACV,UAAU,EACV,aAAa,EACd,MAAM,eAAe,CAAC;AAEvB,MAAM,WAAW,aAAa;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;;;OAOG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,WAAW,CAAC;CAC3B;AAsMD,qBAAa,MAAO,YAAW,UAAU,EAAE,UAAU;IACnD,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC;IACvC,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC;IACvC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC;IAC/B,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;gBAEtB,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,aAAa;IAWjD,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,QAAQ,CAAC,OAAO,CAAC;IAYlD,OAAO,CAAC,QAAQ,EAAE,aAAa,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IAUtE;;;;;;;OAOG;IACH,OAAO,CAAC,OAAO;IAyBf;;;;;;;;;;OAUG;IACH,OAAO,CAAC,UAAU;IAelB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM;IAqDd,yFAAyF;IACzF,OAAO,CAAC,OAAO;IAmBf,6EAA6E;IAC7E,OAAO,CAAC,aAAa;IAoBrB,qDAAqD;IACrD,OAAO,CAAC,WAAW;IAgBnB,gFAAgF;IAChF,OAAO,CAAC,QAAQ;IAkBhB;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,YAAY;IAepB,6EAA6E;IAC7E,OAAO,CAAC,YAAY;IAgBpB,OAAO,CAAC,gBAAgB;CAazB"}

package/dist/core/pretty.js

@@ -0,0 +1,398 @@
+/**
+ * Pretty — formats JavaScript data structures with highlighting.
+ *
+ * Lives in `core/` beside `markup` and `emoji` because it does their job: turn
+ * foreign input into `RichText`. It composes no other renderable — the trait
+ * every file in `renderables/` shares and this one does not — and its imports
+ * are core primitives only. `Console.print` accepts `unknown` and must turn any
+ * of it into something renderable, so the formatter has to sit where `console`
+ * can reach it without an upward edge. [LAW:one-way-deps]
+ *
+ * Two traversals share this file, and the split is the whole design. `_format`
+ * lays a value out across lines; `_oneLine` answers only "does this fit on one
+ * line, and if so what is it?". They meet at `_shape`, which describes a
+ * container without committing to either layout. One traversal answering both
+ * questions is what made this formatter exponential: every child was rendered
+ * once to probe it and again to place it, so a node at depth d was visited 2^d
+ * times.
+ */
+import { cellLen } from "./cells.js";
+import { RichText } from "./text.js";
+import { ReprHighlighter } from "./highlighter.js";
+const reprHighlighter = new ReprHighlighter();
+const rootFrame = (maxWidth) => ({ inset: 0, level: 0, maxWidth, open: new WeakSet() });
+/**
+ * The text, when it is a single line no wider than `budget` — otherwise `null`.
+ *
+ * The one definition of "fits on one line" in this file, and it has to name
+ * both halves: `cellLen` scores a newline as zero cells, so a width check alone
+ * accepted multi-line text as compact. That is how a `Map` nested in an object
+ * used to render as `{ m: Map {` — a one-line object with an expansion wedged
+ * inside it and the closing brace back at column 0.
+ */
+function fitOneLine(text, budget) {
+    return text.includes("\n") || cellLen(text) > budget ? null : text;
+}
+/**
+ * The elements of an indexed sequence, or `null` for anything that isn't one.
+ *
+ * A typed array is an array with a fixed element type, and neither of the two
+ * questions asked elsewhere in this file recognises it: `Array.isArray` says
+ * false, and its own `toString` answers the bare `1,2,3` — no brackets, nothing
+ * for the highlighter to colour per element. Both spellings reach the one arm
+ * that knows what a sequence looks like. `DataView` is excluded because it is a
+ * window onto bytes, not a sequence of values.
+ *
+ * Returned as `ArrayLike` rather than a materialised array because both
+ * spellings already are one. Converting here would box every element of a
+ * multi-megabyte `Buffer` to keep the first `maxLength` of them — bounding the
+ * output while leaving the cost of producing it unbounded.
+ */
+function indexedElements(value) {
+    if (Array.isArray(value))
+        return value;
+    if (ArrayBuffer.isView(value) && !(value instanceof DataView)) {
+        return value;
+    }
+    return null;
+}
+/**
+ * The first `limit` items of a sequence, pulled and no more.
+ *
+ * A `Map` or `Set` reaches its size through `.size`, which iterates nothing, so
+ * spreading one only ever served to throw the tail away — `print` of a
+ * half-million-entry cache walked all of it to show a hundred. `Infinity` is
+ * the unbounded case and never breaks.
+ */
+function take(source, limit) {
+    const taken = [];
+    if (limit <= 0)
+        return taken;
+    for (const item of source) {
+        taken.push(item);
+        if (taken.length >= limit)
+            break;
+    }
+    return taken;
+}
+/**
+ * What a value renders as when reading it threw instead of producing it.
+ *
+ * `Pretty` reflects on data it did not create, and every reflection it performs
+ * — a property getter, `Object.keys`, an iterator, `toString` — can throw. The
+ * message travels into the output, so the failure stays visible and attributed
+ * to the position that produced it. [LAW:no-silent-failure] the error is
+ * carried rather than swallowed; a marker naming its cause is not an
+ * answer-shaped void, and a diagnostic that takes the program down over one
+ * lazily-computed field is unusable on the objects it is most wanted for.
+ */
+function threw(error) {
+    return `[Threw: ${error instanceof Error ? error.message : String(error)}]`;
+}
+/**
+ * Does this value carry its own string form, or must we reflect on its keys?
+ *
+ * A `Date`, an `Error`, a `RegExp`, or any object that defines `toString`
+ * answers the display question itself, and reflecting on such a value throws
+ * that answer away — `Object.keys(new Date())` is empty, so key-reflection
+ * renders it `{}`. Inheriting `Object.prototype.toString` is the opposite
+ * signal: it yields `[object Object]`, a non-answer, so the keys are all the
+ * information there is.
+ *
+ * Both clauses are load-bearing. The identity check separates the two
+ * populations; the `typeof` check is what makes `Object.create(null)` — which
+ * has no `toString` at all — reflect rather than throw.
+ */
+function describesItself(value) {
+    const asRecord = value;
+    return (typeof asRecord[Symbol.toPrimitive] === "function" ||
+        (typeof asRecord.toString === "function" &&
+            asRecord.toString !== Object.prototype.toString));
+}
+/** What joins a container's positions on one line. Its width is charged for, so it is named once. */
+const SEPARATOR = ", ";
+/** The marker for positions the bound dropped, or nothing when it dropped none. */
+const elided = (dropped) => dropped > 0 ? [{ head: `... +${dropped}`, holes: [] }] : [];
+export class Pretty {
+    data;
+    indent;
+    expandAll;
+    maxLength;
+    maxString;
+    maxDepth;
+    indentGuides;
+    highlighter;
+    constructor(data, options) {
+        this.data = data;
+        this.indent = options?.indent ?? 4;
+        this.expandAll = options?.expandAll ?? false;
+        this.maxLength = options?.maxLength;
+        this.maxString = options?.maxString;
+        this.maxDepth = options?.maxDepth ?? Infinity;
+        this.indentGuides = options?.indentGuides !== false;
+        this.highlighter = options?.highlighter ?? reprHighlighter;
+    }
+    *render(options) {
+        const formatted = this._format(this.data, rootFrame(options.maxWidth));
+        const text = new RichText(formatted, { end: "" });
+        this.highlighter.highlight(text);
+        if (this.indentGuides) {
+            this._addIndentGuides(text);
+        }
+        yield* text.render(options);
+    }
+    measure(_options) {
+        const formatted = this._format(this.data, rootFrame(_options.maxWidth));
+        const lines = formatted.split("\n");
+        let max = 0;
+        for (const line of lines) {
+            max = Math.max(max, cellLen(line));
+        }
+        return { minimum: 1, maximum: Math.min(max, _options.maxWidth) };
+    }
+    /**
+     * The text a value shows without being reflected on, or `null` when it is an
+     * object and the shape arms own it.
+     *
+     * Every kind answered here renders the same wherever it sits — no
+     * indentation, no width to fit — which is why one method serves both
+     * traversals.
+     */
+    _scalar(value) {
+        if (value === null)
+            return "null";
+        if (value === undefined)
+            return "undefined";
+        switch (typeof value) {
+            case "string": {
+                let str = value;
+                if (this.maxString !== undefined && str.length > this.maxString) {
+                    str = str.slice(0, this.maxString) + `+${value.length - this.maxString}`;
+                }
+                return JSON.stringify(str);
+            }
+            case "number":
+            case "bigint":
+            case "boolean":
+                return String(value);
+            case "symbol":
+                return value.toString();
+            case "function":
+                return `[Function: ${value.name || "anonymous"}]`;
+        }
+        return null;
+    }
+    /**
+     * A container, or the text standing in for one that is empty or past the
+     * depth cap.
+     *
+     * `positions` is a thunk because both of those answers are reachable from
+     * `size` alone, and reaching a position is not free: a `Map` or `Set` reaches
+     * its own through an iterator, so enumerating one only to elide it drains a
+     * container to print `Set {...}`. `size` also says how many positions were
+     * dropped, which is where the elision marker comes from — one derivation, so
+     * the count and the bound cannot disagree.
+     */
+    _container(open, close, pad, size, level, positions) {
+        if (size === 0)
+            return { kind: "text", text: open + close };
+        if (level >= this.maxDepth)
+            return { kind: "text", text: open + "..." + close };
+        const slots = positions();
+        return { kind: "container", open, close, pad, slots: [...slots, ...elided(size - slots.length)] };
+    }
+    /**
+     * The brackets and positions of an object, layout-free. See `Shape`.
+     *
+     * `bound` is the most positions the caller could ever use. Laying out passes
+     * `Infinity`, because it prints every position it is handed. A probe passes
+     * what is left of its line, which is already more positions than a fitting
+     * one could hold — `SEPARATOR` charges two cells apiece, so a container with
+     * more positions than `budget` overruns however narrow its contents are.
+     * Reaching past it only ever feeds a join that returns `null`, and reaching a
+     * position is what drains a `Map` or `Set`.
+     */
+    _shape(value, level, bound) {
+        // Clamped because a probe's budget goes negative once a line is overrun,
+        // and `slice` reads a negative end as counting from the far end — it would
+        // keep all but the last few keys where the other arms take none.
+        const cap = Math.max(0, Math.min(this.maxLength ?? Infinity, bound));
+        const elements = indexedElements(value);
+        if (elements !== null) {
+            return this._container("[", "]", "", elements.length, level, () => {
+                // Positions rather than values: each index is read in its own slot, so
+                // one throwing accessor costs its own slot, not the whole sequence.
+                const shown = Math.min(elements.length, cap);
+                return Array.from({ length: shown }, (_, i) => ({
+                    head: "",
+                    holes: [{ read: () => elements[i], tail: "" }],
+                }));
+            });
+        }
+        if (value instanceof Map) {
+            return this._container("Map {", "}", " ", value.size, level, () => take(value.entries(), cap).map(([k, v]) => ({
+                head: "",
+                holes: [{ read: () => k, tail: " => " }, { read: () => v, tail: "" }],
+            })));
+        }
+        if (value instanceof Set) {
+            return this._container("Set {", "}", " ", value.size, level, () => take(value, cap).map((v) => ({
+                head: "",
+                holes: [{ read: () => v, tail: "" }],
+            })));
+        }
+        // Objects that answer the display question themselves. Sits below the
+        // Array/Map/Set arms deliberately: an array also overrides `toString`, but
+        // "1,2,3" is a poorer answer than the structural form above.
+        if (describesItself(value))
+            return { kind: "text", text: String(value) };
+        // Plain objects — no self-description, so the keys are the whole story.
+        const obj = value;
+        const keys = Object.keys(obj);
+        return this._container("{", "}", " ", keys.length, level, () => keys.slice(0, cap).map((k) => ({
+            head: `${k}: `,
+            holes: [{ read: () => obj[k], tail: "" }],
+        })));
+    }
+    /** The laid-out form of a value, expanded across lines wherever one line will not do. */
+    _format(value, at) {
+        const scalar = this._scalar(value);
+        if (scalar !== null)
+            return scalar;
+        const object = value;
+        if (at.open.has(object))
+            return "[Circular]";
+        at.open.add(object);
+        try {
+            return this._formatObject(object, at);
+        }
+        catch (error) {
+            // The container's *shape* would not be read — `Object.keys`, an iterator,
+            // `toString`. Nothing can be enumerated, so the whole container degrades;
+            // a value that merely would not be read degrades alone, in its own slot.
+            return threw(error);
+        }
+        finally {
+            at.open.delete(object);
+        }
+    }
+    /** The arms for a non-null object, with `value` already on the open path. */
+    _formatObject(value, at) {
+        const shape = this._shape(value, at.level, Infinity);
+        if (shape.kind === "text")
+            return shape.text;
+        const indentStr = " ".repeat(this.indent * at.inset);
+        if (!this.expandAll) {
+            const compact = this._joinOneLine(shape, {
+                level: at.level + 1,
+                budget: at.maxWidth - cellLen(indentStr),
+                open: at.open,
+            });
+            if (compact !== null)
+                return compact;
+        }
+        const innerIndent = " ".repeat(this.indent * (at.inset + 1));
+        const deeper = { inset: at.inset + 1, level: at.level + 1, maxWidth: at.maxWidth, open: at.open };
+        const parts = shape.slots.map((slot) => innerIndent + this._expandSlot(slot, deeper));
+        return shape.open + "\n" + parts.join(",\n") + "\n" + indentStr + shape.close;
+    }
+    /** One position, with every value in it laid out. */
+    _expandSlot(slot, at) {
+        let out = slot.head;
+        for (const hole of slot.holes) {
+            // This is the read that costs the least when it fails: neighbours are
+            // unaffected, so `{ a: 1, b: [Threw: …], c: 3 }` still shows everything
+            // that could be read.
+            try {
+                out += this._format(hole.read(), at);
+            }
+            catch (error) {
+                out += threw(error);
+            }
+            out += hole.tail;
+        }
+        return out;
+    }
+    /** The one-line form of a value, or `null` when it will not fit `at.budget`. */
+    _oneLine(value, at) {
+        const scalar = this._scalar(value);
+        if (scalar !== null)
+            return fitOneLine(scalar, at.budget);
+        const object = value;
+        if (at.open.has(object))
+            return fitOneLine("[Circular]", at.budget);
+        at.open.add(object);
+        try {
+            const shape = this._shape(object, at.level, at.budget);
+            if (shape.kind === "text")
+                return fitOneLine(shape.text, at.budget);
+            return this._joinOneLine(shape, { level: at.level + 1, budget: at.budget, open: at.open });
+        }
+        catch (error) {
+            return fitOneLine(threw(error), at.budget);
+        }
+        finally {
+            at.open.delete(object);
+        }
+    }
+    /**
+     * A container's positions on one line, or `null` as soon as they overrun.
+     *
+     * The budget is spent as it goes and each position is asked for only what is
+     * left, so a subtree that has already outgrown the line is abandoned where it
+     * outgrew it rather than formatted in full and then measured.
+     *
+     * The brackets are charged before anything is read, and that ordering is what
+     * bounds the traversal: a budget checked only against the finished text still
+     * reads the whole subtree to produce text it then throws away. Charged first,
+     * every level costs at least the two cells of its own brackets, so a probe
+     * descends at most `budget / 2` levels however deep the data goes.
+     */
+    _joinOneLine(shape, at) {
+        let used = cellLen(shape.open) + cellLen(shape.close) + 2 * cellLen(shape.pad);
+        if (used > at.budget)
+            return null;
+        const pieces = [];
+        for (const slot of shape.slots) {
+            used += pieces.length > 0 ? cellLen(SEPARATOR) : 0;
+            const piece = this._slotOneLine(slot, { ...at, budget: at.budget - used });
+            if (piece === null)
+                return null;
+            used += cellLen(piece);
+            pieces.push(piece);
+        }
+        return shape.open + shape.pad + pieces.join(SEPARATOR) + shape.pad + shape.close;
+    }
+    /** One position on one line, or `null` when any value in it will not fit. */
+    _slotOneLine(slot, at) {
+        let out = slot.head;
+        for (const hole of slot.holes) {
+            const left = at.budget - cellLen(out);
+            let text;
+            try {
+                text = this._oneLine(hole.read(), { ...at, budget: left });
+            }
+            catch (error) {
+                text = fitOneLine(threw(error), left);
+            }
+            if (text === null)
+                return null;
+            out += text + hole.tail;
+        }
+        return fitOneLine(out, at.budget);
+    }
+    _addIndentGuides(text) {
+        const lines = text.plain.split("\n");
+        let offset = 0;
+        for (const line of lines) {
+            const leadingSpaces = line.length - line.trimStart().length;
+            for (let i = 0; i < leadingSpaces; i += this.indent) {
+                if (i + offset < text.length) {
+                    text.stylize("repr.indent", offset + i, offset + i + 1);
+                }
+            }
+            offset += line.length + 1; // +1 for newline
+        }
+    }
+}
+//# sourceMappingURL=pretty.js.map