@motionscript/code 0.0.0-stage → 0.1.0-alpha.10

package/dist/code-range.js

@@ -0,0 +1,132 @@
+/**
+ * Create a range that spans `length` characters starting at (line, col).
+ * If `length` is omitted, the range extends to the end of the line.
+ *
+ * Example:
+ *   word(1, 3, 3)   // line 1, column 3, spans 3 characters
+ *   word(1, 3)      // line 1, column 3, to end of line
+ */
+export function word(line, col, length) {
+    return {
+        startLine: line,
+        startCol: col,
+        endLine: line,
+        endCol: length === undefined ? Infinity : col + length,
+    };
+}
+/**
+ * Create a range that covers entire lines from `from` to `to` (inclusive).
+ * If `to` is omitted, only line `from` is covered.
+ *
+ * Example:
+ *   lines(1, 3)   // lines 1 through 3
+ *   lines(2)      // line 2 only
+ */
+export function lines(from, to) {
+    return {
+        startLine: from,
+        startCol: 1,
+        endLine: to ?? from,
+        endCol: Infinity,
+    };
+}
+/**
+ * Immutable, chainable, iterable builder over multiple ranges — mirrors
+ * {@link FillChain}/`Fills` in `@motionscript/sdk`. Every method returns a
+ * *new* chain with one more range appended, so the next range-kind method is
+ * called directly rather than through a separate combinator:
+ *
+ * @example
+ * CodeRanges.lines(2).word(5, 1, 3)   // a 2-range selection, one expression
+ */
+export class CodeRangeChain {
+    list;
+    constructor(list = []) {
+        this.list = list;
+    }
+    lines(from, to) {
+        return new CodeRangeChain([...this.list, lines(from, to)]);
+    }
+    word(line, col, length) {
+        return new CodeRangeChain([...this.list, word(line, col, length)]);
+    }
+    *[Symbol.iterator]() {
+        yield* this.list;
+    }
+    /**
+     * A chain is stored as its ranges. Without this it serialises as
+     * `{ "list": [...] }`, which has no iterator once read back and so selects
+     * nothing; a plain array of ranges reads back as the selection it was.
+     */
+    toJSON() {
+        return this.list;
+    }
+}
+/**
+ * Entry point for building multi-range selections fluently — an empty
+ * {@link CodeRangeChain}, so `CodeRanges.lines(2)` *is* `new
+ * CodeRangeChain().lines(2)`. `word`/`lines` stay directly importable and
+ * usable standalone for a single range; reach for `CodeRanges` when a call
+ * needs more than one.
+ */
+export const CodeRanges = new CodeRangeChain();
+/**
+ * Convert a CodeRange to absolute character offsets [start, end) in the joined
+ * source text, given the per-line lengths of that source. Lines/columns are
+ * clamped into the document so out-of-bounds inputs produce a valid range.
+ */
+export function rangeToCharOffsets(r, lineLengths) {
+    if (lineLengths.length === 0)
+        return { start: 0, end: 0 };
+    // Cumulative line starts in the joined string (lines joined with '\n').
+    const lineStart = new Array(lineLengths.length);
+    let acc = 0;
+    for (let i = 0; i < lineLengths.length; i++) {
+        lineStart[i] = acc;
+        acc += lineLengths[i] + 1; // +1 for the joining newline
+    }
+    const docEnd = acc > 0 ? acc - 1 : 0; // strip trailing newline
+    const clampLine = (n) => Math.max(0, Math.min(lineLengths.length - 1, n - 1)); // to 0-indexed
+    // A range read back from JSON holds `Infinity` as `null`; both mean "to the end".
+    const endLine = r.endLine ?? Infinity;
+    const endCol = r.endCol ?? Infinity;
+    const sLine = clampLine(r.startLine);
+    const eLine = clampLine(endLine);
+    const sColMax = lineLengths[sLine];
+    const eColMax = lineLengths[eLine];
+    // Columns are 1-indexed; clamp to [1, lineLength+1] so endCol can sit past
+    // the last char (one-past-end).
+    const sCol = Math.max(0, Math.min(sColMax, r.startCol - 1));
+    const eCol = endCol === Infinity
+        ? eColMax
+        : Math.max(0, Math.min(eColMax, endCol - 1));
+    const start = Math.min(docEnd, lineStart[sLine] + sCol);
+    const end = Math.min(docEnd, lineStart[eLine] + eCol);
+    return { start: Math.min(start, end), end: Math.max(start, end) };
+}
+/**
+ * Convert [start, end) character offsets in joined source to a CodeRange.
+ * Lines/cols in the returned range are 1-indexed.
+ */
+export function charOffsetsToRange(start, end, lineLengths) {
+    let off = 0;
+    let startLine = 1, startCol = 1, endLine = 1, endCol = 1;
+    let foundStart = false;
+    for (let li = 0; li < lineLengths.length; li++) {
+        const lineStart = off;
+        const lineEnd = off + lineLengths[li];
+        if (!foundStart && start >= lineStart && start <= lineEnd) {
+            startLine = li + 1;
+            startCol = (start - lineStart) + 1;
+            foundStart = true;
+        }
+        if (end >= lineStart && end <= lineEnd) {
+            endLine = li + 1;
+            endCol = (end - lineStart) + 1;
+            break;
+        }
+        off = lineEnd + 1;
+    }
+    return { startLine, startCol, endLine, endCol };
+}
+//# sourceMappingURL=code-range.js.map

