@juxtapose/core 0.4.0 → 0.5.0

package/dist/diff/structural/disambiguate.js

@@ -0,0 +1,89 @@
+// A label is a description, not an identity: a page with two cards has two
+// `div.card`s, and when both change, every reader of the verdict — the JSON,
+// the summary, `describeDeltas` — sees one element. Measured on a dark-mode
+// probe: the two cards' facts merged into one clause that stated
+// `background-color` twice; on a 12-item reorder, seven `span.meta` moves
+// read as one line and six deltas vanished from the human output.
+//
+// So within one verdict, distinct elements get distinct labels. Only labels
+// that actually collide change, and they take the shortest stable
+// distinguisher: the nearest ancestor with a name, id or test id
+// (`span.meta in listitem[name="Item 4"]`), or, when that does not separate
+// them, the element's ordinal among same-labelled elements on its side of the
+// diff (`div.card (2nd)`). Both are properties of the page, not of the diff,
+// so the same change labels the same way on every run.
+import { MAX_LABEL, clip, label } from './label.js';
+export function disambiguate(facts, baseline, current) {
+    const snap = (s) => (s.side === 'baseline' ? baseline : current);
+    const nth = {
+        baseline: undefined,
+        current: undefined,
+    };
+    const nthOf = (s) => (nth[s.side] ??= ordinals(snap(s)))[s.index];
+    const key = (s) => `${s.side}:${s.index}`;
+    const labelOf = (f) => ('el' in f.delta ? f.delta.el : f.delta.after);
+    // label → the distinct elements wearing it, in first-seen (fact) order
+    const byLabel = new Map();
+    for (const f of facts) {
+        const l = labelOf(f);
+        let ids = byLabel.get(l);
+        if (!ids)
+            byLabel.set(l, (ids = new Map()));
+        ids.set(key(f.source), f.source);
+    }
+    const rename = new Map();
+    for (const [l, ids] of byLabel) {
+        if (ids.size < 2)
+            continue;
+        const sources = [...ids.values()];
+        const scoped = sources.map((s) => {
+            const a = labelledAncestor(snap(s), s.index);
+            return a === undefined ? undefined : clip(`${l} in ${a}`, MAX_LABEL);
+        });
+        const distinct = scoped.every((x) => x !== undefined) && new Set(scoped).size === scoped.length;
+        for (const [k, s] of sources.entries()) {
+            const suffix = ` (${ordinal(nthOf(s))})`;
+            rename.set(key(s), distinct ? scoped[k] : clip(l, MAX_LABEL - suffix.length) + suffix);
+        }
+    }
+    if (rename.size === 0)
+        return facts;
+    return facts.map((f) => {
+        const to = rename.get(key(f.source));
+        if (to === undefined)
+            return f;
+        const d = f.delta;
+        return { ...f, delta: 'el' in d ? { ...d, el: to } : { ...d, after: to } };
+    });
+}
+/** Label of the nearest ancestor that names itself (role+name, id, test id);
+ *  a class or a path does not tell two siblings' parents apart. */
+function labelledAncestor(s, index) {
+    for (let p = s.elements[index].parent; p !== null; p = s.elements[p].parent) {
+        const e = s.elements[p];
+        if (e.tag === 'masked')
+            continue;
+        if ((e.role && e.name) || e.id !== undefined || e.testId !== undefined)
+            return label(e);
+    }
+    return undefined;
+}
+/** Each element's 1-based position among its side's elements that carry the
+ *  same label, in document order. One pass per side, not one per element: a
+ *  list of 5,000 identical rows that all changed would otherwise be 25M
+ *  label calls. */
+function ordinals(s) {
+    const seen = new Map();
+    return s.elements.map((e) => {
+        const l = label(e);
+        const n = (seen.get(l) ?? 0) + 1;
+        seen.set(l, n);
+        return n;
+    });
+}
+function ordinal(n) {
+    const teen = n % 100 >= 11 && n % 100 <= 13;
+    const suffix = teen ? 'th' : (['th', 'st', 'nd', 'rd'][n % 10] ?? 'th');
+    return `${n}${suffix}`;
+}
+//# sourceMappingURL=disambiguate.js.map

