@pixerate/editor 0.23.0 → 0.24.0

package/dist/chunk-FODNLX5N.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/compare/diff.ts","../src/compare/documents.ts"],"sourcesContent":["// Portions ported from pdfcraft/crates/compare/src/lib.rs (MIT OR Apache-2.0, © ArtCraft Team and contributors). See THIRD_PARTY_NOTICES.md.\n\n/**\n * Generic sequence diff: common prefix/suffix stripping, Myers' O((N+M)·D)\n * algorithm for small segments and patience anchors (items unique on both\n * sides, longest increasing subsequence) to split long ones. Dependency-free.\n */\n\nexport type DiffOpType = \"equal\" | \"delete\" | \"insert\";\n\n/** A run of consecutive operations of one type. */\nexport interface DiffRun {\n  type: DiffOpType;\n  /** Start index in `a` (for `insert`, where the items go in `a`). */\n  aIndex: number;\n  /** Start index in `b` (for `delete`, where the items were in `b`). */\n  bIndex: number;\n  length: number;\n}\n\n/** A change: a deleted range of `a`, an inserted range of `b`, or both (replaced). */\nexport interface DiffChange {\n  kind: \"inserted\" | \"deleted\" | \"replaced\";\n  aStart: number;\n  aEnd: number;\n  bStart: number;\n  bEnd: number;\n}\n\nexport interface DiffSequencesOptions<T> {\n  /**\n   * Key of an item: items with the same key are equal. Defaults to the item\n   * itself for strings, numbers and booleans, and `JSON.stringify` otherwise.\n   * Keys enable patience anchors for long inputs.\n   */\n  hash?: (item: T) => string | number | boolean;\n  /**\n   * Custom equality. Without `hash`, segments longer than `direct` are only\n   * diffed while the edit distance stays below `direct`, otherwise replaced.\n   */\n  equals?: (a: T, b: T) => boolean;\n  /**\n   * Segments with more items (both sides together) are split at anchors\n   * first so Myers' saved frontiers (O(D²) memory) stay small. Default 3000.\n   */\n  direct?: number;\n  /** Maximum anchor recursion depth before a long segment is replaced whole. Default 8. */\n  maxDepth?: number;\n}\n\nconst EQUAL = 0;\nconst DELETE = 1;\nconst INSERT = 2;\n\ntype Eq = (i: number, j: number) => boolean;\n\nfunction pushRepeat(out: number[], op: number, count: number): void {\n  for (let i = 0; i < count; i++) out.push(op);\n}\n\n/**\n * Myers' diff of a[aLo..aHi) and b[bLo..bHi). Returns false (and emits\n * nothing) when the edit distance exceeds `maxD`.\n */\nfunction myers(\n  aLo: number,\n  aHi: number,\n  bLo: number,\n  bHi: number,\n  eq: Eq,\n  out: number[],\n  maxD: number,\n): boolean {\n  const n = aHi - aLo;\n  const m = bHi - bLo;\n  if (n === 0 || m === 0) {\n    pushRepeat(out, DELETE, n);\n    pushRepeat(out, INSERT, m);\n    return true;\n  }\n  const max = n + m;\n  const off = max + 1;\n  const v = new Int32Array(2 * max + 3);\n  // Frontier d only spans diagonals -d..d: save just that slice.\n  const trace: Int32Array[] = [];\n  const limit = Math.min(max, maxD);\n  let found = false;\n  outer: for (let d = 0; d <= limit; d++) {\n    trace.push(v.slice(Math.max(off - d - 1, 0), off + d + 2));\n    for (let k = -d; k <= d; k += 2) {\n      const i = k + off;\n      let x = k === -d || (k !== d && v[i - 1] < v[i + 1]) ? v[i + 1] : v[i - 1] + 1;\n      let y = x - k;\n      while (x < n && y < m && eq(aLo + x, bLo + y)) {\n        x++;\n        y++;\n      }\n      v[i] = x;\n      if (x >= n && y >= m) {\n        found = true;\n        break outer;\n      }\n    }\n  }\n  if (!found) return false;\n\n  // Walk back through the saved frontiers.\n  const ops: number[] = [];\n  let x = n;\n  let y = m;\n  for (let d = trace.length - 1; d >= 0; d--) {\n    const frontier = trace[d];\n    const base = Math.max(off - d - 1, 0);\n    const at = (k: number) => frontier[k + off - base];\n    const k = x - y;\n    const prevK = k === -d || (k !== d && at(k - 1) < at(k + 1)) ? k + 1 : k - 1;\n    const prevX = at(prevK);\n    const prevY = prevX - prevK;\n    while (x > prevX && y > prevY) {\n      ops.push(EQUAL);\n      x--;\n      y--;\n    }\n    if (d > 0) ops.push(x === prevX ? INSERT : DELETE);\n    x = prevX;\n    y = prevY;\n  }\n  for (let i = ops.length - 1; i >= 0; i--) out.push(ops[i]);\n  return true;\n}\n\n/**\n * Patience anchors: items that occur once on each side, in an order both\n * sides agree on (the longest increasing subsequence of their positions).\n */\nfunction anchors(\n  ids: { a: Int32Array; b: Int32Array },\n  aLo: number,\n  aHi: number,\n  bLo: number,\n  bHi: number,\n): [number, number][] {\n  const count = new Map<number, [number, number, number, number]>();\n  for (let i = aLo; i < aHi; i++) {\n    const id = ids.a[i];\n    const entry = count.get(id);\n    if (entry) {\n      entry[0]++;\n    } else {\n      count.set(id, [1, 0, i, -1]);\n    }\n  }\n  for (let j = bLo; j < bHi; j++) {\n    const entry = count.get(ids.b[j]);\n    if (entry) {\n      entry[1]++;\n      entry[3] = j;\n    }\n  }\n  const pairs: [number, number][] = [];\n  count.forEach((entry) => {\n    if (entry[0] === 1 && entry[1] === 1) pairs.push([entry[2], entry[3]]);\n  });\n  pairs.sort((p, q) => p[0] - q[0]);\n  // LIS on the b positions (patience sorting with back links).\n  const tails: number[] = [];\n  const prev = new Int32Array(pairs.length).fill(-1);\n  for (let k = 0; k < pairs.length; k++) {\n    const y = pairs[k][1];\n    let lo = 0;\n    let hi = tails.length;\n    while (lo < hi) {\n      const mid = (lo + hi) >> 1;\n      if (pairs[tails[mid]][1] < y) lo = mid + 1;\n      else hi = mid;\n    }\n    if (lo > 0) prev[k] = tails[lo - 1];\n    if (lo === tails.length) tails.push(k);\n    else tails[lo] = k;\n  }\n  const result: [number, number][] = [];\n  let k = tails.length ? tails[tails.length - 1] : -1;\n  while (k !== -1) {\n    result.push(pairs[k]);\n    k = prev[k];\n  }\n  return result.reverse();\n}\n\ninterface DiffContext {\n  eq: Eq;\n  ids: { a: Int32Array; b: Int32Array } | null;\n  direct: number;\n  maxDepth: number;\n}\n\nfunction diffRange(\n  ctx: DiffContext,\n  aLo: number,\n  aHi: number,\n  bLo: number,\n  bHi: number,\n  out: number[],\n  depth: number,\n): void {\n  const { eq } = ctx;\n  let prefix = 0;\n  while (aLo + prefix < aHi && bLo + prefix < bHi && eq(aLo + prefix, bLo + prefix)) prefix++;\n  let suffix = 0;\n  while (\n    aHi - suffix > aLo + prefix &&\n    bHi - suffix > bLo + prefix &&\n    eq(aHi - suffix - 1, bHi - suffix - 1)\n  ) {\n    suffix++;\n  }\n  pushRepeat(out, EQUAL, prefix);\n  const ma = aLo + prefix;\n  const mb = bLo + prefix;\n  const ea = aHi - suffix;\n  const eb = bHi - suffix;\n  const replace = () => {\n    pushRepeat(out, DELETE, ea - ma);\n    pushRepeat(out, INSERT, eb - mb);\n  };\n\n  if (ea - ma + (eb - mb) <= ctx.direct) {\n    myers(ma, ea, mb, eb, eq, out, Infinity);\n  } else if (!ctx.ids) {\n    // No keys, so no anchors: bounded Myers, else one replacement.\n    if (!myers(ma, ea, mb, eb, eq, out, ctx.direct)) replace();\n  } else {\n    const found = depth >= ctx.maxDepth ? [] : anchors(ctx.ids, ma, ea, mb, eb);\n    if (found.length === 0) {\n      // A long stretch with nothing unique in common: one replacement.\n      replace();\n    } else {\n      let i = ma;\n      let j = mb;\n      for (const [x, y] of found) {\n        diffRange(ctx, i, x, j, y, out, depth + 1);\n        out.push(EQUAL);\n        i = x + 1;\n        j = y + 1;\n      }\n      diffRange(ctx, i, ea, j, eb, out, depth + 1);\n    }\n  }\n  pushRepeat(out, EQUAL, suffix);\n}\n\nconst defaultHash = (item: unknown): string | number | boolean =>\n  typeof item === \"string\" || typeof item === \"number\" || typeof item === \"boolean\"\n    ? item\n    : JSON.stringify(item);\n\n/**\n * Diffs two sequences and returns the edit script as runs of equal, deleted\n * and inserted items, in order. Within a changed stretch deletions come\n * before insertions. The script is minimal for segments up to `direct`\n * items; longer inputs are split at patience anchors (bounded work).\n */\nexport function diffSequences<T>(\n  a: readonly T[],\n  b: readonly T[],\n  options: DiffSequencesOptions<T> = {},\n): DiffRun[] {\n  const direct = Math.max(2, options.direct ?? 3000);\n  const maxDepth = options.maxDepth ?? 8;\n  let ids: { a: Int32Array; b: Int32Array } | null = null;\n  let eq: Eq;\n  if (options.equals && !options.hash) {\n    const equals = options.equals;\n    eq = (i, j) => equals(a[i], b[j]);\n  } else {\n    const hash = options.hash ?? (defaultHash as (item: T) => string | number | boolean);\n    const table = new Map<string | number | boolean, number>();\n    const idOf = (item: T) => {\n      const key = hash(item);\n      let id = table.get(key);\n      if (id === undefined) {\n        id = table.size;\n        table.set(key, id);\n      }\n      return id;\n    };\n    ids = { a: Int32Array.from(a, idOf), b: Int32Array.from(b, idOf) };\n    const { a: ia, b: ib } = ids;\n    eq = (i, j) => ia[i] === ib[j];\n  }\n\n  const ops: number[] = [];\n  diffRange({ eq, ids, direct, maxDepth }, 0, a.length, 0, b.length, ops, 0);\n\n  // Group into runs, deletions first within each changed stretch.\n  const runs: DiffRun[] = [];\n  const push = (type: DiffOpType, aIndex: number, bIndex: number, length: number) => {\n    if (length === 0) return;\n    const last = runs[runs.length - 1];\n    if (last && last.type === type) {\n      last.length += length;\n    } else {\n      runs.push({ type, aIndex, bIndex, length });\n    }\n  };\n  let i = 0;\n  let j = 0;\n  let k = 0;\n  while (k < ops.length) {\n    if (ops[k] === EQUAL) {\n      let n = 0;\n      while (k < ops.length && ops[k] === EQUAL) {\n        n++;\n        k++;\n      }\n      push(\"equal\", i, j, n);\n      i += n;\n      j += n;\n      continue;\n    }\n    let dels = 0;\n    let inss = 0;\n    while (k < ops.length && ops[k] !== EQUAL) {\n      if (ops[k] === DELETE) dels++;\n      else inss++;\n      k++;\n    }\n    push(\"delete\", i, j, dels);\n    push(\"insert\", i + dels, j, inss);\n    i += dels;\n    j += inss;\n  }\n  return runs;\n}\n\n/** Groups an edit script into inserted, deleted and replaced ranges. */\nexport function diffChanges<T>(\n  a: readonly T[],\n  b: readonly T[],\n  options: DiffSequencesOptions<T> = {},\n): DiffChange[] {\n  const changes: DiffChange[] = [];\n  let current: DiffChange | null = null;\n  for (const run of diffSequences(a, b, options)) {\n    if (run.type === \"equal\") {\n      current = null;\n      continue;\n    }\n    if (!current) {\n      current = {\n        kind: run.type === \"delete\" ? \"deleted\" : \"inserted\",\n        aStart: run.aIndex,\n        aEnd: run.aIndex,\n        bStart: run.bIndex,\n        bEnd: run.bIndex,\n      };\n      changes.push(current);\n    }\n    if (run.type === \"delete\") {\n      current.aEnd = run.aIndex + run.length;\n    } else {\n      current.bEnd = run.bIndex + run.length;\n    }\n    if (current.aEnd > current.aStart && current.bEnd > current.bStart) current.kind = \"replaced\";\n  }\n  return changes;\n}\n","// Portions ported from wordcraft/crates/engine/src/cmd/tools.rs (MIT OR Apache-2.0, © ArtCraft Team and contributors). See THIRD_PARTY_NOTICES.md.\n\nimport { createDocument } from \"@tiptap/core\";\nimport {\n  Fragment,\n  Mark as ProsemirrorMark,\n  type MarkType,\n  type Node as ProsemirrorNode,\n  type Schema,\n} from \"@tiptap/pm/model\";\nimport {\n  BLOCK_CHANGE_ATTRIBUTE,\n  DELETION_MARK_NAME,\n  FORMAT_CHANGE_MARK_NAME,\n  INSERTION_MARK_NAME,\n  getTrackedChanges,\n  resolveTrackedChanges,\n  type TrackedBlockChangeAttributes,\n  type TrackedBlockOperation,\n  type TrackedBlockSnapshot,\n  type TrackedChangeAttributes,\n  type TrackedMark,\n} from \"../extensions/track-changes\";\nimport { createReviewId, type ReviewAuthor } from \"../extensions/comment-store\";\nimport { diffSequences } from \"./diff\";\n\n/** A document to compare: a ProseMirror node, its JSON, or HTML (needs a DOM). */\nexport type CompareSource = ProsemirrorNode | Record<string, any> | string;\n\nexport interface CompareDocumentsOptions {\n  /** Schema of the documents. Required unless both sources are ProseMirror nodes. */\n  schema?: Schema;\n  /** Author recorded on every change. Default `{ id: \"compare\", name: \"Compare\" }`. */\n  author?: ReviewAuthor;\n  /** Time recorded on every change (`createdAt`). Default now. */\n  date?: number | Date | string;\n  /** Compare changed paragraphs word by word (default) or character by character. */\n  granularity?: \"word\" | \"char\";\n  /** Treat text differing only in case as equal (the revised text is kept). */\n  ignoreCase?: boolean;\n  /** Treat runs of white space as equal (the revised text is kept). */\n  ignoreWhitespace?: boolean;\n  /** Record formatting differences of equal text as `formatChange` marks. Default `true`. */\n  formatting?: boolean;\n  /** Change id generator. */\n  generateId?: () => string;\n  /** Marks not compared as formatting (in addition to review marks, comments and bookmarks). */\n  ignoredMarks?: string[];\n  /** Node attributes ignored when comparing blocks. Default `[\"id\"]`. */\n  ignoredBlockAttributes?: string[];\n  /**\n   * Paragraphs longer than this (in characters) are compared by words even\n   * at `granularity: \"char\"`. Default 2000.\n   */\n  maxCharDiff?: number;\n}\n\nexport interface CompareSummary {\n  /** Inserted text runs and inserted block runs. */\n  insertions: number;\n  /** Deleted text runs and deleted block runs. */\n  deletions: number;\n  /** Formatting changes of equal text. */\n  formatChanges: number;\n  /** Block type, attribute and wrapping changes. */\n  blockChanges: number;\n  /** Differences the result could not represent as tracked changes. */\n  notHonoured: string[];\n}\n\nexport interface CompareDocumentsResult {\n  /**\n   * The revised document with the differences as tracked changes: accepting\n   * all changes yields the revised document, rejecting all the original.\n   */\n  doc: ProsemirrorNode;\n  summary: CompareSummary;\n}\n\n/** Marks that are never compared as formatting. */\nconst REVIEW_MARK_NAMES = new Set([\n  INSERTION_MARK_NAME,\n  DELETION_MARK_NAME,\n  FORMAT_CHANGE_MARK_NAME,\n  \"comment\",\n  \"bookmark\",\n]);\n\n/** Container types that pair with each other (a list whose type changed). */\nconst LIST_TYPES = new Set([\"bulletList\", \"orderedList\"]);\n\nconst OBJECT_REPLACEMENT = \"\";\n\ntype Wrapper = TrackedBlockSnapshot[\"wrappers\"][number];\n\ninterface Unit {\n  /** One code point, or \"\" for an inline leaf node. */\n  text: string;\n  node: ProsemirrorNode | null;\n  marks: readonly ProsemirrorMark[];\n}\n\ninterface Context {\n  schema: Schema;\n  author: ReviewAuthor;\n  createdAt: number;\n  generateId: () => string;\n  granularity: \"word\" | \"char\";\n  ignoreCase: boolean;\n  ignoreWhitespace: boolean;\n  formatting: boolean;\n  maxCharDiff: number;\n  ignoredMarks: Set<string>;\n  ignoredAttributes: Set<string>;\n  insertion?: MarkType;\n  deletion?: MarkType;\n  format?: MarkType;\n  notes: Set<string>;\n  keys: Map<ProsemirrorNode, string>;\n  /** Shared change of the textblocks inside a container whose type changed. */\n  wrapperChange: (() => TrackedChangeAttributes) | null;\n}\n\nfunction stableStringify(value: unknown): string {\n  if (value === undefined) return \"null\";\n  if (value === null || typeof value !== \"object\") return JSON.stringify(value);\n  if (Array.isArray(value)) return `[${value.map(stableStringify).join(\",\")}]`;\n  const keys = Object.keys(value as object).sort();\n  return `{${keys\n    .map((key) => `${JSON.stringify(key)}:${stableStringify((value as any)[key])}`)\n    .join(\",\")}}`;\n}\n\nfunction toTime(date: CompareDocumentsOptions[\"date\"]): number {\n  if (date instanceof Date) return date.getTime();\n  if (typeof date === \"string\") {\n    const time = Date.parse(date);\n    return Number.isNaN(time) ? Date.now() : time;\n  }\n  return typeof date === \"number\" ? date : Date.now();\n}\n\nfunction toNode(source: CompareSource, schema: Schema): ProsemirrorNode {\n  if (typeof source === \"string\") return createDocument(source, schema);\n  if (typeof (source as ProsemirrorNode).descendants === \"function\") {\n    const node = source as ProsemirrorNode;\n    return node.type.schema === schema ? node : schema.nodeFromJSON(node.toJSON());\n  }\n  return schema.nodeFromJSON(source);\n}\n\nfunction newAttributes(ctx: Context): TrackedChangeAttributes {\n  return {\n    changeId: ctx.generateId(),\n    authorId: ctx.author.id,\n    authorName: ctx.author.name,\n    authorColor: ctx.author.color ?? null,\n    createdAt: ctx.createdAt,\n  };\n}\n\n/** Lazily created attributes shared by one run of changes. */\nfunction lazyAttributes(ctx: Context): () => TrackedChangeAttributes {\n  let attrs: TrackedChangeAttributes | null = null;\n  return () => (attrs = attrs ?? newAttributes(ctx));\n}\n\nfunction stripBlockChange(attrs: Record<string, any>): Record<string, any> {\n  const copy = { ...attrs };\n  delete copy[BLOCK_CHANGE_ATTRIBUTE];\n  return copy;\n}\n\nfunction wrapperOf(node: ProsemirrorNode): Wrapper {\n  return { type: node.type.name, attrs: stripBlockChange(node.attrs) };\n}\n\nfunction snapshot(node: ProsemirrorNode, wrappers: Wrapper[]): TrackedBlockSnapshot {\n  return { type: node.type.name, attrs: stripBlockChange(node.attrs), wrappers };\n}\n\nfunction filteredAttributes(attrs: Record<string, any>, ctx: Context): string {\n  return stableStringify(\n    Object.fromEntries(\n      Object.entries(attrs ?? {}).filter(\n        ([key]) => key !== BLOCK_CHANGE_ATTRIBUTE && !ctx.ignoredAttributes.has(key),\n      ),\n    ),\n  );\n}\n\n/** Mirrors the tracker's block comparison: type, attributes and wrapper types. */\nfunction sameBlock(a: TrackedBlockSnapshot, b: TrackedBlockSnapshot, ctx: Context): boolean {\n  if (a.type !== b.type) return false;\n  if (filteredAttributes(a.attrs, ctx) !== filteredAttributes(b.attrs, ctx)) return false;\n  if (a.wrappers.length !== b.wrappers.length) return false;\n  return a.wrappers.every((w, i) => w.type === b.wrappers[i].type);\n}\n\nconst hasBlockChange = (node: ProsemirrorNode) =>\n  !!node.type.spec.attrs && BLOCK_CHANGE_ATTRIBUTE in node.type.spec.attrs;\n\nconst label = (node: ProsemirrorNode) => node.type.name;\n\n// ---------------------------------------------------------------------------\n// Keys\n// ---------------------------------------------------------------------------\n\nfunction normalize(text: string, ctx: Context): string {\n  let result = ctx.ignoreWhitespace ? text.replace(/\\s+/g, \" \") : text;\n  if (ctx.ignoreCase) result = result.toLowerCase();\n  return result;\n}\n\nfunction leafKey(node: ProsemirrorNode): string {\n  return `${node.type.name}${stableStringify(stripBlockChange(node.attrs))}`;\n}\n\nfunction group(node: ProsemirrorNode): string {\n  return LIST_TYPES.has(node.type.name) ? \"list\" : node.type.name;\n}\n\n/** Block key: textblocks by their (normalized) text only, so type changes pair up. */\nfunction blockKey(node: ProsemirrorNode, ctx: Context): string {\n  const cached = ctx.keys.get(node);\n  if (cached !== undefined) return cached;\n  let key: string;\n  if (node.isTextblock) {\n    let text = \"\";\n    node.forEach((child) => {\n      text += child.isText ? child.text : `${OBJECT_REPLACEMENT}${leafKey(child)}${OBJECT_REPLACEMENT}`;\n    });\n    text = normalize(text, ctx);\n    key = `T\\u0000${ctx.ignoreWhitespace ? text.trim() : text}`;\n  } else if (node.isLeaf) {\n    key = `A\\u0000${leafKey(node)}`;\n  } else {\n    const parts: string[] = [];\n    node.forEach((child) => parts.push(blockKey(child, ctx)));\n    key = `C\\u0000${group(node)}\\u0000${parts.join(\"\\u0001\")}\\u0002`;\n  }\n  ctx.keys.set(node, key);\n  return key;\n}\n\nfunction compatible(a: ProsemirrorNode, b: ProsemirrorNode): boolean {\n  if (a.isTextblock || b.isTextblock) return a.isTextblock && b.isTextblock;\n  if (a.isLeaf || b.isLeaf) return a.isLeaf && b.isLeaf && a.type === b.type;\n  return group(a) === group(b);\n}\n\n// ---------------------------------------------------------------------------\n// Whole blocks\n// ---------------------------------------------------------------------------\n\nfunction markInline(\n  content: Fragment,\n  mark: ProsemirrorMark,\n): Fragment {\n  const nodes: ProsemirrorNode[] = [];\n  content.forEach((child) => nodes.push(child.mark(mark.addToSet(child.marks))));\n  return Fragment.from(nodes);\n}\n\n/**\n * A block deleted or inserted as a whole: every textblock inside gets a\n * `blockChange` record with the operation (one change id per run).\n */\nfunction wholeBlock(\n  node: ProsemirrorNode,\n  operation: TrackedBlockOperation,\n  wrappers: Wrapper[],\n  attrs: () => TrackedChangeAttributes,\n  ctx: Context,\n): ProsemirrorNode[] {\n  const verb = operation === \"insert\" ? \"Inserted\" : \"Deleted\";\n  if (node.isTextblock) {\n    if (hasBlockChange(node)) {\n      const record: TrackedBlockChangeAttributes = {\n        ...attrs(),\n        previous: snapshot(node, wrappers),\n        operation,\n      };\n      return [node.type.create({ ...node.attrs, [BLOCK_CHANGE_ATTRIBUTE]: record }, node.content, node.marks)];\n    }\n    // No block record: fall back to marking the text.\n    const markType = operation === \"insert\" ? ctx.insertion : ctx.deletion;\n    if (markType && node.type.allowsMarkType(markType) && node.content.size > 0) {\n      ctx.notes.add(\n        `${verb} ${label(node)} blocks have no \"${BLOCK_CHANGE_ATTRIBUTE}\" attribute: only their text is tracked, so an empty block remains when the change is ${operation === \"insert\" ? \"rejected\" : \"accepted\"}.`,\n      );\n      return [node.type.create(node.attrs, markInline(node.content, markType.create(attrs())), node.marks)];\n    }\n    ctx.notes.add(`${verb} ${label(node)} blocks cannot be tracked.`);\n    return operation === \"insert\" ? [node] : [];\n  }\n  if (node.isLeaf) {\n    ctx.notes.add(`${verb} ${label(node)} blocks cannot be tracked.`);\n    return operation === \"insert\" ? [node] : [];\n  }\n  const inner = [...wrappers, wrapperOf(node)];\n  const children: ProsemirrorNode[] = [];\n  node.forEach((child) => children.push(...wholeBlock(child, operation, inner, attrs, ctx)));\n  try {\n    return [node.type.createChecked(node.attrs, children, node.marks)];\n  } catch {\n    ctx.notes.add(`${verb} ${label(node)} blocks cannot be tracked.`);\n    return operation === \"insert\" ? [node] : [];\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Inline comparison\n// ---------------------------------------------------------------------------\n\nfunction units(node: ProsemirrorNode): Unit[] {\n  const result: Unit[] = [];\n  node.forEach((child) => {\n    if (child.isText) {\n      for (const ch of child.text ?? \"\") result.push({ text: ch, node: null, marks: child.marks });\n    } else {\n      result.push({ text: \"\", node: child, marks: child.marks });\n    }\n  });\n  return result;\n}\n\nconst SPACE = /\\s/u;\nconst WORD = /[\\p{L}\\p{N}\\p{M}_]/u;\n\nconst isSpace = (u: Unit) => !u.node && SPACE.test(u.text);\nconst isWord = (u: Unit) => !u.node && WORD.test(u.text);\n\n/** Token ranges: words, white space runs and single symbols, or characters. */\nfunction tokenize(list: Unit[], chars: boolean): [number, number][] {\n  const tokens: [number, number][] = [];\n  if (chars) {\n    for (let i = 0; i < list.length; i++) tokens.push([i, i + 1]);\n    return tokens;\n  }\n  let i = 0;\n  while (i < list.length) {\n    const start = i;\n    const unit = list[i];\n    if (isSpace(unit)) {\n      while (i < list.length && isSpace(list[i])) i++;\n    } else if (isWord(unit)) {\n      while (i < list.length && isWord(list[i])) i++;\n    } else {\n      i++;\n    }\n    tokens.push([start, i]);\n  }\n  return tokens;\n}\n\ntype Stretch =\n  | { type: \"equal\"; aIndex: number; bIndex: number; length: number }\n  | { type: \"change\"; aFrom: number; aTo: number; bFrom: number; bTo: number };\n\n/**\n * Groups token runs into equal stretches and changes. White space alone\n * between two changes joins them, so \"a b\" → \"x y\" reads as one\n * replacement instead of alternating deletions and insertions.\n */\nfunction stretches(runs: ReturnType<typeof diffSequences>, list: Unit[], tokens: [number, number][]): Stretch[] {\n  const spaceOnly = (bIndex: number, length: number) => {\n    for (let t = bIndex; t < bIndex + length; t++) {\n      const [from, to] = tokens[t];\n      for (let k = from; k < to; k++) if (!isSpace(list[k])) return false;\n    }\n    return true;\n  };\n  const result: Stretch[] = [];\n  runs.forEach((run, index) => {\n    const prev = runs[index - 1];\n    const next = runs[index + 1];\n    const absorbed =\n      run.type === \"equal\" &&\n      prev &&\n      next &&\n      prev.type !== \"equal\" &&\n      next.type !== \"equal\" &&\n      spaceOnly(run.bIndex, run.length);\n    if (run.type === \"equal\" && !absorbed) {\n      result.push({ type: \"equal\", aIndex: run.aIndex, bIndex: run.bIndex, length: run.length });\n      return;\n    }\n    let last = result[result.length - 1];\n    if (!last || last.type !== \"change\") {\n      last = { type: \"change\", aFrom: run.aIndex, aTo: run.aIndex, bFrom: run.bIndex, bTo: run.bIndex };\n      result.push(last);\n    }\n    if (run.type !== \"insert\") last.aTo = run.aIndex + run.length;\n    if (run.type !== \"delete\") last.bTo = run.bIndex + run.length;\n  });\n  return result;\n}\n\nfunction tokenKey(list: Unit[], [from, to]: [number, number], ctx: Context): string {\n  let text = \"\";\n  for (let i = from; i < to; i++) {\n    const unit = list[i];\n    text += unit.node ? `${OBJECT_REPLACEMENT}${leafKey(unit.node)}${OBJECT_REPLACEMENT}` : unit.text;\n  }\n  return normalize(text, ctx);\n}\n\nfunction formattingOf(marks: readonly ProsemirrorMark[], ctx: Context): ProsemirrorMark[] {\n  return marks.filter(\n    (mark) => !REVIEW_MARK_NAMES.has(mark.type.name) && !ctx.ignoredMarks.has(mark.type.name),\n  );\n}\n\nfunction withoutReviewMarks(marks: readonly ProsemirrorMark[]): readonly ProsemirrorMark[] {\n  return marks.filter(\n    (mark) =>\n      mark.type.name !== INSERTION_MARK_NAME &&\n      mark.type.name !== DELETION_MARK_NAME &&\n      mark.type.name !== FORMAT_CHANGE_MARK_NAME,\n  );\n}\n\n/**\n * Merges the inline content of two paired textblocks: equal tokens keep the\n * revised text (with `formatChange` where formatting differs), deleted\n * tokens are re-inserted with the `deletion` mark before inserted tokens.\n */\nfunction mergeInline(\n  original: ProsemirrorNode,\n  revised: ProsemirrorNode,\n  parentType: ProsemirrorNode[\"type\"],\n  ctx: Context,\n): Fragment {\n  const a = units(original);\n  const b = units(revised);\n  let chars = ctx.granularity === \"char\";\n  if (chars && Math.max(a.length, b.length) > ctx.maxCharDiff) {\n    chars = false;\n    ctx.notes.add(\n      `Paragraphs longer than ${ctx.maxCharDiff} characters were compared by words instead of characters.`,\n    );\n  }\n  const ta = tokenize(a, chars);\n  const tb = tokenize(b, chars);\n  const runs = diffSequences(\n    ta.map((t) => tokenKey(a, t, ctx)),\n    tb.map((t) => tokenKey(b, t, ctx)),\n  );\n\n  const format = ctx.formatting && ctx.format && parentType.allowsMarkType(ctx.format) ? ctx.format : null;\n  const out: Unit[] = [];\n  let formatRun: { attrs: TrackedChangeAttributes; key: string } | null = null;\n\n  const emit = (\n    source: Unit[],\n    tokens: [number, number][],\n    from: number,\n    to: number,\n    markType: MarkType,\n  ) => {\n    if (to <= from) return;\n    const mark = markType.create(newAttributes(ctx));\n    for (let k = tokens[from][0]; k < tokens[to - 1][1]; k++) {\n      const unit = source[k];\n      out.push({ ...unit, marks: mark.addToSet(withoutReviewMarks(unit.marks)) });\n    }\n  };\n\n  for (const run of stretches(runs, b, tb)) {\n    if (run.type === \"equal\") {\n      for (let t = 0; t < run.length; t++) {\n        const [aFrom, aTo] = ta[run.aIndex + t];\n        const [bFrom, bTo] = tb[run.bIndex + t];\n        for (let k = bFrom; k < bTo; k++) {\n          const unit = b[k];\n          const before = a[Math.min(aFrom + (k - bFrom), aTo - 1)];\n          const marks = withoutReviewMarks(unit.marks);\n          if (!format) {\n            formatRun = null;\n            out.push({ ...unit, marks });\n            continue;\n          }\n          const oldFormat = formattingOf(before.marks, ctx);\n          const newFormat = formattingOf(unit.marks, ctx);\n          if (ProsemirrorMark.sameSet(oldFormat, newFormat)) {\n            formatRun = null;\n            out.push({ ...unit, marks });\n            continue;\n          }\n          const beforeJSON = oldFormat.map((m) => m.toJSON() as TrackedMark);\n          const afterJSON = newFormat.map((m) => m.toJSON() as TrackedMark);\n          const key = stableStringify([beforeJSON, afterJSON]);\n          if (!formatRun || formatRun.key !== key) formatRun = { attrs: newAttributes(ctx), key };\n          const mark = format.create({ ...formatRun.attrs, before: beforeJSON, after: afterJSON });\n          out.push({ ...unit, marks: mark.addToSet(marks) });\n        }\n      }\n      continue;\n    }\n    formatRun = null;\n    emit(a, ta, run.aFrom, run.aTo, ctx.deletion!);\n    emit(b, tb, run.bFrom, run.bTo, ctx.insertion!);\n  }\n\n  const nodes: ProsemirrorNode[] = [];\n  let i = 0;\n  while (i < out.length) {\n    const unit = out[i];\n    if (unit.node) {\n      nodes.push(unit.node.mark(unit.marks));\n      i++;\n      continue;\n    }\n    let text = unit.text;\n    let j = i + 1;\n    while (j < out.length && !out[j].node && ProsemirrorMark.sameSet(out[j].marks, unit.marks)) {\n      text += out[j].text;\n      j++;\n    }\n    nodes.push(ctx.schema.text(text, unit.marks));\n    i = j;\n  }\n  return Fragment.from(nodes);\n}\n\n// ---------------------------------------------------------------------------\n// Blocks\n// ---------------------------------------------------------------------------\n\nfunction mergeTextblocks(\n  original: ProsemirrorNode,\n  revised: ProsemirrorNode,\n  oPath: Wrapper[],\n  rPath: Wrapper[],\n  ctx: Context,\n): ProsemirrorNode[] {\n  const replaceWhole = () => [\n    ...wholeBlock(original, \"delete\", rPath, lazyAttributes(ctx), ctx),\n    ...wholeBlock(revised, \"insert\", rPath, lazyAttributes(ctx), ctx),\n  ];\n\n  let attrs: Record<string, any> = { ...revised.attrs };\n  const previous = snapshot(original, oPath);\n  if (!sameBlock(previous, snapshot(revised, rPath), ctx)) {\n    if (hasBlockChange(revised)) {\n      // Only the wrappers changed (e.g. bulleted → numbered list): one change per container.\n      const onlyWrappers =\n        ctx.wrapperChange &&\n        sameBlock(previous, { ...snapshot(revised, rPath), wrappers: previous.wrappers }, ctx);\n      const base = onlyWrappers ? ctx.wrapperChange!() : newAttributes(ctx);\n      attrs = { ...attrs, [BLOCK_CHANGE_ATTRIBUTE]: { ...base, previous } };\n    } else {\n      ctx.notes.add(`Block changes to ${label(revised)} blocks cannot be tracked.`);\n    }\n  } else if (BLOCK_CHANGE_ATTRIBUTE in attrs) {\n    attrs[BLOCK_CHANGE_ATTRIBUTE] = null;\n  }\n\n  const type = revised.type;\n  const inlineTracking =\n    !!ctx.insertion &&\n    !!ctx.deletion &&\n    type.allowsMarkType(ctx.insertion) &&\n    type.allowsMarkType(ctx.deletion);\n  if (!inlineTracking) {\n    // e.g. code blocks in a headless schema: equal text keeps the block,\n    // anything else is replaced whole.\n    if (!original.content.eq(revised.content)) return replaceWhole();\n    return [type.create(attrs, revised.content, revised.marks)];\n  }\n  const content = mergeInline(original, revised, type, ctx);\n  if (!type.validContent(content)) {\n    ctx.notes.add(`Changes between ${label(original)} and ${label(revised)} blocks were tracked as whole-block replacements.`);\n    return replaceWhole();\n  }\n  return [type.create(attrs, content, revised.marks)];\n}\n\nfunction mergePair(\n  original: ProsemirrorNode,\n  revised: ProsemirrorNode,\n  oPath: Wrapper[],\n  rPath: Wrapper[],\n  ctx: Context,\n): ProsemirrorNode[] {\n  if (original.isTextblock) return mergeTextblocks(original, revised, oPath, rPath, ctx);\n  const replaceWhole = () => [\n    ...wholeBlock(original, \"delete\", rPath, lazyAttributes(ctx), ctx),\n    ...wholeBlock(revised, \"insert\", rPath, lazyAttributes(ctx), ctx),\n  ];\n  if (original.isLeaf) {\n    return original.eq(revised) ? [revised] : replaceWhole();\n  }\n  if (\n    original.type === revised.type &&\n    filteredAttributes(original.attrs, ctx) !== filteredAttributes(revised.attrs, ctx)\n  ) {\n    ctx.notes.add(`Attribute changes of ${label(revised)} nodes are not tracked.`);\n  }\n  const outer = ctx.wrapperChange;\n  if (original.type !== revised.type) ctx.wrapperChange = lazyAttributes(ctx);\n  let children: ProsemirrorNode[];\n  try {\n    children = compareChildren(\n      original,\n      revised,\n      [...oPath, wrapperOf(original)],\n      [...rPath, wrapperOf(revised)],\n      ctx,\n    );\n  } finally {\n    ctx.wrapperChange = outer;\n  }\n  try {\n    return [revised.type.createChecked(revised.attrs, children, revised.marks)];\n  } catch {\n    ctx.notes.add(`Changes inside ${label(revised)} nodes were tracked as whole-block replacements.`);\n    return replaceWhole();\n  }\n}\n\nfunction compareChildren(\n  original: ProsemirrorNode,\n  revised: ProsemirrorNode,\n  oPath: Wrapper[],\n  rPath: Wrapper[],\n  ctx: Context,\n): ProsemirrorNode[] {\n  const a: ProsemirrorNode[] = [];\n  const b: ProsemirrorNode[] = [];\n  original.forEach((child) => a.push(child));\n  revised.forEach((child) => b.push(child));\n  const runs = diffSequences(a, b, { hash: (node) => blockKey(node, ctx) });\n  const out: ProsemirrorNode[] = [];\n\n  for (let r = 0; r < runs.length; r++) {\n    const run = runs[r];\n    if (run.type === \"equal\") {\n      for (let t = 0; t < run.length; t++) {\n        out.push(...mergePair(a[run.aIndex + t], b[run.bIndex + t], oPath, rPath, ctx));\n      }\n      continue;\n    }\n    // A run of deletions and insertions: the i-th deleted block pairs with\n    // the i-th inserted one when they are alike; the rest are whole.\n    let dels: ProsemirrorNode[] = [];\n    let inss: ProsemirrorNode[] = [];\n    if (run.type === \"delete\") {\n      dels = a.slice(run.aIndex, run.aIndex + run.length);\n      const next = runs[r + 1];\n      if (next?.type === \"insert\") {\n        inss = b.slice(next.bIndex, next.bIndex + next.length);\n        r++;\n      }\n    } else {\n      inss = b.slice(run.bIndex, run.bIndex + run.length);\n    }\n    const deleted = lazyAttributes(ctx);\n    const inserted = lazyAttributes(ctx);\n    for (let x = 0; x < Math.max(dels.length, inss.length); x++) {\n      const del = dels[x];\n      const ins = inss[x];\n      if (del && ins && compatible(del, ins)) {\n        out.push(...mergePair(del, ins, oPath, rPath, ctx));\n        continue;\n      }\n      if (del) out.push(...wholeBlock(del, \"delete\", rPath, deleted, ctx));\n      if (ins) out.push(...wholeBlock(ins, \"insert\", rPath, inserted, ctx));\n    }\n  }\n  return out;\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\nfunction summarize(doc: ProsemirrorNode, notes: Set<string>): CompareSummary {\n  const summary: CompareSummary = {\n    insertions: 0,\n    deletions: 0,\n    formatChanges: 0,\n    blockChanges: 0,\n    notHonoured: [...notes],\n  };\n  getTrackedChanges(doc).forEach((change) => {\n    if (change.type === \"insertion\" || change.block?.operation === \"insert\") summary.insertions++;\n    else if (change.type === \"deletion\" || change.block?.operation === \"delete\") summary.deletions++;\n    else if (change.type === \"format\") summary.formatChanges++;\n    else summary.blockChanges++;\n  });\n  return summary;\n}\n\n/**\n * Compares two documents and returns the revised document with the\n * differences as tracked changes (`insertion`/`deletion`/`formatChange`\n * marks and `blockChange` records), plus a summary.\n *\n * Blocks are matched by their text (Myers diff with patience anchors); in a\n * run of changed blocks the i-th deleted block is paired with the i-th\n * inserted one and compared word by word (or by character), while unpaired\n * blocks are recorded as whole-block insertions/deletions. Equal text is\n * compared for formatting, and type/attribute/wrapping changes become\n * `blockChange` records. Without ignore options, accepting all changes\n * yields the revised document and rejecting all yields the original.\n *\n * The schema needs the `TrackChanges` extension (marks and the\n * `blockChange` attribute). Existing tracked changes in either document are\n * accepted first.\n */\nexport function compareDocuments(\n  original: CompareSource,\n  revised: CompareSource,\n  options: CompareDocumentsOptions = {},\n): CompareDocumentsResult {\n  const schema =\n    options.schema ??\n    (typeof (original as ProsemirrorNode)?.descendants === \"function\"\n      ? (original as ProsemirrorNode).type.schema\n      : typeof (revised as ProsemirrorNode)?.descendants === \"function\"\n        ? (revised as ProsemirrorNode).type.schema\n        : null);\n  if (!schema) throw new Error(\"compareDocuments: `schema` is required for JSON or HTML sources.\");\n\n  const ctx: Context = {\n    schema,\n    author: options.author ?? { id: \"compare\", name: \"Compare\" },\n    createdAt: toTime(options.date),\n    generateId: options.generateId ?? (() => createReviewId(\"change\")),\n    granularity: options.granularity ?? \"word\",\n    ignoreCase: !!options.ignoreCase,\n    ignoreWhitespace: !!options.ignoreWhitespace,\n    formatting: options.formatting !== false,\n    maxCharDiff: options.maxCharDiff ?? 2000,\n    ignoredMarks: new Set(options.ignoredMarks ?? []),\n    ignoredAttributes: new Set(options.ignoredBlockAttributes ?? [\"id\"]),\n    insertion: schema.marks[INSERTION_MARK_NAME],\n    deletion: schema.marks[DELETION_MARK_NAME],\n    format: schema.marks[FORMAT_CHANGE_MARK_NAME],\n    notes: new Set(),\n    keys: new Map(),\n    wrapperChange: null,\n  };\n  if (!ctx.insertion || !ctx.deletion) {\n    throw new Error(\"compareDocuments: the schema needs the TrackChanges extension (insertion/deletion marks).\");\n  }\n  if (ctx.formatting && !ctx.format) {\n    ctx.notes.add(\"Formatting differences cannot be tracked: the schema has no formatChange mark.\");\n  }\n\n  const prepare = (source: CompareSource) => {\n    const doc = toNode(source, schema);\n    if (getTrackedChanges(doc).length === 0) return doc;\n    ctx.notes.add(\"Tracked changes already in the documents were accepted before comparing.\");\n    return resolveTrackedChanges(doc, \"accepted\");\n  };\n  const a = prepare(original);\n  const b = prepare(revised);\n\n  const children = compareChildren(a, b, [], [], ctx);\n  let doc: ProsemirrorNode;\n  try {\n    doc = b.type.createChecked(b.attrs, children, b.marks);\n  } catch {\n    doc = b.type.createAndFill(b.attrs, children, b.marks) ?? b;\n    ctx.notes.add(\"The compared document had to be repaired to fit the schema.\");\n  }\n  return { doc, summary: summarize(doc, ctx.notes) };\n}\n\n/** `compareDocuments` for two HTML strings (needs a DOM, like `setContent`). */\nexport function compareHtml(\n  originalHtml: string,\n  revisedHtml: string,\n  options: CompareDocumentsOptions & { schema: Schema },\n): CompareDocumentsResult {\n  return compareDocuments(originalHtml, revisedHtml, options);\n}\n"],"mappings":";;;;;;;;;;;AAkDA,IAAM,QAAQ;AACd,IAAM,SAAS;AACf,IAAM,SAAS;AAIf,SAAS,WAAW,KAAe,IAAY,OAAqB;AAClE,WAAS,IAAI,GAAG,IAAI,OAAO,IAAK,KAAI,KAAK,EAAE;AAC7C;AAMA,SAAS,MACP,KACA,KACA,KACA,KACA,IACA,KACA,MACS;AACT,QAAM,IAAI,MAAM;AAChB,QAAM,IAAI,MAAM;AAChB,MAAI,MAAM,KAAK,MAAM,GAAG;AACtB,eAAW,KAAK,QAAQ,CAAC;AACzB,eAAW,KAAK,QAAQ,CAAC;AACzB,WAAO;AAAA,EACT;AACA,QAAM,MAAM,IAAI;AAChB,QAAM,MAAM,MAAM;AAClB,QAAM,IAAI,IAAI,WAAW,IAAI,MAAM,CAAC;AAEpC,QAAM,QAAsB,CAAC;AAC7B,QAAM,QAAQ,KAAK,IAAI,KAAK,IAAI;AAChC,MAAI,QAAQ;AACZ,QAAO,UAAS,IAAI,GAAG,KAAK,OAAO,KAAK;AACtC,UAAM,KAAK,EAAE,MAAM,KAAK,IAAI,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;AACzD,aAAS,IAAI,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG;AAC/B,YAAM,IAAI,IAAI;AACd,UAAIA,KAAI,MAAM,CAAC,KAAM,MAAM,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI;AAC7E,UAAIC,KAAID,KAAI;AACZ,aAAOA,KAAI,KAAKC,KAAI,KAAK,GAAG,MAAMD,IAAG,MAAMC,EAAC,GAAG;AAC7C,QAAAD;AACA,QAAAC;AAAA,MACF;AACA,QAAE,CAAC,IAAID;AACP,UAAIA,MAAK,KAAKC,MAAK,GAAG;AACpB,gBAAQ;AACR,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,MAAO,QAAO;AAGnB,QAAM,MAAgB,CAAC;AACvB,MAAI,IAAI;AACR,MAAI,IAAI;AACR,WAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,UAAM,WAAW,MAAM,CAAC;AACxB,UAAM,OAAO,KAAK,IAAI,MAAM,IAAI,GAAG,CAAC;AACpC,UAAM,KAAK,CAACC,OAAc,SAASA,KAAI,MAAM,IAAI;AACjD,UAAM,IAAI,IAAI;AACd,UAAM,QAAQ,MAAM,CAAC,KAAM,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAK,IAAI,IAAI,IAAI;AAC3E,UAAM,QAAQ,GAAG,KAAK;AACtB,UAAM,QAAQ,QAAQ;AACtB,WAAO,IAAI,SAAS,IAAI,OAAO;AAC7B,UAAI,KAAK,KAAK;AACd;AACA;AAAA,IACF;AACA,QAAI,IAAI,EAAG,KAAI,KAAK,MAAM,QAAQ,SAAS,MAAM;AACjD,QAAI;AACJ,QAAI;AAAA,EACN;AACA,WAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,IAAK,KAAI,KAAK,IAAI,CAAC,CAAC;AACzD,SAAO;AACT;AAMA,SAAS,QACP,KACA,KACA,KACA,KACA,KACoB;AACpB,QAAM,QAAQ,oBAAI,IAA8C;AAChE,WAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,UAAM,KAAK,IAAI,EAAE,CAAC;AAClB,UAAM,QAAQ,MAAM,IAAI,EAAE;AAC1B,QAAI,OAAO;AACT,YAAM,CAAC;AAAA,IACT,OAAO;AACL,YAAM,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;AAAA,IAC7B;AAAA,EACF;AACA,WAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,UAAM,QAAQ,MAAM,IAAI,IAAI,EAAE,CAAC,CAAC;AAChC,QAAI,OAAO;AACT,YAAM,CAAC;AACP,YAAM,CAAC,IAAI;AAAA,IACb;AAAA,EACF;AACA,QAAM,QAA4B,CAAC;AACnC,QAAM,QAAQ,CAAC,UAAU;AACvB,QAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAG,OAAM,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAAA,EACvE,CAAC;AACD,QAAM,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAEhC,QAAM,QAAkB,CAAC;AACzB,QAAM,OAAO,IAAI,WAAW,MAAM,MAAM,EAAE,KAAK,EAAE;AACjD,WAASA,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,UAAM,IAAI,MAAMA,EAAC,EAAE,CAAC;AACpB,QAAI,KAAK;AACT,QAAI,KAAK,MAAM;AACf,WAAO,KAAK,IAAI;AACd,YAAM,MAAO,KAAK,MAAO;AACzB,UAAI,MAAM,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,EAAG,MAAK,MAAM;AAAA,UACpC,MAAK;AAAA,IACZ;AACA,QAAI,KAAK,EAAG,MAAKA,EAAC,IAAI,MAAM,KAAK,CAAC;AAClC,QAAI,OAAO,MAAM,OAAQ,OAAM,KAAKA,EAAC;AAAA,QAChC,OAAM,EAAE,IAAIA;AAAA,EACnB;AACA,QAAM,SAA6B,CAAC;AACpC,MAAI,IAAI,MAAM,SAAS,MAAM,MAAM,SAAS,CAAC,IAAI;AACjD,SAAO,MAAM,IAAI;AACf,WAAO,KAAK,MAAM,CAAC,CAAC;AACpB,QAAI,KAAK,CAAC;AAAA,EACZ;AACA,SAAO,OAAO,QAAQ;AACxB;AASA,SAAS,UACP,KACA,KACA,KACA,KACA,KACA,KACA,OACM;AACN,QAAM,EAAE,GAAG,IAAI;AACf,MAAI,SAAS;AACb,SAAO,MAAM,SAAS,OAAO,MAAM,SAAS,OAAO,GAAG,MAAM,QAAQ,MAAM,MAAM,EAAG;AACnF,MAAI,SAAS;AACb,SACE,MAAM,SAAS,MAAM,UACrB,MAAM,SAAS,MAAM,UACrB,GAAG,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,GACrC;AACA;AAAA,EACF;AACA,aAAW,KAAK,OAAO,MAAM;AAC7B,QAAM,KAAK,MAAM;AACjB,QAAM,KAAK,MAAM;AACjB,QAAM,KAAK,MAAM;AACjB,QAAM,KAAK,MAAM;AACjB,QAAM,UAAU,MAAM;AACpB,eAAW,KAAK,QAAQ,KAAK,EAAE;AAC/B,eAAW,KAAK,QAAQ,KAAK,EAAE;AAAA,EACjC;AAEA,MAAI,KAAK,MAAM,KAAK,OAAO,IAAI,QAAQ;AACrC,UAAM,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,QAAQ;AAAA,EACzC,WAAW,CAAC,IAAI,KAAK;AAEnB,QAAI,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,MAAM,EAAG,SAAQ;AAAA,EAC3D,OAAO;AACL,UAAM,QAAQ,SAAS,IAAI,WAAW,CAAC,IAAI,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI,EAAE;AAC1E,QAAI,MAAM,WAAW,GAAG;AAEtB,cAAQ;AAAA,IACV,OAAO;AACL,UAAI,IAAI;AACR,UAAI,IAAI;AACR,iBAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC1B,kBAAU,KAAK,GAAG,GAAG,GAAG,GAAG,KAAK,QAAQ,CAAC;AACzC,YAAI,KAAK,KAAK;AACd,YAAI,IAAI;AACR,YAAI,IAAI;AAAA,MACV;AACA,gBAAU,KAAK,GAAG,IAAI,GAAG,IAAI,KAAK,QAAQ,CAAC;AAAA,IAC7C;AAAA,EACF;AACA,aAAW,KAAK,OAAO,MAAM;AAC/B;AAEA,IAAM,cAAc,CAAC,SACnB,OAAO,SAAS,YAAY,OAAO,SAAS,YAAY,OAAO,SAAS,YACpE,OACA,KAAK,UAAU,IAAI;AAQlB,SAAS,cACd,GACA,GACA,UAAmC,CAAC,GACzB;AACX,QAAM,SAAS,KAAK,IAAI,GAAG,QAAQ,UAAU,GAAI;AACjD,QAAM,WAAW,QAAQ,YAAY;AACrC,MAAI,MAA+C;AACnD,MAAI;AACJ,MAAI,QAAQ,UAAU,CAAC,QAAQ,MAAM;AACnC,UAAM,SAAS,QAAQ;AACvB,SAAK,CAACC,IAAGC,OAAM,OAAO,EAAED,EAAC,GAAG,EAAEC,EAAC,CAAC;AAAA,EAClC,OAAO;AACL,UAAM,OAAO,QAAQ,QAAS;AAC9B,UAAM,QAAQ,oBAAI,IAAuC;AACzD,UAAM,OAAO,CAAC,SAAY;AACxB,YAAM,MAAM,KAAK,IAAI;AACrB,UAAI,KAAK,MAAM,IAAI,GAAG;AACtB,UAAI,OAAO,QAAW;AACpB,aAAK,MAAM;AACX,cAAM,IAAI,KAAK,EAAE;AAAA,MACnB;AACA,aAAO;AAAA,IACT;AACA,UAAM,EAAE,GAAG,WAAW,KAAK,GAAG,IAAI,GAAG,GAAG,WAAW,KAAK,GAAG,IAAI,EAAE;AACjE,UAAM,EAAE,GAAG,IAAI,GAAG,GAAG,IAAI;AACzB,SAAK,CAACD,IAAGC,OAAM,GAAGD,EAAC,MAAM,GAAGC,EAAC;AAAA,EAC/B;AAEA,QAAM,MAAgB,CAAC;AACvB,YAAU,EAAE,IAAI,KAAK,QAAQ,SAAS,GAAG,GAAG,EAAE,QAAQ,GAAG,EAAE,QAAQ,KAAK,CAAC;AAGzE,QAAM,OAAkB,CAAC;AACzB,QAAM,OAAO,CAAC,MAAkB,QAAgB,QAAgB,WAAmB;AACjF,QAAI,WAAW,EAAG;AAClB,UAAM,OAAO,KAAK,KAAK,SAAS,CAAC;AACjC,QAAI,QAAQ,KAAK,SAAS,MAAM;AAC9B,WAAK,UAAU;AAAA,IACjB,OAAO;AACL,WAAK,KAAK,EAAE,MAAM,QAAQ,QAAQ,OAAO,CAAC;AAAA,IAC5C;AAAA,EACF;AACA,MAAI,IAAI;AACR,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,IAAI,IAAI,QAAQ;AACrB,QAAI,IAAI,CAAC,MAAM,OAAO;AACpB,UAAI,IAAI;AACR,aAAO,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,OAAO;AACzC;AACA;AAAA,MACF;AACA,WAAK,SAAS,GAAG,GAAG,CAAC;AACrB,WAAK;AACL,WAAK;AACL;AAAA,IACF;AACA,QAAI,OAAO;AACX,QAAI,OAAO;AACX,WAAO,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,OAAO;AACzC,UAAI,IAAI,CAAC,MAAM,OAAQ;AAAA,UAClB;AACL;AAAA,IACF;AACA,SAAK,UAAU,GAAG,GAAG,IAAI;AACzB,SAAK,UAAU,IAAI,MAAM,GAAG,IAAI;AAChC,SAAK;AACL,SAAK;AAAA,EACP;AACA,SAAO;AACT;AAGO,SAAS,YACd,GACA,GACA,UAAmC,CAAC,GACtB;AACd,QAAM,UAAwB,CAAC;AAC/B,MAAI,UAA6B;AACjC,aAAW,OAAO,cAAc,GAAG,GAAG,OAAO,GAAG;AAC9C,QAAI,IAAI,SAAS,SAAS;AACxB,gBAAU;AACV;AAAA,IACF;AACA,QAAI,CAAC,SAAS;AACZ,gBAAU;AAAA,QACR,MAAM,IAAI,SAAS,WAAW,YAAY;AAAA,QAC1C,QAAQ,IAAI;AAAA,QACZ,MAAM,IAAI;AAAA,QACV,QAAQ,IAAI;AAAA,QACZ,MAAM,IAAI;AAAA,MACZ;AACA,cAAQ,KAAK,OAAO;AAAA,IACtB;AACA,QAAI,IAAI,SAAS,UAAU;AACzB,cAAQ,OAAO,IAAI,SAAS,IAAI;AAAA,IAClC,OAAO;AACL,cAAQ,OAAO,IAAI,SAAS,IAAI;AAAA,IAClC;AACA,QAAI,QAAQ,OAAO,QAAQ,UAAU,QAAQ,OAAO,QAAQ,OAAQ,SAAQ,OAAO;AAAA,EACrF;AACA,SAAO;AACT;;;AC5WA,SAAS,sBAAsB;AAC/B;AAAA,EACE;AAAA,EACA,QAAQ;AAAA,OAIH;AAuEP,IAAM,oBAAoB,oBAAI,IAAI;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,IAAM,aAAa,oBAAI,IAAI,CAAC,cAAc,aAAa,CAAC;AAExD,IAAM,qBAAqB;AAgC3B,SAAS,gBAAgB,OAAwB;AAC/C,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,KAAK,UAAU,KAAK;AAC5E,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,IAAI,MAAM,IAAI,eAAe,EAAE,KAAK,GAAG,CAAC;AACzE,QAAM,OAAO,OAAO,KAAK,KAAe,EAAE,KAAK;AAC/C,SAAO,IAAI,KACR,IAAI,CAAC,QAAQ,GAAG,KAAK,UAAU,GAAG,CAAC,IAAI,gBAAiB,MAAc,GAAG,CAAC,CAAC,EAAE,EAC7E,KAAK,GAAG,CAAC;AACd;AAEA,SAAS,OAAO,MAA+C;AAC7D,MAAI,gBAAgB,KAAM,QAAO,KAAK,QAAQ;AAC9C,MAAI,OAAO,SAAS,UAAU;AAC5B,UAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,WAAO,OAAO,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI;AAAA,EAC3C;AACA,SAAO,OAAO,SAAS,WAAW,OAAO,KAAK,IAAI;AACpD;AAEA,SAAS,OAAO,QAAuB,QAAiC;AACtE,MAAI,OAAO,WAAW,SAAU,QAAO,eAAe,QAAQ,MAAM;AACpE,MAAI,OAAQ,OAA2B,gBAAgB,YAAY;AACjE,UAAM,OAAO;AACb,WAAO,KAAK,KAAK,WAAW,SAAS,OAAO,OAAO,aAAa,KAAK,OAAO,CAAC;AAAA,EAC/E;AACA,SAAO,OAAO,aAAa,MAAM;AACnC;AAEA,SAAS,cAAc,KAAuC;AAC5D,SAAO;AAAA,IACL,UAAU,IAAI,WAAW;AAAA,IACzB,UAAU,IAAI,OAAO;AAAA,IACrB,YAAY,IAAI,OAAO;AAAA,IACvB,aAAa,IAAI,OAAO,SAAS;AAAA,IACjC,WAAW,IAAI;AAAA,EACjB;AACF;AAGA,SAAS,eAAe,KAA6C;AACnE,MAAI,QAAwC;AAC5C,SAAO,MAAO,QAAQ,SAAS,cAAc,GAAG;AAClD;AAEA,SAAS,iBAAiB,OAAiD;AACzE,QAAM,OAAO,EAAE,GAAG,MAAM;AACxB,SAAO,KAAK,sBAAsB;AAClC,SAAO;AACT;AAEA,SAAS,UAAU,MAAgC;AACjD,SAAO,EAAE,MAAM,KAAK,KAAK,MAAM,OAAO,iBAAiB,KAAK,KAAK,EAAE;AACrE;AAEA,SAAS,SAAS,MAAuB,UAA2C;AAClF,SAAO,EAAE,MAAM,KAAK,KAAK,MAAM,OAAO,iBAAiB,KAAK,KAAK,GAAG,SAAS;AAC/E;AAEA,SAAS,mBAAmB,OAA4B,KAAsB;AAC5E,SAAO;AAAA,IACL,OAAO;AAAA,MACL,OAAO,QAAQ,SAAS,CAAC,CAAC,EAAE;AAAA,QAC1B,CAAC,CAAC,GAAG,MAAM,QAAQ,0BAA0B,CAAC,IAAI,kBAAkB,IAAI,GAAG;AAAA,MAC7E;AAAA,IACF;AAAA,EACF;AACF;AAGA,SAAS,UAAU,GAAyB,GAAyB,KAAuB;AAC1F,MAAI,EAAE,SAAS,EAAE,KAAM,QAAO;AAC9B,MAAI,mBAAmB,EAAE,OAAO,GAAG,MAAM,mBAAmB,EAAE,OAAO,GAAG,EAAG,QAAO;AAClF,MAAI,EAAE,SAAS,WAAW,EAAE,SAAS,OAAQ,QAAO;AACpD,SAAO,EAAE,SAAS,MAAM,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,IAAI;AACjE;AAEA,IAAM,iBAAiB,CAAC,SACtB,CAAC,CAAC,KAAK,KAAK,KAAK,SAAS,0BAA0B,KAAK,KAAK,KAAK;AAErE,IAAM,QAAQ,CAAC,SAA0B,KAAK,KAAK;AAMnD,SAAS,UAAU,MAAc,KAAsB;AACrD,MAAI,SAAS,IAAI,mBAAmB,KAAK,QAAQ,QAAQ,GAAG,IAAI;AAChE,MAAI,IAAI,WAAY,UAAS,OAAO,YAAY;AAChD,SAAO;AACT;AAEA,SAAS,QAAQ,MAA+B;AAC9C,SAAO,GAAG,KAAK,KAAK,IAAI,GAAG,gBAAgB,iBAAiB,KAAK,KAAK,CAAC,CAAC;AAC1E;AAEA,SAAS,MAAM,MAA+B;AAC5C,SAAO,WAAW,IAAI,KAAK,KAAK,IAAI,IAAI,SAAS,KAAK,KAAK;AAC7D;AAGA,SAAS,SAAS,MAAuB,KAAsB;AAC7D,QAAM,SAAS,IAAI,KAAK,IAAI,IAAI;AAChC,MAAI,WAAW,OAAW,QAAO;AACjC,MAAI;AACJ,MAAI,KAAK,aAAa;AACpB,QAAI,OAAO;AACX,SAAK,QAAQ,CAAC,UAAU;AACtB,cAAQ,MAAM,SAAS,MAAM,OAAO,GAAG,kBAAkB,GAAG,QAAQ,KAAK,CAAC,GAAG,kBAAkB;AAAA,IACjG,CAAC;AACD,WAAO,UAAU,MAAM,GAAG;AAC1B,UAAM,MAAU,IAAI,mBAAmB,KAAK,KAAK,IAAI,IAAI;AAAA,EAC3D,WAAW,KAAK,QAAQ;AACtB,UAAM,MAAU,QAAQ,IAAI,CAAC;AAAA,EAC/B,OAAO;AACL,UAAM,QAAkB,CAAC;AACzB,SAAK,QAAQ,CAAC,UAAU,MAAM,KAAK,SAAS,OAAO,GAAG,CAAC,CAAC;AACxD,UAAM,MAAU,MAAM,IAAI,CAAC,KAAS,MAAM,KAAK,GAAQ,CAAC;AAAA,EAC1D;AACA,MAAI,KAAK,IAAI,MAAM,GAAG;AACtB,SAAO;AACT;AAEA,SAAS,WAAW,GAAoB,GAA6B;AACnE,MAAI,EAAE,eAAe,EAAE,YAAa,QAAO,EAAE,eAAe,EAAE;AAC9D,MAAI,EAAE,UAAU,EAAE,OAAQ,QAAO,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE;AACtE,SAAO,MAAM,CAAC,MAAM,MAAM,CAAC;AAC7B;AAMA,SAAS,WACP,SACA,MACU;AACV,QAAM,QAA2B,CAAC;AAClC,UAAQ,QAAQ,CAAC,UAAU,MAAM,KAAK,MAAM,KAAK,KAAK,SAAS,MAAM,KAAK,CAAC,CAAC,CAAC;AAC7E,SAAO,SAAS,KAAK,KAAK;AAC5B;AAMA,SAAS,WACP,MACA,WACA,UACA,OACA,KACmB;AACnB,QAAM,OAAO,cAAc,WAAW,aAAa;AACnD,MAAI,KAAK,aAAa;AACpB,QAAI,eAAe,IAAI,GAAG;AACxB,YAAM,SAAuC;AAAA,QAC3C,GAAG,MAAM;AAAA,QACT,UAAU,SAAS,MAAM,QAAQ;AAAA,QACjC;AAAA,MACF;AACA,aAAO,CAAC,KAAK,KAAK,OAAO,EAAE,GAAG,KAAK,OAAO,CAAC,sBAAsB,GAAG,OAAO,GAAG,KAAK,SAAS,KAAK,KAAK,CAAC;AAAA,IACzG;AAEA,UAAM,WAAW,cAAc,WAAW,IAAI,YAAY,IAAI;AAC9D,QAAI,YAAY,KAAK,KAAK,eAAe,QAAQ,KAAK,KAAK,QAAQ,OAAO,GAAG;AAC3E,UAAI,MAAM;AAAA,QACR,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,oBAAoB,sBAAsB,yFAAyF,cAAc,WAAW,aAAa,UAAU;AAAA,MAC3M;AACA,aAAO,CAAC,KAAK,KAAK,OAAO,KAAK,OAAO,WAAW,KAAK,SAAS,SAAS,OAAO,MAAM,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC;AAAA,IACtG;AACA,QAAI,MAAM,IAAI,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,4BAA4B;AAChE,WAAO,cAAc,WAAW,CAAC,IAAI,IAAI,CAAC;AAAA,EAC5C;AACA,MAAI,KAAK,QAAQ;AACf,QAAI,MAAM,IAAI,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,4BAA4B;AAChE,WAAO,cAAc,WAAW,CAAC,IAAI,IAAI,CAAC;AAAA,EAC5C;AACA,QAAM,QAAQ,CAAC,GAAG,UAAU,UAAU,IAAI,CAAC;AAC3C,QAAM,WAA8B,CAAC;AACrC,OAAK,QAAQ,CAAC,UAAU,SAAS,KAAK,GAAG,WAAW,OAAO,WAAW,OAAO,OAAO,GAAG,CAAC,CAAC;AACzF,MAAI;AACF,WAAO,CAAC,KAAK,KAAK,cAAc,KAAK,OAAO,UAAU,KAAK,KAAK,CAAC;AAAA,EACnE,QAAQ;AACN,QAAI,MAAM,IAAI,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,4BAA4B;AAChE,WAAO,cAAc,WAAW,CAAC,IAAI,IAAI,CAAC;AAAA,EAC5C;AACF;AAMA,SAAS,MAAM,MAA+B;AAC5C,QAAM,SAAiB,CAAC;AACxB,OAAK,QAAQ,CAAC,UAAU;AACtB,QAAI,MAAM,QAAQ;AAChB,iBAAW,MAAM,MAAM,QAAQ,GAAI,QAAO,KAAK,EAAE,MAAM,IAAI,MAAM,MAAM,OAAO,MAAM,MAAM,CAAC;AAAA,IAC7F,OAAO;AACL,aAAO,KAAK,EAAE,MAAM,IAAI,MAAM,OAAO,OAAO,MAAM,MAAM,CAAC;AAAA,IAC3D;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,IAAM,QAAQ;AACd,IAAM,OAAO;AAEb,IAAM,UAAU,CAAC,MAAY,CAAC,EAAE,QAAQ,MAAM,KAAK,EAAE,IAAI;AACzD,IAAM,SAAS,CAAC,MAAY,CAAC,EAAE,QAAQ,KAAK,KAAK,EAAE,IAAI;AAGvD,SAAS,SAAS,MAAc,OAAoC;AAClE,QAAM,SAA6B,CAAC;AACpC,MAAI,OAAO;AACT,aAASC,KAAI,GAAGA,KAAI,KAAK,QAAQA,KAAK,QAAO,KAAK,CAACA,IAAGA,KAAI,CAAC,CAAC;AAC5D,WAAO;AAAA,EACT;AACA,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,QAAQ;AACtB,UAAM,QAAQ;AACd,UAAM,OAAO,KAAK,CAAC;AACnB,QAAI,QAAQ,IAAI,GAAG;AACjB,aAAO,IAAI,KAAK,UAAU,QAAQ,KAAK,CAAC,CAAC,EAAG;AAAA,IAC9C,WAAW,OAAO,IAAI,GAAG;AACvB,aAAO,IAAI,KAAK,UAAU,OAAO,KAAK,CAAC,CAAC,EAAG;AAAA,IAC7C,OAAO;AACL;AAAA,IACF;AACA,WAAO,KAAK,CAAC,OAAO,CAAC,CAAC;AAAA,EACxB;AACA,SAAO;AACT;AAWA,SAAS,UAAU,MAAwC,MAAc,QAAuC;AAC9G,QAAM,YAAY,CAAC,QAAgB,WAAmB;AACpD,aAAS,IAAI,QAAQ,IAAI,SAAS,QAAQ,KAAK;AAC7C,YAAM,CAAC,MAAM,EAAE,IAAI,OAAO,CAAC;AAC3B,eAAS,IAAI,MAAM,IAAI,IAAI,IAAK,KAAI,CAAC,QAAQ,KAAK,CAAC,CAAC,EAAG,QAAO;AAAA,IAChE;AACA,WAAO;AAAA,EACT;AACA,QAAM,SAAoB,CAAC;AAC3B,OAAK,QAAQ,CAAC,KAAK,UAAU;AAC3B,UAAM,OAAO,KAAK,QAAQ,CAAC;AAC3B,UAAM,OAAO,KAAK,QAAQ,CAAC;AAC3B,UAAM,WACJ,IAAI,SAAS,WACb,QACA,QACA,KAAK,SAAS,WACd,KAAK,SAAS,WACd,UAAU,IAAI,QAAQ,IAAI,MAAM;AAClC,QAAI,IAAI,SAAS,WAAW,CAAC,UAAU;AACrC,aAAO,KAAK,EAAE,MAAM,SAAS,QAAQ,IAAI,QAAQ,QAAQ,IAAI,QAAQ,QAAQ,IAAI,OAAO,CAAC;AACzF;AAAA,IACF;AACA,QAAI,OAAO,OAAO,OAAO,SAAS,CAAC;AACnC,QAAI,CAAC,QAAQ,KAAK,SAAS,UAAU;AACnC,aAAO,EAAE,MAAM,UAAU,OAAO,IAAI,QAAQ,KAAK,IAAI,QAAQ,OAAO,IAAI,QAAQ,KAAK,IAAI,OAAO;AAChG,aAAO,KAAK,IAAI;AAAA,IAClB;AACA,QAAI,IAAI,SAAS,SAAU,MAAK,MAAM,IAAI,SAAS,IAAI;AACvD,QAAI,IAAI,SAAS,SAAU,MAAK,MAAM,IAAI,SAAS,IAAI;AAAA,EACzD,CAAC;AACD,SAAO;AACT;AAEA,SAAS,SAAS,MAAc,CAAC,MAAM,EAAE,GAAqB,KAAsB;AAClF,MAAI,OAAO;AACX,WAAS,IAAI,MAAM,IAAI,IAAI,KAAK;AAC9B,UAAM,OAAO,KAAK,CAAC;AACnB,YAAQ,KAAK,OAAO,GAAG,kBAAkB,GAAG,QAAQ,KAAK,IAAI,CAAC,GAAG,kBAAkB,KAAK,KAAK;AAAA,EAC/F;AACA,SAAO,UAAU,MAAM,GAAG;AAC5B;AAEA,SAAS,aAAa,OAAmC,KAAiC;AACxF,SAAO,MAAM;AAAA,IACX,CAAC,SAAS,CAAC,kBAAkB,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,aAAa,IAAI,KAAK,KAAK,IAAI;AAAA,EAC1F;AACF;AAEA,SAAS,mBAAmB,OAA+D;AACzF,SAAO,MAAM;AAAA,IACX,CAAC,SACC,KAAK,KAAK,SAAS,uBACnB,KAAK,KAAK,SAAS,sBACnB,KAAK,KAAK,SAAS;AAAA,EACvB;AACF;AAOA,SAAS,YACP,UACA,SACA,YACA,KACU;AACV,QAAM,IAAI,MAAM,QAAQ;AACxB,QAAM,IAAI,MAAM,OAAO;AACvB,MAAI,QAAQ,IAAI,gBAAgB;AAChC,MAAI,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,IAAI,IAAI,aAAa;AAC3D,YAAQ;AACR,QAAI,MAAM;AAAA,MACR,0BAA0B,IAAI,WAAW;AAAA,IAC3C;AAAA,EACF;AACA,QAAM,KAAK,SAAS,GAAG,KAAK;AAC5B,QAAM,KAAK,SAAS,GAAG,KAAK;AAC5B,QAAM,OAAO;AAAA,IACX,GAAG,IAAI,CAAC,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AAAA,IACjC,GAAG,IAAI,CAAC,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AAAA,EACnC;AAEA,QAAM,SAAS,IAAI,cAAc,IAAI,UAAU,WAAW,eAAe,IAAI,MAAM,IAAI,IAAI,SAAS;AACpG,QAAM,MAAc,CAAC;AACrB,MAAI,YAAoE;AAExE,QAAM,OAAO,CACX,QACA,QACA,MACA,IACA,aACG;AACH,QAAI,MAAM,KAAM;AAChB,UAAM,OAAO,SAAS,OAAO,cAAc,GAAG,CAAC;AAC/C,aAAS,IAAI,OAAO,IAAI,EAAE,CAAC,GAAG,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK;AACxD,YAAM,OAAO,OAAO,CAAC;AACrB,UAAI,KAAK,EAAE,GAAG,MAAM,OAAO,KAAK,SAAS,mBAAmB,KAAK,KAAK,CAAC,EAAE,CAAC;AAAA,IAC5E;AAAA,EACF;AAEA,aAAW,OAAO,UAAU,MAAM,GAAG,EAAE,GAAG;AACxC,QAAI,IAAI,SAAS,SAAS;AACxB,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,cAAM,CAAC,OAAO,GAAG,IAAI,GAAG,IAAI,SAAS,CAAC;AACtC,cAAM,CAAC,OAAO,GAAG,IAAI,GAAG,IAAI,SAAS,CAAC;AACtC,iBAAS,IAAI,OAAO,IAAI,KAAK,KAAK;AAChC,gBAAM,OAAO,EAAE,CAAC;AAChB,gBAAM,SAAS,EAAE,KAAK,IAAI,SAAS,IAAI,QAAQ,MAAM,CAAC,CAAC;AACvD,gBAAM,QAAQ,mBAAmB,KAAK,KAAK;AAC3C,cAAI,CAAC,QAAQ;AACX,wBAAY;AACZ,gBAAI,KAAK,EAAE,GAAG,MAAM,MAAM,CAAC;AAC3B;AAAA,UACF;AACA,gBAAM,YAAY,aAAa,OAAO,OAAO,GAAG;AAChD,gBAAM,YAAY,aAAa,KAAK,OAAO,GAAG;AAC9C,cAAI,gBAAgB,QAAQ,WAAW,SAAS,GAAG;AACjD,wBAAY;AACZ,gBAAI,KAAK,EAAE,GAAG,MAAM,MAAM,CAAC;AAC3B;AAAA,UACF;AACA,gBAAM,aAAa,UAAU,IAAI,CAAC,MAAM,EAAE,OAAO,CAAgB;AACjE,gBAAM,YAAY,UAAU,IAAI,CAAC,MAAM,EAAE,OAAO,CAAgB;AAChE,gBAAM,MAAM,gBAAgB,CAAC,YAAY,SAAS,CAAC;AACnD,cAAI,CAAC,aAAa,UAAU,QAAQ,IAAK,aAAY,EAAE,OAAO,cAAc,GAAG,GAAG,IAAI;AACtF,gBAAM,OAAO,OAAO,OAAO,EAAE,GAAG,UAAU,OAAO,QAAQ,YAAY,OAAO,UAAU,CAAC;AACvF,cAAI,KAAK,EAAE,GAAG,MAAM,OAAO,KAAK,SAAS,KAAK,EAAE,CAAC;AAAA,QACnD;AAAA,MACF;AACA;AAAA,IACF;AACA,gBAAY;AACZ,SAAK,GAAG,IAAI,IAAI,OAAO,IAAI,KAAK,IAAI,QAAS;AAC7C,SAAK,GAAG,IAAI,IAAI,OAAO,IAAI,KAAK,IAAI,SAAU;AAAA,EAChD;AAEA,QAAM,QAA2B,CAAC;AAClC,MAAI,IAAI;AACR,SAAO,IAAI,IAAI,QAAQ;AACrB,UAAM,OAAO,IAAI,CAAC;AAClB,QAAI,KAAK,MAAM;AACb,YAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC;AACrC;AACA;AAAA,IACF;AACA,QAAI,OAAO,KAAK;AAChB,QAAI,IAAI,IAAI;AACZ,WAAO,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,gBAAgB,QAAQ,IAAI,CAAC,EAAE,OAAO,KAAK,KAAK,GAAG;AAC1F,cAAQ,IAAI,CAAC,EAAE;AACf;AAAA,IACF;AACA,UAAM,KAAK,IAAI,OAAO,KAAK,MAAM,KAAK,KAAK,CAAC;AAC5C,QAAI;AAAA,EACN;AACA,SAAO,SAAS,KAAK,KAAK;AAC5B;AAMA,SAAS,gBACP,UACA,SACA,OACA,OACA,KACmB;AACnB,QAAM,eAAe,MAAM;AAAA,IACzB,GAAG,WAAW,UAAU,UAAU,OAAO,eAAe,GAAG,GAAG,GAAG;AAAA,IACjE,GAAG,WAAW,SAAS,UAAU,OAAO,eAAe,GAAG,GAAG,GAAG;AAAA,EAClE;AAEA,MAAI,QAA6B,EAAE,GAAG,QAAQ,MAAM;AACpD,QAAM,WAAW,SAAS,UAAU,KAAK;AACzC,MAAI,CAAC,UAAU,UAAU,SAAS,SAAS,KAAK,GAAG,GAAG,GAAG;AACvD,QAAI,eAAe,OAAO,GAAG;AAE3B,YAAM,eACJ,IAAI,iBACJ,UAAU,UAAU,EAAE,GAAG,SAAS,SAAS,KAAK,GAAG,UAAU,SAAS,SAAS,GAAG,GAAG;AACvF,YAAM,OAAO,eAAe,IAAI,cAAe,IAAI,cAAc,GAAG;AACpE,cAAQ,EAAE,GAAG,OAAO,CAAC,sBAAsB,GAAG,EAAE,GAAG,MAAM,SAAS,EAAE;AAAA,IACtE,OAAO;AACL,UAAI,MAAM,IAAI,oBAAoB,MAAM,OAAO,CAAC,4BAA4B;AAAA,IAC9E;AAAA,EACF,WAAW,0BAA0B,OAAO;AAC1C,UAAM,sBAAsB,IAAI;AAAA,EAClC;AAEA,QAAM,OAAO,QAAQ;AACrB,QAAM,iBACJ,CAAC,CAAC,IAAI,aACN,CAAC,CAAC,IAAI,YACN,KAAK,eAAe,IAAI,SAAS,KACjC,KAAK,eAAe,IAAI,QAAQ;AAClC,MAAI,CAAC,gBAAgB;AAGnB,QAAI,CAAC,SAAS,QAAQ,GAAG,QAAQ,OAAO,EAAG,QAAO,aAAa;AAC/D,WAAO,CAAC,KAAK,OAAO,OAAO,QAAQ,SAAS,QAAQ,KAAK,CAAC;AAAA,EAC5D;AACA,QAAM,UAAU,YAAY,UAAU,SAAS,MAAM,GAAG;AACxD,MAAI,CAAC,KAAK,aAAa,OAAO,GAAG;AAC/B,QAAI,MAAM,IAAI,mBAAmB,MAAM,QAAQ,CAAC,QAAQ,MAAM,OAAO,CAAC,mDAAmD;AACzH,WAAO,aAAa;AAAA,EACtB;AACA,SAAO,CAAC,KAAK,OAAO,OAAO,SAAS,QAAQ,KAAK,CAAC;AACpD;AAEA,SAAS,UACP,UACA,SACA,OACA,OACA,KACmB;AACnB,MAAI,SAAS,YAAa,QAAO,gBAAgB,UAAU,SAAS,OAAO,OAAO,GAAG;AACrF,QAAM,eAAe,MAAM;AAAA,IACzB,GAAG,WAAW,UAAU,UAAU,OAAO,eAAe,GAAG,GAAG,GAAG;AAAA,IACjE,GAAG,WAAW,SAAS,UAAU,OAAO,eAAe,GAAG,GAAG,GAAG;AAAA,EAClE;AACA,MAAI,SAAS,QAAQ;AACnB,WAAO,SAAS,GAAG,OAAO,IAAI,CAAC,OAAO,IAAI,aAAa;AAAA,EACzD;AACA,MACE,SAAS,SAAS,QAAQ,QAC1B,mBAAmB,SAAS,OAAO,GAAG,MAAM,mBAAmB,QAAQ,OAAO,GAAG,GACjF;AACA,QAAI,MAAM,IAAI,wBAAwB,MAAM,OAAO,CAAC,yBAAyB;AAAA,EAC/E;AACA,QAAM,QAAQ,IAAI;AAClB,MAAI,SAAS,SAAS,QAAQ,KAAM,KAAI,gBAAgB,eAAe,GAAG;AAC1E,MAAI;AACJ,MAAI;AACF,eAAW;AAAA,MACT;AAAA,MACA;AAAA,MACA,CAAC,GAAG,OAAO,UAAU,QAAQ,CAAC;AAAA,MAC9B,CAAC,GAAG,OAAO,UAAU,OAAO,CAAC;AAAA,MAC7B;AAAA,IACF;AAAA,EACF,UAAE;AACA,QAAI,gBAAgB;AAAA,EACtB;AACA,MAAI;AACF,WAAO,CAAC,QAAQ,KAAK,cAAc,QAAQ,OAAO,UAAU,QAAQ,KAAK,CAAC;AAAA,EAC5E,QAAQ;AACN,QAAI,MAAM,IAAI,kBAAkB,MAAM,OAAO,CAAC,kDAAkD;AAChG,WAAO,aAAa;AAAA,EACtB;AACF;AAEA,SAAS,gBACP,UACA,SACA,OACA,OACA,KACmB;AACnB,QAAM,IAAuB,CAAC;AAC9B,QAAM,IAAuB,CAAC;AAC9B,WAAS,QAAQ,CAAC,UAAU,EAAE,KAAK,KAAK,CAAC;AACzC,UAAQ,QAAQ,CAAC,UAAU,EAAE,KAAK,KAAK,CAAC;AACxC,QAAM,OAAO,cAAc,GAAG,GAAG,EAAE,MAAM,CAAC,SAAS,SAAS,MAAM,GAAG,EAAE,CAAC;AACxE,QAAM,MAAyB,CAAC;AAEhC,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,QAAI,IAAI,SAAS,SAAS;AACxB,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,KAAK,GAAG,UAAU,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,IAAI,SAAS,CAAC,GAAG,OAAO,OAAO,GAAG,CAAC;AAAA,MAChF;AACA;AAAA,IACF;AAGA,QAAI,OAA0B,CAAC;AAC/B,QAAI,OAA0B,CAAC;AAC/B,QAAI,IAAI,SAAS,UAAU;AACzB,aAAO,EAAE,MAAM,IAAI,QAAQ,IAAI,SAAS,IAAI,MAAM;AAClD,YAAM,OAAO,KAAK,IAAI,CAAC;AACvB,UAAI,MAAM,SAAS,UAAU;AAC3B,eAAO,EAAE,MAAM,KAAK,QAAQ,KAAK,SAAS,KAAK,MAAM;AACrD;AAAA,MACF;AAAA,IACF,OAAO;AACL,aAAO,EAAE,MAAM,IAAI,QAAQ,IAAI,SAAS,IAAI,MAAM;AAAA,IACpD;AACA,UAAM,UAAU,eAAe,GAAG;AAClC,UAAM,WAAW,eAAe,GAAG;AACnC,aAAS,IAAI,GAAG,IAAI,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM,GAAG,KAAK;AAC3D,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,MAAM,KAAK,CAAC;AAClB,UAAI,OAAO,OAAO,WAAW,KAAK,GAAG,GAAG;AACtC,YAAI,KAAK,GAAG,UAAU,KAAK,KAAK,OAAO,OAAO,GAAG,CAAC;AAClD;AAAA,MACF;AACA,UAAI,IAAK,KAAI,KAAK,GAAG,WAAW,KAAK,UAAU,OAAO,SAAS,GAAG,CAAC;AACnE,UAAI,IAAK,KAAI,KAAK,GAAG,WAAW,KAAK,UAAU,OAAO,UAAU,GAAG,CAAC;AAAA,IACtE;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,UAAU,KAAsB,OAAoC;AAC3E,QAAM,UAA0B;AAAA,IAC9B,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,eAAe;AAAA,IACf,cAAc;AAAA,IACd,aAAa,CAAC,GAAG,KAAK;AAAA,EACxB;AACA,oBAAkB,GAAG,EAAE,QAAQ,CAAC,WAAW;AACzC,QAAI,OAAO,SAAS,eAAe,OAAO,OAAO,cAAc,SAAU,SAAQ;AAAA,aACxE,OAAO,SAAS,cAAc,OAAO,OAAO,cAAc,SAAU,SAAQ;AAAA,aAC5E,OAAO,SAAS,SAAU,SAAQ;AAAA,QACtC,SAAQ;AAAA,EACf,CAAC;AACD,SAAO;AACT;AAmBO,SAAS,iBACd,UACA,SACA,UAAmC,CAAC,GACZ;AACxB,QAAM,SACJ,QAAQ,WACP,OAAQ,UAA8B,gBAAgB,aAClD,SAA6B,KAAK,SACnC,OAAQ,SAA6B,gBAAgB,aAClD,QAA4B,KAAK,SAClC;AACR,MAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,kEAAkE;AAE/F,QAAM,MAAe;AAAA,IACnB;AAAA,IACA,QAAQ,QAAQ,UAAU,EAAE,IAAI,WAAW,MAAM,UAAU;AAAA,IAC3D,WAAW,OAAO,QAAQ,IAAI;AAAA,IAC9B,YAAY,QAAQ,eAAe,MAAM,eAAe,QAAQ;AAAA,IAChE,aAAa,QAAQ,eAAe;AAAA,IACpC,YAAY,CAAC,CAAC,QAAQ;AAAA,IACtB,kBAAkB,CAAC,CAAC,QAAQ;AAAA,IAC5B,YAAY,QAAQ,eAAe;AAAA,IACnC,aAAa,QAAQ,eAAe;AAAA,IACpC,cAAc,IAAI,IAAI,QAAQ,gBAAgB,CAAC,CAAC;AAAA,IAChD,mBAAmB,IAAI,IAAI,QAAQ,0BAA0B,CAAC,IAAI,CAAC;AAAA,IACnE,WAAW,OAAO,MAAM,mBAAmB;AAAA,IAC3C,UAAU,OAAO,MAAM,kBAAkB;AAAA,IACzC,QAAQ,OAAO,MAAM,uBAAuB;AAAA,IAC5C,OAAO,oBAAI,IAAI;AAAA,IACf,MAAM,oBAAI,IAAI;AAAA,IACd,eAAe;AAAA,EACjB;AACA,MAAI,CAAC,IAAI,aAAa,CAAC,IAAI,UAAU;AACnC,UAAM,IAAI,MAAM,2FAA2F;AAAA,EAC7G;AACA,MAAI,IAAI,cAAc,CAAC,IAAI,QAAQ;AACjC,QAAI,MAAM,IAAI,gFAAgF;AAAA,EAChG;AAEA,QAAM,UAAU,CAAC,WAA0B;AACzC,UAAMC,OAAM,OAAO,QAAQ,MAAM;AACjC,QAAI,kBAAkBA,IAAG,EAAE,WAAW,EAAG,QAAOA;AAChD,QAAI,MAAM,IAAI,0EAA0E;AACxF,WAAO,sBAAsBA,MAAK,UAAU;AAAA,EAC9C;AACA,QAAM,IAAI,QAAQ,QAAQ;AAC1B,QAAM,IAAI,QAAQ,OAAO;AAEzB,QAAM,WAAW,gBAAgB,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG;AAClD,MAAI;AACJ,MAAI;AACF,UAAM,EAAE,KAAK,cAAc,EAAE,OAAO,UAAU,EAAE,KAAK;AAAA,EACvD,QAAQ;AACN,UAAM,EAAE,KAAK,cAAc,EAAE,OAAO,UAAU,EAAE,KAAK,KAAK;AAC1D,QAAI,MAAM,IAAI,6DAA6D;AAAA,EAC7E;AACA,SAAO,EAAE,KAAK,SAAS,UAAU,KAAK,IAAI,KAAK,EAAE;AACnD;AAGO,SAAS,YACd,cACA,aACA,SACwB;AACxB,SAAO,iBAAiB,cAAc,aAAa,OAAO;AAC5D;","names":["x","y","k","i","j","i","doc"]}

