@miragon/pulse-widget-shell 0.0.0-stage → 0.22.0

package/dist/ui/inline-fit-solve.d.ts

@@ -0,0 +1,50 @@
+/**
+ * How many rows each inline list of a view keeps so the view fits the host's
+ * height budget (#396): the pure half of the measured inline fit
+ * (`inline-fit.tsx` measures, this decides). Inputs are what the rendered
+ * view measures, never assumed sizes: the content's height and, per list,
+ * the bottom edge of every row it shows. Dropping rows k…n−1 of a list saves
+ * the distance between the bottom of its last shown row and the bottom of
+ * row k−1.
+ *
+ * The order rows go in:
+ *  1. one row at a time from the list showing the most rows (a tie: the later
+ *     list first), down to {@link FitLimits.softMin} each;
+ *  2. then the lists after the first one, last first, down to
+ *     {@link FitLimits.hardMin}; then the first list.
+ * When the view does not fit even at `hardMin` everywhere, cutting below
+ * `softMin` buys nothing: the result is the state after step 1 and
+ * `fits: false` (the view then scrolls inside the budget, its safety net).
+ *
+ * A cap never grows here (growth is a new epoch: another budget, width or
+ * display mode), never drops below `hardMin`, and a list frozen by the user
+ * ("Show more" in place) is never cut.
+ */
+export interface FitSlot {
+    id: string;
+    /** Position in the document: lower is earlier. */
+    order: number;
+    /** The bottom edge (px, any common origin) of each row the list shows, top to bottom. */
+    bottoms: readonly number[];
+    /** The user revealed rows in place: keep them. */
+    frozen: boolean;
+}
+export interface FitLimits {
+    /** Rows a list keeps before any list goes below it. */
+    softMin: number;
+    /** The fewest rows a list ever shows inline. */
+    hardMin: number;
+}
+export declare const FIT_LIMITS: FitLimits;
+export interface FitResult {
+    /** The new row count of every list that loses rows; lists not named keep theirs. */
+    cuts: Record<string, number>;
+    /** The content fits the budget after the cuts (as far as the cuts can tell). */
+    fits: boolean;
+}
+export declare function solveInlineFit(input: {
+    budget: number;
+    content: number;
+    slots: readonly FitSlot[];
+}, limits?: FitLimits): FitResult;
+//# sourceMappingURL=inline-fit-solve.d.ts.map

package/dist/ui/inline-fit-solve.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inline-fit-solve.d.ts","sourceRoot":"","sources":["../../src/ui/inline-fit-solve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAA;IACV,kDAAkD;IAClD,KAAK,EAAE,MAAM,CAAA;IACb,yFAAyF;IACzF,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;IAC1B,kDAAkD;IAClD,MAAM,EAAE,OAAO,CAAA;CAChB;AAED,MAAM,WAAW,SAAS;IACxB,uDAAuD;IACvD,OAAO,EAAE,MAAM,CAAA;IACf,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAA;CAChB;AAED,eAAO,MAAM,UAAU,EAAE,SAAsC,CAAA;AAE/D,MAAM,WAAW,SAAS;IACxB,oFAAoF;IACpF,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC5B,gFAAgF;IAChF,IAAI,EAAE,OAAO,CAAA;CACd;AA8CD,wBAAgB,cAAc,CAC5B,KAAK,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,SAAS,OAAO,EAAE,CAAA;CAAE,EACrE,MAAM,GAAE,SAAsB,GAC7B,SAAS,CAoBX"}

package/dist/ui/inline-fit-solve.js