package/dist/code-range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-range.js","sourceRoot":"","sources":["../src/code-range.ts"],"names":[],"mappings":"AAaA;;;;;;;GAOG;AACH,MAAM,UAAU,IAAI,CAAC,IAAY,EAAE,GAAW,EAAE,MAAe;IAC3D,OAAO;QACH,SAAS,EAAE,IAAI;QACf,QAAQ,EAAE,GAAG;QACb,OAAO,EAAE,IAAI;QACb,MAAM,EAAE,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM;KACzD,CAAC;AACN,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,KAAK,CAAC,IAAY,EAAE,EAAW;IAC3C,OAAO;QACH,SAAS,EAAE,IAAI;QACf,QAAQ,EAAE,CAAC;QACX,OAAO,EAAE,EAAE,IAAI,IAAI;QACnB,MAAM,EAAE,QAAQ;KACnB,CAAC;AACN,CAAC;AAID;;;;;;;;GAQG;AACH,MAAM,OAAO,cAAc;IACK;IAA5B,YAA4B,OAAoB,EAAE;QAAtB,SAAI,GAAJ,IAAI,CAAkB;IAAI,CAAC;IAEvD,KAAK,CAAC,IAAY,EAAE,EAAW;QAC3B,OAAO,IAAI,cAAc,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,CAAC,IAAY,EAAE,GAAW,EAAE,MAAe;QAC3C,OAAO,IAAI,cAAc,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACd,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,MAAM;QACF,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;CACJ;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,IAAI,cAAc,EAAE,CAAC;AAE/C;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAC9B,CAAY,EACZ,WAAqB;IAErB,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IAE1D,wEAAwE;IACxE,MAAM,SAAS,GAAa,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACnB,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,6BAA6B;IAC5D,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,yBAAyB;IAE/D,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE,CAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe;IAEzE,kFAAkF;IAClF,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,IAAI,QAAQ,CAAC;IACtC,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC;IAEpC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAEnC,2EAA2E;IAC3E,gCAAgC;IAChC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,IAAI,GAAG,MAAM,KAAK,QAAQ;QAC5B,CAAC,CAAC,OAAO;QACT,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEjD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;IACxD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;IACtD,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;AACtE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAC9B,KAAa,EACb,GAAW,EACX,WAAqB;IAErB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,SAAS,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;IACzD,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,GAAG,CAAC;QACtB,MAAM,OAAO,GAAG,GAAG,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,UAAU,IAAI,KAAK,IAAI,SAAS,IAAI,KAAK,IAAI,OAAO,EAAE,CAAC;YACxD,SAAS,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,QAAQ,GAAG,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;YACnC,UAAU,GAAG,IAAI,CAAC;QACtB,CAAC;QACD,IAAI,GAAG,IAAI,SAAS,IAAI,GAAG,IAAI,OAAO,EAAE,CAAC;YACrC,OAAO,GAAG,EAAE,GAAG,CAAC,CAAC;YACjB,MAAM,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;YAC/B,MAAM;QACV,CAAC;QACD,GAAG,GAAG,OAAO,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AACpD,CAAC","sourcesContent":["/**\n * A range over a code document. Lines and columns are 1-indexed.\n *\n * `endLine`/`endCol` may be `Infinity` to mean \"to the end of the line\" or\n * \"to the end of the document\".\n */\nexport interface CodeRange {\n    startLine: number;\n    startCol: number;\n    endLine: number;\n    endCol: number;\n}\n\n/**\n * Create a range that spans `length` characters starting at (line, col).\n * If `length` is omitted, the range extends to the end of the line.\n *\n * Example:\n *   word(1, 3, 3)   // line 1, column 3, spans 3 characters\n *   word(1, 3)      // line 1, column 3, to end of line\n */\nexport function word(line: number, col: number, length?: number): CodeRange {\n    return {\n        startLine: line,\n        startCol: col,\n        endLine: line,\n        endCol: length === undefined ? Infinity : col + length,\n    };\n}\n\n/**\n * Create a range that covers entire lines from `from` to `to` (inclusive).\n * If `to` is omitted, only line `from` is covered.\n *\n * Example:\n *   lines(1, 3)   // lines 1 through 3\n *   lines(2)      // line 2 only\n */\nexport function lines(from: number, to?: number): CodeRange {\n    return {\n        startLine: from,\n        startCol: 1,\n        endLine: to ?? from,\n        endCol: Infinity,\n    };\n}\n\n\n\n/**\n * Immutable, chainable, iterable builder over multiple ranges — mirrors\n * {@link FillChain}/`Fills` in `@motionscript/sdk`. Every method returns a\n * *new* chain with one more range appended, so the next range-kind method is\n * called directly rather than through a separate combinator:\n *\n * @example\n * CodeRanges.lines(2).word(5, 1, 3)   // a 2-range selection, one expression\n */\nexport class CodeRangeChain {\n    constructor(public readonly list: CodeRange[] = []) { }\n\n    lines(from: number, to?: number): CodeRangeChain {\n        return new CodeRangeChain([...this.list, lines(from, to)]);\n    }\n\n    word(line: number, col: number, length?: number): CodeRangeChain {\n        return new CodeRangeChain([...this.list, word(line, col, length)]);\n    }\n\n    *[Symbol.iterator](): Iterator<CodeRange> {\n        yield* this.list;\n    }\n\n    /**\n     * A chain is stored as its ranges. Without this it serialises as\n     * `{ \"list\": [...] }`, which has no iterator once read back and so selects\n     * nothing; a plain array of ranges reads back as the selection it was.\n     */\n    toJSON(): CodeRange[] {\n        return this.list;\n    }\n}\n\n/**\n * Entry point for building multi-range selections fluently — an empty\n * {@link CodeRangeChain}, so `CodeRanges.lines(2)` *is* `new\n * CodeRangeChain().lines(2)`. `word`/`lines` stay directly importable and\n * usable standalone for a single range; reach for `CodeRanges` when a call\n * needs more than one.\n */\nexport const CodeRanges = new CodeRangeChain();\n\n/**\n * Convert a CodeRange to absolute character offsets [start, end) in the joined\n * source text, given the per-line lengths of that source. Lines/columns are\n * clamped into the document so out-of-bounds inputs produce a valid range.\n */\nexport function rangeToCharOffsets(\n    r: CodeRange,\n    lineLengths: number[],\n): { start: number; end: number } {\n    if (lineLengths.length === 0) return { start: 0, end: 0 };\n\n    // Cumulative line starts in the joined string (lines joined with '\\n').\n    const lineStart: number[] = new Array(lineLengths.length);\n    let acc = 0;\n    for (let i = 0; i < lineLengths.length; i++) {\n        lineStart[i] = acc;\n        acc += lineLengths[i] + 1; // +1 for the joining newline\n    }\n    const docEnd = acc > 0 ? acc - 1 : 0; // strip trailing newline\n\n    const clampLine = (n: number) =>\n        Math.max(0, Math.min(lineLengths.length - 1, n - 1)); // to 0-indexed\n\n    // A range read back from JSON holds `Infinity` as `null`; both mean \"to the end\".\n    const endLine = r.endLine ?? Infinity;\n    const endCol = r.endCol ?? Infinity;\n\n    const sLine = clampLine(r.startLine);\n    const eLine = clampLine(endLine);\n    const sColMax = lineLengths[sLine];\n    const eColMax = lineLengths[eLine];\n\n    // Columns are 1-indexed; clamp to [1, lineLength+1] so endCol can sit past\n    // the last char (one-past-end).\n    const sCol = Math.max(0, Math.min(sColMax, r.startCol - 1));\n    const eCol = endCol === Infinity\n        ? eColMax\n        : Math.max(0, Math.min(eColMax, endCol - 1));\n\n    const start = Math.min(docEnd, lineStart[sLine] + sCol);\n    const end = Math.min(docEnd, lineStart[eLine] + eCol);\n    return { start: Math.min(start, end), end: Math.max(start, end) };\n}\n\n/**\n * Convert [start, end) character offsets in joined source to a CodeRange.\n * Lines/cols in the returned range are 1-indexed.\n */\nexport function charOffsetsToRange(\n    start: number,\n    end: number,\n    lineLengths: number[],\n): CodeRange {\n    let off = 0;\n    let startLine = 1, startCol = 1, endLine = 1, endCol = 1;\n    let foundStart = false;\n    for (let li = 0; li < lineLengths.length; li++) {\n        const lineStart = off;\n        const lineEnd = off + lineLengths[li];\n        if (!foundStart && start >= lineStart && start <= lineEnd) {\n            startLine = li + 1;\n            startCol = (start - lineStart) + 1;\n            foundStart = true;\n        }\n        if (end >= lineStart && end <= lineEnd) {\n            endLine = li + 1;\n            endCol = (end - lineStart) + 1;\n            break;\n        }\n        off = lineEnd + 1;\n    }\n    return { startLine, startCol, endLine, endCol };\n}\n"]}

package/dist/diff.d.ts

@@ -0,0 +1,56 @@
+import type { IdLine } from "./tokens.js";
+/**
+ * The result of diffing one listing structure against another: the *next*
+ * structure, with token and line ids carried over from the previous one
+ * wherever the content survived, plus the three sets a transition needs to know
+ * which role each token plays.
+ *
+ * Identity is the whole product here. `const variable = 3` becoming
+ * `const number = 3` should move `const` and `= 3` rather than dissolve and
+ * rebuild them, and a token can only *move* if the frame after the edit still
+ * knows it is the same token.
+ */
+/**
+ * How a `Code` node decides which token became which across an edit. Given
+ * the old and new tokenized structures, return the carried-over structure
+ * plus the added/removed/renamed-line bookkeeping a transition needs.
+ * `diffCode` below is the default implementation (exported as
+ * `defaultCodeDiff`) — pass a `diffStrategy` of this shape to `<Code>` to
+ * replace it with your own.
+ */
+export type CodeDiffStrategy = (from: IdLine[], to: IdLine[]) => CodeEdit;
+export interface CodeEdit {
+    /** The new structure. Ids are rewritten in place onto the tokens handed in. */
+    lines: IdLine[];
+    /** Ids present only in the old structure — these fade out. */
+    removedIds: Set<number>;
+    /** Ids present only in the new structure — these fade in. */
+    addedIds: Set<number>;
+    /** Ids of {@link lines} that did not exist before — these enter as a whole row. */
+    newLineIds: Set<number>;
+    /** Previous colour of a surviving token whose highlighting changed, for the cross-fade. */
+    fromColorById: Map<number, string | undefined>;
+}
+/**
+ * The most line pairs one run of changed lines is scored against each other, and
+ * the most across a whole edit.
+ *
+ * Scoring every pair is quadratic: with 50-character lines it took 31 ms at 200
+ * lines and 741 ms at 1,000, paid again for each edit command when it is built.
+ * So the lines are first paired where they cannot be in doubt (see
+ * {@link alignLines}), and only a run left between two such anchors is scored.
+ * A run past the first limit, or what is left of the second, is not compared: its
+ * lines leave and enter as whole rows. That is the budget, and an edit that stays
+ * inside it is diffed exactly as before.
+ */
+export declare const LINE_ALIGN_CELLS = 40000;
+export declare const EDIT_ALIGN_CELLS = 160000;
+/**
+ * Carry `from`'s identities onto `to`, and report what changed.
+ *
+ * `to` is freshly tokenized and owns ids nobody has seen yet, so rewriting them
+ * in place is safe and is what makes the transition cheap: after this, the two
+ * structures share an id for every token that survived the edit.
+ */
+export declare function diffCode(from: IdLine[], to: IdLine[]): CodeEdit;
+//# sourceMappingURL=diff.d.ts.map

package/dist/diff.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.d.ts","sourceRoot":"","sources":["../src/diff.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAW,MAAM,UAAU,CAAC;AAEhD;;;;;;;;;;GAUG;AACH;;;;;;;GAOG;AACH,MAAM,MAAM,gBAAgB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,QAAQ,CAAC;AAE1E,MAAM,WAAW,QAAQ;IACrB,+EAA+E;IAC/E,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,8DAA8D;IAC9D,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,6DAA6D;IAC7D,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB,mFAAmF;IACnF,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,2FAA2F;IAC3F,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC;CAClD;AAYD;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,gBAAgB,QAAS,CAAC;AACvC,eAAO,MAAM,gBAAgB,SAAU,CAAC;AA0OxC;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,QAAQ,CAkD/D"}

package/dist/diff.js

@@ -0,0 +1,311 @@
+/**
+ * How similar two lines must be before they are treated as *one line that was
+ * edited* rather than as one line deleted and another inserted.
+ *
+ * Below this, a row's tokens have so little in common that carrying ids across
+ * would animate glyphs sliding between unrelated words. Above it, the edit reads
+ * the way it was made.
+ */
+const LINE_MATCH_FLOOR = 0.45;
+/**
+ * The most line pairs one run of changed lines is scored against each other, and
+ * the most across a whole edit.
+ *
+ * Scoring every pair is quadratic: with 50-character lines it took 31 ms at 200
+ * lines and 741 ms at 1,000, paid again for each edit command when it is built.
+ * So the lines are first paired where they cannot be in doubt (see
+ * {@link alignLines}), and only a run left between two such anchors is scored.
+ * A run past the first limit, or what is left of the second, is not compared: its
+ * lines leave and enter as whole rows. That is the budget, and an edit that stays
+ * inside it is diffed exactly as before.
+ */
+export const LINE_ALIGN_CELLS = 40_000;
+export const EDIT_ALIGN_CELLS = 160_000;
+/** Weight a token carries when judging similarity: its visible characters. */
+function tokenWeight(tok) {
+    return tok.content.trim().length;
+}
+function lineWeight(line) {
+    let sum = 0;
+    for (const tok of line.tokens)
+        sum += tokenWeight(tok);
+    return sum;
+}
+/**
+ * Dice coefficient over the two lines' token multisets, weighted by visible
+ * characters so `variable` counts for far more than a run of spaces.
+ *
+ * Two blank lines are identical (1); a blank line against a non-blank one shares
+ * nothing (0), which keeps the blank rows a reformat introduces from anchoring
+ * themselves onto real code.
+ */
+function similarity(a, b) {
+    const wa = lineWeight(a);
+    const wb = lineWeight(b);
+    if (wa === 0 && wb === 0)
+        return 1;
+    if (wa === 0 || wb === 0)
+        return 0;
+    const bag = new Map();
+    for (const tok of a.tokens) {
+        if (tokenWeight(tok) === 0)
+            continue;
+        bag.set(tok.content, (bag.get(tok.content) ?? 0) + 1);
+    }
+    let common = 0;
+    for (const tok of b.tokens) {
+        const w = tokenWeight(tok);
+        if (w === 0)
+            continue;
+        const left = bag.get(tok.content) ?? 0;
+        if (left > 0) {
+            bag.set(tok.content, left - 1);
+            common += w;
+        }
+    }
+    return (2 * common) / (wa + wb);
+}
+/**
+ * Align two sequences by maximising total `score`, skipping is free.
+ *
+ * A plain LCS would only ever pair *identical* elements, which is the wrong tool
+ * twice over: two lines that differ by one word are the same line, and two
+ * tokens that differ only in colour are the same token. Scoring the pairing and
+ * letting anything that scores ≤ 0 fall out expresses that directly, and because
+ * skips cost nothing the alignment stays in order.
+ *
+ * Returns the matched index pairs, in order.
+ */
+function align(aLength, bLength, score) {
+    // dp[i][j] = best score aligning a[0..i) with b[0..j).
+    const width = bLength + 1;
+    const dp = new Float64Array((aLength + 1) * width);
+    const pairScore = new Float64Array(aLength * bLength);
+    for (let i = 1; i <= aLength; i++) {
+        for (let j = 1; j <= bLength; j++) {
+            const s = score(i - 1, j - 1);
+            pairScore[(i - 1) * bLength + (j - 1)] = s;
+            const skipA = dp[(i - 1) * width + j];
+            const skipB = dp[i * width + (j - 1)];
+            let best = skipA > skipB ? skipA : skipB;
+            if (s > 0) {
+                const paired = dp[(i - 1) * width + (j - 1)] + s;
+                if (paired > best)
+                    best = paired;
+            }
+            dp[i * width + j] = best;
+        }
+    }
+    const pairs = [];
+    let i = aLength;
+    let j = bLength;
+    while (i > 0 && j > 0) {
+        const s = pairScore[(i - 1) * bLength + (j - 1)];
+        if (s > 0 && dp[i * width + j] === dp[(i - 1) * width + (j - 1)] + s) {
+            pairs.push([i - 1, j - 1]);
+            i--;
+            j--;
+        }
+        else if (dp[(i - 1) * width + j] >= dp[i * width + (j - 1)]) {
+            i--;
+        }
+        else {
+            j--;
+        }
+    }
+    pairs.reverse();
+    return pairs;
+}
+/**
+ * Match the tokens of one line against another's.
+ *
+ * Scored by visible characters rather than token count, so an alignment that
+ * keeps `items.reduce` together beats one that keeps four more spaces. A token
+ * pairs only when its content is unchanged — a changed word is a different word,
+ * and should be seen to be replaced.
+ */
+function alignTokens(from, to) {
+    return align(from.length, to.length, (i, j) => {
+        if (from[i].content !== to[j].content)
+            return 0;
+        // Whitespace still pairs (it holds indentation together), just weakly
+        // enough that it never outranks real content.
+        return tokenWeight(to[j]) || 0.25;
+    });
+}
+function sameTokens(a, b) {
+    if (a.tokens.length !== b.tokens.length)
+        return false;
+    for (let k = 0; k < a.tokens.length; k++)
+        if (a.tokens[k].content !== b.tokens[k].content)
+            return false;
+    return true;
+}
+/** A line's text, token boundaries included, for telling identical lines apart from similar ones. */
+function signature(line) {
+    let out = "";
+    for (const tok of line.tokens)
+        out += tok.content + "\u0001";
+    return out;
+}
+/**
+ * Pair the lines of two listings, in order.
+ *
+ * Lines that are the same at the start and at the end are paired outright. In
+ * what is left, a line that occurs exactly once on each side is an anchor, and
+ * the longest run of anchors that keeps their order splits the rest into runs of
+ * changed lines, each scored against itself within the budget (see
+ * {@link LINE_ALIGN_CELLS}). A one-line edit to a long listing therefore never
+ * builds a table bigger than the lines around it.
+ */
+function alignLines(from, to) {
+    const fromSig = from.map(signature);
+    const toSig = to.map(signature);
+    const pairs = [];
+    let head = 0;
+    while (head < from.length && head < to.length && fromSig[head] === toSig[head]) {
+        pairs.push([head, head]);
+        head++;
+    }
+    let tail = 0;
+    while (tail < from.length - head && tail < to.length - head
+        && fromSig[from.length - 1 - tail] === toSig[to.length - 1 - tail])
+        tail++;
+    const anchors = anchorLines(fromSig, toSig, head, from.length - tail, head, to.length - tail);
+    let budget = EDIT_ALIGN_CELLS;
+    let fi = head;
+    let ti = head;
+    for (const [af, at] of [...anchors, [from.length - tail, to.length - tail]]) {
+        const rows = af - fi;
+        const cols = at - ti;
+        const cells = rows * cols;
+        if (cells > 0 && cells <= LINE_ALIGN_CELLS && cells <= budget) {
+            budget -= cells;
+            for (const [i, j] of align(rows, cols, (a, b) => similarity(from[fi + a], to[ti + b]) - LINE_MATCH_FLOOR)) {
+                pairs.push([fi + i, ti + j]);
+            }
+        }
+        if (af < from.length - tail)
+            pairs.push([af, at]);
+        fi = af + 1;
+        ti = at + 1;
+    }
+    for (let k = tail; k > 0; k--)
+        pairs.push([from.length - k, to.length - k]);
+    return pairs;
+}
+/**
+ * The lines that occur once in `from[fa, fb)` and once in `to[ta, tb)`, reduced to
+ * the longest subsequence that is increasing on both sides (patience sorting).
+ * Blank lines are never anchors: they say nothing about where they belong.
+ */
+function anchorLines(fromSig, toSig, fa, fb, ta, tb) {
+    const fromAt = new Map();
+    const seen = new Set();
+    for (let i = fa; i < fb; i++) {
+        const sig = fromSig[i];
+        if (seen.has(sig))
+            fromAt.delete(sig);
+        else
+            fromAt.set(sig, i);
+        seen.add(sig);
+    }
+    const toAt = new Map();
+    const seenTo = new Set();
+    for (let j = ta; j < tb; j++) {
+        const sig = toSig[j];
+        if (seenTo.has(sig))
+            toAt.delete(sig);
+        else
+            toAt.set(sig, j);
+        seenTo.add(sig);
+    }
+    // In `to` order, each candidate carries its `from` position.
+    const candidates = [];
+    for (let j = ta; j < tb; j++) {
+        const i = fromAt.get(toSig[j]);
+        if (i !== undefined && toAt.get(toSig[j]) === j && toSig[j].replaceAll("\u0001", "").trim() !== "") {
+            candidates.push([i, j]);
+        }
+    }
+    const tails = [];
+    const previous = new Array(candidates.length).fill(-1);
+    for (let c = 0; c < candidates.length; c++) {
+        let lo = 0;
+        let hi = tails.length;
+        while (lo < hi) {
+            const mid = (lo + hi) >> 1;
+            if (candidates[tails[mid]][0] < candidates[c][0])
+                lo = mid + 1;
+            else
+                hi = mid;
+        }
+        if (lo > 0)
+            previous[c] = tails[lo - 1];
+        tails[lo] = c;
+    }
+    const chain = [];
+    for (let c = tails.length > 0 ? tails[tails.length - 1] : -1; c >= 0; c = previous[c])
+        chain.push(candidates[c]);
+    return chain.reverse();
+}
+/**
+ * Carry `from`'s identities onto `to`, and report what changed.
+ *
+ * `to` is freshly tokenized and owns ids nobody has seen yet, so rewriting them
+ * in place is safe and is what makes the transition cheap: after this, the two
+ * structures share an id for every token that survived the edit.
+ */
+export function diffCode(from, to) {
+    const removedIds = new Set();
+    const addedIds = new Set();
+    const newLineIds = new Set();
+    const fromColorById = new Map();
+    const linePairs = alignLines(from, to);
+    const pairedTo = new Set();
+    const pairedFrom = new Set();
+    for (const [fi, ti] of linePairs) {
+        pairedFrom.add(fi);
+        pairedTo.add(ti);
+        const fromLine = from[fi];
+        const toLine = to[ti];
+        toLine.id = fromLine.id;
+        const matched = sameTokens(fromLine, toLine)
+            ? fromLine.tokens.map((_, k) => [k, k])
+            : alignTokens(fromLine.tokens, toLine.tokens);
+        const keptFrom = new Set();
+        const keptTo = new Set();
+        for (const [a, b] of matched) {
+            keptFrom.add(a);
+            keptTo.add(b);
+            const oldTok = fromLine.tokens[a];
+            const newTok = toLine.tokens[b];
+            newTok.id = oldTok.id;
+            if (oldTok.color !== newTok.color)
+                fromColorById.set(oldTok.id, oldTok.color);
+        }
+        for (let a = 0; a < fromLine.tokens.length; a++) {
+            if (!keptFrom.has(a))
+                removedIds.add(fromLine.tokens[a].id);
+        }
+        for (let b = 0; b < toLine.tokens.length; b++) {
+            if (!keptTo.has(b))
+                addedIds.add(toLine.tokens[b].id);
+        }
+    }
+    for (let i = 0; i < from.length; i++) {
+        if (pairedFrom.has(i))
+            continue;
+        for (const tok of from[i].tokens)
+            removedIds.add(tok.id);
+    }
+    for (let j = 0; j < to.length; j++) {
+        if (pairedTo.has(j))
+            continue;
+        newLineIds.add(to[j].id);
+        for (const tok of to[j].tokens)
+            addedIds.add(tok.id);
+    }
+    return { lines: to, removedIds, addedIds, newLineIds, fromColorById };
+}
+//# sourceMappingURL=diff.js.map

package/dist/diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.js","sourceRoot":"","sources":["../src/diff.ts"],"names":[],"mappings":"AAoCA;;;;;;;GAOG;AACH,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAE9B;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAC;AACvC,MAAM,CAAC,MAAM,gBAAgB,GAAG,OAAO,CAAC;AAExC,8EAA8E;AAC9E,SAAS,WAAW,CAAC,GAAY;IAC7B,OAAO,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC;AACrC,CAAC;AAED,SAAS,UAAU,CAAC,IAAY;IAC5B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM;QAAE,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;IACvD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEnC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACzB,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QACrC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACX,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,CAAC,CAAC;QAChB,CAAC;IACL,CAAC;IACD,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,KAAK,CACV,OAAe,EACf,OAAe,EACf,KAAuC;IAEvC,uDAAuD;IACvD,MAAM,KAAK,GAAG,OAAO,GAAG,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;IAEtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YACzC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACR,MAAM,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,IAAI,MAAM,GAAG,IAAI;oBAAE,IAAI,GAAG,MAAM,CAAC;YACrC,CAAC;YACD,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QAC7B,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,IAAI,CAAC,GAAG,OAAO,CAAC;IAChB,IAAI,CAAC,GAAG,OAAO,CAAC;IAChB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACnE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC,EAAE,CAAC;YAAC,CAAC,EAAE,CAAC;QACb,CAAC;aAAM,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,CAAC,EAAE,CAAC;QACR,CAAC;aAAM,CAAC;YACJ,CAAC,EAAE,CAAC;QACR,CAAC;IACL,CAAC;IACD,KAAK,CAAC,OAAO,EAAE,CAAC;IAChB,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,WAAW,CAAC,IAAe,EAAE,EAAa;IAC/C,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1C,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO;YAAE,OAAO,CAAC,CAAC;QAChD,sEAAsE;QACtE,8CAA8C;QAC9C,OAAO,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IACtC,CAAC,CAAC,CAAC;AACP,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACpC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;IACxG,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,qGAAqG;AACrG,SAAS,SAAS,CAAC,IAAY;IAC3B,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM;QAAE,GAAG,IAAI,GAAG,CAAC,OAAO,GAAG,QAAQ,CAAC;IAC7D,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,IAAc,EAAE,EAAY;IAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAChC,MAAM,KAAK,GAA4B,EAAE,CAAC;IAE1C,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7E,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACzB,IAAI,EAAE,CAAC;IACX,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OACI,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC,MAAM,GAAG,IAAI;WACjD,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC;QACpE,IAAI,EAAE,CAAC;IAET,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IAC9F,IAAI,MAAM,GAAG,gBAAgB,CAAC;IAC9B,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,EAAE,CAAC,MAAM,GAAG,IAAI,CAAqB,CAAC,EAAE,CAAC;QAC9F,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,gBAAgB,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;YAC5D,MAAM,IAAI,KAAK,CAAC;YAChB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC;gBACxG,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QACD,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACZ,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5E,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAChB,OAAiB,EACjB,KAAe,EACf,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU;IAEV,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;;YACjC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;;YACjC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,6DAA6D;IAC7D,MAAM,UAAU,GAA4B,EAAE,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACjG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAa,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACtB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACb,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;gBAC1D,EAAE,GAAG,GAAG,CAAC;QAClB,CAAC;QACD,IAAI,EAAE,GAAG,CAAC;YAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACxC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IACjH,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAc,EAAE,EAAY;IACjD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,aAAa,GAAG,IAAI,GAAG,EAA8B,CAAC;IAE5D,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAEvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QAC/B,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,CAAC,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;QAExB,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC;YACxC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAoB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;YACtB,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK;gBAAE,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAClF,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChE,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1D,CAAC;IACL,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAChC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;YAAE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9B,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,CAAC;AAC1E,CAAC","sourcesContent":["import type { IdLine, IdToken } from \"./tokens\";\n\n/**\n * The result of diffing one listing structure against another: the *next*\n * structure, with token and line ids carried over from the previous one\n * wherever the content survived, plus the three sets a transition needs to know\n * which role each token plays.\n *\n * Identity is the whole product here. `const variable = 3` becoming\n * `const number = 3` should move `const` and `= 3` rather than dissolve and\n * rebuild them, and a token can only *move* if the frame after the edit still\n * knows it is the same token.\n */\n/**\n * How a `Code` node decides which token became which across an edit. Given\n * the old and new tokenized structures, return the carried-over structure\n * plus the added/removed/renamed-line bookkeeping a transition needs.\n * `diffCode` below is the default implementation (exported as\n * `defaultCodeDiff`) — pass a `diffStrategy` of this shape to `<Code>` to\n * replace it with your own.\n */\nexport type CodeDiffStrategy = (from: IdLine[], to: IdLine[]) => CodeEdit;\n\nexport interface CodeEdit {\n    /** The new structure. Ids are rewritten in place onto the tokens handed in. */\n    lines: IdLine[];\n    /** Ids present only in the old structure — these fade out. */\n    removedIds: Set<number>;\n    /** Ids present only in the new structure — these fade in. */\n    addedIds: Set<number>;\n    /** Ids of {@link lines} that did not exist before — these enter as a whole row. */\n    newLineIds: Set<number>;\n    /** Previous colour of a surviving token whose highlighting changed, for the cross-fade. */\n    fromColorById: Map<number, string | undefined>;\n}\n\n/**\n * How similar two lines must be before they are treated as *one line that was\n * edited* rather than as one line deleted and another inserted.\n *\n * Below this, a row's tokens have so little in common that carrying ids across\n * would animate glyphs sliding between unrelated words. Above it, the edit reads\n * the way it was made.\n */\nconst LINE_MATCH_FLOOR = 0.45;\n\n/**\n * The most line pairs one run of changed lines is scored against each other, and\n * the most across a whole edit.\n *\n * Scoring every pair is quadratic: with 50-character lines it took 31 ms at 200\n * lines and 741 ms at 1,000, paid again for each edit command when it is built.\n * So the lines are first paired where they cannot be in doubt (see\n * {@link alignLines}), and only a run left between two such anchors is scored.\n * A run past the first limit, or what is left of the second, is not compared: its\n * lines leave and enter as whole rows. That is the budget, and an edit that stays\n * inside it is diffed exactly as before.\n */\nexport const LINE_ALIGN_CELLS = 40_000;\nexport const EDIT_ALIGN_CELLS = 160_000;\n\n/** Weight a token carries when judging similarity: its visible characters. */\nfunction tokenWeight(tok: IdToken): number {\n    return tok.content.trim().length;\n}\n\nfunction lineWeight(line: IdLine): number {\n    let sum = 0;\n    for (const tok of line.tokens) sum += tokenWeight(tok);\n    return sum;\n}\n\n/**\n * Dice coefficient over the two lines' token multisets, weighted by visible\n * characters so `variable` counts for far more than a run of spaces.\n *\n * Two blank lines are identical (1); a blank line against a non-blank one shares\n * nothing (0), which keeps the blank rows a reformat introduces from anchoring\n * themselves onto real code.\n */\nfunction similarity(a: IdLine, b: IdLine): number {\n    const wa = lineWeight(a);\n    const wb = lineWeight(b);\n    if (wa === 0 && wb === 0) return 1;\n    if (wa === 0 || wb === 0) return 0;\n\n    const bag = new Map<string, number>();\n    for (const tok of a.tokens) {\n        if (tokenWeight(tok) === 0) continue;\n        bag.set(tok.content, (bag.get(tok.content) ?? 0) + 1);\n    }\n    let common = 0;\n    for (const tok of b.tokens) {\n        const w = tokenWeight(tok);\n        if (w === 0) continue;\n        const left = bag.get(tok.content) ?? 0;\n        if (left > 0) {\n            bag.set(tok.content, left - 1);\n            common += w;\n        }\n    }\n    return (2 * common) / (wa + wb);\n}\n\n/**\n * Align two sequences by maximising total `score`, skipping is free.\n *\n * A plain LCS would only ever pair *identical* elements, which is the wrong tool\n * twice over: two lines that differ by one word are the same line, and two\n * tokens that differ only in colour are the same token. Scoring the pairing and\n * letting anything that scores ≤ 0 fall out expresses that directly, and because\n * skips cost nothing the alignment stays in order.\n *\n * Returns the matched index pairs, in order.\n */\nfunction align(\n    aLength: number,\n    bLength: number,\n    score: (i: number, j: number) => number,\n): Array<[number, number]> {\n    // dp[i][j] = best score aligning a[0..i) with b[0..j).\n    const width = bLength + 1;\n    const dp = new Float64Array((aLength + 1) * width);\n    const pairScore = new Float64Array(aLength * bLength);\n\n    for (let i = 1; i <= aLength; i++) {\n        for (let j = 1; j <= bLength; j++) {\n            const s = score(i - 1, j - 1);\n            pairScore[(i - 1) * bLength + (j - 1)] = s;\n            const skipA = dp[(i - 1) * width + j];\n            const skipB = dp[i * width + (j - 1)];\n            let best = skipA > skipB ? skipA : skipB;\n            if (s > 0) {\n                const paired = dp[(i - 1) * width + (j - 1)] + s;\n                if (paired > best) best = paired;\n            }\n            dp[i * width + j] = best;\n        }\n    }\n\n    const pairs: Array<[number, number]> = [];\n    let i = aLength;\n    let j = bLength;\n    while (i > 0 && j > 0) {\n        const s = pairScore[(i - 1) * bLength + (j - 1)];\n        if (s > 0 && dp[i * width + j] === dp[(i - 1) * width + (j - 1)] + s) {\n            pairs.push([i - 1, j - 1]);\n            i--; j--;\n        } else if (dp[(i - 1) * width + j] >= dp[i * width + (j - 1)]) {\n            i--;\n        } else {\n            j--;\n        }\n    }\n    pairs.reverse();\n    return pairs;\n}\n\n/**\n * Match the tokens of one line against another's.\n *\n * Scored by visible characters rather than token count, so an alignment that\n * keeps `items.reduce` together beats one that keeps four more spaces. A token\n * pairs only when its content is unchanged — a changed word is a different word,\n * and should be seen to be replaced.\n */\nfunction alignTokens(from: IdToken[], to: IdToken[]): Array<[number, number]> {\n    return align(from.length, to.length, (i, j) => {\n        if (from[i].content !== to[j].content) return 0;\n        // Whitespace still pairs (it holds indentation together), just weakly\n        // enough that it never outranks real content.\n        return tokenWeight(to[j]) || 0.25;\n    });\n}\n\nfunction sameTokens(a: IdLine, b: IdLine): boolean {\n    if (a.tokens.length !== b.tokens.length) return false;\n    for (let k = 0; k < a.tokens.length; k++) if (a.tokens[k].content !== b.tokens[k].content) return false;\n    return true;\n}\n\n/** A line's text, token boundaries included, for telling identical lines apart from similar ones. */\nfunction signature(line: IdLine): string {\n    let out = \"\";\n    for (const tok of line.tokens) out += tok.content + \"\\u0001\";\n    return out;\n}\n\n/**\n * Pair the lines of two listings, in order.\n *\n * Lines that are the same at the start and at the end are paired outright. In\n * what is left, a line that occurs exactly once on each side is an anchor, and\n * the longest run of anchors that keeps their order splits the rest into runs of\n * changed lines, each scored against itself within the budget (see\n * {@link LINE_ALIGN_CELLS}). A one-line edit to a long listing therefore never\n * builds a table bigger than the lines around it.\n */\nfunction alignLines(from: IdLine[], to: IdLine[]): Array<[number, number]> {\n    const fromSig = from.map(signature);\n    const toSig = to.map(signature);\n    const pairs: Array<[number, number]> = [];\n\n    let head = 0;\n    while (head < from.length && head < to.length && fromSig[head] === toSig[head]) {\n        pairs.push([head, head]);\n        head++;\n    }\n    let tail = 0;\n    while (\n        tail < from.length - head && tail < to.length - head\n        && fromSig[from.length - 1 - tail] === toSig[to.length - 1 - tail]\n    ) tail++;\n\n    const anchors = anchorLines(fromSig, toSig, head, from.length - tail, head, to.length - tail);\n    let budget = EDIT_ALIGN_CELLS;\n    let fi = head;\n    let ti = head;\n    for (const [af, at] of [...anchors, [from.length - tail, to.length - tail] as [number, number]]) {\n        const rows = af - fi;\n        const cols = at - ti;\n        const cells = rows * cols;\n        if (cells > 0 && cells <= LINE_ALIGN_CELLS && cells <= budget) {\n            budget -= cells;\n            for (const [i, j] of align(rows, cols, (a, b) => similarity(from[fi + a], to[ti + b]) - LINE_MATCH_FLOOR)) {\n                pairs.push([fi + i, ti + j]);\n            }\n        }\n        if (af < from.length - tail) pairs.push([af, at]);\n        fi = af + 1;\n        ti = at + 1;\n    }\n    for (let k = tail; k > 0; k--) pairs.push([from.length - k, to.length - k]);\n    return pairs;\n}\n\n/**\n * The lines that occur once in `from[fa, fb)` and once in `to[ta, tb)`, reduced to\n * the longest subsequence that is increasing on both sides (patience sorting).\n * Blank lines are never anchors: they say nothing about where they belong.\n */\nfunction anchorLines(\n    fromSig: string[],\n    toSig: string[],\n    fa: number,\n    fb: number,\n    ta: number,\n    tb: number,\n): Array<[number, number]> {\n    const fromAt = new Map<string, number>();\n    const seen = new Set<string>();\n    for (let i = fa; i < fb; i++) {\n        const sig = fromSig[i];\n        if (seen.has(sig)) fromAt.delete(sig);\n        else fromAt.set(sig, i);\n        seen.add(sig);\n    }\n    const toAt = new Map<string, number>();\n    const seenTo = new Set<string>();\n    for (let j = ta; j < tb; j++) {\n        const sig = toSig[j];\n        if (seenTo.has(sig)) toAt.delete(sig);\n        else toAt.set(sig, j);\n        seenTo.add(sig);\n    }\n\n    // In `to` order, each candidate carries its `from` position.\n    const candidates: Array<[number, number]> = [];\n    for (let j = ta; j < tb; j++) {\n        const i = fromAt.get(toSig[j]);\n        if (i !== undefined && toAt.get(toSig[j]) === j && toSig[j].replaceAll(\"\\u0001\", \"\").trim() !== \"\") {\n            candidates.push([i, j]);\n        }\n    }\n\n    const tails: number[] = [];\n    const previous: number[] = new Array(candidates.length).fill(-1);\n    for (let c = 0; c < candidates.length; c++) {\n        let lo = 0;\n        let hi = tails.length;\n        while (lo < hi) {\n            const mid = (lo + hi) >> 1;\n            if (candidates[tails[mid]][0] < candidates[c][0]) lo = mid + 1;\n            else hi = mid;\n        }\n        if (lo > 0) previous[c] = tails[lo - 1];\n        tails[lo] = c;\n    }\n    const chain: Array<[number, number]> = [];\n    for (let c = tails.length > 0 ? tails[tails.length - 1] : -1; c >= 0; c = previous[c]) chain.push(candidates[c]);\n    return chain.reverse();\n}\n\n/**\n * Carry `from`'s identities onto `to`, and report what changed.\n *\n * `to` is freshly tokenized and owns ids nobody has seen yet, so rewriting them\n * in place is safe and is what makes the transition cheap: after this, the two\n * structures share an id for every token that survived the edit.\n */\nexport function diffCode(from: IdLine[], to: IdLine[]): CodeEdit {\n    const removedIds = new Set<number>();\n    const addedIds = new Set<number>();\n    const newLineIds = new Set<number>();\n    const fromColorById = new Map<number, string | undefined>();\n\n    const linePairs = alignLines(from, to);\n\n    const pairedTo = new Set<number>();\n    const pairedFrom = new Set<number>();\n\n    for (const [fi, ti] of linePairs) {\n        pairedFrom.add(fi);\n        pairedTo.add(ti);\n        const fromLine = from[fi];\n        const toLine = to[ti];\n        toLine.id = fromLine.id;\n\n        const matched = sameTokens(fromLine, toLine)\n            ? fromLine.tokens.map((_, k): [number, number] => [k, k])\n            : alignTokens(fromLine.tokens, toLine.tokens);\n        const keptFrom = new Set<number>();\n        const keptTo = new Set<number>();\n        for (const [a, b] of matched) {\n            keptFrom.add(a);\n            keptTo.add(b);\n            const oldTok = fromLine.tokens[a];\n            const newTok = toLine.tokens[b];\n            newTok.id = oldTok.id;\n            if (oldTok.color !== newTok.color) fromColorById.set(oldTok.id, oldTok.color);\n        }\n        for (let a = 0; a < fromLine.tokens.length; a++) {\n            if (!keptFrom.has(a)) removedIds.add(fromLine.tokens[a].id);\n        }\n        for (let b = 0; b < toLine.tokens.length; b++) {\n            if (!keptTo.has(b)) addedIds.add(toLine.tokens[b].id);\n        }\n    }\n\n    for (let i = 0; i < from.length; i++) {\n        if (pairedFrom.has(i)) continue;\n        for (const tok of from[i].tokens) removedIds.add(tok.id);\n    }\n    for (let j = 0; j < to.length; j++) {\n        if (pairedTo.has(j)) continue;\n        newLineIds.add(to[j].id);\n        for (const tok of to[j].tokens) addedIds.add(tok.id);\n    }\n\n    return { lines: to, removedIds, addedIds, newLineIds, fromColorById };\n}\n"]}

