@variance-authority/tribunal 0.1.0

package/dist/ui/distance.d.ts

@@ -0,0 +1,154 @@
+/**
+ * How far a component is from the edit, in the graph the diff already walked.
+ *
+ * A page that lists what moved beside a change has answered *what else* and left
+ * the question a reviewer asks next. `Card` moved in its layout beside `Button`:
+ * is that the card the button is nailed into, or a card on the other side of the
+ * app that happens to share a token? The first is arithmetic. The second is the
+ * finding — an edit whose consequence arrives somewhere with no import path to
+ * it has either found a global, or found a bug.
+ *
+ * Nothing new is measured for this. `ReachedComponent.trail` is the shortest
+ * chain from a file the commit changed to the component, every step a path but
+ * the last, so the file a component is declared in is the step before its name
+ * and the hops between two components are an index arithmetic away. Where the
+ * traversal never arrived, the docket's own causes still carry a file, and a
+ * name with a file beside it is placed even when it is not reached.
+ *
+ * ## What it will not say
+ *
+ * Nothing about the DOM. Two components can be siblings in a render and unrelated
+ * in the module graph, and the reverse — a layout that imports a button it never
+ * renders. This answers *how the edit could have got there*, which is the
+ * question a reviewer holding a diff is in a position to act on; where the boxes
+ * sit relative to each other is the picture's job.
+ *
+ * `unknown` is a state and not a zero. A run with no diff has no graph, and a
+ * surface that drew every distance as *unrelated* would turn a missing input into
+ * a page full of alarms.
+ */
+import type { BuildDetail } from '../review-types.js';
+export type Distance = 
+/** Declared in the same file the change is. */
+{
+    readonly kind: 'same-file';
+}
+/** Reached through the change's file: it imports the change, `hops` files out. */
+ | {
+    readonly kind: 'importer';
+    readonly hops: number;
+}
+/** The change is reached through this one's file, `hops` files out. */
+ | {
+    readonly kind: 'imported';
+    readonly hops: number;
+}
+/** The commit reaches it, by a chain that does not pass the change at all. */
+ | {
+    readonly kind: 'apart';
+}
+/**
+ * Off the traversal, but the build knows where it is declared.
+ *
+ * The interesting half of what used to be one negative. A component the walk
+ * never arrived at is not thereby unplaced: the report's own causes carry the
+ * file most of them are declared in, and *`ui/card.tsx`, which this commit did
+ * not change* is a location a reviewer can act on where *not reached* is a
+ * shrug.
+ */
+ | {
+    readonly kind: 'declared';
+    readonly file: string;
+    readonly edited: boolean;
+}
+/** Nothing in the commit reaches it and no record says where it lives. */
+ | {
+    readonly kind: 'unreached';
+}
+/** No diff was read, so there is no graph to measure in. */
+ | {
+    readonly kind: 'unknown';
+};
+/** Distance from one fixed component to any other, over one build's reach. */
+export type Ruler = (component: string) => Distance;
+export declare function distanceFrom(build: BuildDetail, component: string): Ruler;
+/**
+ * Whether the records put this component anywhere at all relative to the change.
+ *
+ * The distinction a row has to draw before it prints anything. A page that gave
+ * every unplaced component the same chip printed *the diff does not name it* nine
+ * times down one list — a column constant over every row, costing nine lines to
+ * say one thing, and saying it as though it were a property of each component
+ * rather than of the graph. Unplaced rows carry no chip; the list says once, at
+ * its foot, that it could not place them.
+ */
+export declare function placed(distance: Distance): boolean;
+/**
+ * The distance in words, or nothing when there is nothing to say.
+ *
+ * `unknown` returns nothing rather than a sentence about the run: a reviewer
+ * reading a list of components does not need each row to repeat that this build
+ * carried no diff, and the page says it once elsewhere.
+ */
+export declare function howFar(distance: Distance): string | undefined;
+/** One rung of the blast radius: components this many imports from an edited file. */
+export interface Depth {
+    /** Imports between a file the commit changed and this component's file. */
+    readonly depth: number;
+    /** Components the commit reaches at this depth. */
+    readonly reached: number;
+    /** How many of them this build recorded as moving. */
+    readonly moved: number;
+}
+/**
+ * A component that moved and that no file in this commit declares.
+ *
+ * The subjects come with it because they are what makes the *why* answerable.
+ * The census that knows which components enclose this one knows it over the
+ * whole suite, so an unconstrained walk out of `CardFooter` arrives at the cart
+ * as readily as at the product page. Held to the subjects it actually moved in,
+ * it arrives at the one the commit changed. [`holding.ts`](./holding.js) does
+ * that walk.
+ */
+export interface Unplaced {
+    readonly component: string;
+    /** Subjects this build recorded it moving in, in report order. */
+    readonly subjects: readonly string[];
+}
+export interface Spread {
+    readonly rungs: readonly Depth[];
+    /**
+     * Components that moved and that no file in this commit declares.
+     *
+     * The histogram cannot hold these and must not be read as if it had: every
+     * rung is *distance from an edited file*, and a component the traversal never
+     * arrived at has no distance. Left out silently, a build whose loudest movement
+     * is entirely off the graph reads as a build that stayed inside its own diff —
+     * which is the reassurance this surface exists to withhold.
+     */
+    readonly undeclared: readonly Unplaced[];
+    /**
+     * Components reached only through a file the scan could not read.
+     *
+     * Kept out of the rungs and counted, because their depth is measured from the
+     * blind spot rather than from the edit — a histogram that folded them in would
+     * put the scanner's own gaps on the same axis as the commit's consequences.
+     */
+    readonly throughUnread: number;
+}
+/**
+ * The impact-depth histogram: how far out the commit's consequences landed.
+ *
+ * Depth 0 is a component declared in a file the diff names, and everything above
+ * it is collateral in the only sense that can be measured without guessing — the
+ * edit is N imports away from the thing that moved. A commit whose movement is
+ * all at depth 0 did what it said. One with eleven components moving at depth 3
+ * changed something shared, and that is worth knowing before opening the first
+ * change rather than after opening the eleventh.
+ *
+ * `moved` is read from the hashes first and the regions second, because those are
+ * the two records that make the claim, and a component that only appears as a
+ * region lead is still a component this build says moved.
+ */
+export declare function spreadOf(build: BuildDetail): Spread | null;
+//# sourceMappingURL=distance.d.ts.map

package/dist/ui/distance.js