@@ -0,0 +1,83 @@
+/**
+ * How many rows each inline list of a view keeps so the view fits the host's
+ * height budget (#396): the pure half of the measured inline fit
+ * (`inline-fit.tsx` measures, this decides). Inputs are what the rendered
+ * view measures, never assumed sizes: the content's height and, per list,
+ * the bottom edge of every row it shows. Dropping rows k…n−1 of a list saves
+ * the distance between the bottom of its last shown row and the bottom of
+ * row k−1.
+ *
+ * The order rows go in:
+ *  1. one row at a time from the list showing the most rows (a tie: the later
+ *     list first), down to {@link FitLimits.softMin} each;
+ *  2. then the lists after the first one, last first, down to
+ *     {@link FitLimits.hardMin}; then the first list.
+ * When the view does not fit even at `hardMin` everywhere, cutting below
+ * `softMin` buys nothing: the result is the state after step 1 and
+ * `fits: false` (the view then scrolls inside the budget, its safety net).
+ *
+ * A cap never grows here (growth is a new epoch: another budget, width or
+ * display mode), never drops below `hardMin`, and a list frozen by the user
+ * ("Show more" in place) is never cut.
+ */
+export const FIT_LIMITS = { softMin: 3, hardMin: 1 };
+/** What dropping a list's rows below `keep` saves. */
+function savedBy({ slot, shown, keep }) {
+    if (keep >= shown)
+        return 0;
+    return slot.bottoms[shown - 1] - slot.bottoms[keep - 1];
+}
+const totalSaved = (lists) => lists.reduce((sum, list) => sum + savedBy(list), 0);
+/** Step 1: the list with the most rows gives one, down to `softMin`. */
+function trimToSoftMin(lists, over, softMin) {
+    while (totalSaved(lists) < over) {
+        let pick;
+        for (const list of lists) {
+            if (list.keep <= Math.min(softMin, list.shown))
+                continue;
+            if (!pick ||
+                list.keep > pick.keep ||
+                (list.keep === pick.keep && list.slot.order > pick.slot.order)) {
+                pick = list;
+            }
+        }
+        if (!pick)
+            return;
+        pick.keep -= 1;
+    }
+}
+/** Step 2: the later lists, last first, then the first one, down to `hardMin`. */
+function trimToHardMin(lists, over, hardMin) {
+    const byOrder = [...lists].sort((a, b) => a.slot.order - b.slot.order);
+    const sequence = [...byOrder.slice(1).reverse(), ...byOrder.slice(0, 1)];
+    for (const list of sequence) {
+        while (totalSaved(lists) < over && list.keep > hardMin)
+            list.keep -= 1;
+        if (totalSaved(lists) >= over)
+            return;
+    }
+}
+export function solveInlineFit(input, limits = FIT_LIMITS) {
+    const over = Math.ceil(input.content) - input.budget;
+    if (over <= 0)
+        return { cuts: {}, fits: true };
+    const lists = input.slots
+        .filter((slot) => !slot.frozen && slot.bottoms.length > 0)
+        .map((slot) => ({ slot, shown: slot.bottoms.length, keep: slot.bottoms.length }));
+    trimToSoftMin(lists, over, limits.softMin);
+    const soft = lists.map((list) => list.keep);
+    let fits = totalSaved(lists) >= over;
+    if (!fits) {
+        trimToHardMin(lists, over, Math.max(1, limits.hardMin));
+        fits = totalSaved(lists) >= over;
+        // Below softMin only where it makes the view fit.
+        if (!fits)
+            lists.forEach((list, i) => (list.keep = soft[i]));
+    }
+    const cuts = {};
+    for (const list of lists)
+        if (list.keep < list.shown)
+            cuts[list.slot.id] = list.keep;
+    return { cuts, fits };
+}
+//# sourceMappingURL=inline-fit-solve.js.map

package/dist/ui/inline-fit-solve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inline-fit-solve.js","sourceRoot":"","sources":["../../src/ui/inline-fit-solve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAmBH,MAAM,CAAC,MAAM,UAAU,GAAc,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAA;AAe/D,sDAAsD;AACtD,SAAS,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAW;IAC7C,IAAI,IAAI,IAAI,KAAK;QAAE,OAAO,CAAC,CAAA;IAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;AACzD,CAAC;AAED,MAAM,UAAU,GAAG,CAAC,KAAyB,EAAE,EAAE,CAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAErD,wEAAwE;AACxE,SAAS,aAAa,CAAC,KAAgB,EAAE,IAAY,EAAE,OAAe;IACpE,OAAO,UAAU,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC;QAChC,IAAI,IAAyB,CAAA;QAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAQ;YACxD,IACE,CAAC,IAAI;gBACL,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;gBACrB,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAC9D,CAAC;gBACD,IAAI,GAAG,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,IAAI,CAAC,IAAI;YAAE,OAAM;QACjB,IAAI,CAAC,IAAI,IAAI,CAAC,CAAA;IAChB,CAAC;AACH,CAAC;AAED,kFAAkF;AAClF,SAAS,aAAa,CAAC,KAAgB,EAAE,IAAY,EAAE,OAAe;IACpE,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACtE,MAAM,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACxE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,OAAO,UAAU,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO;YAAE,IAAI,CAAC,IAAI,IAAI,CAAC,CAAA;QACtE,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,IAAI;YAAE,OAAM;IACvC,CAAC;AACH,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,KAAqE,EACrE,SAAoB,UAAU;IAE9B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,CAAA;IACpD,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;IAC9C,MAAM,KAAK,GAAc,KAAK,CAAC,KAAK;SACjC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;SACzD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IAEnF,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,CAAA;IAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC3C,IAAI,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,IAAI,CAAA;IACpC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAA;QACvD,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,IAAI,CAAA;QAChC,kDAAkD;QAClD,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC9D,CAAC;IAED,MAAM,IAAI,GAA2B,EAAE,CAAA;IACvC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAA;IACpF,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;AACvB,CAAC"}