package/dist/engine.d.ts

@@ -0,0 +1,15 @@
+export * from './transitions.js';
+export * from './layout.js';
+export { drawCode } from './render.js';
+export type { CodeCanvas, DrawCodeState } from './render.js';
+export { diffCode as defaultCodeDiff } from './diff.js';
+export type { CodeDiffStrategy, CodeEdit } from './diff.js';
+export { loadCodeLanguage, initSyntaxHighlighter, ensureHighlighter, registerCodeTheme, resolveTheme, canHighlight, normalizeSource } from './highlight.js';
+export { tokenizeCodeToIdLines } from './tokens.js';
+export type { IdLine, IdToken } from './tokens.js';
+export { DefaultHighlightStyle, GithubDarkStyle, GithubLightStyle, VscodeDarkStyle, VscodeLightStyle, BUILTIN_THEMES, compileStyle } from './style.js';
+export type { CodeHighlightStyle, CodeStyleRule, CodeTheme, CodeThemeName } from './style.js';
+export { TokenAdvanceCache } from './measure-cache.js';
+export { word, lines, rangeToCharOffsets, charOffsetsToRange, CodeRanges, CodeRangeChain } from './code-range.js';
+export type { CodeRange } from './code-range.js';
+//# sourceMappingURL=engine.d.ts.map