package/dist/diff/structural/disambiguate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"disambiguate.js","sourceRoot":"","sources":["../../../src/diff/structural/disambiguate.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,6EAA6E;AAC7E,4EAA4E;AAC5E,iEAAiE;AACjE,0EAA0E;AAC1E,kEAAkE;AAClE,EAAE;AACF,4EAA4E;AAC5E,kEAAkE;AAClE,iEAAiE;AACjE,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,uDAAuD;AAIvD,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEpD,MAAM,UAAU,YAAY,CAC1B,KAAa,EACb,QAA2B,EAC3B,OAA0B;IAE1B,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACzE,MAAM,GAAG,GAAG;QACV,QAAQ,EAAE,SAAiC;QAC3C,OAAO,EAAE,SAAiC;KAC3C,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1E,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;IAClD,MAAM,OAAO,GAAG,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAE5E,uEAAuE;IACvE,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QAC5C,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;QAC/B,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS;QAC3B,MAAM,OAAO,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC/B,MAAM,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YAC7C,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;QACH,MAAM,QAAQ,GACZ,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM,CAAC;QACjF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,KAAK,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACzC,MAAM,CAAC,GAAG,CACR,GAAG,CAAC,CAAC,CAAC,EACN,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CACpE,CAAC;QACJ,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEpC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACrC,IAAI,EAAE,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;QAClB,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;IAC7E,CAAC,CAAC,CAAC;AACL,CAAC;AAED;mEACmE;AACnE,SAAS,gBAAgB,CAAC,CAAoB,EAAE,KAAa;IAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,CAAC,GAAG,KAAK,QAAQ;YAAE,SAAS;QACjC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;YACpE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;mBAGmB;AACnB,SAAS,QAAQ,CAAC,CAAoB;IACpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACf,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,IAAI,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;IACxE,OAAO,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC;AACzB,CAAC"}

package/dist/diff/structural/label.d.ts

@@ -0,0 +1,15 @@
+import type { StructureElement } from '../../types.js';
+/** Elements that paint their own pixels: a change inside them leaves the DOM
+ *  and computed styles untouched, so unexplained pixels on one of these mean
+ *  "content", not "drift". */
+export declare const SELF_PAINTING: ReadonlySet<string>;
+/** Longest label in a delta or summary. A deep path or a generated id or
+ *  class must not be able to spend the verdict's 1,500-char budget. */
+export declare const MAX_LABEL = 60;
+export declare function label(el: StructureElement): string;
+/** At most `max` UTF-16 units, ending in `…` when cut, never splitting a
+ *  surrogate pair (half an emoji is invalid UTF-16 in the JSON). */
+export declare function clip(s: string, max: number): string;
+/** Identity with the page-specific part removed, so the same change on two
+ *  pages hashes to the same signature. */
+export declare function abstractLabel(el: StructureElement): string;

package/dist/diff/structural/label.js