package/dist/ui/inline-fit-solve.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=inline-fit-solve.test.d.ts.map

package/dist/ui/inline-fit-solve.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inline-fit-solve.test.d.ts","sourceRoot":"","sources":["../../src/ui/inline-fit-solve.test.ts"],"names":[],"mappings":""}

package/dist/ui/inline-fit-solve.test.js

@@ -0,0 +1,108 @@
+import { describe, expect, it } from "vitest";
+import { solveInlineFit } from "./inline-fit-solve.js";
+/**
+ * The inline fit's decision (#396), with the sizes measured on the playground
+ * views at 760 px (chrome above and below the rows, row heights): a list
+ * keeps as many rows as fit, 3 before any list goes lower, 1 at the least,
+ * and never 0.
+ */
+/** A list whose `count` rows of `height` px start at `top`. */
+function list(id, count, height, top = 0, order = 0) {
+    return {
+        id,
+        order,
+        bottoms: Array.from({ length: count }, (_, i) => top + (i + 1) * height),
+        frozen: false,
+    };
+}
+/** A view of `chrome` px around one list of `count` × `height` px rows. */
+function view(budget, chrome, count, height) {
+    return { budget, content: chrome + count * height, slots: [list("rows", count, height, chrome)] };
+}
+describe("solveInlineFit: one list", () => {
+    it("leaves a view that fits as it is", () => {
+        expect(solveInlineFit(view(600, 342, 2, 66))).toEqual({ cuts: {}, fits: true });
+        expect(solveInlineFit(view(600, 400, 2, 100))).toEqual({ cuts: {}, fits: true });
+    });
+    it("keeps the rows that fit: engine-wide instances, scoped instances, a 600 px budget", () => {
+        // 360 px chrome and 66 px rows (engine-wide instances after the density fix).
+        expect(solveInlineFit(view(600, 360, 10, 66))).toEqual({ cuts: { rows: 3 }, fits: true });
+        // 360 px chrome and 57 px rows (scoped instances).
+        expect(solveInlineFit(view(600, 360, 10, 57))).toEqual({ cuts: { rows: 4 }, fits: true });
+    });
+    it("goes below 3 rows only where that makes the view fit: the job panel", () => {
+        // 408 px chrome and 87 px rows: 3 rows are 669 px, 2 are 582.
+        expect(solveInlineFit(view(600, 408, 10, 87))).toEqual({ cuts: { rows: 2 }, fits: true });
+        expect(solveInlineFit(view(600, 500, 10, 87))).toEqual({ cuts: { rows: 1 }, fits: true });
+    });
+    it("keeps 3 rows when even 1 does not fit: the view then scrolls inside the budget", () => {
+        // The analytics dashboard: about 1000 px around its activity table.
+        expect(solveInlineFit(view(600, 1000, 7, 66))).toEqual({ cuts: { rows: 3 }, fits: false });
+    });
+    it("fits more rows into a larger budget", () => {
+        expect(solveInlineFit(view(800, 360, 10, 66)).cuts).toEqual({ rows: 6 });
+        expect(solveInlineFit(view(800, 360, 10, 57)).cuts).toEqual({ rows: 7 });
+        expect(solveInlineFit(view(800, 408, 10, 87)).cuts).toEqual({ rows: 4 });
+    });
+    it("rounds a fractional content height up: 600.4 px is over a 600 px budget", () => {
+        const slot = list("rows", 4, 50, 400);
+        expect(solveInlineFit({ budget: 600, content: 600, slots: [slot] }).cuts).toEqual({});
+        expect(solveInlineFit({ budget: 600, content: 600.4, slots: [slot] }).cuts).toEqual({ rows: 3 });
+    });
+    it("never cuts a list the user revealed rows of", () => {
+        const frozen = { ...list("rows", 10, 66, 360), frozen: true };
+        expect(solveInlineFit({ budget: 600, content: 1020, slots: [frozen] })).toEqual({
+            cuts: {},
+            fits: false,
+        });
+    });
+    it("ignores lists that show no rows (hidden, empty)", () => {
+        const hidden = { id: "hidden", order: 1, bottoms: [], frozen: false };
+        expect(solveInlineFit({ budget: 600, content: 700, slots: [hidden] })).toEqual({
+            cuts: {},
+            fits: false,
+        });
+    });
+    it("lets a short list give a row only where that makes the view fit, and never its last", () => {
+        // 2 rows, 52 px over: one goes.
+        expect(solveInlineFit(view(600, 520, 2, 66))).toEqual({ cuts: { rows: 1 }, fits: true });
+        // 92 px over: even 1 row does not fit, so both stay.
+        expect(solveInlineFit(view(600, 560, 2, 66))).toEqual({ cuts: {}, fits: false });
+    });
+});
+describe("solveInlineFit: several lists", () => {
+    const twoLists = (budget, over) => {
+        const first = list("first", 6, 50, 200, 0);
+        const second = list("second", 4, 50, 600, 1);
+        return { budget, content: budget + over, slots: [first, second] };
+    };
+    it("takes rows from the list showing the most first", () => {
+        // 6 and 4 rows: the first gives two, then both are at 4 and the later one gives.
+        expect(solveInlineFit(twoLists(600, 150)).cuts).toEqual({ first: 4, second: 3 });
+    });
+    it("on a tie, the later list gives first", () => {
+        const first = list("first", 4, 50, 200, 0);
+        const second = list("second", 4, 50, 500, 1);
+        expect(solveInlineFit({ budget: 600, content: 650, slots: [first, second] }).cuts).toEqual({
+            second: 3,
+        });
+    });
+    it("below 3 rows: the later lists first, the first list last", () => {
+        // Both at 3 save 200 px (50 px rows); the second at 1 saves 100 more.
+        expect(solveInlineFit(twoLists(600, 300)).cuts).toEqual({ first: 3, second: 1 });
+        // 50 px more: then the first list gives too.
+        expect(solveInlineFit(twoLists(600, 350)).cuts).toEqual({ first: 2, second: 1 });
+    });
+    it("keeps every list at 3 when the view cannot fit at 1 each", () => {
+        expect(solveInlineFit(twoLists(600, 900))).toEqual({
+            cuts: { first: 3, second: 3 },
+            fits: false,
+        });
+    });
+    it("is stable: solving its own result again changes nothing", () => {
+        const first = list("first", 4, 50, 200, 0);
+        const second = list("second", 3, 50, 500, 1);
+        expect(solveInlineFit({ budget: 600, content: 600, slots: [first, second] }).cuts).toEqual({});
+    });
+});
+//# sourceMappingURL=inline-fit-solve.test.js.map