package/dist/{chunk-OYXSKQFR.js → chunk-FPENXAEJ.js}

@@ -6,7 +6,7 @@ import {
   getSuppliedValue,
   matchConditionalTags,
   parseVariableBody
-} from "./chunk-B2ZRLN4S.js";
+} from "./chunk-P6ODPZ4W.js";
 
 // src/grammar/tokenizer.ts
 function tokenizePrompt(text) {
@@ -96,9 +96,27 @@ function tokenizePromptWithDiagnostics(text) {
   matchConditionalTags(
     conditionals.map((m) => ({ conditional: m.conditional, name: m.value }))
   ).forEach((result, i) => {
-    if (!result.error) return;
     const tag = conditionals[i];
+    const parsed = result.comparison;
+    if (!result.error) {
+      if (parsed?.comparison && tag.conditional !== "end") {
+        tag.value = parsed.subject;
+        tag.comparison = parsed.comparison;
+      }
+      return;
+    }
     literal.add(tag);
+    if (result.error === "invalid-condition") {
+      if (tag.conditional === "end") return;
+      diagnostics.push({
+        code: result.error,
+        message: `Invalid condition "${tag.raw}": ${parsed?.error ?? "malformed comparison"}`,
+        name: parsed?.subject ?? tag.value,
+        start: tag.start,
+        end: tag.end
+      });
+      return;
+    }
     diagnostics.push({
       code: result.error,
       message: result.error === "unclosed-section" ? `Section "${tag.raw}" is never closed with "{/${tag.value}}"` : `"${tag.raw}" does not close any open section`,
@@ -107,6 +125,7 @@ function tokenizePromptWithDiagnostics(text) {
       end: tag.end
     });
   });
+  diagnostics.sort((a, b) => a.start - b.start);
   const tokens = [];
   let currentIdx = 0;
   const pushText = (start, end) => {
@@ -300,7 +319,12 @@ function resolvePrompt(text, templates = [], options = {}) {
         };
         if (token.conditional !== "end") {
           const close = pairs.get(i);
-          if (!evaluateCondition(token.conditional, token.value, values)) {
+          if (!evaluateCondition(
+            token.conditional,
+            token.value,
+            values,
+            token.comparison
+          )) {
             out2.replaced(token.start, tokens[close].end, "", tagInfo);
             i = close;
             continue;
@@ -336,7 +360,12 @@ function evaluatePromptTokens(text, values) {
   for (let i = 0; i < tokens.length; i++) {
     const token = tokens[i];
     if (token.type === "conditional") {
-      if (token.conditional !== "end" && !evaluateCondition(token.conditional, token.value, values)) {
+      if (token.conditional !== "end" && !evaluateCondition(
+        token.conditional,
+        token.value,
+        values,
+        token.comparison
+      )) {
         i = pairs.get(i);
       }
       continue;
@@ -358,176 +387,6 @@ function evaluatePromptTokens(text, values) {
   return result;
 }
 
-// src/grammar/resolver.ts
-function resolveTemplates(text, templates = [], options) {
-  return resolvePrompt(text, templates, options).text;
-}
-function resolveVariables(text, values) {
-  if (!text) return "";
-  return resolvePrompt(text, [], { values }).text;
-}
-function extractTemplateNames(text) {
-  if (!text) return [];
-  const set = /* @__PURE__ */ new Set();
-  const regex = new RegExp(TEMPLATE_REGEX.source, TEMPLATE_REGEX.flags);
-  let match;
-  while ((match = regex.exec(text)) !== null) {
-    set.add(match[1].trim());
-  }
-  return Array.from(set);
-}
-function extractVariableNames(text) {
-  if (!text) return [];
-  const set = /* @__PURE__ */ new Set();
-  const regex = new RegExp(VARIABLE_REGEX.source, VARIABLE_REGEX.flags);
-  let match;
-  while ((match = regex.exec(text)) !== null) {
-    set.add(parseVariableBody(match[1]).name);
-  }
-  return Array.from(set);
-}
-function extractInstructionNames(text) {
-  if (!text) return [];
-  const set = /* @__PURE__ */ new Set();
-  const regex = new RegExp(INSTRUCTION_REGEX.source, INSTRUCTION_REGEX.flags);
-  let match;
-  while ((match = regex.exec(text)) !== null) {
-    set.add(match[1].trim());
-  }
-  return Array.from(set);
-}
-
-// src/grammar/sourcemap.ts
-function resolveTemplatesWithMapping(text, templates = [], templateBindings, options) {
-  if (options?.values === void 0 && (!templates || templates.length === 0 || !text.includes("{{"))) {
-    return {
-      diagnostics: getPromptDiagnostics(text),
-      text,
-      map: [
-        {
-          resolvedStart: 0,
-          resolvedEnd: text.length,
-          source: "raw",
-          rawStart: 0,
-          rawEnd: text.length
-        }
-      ]
-    };
-  }
-  return resolvePrompt(text, templates, {
-    bindings: templateBindings,
-    maxDepth: options?.maxDepth,
-    values: options?.values
-  });
-}
-function mapResolvedOffsetToRaw(resolvedOffset, map) {
-  for (let i = 0; i < map.length; i++) {
-    const seg = map[i];
-    const isLast = i === map.length - 1;
-    const inRange = isLast ? resolvedOffset >= seg.resolvedStart && resolvedOffset <= seg.resolvedEnd : resolvedOffset >= seg.resolvedStart && resolvedOffset < seg.resolvedEnd;
-    if (inRange) {
-      if (seg.source === "raw") {
-        return seg.rawStart + (resolvedOffset - seg.resolvedStart);
-      }
-      if (resolvedOffset === seg.resolvedEnd) {
-        return seg.rawEnd;
-      }
-      return seg.rawStart;
-    }
-  }
-  return resolvedOffset;
-}
-function mapRawOffsetToResolved(rawOffset, map) {
-  for (let i = 0; i < map.length; i++) {
-    const seg = map[i];
-    const isLast = i === map.length - 1;
-    const inRange = isLast ? rawOffset >= seg.rawStart && rawOffset <= seg.rawEnd : rawOffset >= seg.rawStart && rawOffset < seg.rawEnd;
-    if (inRange) {
-      if (seg.source === "raw") {
-        return seg.resolvedStart + (rawOffset - seg.rawStart);
-      }
-      if (rawOffset === seg.rawEnd) {
-        return seg.resolvedEnd;
-      }
-      return seg.resolvedStart;
-    }
-  }
-  return rawOffset;
-}
-
-// src/grammar/fields.ts
-function extractVariables(text, options = {}) {
-  const descriptors = /* @__PURE__ */ new Map();
-  const templateMap = new Map(
-    (options.templates ?? []).map((t) => [t.name, t])
-  );
-  const maxDepth = options.maxDepth ?? 10;
-  const describe = (name, templateName) => {
-    let descriptor = descriptors.get(name);
-    if (!descriptor) {
-      descriptor = {
-        name,
-        usedAsValue: false,
-        usedInCondition: false,
-        occurrences: 0,
-        templates: []
-      };
-      descriptors.set(name, descriptor);
-    }
-    descriptor.occurrences++;
-    if (templateName && !descriptor.templates.includes(templateName)) {
-      descriptor.templates.push(templateName);
-    }
-    return descriptor;
-  };
-  const visit = (source, visited, depth, templateName) => {
-    for (const token of tokenizePrompt(source)) {
-      if (token.type === "variable") {
-        const descriptor = describe(token.value, templateName);
-        descriptor.usedAsValue = true;
-        if (descriptor.defaultValue === void 0 && token.defaultValue !== void 0) {
-          descriptor.defaultValue = token.defaultValue;
-        }
-        if (descriptor.description === void 0 && token.description !== void 0) {
-          descriptor.description = token.description;
-        }
-      } else if (token.type === "conditional" && token.conditional !== "end") {
-        describe(token.value, templateName).usedInCondition = true;
-      } else if (token.type === "template") {
-        const template = templateMap.get(token.value);
-        if (!template || visited.has(token.value) || depth + 1 > maxDepth) {
-          continue;
-        }
-        const body = getTemplateBody(template, options.bindings);
-        if (body === void 0) continue;
-        visit(body, new Set(visited).add(token.value), depth + 1, token.value);
-      }
-    }
-  };
-  if (text) visit(text, /* @__PURE__ */ new Set(), 0);
-  return Array.from(descriptors.values());
-}
-function getVariableFormFields(text, options = {}) {
-  return extractVariables(text, options).map((variable) => ({
-    name: variable.name,
-    label: variable.description || variable.name,
-    placeholder: variable.defaultValue ?? "",
-    ...variable.defaultValue !== void 0 ? { defaultValue: variable.defaultValue } : {},
-    ...variable.description !== void 0 ? { description: variable.description } : {},
-    required: variable.usedAsValue && variable.defaultValue === void 0,
-    conditionOnly: !variable.usedAsValue
-  }));
-}
-function compactVariableValues(input) {
-  const values = {};
-  for (const [name, value] of Object.entries(input)) {
-    if (value !== null && value !== void 0 && value.trim() !== "") {
-      values[name] = value;
-    }
-  }
-  return values;
-}
-
 export {
   tokenizePrompt,
   getPromptDiagnostics,
@@ -537,17 +396,6 @@ export {
   TEMPLATE_DEPTH_ERROR,
   getTemplateBody,
   resolvePrompt,
-  evaluatePromptTokens,
-  resolveTemplates,
-  resolveVariables,
-  extractTemplateNames,
-  extractVariableNames,
-  extractInstructionNames,
-  resolveTemplatesWithMapping,
-  mapResolvedOffsetToRaw,
-  mapRawOffsetToResolved,
-  extractVariables,
-  getVariableFormFields,
-  compactVariableValues
+  evaluatePromptTokens
 };
-//# sourceMappingURL=chunk-OYXSKQFR.js.map
+//# sourceMappingURL=chunk-FPENXAEJ.js.map

package/dist/chunk-FPENXAEJ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/grammar/tokenizer.ts","../src/grammar/engine.ts"],"sourcesContent":["import {\n  TEMPLATE_REGEX,\n  VARIABLE_REGEX,\n  INSTRUCTION_REGEX,\n  Token,\n  PromptDiagnostic,\n} from \"./tokens\";\nimport { matchConditionalTags, parseVariableBody } from \"./variables\";\n\ntype RawMatch = Token & { type: \"template\" | \"variable\" | \"instruction\" | \"conditional\" };\n\nexport interface TokenizeResult {\n  tokens: Token[];\n  /** Unbalanced conditional tags, which were emitted as text. */\n  diagnostics: PromptDiagnostic[];\n}\n\n/**\n * Parses any prompt string into an array of typed tokens in linear order.\n * Plain text between tokens is preserved as `{ type: 'text' }`.\n *\n * Conditional section tags (`{?name}`, `{!name}`, `{/name}`) are only emitted\n * as `conditional` tokens when balanced; unbalanced tags become text. Use\n * `tokenizePromptWithDiagnostics` to find out which tags were rejected.\n */\nexport function tokenizePrompt(text: string): Token[] {\n  return tokenizePromptWithDiagnostics(text).tokens;\n}\n\n/**\n * Returns the diagnostics `tokenizePrompt` would report for `text`.\n */\nexport function getPromptDiagnostics(text: string): PromptDiagnostic[] {\n  return tokenizePromptWithDiagnostics(text).diagnostics;\n}\n\n/**\n * Like `tokenizePrompt`, but also reports unbalanced conditional tags.\n */\nexport function tokenizePromptWithDiagnostics(text: string): TokenizeResult {\n  if (!text) {\n    return { tokens: [], diagnostics: [] };\n  }\n\n  const rawMatches: RawMatch[] = [];\n\n  // Match {{template}}\n  const tmplRegex = new RegExp(TEMPLATE_REGEX.source, TEMPLATE_REGEX.flags);\n  let match: RegExpExecArray | null;\n  while ((match = tmplRegex.exec(text)) !== null) {\n    rawMatches.push({\n      type: \"template\",\n      raw: match[0],\n      value: match[1].trim(),\n      start: match.index,\n      end: match.index + match[0].length,\n    });\n  }\n\n  // Match {variable}\n  const varRegex = new RegExp(VARIABLE_REGEX.source, VARIABLE_REGEX.flags);\n  while ((match = varRegex.exec(text)) !== null) {\n    // Avoid double matching if overlapping with template\n    const start = match.index;\n    const end = start + match[0].length;\n    const overlaps = rawMatches.some(\n      (m) => !(end <= m.start || start >= m.end),\n    );\n    if (!overlaps) {\n      const parsed = parseVariableBody(match[1]);\n      if (parsed.kind === \"conditional\") {\n        rawMatches.push({\n          type: \"conditional\",\n          raw: match[0],\n          value: parsed.name,\n          start,\n          end,\n          conditional: parsed.conditional,\n        });\n      } else {\n        const token: RawMatch = {\n          type: \"variable\",\n          raw: match[0],\n          value: parsed.name,\n          start,\n          end,\n        };\n        if (parsed.defaultValue !== undefined) {\n          token.defaultValue = parsed.defaultValue;\n        }\n        if (parsed.description !== undefined) {\n          token.description = parsed.description;\n        }\n        rawMatches.push(token);\n      }\n    }\n  }\n\n  // Match __instruction__\n  const instRegex = new RegExp(\n    INSTRUCTION_REGEX.source,\n    INSTRUCTION_REGEX.flags,\n  );\n  while ((match = instRegex.exec(text)) !== null) {\n    const start = match.index;\n    const end = start + match[0].length;\n    const overlaps = rawMatches.some(\n      (m) => !(end <= m.start || start >= m.end),\n    );\n    if (!overlaps) {\n      rawMatches.push({\n        type: \"instruction\",\n        raw: match[0],\n        value: match[1].trim(),\n        start,\n        end,\n      });\n    }\n  }\n\n  // Sort matches by start index\n  rawMatches.sort((a, b) => a.start - b.start);\n\n  // Pair conditional tags; unbalanced ones are demoted to text below.\n  const diagnostics: PromptDiagnostic[] = [];\n  const literal = new Set<RawMatch>();\n  const conditionals = rawMatches.filter(\n    (m): m is RawMatch & Required<Pick<Token, \"conditional\">> =>\n      m.type === \"conditional\",\n  );\n  matchConditionalTags(\n    conditionals.map((m) => ({ conditional: m.conditional, name: m.value })),\n  ).forEach((result, i) => {\n    const tag = conditionals[i];\n    const parsed = result.comparison;\n    if (!result.error) {\n      if (parsed?.comparison && tag.conditional !== \"end\") {\n        // `{?amount>100}` closed by `{/amount}`: a comparison on `amount`.\n        tag.value = parsed.subject;\n        tag.comparison = parsed.comparison;\n      }\n      return;\n    }\n    literal.add(tag);\n    if (result.error === \"invalid-condition\") {\n      // Reported once, on the opening tag.\n      if (tag.conditional === \"end\") return;\n      diagnostics.push({\n        code: result.error,\n        message: `Invalid condition \"${tag.raw}\": ${parsed?.error ?? \"malformed comparison\"}`,\n        name: parsed?.subject ?? tag.value,\n        start: tag.start,\n        end: tag.end,\n      });\n      return;\n    }\n    diagnostics.push({\n      code: result.error,\n      message:\n        result.error === \"unclosed-section\"\n          ? `Section \"${tag.raw}\" is never closed with \"{/${tag.value}}\"`\n          : `\"${tag.raw}\" does not close any open section`,\n      name: tag.value,\n      start: tag.start,\n      end: tag.end,\n    });\n  });\n  // Keep diagnostics in document order (an invalid pair is found at its close).\n  diagnostics.sort((a, b) => a.start - b.start);\n\n  const tokens: Token[] = [];\n  let currentIdx = 0;\n\n  const pushText = (start: number, end: number) => {\n    const previous = tokens[tokens.length - 1];\n    if (previous?.type === \"text\" && previous.end === start) {\n      // Merge with text produced by a demoted conditional tag.\n      previous.raw = previous.value = text.slice(previous.start, end);\n      previous.end = end;\n      return;\n    }\n    const textChunk = text.slice(start, end);\n    tokens.push({\n      type: \"text\",\n      raw: textChunk,\n      value: textChunk,\n      start,\n      end,\n    });\n  };\n\n  for (const m of rawMatches) {\n    if (m.start > currentIdx) {\n      pushText(currentIdx, m.start);\n    }\n    if (literal.has(m)) {\n      pushText(m.start, m.end);\n    } else {\n      tokens.push({ ...m });\n    }\n    currentIdx = m.end;\n  }\n\n  if (currentIdx < text.length) {\n    pushText(currentIdx, text.length);\n  }\n\n  return { tokens, diagnostics };\n}\n","import type {\n  PromptDiagnostic,\n  PromptValues,\n  Template,\n  TemplateVersion,\n  Token,\n} from \"./tokens\";\nimport type { SourceMapSegment } from \"./sourcemap\";\nimport { tokenizePromptWithDiagnostics } from \"./tokenizer\";\nimport { evaluateCondition, getSuppliedValue } from \"./variables\";\n\n/**\n * Finds the latest version of a template based on `latestVersion` or last version entry.\n */\nexport function getLatestVersion(\n  template: Template,\n): TemplateVersion | undefined {\n  if (!template.versions || template.versions.length === 0) {\n    if (template.body !== undefined) {\n      return {\n        id: template.id || \"default\",\n        version: \"1.0\",\n        body: template.body,\n      };\n    }\n    return undefined;\n  }\n  if (template.latestVersion) {\n    const found = template.versions.find(\n      (v) => v.version === template.latestVersion,\n    );\n    if (found) return found;\n  }\n  return template.versions[template.versions.length - 1];\n}\n\n/** Marker substituted for a template tag that would recurse into itself. */\nexport const TEMPLATE_LOOP_ERROR = \"[Template loop detected]\";\n/** Marker substituted for a template tag nested deeper than `maxDepth`. */\nexport const TEMPLATE_DEPTH_ERROR = \"[Template max depth exceeded]\";\n\n/**\n * Returns the body a template tag resolves to, honoring version bindings.\n */\nexport function getTemplateBody(\n  template: Template,\n  bindings?: Record<string, string>,\n): string | undefined {\n  const boundVersionId = bindings?.[template.name];\n  if (boundVersionId && template.versions) {\n    const boundVersion = template.versions.find(\n      (v) => v.id === boundVersionId || v.version === boundVersionId,\n    );\n    return boundVersion?.body;\n  }\n  return getLatestVersion(template)?.body ?? template.body;\n}\n\nexport interface ResolvePromptOptions {\n  /** Template version bindings (`{ templateName: versionIdOrVersion }`). */\n  bindings?: Record<string, string>;\n  /** Maximum template nesting depth (default 10). */\n  maxDepth?: number;\n  /**\n   * Values for `{variable}` slots and `{?variable}` / `{!variable}` sections.\n   * When omitted, variables and section tags are left exactly as written.\n   */\n  values?: PromptValues;\n}\n\nexport interface ResolvePromptResult {\n  text: string;\n  map: SourceMapSegment[];\n  diagnostics: PromptDiagnostic[];\n}\n\ntype Segment = SourceMapSegment & { locked?: boolean };\n\n/** Accumulates resolved text and, at the top level, source map segments. */\nclass Output {\n  text = \"\";\n  constructor(readonly segments: Segment[] | null) {}\n\n  /** Text copied verbatim from the raw input. Locked segments never merge. */\n  raw(rawStart: number, rawEnd: number, value: string, locked = false) {\n    const resolvedStart = this.text.length;\n    this.text += value;\n    if (!this.segments) return;\n    const last = this.segments[this.segments.length - 1];\n    if (\n      !locked &&\n      last &&\n      last.source === \"raw\" &&\n      !last.locked &&\n      last.rawEnd === rawStart &&\n      last.resolvedEnd === resolvedStart\n    ) {\n      last.rawEnd = rawEnd;\n      last.resolvedEnd = this.text.length;\n      return;\n    }\n    this.segments.push({\n      resolvedStart,\n      resolvedEnd: this.text.length,\n      source: \"raw\",\n      rawStart,\n      rawEnd,\n      ...(locked ? { locked } : {}),\n    });\n  }\n\n  /** Text that replaces a raw range (template body, value, removed section). */\n  replaced(\n    rawStart: number,\n    rawEnd: number,\n    value: string,\n    extra: Pick<\n      SourceMapSegment,\n      \"source\" | \"templateName\" | \"variableName\" | \"valueSource\"\n    >,\n  ) {\n    const resolvedStart = this.text.length;\n    this.text += value;\n    this.segments?.push({\n      resolvedStart,\n      resolvedEnd: this.text.length,\n      rawStart,\n      rawEnd,\n      ...extra,\n    });\n  }\n}\n\n/** Pairs balanced conditional tokens (the tokenizer guarantees nesting). */\nfunction pairSections(tokens: Token[]): Map<number, number> {\n  const pairs = new Map<number, number>();\n  const stack: number[] = [];\n  tokens.forEach((token, index) => {\n    if (token.type !== \"conditional\") return;\n    if (token.conditional === \"end\") {\n      const open = stack.pop();\n      if (open !== undefined) pairs.set(open, index);\n    } else {\n      stack.push(index);\n    }\n  });\n  return pairs;\n}\n\n/**\n * Resolves a prompt: expands `{{templates}}` recursively (with loop and depth\n * protection), and, when `values` are given, substitutes `{variables}` (falling\n * back to their `|default`) and keeps or removes `{?name}…{/name}` sections.\n *\n * Template bodies are parsed on their own, so a section must open and close\n * within the same body. Templates inside a removed section are never expanded\n * and cannot trigger loop or depth errors. Unbalanced section tags are kept as\n * literal text and reported in `diagnostics`.\n *\n * Returns the resolved text, a source map from resolved to raw offsets, and\n * diagnostics. With no `values` the text matches the original template-only\n * resolver exactly.\n */\nexport function resolvePrompt(\n  text: string,\n  templates: Template[] = [],\n  options: ResolvePromptOptions = {},\n): ResolvePromptResult {\n  const templateMap = new Map<string, Template>();\n  for (const t of templates) {\n    templateMap.set(t.name, t);\n  }\n  const maxDepth = options.maxDepth ?? 10;\n  const values = options.values;\n  const diagnostics: PromptDiagnostic[] = [];\n  const reported = new Set<string>();\n\n  function resolveInto(\n    source: string,\n    out: Output,\n    visited: Set<string>,\n    depth: number,\n    templateName: string | undefined,\n  ): void {\n    const { tokens, diagnostics: found } =\n      tokenizePromptWithDiagnostics(source);\n    for (const diagnostic of found) {\n      const key = `${templateName ?? \"\"}\\u0000${diagnostic.start}\\u0000${diagnostic.code}`;\n      if (reported.has(key)) continue;\n      reported.add(key);\n      diagnostics.push(\n        templateName === undefined ? diagnostic : { ...diagnostic, templateName },\n      );\n    }\n    const pairs = values ? pairSections(tokens) : null;\n\n    for (let i = 0; i < tokens.length; i++) {\n      const token = tokens[i];\n\n      if (token.type === \"template\") {\n        const name = token.value;\n        if (visited.has(name)) {\n          out.replaced(token.start, token.end, TEMPLATE_LOOP_ERROR, {\n            source: \"template\",\n            templateName: name,\n          });\n          continue;\n        }\n        const template = templateMap.get(name);\n        const body = template\n          ? getTemplateBody(template, options.bindings)\n          : undefined;\n        if (body === undefined) {\n          out.raw(token.start, token.end, token.raw, true);\n          continue;\n        }\n        if (depth + 1 > maxDepth) {\n          out.replaced(token.start, token.end, TEMPLATE_DEPTH_ERROR, {\n            source: \"template\",\n            templateName: name,\n          });\n          continue;\n        }\n        const nested = new Output(null);\n        const nextVisited = new Set(visited);\n        nextVisited.add(name);\n        resolveInto(body, nested, nextVisited, depth + 1, name);\n        out.replaced(token.start, token.end, nested.text, {\n          source: \"template\",\n          templateName: name,\n        });\n        continue;\n      }\n\n      if (values && token.type === \"variable\") {\n        const supplied = getSuppliedValue(values, token.value);\n        const value = supplied ?? token.defaultValue;\n        if (value !== undefined) {\n          out.replaced(token.start, token.end, value, {\n            source: \"variable\",\n            variableName: token.value,\n            valueSource: supplied !== undefined ? \"value\" : \"default\",\n          });\n          continue;\n        }\n      }\n\n      if (values && token.type === \"conditional\" && token.conditional) {\n        const tagInfo = {\n          source: \"conditional\" as const,\n          variableName: token.value,\n        };\n        if (token.conditional !== \"end\") {\n          const close = pairs!.get(i)!;\n          if (\n            !evaluateCondition(\n              token.conditional,\n              token.value,\n              values,\n              token.comparison,\n            )\n          ) {\n            // Drop the whole section, tags included.\n            out.replaced(token.start, tokens[close].end, \"\", tagInfo);\n            i = close;\n            continue;\n          }\n        }\n        out.replaced(token.start, token.end, \"\", tagInfo);\n        continue;\n      }\n\n      out.raw(token.start, token.end, token.raw);\n    }\n  }\n\n  const out = new Output([]);\n  resolveInto(text, out, new Set(), 0, undefined);\n\n  const map: SourceMapSegment[] = out.segments!.map(\n    ({ locked: _locked, ...segment }) => segment,\n  );\n  if (map.length === 0) {\n    map.push({\n      resolvedStart: 0,\n      resolvedEnd: 0,\n      source: \"raw\",\n      rawStart: 0,\n      rawEnd: 0,\n    });\n  }\n  return { text: out.text, map, diagnostics };\n}\n\n/** A token annotated with the value it resolves to. */\nexport interface EvaluatedToken extends Token {\n  /** Variables only, when values were given: the substituted text. */\n  resolvedValue?: string;\n  /** Variables only: whether `resolvedValue` came from `values` or the default. */\n  valueSource?: \"value\" | \"default\";\n}\n\n/**\n * Tokenizes a prompt for display. Without `values` this is `tokenizePrompt`.\n * With `values`, sections whose condition fails are removed (tags included),\n * the tags of kept sections are dropped, and each variable that has a value or\n * a default carries it in `resolvedValue`. Templates are not expanded; resolve\n * them first (without values) if the display should show their bodies.\n */\nexport function evaluatePromptTokens(\n  text: string,\n  values?: PromptValues,\n): EvaluatedToken[] {\n  const tokens = tokenizePromptWithDiagnostics(text).tokens;\n  if (!values) return tokens;\n\n  const pairs = pairSections(tokens);\n  const result: EvaluatedToken[] = [];\n  for (let i = 0; i < tokens.length; i++) {\n    const token = tokens[i];\n    if (token.type === \"conditional\") {\n      if (\n        token.conditional !== \"end\" &&\n        !evaluateCondition(\n          token.conditional!,\n          token.value,\n          values,\n          token.comparison,\n        )\n      ) {\n        i = pairs.get(i)!;\n      }\n      continue;\n    }\n    if (token.type === \"variable\") {\n      const supplied = getSuppliedValue(values, token.value);\n      const value = supplied ?? token.defaultValue;\n      if (value !== undefined) {\n        result.push({\n          ...token,\n          resolvedValue: value,\n          valueSource: supplied !== undefined ? \"value\" : \"default\",\n        });\n        continue;\n      }\n    }\n    result.push(token);\n  }\n  return result;\n}\n"],"mappings":";;;;;;;;;;;AAyBO,SAAS,eAAe,MAAuB;AACpD,SAAO,8BAA8B,IAAI,EAAE;AAC7C;AAKO,SAAS,qBAAqB,MAAkC;AACrE,SAAO,8BAA8B,IAAI,EAAE;AAC7C;AAKO,SAAS,8BAA8B,MAA8B;AAC1E,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,QAAQ,CAAC,GAAG,aAAa,CAAC,EAAE;AAAA,EACvC;AAEA,QAAM,aAAyB,CAAC;AAGhC,QAAM,YAAY,IAAI,OAAO,eAAe,QAAQ,eAAe,KAAK;AACxE,MAAI;AACJ,UAAQ,QAAQ,UAAU,KAAK,IAAI,OAAO,MAAM;AAC9C,eAAW,KAAK;AAAA,MACd,MAAM;AAAA,MACN,KAAK,MAAM,CAAC;AAAA,MACZ,OAAO,MAAM,CAAC,EAAE,KAAK;AAAA,MACrB,OAAO,MAAM;AAAA,MACb,KAAK,MAAM,QAAQ,MAAM,CAAC,EAAE;AAAA,IAC9B,CAAC;AAAA,EACH;AAGA,QAAM,WAAW,IAAI,OAAO,eAAe,QAAQ,eAAe,KAAK;AACvE,UAAQ,QAAQ,SAAS,KAAK,IAAI,OAAO,MAAM;AAE7C,UAAM,QAAQ,MAAM;AACpB,UAAM,MAAM,QAAQ,MAAM,CAAC,EAAE;AAC7B,UAAM,WAAW,WAAW;AAAA,MAC1B,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,SAAS,EAAE;AAAA,IACxC;AACA,QAAI,CAAC,UAAU;AACb,YAAM,SAAS,kBAAkB,MAAM,CAAC,CAAC;AACzC,UAAI,OAAO,SAAS,eAAe;AACjC,mBAAW,KAAK;AAAA,UACd,MAAM;AAAA,UACN,KAAK,MAAM,CAAC;AAAA,UACZ,OAAO,OAAO;AAAA,UACd;AAAA,UACA;AAAA,UACA,aAAa,OAAO;AAAA,QACtB,CAAC;AAAA,MACH,OAAO;AACL,cAAM,QAAkB;AAAA,UACtB,MAAM;AAAA,UACN,KAAK,MAAM,CAAC;AAAA,UACZ,OAAO,OAAO;AAAA,UACd;AAAA,UACA;AAAA,QACF;AACA,YAAI,OAAO,iBAAiB,QAAW;AACrC,gBAAM,eAAe,OAAO;AAAA,QAC9B;AACA,YAAI,OAAO,gBAAgB,QAAW;AACpC,gBAAM,cAAc,OAAO;AAAA,QAC7B;AACA,mBAAW,KAAK,KAAK;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAY,IAAI;AAAA,IACpB,kBAAkB;AAAA,IAClB,kBAAkB;AAAA,EACpB;AACA,UAAQ,QAAQ,UAAU,KAAK,IAAI,OAAO,MAAM;AAC9C,UAAM,QAAQ,MAAM;AACpB,UAAM,MAAM,QAAQ,MAAM,CAAC,EAAE;AAC7B,UAAM,WAAW,WAAW;AAAA,MAC1B,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,SAAS,EAAE;AAAA,IACxC;AACA,QAAI,CAAC,UAAU;AACb,iBAAW,KAAK;AAAA,QACd,MAAM;AAAA,QACN,KAAK,MAAM,CAAC;AAAA,QACZ,OAAO,MAAM,CAAC,EAAE,KAAK;AAAA,QACrB;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAGA,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAG3C,QAAM,cAAkC,CAAC;AACzC,QAAM,UAAU,oBAAI,IAAc;AAClC,QAAM,eAAe,WAAW;AAAA,IAC9B,CAAC,MACC,EAAE,SAAS;AAAA,EACf;AACA;AAAA,IACE,aAAa,IAAI,CAAC,OAAO,EAAE,aAAa,EAAE,aAAa,MAAM,EAAE,MAAM,EAAE;AAAA,EACzE,EAAE,QAAQ,CAAC,QAAQ,MAAM;AACvB,UAAM,MAAM,aAAa,CAAC;AAC1B,UAAM,SAAS,OAAO;AACtB,QAAI,CAAC,OAAO,OAAO;AACjB,UAAI,QAAQ,cAAc,IAAI,gBAAgB,OAAO;AAEnD,YAAI,QAAQ,OAAO;AACnB,YAAI,aAAa,OAAO;AAAA,MAC1B;AACA;AAAA,IACF;AACA,YAAQ,IAAI,GAAG;AACf,QAAI,OAAO,UAAU,qBAAqB;AAExC,UAAI,IAAI,gBAAgB,MAAO;AAC/B,kBAAY,KAAK;AAAA,QACf,MAAM,OAAO;AAAA,QACb,SAAS,sBAAsB,IAAI,GAAG,MAAM,QAAQ,SAAS,sBAAsB;AAAA,QACnF,MAAM,QAAQ,WAAW,IAAI;AAAA,QAC7B,OAAO,IAAI;AAAA,QACX,KAAK,IAAI;AAAA,MACX,CAAC;AACD;AAAA,IACF;AACA,gBAAY,KAAK;AAAA,MACf,MAAM,OAAO;AAAA,MACb,SACE,OAAO,UAAU,qBACb,YAAY,IAAI,GAAG,6BAA6B,IAAI,KAAK,OACzD,IAAI,IAAI,GAAG;AAAA,MACjB,MAAM,IAAI;AAAA,MACV,OAAO,IAAI;AAAA,MACX,KAAK,IAAI;AAAA,IACX,CAAC;AAAA,EACH,CAAC;AAED,cAAY,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAE5C,QAAM,SAAkB,CAAC;AACzB,MAAI,aAAa;AAEjB,QAAM,WAAW,CAAC,OAAe,QAAgB;AAC/C,UAAM,WAAW,OAAO,OAAO,SAAS,CAAC;AACzC,QAAI,UAAU,SAAS,UAAU,SAAS,QAAQ,OAAO;AAEvD,eAAS,MAAM,SAAS,QAAQ,KAAK,MAAM,SAAS,OAAO,GAAG;AAC9D,eAAS,MAAM;AACf;AAAA,IACF;AACA,UAAM,YAAY,KAAK,MAAM,OAAO,GAAG;AACvC,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,KAAK;AAAA,MACL,OAAO;AAAA,MACP;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAEA,aAAW,KAAK,YAAY;AAC1B,QAAI,EAAE,QAAQ,YAAY;AACxB,eAAS,YAAY,EAAE,KAAK;AAAA,IAC9B;AACA,QAAI,QAAQ,IAAI,CAAC,GAAG;AAClB,eAAS,EAAE,OAAO,EAAE,GAAG;AAAA,IACzB,OAAO;AACL,aAAO,KAAK,EAAE,GAAG,EAAE,CAAC;AAAA,IACtB;AACA,iBAAa,EAAE;AAAA,EACjB;AAEA,MAAI,aAAa,KAAK,QAAQ;AAC5B,aAAS,YAAY,KAAK,MAAM;AAAA,EAClC;AAEA,SAAO,EAAE,QAAQ,YAAY;AAC/B;;;AClMO,SAAS,iBACd,UAC6B;AAC7B,MAAI,CAAC,SAAS,YAAY,SAAS,SAAS,WAAW,GAAG;AACxD,QAAI,SAAS,SAAS,QAAW;AAC/B,aAAO;AAAA,QACL,IAAI,SAAS,MAAM;AAAA,QACnB,SAAS;AAAA,QACT,MAAM,SAAS;AAAA,MACjB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,MAAI,SAAS,eAAe;AAC1B,UAAM,QAAQ,SAAS,SAAS;AAAA,MAC9B,CAAC,MAAM,EAAE,YAAY,SAAS;AAAA,IAChC;AACA,QAAI,MAAO,QAAO;AAAA,EACpB;AACA,SAAO,SAAS,SAAS,SAAS,SAAS,SAAS,CAAC;AACvD;AAGO,IAAM,sBAAsB;AAE5B,IAAM,uBAAuB;AAK7B,SAAS,gBACd,UACA,UACoB;AACpB,QAAM,iBAAiB,WAAW,SAAS,IAAI;AAC/C,MAAI,kBAAkB,SAAS,UAAU;AACvC,UAAM,eAAe,SAAS,SAAS;AAAA,MACrC,CAAC,MAAM,EAAE,OAAO,kBAAkB,EAAE,YAAY;AAAA,IAClD;AACA,WAAO,cAAc;AAAA,EACvB;AACA,SAAO,iBAAiB,QAAQ,GAAG,QAAQ,SAAS;AACtD;AAuBA,IAAM,SAAN,MAAa;AAAA,EAEX,YAAqB,UAA4B;AAA5B;AAAA,EAA6B;AAAA,EAA7B;AAAA,EADrB,OAAO;AAAA;AAAA,EAIP,IAAI,UAAkB,QAAgB,OAAe,SAAS,OAAO;AACnE,UAAM,gBAAgB,KAAK,KAAK;AAChC,SAAK,QAAQ;AACb,QAAI,CAAC,KAAK,SAAU;AACpB,UAAM,OAAO,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC;AACnD,QACE,CAAC,UACD,QACA,KAAK,WAAW,SAChB,CAAC,KAAK,UACN,KAAK,WAAW,YAChB,KAAK,gBAAgB,eACrB;AACA,WAAK,SAAS;AACd,WAAK,cAAc,KAAK,KAAK;AAC7B;AAAA,IACF;AACA,SAAK,SAAS,KAAK;AAAA,MACjB;AAAA,MACA,aAAa,KAAK,KAAK;AAAA,MACvB,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAC7B,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,SACE,UACA,QACA,OACA,OAIA;AACA,UAAM,gBAAgB,KAAK,KAAK;AAChC,SAAK,QAAQ;AACb,SAAK,UAAU,KAAK;AAAA,MAClB;AAAA,MACA,aAAa,KAAK,KAAK;AAAA,MACvB;AAAA,MACA;AAAA,MACA,GAAG;AAAA,IACL,CAAC;AAAA,EACH;AACF;AAGA,SAAS,aAAa,QAAsC;AAC1D,QAAM,QAAQ,oBAAI,IAAoB;AACtC,QAAM,QAAkB,CAAC;AACzB,SAAO,QAAQ,CAAC,OAAO,UAAU;AAC/B,QAAI,MAAM,SAAS,cAAe;AAClC,QAAI,MAAM,gBAAgB,OAAO;AAC/B,YAAM,OAAO,MAAM,IAAI;AACvB,UAAI,SAAS,OAAW,OAAM,IAAI,MAAM,KAAK;AAAA,IAC/C,OAAO;AACL,YAAM,KAAK,KAAK;AAAA,IAClB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAgBO,SAAS,cACd,MACA,YAAwB,CAAC,GACzB,UAAgC,CAAC,GACZ;AACrB,QAAM,cAAc,oBAAI,IAAsB;AAC9C,aAAW,KAAK,WAAW;AACzB,gBAAY,IAAI,EAAE,MAAM,CAAC;AAAA,EAC3B;AACA,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,SAAS,QAAQ;AACvB,QAAM,cAAkC,CAAC;AACzC,QAAM,WAAW,oBAAI,IAAY;AAEjC,WAAS,YACP,QACAA,MACA,SACA,OACA,cACM;AACN,UAAM,EAAE,QAAQ,aAAa,MAAM,IACjC,8BAA8B,MAAM;AACtC,eAAW,cAAc,OAAO;AAC9B,YAAM,MAAM,GAAG,gBAAgB,EAAE,KAAS,WAAW,KAAK,KAAS,WAAW,IAAI;AAClF,UAAI,SAAS,IAAI,GAAG,EAAG;AACvB,eAAS,IAAI,GAAG;AAChB,kBAAY;AAAA,QACV,iBAAiB,SAAY,aAAa,EAAE,GAAG,YAAY,aAAa;AAAA,MAC1E;AAAA,IACF;AACA,UAAM,QAAQ,SAAS,aAAa,MAAM,IAAI;AAE9C,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAM,QAAQ,OAAO,CAAC;AAEtB,UAAI,MAAM,SAAS,YAAY;AAC7B,cAAM,OAAO,MAAM;AACnB,YAAI,QAAQ,IAAI,IAAI,GAAG;AACrB,UAAAA,KAAI,SAAS,MAAM,OAAO,MAAM,KAAK,qBAAqB;AAAA,YACxD,QAAQ;AAAA,YACR,cAAc;AAAA,UAChB,CAAC;AACD;AAAA,QACF;AACA,cAAM,WAAW,YAAY,IAAI,IAAI;AACrC,cAAM,OAAO,WACT,gBAAgB,UAAU,QAAQ,QAAQ,IAC1C;AACJ,YAAI,SAAS,QAAW;AACtB,UAAAA,KAAI,IAAI,MAAM,OAAO,MAAM,KAAK,MAAM,KAAK,IAAI;AAC/C;AAAA,QACF;AACA,YAAI,QAAQ,IAAI,UAAU;AACxB,UAAAA,KAAI,SAAS,MAAM,OAAO,MAAM,KAAK,sBAAsB;AAAA,YACzD,QAAQ;AAAA,YACR,cAAc;AAAA,UAChB,CAAC;AACD;AAAA,QACF;AACA,cAAM,SAAS,IAAI,OAAO,IAAI;AAC9B,cAAM,cAAc,IAAI,IAAI,OAAO;AACnC,oBAAY,IAAI,IAAI;AACpB,oBAAY,MAAM,QAAQ,aAAa,QAAQ,GAAG,IAAI;AACtD,QAAAA,KAAI,SAAS,MAAM,OAAO,MAAM,KAAK,OAAO,MAAM;AAAA,UAChD,QAAQ;AAAA,UACR,cAAc;AAAA,QAChB,CAAC;AACD;AAAA,MACF;AAEA,UAAI,UAAU,MAAM,SAAS,YAAY;AACvC,cAAM,WAAW,iBAAiB,QAAQ,MAAM,KAAK;AACrD,cAAM,QAAQ,YAAY,MAAM;AAChC,YAAI,UAAU,QAAW;AACvB,UAAAA,KAAI,SAAS,MAAM,OAAO,MAAM,KAAK,OAAO;AAAA,YAC1C,QAAQ;AAAA,YACR,cAAc,MAAM;AAAA,YACpB,aAAa,aAAa,SAAY,UAAU;AAAA,UAClD,CAAC;AACD;AAAA,QACF;AAAA,MACF;AAEA,UAAI,UAAU,MAAM,SAAS,iBAAiB,MAAM,aAAa;AAC/D,cAAM,UAAU;AAAA,UACd,QAAQ;AAAA,UACR,cAAc,MAAM;AAAA,QACtB;AACA,YAAI,MAAM,gBAAgB,OAAO;AAC/B,gBAAM,QAAQ,MAAO,IAAI,CAAC;AAC1B,cACE,CAAC;AAAA,YACC,MAAM;AAAA,YACN,MAAM;AAAA,YACN;AAAA,YACA,MAAM;AAAA,UACR,GACA;AAEA,YAAAA,KAAI,SAAS,MAAM,OAAO,OAAO,KAAK,EAAE,KAAK,IAAI,OAAO;AACxD,gBAAI;AACJ;AAAA,UACF;AAAA,QACF;AACA,QAAAA,KAAI,SAAS,MAAM,OAAO,MAAM,KAAK,IAAI,OAAO;AAChD;AAAA,MACF;AAEA,MAAAA,KAAI,IAAI,MAAM,OAAO,MAAM,KAAK,MAAM,GAAG;AAAA,IAC3C;AAAA,EACF;AAEA,QAAM,MAAM,IAAI,OAAO,CAAC,CAAC;AACzB,cAAY,MAAM,KAAK,oBAAI,IAAI,GAAG,GAAG,MAAS;AAE9C,QAAM,MAA0B,IAAI,SAAU;AAAA,IAC5C,CAAC,EAAE,QAAQ,SAAS,GAAG,QAAQ,MAAM;AAAA,EACvC;AACA,MAAI,IAAI,WAAW,GAAG;AACpB,QAAI,KAAK;AAAA,MACP,eAAe;AAAA,MACf,aAAa;AAAA,MACb,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,QAAQ;AAAA,IACV,CAAC;AAAA,EACH;AACA,SAAO,EAAE,MAAM,IAAI,MAAM,KAAK,YAAY;AAC5C;AAiBO,SAAS,qBACd,MACA,QACkB;AAClB,QAAM,SAAS,8BAA8B,IAAI,EAAE;AACnD,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,QAAQ,aAAa,MAAM;AACjC,QAAM,SAA2B,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,QAAQ,OAAO,CAAC;AACtB,QAAI,MAAM,SAAS,eAAe;AAChC,UACE,MAAM,gBAAgB,SACtB,CAAC;AAAA,QACC,MAAM;AAAA,QACN,MAAM;AAAA,QACN;AAAA,QACA,MAAM;AAAA,MACR,GACA;AACA,YAAI,MAAM,IAAI,CAAC;AAAA,MACjB;AACA;AAAA,IACF;AACA,QAAI,MAAM,SAAS,YAAY;AAC7B,YAAM,WAAW,iBAAiB,QAAQ,MAAM,KAAK;AACrD,YAAM,QAAQ,YAAY,MAAM;AAChC,UAAI,UAAU,QAAW;AACvB,eAAO,KAAK;AAAA,UACV,GAAG;AAAA,UACH,eAAe;AAAA,UACf,aAAa,aAAa,SAAY,UAAU;AAAA,QAClD,CAAC;AACD;AAAA,MACF;AAAA,IACF;AACA,WAAO,KAAK,KAAK;AAAA,EACnB;AACA,SAAO;AACT;","names":["out"]}

package/dist/chunk-HLIMTC6N.js

@@ -0,0 +1 @@
+//# sourceMappingURL=chunk-HLIMTC6N.js.map

package/dist/chunk-HLIMTC6N.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}