@@ -0,0 +1,180 @@
+/**
+ * How far a component is from the edit, in the graph the diff already walked.
+ *
+ * A page that lists what moved beside a change has answered *what else* and left
+ * the question a reviewer asks next. `Card` moved in its layout beside `Button`:
+ * is that the card the button is nailed into, or a card on the other side of the
+ * app that happens to share a token? The first is arithmetic. The second is the
+ * finding — an edit whose consequence arrives somewhere with no import path to
+ * it has either found a global, or found a bug.
+ *
+ * Nothing new is measured for this. `ReachedComponent.trail` is the shortest
+ * chain from a file the commit changed to the component, every step a path but
+ * the last, so the file a component is declared in is the step before its name
+ * and the hops between two components are an index arithmetic away. Where the
+ * traversal never arrived, the docket's own causes still carry a file, and a
+ * name with a file beside it is placed even when it is not reached.
+ *
+ * ## What it will not say
+ *
+ * Nothing about the DOM. Two components can be siblings in a render and unrelated
+ * in the module graph, and the reverse — a layout that imports a button it never
+ * renders. This answers *how the edit could have got there*, which is the
+ * question a reviewer holding a diff is in a position to act on; where the boxes
+ * sit relative to each other is the picture's job.
+ *
+ * `unknown` is a state and not a zero. A run with no diff has no graph, and a
+ * surface that drew every distance as *unrelated* would turn a missing input into
+ * a page full of alarms.
+ */
+/** The path out of a cause's `file`, which carries the declaring line after it. */
+function pathOf(file) {
+    return file.replace(/:\d+(?::\d+)?$/, '');
+}
+export function distanceFrom(build, component) {
+    const reach = build.reach !== null && build.reach.whole === undefined ? build.reach : null;
+    if (reach === null)
+        return () => ({ kind: 'unknown' });
+    const trails = new Map(reach.components.map((each) => [each.component, each.trail]));
+    const declared = new Map(build.causes.flatMap((cause) => cause.file === undefined ? [] : [[cause.component, pathOf(cause.file)]]));
+    const edited = new Set(reach.changed);
+    // The traversal first, the docket second. A trail is a path *and* a distance;
+    // a cause's file is only a place, and it is what there is when the walk never
+    // arrived.
+    const fileOf = (name) => trails.get(name)?.at(-2) ?? declared.get(name);
+    const home = trails.get(component);
+    const homeFile = fileOf(component);
+    return (other) => {
+        const file = fileOf(other);
+        if (file !== undefined && file === homeFile)
+            return { kind: 'same-file' };
+        const trail = trails.get(other);
+        if (trail === undefined) {
+            return file === undefined
+                ? { kind: 'unreached' }
+                : { kind: 'declared', file, edited: edited.has(file) };
+        }
+        if (home === undefined || homeFile === undefined)
+            return { kind: 'apart' };
+        const through = trail.indexOf(homeFile);
+        if (through >= 0)
+            return { kind: 'importer', hops: trail.length - 2 - through };
+        const under = file === undefined ? -1 : home.indexOf(file);
+        if (under >= 0)
+            return { kind: 'imported', hops: home.length - 2 - under };
+        return { kind: 'apart' };
+    };
+}
+/**
+ * Whether the records put this component anywhere at all relative to the change.
+ *
+ * The distinction a row has to draw before it prints anything. A page that gave
+ * every unplaced component the same chip printed *the diff does not name it* nine
+ * times down one list — a column constant over every row, costing nine lines to
+ * say one thing, and saying it as though it were a property of each component
+ * rather than of the graph. Unplaced rows carry no chip; the list says once, at
+ * its foot, that it could not place them.
+ */
+export function placed(distance) {
+    return distance.kind !== 'unreached' && distance.kind !== 'unknown';
+}
+/**
+ * The distance in words, or nothing when there is nothing to say.
+ *
+ * `unknown` returns nothing rather than a sentence about the run: a reviewer
+ * reading a list of components does not need each row to repeat that this build
+ * carried no diff, and the page says it once elsewhere.
+ */
+export function howFar(distance) {
+    switch (distance.kind) {
+        case 'same-file':
+            return 'same file';
+        case 'importer':
+            return distance.hops === 1 ? 'imports it' : `imports it, ${String(distance.hops)} files out`;
+        case 'imported':
+            return distance.hops === 1
+                ? 'imported by it'
+                : `imported by it, ${String(distance.hops)} files out`;
+        case 'apart':
+            return 'reached by a separate path';
+        case 'declared':
+            return distance.edited
+                ? `${basename(distance.file)}, which this commit changed`
+                : `${basename(distance.file)}, untouched by this commit`;
+        case 'unreached':
+        case 'unknown':
+            return undefined;
+    }
+}
+/** The last segment, because a row has no width for `app/src/components/ui/`. */
+function basename(file) {
+    return file.slice(file.lastIndexOf('/') + 1);
+}
+/**
+ * The impact-depth histogram: how far out the commit's consequences landed.
+ *
+ * Depth 0 is a component declared in a file the diff names, and everything above
+ * it is collateral in the only sense that can be measured without guessing — the
+ * edit is N imports away from the thing that moved. A commit whose movement is
+ * all at depth 0 did what it said. One with eleven components moving at depth 3
+ * changed something shared, and that is worth knowing before opening the first
+ * change rather than after opening the eleventh.
+ *
+ * `moved` is read from the hashes first and the regions second, because those are
+ * the two records that make the claim, and a component that only appears as a
+ * region lead is still a component this build says moved.
+ */
+export function spreadOf(build) {
+    const reach = build.reach !== null && build.reach.whole === undefined ? build.reach : null;
+    if (reach === null)
+        return null;
+    // Where, and not only whether. The name alone answers the histogram's question;
+    // the subjects are what a walk up the composition has to be held to.
+    const moved = new Map();
+    const note = (component, subject) => {
+        const where = moved.get(component);
+        if (where === undefined)
+            moved.set(component, [subject]);
+        else if (!where.includes(subject))
+            where.push(subject);
+    };
+    for (const subject of build.subjects) {
+        if (subject.verdict !== 'changed')
+            continue;
+        for (const entry of subject.moved ?? []) {
+            if (entry.cause)
+                note(entry.component, subject.subject);
+        }
+        for (const region of subject.regions) {
+            if (region.cause === true && region.component !== undefined) {
+                note(region.component, subject.subject);
+            }
+        }
+    }
+    const rungs = new Map();
+    let throughUnread = 0;
+    for (const each of reach.components) {
+        if (each.throughUnread !== undefined) {
+            throughUnread += 1;
+            continue;
+        }
+        const depth = Math.max(each.trail.length - 2, 0);
+        const rung = rungs.get(depth) ?? { reached: 0, moved: 0 };
+        rung.reached += 1;
+        if (moved.has(each.component))
+            rung.moved += 1;
+        rungs.set(depth, rung);
+    }
+    const named = new Set(reach.components.map((each) => each.component));
+    return {
+        rungs: [...rungs.entries()]
+            .map(([depth, rung]) => ({ depth, ...rung }))
+            .sort((left, right) => left.depth - right.depth),
+        undeclared: [...moved]
+            .filter(([component]) => !named.has(component))
+            .map(([component, subjects]) => ({ component, subjects }))
+            .sort((left, right) => left.component.localeCompare(right.component)),
+        throughUnread,
+    };
+}
+//# sourceMappingURL=distance.js.map