@@ -0,0 +1,64 @@
+// Short human labels for elements in deltas and summaries. The budget is
+// ~1,500 chars for a whole verdict, so a label is the shortest thing that
+// still tells an agent which element to look at.
+/** Elements that paint their own pixels: a change inside them leaves the DOM
+ *  and computed styles untouched, so unexplained pixels on one of these mean
+ *  "content", not "drift". */
+export const SELF_PAINTING = new Set([
+    'canvas',
+    'video',
+    'img',
+    'iframe',
+    'object',
+    'embed',
+]);
+/** Longest label in a delta or summary. A deep path or a generated id or
+ *  class must not be able to spend the verdict's 1,500-char budget. */
+export const MAX_LABEL = 60;
+export function label(el) {
+    if (el.tag === 'masked')
+        return 'masked';
+    if (el.role && el.name)
+        return clip(`${el.role}[name="${clip(el.name, 40)}"]`, MAX_LABEL);
+    if (el.id !== undefined)
+        return clip(`${el.tag}#${el.id}`, MAX_LABEL);
+    if (el.testId !== undefined)
+        return clip(`${el.tag}[data-testid="${el.testId}"]`, MAX_LABEL);
+    if (el.classes?.length)
+        return clip(`${el.tag}.${el.classes[0]}`, MAX_LABEL);
+    return clipPath(el.path
+        .replace(/^html:nth-of-type\(1\)>body:nth-of-type\(1\)>/, '')
+        .replace(/:nth-of-type\(1\)/g, ''));
+}
+/** A path keeps its tail — the element itself and its nearest ancestors —
+ *  cut at a `>` boundary, so what remains is still a valid selector suffix. */
+function clipPath(path) {
+    if (path.length <= MAX_LABEL)
+        return path;
+    const parts = path.split('>');
+    let out = parts[parts.length - 1];
+    for (let k = parts.length - 2; k >= 0; k--) {
+        const next = `${parts[k]}>${out}`;
+        if (next.length + 2 > MAX_LABEL)
+            break;
+        out = next;
+    }
+    return `…>${clip(out, MAX_LABEL - 2)}`;
+}
+/** At most `max` UTF-16 units, ending in `…` when cut, never splitting a
+ *  surrogate pair (half an emoji is invalid UTF-16 in the JSON). */
+export function clip(s, max) {
+    if (s.length <= max)
+        return s;
+    let end = max - 1;
+    const c = s.charCodeAt(end - 1);
+    if (c >= 0xd800 && c <= 0xdbff)
+        end--;
+    return s.slice(0, end) + '…';
+}
+/** Identity with the page-specific part removed, so the same change on two
+ *  pages hashes to the same signature. */
+export function abstractLabel(el) {
+    return el.role ?? el.tag;
+}
+//# sourceMappingURL=label.js.map

package/dist/diff/structural/label.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"label.js","sourceRoot":"","sources":["../../../src/diff/structural/label.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,0EAA0E;AAC1E,iDAAiD;AAIjD;;8BAE8B;AAC9B,MAAM,CAAC,MAAM,aAAa,GAAwB,IAAI,GAAG,CAAC;IACxD,QAAQ;IACR,OAAO;IACP,KAAK;IACL,QAAQ;IACR,QAAQ;IACR,OAAO;CACR,CAAC,CAAC;AAEH;uEACuE;AACvE,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC;AAE5B,MAAM,UAAU,KAAK,CAAC,EAAoB;IACxC,IAAI,EAAE,CAAC,GAAG,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IACzC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI;QACpB,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACpE,IAAI,EAAE,CAAC,EAAE,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IACtE,IAAI,EAAE,CAAC,MAAM,KAAK,SAAS;QACzB,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,MAAM,IAAI,EAAE,SAAS,CAAC,CAAC;IAClE,IAAI,EAAE,CAAC,OAAO,EAAE,MAAM;QAAE,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IAC7E,OAAO,QAAQ,CACb,EAAE,CAAC,IAAI;SACJ,OAAO,CAAC,+CAA+C,EAAE,EAAE,CAAC;SAC5D,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC,CACrC,CAAC;AACJ,CAAC;AAED;+EAC+E;AAC/E,SAAS,QAAQ,CAAC,IAAY;IAC5B,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;QAAE,OAAO,IAAI,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS;YAAE,MAAM;QACvC,GAAG,GAAG,IAAI,CAAC;IACb,CAAC;IACD,OAAO,KAAK,IAAI,CAAC,GAAG,EAAE,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;AACzC,CAAC;AAED;oEACoE;AACpE,MAAM,UAAU,IAAI,CAAC,CAAS,EAAE,GAAW;IACzC,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;IAClB,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM;QAAE,GAAG,EAAE,CAAC;IACtC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC;AAC/B,CAAC;AAED;0CAC0C;AAC1C,MAAM,UAAU,aAAa,CAAC,EAAoB;IAChD,OAAO,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC;AAC3B,CAAC"}

package/dist/diff/structural/match.d.ts