package/dist/engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../src/engine.ts"],"names":[],"mappings":"AAOA,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACpC,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAC1D,OAAO,EAAE,QAAQ,IAAI,eAAe,EAAE,MAAM,QAAQ,CAAC;AACrD,YAAY,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,YAAY,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACzJ,OAAO,EAAE,qBAAqB,EAAE,MAAM,UAAU,CAAC;AACjD,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AAChD,OAAO,EAAE,qBAAqB,EAAE,eAAe,EAAE,gBAAgB,EAAE,eAAe,EAAE,gBAAgB,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACpJ,YAAY,EAAE,kBAAkB,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAC3F,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC/G,YAAY,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC"}

package/dist/engine.js

@@ -0,0 +1,17 @@
+// The Code "engine": syntax highlighting, tokenizing, layout, diffing, and
+// transition/phase scheduling — kept separate from node.ts so a copy of the node
+// can take just its declaration and import this behind
+// `@motionscript/code` instead. What gets copied is whatever this
+// package's registry.json declares, which for this component is node.ts;
+// src/tests/registry.test.ts checks that anything it
+// reaches for is either copied alongside it or re-exported from here.
+export * from './transitions.js';
+export * from './layout.js';
+export { drawCode } from './render.js';
+export { diffCode as defaultCodeDiff } from './diff.js';
+export { loadCodeLanguage, initSyntaxHighlighter, ensureHighlighter, registerCodeTheme, resolveTheme, canHighlight, normalizeSource } from './highlight.js';
+export { tokenizeCodeToIdLines } from './tokens.js';
+export { DefaultHighlightStyle, GithubDarkStyle, GithubLightStyle, VscodeDarkStyle, VscodeLightStyle, BUILTIN_THEMES, compileStyle } from './style.js';
+export { TokenAdvanceCache } from './measure-cache.js';
+export { word, lines, rangeToCharOffsets, charOffsetsToRange, CodeRanges, CodeRangeChain } from './code-range.js';
+//# sourceMappingURL=engine.js.map

