@pixerate/editor 0.59.0 → 0.60.0

package/dist/chunk-WLVZ235X.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/extensions/table/nesting.ts","../src/extensions/find-replace/pattern.ts","../src/extensions/find-replace/search.ts","../src/extensions/table/extension.ts","../src/extensions/chart/node-view.ts","../src/extensions/chart/chart-node.ts","../src/extensions/document-structure/utils.ts","../src/extensions/chart/sparkline-node.ts","../src/extensions/table/actions.ts"],"sourcesContent":["import { Fragment, Slice, type Node as ProsemirrorNode, type ResolvedPos } from \"@tiptap/pm/model\";\nimport { Plugin, PluginKey, Selection, type Transaction } from \"@tiptap/pm/state\";\nimport type { EditorView } from \"@tiptap/pm/view\";\nimport {\n  CellSelection,\n  __pastedCells,\n  handlePaste as handleTablePaste,\n} from \"@tiptap/pm/tables\";\n\n/**\n * Set this meta on a transaction to let it create tables inside table cells\n * (the nesting guard leaves it alone), e.g. when loading legacy content\n * through a transaction that does not replace the whole document.\n */\nexport const ALLOW_NESTED_TABLES_META = \"allowNestedTables\";\n\nexport const tableNestingPluginKey = new PluginKey(\"tableNesting\");\n\nconst roleOf = (node: ProsemirrorNode) => node.type.spec.tableRole as string | undefined;\nconst isTableNode = (node: ProsemirrorNode) => roleOf(node) === \"table\";\n\n/** Depth of the outermost table around `$pos`, or `-1` outside tables. */\nexport function outermostTableDepth($pos: ResolvedPos): number {\n  for (let d = 1; d <= $pos.depth; d++) if (isTableNode($pos.node(d))) return d;\n  return -1;\n}\n\n/** Whether `$pos` lies inside a table cell or header cell. */\nexport function isInTableCell($pos: ResolvedPos): boolean {\n  for (let d = $pos.depth; d > 0; d--) {\n    const role = roleOf($pos.node(d));\n    if (role === \"cell\" || role === \"header_cell\") return true;\n  }\n  return false;\n}\n\n/** Whether a slice or fragment contains a table node at any depth. */\nexport function sliceContainsTable(content: Slice | Fragment): boolean {\n  const fragment = content instanceof Slice ? content.content : content;\n  let found = false;\n  fragment.descendants((node) => {\n    if (found) return false;\n    if (isTableNode(node)) found = true;\n    return !found;\n  });\n  return found;\n}\n\n/**\n * Inserts `slice` right after the outermost table around `from` instead of\n * inside the cell, deleting `from`–`to` first when both lie in that table.\n * Returns the position right after the inserted content, or `null` (and\n * leaves `tr` unchanged) when `from` is not in a table.\n */\nexport function insertSliceAfterTable(tr: Transaction, from: number, to: number, slice: Slice): number | null {\n  const $from = tr.doc.resolve(from);\n  const depth = outermostTableDepth($from);\n  if (depth < 0) return null;\n  const tableStart = $from.before(depth);\n  const tableEnd = $from.after(depth);\n  if (to > from && to < tableEnd) {\n    if (tr.selection instanceof CellSelection && tr.selection.from === from && tr.selection.to === to) {\n      tr.deleteSelection();\n    } else {\n      tr.delete(from, to);\n    }\n  }\n  const table = tr.doc.nodeAt(tableStart);\n  if (!table) return null;\n  const after = tableStart + table.nodeSize;\n  const before = tr.doc.content.size;\n  // A closed slice: the content becomes blocks of its own after the table\n  // instead of merging into whatever follows it.\n  tr.replace(after, after, new Slice(slice.content, 0, 0));\n  return after + (tr.doc.content.size - before);\n}\n\n/**\n * Paste handling for slices that contain a table while the selection is in a\n * table: a cell selection or a pasted table (rows, cells) fills the cells from\n * the cursor (prosemirror-tables), and anything else that contains a table is\n * inserted after the outermost table, with the cursor at its end. Returns\n * `false` when the paste needs no special handling.\n */\nexport function handleTablePasteWithoutNesting(view: EditorView, event: ClipboardEvent | null, slice: Slice): boolean {\n  const { state } = view;\n  const { selection } = state;\n  if (outermostTableDepth(selection.$from) < 0) return false;\n  if (selection instanceof CellSelection || __pastedCells(slice)) {\n    if (handleTablePaste(view, event as ClipboardEvent, slice)) return true;\n  }\n  if (!sliceContainsTable(slice)) return false;\n  const tr = state.tr;\n  const end = insertSliceAfterTable(tr, selection.from, selection.to, slice);\n  if (end === null) return false;\n  tr.setSelection(Selection.near(tr.doc.resolve(end), -1));\n  view.dispatch(tr.scrollIntoView().setMeta(\"paste\", true).setMeta(\"uiEvent\", \"paste\"));\n  return true;\n}\n\n/**\n * Ranges of the final document that `transactions` changed, leaving out the\n * changes of skipped transactions (their steps still map the other ranges).\n */\nfunction changedRanges(transactions: readonly Transaction[], skip: (tr: Transaction) => boolean): [number, number][] {\n  let ranges: [number, number][] = [];\n  for (const tr of transactions) {\n    const skipped = skip(tr);\n    for (const step of tr.steps) {\n      const map = step.getMap();\n      // Content that later (skipped) steps insert at a range's edge is not\n      // part of it; pure deletions leave nothing to check.\n      ranges = ranges\n        .map(([from, to]): [number, number] => [map.map(from, 1), map.map(to, -1)])\n        .filter(([from, to]) => to > from);\n      if (skipped) continue;\n      map.forEach((_oldStart, _oldEnd, newStart, newEnd) => {\n        if (newEnd > newStart) ranges.push([newStart, newEnd]);\n      });\n    }\n  }\n  return ranges;\n}\n\n/** Tables starting inside `ranges` that sit in a table cell. */\nfunction findNestedTables(doc: ProsemirrorNode, ranges: [number, number][]): number[] {\n  const found = new Set<number>();\n  for (const [from, to] of ranges) {\n    doc.nodesBetween(from, to, (node, pos) => {\n      if (!isTableNode(node) || pos < from) return true;\n      if (isInTableCell(doc.resolve(pos))) {\n        found.add(pos);\n        return false;\n      }\n      return true;\n    });\n  }\n  // A table inside another found table moves with it.\n  const sorted = [...found].sort((a, b) => a - b);\n  const outer: number[] = [];\n  for (const pos of sorted) {\n    const last = outer[outer.length - 1];\n    if (last === undefined || pos >= last + doc.nodeAt(last)!.nodeSize) outer.push(pos);\n  }\n  return outer;\n}\n\n/**\n * Moves tables that sit in table cells (at positions in `ranges`) to right\n * after their outermost table, keeping their content, and repeats for tables\n * nested in the moved ones. A cell left without content gets an empty\n * paragraph. Returns whether `tr` changed.\n */\nexport function unnestTables(tr: Transaction, ranges: [number, number][]): boolean {\n  let changed = false;\n  for (let round = 0; round < 32 && ranges.length; round++) {\n    const nested = findNestedTables(tr.doc, ranges);\n    if (!nested.length) break;\n    // Group by outermost table; handle later tables first so earlier\n    // positions stay valid.\n    const groups = new Map<number, number[]>();\n    for (const pos of nested) {\n      const $pos = tr.doc.resolve(pos);\n      const outer = $pos.before(outermostTableDepth($pos));\n      groups.set(outer, [...(groups.get(outer) ?? []), pos]);\n    }\n    const next: [number, number][] = [];\n    for (const outer of [...groups.keys()].sort((a, b) => b - a)) {\n      const positions = groups.get(outer)!;\n      const nodes = positions.map((pos) => tr.doc.nodeAt(pos)!);\n      for (let i = positions.length - 1; i >= 0; i--) {\n        const pos = positions[i];\n        const node = nodes[i];\n        const $pos = tr.doc.resolve(pos);\n        const parent = $pos.parent;\n        const filler = parent.childCount === 1 ? parent.type.contentMatch.defaultType?.createAndFill() : null;\n        if (filler) tr.replaceWith(pos, pos + node.nodeSize, filler);\n        else tr.delete(pos, pos + node.nodeSize);\n      }\n      const table = tr.doc.nodeAt(outer)!;\n      const after = outer + table.nodeSize;\n      const fragment = Fragment.fromArray(nodes);\n      tr.insert(after, fragment);\n      // Later groups are before this one, so this range stays valid.\n      next.push([after, after + fragment.size]);\n      changed = true;\n    }\n    ranges = next;\n  }\n  return changed;\n}\n\n/**\n * Whether a transaction replaces the whole document (`setContent`, loading):\n * existing documents keep their nested tables.\n */\nfunction replacesDocument(tr: Transaction): boolean {\n  return tr.steps.some((step, i) => {\n    const { from, to } = step as unknown as { from?: number; to?: number };\n    return from === 0 && to !== undefined && to >= tr.docs[i].content.size;\n  });\n}\n\nconst skip = (tr: Transaction) =>\n  !tr.docChanged ||\n  tr.getMeta(ALLOW_NESTED_TABLES_META) === true ||\n  // Undo/redo and remote collaborative changes restore what was there.\n  !!tr.getMeta(\"history$\") ||\n  !!tr.getMeta(\"y-sync$\") ||\n  // Other plugins' housekeeping, e.g. Track Changes putting a deleted\n  // (nested) table back so the deletion can be reviewed.\n  !!tr.getMeta(\"appendedTransaction\") ||\n  replacesDocument(tr);\n\n/**\n * Keeps tables out of table cells: paste handling (see\n * `handleTablePasteWithoutNesting`) plus a guard that moves any table a\n * local edit puts into a cell (`insertContent`, `insertTable`, drops) to\n * right after the outermost table. Documents that already contain nested\n * tables (initial content, `setContent`, undo/redo, collaboration, Track\n * Changes restoring a deleted table) are left as they are.\n */\nexport function createTableNestingPlugin(): Plugin {\n  return new Plugin({\n    key: tableNestingPluginKey,\n    props: {\n      handlePaste: (view, event, slice) => handleTablePasteWithoutNesting(view, event, slice),\n    },\n    appendTransaction(transactions, _oldState, newState) {\n      if (transactions.every(skip)) return null;\n      const ranges = changedRanges(transactions, skip);\n      if (!ranges.length) return null;\n      const tr = newState.tr;\n      if (!unnestTables(tr, ranges)) return null;\n      return tr;\n    },\n  });\n}\n","// Portions ported from wordcraft/crates/engine/src/cmd/find_pattern.rs and crates/engine/src/cmd/edit.rs (MIT OR Apache-2.0, © ArtCraft Team and contributors). See THIRD_PARTY_NOTICES.md.\n/**\n * Word's Find and Replace patterns: special characters (`^p`, `^t`, `^#` …),\n * the \"Use wildcards\" language (`?`, `*`, `[a-z]`, `[!x]`, `{n,m}`, `@`, `<`,\n * `>`, `( )`) and a raw regular-expression mode.\n *\n * Special and wildcard patterns are compiled to a small program run by a\n * Pike VM, which takes time linear in the text for a given pattern, so no\n * Find text can backtrack catastrophically (JavaScript's `RegExp` would). The\n * raw regex mode uses the native `RegExp` engine; it rejects nested\n * repetition and is bounded by the search budget between matches only.\n *\n * Pure TypeScript: no ProseMirror or DOM.\n */\n\n/** A paragraph mark in the searched text (`^p`). */\nexport const FIND_PARAGRAPH_MARK = \"\\r\";\n/** Longest Find what text, in characters. */\nexport const MAX_FIND_PATTERN_LENGTH = 1024;\n/** Largest count in `{n,m}`. */\nconst MAX_COUNT = 1000;\n/** Largest compiled program (instructions). Larger patterns are `too_complex`. */\nconst MAX_PROGRAM_SIZE = 20_000;\n\nexport interface FindOptions {\n  matchCase?: boolean;\n  /** Find whole words only (ignored with wildcards, like Word). */\n  wholeWord?: boolean;\n  /** The match must start a word. */\n  matchPrefix?: boolean;\n  /** The match must end a word. */\n  matchSuffix?: boolean;\n  /** Skip punctuation between the characters of the Find text. */\n  ignorePunctuation?: boolean;\n  /** Skip spaces and tabs between the characters of the Find text. */\n  ignoreWhitespace?: boolean;\n  /** Word's \"Use wildcards\". Always matches case. */\n  wildcards?: boolean;\n  /** A JavaScript regular expression (wins over `wildcards`). Replace text is literal. */\n  regex?: boolean;\n  /** Read the Find and Replace text literally: no `^` codes. */\n  literal?: boolean;\n}\n\nexport type FindPatternErrorCode = \"too_long\" | \"invalid_pattern\" | \"too_complex\";\n\n/** Why a Find text cannot be used. Commands report it; they never throw it. */\nexport interface FindPatternError {\n  code: FindPatternErrorCode;\n  message: string;\n}\n\n/** One match in a searched string (UTF-16 offsets). */\nexport interface PatternMatch {\n  start: number;\n  end: number;\n  /** Text of each group; index 0 is the whole match, unmatched groups are `undefined`. */\n  groups: (string | undefined)[];\n}\n\n/** Shared limit on the work one search may do. */\nexport interface SearchBudget {\n  /** `performance.now()`/`Date.now()` value after which the search stops. */\n  deadline: number;\n  /** VM steps left. */\n  steps: number;\n  /** Set once the budget ran out. */\n  exhausted: boolean;\n}\n\nexport interface SearchBudgetOptions {\n  /** Wall-clock limit in milliseconds (default 250). */\n  timeLimitMs?: number;\n  /** Pike VM thread steps (default 50 million). */\n  maxSteps?: number;\n}\n\nconst now = (): number =>\n  typeof performance !== \"undefined\" && typeof performance.now === \"function\"\n    ? performance.now()\n    : Date.now();\n\nexport function createSearchBudget(options: SearchBudgetOptions = {}): SearchBudget {\n  return {\n    deadline: now() + (options.timeLimitMs ?? 250),\n    steps: options.maxSteps ?? 50_000_000,\n    exhausted: false,\n  };\n}\n\nexport interface CompiledFindPattern {\n  mode: \"special\" | \"wildcards\" | \"regex\";\n  /** The pattern can match a paragraph mark, so paragraphs must be read together. */\n  spansParagraphs: boolean;\n  caseInsensitive: boolean;\n  /** Number of capture groups (not counting the whole match). */\n  groupCount: number;\n  /**\n   * The leftmost match in `hay[start, end)`; text outside the range is\n   * context for word assertions. `\"budget\"` when the budget ran out.\n   */\n  exec(hay: string, start: number, end: number, budget: SearchBudget): PatternMatch | null | \"budget\";\n}\n\nexport type CompileFindPatternResult =\n  | { ok: true; pattern: CompiledFindPattern }\n  | { ok: false; error: FindPatternError };\n\n// ---------------------------------------------------------------------------\n// Character tests\n// ---------------------------------------------------------------------------\n\n/** Tests a code point (and its case fold when matching ignores case). */\ntype CharTest = (cp: number, folded: number) => boolean;\n\nconst PARA = 13; // \"\\r\"\nconst ANY: CharTest = (cp) => cp !== PARA;\n\nconst LETTER = /\\p{L}/u;\nconst PUNCT = /\\p{P}/u;\nconst WORD = /[\\p{L}\\p{M}\\p{Nd}\\p{Pc}]/u;\n\nconst foldCache = new Map<number, number>();\n/** Simple (one code point to one code point) lower-case fold. */\nexport function foldCodePoint(cp: number): number {\n  if (cp < 128) return cp >= 65 && cp <= 90 ? cp + 32 : cp;\n  const cached = foldCache.get(cp);\n  if (cached !== undefined) return cached;\n  const lower = String.fromCodePoint(cp).toLowerCase();\n  const folded = [...lower].length === 1 ? lower.codePointAt(0)! : cp;\n  if (foldCache.size < 4096) foldCache.set(cp, folded);\n  return folded;\n}\n\nfunction isWordChar(cp: number): boolean {\n  if (cp < 0) return false;\n  if (cp < 128) {\n    return (cp >= 48 && cp <= 57) || (cp >= 65 && cp <= 90) || (cp >= 97 && cp <= 122) || cp === 95;\n  }\n  return WORD.test(String.fromCodePoint(cp));\n}\n\nconst isLetter = (cp: number) =>\n  cp < 128 ? (cp >= 65 && cp <= 90) || (cp >= 97 && cp <= 122) : LETTER.test(String.fromCodePoint(cp));\n\nfunction isPunct(cp: number): boolean {\n  if (cp < 128) {\n    return (cp >= 33 && cp <= 47) || (cp >= 58 && cp <= 64) || (cp >= 91 && cp <= 96) || (cp >= 123 && cp <= 126);\n  }\n  return (cp >= 0x2010 && cp <= 0x2027) || cp === 0xa1 || cp === 0xbf || cp === 0xab || cp === 0xbb || PUNCT.test(String.fromCodePoint(cp));\n}\n\nconst isSpace = (cp: number) => cp === 32 || cp === 9 || cp === 0xa0;\n\n/** Code point before `pos` in `hay` (-1 at the start). */\nfunction cpBefore(hay: string, pos: number): number {\n  if (pos <= 0) return -1;\n  const low = hay.charCodeAt(pos - 1);\n  if (low >= 0xdc00 && low <= 0xdfff && pos >= 2) {\n    const high = hay.charCodeAt(pos - 2);\n    if (high >= 0xd800 && high <= 0xdbff) return hay.codePointAt(pos - 2)!;\n  }\n  return low;\n}\n\nconst cpAt = (hay: string, pos: number): number => (pos < hay.length ? hay.codePointAt(pos)! : -1);\n\n// ---------------------------------------------------------------------------\n// Pattern AST\n// ---------------------------------------------------------------------------\n\ntype AssertKind = \"boundary\" | \"wordStart\" | \"wordEnd\";\n\ntype Node =\n  | { k: \"char\"; test: CharTest }\n  | { k: \"cat\"; items: Node[] }\n  | { k: \"group\"; index: number; body: Node }\n  | { k: \"rep\"; body: Node; min: number; max: number; lazy: boolean } // max -1 = unbounded\n  | { k: \"assert\"; kind: AssertKind };\n\nclass PatternError extends Error {\n  constructor(\n    readonly code: FindPatternErrorCode,\n    message: string,\n  ) {\n    super(message);\n  }\n}\n\nconst charNode = (test: CharTest): Node => ({ k: \"char\", test });\nconst exact = (cp: number): Node => charNode((c) => c === cp);\nconst literalNode = (cp: number, caseInsensitive: boolean): Node => {\n  if (!caseInsensitive) return exact(cp);\n  const f = foldCodePoint(cp);\n  return charNode((_c, folded) => folded === f);\n};\nconst star = (body: Node, lazy: boolean): Node => ({ k: \"rep\", body, min: 0, max: -1, lazy });\n\n/** What a `^` code stands for in Find what. */\nfunction findCode(c: string): Node | null {\n  switch (c) {\n    case \"p\": return exact(PARA);\n    case \"t\": return exact(9);\n    case \"?\": return charNode(ANY);\n    case \"#\": return charNode((cp) => cp >= 48 && cp <= 57);\n    case \"$\": return charNode((cp) => isLetter(cp));\n    case \"^\": return exact(94);\n    case \"l\": return exact(10);\n    case \"m\": return exact(0x0c);\n    case \"n\": return exact(0x0e);\n    case \"+\": return exact(0x2014);\n    case \"=\": return exact(0x2013);\n    case \"s\": return exact(0xa0);\n    case \"~\": return exact(0x2011);\n    case \"-\": return exact(0xad);\n    case \"w\": return { k: \"rep\", body: charNode((cp) => isSpace(cp)), min: 1, max: -1, lazy: false };\n    case \"g\": return exact(0xfffc);\n    case \"%\": return exact(0xa7);\n    case \"v\": return exact(0xb6);\n    default: return null;\n  }\n}\n\n/** What a `^` code stands for in Replace with. */\nfunction replaceCode(c: string): string | null {\n  switch (c) {\n    case \"p\": return FIND_PARAGRAPH_MARK;\n    case \"t\": return \"\\t\";\n    case \"^\": return \"^\";\n    case \"l\": return \"\\n\";\n    case \"m\": return \"\\u000c\";\n    case \"n\": return \"\\u000e\";\n    case \"+\": return \"\\u2014\";\n    case \"=\": return \"\\u2013\";\n    case \"s\": return \"\\u00a0\";\n    case \"~\": return \"\\u2011\";\n    case \"-\": return \"\\u00ad\";\n    case \"%\": return \"\\u00a7\";\n    case \"v\": return \"\\u00b6\";\n    default: return null;\n  }\n}\n\n/** A character code (`^13`, `^0151`, `^u8212`) as the character it stands for. */\nfunction codeChar(n: number): number | null {\n  switch (n) {\n    case 13: return PARA;\n    case 11: return 10;\n    case 12: return 0x0c;\n    case 14: return 0x0e;\n    case 30: return 0x2011;\n    case 31: return 0xad;\n  }\n  if (n > 0x10ffff || (n >= 0xd800 && n <= 0xdfff)) return null;\n  // Control characters other than tab stand for nothing here.\n  if ((n < 32 && n !== 9) || (n >= 0x7f && n < 0xa0)) return null;\n  return n;\n}\n\n/** A numeric code after `^` starting at `chars[i]`: the code point and characters used. */\nfunction numericCode(chars: string[], i: number): { cp: number; used: number } | null {\n  const unicode = chars[i] === \"u\";\n  const start = unicode ? i + 1 : i;\n  const max = unicode ? 5 : 4;\n  let digits = \"\";\n  for (let j = start; j < chars.length && digits.length < max && /[0-9]/.test(chars[j]); j++) digits += chars[j];\n  if (!digits) return null;\n  const cp = codeChar(parseInt(digits, 10));\n  return cp === null ? null : { cp, used: start - i + digits.length };\n}\n\nconst toChars = (s: string): string[] => Array.from(s);\nconst cpOf = (ch: string): number => ch.codePointAt(0)!;\n\n/** Normal search: literal text with `^` codes, optionally skipping punctuation and white space. */\nfunction parseSpecial(query: string, o: FindOptions, caseInsensitive: boolean): { node: Node; spans: boolean } {\n  const chars = toChars(query);\n  const atoms: Node[] = [];\n  let spans = false;\n  let i = 0;\n  while (i < chars.length) {\n    const c = chars[i++];\n    if (c === \"^\" && !o.literal && i < chars.length) {\n      const n = chars[i];\n      const code = findCode(n);\n      if (code) {\n        if (n === \"p\") spans = true;\n        atoms.push(code);\n        i++;\n        continue;\n      }\n      const num = numericCode(chars, i);\n      if (num) {\n        if (num.cp === PARA) spans = true;\n        atoms.push(literalNode(num.cp, caseInsensitive));\n        i += num.used;\n        continue;\n      }\n      // Not a code: the caret itself.\n    }\n    const cp = cpOf(c);\n    if ((o.ignorePunctuation && isPunct(cp)) || (o.ignoreWhitespace && isSpace(cp))) continue;\n    atoms.push(literalNode(cp, caseInsensitive));\n  }\n  const filler: CharTest | null =\n    o.ignorePunctuation && o.ignoreWhitespace\n      ? (cp) => isPunct(cp) || isSpace(cp)\n      : o.ignorePunctuation\n        ? (cp) => isPunct(cp)\n        : o.ignoreWhitespace\n          ? (cp) => isSpace(cp)\n          : null;\n  const items: Node[] = [];\n  atoms.forEach((atom, index) => {\n    if (index > 0 && filler) items.push(star(charNode(filler), false));\n    items.push(atom);\n  });\n  return { node: { k: \"cat\", items }, spans };\n}\n\n/** `{n}`, `{n,}`, `{n,m}` (and `{,m}`). */\nfunction parseCount(body: string): { min: number; max: number } {\n  const bad = () => new PatternError(\"invalid_pattern\", `{${body}} is not a valid count`);\n  const num = (s: string): number | null => {\n    const t = s.trim();\n    if (!t) return null;\n    if (!/^[0-9]+$/.test(t)) throw bad();\n    const n = parseInt(t, 10);\n    if (n > MAX_COUNT) throw new PatternError(\"invalid_pattern\", `counts go up to ${MAX_COUNT}`);\n    return n;\n  };\n  const sep = body.search(/[,;]/);\n  if (sep < 0) {\n    const n = num(body);\n    if (n === null) throw bad();\n    return { min: n, max: n };\n  }\n  const a = num(body.slice(0, sep)) ?? 0;\n  const b = num(body.slice(sep + 1));\n  if (b !== null && b < a) throw bad();\n  return { min: a, max: b ?? -1 };\n}\n\n/** `[abc]`, `[a-z]`, `[!x]`: the characters inside are literal. */\nfunction parseClass(inner: string[]): CharTest {\n  let negated = false;\n  if (inner[0] === \"!\") {\n    negated = true;\n    inner = inner.slice(1);\n  }\n  if (inner.length === 0) throw new PatternError(\"invalid_pattern\", \"[ ] needs at least one character\");\n  const singles = new Set<number>();\n  const ranges: [number, number][] = [];\n  let i = 0;\n  while (i < inner.length) {\n    let c = inner[i];\n    if (c === \"\\\\\" && i + 1 < inner.length) c = inner[++i];\n    i++;\n    if (inner[i] === \"-\" && i + 1 < inner.length) {\n      const hi = inner[i + 1];\n      if (cpOf(hi) < cpOf(c)) throw new PatternError(\"invalid_pattern\", `[${c}-${hi}] is not in ascending order`);\n      ranges.push([cpOf(c), cpOf(hi)]);\n      i += 2;\n    } else {\n      singles.add(cpOf(c));\n    }\n  }\n  const inSet = (cp: number) => singles.has(cp) || ranges.some(([lo, hi]) => cp >= lo && cp <= hi);\n  return negated ? (cp) => cp !== PARA && !inSet(cp) : (cp) => inSet(cp);\n}\n\n/** \"Use wildcards\" search. */\nfunction parseWildcards(query: string): { node: Node; spans: boolean; groups: number } {\n  const chars = toChars(query);\n  const stack: { items: Node[]; group: number }[] = [{ items: [], group: 0 }];\n  let groups = 0;\n  let spans = false;\n  const top = () => stack[stack.length - 1].items;\n  const quantify = (min: number, max: number, what: string) => {\n    const items = top();\n    const last = items[items.length - 1];\n    if (!last || last.k === \"assert\" || last.k === \"rep\") {\n      throw new PatternError(\"invalid_pattern\", `${what} needs something to repeat before it`);\n    }\n    items[items.length - 1] = { k: \"rep\", body: last, min, max, lazy: false };\n  };\n  let i = 0;\n  while (i < chars.length) {\n    const c = chars[i++];\n    switch (c) {\n      case \"?\":\n        top().push(charNode(ANY));\n        break;\n      case \"*\":\n        top().push(star(charNode(ANY), true));\n        break;\n      case \"@\":\n        quantify(1, -1, \"@\");\n        break;\n      case \"<\":\n        top().push({ k: \"assert\", kind: \"wordStart\" });\n        break;\n      case \">\":\n        top().push({ k: \"assert\", kind: \"wordEnd\" });\n        break;\n      case \"(\":\n        stack.push({ items: [], group: ++groups });\n        break;\n      case \")\": {\n        if (stack.length === 1) throw new PatternError(\"invalid_pattern\", \"a ) has no opening (\");\n        const frame = stack.pop()!;\n        top().push({ k: \"group\", index: frame.group, body: { k: \"cat\", items: frame.items } });\n        break;\n      }\n      case \"{\": {\n        const end = chars.indexOf(\"}\", i);\n        if (end < 0) throw new PatternError(\"invalid_pattern\", \"a { needs a closing }\");\n        const { min, max } = parseCount(chars.slice(i, end).join(\"\"));\n        quantify(min, max, `{${chars.slice(i, end).join(\"\")}}`);\n        i = end + 1;\n        break;\n      }\n      case \"[\": {\n        const end = chars.indexOf(\"]\", i);\n        if (end < 0) throw new PatternError(\"invalid_pattern\", \"a [ needs a closing ]\");\n        top().push(charNode(parseClass(chars.slice(i, end))));\n        i = end + 1;\n        break;\n      }\n      case \"\\\\\": {\n        if (i >= chars.length) {\n          top().push(exact(92));\n        } else if (/[0-9]/.test(chars[i])) {\n          throw new PatternError(\"invalid_pattern\", \"back-references (\\\\1) work in Replace with, not in Find what\");\n        } else {\n          top().push(exact(cpOf(chars[i++])));\n        }\n        break;\n      }\n      case \"^\": {\n        if (i >= chars.length) {\n          top().push(exact(94));\n          break;\n        }\n        const n = chars[i];\n        const code = findCode(n);\n        if (code) {\n          if (n === \"p\") spans = true;\n          top().push(code);\n          i++;\n          break;\n        }\n        const num = numericCode(chars, i);\n        if (num) {\n          if (num.cp === PARA) spans = true;\n          top().push(exact(num.cp));\n          i += num.used;\n        } else {\n          top().push(exact(94));\n        }\n        break;\n      }\n      default:\n        top().push(exact(cpOf(c)));\n    }\n  }\n  if (stack.length > 1) throw new PatternError(\"invalid_pattern\", \"a ( needs a closing )\");\n  return { node: { k: \"cat\", items: stack[0].items }, spans, groups };\n}\n\n// ---------------------------------------------------------------------------\n// Program and Pike VM\n// ---------------------------------------------------------------------------\n\nenum Op {\n  Char,\n  Split,\n  Jmp,\n  Save,\n  Assert,\n  Match,\n}\n\ntype Inst =\n  | { op: Op.Char; test: CharTest }\n  | { op: Op.Split; x: number; y: number }\n  | { op: Op.Jmp; x: number }\n  | { op: Op.Save; n: number }\n  | { op: Op.Assert; kind: AssertKind }\n  | { op: Op.Match };\n\nfunction compileProgram(node: Node): Inst[] {\n  const prog: Inst[] = [];\n  const push = (inst: Inst): number => {\n    if (prog.length >= MAX_PROGRAM_SIZE) {\n      throw new PatternError(\"too_complex\", \"the pattern is too complex (too many repeats)\");\n    }\n    prog.push(inst);\n    return prog.length - 1;\n  };\n  const emit = (n: Node): void => {\n    switch (n.k) {\n      case \"char\":\n        push({ op: Op.Char, test: n.test });\n        return;\n      case \"cat\":\n        n.items.forEach(emit);\n        return;\n      case \"group\":\n        push({ op: Op.Save, n: 2 * n.index });\n        emit(n.body);\n        push({ op: Op.Save, n: 2 * n.index + 1 });\n        return;\n      case \"assert\":\n        push({ op: Op.Assert, kind: n.kind });\n        return;\n      case \"rep\": {\n        for (let k = 0; k < n.min; k++) emit(n.body);\n        if (n.max < 0) {\n          const split = push({ op: Op.Split, x: 0, y: 0 });\n          emit(n.body);\n          push({ op: Op.Jmp, x: split });\n          const exit = prog.length;\n          const inst = prog[split] as { op: Op.Split; x: number; y: number };\n          inst.x = n.lazy ? exit : split + 1;\n          inst.y = n.lazy ? split + 1 : exit;\n          return;\n        }\n        const splits: number[] = [];\n        for (let k = n.min; k < n.max; k++) {\n          splits.push(push({ op: Op.Split, x: 0, y: 0 }));\n          emit(n.body);\n        }\n        const exit = prog.length;\n        for (const s of splits) {\n          const inst = prog[s] as { op: Op.Split; x: number; y: number };\n          inst.x = n.lazy ? exit : s + 1;\n          inst.y = n.lazy ? s + 1 : exit;\n        }\n        return;\n      }\n    }\n  };\n  push({ op: Op.Save, n: 0 });\n  emit(node);\n  push({ op: Op.Save, n: 1 });\n  push({ op: Op.Match });\n  return prog;\n}\n\nfunction checkAssert(kind: AssertKind, hay: string, pos: number): boolean {\n  const before = isWordChar(cpBefore(hay, pos));\n  const after = isWordChar(cpAt(hay, pos));\n  switch (kind) {\n    case \"boundary\": return before !== after;\n    case \"wordStart\": return !before && after;\n    case \"wordEnd\": return before && !after;\n  }\n}\n\n/**\n * Leftmost-first search (Perl/Rust priorities: greedy, lazy) with a Pike VM:\n * every position is visited once per live instruction, so time is\n * O(text × program) whatever the pattern.\n */\nfunction pikeExec(\n  prog: Inst[],\n  groupCount: number,\n  caseInsensitive: boolean,\n  hay: string,\n  start: number,\n  end: number,\n  budget: SearchBudget,\n): PatternMatch | null | \"budget\" {\n  const ncap = 2 * (groupCount + 1);\n  const mark = new Int32Array(prog.length);\n  let gen = 1;\n  let clistPc: number[] = [];\n  let clistCaps: Int32Array[] = [];\n  let nlistPc: number[] = [];\n  let nlistCaps: Int32Array[] = [];\n  const stackPc: number[] = [];\n  const stackCaps: Int32Array[] = [];\n  let matched: Int32Array | null = null;\n  const initial = new Int32Array(ncap).fill(-1);\n\n  const add = (listPc: number[], listCaps: Int32Array[], pc0: number, caps0: Int32Array, pos: number) => {\n    stackPc.push(pc0);\n    stackCaps.push(caps0);\n    while (stackPc.length) {\n      const pc = stackPc.pop()!;\n      const caps = stackCaps.pop()!;\n      if (mark[pc] === gen) continue;\n      mark[pc] = gen;\n      const inst = prog[pc];\n      switch (inst.op) {\n        case Op.Jmp:\n          stackPc.push(inst.x);\n          stackCaps.push(caps);\n          break;\n        case Op.Split:\n          stackPc.push(inst.y, inst.x);\n          stackCaps.push(caps, caps);\n          break;\n        case Op.Save: {\n          const next = caps.slice();\n          next[inst.n] = pos;\n          stackPc.push(pc + 1);\n          stackCaps.push(next);\n          break;\n        }\n        case Op.Assert:\n          if (checkAssert(inst.kind, hay, pos)) {\n            stackPc.push(pc + 1);\n            stackCaps.push(caps);\n          }\n          break;\n        default:\n          listPc.push(pc);\n          listCaps.push(caps);\n      }\n    }\n  };\n\n  let i = start;\n  if (budget.steps <= 0 || now() > budget.deadline) {\n    budget.exhausted = true;\n    return \"budget\";\n  }\n  let steps = 0;\n  for (;;) {\n    if (!matched) add(clistPc, clistCaps, 0, initial, i);\n    const cp = i < end ? hay.codePointAt(i)! : -1;\n    const width = cp > 0xffff ? 2 : 1;\n    if (clistPc.length === 0) {\n      // Nothing alive here (e.g. an assertion failed at the start): move on.\n      if (matched || i >= end) break;\n      gen++;\n      i += width;\n      continue;\n    }\n    const folded = cp >= 0 && caseInsensitive ? foldCodePoint(cp) : cp;\n    gen++;\n    nlistPc = [];\n    nlistCaps = [];\n    for (let t = 0; t < clistPc.length; t++) {\n      if (++steps >= 4096) {\n        budget.steps -= steps;\n        steps = 0;\n        if (budget.steps <= 0 || now() > budget.deadline) {\n          budget.exhausted = true;\n          return \"budget\";\n        }\n      }\n      const inst = prog[clistPc[t]];\n      if (inst.op === Op.Char) {\n        if (cp >= 0 && inst.test(cp, folded)) add(nlistPc, nlistCaps, clistPc[t] + 1, clistCaps[t], i + width);\n      } else if (inst.op === Op.Match) {\n        matched = clistCaps[t];\n        // Lower-priority threads lose to this match.\n        break;\n      }\n    }\n    clistPc = nlistPc;\n    clistCaps = nlistCaps;\n    if (i >= end) break;\n    i += width;\n  }\n  budget.steps -= steps;\n  if (!matched) return null;\n  const groups: (string | undefined)[] = [];\n  for (let g = 0; g <= groupCount; g++) {\n    const a = matched[2 * g];\n    const b = matched[2 * g + 1];\n    groups.push(a >= 0 && b >= 0 ? hay.slice(a, b) : undefined);\n  }\n  return { start: matched[0], end: matched[1], groups };\n}\n\n// ---------------------------------------------------------------------------\n// Raw regex mode\n// ---------------------------------------------------------------------------\n\nconst WORD_CLASS = \"[\\\\p{L}\\\\p{M}\\\\p{Nd}\\\\p{Pc}]\";\nconst REGEX_BOUNDARY = `(?:(?<=${WORD_CLASS})(?!${WORD_CLASS})|(?<!${WORD_CLASS})(?=${WORD_CLASS}))`;\n\n/**\n * Rejects a repeated group that itself contains a repeat (`(a+)+`, `(\\w*)*`),\n * the shape behind most catastrophic backtracking in `RegExp`.\n */\nfunction hasNestedRepeat(source: string): boolean {\n  /** The quantifier at `i`: whether it repeats at all, and whether more than once. */\n  const quantifierAt = (i: number): { repeats: boolean; many: boolean } => {\n    const c = source[i];\n    if (c === \"*\" || c === \"+\") return { repeats: true, many: true };\n    if (c === \"{\") {\n      const m = /^\\{(\\d*)(,?)(\\d*)\\}/.exec(source.slice(i));\n      if (m) {\n        const max = m[2] ? (m[3] ? Number(m[3]) : Infinity) : Number(m[1]);\n        return { repeats: max > 1, many: max > 1 };\n      }\n    }\n    return { repeats: false, many: false };\n  };\n  // For each open group: whether it contains a repeat.\n  const stack: boolean[] = [];\n  let inClass = false;\n  for (let i = 0; i < source.length; i++) {\n    const c = source[i];\n    if (c === \"\\\\\") {\n      i++;\n      continue;\n    }\n    if (inClass) {\n      if (c === \"]\") inClass = false;\n      continue;\n    }\n    if (c === \"[\") {\n      inClass = true;\n    } else if (c === \"(\") {\n      stack.push(false);\n    } else if (c === \")\") {\n      const inner = stack.pop() ?? false;\n      const q = quantifierAt(i + 1);\n      if (inner && q.many) return true;\n      if (stack.length && (inner || q.repeats)) stack[stack.length - 1] = true;\n    } else if (stack.length && quantifierAt(i).repeats) {\n      stack[stack.length - 1] = true;\n    }\n  }\n  return false;\n}\n\nfunction compileRegex(query: string, o: FindOptions): CompiledFindPattern {\n  if (hasNestedRepeat(query)) {\n    throw new PatternError(\n      \"too_complex\",\n      \"a repeated group containing a repeat, like (a+)+, can take exponential time; rewrite it without nesting\",\n    );\n  }\n  let source = query;\n  if (o.wholeWord || (o.matchPrefix && o.matchSuffix)) source = `${REGEX_BOUNDARY}(?:${query})${REGEX_BOUNDARY}`;\n  else if (o.matchPrefix) source = `${REGEX_BOUNDARY}(?:${query})`;\n  else if (o.matchSuffix) source = `(?:${query})${REGEX_BOUNDARY}`;\n  let re: RegExp;\n  try {\n    re = new RegExp(source, o.matchCase ? \"gu\" : \"giu\");\n  } catch (error) {\n    throw new PatternError(\"invalid_pattern\", `bad pattern: ${error instanceof Error ? error.message : String(error)}`);\n  }\n  let slicedFor: { hay: string; end: number; text: string } | null = null;\n  return {\n    mode: \"regex\",\n    spansParagraphs: false,\n    caseInsensitive: !o.matchCase,\n    groupCount: 0,\n    exec(hay, start, end, budget) {\n      if (now() > budget.deadline) {\n        budget.exhausted = true;\n        return \"budget\";\n      }\n      let text = hay;\n      if (end < hay.length) {\n        if (!slicedFor || slicedFor.hay !== hay || slicedFor.end !== end) {\n          slicedFor = { hay, end, text: hay.slice(0, end) };\n        }\n        text = slicedFor.text;\n      }\n      re.lastIndex = start;\n      const m = re.exec(text);\n      if (!m) return null;\n      return { start: m.index, end: m.index + m[0].length, groups: Array.from(m) };\n    },\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\n/** Translates Word's Find what text. Never throws: invalid text returns `{ ok: false, error }`. */\nexport function compileFindPattern(query: string, options: FindOptions = {}): CompileFindPatternResult {\n  try {\n    if (Array.from(query).length > MAX_FIND_PATTERN_LENGTH) {\n      throw new PatternError(\"too_long\", `the Find what text is longer than ${MAX_FIND_PATTERN_LENGTH} characters`);\n    }\n    if (options.regex) return { ok: true, pattern: compileRegex(query, options) };\n\n    const wildcards = !!options.wildcards && !options.literal;\n    // Word's wildcard search always matches case.\n    const caseInsensitive = !options.matchCase && !wildcards;\n    let node: Node;\n    let spans: boolean;\n    let groups = 0;\n    if (wildcards) {\n      ({ node, spans, groups } = parseWildcards(query));\n    } else {\n      ({ node, spans } = parseSpecial(query, options, caseInsensitive));\n      const before = options.wholeWord || options.matchPrefix;\n      const after = options.wholeWord || options.matchSuffix;\n      if (before || after) {\n        const items: Node[] = [];\n        if (before) items.push({ k: \"assert\", kind: \"boundary\" });\n        items.push(node);\n        if (after) items.push({ k: \"assert\", kind: \"boundary\" });\n        node = { k: \"cat\", items };\n      }\n    }\n    const prog = compileProgram(node);\n    return {\n      ok: true,\n      pattern: {\n        mode: wildcards ? \"wildcards\" : \"special\",\n        spansParagraphs: spans,\n        caseInsensitive,\n        groupCount: groups,\n        exec: (hay, start, end, budget) => pikeExec(prog, groups, caseInsensitive, hay, start, end, budget),\n      },\n    };\n  } catch (error) {\n    if (error instanceof PatternError) return { ok: false, error: { code: error.code, message: error.message } };\n    return { ok: false, error: { code: \"invalid_pattern\", message: error instanceof Error ? error.message : String(error) } };\n  }\n}\n\nexport interface FindAllOptions {\n  /**\n   * Offsets where the live text breaks (e.g. where tracked-deleted text was\n   * skipped): no match spans a cut.\n   */\n  cuts?: readonly number[];\n  budget?: SearchBudget;\n  /** Stop after this many matches (default 10 000). */\n  maxMatches?: number;\n}\n\nexport interface FindAllResult {\n  matches: PatternMatch[];\n  /** The search stopped early (match cap or time budget). */\n  truncated: boolean;\n}\n\n/**\n * Every non-empty match in `hay`, left to right, without overlaps. Empty\n * matches are stepped past so the search always moves on.\n */\nexport function findAllMatches(\n  pattern: CompiledFindPattern,\n  hay: string,\n  options: FindAllOptions = {},\n): FindAllResult {\n  const budget = options.budget ?? createSearchBudget();\n  const maxMatches = options.maxMatches ?? 10_000;\n  const cuts = [...(options.cuts ?? []), hay.length].sort((a, b) => a - b);\n  const matches: PatternMatch[] = [];\n  let from = 0;\n  for (const cut of cuts) {\n    if (cut <= from) continue;\n    let pos = from;\n    from = cut;\n    for (;;) {\n      const m = pattern.exec(hay, pos, cut, budget);\n      if (m === \"budget\") return { matches, truncated: true };\n      if (!m) break;\n      const empty = m.end === m.start;\n      const next = empty ? m.end + (cpAt(hay, m.end) > 0xffff ? 2 : 1) : m.end;\n      if (next > cut) break;\n      pos = next;\n      if (empty) continue;\n      matches.push(m);\n      if (matches.length >= maxMatches) return { matches, truncated: true };\n    }\n  }\n  return { matches, truncated: false };\n}\n\n/** A piece of Replace with text. */\nexport type ReplacePiece =\n  | { type: \"text\"; text: string }\n  /** `^&`: the text found. */\n  | { type: \"found\" }\n  /** `\\n` with wildcards: group `n`. */\n  | { type: \"group\"; index: number }\n  /** `^c`: the clipboard. */\n  | { type: \"clipboard\" };\n\n/** Reads Replace with text: `^` codes (unless `literal`), and `\\1`–`\\9` with wildcards. Regex mode is literal. */\nexport function parseReplacement(replacement: string, options: FindOptions = {}): ReplacePiece[] {\n  if (options.literal || options.regex) return replacement ? [{ type: \"text\", text: replacement }] : [];\n  const chars = toChars(replacement);\n  const out: ReplacePiece[] = [];\n  let cur = \"\";\n  const flush = () => {\n    if (cur) out.push({ type: \"text\", text: cur });\n    cur = \"\";\n  };\n  let i = 0;\n  while (i < chars.length) {\n    const c = chars[i++];\n    if (c === \"\\\\\" && options.wildcards && i < chars.length) {\n      const d = chars[i];\n      if (/[1-9]/.test(d)) {\n        flush();\n        out.push({ type: \"group\", index: Number(d) });\n      } else {\n        cur += d;\n      }\n      i++;\n      continue;\n    }\n    if (c === \"^\" && i < chars.length) {\n      const n = chars[i];\n      if (n === \"&\" || n === \"c\") {\n        flush();\n        out.push(n === \"&\" ? { type: \"found\" } : { type: \"clipboard\" });\n        i++;\n        continue;\n      }\n      const code = replaceCode(n);\n      if (code !== null) {\n        cur += code;\n        i++;\n        continue;\n      }\n      const num = numericCode(chars, i);\n      if (num) {\n        cur += String.fromCodePoint(num.cp);\n        i += num.used;\n        continue;\n      }\n    }\n    cur += c;\n  }\n  flush();\n  return out;\n}\n\n/** Fills in Replace with text for one match. Paragraph marks in the result are `\\r`. */\nexport function expandReplacement(pieces: readonly ReplacePiece[], match: PatternMatch, clipboardText = \"\"): string {\n  let out = \"\";\n  for (const piece of pieces) {\n    switch (piece.type) {\n      case \"text\":\n        out += piece.text;\n        break;\n      case \"found\":\n        out += match.groups[0] ?? \"\";\n        break;\n      case \"group\":\n        out += match.groups[piece.index] ?? \"\";\n        break;\n      case \"clipboard\":\n        out += clipboardText.replace(/\\r\\n/g, \"\\r\").replace(/\\n/g, \"\\r\");\n        break;\n    }\n  }\n  return out;\n}\n","// Portions ported from wordcraft/crates/engine/src/cmd/edit.rs (MIT OR Apache-2.0, © ArtCraft Team and contributors). See THIRD_PARTY_NOTICES.md.\nimport type { Mark as ProsemirrorMark, Node as ProsemirrorNode, Schema } from \"@tiptap/pm/model\";\nimport type { Transaction } from \"@tiptap/pm/state\";\nimport {\n  FIND_PARAGRAPH_MARK,\n  compileFindPattern,\n  createSearchBudget,\n  expandReplacement,\n  findAllMatches,\n  parseReplacement,\n  type FindOptions,\n  type FindPatternError,\n} from \"./pattern\";\n\n/** Name of the tracked-deletion mark (see `track-changes.ts`); deleted text is not searched. */\nconst DELETION_MARK = \"deletion\";\n/** Review marks the replacement text does not inherit from the found text. */\nconst DROPPED_REPLACEMENT_MARKS = new Set([DELETION_MARK, \"formatChange\"]);\n/** Stands for an inline node other than text or a hard break (`^g`). */\nconst OBJECT_CHAR = \"\\ufffc\";\n\nexport interface FindMatch {\n  /** Document position of the first matched character. */\n  from: number;\n  /** Document position after the last matched character. */\n  to: number;\n  /** The matched text (`\\r` for paragraph marks, `\\n` for hard breaks). */\n  text: string;\n  /** The Replace with text for this match (`\\r` splits paragraphs). */\n  replacement: string;\n}\n\nexport interface DocumentSearchOptions {\n  /** Replace with text (`^&`, `^c`, `\\1`…). */\n  replacement?: string;\n  /** Text of `^c` in the replacement. */\n  clipboardText?: string;\n  /** Wall-clock budget for the whole search (default 250 ms). */\n  timeLimitMs?: number;\n  /** Match cap (default 10 000). */\n  maxMatches?: number;\n}\n\nexport interface DocumentSearchResult {\n  matches: FindMatch[];\n  /** The search stopped early at the match cap or time budget. */\n  truncated: boolean;\n  error: FindPatternError | null;\n}\n\ninterface Block {\n  node: ProsemirrorNode;\n  pos: number;\n  parent: ProsemirrorNode | null;\n  index: number;\n}\n\n/**\n * Finds `query` in a document. Each textblock is read as text without\n * tracked-deleted runs (a deletion \"cuts\" the text, so no match spans it, but\n * word boundaries see the live text on both sides); a pattern that can match\n * `^p` reads runs of sibling textblocks as one text with `\\r` between them.\n */\nexport function searchDocument(\n  doc: ProsemirrorNode,\n  query: string,\n  options: FindOptions = {},\n  searchOptions: DocumentSearchOptions = {},\n): DocumentSearchResult {\n  if (!query) return { matches: [], truncated: false, error: null };\n  const compiled = compileFindPattern(query, options);\n  if (!compiled.ok) return { matches: [], truncated: false, error: compiled.error };\n  const pattern = compiled.pattern;\n  const pieces = parseReplacement(searchOptions.replacement ?? \"\", options);\n  const budget = createSearchBudget({ timeLimitMs: searchOptions.timeLimitMs });\n  const maxMatches = searchOptions.maxMatches ?? 10_000;\n\n  const blocks: Block[] = [];\n  doc.descendants((node, pos, parent, index) => {\n    if (!node.isTextblock) return true;\n    blocks.push({ node, pos, parent, index });\n    return false;\n  });\n\n  // Textblocks read as one text: consecutive siblings when the pattern spans paragraphs.\n  const chunks: Block[][] = [];\n  blocks.forEach((block, i) => {\n    const prev = blocks[i - 1];\n    const joins =\n      pattern.spansParagraphs && prev && prev.parent === block.parent && prev.index + 1 === block.index;\n    if (joins) chunks[chunks.length - 1].push(block);\n    else chunks.push([block]);\n  });\n\n  const matches: FindMatch[] = [];\n  let truncated = false;\n  for (const chunk of chunks) {\n    let hay = \"\";\n    // Document position of each hay offset, and the position after it.\n    const posOf: number[] = [];\n    const endOf: number[] = [];\n    const cuts: number[] = [];\n    chunk.forEach((block, k) => {\n      const contentStart = block.pos + 1;\n      block.node.forEach((child, offset) => {\n        const at = contentStart + offset;\n        if (child.marks.some((m) => m.type.name === DELETION_MARK)) {\n          if (cuts[cuts.length - 1] !== hay.length) cuts.push(hay.length);\n          return;\n        }\n        if (child.isText) {\n          const text = child.text ?? \"\";\n          for (let j = 0; j < text.length; j++) {\n            posOf.push(at + j);\n            endOf.push(at + j + 1);\n          }\n          hay += text;\n        } else {\n          posOf.push(at);\n          endOf.push(at + child.nodeSize);\n          hay += child.type.name === \"hardBreak\" ? \"\\n\" : OBJECT_CHAR;\n        }\n      });\n      const next = chunk[k + 1];\n      if (next) {\n        posOf.push(contentStart + block.node.content.size);\n        endOf.push(next.pos + 1);\n        hay += FIND_PARAGRAPH_MARK;\n      }\n    });\n    if (!hay) continue;\n    const result = findAllMatches(pattern, hay, {\n      cuts,\n      budget,\n      maxMatches: maxMatches - matches.length,\n    });\n    for (const m of result.matches) {\n      matches.push({\n        from: posOf[m.start],\n        to: endOf[m.end - 1],\n        text: m.groups[0] ?? hay.slice(m.start, m.end),\n        replacement: expandReplacement(pieces, m, searchOptions.clipboardText ?? \"\"),\n      });\n    }\n    if (result.truncated) {\n      truncated = true;\n      break;\n    }\n  }\n  return { matches, truncated, error: null };\n}\n\n/** Marks the replacement for a match inherits: the found text's, minus tracked-change marks. */\nfunction replacementMarks(doc: ProsemirrorNode, from: number, to: number): readonly ProsemirrorMark[] {\n  const $from = doc.resolve(from);\n  const node = from < to ? $from.nodeAfter : null;\n  const marks = node ? node.marks : $from.marks();\n  return marks.filter((m) => !DROPPED_REPLACEMENT_MARKS.has(m.type.name));\n}\n\n/** Inline content for a piece of replacement text: `\\n` becomes a hard break when the schema has one. */\nfunction inlineContent(schema: Schema, text: string, marks: readonly ProsemirrorMark[]): ProsemirrorNode[] {\n  const nodes: ProsemirrorNode[] = [];\n  const hardBreak = schema.nodes.hardBreak;\n  const parts = hardBreak ? text.split(\"\\n\") : [text];\n  parts.forEach((part, i) => {\n    if (i > 0) nodes.push(hardBreak.create(null, null, marks));\n    if (part) nodes.push(schema.text(part, marks));\n  });\n  return nodes;\n}\n\n/**\n * Replaces matches in one transaction, last first so earlier positions stay\n * valid. A paragraph mark (`\\r` or U+2029) in a replacement splits the\n * paragraph. Returns the mapped end of each replacement (in match order).\n */\nexport function applyReplacements(tr: Transaction, matches: readonly FindMatch[]): number[] {\n  const ends: number[] = new Array(matches.length);\n  const schema = tr.doc.type.schema;\n  for (let i = matches.length - 1; i >= 0; i--) {\n    const { from, to, replacement } = matches[i];\n    const marks = replacementMarks(tr.doc, from, to);\n    const parts = replacement.split(/[\\r\\u2029]/);\n    const stepsBefore = tr.steps.length;\n    const first = inlineContent(schema, parts[0], marks);\n    if (first.length) tr.replaceWith(from, to, first);\n    else if (to > from) tr.delete(from, to);\n    let pos = tr.mapping.slice(stepsBefore).map(to, 1);\n    for (let k = 1; k < parts.length; k++) {\n      tr.split(pos);\n      pos += 2;\n      const content = inlineContent(schema, parts[k], marks);\n      if (content.length) {\n        tr.insert(pos, content);\n        pos += content.reduce((size, node) => size + node.nodeSize, 0);\n      }\n    }\n    // Positions of later replacements were already mapped; record this one's end\n    // and shift the later ends by what this replacement changed.\n    const map = tr.mapping.slice(stepsBefore);\n    for (let j = i + 1; j < matches.length; j++) ends[j] = map.map(ends[j], 1);\n    ends[i] = pos;\n  }\n  return ends;\n}\n","import { getHTMLFromFragment, type Extensions } from \"@tiptap/core\";\nimport { Fragment, type Node as ProsemirrorNode } from \"@tiptap/pm/model\";\nimport * as _Table from \"@tiptap/extension-table\";\nimport * as _TableRow from \"@tiptap/extension-table-row\";\nimport * as _TableHeader from \"@tiptap/extension-table-header\";\nimport * as _TableCell from \"@tiptap/extension-table-cell\";\nimport { createTableNestingPlugin } from \"./nesting\";\n\nconst resolveExt = (mod: any, name: string) =>\n  mod?.[name] || mod?.default?.[name] || mod?.default?.default || mod?.default || mod;\n\nconst BaseTable = resolveExt(_Table, \"Table\");\nconst BaseTableRow = resolveExt(_TableRow, \"TableRow\");\nconst BaseTableHeader = resolveExt(_TableHeader, \"TableHeader\");\nconst BaseTableCell = resolveExt(_TableCell, \"TableCell\");\n\n/** Horizontal alignment of a table cell (`align` attribute). */\nexport type TableCellAlignment = \"left\" | \"center\" | \"right\" | \"justify\";\n\nconst ALIGNMENTS = new Set<TableCellAlignment>([\"left\", \"center\", \"right\", \"justify\"]);\n\n/** Returns a valid cell alignment, or `null`. */\nexport function normalizeTableCellAlignment(value: unknown): TableCellAlignment | null {\n  const v = typeof value === \"string\" ? value.trim().toLowerCase() : \"\";\n  return ALIGNMENTS.has(v as TableCellAlignment) ? (v as TableCellAlignment) : null;\n}\n\n/**\n * Color values allowed as a cell background: hex, `rgb()/rgba()/hsl()/hsla()`\n * with numeric arguments, or a CSS color keyword. Anything else (e.g.\n * `url(...)`, `expression(...)`, `;`) is rejected because the value ends up in\n * a `style` attribute.\n */\nconst COLOR_REGEX =\n  /^(?:#[0-9a-f]{3,8}|(?:rgb|rgba|hsl|hsla)\\(\\s*[-0-9.%\\s,/deg]+\\)|[a-z]{3,20})$/i;\n\n/** Returns a safe CSS color for a cell background, or `null`. */\nexport function normalizeTableCellColor(value: unknown): string | null {\n  const v = typeof value === \"string\" ? value.trim() : \"\";\n  if (!v || v.length > 64 || !COLOR_REGEX.test(v)) return null;\n  if (/^(?:inherit|initial|unset|revert|transparent)$/i.test(v)) return null;\n  return v;\n}\n\n/** Cell attributes added on top of TipTap's `colspan` / `rowspan` / `colwidth`. */\nconst cellAttributes = () => ({\n  align: {\n    default: null,\n    parseHTML: (element: HTMLElement) =>\n      normalizeTableCellAlignment(element.style?.textAlign || element.getAttribute(\"align\")),\n    renderHTML: (attrs: Record<string, any>) => {\n      const align = normalizeTableCellAlignment(attrs.align);\n      return align ? { style: `text-align: ${align}` } : {};\n    },\n  },\n  backgroundColor: {\n    default: null,\n    parseHTML: (element: HTMLElement) =>\n      normalizeTableCellColor(\n        element.getAttribute(\"data-background-color\") ||\n          element.style?.backgroundColor ||\n          element.getAttribute(\"bgcolor\"),\n      ),\n    renderHTML: (attrs: Record<string, any>) => {\n      const color = normalizeTableCellColor(attrs.backgroundColor);\n      return color ? { style: `background-color: ${color}`, \"data-background-color\": color } : {};\n    },\n  },\n});\n\n// ---------------------------------------------------------------------------\n// Markdown (tiptap-markdown)\n// ---------------------------------------------------------------------------\n\nconst children = (node: ProsemirrorNode) => {\n  const list: ProsemirrorNode[] = [];\n  node.forEach((child) => list.push(child));\n  return list;\n};\n\nconst hasSpan = (cell: ProsemirrorNode) => (cell.attrs.colspan ?? 1) > 1 || (cell.attrs.rowspan ?? 1) > 1;\n\n/**\n * Whether a table can be written as a GFM pipe table: the first row is all\n * header cells, the other rows have none, no cell spans rows or columns, and\n * every cell holds a single paragraph.\n */\nexport function isGfmTable(node: ProsemirrorNode): boolean {\n  const rows = children(node);\n  if (rows.length === 0) return false;\n  const width = rows[0].childCount;\n  return rows.every(\n    (row, r) =>\n      row.childCount === width &&\n      children(row).every(\n        (cell) =>\n          (r === 0 ? cell.type.name === \"tableHeader\" : cell.type.name === \"tableCell\") &&\n          !hasSpan(cell) &&\n          cell.childCount === 1 &&\n          cell.firstChild!.type.name === \"paragraph\",\n      ),\n  );\n}\n\nconst DELIMITERS: Record<string, string> = { left: \":---\", center: \":---:\", right: \"---:\" };\n\n/**\n * tiptap-markdown serializer for tables: GFM pipe tables (with column\n * alignment from the header cells and `|` escaped) when `isGfmTable`, HTML\n * otherwise (spans, header columns, multi-paragraph cells).\n */\nfunction serializeTableMarkdown(state: any, node: ProsemirrorNode) {\n  if (!isGfmTable(node)) {\n    const html = getHTMLFromFragment(Fragment.from(node), node.type.schema);\n    // An HTML block must start on its own line and contain no blank lines.\n    state.write(html.replace(/\\n{2,}/g, \"\\n\"));\n    state.closeBlock(node);\n    return;\n  }\n  const previous = state.inTable;\n  state.inTable = true;\n  children(node).forEach((row, r) => {\n    if (r) state.ensureNewLine();\n    state.write(\"| \");\n    children(row).forEach((cell, c) => {\n      if (c) state.write(\" | \");\n      const paragraph = cell.firstChild!;\n      // Render in place (mid-line, so no block prefix is added), then escape\n      // the cell's pipes and line breaks, which would end the cell or row.\n      const start = state.out.length;\n      if (paragraph.childCount) state.renderInline(paragraph);\n      const text: string = state.out.slice(start);\n      state.out = state.out.slice(0, start) + text.replace(/\\n/g, \" \").replace(/\\|/g, \"\\\\|\");\n    });\n    state.write(\" |\");\n    if (r === 0) {\n      const delimiter = children(row).map((cell) => DELIMITERS[cell.attrs.align] ?? \"---\");\n      state.ensureNewLine();\n      state.write(`| ${delimiter.join(\" | \")} |`);\n    }\n  });\n  state.inTable = previous;\n  state.closeBlock(node);\n}\n\n// ---------------------------------------------------------------------------\n// Extensions\n// ---------------------------------------------------------------------------\n\nexport interface RichTextTableOptions {\n  /** Drag column borders to resize columns (stored as `colwidth`). Default `true`. */\n  resizable: boolean;\n  /** Width of the resize handle in pixels. Default 5. */\n  handleWidth: number;\n  /** Minimum cell width in pixels. Default 25. */\n  cellMinWidth: number;\n  /** Whether the last column can be resized. Default `true`. */\n  lastColumnResizable: boolean;\n  /** Allow selecting the whole table as a node (click its border, Esc from a cell selection). Default `true`. */\n  allowTableNodeSelection: boolean;\n  /** HTML attributes of the `<table>` element. */\n  HTMLAttributes: Record<string, any>;\n  /** HTML attributes of `<td>` elements. */\n  cellHTMLAttributes: Record<string, any>;\n  /** HTML attributes of `<th>` elements. */\n  headerHTMLAttributes: Record<string, any>;\n  /** HTML attributes of `<tr>` elements. */\n  rowHTMLAttributes: Record<string, any>;\n}\n\nexport const DEFAULT_TABLE_OPTIONS: RichTextTableOptions = {\n  resizable: true,\n  handleWidth: 5,\n  cellMinWidth: 25,\n  lastColumnResizable: true,\n  allowTableNodeSelection: true,\n  HTMLAttributes: { class: \"pixerate-table\" },\n  cellHTMLAttributes: {},\n  headerHTMLAttributes: {},\n  rowHTMLAttributes: {},\n};\n\n/**\n * TipTap's `Table` with the GFM-aware markdown serializer and the nesting\n * guard (`createTableNestingPlugin`): tables are never pasted, imported or\n * inserted into table cells.\n */\nexport const Table = BaseTable.extend({\n  addStorage() {\n    return { markdown: { serialize: serializeTableMarkdown } };\n  },\n  addProseMirrorPlugins() {\n    return [...(this.parent?.() ?? []), createTableNestingPlugin()];\n  },\n});\n\nexport const TableRow = BaseTableRow;\n\n/** TipTap's `TableCell` plus `align` and `backgroundColor` attributes. */\nexport const TableCell = BaseTableCell.extend({\n  addAttributes() {\n    return { ...this.parent?.(), ...cellAttributes() };\n  },\n});\n\n/** TipTap's `TableHeader` plus `align` and `backgroundColor` attributes. */\nexport const TableHeader = BaseTableHeader.extend({\n  addAttributes() {\n    return { ...this.parent?.(), ...cellAttributes() };\n  },\n});\n\n/**\n * The table extensions (`table`, `tableRow`, `tableHeader`, `tableCell`)\n * configured for rich documents: resizable columns, header rows, columns and\n * cells, `colspan` / `rowspan` from imported HTML, cell alignment and\n * background, table node selection and GFM markdown. `createRichTextPreset`\n * adds them unless `table: false`.\n */\nexport function createTableExtensions(options: Partial<RichTextTableOptions> = {}): Extensions {\n  const o = { ...DEFAULT_TABLE_OPTIONS, ...options };\n  return [\n    Table.configure({\n      resizable: o.resizable,\n      handleWidth: o.handleWidth,\n      cellMinWidth: o.cellMinWidth,\n      lastColumnResizable: o.lastColumnResizable,\n      allowTableNodeSelection: o.allowTableNodeSelection,\n      HTMLAttributes: o.HTMLAttributes,\n    }),\n    TableRow.configure({ HTMLAttributes: o.rowHTMLAttributes }),\n    TableHeader.configure({ HTMLAttributes: o.headerHTMLAttributes }),\n    TableCell.configure({ HTMLAttributes: o.cellHTMLAttributes }),\n  ];\n}\n","import type { Editor, NodeViewRendererProps } from \"@tiptap/core\";\nimport { DOMSerializer, type DOMOutputSpec, type Node as ProsemirrorNode } from \"@tiptap/pm/model\";\nimport { NodeSelection } from \"@tiptap/pm/state\";\nimport type { NodeView } from \"@tiptap/pm/view\";\nimport { ChartController } from \"../../chart/controller\";\nimport type { ChartSpec } from \"../../chart/types\";\n\n/** What a framework chart node view draws. A new object is passed on every change. */\nexport interface ChartNodeViewState {\n  /** The chart's id in the document. */\n  id: string | null;\n  /** Edits the chart: changes are written back to the document when no gesture is running. */\n  controller: ChartController;\n  /** Width in pixels, or null to fill the line. */\n  width: number | null;\n  /** Height in pixels. */\n  height: number;\n  /** The editor is editable (a read-only editor never opens the inspector). */\n  editable: boolean;\n  /** The node is selected. */\n  selected: boolean;\n  /** The inspector is open. */\n  editing: boolean;\n  /** Opens (selecting the node) or closes the inspector. Ignored while the editor is read-only. */\n  setEditing: (editing: boolean) => void;\n  /** Changes the chart's size (one undo step). */\n  setSize: (size: { width?: number | null; height?: number }) => void;\n}\n\n/** A mounted framework component. */\nexport interface ChartNodeViewRenderer {\n  update(state: ChartNodeViewState): void;\n  destroy(): void;\n}\n\n/** Mounts a framework component into a chart node view's element. */\nexport type ChartNodeViewMount = (dom: HTMLElement, state: ChartNodeViewState) => ChartNodeViewRenderer;\n\nconst specKey = (spec: unknown) => JSON.stringify(spec);\n\n/**\n * The ProseMirror side of a chart node view, shared by the React and Svelte packages: it\n * keeps a `ChartController` in step with the node (undo, collaboration and agent edits load\n * into it), writes the controller's edits back as document transactions once any gesture\n * has ended, and lets the inspector's inputs keep their events while it is open.\n */\nexport class ChartNodeView implements NodeView {\n  readonly dom: HTMLElement;\n  private node: ProsemirrorNode;\n  private readonly editor: Editor;\n  private readonly getPos: () => number | undefined;\n  private readonly controller: ChartController;\n  private readonly renderer: ChartNodeViewRenderer | null;\n  private readonly unsubscribe: () => void;\n  private editing = false;\n  private selected = false;\n  private editable: boolean;\n  private key: string;\n\n  constructor(\n    props: Pick<NodeViewRendererProps, \"editor\" | \"node\" | \"getPos\">,\n    mount: ChartNodeViewMount | null,\n    private readonly renderStatic: (node: ProsemirrorNode) => DOMOutputSpec,\n  ) {\n    this.editor = props.editor;\n    this.node = props.node;\n    this.getPos = typeof props.getPos === \"function\" ? (props.getPos as () => number | undefined) : () => undefined;\n    this.editable = this.editor.isEditable;\n    this.dom = document.createElement(\"div\");\n    this.dom.className = \"pixerate-chart-node\";\n    this.dom.setAttribute(\"data-type\", \"chart\");\n    this.dom.contentEditable = \"false\";\n    this.syncAttributes();\n    this.key = specKey(this.node.attrs.spec);\n    this.controller = new ChartController({ spec: this.node.attrs.spec });\n    this.unsubscribe = this.controller.subscribe((state) => {\n      if (!state.gesture) this.writeBack();\n    });\n    this.editor.on(\"update\", this.onEditorUpdate);\n    this.renderer = mount ? mount(this.dom, this.viewState()) : null;\n    if (!mount) this.drawStatic();\n  }\n\n  private viewState(): ChartNodeViewState {\n    return {\n      id: this.node.attrs.id ?? null,\n      controller: this.controller,\n      width: this.node.attrs.width ?? null,\n      height: this.node.attrs.height,\n      editable: this.editable,\n      selected: this.selected,\n      editing: this.editing,\n      setEditing: this.setEditing,\n      setSize: this.setSize,\n    };\n  }\n\n  private render() {\n    if (this.renderer) this.renderer.update(this.viewState());\n    else this.drawStatic();\n    this.dom.toggleAttribute(\"data-editing\", this.editing);\n  }\n\n  private drawStatic() {\n    const { dom } = DOMSerializer.renderSpec(document, this.renderStatic(this.node));\n    this.dom.replaceChildren(dom);\n  }\n\n  private syncAttributes() {\n    if (this.node.attrs.id) this.dom.setAttribute(\"data-chart-id\", this.node.attrs.id);\n    else this.dom.removeAttribute(\"data-chart-id\");\n  }\n\n  private onEditorUpdate = () => {\n    if (this.editor.isEditable === this.editable) return;\n    this.editable = this.editor.isEditable;\n    if (!this.editable) this.editing = false;\n    this.render();\n  };\n\n  /** Writes the controller's spec into the node, if it changed. */\n  private writeBack() {\n    const spec = this.controller.toJSON();\n    const key = specKey(spec);\n    if (key === this.key) return;\n    const pos = this.getPos();\n    if (typeof pos !== \"number\" || this.editor.isDestroyed) return;\n    this.key = key;\n    this.editor.view.dispatch(this.editor.state.tr.setNodeMarkup(pos, undefined, { ...this.node.attrs, spec }));\n  }\n\n  setEditing = (editing: boolean) => {\n    if (editing && !this.editor.isEditable) return;\n    if (editing && !this.selected) {\n      const pos = this.getPos();\n      if (typeof pos === \"number\") {\n        this.editor.view.dispatch(this.editor.state.tr.setSelection(NodeSelection.create(this.editor.state.doc, pos)));\n      }\n    }\n    if (this.editing === editing) return;\n    this.editing = editing;\n    this.render();\n  };\n\n  setSize = (size: { width?: number | null; height?: number }) => {\n    const pos = this.getPos();\n    if (typeof pos !== \"number\" || !this.editor.isEditable) return;\n    this.editor.view.dispatch(this.editor.state.tr.setNodeMarkup(pos, undefined, { ...this.node.attrs, ...size }));\n  };\n\n  update(node: ProsemirrorNode): boolean {\n    if (node.type !== this.node.type) return false;\n    this.node = node;\n    this.syncAttributes();\n    const key = specKey(node.attrs.spec);\n    if (key !== this.key) {\n      this.key = key;\n      // Undo, an agent tool or a collaborator changed the chart: show it as the new start.\n      if (specKey(this.controller.toJSON()) !== key) this.controller.load(node.attrs.spec as ChartSpec, { clearHistory: true });\n    }\n    this.render();\n    return true;\n  }\n\n  selectNode() {\n    this.selected = true;\n    this.dom.classList.add(\"ProseMirror-selectednode\");\n    this.render();\n  }\n\n  deselectNode() {\n    this.selected = false;\n    this.editing = false;\n    this.dom.classList.remove(\"ProseMirror-selectednode\");\n    this.render();\n  }\n\n  /** The inspector's inputs, buttons and chart gestures keep their events while it is open. */\n  stopEvent(event: Event): boolean {\n    if (!this.editing) return false;\n    return !(event.type === \"dragstart\" && event.target === this.dom);\n  }\n\n  ignoreMutation(): boolean {\n    return true;\n  }\n\n  destroy() {\n    this.editor.off(\"update\", this.onEditorUpdate);\n    this.unsubscribe();\n    this.renderer?.destroy();\n    this.controller.destroy();\n  }\n}\n\n/**\n * A TipTap node view factory for the `chart` node. `mount` draws the framework component\n * (`null`: the static SVG, redrawn when the spec changes).\n */\nexport function createChartNodeView(\n  mount: ChartNodeViewMount | null,\n  renderStatic: (node: ProsemirrorNode) => DOMOutputSpec,\n) {\n  return (props: NodeViewRendererProps): NodeView => new ChartNodeView(props, mount, renderStatic);\n}\n","import { Node, mergeAttributes, type Editor } from \"@tiptap/core\";\nimport type { Node as ProsemirrorNode } from \"@tiptap/pm/model\";\nimport { Plugin, PluginKey, type EditorState, type Transaction } from \"@tiptap/pm/state\";\nimport { chartFromMermaid, chartToMermaid } from \"../../chart/mermaid\";\nimport { DEFAULT_CHART_THEME, normalizeChartSpec } from \"../../chart/spec\";\nimport { chartSceneToDomSpec, type ChartDomSpec } from \"../../chart/svg\";\nimport { layoutChart } from \"../../chart/layout\";\nimport { describeChart } from \"../../chart/summary\";\nimport type { ChartSpec, ChartTheme } from \"../../chart/types\";\nimport {\n  generateStructureId,\n  STRUCTURE_PRIORITY,\n  syncInitialContent,\n  transactionsInsert,\n} from \"../document-structure/utils\";\nimport { createChartNodeView, type ChartNodeViewMount } from \"./node-view\";\n\nexport interface ChartNodeOptions {\n  HTMLAttributes: Record<string, any>;\n  /**\n   * Draws the chart inside the editor with a framework component (the React and Svelte\n   * packages export one). Without it the editor shows the static SVG from `renderHTML`.\n   */\n  nodeView: ChartNodeViewMount | null;\n  /** Colours of the static SVG in exported HTML (default `DEFAULT_CHART_THEME`). */\n  theme: Partial<ChartTheme>;\n  /** Width of the static SVG when the node has no `width` (default 640). */\n  defaultWidth: number;\n  /** Height of new charts in pixels (default 320). */\n  defaultHeight: number;\n  /** Generates ids for charts that have none (default `chart-xxxxxxxx`). */\n  generateId: () => string;\n}\n\nexport interface InsertChartOptions {\n  /** Any partial or saved chart spec; it is normalized (see `normalizeChartSpec`). */\n  spec: Partial<ChartSpec> | unknown;\n  /** Width in pixels, or null to fill the line (default null). */\n  width?: number | null;\n  /** Height in pixels (default `defaultHeight`). */\n  height?: number;\n  /** Id to use (default: generated). */\n  id?: string;\n}\n\ndeclare module \"@tiptap/core\" {\n  interface Commands<ReturnType> {\n    chart: {\n      /** Inserts a chart block at the selection. */\n      insertChart: (options: InsertChartOptions) => ReturnType;\n      /** Replaces the spec (and optionally the size) of the chart with this id. */\n      updateChart: (\n        id: string,\n        changes: { spec?: Partial<ChartSpec> | unknown; width?: number | null; height?: number },\n      ) => ReturnType;\n    };\n  }\n}\n\nexport const chartPluginKey = new PluginKey(\"chartNode\");\n\n/** A chart in a document: its node, id and position. */\nexport interface DocumentChart {\n  id: string | null;\n  pos: number;\n  node: ProsemirrorNode;\n  spec: ChartSpec;\n}\n\n/** Every chart node in a document, in order. */\nexport function getDocumentCharts(doc: ProsemirrorNode, typeName = \"chart\"): DocumentChart[] {\n  const charts: DocumentChart[] = [];\n  doc.descendants((node, pos) => {\n    if (node.type.name === typeName) {\n      charts.push({ id: node.attrs.id ?? null, pos, node, spec: node.attrs.spec });\n      return false;\n    }\n    return !node.isTextblock;\n  });\n  return charts;\n}\n\n/** Whether the editor's schema has the chart node (`createRichTextPreset({ chart: true })`). */\nexport function isChartEnabled(editor: Pick<Editor, \"schema\"> | null | undefined): boolean {\n  return !!editor?.schema?.nodes?.chart;\n}\n\n/** Reads a chart spec from JSON text (or an object), or `null` when it is not a chart. */\nfunction readSpec(value: unknown): ChartSpec | null {\n  let input = value;\n  if (typeof value === \"string\") {\n    try {\n      input = JSON.parse(value);\n    } catch {\n      return null;\n    }\n  }\n  if (!input || typeof input !== \"object\" || Array.isArray(input)) return null;\n  return normalizeChartSpec(input).spec;\n}\n\nconst readSize = (value: string | null): number | null => {\n  const n = value === null ? NaN : Number(value);\n  return Number.isFinite(n) && n >= 50 && n <= 4096 ? n : null;\n};\n\n/** Gives charts without an id, or with a duplicate one (after a copy), a fresh id. */\nfunction syncChartIds(state: EditorState, typeName: string, generateId: () => string): Transaction | null {\n  const seen = new Set<string>();\n  let tr: Transaction | null = null;\n  for (const chart of getDocumentCharts(state.doc, typeName)) {\n    if (chart.id && !seen.has(chart.id)) {\n      seen.add(chart.id);\n      continue;\n    }\n    let id = generateId();\n    while (seen.has(id)) id = generateId();\n    seen.add(id);\n    tr = tr ?? state.tr;\n    tr.setNodeMarkup(chart.pos, undefined, { ...chart.node.attrs, id });\n  }\n  return tr?.setMeta(\"addToHistory\", false) ?? null;\n}\n\n/** The static SVG of a chart node, as a `DOMOutputSpec`. */\nexport function staticChartSvg(\n  node: ProsemirrorNode,\n  options: Pick<ChartNodeOptions, \"theme\" | \"defaultWidth\" | \"defaultHeight\">,\n): ChartDomSpec {\n  const spec: ChartSpec = node.attrs.spec;\n  const width = node.attrs.width ?? options.defaultWidth;\n  const height = node.attrs.height ?? options.defaultHeight;\n  const scene = layoutChart(spec, { width, height, theme: options.theme, selection: null });\n  return chartSceneToDomSpec(scene, {\n    ariaLabel: spec.title || \"Chart\",\n    description: describeChart(spec),\n    attrs: { style: \"max-width: 100%; height: auto; display: block\" },\n  });\n}\n\n/** The longest run of backticks in `text`, so a fence can be one longer. */\nconst longestBacktickRun = (text: string) =>\n  Math.max(0, ...Array.from(text.matchAll(/`+/g), (m) => m[0].length));\n\n/**\n * A chart block. Stores a `ChartSpec` as its `spec` attribute (JSON in `data-chart`) with\n * an id, an optional width and a height.\n *\n * - **HTML**: `<div data-type=\"chart\" data-chart=\"{…}\">` holding a static SVG drawn with\n *   `chartSceneToDomSpec`, so exported HTML shows the chart without script.\n * - **Markdown**: a ` ```mermaid ` block written with `chartToMermaid` (its `%% @pixerate`\n *   line keeps everything Mermaid cannot hold); `xychart-beta`, `pie` and `radar-beta`\n *   blocks parse back into charts. Other Mermaid diagrams stay code blocks.\n * - **In the editor**: pass a `nodeView` (React and Svelte export one) for a live chart that\n *   opens the chart inspector on click; without one the static SVG is shown.\n */\nexport const Chart = Node.create<ChartNodeOptions>({\n  name: \"chart\",\n  priority: STRUCTURE_PRIORITY,\n  group: \"block\",\n  atom: true,\n  selectable: true,\n  draggable: true,\n\n  addOptions() {\n    return {\n      HTMLAttributes: {},\n      nodeView: null,\n      theme: DEFAULT_CHART_THEME,\n      defaultWidth: 640,\n      defaultHeight: 320,\n      generateId: () => generateStructureId(\"chart\"),\n    };\n  },\n\n  addAttributes() {\n    return {\n      id: {\n        default: null,\n        parseHTML: (element: HTMLElement) => element.getAttribute(\"data-chart-id\") || null,\n        renderHTML: (attributes: Record<string, any>) =>\n          attributes.id ? { \"data-chart-id\": attributes.id } : {},\n      },\n      spec: {\n        default: normalizeChartSpec({}).spec,\n        // null (no `data-chart`) keeps what the parse rule found, e.g. a mermaid block's spec.\n        parseHTML: (element: HTMLElement) => readSpec(element.getAttribute(\"data-chart\")),\n        renderHTML: (attributes: Record<string, any>) => ({\n          \"data-chart\": JSON.stringify(attributes.spec),\n        }),\n      },\n      width: {\n        default: null,\n        parseHTML: (element: HTMLElement) => readSize(element.getAttribute(\"data-width\")),\n        renderHTML: (attributes: Record<string, any>) =>\n          attributes.width ? { \"data-width\": String(attributes.width) } : {},\n      },\n      height: {\n        default: this.options.defaultHeight,\n        parseHTML: (element: HTMLElement) => readSize(element.getAttribute(\"data-height\")),\n        renderHTML: (attributes: Record<string, any>) => ({\n          \"data-height\": String(attributes.height),\n        }),\n      },\n    };\n  },\n\n  parseHTML() {\n    return [\n      {\n        tag: 'div[data-type=\"chart\"]',\n        priority: 60,\n        // A missing or broken spec falls through, so the fallback content inside (e.g. a\n        // DOCX import's caption and data table) is kept instead.\n        getAttrs: (element) => (readSpec((element as HTMLElement).getAttribute(\"data-chart\")) ? null : false),\n      },\n      {\n        // ```mermaid blocks (from markdown) that hold a chart; other diagrams stay code.\n        tag: \"pre\",\n        priority: 60,\n        getAttrs: (element) => {\n          const code = (element as HTMLElement).querySelector(\"code\");\n          const language = code?.getAttribute(\"class\") ?? (element as HTMLElement).getAttribute(\"data-language\") ?? \"\";\n          if (!/(?:^|\\s)language-mermaid(?:\\s|$)/.test(language) && language !== \"mermaid\") return false;\n          const result = chartFromMermaid((code ?? element).textContent ?? \"\");\n          return result.family ? { spec: result.spec } : false;\n        },\n      },\n    ];\n  },\n\n  renderHTML({ node, HTMLAttributes }) {\n    const svg = staticChartSvg(node, this.options);\n    return [\n      \"div\",\n      mergeAttributes(this.options.HTMLAttributes, HTMLAttributes, {\n        \"data-type\": \"chart\",\n        class: \"pixerate-chart\",\n      }),\n      svg as any,\n    ];\n  },\n\n  renderText({ node }) {\n    return `[Chart: ${node.attrs.spec?.title || \"untitled\"}]`;\n  },\n\n  addStorage() {\n    return {\n      markdown: {\n        serialize(state: any, node: ProsemirrorNode) {\n          const text = chartToMermaid(node.attrs.spec);\n          const fence = \"`\".repeat(Math.max(3, longestBacktickRun(text) + 1));\n          state.write(`${fence}mermaid\\n`);\n          state.text(text, false);\n          state.ensureNewLine();\n          state.write(fence);\n          state.closeBlock(node);\n        },\n        parse: {\n          // markdown-it renders ```mermaid as <pre><code class=\"language-mermaid\">, which\n          // `parseHTML` reads.\n        },\n      },\n    };\n  },\n\n  addCommands() {\n    return {\n      insertChart:\n        (options) =>\n        ({ commands }) =>\n          commands.insertContent({\n            type: this.name,\n            attrs: {\n              id: options.id ?? this.options.generateId(),\n              spec: normalizeChartSpec(options.spec ?? {}).spec,\n              width: options.width ?? null,\n              height: options.height ?? this.options.defaultHeight,\n            },\n          }),\n      updateChart:\n        (id, changes) =>\n        ({ state, tr, dispatch }) => {\n          const chart = getDocumentCharts(state.doc, this.name).find((c) => c.id === id);\n          if (!chart) return false;\n          if (dispatch) {\n            tr.setNodeMarkup(chart.pos, undefined, {\n              ...chart.node.attrs,\n              ...(changes.spec !== undefined ? { spec: normalizeChartSpec(changes.spec).spec } : {}),\n              ...(changes.width !== undefined ? { width: changes.width } : {}),\n              ...(changes.height !== undefined ? { height: changes.height } : {}),\n            });\n          }\n          return true;\n        },\n    };\n  },\n\n  addNodeView() {\n    return createChartNodeView(this.options.nodeView, (node) => staticChartSvg(node, this.options));\n  },\n\n  addProseMirrorPlugins() {\n    const { name } = this;\n    const { generateId } = this.options;\n    return [\n      new Plugin({\n        key: chartPluginKey,\n        appendTransaction: (transactions, _oldState, newState) => {\n          if (!transactions.some((tr) => tr.docChanged)) return null;\n          if (!transactionsInsert(transactions, [name])) return null;\n          return syncChartIds(newState, name, generateId);\n        },\n      }),\n    ];\n  },\n\n  onBeforeCreate() {\n    const { generateId } = this.options;\n    syncInitialContent(this.editor, (state) => syncChartIds(state, this.name, generateId));\n  },\n});\n","import { createDocument, type Editor } from \"@tiptap/core\";\nimport type { Node as ProsemirrorNode } from \"@tiptap/pm/model\";\nimport { EditorState, type Transaction } from \"@tiptap/pm/state\";\nimport { ReplaceAroundStep, ReplaceStep } from \"@tiptap/pm/transform\";\n\nlet idCounter = 0;\n\n/**\n * Generates a short, document-unique-enough id (`prefix-xxxxxxxx`). Ids are\n * stored in the document, so they must not depend on positions or text.\n */\nexport function generateStructureId(prefix: string): string {\n  idCounter = (idCounter + 1) % 1296;\n  const random = Math.random().toString(36).slice(2, 8).padEnd(6, \"0\");\n  return `${prefix}-${random}${idCounter.toString(36).padStart(2, \"0\")}`;\n}\n\n/**\n * Returns true if any transaction inserted content containing one of the given\n * node or mark type names. Used to skip whole-document scans for transactions\n * that cannot have introduced the nodes a plugin tracks.\n */\nexport function transactionsInsert(\n  transactions: readonly Transaction[],\n  typeNames: readonly string[],\n): boolean {\n  for (const tr of transactions) {\n    for (const step of tr.steps) {\n      if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep)) {\n        // Mark and attribute steps can add bookmarks or retarget nodes.\n        const mark = (step as any).mark;\n        if (mark && typeNames.includes(mark.type.name)) return true;\n        continue;\n      }\n      let found = false;\n      step.slice.content.descendants((node) => {\n        if (found) return false;\n        if (\n          typeNames.includes(node.type.name) ||\n          node.marks.some((m) => typeNames.includes(m.type.name))\n        ) {\n          found = true;\n        }\n        return !found;\n      });\n      if (found) return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Returns true if the document contains a node (or mark) of one of the types.\n */\nexport function docContains(\n  doc: ProsemirrorNode,\n  typeNames: readonly string[],\n): boolean {\n  let found = false;\n  doc.descendants((node) => {\n    if (found) return false;\n    if (\n      typeNames.includes(node.type.name) ||\n      node.marks.some((m) => typeNames.includes(m.type.name))\n    ) {\n      found = true;\n    }\n    return !found;\n  });\n  return found;\n}\n\n/**\n * Plugin state spec that tracks whether the document contains any of the given\n * node or mark types. A document without them is only rescanned when a\n * transaction inserts one, so plugins can skip their sync pass cheaply.\n */\nexport function presenceStateSpec(typeNames: readonly string[]) {\n  return {\n    init: (_config: unknown, state: EditorState) =>\n      docContains(state.doc, typeNames),\n    apply: (\n      tr: Transaction,\n      present: boolean,\n      _oldState: EditorState,\n      newState: EditorState,\n    ) => {\n      if (!tr.docChanged) return present;\n      if (!present && !transactionsInsert([tr], typeNames)) return false;\n      return docContains(newState.doc, typeNames);\n    },\n  };\n}\n\n/**\n * Shallow array equality using a per-item comparator.\n */\nexport function arraysEqual<T>(\n  a: readonly T[],\n  b: readonly T[],\n  eq: (x: T, y: T) => boolean,\n): boolean {\n  if (a.length !== b.length) return false;\n  for (let i = 0; i < a.length; i++) {\n    if (!eq(a[i], b[i])) return false;\n  }\n  return true;\n}\n\n/**\n * Scrolls the DOM node at a document position into view, if the editor is\n * mounted in a browser. Errors from detached or headless views are ignored.\n */\nexport function scrollDomAtPos(\n  view: any,\n  pos: number,\n  behavior: ScrollBehavior = \"smooth\",\n): void {\n  try {\n    const dom = view?.nodeDOM?.(pos) as HTMLElement | null;\n    if (dom && typeof dom.scrollIntoView === \"function\") {\n      dom.scrollIntoView({ block: \"start\", behavior });\n    }\n  } catch {\n    // Headless editors (no DOM) cannot scroll.\n  }\n}\n\n/**\n * Applies a sync pass to the editor's initial content. `appendTransaction`\n * does not run for the initial document and TipTap's `create` event fires\n * asynchronously, so derived state (heading ids, TOC entries, footnote\n * numbers) is computed in `onBeforeCreate` instead: the content is parsed,\n * fixed, and handed back to TipTap as a node. Extensions calling this must\n * have a priority below the Markdown extension's (50), so that markdown\n * content has already been converted to HTML.\n */\nexport function syncInitialContent(\n  editor: Editor,\n  sync: (state: EditorState) => Transaction | null,\n): void {\n  const { content } = editor.options;\n  if (content == null || content === \"\") return;\n  try {\n    const doc = createDocument(content as any, editor.schema, editor.options.parseOptions, {\n      errorOnInvalidContent: false,\n    });\n    const tr = sync(EditorState.create({ doc }));\n    if (tr?.docChanged) editor.options.content = tr.doc as any;\n  } catch {\n    // Leave invalid content to TipTap's own handling.\n  }\n}\n\n/** Priority for extensions that use `syncInitialContent` (below Markdown's 50). */\nexport const STRUCTURE_PRIORITY = 45;\n","import { Node, mergeAttributes } from \"@tiptap/core\";\nimport type { Node as ProsemirrorNode } from \"@tiptap/pm/model\";\nimport { layoutSparkline, type ChartSparklineKind } from \"../../chart/sparkline\";\nimport { chartSceneToDomSpec } from \"../../chart/svg\";\nimport type { ChartValue } from \"../../chart/types\";\n\nexport const SPARKLINE_KINDS: readonly ChartSparklineKind[] = [\"line\", \"column\", \"win-loss\"];\n/** Most values a sparkline node keeps. */\nexport const MAX_SPARKLINE_VALUES = 1000;\n\nexport interface SparklineNodeOptions {\n  HTMLAttributes: Record<string, any>;\n  /** Line, positive column and win colour (default the first palette colour). */\n  color: string;\n  /** Negative column and loss colour. */\n  negativeColor: string;\n}\n\nexport interface InsertSparklineOptions {\n  values: readonly (number | null)[];\n  kind?: ChartSparklineKind;\n  /** Width in pixels (default 80). */\n  width?: number;\n  /** Height in pixels (default 18). */\n  height?: number;\n  /** CSS colour (default: the extension's `color`). */\n  color?: string | null;\n  /** Accessible label (default: first and last value). */\n  label?: string | null;\n}\n\ndeclare module \"@tiptap/core\" {\n  interface Commands<ReturnType> {\n    sparkline: {\n      /** Inserts a word-sized chart at the selection. */\n      insertSparkline: (options: InsertSparklineOptions) => ReturnType;\n    };\n  }\n}\n\n/** Cleans sparkline values: finite numbers or null, at most `MAX_SPARKLINE_VALUES`. */\nexport function normalizeSparklineValues(values: unknown): ChartValue[] {\n  if (!Array.isArray(values)) return [];\n  return values\n    .slice(0, MAX_SPARKLINE_VALUES)\n    .map((v) => (typeof v === \"number\" && Number.isFinite(v) ? v : null));\n}\n\nfunction readValues(text: string | null): ChartValue[] {\n  if (!text) return [];\n  try {\n    return normalizeSparklineValues(JSON.parse(text));\n  } catch {\n    return normalizeSparklineValues(text.split(/[\\s,]+/).filter(Boolean).map(Number));\n  }\n}\n\nconst readNumber = (text: string | null, fallback: number, max: number) => {\n  const n = text === null ? NaN : Number(text);\n  return Number.isFinite(n) && n >= 4 && n <= max ? n : fallback;\n};\n\n/** The accessible label of a sparkline node. */\nexport function sparklineLabel(node: ProsemirrorNode): string {\n  if (node.attrs.label) return node.attrs.label;\n  const present = (node.attrs.values as ChartValue[]).filter((v): v is number => v !== null);\n  return present.length ? `Trend from ${present[0]} to ${present[present.length - 1]}` : \"No data\";\n}\n\n/**\n * An inline, word-sized chart (`line`, `column` or `win-loss`) drawn as SVG in the text.\n * HTML: `<span data-type=\"sparkline\" data-values=\"[…]\" data-kind=\"line\">`; markdown keeps the\n * same span (the markdown sanitizer allows `span` with `data-*` attributes).\n */\nexport const Sparkline = Node.create<SparklineNodeOptions>({\n  name: \"sparkline\",\n  group: \"inline\",\n  inline: true,\n  atom: true,\n  selectable: true,\n\n  addOptions() {\n    return { HTMLAttributes: {}, color: \"#4269d0\", negativeColor: \"#e5484d\" };\n  },\n\n  addAttributes() {\n    return {\n      values: {\n        default: [],\n        parseHTML: (element: HTMLElement) => readValues(element.getAttribute(\"data-values\")),\n        renderHTML: (attributes: Record<string, any>) => ({ \"data-values\": JSON.stringify(attributes.values ?? []) }),\n      },\n      kind: {\n        default: \"line\",\n        parseHTML: (element: HTMLElement) => {\n          const kind = element.getAttribute(\"data-kind\") as ChartSparklineKind;\n          return SPARKLINE_KINDS.includes(kind) ? kind : \"line\";\n        },\n        renderHTML: (attributes: Record<string, any>) => ({ \"data-kind\": attributes.kind }),\n      },\n      width: {\n        default: 80,\n        parseHTML: (element: HTMLElement) => readNumber(element.getAttribute(\"data-width\"), 80, 1000),\n        renderHTML: (attributes: Record<string, any>) => ({ \"data-width\": String(attributes.width) }),\n      },\n      height: {\n        default: 18,\n        parseHTML: (element: HTMLElement) => readNumber(element.getAttribute(\"data-height\"), 18, 200),\n        renderHTML: (attributes: Record<string, any>) => ({ \"data-height\": String(attributes.height) }),\n      },\n      color: {\n        default: null,\n        parseHTML: (element: HTMLElement) => element.getAttribute(\"data-color\") || null,\n        renderHTML: (attributes: Record<string, any>) => (attributes.color ? { \"data-color\": attributes.color } : {}),\n      },\n      label: {\n        default: null,\n        parseHTML: (element: HTMLElement) => element.getAttribute(\"data-label\") || null,\n        renderHTML: (attributes: Record<string, any>) => (attributes.label ? { \"data-label\": attributes.label } : {}),\n      },\n    };\n  },\n\n  parseHTML() {\n    return [{ tag: 'span[data-type=\"sparkline\"]', priority: 60 }];\n  },\n\n  renderHTML({ node, HTMLAttributes }) {\n    const scene = layoutSparkline(node.attrs.values, {\n      kind: node.attrs.kind,\n      width: node.attrs.width,\n      height: node.attrs.height,\n      color: node.attrs.color ?? this.options.color,\n      negativeColor: this.options.negativeColor,\n    });\n    const svg = chartSceneToDomSpec(scene, {\n      ariaLabel: sparklineLabel(node),\n      attrs: { style: \"display: inline-block; vertical-align: middle\" },\n    });\n    return [\n      \"span\",\n      mergeAttributes(this.options.HTMLAttributes, HTMLAttributes, {\n        \"data-type\": \"sparkline\",\n        class: \"pixerate-sparkline\",\n      }),\n      svg as any,\n    ];\n  },\n\n  renderText({ node }) {\n    return `[${sparklineLabel(node)}]`;\n  },\n\n  addStorage() {\n    return {\n      markdown: {\n        serialize(state: any, node: ProsemirrorNode) {\n          const attr = (name: string, value: unknown) =>\n            value === null || value === undefined\n              ? \"\"\n              : ` ${name}=\"${String(value).replace(/&/g, \"&amp;\").replace(/\"/g, \"&quot;\").replace(/</g, \"&lt;\")}\"`;\n          state.write(\n            `<span data-type=\"sparkline\"${attr(\"data-values\", JSON.stringify(node.attrs.values))}${attr(\"data-kind\", node.attrs.kind)}${attr(\"data-width\", node.attrs.width)}${attr(\"data-height\", node.attrs.height)}${attr(\"data-color\", node.attrs.color)}${attr(\"data-label\", node.attrs.label)}></span>`,\n          );\n        },\n        parse: {},\n      },\n    };\n  },\n\n  addCommands() {\n    return {\n      insertSparkline:\n        (options) =>\n        ({ commands }) =>\n          commands.insertContent({\n            type: this.name,\n            attrs: {\n              values: normalizeSparklineValues(options.values),\n              kind: options.kind && SPARKLINE_KINDS.includes(options.kind) ? options.kind : \"line\",\n              width: options.width ?? 80,\n              height: options.height ?? 18,\n              color: options.color ?? null,\n              label: options.label ?? null,\n            },\n          }),\n    };\n  },\n});\n","import type { Editor } from \"@tiptap/core\";\nimport type { EditorState } from \"@tiptap/pm/state\";\nimport { CellSelection, isInTable, selectedRect } from \"@tiptap/pm/tables\";\nimport { isTrackChangesEnabled } from \"../track-changes\";\nimport {\n  normalizeTableCellAlignment,\n  normalizeTableCellColor,\n  type TableCellAlignment,\n} from \"./extension\";\n\n/** Table operations shared by the command registry, the toolbars and agent tools. */\nexport type TableAction =\n  | \"insertTable\"\n  | \"addRowBefore\"\n  | \"addRowAfter\"\n  | \"deleteRow\"\n  | \"addColumnBefore\"\n  | \"addColumnAfter\"\n  | \"deleteColumn\"\n  | \"deleteTable\"\n  | \"mergeCells\"\n  | \"splitCell\"\n  | \"toggleHeaderRow\"\n  | \"toggleHeaderColumn\"\n  | \"toggleHeaderCell\"\n  | \"goToNextCell\"\n  | \"goToPreviousCell\"\n  | \"setCellAlignment\"\n  | \"setCellBackground\";\n\n/** Parameters of `insertTable`, `setCellAlignment` and `setCellBackground`. */\nexport interface TableActionParams {\n  /** `insertTable`: number of rows (1–100, default 3). */\n  rows?: number;\n  /** `insertTable`: number of columns (1–50, default 3). */\n  cols?: number;\n  /** `insertTable`: make the first row a header row (default `true`). */\n  withHeaderRow?: boolean;\n  /** `setCellAlignment`: `left`, `center`, `right`, `justify`, or `null` to clear. */\n  align?: TableCellAlignment | null;\n  /** `setCellBackground`: a CSS color, or `null` to clear. */\n  color?: string | null;\n}\n\nexport interface TableActionInfo {\n  action: TableAction;\n  label: string;\n  description: string;\n  keywords: readonly string[];\n}\n\n/** Every table action with its label, in toolbar order. */\nexport const TABLE_ACTIONS: readonly TableActionInfo[] = [\n  { action: \"insertTable\", label: \"Insert Table\", description: \"Inserts a table (rows, cols, withHeaderRow) at the cursor.\", keywords: [\"table\", \"grid\", \"new\"] },\n  { action: \"addRowBefore\", label: \"Insert Row Above\", description: \"Adds a row above the current row.\", keywords: [\"row\", \"add\", \"above\"] },\n  { action: \"addRowAfter\", label: \"Insert Row Below\", description: \"Adds a row below the current row.\", keywords: [\"row\", \"add\", \"below\"] },\n  { action: \"deleteRow\", label: \"Delete Row\", description: \"Deletes the selected rows.\", keywords: [\"row\", \"remove\"] },\n  { action: \"addColumnBefore\", label: \"Insert Column Left\", description: \"Adds a column left of the current column.\", keywords: [\"column\", \"add\", \"left\", \"before\"] },\n  { action: \"addColumnAfter\", label: \"Insert Column Right\", description: \"Adds a column right of the current column.\", keywords: [\"column\", \"add\", \"right\", \"after\"] },\n  { action: \"deleteColumn\", label: \"Delete Column\", description: \"Deletes the selected columns.\", keywords: [\"column\", \"remove\"] },\n  { action: \"deleteTable\", label: \"Delete Table\", description: \"Deletes the table around the cursor.\", keywords: [\"table\", \"remove\"] },\n  { action: \"mergeCells\", label: \"Merge Cells\", description: \"Merges the selected cells into one.\", keywords: [\"combine\", \"join\", \"span\"] },\n  { action: \"splitCell\", label: \"Split Cell\", description: \"Splits a merged cell back into single cells.\", keywords: [\"unmerge\", \"span\"] },\n  { action: \"toggleHeaderRow\", label: \"Toggle Header Row\", description: \"Turns the first row into header cells, or back.\", keywords: [\"header\", \"row\", \"th\"] },\n  { action: \"toggleHeaderColumn\", label: \"Toggle Header Column\", description: \"Turns the first column into header cells, or back.\", keywords: [\"header\", \"column\", \"th\"] },\n  { action: \"toggleHeaderCell\", label: \"Toggle Header Cell\", description: \"Turns the selected cells into header cells, or back.\", keywords: [\"header\", \"cell\", \"th\"] },\n  { action: \"goToNextCell\", label: \"Next Cell\", description: \"Moves the cursor to the next cell.\", keywords: [\"tab\", \"navigate\"] },\n  { action: \"goToPreviousCell\", label: \"Previous Cell\", description: \"Moves the cursor to the previous cell.\", keywords: [\"shift tab\", \"navigate\"] },\n  { action: \"setCellAlignment\", label: \"Align Cells…\", description: \"Sets the horizontal alignment (align: left | center | right | justify | null) of the selected cells.\", keywords: [\"align\", \"left\", \"center\", \"right\"] },\n  { action: \"setCellBackground\", label: \"Cell Background…\", description: \"Sets the background color (color: CSS color or null) of the selected cells.\", keywords: [\"shading\", \"fill\", \"color\"] },\n];\n\n/** A button of the table toolbars (`TableToolbar` in React and Svelte). */\nexport interface TableToolbarItem {\n  /** Unique id (also the button's `data-action`). */\n  id: string;\n  action: TableAction;\n  params?: TableActionParams;\n  /** Short button text. */\n  label: string;\n  /** Accessible name and tooltip. */\n  title: string;\n  /** Items of one group are separated from the next group. */\n  group: string;\n  /** Toggle buttons: whether the button shows as pressed. */\n  active?: (state: TableState) => boolean;\n}\n\n/** The default table toolbar: rows, columns, cells, headers, alignment, delete. */\nexport const DEFAULT_TABLE_TOOLBAR: readonly TableToolbarItem[] = [\n  { id: \"addRowBefore\", action: \"addRowBefore\", label: \"+ Row ↑\", title: \"Insert row above\", group: \"rows\" },\n  { id: \"addRowAfter\", action: \"addRowAfter\", label: \"+ Row ↓\", title: \"Insert row below\", group: \"rows\" },\n  { id: \"deleteRow\", action: \"deleteRow\", label: \"− Row\", title: \"Delete row\", group: \"rows\" },\n  { id: \"addColumnBefore\", action: \"addColumnBefore\", label: \"+ Col ←\", title: \"Insert column left\", group: \"columns\" },\n  { id: \"addColumnAfter\", action: \"addColumnAfter\", label: \"+ Col →\", title: \"Insert column right\", group: \"columns\" },\n  { id: \"deleteColumn\", action: \"deleteColumn\", label: \"− Col\", title: \"Delete column\", group: \"columns\" },\n  { id: \"mergeCells\", action: \"mergeCells\", label: \"Merge\", title: \"Merge cells\", group: \"cells\" },\n  { id: \"splitCell\", action: \"splitCell\", label: \"Split\", title: \"Split cell\", group: \"cells\" },\n  { id: \"toggleHeaderRow\", action: \"toggleHeaderRow\", label: \"Header row\", title: \"Toggle header row\", group: \"headers\", active: (s) => s.headerRow },\n  { id: \"toggleHeaderColumn\", action: \"toggleHeaderColumn\", label: \"Header col\", title: \"Toggle header column\", group: \"headers\", active: (s) => s.headerColumn },\n  { id: \"toggleHeaderCell\", action: \"toggleHeaderCell\", label: \"Header cell\", title: \"Toggle header cell\", group: \"headers\", active: (s) => s.headerCell },\n  { id: \"alignLeft\", action: \"setCellAlignment\", params: { align: \"left\" }, label: \"Left\", title: \"Align cell left\", group: \"align\", active: (s) => s.cellAlignment === \"left\" },\n  { id: \"alignCenter\", action: \"setCellAlignment\", params: { align: \"center\" }, label: \"Center\", title: \"Align cell center\", group: \"align\", active: (s) => s.cellAlignment === \"center\" },\n  { id: \"alignRight\", action: \"setCellAlignment\", params: { align: \"right\" }, label: \"Right\", title: \"Align cell right\", group: \"align\", active: (s) => s.cellAlignment === \"right\" },\n  { id: \"deleteTable\", action: \"deleteTable\", label: \"Delete table\", title: \"Delete table\", group: \"table\" },\n];\n\nexport const MAX_TABLE_ROWS = 100;\nexport const MAX_TABLE_COLUMNS = 50;\n\nconst live = (editor: Editor | null | undefined): editor is Editor => !!editor && !editor.isDestroyed;\n\n/** Whether the editor's schema has the table nodes (`createRichTextPreset({ table })`). */\nexport function isTableEnabled(editor: Editor | null | undefined): boolean {\n  return live(editor) && !!editor.schema.nodes.table && !!editor.schema.nodes.tableRow;\n}\n\n/** Whether the selection (cursor, text or cell selection) is inside a table. */\nexport function isSelectionInTable(state: EditorState): boolean {\n  if (!state.schema.nodes.table) return false;\n  return state.selection instanceof CellSelection || isInTable(state);\n}\n\n/**\n * `shouldShow` for a table bubble menu (TipTap's `BubbleMenuPlugin`): shown\n * while an editable editor's selection is in a table, even a collapsed cursor.\n */\nexport function shouldShowTableBubbleMenu({ editor, state }: { editor: Editor; state: EditorState }): boolean {\n  return editor.isEditable && isSelectionInTable(state);\n}\n\nconst isInt = (value: unknown, min: number, max: number) =>\n  typeof value === \"number\" && Number.isInteger(value) && value >= min && value <= max;\n\nconst can = (editor: Editor, run: (chain: any) => any): boolean => {\n  try {\n    return !!run(editor.can().chain()).run();\n  } catch {\n    return false;\n  }\n};\n\n/**\n * Whether a table action can run: `true`, or the reason it cannot (e.g.\n * \"Place the cursor in a table first.\").\n */\nexport function getTableActionState(\n  editor: Editor | null | undefined,\n  action: TableAction,\n  params: TableActionParams = {},\n): true | string {\n  if (!live(editor)) return \"The editor is not available.\";\n  if (!isTableEnabled(editor)) return \"Tables are not enabled in this editor.\";\n  if (!editor.isEditable) return \"The editor is read-only.\";\n  const state = editor.state;\n  const inTable = isSelectionInTable(state);\n\n  if (action === \"insertTable\") {\n    if (inTable) return \"Tables cannot be nested: move the cursor out of the table first.\";\n    if (params.rows !== undefined && !isInt(params.rows, 1, MAX_TABLE_ROWS)) {\n      return `Rows must be a whole number from 1 to ${MAX_TABLE_ROWS}.`;\n    }\n    if (params.cols !== undefined && !isInt(params.cols, 1, MAX_TABLE_COLUMNS)) {\n      return `Columns must be a whole number from 1 to ${MAX_TABLE_COLUMNS}.`;\n    }\n    return can(editor, (c) => c.insertTable({ rows: 1, cols: 1 })) ? true : \"A table cannot be inserted here.\";\n  }\n\n  if (!inTable) return \"Place the cursor in a table first.\";\n\n  switch (action) {\n    case \"mergeCells\":\n    case \"splitCell\": {\n      if (isTrackChangesEnabled(editor)) {\n        return `${action === \"mergeCells\" ? \"Merging\" : \"Splitting\"} cells cannot be tracked: turn off Track Changes first.`;\n      }\n      if (action === \"mergeCells\") {\n        return can(editor, (c) => c.mergeCells()) ? true : \"Select two or more adjacent cells to merge.\";\n      }\n      return can(editor, (c) => c.splitCell()) ? true : \"Only a merged cell can be split.\";\n    }\n    case \"deleteRow\":\n    case \"deleteColumn\": {\n      // prosemirror-tables only refuses to delete every row/column when dispatching.\n      const rect = selectedRect(state);\n      const all = action === \"deleteRow\"\n        ? rect.top === 0 && rect.bottom === rect.map.height\n        : rect.left === 0 && rect.right === rect.map.width;\n      const what = action === \"deleteRow\" ? \"rows\" : \"columns\";\n      if (all || !can(editor, (c) => c[action]())) return `These are all the ${what}: delete the table instead.`;\n      return true;\n    }\n    case \"goToNextCell\":\n      return can(editor, (c) => c.goToNextCell()) ? true : \"This is the last cell.\";\n    case \"goToPreviousCell\":\n      return can(editor, (c) => c.goToPreviousCell()) ? true : \"This is the first cell.\";\n    case \"setCellAlignment\":\n      if (params.align !== undefined && params.align !== null && !normalizeTableCellAlignment(params.align)) {\n        return 'Alignment must be \"left\", \"center\", \"right\", \"justify\" or null.';\n      }\n      if (!editor.schema.nodes.tableCell?.spec.attrs?.align) return \"Cell alignment is not supported by this schema.\";\n      return true;\n    case \"setCellBackground\":\n      if (params.color !== undefined && params.color !== null && !normalizeTableCellColor(params.color)) {\n        return \"Color must be a CSS color such as #fde68a, rgb(…) or a color name, or null.\";\n      }\n      if (!editor.schema.nodes.tableCell?.spec.attrs?.backgroundColor) return \"Cell backgrounds are not supported by this schema.\";\n      return true;\n    default:\n      return can(editor, (c) => c[action]()) ? true : \"This table action is not available here.\";\n  }\n}\n\nexport interface RunTableActionOptions {\n  /** Focus the editor (toolbars). Default `false`. */\n  focus?: boolean;\n}\n\n/**\n * Runs a table action. Returns `false` (and changes nothing) when it cannot\n * run; check `getTableActionState` for the reason.\n */\nexport function runTableAction(\n  editor: Editor | null | undefined,\n  action: TableAction,\n  params: TableActionParams = {},\n  options: RunTableActionOptions = {},\n): boolean {\n  if (getTableActionState(editor, action, params) !== true) return false;\n  const ed = editor as Editor;\n  let chain: any = ed.chain();\n  if (options.focus) chain = chain.focus();\n  switch (action) {\n    case \"insertTable\":\n      chain = chain.insertTable({\n        rows: params.rows ?? 3,\n        cols: params.cols ?? 3,\n        withHeaderRow: params.withHeaderRow ?? true,\n      });\n      break;\n    case \"setCellAlignment\":\n      chain = chain.setCellAttribute(\"align\", normalizeTableCellAlignment(params.align));\n      break;\n    case \"setCellBackground\":\n      chain = chain.setCellAttribute(\"backgroundColor\", normalizeTableCellColor(params.color));\n      break;\n    default:\n      chain = chain[action]();\n  }\n  return !!chain.run();\n}\n\nexport interface TableActionStatus {\n  enabled: boolean;\n  /** Why the action cannot run (only when `enabled` is false). */\n  reason?: string;\n}\n\n/** The table at the selection and what can be done there. */\nexport interface TableState {\n  /** The schema has tables. */\n  enabled: boolean;\n  /** The selection is inside a table. */\n  inTable: boolean;\n  /** Cells are selected (a `CellSelection`). */\n  cellSelection: boolean;\n  /** Size of the table (0 outside a table). */\n  rows: number;\n  columns: number;\n  /** Row and column (0-based) of the selection's first cell, or -1. */\n  row: number;\n  column: number;\n  /** The first row / first column are all header cells. */\n  headerRow: boolean;\n  headerColumn: boolean;\n  /** The cell at the selection is a header cell. */\n  headerCell: boolean;\n  /** Alignment / background of the cell at the selection. */\n  cellAlignment: TableCellAlignment | null;\n  cellBackground: string | null;\n  /** Enablement of every action (with the default params). */\n  actions: Record<TableAction, TableActionStatus>;\n}\n\nconst NO_ACTIONS = Object.fromEntries(\n  TABLE_ACTIONS.map(({ action }) => [action, { enabled: false, reason: \"The editor is not available.\" }]),\n) as Record<TableAction, TableActionStatus>;\n\nexport const EMPTY_TABLE_STATE: TableState = Object.freeze({\n  enabled: false,\n  inTable: false,\n  cellSelection: false,\n  rows: 0,\n  columns: 0,\n  row: -1,\n  column: -1,\n  headerRow: false,\n  headerColumn: false,\n  headerCell: false,\n  cellAlignment: null,\n  cellBackground: null,\n  actions: NO_ACTIONS,\n}) as TableState;\n\n/** Computes the table state at the editor's selection. */\nexport function getTableState(editor: Editor | null | undefined): TableState {\n  if (!live(editor)) return EMPTY_TABLE_STATE;\n  const actions = Object.fromEntries(\n    TABLE_ACTIONS.map(({ action }) => {\n      const result = getTableActionState(editor, action);\n      return [action, result === true ? { enabled: true } : { enabled: false, reason: result }];\n    }),\n  ) as Record<TableAction, TableActionStatus>;\n  const state = editor.state;\n  const base: TableState = { ...EMPTY_TABLE_STATE, enabled: isTableEnabled(editor), actions };\n  if (!base.enabled || !isSelectionInTable(state)) return base;\n  try {\n    const rect = selectedRect(state);\n    const { map, table } = rect;\n    const cellAt = (row: number, col: number) => table.nodeAt(map.map[row * map.width + col]);\n    const allHeaders = (positions: number[]) =>\n      positions.length > 0 && positions.every((pos) => table.nodeAt(pos)?.type.name === \"tableHeader\");\n    const firstRow = map.cellsInRect({ left: 0, right: map.width, top: 0, bottom: 1 });\n    const firstColumn = map.cellsInRect({ left: 0, right: 1, top: 0, bottom: map.height });\n    const cell = cellAt(rect.top, rect.left);\n    return {\n      ...base,\n      inTable: true,\n      cellSelection: state.selection instanceof CellSelection,\n      rows: map.height,\n      columns: map.width,\n      row: rect.top,\n      column: rect.left,\n      headerRow: allHeaders(firstRow),\n      headerColumn: allHeaders(firstColumn),\n      headerCell: cell?.type.name === \"tableHeader\",\n      cellAlignment: normalizeTableCellAlignment(cell?.attrs.align),\n      cellBackground: normalizeTableCellColor(cell?.attrs.backgroundColor),\n    };\n  } catch {\n    return { ...base, inTable: true };\n  }\n}\n\nconst stateKey = (state: TableState) => JSON.stringify(state);\n\nexport interface TableStore {\n  getSnapshot(): TableState;\n  subscribe(listener: () => void): () => void;\n  destroy(): void;\n}\n\n/**\n * An external store of `getTableState(editor)` for UI bindings (React's\n * `useSyncExternalStore`, Svelte runes). The snapshot object only changes\n * when the state does, and the store listens to the editor only while it\n * has subscribers.\n */\nexport function createTableStore(editor: Editor | null | undefined): TableStore {\n  const listeners = new Set<() => void>();\n  let snapshot = getTableState(editor);\n  let key = stateKey(snapshot);\n\n  const update = () => {\n    const next = getTableState(editor);\n    const nextKey = stateKey(next);\n    if (nextKey === key) return;\n    snapshot = next;\n    key = nextKey;\n    listeners.forEach((listener) => listener());\n  };\n  const detach = () => {\n    editor?.off(\"transaction\", update);\n    editor?.off(\"update\", update);\n    editor?.off(\"focus\", update);\n    editor?.off(\"destroy\", update);\n  };\n\n  return {\n    getSnapshot: () => {\n      if (!listeners.size) {\n        const next = getTableState(editor);\n        const nextKey = stateKey(next);\n        if (nextKey !== key) {\n          snapshot = next;\n          key = nextKey;\n        }\n      }\n      return snapshot;\n    },\n    subscribe(listener) {\n      if (!listeners.size && editor) {\n        update();\n        editor.on(\"transaction\", update);\n        // `setEditable` emits `update` without a transaction.\n        editor.on(\"update\", update);\n        editor.on(\"focus\", update);\n        editor.on(\"destroy\", update);\n      }\n      listeners.add(listener);\n      return () => {\n        listeners.delete(listener);\n        if (!listeners.size) detach();\n      };\n    },\n    destroy() {\n      detach();\n      listeners.clear();\n    },\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,SAAS,UAAU,aAA6D;AAChF,SAAS,QAAQ,WAAW,iBAAmC;AAE/D;AAAA,EACE;AAAA,EACA;AAAA,EACA,eAAe;AAAA,OACV;AAOA,IAAM,2BAA2B;AAEjC,IAAM,wBAAwB,IAAI,UAAU,cAAc;AAEjE,IAAM,SAAS,CAAC,SAA0B,KAAK,KAAK,KAAK;AACzD,IAAM,cAAc,CAAC,SAA0B,OAAO,IAAI,MAAM;AAGzD,SAAS,oBAAoB,MAA2B;AAC7D,WAAS,IAAI,GAAG,KAAK,KAAK,OAAO,IAAK,KAAI,YAAY,KAAK,KAAK,CAAC,CAAC,EAAG,QAAO;AAC5E,SAAO;AACT;AAGO,SAAS,cAAc,MAA4B;AACxD,WAAS,IAAI,KAAK,OAAO,IAAI,GAAG,KAAK;AACnC,UAAM,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC;AAChC,QAAI,SAAS,UAAU,SAAS,cAAe,QAAO;AAAA,EACxD;AACA,SAAO;AACT;AAGO,SAAS,mBAAmB,SAAoC;AACrE,QAAM,WAAW,mBAAmB,QAAQ,QAAQ,UAAU;AAC9D,MAAI,QAAQ;AACZ,WAAS,YAAY,CAAC,SAAS;AAC7B,QAAI,MAAO,QAAO;AAClB,QAAI,YAAY,IAAI,EAAG,SAAQ;AAC/B,WAAO,CAAC;AAAA,EACV,CAAC;AACD,SAAO;AACT;AAQO,SAAS,sBAAsB,IAAiB,MAAc,IAAY,OAA6B;AAC5G,QAAM,QAAQ,GAAG,IAAI,QAAQ,IAAI;AACjC,QAAM,QAAQ,oBAAoB,KAAK;AACvC,MAAI,QAAQ,EAAG,QAAO;AACtB,QAAM,aAAa,MAAM,OAAO,KAAK;AACrC,QAAM,WAAW,MAAM,MAAM,KAAK;AAClC,MAAI,KAAK,QAAQ,KAAK,UAAU;AAC9B,QAAI,GAAG,qBAAqB,iBAAiB,GAAG,UAAU,SAAS,QAAQ,GAAG,UAAU,OAAO,IAAI;AACjG,SAAG,gBAAgB;AAAA,IACrB,OAAO;AACL,SAAG,OAAO,MAAM,EAAE;AAAA,IACpB;AAAA,EACF;AACA,QAAM,QAAQ,GAAG,IAAI,OAAO,UAAU;AACtC,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,aAAa,MAAM;AACjC,QAAM,SAAS,GAAG,IAAI,QAAQ;AAG9B,KAAG,QAAQ,OAAO,OAAO,IAAI,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC;AACvD,SAAO,SAAS,GAAG,IAAI,QAAQ,OAAO;AACxC;AASO,SAAS,+BAA+B,MAAkB,OAA8B,OAAuB;AACpH,QAAM,EAAE,MAAM,IAAI;AAClB,QAAM,EAAE,UAAU,IAAI;AACtB,MAAI,oBAAoB,UAAU,KAAK,IAAI,EAAG,QAAO;AACrD,MAAI,qBAAqB,iBAAiB,cAAc,KAAK,GAAG;AAC9D,QAAI,iBAAiB,MAAM,OAAyB,KAAK,EAAG,QAAO;AAAA,EACrE;AACA,MAAI,CAAC,mBAAmB,KAAK,EAAG,QAAO;AACvC,QAAM,KAAK,MAAM;AACjB,QAAM,MAAM,sBAAsB,IAAI,UAAU,MAAM,UAAU,IAAI,KAAK;AACzE,MAAI,QAAQ,KAAM,QAAO;AACzB,KAAG,aAAa,UAAU,KAAK,GAAG,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;AACvD,OAAK,SAAS,GAAG,eAAe,EAAE,QAAQ,SAAS,IAAI,EAAE,QAAQ,WAAW,OAAO,CAAC;AACpF,SAAO;AACT;AAMA,SAAS,cAAc,cAAsCA,OAAwD;AACnH,MAAI,SAA6B,CAAC;AAClC,aAAW,MAAM,cAAc;AAC7B,UAAM,UAAUA,MAAK,EAAE;AACvB,eAAW,QAAQ,GAAG,OAAO;AAC3B,YAAM,MAAM,KAAK,OAAO;AAGxB,eAAS,OACN,IAAI,CAAC,CAAC,MAAM,EAAE,MAAwB,CAAC,IAAI,IAAI,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,EACzE,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI;AACnC,UAAI,QAAS;AACb,UAAI,QAAQ,CAAC,WAAW,SAAS,UAAU,WAAW;AACpD,YAAI,SAAS,SAAU,QAAO,KAAK,CAAC,UAAU,MAAM,CAAC;AAAA,MACvD,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,iBAAiB,KAAsB,QAAsC;AACpF,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,CAAC,MAAM,EAAE,KAAK,QAAQ;AAC/B,QAAI,aAAa,MAAM,IAAI,CAAC,MAAM,QAAQ;AACxC,UAAI,CAAC,YAAY,IAAI,KAAK,MAAM,KAAM,QAAO;AAC7C,UAAI,cAAc,IAAI,QAAQ,GAAG,CAAC,GAAG;AACnC,cAAM,IAAI,GAAG;AACb,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAEA,QAAM,SAAS,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC9C,QAAM,QAAkB,CAAC;AACzB,aAAW,OAAO,QAAQ;AACxB,UAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,QAAI,SAAS,UAAa,OAAO,OAAO,IAAI,OAAO,IAAI,EAAG,SAAU,OAAM,KAAK,GAAG;AAAA,EACpF;AACA,SAAO;AACT;AAQO,SAAS,aAAa,IAAiB,QAAqC;AACjF,MAAI,UAAU;AACd,WAAS,QAAQ,GAAG,QAAQ,MAAM,OAAO,QAAQ,SAAS;AACxD,UAAM,SAAS,iBAAiB,GAAG,KAAK,MAAM;AAC9C,QAAI,CAAC,OAAO,OAAQ;AAGpB,UAAM,SAAS,oBAAI,IAAsB;AACzC,eAAW,OAAO,QAAQ;AACxB,YAAM,OAAO,GAAG,IAAI,QAAQ,GAAG;AAC/B,YAAM,QAAQ,KAAK,OAAO,oBAAoB,IAAI,CAAC;AACnD,aAAO,IAAI,OAAO,CAAC,GAAI,OAAO,IAAI,KAAK,KAAK,CAAC,GAAI,GAAG,CAAC;AAAA,IACvD;AACA,UAAM,OAA2B,CAAC;AAClC,eAAW,SAAS,CAAC,GAAG,OAAO,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG;AAC5D,YAAM,YAAY,OAAO,IAAI,KAAK;AAClC,YAAM,QAAQ,UAAU,IAAI,CAAC,QAAQ,GAAG,IAAI,OAAO,GAAG,CAAE;AACxD,eAAS,IAAI,UAAU,SAAS,GAAG,KAAK,GAAG,KAAK;AAC9C,cAAM,MAAM,UAAU,CAAC;AACvB,cAAM,OAAO,MAAM,CAAC;AACpB,cAAM,OAAO,GAAG,IAAI,QAAQ,GAAG;AAC/B,cAAM,SAAS,KAAK;AACpB,cAAM,SAAS,OAAO,eAAe,IAAI,OAAO,KAAK,aAAa,aAAa,cAAc,IAAI;AACjG,YAAI,OAAQ,IAAG,YAAY,KAAK,MAAM,KAAK,UAAU,MAAM;AAAA,YACtD,IAAG,OAAO,KAAK,MAAM,KAAK,QAAQ;AAAA,MACzC;AACA,YAAM,QAAQ,GAAG,IAAI,OAAO,KAAK;AACjC,YAAM,QAAQ,QAAQ,MAAM;AAC5B,YAAM,WAAW,SAAS,UAAU,KAAK;AACzC,SAAG,OAAO,OAAO,QAAQ;AAEzB,WAAK,KAAK,CAAC,OAAO,QAAQ,SAAS,IAAI,CAAC;AACxC,gBAAU;AAAA,IACZ;AACA,aAAS;AAAA,EACX;AACA,SAAO;AACT;AAMA,SAAS,iBAAiB,IAA0B;AAClD,SAAO,GAAG,MAAM,KAAK,CAAC,MAAM,MAAM;AAChC,UAAM,EAAE,MAAM,GAAG,IAAI;AACrB,WAAO,SAAS,KAAK,OAAO,UAAa,MAAM,GAAG,KAAK,CAAC,EAAE,QAAQ;AAAA,EACpE,CAAC;AACH;AAEA,IAAM,OAAO,CAAC,OACZ,CAAC,GAAG,cACJ,GAAG,QAAQ,wBAAwB,MAAM;AAEzC,CAAC,CAAC,GAAG,QAAQ,UAAU,KACvB,CAAC,CAAC,GAAG,QAAQ,SAAS;AAAA;AAGtB,CAAC,CAAC,GAAG,QAAQ,qBAAqB,KAClC,iBAAiB,EAAE;AAUd,SAAS,2BAAmC;AACjD,SAAO,IAAI,OAAO;AAAA,IAChB,KAAK;AAAA,IACL,OAAO;AAAA,MACL,aAAa,CAAC,MAAM,OAAO,UAAU,+BAA+B,MAAM,OAAO,KAAK;AAAA,IACxF;AAAA,IACA,kBAAkB,cAAc,WAAW,UAAU;AACnD,UAAI,aAAa,MAAM,IAAI,EAAG,QAAO;AACrC,YAAM,SAAS,cAAc,cAAc,IAAI;AAC/C,UAAI,CAAC,OAAO,OAAQ,QAAO;AAC3B,YAAM,KAAK,SAAS;AACpB,UAAI,CAAC,aAAa,IAAI,MAAM,EAAG,QAAO;AACtC,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AACH;;;AC7NO,IAAM,sBAAsB;AAE5B,IAAM,0BAA0B;AAEvC,IAAM,YAAY;AAElB,IAAM,mBAAmB;AAuDzB,IAAM,MAAM,MACV,OAAO,gBAAgB,eAAe,OAAO,YAAY,QAAQ,aAC7D,YAAY,IAAI,IAChB,KAAK,IAAI;AAER,SAAS,mBAAmB,UAA+B,CAAC,GAAiB;AAClF,SAAO;AAAA,IACL,UAAU,IAAI,KAAK,QAAQ,eAAe;AAAA,IAC1C,OAAO,QAAQ,YAAY;AAAA,IAC3B,WAAW;AAAA,EACb;AACF;AA2BA,IAAM,OAAO;AACb,IAAM,MAAgB,CAAC,OAAO,OAAO;AAErC,IAAM,SAAS;AACf,IAAM,QAAQ;AACd,IAAM,OAAO;AAEb,IAAM,YAAY,oBAAI,IAAoB;AAEnC,SAAS,cAAc,IAAoB;AAChD,MAAI,KAAK,IAAK,QAAO,MAAM,MAAM,MAAM,KAAK,KAAK,KAAK;AACtD,QAAM,SAAS,UAAU,IAAI,EAAE;AAC/B,MAAI,WAAW,OAAW,QAAO;AACjC,QAAM,QAAQ,OAAO,cAAc,EAAE,EAAE,YAAY;AACnD,QAAM,SAAS,CAAC,GAAG,KAAK,EAAE,WAAW,IAAI,MAAM,YAAY,CAAC,IAAK;AACjE,MAAI,UAAU,OAAO,KAAM,WAAU,IAAI,IAAI,MAAM;AACnD,SAAO;AACT;AAEA,SAAS,WAAW,IAAqB;AACvC,MAAI,KAAK,EAAG,QAAO;AACnB,MAAI,KAAK,KAAK;AACZ,WAAQ,MAAM,MAAM,MAAM,MAAQ,MAAM,MAAM,MAAM,MAAQ,MAAM,MAAM,MAAM,OAAQ,OAAO;AAAA,EAC/F;AACA,SAAO,KAAK,KAAK,OAAO,cAAc,EAAE,CAAC;AAC3C;AAEA,IAAM,WAAW,CAAC,OAChB,KAAK,MAAO,MAAM,MAAM,MAAM,MAAQ,MAAM,MAAM,MAAM,MAAO,OAAO,KAAK,OAAO,cAAc,EAAE,CAAC;AAErG,SAAS,QAAQ,IAAqB;AACpC,MAAI,KAAK,KAAK;AACZ,WAAQ,MAAM,MAAM,MAAM,MAAQ,MAAM,MAAM,MAAM,MAAQ,MAAM,MAAM,MAAM,MAAQ,MAAM,OAAO,MAAM;AAAA,EAC3G;AACA,SAAQ,MAAM,QAAU,MAAM,QAAW,OAAO,OAAQ,OAAO,OAAQ,OAAO,OAAQ,OAAO,OAAQ,MAAM,KAAK,OAAO,cAAc,EAAE,CAAC;AAC1I;AAEA,IAAM,UAAU,CAAC,OAAe,OAAO,MAAM,OAAO,KAAK,OAAO;AAGhE,SAAS,SAAS,KAAa,KAAqB;AAClD,MAAI,OAAO,EAAG,QAAO;AACrB,QAAM,MAAM,IAAI,WAAW,MAAM,CAAC;AAClC,MAAI,OAAO,SAAU,OAAO,SAAU,OAAO,GAAG;AAC9C,UAAM,OAAO,IAAI,WAAW,MAAM,CAAC;AACnC,QAAI,QAAQ,SAAU,QAAQ,MAAQ,QAAO,IAAI,YAAY,MAAM,CAAC;AAAA,EACtE;AACA,SAAO;AACT;AAEA,IAAM,OAAO,CAAC,KAAa,QAAyB,MAAM,IAAI,SAAS,IAAI,YAAY,GAAG,IAAK;AAe/F,IAAM,eAAN,cAA2B,MAAM;AAAA,EAC/B,YACW,MACT,SACA;AACA,UAAM,OAAO;AAHJ;AAAA,EAIX;AAAA,EAJW;AAKb;AAEA,IAAM,WAAW,CAAC,UAA0B,EAAE,GAAG,QAAQ,KAAK;AAC9D,IAAM,QAAQ,CAAC,OAAqB,SAAS,CAAC,MAAM,MAAM,EAAE;AAC5D,IAAM,cAAc,CAAC,IAAY,oBAAmC;AAClE,MAAI,CAAC,gBAAiB,QAAO,MAAM,EAAE;AACrC,QAAM,IAAI,cAAc,EAAE;AAC1B,SAAO,SAAS,CAAC,IAAI,WAAW,WAAW,CAAC;AAC9C;AACA,IAAM,OAAO,CAAC,MAAY,UAAyB,EAAE,GAAG,OAAO,MAAM,KAAK,GAAG,KAAK,IAAI,KAAK;AAG3F,SAAS,SAAS,GAAwB;AACxC,UAAQ,GAAG;AAAA,IACT,KAAK;AAAK,aAAO,MAAM,IAAI;AAAA,IAC3B,KAAK;AAAK,aAAO,MAAM,CAAC;AAAA,IACxB,KAAK;AAAK,aAAO,SAAS,GAAG;AAAA,IAC7B,KAAK;AAAK,aAAO,SAAS,CAAC,OAAO,MAAM,MAAM,MAAM,EAAE;AAAA,IACtD,KAAK;AAAK,aAAO,SAAS,CAAC,OAAO,SAAS,EAAE,CAAC;AAAA,IAC9C,KAAK;AAAK,aAAO,MAAM,EAAE;AAAA,IACzB,KAAK;AAAK,aAAO,MAAM,EAAE;AAAA,IACzB,KAAK;AAAK,aAAO,MAAM,EAAI;AAAA,IAC3B,KAAK;AAAK,aAAO,MAAM,EAAI;AAAA,IAC3B,KAAK;AAAK,aAAO,MAAM,IAAM;AAAA,IAC7B,KAAK;AAAK,aAAO,MAAM,IAAM;AAAA,IAC7B,KAAK;AAAK,aAAO,MAAM,GAAI;AAAA,IAC3B,KAAK;AAAK,aAAO,MAAM,IAAM;AAAA,IAC7B,KAAK;AAAK,aAAO,MAAM,GAAI;AAAA,IAC3B,KAAK;AAAK,aAAO,EAAE,GAAG,OAAO,MAAM,SAAS,CAAC,OAAO,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM;AAAA,IAC/F,KAAK;AAAK,aAAO,MAAM,KAAM;AAAA,IAC7B,KAAK;AAAK,aAAO,MAAM,GAAI;AAAA,IAC3B,KAAK;AAAK,aAAO,MAAM,GAAI;AAAA,IAC3B;AAAS,aAAO;AAAA,EAClB;AACF;AAGA,SAAS,YAAY,GAA0B;AAC7C,UAAQ,GAAG;AAAA,IACT,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA,IACjB;AAAS,aAAO;AAAA,EAClB;AACF;AAGA,SAAS,SAAS,GAA0B;AAC1C,UAAQ,GAAG;AAAA,IACT,KAAK;AAAI,aAAO;AAAA,IAChB,KAAK;AAAI,aAAO;AAAA,IAChB,KAAK;AAAI,aAAO;AAAA,IAChB,KAAK;AAAI,aAAO;AAAA,IAChB,KAAK;AAAI,aAAO;AAAA,IAChB,KAAK;AAAI,aAAO;AAAA,EAClB;AACA,MAAI,IAAI,WAAa,KAAK,SAAU,KAAK,MAAS,QAAO;AAEzD,MAAK,IAAI,MAAM,MAAM,KAAO,KAAK,OAAQ,IAAI,IAAO,QAAO;AAC3D,SAAO;AACT;AAGA,SAAS,YAAY,OAAiB,GAAgD;AACpF,QAAM,UAAU,MAAM,CAAC,MAAM;AAC7B,QAAM,QAAQ,UAAU,IAAI,IAAI;AAChC,QAAM,MAAM,UAAU,IAAI;AAC1B,MAAI,SAAS;AACb,WAAS,IAAI,OAAO,IAAI,MAAM,UAAU,OAAO,SAAS,OAAO,QAAQ,KAAK,MAAM,CAAC,CAAC,GAAG,IAAK,WAAU,MAAM,CAAC;AAC7G,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,KAAK,SAAS,SAAS,QAAQ,EAAE,CAAC;AACxC,SAAO,OAAO,OAAO,OAAO,EAAE,IAAI,MAAM,QAAQ,IAAI,OAAO,OAAO;AACpE;AAEA,IAAM,UAAU,CAAC,MAAwB,MAAM,KAAK,CAAC;AACrD,IAAM,OAAO,CAAC,OAAuB,GAAG,YAAY,CAAC;AAGrD,SAAS,aAAa,OAAe,GAAgB,iBAA0D;AAC7G,QAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAM,QAAgB,CAAC;AACvB,MAAI,QAAQ;AACZ,MAAI,IAAI;AACR,SAAO,IAAI,MAAM,QAAQ;AACvB,UAAM,IAAI,MAAM,GAAG;AACnB,QAAI,MAAM,OAAO,CAAC,EAAE,WAAW,IAAI,MAAM,QAAQ;AAC/C,YAAM,IAAI,MAAM,CAAC;AACjB,YAAM,OAAO,SAAS,CAAC;AACvB,UAAI,MAAM;AACR,YAAI,MAAM,IAAK,SAAQ;AACvB,cAAM,KAAK,IAAI;AACf;AACA;AAAA,MACF;AACA,YAAM,MAAM,YAAY,OAAO,CAAC;AAChC,UAAI,KAAK;AACP,YAAI,IAAI,OAAO,KAAM,SAAQ;AAC7B,cAAM,KAAK,YAAY,IAAI,IAAI,eAAe,CAAC;AAC/C,aAAK,IAAI;AACT;AAAA,MACF;AAAA,IAEF;AACA,UAAM,KAAK,KAAK,CAAC;AACjB,QAAK,EAAE,qBAAqB,QAAQ,EAAE,KAAO,EAAE,oBAAoB,QAAQ,EAAE,EAAI;AACjF,UAAM,KAAK,YAAY,IAAI,eAAe,CAAC;AAAA,EAC7C;AACA,QAAM,SACJ,EAAE,qBAAqB,EAAE,mBACrB,CAAC,OAAO,QAAQ,EAAE,KAAK,QAAQ,EAAE,IACjC,EAAE,oBACA,CAAC,OAAO,QAAQ,EAAE,IAClB,EAAE,mBACA,CAAC,OAAO,QAAQ,EAAE,IAClB;AACV,QAAM,QAAgB,CAAC;AACvB,QAAM,QAAQ,CAAC,MAAM,UAAU;AAC7B,QAAI,QAAQ,KAAK,OAAQ,OAAM,KAAK,KAAK,SAAS,MAAM,GAAG,KAAK,CAAC;AACjE,UAAM,KAAK,IAAI;AAAA,EACjB,CAAC;AACD,SAAO,EAAE,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM;AAC5C;AAGA,SAAS,WAAW,MAA4C;AAC9D,QAAM,MAAM,MAAM,IAAI,aAAa,mBAAmB,IAAI,IAAI,wBAAwB;AACtF,QAAM,MAAM,CAAC,MAA6B;AACxC,UAAM,IAAI,EAAE,KAAK;AACjB,QAAI,CAAC,EAAG,QAAO;AACf,QAAI,CAAC,WAAW,KAAK,CAAC,EAAG,OAAM,IAAI;AACnC,UAAM,IAAI,SAAS,GAAG,EAAE;AACxB,QAAI,IAAI,UAAW,OAAM,IAAI,aAAa,mBAAmB,mBAAmB,SAAS,EAAE;AAC3F,WAAO;AAAA,EACT;AACA,QAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,MAAI,MAAM,GAAG;AACX,UAAM,IAAI,IAAI,IAAI;AAClB,QAAI,MAAM,KAAM,OAAM,IAAI;AAC1B,WAAO,EAAE,KAAK,GAAG,KAAK,EAAE;AAAA,EAC1B;AACA,QAAM,IAAI,IAAI,KAAK,MAAM,GAAG,GAAG,CAAC,KAAK;AACrC,QAAM,IAAI,IAAI,KAAK,MAAM,MAAM,CAAC,CAAC;AACjC,MAAI,MAAM,QAAQ,IAAI,EAAG,OAAM,IAAI;AACnC,SAAO,EAAE,KAAK,GAAG,KAAK,KAAK,GAAG;AAChC;AAGA,SAAS,WAAW,OAA2B;AAC7C,MAAI,UAAU;AACd,MAAI,MAAM,CAAC,MAAM,KAAK;AACpB,cAAU;AACV,YAAQ,MAAM,MAAM,CAAC;AAAA,EACvB;AACA,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,aAAa,mBAAmB,kCAAkC;AACpG,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,SAA6B,CAAC;AACpC,MAAI,IAAI;AACR,SAAO,IAAI,MAAM,QAAQ;AACvB,QAAI,IAAI,MAAM,CAAC;AACf,QAAI,MAAM,QAAQ,IAAI,IAAI,MAAM,OAAQ,KAAI,MAAM,EAAE,CAAC;AACrD;AACA,QAAI,MAAM,CAAC,MAAM,OAAO,IAAI,IAAI,MAAM,QAAQ;AAC5C,YAAM,KAAK,MAAM,IAAI,CAAC;AACtB,UAAI,KAAK,EAAE,IAAI,KAAK,CAAC,EAAG,OAAM,IAAI,aAAa,mBAAmB,IAAI,CAAC,IAAI,EAAE,6BAA6B;AAC1G,aAAO,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;AAC/B,WAAK;AAAA,IACP,OAAO;AACL,cAAQ,IAAI,KAAK,CAAC,CAAC;AAAA,IACrB;AAAA,EACF;AACA,QAAM,QAAQ,CAAC,OAAe,QAAQ,IAAI,EAAE,KAAK,OAAO,KAAK,CAAC,CAAC,IAAI,EAAE,MAAM,MAAM,MAAM,MAAM,EAAE;AAC/F,SAAO,UAAU,CAAC,OAAO,OAAO,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,MAAM,EAAE;AACvE;AAGA,SAAS,eAAe,OAA+D;AACrF,QAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAM,QAA4C,CAAC,EAAE,OAAO,CAAC,GAAG,OAAO,EAAE,CAAC;AAC1E,MAAI,SAAS;AACb,MAAI,QAAQ;AACZ,QAAM,MAAM,MAAM,MAAM,MAAM,SAAS,CAAC,EAAE;AAC1C,QAAM,WAAW,CAAC,KAAa,KAAa,SAAiB;AAC3D,UAAM,QAAQ,IAAI;AAClB,UAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,QAAI,CAAC,QAAQ,KAAK,MAAM,YAAY,KAAK,MAAM,OAAO;AACpD,YAAM,IAAI,aAAa,mBAAmB,GAAG,IAAI,sCAAsC;AAAA,IACzF;AACA,UAAM,MAAM,SAAS,CAAC,IAAI,EAAE,GAAG,OAAO,MAAM,MAAM,KAAK,KAAK,MAAM,MAAM;AAAA,EAC1E;AACA,MAAI,IAAI;AACR,SAAO,IAAI,MAAM,QAAQ;AACvB,UAAM,IAAI,MAAM,GAAG;AACnB,YAAQ,GAAG;AAAA,MACT,KAAK;AACH,YAAI,EAAE,KAAK,SAAS,GAAG,CAAC;AACxB;AAAA,MACF,KAAK;AACH,YAAI,EAAE,KAAK,KAAK,SAAS,GAAG,GAAG,IAAI,CAAC;AACpC;AAAA,MACF,KAAK;AACH,iBAAS,GAAG,IAAI,GAAG;AACnB;AAAA,MACF,KAAK;AACH,YAAI,EAAE,KAAK,EAAE,GAAG,UAAU,MAAM,YAAY,CAAC;AAC7C;AAAA,MACF,KAAK;AACH,YAAI,EAAE,KAAK,EAAE,GAAG,UAAU,MAAM,UAAU,CAAC;AAC3C;AAAA,MACF,KAAK;AACH,cAAM,KAAK,EAAE,OAAO,CAAC,GAAG,OAAO,EAAE,OAAO,CAAC;AACzC;AAAA,MACF,KAAK,KAAK;AACR,YAAI,MAAM,WAAW,EAAG,OAAM,IAAI,aAAa,mBAAmB,sBAAsB;AACxF,cAAM,QAAQ,MAAM,IAAI;AACxB,YAAI,EAAE,KAAK,EAAE,GAAG,SAAS,OAAO,MAAM,OAAO,MAAM,EAAE,GAAG,OAAO,OAAO,MAAM,MAAM,EAAE,CAAC;AACrF;AAAA,MACF;AAAA,MACA,KAAK,KAAK;AACR,cAAM,MAAM,MAAM,QAAQ,KAAK,CAAC;AAChC,YAAI,MAAM,EAAG,OAAM,IAAI,aAAa,mBAAmB,uBAAuB;AAC9E,cAAM,EAAE,KAAK,IAAI,IAAI,WAAW,MAAM,MAAM,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC;AAC5D,iBAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG;AACtD,YAAI,MAAM;AACV;AAAA,MACF;AAAA,MACA,KAAK,KAAK;AACR,cAAM,MAAM,MAAM,QAAQ,KAAK,CAAC;AAChC,YAAI,MAAM,EAAG,OAAM,IAAI,aAAa,mBAAmB,uBAAuB;AAC9E,YAAI,EAAE,KAAK,SAAS,WAAW,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;AACpD,YAAI,MAAM;AACV;AAAA,MACF;AAAA,MACA,KAAK,MAAM;AACT,YAAI,KAAK,MAAM,QAAQ;AACrB,cAAI,EAAE,KAAK,MAAM,EAAE,CAAC;AAAA,QACtB,WAAW,QAAQ,KAAK,MAAM,CAAC,CAAC,GAAG;AACjC,gBAAM,IAAI,aAAa,mBAAmB,8DAA8D;AAAA,QAC1G,OAAO;AACL,cAAI,EAAE,KAAK,MAAM,KAAK,MAAM,GAAG,CAAC,CAAC,CAAC;AAAA,QACpC;AACA;AAAA,MACF;AAAA,MACA,KAAK,KAAK;AACR,YAAI,KAAK,MAAM,QAAQ;AACrB,cAAI,EAAE,KAAK,MAAM,EAAE,CAAC;AACpB;AAAA,QACF;AACA,cAAM,IAAI,MAAM,CAAC;AACjB,cAAM,OAAO,SAAS,CAAC;AACvB,YAAI,MAAM;AACR,cAAI,MAAM,IAAK,SAAQ;AACvB,cAAI,EAAE,KAAK,IAAI;AACf;AACA;AAAA,QACF;AACA,cAAM,MAAM,YAAY,OAAO,CAAC;AAChC,YAAI,KAAK;AACP,cAAI,IAAI,OAAO,KAAM,SAAQ;AAC7B,cAAI,EAAE,KAAK,MAAM,IAAI,EAAE,CAAC;AACxB,eAAK,IAAI;AAAA,QACX,OAAO;AACL,cAAI,EAAE,KAAK,MAAM,EAAE,CAAC;AAAA,QACtB;AACA;AAAA,MACF;AAAA,MACA;AACE,YAAI,EAAE,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC;AAAA,IAC7B;AAAA,EACF;AACA,MAAI,MAAM,SAAS,EAAG,OAAM,IAAI,aAAa,mBAAmB,uBAAuB;AACvF,SAAO,EAAE,MAAM,EAAE,GAAG,OAAO,OAAO,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,OAAO;AACpE;AAuBA,SAAS,eAAe,MAAoB;AAC1C,QAAM,OAAe,CAAC;AACtB,QAAM,OAAO,CAAC,SAAuB;AACnC,QAAI,KAAK,UAAU,kBAAkB;AACnC,YAAM,IAAI,aAAa,eAAe,+CAA+C;AAAA,IACvF;AACA,SAAK,KAAK,IAAI;AACd,WAAO,KAAK,SAAS;AAAA,EACvB;AACA,QAAM,OAAO,CAAC,MAAkB;AAC9B,YAAQ,EAAE,GAAG;AAAA,MACX,KAAK;AACH,aAAK,EAAE,IAAI,cAAS,MAAM,EAAE,KAAK,CAAC;AAClC;AAAA,MACF,KAAK;AACH,UAAE,MAAM,QAAQ,IAAI;AACpB;AAAA,MACF,KAAK;AACH,aAAK,EAAE,IAAI,cAAS,GAAG,IAAI,EAAE,MAAM,CAAC;AACpC,aAAK,EAAE,IAAI;AACX,aAAK,EAAE,IAAI,cAAS,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC;AACxC;AAAA,MACF,KAAK;AACH,aAAK,EAAE,IAAI,gBAAW,MAAM,EAAE,KAAK,CAAC;AACpC;AAAA,MACF,KAAK,OAAO;AACV,iBAAS,IAAI,GAAG,IAAI,EAAE,KAAK,IAAK,MAAK,EAAE,IAAI;AAC3C,YAAI,EAAE,MAAM,GAAG;AACb,gBAAM,QAAQ,KAAK,EAAE,IAAI,eAAU,GAAG,GAAG,GAAG,EAAE,CAAC;AAC/C,eAAK,EAAE,IAAI;AACX,eAAK,EAAE,IAAI,aAAQ,GAAG,MAAM,CAAC;AAC7B,gBAAMC,QAAO,KAAK;AAClB,gBAAM,OAAO,KAAK,KAAK;AACvB,eAAK,IAAI,EAAE,OAAOA,QAAO,QAAQ;AACjC,eAAK,IAAI,EAAE,OAAO,QAAQ,IAAIA;AAC9B;AAAA,QACF;AACA,cAAM,SAAmB,CAAC;AAC1B,iBAAS,IAAI,EAAE,KAAK,IAAI,EAAE,KAAK,KAAK;AAClC,iBAAO,KAAK,KAAK,EAAE,IAAI,eAAU,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC;AAC9C,eAAK,EAAE,IAAI;AAAA,QACb;AACA,cAAM,OAAO,KAAK;AAClB,mBAAW,KAAK,QAAQ;AACtB,gBAAM,OAAO,KAAK,CAAC;AACnB,eAAK,IAAI,EAAE,OAAO,OAAO,IAAI;AAC7B,eAAK,IAAI,EAAE,OAAO,IAAI,IAAI;AAAA,QAC5B;AACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,OAAK,EAAE,IAAI,cAAS,GAAG,EAAE,CAAC;AAC1B,OAAK,IAAI;AACT,OAAK,EAAE,IAAI,cAAS,GAAG,EAAE,CAAC;AAC1B,OAAK,EAAE,IAAI,cAAS,CAAC;AACrB,SAAO;AACT;AAEA,SAAS,YAAY,MAAkB,KAAa,KAAsB;AACxE,QAAM,SAAS,WAAW,SAAS,KAAK,GAAG,CAAC;AAC5C,QAAM,QAAQ,WAAW,KAAK,KAAK,GAAG,CAAC;AACvC,UAAQ,MAAM;AAAA,IACZ,KAAK;AAAY,aAAO,WAAW;AAAA,IACnC,KAAK;AAAa,aAAO,CAAC,UAAU;AAAA,IACpC,KAAK;AAAW,aAAO,UAAU,CAAC;AAAA,EACpC;AACF;AAOA,SAAS,SACP,MACA,YACA,iBACA,KACA,OACA,KACA,QACgC;AAChC,QAAM,OAAO,KAAK,aAAa;AAC/B,QAAM,OAAO,IAAI,WAAW,KAAK,MAAM;AACvC,MAAI,MAAM;AACV,MAAI,UAAoB,CAAC;AACzB,MAAI,YAA0B,CAAC;AAC/B,MAAI,UAAoB,CAAC;AACzB,MAAI,YAA0B,CAAC;AAC/B,QAAM,UAAoB,CAAC;AAC3B,QAAM,YAA0B,CAAC;AACjC,MAAI,UAA6B;AACjC,QAAM,UAAU,IAAI,WAAW,IAAI,EAAE,KAAK,EAAE;AAE5C,QAAM,MAAM,CAAC,QAAkB,UAAwB,KAAa,OAAmB,QAAgB;AACrG,YAAQ,KAAK,GAAG;AAChB,cAAU,KAAK,KAAK;AACpB,WAAO,QAAQ,QAAQ;AACrB,YAAM,KAAK,QAAQ,IAAI;AACvB,YAAM,OAAO,UAAU,IAAI;AAC3B,UAAI,KAAK,EAAE,MAAM,IAAK;AACtB,WAAK,EAAE,IAAI;AACX,YAAM,OAAO,KAAK,EAAE;AACpB,cAAQ,KAAK,IAAI;AAAA,QACf,KAAK;AACH,kBAAQ,KAAK,KAAK,CAAC;AACnB,oBAAU,KAAK,IAAI;AACnB;AAAA,QACF,KAAK;AACH,kBAAQ,KAAK,KAAK,GAAG,KAAK,CAAC;AAC3B,oBAAU,KAAK,MAAM,IAAI;AACzB;AAAA,QACF,KAAK,cAAS;AACZ,gBAAM,OAAO,KAAK,MAAM;AACxB,eAAK,KAAK,CAAC,IAAI;AACf,kBAAQ,KAAK,KAAK,CAAC;AACnB,oBAAU,KAAK,IAAI;AACnB;AAAA,QACF;AAAA,QACA,KAAK;AACH,cAAI,YAAY,KAAK,MAAM,KAAK,GAAG,GAAG;AACpC,oBAAQ,KAAK,KAAK,CAAC;AACnB,sBAAU,KAAK,IAAI;AAAA,UACrB;AACA;AAAA,QACF;AACE,iBAAO,KAAK,EAAE;AACd,mBAAS,KAAK,IAAI;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,IAAI;AACR,MAAI,OAAO,SAAS,KAAK,IAAI,IAAI,OAAO,UAAU;AAChD,WAAO,YAAY;AACnB,WAAO;AAAA,EACT;AACA,MAAI,QAAQ;AACZ,aAAS;AACP,QAAI,CAAC,QAAS,KAAI,SAAS,WAAW,GAAG,SAAS,CAAC;AACnD,UAAM,KAAK,IAAI,MAAM,IAAI,YAAY,CAAC,IAAK;AAC3C,UAAM,QAAQ,KAAK,QAAS,IAAI;AAChC,QAAI,QAAQ,WAAW,GAAG;AAExB,UAAI,WAAW,KAAK,IAAK;AACzB;AACA,WAAK;AACL;AAAA,IACF;AACA,UAAM,SAAS,MAAM,KAAK,kBAAkB,cAAc,EAAE,IAAI;AAChE;AACA,cAAU,CAAC;AACX,gBAAY,CAAC;AACb,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAI,EAAE,SAAS,MAAM;AACnB,eAAO,SAAS;AAChB,gBAAQ;AACR,YAAI,OAAO,SAAS,KAAK,IAAI,IAAI,OAAO,UAAU;AAChD,iBAAO,YAAY;AACnB,iBAAO;AAAA,QACT;AAAA,MACF;AACA,YAAM,OAAO,KAAK,QAAQ,CAAC,CAAC;AAC5B,UAAI,KAAK,OAAO,cAAS;AACvB,YAAI,MAAM,KAAK,KAAK,KAAK,IAAI,MAAM,EAAG,KAAI,SAAS,WAAW,QAAQ,CAAC,IAAI,GAAG,UAAU,CAAC,GAAG,IAAI,KAAK;AAAA,MACvG,WAAW,KAAK,OAAO,eAAU;AAC/B,kBAAU,UAAU,CAAC;AAErB;AAAA,MACF;AAAA,IACF;AACA,cAAU;AACV,gBAAY;AACZ,QAAI,KAAK,IAAK;AACd,SAAK;AAAA,EACP;AACA,SAAO,SAAS;AAChB,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,SAAiC,CAAC;AACxC,WAAS,IAAI,GAAG,KAAK,YAAY,KAAK;AACpC,UAAM,IAAI,QAAQ,IAAI,CAAC;AACvB,UAAM,IAAI,QAAQ,IAAI,IAAI,CAAC;AAC3B,WAAO,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,MAAS;AAAA,EAC5D;AACA,SAAO,EAAE,OAAO,QAAQ,CAAC,GAAG,KAAK,QAAQ,CAAC,GAAG,OAAO;AACtD;AAMA,IAAM,aAAa;AACnB,IAAM,iBAAiB,UAAU,UAAU,OAAO,UAAU,SAAS,UAAU,OAAO,UAAU;AAMhG,SAAS,gBAAgB,QAAyB;AAEhD,QAAM,eAAe,CAAC,MAAmD;AACvE,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,MAAM,OAAO,MAAM,IAAK,QAAO,EAAE,SAAS,MAAM,MAAM,KAAK;AAC/D,QAAI,MAAM,KAAK;AACb,YAAM,IAAI,sBAAsB,KAAK,OAAO,MAAM,CAAC,CAAC;AACpD,UAAI,GAAG;AACL,cAAM,MAAM,EAAE,CAAC,IAAK,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,CAAC,IAAI,WAAY,OAAO,EAAE,CAAC,CAAC;AACjE,eAAO,EAAE,SAAS,MAAM,GAAG,MAAM,MAAM,EAAE;AAAA,MAC3C;AAAA,IACF;AACA,WAAO,EAAE,SAAS,OAAO,MAAM,MAAM;AAAA,EACvC;AAEA,QAAM,QAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,MAAM,MAAM;AACd;AACA;AAAA,IACF;AACA,QAAI,SAAS;AACX,UAAI,MAAM,IAAK,WAAU;AACzB;AAAA,IACF;AACA,QAAI,MAAM,KAAK;AACb,gBAAU;AAAA,IACZ,WAAW,MAAM,KAAK;AACpB,YAAM,KAAK,KAAK;AAAA,IAClB,WAAW,MAAM,KAAK;AACpB,YAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,YAAM,IAAI,aAAa,IAAI,CAAC;AAC5B,UAAI,SAAS,EAAE,KAAM,QAAO;AAC5B,UAAI,MAAM,WAAW,SAAS,EAAE,SAAU,OAAM,MAAM,SAAS,CAAC,IAAI;AAAA,IACtE,WAAW,MAAM,UAAU,aAAa,CAAC,EAAE,SAAS;AAClD,YAAM,MAAM,SAAS,CAAC,IAAI;AAAA,IAC5B;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,aAAa,OAAe,GAAqC;AACxE,MAAI,gBAAgB,KAAK,GAAG;AAC1B,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,SAAS;AACb,MAAI,EAAE,aAAc,EAAE,eAAe,EAAE,YAAc,UAAS,GAAG,cAAc,MAAM,KAAK,IAAI,cAAc;AAAA,WACnG,EAAE,YAAa,UAAS,GAAG,cAAc,MAAM,KAAK;AAAA,WACpD,EAAE,YAAa,UAAS,MAAM,KAAK,IAAI,cAAc;AAC9D,MAAI;AACJ,MAAI;AACF,SAAK,IAAI,OAAO,QAAQ,EAAE,YAAY,OAAO,KAAK;AAAA,EACpD,SAAS,OAAO;AACd,UAAM,IAAI,aAAa,mBAAmB,gBAAgB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,EACpH;AACA,MAAI,YAA+D;AACnE,SAAO;AAAA,IACL,MAAM;AAAA,IACN,iBAAiB;AAAA,IACjB,iBAAiB,CAAC,EAAE;AAAA,IACpB,YAAY;AAAA,IACZ,KAAK,KAAK,OAAO,KAAK,QAAQ;AAC5B,UAAI,IAAI,IAAI,OAAO,UAAU;AAC3B,eAAO,YAAY;AACnB,eAAO;AAAA,MACT;AACA,UAAI,OAAO;AACX,UAAI,MAAM,IAAI,QAAQ;AACpB,YAAI,CAAC,aAAa,UAAU,QAAQ,OAAO,UAAU,QAAQ,KAAK;AAChE,sBAAY,EAAE,KAAK,KAAK,MAAM,IAAI,MAAM,GAAG,GAAG,EAAE;AAAA,QAClD;AACA,eAAO,UAAU;AAAA,MACnB;AACA,SAAG,YAAY;AACf,YAAM,IAAI,GAAG,KAAK,IAAI;AACtB,UAAI,CAAC,EAAG,QAAO;AACf,aAAO,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,QAAQ,MAAM,KAAK,CAAC,EAAE;AAAA,IAC7E;AAAA,EACF;AACF;AAOO,SAAS,mBAAmB,OAAe,UAAuB,CAAC,GAA6B;AACrG,MAAI;AACF,QAAI,MAAM,KAAK,KAAK,EAAE,SAAS,yBAAyB;AACtD,YAAM,IAAI,aAAa,YAAY,qCAAqC,uBAAuB,aAAa;AAAA,IAC9G;AACA,QAAI,QAAQ,MAAO,QAAO,EAAE,IAAI,MAAM,SAAS,aAAa,OAAO,OAAO,EAAE;AAE5E,UAAM,YAAY,CAAC,CAAC,QAAQ,aAAa,CAAC,QAAQ;AAElD,UAAM,kBAAkB,CAAC,QAAQ,aAAa,CAAC;AAC/C,QAAI;AACJ,QAAI;AACJ,QAAI,SAAS;AACb,QAAI,WAAW;AACb,OAAC,EAAE,MAAM,OAAO,OAAO,IAAI,eAAe,KAAK;AAAA,IACjD,OAAO;AACL,OAAC,EAAE,MAAM,MAAM,IAAI,aAAa,OAAO,SAAS,eAAe;AAC/D,YAAM,SAAS,QAAQ,aAAa,QAAQ;AAC5C,YAAM,QAAQ,QAAQ,aAAa,QAAQ;AAC3C,UAAI,UAAU,OAAO;AACnB,cAAM,QAAgB,CAAC;AACvB,YAAI,OAAQ,OAAM,KAAK,EAAE,GAAG,UAAU,MAAM,WAAW,CAAC;AACxD,cAAM,KAAK,IAAI;AACf,YAAI,MAAO,OAAM,KAAK,EAAE,GAAG,UAAU,MAAM,WAAW,CAAC;AACvD,eAAO,EAAE,GAAG,OAAO,MAAM;AAAA,MAC3B;AAAA,IACF;AACA,UAAM,OAAO,eAAe,IAAI;AAChC,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,SAAS;AAAA,QACP,MAAM,YAAY,cAAc;AAAA,QAChC,iBAAiB;AAAA,QACjB;AAAA,QACA,YAAY;AAAA,QACZ,MAAM,CAAC,KAAK,OAAO,KAAK,WAAW,SAAS,MAAM,QAAQ,iBAAiB,KAAK,OAAO,KAAK,MAAM;AAAA,MACpG;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd,QAAI,iBAAiB,aAAc,QAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,QAAQ,EAAE;AAC3G,WAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,mBAAmB,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,EAAE,EAAE;AAAA,EAC1H;AACF;AAuBO,SAAS,eACd,SACA,KACA,UAA0B,CAAC,GACZ;AACf,QAAM,SAAS,QAAQ,UAAU,mBAAmB;AACpD,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,OAAO,CAAC,GAAI,QAAQ,QAAQ,CAAC,GAAI,IAAI,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvE,QAAM,UAA0B,CAAC;AACjC,MAAI,OAAO;AACX,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAM;AACjB,QAAI,MAAM;AACV,WAAO;AACP,eAAS;AACP,YAAM,IAAI,QAAQ,KAAK,KAAK,KAAK,KAAK,MAAM;AAC5C,UAAI,MAAM,SAAU,QAAO,EAAE,SAAS,WAAW,KAAK;AACtD,UAAI,CAAC,EAAG;AACR,YAAM,QAAQ,EAAE,QAAQ,EAAE;AAC1B,YAAM,OAAO,QAAQ,EAAE,OAAO,KAAK,KAAK,EAAE,GAAG,IAAI,QAAS,IAAI,KAAK,EAAE;AACrE,UAAI,OAAO,IAAK;AAChB,YAAM;AACN,UAAI,MAAO;AACX,cAAQ,KAAK,CAAC;AACd,UAAI,QAAQ,UAAU,WAAY,QAAO,EAAE,SAAS,WAAW,KAAK;AAAA,IACtE;AAAA,EACF;AACA,SAAO,EAAE,SAAS,WAAW,MAAM;AACrC;AAaO,SAAS,iBAAiB,aAAqB,UAAuB,CAAC,GAAmB;AAC/F,MAAI,QAAQ,WAAW,QAAQ,MAAO,QAAO,cAAc,CAAC,EAAE,MAAM,QAAQ,MAAM,YAAY,CAAC,IAAI,CAAC;AACpG,QAAM,QAAQ,QAAQ,WAAW;AACjC,QAAM,MAAsB,CAAC;AAC7B,MAAI,MAAM;AACV,QAAM,QAAQ,MAAM;AAClB,QAAI,IAAK,KAAI,KAAK,EAAE,MAAM,QAAQ,MAAM,IAAI,CAAC;AAC7C,UAAM;AAAA,EACR;AACA,MAAI,IAAI;AACR,SAAO,IAAI,MAAM,QAAQ;AACvB,UAAM,IAAI,MAAM,GAAG;AACnB,QAAI,MAAM,QAAQ,QAAQ,aAAa,IAAI,MAAM,QAAQ;AACvD,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,QAAQ,KAAK,CAAC,GAAG;AACnB,cAAM;AACN,YAAI,KAAK,EAAE,MAAM,SAAS,OAAO,OAAO,CAAC,EAAE,CAAC;AAAA,MAC9C,OAAO;AACL,eAAO;AAAA,MACT;AACA;AACA;AAAA,IACF;AACA,QAAI,MAAM,OAAO,IAAI,MAAM,QAAQ;AACjC,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,MAAM,OAAO,MAAM,KAAK;AAC1B,cAAM;AACN,YAAI,KAAK,MAAM,MAAM,EAAE,MAAM,QAAQ,IAAI,EAAE,MAAM,YAAY,CAAC;AAC9D;AACA;AAAA,MACF;AACA,YAAM,OAAO,YAAY,CAAC;AAC1B,UAAI,SAAS,MAAM;AACjB,eAAO;AACP;AACA;AAAA,MACF;AACA,YAAM,MAAM,YAAY,OAAO,CAAC;AAChC,UAAI,KAAK;AACP,eAAO,OAAO,cAAc,IAAI,EAAE;AAClC,aAAK,IAAI;AACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,QAAM;AACN,SAAO;AACT;AAGO,SAAS,kBAAkB,QAAiC,OAAqB,gBAAgB,IAAY;AAClH,MAAI,MAAM;AACV,aAAW,SAAS,QAAQ;AAC1B,YAAQ,MAAM,MAAM;AAAA,MAClB,KAAK;AACH,eAAO,MAAM;AACb;AAAA,MACF,KAAK;AACH,eAAO,MAAM,OAAO,CAAC,KAAK;AAC1B;AAAA,MACF,KAAK;AACH,eAAO,MAAM,OAAO,MAAM,KAAK,KAAK;AACpC;AAAA,MACF,KAAK;AACH,eAAO,cAAc,QAAQ,SAAS,IAAI,EAAE,QAAQ,OAAO,IAAI;AAC/D;AAAA,IACJ;AAAA,EACF;AACA,SAAO;AACT;;;AC96BA,IAAM,gBAAgB;AAEtB,IAAM,4BAA4B,oBAAI,IAAI,CAAC,eAAe,cAAc,CAAC;AAEzE,IAAM,cAAc;AA4Cb,SAAS,eACd,KACA,OACA,UAAuB,CAAC,GACxB,gBAAuC,CAAC,GAClB;AACtB,MAAI,CAAC,MAAO,QAAO,EAAE,SAAS,CAAC,GAAG,WAAW,OAAO,OAAO,KAAK;AAChE,QAAM,WAAW,mBAAmB,OAAO,OAAO;AAClD,MAAI,CAAC,SAAS,GAAI,QAAO,EAAE,SAAS,CAAC,GAAG,WAAW,OAAO,OAAO,SAAS,MAAM;AAChF,QAAM,UAAU,SAAS;AACzB,QAAM,SAAS,iBAAiB,cAAc,eAAe,IAAI,OAAO;AACxE,QAAM,SAAS,mBAAmB,EAAE,aAAa,cAAc,YAAY,CAAC;AAC5E,QAAM,aAAa,cAAc,cAAc;AAE/C,QAAM,SAAkB,CAAC;AACzB,MAAI,YAAY,CAAC,MAAM,KAAK,QAAQ,UAAU;AAC5C,QAAI,CAAC,KAAK,YAAa,QAAO;AAC9B,WAAO,KAAK,EAAE,MAAM,KAAK,QAAQ,MAAM,CAAC;AACxC,WAAO;AAAA,EACT,CAAC;AAGD,QAAM,SAAoB,CAAC;AAC3B,SAAO,QAAQ,CAAC,OAAO,MAAM;AAC3B,UAAM,OAAO,OAAO,IAAI,CAAC;AACzB,UAAM,QACJ,QAAQ,mBAAmB,QAAQ,KAAK,WAAW,MAAM,UAAU,KAAK,QAAQ,MAAM,MAAM;AAC9F,QAAI,MAAO,QAAO,OAAO,SAAS,CAAC,EAAE,KAAK,KAAK;AAAA,QAC1C,QAAO,KAAK,CAAC,KAAK,CAAC;AAAA,EAC1B,CAAC;AAED,QAAM,UAAuB,CAAC;AAC9B,MAAI,YAAY;AAChB,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM;AAEV,UAAM,QAAkB,CAAC;AACzB,UAAM,QAAkB,CAAC;AACzB,UAAM,OAAiB,CAAC;AACxB,UAAM,QAAQ,CAAC,OAAO,MAAM;AAC1B,YAAM,eAAe,MAAM,MAAM;AACjC,YAAM,KAAK,QAAQ,CAAC,OAAO,WAAW;AACpC,cAAM,KAAK,eAAe;AAC1B,YAAI,MAAM,MAAM,KAAK,CAAC,MAAM,EAAE,KAAK,SAAS,aAAa,GAAG;AAC1D,cAAI,KAAK,KAAK,SAAS,CAAC,MAAM,IAAI,OAAQ,MAAK,KAAK,IAAI,MAAM;AAC9D;AAAA,QACF;AACA,YAAI,MAAM,QAAQ;AAChB,gBAAM,OAAO,MAAM,QAAQ;AAC3B,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,KAAK,KAAK,CAAC;AACjB,kBAAM,KAAK,KAAK,IAAI,CAAC;AAAA,UACvB;AACA,iBAAO;AAAA,QACT,OAAO;AACL,gBAAM,KAAK,EAAE;AACb,gBAAM,KAAK,KAAK,MAAM,QAAQ;AAC9B,iBAAO,MAAM,KAAK,SAAS,cAAc,OAAO;AAAA,QAClD;AAAA,MACF,CAAC;AACD,YAAM,OAAO,MAAM,IAAI,CAAC;AACxB,UAAI,MAAM;AACR,cAAM,KAAK,eAAe,MAAM,KAAK,QAAQ,IAAI;AACjD,cAAM,KAAK,KAAK,MAAM,CAAC;AACvB,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AACD,QAAI,CAAC,IAAK;AACV,UAAM,SAAS,eAAe,SAAS,KAAK;AAAA,MAC1C;AAAA,MACA;AAAA,MACA,YAAY,aAAa,QAAQ;AAAA,IACnC,CAAC;AACD,eAAW,KAAK,OAAO,SAAS;AAC9B,cAAQ,KAAK;AAAA,QACX,MAAM,MAAM,EAAE,KAAK;AAAA,QACnB,IAAI,MAAM,EAAE,MAAM,CAAC;AAAA,QACnB,MAAM,EAAE,OAAO,CAAC,KAAK,IAAI,MAAM,EAAE,OAAO,EAAE,GAAG;AAAA,QAC7C,aAAa,kBAAkB,QAAQ,GAAG,cAAc,iBAAiB,EAAE;AAAA,MAC7E,CAAC;AAAA,IACH;AACA,QAAI,OAAO,WAAW;AACpB,kBAAY;AACZ;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,SAAS,WAAW,OAAO,KAAK;AAC3C;AAGA,SAAS,iBAAiB,KAAsB,MAAc,IAAwC;AACpG,QAAM,QAAQ,IAAI,QAAQ,IAAI;AAC9B,QAAM,OAAO,OAAO,KAAK,MAAM,YAAY;AAC3C,QAAM,QAAQ,OAAO,KAAK,QAAQ,MAAM,MAAM;AAC9C,SAAO,MAAM,OAAO,CAAC,MAAM,CAAC,0BAA0B,IAAI,EAAE,KAAK,IAAI,CAAC;AACxE;AAGA,SAAS,cAAc,QAAgB,MAAc,OAAsD;AACzG,QAAM,QAA2B,CAAC;AAClC,QAAM,YAAY,OAAO,MAAM;AAC/B,QAAM,QAAQ,YAAY,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI;AAClD,QAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,QAAI,IAAI,EAAG,OAAM,KAAK,UAAU,OAAO,MAAM,MAAM,KAAK,CAAC;AACzD,QAAI,KAAM,OAAM,KAAK,OAAO,KAAK,MAAM,KAAK,CAAC;AAAA,EAC/C,CAAC;AACD,SAAO;AACT;AAOO,SAAS,kBAAkB,IAAiB,SAAyC;AAC1F,QAAM,OAAiB,IAAI,MAAM,QAAQ,MAAM;AAC/C,QAAM,SAAS,GAAG,IAAI,KAAK;AAC3B,WAAS,IAAI,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;AAC5C,UAAM,EAAE,MAAM,IAAI,YAAY,IAAI,QAAQ,CAAC;AAC3C,UAAM,QAAQ,iBAAiB,GAAG,KAAK,MAAM,EAAE;AAC/C,UAAM,QAAQ,YAAY,MAAM,YAAY;AAC5C,UAAM,cAAc,GAAG,MAAM;AAC7B,UAAM,QAAQ,cAAc,QAAQ,MAAM,CAAC,GAAG,KAAK;AACnD,QAAI,MAAM,OAAQ,IAAG,YAAY,MAAM,IAAI,KAAK;AAAA,aACvC,KAAK,KAAM,IAAG,OAAO,MAAM,EAAE;AACtC,QAAI,MAAM,GAAG,QAAQ,MAAM,WAAW,EAAE,IAAI,IAAI,CAAC;AACjD,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,SAAG,MAAM,GAAG;AACZ,aAAO;AACP,YAAM,UAAU,cAAc,QAAQ,MAAM,CAAC,GAAG,KAAK;AACrD,UAAI,QAAQ,QAAQ;AAClB,WAAG,OAAO,KAAK,OAAO;AACtB,eAAO,QAAQ,OAAO,CAAC,MAAM,SAAS,OAAO,KAAK,UAAU,CAAC;AAAA,MAC/D;AAAA,IACF;AAGA,UAAM,MAAM,GAAG,QAAQ,MAAM,WAAW;AACxC,aAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAAK,MAAK,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC;AACzE,SAAK,CAAC,IAAI;AAAA,EACZ;AACA,SAAO;AACT;;;AC7MA,SAAS,2BAA4C;AACrD,SAAS,YAAAC,iBAA8C;AACvD,YAAY,YAAY;AACxB,YAAY,eAAe;AAC3B,YAAY,kBAAkB;AAC9B,YAAY,gBAAgB;AAG5B,IAAM,aAAa,CAAC,KAAU,SAC5B,MAAM,IAAI,KAAK,KAAK,UAAU,IAAI,KAAK,KAAK,SAAS,WAAW,KAAK,WAAW;AAElF,IAAM,YAAY,WAAW,QAAQ,OAAO;AAC5C,IAAM,eAAe,WAAW,WAAW,UAAU;AACrD,IAAM,kBAAkB,WAAW,cAAc,aAAa;AAC9D,IAAM,gBAAgB,WAAW,YAAY,WAAW;AAKxD,IAAM,aAAa,oBAAI,IAAwB,CAAC,QAAQ,UAAU,SAAS,SAAS,CAAC;AAG9E,SAAS,4BAA4B,OAA2C;AACrF,QAAM,IAAI,OAAO,UAAU,WAAW,MAAM,KAAK,EAAE,YAAY,IAAI;AACnE,SAAO,WAAW,IAAI,CAAuB,IAAK,IAA2B;AAC/E;AAQA,IAAM,cACJ;AAGK,SAAS,wBAAwB,OAA+B;AACrE,QAAM,IAAI,OAAO,UAAU,WAAW,MAAM,KAAK,IAAI;AACrD,MAAI,CAAC,KAAK,EAAE,SAAS,MAAM,CAAC,YAAY,KAAK,CAAC,EAAG,QAAO;AACxD,MAAI,kDAAkD,KAAK,CAAC,EAAG,QAAO;AACtE,SAAO;AACT;AAGA,IAAM,iBAAiB,OAAO;AAAA,EAC5B,OAAO;AAAA,IACL,SAAS;AAAA,IACT,WAAW,CAAC,YACV,4BAA4B,QAAQ,OAAO,aAAa,QAAQ,aAAa,OAAO,CAAC;AAAA,IACvF,YAAY,CAAC,UAA+B;AAC1C,YAAM,QAAQ,4BAA4B,MAAM,KAAK;AACrD,aAAO,QAAQ,EAAE,OAAO,eAAe,KAAK,GAAG,IAAI,CAAC;AAAA,IACtD;AAAA,EACF;AAAA,EACA,iBAAiB;AAAA,IACf,SAAS;AAAA,IACT,WAAW,CAAC,YACV;AAAA,MACE,QAAQ,aAAa,uBAAuB,KAC1C,QAAQ,OAAO,mBACf,QAAQ,aAAa,SAAS;AAAA,IAClC;AAAA,IACF,YAAY,CAAC,UAA+B;AAC1C,YAAM,QAAQ,wBAAwB,MAAM,eAAe;AAC3D,aAAO,QAAQ,EAAE,OAAO,qBAAqB,KAAK,IAAI,yBAAyB,MAAM,IAAI,CAAC;AAAA,IAC5F;AAAA,EACF;AACF;AAMA,IAAM,WAAW,CAAC,SAA0B;AAC1C,QAAM,OAA0B,CAAC;AACjC,OAAK,QAAQ,CAAC,UAAU,KAAK,KAAK,KAAK,CAAC;AACxC,SAAO;AACT;AAEA,IAAM,UAAU,CAAC,UAA2B,KAAK,MAAM,WAAW,KAAK,MAAM,KAAK,MAAM,WAAW,KAAK;AAOjG,SAAS,WAAW,MAAgC;AACzD,QAAM,OAAO,SAAS,IAAI;AAC1B,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,QAAQ,KAAK,CAAC,EAAE;AACtB,SAAO,KAAK;AAAA,IACV,CAAC,KAAK,MACJ,IAAI,eAAe,SACnB,SAAS,GAAG,EAAE;AAAA,MACZ,CAAC,UACE,MAAM,IAAI,KAAK,KAAK,SAAS,gBAAgB,KAAK,KAAK,SAAS,gBACjE,CAAC,QAAQ,IAAI,KACb,KAAK,eAAe,KACpB,KAAK,WAAY,KAAK,SAAS;AAAA,IACnC;AAAA,EACJ;AACF;AAEA,IAAM,aAAqC,EAAE,MAAM,QAAQ,QAAQ,SAAS,OAAO,OAAO;AAO1F,SAAS,uBAAuB,OAAY,MAAuB;AACjE,MAAI,CAAC,WAAW,IAAI,GAAG;AACrB,UAAM,OAAO,oBAAoBC,UAAS,KAAK,IAAI,GAAG,KAAK,KAAK,MAAM;AAEtE,UAAM,MAAM,KAAK,QAAQ,WAAW,IAAI,CAAC;AACzC,UAAM,WAAW,IAAI;AACrB;AAAA,EACF;AACA,QAAM,WAAW,MAAM;AACvB,QAAM,UAAU;AAChB,WAAS,IAAI,EAAE,QAAQ,CAAC,KAAK,MAAM;AACjC,QAAI,EAAG,OAAM,cAAc;AAC3B,UAAM,MAAM,IAAI;AAChB,aAAS,GAAG,EAAE,QAAQ,CAAC,MAAM,MAAM;AACjC,UAAI,EAAG,OAAM,MAAM,KAAK;AACxB,YAAM,YAAY,KAAK;AAGvB,YAAM,QAAQ,MAAM,IAAI;AACxB,UAAI,UAAU,WAAY,OAAM,aAAa,SAAS;AACtD,YAAM,OAAe,MAAM,IAAI,MAAM,KAAK;AAC1C,YAAM,MAAM,MAAM,IAAI,MAAM,GAAG,KAAK,IAAI,KAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,KAAK;AAAA,IACvF,CAAC;AACD,UAAM,MAAM,IAAI;AAChB,QAAI,MAAM,GAAG;AACX,YAAM,YAAY,SAAS,GAAG,EAAE,IAAI,CAAC,SAAS,WAAW,KAAK,MAAM,KAAK,KAAK,KAAK;AACnF,YAAM,cAAc;AACpB,YAAM,MAAM,KAAK,UAAU,KAAK,KAAK,CAAC,IAAI;AAAA,IAC5C;AAAA,EACF,CAAC;AACD,QAAM,UAAU;AAChB,QAAM,WAAW,IAAI;AACvB;AA2BO,IAAM,wBAA8C;AAAA,EACzD,WAAW;AAAA,EACX,aAAa;AAAA,EACb,cAAc;AAAA,EACd,qBAAqB;AAAA,EACrB,yBAAyB;AAAA,EACzB,gBAAgB,EAAE,OAAO,iBAAiB;AAAA,EAC1C,oBAAoB,CAAC;AAAA,EACrB,sBAAsB,CAAC;AAAA,EACvB,mBAAmB,CAAC;AACtB;AAOO,IAAM,QAAQ,UAAU,OAAO;AAAA,EACpC,aAAa;AACX,WAAO,EAAE,UAAU,EAAE,WAAW,uBAAuB,EAAE;AAAA,EAC3D;AAAA,EACA,wBAAwB;AACtB,WAAO,CAAC,GAAI,KAAK,SAAS,KAAK,CAAC,GAAI,yBAAyB,CAAC;AAAA,EAChE;AACF,CAAC;AAEM,IAAM,WAAW;AAGjB,IAAM,YAAY,cAAc,OAAO;AAAA,EAC5C,gBAAgB;AACd,WAAO,EAAE,GAAG,KAAK,SAAS,GAAG,GAAG,eAAe,EAAE;AAAA,EACnD;AACF,CAAC;AAGM,IAAM,cAAc,gBAAgB,OAAO;AAAA,EAChD,gBAAgB;AACd,WAAO,EAAE,GAAG,KAAK,SAAS,GAAG,GAAG,eAAe,EAAE;AAAA,EACnD;AACF,CAAC;AASM,SAAS,sBAAsB,UAAyC,CAAC,GAAe;AAC7F,QAAM,IAAI,EAAE,GAAG,uBAAuB,GAAG,QAAQ;AACjD,SAAO;AAAA,IACL,MAAM,UAAU;AAAA,MACd,WAAW,EAAE;AAAA,MACb,aAAa,EAAE;AAAA,MACf,cAAc,EAAE;AAAA,MAChB,qBAAqB,EAAE;AAAA,MACvB,yBAAyB,EAAE;AAAA,MAC3B,gBAAgB,EAAE;AAAA,IACpB,CAAC;AAAA,IACD,SAAS,UAAU,EAAE,gBAAgB,EAAE,kBAAkB,CAAC;AAAA,IAC1D,YAAY,UAAU,EAAE,gBAAgB,EAAE,qBAAqB,CAAC;AAAA,IAChE,UAAU,UAAU,EAAE,gBAAgB,EAAE,mBAAmB,CAAC;AAAA,EAC9D;AACF;;;ACzOA,SAAS,qBAAuE;AAChF,SAAS,qBAAqB;AAoC9B,IAAM,UAAU,CAAC,SAAkB,KAAK,UAAU,IAAI;AAQ/C,IAAM,gBAAN,MAAwC;AAAA,EAa7C,YACE,OACA,OACiB,cACjB;AADiB;AAEjB,SAAK,SAAS,MAAM;AACpB,SAAK,OAAO,MAAM;AAClB,SAAK,SAAS,OAAO,MAAM,WAAW,aAAc,MAAM,SAAsC,MAAM;AACtG,SAAK,WAAW,KAAK,OAAO;AAC5B,SAAK,MAAM,SAAS,cAAc,KAAK;AACvC,SAAK,IAAI,YAAY;AACrB,SAAK,IAAI,aAAa,aAAa,OAAO;AAC1C,SAAK,IAAI,kBAAkB;AAC3B,SAAK,eAAe;AACpB,SAAK,MAAM,QAAQ,KAAK,KAAK,MAAM,IAAI;AACvC,SAAK,aAAa,IAAI,gBAAgB,EAAE,MAAM,KAAK,KAAK,MAAM,KAAK,CAAC;AACpE,SAAK,cAAc,KAAK,WAAW,UAAU,CAAC,UAAU;AACtD,UAAI,CAAC,MAAM,QAAS,MAAK,UAAU;AAAA,IACrC,CAAC;AACD,SAAK,OAAO,GAAG,UAAU,KAAK,cAAc;AAC5C,SAAK,WAAW,QAAQ,MAAM,KAAK,KAAK,KAAK,UAAU,CAAC,IAAI;AAC5D,QAAI,CAAC,MAAO,MAAK,WAAW;AAAA,EAC9B;AAAA,EAnBmB;AAAA,EAfV;AAAA,EACD;AAAA,EACS;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT,UAAU;AAAA,EACV,WAAW;AAAA,EACX;AAAA,EACA;AAAA,EA0BA,YAAgC;AACtC,WAAO;AAAA,MACL,IAAI,KAAK,KAAK,MAAM,MAAM;AAAA,MAC1B,YAAY,KAAK;AAAA,MACjB,OAAO,KAAK,KAAK,MAAM,SAAS;AAAA,MAChC,QAAQ,KAAK,KAAK,MAAM;AAAA,MACxB,UAAU,KAAK;AAAA,MACf,UAAU,KAAK;AAAA,MACf,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,MACjB,SAAS,KAAK;AAAA,IAChB;AAAA,EACF;AAAA,EAEQ,SAAS;AACf,QAAI,KAAK,SAAU,MAAK,SAAS,OAAO,KAAK,UAAU,CAAC;AAAA,QACnD,MAAK,WAAW;AACrB,SAAK,IAAI,gBAAgB,gBAAgB,KAAK,OAAO;AAAA,EACvD;AAAA,EAEQ,aAAa;AACnB,UAAM,EAAE,IAAI,IAAI,cAAc,WAAW,UAAU,KAAK,aAAa,KAAK,IAAI,CAAC;AAC/E,SAAK,IAAI,gBAAgB,GAAG;AAAA,EAC9B;AAAA,EAEQ,iBAAiB;AACvB,QAAI,KAAK,KAAK,MAAM,GAAI,MAAK,IAAI,aAAa,iBAAiB,KAAK,KAAK,MAAM,EAAE;AAAA,QAC5E,MAAK,IAAI,gBAAgB,eAAe;AAAA,EAC/C;AAAA,EAEQ,iBAAiB,MAAM;AAC7B,QAAI,KAAK,OAAO,eAAe,KAAK,SAAU;AAC9C,SAAK,WAAW,KAAK,OAAO;AAC5B,QAAI,CAAC,KAAK,SAAU,MAAK,UAAU;AACnC,SAAK,OAAO;AAAA,EACd;AAAA;AAAA,EAGQ,YAAY;AAClB,UAAM,OAAO,KAAK,WAAW,OAAO;AACpC,UAAM,MAAM,QAAQ,IAAI;AACxB,QAAI,QAAQ,KAAK,IAAK;AACtB,UAAM,MAAM,KAAK,OAAO;AACxB,QAAI,OAAO,QAAQ,YAAY,KAAK,OAAO,YAAa;AACxD,SAAK,MAAM;AACX,SAAK,OAAO,KAAK,SAAS,KAAK,OAAO,MAAM,GAAG,cAAc,KAAK,QAAW,EAAE,GAAG,KAAK,KAAK,OAAO,KAAK,CAAC,CAAC;AAAA,EAC5G;AAAA,EAEA,aAAa,CAAC,YAAqB;AACjC,QAAI,WAAW,CAAC,KAAK,OAAO,WAAY;AACxC,QAAI,WAAW,CAAC,KAAK,UAAU;AAC7B,YAAM,MAAM,KAAK,OAAO;AACxB,UAAI,OAAO,QAAQ,UAAU;AAC3B,aAAK,OAAO,KAAK,SAAS,KAAK,OAAO,MAAM,GAAG,aAAa,cAAc,OAAO,KAAK,OAAO,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAC/G;AAAA,IACF;AACA,QAAI,KAAK,YAAY,QAAS;AAC9B,SAAK,UAAU;AACf,SAAK,OAAO;AAAA,EACd;AAAA,EAEA,UAAU,CAAC,SAAqD;AAC9D,UAAM,MAAM,KAAK,OAAO;AACxB,QAAI,OAAO,QAAQ,YAAY,CAAC,KAAK,OAAO,WAAY;AACxD,SAAK,OAAO,KAAK,SAAS,KAAK,OAAO,MAAM,GAAG,cAAc,KAAK,QAAW,EAAE,GAAG,KAAK,KAAK,OAAO,GAAG,KAAK,CAAC,CAAC;AAAA,EAC/G;AAAA,EAEA,OAAO,MAAgC;AACrC,QAAI,KAAK,SAAS,KAAK,KAAK,KAAM,QAAO;AACzC,SAAK,OAAO;AACZ,SAAK,eAAe;AACpB,UAAM,MAAM,QAAQ,KAAK,MAAM,IAAI;AACnC,QAAI,QAAQ,KAAK,KAAK;AACpB,WAAK,MAAM;AAEX,UAAI,QAAQ,KAAK,WAAW,OAAO,CAAC,MAAM,IAAK,MAAK,WAAW,KAAK,KAAK,MAAM,MAAmB,EAAE,cAAc,KAAK,CAAC;AAAA,IAC1H;AACA,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;AAAA,EAEA,aAAa;AACX,SAAK,WAAW;AAChB,SAAK,IAAI,UAAU,IAAI,0BAA0B;AACjD,SAAK,OAAO;AAAA,EACd;AAAA,EAEA,eAAe;AACb,SAAK,WAAW;AAChB,SAAK,UAAU;AACf,SAAK,IAAI,UAAU,OAAO,0BAA0B;AACpD,SAAK,OAAO;AAAA,EACd;AAAA;AAAA,EAGA,UAAU,OAAuB;AAC/B,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,WAAO,EAAE,MAAM,SAAS,eAAe,MAAM,WAAW,KAAK;AAAA,EAC/D;AAAA,EAEA,iBAA0B;AACxB,WAAO;AAAA,EACT;AAAA,EAEA,UAAU;AACR,SAAK,OAAO,IAAI,UAAU,KAAK,cAAc;AAC7C,SAAK,YAAY;AACjB,SAAK,UAAU,QAAQ;AACvB,SAAK,WAAW,QAAQ;AAAA,EAC1B;AACF;AAMO,SAAS,oBACd,OACA,cACA;AACA,SAAO,CAAC,UAA2C,IAAI,cAAc,OAAO,OAAO,YAAY;AACjG;;;AC5MA,SAAS,MAAM,uBAAoC;AAEnD,SAAS,UAAAC,SAAQ,aAAAC,kBAAqD;;;ACFtE,SAAS,sBAAmC;AAE5C,SAAS,mBAAqC;AAC9C,SAAS,mBAAmB,mBAAmB;AAE/C,IAAI,YAAY;AAMT,SAAS,oBAAoB,QAAwB;AAC1D,eAAa,YAAY,KAAK;AAC9B,QAAM,SAAS,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,GAAG;AACnE,SAAO,GAAG,MAAM,IAAI,MAAM,GAAG,UAAU,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AACtE;AAOO,SAAS,mBACd,cACA,WACS;AACT,aAAW,MAAM,cAAc;AAC7B,eAAW,QAAQ,GAAG,OAAO;AAC3B,UAAI,EAAE,gBAAgB,eAAe,gBAAgB,oBAAoB;AAEvE,cAAM,OAAQ,KAAa;AAC3B,YAAI,QAAQ,UAAU,SAAS,KAAK,KAAK,IAAI,EAAG,QAAO;AACvD;AAAA,MACF;AACA,UAAI,QAAQ;AACZ,WAAK,MAAM,QAAQ,YAAY,CAAC,SAAS;AACvC,YAAI,MAAO,QAAO;AAClB,YACE,UAAU,SAAS,KAAK,KAAK,IAAI,KACjC,KAAK,MAAM,KAAK,CAAC,MAAM,UAAU,SAAS,EAAE,KAAK,IAAI,CAAC,GACtD;AACA,kBAAQ;AAAA,QACV;AACA,eAAO,CAAC;AAAA,MACV,CAAC;AACD,UAAI,MAAO,QAAO;AAAA,IACpB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,YACd,KACA,WACS;AACT,MAAI,QAAQ;AACZ,MAAI,YAAY,CAAC,SAAS;AACxB,QAAI,MAAO,QAAO;AAClB,QACE,UAAU,SAAS,KAAK,KAAK,IAAI,KACjC,KAAK,MAAM,KAAK,CAAC,MAAM,UAAU,SAAS,EAAE,KAAK,IAAI,CAAC,GACtD;AACA,cAAQ;AAAA,IACV;AACA,WAAO,CAAC;AAAA,EACV,CAAC;AACD,SAAO;AACT;AAOO,SAAS,kBAAkB,WAA8B;AAC9D,SAAO;AAAA,IACL,MAAM,CAAC,SAAkB,UACvB,YAAY,MAAM,KAAK,SAAS;AAAA,IAClC,OAAO,CACL,IACA,SACA,WACA,aACG;AACH,UAAI,CAAC,GAAG,WAAY,QAAO;AAC3B,UAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,EAAE,GAAG,SAAS,EAAG,QAAO;AAC7D,aAAO,YAAY,SAAS,KAAK,SAAS;AAAA,IAC5C;AAAA,EACF;AACF;AAKO,SAAS,YACd,GACA,GACA,IACS;AACT,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAI,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAAA,EAC9B;AACA,SAAO;AACT;AAMO,SAAS,eACd,MACA,KACA,WAA2B,UACrB;AACN,MAAI;AACF,UAAM,MAAM,MAAM,UAAU,GAAG;AAC/B,QAAI,OAAO,OAAO,IAAI,mBAAmB,YAAY;AACnD,UAAI,eAAe,EAAE,OAAO,SAAS,SAAS,CAAC;AAAA,IACjD;AAAA,EACF,QAAQ;AAAA,EAER;AACF;AAWO,SAAS,mBACd,QACA,MACM;AACN,QAAM,EAAE,QAAQ,IAAI,OAAO;AAC3B,MAAI,WAAW,QAAQ,YAAY,GAAI;AACvC,MAAI;AACF,UAAM,MAAM,eAAe,SAAgB,OAAO,QAAQ,OAAO,QAAQ,cAAc;AAAA,MACrF,uBAAuB;AAAA,IACzB,CAAC;AACD,UAAM,KAAK,KAAK,YAAY,OAAO,EAAE,IAAI,CAAC,CAAC;AAC3C,QAAI,IAAI,WAAY,QAAO,QAAQ,UAAU,GAAG;AAAA,EAClD,QAAQ;AAAA,EAER;AACF;AAGO,IAAM,qBAAqB;;;ADhG3B,IAAM,iBAAiB,IAAIC,WAAU,WAAW;AAWhD,SAAS,kBAAkB,KAAsB,WAAW,SAA0B;AAC3F,QAAM,SAA0B,CAAC;AACjC,MAAI,YAAY,CAAC,MAAM,QAAQ;AAC7B,QAAI,KAAK,KAAK,SAAS,UAAU;AAC/B,aAAO,KAAK,EAAE,IAAI,KAAK,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,KAAK,CAAC;AAC3E,aAAO;AAAA,IACT;AACA,WAAO,CAAC,KAAK;AAAA,EACf,CAAC;AACD,SAAO;AACT;AAGO,SAAS,eAAe,QAA4D;AACzF,SAAO,CAAC,CAAC,QAAQ,QAAQ,OAAO;AAClC;AAGA,SAAS,SAAS,OAAkC;AAClD,MAAI,QAAQ;AACZ,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI;AACF,cAAQ,KAAK,MAAM,KAAK;AAAA,IAC1B,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AACA,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO;AACxE,SAAO,mBAAmB,KAAK,EAAE;AACnC;AAEA,IAAM,WAAW,CAAC,UAAwC;AACxD,QAAM,IAAI,UAAU,OAAO,MAAM,OAAO,KAAK;AAC7C,SAAO,OAAO,SAAS,CAAC,KAAK,KAAK,MAAM,KAAK,OAAO,IAAI;AAC1D;AAGA,SAAS,aAAa,OAAoB,UAAkB,YAA8C;AACxG,QAAM,OAAO,oBAAI,IAAY;AAC7B,MAAI,KAAyB;AAC7B,aAAW,SAAS,kBAAkB,MAAM,KAAK,QAAQ,GAAG;AAC1D,QAAI,MAAM,MAAM,CAAC,KAAK,IAAI,MAAM,EAAE,GAAG;AACnC,WAAK,IAAI,MAAM,EAAE;AACjB;AAAA,IACF;AACA,QAAI,KAAK,WAAW;AACpB,WAAO,KAAK,IAAI,EAAE,EAAG,MAAK,WAAW;AACrC,SAAK,IAAI,EAAE;AACX,SAAK,MAAM,MAAM;AACjB,OAAG,cAAc,MAAM,KAAK,QAAW,EAAE,GAAG,MAAM,KAAK,OAAO,GAAG,CAAC;AAAA,EACpE;AACA,SAAO,IAAI,QAAQ,gBAAgB,KAAK,KAAK;AAC/C;AAGO,SAAS,eACd,MACA,SACc;AACd,QAAM,OAAkB,KAAK,MAAM;AACnC,QAAM,QAAQ,KAAK,MAAM,SAAS,QAAQ;AAC1C,QAAM,SAAS,KAAK,MAAM,UAAU,QAAQ;AAC5C,QAAM,QAAQ,YAAY,MAAM,EAAE,OAAO,QAAQ,OAAO,QAAQ,OAAO,WAAW,KAAK,CAAC;AACxF,SAAO,oBAAoB,OAAO;AAAA,IAChC,WAAW,KAAK,SAAS;AAAA,IACzB,aAAa,cAAc,IAAI;AAAA,IAC/B,OAAO,EAAE,OAAO,gDAAgD;AAAA,EAClE,CAAC;AACH;AAGA,IAAM,qBAAqB,CAAC,SAC1B,KAAK,IAAI,GAAG,GAAG,MAAM,KAAK,KAAK,SAAS,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC;AAc9D,IAAM,QAAQ,KAAK,OAAyB;AAAA,EACjD,MAAM;AAAA,EACN,UAAU;AAAA,EACV,OAAO;AAAA,EACP,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,WAAW;AAAA,EAEX,aAAa;AACX,WAAO;AAAA,MACL,gBAAgB,CAAC;AAAA,MACjB,UAAU;AAAA,MACV,OAAO;AAAA,MACP,cAAc;AAAA,MACd,eAAe;AAAA,MACf,YAAY,MAAM,oBAAoB,OAAO;AAAA,IAC/C;AAAA,EACF;AAAA,EAEA,gBAAgB;AACd,WAAO;AAAA,MACL,IAAI;AAAA,QACF,SAAS;AAAA,QACT,WAAW,CAAC,YAAyB,QAAQ,aAAa,eAAe,KAAK;AAAA,QAC9E,YAAY,CAAC,eACX,WAAW,KAAK,EAAE,iBAAiB,WAAW,GAAG,IAAI,CAAC;AAAA,MAC1D;AAAA,MACA,MAAM;AAAA,QACJ,SAAS,mBAAmB,CAAC,CAAC,EAAE;AAAA;AAAA,QAEhC,WAAW,CAAC,YAAyB,SAAS,QAAQ,aAAa,YAAY,CAAC;AAAA,QAChF,YAAY,CAAC,gBAAqC;AAAA,UAChD,cAAc,KAAK,UAAU,WAAW,IAAI;AAAA,QAC9C;AAAA,MACF;AAAA,MACA,OAAO;AAAA,QACL,SAAS;AAAA,QACT,WAAW,CAAC,YAAyB,SAAS,QAAQ,aAAa,YAAY,CAAC;AAAA,QAChF,YAAY,CAAC,eACX,WAAW,QAAQ,EAAE,cAAc,OAAO,WAAW,KAAK,EAAE,IAAI,CAAC;AAAA,MACrE;AAAA,MACA,QAAQ;AAAA,QACN,SAAS,KAAK,QAAQ;AAAA,QACtB,WAAW,CAAC,YAAyB,SAAS,QAAQ,aAAa,aAAa,CAAC;AAAA,QACjF,YAAY,CAAC,gBAAqC;AAAA,UAChD,eAAe,OAAO,WAAW,MAAM;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,YAAY;AACV,WAAO;AAAA,MACL;AAAA,QACE,KAAK;AAAA,QACL,UAAU;AAAA;AAAA;AAAA,QAGV,UAAU,CAAC,YAAa,SAAU,QAAwB,aAAa,YAAY,CAAC,IAAI,OAAO;AAAA,MACjG;AAAA,MACA;AAAA;AAAA,QAEE,KAAK;AAAA,QACL,UAAU;AAAA,QACV,UAAU,CAAC,YAAY;AACrB,gBAAM,OAAQ,QAAwB,cAAc,MAAM;AAC1D,gBAAM,WAAW,MAAM,aAAa,OAAO,KAAM,QAAwB,aAAa,eAAe,KAAK;AAC1G,cAAI,CAAC,mCAAmC,KAAK,QAAQ,KAAK,aAAa,UAAW,QAAO;AACzF,gBAAM,SAAS,kBAAkB,QAAQ,SAAS,eAAe,EAAE;AACnE,iBAAO,OAAO,SAAS,EAAE,MAAM,OAAO,KAAK,IAAI;AAAA,QACjD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,WAAW,EAAE,MAAM,eAAe,GAAG;AACnC,UAAM,MAAM,eAAe,MAAM,KAAK,OAAO;AAC7C,WAAO;AAAA,MACL;AAAA,MACA,gBAAgB,KAAK,QAAQ,gBAAgB,gBAAgB;AAAA,QAC3D,aAAa;AAAA,QACb,OAAO;AAAA,MACT,CAAC;AAAA,MACD;AAAA,IACF;AAAA,EACF;AAAA,EAEA,WAAW,EAAE,KAAK,GAAG;AACnB,WAAO,WAAW,KAAK,MAAM,MAAM,SAAS,UAAU;AAAA,EACxD;AAAA,EAEA,aAAa;AACX,WAAO;AAAA,MACL,UAAU;AAAA,QACR,UAAU,OAAY,MAAuB;AAC3C,gBAAM,OAAO,eAAe,KAAK,MAAM,IAAI;AAC3C,gBAAM,QAAQ,IAAI,OAAO,KAAK,IAAI,GAAG,mBAAmB,IAAI,IAAI,CAAC,CAAC;AAClE,gBAAM,MAAM,GAAG,KAAK;AAAA,CAAW;AAC/B,gBAAM,KAAK,MAAM,KAAK;AACtB,gBAAM,cAAc;AACpB,gBAAM,MAAM,KAAK;AACjB,gBAAM,WAAW,IAAI;AAAA,QACvB;AAAA,QACA,OAAO;AAAA;AAAA;AAAA,QAGP;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAc;AACZ,WAAO;AAAA,MACL,aACE,CAAC,YACD,CAAC,EAAE,SAAS,MACV,SAAS,cAAc;AAAA,QACrB,MAAM,KAAK;AAAA,QACX,OAAO;AAAA,UACL,IAAI,QAAQ,MAAM,KAAK,QAAQ,WAAW;AAAA,UAC1C,MAAM,mBAAmB,QAAQ,QAAQ,CAAC,CAAC,EAAE;AAAA,UAC7C,OAAO,QAAQ,SAAS;AAAA,UACxB,QAAQ,QAAQ,UAAU,KAAK,QAAQ;AAAA,QACzC;AAAA,MACF,CAAC;AAAA,MACL,aACE,CAAC,IAAI,YACL,CAAC,EAAE,OAAO,IAAI,SAAS,MAAM;AAC3B,cAAM,QAAQ,kBAAkB,MAAM,KAAK,KAAK,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AAC7E,YAAI,CAAC,MAAO,QAAO;AACnB,YAAI,UAAU;AACZ,aAAG,cAAc,MAAM,KAAK,QAAW;AAAA,YACrC,GAAG,MAAM,KAAK;AAAA,YACd,GAAI,QAAQ,SAAS,SAAY,EAAE,MAAM,mBAAmB,QAAQ,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,YACpF,GAAI,QAAQ,UAAU,SAAY,EAAE,OAAO,QAAQ,MAAM,IAAI,CAAC;AAAA,YAC9D,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;AAAA,UACnE,CAAC;AAAA,QACH;AACA,eAAO;AAAA,MACT;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,cAAc;AACZ,WAAO,oBAAoB,KAAK,QAAQ,UAAU,CAAC,SAAS,eAAe,MAAM,KAAK,OAAO,CAAC;AAAA,EAChG;AAAA,EAEA,wBAAwB;AACtB,UAAM,EAAE,KAAK,IAAI;AACjB,UAAM,EAAE,WAAW,IAAI,KAAK;AAC5B,WAAO;AAAA,MACL,IAAIC,QAAO;AAAA,QACT,KAAK;AAAA,QACL,mBAAmB,CAAC,cAAc,WAAW,aAAa;AACxD,cAAI,CAAC,aAAa,KAAK,CAAC,OAAO,GAAG,UAAU,EAAG,QAAO;AACtD,cAAI,CAAC,mBAAmB,cAAc,CAAC,IAAI,CAAC,EAAG,QAAO;AACtD,iBAAO,aAAa,UAAU,MAAM,UAAU;AAAA,QAChD;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,iBAAiB;AACf,UAAM,EAAE,WAAW,IAAI,KAAK;AAC5B,uBAAmB,KAAK,QAAQ,CAAC,UAAU,aAAa,OAAO,KAAK,MAAM,UAAU,CAAC;AAAA,EACvF;AACF,CAAC;;;AElUD,SAAS,QAAAC,OAAM,mBAAAC,wBAAuB;AAM/B,IAAM,kBAAiD,CAAC,QAAQ,UAAU,UAAU;AAEpF,IAAM,uBAAuB;AAiC7B,SAAS,yBAAyB,QAA+B;AACtE,MAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,QAAO,CAAC;AACpC,SAAO,OACJ,MAAM,GAAG,oBAAoB,EAC7B,IAAI,CAAC,MAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI,IAAK;AACxE;AAEA,SAAS,WAAW,MAAmC;AACrD,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,MAAI;AACF,WAAO,yBAAyB,KAAK,MAAM,IAAI,CAAC;AAAA,EAClD,QAAQ;AACN,WAAO,yBAAyB,KAAK,MAAM,QAAQ,EAAE,OAAO,OAAO,EAAE,IAAI,MAAM,CAAC;AAAA,EAClF;AACF;AAEA,IAAM,aAAa,CAAC,MAAqB,UAAkB,QAAgB;AACzE,QAAM,IAAI,SAAS,OAAO,MAAM,OAAO,IAAI;AAC3C,SAAO,OAAO,SAAS,CAAC,KAAK,KAAK,KAAK,KAAK,MAAM,IAAI;AACxD;AAGO,SAAS,eAAe,MAA+B;AAC5D,MAAI,KAAK,MAAM,MAAO,QAAO,KAAK,MAAM;AACxC,QAAM,UAAW,KAAK,MAAM,OAAwB,OAAO,CAAC,MAAmB,MAAM,IAAI;AACzF,SAAO,QAAQ,SAAS,cAAc,QAAQ,CAAC,CAAC,OAAO,QAAQ,QAAQ,SAAS,CAAC,CAAC,KAAK;AACzF;AAOO,IAAM,YAAYC,MAAK,OAA6B;AAAA,EACzD,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,YAAY;AAAA,EAEZ,aAAa;AACX,WAAO,EAAE,gBAAgB,CAAC,GAAG,OAAO,WAAW,eAAe,UAAU;AAAA,EAC1E;AAAA,EAEA,gBAAgB;AACd,WAAO;AAAA,MACL,QAAQ;AAAA,QACN,SAAS,CAAC;AAAA,QACV,WAAW,CAAC,YAAyB,WAAW,QAAQ,aAAa,aAAa,CAAC;AAAA,QACnF,YAAY,CAAC,gBAAqC,EAAE,eAAe,KAAK,UAAU,WAAW,UAAU,CAAC,CAAC,EAAE;AAAA,MAC7G;AAAA,MACA,MAAM;AAAA,QACJ,SAAS;AAAA,QACT,WAAW,CAAC,YAAyB;AACnC,gBAAM,OAAO,QAAQ,aAAa,WAAW;AAC7C,iBAAO,gBAAgB,SAAS,IAAI,IAAI,OAAO;AAAA,QACjD;AAAA,QACA,YAAY,CAAC,gBAAqC,EAAE,aAAa,WAAW,KAAK;AAAA,MACnF;AAAA,MACA,OAAO;AAAA,QACL,SAAS;AAAA,QACT,WAAW,CAAC,YAAyB,WAAW,QAAQ,aAAa,YAAY,GAAG,IAAI,GAAI;AAAA,QAC5F,YAAY,CAAC,gBAAqC,EAAE,cAAc,OAAO,WAAW,KAAK,EAAE;AAAA,MAC7F;AAAA,MACA,QAAQ;AAAA,QACN,SAAS;AAAA,QACT,WAAW,CAAC,YAAyB,WAAW,QAAQ,aAAa,aAAa,GAAG,IAAI,GAAG;AAAA,QAC5F,YAAY,CAAC,gBAAqC,EAAE,eAAe,OAAO,WAAW,MAAM,EAAE;AAAA,MAC/F;AAAA,MACA,OAAO;AAAA,QACL,SAAS;AAAA,QACT,WAAW,CAAC,YAAyB,QAAQ,aAAa,YAAY,KAAK;AAAA,QAC3E,YAAY,CAAC,eAAqC,WAAW,QAAQ,EAAE,cAAc,WAAW,MAAM,IAAI,CAAC;AAAA,MAC7G;AAAA,MACA,OAAO;AAAA,QACL,SAAS;AAAA,QACT,WAAW,CAAC,YAAyB,QAAQ,aAAa,YAAY,KAAK;AAAA,QAC3E,YAAY,CAAC,eAAqC,WAAW,QAAQ,EAAE,cAAc,WAAW,MAAM,IAAI,CAAC;AAAA,MAC7G;AAAA,IACF;AAAA,EACF;AAAA,EAEA,YAAY;AACV,WAAO,CAAC,EAAE,KAAK,+BAA+B,UAAU,GAAG,CAAC;AAAA,EAC9D;AAAA,EAEA,WAAW,EAAE,MAAM,eAAe,GAAG;AACnC,UAAM,QAAQ,gBAAgB,KAAK,MAAM,QAAQ;AAAA,MAC/C,MAAM,KAAK,MAAM;AAAA,MACjB,OAAO,KAAK,MAAM;AAAA,MAClB,QAAQ,KAAK,MAAM;AAAA,MACnB,OAAO,KAAK,MAAM,SAAS,KAAK,QAAQ;AAAA,MACxC,eAAe,KAAK,QAAQ;AAAA,IAC9B,CAAC;AACD,UAAM,MAAM,oBAAoB,OAAO;AAAA,MACrC,WAAW,eAAe,IAAI;AAAA,MAC9B,OAAO,EAAE,OAAO,gDAAgD;AAAA,IAClE,CAAC;AACD,WAAO;AAAA,MACL;AAAA,MACAC,iBAAgB,KAAK,QAAQ,gBAAgB,gBAAgB;AAAA,QAC3D,aAAa;AAAA,QACb,OAAO;AAAA,MACT,CAAC;AAAA,MACD;AAAA,IACF;AAAA,EACF;AAAA,EAEA,WAAW,EAAE,KAAK,GAAG;AACnB,WAAO,IAAI,eAAe,IAAI,CAAC;AAAA,EACjC;AAAA,EAEA,aAAa;AACX,WAAO;AAAA,MACL,UAAU;AAAA,QACR,UAAU,OAAY,MAAuB;AAC3C,gBAAM,OAAO,CAAC,MAAc,UAC1B,UAAU,QAAQ,UAAU,SACxB,KACA,IAAI,IAAI,KAAK,OAAO,KAAK,EAAE,QAAQ,MAAM,OAAO,EAAE,QAAQ,MAAM,QAAQ,EAAE,QAAQ,MAAM,MAAM,CAAC;AACrG,gBAAM;AAAA,YACJ,8BAA8B,KAAK,eAAe,KAAK,UAAU,KAAK,MAAM,MAAM,CAAC,CAAC,GAAG,KAAK,aAAa,KAAK,MAAM,IAAI,CAAC,GAAG,KAAK,cAAc,KAAK,MAAM,KAAK,CAAC,GAAG,KAAK,eAAe,KAAK,MAAM,MAAM,CAAC,GAAG,KAAK,cAAc,KAAK,MAAM,KAAK,CAAC,GAAG,KAAK,cAAc,KAAK,MAAM,KAAK,CAAC;AAAA,UACzR;AAAA,QACF;AAAA,QACA,OAAO,CAAC;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAc;AACZ,WAAO;AAAA,MACL,iBACE,CAAC,YACD,CAAC,EAAE,SAAS,MACV,SAAS,cAAc;AAAA,QACrB,MAAM,KAAK;AAAA,QACX,OAAO;AAAA,UACL,QAAQ,yBAAyB,QAAQ,MAAM;AAAA,UAC/C,MAAM,QAAQ,QAAQ,gBAAgB,SAAS,QAAQ,IAAI,IAAI,QAAQ,OAAO;AAAA,UAC9E,OAAO,QAAQ,SAAS;AAAA,UACxB,QAAQ,QAAQ,UAAU;AAAA,UAC1B,OAAO,QAAQ,SAAS;AAAA,UACxB,OAAO,QAAQ,SAAS;AAAA,QAC1B;AAAA,MACF,CAAC;AAAA,IACP;AAAA,EACF;AACF,CAAC;;;AC1LD,SAAS,iBAAAC,gBAAe,WAAW,oBAAoB;AAkDhD,IAAM,gBAA4C;AAAA,EACvD,EAAE,QAAQ,eAAe,OAAO,gBAAgB,aAAa,8DAA8D,UAAU,CAAC,SAAS,QAAQ,KAAK,EAAE;AAAA,EAC9J,EAAE,QAAQ,gBAAgB,OAAO,oBAAoB,aAAa,qCAAqC,UAAU,CAAC,OAAO,OAAO,OAAO,EAAE;AAAA,EACzI,EAAE,QAAQ,eAAe,OAAO,oBAAoB,aAAa,qCAAqC,UAAU,CAAC,OAAO,OAAO,OAAO,EAAE;AAAA,EACxI,EAAE,QAAQ,aAAa,OAAO,cAAc,aAAa,8BAA8B,UAAU,CAAC,OAAO,QAAQ,EAAE;AAAA,EACnH,EAAE,QAAQ,mBAAmB,OAAO,sBAAsB,aAAa,6CAA6C,UAAU,CAAC,UAAU,OAAO,QAAQ,QAAQ,EAAE;AAAA,EAClK,EAAE,QAAQ,kBAAkB,OAAO,uBAAuB,aAAa,8CAA8C,UAAU,CAAC,UAAU,OAAO,SAAS,OAAO,EAAE;AAAA,EACnK,EAAE,QAAQ,gBAAgB,OAAO,iBAAiB,aAAa,iCAAiC,UAAU,CAAC,UAAU,QAAQ,EAAE;AAAA,EAC/H,EAAE,QAAQ,eAAe,OAAO,gBAAgB,aAAa,wCAAwC,UAAU,CAAC,SAAS,QAAQ,EAAE;AAAA,EACnI,EAAE,QAAQ,cAAc,OAAO,eAAe,aAAa,uCAAuC,UAAU,CAAC,WAAW,QAAQ,MAAM,EAAE;AAAA,EACxI,EAAE,QAAQ,aAAa,OAAO,cAAc,aAAa,gDAAgD,UAAU,CAAC,WAAW,MAAM,EAAE;AAAA,EACvI,EAAE,QAAQ,mBAAmB,OAAO,qBAAqB,aAAa,mDAAmD,UAAU,CAAC,UAAU,OAAO,IAAI,EAAE;AAAA,EAC3J,EAAE,QAAQ,sBAAsB,OAAO,wBAAwB,aAAa,sDAAsD,UAAU,CAAC,UAAU,UAAU,IAAI,EAAE;AAAA,EACvK,EAAE,QAAQ,oBAAoB,OAAO,sBAAsB,aAAa,wDAAwD,UAAU,CAAC,UAAU,QAAQ,IAAI,EAAE;AAAA,EACnK,EAAE,QAAQ,gBAAgB,OAAO,aAAa,aAAa,sCAAsC,UAAU,CAAC,OAAO,UAAU,EAAE;AAAA,EAC/H,EAAE,QAAQ,oBAAoB,OAAO,iBAAiB,aAAa,0CAA0C,UAAU,CAAC,aAAa,UAAU,EAAE;AAAA,EACjJ,EAAE,QAAQ,oBAAoB,OAAO,qBAAgB,aAAa,wGAAwG,UAAU,CAAC,SAAS,QAAQ,UAAU,OAAO,EAAE;AAAA,EACzN,EAAE,QAAQ,qBAAqB,OAAO,yBAAoB,aAAa,+EAA+E,UAAU,CAAC,WAAW,QAAQ,OAAO,EAAE;AAC/L;AAmBO,IAAM,wBAAqD;AAAA,EAChE,EAAE,IAAI,gBAAgB,QAAQ,gBAAgB,OAAO,gBAAW,OAAO,oBAAoB,OAAO,OAAO;AAAA,EACzG,EAAE,IAAI,eAAe,QAAQ,eAAe,OAAO,gBAAW,OAAO,oBAAoB,OAAO,OAAO;AAAA,EACvG,EAAE,IAAI,aAAa,QAAQ,aAAa,OAAO,cAAS,OAAO,cAAc,OAAO,OAAO;AAAA,EAC3F,EAAE,IAAI,mBAAmB,QAAQ,mBAAmB,OAAO,gBAAW,OAAO,sBAAsB,OAAO,UAAU;AAAA,EACpH,EAAE,IAAI,kBAAkB,QAAQ,kBAAkB,OAAO,gBAAW,OAAO,uBAAuB,OAAO,UAAU;AAAA,EACnH,EAAE,IAAI,gBAAgB,QAAQ,gBAAgB,OAAO,cAAS,OAAO,iBAAiB,OAAO,UAAU;AAAA,EACvG,EAAE,IAAI,cAAc,QAAQ,cAAc,OAAO,SAAS,OAAO,eAAe,OAAO,QAAQ;AAAA,EAC/F,EAAE,IAAI,aAAa,QAAQ,aAAa,OAAO,SAAS,OAAO,cAAc,OAAO,QAAQ;AAAA,EAC5F,EAAE,IAAI,mBAAmB,QAAQ,mBAAmB,OAAO,cAAc,OAAO,qBAAqB,OAAO,WAAW,QAAQ,CAAC,MAAM,EAAE,UAAU;AAAA,EAClJ,EAAE,IAAI,sBAAsB,QAAQ,sBAAsB,OAAO,cAAc,OAAO,wBAAwB,OAAO,WAAW,QAAQ,CAAC,MAAM,EAAE,aAAa;AAAA,EAC9J,EAAE,IAAI,oBAAoB,QAAQ,oBAAoB,OAAO,eAAe,OAAO,sBAAsB,OAAO,WAAW,QAAQ,CAAC,MAAM,EAAE,WAAW;AAAA,EACvJ,EAAE,IAAI,aAAa,QAAQ,oBAAoB,QAAQ,EAAE,OAAO,OAAO,GAAG,OAAO,QAAQ,OAAO,mBAAmB,OAAO,SAAS,QAAQ,CAAC,MAAM,EAAE,kBAAkB,OAAO;AAAA,EAC7K,EAAE,IAAI,eAAe,QAAQ,oBAAoB,QAAQ,EAAE,OAAO,SAAS,GAAG,OAAO,UAAU,OAAO,qBAAqB,OAAO,SAAS,QAAQ,CAAC,MAAM,EAAE,kBAAkB,SAAS;AAAA,EACvL,EAAE,IAAI,cAAc,QAAQ,oBAAoB,QAAQ,EAAE,OAAO,QAAQ,GAAG,OAAO,SAAS,OAAO,oBAAoB,OAAO,SAAS,QAAQ,CAAC,MAAM,EAAE,kBAAkB,QAAQ;AAAA,EAClL,EAAE,IAAI,eAAe,QAAQ,eAAe,OAAO,gBAAgB,OAAO,gBAAgB,OAAO,QAAQ;AAC3G;AAEO,IAAM,iBAAiB;AACvB,IAAM,oBAAoB;AAEjC,IAAM,OAAO,CAAC,WAAwD,CAAC,CAAC,UAAU,CAAC,OAAO;AAGnF,SAAS,eAAe,QAA4C;AACzE,SAAO,KAAK,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO,MAAM,SAAS,CAAC,CAAC,OAAO,OAAO,MAAM;AAC9E;AAGO,SAAS,mBAAmB,OAA6B;AAC9D,MAAI,CAAC,MAAM,OAAO,MAAM,MAAO,QAAO;AACtC,SAAO,MAAM,qBAAqBC,kBAAiB,UAAU,KAAK;AACpE;AAMO,SAAS,0BAA0B,EAAE,QAAQ,MAAM,GAAoD;AAC5G,SAAO,OAAO,cAAc,mBAAmB,KAAK;AACtD;AAEA,IAAM,QAAQ,CAAC,OAAgB,KAAa,QAC1C,OAAO,UAAU,YAAY,OAAO,UAAU,KAAK,KAAK,SAAS,OAAO,SAAS;AAEnF,IAAM,MAAM,CAAC,QAAgB,QAAsC;AACjE,MAAI;AACF,WAAO,CAAC,CAAC,IAAI,OAAO,IAAI,EAAE,MAAM,CAAC,EAAE,IAAI;AAAA,EACzC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAMO,SAAS,oBACd,QACA,QACA,SAA4B,CAAC,GACd;AACf,MAAI,CAAC,KAAK,MAAM,EAAG,QAAO;AAC1B,MAAI,CAAC,eAAe,MAAM,EAAG,QAAO;AACpC,MAAI,CAAC,OAAO,WAAY,QAAO;AAC/B,QAAM,QAAQ,OAAO;AACrB,QAAM,UAAU,mBAAmB,KAAK;AAExC,MAAI,WAAW,eAAe;AAC5B,QAAI,QAAS,QAAO;AACpB,QAAI,OAAO,SAAS,UAAa,CAAC,MAAM,OAAO,MAAM,GAAG,cAAc,GAAG;AACvE,aAAO,yCAAyC,cAAc;AAAA,IAChE;AACA,QAAI,OAAO,SAAS,UAAa,CAAC,MAAM,OAAO,MAAM,GAAG,iBAAiB,GAAG;AAC1E,aAAO,4CAA4C,iBAAiB;AAAA,IACtE;AACA,WAAO,IAAI,QAAQ,CAAC,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC,IAAI,OAAO;AAAA,EAC1E;AAEA,MAAI,CAAC,QAAS,QAAO;AAErB,UAAQ,QAAQ;AAAA,IACd,KAAK;AAAA,IACL,KAAK,aAAa;AAChB,UAAI,sBAAsB,MAAM,GAAG;AACjC,eAAO,GAAG,WAAW,eAAe,YAAY,WAAW;AAAA,MAC7D;AACA,UAAI,WAAW,cAAc;AAC3B,eAAO,IAAI,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,OAAO;AAAA,MACrD;AACA,aAAO,IAAI,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,OAAO;AAAA,IACpD;AAAA,IACA,KAAK;AAAA,IACL,KAAK,gBAAgB;AAEnB,YAAM,OAAO,aAAa,KAAK;AAC/B,YAAM,MAAM,WAAW,cACnB,KAAK,QAAQ,KAAK,KAAK,WAAW,KAAK,IAAI,SAC3C,KAAK,SAAS,KAAK,KAAK,UAAU,KAAK,IAAI;AAC/C,YAAM,OAAO,WAAW,cAAc,SAAS;AAC/C,UAAI,OAAO,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAG,QAAO,qBAAqB,IAAI;AAC7E,aAAO;AAAA,IACT;AAAA,IACA,KAAK;AACH,aAAO,IAAI,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,IAAI,OAAO;AAAA,IACvD,KAAK;AACH,aAAO,IAAI,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC,IAAI,OAAO;AAAA,IAC3D,KAAK;AACH,UAAI,OAAO,UAAU,UAAa,OAAO,UAAU,QAAQ,CAAC,4BAA4B,OAAO,KAAK,GAAG;AACrG,eAAO;AAAA,MACT;AACA,UAAI,CAAC,OAAO,OAAO,MAAM,WAAW,KAAK,OAAO,MAAO,QAAO;AAC9D,aAAO;AAAA,IACT,KAAK;AACH,UAAI,OAAO,UAAU,UAAa,OAAO,UAAU,QAAQ,CAAC,wBAAwB,OAAO,KAAK,GAAG;AACjG,eAAO;AAAA,MACT;AACA,UAAI,CAAC,OAAO,OAAO,MAAM,WAAW,KAAK,OAAO,gBAAiB,QAAO;AACxE,aAAO;AAAA,IACT;AACE,aAAO,IAAI,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,IAAI,OAAO;AAAA,EACpD;AACF;AAWO,SAAS,eACd,QACA,QACA,SAA4B,CAAC,GAC7B,UAAiC,CAAC,GACzB;AACT,MAAI,oBAAoB,QAAQ,QAAQ,MAAM,MAAM,KAAM,QAAO;AACjE,QAAM,KAAK;AACX,MAAI,QAAa,GAAG,MAAM;AAC1B,MAAI,QAAQ,MAAO,SAAQ,MAAM,MAAM;AACvC,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,cAAQ,MAAM,YAAY;AAAA,QACxB,MAAM,OAAO,QAAQ;AAAA,QACrB,MAAM,OAAO,QAAQ;AAAA,QACrB,eAAe,OAAO,iBAAiB;AAAA,MACzC,CAAC;AACD;AAAA,IACF,KAAK;AACH,cAAQ,MAAM,iBAAiB,SAAS,4BAA4B,OAAO,KAAK,CAAC;AACjF;AAAA,IACF,KAAK;AACH,cAAQ,MAAM,iBAAiB,mBAAmB,wBAAwB,OAAO,KAAK,CAAC;AACvF;AAAA,IACF;AACE,cAAQ,MAAM,MAAM,EAAE;AAAA,EAC1B;AACA,SAAO,CAAC,CAAC,MAAM,IAAI;AACrB;AAkCA,IAAM,aAAa,OAAO;AAAA,EACxB,cAAc,IAAI,CAAC,EAAE,OAAO,MAAM,CAAC,QAAQ,EAAE,SAAS,OAAO,QAAQ,+BAA+B,CAAC,CAAC;AACxG;AAEO,IAAM,oBAAgC,OAAO,OAAO;AAAA,EACzD,SAAS;AAAA,EACT,SAAS;AAAA,EACT,eAAe;AAAA,EACf,MAAM;AAAA,EACN,SAAS;AAAA,EACT,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,eAAe;AAAA,EACf,gBAAgB;AAAA,EAChB,SAAS;AACX,CAAC;AAGM,SAAS,cAAc,QAA+C;AAC3E,MAAI,CAAC,KAAK,MAAM,EAAG,QAAO;AAC1B,QAAM,UAAU,OAAO;AAAA,IACrB,cAAc,IAAI,CAAC,EAAE,OAAO,MAAM;AAChC,YAAM,SAAS,oBAAoB,QAAQ,MAAM;AACjD,aAAO,CAAC,QAAQ,WAAW,OAAO,EAAE,SAAS,KAAK,IAAI,EAAE,SAAS,OAAO,QAAQ,OAAO,CAAC;AAAA,IAC1F,CAAC;AAAA,EACH;AACA,QAAM,QAAQ,OAAO;AACrB,QAAM,OAAmB,EAAE,GAAG,mBAAmB,SAAS,eAAe,MAAM,GAAG,QAAQ;AAC1F,MAAI,CAAC,KAAK,WAAW,CAAC,mBAAmB,KAAK,EAAG,QAAO;AACxD,MAAI;AACF,UAAM,OAAO,aAAa,KAAK;AAC/B,UAAM,EAAE,KAAK,MAAM,IAAI;AACvB,UAAM,SAAS,CAAC,KAAa,QAAgB,MAAM,OAAO,IAAI,IAAI,MAAM,IAAI,QAAQ,GAAG,CAAC;AACxF,UAAM,aAAa,CAAC,cAClB,UAAU,SAAS,KAAK,UAAU,MAAM,CAAC,QAAQ,MAAM,OAAO,GAAG,GAAG,KAAK,SAAS,aAAa;AACjG,UAAM,WAAW,IAAI,YAAY,EAAE,MAAM,GAAG,OAAO,IAAI,OAAO,KAAK,GAAG,QAAQ,EAAE,CAAC;AACjF,UAAM,cAAc,IAAI,YAAY,EAAE,MAAM,GAAG,OAAO,GAAG,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC;AACrF,UAAM,OAAO,OAAO,KAAK,KAAK,KAAK,IAAI;AACvC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,SAAS;AAAA,MACT,eAAe,MAAM,qBAAqBA;AAAA,MAC1C,MAAM,IAAI;AAAA,MACV,SAAS,IAAI;AAAA,MACb,KAAK,KAAK;AAAA,MACV,QAAQ,KAAK;AAAA,MACb,WAAW,WAAW,QAAQ;AAAA,MAC9B,cAAc,WAAW,WAAW;AAAA,MACpC,YAAY,MAAM,KAAK,SAAS;AAAA,MAChC,eAAe,4BAA4B,MAAM,MAAM,KAAK;AAAA,MAC5D,gBAAgB,wBAAwB,MAAM,MAAM,eAAe;AAAA,IACrE;AAAA,EACF,QAAQ;AACN,WAAO,EAAE,GAAG,MAAM,SAAS,KAAK;AAAA,EAClC;AACF;AAEA,IAAM,WAAW,CAAC,UAAsB,KAAK,UAAU,KAAK;AAcrD,SAAS,iBAAiB,QAA+C;AAC9E,QAAM,YAAY,oBAAI,IAAgB;AACtC,MAAI,WAAW,cAAc,MAAM;AACnC,MAAI,MAAM,SAAS,QAAQ;AAE3B,QAAM,SAAS,MAAM;AACnB,UAAM,OAAO,cAAc,MAAM;AACjC,UAAM,UAAU,SAAS,IAAI;AAC7B,QAAI,YAAY,IAAK;AACrB,eAAW;AACX,UAAM;AACN,cAAU,QAAQ,CAAC,aAAa,SAAS,CAAC;AAAA,EAC5C;AACA,QAAM,SAAS,MAAM;AACnB,YAAQ,IAAI,eAAe,MAAM;AACjC,YAAQ,IAAI,UAAU,MAAM;AAC5B,YAAQ,IAAI,SAAS,MAAM;AAC3B,YAAQ,IAAI,WAAW,MAAM;AAAA,EAC/B;AAEA,SAAO;AAAA,IACL,aAAa,MAAM;AACjB,UAAI,CAAC,UAAU,MAAM;AACnB,cAAM,OAAO,cAAc,MAAM;AACjC,cAAM,UAAU,SAAS,IAAI;AAC7B,YAAI,YAAY,KAAK;AACnB,qBAAW;AACX,gBAAM;AAAA,QACR;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,UAAU,UAAU;AAClB,UAAI,CAAC,UAAU,QAAQ,QAAQ;AAC7B,eAAO;AACP,eAAO,GAAG,eAAe,MAAM;AAE/B,eAAO,GAAG,UAAU,MAAM;AAC1B,eAAO,GAAG,SAAS,MAAM;AACzB,eAAO,GAAG,WAAW,MAAM;AAAA,MAC7B;AACA,gBAAU,IAAI,QAAQ;AACtB,aAAO,MAAM;AACX,kBAAU,OAAO,QAAQ;AACzB,YAAI,CAAC,UAAU,KAAM,QAAO;AAAA,MAC9B;AAAA,IACF;AAAA,IACA,UAAU;AACR,aAAO;AACP,gBAAU,MAAM;AAAA,IAClB;AAAA,EACF;AACF;","names":["skip","exit","Fragment","Fragment","Plugin","PluginKey","PluginKey","Plugin","Node","mergeAttributes","Node","mergeAttributes","CellSelection","CellSelection"]}