package/dist/ui/inline-fit-solve.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inline-fit-solve.test.js","sourceRoot":"","sources":["../../src/ui/inline-fit-solve.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AAC7C,OAAO,EAAE,cAAc,EAAgB,MAAM,uBAAuB,CAAA;AAEpE;;;;;GAKG;AAEH,+DAA+D;AAC/D,SAAS,IAAI,CAAC,EAAU,EAAE,KAAa,EAAE,MAAc,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC;IACzE,OAAO;QACL,EAAE;QACF,KAAK;QACL,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;QACxE,MAAM,EAAE,KAAK;KACd,CAAA;AACH,CAAC;AAED,2EAA2E;AAC3E,SAAS,IAAI,CAAC,MAAc,EAAE,MAAc,EAAE,KAAa,EAAE,MAAc;IACzE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAA;AACnG,CAAC;AAED,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;QAC/E,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;IAClF,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mFAAmF,EAAE,GAAG,EAAE;QAC3F,8EAA8E;QAC9E,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;QACzF,mDAAmD;QACnD,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;IAC3F,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,8DAA8D;QAC9D,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;QACzF,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;IAC3F,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gFAAgF,EAAE,GAAG,EAAE;QACxF,oEAAoE;QACpE,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;IAC5F,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;QACxE,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;QACxE,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC1E,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yEAAyE,EAAE,GAAG,EAAE;QACjF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;QACrC,MAAM,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;QACrF,MAAM,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAClG,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;QAC7D,MAAM,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YAC9E,IAAI,EAAE,EAAE;YACR,IAAI,EAAE,KAAK;SACZ,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,MAAM,GAAY,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAA;QAC9E,MAAM,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YAC7E,IAAI,EAAE,EAAE;YACR,IAAI,EAAE,KAAK;SACZ,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qFAAqF,EAAE,GAAG,EAAE;QAC7F,gCAAgC;QAChC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;QACxF,qDAAqD;QACrD,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;IAClF,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAE,IAAY,EAAE,EAAE;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QAC5C,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAA;IACnE,CAAC,CAAA;IAED,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,iFAAiF;QACjF,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;IAClF,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QAC5C,MAAM,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC;YACzF,MAAM,EAAE,CAAC;SACV,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,sEAAsE;QACtE,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;QAChF,6CAA6C;QAC7C,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAA;IAClF,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACjD,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;YAC7B,IAAI,EAAE,KAAK;SACZ,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QAC5C,MAAM,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;IAChG,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/ui/inline-fit-time.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=inline-fit-time.test.d.ts.map

