@bendyline/squisq 1.4.0 → 1.5.0

package/dist/chunk-OH43RPTP.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/markdown/annotationCoercion.ts","../src/markdown/attrTokens.ts","../src/markdown/convert.ts","../src/markdown/parse.ts"],"sourcesContent":["/**\n * Heading-attribute value coercion.\n *\n * The Pandoc-style heading attribute block `{#id .class key=value}` parses\n * to a flat `Record<string, string>` of `key → raw value`. This module\n * coerces a known subset of keys to typed values (numbers, time-in-seconds,\n * `BlockConnection[]`) so downstream consumers don't have to re-parse them.\n *\n * Unknown keys are returned in `metadata` as raw strings. Malformed known-key\n * values are dropped from the typed result and reported via `warnings` (the\n * raw string is preserved in `params` upstream for lossless round-tripping —\n * coercion failures do not corrupt the source).\n */\n\nimport type { BlockConnection } from './types.js';\nimport type { TransitionDirection, TransitionType } from '../schemas/Transitions.js';\nimport {\n  normalizeTransitionDirection,\n  normalizeTransitionType,\n  TRANSITION_TYPES,\n  TRANSITION_DIRECTIONS,\n} from '../schemas/Transitions.js';\n\n/**\n * Registry of known block-meta keys and their coercion strategies.\n *\n * Adding a new typed key: add an entry here, add the typed field to\n * `HeadingAttributes.blockMeta` in `types.ts`, and apply the coerced value\n * in `markdownToDoc.ts`.\n */\nexport const KNOWN_BLOCK_META_KEYS = {\n  x: 'number',\n  y: 'number',\n  startTime: 'time',\n  duration: 'time',\n  connectsTo: 'connectionList',\n  transition: 'transition',\n  transitionDuration: 'time',\n  transitionDirection: 'transitionDirection',\n} as const;\n\nexport type KnownBlockMetaKey = keyof typeof KNOWN_BLOCK_META_KEYS;\n\n/**\n * Editor-facing description of a known block-meta key: what it does, and\n * either its closed set of valid values or a free-form format hint. This is\n * the single source the markdown editor's `{[name key=value]}` attribute\n * autocomplete reads from, so the suggestion list stays in lockstep with\n * `KNOWN_BLOCK_META_KEYS` and the transition vocabulary rather than drifting\n * in a hand-maintained copy. `values`/`valueHint` are mutually exclusive: a\n * key has a closed enum (`values`) or a format hint (`valueHint`), not both.\n */\nexport interface BlockMetaKeyDescriptor {\n  key: KnownBlockMetaKey;\n  /** One-line description, shown as the completion item's detail. */\n  description: string;\n  /** Closed set of valid values, for keys backed by an enum. */\n  values?: readonly string[];\n  /** Format hint shown when the value is free-form (no closed set). */\n  valueHint?: string;\n}\n\n/**\n * Ordered descriptors for every key in `KNOWN_BLOCK_META_KEYS`. Order is the\n * suggestion display order: the transition family first (the most common\n * authoring case), then timeline timing, then diagram geometry/links.\n */\nexport const BLOCK_META_KEY_DESCRIPTORS: readonly BlockMetaKeyDescriptor[] = [\n  {\n    key: 'transition',\n    description: 'Block-to-block transition effect',\n    values: TRANSITION_TYPES,\n  },\n  {\n    key: 'transitionDuration',\n    description: 'How long the transition lasts',\n    valueHint: 'seconds — e.g. 0.7, 700ms',\n  },\n  {\n    key: 'transitionDirection',\n    description: 'Directional variant for the transition',\n    values: TRANSITION_DIRECTIONS,\n  },\n  {\n    key: 'startTime',\n    description: 'Timeline start time of this block',\n    valueHint: 'mm:ss or seconds — e.g. 01:30, 5, 1500ms',\n  },\n  {\n    key: 'duration',\n    description: 'How long this block lasts',\n    valueHint: 'mm:ss or seconds — e.g. 45, 1500ms',\n  },\n  {\n    key: 'x',\n    description: 'Horizontal position on the diagram canvas',\n    valueHint: 'number — e.g. 600',\n  },\n  {\n    key: 'y',\n    description: 'Vertical position on the diagram canvas',\n    valueHint: 'number — e.g. 300',\n  },\n  {\n    key: 'connectsTo',\n    description: 'Diagram connections to other blocks',\n    valueHint: 'comma-separated target or target:type — e.g. foo,bar:flow',\n  },\n];\n\n/**\n * The shape of the typed values produced by coercion. Mirrors\n * `HeadingAttributes.blockMeta` in `types.ts`.\n */\nexport interface CoercedBlockMeta {\n  x?: number;\n  y?: number;\n  startTime?: number;\n  duration?: number;\n  connectsTo?: BlockConnection[];\n  transition?: {\n    type: TransitionType;\n    duration?: number;\n    direction?: TransitionDirection;\n  };\n}\n\nexport interface CoerceResult {\n  /** Typed values for known keys whose coercion succeeded. */\n  blockMeta: CoercedBlockMeta;\n  /** Raw string values for keys not in the known-key registry. */\n  metadata: Record<string, string>;\n  /** Human-readable diagnostics — currently emitted for coercion failures. */\n  warnings: string[];\n}\n\n/**\n * Coerce a flat `key → raw string` map into typed block-meta + an\n * untyped metadata bag, per the `KNOWN_BLOCK_META_KEYS` registry.\n */\nexport function coerceAnnotationValues(params: Record<string, string>): CoerceResult {\n  const blockMeta: CoercedBlockMeta = {};\n  const metadata: Record<string, string> = {};\n  const warnings: string[] = [];\n  let transitionType: TransitionType | null = null;\n  let transitionDuration: number | undefined;\n  let transitionDirection: TransitionDirection | undefined;\n\n  for (const [key, raw] of Object.entries(params)) {\n    const kind = (KNOWN_BLOCK_META_KEYS as Record<string, string>)[key];\n    if (!kind) {\n      metadata[key] = raw;\n      continue;\n    }\n    if (kind === 'number') {\n      const n = parseNumber(raw);\n      if (n == null) {\n        warnings.push(`Invalid number for \"${key}\": ${JSON.stringify(raw)}`);\n      } else {\n        (blockMeta as Record<string, unknown>)[key] = n;\n      }\n    } else if (kind === 'time') {\n      const s = parseTimeSeconds(raw);\n      if (s == null) {\n        warnings.push(`Invalid time for \"${key}\": ${JSON.stringify(raw)}`);\n      } else if (key === 'transitionDuration') {\n        transitionDuration = s;\n      } else {\n        (blockMeta as Record<string, unknown>)[key] = s;\n      }\n    } else if (kind === 'connectionList') {\n      const { list, warning } = parseConnectionList(raw);\n      if (warning) warnings.push(`\"${key}\": ${warning}`);\n      blockMeta.connectsTo = list;\n    } else if (kind === 'transition') {\n      const transition = normalizeTransitionType(raw);\n      if (transition == null) {\n        warnings.push(`Invalid transition for \"${key}\": ${JSON.stringify(raw)}`);\n      } else {\n        transitionType = transition;\n      }\n    } else if (kind === 'transitionDirection') {\n      const direction = normalizeTransitionDirection(raw);\n      if (direction == null) {\n        warnings.push(`Invalid transition direction for \"${key}\": ${JSON.stringify(raw)}`);\n      } else {\n        transitionDirection = direction;\n      }\n    }\n  }\n\n  if (transitionType) {\n    blockMeta.transition = {\n      type: transitionType,\n      ...(transitionDuration !== undefined ? { duration: transitionDuration } : {}),\n      ...(transitionDirection !== undefined ? { direction: transitionDirection } : {}),\n    };\n  }\n\n  return { blockMeta, metadata, warnings };\n}\n\n// ============================================\n// Coercers\n// ============================================\n\n/** Parse a finite number from a string. Returns null on failure. */\nfunction parseNumber(raw: string): number | null {\n  if (raw.trim() === '') return null;\n  const n = Number(raw);\n  return Number.isFinite(n) ? n : null;\n}\n\nconst TIME_BARE_RE = /^\\d+(?:\\.\\d+)?$/;\nconst TIME_MS_RE = /^(\\d+(?:\\.\\d+)?)ms$/;\nconst TIME_MMSS_RE = /^(\\d+):(\\d{1,2})(?:\\.(\\d+))?$/;\n\n/**\n * Parse a time value to seconds. Accepts:\n * - bare number: `5` → 5, `5.5` → 5.5\n * - `mm:ss`: `01:30` → 90\n * - `mm:ss.ms`: `01:30.500` → 90.5\n * - `1500ms` → 1.5\n *\n * Returns null on malformed input.\n */\nexport function parseTimeSeconds(raw: string): number | null {\n  const trimmed = raw.trim();\n  if (!trimmed) return null;\n\n  if (TIME_BARE_RE.test(trimmed)) {\n    const n = Number(trimmed);\n    return Number.isFinite(n) ? n : null;\n  }\n\n  const msMatch = trimmed.match(TIME_MS_RE);\n  if (msMatch) {\n    const n = Number(msMatch[1]);\n    return Number.isFinite(n) ? n / 1000 : null;\n  }\n\n  const mmssMatch = trimmed.match(TIME_MMSS_RE);\n  if (mmssMatch) {\n    const mins = Number(mmssMatch[1]);\n    const secs = Number(mmssMatch[2]);\n    const frac = mmssMatch[3] ? Number(`0.${mmssMatch[3]}`) : 0;\n    if (!Number.isFinite(mins) || !Number.isFinite(secs) || !Number.isFinite(frac)) {\n      return null;\n    }\n    if (secs >= 60) return null;\n    return mins * 60 + secs + frac;\n  }\n\n  return null;\n}\n\n/**\n * Parse a comma-separated connection list. Each entry is `target` or\n * `target:type`. Empty entries (`a,,b`) are filtered with a warning; an\n * entirely empty input yields an empty list with no warning.\n */\nexport function parseConnectionList(raw: string): {\n  list: BlockConnection[];\n  warning: string | null;\n} {\n  const trimmed = raw.trim();\n  if (!trimmed) return { list: [], warning: null };\n\n  const list: BlockConnection[] = [];\n  let droppedEmpty = false;\n  for (const part of trimmed.split(',')) {\n    const entry = part.trim();\n    if (!entry) {\n      droppedEmpty = true;\n      continue;\n    }\n    const colonIdx = entry.indexOf(':');\n    if (colonIdx < 0) {\n      list.push({ target: entry });\n    } else {\n      const target = entry.slice(0, colonIdx).trim();\n      const type = entry.slice(colonIdx + 1).trim();\n      if (!target) {\n        droppedEmpty = true;\n        continue;\n      }\n      list.push(type ? { target, type } : { target });\n    }\n  }\n\n  return {\n    list,\n    warning: droppedEmpty ? 'dropped empty connection entries' : null,\n  };\n}\n","/**\n * Shared key=value attribute machinery for the two heading annotation forms:\n * the squisq-native `{[templateName key=value …]}` template annotation and\n * the Pandoc-style `{#id .class key=value}` attribute block.\n *\n * Both forms share one interior grammar — whitespace-separated tokens whose\n * values may be quoted (double or single) to include spaces, brackets, or\n * quote characters. This module is the single implementation of that\n * grammar: one tokenizer, one value un/escaper, one quoting rule. The\n * trailing-annotation recognizers live here too so the editor bridge\n * (packages/editor-react/src/tiptapBridge.ts) stays in sync by importing\n * them rather than copying regexes.\n *\n * Value syntax:\n * - Unquoted: no whitespace, quotes, or `[ ] { }` (those would collide with\n *   the surrounding annotation delimiters), e.g. `columns=3`, `name=O'Brien`\n *   (a quote *inside* an unquoted value is literal).\n * - Quoted: `key=\"value with spaces\"` or `key='…'`. Inside a quoted run,\n *   `\\` escapes the active quote character and itself; any other `\\` is\n *   literal. Quoted values may contain `]` and `}`.\n * - Serialization emits double quotes, switching to single quotes when the\n *   value contains a double quote (markdown character-escape resolution\n *   makes backslash-escaped quotes fragile in `.md` source, so picking the\n *   other quote character is preferred over escaping). A value containing\n *   BOTH quote characters falls back to double quotes with `\\\"` escapes —\n *   that survives the API path but is best avoided in markdown source.\n */\n\n// ============================================\n// Trailing-annotation recognizers\n// ============================================\n\n/** Regex source for a double-quoted run with `\\\"` / `\\\\` escapes. */\nconst DQ_RUN = `\"(?:[^\"\\\\\\\\]|\\\\\\\\.)*\"`;\n/** Regex source for a single-quoted run with `\\'` / `\\\\` escapes. */\nconst SQ_RUN = `'(?:[^'\\\\\\\\]|\\\\\\\\.)*'`;\n\n/**\n * Quote-aware match for a trailing `{[…]}` annotation: the interior is any\n * mix of quoted runs and characters other than `]` and quotes, so quoted\n * values may contain `]`. The trailing `[\\s\\]}]*` tolerates an accidental\n * doubled `]}` that users sometimes type when learning the syntax.\n */\nconst TEMPLATE_STRICT_RE = new RegExp(\n  `\\\\s*\\\\{\\\\[((?:[^\\\\]\"']|${DQ_RUN}|${SQ_RUN})+)\\\\]\\\\}[\\\\s\\\\]}]*$`,\n);\n\n/**\n * Legacy fallback matching the pre-quote-aware grammar (`[^\\]]+` interior).\n * Tried after the strict form so inputs with unbalanced quotes keep parsing\n * exactly as they did before quote support landed.\n */\nconst TEMPLATE_LEGACY_RE = /\\s*\\{\\[([^\\]]+)\\]\\}[\\s\\]}]*$/;\n\n/**\n * Quote-aware match for a trailing Pandoc `{…}` block. The negative\n * lookahead `(?!\\[)` keeps it from colliding with the `{[…]}` template\n * form. Quoted values may contain `}`.\n */\nconst PANDOC_STRICT_RE = new RegExp(`\\\\s*\\\\{(?!\\\\[)((?:[^}\"']|${DQ_RUN}|${SQ_RUN})*)\\\\}\\\\s*$`);\n\n/** Legacy fallback for the Pandoc block (`[^}]*` interior). */\nconst PANDOC_LEGACY_RE = /\\s*\\{(?!\\[)([^}]*)\\}\\s*$/;\n\n/** Result of matching a trailing annotation against a text run. */\nexport interface TrailingAnnotationMatch {\n  /** Interior of the brace block (between `{[`/`{` and `]}`/`}`), untrimmed. */\n  inner: string;\n  /** Offset of the match start (including leading whitespace) in the input. */\n  index: number;\n}\n\nfunction matchTrailing(\n  text: string,\n  strict: RegExp,\n  legacy: RegExp,\n): TrailingAnnotationMatch | null {\n  const m = strict.exec(text) ?? legacy.exec(text);\n  return m ? { inner: m[1], index: m.index } : null;\n}\n\n/**\n * Match a trailing `{[templateName key=value …]}` annotation. Quote-aware\n * (values may contain `]` when quoted), with a legacy fallback so inputs\n * the old `[^\\]]+` grammar accepted still match.\n */\nexport function matchTrailingTemplateAnnotation(text: string): TrailingAnnotationMatch | null {\n  return matchTrailing(text, TEMPLATE_STRICT_RE, TEMPLATE_LEGACY_RE);\n}\n\n/**\n * Match a trailing Pandoc `{#id .class key=value}` block. Quote-aware\n * (values may contain `}` when quoted), with a legacy fallback.\n */\nexport function matchTrailingPandocAttr(text: string): TrailingAnnotationMatch | null {\n  return matchTrailing(text, PANDOC_STRICT_RE, PANDOC_LEGACY_RE);\n}\n\n// ============================================\n// Tokenizer\n// ============================================\n\nconst WHITESPACE_RE = /\\s/;\n\n/**\n * Quote-aware whitespace tokenizer for the interior of either annotation\n * form.\n *\n * A quote run starts only at the beginning of a token or immediately after\n * `=` — a quote elsewhere (e.g. `name=O'Brien`) is a literal character.\n * Inside a run, `\\` escapes the active quote character and itself; the\n * escape pair is preserved in the returned token (callers strip and\n * unescape via {@link splitKeyValueToken} / {@link unquoteAttrValue}).\n * An unbalanced opening quote is tolerated: the run extends to the end of\n * the input.\n */\nexport function tokenizeAttrTokens(input: string): string[] {\n  const tokens: string[] = [];\n  let i = 0;\n  const n = input.length;\n  while (i < n) {\n    while (i < n && WHITESPACE_RE.test(input[i])) i++;\n    if (i >= n) break;\n\n    let token = '';\n    while (i < n && !WHITESPACE_RE.test(input[i])) {\n      const ch = input[i];\n      const atValueStart = token === '' || token.endsWith('=');\n      if ((ch === '\"' || ch === \"'\") && atValueStart) {\n        token += ch;\n        i++;\n        while (i < n && input[i] !== ch) {\n          if (input[i] === '\\\\' && i + 1 < n && (input[i + 1] === ch || input[i + 1] === '\\\\')) {\n            token += input[i] + input[i + 1];\n            i += 2;\n          } else {\n            token += input[i];\n            i++;\n          }\n        }\n        if (i < n && input[i] === ch) {\n          token += ch;\n          i++;\n        }\n      } else {\n        token += ch;\n        i++;\n      }\n    }\n    if (token) tokens.push(token);\n  }\n  return tokens;\n}\n\n// ============================================\n// Value un/escaping\n// ============================================\n\nconst DQ_UNESCAPE_RE = /\\\\([\\\\\"])/g;\nconst SQ_UNESCAPE_RE = /\\\\([\\\\'])/g;\n\n/**\n * Strip surrounding quotes from a raw token value and unescape the active\n * quote character and backslash. Values not wrapped in matching quotes are\n * returned verbatim (including any interior quotes or backslashes).\n */\nexport function unquoteAttrValue(raw: string): string {\n  if (raw.length >= 2) {\n    const q = raw[0];\n    if ((q === '\"' || q === \"'\") && raw.endsWith(q)) {\n      const body = raw.slice(1, -1);\n      return body.replace(q === '\"' ? DQ_UNESCAPE_RE : SQ_UNESCAPE_RE, '$1');\n    }\n  }\n  return raw;\n}\n\n/**\n * Split a `key=value` token into its parts, unquoting/unescaping the value.\n * Returns null for tokens with no `=` past the first character (bare words,\n * `#id`, `.class`, or a leading `=`).\n */\nexport function splitKeyValueToken(token: string): { key: string; value: string } | null {\n  const eqIdx = token.indexOf('=');\n  if (eqIdx <= 0) return null;\n  return { key: token.slice(0, eqIdx), value: unquoteAttrValue(token.slice(eqIdx + 1)) };\n}\n\n// ============================================\n// Serialization\n// ============================================\n\nconst NEEDS_QUOTING_RE = /[\\s\"'[\\]{}]/;\nconst DQ_ESCAPE_RE = /[\\\\\"]/g;\nconst SQ_ESCAPE_RE = /[\\\\']/g;\n\n/**\n * Whether a value must be quoted to survive tokenization and the outer\n * annotation regexes: any whitespace, quote character, bracket, or brace —\n * or an empty value, which would otherwise serialize as a bare `key=`.\n */\nexport function needsQuoting(value: string): boolean {\n  return value === '' || NEEDS_QUOTING_RE.test(value);\n}\n\n/**\n * Serialize an attribute value, quoting when {@link needsQuoting} says the\n * bare form would not round-trip.\n *\n * Double quotes are canonical; a value containing a double quote (but no\n * single quote) is single-quoted instead, because markdown resolves\n * backslash escapes in text runs before our parser sees them — switching\n * the quote character round-trips through `.md` source where `\\\"` would\n * not. Backslashes and the active quote character are escaped.\n */\nexport function quoteAttrValue(value: string): string {\n  if (!needsQuoting(value)) return value;\n  if (value.includes('\"') && !value.includes(\"'\")) {\n    return `'${value.replace(SQ_ESCAPE_RE, (ch) => `\\\\${ch}`)}'`;\n  }\n  return `\"${value.replace(DQ_ESCAPE_RE, (ch) => `\\\\${ch}`)}\"`;\n}\n","/**\n * mdast ↔ Squisq Markdown Node Conversion\n *\n * Converts between the remark/mdast AST format and the squisq\n * MarkdownDocument JSON format. This is the bridge layer that allows\n * us to use the battle-tested unified/remark ecosystem for parsing\n * and serialization while exposing our own clean, well-typed interfaces.\n *\n * The conversion is designed for perfect round-tripping:\n * toMdast(fromMdast(tree)) should produce an equivalent mdast tree.\n */\n\nimport type {\n  MarkdownDocument,\n  MarkdownBlockNode,\n  MarkdownInlineNode,\n  MarkdownListItem,\n  MarkdownTableRow,\n  MarkdownTableCell,\n  MarkdownSourcePosition,\n  HeadingTemplateAnnotation,\n  HeadingAttributes,\n  MarkdownHeading,\n  MarkdownInlineIcon,\n} from './types.js';\nimport { parseHtmlToNodes } from './htmlParse.js';\nimport { resolveIcon } from '../icons/resolve.js';\nimport { coerceAnnotationValues } from './annotationCoercion.js';\nimport {\n  matchTrailingTemplateAnnotation,\n  matchTrailingPandocAttr,\n  tokenizeAttrTokens,\n  splitKeyValueToken,\n  quoteAttrValue,\n} from './attrTokens.js';\n\n// ============================================\n// Generic mdast node shape\n// ============================================\n\n/**\n * Minimal interface for mdast/unist nodes.\n * Using a generic shape avoids hard dependency on @types/mdast\n * and handles extension nodes (GFM, math, directive) uniformly.\n */\ninterface MdastPosition {\n  start: { line: number; column: number; offset?: number };\n  end: { line: number; column: number; offset?: number };\n}\n\ninterface MdastNode {\n  type: string;\n  position?: MdastPosition;\n  children?: MdastNode[];\n  value?: string;\n  depth?: number;\n  ordered?: boolean | null;\n  start?: number | null;\n  spread?: boolean | null;\n  checked?: boolean | null;\n  lang?: string | null;\n  meta?: string | null;\n  url?: string;\n  title?: string | null;\n  alt?: string;\n  identifier?: string;\n  label?: string;\n  referenceType?: string;\n  align?: (string | null)[];\n  name?: string;\n  attributes?: Record<string, string>;\n  data?: Record<string, unknown>;\n}\n\n// ============================================\n// Position conversion\n// ============================================\n\nfunction convertPosition(pos?: MdastPosition): MarkdownSourcePosition | undefined {\n  if (!pos) return undefined;\n  return {\n    start: {\n      line: pos.start.line,\n      column: pos.start.column,\n      ...(pos.start.offset != null ? { offset: pos.start.offset } : {}),\n    },\n    end: {\n      line: pos.end.line,\n      column: pos.end.column,\n      ...(pos.end.offset != null ? { offset: pos.end.offset } : {}),\n    },\n  };\n}\n\nfunction toMdastPosition(pos: MarkdownSourcePosition): MdastPosition {\n  return {\n    start: {\n      line: pos.start.line,\n      column: pos.start.column,\n      ...(pos.start.offset != null ? { offset: pos.start.offset } : {}),\n    },\n    end: {\n      line: pos.end.line,\n      column: pos.end.column,\n      ...(pos.end.offset != null ? { offset: pos.end.offset } : {}),\n    },\n  };\n}\n\n/** Conditionally include position in node. */\nfunction posField(\n  pos?: MarkdownSourcePosition,\n): { position: MarkdownSourcePosition } | Record<string, never> {\n  return pos ? { position: pos } : {};\n}\n\nfunction mdastPosField(\n  pos?: MarkdownSourcePosition,\n): { position: MdastPosition } | Record<string, never> {\n  return pos ? { position: toMdastPosition(pos) } : {};\n}\n\n// ============================================\n// mdast → Squisq (fromMdast)\n// ============================================\n\n/**\n * Extract plain text content from an mdast node tree.\n * Used for directive labels.\n */\nfunction extractText(node: MdastNode): string {\n  if (node.value != null) return node.value;\n  if (node.children) {\n    return node.children.map(extractText).join('');\n  }\n  return '';\n}\n\n// ============================================\n// Template annotation helpers\n// ============================================\n\n/**\n * Extract a `{[templateName key=value …]}` annotation from a heading's\n * inline children. Mutates the children array in-place: strips the\n * annotation text from the last text node (or removes the node entirely).\n *\n * Matching is delegated to {@link matchTrailingTemplateAnnotation}: a\n * quote-aware grammar (values may contain `]` when quoted) with a legacy\n * fallback, plus tolerance for an accidental doubled trailing `]}`. A\n * non-trailing annotation like `## The {[chart]} section` doesn't match.\n *\n * @returns The parsed annotation, or null if none found.\n */\nfunction extractTemplateAnnotation(\n  children: MarkdownInlineNode[],\n): HeadingTemplateAnnotation | null {\n  // Walk backwards to find the last text node\n  for (let i = children.length - 1; i >= 0; i--) {\n    const child = children[i];\n    if (child.type === 'text') {\n      const match = matchTrailingTemplateAnnotation(child.value);\n      if (match) {\n        const inner = match.inner.trim();\n        const annotation = parseAnnotationTokens(inner);\n\n        // Strip the matched portion from the text\n        const stripped = child.value.slice(0, match.index).replace(/\\s+$/, '');\n        if (stripped) {\n          (child as { value: string }).value = stripped;\n        } else {\n          // Remove the now-empty text node\n          children.splice(i, 1);\n        }\n        return annotation;\n      }\n      // Only check the last text node (trailing position)\n      break;\n    }\n    // If the last child isn't a text node, there's no annotation\n    break;\n  }\n  return null;\n}\n\n/**\n * Parse the inner content of a `{[…]}` annotation into template + params.\n *\n * Input: `\"chart colorScheme=blue caption=\\\"Sales by region\\\"\"`\n * Output: `{ template: 'chart', params: { colorScheme: 'blue', caption: 'Sales by region' } }`\n *\n * Tokenization is shared with the Pandoc attribute parser\n * ({@link tokenizeAttrTokens}), so quoting and escaping behave\n * identically in both annotation forms.\n */\nfunction parseAnnotationTokens(inner: string): HeadingTemplateAnnotation {\n  const tokens = tokenizeAttrTokens(inner);\n  const params: Record<string, string> = {};\n\n  // If the first token contains '=', there's no template name —\n  // the annotation is purely key-value (e.g., `{[audio=intro.mp3]}`).\n  const firstIsParam = tokens.length > 0 && tokens[0].indexOf('=') > 0;\n  const template = firstIsParam || tokens.length === 0 ? undefined : tokens[0];\n  const startIdx = firstIsParam ? 0 : 1;\n\n  for (let i = startIdx; i < tokens.length; i++) {\n    const kv = splitKeyValueToken(tokens[i]);\n    if (kv) {\n      params[kv.key] = kv.value;\n    }\n  }\n\n  const result: HeadingTemplateAnnotation = {};\n  if (template) {\n    result.template = template;\n  }\n  if (Object.keys(params).length > 0) {\n    result.params = params;\n  }\n  return result;\n}\n\n// ============================================\n// Pandoc-style heading attribute helpers\n// ============================================\n\n/**\n * Extract a trailing Pandoc-style `{…}` attribute block from a heading's\n * inline children. Matching is delegated to {@link matchTrailingPandocAttr}\n * (quote-aware — values may contain `}` when quoted — with a legacy\n * fallback; a `(?!\\[)` lookahead keeps it from colliding with the\n * squisq-native `{[…]}` template annotation).\n *\n * Unlike `extractTemplateAnnotation()`, this walks backward through both\n * text nodes AND bare `textDirective` nodes. remark-directive may have\n * fragmented a `{key=val:type,…}` attribute block at colon-prefixed\n * segments like `:type` that look like text directives but are really\n * attribute-value fragments. We virtually re-stitch the trailing run as a\n * single string, match against it, and only physically modify the children\n * array if a match is found — so a heading that legitimately contains a\n * non-bare `:directive` is left alone.\n *\n * Returns the parsed `HeadingAttributes`, or null if no match.\n */\nfunction extractPandocAttributes(children: MarkdownInlineNode[]): HeadingAttributes | null {\n  // Collect the trailing run of [text | bare textDirective] children.\n  const trail: { val: string; idx: number; len: number }[] = [];\n  for (let i = children.length - 1; i >= 0; i--) {\n    const c = children[i];\n    if (c.type === 'text') {\n      trail.unshift({ val: c.value, idx: i, len: c.value.length });\n    } else if (c.type === 'textDirective') {\n      const td = c as {\n        name?: string;\n        children?: unknown[];\n        attributes?: Record<string, string>;\n      };\n      const isBare =\n        (!td.children || td.children.length === 0) &&\n        (!td.attributes || Object.keys(td.attributes).length === 0);\n      if (!isBare) break;\n      const synthesized = ':' + (td.name ?? '');\n      trail.unshift({ val: synthesized, idx: i, len: synthesized.length });\n    } else {\n      break;\n    }\n  }\n  if (trail.length === 0) return null;\n\n  const joined = trail.map((t) => t.val).join('');\n  const match = matchTrailingPandocAttr(joined);\n  if (!match) return null;\n\n  const inner = match.inner.trim();\n  const attrs = parsePandocAttrTokens(inner);\n\n  // Strip the matched portion. `match.index` is an offset into `joined`.\n  // Walk forward through `trail` until we find the child that straddles\n  // the match boundary; trim that child (if text) or drop it (if directive),\n  // and remove everything after it from `children`.\n  const matchStart = match.index;\n  let scannedLen = 0;\n  for (let ti = 0; ti < trail.length; ti++) {\n    const t = trail[ti];\n    if (scannedLen + t.len <= matchStart) {\n      scannedLen += t.len;\n      continue;\n    }\n    const firstNode = children[t.idx];\n    const keepLen = matchStart - scannedLen;\n    if (firstNode.type === 'text') {\n      const trimmed = firstNode.value.slice(0, keepLen).replace(/\\s+$/, '');\n      if (trimmed) {\n        (firstNode as { value: string }).value = trimmed;\n        children.splice(t.idx + 1);\n      } else {\n        children.splice(t.idx);\n      }\n    } else {\n      // Match boundary fell inside a textDirective's synthesized \":name\"\n      // string — drop the directive and everything after.\n      children.splice(t.idx);\n    }\n    return attrs;\n  }\n  // Match consumes the entire trail.\n  children.splice(trail[0].idx);\n  return attrs;\n}\n\n/**\n * Parse the inner content of a Pandoc-style `{…}` block. Tokens are\n * whitespace-separated, with quoted runs (single or double) treated as\n * single tokens — tokenization is shared with the `{[…]}` template\n * annotation parser via {@link tokenizeAttrTokens}.\n *\n * - `#id` → `attributes.id`\n * - `.class` → push onto `attributes.classes`\n * - `key=value` or `key=\"quoted value\"` → `attributes.params[key] = value`\n *\n * Empty `{}` yields `{}` (preserved as an annotation marker for round-tripping).\n * Duplicate ids and keys: last wins, silent.\n */\nexport function parsePandocAttrTokens(inner: string): HeadingAttributes {\n  const tokens = tokenizeAttrTokens(inner);\n  const attrs: HeadingAttributes = {};\n  const params: Record<string, string> = {};\n  const classes: string[] = [];\n\n  for (const token of tokens) {\n    if (token.startsWith('#') && !token.includes('=')) {\n      attrs.id = token.slice(1);\n    } else if (token.startsWith('.') && !token.includes('=')) {\n      const cls = token.slice(1);\n      if (cls) classes.push(cls);\n    } else {\n      const kv = splitKeyValueToken(token);\n      if (kv) {\n        params[kv.key] = kv.value;\n      }\n    }\n  }\n\n  if (classes.length > 0) attrs.classes = classes;\n  if (Object.keys(params).length > 0) {\n    attrs.params = params;\n    const { blockMeta, metadata } = coerceAnnotationValues(params);\n    if (Object.keys(blockMeta).length > 0) attrs.blockMeta = blockMeta;\n    if (Object.keys(metadata).length > 0) attrs.metadata = metadata;\n  }\n  return attrs;\n}\n\n/**\n * Serialize a HeadingAttributes object back to a Pandoc `{#id .class key=value}` string.\n * Returns null when the attributes object is entirely empty (nothing to emit).\n *\n * Canonical key order: `#id`, then `.classes` (in original order), then\n * params in their original insertion order. Values are quoted via the\n * shared {@link quoteAttrValue} rule (same as `{[…]}` serialization).\n */\nexport function serializePandocAttributes(attrs: HeadingAttributes): string | null {\n  const parts: string[] = [];\n  if (attrs.id) parts.push(`#${attrs.id}`);\n  if (attrs.classes) {\n    for (const cls of attrs.classes) parts.push(`.${cls}`);\n  }\n  if (attrs.params) {\n    for (const [key, value] of Object.entries(attrs.params)) {\n      parts.push(`${key}=${quoteAttrValue(value)}`);\n    }\n  }\n  // Preserve an empty `{}` annotation marker if it was authored deliberately\n  // (e.g., reserved for downstream tooling). Caller decides whether to emit.\n  if (parts.length === 0) return '{}';\n  return `{${parts.join(' ')}}`;\n}\n\n/**\n * Serialize a HeadingTemplateAnnotation back to `{[templateName key=value …]}` text.\n * Values are quoted via the shared {@link quoteAttrValue} rule (same as\n * Pandoc attribute serialization).\n */\nfunction serializeTemplateAnnotation(annotation: HeadingTemplateAnnotation): string {\n  const parts: string[] = [];\n  if (annotation.template) {\n    parts.push(annotation.template);\n  }\n  if (annotation.params) {\n    for (const [key, value] of Object.entries(annotation.params)) {\n      parts.push(`${key}=${quoteAttrValue(value)}`);\n    }\n  }\n  return `{[${parts.join(' ')}]}`;\n}\n\n/**\n * Convert an mdast Root node to a MarkdownDocument.\n *\n * @param root - The mdast root node (from remark-parse)\n * @param options - Conversion options\n * @returns A MarkdownDocument\n */\nexport function fromMdast(root: MdastNode, options?: { parseHtml?: boolean }): MarkdownDocument {\n  const doParseHtml = options?.parseHtml !== false;\n  return {\n    type: 'document',\n    children: convertBlockChildren(root.children ?? [], doParseHtml),\n    ...posField(convertPosition(root.position)),\n  };\n}\n\nfunction convertBlockChildren(children: MdastNode[], parseHtml: boolean): MarkdownBlockNode[] {\n  const result: MarkdownBlockNode[] = [];\n  for (const child of children) {\n    const node = convertBlockNode(child, parseHtml);\n    if (node) result.push(node);\n  }\n  return result;\n}\n\nfunction convertInlineChildren(\n  children: MdastNode[],\n  parseHtml: boolean,\n  /** When false, skip the inline-icon split. Headings opt out so the\n   *  `extractTemplateAnnotation` pass still sees the trailing\n   *  `{[…]}` in raw text form; the caller runs `splitInlineIcons`\n   *  itself afterward on the remaining children. */\n  applyIconSplit: boolean = true,\n): MarkdownInlineNode[] {\n  const result: MarkdownInlineNode[] = [];\n  for (const child of children) {\n    const node = convertInlineNode(child, parseHtml);\n    if (node) result.push(node);\n  }\n  const mentioned = coalesceMentions(result);\n  return applyIconSplit ? splitInlineIcons(mentioned) : mentioned;\n}\n\n/**\n * Walk an inline-children list and split each text node on `{[token]}`\n * occurrences whose tokens resolve to known FontAwesome icons. Returns\n * a new array — unresolved tokens are left as literal text so authors\n * can write `{[notathing]}` verbatim if they really mean to.\n *\n * Exposed for the heading code path, which first strips the trailing\n * template annotation and then runs this on what remains.\n */\nexport function splitInlineIcons(nodes: MarkdownInlineNode[]): MarkdownInlineNode[] {\n  // First pass: reassemble `text + textDirective + text` patterns\n  // formed when a qualified token like `{[fa-solid:user]}` was split\n  // by remark-directive's colon recognition. We collapse those triples\n  // back into a single text node containing the original token so the\n  // regex below can match.\n  const recombined = recombineDirectiveTokens(nodes);\n\n  const out: MarkdownInlineNode[] = [];\n  for (const node of recombined) {\n    if (node.type !== 'text') {\n      out.push(node);\n      continue;\n    }\n    out.push(...splitTextOnIcons(node.value, node.position));\n  }\n  return out;\n}\n\n/**\n * When the user types `{[fa-solid:user]}`, remark's directive plugin\n * sees `:user` and emits a `textDirective` node. The result is a\n * three-node sequence `text(\"…{[fa-solid\") + textDirective(\"user\") +\n * text(\"]}…\")`. This helper detects that shape and stitches the three\n * back into one text node so downstream icon detection works on the\n * authored token.\n */\nfunction recombineDirectiveTokens(nodes: MarkdownInlineNode[]): MarkdownInlineNode[] {\n  const out: MarkdownInlineNode[] = [];\n  for (let i = 0; i < nodes.length; i++) {\n    const cur = nodes[i];\n    const next = nodes[i + 1];\n    const after = nodes[i + 2];\n    if (\n      cur?.type === 'text' &&\n      next?.type === 'textDirective' &&\n      after?.type === 'text' &&\n      /\\{\\[[a-zA-Z0-9_-]+$/.test(cur.value) &&\n      /^\\]\\}/.test(after.value)\n    ) {\n      const directive = next as unknown as { name?: string };\n      const directiveName = directive.name ?? '';\n      const merged: MarkdownInlineNode = {\n        type: 'text',\n        value: cur.value + ':' + directiveName + after.value,\n        ...(cur.position ? { position: cur.position } : {}),\n      };\n      out.push(merged);\n      i += 2;\n      continue;\n    }\n    out.push(cur);\n  }\n  return out;\n}\n\nconst ICON_TOKEN_RE = /\\{\\[([a-zA-Z0-9_:-]+)\\]\\}/g;\n\nfunction splitTextOnIcons(value: string, position?: MarkdownSourcePosition): MarkdownInlineNode[] {\n  if (!value) return [];\n  ICON_TOKEN_RE.lastIndex = 0;\n  let lastIndex = 0;\n  let match: RegExpExecArray | null;\n  const out: MarkdownInlineNode[] = [];\n  while ((match = ICON_TOKEN_RE.exec(value)) !== null) {\n    const token = match[1];\n    const icon = resolveIcon(token);\n    if (!icon) continue; // leave the literal `{[…]}` in place\n    if (match.index > lastIndex) {\n      out.push({\n        type: 'text',\n        value: value.slice(lastIndex, match.index),\n        ...(position ? { position } : {}),\n      });\n    }\n    const iconNode: MarkdownInlineIcon = {\n      type: 'inlineIcon',\n      token,\n      family: icon.family,\n      name: icon.name,\n      ...(position ? { position } : {}),\n    };\n    out.push(iconNode);\n    lastIndex = match.index + match[0].length;\n  }\n  if (lastIndex === 0) {\n    // No matches — return the original text node unchanged.\n    return [{ type: 'text', value, ...(position ? { position } : {}) }];\n  }\n  if (lastIndex < value.length) {\n    out.push({\n      type: 'text',\n      value: value.slice(lastIndex),\n      ...(position ? { position } : {}),\n    });\n  }\n  return out;\n}\n\n/**\n * Post-process an inline-children list to collapse `text('@') + link(scheme:id)`\n * pairs into a single `mention` node. The wire format `@[Display](scheme:id)`\n * comes back from remark as two adjacent nodes — we merge them so consumers\n * see a single atomic mention. A plain link whose URL doesn't have `scheme:id`\n * shape, or that isn't immediately preceded by `@`, is left alone so ordinary\n * links keep working.\n */\nfunction coalesceMentions(inlines: MarkdownInlineNode[]): MarkdownInlineNode[] {\n  const out: MarkdownInlineNode[] = [];\n  for (const cur of inlines) {\n    const prev = out[out.length - 1];\n    if (\n      cur.type === 'link' &&\n      typeof cur.url === 'string' &&\n      prev &&\n      prev.type === 'text' &&\n      prev.value.endsWith('@')\n    ) {\n      const schemeMatch = cur.url.match(/^([a-z][a-z0-9+.-]*):(.+)$/i);\n      if (schemeMatch && schemeMatch[1] && schemeMatch[2]) {\n        const targetKind = schemeMatch[1];\n        const targetId = schemeMatch[2];\n        const displayName = extractInlineText(cur.children);\n        if (prev.value === '@') {\n          out.pop();\n        } else {\n          prev.value = prev.value.slice(0, -1);\n        }\n        out.push({\n          type: 'mention',\n          targetKind,\n          targetId,\n          displayName,\n          ...(cur.position ? { position: cur.position } : {}),\n        });\n        continue;\n      }\n    }\n    out.push(cur);\n  }\n  return out;\n}\n\n/** Plain-text of an inline children list — used to pull the display name\n * out of a mention link's children. */\nfunction extractInlineText(nodes: MarkdownInlineNode[]): string {\n  let out = '';\n  for (const n of nodes) {\n    if (n.type === 'text' || n.type === 'inlineCode') out += n.value;\n    else if ('children' in n && Array.isArray(n.children)) {\n      out += extractInlineText(n.children as MarkdownInlineNode[]);\n    }\n  }\n  return out;\n}\n\nfunction convertBlockNode(node: MdastNode, parseHtml: boolean): MarkdownBlockNode | null {\n  const pos = convertPosition(node.position);\n\n  switch (node.type) {\n    case 'heading': {\n      // Defer icon splitting so `extractTemplateAnnotation` sees the\n      // trailing `{[name]}` as plain text and can decide whether it's\n      // a template annotation. Anything that's NOT the template still\n      // needs to become an icon node, so we run `splitInlineIcons` on\n      // what's left after the template extraction.\n      //\n      // Both annotation forms ({[…]} and Pandoc {#…}) may appear at the\n      // end of the heading in either order. Extract them in a loop so\n      // we catch the second-from-last one too. A small bounded retry\n      // (max 4) is plenty — authors don't stack more than two trailing\n      // brace-blocks in practice.\n      const headingChildren = convertInlineChildren(node.children ?? [], parseHtml, false);\n      let annotation: HeadingTemplateAnnotation | null = null;\n      let attrs: HeadingAttributes | null = null;\n      for (let pass = 0; pass < 4; pass++) {\n        let matched = false;\n        if (!annotation) {\n          const t = extractTemplateAnnotation(headingChildren);\n          if (t) {\n            annotation = t;\n            matched = true;\n          }\n        }\n        if (!attrs) {\n          const a = extractPandocAttributes(headingChildren);\n          if (a) {\n            attrs = a;\n            matched = true;\n          }\n        }\n        if (!matched) break;\n      }\n      const finalChildren = splitInlineIcons(headingChildren);\n      const result: MarkdownHeading = {\n        type: 'heading',\n        depth: (node.depth ?? 1) as 1 | 2 | 3 | 4 | 5 | 6,\n        children: finalChildren,\n        ...posField(pos),\n      };\n      if (annotation) {\n        result.templateAnnotation = annotation;\n      }\n      if (attrs) {\n        result.attributes = attrs;\n      }\n      return result;\n    }\n\n    case 'paragraph':\n      return {\n        type: 'paragraph',\n        children: convertInlineChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'blockquote':\n      return {\n        type: 'blockquote',\n        children: convertBlockChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'list':\n      return {\n        type: 'list',\n        ordered: node.ordered ?? false,\n        ...(node.start != null ? { start: node.start } : {}),\n        ...(node.spread != null ? { spread: node.spread } : {}),\n        children: (node.children ?? []).map((item) => convertListItem(item, parseHtml)),\n        ...posField(pos),\n      };\n\n    case 'code':\n      return {\n        type: 'code',\n        ...(node.lang != null ? { lang: node.lang } : {}),\n        ...(node.meta != null ? { meta: node.meta } : {}),\n        value: node.value ?? '',\n        ...posField(pos),\n      };\n\n    case 'thematicBreak':\n      return {\n        type: 'thematicBreak',\n        ...posField(pos),\n      };\n\n    case 'table':\n      return {\n        type: 'table',\n        ...(node.align\n          ? { align: node.align.map((a) => a as 'left' | 'right' | 'center' | null) }\n          : {}),\n        children: (node.children ?? []).map((row, i) => convertTableRow(row, i === 0, parseHtml)),\n        ...posField(pos),\n      };\n\n    case 'html':\n      return {\n        type: 'htmlBlock',\n        rawHtml: node.value ?? '',\n        htmlChildren: parseHtml ? parseHtmlToNodes(node.value ?? '') : [],\n        ...posField(pos),\n      };\n\n    case 'math':\n      return {\n        type: 'math',\n        value: node.value ?? '',\n        ...(node.meta != null ? { meta: node.meta } : {}),\n        ...posField(pos),\n      };\n\n    case 'definition':\n      return {\n        type: 'definition',\n        identifier: node.identifier ?? '',\n        ...(node.label != null ? { label: node.label } : {}),\n        url: node.url ?? '',\n        ...(node.title != null ? { title: node.title } : {}),\n        ...posField(pos),\n      };\n\n    case 'footnoteDefinition':\n      return {\n        type: 'footnoteDefinition',\n        identifier: node.identifier ?? '',\n        ...(node.label != null ? { label: node.label } : {}),\n        children: convertBlockChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'containerDirective': {\n      const allChildren = node.children ?? [];\n      let label: string | undefined;\n      let contentChildren = allChildren;\n\n      // Extract directive label (first paragraph with directiveLabel flag)\n      if (\n        allChildren.length > 0 &&\n        allChildren[0].type === 'paragraph' &&\n        allChildren[0].data?.directiveLabel === true\n      ) {\n        label = extractText(allChildren[0]);\n        contentChildren = allChildren.slice(1);\n      }\n\n      return {\n        type: 'containerDirective',\n        name: node.name ?? '',\n        ...(label ? { label } : {}),\n        ...(node.attributes && Object.keys(node.attributes).length > 0\n          ? { attributes: node.attributes }\n          : {}),\n        children: convertBlockChildren(contentChildren, parseHtml),\n        ...posField(pos),\n      };\n    }\n\n    case 'leafDirective':\n      return {\n        type: 'leafDirective',\n        name: node.name ?? '',\n        ...(node.attributes && Object.keys(node.attributes).length > 0\n          ? { attributes: node.attributes }\n          : {}),\n        children: convertInlineChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'yaml':\n      // YAML frontmatter nodes are handled separately in parse.ts — skip silently\n      return null;\n\n    default:\n      // Unknown block node — skip with a warning\n      if (typeof console !== 'undefined') {\n        console.warn(`[squisq/markdown] Unknown mdast block node type: \"${node.type}\"`);\n      }\n      return null;\n  }\n}\n\nfunction convertListItem(node: MdastNode, parseHtml: boolean): MarkdownListItem {\n  const pos = convertPosition(node.position);\n  return {\n    type: 'listItem',\n    ...(node.checked != null ? { checked: node.checked } : {}),\n    ...(node.spread != null ? { spread: node.spread } : {}),\n    children: convertBlockChildren(node.children ?? [], parseHtml),\n    ...posField(pos),\n  };\n}\n\nfunction convertTableRow(node: MdastNode, isHeader: boolean, parseHtml: boolean): MarkdownTableRow {\n  const pos = convertPosition(node.position);\n  return {\n    type: 'tableRow',\n    children: (node.children ?? []).map((cell) => convertTableCell(cell, isHeader, parseHtml)),\n    ...posField(pos),\n  };\n}\n\nfunction convertTableCell(\n  node: MdastNode,\n  isHeader: boolean,\n  parseHtml: boolean,\n): MarkdownTableCell {\n  const pos = convertPosition(node.position);\n  return {\n    type: 'tableCell',\n    ...(isHeader ? { isHeader: true } : {}),\n    children: convertInlineChildren(node.children ?? [], parseHtml),\n    ...posField(pos),\n  };\n}\n\nfunction convertInlineNode(node: MdastNode, parseHtml: boolean): MarkdownInlineNode | null {\n  const pos = convertPosition(node.position);\n\n  switch (node.type) {\n    case 'text':\n      return {\n        type: 'text',\n        value: node.value ?? '',\n        ...posField(pos),\n      };\n\n    case 'emphasis':\n      return {\n        type: 'emphasis',\n        children: convertInlineChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'strong':\n      return {\n        type: 'strong',\n        children: convertInlineChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'delete':\n      return {\n        type: 'delete',\n        children: convertInlineChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'inlineCode':\n      return {\n        type: 'inlineCode',\n        value: node.value ?? '',\n        ...posField(pos),\n      };\n\n    case 'link':\n      return {\n        type: 'link',\n        url: node.url ?? '',\n        ...(node.title != null ? { title: node.title } : {}),\n        children: convertInlineChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'image':\n      return {\n        type: 'image',\n        url: node.url ?? '',\n        ...(node.alt != null ? { alt: node.alt } : {}),\n        ...(node.title != null ? { title: node.title } : {}),\n        ...posField(pos),\n      };\n\n    case 'break':\n      return {\n        type: 'break',\n        ...posField(pos),\n      };\n\n    case 'html':\n      return {\n        type: 'htmlInline',\n        rawHtml: node.value ?? '',\n        htmlChildren: parseHtml ? parseHtmlToNodes(node.value ?? '') : [],\n        ...posField(pos),\n      };\n\n    case 'inlineMath':\n      return {\n        type: 'inlineMath',\n        value: node.value ?? '',\n        ...posField(pos),\n      };\n\n    case 'footnoteReference':\n      return {\n        type: 'footnoteReference',\n        identifier: node.identifier ?? '',\n        ...(node.label != null ? { label: node.label } : {}),\n        ...posField(pos),\n      };\n\n    case 'linkReference':\n      return {\n        type: 'linkReference',\n        identifier: node.identifier ?? '',\n        ...(node.label != null ? { label: node.label } : {}),\n        referenceType: (node.referenceType ?? 'full') as 'full' | 'collapsed' | 'shortcut',\n        children: convertInlineChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    case 'imageReference':\n      return {\n        type: 'imageReference',\n        identifier: node.identifier ?? '',\n        ...(node.label != null ? { label: node.label } : {}),\n        referenceType: (node.referenceType ?? 'full') as 'full' | 'collapsed' | 'shortcut',\n        ...(node.alt != null ? { alt: node.alt } : {}),\n        ...posField(pos),\n      };\n\n    case 'textDirective':\n      return {\n        type: 'textDirective',\n        name: node.name ?? '',\n        ...(node.attributes && Object.keys(node.attributes).length > 0\n          ? { attributes: node.attributes }\n          : {}),\n        children: convertInlineChildren(node.children ?? [], parseHtml),\n        ...posField(pos),\n      };\n\n    default:\n      if (typeof console !== 'undefined') {\n        console.warn(`[squisq/markdown] Unknown mdast inline node type: \"${node.type}\"`);\n      }\n      return null;\n  }\n}\n\n// ============================================\n// Squisq → mdast (toMdast)\n// ============================================\n\n/**\n * Convert a MarkdownDocument back to an mdast Root node.\n *\n * @param doc - A MarkdownDocument\n * @returns An mdast Root node suitable for remark-stringify\n */\nexport function toMdast(doc: MarkdownDocument): MdastNode {\n  return {\n    type: 'root',\n    children: doc.children.map((n) => blockToMdast(n)),\n    ...mdastPosField(doc.position),\n  };\n}\n\nfunction blockToMdast(node: MarkdownBlockNode): MdastNode {\n  switch (node.type) {\n    case 'heading': {\n      const mdastChildren = inlineChildrenToMdast(node.children);\n      // Canonical trailing order: Pandoc attrs first, then template annotation.\n      // Author-supplied order is not preserved across round-trips by design —\n      // canonicalization gives stable diffs.\n      const suffixes: string[] = [];\n      if (node.attributes) {\n        const pandoc = serializePandocAttributes(node.attributes);\n        if (pandoc != null) suffixes.push(pandoc);\n      }\n      if (node.templateAnnotation) {\n        suffixes.push(serializeTemplateAnnotation(node.templateAnnotation));\n      }\n      if (suffixes.length > 0) {\n        const suffix = suffixes.join(' ');\n        const lastChild = mdastChildren[mdastChildren.length - 1];\n        if (lastChild && lastChild.type === 'text') {\n          lastChild.value = (lastChild.value ?? '') + ' ' + suffix;\n        } else {\n          mdastChildren.push({ type: 'text', value: ' ' + suffix });\n        }\n      }\n      return {\n        type: 'heading',\n        depth: node.depth,\n        children: mdastChildren,\n        ...mdastPosField(node.position),\n      };\n    }\n\n    case 'paragraph':\n      return {\n        type: 'paragraph',\n        children: inlineChildrenToMdast(node.children),\n        ...mdastPosField(node.position),\n      };\n\n    case 'blockquote':\n      return {\n        type: 'blockquote',\n        children: node.children.map(blockToMdast),\n        ...mdastPosField(node.position),\n      };\n\n    case 'list':\n      return {\n        type: 'list',\n        ordered: node.ordered,\n        ...(node.start != null ? { start: node.start } : {}),\n        ...(node.spread != null ? { spread: node.spread } : {}),\n        children: node.children.map(listItemToMdast),\n        ...mdastPosField(node.position),\n      };\n\n    case 'code':\n      return {\n        type: 'code',\n        ...(node.lang != null ? { lang: node.lang } : {}),\n        ...(node.meta != null ? { meta: node.meta } : {}),\n        value: node.value,\n        ...mdastPosField(node.position),\n      };\n\n    case 'thematicBreak':\n      return {\n        type: 'thematicBreak',\n        ...mdastPosField(node.position),\n      };\n\n    case 'table':\n      return {\n        type: 'table',\n        ...(node.align ? { align: node.align } : {}),\n        children: node.children.map(tableRowToMdast),\n        ...mdastPosField(node.position),\n      };\n\n    case 'htmlBlock':\n      return {\n        type: 'html',\n        value: node.rawHtml,\n        ...mdastPosField(node.position),\n      };\n\n    case 'math':\n      return {\n        type: 'math',\n        value: node.value,\n        ...(node.meta != null ? { meta: node.meta } : {}),\n        ...mdastPosField(node.position),\n      };\n\n    case 'definition':\n      return {\n        type: 'definition',\n        identifier: node.identifier,\n        ...(node.label != null ? { label: node.label } : {}),\n        url: node.url,\n        ...(node.title != null ? { title: node.title } : {}),\n        ...mdastPosField(node.position),\n      };\n\n    case 'footnoteDefinition':\n      return {\n        type: 'footnoteDefinition',\n        identifier: node.identifier,\n        ...(node.label != null ? { label: node.label } : {}),\n        children: node.children.map(blockToMdast),\n        ...mdastPosField(node.position),\n      };\n\n    case 'containerDirective': {\n      const children: MdastNode[] = [];\n\n      // Reinject label as first paragraph with directiveLabel flag\n      if (node.label) {\n        children.push({\n          type: 'paragraph',\n          data: { directiveLabel: true },\n          children: [{ type: 'text', value: node.label }],\n        });\n      }\n\n      children.push(...node.children.map(blockToMdast));\n\n      return {\n        type: 'containerDirective',\n        name: node.name,\n        ...(node.attributes ? { attributes: node.attributes } : {}),\n        children,\n        ...mdastPosField(node.position),\n      };\n    }\n\n    case 'leafDirective':\n      return {\n        type: 'leafDirective',\n        name: node.name,\n        ...(node.attributes ? { attributes: node.attributes } : {}),\n        children: inlineChildrenToMdast(node.children),\n        ...mdastPosField(node.position),\n      };\n\n    case 'definitionList':\n      // Definition lists don't map to standard mdast.\n      // Convert to HTML as fallback.\n      return {\n        type: 'html',\n        value: definitionListToHtml(node),\n        ...mdastPosField(node.position),\n      };\n\n    default:\n      return { type: 'html', value: '' };\n  }\n}\n\nfunction listItemToMdast(item: MarkdownListItem): MdastNode {\n  return {\n    type: 'listItem',\n    ...(item.checked != null ? { checked: item.checked } : {}),\n    ...(item.spread != null ? { spread: item.spread } : {}),\n    children: item.children.map(blockToMdast),\n    ...mdastPosField(item.position),\n  };\n}\n\nfunction tableRowToMdast(row: MarkdownTableRow): MdastNode {\n  return {\n    type: 'tableRow',\n    children: row.children.map(tableCellToMdast),\n    ...mdastPosField(row.position),\n  };\n}\n\nfunction tableCellToMdast(cell: MarkdownTableCell): MdastNode {\n  return {\n    type: 'tableCell',\n    children: inlineChildrenToMdast(cell.children),\n    ...mdastPosField(cell.position),\n  };\n}\n\n/**\n * Serialize an array of inline nodes to mdast, flat-mapping the result so\n * a single `mention` expands to two mdast nodes (`text('@')` + `link`).\n * Use in place of `.map(inlineToMdast)` wherever we walk a children array.\n */\nfunction inlineChildrenToMdast(nodes: MarkdownInlineNode[]): MdastNode[] {\n  const out: MdastNode[] = [];\n  for (const n of nodes) {\n    if (n.type === 'mention') {\n      out.push({ type: 'text', value: '@' });\n      out.push({\n        type: 'link',\n        url: `${n.targetKind}:${n.targetId}`,\n        children: [{ type: 'text', value: n.displayName }],\n        ...mdastPosField(n.position),\n      });\n    } else {\n      out.push(inlineToMdast(n));\n    }\n  }\n  return out;\n}\n\nfunction inlineToMdast(node: MarkdownInlineNode): MdastNode {\n  switch (node.type) {\n    case 'text':\n      return {\n        type: 'text',\n        value: node.value,\n        ...mdastPosField(node.position),\n      };\n\n    case 'emphasis':\n      return {\n        type: 'emphasis',\n        children: inlineChildrenToMdast(node.children),\n        ...mdastPosField(node.position),\n      };\n\n    case 'strong':\n      return {\n        type: 'strong',\n        children: inlineChildrenToMdast(node.children),\n        ...mdastPosField(node.position),\n      };\n\n    case 'delete':\n      return {\n        type: 'delete',\n        children: inlineChildrenToMdast(node.children),\n        ...mdastPosField(node.position),\n      };\n\n    case 'inlineCode':\n      return {\n        type: 'inlineCode',\n        value: node.value,\n        ...mdastPosField(node.position),\n      };\n\n    case 'link':\n      return {\n        type: 'link',\n        url: node.url,\n        ...(node.title != null ? { title: node.title } : {}),\n        children: inlineChildrenToMdast(node.children),\n        ...mdastPosField(node.position),\n      };\n\n    case 'image':\n      return {\n        type: 'image',\n        url: node.url,\n        ...(node.alt != null ? { alt: node.alt } : {}),\n        ...(node.title != null ? { title: node.title } : {}),\n        ...mdastPosField(node.position),\n      };\n\n    case 'break':\n      return {\n        type: 'break',\n        ...mdastPosField(node.position),\n      };\n\n    case 'htmlInline':\n      return {\n        type: 'html',\n        value: node.rawHtml,\n        ...mdastPosField(node.position),\n      };\n\n    case 'inlineMath':\n      return {\n        type: 'inlineMath',\n        value: node.value,\n        ...mdastPosField(node.position),\n      };\n\n    case 'footnoteReference':\n      return {\n        type: 'footnoteReference',\n        identifier: node.identifier,\n        ...(node.label != null ? { label: node.label } : {}),\n        ...mdastPosField(node.position),\n      };\n\n    case 'linkReference':\n      return {\n        type: 'linkReference',\n        identifier: node.identifier,\n        ...(node.label != null ? { label: node.label } : {}),\n        referenceType: node.referenceType,\n        children: inlineChildrenToMdast(node.children),\n        ...mdastPosField(node.position),\n      };\n\n    case 'imageReference':\n      return {\n        type: 'imageReference',\n        identifier: node.identifier,\n        ...(node.label != null ? { label: node.label } : {}),\n        referenceType: node.referenceType,\n        ...(node.alt != null ? { alt: node.alt } : {}),\n        ...mdastPosField(node.position),\n      };\n\n    case 'textDirective':\n      return {\n        type: 'textDirective',\n        name: node.name,\n        ...(node.attributes ? { attributes: node.attributes } : {}),\n        children: inlineChildrenToMdast(node.children),\n        ...mdastPosField(node.position),\n      };\n\n    case 'mention':\n      // Fallback: when `inlineToMdast` is called directly (not via\n      // `inlineChildrenToMdast`), collapse the mention to just the link\n      // form. The `@` prefix is lost, but the id+name still round-trip.\n      // Normal call sites go through `inlineChildrenToMdast` and get\n      // the proper text('@') + link pair.\n      return {\n        type: 'link',\n        url: `${node.targetKind}:${node.targetId}`,\n        children: [{ type: 'text', value: node.displayName }],\n        ...mdastPosField(node.position),\n      };\n\n    case 'inlineIcon':\n      // Serialize back to the authored token so source round-trips\n      // byte-stable. The token already carries the qualified form when\n      // required (the parser preserved it verbatim).\n      return {\n        type: 'text',\n        value: `{[${node.token}]}`,\n        ...mdastPosField(node.position),\n      };\n\n    default:\n      return { type: 'text', value: '' };\n  }\n}\n\n// ============================================\n// Helpers\n// ============================================\n\n/**\n * Convert a MarkdownDefinitionList to an HTML <dl> string.\n * Fallback for serialization since mdast doesn't support definition lists.\n */\nfunction definitionListToHtml(list: {\n  children: Array<{ type: string; children?: unknown[] }>;\n}): string {\n  let html = '<dl>\\n';\n  for (const child of list.children) {\n    if (child.type === 'definitionTerm') {\n      // Extract plain text from inline children\n      const text = (child.children as Array<{ value?: string; children?: unknown[] }>)\n        .map((c) => c.value ?? '')\n        .join('');\n      html += `  <dt>${text}</dt>\\n`;\n    } else if (child.type === 'definitionDescription') {\n      html += `  <dd>...</dd>\\n`;\n    }\n  }\n  html += '</dl>';\n  return html;\n}\n","/**\n * Markdown → JSON Parser\n *\n * Parses a markdown string into a MarkdownDocument JSON structure\n * using the unified/remark ecosystem with GFM, math, and directive extensions.\n */\n\nimport { unified } from 'unified';\nimport remarkParse from 'remark-parse';\nimport remarkGfm from 'remark-gfm';\nimport remarkMath from 'remark-math';\nimport remarkDirective from 'remark-directive';\nimport remarkFrontmatter from 'remark-frontmatter';\nimport type { MarkdownDocument, ParseOptions } from './types.js';\nimport { fromMdast } from './convert.js';\nimport { parseFrontmatter } from './utils.js';\n\n// Cache the default processor (all extensions enabled) to avoid rebuilding on every call.\nlet defaultProcessor: any;\n\n/**\n * Parse a markdown string into a MarkdownDocument.\n *\n * All extensions (GFM, math, directives) are enabled by default.\n * Use the `options` parameter to disable specific extensions.\n *\n * @param markdown - The markdown source text\n * @param options - Parser options (extensions, HTML parsing)\n * @returns A MarkdownDocument representing the parsed markdown\n *\n * @example\n * ```ts\n * const doc = parseMarkdown('# Hello\\n\\nWorld **bold** and *italic*');\n * // doc.type === 'document'\n * // doc.children[0].type === 'heading'\n * // doc.children[1].type === 'paragraph'\n * ```\n */\nexport function parseMarkdown(markdown: string, options?: ParseOptions): MarkdownDocument {\n  // Use cached default processor when all extensions are enabled (the common case).\n  const useDefaults =\n    !options ||\n    (options.gfm !== false &&\n      options.math !== false &&\n      options.directive !== false &&\n      options.frontmatter !== false);\n\n  let processor: any;\n\n  if (useDefaults) {\n    if (!defaultProcessor) {\n      defaultProcessor = unified()\n        .use(remarkParse)\n        .use(remarkGfm)\n        .use(remarkMath)\n        .use(remarkDirective)\n        .use(remarkFrontmatter, ['yaml']);\n    }\n    processor = defaultProcessor;\n  } else {\n    // Build a custom processor with requested extensions.\n    // unified's .use() chaining changes the generic signature each time,\n    // making strict typing impractical — use a widened Processor type.\n    processor = unified().use(remarkParse);\n\n    if (options?.gfm !== false) {\n      processor = processor.use(remarkGfm);\n    }\n    if (options?.math !== false) {\n      processor = processor.use(remarkMath);\n    }\n    if (options?.directive !== false) {\n      processor = processor.use(remarkDirective);\n    }\n    if (options?.frontmatter !== false) {\n      processor = processor.use(remarkFrontmatter, ['yaml']);\n    }\n  }\n\n  // Parse markdown → mdast tree (result is an mdast Root node)\n  const mdastTree = processor.parse(markdown) as {\n    type: string;\n    children?: Array<{ type: string; value?: string }>;\n  };\n\n  // Convert mdast → MarkdownDocument\n  const doc = fromMdast(mdastTree as Parameters<typeof fromMdast>[0], {\n    parseHtml: options?.parseHtml,\n  });\n\n  // Extract YAML frontmatter if present\n  if (options?.frontmatter !== false) {\n    const yamlNode = mdastTree.children?.find((n) => n.type === 'yaml');\n    if (yamlNode?.value) {\n      const fm = parseFrontmatter(yamlNode.value);\n      if (fm && Object.keys(fm).length > 0) {\n        doc.frontmatter = fm;\n      }\n    }\n  }\n\n  return doc;\n}\n"],"mappings":";;;;;;;;;;;;;;;AA8BO,IAAM,wBAAwB;AAAA,EACnC,GAAG;AAAA,EACH,GAAG;AAAA,EACH,WAAW;AAAA,EACX,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,oBAAoB;AAAA,EACpB,qBAAqB;AACvB;AA4BO,IAAM,6BAAgE;AAAA,EAC3E;AAAA,IACE,KAAK;AAAA,IACL,aAAa;AAAA,IACb,QAAQ;AAAA,EACV;AAAA,EACA;AAAA,IACE,KAAK;AAAA,IACL,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AAAA,EACA;AAAA,IACE,KAAK;AAAA,IACL,aAAa;AAAA,IACb,QAAQ;AAAA,EACV;AAAA,EACA;AAAA,IACE,KAAK;AAAA,IACL,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AAAA,EACA;AAAA,IACE,KAAK;AAAA,IACL,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AAAA,EACA;AAAA,IACE,KAAK;AAAA,IACL,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AAAA,EACA;AAAA,IACE,KAAK;AAAA,IACL,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AAAA,EACA;AAAA,IACE,KAAK;AAAA,IACL,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AACF;AAgCO,SAAS,uBAAuB,QAA8C;AACnF,QAAM,YAA8B,CAAC;AACrC,QAAM,WAAmC,CAAC;AAC1C,QAAM,WAAqB,CAAC;AAC5B,MAAI,iBAAwC;AAC5C,MAAI;AACJ,MAAI;AAEJ,aAAW,CAAC,KAAK,GAAG,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC/C,UAAM,OAAQ,sBAAiD,GAAG;AAClE,QAAI,CAAC,MAAM;AACT,eAAS,GAAG,IAAI;AAChB;AAAA,IACF;AACA,QAAI,SAAS,UAAU;AACrB,YAAM,IAAI,YAAY,GAAG;AACzB,UAAI,KAAK,MAAM;AACb,iBAAS,KAAK,uBAAuB,GAAG,MAAM,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,MACrE,OAAO;AACL,QAAC,UAAsC,GAAG,IAAI;AAAA,MAChD;AAAA,IACF,WAAW,SAAS,QAAQ;AAC1B,YAAM,IAAI,iBAAiB,GAAG;AAC9B,UAAI,KAAK,MAAM;AACb,iBAAS,KAAK,qBAAqB,GAAG,MAAM,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,MACnE,WAAW,QAAQ,sBAAsB;AACvC,6BAAqB;AAAA,MACvB,OAAO;AACL,QAAC,UAAsC,GAAG,IAAI;AAAA,MAChD;AAAA,IACF,WAAW,SAAS,kBAAkB;AACpC,YAAM,EAAE,MAAM,QAAQ,IAAI,oBAAoB,GAAG;AACjD,UAAI,QAAS,UAAS,KAAK,IAAI,GAAG,MAAM,OAAO,EAAE;AACjD,gBAAU,aAAa;AAAA,IACzB,WAAW,SAAS,cAAc;AAChC,YAAM,aAAa,wBAAwB,GAAG;AAC9C,UAAI,cAAc,MAAM;AACtB,iBAAS,KAAK,2BAA2B,GAAG,MAAM,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,MACzE,OAAO;AACL,yBAAiB;AAAA,MACnB;AAAA,IACF,WAAW,SAAS,uBAAuB;AACzC,YAAM,YAAY,6BAA6B,GAAG;AAClD,UAAI,aAAa,MAAM;AACrB,iBAAS,KAAK,qCAAqC,GAAG,MAAM,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,MACnF,OAAO;AACL,8BAAsB;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,gBAAgB;AAClB,cAAU,aAAa;AAAA,MACrB,MAAM;AAAA,MACN,GAAI,uBAAuB,SAAY,EAAE,UAAU,mBAAmB,IAAI,CAAC;AAAA,MAC3E,GAAI,wBAAwB,SAAY,EAAE,WAAW,oBAAoB,IAAI,CAAC;AAAA,IAChF;AAAA,EACF;AAEA,SAAO,EAAE,WAAW,UAAU,SAAS;AACzC;AAOA,SAAS,YAAY,KAA4B;AAC/C,MAAI,IAAI,KAAK,MAAM,GAAI,QAAO;AAC9B,QAAM,IAAI,OAAO,GAAG;AACpB,SAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAClC;AAEA,IAAM,eAAe;AACrB,IAAM,aAAa;AACnB,IAAM,eAAe;AAWd,SAAS,iBAAiB,KAA4B;AAC3D,QAAM,UAAU,IAAI,KAAK;AACzB,MAAI,CAAC,QAAS,QAAO;AAErB,MAAI,aAAa,KAAK,OAAO,GAAG;AAC9B,UAAM,IAAI,OAAO,OAAO;AACxB,WAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAAA,EAClC;AAEA,QAAM,UAAU,QAAQ,MAAM,UAAU;AACxC,MAAI,SAAS;AACX,UAAM,IAAI,OAAO,QAAQ,CAAC,CAAC;AAC3B,WAAO,OAAO,SAAS,CAAC,IAAI,IAAI,MAAO;AAAA,EACzC;AAEA,QAAM,YAAY,QAAQ,MAAM,YAAY;AAC5C,MAAI,WAAW;AACb,UAAM,OAAO,OAAO,UAAU,CAAC,CAAC;AAChC,UAAM,OAAO,OAAO,UAAU,CAAC,CAAC;AAChC,UAAM,OAAO,UAAU,CAAC,IAAI,OAAO,KAAK,UAAU,CAAC,CAAC,EAAE,IAAI;AAC1D,QAAI,CAAC,OAAO,SAAS,IAAI,KAAK,CAAC,OAAO,SAAS,IAAI,KAAK,CAAC,OAAO,SAAS,IAAI,GAAG;AAC9E,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,GAAI,QAAO;AACvB,WAAO,OAAO,KAAK,OAAO;AAAA,EAC5B;AAEA,SAAO;AACT;AAOO,SAAS,oBAAoB,KAGlC;AACA,QAAM,UAAU,IAAI,KAAK;AACzB,MAAI,CAAC,QAAS,QAAO,EAAE,MAAM,CAAC,GAAG,SAAS,KAAK;AAE/C,QAAM,OAA0B,CAAC;AACjC,MAAI,eAAe;AACnB,aAAW,QAAQ,QAAQ,MAAM,GAAG,GAAG;AACrC,UAAM,QAAQ,KAAK,KAAK;AACxB,QAAI,CAAC,OAAO;AACV,qBAAe;AACf;AAAA,IACF;AACA,UAAM,WAAW,MAAM,QAAQ,GAAG;AAClC,QAAI,WAAW,GAAG;AAChB,WAAK,KAAK,EAAE,QAAQ,MAAM,CAAC;AAAA,IAC7B,OAAO;AACL,YAAM,SAAS,MAAM,MAAM,GAAG,QAAQ,EAAE,KAAK;AAC7C,YAAM,OAAO,MAAM,MAAM,WAAW,CAAC,EAAE,KAAK;AAC5C,UAAI,CAAC,QAAQ;AACX,uBAAe;AACf;AAAA,MACF;AACA,WAAK,KAAK,OAAO,EAAE,QAAQ,KAAK,IAAI,EAAE,OAAO,CAAC;AAAA,IAChD;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,SAAS,eAAe,qCAAqC;AAAA,EAC/D;AACF;;;ACrQA,IAAM,SAAS;AAEf,IAAM,SAAS;AAQf,IAAM,qBAAqB,IAAI;AAAA,EAC7B,0BAA0B,MAAM,IAAI,MAAM;AAC5C;AAOA,IAAM,qBAAqB;AAO3B,IAAM,mBAAmB,IAAI,OAAO,4BAA4B,MAAM,IAAI,MAAM,aAAa;AAG7F,IAAM,mBAAmB;AAUzB,SAAS,cACP,MACA,QACA,QACgC;AAChC,QAAM,IAAI,OAAO,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI;AAC/C,SAAO,IAAI,EAAE,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,MAAM,IAAI;AAC/C;AAOO,SAAS,gCAAgC,MAA8C;AAC5F,SAAO,cAAc,MAAM,oBAAoB,kBAAkB;AACnE;AAMO,SAAS,wBAAwB,MAA8C;AACpF,SAAO,cAAc,MAAM,kBAAkB,gBAAgB;AAC/D;AAMA,IAAM,gBAAgB;AAcf,SAAS,mBAAmB,OAAyB;AAC1D,QAAM,SAAmB,CAAC;AAC1B,MAAI,IAAI;AACR,QAAM,IAAI,MAAM;AAChB,SAAO,IAAI,GAAG;AACZ,WAAO,IAAI,KAAK,cAAc,KAAK,MAAM,CAAC,CAAC,EAAG;AAC9C,QAAI,KAAK,EAAG;AAEZ,QAAI,QAAQ;AACZ,WAAO,IAAI,KAAK,CAAC,cAAc,KAAK,MAAM,CAAC,CAAC,GAAG;AAC7C,YAAM,KAAK,MAAM,CAAC;AAClB,YAAM,eAAe,UAAU,MAAM,MAAM,SAAS,GAAG;AACvD,WAAK,OAAO,OAAO,OAAO,QAAQ,cAAc;AAC9C,iBAAS;AACT;AACA,eAAO,IAAI,KAAK,MAAM,CAAC,MAAM,IAAI;AAC/B,cAAI,MAAM,CAAC,MAAM,QAAQ,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,MAAM,MAAM,MAAM,IAAI,CAAC,MAAM,OAAO;AACpF,qBAAS,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC;AAC/B,iBAAK;AAAA,UACP,OAAO;AACL,qBAAS,MAAM,CAAC;AAChB;AAAA,UACF;AAAA,QACF;AACA,YAAI,IAAI,KAAK,MAAM,CAAC,MAAM,IAAI;AAC5B,mBAAS;AACT;AAAA,QACF;AAAA,MACF,OAAO;AACL,iBAAS;AACT;AAAA,MACF;AAAA,IACF;AACA,QAAI,MAAO,QAAO,KAAK,KAAK;AAAA,EAC9B;AACA,SAAO;AACT;AAMA,IAAM,iBAAiB;AACvB,IAAM,iBAAiB;AAOhB,SAAS,iBAAiB,KAAqB;AACpD,MAAI,IAAI,UAAU,GAAG;AACnB,UAAM,IAAI,IAAI,CAAC;AACf,SAAK,MAAM,OAAO,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG;AAC/C,YAAM,OAAO,IAAI,MAAM,GAAG,EAAE;AAC5B,aAAO,KAAK,QAAQ,MAAM,MAAM,iBAAiB,gBAAgB,IAAI;AAAA,IACvE;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,mBAAmB,OAAsD;AACvF,QAAM,QAAQ,MAAM,QAAQ,GAAG;AAC/B,MAAI,SAAS,EAAG,QAAO;AACvB,SAAO,EAAE,KAAK,MAAM,MAAM,GAAG,KAAK,GAAG,OAAO,iBAAiB,MAAM,MAAM,QAAQ,CAAC,CAAC,EAAE;AACvF;AAMA,IAAM,mBAAmB;AACzB,IAAM,eAAe;AACrB,IAAM,eAAe;AAOd,SAAS,aAAa,OAAwB;AACnD,SAAO,UAAU,MAAM,iBAAiB,KAAK,KAAK;AACpD;AAYO,SAAS,eAAe,OAAuB;AACpD,MAAI,CAAC,aAAa,KAAK,EAAG,QAAO;AACjC,MAAI,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,GAAG,GAAG;AAC/C,WAAO,IAAI,MAAM,QAAQ,cAAc,CAAC,OAAO,KAAK,EAAE,EAAE,CAAC;AAAA,EAC3D;AACA,SAAO,IAAI,MAAM,QAAQ,cAAc,CAAC,OAAO,KAAK,EAAE,EAAE,CAAC;AAC3D;;;AC/IA,SAAS,gBAAgB,KAAyD;AAChF,MAAI,CAAC,IAAK,QAAO;AACjB,SAAO;AAAA,IACL,OAAO;AAAA,MACL,MAAM,IAAI,MAAM;AAAA,MAChB,QAAQ,IAAI,MAAM;AAAA,MAClB,GAAI,IAAI,MAAM,UAAU,OAAO,EAAE,QAAQ,IAAI,MAAM,OAAO,IAAI,CAAC;AAAA,IACjE;AAAA,IACA,KAAK;AAAA,MACH,MAAM,IAAI,IAAI;AAAA,MACd,QAAQ,IAAI,IAAI;AAAA,MAChB,GAAI,IAAI,IAAI,UAAU,OAAO,EAAE,QAAQ,IAAI,IAAI,OAAO,IAAI,CAAC;AAAA,IAC7D;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,KAA4C;AACnE,SAAO;AAAA,IACL,OAAO;AAAA,MACL,MAAM,IAAI,MAAM;AAAA,MAChB,QAAQ,IAAI,MAAM;AAAA,MAClB,GAAI,IAAI,MAAM,UAAU,OAAO,EAAE,QAAQ,IAAI,MAAM,OAAO,IAAI,CAAC;AAAA,IACjE;AAAA,IACA,KAAK;AAAA,MACH,MAAM,IAAI,IAAI;AAAA,MACd,QAAQ,IAAI,IAAI;AAAA,MAChB,GAAI,IAAI,IAAI,UAAU,OAAO,EAAE,QAAQ,IAAI,IAAI,OAAO,IAAI,CAAC;AAAA,IAC7D;AAAA,EACF;AACF;AAGA,SAAS,SACP,KAC8D;AAC9D,SAAO,MAAM,EAAE,UAAU,IAAI,IAAI,CAAC;AACpC;AAEA,SAAS,cACP,KACqD;AACrD,SAAO,MAAM,EAAE,UAAU,gBAAgB,GAAG,EAAE,IAAI,CAAC;AACrD;AAUA,SAAS,YAAY,MAAyB;AAC5C,MAAI,KAAK,SAAS,KAAM,QAAO,KAAK;AACpC,MAAI,KAAK,UAAU;AACjB,WAAO,KAAK,SAAS,IAAI,WAAW,EAAE,KAAK,EAAE;AAAA,EAC/C;AACA,SAAO;AACT;AAkBA,SAAS,0BACP,UACkC;AAElC,WAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7C,UAAM,QAAQ,SAAS,CAAC;AACxB,QAAI,MAAM,SAAS,QAAQ;AACzB,YAAM,QAAQ,gCAAgC,MAAM,KAAK;AACzD,UAAI,OAAO;AACT,cAAM,QAAQ,MAAM,MAAM,KAAK;AAC/B,cAAM,aAAa,sBAAsB,KAAK;AAG9C,cAAM,WAAW,MAAM,MAAM,MAAM,GAAG,MAAM,KAAK,EAAE,QAAQ,QAAQ,EAAE;AACrE,YAAI,UAAU;AACZ,UAAC,MAA4B,QAAQ;AAAA,QACvC,OAAO;AAEL,mBAAS,OAAO,GAAG,CAAC;AAAA,QACtB;AACA,eAAO;AAAA,MACT;AAEA;AAAA,IACF;AAEA;AAAA,EACF;AACA,SAAO;AACT;AAYA,SAAS,sBAAsB,OAA0C;AACvE,QAAM,SAAS,mBAAmB,KAAK;AACvC,QAAM,SAAiC,CAAC;AAIxC,QAAM,eAAe,OAAO,SAAS,KAAK,OAAO,CAAC,EAAE,QAAQ,GAAG,IAAI;AACnE,QAAM,WAAW,gBAAgB,OAAO,WAAW,IAAI,SAAY,OAAO,CAAC;AAC3E,QAAM,WAAW,eAAe,IAAI;AAEpC,WAAS,IAAI,UAAU,IAAI,OAAO,QAAQ,KAAK;AAC7C,UAAM,KAAK,mBAAmB,OAAO,CAAC,CAAC;AACvC,QAAI,IAAI;AACN,aAAO,GAAG,GAAG,IAAI,GAAG;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,SAAoC,CAAC;AAC3C,MAAI,UAAU;AACZ,WAAO,WAAW;AAAA,EACpB;AACA,MAAI,OAAO,KAAK,MAAM,EAAE,SAAS,GAAG;AAClC,WAAO,SAAS;AAAA,EAClB;AACA,SAAO;AACT;AAwBA,SAAS,wBAAwB,UAA0D;AAEzF,QAAM,QAAqD,CAAC;AAC5D,WAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7C,UAAM,IAAI,SAAS,CAAC;AACpB,QAAI,EAAE,SAAS,QAAQ;AACrB,YAAM,QAAQ,EAAE,KAAK,EAAE,OAAO,KAAK,GAAG,KAAK,EAAE,MAAM,OAAO,CAAC;AAAA,IAC7D,WAAW,EAAE,SAAS,iBAAiB;AACrC,YAAM,KAAK;AAKX,YAAM,UACH,CAAC,GAAG,YAAY,GAAG,SAAS,WAAW,OACvC,CAAC,GAAG,cAAc,OAAO,KAAK,GAAG,UAAU,EAAE,WAAW;AAC3D,UAAI,CAAC,OAAQ;AACb,YAAM,cAAc,OAAO,GAAG,QAAQ;AACtC,YAAM,QAAQ,EAAE,KAAK,aAAa,KAAK,GAAG,KAAK,YAAY,OAAO,CAAC;AAAA,IACrE,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,QAAM,SAAS,MAAM,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE;AAC9C,QAAM,QAAQ,wBAAwB,MAAM;AAC5C,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,QAAQ,MAAM,MAAM,KAAK;AAC/B,QAAM,QAAQ,sBAAsB,KAAK;AAMzC,QAAM,aAAa,MAAM;AACzB,MAAI,aAAa;AACjB,WAAS,KAAK,GAAG,KAAK,MAAM,QAAQ,MAAM;AACxC,UAAM,IAAI,MAAM,EAAE;AAClB,QAAI,aAAa,EAAE,OAAO,YAAY;AACpC,oBAAc,EAAE;AAChB;AAAA,IACF;AACA,UAAM,YAAY,SAAS,EAAE,GAAG;AAChC,UAAM,UAAU,aAAa;AAC7B,QAAI,UAAU,SAAS,QAAQ;AAC7B,YAAM,UAAU,UAAU,MAAM,MAAM,GAAG,OAAO,EAAE,QAAQ,QAAQ,EAAE;AACpE,UAAI,SAAS;AACX,QAAC,UAAgC,QAAQ;AACzC,iBAAS,OAAO,EAAE,MAAM,CAAC;AAAA,MAC3B,OAAO;AACL,iBAAS,OAAO,EAAE,GAAG;AAAA,MACvB;AAAA,IACF,OAAO;AAGL,eAAS,OAAO,EAAE,GAAG;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AAEA,WAAS,OAAO,MAAM,CAAC,EAAE,GAAG;AAC5B,SAAO;AACT;AAeO,SAAS,sBAAsB,OAAkC;AACtE,QAAM,SAAS,mBAAmB,KAAK;AACvC,QAAM,QAA2B,CAAC;AAClC,QAAM,SAAiC,CAAC;AACxC,QAAM,UAAoB,CAAC;AAE3B,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,SAAS,GAAG,GAAG;AACjD,YAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAC1B,WAAW,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,SAAS,GAAG,GAAG;AACxD,YAAM,MAAM,MAAM,MAAM,CAAC;AACzB,UAAI,IAAK,SAAQ,KAAK,GAAG;AAAA,IAC3B,OAAO;AACL,YAAM,KAAK,mBAAmB,KAAK;AACnC,UAAI,IAAI;AACN,eAAO,GAAG,GAAG,IAAI,GAAG;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,QAAQ,SAAS,EAAG,OAAM,UAAU;AACxC,MAAI,OAAO,KAAK,MAAM,EAAE,SAAS,GAAG;AAClC,UAAM,SAAS;AACf,UAAM,EAAE,WAAW,SAAS,IAAI,uBAAuB,MAAM;AAC7D,QAAI,OAAO,KAAK,SAAS,EAAE,SAAS,EAAG,OAAM,YAAY;AACzD,QAAI,OAAO,KAAK,QAAQ,EAAE,SAAS,EAAG,OAAM,WAAW;AAAA,EACzD;AACA,SAAO;AACT;AAUO,SAAS,0BAA0B,OAAyC;AACjF,QAAM,QAAkB,CAAC;AACzB,MAAI,MAAM,GAAI,OAAM,KAAK,IAAI,MAAM,EAAE,EAAE;AACvC,MAAI,MAAM,SAAS;AACjB,eAAW,OAAO,MAAM,QAAS,OAAM,KAAK,IAAI,GAAG,EAAE;AAAA,EACvD;AACA,MAAI,MAAM,QAAQ;AAChB,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,MAAM,GAAG;AACvD,YAAM,KAAK,GAAG,GAAG,IAAI,eAAe,KAAK,CAAC,EAAE;AAAA,IAC9C;AAAA,EACF;AAGA,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,SAAO,IAAI,MAAM,KAAK,GAAG,CAAC;AAC5B;AAOA,SAAS,4BAA4B,YAA+C;AAClF,QAAM,QAAkB,CAAC;AACzB,MAAI,WAAW,UAAU;AACvB,UAAM,KAAK,WAAW,QAAQ;AAAA,EAChC;AACA,MAAI,WAAW,QAAQ;AACrB,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,WAAW,MAAM,GAAG;AAC5D,YAAM,KAAK,GAAG,GAAG,IAAI,eAAe,KAAK,CAAC,EAAE;AAAA,IAC9C;AAAA,EACF;AACA,SAAO,KAAK,MAAM,KAAK,GAAG,CAAC;AAC7B;AASO,SAAS,UAAU,MAAiB,SAAqD;AAC9F,QAAM,cAAc,SAAS,cAAc;AAC3C,SAAO;AAAA,IACL,MAAM;AAAA,IACN,UAAU,qBAAqB,KAAK,YAAY,CAAC,GAAG,WAAW;AAAA,IAC/D,GAAG,SAAS,gBAAgB,KAAK,QAAQ,CAAC;AAAA,EAC5C;AACF;AAEA,SAAS,qBAAqB,UAAuB,WAAyC;AAC5F,QAAM,SAA8B,CAAC;AACrC,aAAW,SAAS,UAAU;AAC5B,UAAM,OAAO,iBAAiB,OAAO,SAAS;AAC9C,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AACA,SAAO;AACT;AAEA,SAAS,sBACP,UACA,WAKA,iBAA0B,MACJ;AACtB,QAAM,SAA+B,CAAC;AACtC,aAAW,SAAS,UAAU;AAC5B,UAAM,OAAO,kBAAkB,OAAO,SAAS;AAC/C,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AACA,QAAM,YAAY,iBAAiB,MAAM;AACzC,SAAO,iBAAiB,iBAAiB,SAAS,IAAI;AACxD;AAWO,SAAS,iBAAiB,OAAmD;AAMlF,QAAM,aAAa,yBAAyB,KAAK;AAEjD,QAAM,MAA4B,CAAC;AACnC,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,SAAS,QAAQ;AACxB,UAAI,KAAK,IAAI;AACb;AAAA,IACF;AACA,QAAI,KAAK,GAAG,iBAAiB,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EACzD;AACA,SAAO;AACT;AAUA,SAAS,yBAAyB,OAAmD;AACnF,QAAM,MAA4B,CAAC;AACnC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,MAAM,MAAM,CAAC;AACnB,UAAM,OAAO,MAAM,IAAI,CAAC;AACxB,UAAM,QAAQ,MAAM,IAAI,CAAC;AACzB,QACE,KAAK,SAAS,UACd,MAAM,SAAS,mBACf,OAAO,SAAS,UAChB,sBAAsB,KAAK,IAAI,KAAK,KACpC,QAAQ,KAAK,MAAM,KAAK,GACxB;AACA,YAAM,YAAY;AAClB,YAAM,gBAAgB,UAAU,QAAQ;AACxC,YAAM,SAA6B;AAAA,QACjC,MAAM;AAAA,QACN,OAAO,IAAI,QAAQ,MAAM,gBAAgB,MAAM;AAAA,QAC/C,GAAI,IAAI,WAAW,EAAE,UAAU,IAAI,SAAS,IAAI,CAAC;AAAA,MACnD;AACA,UAAI,KAAK,MAAM;AACf,WAAK;AACL;AAAA,IACF;AACA,QAAI,KAAK,GAAG;AAAA,EACd;AACA,SAAO;AACT;AAEA,IAAM,gBAAgB;AAEtB,SAAS,iBAAiB,OAAe,UAAyD;AAChG,MAAI,CAAC,MAAO,QAAO,CAAC;AACpB,gBAAc,YAAY;AAC1B,MAAI,YAAY;AAChB,MAAI;AACJ,QAAM,MAA4B,CAAC;AACnC,UAAQ,QAAQ,cAAc,KAAK,KAAK,OAAO,MAAM;AACnD,UAAM,QAAQ,MAAM,CAAC;AACrB,UAAM,OAAO,YAAY,KAAK;AAC9B,QAAI,CAAC,KAAM;AACX,QAAI,MAAM,QAAQ,WAAW;AAC3B,UAAI,KAAK;AAAA,QACP,MAAM;AAAA,QACN,OAAO,MAAM,MAAM,WAAW,MAAM,KAAK;AAAA,QACzC,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACjC,CAAC;AAAA,IACH;AACA,UAAM,WAA+B;AAAA,MACnC,MAAM;AAAA,MACN;AAAA,MACA,QAAQ,KAAK;AAAA,MACb,MAAM,KAAK;AAAA,MACX,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,IACjC;AACA,QAAI,KAAK,QAAQ;AACjB,gBAAY,MAAM,QAAQ,MAAM,CAAC,EAAE;AAAA,EACrC;AACA,MAAI,cAAc,GAAG;AAEnB,WAAO,CAAC,EAAE,MAAM,QAAQ,OAAO,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC,EAAG,CAAC;AAAA,EACpE;AACA,MAAI,YAAY,MAAM,QAAQ;AAC5B,QAAI,KAAK;AAAA,MACP,MAAM;AAAA,MACN,OAAO,MAAM,MAAM,SAAS;AAAA,MAC5B,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,IACjC,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAUA,SAAS,iBAAiB,SAAqD;AAC7E,QAAM,MAA4B,CAAC;AACnC,aAAW,OAAO,SAAS;AACzB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QACE,IAAI,SAAS,UACb,OAAO,IAAI,QAAQ,YACnB,QACA,KAAK,SAAS,UACd,KAAK,MAAM,SAAS,GAAG,GACvB;AACA,YAAM,cAAc,IAAI,IAAI,MAAM,6BAA6B;AAC/D,UAAI,eAAe,YAAY,CAAC,KAAK,YAAY,CAAC,GAAG;AACnD,cAAM,aAAa,YAAY,CAAC;AAChC,cAAM,WAAW,YAAY,CAAC;AAC9B,cAAM,cAAc,kBAAkB,IAAI,QAAQ;AAClD,YAAI,KAAK,UAAU,KAAK;AACtB,cAAI,IAAI;AAAA,QACV,OAAO;AACL,eAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,EAAE;AAAA,QACrC;AACA,YAAI,KAAK;AAAA,UACP,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA;AAAA,UACA,GAAI,IAAI,WAAW,EAAE,UAAU,IAAI,SAAS,IAAI,CAAC;AAAA,QACnD,CAAC;AACD;AAAA,MACF;AAAA,IACF;AACA,QAAI,KAAK,GAAG;AAAA,EACd;AACA,SAAO;AACT;AAIA,SAAS,kBAAkB,OAAqC;AAC9D,MAAI,MAAM;AACV,aAAW,KAAK,OAAO;AACrB,QAAI,EAAE,SAAS,UAAU,EAAE,SAAS,aAAc,QAAO,EAAE;AAAA,aAClD,cAAc,KAAK,MAAM,QAAQ,EAAE,QAAQ,GAAG;AACrD,aAAO,kBAAkB,EAAE,QAAgC;AAAA,IAC7D;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,MAAiB,WAA8C;AACvF,QAAM,MAAM,gBAAgB,KAAK,QAAQ;AAEzC,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,WAAW;AAYd,YAAM,kBAAkB,sBAAsB,KAAK,YAAY,CAAC,GAAG,WAAW,KAAK;AACnF,UAAI,aAA+C;AACnD,UAAI,QAAkC;AACtC,eAAS,OAAO,GAAG,OAAO,GAAG,QAAQ;AACnC,YAAI,UAAU;AACd,YAAI,CAAC,YAAY;AACf,gBAAM,IAAI,0BAA0B,eAAe;AACnD,cAAI,GAAG;AACL,yBAAa;AACb,sBAAU;AAAA,UACZ;AAAA,QACF;AACA,YAAI,CAAC,OAAO;AACV,gBAAM,IAAI,wBAAwB,eAAe;AACjD,cAAI,GAAG;AACL,oBAAQ;AACR,sBAAU;AAAA,UACZ;AAAA,QACF;AACA,YAAI,CAAC,QAAS;AAAA,MAChB;AACA,YAAM,gBAAgB,iBAAiB,eAAe;AACtD,YAAM,SAA0B;AAAA,QAC9B,MAAM;AAAA,QACN,OAAQ,KAAK,SAAS;AAAA,QACtB,UAAU;AAAA,QACV,GAAG,SAAS,GAAG;AAAA,MACjB;AACA,UAAI,YAAY;AACd,eAAO,qBAAqB;AAAA,MAC9B;AACA,UAAI,OAAO;AACT,eAAO,aAAa;AAAA,MACtB;AACA,aAAO;AAAA,IACT;AAAA,IAEA,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC9D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,qBAAqB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC7D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,SAAS,KAAK,WAAW;AAAA,QACzB,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,GAAI,KAAK,UAAU,OAAO,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,QACrD,WAAW,KAAK,YAAY,CAAC,GAAG,IAAI,CAAC,SAAS,gBAAgB,MAAM,SAAS,CAAC;AAAA,QAC9E,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,GAAI,KAAK,QAAQ,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QAC/C,GAAI,KAAK,QAAQ,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QAC/C,OAAO,KAAK,SAAS;AAAA,QACrB,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,GAAI,KAAK,QACL,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC,MAAM,CAAuC,EAAE,IACxE,CAAC;AAAA,QACL,WAAW,KAAK,YAAY,CAAC,GAAG,IAAI,CAAC,KAAK,MAAM,gBAAgB,KAAK,MAAM,GAAG,SAAS,CAAC;AAAA,QACxF,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,SAAS,KAAK,SAAS;AAAA,QACvB,cAAc,YAAY,iBAAiB,KAAK,SAAS,EAAE,IAAI,CAAC;AAAA,QAChE,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK,SAAS;AAAA,QACrB,GAAI,KAAK,QAAQ,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QAC/C,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK,cAAc;AAAA,QAC/B,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,KAAK,KAAK,OAAO;AAAA,QACjB,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK,cAAc;AAAA,QAC/B,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,UAAU,qBAAqB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC7D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK,sBAAsB;AACzB,YAAM,cAAc,KAAK,YAAY,CAAC;AACtC,UAAI;AACJ,UAAI,kBAAkB;AAGtB,UACE,YAAY,SAAS,KACrB,YAAY,CAAC,EAAE,SAAS,eACxB,YAAY,CAAC,EAAE,MAAM,mBAAmB,MACxC;AACA,gBAAQ,YAAY,YAAY,CAAC,CAAC;AAClC,0BAAkB,YAAY,MAAM,CAAC;AAAA,MACvC;AAEA,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,KAAK,QAAQ;AAAA,QACnB,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,QACzB,GAAI,KAAK,cAAc,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,IACzD,EAAE,YAAY,KAAK,WAAW,IAC9B,CAAC;AAAA,QACL,UAAU,qBAAqB,iBAAiB,SAAS;AAAA,QACzD,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,KAAK,QAAQ;AAAA,QACnB,GAAI,KAAK,cAAc,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,IACzD,EAAE,YAAY,KAAK,WAAW,IAC9B,CAAC;AAAA,QACL,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC9D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AAEH,aAAO;AAAA,IAET;AAEE,UAAI,OAAO,YAAY,aAAa;AAClC,gBAAQ,KAAK,qDAAqD,KAAK,IAAI,GAAG;AAAA,MAChF;AACA,aAAO;AAAA,EACX;AACF;AAEA,SAAS,gBAAgB,MAAiB,WAAsC;AAC9E,QAAM,MAAM,gBAAgB,KAAK,QAAQ;AACzC,SAAO;AAAA,IACL,MAAM;AAAA,IACN,GAAI,KAAK,WAAW,OAAO,EAAE,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,IACxD,GAAI,KAAK,UAAU,OAAO,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,IACrD,UAAU,qBAAqB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,IAC7D,GAAG,SAAS,GAAG;AAAA,EACjB;AACF;AAEA,SAAS,gBAAgB,MAAiB,UAAmB,WAAsC;AACjG,QAAM,MAAM,gBAAgB,KAAK,QAAQ;AACzC,SAAO;AAAA,IACL,MAAM;AAAA,IACN,WAAW,KAAK,YAAY,CAAC,GAAG,IAAI,CAAC,SAAS,iBAAiB,MAAM,UAAU,SAAS,CAAC;AAAA,IACzF,GAAG,SAAS,GAAG;AAAA,EACjB;AACF;AAEA,SAAS,iBACP,MACA,UACA,WACmB;AACnB,QAAM,MAAM,gBAAgB,KAAK,QAAQ;AACzC,SAAO;AAAA,IACL,MAAM;AAAA,IACN,GAAI,WAAW,EAAE,UAAU,KAAK,IAAI,CAAC;AAAA,IACrC,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,IAC9D,GAAG,SAAS,GAAG;AAAA,EACjB;AACF;AAEA,SAAS,kBAAkB,MAAiB,WAA+C;AACzF,QAAM,MAAM,gBAAgB,KAAK,QAAQ;AAEzC,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK,SAAS;AAAA,QACrB,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC9D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC9D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC9D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK,SAAS;AAAA,QACrB,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,KAAK,KAAK,OAAO;AAAA,QACjB,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC9D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,KAAK,KAAK,OAAO;AAAA,QACjB,GAAI,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,QAC5C,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,SAAS,KAAK,SAAS;AAAA,QACvB,cAAc,YAAY,iBAAiB,KAAK,SAAS,EAAE,IAAI,CAAC;AAAA,QAChE,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK,SAAS;AAAA,QACrB,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK,cAAc;AAAA,QAC/B,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK,cAAc;AAAA,QAC/B,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,eAAgB,KAAK,iBAAiB;AAAA,QACtC,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC9D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK,cAAc;AAAA,QAC/B,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,eAAgB,KAAK,iBAAiB;AAAA,QACtC,GAAI,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,QAC5C,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,KAAK,QAAQ;AAAA,QACnB,GAAI,KAAK,cAAc,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,IACzD,EAAE,YAAY,KAAK,WAAW,IAC9B,CAAC;AAAA,QACL,UAAU,sBAAsB,KAAK,YAAY,CAAC,GAAG,SAAS;AAAA,QAC9D,GAAG,SAAS,GAAG;AAAA,MACjB;AAAA,IAEF;AACE,UAAI,OAAO,YAAY,aAAa;AAClC,gBAAQ,KAAK,sDAAsD,KAAK,IAAI,GAAG;AAAA,MACjF;AACA,aAAO;AAAA,EACX;AACF;AAYO,SAAS,QAAQ,KAAkC;AACxD,SAAO;AAAA,IACL,MAAM;AAAA,IACN,UAAU,IAAI,SAAS,IAAI,CAAC,MAAM,aAAa,CAAC,CAAC;AAAA,IACjD,GAAG,cAAc,IAAI,QAAQ;AAAA,EAC/B;AACF;AAEA,SAAS,aAAa,MAAoC;AACxD,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,WAAW;AACd,YAAM,gBAAgB,sBAAsB,KAAK,QAAQ;AAIzD,YAAM,WAAqB,CAAC;AAC5B,UAAI,KAAK,YAAY;AACnB,cAAM,SAAS,0BAA0B,KAAK,UAAU;AACxD,YAAI,UAAU,KAAM,UAAS,KAAK,MAAM;AAAA,MAC1C;AACA,UAAI,KAAK,oBAAoB;AAC3B,iBAAS,KAAK,4BAA4B,KAAK,kBAAkB,CAAC;AAAA,MACpE;AACA,UAAI,SAAS,SAAS,GAAG;AACvB,cAAM,SAAS,SAAS,KAAK,GAAG;AAChC,cAAM,YAAY,cAAc,cAAc,SAAS,CAAC;AACxD,YAAI,aAAa,UAAU,SAAS,QAAQ;AAC1C,oBAAU,SAAS,UAAU,SAAS,MAAM,MAAM;AAAA,QACpD,OAAO;AACL,wBAAc,KAAK,EAAE,MAAM,QAAQ,OAAO,MAAM,OAAO,CAAC;AAAA,QAC1D;AAAA,MACF;AACA,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,QACZ,UAAU;AAAA,QACV,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IACF;AAAA,IAEA,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,sBAAsB,KAAK,QAAQ;AAAA,QAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,KAAK,SAAS,IAAI,YAAY;AAAA,QACxC,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,SAAS,KAAK;AAAA,QACd,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,GAAI,KAAK,UAAU,OAAO,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,QACrD,UAAU,KAAK,SAAS,IAAI,eAAe;AAAA,QAC3C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,GAAI,KAAK,QAAQ,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QAC/C,GAAI,KAAK,QAAQ,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QAC/C,OAAO,KAAK;AAAA,QACZ,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,GAAI,KAAK,QAAQ,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAC1C,UAAU,KAAK,SAAS,IAAI,eAAe;AAAA,QAC3C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,QACZ,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,QACZ,GAAI,KAAK,QAAQ,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QAC/C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK;AAAA,QACjB,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,KAAK,KAAK;AAAA,QACV,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK;AAAA,QACjB,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,UAAU,KAAK,SAAS,IAAI,YAAY;AAAA,QACxC,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK,sBAAsB;AACzB,YAAM,WAAwB,CAAC;AAG/B,UAAI,KAAK,OAAO;AACd,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,MAAM,EAAE,gBAAgB,KAAK;AAAA,UAC7B,UAAU,CAAC,EAAE,MAAM,QAAQ,OAAO,KAAK,MAAM,CAAC;AAAA,QAChD,CAAC;AAAA,MACH;AAEA,eAAS,KAAK,GAAG,KAAK,SAAS,IAAI,YAAY,CAAC;AAEhD,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,KAAK;AAAA,QACX,GAAI,KAAK,aAAa,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;AAAA,QACzD;AAAA,QACA,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IACF;AAAA,IAEA,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,KAAK;AAAA,QACX,GAAI,KAAK,aAAa,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;AAAA,QACzD,UAAU,sBAAsB,KAAK,QAAQ;AAAA,QAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AAGH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,qBAAqB,IAAI;AAAA,QAChC,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF;AACE,aAAO,EAAE,MAAM,QAAQ,OAAO,GAAG;AAAA,EACrC;AACF;AAEA,SAAS,gBAAgB,MAAmC;AAC1D,SAAO;AAAA,IACL,MAAM;AAAA,IACN,GAAI,KAAK,WAAW,OAAO,EAAE,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,IACxD,GAAI,KAAK,UAAU,OAAO,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,IACrD,UAAU,KAAK,SAAS,IAAI,YAAY;AAAA,IACxC,GAAG,cAAc,KAAK,QAAQ;AAAA,EAChC;AACF;AAEA,SAAS,gBAAgB,KAAkC;AACzD,SAAO;AAAA,IACL,MAAM;AAAA,IACN,UAAU,IAAI,SAAS,IAAI,gBAAgB;AAAA,IAC3C,GAAG,cAAc,IAAI,QAAQ;AAAA,EAC/B;AACF;AAEA,SAAS,iBAAiB,MAAoC;AAC5D,SAAO;AAAA,IACL,MAAM;AAAA,IACN,UAAU,sBAAsB,KAAK,QAAQ;AAAA,IAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,EAChC;AACF;AAOA,SAAS,sBAAsB,OAA0C;AACvE,QAAM,MAAmB,CAAC;AAC1B,aAAW,KAAK,OAAO;AACrB,QAAI,EAAE,SAAS,WAAW;AACxB,UAAI,KAAK,EAAE,MAAM,QAAQ,OAAO,IAAI,CAAC;AACrC,UAAI,KAAK;AAAA,QACP,MAAM;AAAA,QACN,KAAK,GAAG,EAAE,UAAU,IAAI,EAAE,QAAQ;AAAA,QAClC,UAAU,CAAC,EAAE,MAAM,QAAQ,OAAO,EAAE,YAAY,CAAC;AAAA,QACjD,GAAG,cAAc,EAAE,QAAQ;AAAA,MAC7B,CAAC;AAAA,IACH,OAAO;AACL,UAAI,KAAK,cAAc,CAAC,CAAC;AAAA,IAC3B;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,MAAqC;AAC1D,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,QACZ,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,sBAAsB,KAAK,QAAQ;AAAA,QAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,sBAAsB,KAAK,QAAQ;AAAA,QAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,sBAAsB,KAAK,QAAQ;AAAA,QAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,QACZ,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,KAAK,KAAK;AAAA,QACV,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,UAAU,sBAAsB,KAAK,QAAQ;AAAA,QAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,KAAK,KAAK;AAAA,QACV,GAAI,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,QAC5C,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,QACZ,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,QACZ,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK;AAAA,QACjB,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK;AAAA,QACjB,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,eAAe,KAAK;AAAA,QACpB,UAAU,sBAAsB,KAAK,QAAQ;AAAA,QAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,YAAY,KAAK;AAAA,QACjB,GAAI,KAAK,SAAS,OAAO,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,QAClD,eAAe,KAAK;AAAA,QACpB,GAAI,KAAK,OAAO,OAAO,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,QAC5C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,KAAK;AAAA,QACX,GAAI,KAAK,aAAa,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;AAAA,QACzD,UAAU,sBAAsB,KAAK,QAAQ;AAAA,QAC7C,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AAMH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,KAAK,GAAG,KAAK,UAAU,IAAI,KAAK,QAAQ;AAAA,QACxC,UAAU,CAAC,EAAE,MAAM,QAAQ,OAAO,KAAK,YAAY,CAAC;AAAA,QACpD,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF,KAAK;AAIH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK,KAAK,KAAK;AAAA,QACtB,GAAG,cAAc,KAAK,QAAQ;AAAA,MAChC;AAAA,IAEF;AACE,aAAO,EAAE,MAAM,QAAQ,OAAO,GAAG;AAAA,EACrC;AACF;AAUA,SAAS,qBAAqB,MAEnB;AACT,MAAI,OAAO;AACX,aAAW,SAAS,KAAK,UAAU;AACjC,QAAI,MAAM,SAAS,kBAAkB;AAEnC,YAAM,OAAQ,MAAM,SACjB,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EACxB,KAAK,EAAE;AACV,cAAQ,SAAS,IAAI;AAAA;AAAA,IACvB,WAAW,MAAM,SAAS,yBAAyB;AACjD,cAAQ;AAAA;AAAA,IACV;AAAA,EACF;AACA,UAAQ;AACR,SAAO;AACT;;;ACvzCA,SAAS,eAAe;AACxB,OAAO,iBAAiB;AACxB,OAAO,eAAe;AACtB,OAAO,gBAAgB;AACvB,OAAO,qBAAqB;AAC5B,OAAO,uBAAuB;AAM9B,IAAI;AAoBG,SAAS,cAAc,UAAkB,SAA0C;AAExF,QAAM,cACJ,CAAC,WACA,QAAQ,QAAQ,SACf,QAAQ,SAAS,SACjB,QAAQ,cAAc,SACtB,QAAQ,gBAAgB;AAE5B,MAAI;AAEJ,MAAI,aAAa;AACf,QAAI,CAAC,kBAAkB;AACrB,yBAAmB,QAAQ,EACxB,IAAI,WAAW,EACf,IAAI,SAAS,EACb,IAAI,UAAU,EACd,IAAI,eAAe,EACnB,IAAI,mBAAmB,CAAC,MAAM,CAAC;AAAA,IACpC;AACA,gBAAY;AAAA,EACd,OAAO;AAIL,gBAAY,QAAQ,EAAE,IAAI,WAAW;AAErC,QAAI,SAAS,QAAQ,OAAO;AAC1B,kBAAY,UAAU,IAAI,SAAS;AAAA,IACrC;AACA,QAAI,SAAS,SAAS,OAAO;AAC3B,kBAAY,UAAU,IAAI,UAAU;AAAA,IACtC;AACA,QAAI,SAAS,cAAc,OAAO;AAChC,kBAAY,UAAU,IAAI,eAAe;AAAA,IAC3C;AACA,QAAI,SAAS,gBAAgB,OAAO;AAClC,kBAAY,UAAU,IAAI,mBAAmB,CAAC,MAAM,CAAC;AAAA,IACvD;AAAA,EACF;AAGA,QAAM,YAAY,UAAU,MAAM,QAAQ;AAM1C,QAAM,MAAM,UAAU,WAA8C;AAAA,IAClE,WAAW,SAAS;AAAA,EACtB,CAAC;AAGD,MAAI,SAAS,gBAAgB,OAAO;AAClC,UAAM,WAAW,UAAU,UAAU,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM;AAClE,QAAI,UAAU,OAAO;AACnB,YAAM,KAAK,iBAAiB,SAAS,KAAK;AAC1C,UAAI,MAAM,OAAO,KAAK,EAAE,EAAE,SAAS,GAAG;AACpC,YAAI,cAAc;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}

