effect 4.0.4 → 4.0.6

package/dist/TextDiff.js

@@ -0,0 +1,634 @@
+/**
+ * The `TextDiff` module computes edit scripts for arrays and text, applies and
+ * inverts them, and formats line differences as unified diffs.
+ *
+ * Scripts are computed with Myers' O(ND) algorithm in linear space, after
+ * trimming common prefixes and suffixes. Scripts are minimal unless the
+ * optional `maxEdits` search cap is exceeded. Word diffs, semantic cleanup
+ * and collaborative editing protocols are out of scope.
+ *
+ * @stability experimental
+ * @since 4.0.6
+ */
+import * as Data from "./Data.js";
+import * as Equal from "./Equal.js";
+import { hasProperty } from "./Predicate.js";
+import * as Result from "./Result.js";
+const TextDiffErrorTypeId = "~effect/TextDiff/TextDiffError";
+/**
+ * Error returned when an edit script does not fit the input it is applied to.
+ *
+ * **Example** (Rejecting a script made for other input)
+ *
+ * ```ts import.meta.vitest
+ * import { Result, TextDiff } from "effect"
+ *
+ * const edits = TextDiff.diff([1, 2], [1])
+ *
+ * Result.mapError(TextDiff.apply([1], edits), TextDiff.isTextDiffError) // => Result.fail(true)
+ * ```
+ *
+ * @see {@link apply} and {@link applyText} for the operations that return it
+ * @see {@link isTextDiffError} for narrowing unknown values
+ * @stability experimental
+ * @category errors
+ * @since 4.0.6
+ */
+export class TextDiffError extends /*#__PURE__*/Data.TaggedError("TextDiffError") {
+  [TextDiffErrorTypeId] = TextDiffErrorTypeId;
+}
+/**
+ * Checks whether a value is a `TextDiffError`.
+ *
+ * @stability experimental
+ * @category guards
+ * @since 4.0.6
+ */
+export const isTextDiffError = u => hasProperty(u, TextDiffErrorTypeId);
+/**
+ * Creates a function that computes a minimal edit script between two arrays
+ * using a custom equivalence.
+ *
+ * **When to use**
+ *
+ * Use when items should match by key or by a structural comparison other than
+ * `Equal.equals`.
+ *
+ * **Details**
+ *
+ * Unless the `maxEdits` cap is exceeded, the script has the
+ * fewest possible inserted plus deleted items. `Equal` runs carry the items
+ * from `before`, not necessarily the exact values from `after`.
+ *
+ * **Gotchas**
+ *
+ * Without `maxEdits`, work grows with the product of the input size and the
+ * number of differences, which is quadratic for unrelated inputs. Set
+ * `maxEdits` for large or untrusted inputs.
+ *
+ * **Example** (Matching items by id)
+ *
+ * ```ts import.meta.vitest
+ * import { TextDiff } from "effect"
+ *
+ * const diffById = TextDiff.diffWith<{ readonly id: number }>((a, b) => a.id === b.id)
+ *
+ * diffById([{ id: 1 }, { id: 2 }], [{ id: 2 }]) // => [{ _tag: "Delete", items: [{ id: 1 }] }, { _tag: "Equal", items: [{ id: 2 }] }]
+ * ```
+ *
+ * @see {@link diff} for the `Equal.equals` variant
+ * @stability experimental
+ * @category constructors
+ * @since 4.0.6
+ */
+export const diffWith = isEquivalent => (before, after, options) => editScript(before, after, (i, j) => isEquivalent(before[i], after[j]), options?.maxEdits);
+/**
+ * Computes a minimal edit script between two arrays, comparing items with
+ * `Equal.equals`.
+ *
+ * **Details**
+ *
+ * Unless the `maxEdits` cap is exceeded, the script has the
+ * fewest possible inserted plus deleted items. The choice is deterministic,
+ * and each change lists its deletions before its insertions.
+ *
+ * **Gotchas**
+ *
+ * Without `maxEdits`, work is quadratic for unrelated inputs. Set `maxEdits`
+ * when diffing large or untrusted arrays.
+ *
+ * **Example** (Diffing two arrays)
+ *
+ * ```ts import.meta.vitest
+ * import { TextDiff } from "effect"
+ *
+ * TextDiff.diff([1, 2, 3, 4], [1, 3, 4, 5]) // => [{ _tag: "Equal", items: [1] }, { _tag: "Delete", items: [2] }, { _tag: "Equal", items: [3, 4] }, { _tag: "Insert", items: [5] }]
+ * ```
+ *
+ * @see {@link diffWith} to compare items with a custom equivalence
+ * @see {@link apply} to replay a script
+ * @stability experimental
+ * @category constructors
+ * @since 4.0.6
+ */
+export const diff = (before, after, options) => diffWith(Equal.equals)(before, after, options);
+/**
+ * Computes a minimal line-level edit script between two strings.
+ *
+ * **Details**
+ *
+ * Each line keeps its `\n` terminator, so `\n` versus `\r\n` endings and a
+ * missing final newline are reported as changes. Joining the items of a run
+ * gives the exact text it covers.
+ *
+ * **Gotchas**
+ *
+ * Without `maxEdits`, work is quadratic for unrelated inputs. Set `maxEdits`
+ * when diffing large or untrusted text.
+ *
+ * **Example** (Diffing lines)
+ *
+ * ```ts import.meta.vitest
+ * import { TextDiff } from "effect"
+ *
+ * TextDiff.lines("a\nb\n", "a\nc\n") // => [{ _tag: "Equal", items: ["a\n"] }, { _tag: "Delete", items: ["b\n"] }, { _tag: "Insert", items: ["c\n"] }]
+ * ```
+ *
+ * @see {@link codePoints} for a code point diff
+ * @see {@link unified} to format a line diff
+ * @stability experimental
+ * @category constructors
+ * @since 4.0.6
+ */
+export const lines = (before, after, options) => diffStrings(splitLines(before), splitLines(after), options?.maxEdits);
+/**
+ * Computes a minimal code point edit script between two strings.
+ *
+ * **Details**
+ *
+ * Items are Unicode code points, so a surrogate pair is never split between
+ * runs. Grapheme clusters, such as an emoji with modifiers or a letter with
+ * combining marks, can still be split. The UTF-16 length of a run is the sum
+ * of its items' lengths.
+ *
+ * **Gotchas**
+ *
+ * Without `maxEdits`, work is quadratic for unrelated inputs. Set `maxEdits`
+ * when diffing large or untrusted text.
+ *
+ * **Example** (Diffing code points)
+ *
+ * ```ts import.meta.vitest
+ * import { TextDiff } from "effect"
+ *
+ * TextDiff.codePoints("cat", "cut") // => [{ _tag: "Equal", items: ["c"] }, { _tag: "Delete", items: ["a"] }, { _tag: "Insert", items: ["u"] }, { _tag: "Equal", items: ["t"] }]
+ * ```
+ *
+ * @see {@link lines} for a line diff
+ * @see {@link applyText} to replay a script on a string
+ * @stability experimental
+ * @category constructors
+ * @since 4.0.6
+ */
+export const codePoints = (before, after, options) => diffStrings(Array.from(before), Array.from(after), options?.maxEdits);
+/**
+ * Applies an edit script to an array.
+ *
+ * **Details**
+ *
+ * `Equal` and `Delete` runs consume items from `before` by count, `Equal` runs
+ * copy them to the result, and `Insert` runs add their items. Run contents are
+ * not compared with `before`, since under a custom equivalence `Equal` items
+ * can differ from the input.
+ *
+ * **Gotchas**
+ *
+ * Fails with a {@link TextDiffError} when the runs do not consume exactly
+ * `before.length` items.
+ *
+ * **Example** (Replaying a script)
+ *
+ * ```ts import.meta.vitest
+ * import { Result, TextDiff } from "effect"
+ *
+ * const edits = TextDiff.diff([1, 2, 3], [1, 3, 4])
+ *
+ * TextDiff.apply([1, 2, 3], edits) // => Result.succeed([1, 3, 4])
+ * ```
+ *
+ * @see {@link applyText} for the string variant
+ * @see {@link invert} to apply a script in reverse
+ * @stability experimental
+ * @category combinators
+ * @since 4.0.6
+ */
+export const apply = (before, edits) => {
+  const out = [];
+  let index = 0;
+  for (const edit of edits) {
+    if (edit._tag === "Insert") {
+      for (const item of edit.items) out.push(item);
+      continue;
+    }
+    const end = index + edit.items.length;
+    if (end > before.length) return fail("Edit script consumes more items than the input contains");
+    if (edit._tag === "Equal") {
+      for (let i = index; i < end; i++) out.push(before[i]);
+    }
+    index = end;
+  }
+  if (index !== before.length) return fail("Edit script consumes fewer items than the input contains");
+  return Result.succeed(out);
+};
+/**
+ * Applies a text edit script to a string.
+ *
+ * **Details**
+ *
+ * Works with scripts from both {@link lines} and {@link codePoints}. The
+ * joined items of each `Equal` and `Delete` run must match `before` at the
+ * current position, so a script made for different text is rejected rather
+ * than applied.
+ *
+ * **Gotchas**
+ *
+ * Fails with a {@link TextDiffError} when a run does not match `before`, or
+ * when the runs do not cover all of it.
+ *
+ * **Example** (Replaying a code point diff)
+ *
+ * ```ts import.meta.vitest
+ * import { Result, TextDiff } from "effect"
+ *
+ * const edits = TextDiff.codePoints("cat", "cut")
+ *
+ * TextDiff.applyText("cat", edits) // => Result.succeed("cut")
+ * ```
+ *
+ * @see {@link apply} for the array variant
+ * @stability experimental
+ * @category combinators
+ * @since 4.0.6
+ */
+export const applyText = (before, edits) => {
+  let out = "";
+  let index = 0;
+  for (const edit of edits) {
+    const text = edit.items.join("");
+    if (edit._tag === "Insert") {
+      out += text;
+      continue;
+    }
+    if (!before.startsWith(text, index)) return fail(`Edit script does not match the input at index ${index}`);
+    if (edit._tag === "Equal") out += text;
+    index += text.length;
+  }
+  if (index !== before.length) return fail("Edit script covers less text than the input contains");
+  return Result.succeed(out);
+};
+/**
+ * Inverts an edit script, so it turns `after` back into `before`.
+ *
+ * **Details**
+ *
+ * Swaps the items of each change's `Delete` and `Insert` runs, keeping
+ * deletions before insertions. `Equal` runs are unchanged.
+ *
+ * **Example** (Undoing a change)
+ *
+ * ```ts import.meta.vitest
+ * import { Result, TextDiff } from "effect"
+ *
+ * const edits = TextDiff.diff([1, 2], [1, 3])
+ *
+ * TextDiff.apply([1, 3], TextDiff.invert(edits)) // => Result.succeed([1, 2])
+ * ```
+ *
+ * @stability experimental
+ * @category combinators
+ * @since 4.0.6
+ */
+export const invert = edits => {
+  const out = [];
+  let deleted = [];
+  let inserted = [];
+  const flush = () => {
+    if (inserted.length > 0) out.push({
+      _tag: "Delete",
+      items: inserted
+    });
+    if (deleted.length > 0) out.push({
+      _tag: "Insert",
+      items: deleted
+    });
+    deleted = [];
+    inserted = [];
+  };
+  for (const edit of edits) {
+    if (edit._tag === "Delete") {
+      deleted = deleted.concat(edit.items);
+    } else if (edit._tag === "Insert") {
+      inserted = inserted.concat(edit.items);
+    } else {
+      flush();
+      out.push(edit);
+    }
+  }
+  flush();
+  return out;
+};
+/**
+ * Formats a line edit script as a unified diff.
+ *
+ * **Details**
+ *
+ * The script must come from {@link lines}, or otherwise hold one line per
+ * item. The output follows `diff -u`: hunks whose context would touch or
+ * overlap are merged, and a final line without a newline is followed by
+ * ``. When `fromFile` or `toFile` is set, both
+ * header lines are emitted and an unset name falls back to the other. A script
+ * without changes produces an empty string.
+ *
+ * **Gotchas**
+ *
+ * Among equally small diffs, hunks can differ from those of GNU diff or Git,
+ * which apply extra heuristics.
+ *
+ * **Example** (Formatting a unified diff)
+ *
+ * ```ts import.meta.vitest
+ * import { TextDiff } from "effect"
+ *
+ * TextDiff.unified(TextDiff.lines("a\nb\n", "a\nc\n")) // => "@@ -1,2 +1,2 @@\n a\n-b\n+c\n"
+ * ```
+ *
+ * @see {@link lines} to compute a line diff
+ * @stability experimental
+ * @category formatting
+ * @since 4.0.6
+ */
+export const unified = (edits, options) => {
+  const a = [];
+  const b = [];
+  // Group consecutive deletions and insertions between Equal runs.
+  const changes = [];
+  let change;
+  for (const edit of edits) {
+    if (edit._tag === "Equal") {
+      change = undefined;
+      for (const line of edit.items) {
+        a.push(line);
+        b.push(line);
+      }
+      continue;
+    }
+    if (edit.items.length === 0) continue;
+    if (change === undefined) {
+      change = {
+        a0: a.length,
+        a1: a.length,
+        b0: b.length,
+        b1: b.length
+      };
+      changes.push(change);
+    }
+    if (edit._tag === "Delete") {
+      for (const line of edit.items) a.push(line);
+      change.a1 = a.length;
+    } else {
+      for (const line of edit.items) b.push(line);
+      change.b1 = b.length;
+    }
+  }
+  if (changes.length === 0) return "";
+  const context = Math.max(0, Math.floor(options?.context ?? 3));
+  let out = "";
+  if (options?.fromFile !== undefined || options?.toFile !== undefined) {
+    out += `--- ${options.fromFile ?? options.toFile}\n+++ ${options.toFile ?? options.fromFile}\n`;
+  }
+  let start = 0;
+  while (start < changes.length) {
+    let end = start + 1;
+    while (end < changes.length && changes[end].a0 - changes[end - 1].a1 <= 2 * context) end++;
+    const first = changes[start];
+    const last = changes[end - 1];
+    const a0 = Math.max(0, first.a0 - context);
+    const b0 = first.b0 - (first.a0 - a0);
+    const a1 = Math.min(a.length, last.a1 + context);
+    const b1 = last.b1 + (a1 - last.a1);
+    out += `@@ -${range(a0, a1 - a0)} +${range(b0, b1 - b0)} @@\n`;
+    let line = a0;
+    for (let c = start; c < end; c++) {
+      const change = changes[c];
+      for (; line < change.a0; line++) out += formatLine(" ", a[line]);
+      for (let k = change.a0; k < change.a1; k++) out += formatLine("-", a[k]);
+      for (let k = change.b0; k < change.b1; k++) out += formatLine("+", b[k]);
+      line = change.a1;
+    }
+    for (; line < a1; line++) out += formatLine(" ", a[line]);
+    start = end;
+  }
+  return out;
+};
+// -----------------------------------------------------------------------------
+// internal
+// -----------------------------------------------------------------------------
+const fail = message => Result.fail(new TextDiffError({
+  message
+}));
+const splitLines = text => text.match(/[^\n]*\n|[^\n]+$/g) ?? [];
+const range = (start, count) => count === 0 ? `${start},0` : count === 1 ? `${start + 1}` : `${start + 1},${count}`;
+const formatLine = (prefix, line) => line.endsWith("\n") ? prefix + line : `${prefix}${line}\n\\n`;
+// Interns the tokens so the search compares integers instead of strings
+const diffStrings = (a, b, maxEdits) => {
+  const ids = new Map();
+  const intern = token => {
+    let id = ids.get(token);
+    if (id === undefined) {
+      id = ids.size;
+      ids.set(token, id);
+    }
+    return id;
+  };
+  const ai = Int32Array.from(a, intern);
+  const bi = Int32Array.from(b, intern);
+  return editScript(a, b, (i, j) => ai[i] === bi[j], maxEdits);
+};
+const editScript = (a, b, equals, maxEdits) => {
+  const blocks = matchingBlocks(a.length, b.length, equals, maxEdits);
+  // A final empty block flushes the trailing changes
+  blocks.push({
+    a: a.length,
+    b: b.length,
+    length: 0
+  });
+  const out = [];
+  let i = 0;
+  let j = 0;
+  for (const block of blocks) {
+    if (block.a > i) out.push({
+      _tag: "Delete",
+      items: a.slice(i, block.a)
+    });
+    if (block.b > j) out.push({
+      _tag: "Insert",
+      items: b.slice(j, block.b)
+    });
+    if (block.length > 0) out.push({
+      _tag: "Equal",
+      items: a.slice(block.a, block.a + block.length)
+    });
+    i = block.a + block.length;
+    j = block.b + block.length;
+  }
+  return out;
+};
+/**
+ * Returns ordered, merged matching runs for sequences of lengths n and m,
+ * using the index comparator. Linear-space Myers search splits each region
+ * at the middle snake of a minimal path, or at the furthest point reached
+ * when the search cap is exceeded.
+ */
+const matchingBlocks = (n, m, equals, maxEdits = Infinity) => {
+  const blocks = [];
+  const push = (a, b, length) => {
+    if (length === 0) return;
+    const last = blocks[blocks.length - 1];
+    if (last !== undefined && last.a + last.length === a && last.b + last.length === b) {
+      blocks[blocks.length - 1] = {
+        a: last.a,
+        b: last.b,
+        length: last.length + length
+      };
+    } else {
+      blocks.push({
+        a,
+        b,
+        length
+      });
+    }
+  };
+  // Forward and reverse furthest-reaching x per diagonal, offset by n + m + 1
+  const offset = n + m + 1;
+  const vf = new Int32Array(2 * offset + 1);
+  const vb = new Int32Array(2 * offset + 1);
+  // The searches meet after half the edits of a region, so a region needing at
+  // most `maxEdits` edits is solved within `maxD` steps of each search
+  const maxD = Math.ceil(Math.max(0, maxEdits) / 2);
+  // Returns the middle snake of a minimal path in absolute coordinates, or an
+  // empty snake at the furthest point reached when the region needs more than
+  // `maxEdits` edits, or undefined when no point inside the region was reached
+  const findSplit = (aLo, aHi, bLo, bHi) => {
+    const N = aHi - aLo;
+    const M = bHi - bLo;
+    const delta = N - M;
+    const odd = (delta & 1) === 1;
+    const limit = Math.min(N + M + 1 >> 1, maxD);
+    vf[offset + 1] = 0;
+    vb[offset + 1] = 0;
+    for (let d = 0; d <= limit; d++) {
+      for (let k = -d; k <= d; k += 2) {
+        let x = k === -d || k !== d && vf[offset + k - 1] < vf[offset + k + 1] ? vf[offset + k + 1] : vf[offset + k - 1] + 1;
+        let y = x - k;
+        const x0 = x;
+        const y0 = y;
+        while (x < N && y < M && equals(aLo + x, bLo + y)) {
+          x++;
+          y++;
+        }
+        vf[offset + k] = x;
+        if (odd && k >= delta - (d - 1) && k <= delta + (d - 1) && x + vb[offset + delta - k] >= N) {
+          return {
+            x: aLo + x0,
+            y: bLo + y0,
+            u: aLo + x,
+            v: bLo + y
+          };
+        }
+      }
+      for (let k = -d; k <= d; k += 2) {
+        let x = k === -d || k !== d && vb[offset + k - 1] < vb[offset + k + 1] ? vb[offset + k + 1] : vb[offset + k - 1] + 1;
+        let y = x - k;
+        const x0 = x;
+        const y0 = y;
+        while (x < N && y < M && equals(aHi - x - 1, bHi - y - 1)) {
+          x++;
+          y++;
+        }
+        vb[offset + k] = x;
+        if (!odd && k >= delta - d && k <= delta + d && x + vf[offset + delta - k] >= N) {
+          return {
+            x: aHi - x,
+            y: bHi - y,
+            u: aHi - x0,
+            v: bHi - y0
+          };
+        }
+      }
+    }
+    // Over the cap: split at the reached point that covers the most items. It
+    // must lie strictly inside the region so that both parts shrink
+    let best = 0;
+    let x = 0;
+    let y = 0;
+    for (let k = -limit; k <= limit; k += 2) {
+      const xf = vf[offset + k];
+      const yf = xf - k;
+      if (xf <= N && yf >= 0 && yf <= M && xf + yf > best) {
+        best = xf + yf;
+        x = aLo + xf;
+        y = bLo + yf;
+      }
+      const xb = vb[offset + k];
+      const yb = xb - k;
+      if (xb <= N && yb >= 0 && yb <= M && xb + yb > best) {
+        best = xb + yb;
+        x = aHi - xb;
+        y = bHi - yb;
+      }
+    }
+    return best > 0 && best < N + M ? {
+      x,
+      y,
+      u: x,
+      v: y
+    } : undefined;
+  };
+  // Regions are processed in order from an explicit stack, since splits over
+  // the cap can nest deeper than the call stack allows
+  const stack = [{
+    aLo: 0,
+    aHi: n,
+    bLo: 0,
+    bHi: m
+  }];
+  while (stack.length > 0) {
+    const task = stack.pop();
+    if ("length" in task) {
+      push(task.a, task.b, task.length);
+      continue;
+    }
+    let {
+      aHi,
+      aLo,
+      bHi,
+      bLo
+    } = task;
+    let prefix = 0;
+    while (aLo + prefix < aHi && bLo + prefix < bHi && equals(aLo + prefix, bLo + prefix)) prefix++;
+    push(aLo, bLo, prefix);
+    aLo += prefix;
+    bLo += prefix;
+    let suffix = 0;
+    while (aLo < aHi - suffix && bLo < bHi - suffix && equals(aHi - suffix - 1, bHi - suffix - 1)) suffix++;
+    aHi -= suffix;
+    bHi -= suffix;
+    stack.push({
+      a: aHi,
+      b: bHi,
+      length: suffix
+    });
+    // With a common prefix and suffix removed, a non-empty side on both ends
+    // means at least two edits, so both halves below are strictly smaller
+    const snake = aLo < aHi && bLo < bHi ? findSplit(aLo, aHi, bLo, bHi) : undefined;
+    if (snake !== undefined) {
+      stack.push({
+        aLo: snake.u,
+        aHi,
+        bLo: snake.v,
+        bHi
+      }, {
+        a: snake.x,
+        b: snake.y,
+        length: snake.u - snake.x
+      }, {
+        aLo,
+        aHi: snake.x,
+        bLo,
+        bHi: snake.y
+      });
+    }
+  }
+  return blocks;
+};
+//# sourceMappingURL=TextDiff.js.map