package/dist/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../src/engine.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,iFAAiF;AACjF,uDAAuD;AACvD,kEAAkE;AAClE,yEAAyE;AACzE,qDAAqD;AACrD,sEAAsE;AACtE,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AAEpC,OAAO,EAAE,QAAQ,IAAI,eAAe,EAAE,MAAM,QAAQ,CAAC;AAErD,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,YAAY,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACzJ,OAAO,EAAE,qBAAqB,EAAE,MAAM,UAAU,CAAC;AAEjD,OAAO,EAAE,qBAAqB,EAAE,eAAe,EAAE,gBAAgB,EAAE,eAAe,EAAE,gBAAgB,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAEpJ,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC","sourcesContent":["// The Code \"engine\": syntax highlighting, tokenizing, layout, diffing, and\n// transition/phase scheduling — kept separate from node.ts so a copy of the node\n// can take just its declaration and import this behind\n// `@motionscript/code` instead. What gets copied is whatever this\n// package's registry.json declares, which for this component is node.ts;\n// src/tests/registry.test.ts checks that anything it\n// reaches for is either copied alongside it or re-exported from here.\nexport * from './transitions';\nexport * from './layout';\nexport { drawCode } from './render';\nexport type { CodeCanvas, DrawCodeState } from './render';\nexport { diffCode as defaultCodeDiff } from './diff';\nexport type { CodeDiffStrategy, CodeEdit } from './diff';\nexport { loadCodeLanguage, initSyntaxHighlighter, ensureHighlighter, registerCodeTheme, resolveTheme, canHighlight, normalizeSource } from './highlight';\nexport { tokenizeCodeToIdLines } from './tokens';\nexport type { IdLine, IdToken } from './tokens';\nexport { DefaultHighlightStyle, GithubDarkStyle, GithubLightStyle, VscodeDarkStyle, VscodeLightStyle, BUILTIN_THEMES, compileStyle } from './style';\nexport type { CodeHighlightStyle, CodeStyleRule, CodeTheme, CodeThemeName } from './style';\nexport { TokenAdvanceCache } from './measure-cache';\nexport { word, lines, rangeToCharOffsets, charOffsetsToRange, CodeRanges, CodeRangeChain } from './code-range';\nexport type { CodeRange } from './code-range';\n"]}