@motion-script/code 0.1.0

package/README.md

@@ -0,0 +1,85 @@
+# @motion-script/code
+
+Animated, syntax-highlighted code blocks for [Motion Script](https://motionscript.dev).
+The `Code` node tokenizes source with [Shiki](https://shiki.style) and animates
+edits at the token level, so appending, inserting, removing, replacing, and
+highlighting code all morph smoothly instead of snapping.
+
+```tsx
+import { Scene, createRef } from '@motion-script/core';
+import { Code, lines, word } from '@motion-script/code';
+
+export class CodeScene extends Scene {
+  *build() {
+    const code = createRef<Code>();
+
+    this.add(
+      <Code
+        ref={code}
+        language="typescript"
+        theme="github-dark"
+        fontSize={28}
+        code={`function greet(name) {\n  return "hi";\n}`}
+      />,
+    );
+
+    yield* code().append('\ngreet("world");', 0.6);
+    yield* code().highlight(lines(2), 0.4);
+    yield* code().replace(word(2, 10, 4), '`hi, ${name}`', 0.6);
+  }
+}
+```
+
+## What's in here
+
+- **`Code`** node, a hugging block of syntax-highlighted source. Set `code`,
+  `language`, and `theme` to switch what is shown; tune `fontSize`,
+  `fontFamily`, `lineHeight`, `letterSpacing`, `showLineNumbers`,
+  `lineNumberGap`, and `padding` for layout.
+- **Token-level transitions**, generator methods you `yield*` from a scene:
+  - `append(code, duration)` / `prepend(code, duration)`, fade in lines at the
+    end or start.
+  - `insert([line, col], code, duration)`, splice code into a line or grow new
+    lines mid-document.
+  - `remove(range, duration)`, collapse tokens (and whole lines) so surrounding
+    text reflows.
+  - `replace(range, next, duration)`, cross-fade old tokens out and new ones in.
+  - `highlight(range, duration)` / `resetHighlight(duration)`, dim everything
+    outside the range, then restore it.
+- **Range helpers**, `word(line, col, length)`, `lines(from, to)`, and
+  `range(startLine, startCol, endLine, endCol)` build the `CodeRange` values the
+  transitions take. `findFirstRange`, `findRangeAt`, and `findAllRanges` locate
+  ranges by matching literal text.
+- **`initSyntaxHighlighter(themes, langs)`**, optional preloading of Shiki
+  themes and languages so the first frame renders fully highlighted.
+
+Every token keeps a stable identity across edits, so concurrent animations at
+different positions do not clobber each other while one is mid-flight.
+
+This package builds on [`@motion-script/core`](../../core) (the scene graph and
+animation runtime) and renders through whatever backend draws the scene, such as
+[`@motion-script/web`](../../web).
+
+## Usage
+
+```bash
+npm install @motion-script/code
+```
+
+For a guided setup, scaffold a project instead with:
+
+```bash
+npm create motion-script@latest
+```
+
+See the [docs](https://motionscript.dev/docs) for the full feature set and API
+reference.
+
+## Development
+
+From the monorepo root:
+
+```bash
+pnpm --filter @motion-script/code build
+pnpm --filter @motion-script/code test
+```

package/dist/code-fragment.d.ts

@@ -0,0 +1,42 @@
+import { CodeMetrics } from './code-metrics';
+export interface CodeFragment {
+    before: CodeMetrics;
+    after: CodeMetrics;
+}
+export interface RawCodeFragment {
+    before: string;
+    after: string;
+}
+export type PossibleCodeFragment = CodeFragment | CodeMetrics | RawCodeFragment | string;
+export declare function metricsToFragment(value: CodeMetrics): CodeFragment;
+export declare function parseCodeFragment(value: PossibleCodeFragment, context: CanvasRenderingContext2D, monoWidth: number): CodeFragment;
+/**
+ * Create a code fragment that represents an insertion of code.
+ *
+ * @remarks
+ * Can be used in conjunction with {@link code.CodeSignalHelpers.edit}.
+ *
+ * @param code - The code to insert.
+ */
+export declare function insert(code: string): RawCodeFragment;
+/**
+ * Create a code fragment that represents a change from one piece of code to
+ * another.
+ *
+ * @remarks
+ * Can be used in conjunction with {@link code.CodeSignalHelpers.edit}.
+ *
+ * @param before - The code to change from.
+ * @param after - The code to change to.
+ */
+export declare function replace(before: string, after: string): RawCodeFragment;
+/**
+ * Create a code fragment that represents a removal of code.
+ *
+ * @remarks
+ * Can be used in conjunction with {@link code.CodeSignalHelpers.edit}.
+ *
+ * @param code - The code to remove.
+ */
+export declare function remove(code: string): RawCodeFragment;
+//# sourceMappingURL=code-fragment.d.ts.map

package/dist/code-fragment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-fragment.d.ts","sourceRoot":"","sources":["../src/code-fragment.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAgC,MAAM,gBAAgB,CAAC;AAE3E,MAAM,WAAW,YAAY;IACzB,MAAM,EAAE,WAAW,CAAC;IACpB,KAAK,EAAE,WAAW,CAAC;CACtB;AACD,MAAM,WAAW,eAAe;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,oBAAoB,GAC1B,YAAY,GACZ,WAAW,GACX,eAAe,GACf,MAAM,CAAC;AAEb,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,WAAW,GAAG,YAAY,CAKlE;AAED,wBAAgB,iBAAiB,CAC7B,KAAK,EAAE,oBAAoB,EAC3B,OAAO,EAAE,wBAAwB,EACjC,SAAS,EAAE,MAAM,GAClB,YAAY,CAoBd;AAED;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,eAAe,CAKpD;AAED;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,eAAe,CAKtE;AAED;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,eAAe,CAKpD"}

package/dist/code-fragment.js

@@ -0,0 +1,72 @@
+import { isCodeMetrics, measureString } from './code-metrics';
+export function metricsToFragment(value) {
+    return {
+        before: value,
+        after: value,
+    };
+}
+export function parseCodeFragment(value, context, monoWidth) {
+    let fragment;
+    if (typeof value === 'string') {
+        fragment = metricsToFragment(measureString(context, monoWidth, value));
+    }
+    else if (isCodeMetrics(value)) {
+        fragment = metricsToFragment(value);
+    }
+    else {
+        fragment = {
+            before: typeof value.before === 'string'
+                ? measureString(context, monoWidth, value.before)
+                : value.before,
+            after: typeof value.after === 'string'
+                ? measureString(context, monoWidth, value.after)
+                : value.after,
+        };
+    }
+    return fragment;
+}
+/**
+ * Create a code fragment that represents an insertion of code.
+ *
+ * @remarks
+ * Can be used in conjunction with {@link code.CodeSignalHelpers.edit}.
+ *
+ * @param code - The code to insert.
+ */
+export function insert(code) {
+    return {
+        before: '',
+        after: code,
+    };
+}
+/**
+ * Create a code fragment that represents a change from one piece of code to
+ * another.
+ *
+ * @remarks
+ * Can be used in conjunction with {@link code.CodeSignalHelpers.edit}.
+ *
+ * @param before - The code to change from.
+ * @param after - The code to change to.
+ */
+export function replace(before, after) {
+    return {
+        before,
+        after,
+    };
+}
+/**
+ * Create a code fragment that represents a removal of code.
+ *
+ * @remarks
+ * Can be used in conjunction with {@link code.CodeSignalHelpers.edit}.
+ *
+ * @param code - The code to remove.
+ */
+export function remove(code) {
+    return {
+        before: code,
+        after: '',
+    };
+}
+//# sourceMappingURL=code-fragment.js.map

package/dist/code-fragment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-fragment.js","sourceRoot":"","sources":["../src/code-fragment.ts"],"names":[],"mappings":"AAAA,OAAO,EAAe,aAAa,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAiB3E,MAAM,UAAU,iBAAiB,CAAC,KAAkB;IAChD,OAAO;QACH,MAAM,EAAE,KAAK;QACb,KAAK,EAAE,KAAK;KACf,CAAC;AACN,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC7B,KAA2B,EAC3B,OAAiC,EACjC,SAAiB;IAEjB,IAAI,QAAsB,CAAC;IAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC5B,QAAQ,GAAG,iBAAiB,CAAC,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;IAC3E,CAAC;SAAM,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;SAAM,CAAC;QACJ,QAAQ,GAAG;YACP,MAAM,EACF,OAAO,KAAK,CAAC,MAAM,KAAK,QAAQ;gBAC5B,CAAC,CAAC,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC;gBACjD,CAAC,CAAC,KAAK,CAAC,MAAM;YACtB,KAAK,EACD,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ;gBAC3B,CAAC,CAAC,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC;gBAChD,CAAC,CAAC,KAAK,CAAC,KAAK;SACxB,CAAC;IACN,CAAC;IAED,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAC,IAAY;IAC/B,OAAO;QACH,MAAM,EAAE,EAAE;QACV,KAAK,EAAE,IAAI;KACd,CAAC;AACN,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,OAAO,CAAC,MAAc,EAAE,KAAa;IACjD,OAAO;QACH,MAAM;QACN,KAAK;KACR,CAAC;AACN,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAC,IAAY;IAC/B,OAAO;QACH,MAAM,EAAE,IAAI;QACZ,KAAK,EAAE,EAAE;KACZ,CAAC;AACN,CAAC"}

package/dist/code-metrics.d.ts

@@ -0,0 +1,11 @@
+export interface CodeMetrics {
+    content: string;
+    newRows: number;
+    endColumn: number;
+    firstWidth: number;
+    maxWidth: number;
+    lastWidth: number;
+}
+export declare function measureString(context: CanvasRenderingContext2D, monoWidth: number, value: string): CodeMetrics;
+export declare function isCodeMetrics(value: any): value is CodeMetrics;
+//# sourceMappingURL=code-metrics.d.ts.map

package/dist/code-metrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-metrics.d.ts","sourceRoot":"","sources":["../src/code-metrics.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,WAAW;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACrB;AAED,wBAAgB,aAAa,CACzB,OAAO,EAAE,wBAAwB,EACjC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,GACd,WAAW,CA6Bb;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,GAAG,GAAG,KAAK,IAAI,WAAW,CAE9D"}

package/dist/code-metrics.js

@@ -0,0 +1,29 @@
+export function measureString(context, monoWidth, value) {
+    const lines = value.split('\n');
+    const lastLine = lines[lines.length - 1];
+    const firstWidth = Math.round(context.measureText(lines[0]).width / monoWidth);
+    let lastWidth = firstWidth;
+    let maxWidth = firstWidth;
+    for (let i = 1; i < lines.length; i++) {
+        const line = lines[i];
+        const width = Math.round(context.measureText(line).width / monoWidth);
+        if (width > maxWidth) {
+            maxWidth = width;
+        }
+    }
+    if (lines.length > 0) {
+        lastWidth = Math.round(context.measureText(lastLine).width / monoWidth);
+    }
+    return {
+        content: value,
+        newRows: lines.length - 1,
+        endColumn: lastLine.length,
+        firstWidth,
+        maxWidth,
+        lastWidth,
+    };
+}
+export function isCodeMetrics(value) {
+    return value?.content !== undefined;
+}
+//# sourceMappingURL=code-metrics.js.map

package/dist/code-metrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-metrics.js","sourceRoot":"","sources":["../src/code-metrics.ts"],"names":[],"mappings":"AASA,MAAM,UAAU,aAAa,CACzB,OAAiC,EACjC,SAAiB,EACjB,KAAa;IAEb,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CACzB,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAClD,CAAC;IACF,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,IAAI,QAAQ,GAAG,UAAU,CAAC;IAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC;QACtE,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACnB,QAAQ,GAAG,KAAK,CAAC;QACrB,CAAC;IACL,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnB,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC;IAC5E,CAAC;IAED,OAAO;QACH,OAAO,EAAE,KAAK;QACd,OAAO,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC;QACzB,SAAS,EAAE,QAAQ,CAAC,MAAM;QAC1B,UAAU;QACV,QAAQ;QACR,SAAS;KACZ,CAAC;AACN,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAU;IACpC,OAAO,KAAK,EAAE,OAAO,KAAK,SAAS,CAAC;AACxC,CAAC"}

package/dist/code-range.d.ts

@@ -0,0 +1,44 @@
+/**
+ * A range over a code document. Lines and columns are 1-indexed.
+ *
+ * `endLine`/`endCol` may be `Infinity` to mean "to the end of the line" or
+ * "to the end of the document".
+ */
+export interface CodeRange {
+    startLine: number;
+    startCol: number;
+    endLine: number;
+    endCol: number;
+}
+/**
+ * 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 declare function word(line: number, col: number, length?: number): CodeRange;
+/**
+ * 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 declare function lines(from: number, to?: number): CodeRange;
+/**
+ * Create an arbitrary range from (startLine, startCol) to (endLine, endCol).
+ */
+export declare function range(startLine: number, startCol: number, endLine: number, endCol: number): CodeRange;
+/**
+ * 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 declare function rangeToCharOffsets(r: CodeRange, lineLengths: number[]): {
+    start: number;
+    end: number;
+};
+//# sourceMappingURL=code-range.d.ts.map

package/dist/code-range.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-range.d.ts","sourceRoot":"","sources":["../src/code-range.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;GAOG;AACH,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAO1E;AAED;;;;;;;GAOG;AACH,wBAAgB,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAO1D;AAED;;GAEG;AACH,wBAAgB,KAAK,CACjB,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,GACf,SAAS,CAEX;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAC9B,CAAC,EAAE,SAAS,EACZ,WAAW,EAAE,MAAM,EAAE,GACtB;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CA8BhC"}

package/dist/code-range.js

@@ -0,0 +1,70 @@
+/**
+ * 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,
+    };
+}
+/**
+ * Create an arbitrary range from (startLine, startCol) to (endLine, endCol).
+ */
+export function range(startLine, startCol, endLine, endCol) {
+    return { startLine, startCol, endLine, endCol };
+}
+/**
+ * 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
+    const sLine = clampLine(r.startLine);
+    const eLine = clampLine(r.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 = r.endCol === Infinity
+        ? eColMax
+        : Math.max(0, Math.min(eColMax, r.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) };
+}
+//# 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;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CACjB,SAAiB,EACjB,QAAgB,EAChB,OAAe,EACf,MAAc;IAEd,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AACpD,CAAC;AAED;;;;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,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACnC,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,CAAC,CAAC,MAAM,KAAK,QAAQ;QAC9B,CAAC,CAAC,OAAO;QACT,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEnD,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"}

package/dist/diff.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Performs a patience diff on two arrays of strings, returning an object
+ * containing the lines that were deleted, inserted, and potentially moved
+ * lines. The plus parameter can result in a significant performance hit due
+ * to additional Longest Common Substring searches.
+ *
+ * @param aLines - The original array of strings
+ * @param bLines - The new array of strings
+ * @param plus - Whether to return the moved lines
+ *
+ * Adapted from Jonathan "jonTrent" Trent's patience-diff algorithm.
+ * Types and tests added by Hunter "hhenrichsen" Henrichsen.
+ *
+ * {@link https://github.com/jonTrent/PatienceDiff}
+ */
+export declare function patienceDiff(aLines: string[], bLines: string[]): {
+    lines: {
+        line: string;
+        aIndex: number;
+        bIndex: number;
+    }[];
+    lineCountDeleted: number;
+    lineCountInserted: number;
+};
+/**
+ * Utility function for debugging patienceDiff.
+ *
+ * @internal
+ */
+export declare function printDiff(diff: ReturnType<typeof patienceDiff>): void;
+//# 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":"AAMA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,YAAY,CACxB,MAAM,EAAE,MAAM,EAAE,EAChB,MAAM,EAAE,MAAM,EAAE,GACjB;IACC,KAAK,EAAE;QACH,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;KAClB,EAAE,CAAC;IACJ,gBAAgB,EAAE,MAAM,CAAC;IACzB,iBAAiB,EAAE,MAAM,CAAC;CAC7B,CA6QA;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,OAAO,YAAY,CAAC,QAU9D"}

package/dist/diff.js

@@ -0,0 +1,236 @@
+/**
+ * Performs a patience diff on two arrays of strings, returning an object
+ * containing the lines that were deleted, inserted, and potentially moved
+ * lines. The plus parameter can result in a significant performance hit due
+ * to additional Longest Common Substring searches.
+ *
+ * @param aLines - The original array of strings
+ * @param bLines - The new array of strings
+ * @param plus - Whether to return the moved lines
+ *
+ * Adapted from Jonathan "jonTrent" Trent's patience-diff algorithm.
+ * Types and tests added by Hunter "hhenrichsen" Henrichsen.
+ *
+ * {@link https://github.com/jonTrent/PatienceDiff}
+ */
+export function patienceDiff(aLines, bLines) {
+    /**
+     * Finds all unique values in lines[start...end], inclusive. This
+     * function is used in preparation for determining the longest common
+     * subsequence.
+     *
+     * @param lines - The array to search
+     * @param start - The starting index (inclusive)
+     * @param end - The ending index (inclusive)
+     * @returns A map of the unique lines to their index
+     */
+    function findUnique(lines, start, end) {
+        const lineMap = new Map();
+        for (let i = start; i <= end; i++) {
+            const line = lines[i];
+            const data = lineMap.get(line);
+            if (data) {
+                data.count++;
+                data.index = i;
+            }
+            else {
+                lineMap.set(line, { count: 1, index: i });
+            }
+        }
+        const newMap = new Map();
+        for (const [key, value] of lineMap) {
+            if (value.count === 1) {
+                newMap.set(key, value.index);
+            }
+        }
+        return newMap;
+    }
+    /**
+     * Finds all the unique common entries between aArray[aStart...aEnd] and
+     * bArray[bStart...bEnd], inclusive. This function uses findUnique to pare
+     * down the aArray and bArray ranges first, before then walking the
+     * comparison between the two arrays.
+     *
+     *
+     * @param aArray - The original array
+     * @param aStart - The start of the original array to search
+     * @param aEnd - The end of the original array to search, inclusive
+     * @param bArray - The new array
+     * @param bStart - the start of the new array to search
+     * @param bEnd - The end of the new array to search, inclusive
+     * @returns a Map, with the key as the common line between aArray and
+     * bArray, with the value as an object containing the array indices of the
+     * matching uniqe lines.
+     */
+    function uniqueCommon(aArray, aStart, aEnd, bArray, bStart, bEnd) {
+        const aUnique = findUnique(aArray, aStart, aEnd);
+        const bUnique = findUnique(bArray, bStart, bEnd);
+        return [...aUnique.entries()].reduce((paired, [key, value]) => {
+            const bIndex = bUnique.get(key);
+            if (bIndex !== undefined) {
+                paired.set(key, {
+                    aIndex: value,
+                    bIndex,
+                });
+            }
+            return paired;
+        }, new Map());
+    }
+    /**
+     * Takes a map from the unique common lines between two arrays and determines
+     * the longest common subsequence.
+     *
+     * @see uniqueCommon
+     *
+     * @param abMap - The map of unique common lines between two arrays.
+     * @returns An array of objects containing the indices of the longest common
+     * subsequence.
+     */
+    function longestCommonSubsequence(abMap) {
+        const jagged = [];
+        abMap.forEach(value => {
+            let i = 0;
+            while (jagged[i] && jagged[i].at(-1).bIndex < value.bIndex) {
+                i++;
+            }
+            if (i > 0) {
+                value.prev = jagged[i - 1].at(-1);
+            }
+            if (!jagged[i]) {
+                jagged[i] = [value];
+            }
+            else {
+                jagged[i].push(value);
+            }
+        });
+        // Pull out the longest common subsequence
+        let lcs = [];
+        if (jagged.length > 0) {
+            lcs = [jagged.at(-1).at(-1)];
+            let cursor = lcs.at(-1);
+            while (cursor?.prev) {
+                cursor = cursor.prev;
+                lcs.push(cursor);
+            }
+        }
+        return lcs.reverse();
+    }
+    /**
+     * Keeps track of the aLines that have been deleted, are shared between aLines
+     * and bLines, and bLines that have been inserted.
+     */
+    const result = [];
+    let deleted = 0;
+    let inserted = 0;
+    function addToResult(aIndex, bIndex) {
+        if (bIndex < 0) {
+            deleted++;
+        }
+        else if (aIndex < 0) {
+            inserted++;
+        }
+        result.push({
+            line: 0 <= aIndex ? aLines[aIndex] : bLines[bIndex],
+            aIndex,
+            bIndex,
+            moved: false,
+        });
+    }
+    function addSubMatch(aStart, aEnd, bStart, bEnd) {
+        // Match any lines at the beginning of aLines and bLines.
+        while (aStart <= aEnd &&
+            bStart <= bEnd &&
+            aLines[aStart] === bLines[bStart]) {
+            addToResult(aStart++, bStart++);
+        }
+        // Match any lines at the end of aLines and bLines, but don't place them
+        // in the "result" array just yet, as the lines between these matches at
+        // the beginning and the end need to be analyzed first.
+        const aEndTemp = aEnd;
+        while (aStart <= aEnd && bStart <= bEnd && aLines[aEnd] === bLines[bEnd]) {
+            aEnd--;
+            bEnd--;
+        }
+        // Now, check to determine with the remaining lines in the subsequence
+        // whether there are any unique common lines between aLines and bLines.
+        //
+        // If not, add the subsequence to the result (all aLines having been
+        // deleted, and all bLines having been inserted).
+        //
+        // If there are unique common lines between aLines and bLines, then let's
+        // recursively perform the patience diff on the subsequence.
+        const uniqueCommonMap = uniqueCommon(aLines, aStart, aEnd, bLines, bStart, bEnd);
+        if (uniqueCommonMap.size === 0) {
+            while (aStart <= aEnd) {
+                addToResult(aStart++, -1);
+            }
+            while (bStart <= bEnd) {
+                addToResult(-1, bStart++);
+            }
+        }
+        else {
+            recurseLCS(aStart, aEnd, bStart, bEnd, uniqueCommonMap);
+        }
+        // Finally, let's add the matches at the end to the result.
+        while (aEnd < aEndTemp) {
+            addToResult(++aEnd, ++bEnd);
+        }
+    }
+    /**
+     * Finds the longest common subsequence between the arrays
+     * aLines[aStart...aEnd] and bLines[bStart...bEnd], inclusive. Then for each
+     * subsequence, recursively performs another LCS search (via addSubMatch),
+     * until there are none found, at which point the subsequence is dumped to
+     * the result.
+     *
+     * @param aStart - The start of the original array to search
+     * @param aEnd - The end of the original array to search, inclusive
+     * @param bStart - The start of the new array to search
+     * @param bEnd - The end of the new array to search, inclusive
+     * @param uniqueCommonMap - A map of the unique common lines between
+     * aLines[aStart...aEnd] and bLines[bStart...bEnd], inclusive.
+     */
+    function recurseLCS(aStart, aEnd, bStart, bEnd, uniqueCommonMap = uniqueCommon(aLines, aStart, aEnd, bLines, bStart, bEnd)) {
+        const lcs = longestCommonSubsequence(uniqueCommonMap);
+        if (lcs.length === 0) {
+            addSubMatch(aStart, aEnd, bStart, bEnd);
+        }
+        else {
+            if (aStart < lcs[0].aIndex || bStart < lcs[0].bIndex) {
+                addSubMatch(aStart, lcs[0].aIndex - 1, bStart, lcs[0].bIndex - 1);
+            }
+            let i;
+            for (i = 0; i < lcs.length - 1; i++) {
+                addSubMatch(lcs[i].aIndex, lcs[i + 1].aIndex - 1, lcs[i].bIndex, lcs[i + 1].bIndex - 1);
+            }
+            if (lcs[i].aIndex <= aEnd || lcs[i].bIndex <= bEnd) {
+                addSubMatch(lcs[i].aIndex, aEnd, lcs[i].bIndex, bEnd);
+            }
+        }
+    }
+    recurseLCS(0, aLines.length - 1, 0, bLines.length - 1);
+    return {
+        lines: result,
+        lineCountDeleted: deleted,
+        lineCountInserted: inserted,
+    };
+}
+/**
+ * Utility function for debugging patienceDiff.
+ *
+ * @internal
+ */
+export function printDiff(diff) {
+    diff.lines.forEach(line => {
+        if (line.bIndex < 0) {
+            console.log(`- ${line.line}`);
+        }
+        else if (line.aIndex < 0) {
+            console.log(`+ ${line.line}`);
+        }
+        else {
+            console.log(`  ${line.line}`);
+        }
+    });
+}
+//# sourceMappingURL=diff.js.map

package/dist/diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.js","sourceRoot":"","sources":["../src/diff.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,YAAY,CACxB,MAAgB,EAChB,MAAgB;IAUhB;;;;;;;;;OASG;IACH,SAAS,UAAU,CAAC,KAAe,EAAE,KAAa,EAAE,GAAW;QAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4C,CAAC;QACpE,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,IAAI,EAAE,CAAC;gBACP,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACJ,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,CAAC;QACL,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACH,SAAS,YAAY,CACjB,MAAgB,EAChB,MAAc,EACd,IAAY,EACZ,MAAgB,EAChB,MAAc,EACd,IAAY;QAEZ,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAEjD,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAChC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE;YACrB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE;oBACZ,MAAM,EAAE,KAAK;oBACb,MAAM;iBACT,CAAC,CAAC;YACP,CAAC;YACD,OAAO,MAAM,CAAC;QAClB,CAAC,EACD,IAAI,GAAG,EAAE,CACZ,CAAC;IACN,CAAC;IAED;;;;;;;;;OASG;IACH,SAAS,wBAAwB,CAC7B,KAA+B;QAE/B,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YAClB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC1D,CAAC,EAAE,CAAC;YACR,CAAC;YAED,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACR,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACb,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,0CAA0C;QAC1C,IAAI,GAAG,GAAkB,EAAE,CAAC;QAE5B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;YAC/B,IAAI,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,OAAO,MAAM,EAAE,IAAI,EAAE,CAAC;gBAClB,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;gBACrB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QAED,OAAO,GAAG,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,MAAM,MAAM,GAKN,EAAE,CAAC;IACT,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,SAAS,WAAW,CAAC,MAAc,EAAE,MAAc;QAC/C,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACb,OAAO,EAAE,CAAC;QACd,CAAC;aAAM,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,QAAQ,EAAE,CAAC;QACf,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;YACR,IAAI,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;YACnD,MAAM;YACN,MAAM;YACN,KAAK,EAAE,KAAK;SACf,CAAC,CAAC;IACP,CAAC;IAED,SAAS,WAAW,CAChB,MAAc,EACd,IAAY,EACZ,MAAc,EACd,IAAY;QAEZ,yDAAyD;QACzD,OACI,MAAM,IAAI,IAAI;YACd,MAAM,IAAI,IAAI;YACd,MAAM,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,EACnC,CAAC;YACC,WAAW,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QACpC,CAAC;QAED,wEAAwE;QACxE,wEAAwE;QACxE,uDAAuD;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC;QACtB,OAAO,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACvE,IAAI,EAAE,CAAC;YACP,IAAI,EAAE,CAAC;QACX,CAAC;QAED,sEAAsE;QACtE,uEAAuE;QACvE,EAAE;QACF,oEAAoE;QACpE,iDAAiD;QACjD,EAAE;QACF,yEAAyE;QACzE,4DAA4D;QAC5D,MAAM,eAAe,GAAG,YAAY,CAChC,MAAM,EACN,MAAM,EACN,IAAI,EACJ,MAAM,EACN,MAAM,EACN,IAAI,CACP,CAAC;QAEF,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,MAAM,IAAI,IAAI,EAAE,CAAC;gBACpB,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,MAAM,IAAI,IAAI,EAAE,CAAC;gBACpB,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QAC5D,CAAC;QAED,2DAA2D;QAC3D,OAAO,IAAI,GAAG,QAAQ,EAAE,CAAC;YACrB,WAAW,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,SAAS,UAAU,CACf,MAAc,EACd,IAAY,EACZ,MAAc,EACd,IAAY,EACZ,kBAA4C,YAAY,CACpD,MAAM,EACN,MAAM,EACN,IAAI,EACJ,MAAM,EACN,MAAM,EACN,IAAI,CACP;QAED,MAAM,GAAG,GAAG,wBAAwB,CAAC,eAAe,CAAC,CAAC;QAEtD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnB,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACJ,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;gBACnD,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACtE,CAAC;YAED,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,WAAW,CACP,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EACb,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EACrB,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EACb,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CACxB,CAAC;YACN,CAAC;YAED,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBACjD,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC1D,CAAC;QACL,CAAC;IACL,CAAC;IAED,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEvD,OAAO;QACH,KAAK,EAAE,MAAM;QACb,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,QAAQ;KAC9B,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,IAAqC;IAC3D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACtB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClB,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC;aAAM,CAAC;YACJ,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC;IACL,CAAC,CAAC,CAAC;AACP,CAAC"}