package/dist/{chunk-H3AXU4MJ.js → chunk-OKJOQXK4.js}

@@ -1,3 +1,121 @@
+// src/markdown/htmlParse.ts
+import { fromHtml } from "hast-util-from-html";
+var HAST_PROP_TO_ATTR = {
+  className: "class",
+  htmlFor: "for",
+  httpEquiv: "http-equiv",
+  acceptCharset: "accept-charset"
+};
+var VOID_ELEMENTS = /* @__PURE__ */ new Set([
+  "area",
+  "base",
+  "br",
+  "col",
+  "embed",
+  "hr",
+  "img",
+  "input",
+  "link",
+  "meta",
+  "param",
+  "source",
+  "track",
+  "wbr"
+]);
+function propertyToAttribute(prop) {
+  if (HAST_PROP_TO_ATTR[prop]) return HAST_PROP_TO_ATTR[prop];
+  if (prop.length > 4 && prop.startsWith("data") && prop[4] >= "A" && prop[4] <= "Z") {
+    return "data-" + prop.slice(4).replace(/[A-Z]/g, (m) => "-" + m.toLowerCase()).replace(/^-/, "");
+  }
+  if (prop.length > 4 && prop.startsWith("aria") && prop[4] >= "A" && prop[4] <= "Z") {
+    return "aria-" + prop.slice(4).replace(/[A-Z]/g, (m) => "-" + m.toLowerCase()).replace(/^-/, "");
+  }
+  return prop.toLowerCase();
+}
+function convertHastProperties(properties) {
+  const attrs = {};
+  for (const [key, value] of Object.entries(properties)) {
+    if (value === false || value === void 0 || value === null) continue;
+    const attrName = propertyToAttribute(key);
+    if (value === true) {
+      attrs[attrName] = "";
+    } else if (Array.isArray(value)) {
+      attrs[attrName] = value.join(" ");
+    } else {
+      attrs[attrName] = String(value);
+    }
+  }
+  return attrs;
+}
+function hastChildrenToNodes(children) {
+  const result = [];
+  for (const child of children) {
+    const node = hastNodeToHtmlNode(child);
+    if (node) result.push(node);
+  }
+  return result;
+}
+function hastNodeToHtmlNode(node) {
+  switch (node.type) {
+    case "element": {
+      const tagName = node.tagName;
+      const properties = node.properties ?? {};
+      const children = node.children ?? [];
+      return {
+        type: "htmlElement",
+        tagName,
+        attributes: convertHastProperties(properties),
+        children: hastChildrenToNodes(children),
+        selfClosing: VOID_ELEMENTS.has(tagName) && children.length === 0
+      };
+    }
+    case "text":
+      return {
+        type: "htmlText",
+        value: node.value
+      };
+    case "comment":
+      return {
+        type: "htmlComment",
+        value: node.value
+      };
+    case "doctype":
+      return null;
+    default:
+      return null;
+  }
+}
+function parseHtmlToNodes(html) {
+  if (!html || !html.trim()) return [];
+  try {
+    const tree = fromHtml(html, { fragment: true });
+    return hastChildrenToNodes(tree.children);
+  } catch {
+    return [{ type: "htmlText", value: html }];
+  }
+}
+function escapeHtmlAttr(value) {
+  return value.replace(/&/g, "&amp;").replace(/"/g, "&quot;").replace(/</g, "&lt;").replace(/>/g, "&gt;");
+}
+function stringifyNode(node) {
+  switch (node.type) {
+    case "htmlElement": {
+      const attrs = Object.entries(node.attributes).map(([k, v]) => v === "" ? k : `${k}="${escapeHtmlAttr(v)}"`).join(" ");
+      const open = attrs ? `<${node.tagName} ${attrs}>` : `<${node.tagName}>`;
+      if (node.selfClosing) return open;
+      const inner = node.children.map(stringifyNode).join("");
+      return `${open}${inner}</${node.tagName}>`;
+    }
+    case "htmlText":
+      return node.value;
+    case "htmlComment":
+      return `<!--${node.value}-->`;
+  }
+}
+function stringifyHtmlNodes(nodes) {
+  return nodes.map(stringifyNode).join("");
+}
+
 // src/markdown/utils.ts
 function getChildren(node) {
   if ("children" in node && Array.isArray(node.children)) {
@@ -66,6 +184,7 @@ function parseFrontmatter(yaml) {
 var FRONTMATTER_BLOCK_RE = /^---\r?\n([\s\S]*?)\r?\n---(\r?\n)?/;
 function formatFrontmatterValue(value) {
   if (typeof value === "boolean" || typeof value === "number") return String(value);
+  if (/^[{[]/.test(value) && !/[\r\n]/.test(value)) return value;
   const needsQuote = /^\s|\s$/.test(value) || /^[!&*?|>%@`]/.test(value) || /[:#]/.test(value) || value === "" || value === "true" || value === "false" || /^-?\d+(\.\d+)?$/.test(value);
   if (!needsQuote) return value;
   const escaped = value.replace(/\\/g, "\\\\").replace(/"/g, '\\"');
@@ -163,8 +282,35 @@ function readFrontmatterThemeId(frontmatter) {
   }
   return void 0;
 }
+function plainTextFromInlineHtml(html) {
+  const BLOCK = /* @__PURE__ */ new Set([
+    "p",
+    "div",
+    "h1",
+    "h2",
+    "h3",
+    "h4",
+    "h5",
+    "h6",
+    "li",
+    "blockquote",
+    "pre"
+  ]);
+  const walk = (nodes) => nodes.map((n) => {
+    if (n.type === "htmlText") return n.value;
+    if (n.type !== "htmlElement") return "";
+    const tag = n.tagName.toLowerCase();
+    if (tag === "br") return "\n";
+    const inner = walk(n.children);
+    return BLOCK.has(tag) ? `${inner}
+` : inner;
+  }).join("");
+  return walk(parseHtmlToNodes(html)).replace(/\u00A0/g, " ").replace(/\n{3,}/g, "\n\n").trim();
+}
 
 export {
+  parseHtmlToNodes,
+  stringifyHtmlNodes,
   getChildren,
   walkMarkdownTree,
   findNodesByType,
@@ -174,6 +320,7 @@ export {
   setFrontmatterValues,
   createDocument,
   inferDocumentTitle,
-  readFrontmatterThemeId
+  readFrontmatterThemeId,
+  plainTextFromInlineHtml
 };
-//# sourceMappingURL=chunk-H3AXU4MJ.js.map
+//# sourceMappingURL=chunk-OKJOQXK4.js.map

package/dist/chunk-OKJOQXK4.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/markdown/htmlParse.ts","../src/markdown/utils.ts"],"sourcesContent":["/**\n * HTML ↔ HtmlNode Conversion\n *\n * Parses raw HTML strings into the squisq HtmlNode tree representation\n * using hast-util-from-html (parse5-backed), and serializes HtmlNode trees\n * back to HTML strings with a lightweight custom serializer.\n */\n\nimport { fromHtml } from 'hast-util-from-html';\nimport type { HtmlNode } from './types.js';\n\n// ============================================\n// Hast → HtmlNode conversion\n// ============================================\n\n/**\n * Mapping from hast DOM-style property names to HTML attribute names.\n * Only includes names where the property and attribute differ.\n */\nconst HAST_PROP_TO_ATTR: Record<string, string> = {\n  className: 'class',\n  htmlFor: 'for',\n  httpEquiv: 'http-equiv',\n  acceptCharset: 'accept-charset',\n};\n\n/** HTML void elements that are self-closing. */\nconst VOID_ELEMENTS = new Set([\n  'area',\n  'base',\n  'br',\n  'col',\n  'embed',\n  'hr',\n  'img',\n  'input',\n  'link',\n  'meta',\n  'param',\n  'source',\n  'track',\n  'wbr',\n]);\n\n/**\n * Convert a hast property name to an HTML attribute name.\n */\nfunction propertyToAttribute(prop: string): string {\n  if (HAST_PROP_TO_ATTR[prop]) return HAST_PROP_TO_ATTR[prop];\n\n  // data-* attributes: dataFooBar → data-foo-bar\n  if (prop.length > 4 && prop.startsWith('data') && prop[4] >= 'A' && prop[4] <= 'Z') {\n    return (\n      'data-' +\n      prop\n        .slice(4)\n        .replace(/[A-Z]/g, (m) => '-' + m.toLowerCase())\n        .replace(/^-/, '')\n    );\n  }\n\n  // aria-* attributes: ariaLabel → aria-label\n  if (prop.length > 4 && prop.startsWith('aria') && prop[4] >= 'A' && prop[4] <= 'Z') {\n    return (\n      'aria-' +\n      prop\n        .slice(4)\n        .replace(/[A-Z]/g, (m) => '-' + m.toLowerCase())\n        .replace(/^-/, '')\n    );\n  }\n\n  // Most HTML attributes are lowercase (tabIndex → tabindex, readOnly → readonly, etc.)\n  return prop.toLowerCase();\n}\n\n/**\n * Convert hast element properties to a flat HTML attribute map.\n */\nfunction convertHastProperties(properties: Record<string, unknown>): Record<string, string> {\n  const attrs: Record<string, string> = {};\n  for (const [key, value] of Object.entries(properties)) {\n    if (value === false || value === undefined || value === null) continue;\n\n    const attrName = propertyToAttribute(key);\n\n    if (value === true) {\n      attrs[attrName] = '';\n    } else if (Array.isArray(value)) {\n      attrs[attrName] = value.join(' ');\n    } else {\n      attrs[attrName] = String(value);\n    }\n  }\n  return attrs;\n}\n\n/**\n * Recursively convert hast child nodes to HtmlNode[].\n */\nfunction hastChildrenToNodes(children: unknown[]): HtmlNode[] {\n  const result: HtmlNode[] = [];\n  for (const child of children) {\n    const node = hastNodeToHtmlNode(child as Record<string, unknown>);\n    if (node) result.push(node);\n  }\n  return result;\n}\n\n/**\n * Convert a single hast node to an HtmlNode.\n */\nfunction hastNodeToHtmlNode(node: Record<string, unknown>): HtmlNode | null {\n  switch (node.type) {\n    case 'element': {\n      const tagName = node.tagName as string;\n      const properties = (node.properties ?? {}) as Record<string, unknown>;\n      const children = (node.children ?? []) as unknown[];\n      return {\n        type: 'htmlElement',\n        tagName,\n        attributes: convertHastProperties(properties),\n        children: hastChildrenToNodes(children),\n        selfClosing: VOID_ELEMENTS.has(tagName) && children.length === 0,\n      };\n    }\n    case 'text':\n      return {\n        type: 'htmlText',\n        value: node.value as string,\n      };\n    case 'comment':\n      return {\n        type: 'htmlComment',\n        value: node.value as string,\n      };\n    case 'doctype':\n      // Doctype nodes are rare in markdown HTML; skip them\n      return null;\n    default:\n      return null;\n  }\n}\n\n// ============================================\n// Public API\n// ============================================\n\n/**\n * Parse a raw HTML string into an HtmlNode[] tree.\n *\n * Uses the HTML5 parsing algorithm (via parse5) for correct handling of\n * self-closing tags, optional end tags, entity decoding, etc.\n *\n * @param html - Raw HTML string to parse\n * @returns Array of top-level HtmlNode elements\n */\nexport function parseHtmlToNodes(html: string): HtmlNode[] {\n  if (!html || !html.trim()) return [];\n\n  try {\n    const tree = fromHtml(html, { fragment: true });\n    return hastChildrenToNodes(tree.children as unknown[]);\n  } catch {\n    // If parsing fails, return the raw text as a single text node\n    return [{ type: 'htmlText', value: html }];\n  }\n}\n\n/**\n * Escape special characters in HTML attribute values.\n */\nfunction escapeHtmlAttr(value: string): string {\n  return value\n    .replace(/&/g, '&amp;')\n    .replace(/\"/g, '&quot;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;');\n}\n\n/**\n * Serialize an HtmlNode back to an HTML string.\n */\nfunction stringifyNode(node: HtmlNode): string {\n  switch (node.type) {\n    case 'htmlElement': {\n      const attrs = Object.entries(node.attributes)\n        .map(([k, v]) => (v === '' ? k : `${k}=\"${escapeHtmlAttr(v)}\"`))\n        .join(' ');\n      const open = attrs ? `<${node.tagName} ${attrs}>` : `<${node.tagName}>`;\n\n      if (node.selfClosing) return open;\n\n      const inner = node.children.map(stringifyNode).join('');\n      return `${open}${inner}</${node.tagName}>`;\n    }\n    case 'htmlText':\n      return node.value;\n    case 'htmlComment':\n      return `<!--${node.value}-->`;\n  }\n}\n\n/**\n * Serialize an HtmlNode[] tree back to an HTML string.\n *\n * @param nodes - Array of HtmlNode elements to serialize\n * @returns HTML string\n */\nexport function stringifyHtmlNodes(nodes: HtmlNode[]): string {\n  return nodes.map(stringifyNode).join('');\n}\n","/**\n * Markdown Tree Utilities\n *\n * Helper functions for traversing and querying the MarkdownDocument tree.\n * All functions are pure and operate on the JSON node interfaces.\n */\n\nimport type { MarkdownNode, MarkdownDocument, HtmlNode } from './types.js';\nimport { parseHtmlToNodes } from './htmlParse.js';\n\n/**\n * Get the children of any markdown node, if it has children.\n * Returns an empty array for leaf nodes (text, code, break, etc.).\n *\n * This is useful for generic tree walking where you don't want to\n * check the specific node type.\n */\nexport function getChildren(node: MarkdownNode): MarkdownNode[] {\n  if ('children' in node && Array.isArray(node.children)) {\n    return node.children as MarkdownNode[];\n  }\n  return [];\n}\n\n/**\n * Walk the markdown tree depth-first, calling the visitor for each node.\n *\n * The visitor receives the current node and its parent. Return `true`\n * from the visitor to skip the node's children (prune).\n *\n * @param node - The root node to start walking from\n * @param visitor - Called for each node; return true to skip children\n * @param parent - (internal) Parent node\n */\nexport function walkMarkdownTree(\n  node: MarkdownNode,\n  visitor: (node: MarkdownNode, parent?: MarkdownNode) => void | boolean,\n  parent?: MarkdownNode,\n): void {\n  const skip = visitor(node, parent);\n  if (skip === true) return;\n\n  const children = getChildren(node);\n  for (const child of children) {\n    walkMarkdownTree(child, visitor, node);\n  }\n}\n\n/**\n * Find all nodes of a specific type in the tree.\n *\n * @param root - The document or node to search within\n * @param type - The node type to find (e.g., 'heading', 'link', 'text')\n * @returns Array of matching nodes\n *\n * @example\n * ```ts\n * const headings = findNodesByType(doc, 'heading');\n * const links = findNodesByType(doc, 'link');\n * ```\n */\nexport function findNodesByType<T extends MarkdownNode>(root: MarkdownNode, type: T['type']): T[] {\n  const results: T[] = [];\n  walkMarkdownTree(root, (node) => {\n    if (node.type === type) {\n      results.push(node as T);\n    }\n  });\n  return results;\n}\n\n/**\n * Extract all plain text content from a node and its descendants.\n * Concatenates text values, ignoring formatting, links, etc.\n *\n * @param node - The node to extract text from\n * @returns Plain text content\n *\n * @example\n * ```ts\n * const heading = doc.children[0]; // { type: 'heading', children: [{ type: 'text', value: 'Hello' }] }\n * extractPlainText(heading); // 'Hello'\n * ```\n */\nexport function extractPlainText(node: MarkdownNode): string {\n  if ('value' in node && typeof node.value === 'string') {\n    return node.value;\n  }\n\n  const children = getChildren(node);\n  // Preserve boundaries between block-level elements (list items, paragraphs\n  // inside list items, blockquotes) so downstream consumers like caption\n  // splitting can treat each item as a separate phrase.\n  const separator = node.type === 'list' || node.type === 'listItem' ? '\\n' : '';\n  return children.map(extractPlainText).join(separator);\n}\n\n/**\n * Count the total number of nodes in the tree.\n *\n * @param node - The root node\n * @returns Total node count (including the root)\n */\nexport function countNodes(node: MarkdownNode): number {\n  let count = 1;\n  const children = getChildren(node);\n  for (const child of children) {\n    count += countNodes(child);\n  }\n  return count;\n}\n\n/**\n * Parse a YAML frontmatter string into a key-value record.\n *\n * Handles simple `key: value` pairs common in markdown frontmatter.\n * Values are trimmed; quoted strings have their quotes removed.\n * Returns `null` if parsing fails or the input is empty.\n *\n * @param yaml - The raw YAML string (without the `---` delimiters)\n * @returns A record of string keys to parsed values, or null\n */\nexport function parseFrontmatter(yaml: string): Record<string, unknown> | null {\n  if (!yaml || !yaml.trim()) return null;\n\n  const result: Record<string, unknown> = {};\n\n  for (const line of yaml.split('\\n')) {\n    const trimmed = line.trim();\n    if (!trimmed || trimmed.startsWith('#')) continue;\n\n    const colonIdx = trimmed.indexOf(':');\n    if (colonIdx < 1) continue;\n\n    const key = trimmed.slice(0, colonIdx).trim();\n    let value: string | boolean | number = trimmed.slice(colonIdx + 1).trim();\n\n    // Remove surrounding quotes\n    if (\n      (value.startsWith('\"') && value.endsWith('\"')) ||\n      (value.startsWith(\"'\") && value.endsWith(\"'\"))\n    ) {\n      value = value.slice(1, -1);\n    }\n\n    // Parse booleans and numbers\n    if (value === 'true') {\n      result[key] = true;\n    } else if (value === 'false') {\n      result[key] = false;\n    } else if (value !== '' && !isNaN(Number(value))) {\n      result[key] = Number(value);\n    } else {\n      result[key] = value;\n    }\n  }\n\n  return Object.keys(result).length > 0 ? result : null;\n}\n\nconst FRONTMATTER_BLOCK_RE = /^---\\r?\\n([\\s\\S]*?)\\r?\\n---(\\r?\\n)?/;\n\n/** Quote a frontmatter scalar so it round-trips cleanly through `parseFrontmatter`. */\nfunction formatFrontmatterValue(value: string | number | boolean): string {\n  if (typeof value === 'boolean' || typeof value === 'number') return String(value);\n  // A single-line JSON object/array literal round-trips verbatim through\n  // the line-based `parseFrontmatter` (no leading quote to strip, no\n  // newline to split on), so write it unquoted to keep it human-readable\n  // — matching how `stringifyMarkdown` emits string values. Used by the\n  // compact custom-layouts payload.\n  if (/^[{[]/.test(value) && !/[\\r\\n]/.test(value)) return value;\n  // Quote when needed: leading/trailing whitespace, leading punctuation that\n  // could trigger YAML modes, or values that look like reserved literals.\n  const needsQuote =\n    /^\\s|\\s$/.test(value) ||\n    /^[!&*?|>%@`]/.test(value) ||\n    /[:#]/.test(value) ||\n    value === '' ||\n    value === 'true' ||\n    value === 'false' ||\n    /^-?\\d+(\\.\\d+)?$/.test(value);\n  if (!needsQuote) return value;\n  // Prefer double quotes; escape any embedded double-quote / backslash.\n  const escaped = value.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n  return `\"${escaped}\"`;\n}\n\n/**\n * Update a markdown source string's YAML frontmatter block, applying the\n * given key/value updates. A `null` or `undefined` value removes the key.\n * If no frontmatter block exists and any non-null update is supplied, a\n * new block is prepended; if every update is a removal and no block\n * exists, the source is returned unchanged.\n *\n * Existing key order is preserved; new keys are appended in the order\n * they appear in `updates`. The simple parser used here handles plain\n * `key: value` pairs only — comments, multi-line scalars, and nested\n * structures are left untouched (we only rewrite lines whose key matches\n * one in `updates`).\n *\n * @param source - The markdown source string.\n * @param updates - Map of key → new value (or null/undefined to remove).\n * @returns The updated markdown source string.\n */\nexport function setFrontmatterValues(\n  source: string,\n  updates: Record<string, string | number | boolean | null | undefined>,\n): string {\n  const updateKeys = Object.keys(updates);\n  if (updateKeys.length === 0) return source;\n\n  const match = source.match(FRONTMATTER_BLOCK_RE);\n  const handled = new Set<string>();\n\n  // Existing frontmatter block — rewrite line-by-line, preserving order.\n  if (match) {\n    const inner = match[1];\n    const lines = inner.split(/\\r?\\n/);\n    const newLines: string[] = [];\n\n    for (const line of lines) {\n      const trimmed = line.trim();\n      if (!trimmed || trimmed.startsWith('#')) {\n        newLines.push(line);\n        continue;\n      }\n      const colonIdx = trimmed.indexOf(':');\n      if (colonIdx < 1) {\n        newLines.push(line);\n        continue;\n      }\n      const key = trimmed.slice(0, colonIdx).trim();\n      if (!Object.prototype.hasOwnProperty.call(updates, key)) {\n        newLines.push(line);\n        continue;\n      }\n      handled.add(key);\n      const next = updates[key];\n      if (next === null || next === undefined) continue; // remove\n      newLines.push(`${key}: ${formatFrontmatterValue(next)}`);\n    }\n\n    // Append any keys that weren't already present.\n    for (const key of updateKeys) {\n      if (handled.has(key)) continue;\n      const next = updates[key];\n      if (next === null || next === undefined) continue;\n      newLines.push(`${key}: ${formatFrontmatterValue(next)}`);\n    }\n\n    // If every line got removed, drop the block entirely.\n    const nonEmpty = newLines.filter((l) => l.trim().length > 0);\n    const rest = source.slice(match[0].length);\n    if (nonEmpty.length === 0) return rest;\n    return `---\\n${newLines.join('\\n')}\\n---\\n${rest}`;\n  }\n\n  // No existing block — only create one if there's at least one non-null\n  // value to write.\n  const fresh: string[] = [];\n  for (const key of updateKeys) {\n    const next = updates[key];\n    if (next === null || next === undefined) continue;\n    fresh.push(`${key}: ${formatFrontmatterValue(next)}`);\n  }\n  if (fresh.length === 0) return source;\n  return `---\\n${fresh.join('\\n')}\\n---\\n${source}`;\n}\n\n/**\n * Create a minimal MarkdownDocument from a list of block nodes.\n * Convenience function for programmatic document construction.\n */\nexport function createDocument(...children: MarkdownDocument['children']): MarkdownDocument {\n  return {\n    type: 'document',\n    children,\n  };\n}\n\n/**\n * Infer a human-readable title for a markdown document.\n *\n * Resolution order:\n *   1. `title:` value in YAML frontmatter (when present and non-empty)\n *   2. Text of the first heading found, walking top-level depth (H1, then\n *      H2, etc.) — the shallowest heading wins regardless of source order\n *\n * Returns `undefined` when no usable title is found.\n */\nexport function inferDocumentTitle(doc: MarkdownDocument): string | undefined {\n  const fmTitle = doc.frontmatter?.title;\n  if (typeof fmTitle === 'string') {\n    const trimmed = fmTitle.trim();\n    if (trimmed) return trimmed;\n  }\n\n  let best: { depth: number; text: string } | null = null;\n  for (const node of doc.children) {\n    if (node.type !== 'heading') continue;\n    const text = extractPlainText(node).trim();\n    if (!text) continue;\n    if (best === null || node.depth < best.depth) {\n      best = { depth: node.depth, text };\n      if (best.depth === 1) break;\n    }\n  }\n\n  return best?.text;\n}\n\n/**\n * Read a theme id from a markdown document's frontmatter.\n *\n * Checks the editor's canonical `squisq-theme` key first, then the\n * shorter legacy aliases (`themeId`, `theme`). Returns `undefined`\n * when none of them carry a non-empty string. Centralizing the lookup\n * keeps the export pipelines (DOCX, PPTX, HTML, plain-HTML bundle) in\n * sync with whatever the editor writes — adding a new frontmatter\n * spelling later is a one-file change.\n */\nexport function readFrontmatterThemeId(\n  frontmatter: Record<string, unknown> | undefined,\n): string | undefined {\n  if (!frontmatter) return undefined;\n  const keys = ['squisq-theme', 'themeId', 'theme'] as const;\n  for (const key of keys) {\n    const raw = frontmatter[key];\n    if (typeof raw === 'string') {\n      const trimmed = raw.trim();\n      if (trimmed) return trimmed;\n    }\n  }\n  return undefined;\n}\n\n/**\n * Project an inline-HTML string (as stored on `TextLayer.content.html`) down\n * to plain text — the value mirrored into `content.text` for plain consumers\n * (PDF/markdown export, search, accessibility) and the SVG `<text>` fallback.\n *\n * `<br>` and block-level tags (`p`, `div`, `h1`–`h6`, `li`, `blockquote`,\n * `pre`) become line breaks so multi-line rich content reads sensibly. Entity\n * decoding is handled by {@link parseHtmlToNodes} (parse5-backed), so this is\n * more correct than a regex tag-stripper.\n */\nexport function plainTextFromInlineHtml(html: string): string {\n  const BLOCK = new Set([\n    'p',\n    'div',\n    'h1',\n    'h2',\n    'h3',\n    'h4',\n    'h5',\n    'h6',\n    'li',\n    'blockquote',\n    'pre',\n  ]);\n  const walk = (nodes: HtmlNode[]): string =>\n    nodes\n      .map((n) => {\n        if (n.type === 'htmlText') return n.value;\n        if (n.type !== 'htmlElement') return '';\n        const tag = n.tagName.toLowerCase();\n        if (tag === 'br') return '\\n';\n        const inner = walk(n.children);\n        return BLOCK.has(tag) ? `${inner}\\n` : inner;\n      })\n      .join('');\n  return walk(parseHtmlToNodes(html))\n    .replace(/\\u00A0/g, ' ')\n    .replace(/\\n{3,}/g, '\\n\\n')\n    .trim();\n}\n"],"mappings":";AAQA,SAAS,gBAAgB;AAWzB,IAAM,oBAA4C;AAAA,EAChD,WAAW;AAAA,EACX,SAAS;AAAA,EACT,WAAW;AAAA,EACX,eAAe;AACjB;AAGA,IAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAKD,SAAS,oBAAoB,MAAsB;AACjD,MAAI,kBAAkB,IAAI,EAAG,QAAO,kBAAkB,IAAI;AAG1D,MAAI,KAAK,SAAS,KAAK,KAAK,WAAW,MAAM,KAAK,KAAK,CAAC,KAAK,OAAO,KAAK,CAAC,KAAK,KAAK;AAClF,WACE,UACA,KACG,MAAM,CAAC,EACP,QAAQ,UAAU,CAAC,MAAM,MAAM,EAAE,YAAY,CAAC,EAC9C,QAAQ,MAAM,EAAE;AAAA,EAEvB;AAGA,MAAI,KAAK,SAAS,KAAK,KAAK,WAAW,MAAM,KAAK,KAAK,CAAC,KAAK,OAAO,KAAK,CAAC,KAAK,KAAK;AAClF,WACE,UACA,KACG,MAAM,CAAC,EACP,QAAQ,UAAU,CAAC,MAAM,MAAM,EAAE,YAAY,CAAC,EAC9C,QAAQ,MAAM,EAAE;AAAA,EAEvB;AAGA,SAAO,KAAK,YAAY;AAC1B;AAKA,SAAS,sBAAsB,YAA6D;AAC1F,QAAM,QAAgC,CAAC;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,UAAU,GAAG;AACrD,QAAI,UAAU,SAAS,UAAU,UAAa,UAAU,KAAM;AAE9D,UAAM,WAAW,oBAAoB,GAAG;AAExC,QAAI,UAAU,MAAM;AAClB,YAAM,QAAQ,IAAI;AAAA,IACpB,WAAW,MAAM,QAAQ,KAAK,GAAG;AAC/B,YAAM,QAAQ,IAAI,MAAM,KAAK,GAAG;AAAA,IAClC,OAAO;AACL,YAAM,QAAQ,IAAI,OAAO,KAAK;AAAA,IAChC;AAAA,EACF;AACA,SAAO;AACT;AAKA,SAAS,oBAAoB,UAAiC;AAC5D,QAAM,SAAqB,CAAC;AAC5B,aAAW,SAAS,UAAU;AAC5B,UAAM,OAAO,mBAAmB,KAAgC;AAChE,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AACA,SAAO;AACT;AAKA,SAAS,mBAAmB,MAAgD;AAC1E,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,WAAW;AACd,YAAM,UAAU,KAAK;AACrB,YAAM,aAAc,KAAK,cAAc,CAAC;AACxC,YAAM,WAAY,KAAK,YAAY,CAAC;AACpC,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,QACA,YAAY,sBAAsB,UAAU;AAAA,QAC5C,UAAU,oBAAoB,QAAQ;AAAA,QACtC,aAAa,cAAc,IAAI,OAAO,KAAK,SAAS,WAAW;AAAA,MACjE;AAAA,IACF;AAAA,IACA,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,MACd;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,KAAK;AAAA,MACd;AAAA,IACF,KAAK;AAEH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAeO,SAAS,iBAAiB,MAA0B;AACzD,MAAI,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAG,QAAO,CAAC;AAEnC,MAAI;AACF,UAAM,OAAO,SAAS,MAAM,EAAE,UAAU,KAAK,CAAC;AAC9C,WAAO,oBAAoB,KAAK,QAAqB;AAAA,EACvD,QAAQ;AAEN,WAAO,CAAC,EAAE,MAAM,YAAY,OAAO,KAAK,CAAC;AAAA,EAC3C;AACF;AAKA,SAAS,eAAe,OAAuB;AAC7C,SAAO,MACJ,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,QAAQ,EACtB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM;AACzB;AAKA,SAAS,cAAc,MAAwB;AAC7C,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,eAAe;AAClB,YAAM,QAAQ,OAAO,QAAQ,KAAK,UAAU,EACzC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAO,MAAM,KAAK,IAAI,GAAG,CAAC,KAAK,eAAe,CAAC,CAAC,GAAI,EAC9D,KAAK,GAAG;AACX,YAAM,OAAO,QAAQ,IAAI,KAAK,OAAO,IAAI,KAAK,MAAM,IAAI,KAAK,OAAO;AAEpE,UAAI,KAAK,YAAa,QAAO;AAE7B,YAAM,QAAQ,KAAK,SAAS,IAAI,aAAa,EAAE,KAAK,EAAE;AACtD,aAAO,GAAG,IAAI,GAAG,KAAK,KAAK,KAAK,OAAO;AAAA,IACzC;AAAA,IACA,KAAK;AACH,aAAO,KAAK;AAAA,IACd,KAAK;AACH,aAAO,OAAO,KAAK,KAAK;AAAA,EAC5B;AACF;AAQO,SAAS,mBAAmB,OAA2B;AAC5D,SAAO,MAAM,IAAI,aAAa,EAAE,KAAK,EAAE;AACzC;;;AClMO,SAAS,YAAY,MAAoC;AAC9D,MAAI,cAAc,QAAQ,MAAM,QAAQ,KAAK,QAAQ,GAAG;AACtD,WAAO,KAAK;AAAA,EACd;AACA,SAAO,CAAC;AACV;AAYO,SAAS,iBACd,MACA,SACA,QACM;AACN,QAAM,OAAO,QAAQ,MAAM,MAAM;AACjC,MAAI,SAAS,KAAM;AAEnB,QAAM,WAAW,YAAY,IAAI;AACjC,aAAW,SAAS,UAAU;AAC5B,qBAAiB,OAAO,SAAS,IAAI;AAAA,EACvC;AACF;AAeO,SAAS,gBAAwC,MAAoB,MAAsB;AAChG,QAAM,UAAe,CAAC;AACtB,mBAAiB,MAAM,CAAC,SAAS;AAC/B,QAAI,KAAK,SAAS,MAAM;AACtB,cAAQ,KAAK,IAAS;AAAA,IACxB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAeO,SAAS,iBAAiB,MAA4B;AAC3D,MAAI,WAAW,QAAQ,OAAO,KAAK,UAAU,UAAU;AACrD,WAAO,KAAK;AAAA,EACd;AAEA,QAAM,WAAW,YAAY,IAAI;AAIjC,QAAM,YAAY,KAAK,SAAS,UAAU,KAAK,SAAS,aAAa,OAAO;AAC5E,SAAO,SAAS,IAAI,gBAAgB,EAAE,KAAK,SAAS;AACtD;AAQO,SAAS,WAAW,MAA4B;AACrD,MAAI,QAAQ;AACZ,QAAM,WAAW,YAAY,IAAI;AACjC,aAAW,SAAS,UAAU;AAC5B,aAAS,WAAW,KAAK;AAAA,EAC3B;AACA,SAAO;AACT;AAYO,SAAS,iBAAiB,MAA8C;AAC7E,MAAI,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAG,QAAO;AAElC,QAAM,SAAkC,CAAC;AAEzC,aAAW,QAAQ,KAAK,MAAM,IAAI,GAAG;AACnC,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,CAAC,WAAW,QAAQ,WAAW,GAAG,EAAG;AAEzC,UAAM,WAAW,QAAQ,QAAQ,GAAG;AACpC,QAAI,WAAW,EAAG;AAElB,UAAM,MAAM,QAAQ,MAAM,GAAG,QAAQ,EAAE,KAAK;AAC5C,QAAI,QAAmC,QAAQ,MAAM,WAAW,CAAC,EAAE,KAAK;AAGxE,QACG,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,KAC3C,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAC5C;AACA,cAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,IAC3B;AAGA,QAAI,UAAU,QAAQ;AACpB,aAAO,GAAG,IAAI;AAAA,IAChB,WAAW,UAAU,SAAS;AAC5B,aAAO,GAAG,IAAI;AAAA,IAChB,WAAW,UAAU,MAAM,CAAC,MAAM,OAAO,KAAK,CAAC,GAAG;AAChD,aAAO,GAAG,IAAI,OAAO,KAAK;AAAA,IAC5B,OAAO;AACL,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AAEA,SAAO,OAAO,KAAK,MAAM,EAAE,SAAS,IAAI,SAAS;AACnD;AAEA,IAAM,uBAAuB;AAG7B,SAAS,uBAAuB,OAA0C;AACxE,MAAI,OAAO,UAAU,aAAa,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK;AAMhF,MAAI,QAAQ,KAAK,KAAK,KAAK,CAAC,SAAS,KAAK,KAAK,EAAG,QAAO;AAGzD,QAAM,aACJ,UAAU,KAAK,KAAK,KACpB,eAAe,KAAK,KAAK,KACzB,OAAO,KAAK,KAAK,KACjB,UAAU,MACV,UAAU,UACV,UAAU,WACV,kBAAkB,KAAK,KAAK;AAC9B,MAAI,CAAC,WAAY,QAAO;AAExB,QAAM,UAAU,MAAM,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AAChE,SAAO,IAAI,OAAO;AACpB;AAmBO,SAAS,qBACd,QACA,SACQ;AACR,QAAM,aAAa,OAAO,KAAK,OAAO;AACtC,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,QAAQ,OAAO,MAAM,oBAAoB;AAC/C,QAAM,UAAU,oBAAI,IAAY;AAGhC,MAAI,OAAO;AACT,UAAM,QAAQ,MAAM,CAAC;AACrB,UAAM,QAAQ,MAAM,MAAM,OAAO;AACjC,UAAM,WAAqB,CAAC;AAE5B,eAAW,QAAQ,OAAO;AACxB,YAAM,UAAU,KAAK,KAAK;AAC1B,UAAI,CAAC,WAAW,QAAQ,WAAW,GAAG,GAAG;AACvC,iBAAS,KAAK,IAAI;AAClB;AAAA,MACF;AACA,YAAM,WAAW,QAAQ,QAAQ,GAAG;AACpC,UAAI,WAAW,GAAG;AAChB,iBAAS,KAAK,IAAI;AAClB;AAAA,MACF;AACA,YAAM,MAAM,QAAQ,MAAM,GAAG,QAAQ,EAAE,KAAK;AAC5C,UAAI,CAAC,OAAO,UAAU,eAAe,KAAK,SAAS,GAAG,GAAG;AACvD,iBAAS,KAAK,IAAI;AAClB;AAAA,MACF;AACA,cAAQ,IAAI,GAAG;AACf,YAAM,OAAO,QAAQ,GAAG;AACxB,UAAI,SAAS,QAAQ,SAAS,OAAW;AACzC,eAAS,KAAK,GAAG,GAAG,KAAK,uBAAuB,IAAI,CAAC,EAAE;AAAA,IACzD;AAGA,eAAW,OAAO,YAAY;AAC5B,UAAI,QAAQ,IAAI,GAAG,EAAG;AACtB,YAAM,OAAO,QAAQ,GAAG;AACxB,UAAI,SAAS,QAAQ,SAAS,OAAW;AACzC,eAAS,KAAK,GAAG,GAAG,KAAK,uBAAuB,IAAI,CAAC,EAAE;AAAA,IACzD;AAGA,UAAM,WAAW,SAAS,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC;AAC3D,UAAM,OAAO,OAAO,MAAM,MAAM,CAAC,EAAE,MAAM;AACzC,QAAI,SAAS,WAAW,EAAG,QAAO;AAClC,WAAO;AAAA,EAAQ,SAAS,KAAK,IAAI,CAAC;AAAA;AAAA,EAAU,IAAI;AAAA,EAClD;AAIA,QAAM,QAAkB,CAAC;AACzB,aAAW,OAAO,YAAY;AAC5B,UAAM,OAAO,QAAQ,GAAG;AACxB,QAAI,SAAS,QAAQ,SAAS,OAAW;AACzC,UAAM,KAAK,GAAG,GAAG,KAAK,uBAAuB,IAAI,CAAC,EAAE;AAAA,EACtD;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,SAAO;AAAA,EAAQ,MAAM,KAAK,IAAI,CAAC;AAAA;AAAA,EAAU,MAAM;AACjD;AAMO,SAAS,kBAAkB,UAA0D;AAC1F,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,EACF;AACF;AAYO,SAAS,mBAAmB,KAA2C;AAC5E,QAAM,UAAU,IAAI,aAAa;AACjC,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAM,UAAU,QAAQ,KAAK;AAC7B,QAAI,QAAS,QAAO;AAAA,EACtB;AAEA,MAAI,OAA+C;AACnD,aAAW,QAAQ,IAAI,UAAU;AAC/B,QAAI,KAAK,SAAS,UAAW;AAC7B,UAAM,OAAO,iBAAiB,IAAI,EAAE,KAAK;AACzC,QAAI,CAAC,KAAM;AACX,QAAI,SAAS,QAAQ,KAAK,QAAQ,KAAK,OAAO;AAC5C,aAAO,EAAE,OAAO,KAAK,OAAO,KAAK;AACjC,UAAI,KAAK,UAAU,EAAG;AAAA,IACxB;AAAA,EACF;AAEA,SAAO,MAAM;AACf;AAYO,SAAS,uBACd,aACoB;AACpB,MAAI,CAAC,YAAa,QAAO;AACzB,QAAM,OAAO,CAAC,gBAAgB,WAAW,OAAO;AAChD,aAAW,OAAO,MAAM;AACtB,UAAM,MAAM,YAAY,GAAG;AAC3B,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,UAAU,IAAI,KAAK;AACzB,UAAI,QAAS,QAAO;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AACT;AAYO,SAAS,wBAAwB,MAAsB;AAC5D,QAAM,QAAQ,oBAAI,IAAI;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,OAAO,CAAC,UACZ,MACG,IAAI,CAAC,MAAM;AACV,QAAI,EAAE,SAAS,WAAY,QAAO,EAAE;AACpC,QAAI,EAAE,SAAS,cAAe,QAAO;AACrC,UAAM,MAAM,EAAE,QAAQ,YAAY;AAClC,QAAI,QAAQ,KAAM,QAAO;AACzB,UAAM,QAAQ,KAAK,EAAE,QAAQ;AAC7B,WAAO,MAAM,IAAI,GAAG,IAAI,GAAG,KAAK;AAAA,IAAO;AAAA,EACzC,CAAC,EACA,KAAK,EAAE;AACZ,SAAO,KAAK,iBAAiB,IAAI,CAAC,EAC/B,QAAQ,WAAW,GAAG,EACtB,QAAQ,WAAW,MAAM,EACzB,KAAK;AACV;","names":[]}

package/dist/chunk-PGGGKYWG.js

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

package/dist/chunk-PGGGKYWG.js.map

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

package/dist/{chunk-7UDSRZKG.js → chunk-Q3ROPT5H.js}

@@ -38,9 +38,7 @@ function getNeighbors(hash) {
   return ngeohash.neighbors(hash);
 }
 function getGeohash4Neighbors(geohash4) {
-  if (geohash4.length !== 4) {
-    throw new Error(`getGeohash4Neighbors requires 4-char geohash, got: ${geohash4}`);
-  }
+  if (geohash4.length !== 4) return [];
   const neighbors = getNeighbors(geohash4);
   return [geohash4, ...neighbors];
 }
@@ -48,9 +46,7 @@ function getGeohashPrefix(geohash, precision) {
   return geohash.slice(0, precision);
 }
 function geohashToHierarchicalPath(geohash4) {
-  if (geohash4.length !== 4) {
-    throw new Error(`geohashToHierarchicalPath requires 4-char geohash, got: ${geohash4}`);
-  }
+  if (geohash4.length !== 4) return "";
   const [c1, c2, c3, c4] = geohash4.split("");
   return `${c1}/${c2}/${c3}/${c4}`;
 }
@@ -58,19 +54,44 @@ function getGeohashPath(from, to, precision = 4) {
   if (from === to) return [];
   const fromCenter = decodeGeohash(from);
   const toCenter = decodeGeohash(to);
-  const dLat = Math.abs(toCenter.lat - fromCenter.lat);
-  const dLng = Math.abs(toCenter.lng - fromCenter.lng);
-  const midLatRad = (fromCenter.lat + toCenter.lat) / 2 * (Math.PI / 180);
-  const approxKm = Math.sqrt((dLat * 111) ** 2 + (dLng * 111 * Math.cos(midLatRad)) ** 2);
-  const steps = Math.max(2, Math.ceil(approxKm / 15));
+  const distKm = haversineDistance(
+    { lat: fromCenter.lat, lng: fromCenter.lng },
+    { lat: toCenter.lat, lng: toCenter.lng }
+  );
+  const steps = Math.max(2, Math.ceil(distKm / 15));
+  const \u03C61 = fromCenter.lat * Math.PI / 180;
+  const \u03BB1 = fromCenter.lng * Math.PI / 180;
+  const \u03C62 = toCenter.lat * Math.PI / 180;
+  const \u03BB2 = toCenter.lng * Math.PI / 180;
+  const x1 = Math.cos(\u03C61) * Math.cos(\u03BB1);
+  const y1 = Math.cos(\u03C61) * Math.sin(\u03BB1);
+  const z1 = Math.sin(\u03C61);
+  const x2 = Math.cos(\u03C62) * Math.cos(\u03BB2);
+  const y2 = Math.cos(\u03C62) * Math.sin(\u03BB2);
+  const z2 = Math.sin(\u03C62);
+  const dot = Math.max(-1, Math.min(1, x1 * x2 + y1 * y2 + z1 * z2));
+  const d = Math.acos(dot);
+  const useLinear = Math.abs(Math.sin(d)) < 1e-10;
   const seen = /* @__PURE__ */ new Set();
   seen.add(from);
   seen.add(to);
   const path = [];
   for (let i = 1; i < steps; i++) {
     const t = i / steps;
-    const lat = fromCenter.lat + t * (toCenter.lat - fromCenter.lat);
-    const lng = fromCenter.lng + t * (toCenter.lng - fromCenter.lng);
+    let lat;
+    let lng;
+    if (useLinear) {
+      lat = fromCenter.lat + t * (toCenter.lat - fromCenter.lat);
+      lng = fromCenter.lng + t * (toCenter.lng - fromCenter.lng);
+    } else {
+      const A = Math.sin((1 - t) * d) / Math.sin(d);
+      const B = Math.sin(t * d) / Math.sin(d);
+      const x = A * x1 + B * x2;
+      const y = A * y1 + B * y2;
+      const z = A * z1 + B * z2;
+      lat = Math.atan2(z, Math.sqrt(x * x + y * y)) * 180 / Math.PI;
+      lng = Math.atan2(y, x) * 180 / Math.PI;
+    }
     const hash = encodeGeohash(lat, lng, precision);
     if (!seen.has(hash)) {
       seen.add(hash);
@@ -100,4 +121,4 @@ export {
   getGeohashPath,
   geohashOverlapsBounds
 };
-//# sourceMappingURL=chunk-7UDSRZKG.js.map
+//# sourceMappingURL=chunk-Q3ROPT5H.js.map

package/dist/chunk-Q3ROPT5H.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/spatial/Haversine.ts","../src/spatial/Geohash.ts"],"sourcesContent":["/**\n * Haversine Distance Calculation\n *\n * Provides accurate distance calculation between two geographic coordinates\n * using the Haversine formula, which accounts for Earth's curvature.\n */\n\nimport type { Coordinates } from '../schemas/Types.js';\n\n/**\n * Calculate distance between two coordinates using Haversine formula.\n *\n * @param from Start coordinates\n * @param to End coordinates\n * @returns Distance in kilometers\n */\nexport function haversineDistance(from: Coordinates, to: Coordinates): number {\n  const R = 6371; // Earth's radius in kilometers\n\n  const dLat = toRadians(to.lat - from.lat);\n  const dLng = toRadians(to.lng - from.lng);\n\n  const a =\n    Math.sin(dLat / 2) * Math.sin(dLat / 2) +\n    Math.cos(toRadians(from.lat)) *\n      Math.cos(toRadians(to.lat)) *\n      Math.sin(dLng / 2) *\n      Math.sin(dLng / 2);\n\n  const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n  return R * c;\n}\n\n/**\n * Calculate bearing from one coordinate to another.\n *\n * @param from Start coordinates\n * @param to End coordinates\n * @returns Bearing in degrees (0-360, where 0 = north, 90 = east)\n */\nexport function calculateBearing(from: Coordinates, to: Coordinates): number {\n  const dLng = toRadians(to.lng - from.lng);\n  const lat1 = toRadians(from.lat);\n  const lat2 = toRadians(to.lat);\n\n  const x = Math.sin(dLng) * Math.cos(lat2);\n  const y = Math.cos(lat1) * Math.sin(lat2) - Math.sin(lat1) * Math.cos(lat2) * Math.cos(dLng);\n\n  const bearing = Math.atan2(x, y);\n  return ((bearing * 180) / Math.PI + 360) % 360;\n}\n\n/**\n * Convert degrees to radians.\n */\nfunction toRadians(degrees: number): number {\n  return (degrees * Math.PI) / 180;\n}\n","/**\n * Geohash Utilities\n *\n * Provides geohash encoding/decoding and spatial utilities using the standard\n * ngeohash library for core operations, plus custom utilities for overlap checking\n * and distance calculation.\n *\n * Geohashes are a hierarchical spatial indexing system that divides the world\n * into a grid of cells. Each additional character narrows the area by ~1/32.\n *\n * Precision guide:\n * - 4 chars: ~39km x 19km (used for tile indexing)\n * - 5 chars: ~5km x 5km\n * - 6 chars: ~1.2km x 0.6km\n */\n\nimport ngeohash from 'ngeohash';\nimport { haversineDistance } from './Haversine.js';\n\n/**\n * Encode latitude/longitude to a geohash string.\n * Uses the standard ngeohash library.\n */\nexport function encodeGeohash(lat: number, lng: number, precision = 9): string {\n  return ngeohash.encode(lat, lng, precision);\n}\n\n/**\n * Decode a geohash to latitude/longitude center with error bounds.\n * Uses the standard ngeohash library.\n */\nexport function decodeGeohash(hash: string): {\n  lat: number;\n  lng: number;\n  latErr: number;\n  lngErr: number;\n} {\n  const result = ngeohash.decode(hash);\n  return {\n    lat: result.latitude,\n    lng: result.longitude,\n    latErr: result.error.latitude,\n    lngErr: result.error.longitude,\n  };\n}\n\n/**\n * Get the 8 neighboring geohash cells.\n * Returns up to 8 neighbors (fewer at poles or antimeridian).\n * Uses the standard ngeohash library.\n */\nexport function getNeighbors(hash: string): string[] {\n  return ngeohash.neighbors(hash);\n}\n\n/**\n * Get a 3x3 grid of geohash4 cells (center + 8 neighbors).\n * Used for landing bonus expansions in Fly mode.\n *\n * @param geohash4 - Center geohash4 cell\n * @returns Array of 9 geohash4 cells (center first, then neighbors)\n *\n * @example\n * getGeohash4Neighbors('c23n')\n * // => ['c23n', 'c23p', 'c23q', 'c23j', 'c23m', 'c23k', 'c23h', 'c23e', 'c23s']\n */\nexport function getGeohash4Neighbors(geohash4: string): string[] {\n  if (geohash4.length !== 4) return [];\n  const neighbors = getNeighbors(geohash4);\n  return [geohash4, ...neighbors];\n}\n\n/**\n * Get the prefix of a geohash at a given precision.\n * Simple helper for extracting geohash prefixes for directory organization.\n */\nexport function getGeohashPrefix(geohash: string, precision: number): string {\n  return geohash.slice(0, precision);\n}\n\n/**\n * Convert a geohash prefix to a hierarchical path.\n *\n * Examples:\n *   \"9mud\" -> \"9/m/u/d\"\n *   \"9q8y\" -> \"9/q/8/y\"\n *   \"c24k\" -> \"c/2/4/k\"\n *\n * This is used for organizing files in hierarchical directories to avoid\n * thousands of folders in a single directory, which causes filesystem\n * performance issues.\n */\nexport function geohashToHierarchicalPath(geohash4: string): string {\n  if (geohash4.length !== 4) return '';\n  const [c1, c2, c3, c4] = geohash4.split('');\n  return `${c1}/${c2}/${c3}/${c4}`;\n}\n\n/**\n * Compute all geohash cells along the great-circle path between two geohash cells.\n * Samples points along the spherical arc from `from` to `to`, encoding each to a\n * geohash at the given precision, and returns the deduplicated list of intermediate\n * cells (excluding `from` and `to`).\n *\n * Uses spherical linear interpolation (SLERP) via 3D unit vectors, which correctly\n * handles antimeridian crossings and polar paths — both of which flat lat/lng\n * interpolation gets wrong.\n */\nexport function getGeohashPath(from: string, to: string, precision = 4): string[] {\n  if (from === to) return [];\n\n  const fromCenter = decodeGeohash(from);\n  const toCenter = decodeGeohash(to);\n\n  // Use haversine for accurate great-circle distance (step sizing)\n  const distKm = haversineDistance(\n    { lat: fromCenter.lat, lng: fromCenter.lng },\n    { lat: toCenter.lat, lng: toCenter.lng },\n  );\n\n  // Step every ~15km to avoid skipping any geohash4 cell (~39x19km)\n  const steps = Math.max(2, Math.ceil(distKm / 15));\n\n  // Convert endpoints to unit Cartesian vectors for SLERP\n  const φ1 = (fromCenter.lat * Math.PI) / 180;\n  const λ1 = (fromCenter.lng * Math.PI) / 180;\n  const φ2 = (toCenter.lat * Math.PI) / 180;\n  const λ2 = (toCenter.lng * Math.PI) / 180;\n\n  const x1 = Math.cos(φ1) * Math.cos(λ1);\n  const y1 = Math.cos(φ1) * Math.sin(λ1);\n  const z1 = Math.sin(φ1);\n  const x2 = Math.cos(φ2) * Math.cos(λ2);\n  const y2 = Math.cos(φ2) * Math.sin(λ2);\n  const z2 = Math.sin(φ2);\n\n  // Central angle between the two points\n  const dot = Math.max(-1, Math.min(1, x1 * x2 + y1 * y2 + z1 * z2));\n  const d = Math.acos(dot);\n  // Near-antipodal fallback: sin(d)≈0 means the great circle is undefined.\n  // Extremely unlikely for geohash path use; fall back to linear lat/lng.\n  const useLinear = Math.abs(Math.sin(d)) < 1e-10;\n\n  const seen = new Set<string>();\n  seen.add(from);\n  seen.add(to);\n\n  const path: string[] = [];\n  for (let i = 1; i < steps; i++) {\n    const t = i / steps;\n    let lat: number;\n    let lng: number;\n    if (useLinear) {\n      lat = fromCenter.lat + t * (toCenter.lat - fromCenter.lat);\n      lng = fromCenter.lng + t * (toCenter.lng - fromCenter.lng);\n    } else {\n      const A = Math.sin((1 - t) * d) / Math.sin(d);\n      const B = Math.sin(t * d) / Math.sin(d);\n      const x = A * x1 + B * x2;\n      const y = A * y1 + B * y2;\n      const z = A * z1 + B * z2;\n      lat = (Math.atan2(z, Math.sqrt(x * x + y * y)) * 180) / Math.PI;\n      lng = (Math.atan2(y, x) * 180) / Math.PI;\n    }\n    const hash = encodeGeohash(lat, lng, precision);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      path.push(hash);\n    }\n  }\n\n  return path;\n}\n\n/**\n * Check if a geohash cell overlaps with a bounding box.\n * Custom implementation (not available in ngeohash).\n */\nexport function geohashOverlapsBounds(\n  hash: string,\n  bounds: { north: number; south: number; east: number; west: number },\n): boolean {\n  const { lat, lng, latErr, lngErr } = decodeGeohash(hash);\n\n  const hashNorth = lat + latErr;\n  const hashSouth = lat - latErr;\n  const hashEast = lng + lngErr;\n  const hashWest = lng - lngErr;\n\n  return !(\n    hashNorth < bounds.south ||\n    hashSouth > bounds.north ||\n    hashEast < bounds.west ||\n    hashWest > bounds.east\n  );\n}\n\n// Re-export for backwards compatibility with existing imports.\nexport { haversineDistance };\n"],"mappings":";AAgBO,SAAS,kBAAkB,MAAmB,IAAyB;AAC5E,QAAM,IAAI;AAEV,QAAM,OAAO,UAAU,GAAG,MAAM,KAAK,GAAG;AACxC,QAAM,OAAO,UAAU,GAAG,MAAM,KAAK,GAAG;AAExC,QAAM,IACJ,KAAK,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,OAAO,CAAC,IACtC,KAAK,IAAI,UAAU,KAAK,GAAG,CAAC,IAC1B,KAAK,IAAI,UAAU,GAAG,GAAG,CAAC,IAC1B,KAAK,IAAI,OAAO,CAAC,IACjB,KAAK,IAAI,OAAO,CAAC;AAErB,QAAM,IAAI,IAAI,KAAK,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC;AAEvD,SAAO,IAAI;AACb;AASO,SAAS,iBAAiB,MAAmB,IAAyB;AAC3E,QAAM,OAAO,UAAU,GAAG,MAAM,KAAK,GAAG;AACxC,QAAM,OAAO,UAAU,KAAK,GAAG;AAC/B,QAAM,OAAO,UAAU,GAAG,GAAG;AAE7B,QAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AACxC,QAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AAE3F,QAAM,UAAU,KAAK,MAAM,GAAG,CAAC;AAC/B,UAAS,UAAU,MAAO,KAAK,KAAK,OAAO;AAC7C;AAKA,SAAS,UAAU,SAAyB;AAC1C,SAAQ,UAAU,KAAK,KAAM;AAC/B;;;AC1CA,OAAO,cAAc;AAOd,SAAS,cAAc,KAAa,KAAa,YAAY,GAAW;AAC7E,SAAO,SAAS,OAAO,KAAK,KAAK,SAAS;AAC5C;AAMO,SAAS,cAAc,MAK5B;AACA,QAAM,SAAS,SAAS,OAAO,IAAI;AACnC,SAAO;AAAA,IACL,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AAAA,IACZ,QAAQ,OAAO,MAAM;AAAA,IACrB,QAAQ,OAAO,MAAM;AAAA,EACvB;AACF;AAOO,SAAS,aAAa,MAAwB;AACnD,SAAO,SAAS,UAAU,IAAI;AAChC;AAaO,SAAS,qBAAqB,UAA4B;AAC/D,MAAI,SAAS,WAAW,EAAG,QAAO,CAAC;AACnC,QAAM,YAAY,aAAa,QAAQ;AACvC,SAAO,CAAC,UAAU,GAAG,SAAS;AAChC;AAMO,SAAS,iBAAiB,SAAiB,WAA2B;AAC3E,SAAO,QAAQ,MAAM,GAAG,SAAS;AACnC;AAcO,SAAS,0BAA0B,UAA0B;AAClE,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAM,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,SAAS,MAAM,EAAE;AAC1C,SAAO,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AAChC;AAYO,SAAS,eAAe,MAAc,IAAY,YAAY,GAAa;AAChF,MAAI,SAAS,GAAI,QAAO,CAAC;AAEzB,QAAM,aAAa,cAAc,IAAI;AACrC,QAAM,WAAW,cAAc,EAAE;AAGjC,QAAM,SAAS;AAAA,IACb,EAAE,KAAK,WAAW,KAAK,KAAK,WAAW,IAAI;AAAA,IAC3C,EAAE,KAAK,SAAS,KAAK,KAAK,SAAS,IAAI;AAAA,EACzC;AAGA,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,SAAS,EAAE,CAAC;AAGhD,QAAM,UAAM,WAAW,MAAM,KAAK,KAAM;AACxC,QAAM,UAAM,WAAW,MAAM,KAAK,KAAM;AACxC,QAAM,UAAM,SAAS,MAAM,KAAK,KAAM;AACtC,QAAM,UAAM,SAAS,MAAM,KAAK,KAAM;AAEtC,QAAM,KAAK,KAAK,IAAI,OAAE,IAAI,KAAK,IAAI,OAAE;AACrC,QAAM,KAAK,KAAK,IAAI,OAAE,IAAI,KAAK,IAAI,OAAE;AACrC,QAAM,KAAK,KAAK,IAAI,OAAE;AACtB,QAAM,KAAK,KAAK,IAAI,OAAE,IAAI,KAAK,IAAI,OAAE;AACrC,QAAM,KAAK,KAAK,IAAI,OAAE,IAAI,KAAK,IAAI,OAAE;AACrC,QAAM,KAAK,KAAK,IAAI,OAAE;AAGtB,QAAM,MAAM,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE,CAAC;AACjE,QAAM,IAAI,KAAK,KAAK,GAAG;AAGvB,QAAM,YAAY,KAAK,IAAI,KAAK,IAAI,CAAC,CAAC,IAAI;AAE1C,QAAM,OAAO,oBAAI,IAAY;AAC7B,OAAK,IAAI,IAAI;AACb,OAAK,IAAI,EAAE;AAEX,QAAM,OAAiB,CAAC;AACxB,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,IAAI,IAAI;AACd,QAAI;AACJ,QAAI;AACJ,QAAI,WAAW;AACb,YAAM,WAAW,MAAM,KAAK,SAAS,MAAM,WAAW;AACtD,YAAM,WAAW,MAAM,KAAK,SAAS,MAAM,WAAW;AAAA,IACxD,OAAO;AACL,YAAM,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAC5C,YAAM,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AACtC,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAO,KAAK,MAAM,GAAG,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC,IAAI,MAAO,KAAK;AAC7D,YAAO,KAAK,MAAM,GAAG,CAAC,IAAI,MAAO,KAAK;AAAA,IACxC;AACA,UAAM,OAAO,cAAc,KAAK,KAAK,SAAS;AAC9C,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,WAAK,IAAI,IAAI;AACb,WAAK,KAAK,IAAI;AAAA,IAChB;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,sBACd,MACA,QACS;AACT,QAAM,EAAE,KAAK,KAAK,QAAQ,OAAO,IAAI,cAAc,IAAI;AAEvD,QAAM,YAAY,MAAM;AACxB,QAAM,YAAY,MAAM;AACxB,QAAM,WAAW,MAAM;AACvB,QAAM,WAAW,MAAM;AAEvB,SAAO,EACL,YAAY,OAAO,SACnB,YAAY,OAAO,SACnB,WAAW,OAAO,QAClB,WAAW,OAAO;AAEtB;","names":[]}