package/dist/ui/distance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"distance.js","sourceRoot":"","sources":["../../src/ui/distance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AA+BH,mFAAmF;AACnF,SAAS,MAAM,CAAC,IAAY;IAC1B,OAAO,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;AAC5C,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,KAAkB,EAAE,SAAiB;IAChE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3F,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;IAEvD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACrF,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7B,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAU,CAAC,CACjF,CACF,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAEtC,8EAA8E;IAC9E,8EAA8E;IAC9E,WAAW;IACX,MAAM,MAAM,GAAG,CAAC,IAAY,EAAsB,EAAE,CAClD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAEjD,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;IAEnC,OAAO,CAAC,KAAK,EAAE,EAAE;QACf,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAE1E,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,IAAI,KAAK,SAAS;gBACvB,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE;gBACvB,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3D,CAAC;QACD,IAAI,IAAI,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAE3E,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAI,OAAO,IAAI,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC;QAEhF,MAAM,KAAK,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC;QAE3E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC3B,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,MAAM,CAAC,QAAkB;IACvC,OAAO,QAAQ,CAAC,IAAI,KAAK,WAAW,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,CAAC;AACtE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAAC,QAAkB;IACvC,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,WAAW;YACd,OAAO,WAAW,CAAC;QACrB,KAAK,UAAU;YACb,OAAO,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,eAAe,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC;QAC/F,KAAK,UAAU;YACb,OAAO,QAAQ,CAAC,IAAI,KAAK,CAAC;gBACxB,CAAC,CAAC,gBAAgB;gBAClB,CAAC,CAAC,mBAAmB,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC;QAC3D,KAAK,OAAO;YACV,OAAO,4BAA4B,CAAC;QACtC,KAAK,UAAU;YACb,OAAO,QAAQ,CAAC,MAAM;gBACpB,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,6BAA6B;gBACzD,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,4BAA4B,CAAC;QAC7D,KAAK,WAAW,CAAC;QACjB,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,iFAAiF;AACjF,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC/C,CAAC;AAkDD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAkB;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3F,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAEhC,gFAAgF;IAChF,qEAAqE;IACrE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,SAAiB,EAAE,OAAe,EAAQ,EAAE;QACxD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,SAAS;YAAE,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;aACpD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzD,CAAC,CAAC;IAEF,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrC,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS;YAAE,SAAS;QAC5C,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;QAC1D,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACrC,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5D,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAA8C,CAAC;IACpE,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;YACrC,aAAa,IAAI,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC1D,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;QAClB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAC/C,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAEtE,OAAO;QACL,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;aACxB,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;aAC5C,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAClD,UAAU,EAAE,CAAC,GAAG,KAAK,CAAC;aACnB,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;aAC9C,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC;aACzD,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACvE,aAAa;KACd,CAAC;AACJ,CAAC","sourcesContent":["/**\n * How far a component is from the edit, in the graph the diff already walked.\n *\n * A page that lists what moved beside a change has answered *what else* and left\n * the question a reviewer asks next. `Card` moved in its layout beside `Button`:\n * is that the card the button is nailed into, or a card on the other side of the\n * app that happens to share a token? The first is arithmetic. The second is the\n * finding — an edit whose consequence arrives somewhere with no import path to\n * it has either found a global, or found a bug.\n *\n * Nothing new is measured for this. `ReachedComponent.trail` is the shortest\n * chain from a file the commit changed to the component, every step a path but\n * the last, so the file a component is declared in is the step before its name\n * and the hops between two components are an index arithmetic away. Where the\n * traversal never arrived, the docket's own causes still carry a file, and a\n * name with a file beside it is placed even when it is not reached.\n *\n * ## What it will not say\n *\n * Nothing about the DOM. Two components can be siblings in a render and unrelated\n * in the module graph, and the reverse — a layout that imports a button it never\n * renders. This answers *how the edit could have got there*, which is the\n * question a reviewer holding a diff is in a position to act on; where the boxes\n * sit relative to each other is the picture's job.\n *\n * `unknown` is a state and not a zero. A run with no diff has no graph, and a\n * surface that drew every distance as *unrelated* would turn a missing input into\n * a page full of alarms.\n */\n\nimport type { BuildDetail } from '../review-types.js';\n\nexport type Distance =\n  /** Declared in the same file the change is. */\n  | { readonly kind: 'same-file' }\n  /** Reached through the change's file: it imports the change, `hops` files out. */\n  | { readonly kind: 'importer'; readonly hops: number }\n  /** The change is reached through this one's file, `hops` files out. */\n  | { readonly kind: 'imported'; readonly hops: number }\n  /** The commit reaches it, by a chain that does not pass the change at all. */\n  | { readonly kind: 'apart' }\n  /**\n   * Off the traversal, but the build knows where it is declared.\n   *\n   * The interesting half of what used to be one negative. A component the walk\n   * never arrived at is not thereby unplaced: the report's own causes carry the\n   * file most of them are declared in, and *`ui/card.tsx`, which this commit did\n   * not change* is a location a reviewer can act on where *not reached* is a\n   * shrug.\n   */\n  | { readonly kind: 'declared'; readonly file: string; readonly edited: boolean }\n  /** Nothing in the commit reaches it and no record says where it lives. */\n  | { readonly kind: 'unreached' }\n  /** No diff was read, so there is no graph to measure in. */\n  | { readonly kind: 'unknown' };\n\n/** Distance from one fixed component to any other, over one build's reach. */\nexport type Ruler = (component: string) => Distance;\n\n/** The path out of a cause's `file`, which carries the declaring line after it. */\nfunction pathOf(file: string): string {\n  return file.replace(/:\\d+(?::\\d+)?$/, '');\n}\n\nexport function distanceFrom(build: BuildDetail, component: string): Ruler {\n  const reach = build.reach !== null && build.reach.whole === undefined ? build.reach : null;\n  if (reach === null) return () => ({ kind: 'unknown' });\n\n  const trails = new Map(reach.components.map((each) => [each.component, each.trail]));\n  const declared = new Map(\n    build.causes.flatMap((cause) =>\n      cause.file === undefined ? [] : [[cause.component, pathOf(cause.file)] as const],\n    ),\n  );\n  const edited = new Set(reach.changed);\n\n  // The traversal first, the docket second. A trail is a path *and* a distance;\n  // a cause's file is only a place, and it is what there is when the walk never\n  // arrived.\n  const fileOf = (name: string): string | undefined =>\n    trails.get(name)?.at(-2) ?? declared.get(name);\n\n  const home = trails.get(component);\n  const homeFile = fileOf(component);\n\n  return (other) => {\n    const file = fileOf(other);\n    if (file !== undefined && file === homeFile) return { kind: 'same-file' };\n\n    const trail = trails.get(other);\n    if (trail === undefined) {\n      return file === undefined\n        ? { kind: 'unreached' }\n        : { kind: 'declared', file, edited: edited.has(file) };\n    }\n    if (home === undefined || homeFile === undefined) return { kind: 'apart' };\n\n    const through = trail.indexOf(homeFile);\n    if (through >= 0) return { kind: 'importer', hops: trail.length - 2 - through };\n\n    const under = file === undefined ? -1 : home.indexOf(file);\n    if (under >= 0) return { kind: 'imported', hops: home.length - 2 - under };\n\n    return { kind: 'apart' };\n  };\n}\n\n/**\n * Whether the records put this component anywhere at all relative to the change.\n *\n * The distinction a row has to draw before it prints anything. A page that gave\n * every unplaced component the same chip printed *the diff does not name it* nine\n * times down one list — a column constant over every row, costing nine lines to\n * say one thing, and saying it as though it were a property of each component\n * rather than of the graph. Unplaced rows carry no chip; the list says once, at\n * its foot, that it could not place them.\n */\nexport function placed(distance: Distance): boolean {\n  return distance.kind !== 'unreached' && distance.kind !== 'unknown';\n}\n\n/**\n * The distance in words, or nothing when there is nothing to say.\n *\n * `unknown` returns nothing rather than a sentence about the run: a reviewer\n * reading a list of components does not need each row to repeat that this build\n * carried no diff, and the page says it once elsewhere.\n */\nexport function howFar(distance: Distance): string | undefined {\n  switch (distance.kind) {\n    case 'same-file':\n      return 'same file';\n    case 'importer':\n      return distance.hops === 1 ? 'imports it' : `imports it, ${String(distance.hops)} files out`;\n    case 'imported':\n      return distance.hops === 1\n        ? 'imported by it'\n        : `imported by it, ${String(distance.hops)} files out`;\n    case 'apart':\n      return 'reached by a separate path';\n    case 'declared':\n      return distance.edited\n        ? `${basename(distance.file)}, which this commit changed`\n        : `${basename(distance.file)}, untouched by this commit`;\n    case 'unreached':\n    case 'unknown':\n      return undefined;\n  }\n}\n\n/** The last segment, because a row has no width for `app/src/components/ui/`. */\nfunction basename(file: string): string {\n  return file.slice(file.lastIndexOf('/') + 1);\n}\n\n/** One rung of the blast radius: components this many imports from an edited file. */\nexport interface Depth {\n  /** Imports between a file the commit changed and this component's file. */\n  readonly depth: number;\n  /** Components the commit reaches at this depth. */\n  readonly reached: number;\n  /** How many of them this build recorded as moving. */\n  readonly moved: number;\n}\n\n/**\n * A component that moved and that no file in this commit declares.\n *\n * The subjects come with it because they are what makes the *why* answerable.\n * The census that knows which components enclose this one knows it over the\n * whole suite, so an unconstrained walk out of `CardFooter` arrives at the cart\n * as readily as at the product page. Held to the subjects it actually moved in,\n * it arrives at the one the commit changed. [`holding.ts`](./holding.js) does\n * that walk.\n */\nexport interface Unplaced {\n  readonly component: string;\n  /** Subjects this build recorded it moving in, in report order. */\n  readonly subjects: readonly string[];\n}\n\nexport interface Spread {\n  readonly rungs: readonly Depth[];\n  /**\n   * Components that moved and that no file in this commit declares.\n   *\n   * The histogram cannot hold these and must not be read as if it had: every\n   * rung is *distance from an edited file*, and a component the traversal never\n   * arrived at has no distance. Left out silently, a build whose loudest movement\n   * is entirely off the graph reads as a build that stayed inside its own diff —\n   * which is the reassurance this surface exists to withhold.\n   */\n  readonly undeclared: readonly Unplaced[];\n  /**\n   * Components reached only through a file the scan could not read.\n   *\n   * Kept out of the rungs and counted, because their depth is measured from the\n   * blind spot rather than from the edit — a histogram that folded them in would\n   * put the scanner's own gaps on the same axis as the commit's consequences.\n   */\n  readonly throughUnread: number;\n}\n\n/**\n * The impact-depth histogram: how far out the commit's consequences landed.\n *\n * Depth 0 is a component declared in a file the diff names, and everything above\n * it is collateral in the only sense that can be measured without guessing — the\n * edit is N imports away from the thing that moved. A commit whose movement is\n * all at depth 0 did what it said. One with eleven components moving at depth 3\n * changed something shared, and that is worth knowing before opening the first\n * change rather than after opening the eleventh.\n *\n * `moved` is read from the hashes first and the regions second, because those are\n * the two records that make the claim, and a component that only appears as a\n * region lead is still a component this build says moved.\n */\nexport function spreadOf(build: BuildDetail): Spread | null {\n  const reach = build.reach !== null && build.reach.whole === undefined ? build.reach : null;\n  if (reach === null) return null;\n\n  // Where, and not only whether. The name alone answers the histogram's question;\n  // the subjects are what a walk up the composition has to be held to.\n  const moved = new Map<string, string[]>();\n  const note = (component: string, subject: string): void => {\n    const where = moved.get(component);\n    if (where === undefined) moved.set(component, [subject]);\n    else if (!where.includes(subject)) where.push(subject);\n  };\n\n  for (const subject of build.subjects) {\n    if (subject.verdict !== 'changed') continue;\n    for (const entry of subject.moved ?? []) {\n      if (entry.cause) note(entry.component, subject.subject);\n    }\n    for (const region of subject.regions) {\n      if (region.cause === true && region.component !== undefined) {\n        note(region.component, subject.subject);\n      }\n    }\n  }\n\n  const rungs = new Map<number, { reached: number; moved: number }>();\n  let throughUnread = 0;\n\n  for (const each of reach.components) {\n    if (each.throughUnread !== undefined) {\n      throughUnread += 1;\n      continue;\n    }\n    const depth = Math.max(each.trail.length - 2, 0);\n    const rung = rungs.get(depth) ?? { reached: 0, moved: 0 };\n    rung.reached += 1;\n    if (moved.has(each.component)) rung.moved += 1;\n    rungs.set(depth, rung);\n  }\n\n  const named = new Set(reach.components.map((each) => each.component));\n\n  return {\n    rungs: [...rungs.entries()]\n      .map(([depth, rung]) => ({ depth, ...rung }))\n      .sort((left, right) => left.depth - right.depth),\n    undeclared: [...moved]\n      .filter(([component]) => !named.has(component))\n      .map(([component, subjects]) => ({ component, subjects }))\n      .sort((left, right) => left.component.localeCompare(right.component)),\n    throughUnread,\n  };\n}\n"]}