package/dist/ui/inline-fit-time.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inline-fit-time.test.d.ts","sourceRoot":"","sources":["../../src/ui/inline-fit-time.test.tsx"],"names":[],"mappings":""}

package/dist/ui/inline-fit-time.test.js

@@ -0,0 +1,110 @@
+import { jsx as _jsx, Fragment as _Fragment, jsxs as _jsxs } from "react/jsx-runtime";
+// @vitest-environment happy-dom
+import { afterEach, beforeEach, describe, expect, it, vi } from "vitest";
+import { useState } from "react";
+import { act, cleanup, fireEvent, render, screen } from "@testing-library/react";
+import { Host, ROWS, Table, layout, shownRows } from "./inline-fit.test-support.js";
+/**
+ * The inline fit over time (#396): a second pass for the line its own cap
+ * adds, late growth before and after the user touches the view, a list shown
+ * from a hidden tab, a new budget after rows were revealed, a revealed list
+ * next to a changing one, and the step "Show more" reveals.
+ */
+afterEach(() => cleanup());
+describe("the fit over time", () => {
+    /** A layout whose chrome can grow later, and whose hidden lists show no rows. */
+    function mutableLayout(start) {
+        const state = { ...start, footer: start.footer ?? 40 };
+        const measure = {
+            rows: (element) => element.closest("[data-test-hidden]")
+                ? []
+                : Array.from(element.children).map((_, i) => state.chrome + (i + 1) * state.row),
+            content: (box) => state.chrome +
+                box.querySelectorAll("[data-inline-fit-rows] > *").length * state.row +
+                box.querySelectorAll("tfoot").length * state.footer,
+        };
+        return { state, measure };
+    }
+    const observers = [];
+    beforeEach(() => {
+        vi.stubGlobal("ResizeObserver", class {
+            constructor(callback) {
+                observers.push(callback);
+            }
+            observe() { }
+            disconnect() { }
+        });
+    });
+    afterEach(() => {
+        vi.unstubAllGlobals();
+        observers.length = 0;
+    });
+    /** The view's content changed size (fonts, a diagram, a tab shown). */
+    const resized = () => act(() => observers.forEach((callback) => callback()));
+    const rowsOf = (prefix) => shownRows().filter((text) => text.startsWith(prefix));
+    it("absorbs the 'k of N' line its own cap adds (a second pass)", () => {
+        // 8 rows are 780 px; 5 fit before the line appears, 4 with it.
+        render(_jsx(Host, { measure: layout({ chrome: 300, row: 60 }), children: _jsx(Table, { rows: ROWS.slice(0, 8) }) }));
+        expect(shownRows()).toHaveLength(4);
+        expect(screen.getByText("4 of 8 shown")).toBeTruthy();
+    });
+    it("refits what grows late until the user touches the view, then leaves the rows alone", () => {
+        const { state, measure } = mutableLayout({ chrome: 300, row: 60 });
+        render(_jsx(Host, { measure: measure, children: _jsx(Table, {}) }));
+        expect(shownRows()).toHaveLength(4);
+        state.chrome = 360;
+        resized();
+        expect(shownRows()).toHaveLength(3);
+        fireEvent.pointerDown(window);
+        state.chrome = 420;
+        resized();
+        // Rows never vanish under the pointer: the view scrolls inside its budget instead.
+        expect(shownRows()).toHaveLength(3);
+    });
+    it("fits a list the first time it shows, also after the user touched the view", () => {
+        const { measure } = mutableLayout({ chrome: 300, row: 60 });
+        function Tabbed() {
+            const [shown, setShown] = useState(false);
+            return (_jsxs(_Fragment, { children: [_jsx("button", { type: "button", onClick: () => setShown(true), children: "show" }), _jsx("div", { "data-test-hidden": shown ? undefined : "", children: _jsx(Table, {}) })] }));
+        }
+        render(_jsx(Host, { measure: measure, children: _jsx(Tabbed, {}) }));
+        // Hidden: nothing to measure, nothing cut.
+        expect(shownRows()).toHaveLength(10);
+        fireEvent.pointerDown(window);
+        fireEvent.click(screen.getByRole("button", { name: "show" }));
+        resized();
+        expect(shownRows()).toHaveLength(4);
+    });
+    it("a new budget refits a list whose rows the user revealed in place", () => {
+        // 340 px chrome, 60 px rows: 3 of 6 fit 600 px.
+        const measure = layout({ chrome: 340, row: 60 });
+        const { rerender } = render(_jsx(Host, { measure: measure, children: _jsx(Table, { rows: ROWS.slice(0, 6) }) }));
+        expect(shownRows()).toHaveLength(3);
+        fireEvent.click(screen.getByRole("button", { name: "Show more" }));
+        expect(shownRows()).toHaveLength(6);
+        rerender(_jsx(Host, { budget: 500, measure: measure, children: _jsx(Table, { rows: ROWS.slice(0, 6) }) }));
+        expect(shownRows()).toHaveLength(2);
+    });
+    it("keeps the rows the user revealed while another list of the view changes", () => {
+        const measure = layout({ chrome: 100, row: 50 });
+        const a = Array.from({ length: 12 }, (_, i) => `row a${i + 1}`);
+        function TwoTables({ b }) {
+            return (_jsxs(_Fragment, { children: [_jsx(Table, { rows: a }), _jsx(Table, { rows: Array.from({ length: b }, (_, i) => `row b${i + 1}`) })] }));
+        }
+        const { rerender } = render(_jsx(Host, { measure: measure, children: _jsx(TwoTables, { b: 2 }) }));
+        expect(rowsOf("row a")).toHaveLength(7);
+        fireEvent.click(screen.getByRole("button", { name: "Show more" }));
+        expect(rowsOf("row a")).toHaveLength(12);
+        rerender(_jsx(Host, { measure: measure, children: _jsx(TwoTables, { b: 6 }) }));
+        expect(rowsOf("row a")).toHaveLength(12);
+        expect(rowsOf("row b")).toHaveLength(3);
+    });
+    it("reveals at least 3 rows per click where only 1 fits", () => {
+        // 470 px chrome, 87 px rows: 1 row fits.
+        render(_jsx(Host, { measure: layout({ chrome: 470, row: 87 }), children: _jsx(Table, {}) }));
+        expect(shownRows()).toHaveLength(1);
+        fireEvent.click(screen.getByRole("button", { name: "Show more" }));
+        expect(shownRows()).toHaveLength(4);
+    });
+});
+//# sourceMappingURL=inline-fit-time.test.js.map