@@ -0,0 +1,13 @@
+import type { StructureElement, StructureSnapshot } from '../../types.js';
+export interface ElementMatch {
+    /** [baseline index, current index], sorted by current index. */
+    pairs: Array<[number, number]>;
+    /** Current indices of unmatched subtree roots, ascending. */
+    added: number[];
+    /** Baseline indices of unmatched subtree roots, ascending. */
+    removed: number[];
+}
+/** What makes an element "the same one" across captures: tag plus the most
+ *  stable identity it carries. Masked stand-ins have only their tag. */
+export declare function identityKey(el: StructureElement): string;
+export declare function matchElements(a: StructureSnapshot, b: StructureSnapshot): ElementMatch;

package/dist/diff/structural/match.js

@@ -0,0 +1,135 @@
+// Which element on the baseline side is which element on the current side.
+//
+// Positional paths alone would report every sibling after an insertion as
+// changed. Instead children are aligned per parent with an LCS over an
+// identity key, recursing into matches, so an insertion is one `added` and the
+// rest stay matched. LCS is per parent, so cost is Σ(children²) — small for
+// real DOMs; a pathological flat parent falls back to in-order key pairing.
+/** Above this many DP cells for one parent, pair greedily instead. */
+const LCS_CELL_CAP = 250_000;
+/** What makes an element "the same one" across captures: tag plus the most
+ *  stable identity it carries. Masked stand-ins have only their tag. */
+export function identityKey(el) {
+    if (el.id !== undefined)
+        return `${el.tag}#${el.id}`;
+    if (el.testId !== undefined)
+        return `${el.tag}[${el.testId}]`;
+    if (el.role && el.name)
+        return `${el.tag}|${el.role}=${el.name}`;
+    if (el.classes?.length)
+        return `${el.tag}.${el.classes.join('.')}`;
+    return el.tag;
+}
+export function matchElements(a, b) {
+    const childrenA = childLists(a.elements);
+    const childrenB = childLists(b.elements);
+    const keyA = a.elements.map(identityKey);
+    const keyB = b.elements.map(identityKey);
+    const pairs = [];
+    const added = [];
+    const removed = [];
+    const walk = (pa, pb) => {
+        const ca = childrenA.get(pa) ?? [];
+        const cb = childrenB.get(pb) ?? [];
+        const first = align(ca, cb, (i, j) => keyA[i] === keyB[j]);
+        // A text edit changes a name-derived key, a toggled class changes a
+        // class-derived one. Pair what is left by tag, in order, so those read as
+        // `text`/`attr` deltas rather than removed + added.
+        // Never across conflicting explicit identities: `div#row-1` removed and
+        // `div#banner` added are two different elements, not one edited one.
+        const second = align(first.leftA, first.leftB, (i, j) => sameKind(a.elements[i], b.elements[j]));
+        for (const [i, j] of [...first.matched, ...second.matched]) {
+            pairs.push([i, j]);
+            walk(i, j);
+        }
+        removed.push(...second.leftA);
+        added.push(...second.leftB);
+    };
+    walk(-1, -1);
+    pairs.sort((p, q) => p[1] - q[1]);
+    added.sort((x, y) => x - y);
+    removed.sort((x, y) => x - y);
+    return { pairs, added, removed };
+}
+/** Tag equal, and no explicit id or testId present on both sides and unequal. */
+function sameKind(x, y) {
+    if (x.tag !== y.tag)
+        return false;
+    if (x.id !== undefined && y.id !== undefined && x.id !== y.id)
+        return false;
+    if (x.testId !== undefined && y.testId !== undefined && x.testId !== y.testId)
+        return false;
+    return true;
+}
+/** Children in document order, keyed by parent index; -1 is the root. */
+function childLists(elements) {
+    const m = new Map();
+    elements.forEach((e, i) => {
+        const p = e.parent ?? -1;
+        const list = m.get(p);
+        if (list)
+            list.push(i);
+        else
+            m.set(p, [i]);
+    });
+    return m;
+}
+/** Order-preserving alignment of two sibling lists under `same`. */
+function align(ca, cb, same) {
+    const matched = ca.length * cb.length > LCS_CELL_CAP ? greedy(ca, cb, same) : lcs(ca, cb, same);
+    const usedA = new Set(matched.map(([i]) => i));
+    const usedB = new Set(matched.map(([, j]) => j));
+    return {
+        matched,
+        leftA: ca.filter((i) => !usedA.has(i)),
+        leftB: cb.filter((j) => !usedB.has(j)),
+    };
+}
+function lcs(ca, cb, same) {
+    const n = ca.length;
+    const m = cb.length;
+    // L[i][j] = LCS length of ca[i..] and cb[j..]
+    const L = Array.from({ length: n + 1 }, () => new Uint32Array(m + 1));
+    for (let i = n - 1; i >= 0; i--) {
+        for (let j = m - 1; j >= 0; j--) {
+            L[i][j] = same(ca[i], cb[j])
+                ? L[i + 1][j + 1] + 1
+                : Math.max(L[i + 1][j], L[i][j + 1]);
+        }
+    }
+    const out = [];
+    let i = 0;
+    let j = 0;
+    while (i < n && j < m) {
+        if (same(ca[i], cb[j])) {
+            out.push([ca[i], cb[j]]);
+            i++;
+            j++;
+        }
+        else if (L[i + 1][j] >= L[i][j + 1])
+            i++;
+        else
+            j++;
+    }
+    return out;
+}
+/** In-order pairing: each a takes the first unused b after the last pairing
+ *  that is `same`. Linear-ish, order-preserving, and good enough for a parent
+ *  with thousands of children where an exact LCS would cost seconds.
+ *  Failure mode: it never looks backwards, so a reordered list degrades to
+ *  many removed/added pairs instead of a minimal edit. */
+function greedy(ca, cb, same) {
+    const out = [];
+    let j = 0;
+    for (const i of ca) {
+        let k = j;
+        while (k < cb.length && !same(i, cb[k]))
+            k++;
+        if (k < cb.length) {
+            out.push([i, cb[k]]);
+            j = k + 1;
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=match.js.map

package/dist/diff/structural/match.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"match.js","sourceRoot":"","sources":["../../../src/diff/structural/match.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,EAAE;AACF,0EAA0E;AAC1E,uEAAuE;AACvE,+EAA+E;AAC/E,4EAA4E;AAC5E,4EAA4E;AAa5E,sEAAsE;AACtE,MAAM,YAAY,GAAG,OAAO,CAAC;AAE7B;wEACwE;AACxE,MAAM,UAAU,WAAW,CAAC,EAAoB;IAC9C,IAAI,EAAE,CAAC,EAAE,KAAK,SAAS;QAAE,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;IACrD,IAAI,EAAE,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;IAC9D,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI;QAAE,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;IACjE,IAAI,EAAE,CAAC,OAAO,EAAE,MAAM;QAAE,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACnE,OAAO,EAAE,CAAC,GAAG,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,CAAoB,EAAE,CAAoB;IACtE,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACzC,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,MAAM,IAAI,GAAG,CAAC,EAAU,EAAE,EAAU,EAAQ,EAAE;QAC5C,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACnC,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,oEAAoE;QACpE,0EAA0E;QAC1E,oDAAoD;QACpD,wEAAwE;QACxE,qEAAqE;QACrE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACtD,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CACvC,CAAC;QACF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACb,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC,CAAC;IACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEb,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AACnC,CAAC;AAED,iFAAiF;AACjF,SAAS,QAAQ,CAAC,CAAmB,EAAE,CAAmB;IACxD,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IAClC,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;IAC5E,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAC3E,OAAO,KAAK,CAAC;IACf,OAAO,IAAI,CAAC;AACd,CAAC;AAED,yEAAyE;AACzE,SAAS,UAAU,CAAC,QAA4B;IAC9C,MAAM,CAAC,GAAG,IAAI,GAAG,EAAoB,CAAC;IACtC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAClB,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,CAAC;AACX,CAAC;AAQD,oEAAoE;AACpE,SAAS,KAAK,CACZ,EAAY,EACZ,EAAY,EACZ,IAAuC;IAEvC,MAAM,OAAO,GACX,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IAClF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,OAAO;QACL,OAAO;QACP,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;KACvC,CAAC;AACJ,CAAC;AAED,SAAS,GAAG,CACV,EAAY,EACZ,EAAY,EACZ,IAAuC;IAEvC,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;IACpB,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;IACpB,8CAA8C;IAC9C,MAAM,CAAC,GAAkB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrF,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC1B,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;gBACrB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;;YACtC,CAAC,EAAE,CAAC;IACX,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;0DAI0D;AAC1D,SAAS,MAAM,CACb,EAAY,EACZ,EAAY,EACZ,IAAuC;IAEvC,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,EAAE,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC;YAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACZ,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/diff/structural/shift.d.ts

@@ -0,0 +1,2 @@
+import { type Fact } from './deltas.js';
+export declare function synthesizeShifts(facts: Fact[]): Fact[];

package/dist/diff/structural/shift.js

@@ -0,0 +1,144 @@
+// "Everything below the banner moved down 14px because the banner grew 14px"
+// is one fact, not forty. Collapse a run of ≥3 matched elements that moved by
+// the same (dx, dy), contiguous in document order, into one `shift` anchored
+// on the element that explains it (see `collapse`).
+//
+// The anchor set is wider than the spec's added/removed/resized: a margin or
+// line-height change moves everything after it without resizing anything the
+// LCS can see, and leaving those as 40 `moved` deltas defeats the purpose.
+import { compareCodeUnits, sortFacts } from './deltas.js';
+const MIN_RUN = 3;
+export function synthesizeShifts(facts) {
+    const anchors = facts.filter((f) => f.delta.kind !== 'moved' && f.delta.kind !== 'shift');
+    const moved = facts.filter((f) => f.delta.kind === 'moved');
+    if (moved.length < MIN_RUN)
+        return facts;
+    // Group by displacement, keeping document order within a group.
+    const groups = new Map();
+    for (const f of moved) {
+        const d = f.delta;
+        const key = `${d.dx},${d.dy}`;
+        const g = groups.get(key);
+        if (g)
+            g.push(f);
+        else
+            groups.set(key, [f]);
+    }
+    // A fact's position among all moves, in document order: two members of a
+    // group are adjacent exactly when no move with another displacement sits
+    // between them (unmoved elements in between — sticky headers, absolutes —
+    // do not break a run).
+    const pos = new Map(moved.map((f, k) => [f, k]));
+    const anchorOrders = anchors.map((f) => f.order); // ascending: facts are sorted
+    const collapsed = new Set();
+    const shifts = [];
+    // Deterministic: iterate groups by key, not by insertion.
+    for (const key of [...groups.keys()].sort(compareCodeUnits)) {
+        const g = groups.get(key);
+        // A different move inside a group splits it rather than vetoing it: in
+        // `font-size` the logo slides right between the button and the rows, and
+        // the six elements below still moved up together. So does another cause
+        // between two members: rows below a second removal moved because of that
+        // removal, not the first, so "480 elements after the first" would blame
+        // the wrong element (measured on the 50-section perf tree).
+        let start = 0;
+        for (let k = 1; k <= g.length; k++) {
+            if (k < g.length &&
+                pos.get(g[k]) === pos.get(g[k - 1]) + 1 &&
+                !causeBetween(anchorOrders, g[k - 1].order, g[k].order))
+                continue;
+            const run = g.slice(start, k);
+            start = k;
+            const shift = run.length >= MIN_RUN ? collapse(run, anchors, moved) : undefined;
+            if (!shift)
+                continue;
+            for (const f of run)
+                collapsed.add(f);
+            shifts.push(shift);
+        }
+    }
+    if (shifts.length === 0)
+        return facts;
+    return sortFacts([...facts.filter((f) => !collapsed.has(f)), ...shifts]);
+}
+/** One contiguous run as a shift on what explains it; nothing means the
+ *  move stays as moves. In order of preference:
+ *
+ *  1. A move with another displacement that crossed the run — before it in
+ *     the baseline, after it now, or the reverse. That is a reorder: moving
+ *     item 3 to slot 9 of 12 moves items 4–9 up 37px each, and item 3 (the
+ *     only thing the author touched) sits after them in the current order,
+ *     so "nearest preceding" can never find it. Measured on the 12-item
+ *     probe: before this, the six −37px moves stayed six (no anchor) and
+ *     item 3's `moved down 222px` was the 8th line.
+ *  2. The nearest preceding element that changed in another way.
+ *  3. The nearest preceding move with another displacement.
+ *
+ *  (1) and (3) take the head of the anchor's own block of equal moves, so the
+ *  shift names the list item, not the `span` inside it that moved with it.
+ *  (2) is ahead of (3) because a nearer odd move is usually a consequence of
+ *  the same cause: in `inserted` the logo drops off the button's line between
+ *  the banner and the rows, and the rows moved because of the banner. */
+function collapse(run, anchors, moved) {
+    const first = run[0];
+    const last = run[run.length - 1];
+    const d = first.delta;
+    const other = moved.filter((f) => {
+        const m = f.delta;
+        return m.dx !== d.dx || m.dy !== d.dy;
+    });
+    const base = (f) => f.source.index; // moves are matched: baseline side
+    const crossed = other
+        .filter((f) => (base(f) < base(first) && f.order > last.order) ||
+        (base(f) > base(last) && f.order < first.order))
+        .sort((x, y) => base(x) - base(y));
+    const preceding = (fs) => fs.filter((f) => f.order < first.order).at(-1);
+    const anchor = (crossed[0] && headOf(crossed[0], moved)) ??
+        preceding(anchors) ??
+        (preceding(other) && headOf(preceding(other), moved));
+    if (!anchor)
+        return undefined;
+    return {
+        delta: {
+            kind: 'shift',
+            after: 'el' in anchor.delta ? anchor.delta.el : anchor.delta.after,
+            dx: d.dx,
+            dy: d.dy,
+            count: run.length,
+        },
+        rects: run.flatMap((f) => f.rects),
+        abstract: anchor.abstract,
+        order: anchor.order + 0.25,
+        source: anchor.source,
+    };
+}
+/** The first of the moves contiguous (in document order) with `f` that
+ *  share its displacement: an element and the descendants that moved with it
+ *  read as the element. */
+function headOf(f, moved) {
+    const m = f.delta;
+    let k = moved.indexOf(f);
+    while (k > 0) {
+        const p = moved[k - 1].delta;
+        if (p.dx !== m.dx || p.dy !== m.dy)
+            break;
+        k--;
+    }
+    return moved[k];
+}
+/** Some anchor sits strictly between two run members. An anchor at a
+ *  member's own position (a moved row whose text also changed) is part of
+ *  the run, not a new cause. */
+function causeBetween(orders, lo, hi) {
+    let a = 0;
+    let b = orders.length;
+    while (a < b) {
+        const m = (a + b) >> 1;
+        if (orders[m] <= lo)
+            a = m + 1;
+        else
+            b = m;
+    }
+    return a < orders.length && orders[a] < hi;
+}
+//# sourceMappingURL=shift.js.map

package/dist/diff/structural/shift.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shift.js","sourceRoot":"","sources":["../../../src/diff/structural/shift.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,8EAA8E;AAC9E,6EAA6E;AAC7E,oDAAoD;AACpD,EAAE;AACF,6EAA6E;AAC7E,6EAA6E;AAC7E,2EAA2E;AAG3E,OAAO,EAAE,gBAAgB,EAAE,SAAS,EAAa,MAAM,aAAa,CAAC;AAErE,MAAM,OAAO,GAAG,CAAC,CAAC;AAElB,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAC5D,CAAC;IACF,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IAC5D,IAAI,KAAK,CAAC,MAAM,GAAG,OAAO;QAAE,OAAO,KAAK,CAAC;IAEzC,gEAAgE;IAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,KAA0C,CAAC;QACvD,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YACZ,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,yEAAyE;IACzE,yEAAyE;IACzE,0EAA0E;IAC1E,uBAAuB;IACvB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,8BAA8B;IAChF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAQ,CAAC;IAClC,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,0DAA0D;IAC1D,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC3B,uEAAuE;QACvE,yEAAyE;QACzE,wEAAwE;QACxE,yEAAyE;QACzE,wEAAwE;QACxE,4DAA4D;QAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IACE,CAAC,GAAG,CAAC,CAAC,MAAM;gBACZ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC;gBACzC,CAAC,YAAY,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBAEvD,SAAS;YACX,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,GAAG,CAAC,CAAC;YACV,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAChF,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,KAAK,MAAM,CAAC,IAAI,GAAG;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,OAAO,SAAS,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;;;;;;;;;;;;;yEAiByE;AACzE,SAAS,QAAQ,CAAC,GAAW,EAAE,OAAe,EAAE,KAAa;IAC3D,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACjC,MAAM,CAAC,GAAG,KAAK,CAAC,KAA0C,CAAC;IAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,KAA0C,CAAC;QACvD,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;IACxC,CAAC,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,mCAAmC;IAC7E,MAAM,OAAO,GAAG,KAAK;SAClB,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC/C,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAClD;SACA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,MAAM,GACV,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACzC,SAAS,CAAC,OAAO,CAAC;QAClB,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IACzD,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAC9B,OAAO;QACL,KAAK,EAAE;YACL,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK;YAClE,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK,EAAE,GAAG,CAAC,MAAM;SAClB;QACD,KAAK,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QAClC,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,KAAK,EAAE,MAAM,CAAC,KAAK,GAAG,IAAI;QAC1B,MAAM,EAAE,MAAM,CAAC,MAAM;KACtB,CAAC;AACJ,CAAC;AAED;;2BAE2B;AAC3B,SAAS,MAAM,CAAC,CAAO,EAAE,KAAa;IACpC,MAAM,CAAC,GAAG,CAAC,CAAC,KAA0C,CAAC;IACvD,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAA0C,CAAC;QAClE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;YAAE,MAAM;QAC1C,CAAC,EAAE,CAAC;IACN,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAED;;gCAEgC;AAChC,SAAS,YAAY,CAAC,MAAgB,EAAE,EAAU,EAAE,EAAU;IAC5D,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACtB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE;YAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;;YAC1B,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;AAC7C,CAAC"}

package/dist/diff/structural/summary.d.ts

@@ -0,0 +1,31 @@
+import type { ChangedRegion, Classification, Delta, Flag, StructureSnapshot, StyleTag } from '../../types.js';
+export declare const MAX_SUMMARY = 300;
+/** `change`: the summary's lead clauses without the per-story tail. */
+export declare const MAX_CHANGE = 160;
+export declare function describeDelta(d: Delta): string;
+/** The deltas as indented display lines for a human, grouped by element:
+ *  the element's content changes (four-side longhands collapsed), then its
+ *  resize and move on one line. Groups run causes first — content, added and
+ *  removed, and a move a shift is blamed on; then shifts; then other moves;
+ *  then resizes, so an ancestor's consequential `resized` comes last. Every
+ *  delta passed in is stated on some line; `total` is the verdict's
+ *  `deltaCount`, which says whether `deltas` is the whole set. */
+export declare function describeDeltas(deltas: Delta[], total?: number): string[];
+export interface SummaryArgs {
+    classification: Classification;
+    styleTags: StyleTag[];
+    deltas: Delta[];
+    deltaCount: number;
+    regionCount: number;
+    unexplainedRegions: ChangedRegion[];
+    flags: Flag[];
+    imagesIdentical: boolean;
+    baseline?: StructureSnapshot;
+    current?: StructureSnapshot;
+}
+/** The change alone, for naming what several stories share: the summary's
+ *  own clause wording with every element reduced to its role|tag (the
+ *  caller passes `deltas` already abstracted), no coverage or tolerance
+ *  tail, at most two clauses. */
+export declare function buildChange(a: SummaryArgs): string;
+export declare function buildSummary(a: SummaryArgs): string;