package/dist/ui/divergence.d.ts

@@ -0,0 +1,40 @@
+/**
+ * This run against the run before it — which is a different question from this
+ * run against its baseline, and the one nobody in the category asks.
+ *
+ * [`shift.ts`](./shift.ts) does the crossing. What is decided here is how it
+ * reads: which states open the section, what each one is worth saying, and how
+ * much of the earlier run travels onto a row.
+ *
+ * ## The decision on the earlier run is part of the finding
+ *
+ * A difference that is identical to build 5's, where build 5 approved it, means
+ * the approval did not reach the baseline. Identical where build 5 rejected it
+ * means it came back. Identical where nobody decided means the docket is a queue
+ * and this is its second delivery. Same shape, three different afternoons — so the
+ * earlier decision is carried onto the row rather than summarised away.
+ *
+ * ## Ranked by what it costs to miss
+ *
+ * Not by how many subjects land in a state. *The same difference again* is
+ * usually the largest group and the least urgent one, and it is not allowed to
+ * open the section and push the two states above it under the fold.
+ */
+import type { ReactElement } from 'react';
+import type { BuildDetail } from '../review-types.js';
+import type { ReviewClient } from './client.js';
+import { type Crossing } from './crossing.js';
+export declare function DivergencePanel({ client, build, }: {
+    readonly client: ReviewClient;
+    readonly build: BuildDetail;
+}): ReactElement | null;
+/**
+ * The crossing as a section, from a reading somebody else paid for.
+ *
+ * Separate from the fetch so the build page can load the previous run once and
+ * spend it on both this and the line under each change.
+ */
+export declare function DivergenceOf({ crossing }: {
+    readonly crossing: Crossing;
+}): ReactElement | null;
+//# sourceMappingURL=divergence.d.ts.map

package/dist/ui/divergence.js