package/dist/ui/inline-fit-time.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inline-fit-time.test.js","sourceRoot":"","sources":["../../src/ui/inline-fit-time.test.tsx"],"names":[],"mappings":";AAAA,gCAAgC;AAChC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AACxE,OAAO,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAA;AAChC,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAA;AAEhF,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAA;AAEnF;;;;;GAKG;AAEH,SAAS,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAA;AAE1B,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,iFAAiF;IACjF,SAAS,aAAa,CAAC,KAAuD;QAC5E,MAAM,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,EAAE,EAAE,CAAA;QACtD,MAAM,OAAO,GAAe;YAC1B,IAAI,EAAE,CAAC,OAAO,EAAE,EAAE,CAChB,OAAO,CAAC,OAAO,CAAC,oBAAoB,CAAC;gBACnC,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC;YACpF,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CACf,KAAK,CAAC,MAAM;gBACZ,GAAG,CAAC,gBAAgB,CAAC,4BAA4B,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG;gBACrE,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;SACtD,CAAA;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;IAC3B,CAAC;IAED,MAAM,SAAS,GAAsB,EAAE,CAAA;IACvC,UAAU,CAAC,GAAG,EAAE;QACd,EAAE,CAAC,UAAU,CACX,gBAAgB,EAChB;YACE,YAAY,QAAoB;gBAC9B,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC1B,CAAC;YACD,OAAO,KAAI,CAAC;YACZ,UAAU,KAAI,CAAC;SAChB,CACF,CAAA;IACH,CAAC,CAAC,CAAA;IACF,SAAS,CAAC,GAAG,EAAE;QACb,EAAE,CAAC,gBAAgB,EAAE,CAAA;QACrB,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;IACtB,CAAC,CAAC,CAAA;IACF,uEAAuE;IACvE,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;IAE5E,MAAM,MAAM,GAAG,CAAC,MAAc,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAA;IAExF,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,+DAA+D;QAC/D,MAAM,CACJ,KAAC,IAAI,IAAC,OAAO,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,YAC7C,KAAC,KAAK,IAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAI,GAC5B,CACR,CAAA;QACD,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACnC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,UAAU,EAAE,CAAA;IACvD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oFAAoF,EAAE,GAAG,EAAE;QAC5F,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAA;QAClE,MAAM,CACJ,KAAC,IAAI,IAAC,OAAO,EAAE,OAAO,YACpB,KAAC,KAAK,KAAG,GACJ,CACR,CAAA;QACD,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACnC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAA;QAClB,OAAO,EAAE,CAAA;QACT,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAEnC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;QAC7B,KAAK,CAAC,MAAM,GAAG,GAAG,CAAA;QAClB,OAAO,EAAE,CAAA;QACT,mFAAmF;QACnF,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,MAAM,EAAE,OAAO,EAAE,GAAG,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAA;QAC3D,SAAS,MAAM;YACb,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;YACzC,OAAO,CACL,8BACE,iBAAQ,IAAI,EAAC,QAAQ,EAAC,OAAO,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,qBAE1C,EACT,kCAAuB,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,YAC3C,KAAC,KAAK,KAAG,GACL,IACL,CACJ,CAAA;QACH,CAAC;QACD,MAAM,CACJ,KAAC,IAAI,IAAC,OAAO,EAAE,OAAO,YACpB,KAAC,MAAM,KAAG,GACL,CACR,CAAA;QACD,2CAA2C;QAC3C,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAA;QACpC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;QAC7B,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;QAC7D,OAAO,EAAE,CAAA;QACT,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,gDAAgD;QAChD,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAA;QAChD,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CACzB,KAAC,IAAI,IAAC,OAAO,EAAE,OAAO,YACpB,KAAC,KAAK,IAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAI,GAC5B,CACR,CAAA;QACD,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACnC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,CAAA;QAClE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACnC,QAAQ,CACN,KAAC,IAAI,IAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,YACjC,KAAC,KAAK,IAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAI,GAC5B,CACR,CAAA;QACD,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yEAAyE,EAAE,GAAG,EAAE;QACjF,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAA;QAChD,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC/D,SAAS,SAAS,CAAC,EAAE,CAAC,EAAiB;YACrC,OAAO,CACL,8BACE,KAAC,KAAK,IAAC,IAAI,EAAE,CAAC,GAAI,EAClB,KAAC,KAAK,IAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,GAAI,IACpE,CACJ,CAAA;QACH,CAAC;QACD,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CACzB,KAAC,IAAI,IAAC,OAAO,EAAE,OAAO,YACpB,KAAC,SAAS,IAAC,CAAC,EAAE,CAAC,GAAI,GACd,CACR,CAAA;QACD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACvC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,CAAA;QAClE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAA;QACxC,QAAQ,CACN,KAAC,IAAI,IAAC,OAAO,EAAE,OAAO,YACpB,KAAC,SAAS,IAAC,CAAC,EAAE,CAAC,GAAI,GACd,CACR,CAAA;QACD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAA;QACxC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,yCAAyC;QACzC,MAAM,CACJ,KAAC,IAAI,IAAC,OAAO,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,YAC7C,KAAC,KAAK,KAAG,GACJ,CACR,CAAA;QACD,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACnC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,CAAA;QAClE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/ui/inline-fit.d.ts