package/dist/TextDiff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TextDiff.js","names":[],"sources":["../src/TextDiff.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;;;;;;;AAYA,OAAO,KAAK,IAAI,MAAM,WAAW;AACjC,OAAO,KAAK,KAAK,MAAM,YAAY;AACnC,SAAS,WAAW,QAAQ,gBAAgB;AAC5C,OAAO,KAAK,MAAM,MAAM,aAAa;AAErC,MAAM,mBAAmB,GAAG,gCAAgC;AAwD5D;;;;;;;;;;;;;;;;;;;AAmBA,OAAM,MAAO,aAAc,sBAAQ,IAAI,CAAC,WAAW,CAAC,eAAe,CAEjE;EACS,CAAC,mBAAmB,IAAgC,mBAAmB;;AAGlF;;;;;;;AAOA,OAAO,MAAM,eAAe,GAAI,CAAU,IAAyB,WAAW,CAAC,CAAC,EAAE,mBAAmB,CAAC;AAEtG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,OAAO,MAAM,QAAQ,GAAO,YAA2C,IACvE,CACE,MAAwB,EACxB,KAAuB,EACvB,OAaC,KACkB,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC;AAE9G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,OAAO,MAAM,IAAI,GAAG,CAClB,MAAwB,EACxB,KAAuB,EACvB,OAaC,KACkB,QAAQ,CAAI,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC;AAEtE;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,OAAO,MAAM,KAAK,GAAG,CAAC,MAAc,EAAE,KAAa,EAAE,OAapD,KAA0B,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC;AAEhG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,OAAO,MAAM,UAAU,GAAG,CAAC,MAAc,EAAE,KAAa,EAAE,OAazD,KAA0B,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC;AAEhG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BA,OAAO,MAAM,KAAK,GAAG,CACnB,MAAwB,EACxB,KAA6B,KACa;EAC1C,MAAM,GAAG,GAAa,EAAE;EACxB,IAAI,KAAK,GAAG,CAAC;EACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;IACxB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE;MAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;MAC7C;IACF;IACA,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;IACrC,IAAI,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,yDAAyD,CAAC;IAC/F,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE;MACzB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACvD;IACA,KAAK,GAAG,GAAG;EACb;EACA,IAAI,KAAK,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,0DAA0D,CAAC;EACpG,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,OAAO,MAAM,SAAS,GAAG,CACvB,MAAc,EACd,KAAkC,KACM;EACxC,IAAI,GAAG,GAAG,EAAE;EACZ,IAAI,KAAK,GAAG,CAAC;EACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;IACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;IAChC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE;MAC1B,GAAG,IAAI,IAAI;MACX;IACF;IACA,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,IAAI,CAAC,iDAAiD,KAAK,EAAE,CAAC;IAC1G,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,GAAG,IAAI,IAAI;IACtC,KAAK,IAAI,IAAI,CAAC,MAAM;EACtB;EACA,IAAI,KAAK,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,sDAAsD,CAAC;EAChG,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;AAsBA,OAAO,MAAM,MAAM,GAAO,KAA6B,IAAoB;EACzE,MAAM,GAAG,GAAmB,EAAE;EAC9B,IAAI,OAAO,GAAqB,EAAE;EAClC,IAAI,QAAQ,GAAqB,EAAE;EACnC,MAAM,KAAK,GAAG,MAAK;IACjB,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC;MAAE,IAAI,EAAE,QAAQ;MAAE,KAAK,EAAE;IAAQ,CAAE,CAAC;IACtE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC;MAAE,IAAI,EAAE,QAAQ;MAAE,KAAK,EAAE;IAAO,CAAE,CAAC;IACpE,OAAO,GAAG,EAAE;IACZ,QAAQ,GAAG,EAAE;EACf,CAAC;EACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;IACxB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE;MAC1B,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACtC,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE;MACjC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACxC,CAAC,MAAM;MACL,KAAK,EAAE;MACP,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;IAChB;EACF;EACA,KAAK,EAAE;EACP,OAAO,GAAG;AACZ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,OAAO,MAAM,OAAO,GAAG,CAAC,KAAkC,EAAE,OAe3D,KAAY;EACX,MAAM,CAAC,GAAkB,EAAE;EAC3B,MAAM,CAAC,GAAkB,EAAE;EAC3B;EACA,MAAM,OAAO,GAAkB,EAAE;EACjC,IAAI,MAA0B;EAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;IACxB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE;MACzB,MAAM,GAAG,SAAS;MAClB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;QAC7B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACZ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;MACd;MACA;IACF;IACA,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;IAC7B,IAAI,MAAM,KAAK,SAAS,EAAE;MACxB,MAAM,GAAG;QAAE,EAAE,EAAE,CAAC,CAAC,MAAM;QAAE,EAAE,EAAE,CAAC,CAAC,MAAM;QAAE,EAAE,EAAE,CAAC,CAAC,MAAM;QAAE,EAAE,EAAE,CAAC,CAAC;MAAM,CAAE;MACnE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;IACtB;IACA,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE;MAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;MAC3C,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,MAAM;IACtB,CAAC,MAAM;MACL,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;MAC3C,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,MAAM;IACtB;EACF;EACA,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE;EAEnC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,CAAC,CAAC;EAC9D,IAAI,GAAG,GAAG,EAAE;EACZ,IAAI,OAAO,EAAE,QAAQ,KAAK,SAAS,IAAI,OAAO,EAAE,MAAM,KAAK,SAAS,EAAE;IACpE,GAAG,IAAI,OAAO,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,MAAM,SAAS,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,QAAQ,IAAI;EACjG;EACA,IAAI,KAAK,GAAG,CAAC;EACb,OAAO,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE;IAC7B,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC;IACnB,OAAO,GAAG,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,OAAO,EAAE,GAAG,EAAE;IAC1F,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG,OAAO,CAAC;IAC1C,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;IACrC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,GAAG,OAAO,CAAC;IAChD,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IACnC,GAAG,IAAI,OAAO,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,OAAO;IAC9D,IAAI,IAAI,GAAG,EAAE;IACb,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;MAChC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;MACzB,OAAO,IAAI,GAAG,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;MAChE,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;MACxE,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;MACxE,IAAI,GAAG,MAAM,CAAC,EAAE;IAClB;IACA,OAAO,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACzD,KAAK,GAAG,GAAG;EACb;EACA,OAAO,GAAG;AACZ,CAAC;AAED;AACA;AACA;AAEA,MAAM,IAAI,GAAI,OAAe,IAAK,MAAM,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC;EAAE;AAAO,CAAE,CAAC,CAAC;AA8B7E,MAAM,UAAU,GAAI,IAAY,IAAoB,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE;AAEzF,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,KAAa,KACzC,KAAK,KAAK,CAAC,GAAG,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,CAAC,GAAG,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,KAAK,EAAE;AAErF,MAAM,UAAU,GAAG,CAAC,MAAc,EAAE,IAAY,KAC9C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,IAAI,GAAG,GAAG,MAAM,GAAG,IAAI,kCAAkC;AAE1F;AACA,MAAM,WAAW,GAAG,CAAC,CAAwB,EAAE,CAAwB,EAAE,QAAiB,KAAI;EAC5F,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB;EACrC,MAAM,MAAM,GAAI,KAAa,IAAI;IAC/B,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;IACvB,IAAI,EAAE,KAAK,SAAS,EAAE;MACpB,EAAE,GAAG,GAAG,CAAC,IAAI;MACb,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC;IACpB;IACA,OAAO,EAAE;EACX,CAAC;EACD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;EACrC,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;EACrC,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC;AAC9D,CAAC;AAED,MAAM,UAAU,GAAG,CACjB,CAAmB,EACnB,CAAmB,EACnB,MAAyC,EACzC,QAAiB,KACC;EAClB,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC;EACnE;EACA,MAAM,CAAC,IAAI,CAAC;IAAE,CAAC,EAAE,CAAC,CAAC,MAAM;IAAE,CAAC,EAAE,CAAC,CAAC,MAAM;IAAE,MAAM,EAAE;EAAC,CAAE,CAAC;EACpD,MAAM,GAAG,GAAmB,EAAE;EAC9B,IAAI,CAAC,GAAG,CAAC;EACT,IAAI,CAAC,GAAG,CAAC;EACT,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;IAC1B,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC;MAAE,IAAI,EAAE,QAAQ;MAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAAC,CAAE,CAAC;IACzE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC;MAAE,IAAI,EAAE,QAAQ;MAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAAC,CAAE,CAAC;IACzE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC;MAAE,IAAI,EAAE,OAAO;MAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM;IAAC,CAAE,CAAC;IAClG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM;IAC1B,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM;EAC5B;EACA,OAAO,GAAG;AACZ,CAAC;AAED;;;;;;AAMA,MAAM,cAAc,GAAG,CACrB,CAAS,EACT,CAAS,EACT,MAAyC,EACzC,QAAQ,GAAG,QAAQ,KACH;EAChB,MAAM,MAAM,GAAiB,EAAE;EAC/B,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,MAAc,KAAI;IACpD,IAAI,MAAM,KAAK,CAAC,EAAE;IAClB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;MAClF,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG;QAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAAE,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG;MAAM,CAAE;IACpF,CAAC,MAAM;MACL,MAAM,CAAC,IAAI,CAAC;QAAE,CAAC;QAAE,CAAC;QAAE;MAAM,CAAE,CAAC;IAC/B;EACF,CAAC;EAED;EACA,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;EACxB,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;EACzC,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;EACzC;EACA;EACA,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;EAEjD;EACA;EACA;EACA,MAAM,SAAS,GAAG,CAAC,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,GAAW,KAAuB;IAC1F,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG;IACnB,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG;IACnB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC;IACnB,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC;IAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAK,CAAC,EAAE,IAAI,CAAC;IAC9C,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC;IAClB,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE;MAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;QAC/B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAE,GACpE,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAClB,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACb,MAAM,EAAE,GAAG,CAAC;QACZ,MAAM,EAAE,GAAG,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE;UACjD,CAAC,EAAE;UACH,CAAC,EAAE;QACL;QACA,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC;QAClB,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE;UAC1F,OAAO;YAAE,CAAC,EAAE,GAAG,GAAG,EAAE;YAAE,CAAC,EAAE,GAAG,GAAG,EAAE;YAAE,CAAC,EAAE,GAAG,GAAG,CAAC;YAAE,CAAC,EAAE,GAAG,GAAG;UAAC,CAAE;QAC7D;MACF;MACA,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;QAC/B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAE,GACpE,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAClB,EAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACb,MAAM,EAAE,GAAG,CAAC;QACZ,MAAM,EAAE,GAAG,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;UACzD,CAAC,EAAE;UACH,CAAC,EAAE;QACL;QACA,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC;QAClB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE;UAC/E,OAAO;YAAE,CAAC,EAAE,GAAG,GAAG,CAAC;YAAE,CAAC,EAAE,GAAG,GAAG,CAAC;YAAE,CAAC,EAAE,GAAG,GAAG,EAAE;YAAE,CAAC,EAAE,GAAG,GAAG;UAAE,CAAE;QAC7D;MACF;IACF;IAEA;IACA;IACA,IAAI,IAAI,GAAG,CAAC;IACZ,IAAI,CAAC,GAAG,CAAC;IACT,IAAI,CAAC,GAAG,CAAC;IACT,KAAK,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE;MACvC,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;MACzB,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC;MACjB,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE;QACnD,IAAI,GAAG,EAAE,GAAG,EAAE;QACd,CAAC,GAAG,GAAG,GAAG,EAAE;QACZ,CAAC,GAAG,GAAG,GAAG,EAAE;MACd;MACA,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;MACzB,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC;MACjB,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE;QACnD,IAAI,GAAG,EAAE,GAAG,EAAE;QACd,CAAC,GAAG,GAAG,GAAG,EAAE;QACZ,CAAC,GAAG,GAAG,GAAG,EAAE;MACd;IACF;IACA,OAAO,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG;MAAE,CAAC;MAAE,CAAC;MAAE,CAAC,EAAE,CAAC;MAAE,CAAC,EAAE;IAAC,CAAE,GAAG,SAAS;EACpE,CAAC;EAED;EACA;EACA,MAAM,KAAK,GAA0B,CAAC;IAAE,GAAG,EAAE,CAAC;IAAE,GAAG,EAAE,CAAC;IAAE,GAAG,EAAE,CAAC;IAAE,GAAG,EAAE;EAAC,CAAE,CAAC;EACzE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;IACvB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG;IACzB,IAAI,QAAQ,IAAI,IAAI,EAAE;MACpB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC;MACjC;IACF;IACA,IAAI;MAAE,GAAG;MAAE,GAAG;MAAE,GAAG;MAAE;IAAG,CAAE,GAAG,IAAI;IACjC,IAAI,MAAM,GAAG,CAAC;IACd,OAAO,GAAG,GAAG,MAAM,GAAG,GAAG,IAAI,GAAG,GAAG,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,EAAE,GAAG,GAAG,MAAM,CAAC,EAAE,MAAM,EAAE;IAC/F,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC;IACtB,GAAG,IAAI,MAAM;IACb,GAAG,IAAI,MAAM;IACb,IAAI,MAAM,GAAG,CAAC;IACd,OAAO,GAAG,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,GAAG,GAAG,GAAG,MAAM,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE;IACvG,GAAG,IAAI,MAAM;IACb,GAAG,IAAI,MAAM;IACb,KAAK,CAAC,IAAI,CAAC;MAAE,CAAC,EAAE,GAAG;MAAE,CAAC,EAAE,GAAG;MAAE,MAAM,EAAE;IAAM,CAAE,CAAC;IAC9C;IACA;IACA,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,SAAS;IAChF,IAAI,KAAK,KAAK,SAAS,EAAE;MACvB,KAAK,CAAC,IAAI,CACR;QAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAAE,GAAG;QAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAAE;MAAG,CAAE,EACxC;QAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAAE,MAAM,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;MAAC,CAAE,EACrD;QAAE,GAAG;QAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAAE,GAAG;QAAE,GAAG,EAAE,KAAK,CAAC;MAAC,CAAE,CACzC;IACH;EACF;EACA,OAAO,MAAM;AACf,CAAC","ignoreList":[]}