@@ -0,0 +1,176 @@
+import { Fragment as _Fragment, jsx as _jsx, jsxs as _jsxs } from "react/jsx-runtime";
+import { greenBecause } from '@variance-authority/report';
+import { useCrossing } from './crossing.js';
+import { count, number, when } from './text.js';
+/**
+ * The order the states are read in, and what each one is worth saying.
+ *
+ * Ranked by what it costs to miss, not by how many subjects land in it. *The same
+ * difference again* is usually the largest group and the least urgent one: it is
+ * the part of the docket a reviewer can take in one decision, which is exactly why
+ * it is not allowed to open the section and bury the two states above it.
+ */
+const SHIFTS = [
+    {
+        shift: 'differently',
+        title: 'Moved again, and not the same way',
+        tone: 'va-shift-alarm',
+        say: (against) => `These differed in ${against} too, but not in the same way: the difference itself changed between the two runs, so neither reading has settled.`,
+    },
+    {
+        shift: 'unsaid',
+        title: 'Moved again; nothing recorded says whether it is the same',
+        tone: 'va-shift-ask',
+        say: (against) => `Both runs found a difference, and at least one of them localised no shape for it. Nothing here may call these identical to ${against}, or different from it.`,
+    },
+    {
+        shift: 'first',
+        title: 'Moved for the first time',
+        tone: 'va-shift-alarm',
+        say: (against) => `${against} compared these and found nothing. This run found a difference.`,
+    },
+    {
+        shift: 'unmasked',
+        title: 'A rule stopped absorbing these',
+        tone: 'va-shift-alarm',
+        say: (against) => `${against} reported these green because a declaration absorbed their difference, and this run reports one. Either the rule stopped matching, or something moved outside what it covers — and the second is what a mask over a real regression looks like from the outside.`,
+    },
+    {
+        shift: 'absorbed',
+        title: 'A rule now decides these',
+        tone: 'va-shift-ask',
+        say: (against) => `${against} put these in front of a reviewer and this run does not: a declaration in the config now takes their difference. That is the intended effect of writing one, and it is also how a subject leaves review without anybody deciding it.`,
+    },
+    {
+        shift: 'new',
+        title: 'New to this run',
+        tone: 'va-shift-quiet',
+        say: (against) => `${against} had no such subject, so there is nothing to place these against.`,
+    },
+    {
+        shift: 'again',
+        title: 'The same difference, again',
+        tone: 'va-shift-known',
+        say: (against) => `The shape ${against} already carried, unchanged. Deciding it there would have settled it here.`,
+    },
+    {
+        shift: 'settled',
+        title: 'No longer moving',
+        tone: 'va-shift-good',
+        say: (against) => `${against} found a difference in these. This run agrees with the baseline.`,
+    },
+    {
+        shift: 'declared',
+        title: 'Green because a rule says so',
+        tone: 'va-shift-known',
+        say: () => 'Compared, found to differ, and decided by a declaration this config names. Nothing is awaiting review here; what is worth reading is the ledger below, which says what each rule absorbed and what it no longer does.',
+    },
+    {
+        shift: 'unplaced',
+        title: 'The earlier run never compared these',
+        tone: 'va-shift-quiet',
+        say: (against) => `${against} recorded no comparison for them — no baseline, or nothing to compare — so this run's reading stands alone.`,
+    },
+    {
+        shift: 'uncompared',
+        title: 'This run did not compare these',
+        tone: 'va-shift-quiet',
+        say: () => 'No baseline was put beside them here, so nothing about their history applies yet.',
+    },
+    {
+        shift: 'dropped',
+        title: 'Gone since the earlier run',
+        tone: 'va-shift-ask',
+        say: (against) => `${against} carried these and this run does not. The suite lost them.`,
+    },
+];
+/** How many subjects a group names before the rest become a count. */
+const NAMED = 6;
+export function DivergencePanel({ client, build, }) {
+    return _jsx(DivergenceOf, { crossing: useCrossing(client, build) });
+}
+/**
+ * The crossing as a section, from a reading somebody else paid for.
+ *
+ * Separate from the fetch so the build page can load the previous run once and
+ * spend it on both this and the line under each change.
+ */
+export function DivergenceOf({ crossing }) {
+    if (crossing.state === 'loading')
+        return null;
+    if (crossing.state === 'none') {
+        return (_jsxs("section", { className: "va-card", children: [_jsx("h2", { children: "Since the last run" }), _jsx("p", { className: "va-note", children: "There is no earlier run of this project to place this one against. Everything here is being read for the first time." })] }));
+    }
+    if (crossing.state === 'failed') {
+        return (_jsxs("section", { className: "va-card", children: [_jsx("h2", { children: "Since the last run" }), _jsxs("p", { className: "va-failure", children: ["The earlier run could not be read, so nothing on this page says which of these differences you have already seen: ", crossing.why] })] }));
+    }
+    return _jsx(Crossed, { earlier: crossing.earlier, divergence: crossing.divergence });
+}
+function Crossed({ earlier, divergence, }) {
+    const { shifts, held } = divergence;
+    const against = `build ${earlier.build}`;
+    const known = shifts.filter((each) => each.shift === 'again').length;
+    // `unmasked` counts here. A subject the earlier run showed nobody, because a
+    // rule absorbed it, is a subject that run did not show you — and it is the one
+    // the headline is least entitled to leave out.
+    const fresh = shifts.filter((each) => ['differently', 'first', 'new', 'unmasked'].includes(each.shift)).length;
+    return (_jsxs("section", { className: "va-card va-divergence", children: [_jsx("h2", { children: "Since the last run" }), _jsxs("p", { className: "va-subtitle", children: ["Against ", _jsxs("strong", { children: ["build ", earlier.build] }), ' ', _jsx("code", { className: "va-commit", children: earlier.commit.slice(0, 8) }), earlier.branch === undefined ? null : (_jsxs("span", { className: "va-note", children: [" on ", earlier.branch] })), ", ", when(earlier.at), ".", ' ', shifts.length === 0
+                        ? 'Every subject read the same way in both runs.'
+                        : `${fresh === 0
+                            ? 'Nothing here is something that run did not show you'
+                            : `${count(fresh, 'subject')} here ${fresh === 1 ? 'is' : 'are'} something that run did not show you`}; ${count(known, 'subject')} ${known === 1 ? 'carries' : 'carry'} a difference it already had.`] }), SHIFTS.map((group) => {
+                const members = shifts.filter((each) => each.shift === group.shift);
+                if (members.length === 0)
+                    return null;
+                return (_jsxs("div", { className: `va-shift ${group.tone}`, children: [_jsxs("p", { className: "va-shift-head", children: [_jsx("span", { className: "va-shift-title", children: group.title }), _jsx("span", { className: "va-shift-count va-num", children: number(members.length) })] }), _jsx("p", { className: "va-note", children: group.say(against) }), _jsx("ul", { className: "va-shift-list", children: members.slice(0, NAMED).map((each) => (_jsx(ShiftRow, { shifted: each, against: against }, each.subject))) }), members.length > NAMED ? (_jsxs("p", { className: "va-note", children: ["and ", number(members.length - NAMED), " more, in the rail."] })) : null] }, group.shift));
+            }), held === 0 ? null : (_jsxs("p", { className: "va-note va-shift-held", children: [count(held, 'subject'), " read the same in both runs and neither found a difference."] }))] }));
+}
+/**
+ * One subject, and the single fact that places it against the earlier run.
+ *
+ * Which fact that is depends on the state, because the useful number is not the
+ * same one twice: a difference that changed size says so in pixels, and a
+ * difference that arrived identical says what the earlier run decided about it —
+ * which is the whole reason its identity matters.
+ */
+function ShiftRow({ shifted, against, }) {
+    const { now, earlier } = shifted;
+    return (_jsxs("li", { className: "va-shift-row", children: [_jsx("span", { className: "va-shift-subject", children: shifted.subject }), shifted.shift === 'differently' && now !== undefined && earlier !== undefined ? (_jsxs("span", { className: "va-note va-num", children: [number(earlier.changedPixels), " px \u2192 ", number(now.changedPixels), " px"] })) : null, shifted.shift === 'again' ? _jsx(Standing, { earlier: earlier, against: against }) : null, shifted.shift === 'first' && now !== undefined ? (_jsxs("span", { className: "va-note va-num", children: [number(now.changedPixels), " px"] })) : null, shifted.shift === 'unmasked' && now !== undefined ? (_jsxs("span", { className: "va-note va-num", children: [number(now.changedPixels), " px, reported"] })) : null, shifted.shift === 'absorbed' ? _jsx(Absorbing, { now: now, earlier: earlier }) : null] }));
+}
+/**
+ * Which rule took a subject out of review, and what it was worth when it did.
+ *
+ * Both halves are read from the record and neither is invented. Where the build
+ * did not store the per-subject block — an older push, or a service that dropped
+ * it on the way in — the row says the rule is unnamed rather than leaving a
+ * reader to assume the difference was too small to be worth one.
+ */
+function Absorbing({ now, earlier, }) {
+    const green = now === undefined ? undefined : greenBecause(now);
+    const was = earlier === undefined ? null : (_jsxs("span", { className: "va-note va-num", children: [number(earlier.changedPixels), " px before"] }));
+    if (green === undefined || green.kind === 'unsaid') {
+        return (_jsxs(_Fragment, { children: [_jsx("span", { className: "va-note", children: "this build does not record which rule" }), was] }));
+    }
+    if (green.kind === 'relaxed') {
+        return (_jsxs(_Fragment, { children: [_jsxs("span", { className: "va-mark va-ignored", children: [green.rule, " \u00B7 asserted on ", green.level] }), was] }));
+    }
+    if (green.kind === 'absorbed') {
+        return (_jsxs(_Fragment, { children: [_jsx("span", { className: "va-mark va-ignored", children: green.rules.join(', ') }), _jsxs("span", { className: "va-note va-num", children: [number(green.pixels), " px absorbed"] })] }));
+    }
+    return _jsx(_Fragment, { children: was });
+}
+/**
+ * What the earlier run decided about a difference this one is carrying again.
+ *
+ * Undecided is the common case and the one worth a word, because it is the
+ * failure this whole section exists to name: a docket delivered twice to somebody
+ * who read it once.
+ */
+function Standing({ earlier, against, }) {
+    const decision = earlier?.decision;
+    if (decision === undefined || decision === null) {
+        return _jsxs("span", { className: "va-note", children: ["undecided in ", against] });
+    }
+    return (_jsxs("span", { className: decision.decision === 'approved' ? 'va-mark va-approved' : 'va-mark va-rejected', children: [decision.decision, " in ", against, " by ", decision.by] }));
+}
+//# sourceMappingURL=divergence.js.map