@@ -0,0 +1,77 @@
+import { type CSSProperties, type ReactNode } from "react";
+import { type FitMeasure } from "./inline-fit-registry.js";
+export { CONTINUES_ATTRIBUTE, DOM_MEASURE, FIT_CONTINUES_ROW, type FitMeasure, } from "./inline-fit-registry.js";
+/**
+ * The measured inline fit (#396): an inline view is a card in a chat, and a
+ * card taller than the host's height budget turns into one scroll box. So
+ * inline, every list of the view shows only as many rows as fit, measured on
+ * the rendered view: its real chrome and its real rows (a two-line row with a
+ * name and an id is not a one-line row, and a view's header, filters and
+ * footer differ per view). The rest is one "Show all" away (fullscreen, or
+ * the next rows in place where the host offers no fullscreen).
+ *
+ * - The fit runs before the first paint (each list's layout effect), so the
+ *   host's first size report already has the fitted height; a footer that
+ *   appears because of a cap ("3 of 160") is absorbed by the next pass.
+ * - Within an EPOCH (the budget, the frame's width, inline vs. fullscreen) a
+ *   cap only shrinks; a new epoch starts every list at {@link START_ROWS}
+ *   again. Without a stated budget the view is fitted to
+ *   {@link UNSTATED_BUDGET} and never capped.
+ * - Until the user first touches the view (pointer or key), content that
+ *   grows late (a font swap, a diagram, an error line) refits; after that,
+ *   only a list's own placement does (mounted, shown from a hidden tab, a new
+ *   search or filter), so rows never vanish under the pointer.
+ * - Revealing rows in place freezes a list until its search or filter
+ *   changes.
+ *
+ * Outside a host (unit renders, fixtures) and in fullscreen there is no fit:
+ * every row shows.
+ */
+/** Rows a list starts with in an epoch, before the fit takes some away. */
+export declare const START_ROWS = 10;
+/** The height an inline view is fitted to when the host states no budget. */
+export declare const UNSTATED_BUDGET = 600;
+/**
+ * The view's document box with its fit: `HostDocument` renders the view in
+ * it in every display mode (the tree never changes with the mode; only
+ * `active` and the style do). `data-inline-fit` on the box says whether the
+ * last fit made the view fit ("fits") or not ("overflow": it then scrolls
+ * inside the budget).
+ */
+export declare function InlineFitBox({ active, budget, style, measure, children, }: {
+    /** Inline under a host: fit. Fullscreen/PiP: every row. */
+    active: boolean;
+    /** The host's height budget in px, {@link UNSTATED_BUDGET} when it states none. */
+    budget: number;
+    style?: CSSProperties;
+    measure?: FitMeasure;
+    children: ReactNode;
+}): import("react").JSX.Element;
+/** One list's rows in the fit: how many it shows, and how its rows are found. */
+export interface InlineRows {
+    /** Rows the list shows; null = every row (no fit: fullscreen, no host, or not fitted). */
+    cap: number | null;
+    /** Rows the fit leaves the list: the step "Show more" reveals in place. */
+    step: number;
+    /** The element whose children are the rows (a `<tbody>`, an `<ol>`). */
+    attachRows: (element: HTMLElement | null) => void;
+    /** The paged list's wrapper: the rows when no table inside names its body. */
+    attachFallback: (element: HTMLElement | null) => void;
+    /** Shows `rows` more in place and keeps them until the search or filter changes. */
+    reveal: (rows: number) => void;
+}
+/** A list outside the fit: every row, nothing to register. */
+export declare const NO_FIT_ROWS: InlineRows;
+/**
+ * Registers a list with the view's fit. `available` is how many rows it has
+ * (loaded); `resetKey` names its search or filter (a new one drops the rows
+ * revealed in place and refits the list's placement). `enabled: false` (a
+ * table inside a paged list, which fits as one) registers nothing.
+ */
+export declare function useInlineRows(available: number, { resetKey, contentKey, enabled, }?: {
+    resetKey?: string;
+    /** Changes when the rows' content changes (a page landed): the list refits. */
+    contentKey?: unknown;
+    enabled?: boolean;
+}): InlineRows;
+//# sourceMappingURL=inline-fit.d.ts.map