package/dist/ui/divergence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"divergence.js","sourceRoot":"","sources":["../../src/ui/divergence.tsx"],"names":[],"mappings":";AAwBA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAG1D,OAAO,EAAE,WAAW,EAAiB,MAAM,eAAe,CAAC;AAE3D,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEhD;;;;;;;GAOG;AACH,MAAM,MAAM,GAKN;IACJ;QACE,KAAK,EAAE,aAAa;QACpB,KAAK,EAAE,mCAAmC;QAC1C,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CACf,qBAAqB,OAAO,oHAAoH;KACnJ;IACD;QACE,KAAK,EAAE,QAAQ;QACf,KAAK,EAAE,2DAA2D;QAClE,IAAI,EAAE,cAAc;QACpB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CACf,8HAA8H,OAAO,yBAAyB;KACjK;IACD;QACE,KAAK,EAAE,OAAO;QACd,KAAK,EAAE,0BAA0B;QACjC,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,OAAO,iEAAiE;KAC9F;IACD;QACE,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,gCAAgC;QACvC,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CACf,GAAG,OAAO,kQAAkQ;KAC/Q;IACD;QACE,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,0BAA0B;QACjC,IAAI,EAAE,cAAc;QACpB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CACf,GAAG,OAAO,sOAAsO;KACnP;IACD;QACE,KAAK,EAAE,KAAK;QACZ,KAAK,EAAE,iBAAiB;QACxB,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,OAAO,mEAAmE;KAChG;IACD;QACE,KAAK,EAAE,OAAO;QACd,KAAK,EAAE,4BAA4B;QACnC,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CACf,aAAa,OAAO,4EAA4E;KACnG;IACD;QACE,KAAK,EAAE,SAAS;QAChB,KAAK,EAAE,kBAAkB;QACzB,IAAI,EAAE,eAAe;QACrB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,OAAO,kEAAkE;KAC/F;IACD;QACE,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,8BAA8B;QACrC,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,GAAG,EAAE,CACR,uNAAuN;KAC1N;IACD;QACE,KAAK,EAAE,UAAU;QACjB,KAAK,EAAE,sCAAsC;QAC7C,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CACf,GAAG,OAAO,6GAA6G;KAC1H;IACD;QACE,KAAK,EAAE,YAAY;QACnB,KAAK,EAAE,gCAAgC;QACvC,IAAI,EAAE,gBAAgB;QACtB,GAAG,EAAE,GAAG,EAAE,CAAC,mFAAmF;KAC/F;IACD;QACE,KAAK,EAAE,SAAS;QAChB,KAAK,EAAE,4BAA4B;QACnC,IAAI,EAAE,cAAc;QACpB,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,OAAO,4DAA4D;KACzF;CACF,CAAC;AAEF,sEAAsE;AACtE,MAAM,KAAK,GAAG,CAAC,CAAC;AAEhB,MAAM,UAAU,eAAe,CAAC,EAC9B,MAAM,EACN,KAAK,GAIN;IACC,OAAO,KAAC,YAAY,IAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,GAAI,CAAC;AAChE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,EAAE,QAAQ,EAAmC;IACxE,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC9C,IAAI,QAAQ,CAAC,KAAK,KAAK,MAAM,EAAE,CAAC;QAC9B,OAAO,CACL,mBAAS,SAAS,EAAC,SAAS,aAC1B,8CAA2B,EAC3B,YAAG,SAAS,EAAC,SAAS,qIAGlB,IACI,CACX,CAAC;IACJ,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QAChC,OAAO,CACL,mBAAS,SAAS,EAAC,SAAS,aAC1B,8CAA2B,EAC3B,aAAG,SAAS,EAAC,YAAY,mIAEC,QAAQ,CAAC,GAAG,IAClC,IACI,CACX,CAAC;IACJ,CAAC;IAED,OAAO,KAAC,OAAO,IAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,GAAI,CAAC;AACjF,CAAC;AAED,SAAS,OAAO,CAAC,EACf,OAAO,EACP,UAAU,GAIX;IACC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,UAAU,CAAC;IACpC,MAAM,OAAO,GAAG,SAAS,OAAO,CAAC,KAAK,EAAE,CAAC;IACzC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,MAAM,CAAC;IACrE,6EAA6E;IAC7E,+EAA+E;IAC/E,+CAA+C;IAC/C,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CACnC,CAAC,aAAa,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CACjE,CAAC,MAAM,CAAC;IAET,OAAO,CACL,mBAAS,SAAS,EAAC,uBAAuB,aACxC,8CAA2B,EAC3B,aAAG,SAAS,EAAC,aAAa,yBAChB,uCAAe,OAAO,CAAC,KAAK,IAAU,EAAC,GAAG,EAClD,eAAM,SAAS,EAAC,WAAW,YAAE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAQ,EAC9D,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACrC,gBAAM,SAAS,EAAC,SAAS,qBAAM,OAAO,CAAC,MAAM,IAAQ,CACtD,QACE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAG,GAAG,EACxB,MAAM,CAAC,MAAM,KAAK,CAAC;wBAClB,CAAC,CAAC,+CAA+C;wBACjD,CAAC,CAAC,GACE,KAAK,KAAK,CAAC;4BACT,CAAC,CAAC,qDAAqD;4BACvD,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,sCACnE,KAAK,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,+BAA+B,IAClG,EAEH,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;gBACpB,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC;gBACpE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;gBACtC,OAAO,CACL,eAAuB,SAAS,EAAE,YAAY,KAAK,CAAC,IAAI,EAAE,aACxD,aAAG,SAAS,EAAC,eAAe,aAC1B,eAAM,SAAS,EAAC,gBAAgB,YAAE,KAAK,CAAC,KAAK,GAAQ,EACrD,eAAM,SAAS,EAAC,uBAAuB,YAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,GAAQ,IACrE,EACJ,YAAG,SAAS,EAAC,SAAS,YAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,GAAK,EAC/C,aAAI,SAAS,EAAC,eAAe,YAC1B,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CACrC,KAAC,QAAQ,IAAoB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,IAA7C,IAAI,CAAC,OAAO,CAAqC,CACjE,CAAC,GACC,EACJ,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CACxB,aAAG,SAAS,EAAC,SAAS,qBACf,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,2BACjC,CACL,CAAC,CAAC,CAAC,IAAI,KAfA,KAAK,CAAC,KAAK,CAgBf,CACP,CAAC;YACJ,CAAC,CAAC,EAED,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACnB,aAAG,SAAS,EAAC,uBAAuB,aACjC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,mEACrB,CACL,IACO,CACX,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,QAAQ,CAAC,EAChB,OAAO,EACP,OAAO,GAIR;IACC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;IAEjC,OAAO,CACL,cAAI,SAAS,EAAC,cAAc,aAC1B,eAAM,SAAS,EAAC,kBAAkB,YAAE,OAAO,CAAC,OAAO,GAAQ,EAC1D,OAAO,CAAC,KAAK,KAAK,aAAa,IAAI,GAAG,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAC/E,gBAAM,SAAS,EAAC,gBAAgB,aAC7B,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,iBAAQ,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,WAC1D,CACR,CAAC,CAAC,CAAC,IAAI,EACP,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,KAAC,QAAQ,IAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAI,CAAC,CAAC,CAAC,IAAI,EACnF,OAAO,CAAC,KAAK,KAAK,OAAO,IAAI,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,CAChD,gBAAM,SAAS,EAAC,gBAAgB,aAAE,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,WAAW,CACvE,CAAC,CAAC,CAAC,IAAI,EACP,OAAO,CAAC,KAAK,KAAK,UAAU,IAAI,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,CACnD,gBAAM,SAAS,EAAC,gBAAgB,aAAE,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,qBAAqB,CACjF,CAAC,CAAC,CAAC,IAAI,EACP,OAAO,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,KAAC,SAAS,IAAC,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,GAAI,CAAC,CAAC,CAAC,IAAI,IAC7E,CACN,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,SAAS,CAAC,EACjB,GAAG,EACH,OAAO,GAIR;IACC,MAAM,KAAK,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAChE,MAAM,GAAG,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACzC,gBAAM,SAAS,EAAC,gBAAgB,aAAE,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,kBAAkB,CAClF,CAAC;IAEF,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACnD,OAAO,CACL,8BACE,eAAM,SAAS,EAAC,SAAS,sDAA6C,EACrE,GAAG,IACH,CACJ,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,CACL,8BACE,gBAAM,SAAS,EAAC,oBAAoB,aAAE,KAAK,CAAC,IAAI,0BAAiB,KAAK,CAAC,KAAK,IAAQ,EACnF,GAAG,IACH,CACJ,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC9B,OAAO,CACL,8BACE,eAAM,SAAS,EAAC,oBAAoB,YAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAQ,EACpE,gBAAM,SAAS,EAAC,gBAAgB,aAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,oBAAoB,IACzE,CACJ,CAAC;IACJ,CAAC;IACD,OAAO,4BAAG,GAAG,GAAI,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,EAChB,OAAO,EACP,OAAO,GAIR;IACC,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,CAAC;IACnC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QAChD,OAAO,gBAAM,SAAS,EAAC,SAAS,8BAAe,OAAO,IAAQ,CAAC;IACjE,CAAC;IACD,OAAO,CACL,gBAAM,SAAS,EAAE,QAAQ,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,qBAAqB,aAC9F,QAAQ,CAAC,QAAQ,UAAM,OAAO,UAAM,QAAQ,CAAC,EAAE,IAC3C,CACR,CAAC;AACJ,CAAC","sourcesContent":["/**\n * This run against the run before it — which is a different question from this\n * run against its baseline, and the one nobody in the category asks.\n *\n * [`shift.ts`](./shift.ts) does the crossing. What is decided here is how it\n * reads: which states open the section, what each one is worth saying, and how\n * much of the earlier run travels onto a row.\n *\n * ## The decision on the earlier run is part of the finding\n *\n * A difference that is identical to build 5's, where build 5 approved it, means\n * the approval did not reach the baseline. Identical where build 5 rejected it\n * means it came back. Identical where nobody decided means the docket is a queue\n * and this is its second delivery. Same shape, three different afternoons — so the\n * earlier decision is carried onto the row rather than summarised away.\n *\n * ## Ranked by what it costs to miss\n *\n * Not by how many subjects land in a state. *The same difference again* is\n * usually the largest group and the least urgent one, and it is not allowed to\n * open the section and push the two states above it under the fold.\n */\n\nimport type { ReactElement } from 'react';\nimport { greenBecause } from '@variance-authority/report';\nimport type { BuildDetail, SubjectView } from '../review-types.js';\nimport type { ReviewClient } from './client.js';\nimport { useCrossing, type Crossing } from './crossing.js';\nimport type { Divergence, Shift, Shifted } from './shift.js';\nimport { count, number, when } from './text.js';\n\n/**\n * The order the states are read in, and what each one is worth saying.\n *\n * Ranked by what it costs to miss, not by how many subjects land in it. *The same\n * difference again* is usually the largest group and the least urgent one: it is\n * the part of the docket a reviewer can take in one decision, which is exactly why\n * it is not allowed to open the section and bury the two states above it.\n */\nconst SHIFTS: readonly {\n  readonly shift: Shift;\n  readonly title: string;\n  readonly tone: string;\n  readonly say: (against: string) => string;\n}[] = [\n  {\n    shift: 'differently',\n    title: 'Moved again, and not the same way',\n    tone: 'va-shift-alarm',\n    say: (against) =>\n      `These differed in ${against} too, but not in the same way: the difference itself changed between the two runs, so neither reading has settled.`,\n  },\n  {\n    shift: 'unsaid',\n    title: 'Moved again; nothing recorded says whether it is the same',\n    tone: 'va-shift-ask',\n    say: (against) =>\n      `Both runs found a difference, and at least one of them localised no shape for it. Nothing here may call these identical to ${against}, or different from it.`,\n  },\n  {\n    shift: 'first',\n    title: 'Moved for the first time',\n    tone: 'va-shift-alarm',\n    say: (against) => `${against} compared these and found nothing. This run found a difference.`,\n  },\n  {\n    shift: 'unmasked',\n    title: 'A rule stopped absorbing these',\n    tone: 'va-shift-alarm',\n    say: (against) =>\n      `${against} reported these green because a declaration absorbed their difference, and this run reports one. Either the rule stopped matching, or something moved outside what it covers — and the second is what a mask over a real regression looks like from the outside.`,\n  },\n  {\n    shift: 'absorbed',\n    title: 'A rule now decides these',\n    tone: 'va-shift-ask',\n    say: (against) =>\n      `${against} put these in front of a reviewer and this run does not: a declaration in the config now takes their difference. That is the intended effect of writing one, and it is also how a subject leaves review without anybody deciding it.`,\n  },\n  {\n    shift: 'new',\n    title: 'New to this run',\n    tone: 'va-shift-quiet',\n    say: (against) => `${against} had no such subject, so there is nothing to place these against.`,\n  },\n  {\n    shift: 'again',\n    title: 'The same difference, again',\n    tone: 'va-shift-known',\n    say: (against) =>\n      `The shape ${against} already carried, unchanged. Deciding it there would have settled it here.`,\n  },\n  {\n    shift: 'settled',\n    title: 'No longer moving',\n    tone: 'va-shift-good',\n    say: (against) => `${against} found a difference in these. This run agrees with the baseline.`,\n  },\n  {\n    shift: 'declared',\n    title: 'Green because a rule says so',\n    tone: 'va-shift-known',\n    say: () =>\n      'Compared, found to differ, and decided by a declaration this config names. Nothing is awaiting review here; what is worth reading is the ledger below, which says what each rule absorbed and what it no longer does.',\n  },\n  {\n    shift: 'unplaced',\n    title: 'The earlier run never compared these',\n    tone: 'va-shift-quiet',\n    say: (against) =>\n      `${against} recorded no comparison for them — no baseline, or nothing to compare — so this run's reading stands alone.`,\n  },\n  {\n    shift: 'uncompared',\n    title: 'This run did not compare these',\n    tone: 'va-shift-quiet',\n    say: () => 'No baseline was put beside them here, so nothing about their history applies yet.',\n  },\n  {\n    shift: 'dropped',\n    title: 'Gone since the earlier run',\n    tone: 'va-shift-ask',\n    say: (against) => `${against} carried these and this run does not. The suite lost them.`,\n  },\n];\n\n/** How many subjects a group names before the rest become a count. */\nconst NAMED = 6;\n\nexport function DivergencePanel({\n  client,\n  build,\n}: {\n  readonly client: ReviewClient;\n  readonly build: BuildDetail;\n}): ReactElement | null {\n  return <DivergenceOf crossing={useCrossing(client, build)} />;\n}\n\n/**\n * The crossing as a section, from a reading somebody else paid for.\n *\n * Separate from the fetch so the build page can load the previous run once and\n * spend it on both this and the line under each change.\n */\nexport function DivergenceOf({ crossing }: { readonly crossing: Crossing }): ReactElement | null {\n  if (crossing.state === 'loading') return null;\n  if (crossing.state === 'none') {\n    return (\n      <section className=\"va-card\">\n        <h2>Since the last run</h2>\n        <p className=\"va-note\">\n          There is no earlier run of this project to place this one against. Everything here is\n          being read for the first time.\n        </p>\n      </section>\n    );\n  }\n  if (crossing.state === 'failed') {\n    return (\n      <section className=\"va-card\">\n        <h2>Since the last run</h2>\n        <p className=\"va-failure\">\n          The earlier run could not be read, so nothing on this page says which of these differences\n          you have already seen: {crossing.why}\n        </p>\n      </section>\n    );\n  }\n\n  return <Crossed earlier={crossing.earlier} divergence={crossing.divergence} />;\n}\n\nfunction Crossed({\n  earlier,\n  divergence,\n}: {\n  readonly earlier: BuildDetail;\n  readonly divergence: Divergence;\n}): ReactElement {\n  const { shifts, held } = divergence;\n  const against = `build ${earlier.build}`;\n  const known = shifts.filter((each) => each.shift === 'again').length;\n  // `unmasked` counts here. A subject the earlier run showed nobody, because a\n  // rule absorbed it, is a subject that run did not show you — and it is the one\n  // the headline is least entitled to leave out.\n  const fresh = shifts.filter((each) =>\n    ['differently', 'first', 'new', 'unmasked'].includes(each.shift),\n  ).length;\n\n  return (\n    <section className=\"va-card va-divergence\">\n      <h2>Since the last run</h2>\n      <p className=\"va-subtitle\">\n        Against <strong>build {earlier.build}</strong>{' '}\n        <code className=\"va-commit\">{earlier.commit.slice(0, 8)}</code>\n        {earlier.branch === undefined ? null : (\n          <span className=\"va-note\"> on {earlier.branch}</span>\n        )}\n        , {when(earlier.at)}.{' '}\n        {shifts.length === 0\n          ? 'Every subject read the same way in both runs.'\n          : `${\n              fresh === 0\n                ? 'Nothing here is something that run did not show you'\n                : `${count(fresh, 'subject')} here ${fresh === 1 ? 'is' : 'are'} something that run did not show you`\n            }; ${count(known, 'subject')} ${known === 1 ? 'carries' : 'carry'} a difference it already had.`}\n      </p>\n\n      {SHIFTS.map((group) => {\n        const members = shifts.filter((each) => each.shift === group.shift);\n        if (members.length === 0) return null;\n        return (\n          <div key={group.shift} className={`va-shift ${group.tone}`}>\n            <p className=\"va-shift-head\">\n              <span className=\"va-shift-title\">{group.title}</span>\n              <span className=\"va-shift-count va-num\">{number(members.length)}</span>\n            </p>\n            <p className=\"va-note\">{group.say(against)}</p>\n            <ul className=\"va-shift-list\">\n              {members.slice(0, NAMED).map((each) => (\n                <ShiftRow key={each.subject} shifted={each} against={against} />\n              ))}\n            </ul>\n            {members.length > NAMED ? (\n              <p className=\"va-note\">\n                and {number(members.length - NAMED)} more, in the rail.\n              </p>\n            ) : null}\n          </div>\n        );\n      })}\n\n      {held === 0 ? null : (\n        <p className=\"va-note va-shift-held\">\n          {count(held, 'subject')} read the same in both runs and neither found a difference.\n        </p>\n      )}\n    </section>\n  );\n}\n\n/**\n * One subject, and the single fact that places it against the earlier run.\n *\n * Which fact that is depends on the state, because the useful number is not the\n * same one twice: a difference that changed size says so in pixels, and a\n * difference that arrived identical says what the earlier run decided about it —\n * which is the whole reason its identity matters.\n */\nfunction ShiftRow({\n  shifted,\n  against,\n}: {\n  readonly shifted: Shifted;\n  readonly against: string;\n}): ReactElement {\n  const { now, earlier } = shifted;\n\n  return (\n    <li className=\"va-shift-row\">\n      <span className=\"va-shift-subject\">{shifted.subject}</span>\n      {shifted.shift === 'differently' && now !== undefined && earlier !== undefined ? (\n        <span className=\"va-note va-num\">\n          {number(earlier.changedPixels)} px → {number(now.changedPixels)} px\n        </span>\n      ) : null}\n      {shifted.shift === 'again' ? <Standing earlier={earlier} against={against} /> : null}\n      {shifted.shift === 'first' && now !== undefined ? (\n        <span className=\"va-note va-num\">{number(now.changedPixels)} px</span>\n      ) : null}\n      {shifted.shift === 'unmasked' && now !== undefined ? (\n        <span className=\"va-note va-num\">{number(now.changedPixels)} px, reported</span>\n      ) : null}\n      {shifted.shift === 'absorbed' ? <Absorbing now={now} earlier={earlier} /> : null}\n    </li>\n  );\n}\n\n/**\n * Which rule took a subject out of review, and what it was worth when it did.\n *\n * Both halves are read from the record and neither is invented. Where the build\n * did not store the per-subject block — an older push, or a service that dropped\n * it on the way in — the row says the rule is unnamed rather than leaving a\n * reader to assume the difference was too small to be worth one.\n */\nfunction Absorbing({\n  now,\n  earlier,\n}: {\n  readonly now: SubjectView | undefined;\n  readonly earlier: SubjectView | undefined;\n}): ReactElement {\n  const green = now === undefined ? undefined : greenBecause(now);\n  const was = earlier === undefined ? null : (\n    <span className=\"va-note va-num\">{number(earlier.changedPixels)} px before</span>\n  );\n\n  if (green === undefined || green.kind === 'unsaid') {\n    return (\n      <>\n        <span className=\"va-note\">this build does not record which rule</span>\n        {was}\n      </>\n    );\n  }\n  if (green.kind === 'relaxed') {\n    return (\n      <>\n        <span className=\"va-mark va-ignored\">{green.rule} · asserted on {green.level}</span>\n        {was}\n      </>\n    );\n  }\n  if (green.kind === 'absorbed') {\n    return (\n      <>\n        <span className=\"va-mark va-ignored\">{green.rules.join(', ')}</span>\n        <span className=\"va-note va-num\">{number(green.pixels)} px absorbed</span>\n      </>\n    );\n  }\n  return <>{was}</>;\n}\n\n/**\n * What the earlier run decided about a difference this one is carrying again.\n *\n * Undecided is the common case and the one worth a word, because it is the\n * failure this whole section exists to name: a docket delivered twice to somebody\n * who read it once.\n */\nfunction Standing({\n  earlier,\n  against,\n}: {\n  readonly earlier: SubjectView | undefined;\n  readonly against: string;\n}): ReactElement {\n  const decision = earlier?.decision;\n  if (decision === undefined || decision === null) {\n    return <span className=\"va-note\">undecided in {against}</span>;\n  }\n  return (\n    <span className={decision.decision === 'approved' ? 'va-mark va-approved' : 'va-mark va-rejected'}>\n      {decision.decision} in {against} by {decision.by}\n    </span>\n  );\n}\n"]}