package/dist/ui/inline-fit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inline-fit.d.ts","sourceRoot":"","sources":["../../src/ui/inline-fit.tsx"],"names":[],"mappings":"AAAA,OAAO,EAWL,KAAK,aAAa,EAClB,KAAK,SAAS,EACf,MAAM,OAAO,CAAA;AAEd,OAAO,EAA4C,KAAK,UAAU,EAAE,MAAM,0BAA0B,CAAA;AAEpG,OAAO,EACL,mBAAmB,EACnB,WAAW,EACX,iBAAiB,EACjB,KAAK,UAAU,GAChB,MAAM,0BAA0B,CAAA;AAEjC;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,2EAA2E;AAC3E,eAAO,MAAM,UAAU,KAAK,CAAA;AAC5B,6EAA6E;AAC7E,eAAO,MAAM,eAAe,MAAM,CAAA;AAmDlC;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,EAC3B,MAAM,EACN,MAAM,EACN,KAAK,EACL,OAAqB,EACrB,QAAQ,GACT,EAAE;IACD,2DAA2D;IAC3D,MAAM,EAAE,OAAO,CAAA;IACf,mFAAmF;IACnF,MAAM,EAAE,MAAM,CAAA;IACd,KAAK,CAAC,EAAE,aAAa,CAAA;IACrB,OAAO,CAAC,EAAE,UAAU,CAAA;IACpB,QAAQ,EAAE,SAAS,CAAA;CACpB,+BAmHA;AA0BD,iFAAiF;AACjF,MAAM,WAAW,UAAU;IACzB,0FAA0F;IAC1F,GAAG,EAAE,MAAM,GAAG,IAAI,CAAA;IAClB,2EAA2E;IAC3E,IAAI,EAAE,MAAM,CAAA;IACZ,wEAAwE;IACxE,UAAU,EAAE,CAAC,OAAO,EAAE,WAAW,GAAG,IAAI,KAAK,IAAI,CAAA;IACjD,8EAA8E;IAC9E,cAAc,EAAE,CAAC,OAAO,EAAE,WAAW,GAAG,IAAI,KAAK,IAAI,CAAA;IACrD,oFAAoF;IACpF,MAAM,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,CAAA;CAC/B;AAED,8DAA8D;AAC9D,eAAO,MAAM,WAAW,EAAE,UAMzB,CAAA;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EACjB,EACE,QAAa,EACb,UAAU,EACV,OAAc,GACf,GAAE;IACD,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,+EAA+E;IAC/E,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB,OAAO,CAAC,EAAE,OAAO,CAAA;CACb,GACL,UAAU,CAuCZ"}