@rohal12/twee-ts 1.18.0 → 1.18.2

package/dist/paths-BuTAg2av.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths-BuTAg2av.js","names":["_exhaustive","_exhaustive","VERSION","parsePath","_exhaustive","isInside","_exhaustive","CharCodes","isTag","Text","Comment","CDATA","isTagRaw","CREATOR_NAME","CREATOR_NAME","_exhaustive","_exhaustive"],"sources":["../src/ifid.ts","../src/escape.ts","../src/passage.ts","../src/story.ts","../src/media-types.ts","../src/filesystem.ts","../src/relaxed-json.ts","../src/semver.ts","../src/source-text.ts","../src/util.ts","../src/formats.ts","../src/atomic-write.ts","../src/remote-formats.ts","../src/format-resolution.ts","../src/types.ts","../src/lexer.ts","../src/twee2-compat.ts","../src/parser.ts","../node_modules/.pnpm/entities@8.1.0/node_modules/entities/dist/decode-codepoint.js","../node_modules/.pnpm/entities@8.1.0/node_modules/entities/dist/internal/decode-shared.js","../node_modules/.pnpm/entities@8.1.0/node_modules/entities/dist/generated/decode-data-html.js","../node_modules/.pnpm/entities@8.1.0/node_modules/entities/dist/generated/decode-data-xml.js","../node_modules/.pnpm/entities@8.1.0/node_modules/entities/dist/internal/bin-trie-flags.js","../node_modules/.pnpm/entities@8.1.0/node_modules/entities/dist/decode.js","../node_modules/.pnpm/htmlparser2@12.0.0/node_modules/htmlparser2/dist/Tokenizer.js","../node_modules/.pnpm/htmlparser2@12.0.0/node_modules/htmlparser2/dist/Parser.js","../node_modules/.pnpm/domelementtype@3.0.0/node_modules/domelementtype/dist/index.js","../node_modules/.pnpm/domhandler@6.0.1/node_modules/domhandler/dist/node.js","../node_modules/.pnpm/domhandler@6.0.1/node_modules/domhandler/dist/index.js","../node_modules/.pnpm/htmlparser2@12.0.0/node_modules/htmlparser2/dist/index.js","../src/html-parser.ts","../src/loader.ts","../src/template.ts","../src/modules.ts","../src/version.ts","../src/output-twine2.ts","../src/output-twine1.ts","../src/output-twee.ts","../src/passage-omission.ts","../src/start-passage.ts","../src/compiler.ts","../src/plugins/diagnostics.ts","../src/plugins/paths.ts"],"sourcesContent":["/**\n * IFID (Interactive Fiction IDentifier) generation and validation.\n * Ported from ifid.go.\n */\nimport { randomUUID } from 'node:crypto';\nimport type { IFID } from './types.js';\n\n/** Generate a new IFID (UUID v4, uppercase). */\nexport function generateIFID(): IFID {\n  return randomUUID().toUpperCase() as IFID;\n}\n\n/**\n * Validate and brand an IFID string. Throws on invalid input.\n * Returns the IFID in its stored form (see `normalizeIFID`).\n */\nexport function createIFID(value: string): IFID {\n  const err = validateIFID(value);\n  if (err) throw new Error(`Invalid IFID: ${err}`);\n  return normalizeIFID(value);\n}\n\n/** Length of the `UUID://...//` wrapper around a 36-character UUID. */\nconst WRAPPED_LENGTH = 45;\n\n/**\n * Bring an IFID into the form the story model stores and every output writes: the uppercase\n * bare UUID. A valid `UUID://...//` wrapped IFID loses its wrapper; outputs that need the wrapper\n * (the Treaty of Babel comment) add exactly one. Twine 2 IFIDs use only capital letters, so the\n * value is uppercased, as Tweego does. An invalid value is only uppercased, so that validation\n * reports it as written.\n */\nexport function normalizeIFID(value: string): IFID {\n  const upper = value.toUpperCase();\n  const bare = upper.length === WRAPPED_LENGTH && validateIFID(upper) === null ? upper.slice(7, 43) : upper;\n  return bare as IFID;\n}\n\n/**\n * Validate an IFID string.\n * Accepts both bare UUIDs and UUID://...// wrapped format.\n * Returns null if valid, or an error message string.\n */\nexport function validateIFID(ifid: string): string | null {\n  let uuid = ifid;\n\n  switch (ifid.length) {\n    case 36:\n      break;\n    case 45: {\n      if (ifid.slice(0, 7).toUpperCase() !== 'UUID://' || ifid.slice(43) !== '//') {\n        return 'invalid IFID UUID://...// format';\n      }\n      uuid = ifid.slice(7, 43);\n      break;\n    }\n    default:\n      return `invalid IFID length: ${ifid.length}`;\n  }\n\n  for (let i = 0; i < uuid.length; i++) {\n    const ch = uuid[i]!;\n    switch (i) {\n      case 8:\n      case 13:\n      case 18:\n      case 23:\n        if (ch !== '-') {\n          return `invalid IFID character '${ch}' at position ${i + 1}`;\n        }\n        break;\n      case 14:\n        if (ch < '1' || ch > '5') {\n          return `invalid version '${ch}' at position ${i + 1}`;\n        }\n        break;\n      case 19:\n        if (!['8', '9', 'a', 'A', 'b', 'B'].includes(ch)) {\n          return `invalid variant '${ch}' at position ${i + 1}`;\n        }\n        break;\n      default:\n        if (!/^[0-9a-fA-F]$/.test(ch)) {\n          return `invalid IFID hex value '${ch}' at position ${i + 1}`;\n        }\n        break;\n    }\n  }\n\n  return null;\n}\n","/**\n * HTML, attribute, tiddler, and twee escaping/unescaping utilities.\n * Ported from escaping.go.\n */\n\n/** Escape the minimum characters required for HTML attribute values. */\nexport function attrEscape(s: string): string {\n  if (s.length === 0) return s;\n  return s.replace(/&/g, '&amp;').replace(/\"/g, '&quot;').replace(/'/g, '&#39;');\n}\n\n/** Escape for HTML attribute values including < and > (for spec-compliant output). */\nexport function fullAttrEscape(s: string): string {\n  if (s.length === 0) return s;\n  return s\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n    .replace(/'/g, '&#39;');\n}\n\n/** Escape the minimum characters required for general HTML content. */\nexport function htmlEscape(s: string): string {\n  if (s.length === 0) return s;\n  return s\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n    .replace(/'/g, '&#39;');\n}\n\n/** Escape for Twine 1 tiddler format. */\nexport function tiddlerEscape(s: string): string {\n  if (s.length === 0) return s;\n  return s\n    .replace(/\\\\/g, '\\\\s')\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n    .replace(/\\t/g, '\\\\t')\n    .replace(/\\n/g, '\\\\n');\n}\n\n/** Unescape from Twine 1 tiddler format. */\nexport function tiddlerUnescape(s: string): string {\n  if (s.length === 0) return s;\n  return s.replace(/\\\\n/g, '\\n').replace(/\\\\t/g, '\\t').replace(/\\\\s/g, '\\\\');\n}\n\n/** Escape characters that are special in Twee passage names/tags. */\nexport function tweeEscape(s: string): string {\n  if (s.length === 0) return s;\n  return s.replace(/[\\\\[\\]{}]/g, (ch) => '\\\\' + ch);\n}\n\nconst JS_STRING_ESCAPES: Readonly<Record<string, string>> = {\n  '\\\\': '\\\\\\\\',\n  '\"': '\\\\\"',\n  \"'\": \"\\\\'\",\n  '\\n': '\\\\n',\n  '\\r': '\\\\r',\n  '\\t': '\\\\t',\n  '<': '\\\\x3C',\n  '\\u2028': '\\\\u2028',\n  '\\u2029': '\\\\u2029',\n};\n\n/**\n * Escape a string for the inside of a single- or double-quoted JavaScript string literal, including one written\n * into an HTML `<script>` element. Besides backslashes, quotes and line breaks (with U+2028 and U+2029, which end\n * a string literal in JavaScript before ES2019), every `<` becomes `\\x3C`, so the literal holds no `</script`\n * that would end the element and no `<!--` or `<script` that would change where it ends. The string's value is\n * unchanged.\n */\nexport function jsStringEscape(s: string): string {\n  if (s.length === 0) return s;\n  return s.replace(/[\\\\\"'\\n\\r\\t<\\u2028\\u2029]/g, (ch) => JS_STRING_ESCAPES[ch] ?? ch);\n}\n\n/**\n * Escape a string for the inside of a double-quoted CSS string (such as a `font-family` name): `\\` and `\"` get\n * a backslash, and line breaks and other control characters become hex escapes followed by a space (`\\a ` for a\n * line feed), since a raw line break ends a CSS string and a backslash before one is a line continuation.\n */\nexport function cssStringEscape(s: string): string {\n  if (s.length === 0) return s;\n  return s.replace(/[\\\\\"\\u0000-\\u001f\\u007f]/g, (ch) =>\n    ch === '\\\\' || ch === '\"' ? `\\\\${ch}` : `\\\\${ch.charCodeAt(0).toString(16)} `,\n  );\n}\n\n/** Sanitize a string for safe inclusion in a CSS or JS block comment. */\nexport function commentSanitize(s: string): string {\n  return s.replace(/\\*\\//g, '* /');\n}\n\n/** Sanitize a string for safe inclusion in an HTML comment: break up `-->` and `--!>`, which both end one. */\nexport function htmlCommentSanitize(s: string): string {\n  return s.replace(/--(!?)>/g, '--$1 >');\n}\n\n/**\n * Escape JavaScript for the content of an HTML `<script>` element, so that the HTML parser reads all of it as\n * the element's text and ends the element at the end tag written after it.\n *\n * - Every `</script` (in any letter case) becomes `<\\/script`. HTML ends a script element at the first\n *   `</script` followed by whitespace, `/` or `>`, wherever it is in the JavaScript, even inside a string.\n * - Every `<!--` becomes `<\\!--`, but only if the text would otherwise end in the HTML tokenizer's \"script\n *   data double escaped\" state: after a `<!--` and then a `<script` start tag with no `-->` between them, the\n *   end tag after the text would not end the element.\n *\n * Inserting a backslash after `<` keeps the value of every string, template, and regular expression literal\n * and every comment where these sequences can be written (`\\/` and `\\!` are identity escapes; a backslash\n * already before the `<` escapes the `<`, as it did before); `<\\/script` is also how minifiers such as Terser\n * write inline scripts. It only changes code that uses them outside literals (`a </script/ b`, an HTML-like `<!--`\n * comment that is escaped because of a later `<script`), the raw text of a tagged template, and a `<!--` in a\n * regular expression with the `u` or `v` flag. The result is unchanged by escaping it again.\n */\nexport function scriptContentEscape(s: string): string {\n  const escaped = s.replace(/<(?=\\/script)/gi, '<\\\\');\n  return endsDoubleEscaped(escaped) ? escaped.replace(/<(?=!--)/g, '<\\\\') : escaped;\n}\n\n/**\n * Whether the HTML tokenizer, reading `s` as script element content with no `</script` in it, ends in the\n * \"script data double escaped\" state, where an end tag after `s` would not end the element.\n * See https://html.spec.whatwg.org/multipage/parsing.html#script-data-escaped-state.\n */\nfunction endsDoubleEscaped(s: string): boolean {\n  const scriptStartTag = /<script[\\t\\n\\f\\r />]/gi;\n  let pos = 0;\n  for (;;) {\n    // Script data: a `<!--` enters the escaped state.\n    const open = s.indexOf('<!--', pos);\n    if (open === -1) return false;\n    // Escaped: a `-->` leaves it (the dashes of `<!--` count, so `<!-->` leaves at once); a `<script` start\n    // tag enters the double escaped state.\n    const escapedFrom = open + 2;\n    const close = s.indexOf('-->', escapedFrom);\n    scriptStartTag.lastIndex = escapedFrom;\n    const start = scriptStartTag.exec(s);\n    if (start === null || (close !== -1 && close < start.index)) {\n      if (close === -1) return false;\n      pos = close + 3;\n      continue;\n    }\n    // Double escaped: only a `</script` (none are left) or a `-->` leaves it.\n    const end = s.indexOf('-->', start.index + start[0].length);\n    if (end === -1) return true;\n    pos = end + 3;\n  }\n}\n\n/**\n * Escape CSS for the content of an HTML `<style>` element: every `</style` (in any letter case) becomes\n * `<\\/style`, since HTML ends a style element at the first `</style` followed by whitespace, `/` or `>`.\n * `\\/` stands for `/` in CSS strings and URLs, and comments don't matter; `</style` anywhere else isn't valid\n * CSS anyway.\n */\nexport function styleContentEscape(s: string): string {\n  return s.replace(/<(?=\\/style)/gi, '<\\\\');\n}\n\n/** Apply ROT13 encoding to a string (only affects [A-Za-z]). */\nexport function rot13(s: string): string {\n  if (s.length === 0) return s;\n  return s.replace(/[A-Za-z]/g, (ch) => {\n    const base = ch <= 'Z' ? 65 : 97;\n    return String.fromCharCode(((ch.charCodeAt(0) - base + 13) % 26) + base);\n  });\n}\n\n/** Unescape backslash-escaped Twee characters. */\nexport function tweeUnescape(s: string): string {\n  if (s.length === 0) return s;\n  let result = '';\n  for (let i = 0; i < s.length; i++) {\n    if (s[i] === '\\\\') {\n      i++;\n      if (i >= s.length) {\n        result += '\\\\';\n        break;\n      }\n    }\n    result += s[i];\n  }\n  return result;\n}\n","/**\n * Passage helpers and output methods.\n * Ported from passage.go / passagedata.go.\n */\nimport type { Passage, ReadonlyPassage, PassageMetadata, OutputMode, WordCountMethod } from './types.js';\nimport { attrEscape, fullAttrEscape, htmlEscape, tiddlerEscape, tweeEscape, rot13 } from './escape.js';\n\n// Info passages contain structural data, metadata, and code rather than story content.\nconst INFO_PASSAGE_NAMES = new Set([\n  'StoryAuthor',\n  'StoryInit',\n  'StoryMenu',\n  'StorySubtitle',\n  'StoryTitle',\n  'PassageReady',\n  'PassageDone',\n  'PassageHeader',\n  'PassageFooter',\n  'StoryBanner',\n  'StoryCaption',\n  'MenuOptions',\n  'MenuShare',\n  'MenuStory',\n  'StoryInterface',\n  'StoryShare',\n  'StorySettings',\n  'StoryData',\n  'StoryIncludes',\n]);\n\nconst INFO_TAGS = ['annotation', 'script', 'stylesheet', 'widget'];\n\nexport function hasTag(p: ReadonlyPassage, tag: string): boolean {\n  return p.tags.includes(tag);\n}\n\nexport function hasAnyTag(p: ReadonlyPassage, ...tags: string[]): boolean {\n  return p.tags.some((t) => tags.includes(t));\n}\n\nexport function hasTagStartingWith(p: ReadonlyPassage, prefix: string): boolean {\n  return p.tags.some((t) => t.startsWith(prefix));\n}\n\nexport function hasInfoTags(p: ReadonlyPassage): boolean {\n  return hasAnyTag(p, ...INFO_TAGS) || hasTagStartingWith(p, 'Twine.');\n}\n\nexport function hasInfoName(p: ReadonlyPassage): boolean {\n  return INFO_PASSAGE_NAMES.has(p.name);\n}\n\nexport function isInfoPassage(p: ReadonlyPassage): boolean {\n  return hasInfoName(p) || hasInfoTags(p);\n}\n\nexport function isStoryPassage(p: ReadonlyPassage): boolean {\n  return !hasInfoName(p) && !hasInfoTags(p);\n}\n\nexport function hasMetadataPosition(p: ReadonlyPassage): boolean {\n  return p.metadata != null && p.metadata.position != null && p.metadata.position !== '';\n}\n\nexport function hasMetadataSize(p: ReadonlyPassage): boolean {\n  return p.metadata != null && p.metadata.size != null && p.metadata.size !== '';\n}\n\nexport function hasAnyMetadata(p: ReadonlyPassage): boolean {\n  if (!p.metadata) return false;\n  return Object.values(p.metadata).some((v) => v != null && v !== '');\n}\n\nexport function marshalMetadata(meta: PassageMetadata): string {\n  const obj: Record<string, string> = {};\n  for (const [key, value] of Object.entries(meta)) {\n    if (typeof value === 'string' && value) obj[key] = value;\n  }\n  return JSON.stringify(obj);\n}\n\nexport function unmarshalMetadata(json: string): PassageMetadata {\n  const raw: unknown = JSON.parse(json);\n  if (typeof raw !== 'object' || raw === null || Array.isArray(raw)) {\n    return {};\n  }\n  const parsed = raw as Record<string, unknown>;\n  const meta: PassageMetadata = {};\n  for (const [key, value] of Object.entries(parsed)) {\n    if (typeof value === 'string') meta[key] = value;\n  }\n  return meta;\n}\n\n/** Convert passage to Twee source. */\nexport function passageToTwee(p: ReadonlyPassage, outMode: OutputMode): string {\n  let output: string;\n  if (outMode === 'twee3') {\n    output = ':: ' + tweeEscape(p.name);\n    if (p.tags.length > 0) {\n      output += ' [' + tweeEscape(p.tags.join(' ')) + ']';\n    }\n    if (hasAnyMetadata(p) && p.metadata) {\n      output += ' ' + marshalMetadata(p.metadata);\n    }\n  } else {\n    output = ':: ' + p.name;\n    if (p.tags.length > 0) {\n      output += ' [' + p.tags.join(' ') + ']';\n    }\n  }\n  output += '\\n';\n  if (p.text.length > 0) {\n    output += p.text + '\\n';\n  }\n  output += '\\n\\n';\n  return output;\n}\n\n/** Generate `<tw-passagedata>` HTML for Twine 2. */\nexport function passageToPassagedata(\n  p: ReadonlyPassage,\n  pid: number,\n  options?: { readonly sourceInfo?: boolean },\n): string {\n  let position: string;\n  let size: string;\n\n  if (hasMetadataPosition(p)) {\n    position = p.metadata?.position ?? '';\n  } else {\n    const x = pid % 10;\n    const y = Math.floor(pid / 10);\n    const xp = x === 0 ? 10 : x;\n    const yp = x === 0 ? y : y + 1;\n    position = `${xp * 125 - 25},${yp * 125 - 25}`;\n  }\n\n  if (hasMetadataSize(p)) {\n    size = p.metadata?.size ?? '';\n  } else {\n    size = '100,100';\n  }\n\n  let attrs = `<tw-passagedata pid=\"${pid}\" name=${quote(fullAttrEscape(p.name))} tags=${quote(attrEscape(p.tags.join(' ')))} position=${quote(attrEscape(position))} size=${quote(attrEscape(size))}`;\n  if (options?.sourceInfo && p.source) {\n    attrs += ` data-source-file=${quote(attrEscape(p.source.file))} data-source-line=\"${p.source.line}\"`;\n  }\n  return `${attrs}>${htmlEscape(p.text)}</tw-passagedata>`;\n}\n\n/**\n * Whether Twine 1 `obfuscate:rot13` encodes a tiddler: every one but `StorySettings` and those tagged `Twine.image`\n * (Twine 1.4 `Tiddler.isObfuscateable()`). Its engine tests the stored name and tags, which these tiddlers keep\n * unencoded, so the decompiler tests them the same way.\n */\nexport function isObfuscatable(p: Pick<ReadonlyPassage, 'name' | 'tags'>): boolean {\n  return p.name !== 'StorySettings' && !p.tags.includes('Twine.image');\n}\n\n/**\n * Generate `<div tiddler>` HTML for Twine 1. With `obfuscateRot13`, an obfuscatable tiddler (see\n * `isObfuscatable()`) has its name, each tag and its text ROT13-encoded, as Twine 1.4 writes it\n * (`Tiddler.toHtml()`), and as its engine.js decodes it.\n */\nexport function passageToTiddler(p: ReadonlyPassage, pid: number, obfuscateRot13 = false): string {\n  let position: string;\n\n  if (hasMetadataPosition(p)) {\n    position = p.metadata?.position ?? '';\n  } else {\n    const x = pid % 10;\n    const y = Math.floor(pid / 10);\n    const xp = x === 0 ? 10 : x;\n    const yp = x === 0 ? y : y + 1;\n    position = `${xp * 140 - 130},${yp * 140 - 130}`;\n  }\n\n  const created = new Date().toISOString().replace(/[-:T]/g, '').slice(0, 12);\n  const encode = obfuscateRot13 && isObfuscatable(p) ? rot13 : (s: string) => s;\n  const name = attrEscape(encode(p.name));\n  const tags = attrEscape(p.tags.map(encode).join(' '));\n  return `<div tiddler=${quote(name)} tags=${quote(tags)} created=${quote(created)} modifier=${quote('twee')} twine-position=${quote(attrEscape(position))}>${tiddlerEscape(encode(p.text))}</div>`;\n}\n\n/**\n * Count words in a passage.\n *\n * - `'tweego'` (default): Strip newlines, strip comments, count NFKD-normalized characters, divide by 5.\n * - `'whitespace'`: Strip comments and markup, split on whitespace, count tokens.\n */\nexport function countWords(p: ReadonlyPassage, method: WordCountMethod = 'tweego'): number {\n  switch (method) {\n    case 'tweego': {\n      let text = p.text;\n      text = text.replace(/\\n/g, '');\n      text = text.replace(/(?:\\/%.+?%\\/|\\/\\*.+?\\*\\/|<!--.+?-->)/gs, '');\n      const normalized = text.normalize('NFKD');\n      const count = [...normalized].length;\n      if (count === 0) return 0;\n      const words = Math.floor(count / 5);\n      return count % 5 > 0 ? words + 1 : words;\n    }\n    case 'whitespace': {\n      let text = p.text;\n      // Strip comments\n      text = text.replace(/(?:\\/%.+?%\\/|\\/\\*.+?\\*\\/|<!--.+?-->)/gs, '');\n      // Strip Twine macros <<...>>\n      text = text.replace(/<<[^>]*>>/g, '');\n      // Strip Twine links [[...]] — keep display text\n      text = text.replace(/\\[\\[([^\\]|]*?)(?:\\|[^\\]]*?)?\\]\\]/g, '$1');\n      // Strip HTML tags\n      text = text.replace(/<[^>]+>/g, '');\n      const tokens = text.split(/\\s+/).filter((t) => t.length > 0);\n      return tokens.length;\n    }\n    default: {\n      const _exhaustive: never = method;\n      throw new Error(`Unhandled word count method: ${_exhaustive as string}`);\n    }\n  }\n}\n\n/**\n * Apply tag aliases: for each passage carrying an alias tag, add the canonical\n * tag if not already present. Returns new passage objects where tags changed;\n * unchanged passages are returned as-is. Idempotent — safe to call multiple times.\n */\nexport function applyTagAliases(passages: readonly Passage[], aliases: Record<string, string>): Passage[] {\n  const entries = Object.entries(aliases);\n  if (entries.length === 0) return [...passages];\n  return passages.map((p) => {\n    const original = p.tags;\n    const added: string[] = [];\n    for (const [alias, canonical] of entries) {\n      if (original.includes(alias) && !original.includes(canonical) && !added.includes(canonical)) {\n        added.push(canonical);\n      }\n    }\n    return added.length > 0 ? { ...p, tags: [...original, ...added] } : p;\n  });\n}\n\nfunction quote(s: string): string {\n  return `\"${s}\"`;\n}\n","/**\n * Story model + StoryData JSON marshal/unmarshal.\n * Ported from story.go + storydata.go.\n */\nimport type { Story, ReadonlyStory, Passage, Diagnostic, WordCountMethod, IFID } from './types.js';\nimport { normalizeIFID, validateIFID } from './ifid.js';\nimport { isStoryPassage, countWords } from './passage.js';\n\n// --- Passage name index ---\n\n/**\n * A story's passage positions by name, for O(1) lookups. `story.passages` is a plain mutable\n * array that code outside this module may change (StoryBuilder documents it), so the index\n * records what it was built from and is rebuilt when that no longer matches.\n */\ninterface NameIndex {\n  /** The array the index describes; assigning `story.passages` gives a different one. */\n  readonly passages: readonly Passage[];\n  /** The name at each position when the index was last updated. */\n  readonly names: string[];\n  /** Position by name; with duplicate names in the array, the last position. */\n  readonly positions: Map<string, number>;\n}\n\nconst passageIndex = new WeakMap<Story, NameIndex>();\n\nfunction buildIndex(story: Story): NameIndex {\n  const names = story.passages.map((p) => p.name);\n  const index: NameIndex = { passages: story.passages, names, positions: new Map(names.map((name, i) => [name, i])) };\n  passageIndex.set(story, index);\n  return index;\n}\n\n/**\n * The index, rebuilt if `story.passages` was reassigned or changed length. O(1); `position()`\n * also checks every hit. A change that keeps the length, such as replacing an element, can still\n * hide a passage from a lookup, so `storyVerifyIndex()` checks every position.\n */\nfunction currentIndex(story: Story): NameIndex {\n  const index = passageIndex.get(story);\n  return index !== undefined && index.passages === story.passages && index.names.length === story.passages.length\n    ? index\n    : buildIndex(story);\n}\n\n/**\n * Rebuild the index unless it matches `story.passages` at every position. O(n): for entry points\n * that run after code outside the compiler may have changed the passages, such as StoryBuilder.\n */\nfunction storyVerifyIndex(story: Story): void {\n  const index = currentIndex(story);\n  if (!story.passages.every((p, i) => p.name === index.names[i])) buildIndex(story);\n}\n\n/** The position of the passage named `name`, or -1. */\nfunction position(story: Story, name: string): number {\n  const i = currentIndex(story).positions.get(name);\n  if (i === undefined) return -1;\n  if (story.passages[i]?.name === name) return i;\n  return buildIndex(story).positions.get(name) ?? -1;\n}\n\n/** Add a passage whose name no passage has yet at the end. */\nfunction push(story: Story, p: Passage): void {\n  const index = currentIndex(story);\n  index.positions.set(p.name, story.passages.length);\n  index.names.push(p.name);\n  story.passages.push(p);\n}\n\n/** Put a passage at position `i`, in place of the passage there. */\nfunction replaceAt(story: Story, i: number, p: Passage): void {\n  const renamed = story.passages[i]?.name !== p.name;\n  story.passages[i] = p;\n  // Only moving a generated name aside renames a position; that is rare, so rebuild then.\n  if (renamed) buildIndex(story);\n}\n\n// --- Generated passage names ---\n\n/** Names of compiler special passages, which storyAdd() reads into the story model. */\nconst SPECIAL_PASSAGE_NAMES: ReadonlySet<string> = new Set([\n  'StoryData',\n  'StoryIncludes',\n  'StorySettings',\n  'StoryTitle',\n]);\n\n/**\n * Where a passage name that the compiler made up came from. Generated names yield to every other\n * name in the story: see `storyAdd()`.\n * - `code`: a stylesheet or script (a `.css`, `.js` or font file, or an imported Twine 2 story's\n *   stylesheet or script). Output finds these by tag, so a new name is not reported.\n * - `media`: an image, audio, video or text track file. Stories refer to these by passage name,\n *   so a new name is reported.\n */\nexport type GeneratedName =\n  | { readonly kind: 'code'; readonly base: string }\n  | { readonly kind: 'media'; readonly base: string; readonly file: string };\n\n/** Passages whose names were generated, kept by identity so that cached passages keep the mark. */\nconst generatedNames = new WeakMap<Passage, GeneratedName>();\n\n/**\n * Mark a passage's name as generated (from a file name, or for imported story code) and return\n * the passage. `origin.base` is the name that free names are numbered from: `base`, `base 2`, ….\n */\nexport function withGeneratedName(p: Passage, origin: GeneratedName): Passage {\n  generatedNames.set(p, origin);\n  return p;\n}\n\n/** The first of `base`, `base 2`, `base 3`, … that `isFree` accepts. */\nexport function freeName(base: string, isFree: (name: string) => boolean): string {\n  if (isFree(base)) return base;\n  for (let n = 2; ; n++) {\n    const candidate = `${base} ${n}`;\n    if (isFree(candidate)) return candidate;\n  }\n}\n\n/** Whether a generated name may take `name`: no passage has it and it is no special name. */\nfunction isFreeForGenerated(story: Story, name: string): boolean {\n  return !SPECIAL_PASSAGE_NAMES.has(name) && position(story, name) === -1;\n}\n\nfunction reportRename(origin: GeneratedName, from: string, to: string, diagnostics: Diagnostic[]): void {\n  switch (origin.kind) {\n    case 'code':\n      return;\n    case 'media': {\n      const reason = SPECIAL_PASSAGE_NAMES.has(from)\n        ? `\"${from}\" is a compiler special passage name`\n        : `another passage has the name \"${from}\"`;\n      diagnostics.push({\n        level: 'warning',\n        message: `Passage \"${from}\" from \"${origin.file}\" renamed to \"${to}\"; ${reason}.`,\n      });\n      return;\n    }\n    default: {\n      const _exhaustive: never = origin;\n      throw new Error(`unhandled generated name: ${JSON.stringify(_exhaustive)}`);\n    }\n  }\n}\n\n/** Add a passage with a generated name, under the first free name if its own is taken. */\nfunction addGenerated(story: Story, p: Passage, origin: GeneratedName, diagnostics: Diagnostic[]): void {\n  if (isFreeForGenerated(story, p.name)) {\n    push(story, p);\n    return;\n  }\n  const name = freeName(origin.base, (n) => isFreeForGenerated(story, n));\n  reportRename(origin, p.name, name, diagnostics);\n  push(story, withGeneratedName({ ...p, name }, origin));\n}\n\n/**\n * If a passage with a generated name has `name`, give it the first free name, in its place in the\n * passage list, so that a passage from the sources can take the name.\n */\nfunction moveGeneratedAside(story: Story, name: string, diagnostics: Diagnostic[]): void {\n  const i = position(story, name);\n  const existing = i === -1 ? undefined : story.passages[i];\n  const origin = existing === undefined ? undefined : generatedNames.get(existing);\n  if (existing === undefined || origin === undefined) return;\n  const free = freeName(origin.base, (n) => isFreeForGenerated(story, n));\n  reportRename(origin, name, free, diagnostics);\n  replaceAt(story, i, withGeneratedName({ ...existing, name: free }, origin));\n}\n\n// --- Story ---\n\nfunction defaultTwine2Metadata(): Story['twine2'] {\n  return {\n    format: '',\n    formatVersion: '',\n    options: new Map(),\n    start: '',\n    tags: '',\n    tagColors: new Map(),\n    zoom: 1,\n  };\n}\n\nexport function createStory(): Story {\n  const story: Story = {\n    name: '',\n    ifid: '' as IFID,\n    passages: [],\n    legacyIFID: '' as IFID,\n    twine1: { settings: new Map() },\n    twine2: defaultTwine2Metadata(),\n  };\n  buildIndex(story);\n  return story;\n}\n\nexport function storyHas(story: Story, name: string): boolean {\n  return position(story, name) !== -1;\n}\n\nexport function storyIndex(story: Story, name: string): number {\n  return position(story, name);\n}\n\nexport function storyGet(story: Story, name: string): Passage | undefined {\n  const i = position(story, name);\n  return i === -1 ? undefined : story.passages[i];\n}\n\nexport function storyAppend(story: Story, p: Passage, diagnostics: Diagnostic[]): void {\n  const i = position(story, p.name);\n  if (i === -1) {\n    push(story, p);\n  } else {\n    diagnostics.push({\n      level: 'warning',\n      message: `Replacing existing passage \"${p.name}\" with duplicate.`,\n    });\n    replaceAt(story, i, p);\n  }\n}\n\nexport function storyPrepend(story: Story, p: Passage, diagnostics: Diagnostic[]): void {\n  moveGeneratedAside(story, p.name, diagnostics);\n  const i = position(story, p.name);\n  if (i === -1) {\n    story.passages.unshift(p);\n    // Every position moves up by one.\n    buildIndex(story);\n  } else {\n    diagnostics.push({\n      level: 'warning',\n      message: `Replacing existing passage \"${p.name}\" with duplicate.`,\n    });\n    replaceAt(story, i, p);\n  }\n}\n\n// --- StoryData JSON ---\n\ninterface StoryDataJSON {\n  ifid?: string;\n  format?: string;\n  'format-version'?: string;\n  options?: string[];\n  start?: string;\n  tags?: string;\n  'tag-colors'?: Record<string, string>;\n  zoom?: number;\n}\n\nexport function marshalStoryData(story: ReadonlyStory): string {\n  const data: StoryDataJSON = {};\n  if (story.ifid) data.ifid = story.ifid;\n  if (story.twine2.format) data.format = story.twine2.format;\n  if (story.twine2.formatVersion) data['format-version'] = story.twine2.formatVersion;\n\n  const options: string[] = [];\n  for (const [opt, val] of story.twine2.options) {\n    if (val) options.push(opt);\n  }\n  if (options.length > 0) data.options = options;\n\n  if (story.twine2.start) data.start = story.twine2.start;\n  if (story.twine2.tags) data.tags = story.twine2.tags;\n\n  if (story.twine2.tagColors.size > 0) {\n    data['tag-colors'] = Object.fromEntries(story.twine2.tagColors);\n  }\n  if (story.twine2.zoom !== 1) data.zoom = story.twine2.zoom;\n\n  return JSON.stringify(data, null, '\\t');\n}\n\nexport function unmarshalStoryData(story: Story, json: string): string | null {\n  let raw: unknown;\n  try {\n    raw = JSON.parse(json) as unknown;\n  } catch (e) {\n    return `Cannot unmarshal \"StoryData\"; ${e instanceof Error ? e.message : String(e)}`;\n  }\n\n  if (typeof raw !== 'object' || raw === null || Array.isArray(raw)) {\n    return 'Cannot unmarshal \"StoryData\"; expected a JSON object';\n  }\n  const data = raw as StoryDataJSON;\n\n  // StoryData holds all of this metadata, so a field it leaves out gets its default, not the\n  // value of an earlier StoryData passage. The StorySettings IFID is kept apart (legacyIFID).\n  const twine2 = defaultTwine2Metadata();\n  story.ifid = typeof data.ifid === 'string' ? normalizeIFID(data.ifid) : ('' as IFID);\n  if (typeof data.format === 'string') twine2.format = data.format;\n  if (typeof data['format-version'] === 'string') twine2.formatVersion = data['format-version'];\n  if (Array.isArray(data.options)) {\n    for (const opt of data.options) {\n      if (typeof opt === 'string') twine2.options.set(opt, true);\n    }\n  }\n  if (typeof data.start === 'string') twine2.start = data.start;\n  if (typeof data.tags === 'string') twine2.tags = data.tags;\n  if (typeof data['tag-colors'] === 'object' && data['tag-colors'] !== null && !Array.isArray(data['tag-colors'])) {\n    for (const [tag, color] of Object.entries(data['tag-colors'])) {\n      if (typeof color === 'string') twine2.tagColors.set(tag, color);\n    }\n  }\n  if (typeof data.zoom === 'number' && data.zoom !== 0) twine2.zoom = data.zoom;\n  story.twine2 = twine2;\n\n  return null;\n}\n\n// --- StorySettings (legacy) ---\n\nexport function unmarshalStorySettings(story: Story, text: string, diagnostics: Diagnostic[]): void {\n  const obsolete: string[] = [];\n\n  for (const rawLine of text.split('\\n')) {\n    const line = rawLine.trim();\n    if (line.length === 0) continue;\n\n    const colonIdx = line.indexOf(':');\n    if (colonIdx === -1) {\n      diagnostics.push({\n        level: 'warning',\n        message: `Malformed \"StorySettings\" entry; skipping \"${line}\".`,\n      });\n      continue;\n    }\n\n    const key = line.slice(0, colonIdx).trim().toLowerCase();\n    const val = line\n      .slice(colonIdx + 1)\n      .trim()\n      .toLowerCase();\n\n    switch (key) {\n      case 'ifid': {\n        const err = validateIFID(val);\n        if (err === null) {\n          story.legacyIFID = normalizeIFID(val);\n        }\n        obsolete.push('\"ifid\"');\n        continue;\n      }\n      case 'zoom':\n        obsolete.push('\"zoom\"');\n        continue;\n    }\n\n    story.twine1.settings.set(key, val);\n  }\n\n  if (obsolete.length > 0) {\n    const entries = obsolete.length === 1 ? 'entry' : 'entries';\n    const pronoun = obsolete.length === 1 ? 'it' : 'them';\n    diagnostics.push({\n      level: 'warning',\n      message:\n        `Detected obsolete \"StorySettings\" ${entries}: ${obsolete.join(', ')}. ` +\n        `Please remove ${pronoun} from the \"StorySettings\" special passage.`,\n    });\n  }\n}\n\n/**\n * Process a passage and add it to the story, handling special passages.\n * Creates new passage objects where text is modified rather than mutating the input.\n *\n * A passage replaces an earlier one with the same name, except where either name was generated\n * (see `withGeneratedName()`): a generated name never replaces a passage and is never replaced.\n * A passage with a generated name takes the first free name of `base`, `base 2`, … when its own\n * is taken or is a compiler special name. A passage with a name from the sources that a generated\n * name holds takes it over, and the generated one moves to the first free name in its place.\n */\nexport function storyAdd(story: Story, p: Passage, diagnostics: Diagnostic[]): void {\n  const origin = generatedNames.get(p);\n  if (origin !== undefined) {\n    addGenerated(story, p, origin, diagnostics);\n    return;\n  }\n  moveGeneratedAside(story, p.name, diagnostics);\n\n  let processed = p;\n\n  switch (p.name) {\n    case 'StoryIncludes':\n      diagnostics.push({\n        level: 'warning',\n        message:\n          'Ignoring \"StoryIncludes\" compiler special passage; twee-ts allows you to specify project files and/or directories to recursively search.',\n      });\n      break;\n\n    case 'StoryData': {\n      const err = unmarshalStoryData(story, p.text);\n      if (err === null) {\n        // Validate the IFID if present.\n        if (story.ifid.length > 0) {\n          const vErr = validateIFID(story.ifid);\n          if (vErr !== null) {\n            diagnostics.push({\n              level: 'error',\n              message: `Cannot validate IFID; ${vErr}.`,\n            });\n          }\n        }\n        // Rebuild passage contents to normalize.\n        processed = { ...p, text: marshalStoryData(story) };\n      } else {\n        diagnostics.push({\n          level: 'warning',\n          message: `Cannot unmarshal \"StoryData\" compiler special passage; ${err}.`,\n        });\n      }\n      break;\n    }\n\n    case 'StorySettings':\n      unmarshalStorySettings(story, p.text, diagnostics);\n      break;\n\n    case 'StoryTitle': {\n      const trimmed = p.text.trim();\n      processed = { ...p, text: trimmed };\n      story.name = trimmed;\n      break;\n    }\n  }\n\n  storyAppend(story, processed, diagnostics);\n}\n\n/** Get story passage count and word count stats. */\nexport function getStoryStats(\n  story: Story,\n  wordCountMethod: WordCountMethod = 'tweego',\n): { passages: number; storyPassages: number; words: number } {\n  let storyPassages = 0;\n  let words = 0;\n  for (const p of story.passages) {\n    if (isStoryPassage(p)) {\n      storyPassages++;\n      words += countWords(p, wordCountMethod);\n    }\n  }\n  return { passages: story.passages.length, storyPassages, words };\n}\n\n/**\n * Builder that separates the mutable construction phase from the immutable consumption phase.\n * During construction, the internal `Story` is mutable via `add()` and direct access: you may\n * push, splice, sort, rename or reassign `story.passages` between calls, and `add()` and `has()`\n * see the passages as they are then.\n * After `build()`, the story is returned as `ReadonlyStory`.\n */\nexport class StoryBuilder {\n  /** The mutable story, accessible during construction for loader functions. */\n  readonly story: Story;\n\n  constructor() {\n    this.story = createStory();\n  }\n\n  /** Add a passage, handling special passages (StoryData, StoryTitle, etc.). */\n  add(passage: Passage, diagnostics: Diagnostic[]): void {\n    // A found name is checked at its position, so it is current. Only a new name (or a generated\n    // one, which looks up other names) needs every position checked first.\n    if (generatedNames.has(passage) || !storyHas(this.story, passage.name)) storyVerifyIndex(this.story);\n    storyAdd(this.story, passage, diagnostics);\n  }\n\n  /** Check if a passage name exists. */\n  has(name: string): boolean {\n    // A found name is checked at its position; only \"not found\" needs every position checked.\n    if (storyHas(this.story, name)) return true;\n    storyVerifyIndex(this.story);\n    return storyHas(this.story, name);\n  }\n\n  /** Finalize and return the story as read-only. */\n  build(): ReadonlyStory {\n    return this.story;\n  }\n}\n","/**\n * Extension → MIME type mapping.\n * Ported from util.go:mediaTypeFromExt().\n */\n\nimport { extname } from 'node:path';\n\nconst MEDIA_TYPE_MAP: Record<string, string> = {\n  // Audio\n  aac: 'audio/aac',\n  flac: 'audio/flac',\n  ogg: 'audio/ogg',\n  wav: 'audio/wav',\n  mp3: 'audio/mpeg',\n  m4a: 'audio/mp4',\n  oga: 'audio/ogg',\n  opus: 'audio/ogg',\n  wave: 'audio/wav',\n  weba: 'audio/webm',\n\n  // Fonts\n  otf: 'font/otf',\n  ttf: 'font/ttf',\n  woff: 'font/woff',\n  woff2: 'font/woff2',\n\n  // Images\n  gif: 'image/gif',\n  jpeg: 'image/jpeg',\n  jpg: 'image/jpeg',\n  png: 'image/png',\n  svg: 'image/svg+xml',\n  tif: 'image/tiff',\n  tiff: 'image/tiff',\n  webp: 'image/webp',\n\n  // Metadata\n  vtt: 'text/vtt',\n\n  // Video\n  mp4: 'video/mp4',\n  ogv: 'video/ogg',\n  webm: 'video/webm',\n};\n\nexport function mediaTypeFromExt(ext: string): string {\n  return MEDIA_TYPE_MAP[ext] ?? 'application/octet-stream';\n}\n\nexport function mediaTypeFromFilename(filename: string): string {\n  return mediaTypeFromExt(normalizedFileExt(filename));\n}\n\nexport function normalizedFileExt(filename: string): string {\n  const ext = extname(filename);\n  if (!ext) return '';\n  return ext.slice(1).toLowerCase();\n}\n\n/** Slugify a string for safe use as a DOM ID. */\nexport function slugify(original: string): string {\n  return original.replace(/[\\x00-\\x20!-/:-@[-^`{-\\x9f]+/g, '_');\n}\n\n/** Check if a file has a known type that should be processed. */\nexport function isKnownFileType(filename: string): boolean {\n  const ext = normalizedFileExt(filename);\n  return KNOWN_EXTENSIONS.has(ext);\n}\n\nconst KNOWN_EXTENSIONS = new Set([\n  'tw',\n  'twee',\n  'tw2',\n  'twee2',\n  'htm',\n  'html',\n  'css',\n  'js',\n  'otf',\n  'ttf',\n  'woff',\n  'woff2',\n  'gif',\n  'jpeg',\n  'jpg',\n  'png',\n  'svg',\n  'tif',\n  'tiff',\n  'webp',\n  'aac',\n  'flac',\n  'm4a',\n  'mp3',\n  'oga',\n  'ogg',\n  'opus',\n  'wav',\n  'wave',\n  'weba',\n  'mp4',\n  'ogv',\n  'webm',\n  'vtt',\n]);\n\n/** Font format hint for @font-face. */\nexport function fontFormatHint(ext: string): string {\n  switch (ext) {\n    case 'ttf':\n      return 'truetype';\n    case 'otf':\n      return 'opentype';\n    default:\n      return ext;\n  }\n}\n","/**\n * File system utilities: path walking, file type detection, watch mode.\n * Ported from filesystem.go.\n */\nimport {\n  accessSync,\n  constants as fsConstants,\n  lstatSync,\n  readdirSync,\n  realpathSync,\n  statSync,\n  watch as fsWatch,\n} from 'node:fs';\nimport type { FSWatcher, Stats } from 'node:fs';\nimport * as nodePath from 'node:path';\nimport { basename, dirname, resolve, relative, join, sep } from 'node:path';\nimport { isKnownFileType } from './media-types.js';\nimport type { Diagnostic } from './types.js';\n\n/**\n * Whether `filename` matches one of the `exclude` globs. The globs are matched\n * against the file's path relative to the working directory, the path\n * getFilenames reports; an absolute `filename` is made relative first. A leading\n * `./` in a glob is dropped. Matching is Node's `path.matchesGlob`.\n */\nexport function isExcluded(filename: string, exclude: readonly string[]): boolean {\n  if (exclude.length === 0) return false;\n  // Read from the namespace, not imported by name: path.matchesGlob arrived in\n  // Node 22.5, and a named import would stop this module loading on 22.0-22.4.\n  const { matchesGlob } = nodePath;\n  if (typeof matchesGlob !== 'function') {\n    throw new Error(`The exclude option needs Node.js 22.5 or newer (found ${process.version}).`);\n  }\n  const rel = relative(process.cwd(), resolve(filename)) || filename;\n  return exclude.some((pattern) => matchesGlob(rel, pattern.replace(/^\\.\\//, '')));\n}\n\n/**\n * The paths a build writes. Source discovery never reads them back as sources,\n * and the watchers don't rebuild for them.\n */\nexport interface BuildOutputs {\n  /**\n   * Files the build writes: the story, and for a bundler also its chunks, its\n   * assets and the public files it copies.\n   */\n  readonly files: readonly string[];\n  /**\n   * Folders the build writes into, which hold nothing but its output. One found\n   * while walking a source folder is skipped whole, files from earlier builds\n   * included (old hashed chunks, say). A folder named as a source, or one that\n   * holds a source folder, is still walked, and only `files` are left out of it.\n   */\n  readonly dirs: readonly string[];\n}\n\n/** A build that writes nothing: `compile()`, or output to stdout. */\nexport const NO_BUILD_OUTPUTS: BuildOutputs = { files: [], dirs: [] };\n\n/** The outputs of a build that writes the one file `outFile`, or none without it. */\nexport function toBuildOutputs(outputs: BuildOutputs | string | undefined): BuildOutputs {\n  if (outputs === undefined) return NO_BUILD_OUTPUTS;\n  return typeof outputs === 'string' ? { files: [outputs], dirs: [] } : outputs;\n}\n\n/**\n * The path outputs are compared by: absolute, with every symbolic link in it\n * resolved, so two paths that reach the same file through different links (a\n * symlinked project folder, an alias of the output folder) compare equal. A\n * path that doesn't exist yet, such as the output before the first build, is\n * its nearest existing folder's real path joined with the rest.\n */\nexport function realPathOf(path: string): string {\n  const abs = resolve(path);\n  try {\n    return realpathSync.native(abs);\n  } catch {\n    // Missing or unreadable: resolve the folder it would be in instead.\n  }\n  const parent = dirname(abs);\n  return parent === abs ? abs : join(realPathOf(parent), basename(abs));\n}\n\n/** Whether the path `inner` is `outer` or inside it. */\nfunction isSameOrInside(inner: string, outer: string): boolean {\n  return inner === outer || inner.startsWith(outer.endsWith(sep) ? outer : outer + sep);\n}\n\n/** A build's outputs as real paths (see realPathOf), with the checks discovery and the watchers make. */\nexport interface OutputPaths {\n  /** Whether the real path `real` is a file the build writes. */\n  isFile(real: string): boolean;\n  /** Whether the real path `real` is a folder the build owns (see BuildOutputs.dirs). */\n  isDir(real: string): boolean;\n  /** Whether the folder at the real path `real` is an owned folder or holds an output, at any depth. */\n  holds(real: string): boolean;\n  /**\n   * Whether source discovery, walking the folders `roots`, leaves the path out\n   * as output: an output file, or a path it only reaches through an owned folder.\n   */\n  isOutput(path: string, roots: readonly string[]): boolean;\n}\n\nexport function outputPaths(outputs: BuildOutputs): OutputPaths {\n  const files = new Set(outputs.files.map(realPathOf));\n  const dirs = new Set(outputs.dirs.map(realPathOf));\n  const all = [...files, ...dirs];\n  return {\n    isFile: (real) => files.has(real),\n    isDir: (real) => dirs.has(real),\n    holds: (real) => dirs.has(real) || all.some((output) => output !== real && isSameOrInside(output, real)),\n    isOutput(path, roots) {\n      const real = realPathOf(path);\n      if (files.has(real)) return true;\n      const owners = [...dirs].filter((dir) => isSameOrInside(real, dir));\n      if (owners.length === 0) return false;\n      // A root walks into the path unless an owned folder below the root holds it.\n      const reaching = roots.map(realPathOf).filter((root) => isSameOrInside(real, root));\n      return reaching.every((root) => owners.some((dir) => dir !== root && isSameOrInside(dir, root)));\n    },\n  };\n}\n\n/**\n * A folder entry as source discovery walks it, found at `pathname` with the real\n * path `real` when it is no link: a link to a file counts as that file, and a\n * link to anything else (a folder above all) as nothing, undefined. Throws when\n * the entry or a link's target can't be read.\n */\nexport function walkedEntry(\n  pathname: string,\n  real: string,\n): { readonly stat: Stats; readonly real: string } | undefined {\n  const stat = lstatSync(pathname);\n  if (!stat.isSymbolicLink()) return { stat, real };\n  const target = statSync(pathname);\n  return target.isFile() ? { stat: target, real: realPathOf(pathname) } : undefined;\n}\n\nexport interface FilenamesResult {\n  readonly filenames: string[];\n  /** One warning per path that could not be read. */\n  readonly diagnostics: Diagnostic[];\n  /**\n   * The paths given that are themselves an output file. A build reading one would\n   * overwrite its own source; the compiler refuses it, as Tweego does.\n   */\n  readonly outputSources: string[];\n}\n\n/**\n * Recursively walk directories, collecting regular file paths.\n *\n * Leaves out what the build writes (`outputs`, compared by real path, see\n * realPathOf) so its last output is never read back, and the files that match an\n * `exclude` glob (see isExcluded). A path given that is itself an output file is\n * not walked but listed in `outputSources`.\n *\n * Symbolic links: a path given is followed wherever it leads. Inside a folder, a\n * link to a file is read, but a link to a folder is not followed, as Tweego's walk\n * doesn't follow one. A link back to its own folder or a parent would otherwise\n * walk the same files again at every depth.\n *\n * Like Tweego, a path that cannot be read is reported as a warning and skipped.\n */\nexport function getFilenames(\n  pathnames: readonly string[],\n  outputs?: BuildOutputs | string,\n  exclude: readonly string[] = [],\n): FilenamesResult {\n  const filenames: string[] = [];\n  const diagnostics: Diagnostic[] = [];\n  const outputSources: string[] = [];\n  const output = outputPaths(toBuildOutputs(outputs));\n\n  function warn(pathname: string, e: unknown): void {\n    diagnostics.push({ level: 'warning', message: `path ${pathname}: ${e instanceof Error ? e.message : String(e)}` });\n  }\n\n  function addFile(pathname: string): void {\n    const abs = resolve(pathname);\n    const rel = relative(process.cwd(), abs);\n    if (isExcluded(rel || abs, exclude)) return;\n    filenames.push(rel || abs);\n  }\n\n  // A folder's entries. `real` is the folder's real path; an entry that is no link\n  // has the real path `real/entry`, so no entry needs resolving.\n  function walkDir(pathname: string, real: string): void {\n    let entries;\n    try {\n      entries = readdirSync(pathname);\n    } catch (e) {\n      warn(pathname, e);\n      return;\n    }\n    for (const entry of entries) walkEntry(join(pathname, entry), join(real, entry));\n  }\n\n  function walkEntry(pathname: string, real: string): void {\n    let entry;\n    try {\n      entry = walkedEntry(pathname, real);\n    } catch (e) {\n      warn(pathname, e);\n      return;\n    }\n    if (entry === undefined) return;\n    if (entry.stat.isFile()) {\n      if (!output.isFile(entry.real)) addFile(pathname);\n    } else if (entry.stat.isDirectory() && !output.isDir(entry.real)) {\n      walkDir(pathname, entry.real);\n    }\n  }\n\n  for (const pathname of pathnames) {\n    let stat;\n    try {\n      stat = statSync(pathname);\n    } catch (e) {\n      warn(pathname, e);\n      continue;\n    }\n    const real = realPathOf(pathname);\n    if (stat.isFile()) {\n      if (output.isFile(real)) outputSources.push(pathname);\n      else addFile(pathname);\n    } else if (stat.isDirectory()) {\n      walkDir(pathname, real);\n    }\n  }\n\n  return { filenames, diagnostics, outputSources };\n}\n\nexport interface WatchHandle {\n  close(): void;\n}\n\n/**\n * A watched path that can't be watched: fs.watch failed on it, or on the folder it is\n * watched through. watchFilesystem passes it to its `onError` and keeps watching the rest.\n */\nexport class WatchPathError extends Error {\n  constructor(\n    readonly path: string,\n    cause: unknown,\n  ) {\n    super(`Cannot watch ${path}: ${cause instanceof Error ? cause.message : String(cause)}`);\n    this.name = 'WatchPathError';\n  }\n}\n\n/** What a stat finds at a path: a folder (with its identity) or something else. */\ntype PathKind =\n  { readonly kind: 'dir'; readonly id: string } | { readonly kind: 'file' } | { readonly kind: 'missing' };\n\nfunction pathKind(path: string): PathKind {\n  try {\n    const stats = statSync(path);\n    return stats.isDirectory() ? { kind: 'dir', id: `${stats.dev}:${stats.ino}` } : { kind: 'file' };\n  } catch {\n    // Missing, or unreadable: either way, wait for it to change.\n    return { kind: 'missing' };\n  }\n}\n\n/**\n * Where a watched path stands, and so which folders its watches must be on. A watch follows the\n * folder it was started on, not its path, so the watches are set up again whenever this changes.\n */\ninterface RootState {\n  /**\n   * The folder the path is watched through, which sees it created, deleted or replaced: its\n   * parent folder, or while that is missing, the nearest folder above it that exists.\n   */\n  readonly anchor: { readonly path: string; readonly id: string } | undefined;\n  /** The path itself: a folder is watched recursively; a file is watched through `anchor`. */\n  readonly self: PathKind;\n}\n\nfunction rootState(abs: string): RootState {\n  return { anchor: nearestFolderAbove(abs), self: pathKind(abs) };\n}\n\nfunction nearestFolderAbove(abs: string): RootState['anchor'] {\n  for (let dir = dirname(abs), below = abs; dir !== below; below = dir, dir = dirname(dir)) {\n    const kind = pathKind(dir);\n    if (kind.kind === 'dir') return { path: dir, id: kind.id };\n  }\n  return undefined;\n}\n\n/** Whether two states need the same watches: the same anchor folder, and the same watched folder if any. */\nfunction sameWatches(a: RootState, b: RootState): boolean {\n  const selfId = (s: RootState): string | undefined => (s.self.kind === 'dir' ? s.self.id : undefined);\n  return a.anchor?.path === b.anchor?.path && a.anchor?.id === b.anchor?.id && selfId(a) === selfId(b);\n}\n\n/** One watched path (a source, module or head file), as given and as an absolute path. */\ninterface Root {\n  readonly path: string;\n  readonly abs: string;\n  state: RootState;\n  watchers: FSWatcher[];\n  /** A watch could not be started, or broke: it is tried again on the next event in its anchor folder. */\n  failed: boolean;\n  /** The last failure reported, so that one that persists is reported once. */\n  lastReport: string | undefined;\n}\n\n/**\n * Watch paths for changes, calling the build callback on known file type changes.\n * A folder is watched recursively; a file is watched on its own and counts\n * whatever its type (a head file, say). A change to a file `ignore` returns true\n * for (given the path relative to the working directory) schedules no build.\n * Uses debouncing to avoid rapid rebuilds.\n *\n * A watched path that doesn't exist yet is waited for, and one that is deleted, or renamed\n * away and replaced, is followed to the new folder or file at its path: each path is also\n * watched through the folder above it. When that sets up a path's watches again, the next\n * build is a full one (`changedFiles` undefined), since changes made in between went unseen.\n * A path that can't be watched is passed to `onError` as a WatchPathError, once while the\n * failure persists; the other paths are still watched.\n */\nexport function watchFilesystem(\n  pathnames: string[],\n  outFilename: string,\n  callback: (changedFiles?: ReadonlySet<string>) => void,\n  ignore: (filename: string) => boolean = () => false,\n  onError: (error: WatchPathError) => void = () => {},\n): WatchHandle {\n  const output = outputPaths(toBuildOutputs(outFilename));\n  let buildTimer: ReturnType<typeof setTimeout> | null = null;\n  const BUILD_DEBOUNCE = 500;\n  const pendingFiles = new Set<string>();\n  let pendingFullBuild = false;\n  let closed = false;\n\n  // `changedFile` undefined: a full build, which wins over the changed files pending with it.\n  function scheduleBuild(changedFile?: string): void {\n    if (changedFile === undefined) pendingFullBuild = true;\n    else pendingFiles.add(changedFile);\n    if (buildTimer) clearTimeout(buildTimer);\n    buildTimer = setTimeout(() => {\n      buildTimer = null;\n      const files = pendingFullBuild || pendingFiles.size === 0 ? undefined : new Set(pendingFiles);\n      pendingFiles.clear();\n      pendingFullBuild = false;\n      callback(files);\n    }, BUILD_DEBOUNCE);\n  }\n\n  const roots: Root[] = pathnames.map((path) => {\n    const abs = resolve(path);\n    return { path, abs, state: rootState(abs), watchers: [], failed: false, lastReport: undefined };\n  });\n\n  // A watched path that is a file counts whatever its type.\n  const isNamedFile = (abs: string): boolean => roots.some((r) => r.abs === abs && r.state.self.kind === 'file');\n\n  // A changed file, as an absolute path. `named`: it is one of the watched paths\n  // itself, so it counts whatever its type. Reported relative to the working\n  // directory, the form getFilenames gives and the incremental cache is keyed by.\n  function fileChanged(abs: string, named: boolean): void {\n    if (!named && !isKnownFileType(abs)) return;\n    // Compared by real path: the output may be reached through a link.\n    if (output.isFile(realPathOf(abs))) return;\n    const rel = relative(process.cwd(), abs);\n    if (!ignore(rel || abs)) scheduleBuild(rel || abs);\n  }\n\n  function report(root: Root, cause: unknown): void {\n    const error = new WatchPathError(root.path, cause);\n    if (error.message === root.lastReport) return;\n    root.lastReport = error.message;\n    onError(error);\n  }\n\n  function startWatch(root: Root, path: string, recursive: boolean, listener: (filename: string) => void): void {\n    try {\n      // A recursive watch on a folder it can't read starts without an error on Linux, and\n      // then never reports anything: check first.\n      if (recursive) accessSync(path, fsConstants.R_OK | fsConstants.X_OK);\n      const watcher = fsWatch(path, { recursive }, (_event, filename) => {\n        if (!closed) listener(filename ?? '');\n      });\n      watcher.on('error', (e) => {\n        watcher.close();\n        root.watchers = root.watchers.filter((w) => w !== watcher);\n        root.failed = true;\n        if (!closed && !recheck(root, false)) report(root, e);\n      });\n      root.watchers.push(watcher);\n    } catch (e) {\n      root.failed = true;\n      report(root, e);\n    }\n  }\n\n  // Starts the watches `root.state` calls for, closing any earlier ones.\n  function arm(root: Root): void {\n    for (const w of root.watchers) w.close();\n    root.watchers = [];\n    root.failed = false;\n    const { anchor, self } = root.state;\n    if (anchor) {\n      startWatch(root, anchor.path, false, (filename) => {\n        // A file is watched through its folder, not on its own: the OS reports only the file's\n        // name for a watch on the file, and an editor that saves by replacing the file would\n        // leave such a watch on the old one.\n        const before = root.state.self.kind;\n        recheck(root, true);\n        const isFile = before === 'file' || isNamedFile(root.abs);\n        if (isFile && filename !== '' && resolve(anchor.path, filename) === root.abs) fileChanged(root.abs, true);\n      });\n    }\n    if (self.kind === 'dir') {\n      startWatch(root, root.path, true, (filename) => {\n        // No name: an event on the folder itself, such as its deletion.\n        if (filename === '') recheck(root, true);\n        else {\n          const abs = resolve(root.abs, filename);\n          fileChanged(abs, isNamedFile(abs));\n        }\n      });\n    }\n    if (!root.failed) root.lastReport = undefined;\n  }\n\n  /**\n   * Sets up `root`'s watches again when its path, or the folder above it, is no longer the\n   * one they were started on (or, with `retry`, when one of them failed), and then schedules a\n   * full build. Returns whether its state changed.\n   */\n  function recheck(root: Root, retry: boolean): boolean {\n    const before = root.state;\n    const after = rootState(root.abs);\n    const changed = !sameWatches(before, after);\n    const wasFailed = root.failed;\n    if (!changed && !(retry && wasFailed)) {\n      root.state = after;\n      return false;\n    }\n    root.state = after;\n    arm(root);\n    const recovered = wasFailed && !root.failed;\n    if ((changed || recovered) && (before.self.kind !== 'missing' || after.self.kind !== 'missing')) scheduleBuild();\n    return changed;\n  }\n\n  for (const root of roots) arm(root);\n\n  // Build once initially (no changedFiles = full build).\n  callback();\n\n  return {\n    close() {\n      closed = true;\n      if (buildTimer) clearTimeout(buildTimer);\n      for (const root of roots) for (const w of root.watchers) w.close();\n    },\n  };\n}\n","/**\n * A parser for the object literal a Twine 2 `format.js` passes to `window.storyFormat()`.\n *\n * The story formats spec does not require that object to be strict JSON, and Twine 2 runs\n * `format.js` as JavaScript. This parser accepts JSON plus the JavaScript literal syntax formats\n * use in practice: single-quoted strings, unquoted (identifier) and numeric keys, trailing commas,\n * comments, JavaScript string escapes, and hexadecimal, octal and binary numbers.\n *\n * It reads string literals token by token, so their contents come back exactly as JavaScript\n * evaluation gives them: text that only looks like structure (`a, }`, `word:`, an apostrophe) is\n * never touched. Anything outside that subset, such as a function or a variable, is a syntax error.\n */\n\nconst IDENTIFIER = /[A-Za-z_$][\\w$]*/y;\nconst NUMBER = /[+-]?(?:0[xX][0-9a-fA-F]+|0[oO][0-7]+|0[bB][01]+|(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:[eE][+-]?\\d+)?)/y;\nconst IDENTIFIER_PART = /[\\w$]/;\nconst WHITESPACE = /[\\s]/;\nconst HEX = /^[0-9a-fA-F]+$/;\n\n/** Simple single-character escapes and the characters they stand for. */\nconst SIMPLE_ESCAPES: Readonly<Record<string, string>> = {\n  b: '\\b',\n  f: '\\f',\n  n: '\\n',\n  r: '\\r',\n  t: '\\t',\n  v: '\\v',\n};\n\n/**\n * Parse a JavaScript object, array or primitive literal: all of `text`, or the part from `start` to\n * `end`. Error positions count from the start of `text`, so they point into the file it came from.\n *\n * @throws SyntaxError naming the line and column of the first thing it cannot parse.\n */\nexport function parseRelaxedJSON(text: string, start = 0, end = text.length): unknown {\n  let pos = start;\n\n  function fail(message: string, at = pos): never {\n    const before = text.slice(0, at);\n    const line = before.split('\\n').length;\n    const column = at - before.lastIndexOf('\\n');\n    throw new SyntaxError(`${message} at line ${line}, column ${column}`);\n  }\n\n  /** The character at `pos`, or '' at the end of the input. */\n  const peek = (): string => (pos < end ? (text[pos] ?? '') : '');\n\n  const describeChar = (at: number): string => (at >= end ? 'end of input' : JSON.stringify(text[at]));\n\n  /** Skip whitespace and comments. */\n  const skipTrivia = (): void => {\n    while (pos < end) {\n      const ch = peek();\n      if (WHITESPACE.test(ch)) {\n        pos++;\n      } else if (text.startsWith('//', pos)) {\n        const lineEnd = text.slice(pos, end).search(/[\\n\\r\\u2028\\u2029]/);\n        pos = lineEnd === -1 ? end : pos + lineEnd;\n      } else if (text.startsWith('/*', pos)) {\n        const commentEnd = text.indexOf('*/', pos + 2);\n        if (commentEnd === -1 || commentEnd + 2 > end) fail('Unterminated comment');\n        pos = commentEnd + 2;\n      } else {\n        return;\n      }\n    }\n  };\n\n  const consume = (ch: string): void => {\n    skipTrivia();\n    if (peek() !== ch) fail(`Expected ${JSON.stringify(ch)} but found ${describeChar(pos)}`);\n    pos++;\n  };\n\n  /** Read exactly `count` hex digits and return their value. */\n  const readHex = (count: number): number => {\n    const digits = text.slice(pos, Math.min(pos + count, end));\n    if (digits.length !== count || !HEX.test(digits)) fail('Invalid hexadecimal escape sequence');\n    pos += count;\n    return parseInt(digits, 16);\n  };\n\n  /** Decode the escape sequence after a backslash; `pos` is just past the backslash. */\n  const readEscape = (): string => {\n    const ch = peek();\n    const simple = SIMPLE_ESCAPES[ch];\n    if (simple !== undefined) {\n      pos++;\n      return simple;\n    }\n    switch (ch) {\n      case '':\n        return fail('Unterminated string');\n      case 'x':\n        pos++;\n        return String.fromCharCode(readHex(2));\n      case 'u': {\n        pos++;\n        if (peek() !== '{') return String.fromCharCode(readHex(4));\n        const close = text.indexOf('}', pos);\n        if (close === -1 || close >= end) fail('Invalid Unicode escape sequence');\n        pos++;\n        const codePoint = readHex(close - pos);\n        if (codePoint > 0x10ffff) fail('Undefined Unicode code-point');\n        pos = close + 1;\n        return String.fromCodePoint(codePoint);\n      }\n      case '\\r':\n        // A line continuation: the escaped line break is dropped.\n        pos += text[pos + 1] === '\\n' ? 2 : 1;\n        return '';\n      case '\\n':\n      case '\\u2028':\n      case '\\u2029':\n        pos++;\n        return '';\n      case '0':\n        if (/[0-9]/.test(text[pos + 1] ?? '')) fail('Octal escape sequences are not supported');\n        pos++;\n        return '\\0';\n      default:\n        if (/[1-9]/.test(ch)) fail('Octal escape sequences are not supported');\n        // Any other escaped character stands for itself (\\' \\\" \\\\ \\/ …).\n        pos++;\n        return ch;\n    }\n  };\n\n  const readString = (): string => {\n    const quote = peek();\n    pos++;\n    let out = '';\n    let chunkStart = pos;\n    for (;;) {\n      if (pos >= end) fail('Unterminated string');\n      const ch = peek();\n      if (ch === quote) {\n        out += text.slice(chunkStart, pos);\n        pos++;\n        return out;\n      }\n      if (ch === '\\n' || ch === '\\r') fail('Unterminated string');\n      if (ch === '\\\\') {\n        out += text.slice(chunkStart, pos);\n        pos++;\n        out += readEscape();\n        chunkStart = pos;\n      } else {\n        pos++;\n      }\n    }\n  };\n\n  /** Read a match of a sticky regular expression at `pos`, or return undefined. */\n  const readToken = (pattern: RegExp): string | undefined => {\n    pattern.lastIndex = pos;\n    const m = pattern.exec(text);\n    if (!m || pattern.lastIndex > end) return undefined;\n    pos = pattern.lastIndex;\n    return m[0];\n  };\n\n  const readNumber = (): number | undefined => {\n    const tokenStart = pos;\n    const token = readToken(NUMBER);\n    if (token === undefined) return undefined;\n    if (IDENTIFIER_PART.test(peek())) fail('Invalid number', tokenStart);\n    const sign = token.startsWith('-') ? -1 : 1;\n    return sign * Number(/^[+-]/.test(token) ? token.slice(1) : token);\n  };\n\n  const readKey = (): string => {\n    skipTrivia();\n    const ch = peek();\n    if (ch === '\"' || ch === \"'\") return readString();\n    const identifier = readToken(IDENTIFIER);\n    if (identifier !== undefined) return identifier;\n    const number = readNumber();\n    if (number !== undefined) return String(number);\n    return fail(`Expected a property name but found ${describeChar(pos)}`);\n  };\n\n  const readObject = (): Record<string, unknown> => {\n    pos++; // {\n    // Properties are defined, not assigned, so a \"__proto__\" key stays an ordinary property.\n    const out: Record<string, unknown> = {};\n    for (;;) {\n      skipTrivia();\n      if (peek() === '}') {\n        pos++;\n        return out;\n      }\n      const key = readKey();\n      consume(':');\n      Object.defineProperty(out, key, { value: readValue(), enumerable: true, writable: true, configurable: true });\n      skipTrivia();\n      if (peek() === ',') pos++;\n      else if (peek() !== '}') fail(`Expected \",\" or \"}\" but found ${describeChar(pos)}`);\n    }\n  };\n\n  const readArray = (): unknown[] => {\n    pos++; // [\n    const out: unknown[] = [];\n    for (;;) {\n      skipTrivia();\n      if (peek() === ']') {\n        pos++;\n        return out;\n      }\n      out.push(readValue());\n      skipTrivia();\n      if (peek() === ',') pos++;\n      else if (peek() !== ']') fail(`Expected \",\" or \"]\" but found ${describeChar(pos)}`);\n    }\n  };\n\n  function readValue(): unknown {\n    skipTrivia();\n    const ch = peek();\n    if (ch === '{') return readObject();\n    if (ch === '[') return readArray();\n    if (ch === '\"' || ch === \"'\") return readString();\n    const tokenStart = pos;\n    const identifier = readToken(IDENTIFIER);\n    if (identifier !== undefined) {\n      if (identifier === 'true') return true;\n      if (identifier === 'false') return false;\n      if (identifier === 'null') return null;\n      return fail(`Unexpected identifier ${JSON.stringify(identifier)}`, tokenStart);\n    }\n    const number = readNumber();\n    if (number !== undefined) return number;\n    return fail(`Unexpected ${describeChar(pos)}`);\n  }\n\n  const value = readValue();\n  skipTrivia();\n  if (pos < end) fail(`Unexpected ${describeChar(pos)} after the value`);\n  return value;\n}\n","/**\n * SemVer parsing and precedence, shared by every story format lookup (local folders, the download\n * cache and remote indices).\n *\n * Parsing follows Tweego's `semver.NewVersion` (Masterminds/semver): a leading `v` is allowed, and\n * `x` or `x.y` stand for `x.0.0` and `x.y.0`. Comparison follows SemVer 2.0.0 §11: a prerelease\n * ranks below its release, prerelease identifiers compare field by field, and build metadata is\n * ignored.\n */\nimport type { SemVer } from './types.js';\n\nconst IDENTIFIERS = String.raw`[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*`;\nconst VERSION = new RegExp(String.raw`^[vV]?(\\d+)(?:\\.(\\d+))?(?:\\.(\\d+))?(?:-(${IDENTIFIERS}))?(?:\\+${IDENTIFIERS})?$`);\nconst NUMERIC = /^\\d+$/;\n\n/** Parse a version string, or return null when it is not a version. */\nexport function parseVersion(text: string): SemVer | null {\n  const m = VERSION.exec(text);\n  if (!m) return null;\n  return {\n    major: Number(m[1]),\n    minor: Number(m[2] ?? 0),\n    patch: Number(m[3] ?? 0),\n    prerelease: m[4] === undefined ? [] : m[4].split('.'),\n  };\n}\n\n/** Compare two prerelease identifiers: numeric ones numerically and below alphanumeric ones, which compare as ASCII. */\nfunction compareIdentifiers(a: string, b: string): number {\n  const aNumeric = NUMERIC.test(a);\n  const bNumeric = NUMERIC.test(b);\n  if (aNumeric && bNumeric) return Math.sign(Number(a) - Number(b));\n  if (aNumeric !== bNumeric) return aNumeric ? -1 : 1;\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\n/** Compare prerelease identifier lists. An empty list (a release) ranks above any prerelease. */\nfunction comparePrerelease(a: readonly string[], b: readonly string[]): number {\n  if (a.length === 0 || b.length === 0) return Math.sign(b.length - a.length);\n  const shared = Math.min(a.length, b.length);\n  for (let i = 0; i < shared; i++) {\n    const order = compareIdentifiers(a[i] ?? '', b[i] ?? '');\n    if (order !== 0) return order;\n  }\n  return Math.sign(a.length - b.length);\n}\n\n/** Compare two versions by SemVer precedence: negative when `a` ranks lower, 0 when equal, positive when higher. */\nexport function compareVersions(a: SemVer, b: SemVer): number {\n  return (\n    Math.sign(a.major - b.major) ||\n    Math.sign(a.minor - b.minor) ||\n    Math.sign(a.patch - b.patch) ||\n    comparePrerelease(a.prerelease, b.prerelease)\n  );\n}\n\n/** Whether two version strings name the same version (prerelease included, build metadata ignored). */\nexport function sameVersion(a: string, b: string): boolean {\n  const left = parseVersion(a);\n  const right = parseVersion(b);\n  return left !== null && right !== null && compareVersions(left, right) === 0;\n}\n","/**\n * Source text normalization shared by every input path (files, in-memory sources, `parseTwee`).\n */\n\n/**\n * Strip a leading UTF-8 byte order mark and convert CRLF and bare CR line endings to LF.\n * Idempotent, so text that is already normalized passes through unchanged.\n */\nexport function normalizeSourceText(text: string): string {\n  const withoutBOM = text.charCodeAt(0) === 0xfeff ? text.slice(1) : text;\n  return withoutBOM.replace(/\\r\\n?/g, '\\n');\n}\n\n/** Byte order marks at the start of a line, directly before a passage header's `::`. */\nconst BOMS_BEFORE_HEADER = /(?<=^|\\n)\\uFEFF+(?=::)/g;\n\n/**\n * Normalize Twee source text: {@link normalizeSourceText}, and also remove byte order marks at the start of\n * a line that are directly followed by `::`. Concatenating files (`cat a.tw b.tw`) leaves the BOM of every\n * later file in front of its first passage header, which would otherwise not be recognised as a header.\n * A U+FEFF anywhere else is passage text and kept. Idempotent.\n */\nexport function normalizeTweeSourceText(text: string): string {\n  return normalizeSourceText(text).replace(BOMS_BEFORE_HEADER, '');\n}\n","/**\n * Shared file I/O utilities.\n */\nimport { readFileSync } from 'node:fs';\nimport { parse as parsePath } from 'node:path';\nimport type { Diagnostic } from './types.js';\nimport { normalizeSourceText } from './source-text.js';\n\n/** Text decoded from bytes, with the warning when the bytes were not valid UTF-8. */\nexport interface DecodedText {\n  readonly text: string;\n  readonly diagnostics: readonly Diagnostic[];\n}\n\n/** The charset assumed for text that is not valid UTF-8, as Tweego assumes it. */\nconst FALLBACK_CHARSET = 'windows-1252';\n\n/**\n * Throws on invalid UTF-8 instead of replacing bytes with U+FFFD. `ignoreBOM` keeps a leading BOM in the\n * text, as `readFileSync(file, 'utf-8')` did, so {@link normalizeSourceText} strips exactly one.\n */\nconst utf8Decoder = new TextDecoder('utf-8', { fatal: true, ignoreBOM: true });\n\n/**\n * The code points of the Windows-1252 bytes 0x80 to 0x9F, from the WHATWG Encoding Standard. The five bytes\n * Windows-1252 leaves undefined map to the C1 control with the same number, as the standard and Go's charmap\n * do. Every other byte is the code point with the same number.\n *\n * Decoded by hand, because Node's `TextDecoder('windows-1252')` decodes as ISO-8859-1 in some releases\n * (Node 22.18 turns 0x80 into U+0080 instead of €), and builds without ICU lack it.\n */\nconst WINDOWS_1252_C1 = [\n  0x20ac, 0x81, 0x201a, 0x192, 0x201e, 0x2026, 0x2020, 0x2021, 0x2c6, 0x2030, 0x160, 0x2039, 0x152, 0x8d, 0x17d, 0x8f,\n  0x90, 0x2018, 0x2019, 0x201c, 0x201d, 0x2022, 0x2013, 0x2014, 0x2dc, 0x2122, 0x161, 0x203a, 0x153, 0x9d, 0x17e, 0x178,\n] as const;\n\nfunction decodeWindows1252(bytes: Uint8Array): string {\n  const chunks: string[] = [];\n  // Chunked, so String.fromCharCode never gets more arguments than the engine allows.\n  for (let start = 0; start < bytes.length; start += 0x2000) {\n    const codes = Array.from(bytes.subarray(start, start + 0x2000), (b) =>\n      b >= 0x80 && b <= 0x9f ? (WINDOWS_1252_C1[b - 0x80] ?? b) : b,\n    );\n    chunks.push(String.fromCharCode(...codes));\n  }\n  return chunks.join('');\n}\n\n/**\n * Decode bytes read from `filename` as UTF-8. Bytes that are not valid UTF-8 are decoded as Windows-1252\n * instead, with a warning naming the file, as Tweego does (`fileReadAllWithEncoding` in io.go), so a legacy\n * file keeps its non-ASCII characters instead of losing them to U+FFFD.\n *\n * The text is returned as decoded: a leading BOM and CR line endings are kept (see {@link normalizeSourceText}).\n */\nexport function decodeText(bytes: Uint8Array, filename: string): DecodedText {\n  try {\n    return { text: utf8Decoder.decode(bytes), diagnostics: [] };\n  } catch {\n    return {\n      text: decodeWindows1252(bytes),\n      diagnostics: [\n        {\n          level: 'warning',\n          message: `read ${filename}: Invalid UTF-8; assuming charset is ${FALLBACK_CHARSET}.`,\n          file: filename,\n        },\n      ],\n    };\n  }\n}\n\n/**\n * Read a text file: decode it with {@link decodeText} (UTF-8, or Windows-1252 when it is not valid UTF-8),\n * strip a leading BOM and convert CRLF and bare CR line endings to LF. This is the one path every file read\n * as text goes through: sources, modules, the head file, story formats and the config file.\n *\n * @param diagnostics Receives the warning when the file is not valid UTF-8. Without it, the file is decoded\n *   the same way and the warning is dropped.\n * @throws When the file cannot be read.\n */\nexport function readUTF8(filename: string, diagnostics?: Diagnostic[]): string {\n  const decoded = decodeText(readFileSync(filename), filename);\n  diagnostics?.push(...decoded.diagnostics);\n  return normalizeSourceText(decoded.text);\n}\n\n/** Read a file as base64. */\nexport function readBase64(filename: string): string {\n  return readFileSync(filename).toString('base64');\n}\n\n/** Get the filename without extension, a dotfile keeps its whole name. */\nexport function baseNameWithoutExt(filename: string): string {\n  return parsePath(filename).name;\n}\n","/**\n * Story format discovery, loading, and SemVer matching.\n * Ported from formats.go + config.go.\n *\n * Every lookup (local folders here, the download cache and remote indices in remote-formats.ts)\n * goes through the same version parsing ({@link parseVersion}) and the same matching rules\n * ({@link selectFormatCandidate}).\n */\nimport { readdirSync, statSync } from 'node:fs';\nimport { dirname, join } from 'node:path';\nimport { homedir } from 'node:os';\nimport type {\n  Diagnostic,\n  FormatDecodeResult,\n  FormatRequest,\n  SemVer,\n  StoryFormatInfo,\n  Twine2FormatJSON,\n} from './types.js';\nimport { parseRelaxedJSON } from './relaxed-json.js';\nimport { compareVersions, parseVersion } from './semver.js';\nimport { readUTF8 } from './util.js';\n\n/** A `\"setup\": function` property, which Harlowe appends to its otherwise-JSON format object. */\nconst SETUP_FUNCTION_PROPERTY = /,\\s*\"setup\"\\s*:\\s*function\\b/g;\n\n/** Drop a trailing `\"setup\": function(){…}` property from a format object, if it has one. */\nfunction stripSetupFunction(chunk: string): string | undefined {\n  let lastIndex = -1;\n  for (const match of chunk.matchAll(SETUP_FUNCTION_PROPERTY)) lastIndex = match.index;\n  return lastIndex === -1 ? undefined : chunk.slice(0, lastIndex) + '}';\n}\n\n/** Index after the whitespace and `//` or block comments starting at `i`. */\nfunction skipTrivia(text: string, i: number): number {\n  let pos = i;\n  for (;;) {\n    const ch = text[pos];\n    if (ch !== undefined && /\\s/.test(ch)) {\n      pos++;\n    } else if (text.startsWith('//', pos)) {\n      const newline = text.indexOf('\\n', pos);\n      pos = newline === -1 ? text.length : newline + 1;\n    } else if (text.startsWith('/*', pos)) {\n      const close = text.indexOf('*/', pos + 2);\n      pos = close === -1 ? text.length : close + 2;\n    } else {\n      return pos;\n    }\n  }\n}\n\n/** Index after the quoted string starting at `i` (a quote character); template literals nest `${…}`. */\nfunction skipString(text: string, i: number): number {\n  const quote = text[i];\n  let pos = i + 1;\n  while (pos < text.length) {\n    const ch = text[pos];\n    if (ch === '\\\\') {\n      pos += 2;\n    } else if (ch === quote) {\n      return pos + 1;\n    } else if (quote === '`' && ch === '$' && text[pos + 1] === '{') {\n      const close = findClosingBrace(text, pos + 1);\n      if (close === -1) return text.length;\n      pos = close + 1;\n    } else {\n      pos++;\n    }\n  }\n  return text.length;\n}\n\nfunction startsComment(text: string, pos: number): boolean {\n  return text[pos] === '/' && (text[pos + 1] === '/' || text[pos + 1] === '*');\n}\n\nfunction startsString(text: string, pos: number): boolean {\n  const ch = text[pos];\n  return ch === '\"' || ch === \"'\" || ch === '`';\n}\n\n/** Index of the `}` matching the `{` at `open`, skipping comments and strings; -1 when unbalanced. */\nfunction findClosingBrace(text: string, open: number): number {\n  let depth = 0;\n  let pos = open;\n  while (pos < text.length) {\n    if (startsComment(text, pos)) {\n      pos = skipTrivia(text, pos);\n    } else if (startsString(text, pos)) {\n      pos = skipString(text, pos);\n    } else {\n      if (text[pos] === '{') depth++;\n      else if (text[pos] === '}' && --depth === 0) return pos;\n      pos++;\n    }\n  }\n  return -1;\n}\n\nconst STORY_FORMAT = 'storyFormat';\nconst IDENTIFIER_CHAR = /[\\w$]/;\n\n/**\n * Locate the object literal passed to `storyFormat(` as `[start, end)` offsets, ignoring comments and\n * strings outside it and never evaluating anything. Without such a call, the first `{` outside comments\n * and strings starts the object. When its closing brace cannot be matched (a Harlowe setup function can\n * hold regular expression literals), the last `}` of the file ends it.\n */\nfunction locateFormatObject(text: string): { readonly start: number; readonly end: number } | undefined {\n  let start = -1;\n  let firstBrace = -1;\n  let pos = 0;\n  while (pos < text.length && start === -1) {\n    if (startsComment(text, pos)) {\n      pos = skipTrivia(text, pos);\n    } else if (startsString(text, pos)) {\n      pos = skipString(text, pos);\n    } else if (text[pos] === '{') {\n      if (firstBrace === -1) firstBrace = pos;\n      pos++;\n    } else if (text.startsWith(STORY_FORMAT, pos) && !IDENTIFIER_CHAR.test(text[pos - 1] ?? '')) {\n      const paren = skipTrivia(text, pos + STORY_FORMAT.length);\n      const brace = text[paren] === '(' ? skipTrivia(text, paren + 1) : -1;\n      if (text[brace] === '{') start = brace;\n      pos += STORY_FORMAT.length;\n    } else {\n      pos++;\n    }\n  }\n  if (start === -1) start = firstBrace;\n  if (start === -1) return undefined;\n  const close = findClosingBrace(text, start);\n  const end = close === -1 ? text.lastIndexOf('}') : close;\n  return end < start ? undefined : { start, end: end + 1 };\n}\n\ntype ObjectParse = { readonly ok: true; readonly value: unknown } | { readonly ok: false; readonly error: string };\n\n/**\n * Parse the format object at `start`–`end` of `text`: strict JSON first (fast), then the\n * JavaScript literal subset formats use. Error positions point into `text`.\n */\nfunction parseFormatObject(text: string, start: number, end: number): ObjectParse {\n  try {\n    return { ok: true, value: JSON.parse(text.slice(start, end)) };\n  } catch {\n    // Not strict JSON; the spec does not require it to be.\n  }\n  try {\n    return { ok: true, value: parseRelaxedJSON(text, start, end) };\n  } catch (e) {\n    return { ok: false, error: e instanceof Error ? e.message : String(e) };\n  }\n}\n\n/** Check a parsed format object's fields. Per spec, `name` is optional; `version` and `source` are required. */\n/** The name given to a format.js that names no format. */\nexport const UNNAMED_FORMAT_NAME = 'Untitled Story Format';\n\nfunction toFormatJSON(raw: unknown): FormatDecodeResult {\n  if (typeof raw !== 'object' || raw === null || Array.isArray(raw)) {\n    return { ok: false, reason: 'Story format JSON chunk is not an object.' };\n  }\n  const obj = raw as Record<string, unknown>;\n  if (typeof obj.version !== 'string') return { ok: false, reason: 'Story format has no \"version\" string.' };\n  if (typeof obj.source !== 'string') return { ok: false, reason: 'Story format has no \"source\" string.' };\n  if (!parseVersion(obj.version)) {\n    return { ok: false, reason: `Story format version ${JSON.stringify(obj.version)} is not a SemVer version.` };\n  }\n  const data: Twine2FormatJSON = {\n    name: typeof obj.name === 'string' ? obj.name : UNNAMED_FORMAT_NAME,\n    version: obj.version,\n    source: obj.source,\n    proofing: obj.proofing === true,\n  };\n  if (typeof obj.author === 'string') data.author = obj.author;\n  if (typeof obj.description === 'string') data.description = obj.description;\n  if (typeof obj.image === 'string') data.image = obj.image;\n  if (typeof obj.url === 'string') data.url = obj.url;\n  if (typeof obj.license === 'string') data.license = obj.license;\n  return { ok: true, data };\n}\n\n/**\n * Read the metadata of a Twine 2 format.js, or say why it cannot be used.\n *\n * The object passed to `window.storyFormat()` may be strict JSON or a JavaScript object literal\n * (single quotes, unquoted keys, trailing commas, comments). String values come back exactly as\n * JavaScript evaluation gives them. Harlowe's function-valued `setup` property is dropped; the\n * workaround keys on the property itself, so the same bytes parse whether they come from a\n * `harlowe-3` directory or a direct download.\n */\nexport function decodeFormatJSON(source: string): FormatDecodeResult {\n  const located = locateFormatObject(source);\n  if (located === undefined) {\n    return { ok: false, reason: 'Could not find Twine 2 style story format JSON chunk.' };\n  }\n\n  const parsed = parseFormatObject(source, located.start, located.end);\n  if (parsed.ok) return toFormatJSON(parsed.value);\n\n  // Harlowe workaround: strip the \"setup\" function property.\n  const stripped = stripSetupFunction(source.slice(located.start, located.end));\n  const retried = stripped === undefined ? undefined : parseFormatObject(stripped, 0, stripped.length);\n  if (retried?.ok) return toFormatJSON(retried.value);\n  return { ok: false, reason: `Could not decode story format JSON chunk: ${parsed.error}` };\n}\n\n/**\n * Parse the Twine 2 format.js JSON chunk; null when it cannot be used ({@link decodeFormatJSON}\n * gives the reason).\n *\n * @param _formatId No longer used; kept so existing callers keep compiling.\n */\nexport function parseFormatJSON(source: string, _formatId?: string): Twine2FormatJSON | null {\n  const result = decodeFormatJSON(source);\n  return result.ok ? result.data : null;\n}\n\n/** A directory's entries in a stable order, or none when it cannot be read. */\nfunction listDirectory(dir: string): string[] {\n  try {\n    return readdirSync(dir).sort();\n  } catch {\n    return [];\n  }\n}\n\nfunction isDirectory(path: string): boolean {\n  try {\n    return statSync(path).isDirectory();\n  } catch {\n    return false;\n  }\n}\n\nfunction isFile(path: string): boolean {\n  try {\n    return statSync(path).isFile();\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Load the format in one folder: its format.js (Twine 2), else its header.html (Twine 1).\n * A format.js that cannot be used is reported as a warning, as Tweego does.\n */\nfunction loadFormatDir(\n  searchDir: string,\n  id: string,\n  diagnostics: Diagnostic[] | undefined,\n): StoryFormatInfo | undefined {\n  const formatDir = join(searchDir, id);\n  if (!isDirectory(formatDir)) return undefined;\n\n  for (const baseFilename of ['format.js', 'header.html']) {\n    const filename = join(formatDir, baseFilename);\n    if (!isFile(filename)) continue;\n\n    if (baseFilename === 'header.html') {\n      // Twine 1 format: the folder name is its name.\n      return { id, filename, isTwine2: false, name: id, version: '', proofing: false };\n    }\n\n    // An encoding warning explains a skipped format; for a usable one, readFormatSource() reports it when used.\n    const encoding: Diagnostic[] = [];\n    let decoded: FormatDecodeResult;\n    try {\n      decoded = decodeFormatJSON(readUTF8(filename, encoding));\n    } catch (e) {\n      decoded = { ok: false, reason: `Could not read ${filename}: ${e instanceof Error ? e.message : String(e)}` };\n    }\n    if (!decoded.ok) {\n      diagnostics?.push(...encoding);\n      diagnostics?.push({\n        level: 'warning',\n        message: `format ${id}: Skipping format; ${decoded.reason} (${filename})`,\n      });\n      continue;\n    }\n    const { data } = decoded;\n    const format: StoryFormatInfo = {\n      id,\n      filename,\n      isTwine2: true,\n      name: data.name,\n      version: data.version,\n      proofing: data.proofing ?? false,\n    };\n    if (data.author) format.author = data.author;\n    if (data.description) format.description = data.description;\n    if (data.image) format.image = data.image;\n    if (data.url) format.url = data.url;\n    if (data.license) format.license = data.license;\n    return format;\n  }\n  return undefined;\n}\n\n/**\n * Discover every story format in the search directories, keyed by folder name (the format ID),\n * without version pruning.\n *\n * Directories are searched in order, and a later directory outranks an earlier one: when two hold\n * the same folder name, the later one's format is kept. The map iterates in that order too, lowest\n * rank first. Formats that cannot be used are left out, with a warning in `diagnostics`.\n */\nexport function discoverAllFormats(\n  searchDirs: readonly string[],\n  diagnostics?: Diagnostic[],\n): Map<string, StoryFormatInfo> {\n  const formats = new Map<string, StoryFormatInfo>();\n  for (const searchDir of searchDirs) {\n    for (const entry of listDirectory(searchDir)) {\n      const format = loadFormatDir(searchDir, entry, diagnostics);\n      if (!format) continue;\n      // Re-insert, so the map's order follows the directories' rank.\n      formats.delete(entry);\n      formats.set(entry, format);\n    }\n  }\n  return formats;\n}\n\n/** The version a format is pruned and selected by, or null for one outside SemVer pruning. */\nfunction prunableVersion(format: StoryFormatInfo): SemVer | null {\n  return format.isTwine2 && format.name ? parseVersion(format.version) : null;\n}\n\n/** The search directory a discovered format was found in. */\nfunction searchDirOf(format: StoryFormatInfo): string {\n  return dirname(dirname(format.filename));\n}\n\n/**\n * Prune formats by SemVer: within each (name, major) group, keep only the version with the highest\n * precedence (a release outranks its prereleases). Between equal versions, the folder in the\n * higher-ranked search directory wins, and within one directory the first folder name in sort\n * order. Returns a new map in the same order.\n *\n * Pruning serves name-based selection and listings. An explicit format ID is looked up in the\n * unpruned map, so a pinned folder is used even when another folder holds a newer version.\n */\nexport function pruneFormats(formats: ReadonlyMap<string, StoryFormatInfo>): Map<string, StoryFormatInfo> {\n  // Search directories first appear in the map in rank order (see discoverAllFormats).\n  const dirRank = new Map<string, number>();\n  for (const format of formats.values()) {\n    const dir = searchDirOf(format);\n    if (!dirRank.has(dir)) dirRank.set(dir, dirRank.size);\n  }\n  const rankOf = (format: StoryFormatInfo): number => dirRank.get(searchDirOf(format)) ?? 0;\n\n  const best = new Map<string, { readonly format: StoryFormatInfo; readonly version: SemVer }>();\n  for (const format of formats.values()) {\n    const version = prunableVersion(format);\n    if (!version) continue;\n    const group = `${format.name}@${version.major}`;\n    const current = best.get(group);\n    const order = current ? compareVersions(version, current.version) : 1;\n    if (order > 0 || (order === 0 && current && rankOf(format) > rankOf(current.format))) {\n      best.set(group, { format, version });\n    }\n  }\n  return new Map(\n    [...formats].filter(([id, format]) => {\n      const version = prunableVersion(format);\n      return version === null || best.get(`${format.name}@${version.major}`)?.format.id === id;\n    }),\n  );\n}\n\n/**\n * Discover all story formats in the given search directories, pruned by SemVer: within each\n * (name, major) group only the highest version survives. See {@link discoverAllFormats} for the\n * directory ranking and {@link pruneFormats} for pruning.\n */\nexport function discoverFormats(searchDirs: readonly string[]): Map<string, StoryFormatInfo> {\n  return pruneFormats(discoverAllFormats(searchDirs));\n}\n\n/**\n * Get the format search directories, lowest rank first: the story format subdirectories of the\n * home directory, then of the working directory, then each `TWEEGO_PATH` entry, then `extraPaths`\n * (`formatPaths`). A later directory outranks an earlier one for the same format folder name, so\n * `formatPaths` override `TWEEGO_PATH`, which overrides the home and working directories, as in\n * Tweego.\n */\nexport function getFormatSearchDirs(extraPaths: readonly string[] = [], useTweegoPath = true): string[] {\n  const subdirNames = ['storyformats', '.storyformats', 'story-formats', 'storyFormats', 'targets'];\n  const basePaths = new Set<string>();\n\n  // Home directory\n  try {\n    basePaths.add(homedir());\n  } catch {\n    // ignore\n  }\n\n  // Working directory\n  basePaths.add(process.cwd());\n\n  const dirs = [...basePaths].flatMap((base) => subdirNames.map((sub) => join(base, sub))).filter(isDirectory);\n\n  // TWEEGO_PATH environment variable\n  const tweegoPath = useTweegoPath ? process.env.TWEEGO_PATH : undefined;\n  if (tweegoPath) dirs.push(...tweegoPath.split(process.platform === 'win32' ? ';' : ':'));\n\n  // Extra user-provided paths outrank everything else.\n  dirs.push(...extraPaths);\n\n  return dirs;\n}\n\n/**\n * Parse a version string into [major, minor, patch]. Accepts what {@link parseVersion} accepts\n * (`v1.2.3`, `1.2`, `2.0.0-beta.1`); the prerelease and build metadata are dropped.\n */\nexport function parseSemver(v: string): [number, number, number] | null {\n  const parsed = parseVersion(v);\n  return parsed ? [parsed.major, parsed.minor, parsed.patch] : null;\n}\n\n/** Compare [major, minor, patch] tuples. Use {@link compareVersions} to take prereleases into account. */\nexport function semverCompare(a: [number, number, number], b: [number, number, number]): number {\n  const [aMajor, aMinor, aPatch] = a;\n  const [bMajor, bMinor, bPatch] = b;\n  if (aMajor !== bMajor) return aMajor - bMajor;\n  if (aMinor !== bMinor) return aMinor - bMinor;\n  if (aPatch !== bPatch) return aPatch - bPatch;\n  return 0;\n}\n\n/** Build a directory-style format ID from a name and version, e.g. ('SugarCube', '2.37.3') → 'sugarcube-2'. */\nexport function makeFormatId(name: string, version: string): string {\n  const major = parseVersion(version)?.major ?? 0;\n  return `${name.toLowerCase().replace(/\\s+/g, '-')}-${major}`;\n}\n\n/** Describe a format request for diagnostics. */\nexport function describeFormatRequest(request: FormatRequest): string {\n  switch (request.kind) {\n    case 'id':\n      return `\"${request.id}\"`;\n    case 'name':\n      return request.version ? `\"${request.name}\" at version \"${request.version}\"` : `\"${request.name}\"`;\n    default: {\n      const _exhaustive: never = request;\n      throw new Error(`unhandled format request: ${JSON.stringify(_exhaustive)}`);\n    }\n  }\n}\n\n/** Options for {@link selectFormatCandidate}. */\nexport interface SelectFormatOptions {\n  /** For a name request, also accept a version older than the one asked for (same major only). */\n  readonly allowOlder?: boolean;\n}\n\n/** {@link selectFormatCandidate} over one set of candidates, matching names without regard to case. */\nfunction pickFormatCandidate<T>(\n  request: FormatRequest,\n  candidates: readonly T[],\n  describe: (candidate: T) => { readonly name: string; readonly version: string },\n  allowOlder: boolean,\n): T | undefined {\n  const wanted = request.kind === 'name' ? parseVersion(request.version) : null;\n  let best: { readonly candidate: T; readonly version: SemVer } | undefined;\n\n  for (const candidate of candidates) {\n    const { name, version } = describe(candidate);\n    const have = parseVersion(version);\n    if (!have) continue;\n\n    if (request.kind === 'id') {\n      if (makeFormatId(name, version) !== request.id.toLowerCase()) continue;\n    } else {\n      if (name.toLowerCase() !== request.name.toLowerCase()) continue;\n      if (wanted) {\n        const order = compareVersions(have, wanted);\n        if (order === 0) return candidate;\n        if (have.major !== wanted.major) continue;\n        if (!allowOlder && order < 0) continue;\n      }\n    }\n\n    if (!best || compareVersions(have, best.version) > 0) best = { candidate, version: have };\n  }\n\n  return best?.candidate;\n}\n\n/**\n * Pick the candidate that best answers a format request. Local folders, the download cache and\n * remote indices all select through this one function.\n *\n * - An ID request ('sugarcube-2') matches, without regard to case, a candidate whose name and\n *   major version build that ID, and takes the greatest such version.\n * - A name request matches the name without regard to case, but a candidate whose name matches in\n *   case too is preferred when one answers the request. An exact version (prerelease included)\n *   wins outright; otherwise the greatest version with the same major that is not older than the\n *   one asked for (or, with `allowOlder`, the greatest same-major version). An unparseable\n *   requested version takes the greatest version of any major.\n *\n * Versions compare by SemVer precedence ({@link compareVersions}), so a release outranks its\n * prereleases. Between equal versions, the earlier candidate wins.\n */\nexport function selectFormatCandidate<T>(\n  request: FormatRequest,\n  candidates: readonly T[],\n  describe: (candidate: T) => { readonly name: string; readonly version: string },\n  options: SelectFormatOptions = {},\n): T | undefined {\n  const allowOlder = options.allowOlder ?? false;\n  if (request.kind === 'name') {\n    const exactCase = candidates.filter((c) => describe(c).name === request.name);\n    const preferred = pickFormatCandidate(request, exactCase, describe, allowOlder);\n    if (preferred !== undefined) return preferred;\n  }\n  return pickFormatCandidate(request, candidates, describe, allowOlder);\n}\n\n/** The Twine 2 formats of a discovered map, those from higher-ranked search directories first. */\nexport function rankedTwine2Formats(formats: ReadonlyMap<string, StoryFormatInfo>): StoryFormatInfo[] {\n  return [...formats.values()].filter((f) => f.isTwine2).reverse();\n}\n\n/**\n * Look a format ID up among discovered folders. The ID matches a folder name without regard to\n * case; an exact-case folder is preferred, then the highest-ranked one.\n */\nexport function findFormatById(formats: ReadonlyMap<string, StoryFormatInfo>, id: string): StoryFormatInfo | undefined {\n  const exact = formats.get(id);\n  if (exact) return exact;\n  const wanted = id.toLowerCase();\n  return [...formats.values()].reverse().find((f) => f.id.toLowerCase() === wanted);\n}\n\n/**\n * Get format ID from Twine 2 name and version, as a compile selects a local format by StoryData:\n * {@link selectFormatCandidate} over the pruned formats, so the greatest version with the same\n * major that is not older than `version` (any major when `version` is unparseable).\n */\nexport function getFormatIdByNameAndVersion(\n  formats: ReadonlyMap<string, StoryFormatInfo>,\n  name: string,\n  version: string,\n): string | undefined {\n  const request: FormatRequest = { kind: 'name', name, version };\n  return selectFormatCandidate(request, rankedTwine2Formats(pruneFormats(formats)), (f) => f)?.id;\n}\n\n/** Get format ID from Twine 2 name, picking the greatest version. */\nexport function getFormatIdByName(formats: ReadonlyMap<string, StoryFormatInfo>, name: string): string | undefined {\n  return getFormatIdByNameAndVersion(formats, name, '');\n}\n\n/**\n * Read the story format source (for Twine 2, extract the `source` property from JSON).\n * `diagnostics` receives a warning when the format file is not valid UTF-8 (it is read as Windows-1252).\n */\nexport function readFormatSource(format: StoryFormatInfo, diagnostics?: Diagnostic[]): string {\n  const source = readUTF8(format.filename, diagnostics);\n  if (!format.isTwine2) return source;\n  const decoded = decodeFormatJSON(source);\n  if (!decoded.ok) throw new Error(`Cannot parse format ${format.id} JSON: ${decoded.reason}`);\n  return decoded.data.source;\n}\n\n/** Read a file as UTF-8 (re-exported for loader use). */\nexport { readUTF8 as readFileUTF8 } from './util.js';\n","/**\n * Atomic file replacement, for every file twee-ts writes that something else may read\n * meanwhile: build output (which live-reload servers read on each change) and downloaded\n * story formats (which other twee-ts processes share).\n */\nimport { randomBytes } from 'node:crypto';\nimport { chmodSync, lstatSync, readlinkSync, renameSync, rmSync, statSync, writeFileSync } from 'node:fs';\nimport { basename, dirname, join, resolve } from 'node:path';\n\n/**\n * Writes `data` to `path` so that a reader sees either the previous file or the complete new\n * one, never a partly written file. The data goes to a temporary file in the same folder,\n * which is then renamed over `path`. When `path` is a symlink (even a dangling one, or a chain of links), the file it\n * finally points to is replaced or created and the link stays, and an existing file keeps its permissions.\n *\n * On failure (a full disk, a missing folder) the temporary file is removed, `path` is left\n * as it was, and the error is thrown with `path` in its message and its original `code`.\n */\nexport function writeFileAtomic(path: string, data: string): void {\n  let temp: string | undefined;\n  try {\n    const target = resolveWriteTarget(path);\n    temp = join(dirname(target), `.${basename(target)}.${process.pid}-${randomBytes(6).toString('hex')}.tmp`);\n    writeFileSync(temp, data, { encoding: 'utf-8', flag: 'wx' });\n    keepPermissions(target, temp);\n    renameSync(temp, target);\n  } catch (e) {\n    if (temp !== undefined) rmSync(temp, { force: true });\n    throw writeError(path, e);\n  }\n}\n\n/** Links followed before a path counts as a cycle (Linux stops at 40 as well). */\nconst MAX_LINK_DEPTH = 40;\n\n/**\n * The file a symlink at `path` finally points to, or `path` itself when it is no link. Links are\n * followed one by one, so a link whose target does not exist yet (absolute, relative, or a chain\n * of them) still resolves to the file that should be created. A cycle or an unreadable link throws.\n */\nfunction resolveWriteTarget(path: string): string {\n  let current = path;\n  for (let depth = 0; depth <= MAX_LINK_DEPTH; depth++) {\n    const stat = lstatSync(current, { throwIfNoEntry: false });\n    if (stat === undefined || !stat.isSymbolicLink()) return current;\n    current = resolve(dirname(current), readlinkSync(current));\n  }\n  throw Object.assign(new Error(`ELOOP: too many levels of symbolic links, ${path}`), { code: 'ELOOP' });\n}\n\n/**\n * Gives `temp` the permission bits of `target`, when `target` exists. Best effort: on a file\n * system without Unix permissions chmod can fail, and writing in place never kept them there either.\n */\nfunction keepPermissions(target: string, temp: string): void {\n  const existing = statSync(target, { throwIfNoEntry: false });\n  if (existing === undefined) return;\n  try {\n    chmodSync(temp, existing.mode & 0o7777);\n  } catch {\n    // The new file keeps the default permissions.\n  }\n}\n\n/** `cause` as an error that names `path` and keeps the original error code. */\nfunction writeError(path: string, cause: unknown): Error {\n  const message = cause instanceof Error ? cause.message : String(cause);\n  const error: Error & { code?: unknown } = new Error(`Cannot write ${path}: ${message}`, { cause });\n  if (cause instanceof Error && 'code' in cause) error.code = cause.code;\n  return error;\n}\n","/**\n * Remote story format fetching, caching, and checksum verification.\n * Uses the Story Formats Archive (SFA) as the default source.\n *\n * Two caches hold downloads. Formats found through an index are shared by name and version\n * (`<cache>/<name>/<version>/format.js`). A format downloaded from a direct URL is kept under\n * that URL instead, so one project's copy never answers another project's request.\n * Cache files are replaced atomically, so another process never reads a partly written one.\n */\nimport { createHash } from 'node:crypto';\nimport { mkdirSync, existsSync, readdirSync, statSync, rmSync, lstatSync } from 'node:fs';\nimport { dirname, isAbsolute, join, relative, resolve, sep } from 'node:path';\nimport { homedir } from 'node:os';\nimport type {\n  FormatRequest,\n  RemoteFetchOptions,\n  SFAIndex,\n  SFAIndexEntry,\n  StoryFormatInfo,\n  Twine2FormatJSON,\n} from './types.js';\nimport { parseSemver, parseFormatJSON, makeFormatId, selectFormatCandidate, UNNAMED_FORMAT_NAME } from './formats.js';\nimport type { SelectFormatOptions } from './formats.js';\nimport { sameVersion } from './semver.js';\nimport { decodeText, readUTF8 } from './util.js';\nimport { writeFileAtomic } from './atomic-write.js';\n\nconst DEFAULT_SFA_INDICES = [\n  'https://videlais.github.io/story-formats-archive/official/index.json',\n  'https://videlais.github.io/story-formats-archive/unofficial/index.json',\n];\n\n/** How long one story format request (an index or a format.js) may take by default, in milliseconds. */\nexport const DEFAULT_FORMAT_FETCH_TIMEOUT = 30_000;\n\n/** The longest delay a timer accepts; a longer timeout means no limit. */\nconst MAX_TIMER_DELAY = 2_147_483_647;\n\n/** Get the cache directory for downloaded story formats. */\nexport function getCacheDir(): string {\n  const xdg = process.env['XDG_CACHE_HOME'];\n  const base = xdg || join(homedir(), '.cache');\n  return join(base, 'twee-ts', 'storyformats');\n}\n\n/** The cache directory for formats downloaded from direct URLs, beside {@link getCacheDir}. */\nfunction getUrlCacheDir(): string {\n  return join(dirname(getCacheDir()), 'storyformat-urls');\n}\n\n/** The name of one direct URL's cache entry: a hash of the URL, so each URL has its own. */\nfunction urlCacheKey(url: string): string {\n  return createHash('sha256').update(url).digest('hex');\n}\n\n/**\n * Whether a string can serve as one directory name inside the cache: not empty, not `.` or `..`,\n * and free of path separators. Format names and versions come from downloaded metadata, so they\n * are untrusted path input.\n */\nfunction isSafeSegment(segment: string): boolean {\n  return segment !== '' && segment !== '.' && segment !== '..' && !/[/\\\\\\0]/.test(segment);\n}\n\n/** Whether absolute path `target` lies strictly inside absolute path `root`. */\nfunction isInside(root: string, target: string): boolean {\n  const rel = relative(root, target);\n  return rel !== '' && !isAbsolute(rel) && rel.split(sep)[0] !== '..';\n}\n\n/** The cache directory for one format version. Throws when the name or version could leave the cache. */\nfunction cachedFormatDir(name: string, version: string): string {\n  if (!isSafeSegment(name)) {\n    throw new Error(`Refusing to cache a story format with an unsafe name: ${JSON.stringify(name)}`);\n  }\n  if (!isSafeSegment(version) || !parseSemver(version)) {\n    throw new Error(`Refusing to cache story format \"${name}\" with an unsafe version: ${JSON.stringify(version)}`);\n  }\n  const root = resolve(getCacheDir());\n  const dir = resolve(root, name, version);\n  if (!isInside(root, dir)) {\n    throw new Error(`Refusing to cache a story format outside the cache directory ${root}: ${dir}`);\n  }\n  return dir;\n}\n\n/** Whether `e` is a Node.js system error with the given code. */\nfunction hasErrorCode(e: unknown, code: string): boolean {\n  return e instanceof Error && 'code' in e && e.code === code;\n}\n\n/**\n * Create `dir` as a plain directory, or check that it already is one (a symlink could lead out of the cache).\n * A directory another process creates between the check and the mkdir is fine.\n */\nfunction ensurePlainDirectory(dir: string): void {\n  if (lstatSync(dir, { throwIfNoEntry: false }) === undefined) {\n    try {\n      mkdirSync(dir);\n      return;\n    } catch (e) {\n      if (!hasErrorCode(e, 'EEXIST')) throw e;\n    }\n  }\n  const stat = lstatSync(dir, { throwIfNoEntry: false });\n  if (stat === undefined || stat.isSymbolicLink() || !stat.isDirectory()) {\n    throw new Error(`Refusing to write a story format outside the cache directory: ${dir} is not a plain directory`);\n  }\n}\n\n/**\n * Write a downloaded format.js to `<root>/<...segments>/format.js`, replacing any earlier copy\n * atomically, and return its path. Every directory below `root` must be a plain one.\n */\nfunction writeCacheEntry(root: string, segments: readonly string[], text: string): string {\n  mkdirSync(root, { recursive: true });\n  const dir = segments.reduce((parent, segment) => {\n    const child = join(parent, segment);\n    ensurePlainDirectory(child);\n    return child;\n  }, root);\n\n  const formatPath = join(dir, 'format.js');\n  if (lstatSync(formatPath, { throwIfNoEntry: false })?.isSymbolicLink()) {\n    throw new Error(`Refusing to write a story format outside the cache directory: ${formatPath} is a symlink`);\n  }\n  writeFileAtomic(formatPath, text);\n  return formatPath;\n}\n\n/** In-memory index cache, keyed by URL. Cleared each compile. */\nconst indexCache = new Map<string, SFAIndex>();\n\n/** Clear the in-memory index cache. */\nexport function clearIndexCache(): void {\n  indexCache.clear();\n}\n\n/** One network request with everyone in this process who waits on its result. */\ninterface SharedRequest<T> {\n  readonly promise: Promise<T>;\n  readonly controller: AbortController;\n  waiters: number;\n}\n\n/** Requests in progress, by what they fetch, so concurrent compiles make each request once. */\nconst sharedRequests = new Map<string, SharedRequest<unknown>>();\n\n/** How one caller waits on a shared request. */\ninterface WaitOptions {\n  /** Stops this caller's wait at once, rejecting with the signal's reason. */\n  readonly signal: AbortSignal | undefined;\n  /** How long this caller waits, in milliseconds (0: no limit). */\n  readonly timeout: number;\n  /** The error this caller's wait ends with when its timeout passes. */\n  readonly timedOut: () => Error;\n}\n\n/**\n * Runs `start` once for all callers that ask for `key` while it is in progress. Each caller waits\n * under its own limits: a caller whose `signal` aborts, or whose `timeout` passes, stops waiting\n * at once and rejects, while the others keep waiting. The request itself is aborted (through\n * the signal `start` receives) once no caller waits on it. `start` must not depend on any one\n * caller: what differs between callers belongs after the shared result.\n */\nfunction shareRequest<T>(\n  key: string,\n  { signal, timeout, timedOut }: WaitOptions,\n  start: (signal: AbortSignal) => Promise<T>,\n): Promise<T> {\n  if (signal?.aborted) return Promise.reject(signal.reason);\n  const request = (sharedRequests.get(key) as SharedRequest<T> | undefined) ?? startSharedRequest(key, start);\n  request.waiters++;\n\n  return new Promise<T>((resolve, reject) => {\n    let waiting = true;\n    let timer: ReturnType<typeof setTimeout> | undefined;\n    const stopWaiting = (): void => {\n      if (!waiting) return;\n      waiting = false;\n      signal?.removeEventListener('abort', onAbort);\n      clearTimeout(timer);\n      request.waiters--;\n    };\n    const giveUp = (reason: unknown): void => {\n      stopWaiting();\n      if (request.waiters === 0) {\n        if (sharedRequests.get(key) === request) sharedRequests.delete(key);\n        request.controller.abort(reason);\n      }\n      reject(reason);\n    };\n    const onAbort = (): void => giveUp(signal?.reason);\n    signal?.addEventListener('abort', onAbort, { once: true });\n    if (timeout > 0 && timeout <= MAX_TIMER_DELAY) timer = setTimeout(() => giveUp(timedOut()), timeout);\n    request.promise.then(\n      (value) => {\n        stopWaiting();\n        resolve(value);\n      },\n      (e: unknown) => {\n        stopWaiting();\n        reject(e);\n      },\n    );\n  });\n}\n\nfunction startSharedRequest<T>(key: string, start: (signal: AbortSignal) => Promise<T>): SharedRequest<T> {\n  const controller = new AbortController();\n  const request: SharedRequest<T> = { promise: start(controller.signal), controller, waiters: 0 };\n  sharedRequests.set(key, request);\n  const forget = (): void => {\n    if (sharedRequests.get(key) === request) sharedRequests.delete(key);\n  };\n  request.promise.then(forget, forget);\n  return request;\n}\n\n/** The time limit for each request, from the caller's options. */\nfunction requestTimeout(options: RemoteFetchOptions): number {\n  const timeout = options.timeout ?? DEFAULT_FORMAT_FETCH_TIMEOUT;\n  if (!(timeout >= 0)) {\n    throw new RangeError(`A story format request timeout must be 0 or more milliseconds, not ${timeout}`);\n  }\n  return timeout;\n}\n\n/** How one caller waits for `url`: under its own signal and timeout. `what` names the request in errors. */\nfunction waitOptions(options: RemoteFetchOptions, what: string, url: string): WaitOptions {\n  const timeout = requestTimeout(options);\n  return {\n    signal: options.signal,\n    timeout,\n    timedOut: () => new Error(`Failed to ${what} from ${url}: timed out after ${timeout} ms`),\n  };\n}\n\n/**\n * Fetch `url` as bytes, aborting when `signal` does. `what` names the request in errors, as in\n * \"Failed to <what> from <url>\". The bytes are returned undecoded, so checksums cover what was served.\n */\nasync function fetchBytes(url: string, what: string, signal: AbortSignal): Promise<Uint8Array<ArrayBuffer>> {\n  const res = await fetch(url, { signal });\n  if (!res.ok) {\n    throw new Error(`Failed to ${what} from ${url}: ${res.status} ${res.statusText}`);\n  }\n  return new Uint8Array(await res.arrayBuffer());\n}\n\n/** Download a format.js once for every caller in this process that asks for `url` meanwhile. */\nfunction shareDownload(url: string, options: RemoteFetchOptions): Promise<Uint8Array<ArrayBuffer>> {\n  return shareRequest(`download\\0${url}`, waitOptions(options, 'download format', url), (signal) =>\n    fetchBytes(url, 'download format', signal),\n  );\n}\n\n/** Decode a downloaded format.js as local ones are (UTF-8, else Windows-1252), without a leading BOM. */\nfunction decodeDownload(bytes: Uint8Array, url: string): string {\n  const { text } = decodeText(bytes, url);\n  return text.charCodeAt(0) === 0xfeff ? text.slice(1) : text;\n}\n\n/** Validate that a JSON value is a valid SFAIndexEntry. */\nfunction isValidEntry(val: unknown): val is SFAIndexEntry {\n  if (typeof val !== 'object' || val === null || Array.isArray(val)) return false;\n  const obj = val as Record<string, unknown>;\n  return (\n    typeof obj.name === 'string' &&\n    typeof obj.version === 'string' &&\n    typeof obj.checksums === 'object' &&\n    obj.checksums !== null &&\n    !Array.isArray(obj.checksums)\n  );\n}\n\n/** Validate that a JSON value conforms to the SFAIndex shape. */\nfunction validateSFAIndex(json: unknown): SFAIndex {\n  if (typeof json !== 'object' || json === null) {\n    throw new Error('SFA index is not an object');\n  }\n  const obj = json as Record<string, unknown>;\n  const twine1 = Array.isArray(obj['twine1']) ? (obj['twine1'] as unknown[]).filter(isValidEntry) : [];\n  const twine2 = Array.isArray(obj['twine2']) ? (obj['twine2'] as unknown[]).filter(isValidEntry) : [];\n  return { twine1, twine2 };\n}\n\n/** Fetch and parse an SFA index.json, with in-memory caching. Concurrent calls for one URL share a request. */\nexport async function fetchIndex(url: string, options: RemoteFetchOptions = {}): Promise<SFAIndex> {\n  options.signal?.throwIfAborted();\n  const cached = indexCache.get(url);\n  if (cached) return cached;\n\n  return shareRequest(`index\\0${url}`, waitOptions(options, 'fetch format index', url), async (signal) => {\n    const text = decodeDownload(await fetchBytes(url, 'fetch format index', signal), url);\n    const data = validateSFAIndex(JSON.parse(text));\n    indexCache.set(url, data);\n    return data;\n  });\n}\n\ninterface FindEntryResult {\n  entry: SFAIndexEntry;\n  formatType: 'twine1' | 'twine2';\n}\n\n/**\n * Find the best matching entry in an SFA index.\n * Exact version preferred, then highest version with same major.\n */\nexport function findEntry(index: SFAIndex, name: string, version: string): FindEntryResult | undefined {\n  return findEntryForRequest(index, { kind: 'name', name, version });\n}\n\n/** Find the best matching entry in an SFA index for a name or ID request (twine2 entries first). */\nfunction findEntryForRequest(index: SFAIndex, request: FormatRequest): FindEntryResult | undefined {\n  const candidates: FindEntryResult[] = [\n    ...(index.twine2 ?? []).map((entry) => ({ entry, formatType: 'twine2' as const })),\n    ...(index.twine1 ?? []).map((entry) => ({ entry, formatType: 'twine1' as const })),\n  ];\n  return selectFormatCandidate(request, candidates, (c) => c.entry);\n}\n\n/** Verify SHA-256 checksum using Web Crypto API (Node 22 built-in). */\nexport async function verifySHA256(content: Uint8Array<ArrayBuffer>, expectedHex: string): Promise<boolean> {\n  const digest = await crypto.subtle.digest('SHA-256', content);\n  const hex = Array.from(new Uint8Array(digest))\n    .map((b) => b.toString(16).padStart(2, '0'))\n    .join('');\n  return hex === expectedHex.toLowerCase();\n}\n\n/** Derive the download URL for a format.js from the index URL and entry. */\nfunction getDownloadUrl(indexUrl: string, entry: SFAIndexEntry, formatType: 'twine1' | 'twine2'): string {\n  const base = indexUrl.replace(/\\/index\\.json$/, '');\n  return `${base}/${formatType}/${entry.name}/${entry.version}/format.js`;\n}\n\n/** The StoryFormatInfo of a Twine 2 format.js cached at `filename`. */\nfunction cachedFormatInfo(\n  id: string,\n  filename: string,\n  data: { readonly name: string; readonly version: string; readonly proofing?: boolean },\n): StoryFormatInfo {\n  return { id, filename, isTwine2: true, name: data.name, version: data.version, proofing: data.proofing ?? false };\n}\n\n/**\n * Check that a downloaded format is the one the index entry promised. The name matches without\n * regard to case, as format requests do, and the version by SemVer precedence, so \"1.0\" and \"v1.0.0\"\n * agree. A format.js that names no format ({@link UNNAMED_FORMAT_NAME}) is allowed: such formats\n * exist, and the index entry then supplies the name it is cached under.\n */\nfunction checkFormatIdentity(entry: SFAIndexEntry, data: Twine2FormatJSON, downloadUrl: string): void {\n  const nameMatches = data.name === UNNAMED_FORMAT_NAME || data.name.toLowerCase() === entry.name.toLowerCase();\n  if (nameMatches && sameVersion(data.version, entry.version)) return;\n  throw new Error(\n    `Story format mismatch for ${downloadUrl}: the index lists ${entry.name} ${entry.version}, ` +\n      `but the download is ${data.name} ${data.version}`,\n  );\n}\n\n/**\n * Download a format, verify its checksum, check that it is the format the entry names, write it to\n * the cache shared by name and version, and return its StoryFormatInfo. Concurrent calls for one\n * download URL share one request for the bytes; each call then verifies them against its own\n * entry, within its own timeout.\n */\nexport async function fetchAndCacheFormat(\n  entry: SFAIndexEntry,\n  downloadUrl: string,\n  options: RemoteFetchOptions = {},\n): Promise<StoryFormatInfo> {\n  // Index metadata is untrusted: reject a name or version that would leave the cache before downloading.\n  cachedFormatDir(entry.name, entry.version);\n  const bytes = await shareDownload(downloadUrl, options);\n\n  // Verify the checksum against the bytes as served, if the entry has one.\n  const checksumKey = Object.keys(entry.checksums ?? {}).find((k) => k.endsWith('format.js'));\n  if (checksumKey) {\n    const expected = entry.checksums[checksumKey];\n    if (!expected) throw new Error(`Missing checksum value for key \"${checksumKey}\"`);\n    if (!(await verifySHA256(bytes, expected))) {\n      throw new Error(`Checksum verification failed for ${entry.name} ${entry.version}`);\n    }\n  }\n\n  // Parse format JSON to extract name/version/source\n  const text = decodeDownload(bytes, downloadUrl);\n  const id = makeFormatId(entry.name, entry.version);\n  const data = parseFormatJSON(text, id);\n  if (!data) {\n    throw new Error(`Failed to parse format JSON from ${downloadUrl}`);\n  }\n  checkFormatIdentity(entry, data, downloadUrl);\n\n  // This caller gave up meanwhile: leave the cache as it was.\n  options.signal?.throwIfAborted();\n  const formatPath = writeCacheEntry(resolve(getCacheDir()), [entry.name, entry.version], text);\n  return cachedFormatInfo(id, formatPath, data);\n}\n\n/**\n * Download a direct format.js URL, parse its JSON, cache it under that URL (apart from the\n * downloads shared by name and version), and return its StoryFormatInfo. Concurrent calls for\n * one URL share one request.\n */\nexport async function fetchDirectFormat(url: string, options: RemoteFetchOptions = {}): Promise<StoryFormatInfo> {\n  const bytes = await shareDownload(url, options);\n  const text = decodeDownload(bytes, url);\n\n  const data = parseFormatJSON(text);\n  if (!data) {\n    throw new Error(`Failed to parse format JSON from ${url}`);\n  }\n  // The metadata is untrusted: refuse what could not be cached by name and version either.\n  cachedFormatDir(data.name, data.version);\n\n  // This caller gave up meanwhile: leave the cache as it was.\n  options.signal?.throwIfAborted();\n  const formatPath = writeCacheEntry(getUrlCacheDir(), [urlCacheKey(url)], text);\n  return cachedFormatInfo(makeFormatId(data.name, data.version), formatPath, data);\n}\n\n/** The copy of a direct format URL in the download cache, if it has been downloaded before. */\nfunction getCachedDirectFormat(url: string): StoryFormatInfo | undefined {\n  const formatPath = join(getUrlCacheDir(), urlCacheKey(url), 'format.js');\n  try {\n    if (!existsSync(formatPath)) return undefined;\n    const data = parseFormatJSON(readUTF8(formatPath));\n    if (!data) return undefined;\n    return cachedFormatInfo(makeFormatId(data.name, data.version), formatPath, data);\n  } catch {\n    return undefined;\n  }\n}\n\n/** Options for {@link resolveFormatUrls}. */\nexport interface ResolveFormatUrlsOptions extends RemoteFetchOptions {\n  /** Use only the URLs downloaded before; fetch nothing. */\n  readonly offline?: boolean;\n}\n\n/**\n * Look a request up among direct format URLs, in order, and return the first format that\n * answers it. A URL downloaded before is answered by its cached copy without the network;\n * any other is downloaded (unless `offline`). When none answers and a download failed, the\n * last failure is thrown. An aborted signal rejects with its reason and tries no further URL.\n *\n * Internal, for format resolution; not part of the public API.\n */\nexport async function resolveFormatUrls(\n  request: FormatRequest,\n  urls: readonly string[],\n  options: ResolveFormatUrlsOptions = {},\n): Promise<StoryFormatInfo | undefined> {\n  let lastError: Error | undefined;\n  for (const url of urls) {\n    const cached = getCachedDirectFormat(url);\n    if (cached) {\n      if (answers(request, cached)) return cached;\n      continue;\n    }\n    if (options.offline) continue;\n    try {\n      const info = await fetchDirectFormat(url, options);\n      if (answers(request, info)) return info;\n    } catch (e) {\n      if (options.signal?.aborted) throw options.signal.reason;\n      lastError = toError(e);\n    }\n  }\n  if (lastError) throw lastError;\n  return undefined;\n}\n\n/**\n * Find the best format among the cached copies of direct format URLs, without network access.\n * Matching follows {@link selectFormatCandidate}, so `allowOlder` admits a same-major older version.\n * Each URL keeps its own copy; the shared name and version downloads are never consulted.\n *\n * Internal, for format resolution; not part of the public API.\n */\nexport function findCachedUrlFormat(\n  request: FormatRequest,\n  urls: readonly string[],\n  options: SelectFormatOptions = {},\n): StoryFormatInfo | undefined {\n  const cached = urls.flatMap((url) => getCachedDirectFormat(url) ?? []);\n  return selectFormatCandidate(request, cached, (f) => f, options);\n}\n\n/** Whether `info` is a format the request accepts. */\nfunction answers(request: FormatRequest, info: StoryFormatInfo): boolean {\n  return selectFormatCandidate(request, [info], (f) => f) !== undefined;\n}\n\nfunction toError(e: unknown): Error {\n  return e instanceof Error ? e : new Error(String(e));\n}\n\n/**\n * Try to resolve a remote story format by name and version.\n * 1. Try direct format URLs (each one's cached copy, else a download)\n * 2. Use an exactly matching download from the shared cache, without touching the network\n * 3. Try custom index URLs, then the default SFA indices\n * 4. Fall back to a compatible download from the shared cache (e.g. when offline)\n *\n * `options.signal` aborts the lookup, which then rejects with the signal's reason;\n * `options.timeout` limits each request (default {@link DEFAULT_FORMAT_FETCH_TIMEOUT} ms).\n */\nexport async function resolveRemoteFormat(\n  name: string,\n  version: string,\n  indices?: readonly string[],\n  urls?: readonly string[],\n  options: RemoteFetchOptions = {},\n): Promise<StoryFormatInfo | undefined> {\n  return resolveRemoteFormatRequest({ kind: 'name', name, version }, indices, urls, options);\n}\n\n/**\n * Resolve a story format request remotely, in the same order as {@link resolveRemoteFormat}.\n * An ID request such as 'sugarcube-2' matches the format whose name and major version build that ID\n * (SugarCube 2.x), taking the greatest version available.\n */\nexport async function resolveRemoteFormatRequest(\n  request: FormatRequest,\n  indices?: readonly string[],\n  urls?: readonly string[],\n  options: RemoteFetchOptions = {},\n): Promise<StoryFormatInfo | undefined> {\n  options.signal?.throwIfAborted();\n  let lastError: Error | undefined;\n\n  // 1. The caller's own format URLs come before anything shared by name and version.\n  try {\n    const direct = await resolveFormatUrls(request, urls ?? [], options);\n    if (direct) return direct;\n  } catch (e) {\n    if (options.signal?.aborted) throw options.signal.reason;\n    lastError = toError(e);\n  }\n\n  // 2. An exact version already downloaded needs no network access.\n  const cached = findCachedFormat(request);\n  if (cached && request.kind === 'name' && sameVersion(cached.version, request.version)) return cached;\n\n  // 3. Try custom indices, then default SFA indices\n  const allIndices = [...(indices ?? []), ...DEFAULT_SFA_INDICES];\n  for (const indexUrl of allIndices) {\n    try {\n      const index = await fetchIndex(indexUrl, options);\n      const result = findEntryForRequest(index, request);\n      if (result) {\n        // Check cache first\n        const hit = getCachedFormat(result.entry.name, result.entry.version);\n        if (hit) return hit;\n\n        const downloadUrl = getDownloadUrl(indexUrl, result.entry, result.formatType);\n        return await fetchAndCacheFormat(result.entry, downloadUrl, options);\n      }\n    } catch (e) {\n      if (options.signal?.aborted) throw options.signal.reason;\n      lastError = toError(e);\n    }\n  }\n\n  // 4. No source had it (or none could be reached): a compatible cached download still answers the request.\n  if (cached) return cached;\n\n  // If all sources failed with errors, propagate the last one\n  if (lastError) throw lastError;\n  return undefined;\n}\n\n/**\n * Find the cached download that best answers a format request, without network access.\n * Only the downloads shared by name and version are searched, not those from direct URLs.\n * Matching follows {@link selectFormatCandidate}.\n */\nexport function findCachedFormat(\n  request: FormatRequest,\n  options: SelectFormatOptions = {},\n): StoryFormatInfo | undefined {\n  return selectFormatCandidate(request, [...discoverCachedFormats().values()], (f) => f, options);\n}\n\n/** Check if a format is already in the local cache. */\nfunction getCachedFormat(name: string, version: string): StoryFormatInfo | undefined {\n  if (!isSafeSegment(name) || !isSafeSegment(version)) return undefined;\n  const formatPath = join(getCacheDir(), name, version, 'format.js');\n  try {\n    if (!existsSync(formatPath)) return undefined;\n    const source = readUTF8(formatPath);\n    const id = makeFormatId(name, version);\n    const data = parseFormatJSON(source, id);\n    if (!data) return undefined;\n    return cachedFormatInfo(id, formatPath, data);\n  } catch {\n    return undefined;\n  }\n}\n\n/** Discover all cached remote formats. Returns a Map like discoverFormats(). */\nexport function discoverCachedFormats(): Map<string, StoryFormatInfo> {\n  const formats = new Map<string, StoryFormatInfo>();\n  const cacheDir = getCacheDir();\n\n  try {\n    if (!existsSync(cacheDir)) return formats;\n  } catch {\n    return formats;\n  }\n\n  let names: string[];\n  try {\n    names = readdirSync(cacheDir);\n  } catch {\n    return formats;\n  }\n\n  for (const name of names) {\n    const nameDir = join(cacheDir, name);\n    try {\n      if (!statSync(nameDir).isDirectory()) continue;\n    } catch {\n      continue;\n    }\n\n    let versions: string[];\n    try {\n      versions = readdirSync(nameDir);\n    } catch {\n      continue;\n    }\n\n    for (const version of versions) {\n      const info = getCachedFormat(name, version);\n      if (info) {\n        formats.set(`${info.id}-${version}`, info);\n      }\n    }\n  }\n\n  return formats;\n}\n\n/** Info about a cached format entry with size and modification date. */\nexport interface CachedFormatEntry {\n  readonly name: string;\n  readonly version: string;\n  readonly sizeBytes: number;\n  readonly modifiedAt: Date;\n}\n\n/** List all cached formats with size and modification date. */\nexport function listCachedFormats(): readonly CachedFormatEntry[] {\n  const cacheDir = getCacheDir();\n  const entries: CachedFormatEntry[] = [];\n\n  try {\n    if (!existsSync(cacheDir)) return entries;\n  } catch {\n    return entries;\n  }\n\n  let names: string[];\n  try {\n    names = readdirSync(cacheDir);\n  } catch {\n    return entries;\n  }\n\n  for (const name of names) {\n    const nameDir = join(cacheDir, name);\n    try {\n      if (!statSync(nameDir).isDirectory()) continue;\n    } catch {\n      continue;\n    }\n\n    let versions: string[];\n    try {\n      versions = readdirSync(nameDir);\n    } catch {\n      continue;\n    }\n\n    for (const version of versions) {\n      const formatPath = join(nameDir, version, 'format.js');\n      try {\n        const stat = statSync(formatPath);\n        entries.push({\n          name,\n          version,\n          sizeBytes: stat.size,\n          modifiedAt: stat.mtime,\n        });\n      } catch {\n        // Skip entries without a valid format.js\n      }\n    }\n  }\n\n  return entries;\n}\n\n/**\n * Clear all cached formats, or only those matching a given name. Returns the number of entries removed.\n * Clearing all also removes the downloads from direct format URLs; a name clears only the\n * downloads shared by name and version.\n * A name must be a single cache entry name (as `listCachedFormats()` reports it); anything with a\n * path separator or `.`/`..` throws instead of deleting outside the format's own directory.\n */\nexport function clearCachedFormats(name?: string): number {\n  if (name && !isSafeSegment(name)) {\n    throw new Error(\n      `Refusing to clear ${JSON.stringify(name)}: it is not a cached format name. Use a name as \"cache list\" shows it.`,\n    );\n  }\n\n  const cacheDir = getCacheDir();\n\n  if (!name) {\n    const count = listCachedFormats().length + countUrlCacheEntries();\n    rmSync(cacheDir, { recursive: true, force: true });\n    rmSync(getUrlCacheDir(), { recursive: true, force: true });\n    return count;\n  }\n\n  if (!existsSync(cacheDir)) return 0;\n\n  const root = resolve(cacheDir);\n  const nameDir = resolve(root, name);\n  if (!isInside(root, nameDir)) {\n    throw new Error(`Refusing to clear ${JSON.stringify(name)}: it is not a cached format name.`);\n  }\n  // lstat, so a symlinked entry is never followed out of the cache: only plain directories are entries.\n  if (!lstatSync(nameDir, { throwIfNoEntry: false })?.isDirectory()) return 0;\n\n  let versions: string[];\n  try {\n    versions = readdirSync(nameDir);\n  } catch {\n    return 0;\n  }\n  const count = versions.length;\n  rmSync(nameDir, { recursive: true, force: true });\n  return count;\n}\n\n/** The number of direct format URLs with a download in the cache. */\nfunction countUrlCacheEntries(): number {\n  const dir = getUrlCacheDir();\n  try {\n    return readdirSync(dir).filter((key) => existsSync(join(dir, key, 'format.js'))).length;\n  } catch {\n    return 0;\n  }\n}\n\n/** Get total cache size in bytes and format count. */\nexport function getCacheSize(): { totalBytes: number; count: number } {\n  const entries = listCachedFormats();\n  const totalBytes = entries.reduce((sum, e) => sum + e.sizeBytes, 0);\n  return { totalBytes, count: entries.length };\n}\n","/**\n * Story format selection for a compile.\n *\n * The request comes from the explicit `formatId` option, else the StoryData format name and\n * version, else the default ID. That one request is then looked up in the local format\n * directories, the download cache, and (unless disabled) remote sources. A request that none of\n * them can answer is reported as an error rather than swapped for a different story format.\n */\nimport type { Diagnostic, FormatRequest, RemoteFetchOptions, StoryFormatInfo } from './types.js';\nimport {\n  describeFormatRequest,\n  discoverAllFormats,\n  findFormatById,\n  getFormatSearchDirs,\n  pruneFormats,\n  rankedTwine2Formats,\n  selectFormatCandidate,\n} from './formats.js';\nimport {\n  findCachedFormat,\n  findCachedUrlFormat,\n  resolveFormatUrls,\n  resolveRemoteFormatRequest,\n} from './remote-formats.js';\n\n/** Where to look for story formats. */\nexport interface FormatResolutionOptions {\n  readonly formatPaths?: readonly string[];\n  readonly useTweegoPath?: boolean;\n  readonly noRemote?: boolean;\n  readonly formatIndices?: readonly string[];\n  readonly formatUrls?: readonly string[];\n  /** Aborts the format requests; resolution then rejects with the signal's reason. */\n  readonly signal?: AbortSignal;\n  /** Milliseconds each format request may take. */\n  readonly formatFetchTimeout?: number;\n}\n\n/** Choose the format request: explicit format ID > StoryData format > default ID. */\nexport function formatRequestFor(\n  formatId: string | undefined,\n  storyFormat: string,\n  storyFormatVersion: string,\n  defaultId: string,\n): FormatRequest {\n  if (formatId) return { kind: 'id', id: formatId };\n  if (storyFormat) return { kind: 'name', name: storyFormat, version: storyFormatVersion };\n  return { kind: 'id', id: defaultId };\n}\n\n/**\n * Look a request up among the formats found in local format directories. An ID names a folder, so\n * it is looked up among all of them; a name request selects by SemVer among the pruned formats.\n */\nfunction findLocalFormat(\n  all: ReadonlyMap<string, StoryFormatInfo>,\n  pruned: ReadonlyMap<string, StoryFormatInfo>,\n  request: FormatRequest,\n): StoryFormatInfo | undefined {\n  switch (request.kind) {\n    case 'id':\n      return findFormatById(all, request.id);\n    case 'name':\n      return selectFormatCandidate(request, rankedTwine2Formats(pruned), (f) => f);\n    default: {\n      const _exhaustive: never = request;\n      throw new Error(`unhandled format request: ${JSON.stringify(_exhaustive)}`);\n    }\n  }\n}\n\n/**\n * Resolve a format request to a story format.\n *\n * Order: local format directories, then the project's direct format URLs (each one's cached\n * copy, else a download unless `noRemote`), then the download cache shared by name and version,\n * then format indices (unless `noRemote`). Names and IDs match the same way in each (see\n * `selectFormatCandidate`), so a request that a local format answers never reaches the cache or the\n * network. Local formats that cannot be used are reported as warnings. When a StoryData request\n * names a version that none of them has, an older version of the same format and major version\n * is used with a warning, from local formats, the project's cached format URLs, or the shared cache. Anything else is an error diagnostic,\n * and the result is `undefined`.\n */\nexport async function resolveStoryFormat(\n  request: FormatRequest,\n  options: FormatResolutionOptions,\n  diagnostics: Diagnostic[],\n): Promise<StoryFormatInfo | undefined> {\n  const noRemote = options.noRemote ?? false;\n  const searchDirs = getFormatSearchDirs(options.formatPaths, options.useTweegoPath ?? true);\n  const all = discoverAllFormats(searchDirs, diagnostics);\n  const pruned = pruneFormats(all);\n  const wanted = describeFormatRequest(request);\n\n  const local = findLocalFormat(all, pruned, request);\n  if (local) return local;\n\n  const fetchOptions: RemoteFetchOptions = { signal: options.signal, timeout: options.formatFetchTimeout };\n  const warnOnFailure = async (\n    lookup: () => Promise<StoryFormatInfo | undefined>,\n  ): Promise<StoryFormatInfo | undefined> => {\n    try {\n      return await lookup();\n    } catch (e) {\n      if (options.signal?.aborted) throw options.signal.reason;\n      diagnostics.push({\n        level: 'warning',\n        message: `Remote format fetch failed for ${wanted}: ${e instanceof Error ? e.message : String(e)}`,\n      });\n      return undefined;\n    }\n  };\n\n  // The project's own format URLs come before the downloads shared by name and version, so\n  // another project's download of the same name and version never stands in for them.\n  const direct = await warnOnFailure(() =>\n    resolveFormatUrls(request, options.formatUrls ?? [], { ...fetchOptions, offline: noRemote }),\n  );\n  if (direct) return direct;\n\n  const cached = findCachedFormat(request);\n  if (cached) return cached;\n\n  if (!noRemote) {\n    const remote = await warnOnFailure(() =>\n      resolveRemoteFormatRequest(request, options.formatIndices, [], fetchOptions),\n    );\n    if (remote) return remote;\n  }\n\n  // A same-major older version keeps the story in its own format; it never crosses majors.\n  if (request.kind === 'name') {\n    const older =\n      selectFormatCandidate(request, rankedTwine2Formats(pruned), (f) => f, { allowOlder: true }) ??\n      // Every configured URL was downloaded above unless remote fetching is off or it failed, so\n      // its cached copy is the whole answer here.\n      findCachedUrlFormat(request, options.formatUrls ?? [], { allowOlder: true }) ??\n      findCachedFormat(request, { allowOlder: true });\n    if (older) {\n      diagnostics.push({\n        level: 'warning',\n        message: `Story format ${wanted} is not available; using ${older.name} ${older.version} instead.`,\n      });\n      return older;\n    }\n  }\n\n  const reason = noRemote ? ' (remote fetching disabled)' : '';\n  diagnostics.push({\n    level: 'error',\n    message: `Story format ${wanted} is not available${reason}. Found: ${[...all.keys()].join(', ') || 'none'}`,\n  });\n  return undefined;\n}\n","/**\n * All public interfaces for twee-ts.\n */\n\n// --- Output modes ---\n\nexport type OutputMode = 'html' | 'twee3' | 'twee1' | 'twine2-archive' | 'twine1-archive' | 'json';\n\n// --- Word count ---\n\nexport type WordCountMethod = 'tweego' | 'whitespace';\n\n// --- Source input ---\n\nexport type InlineSource = { filename: string; content: string | Buffer };\nexport type SourceInput = string | InlineSource;\n\n// --- Compile options ---\n\nexport interface CompileOptions {\n  /**\n   * Files, directories, or inline sources to compile. Directories are walked\n   * recursively; inside one, a symbolic link to a file is read, but a link to a\n   * directory is not followed (as in Tweego).\n   */\n  sources: readonly SourceInput[];\n  /**\n   * Glob patterns for files to leave out of `sources`, matched against each file's\n   * path relative to the working directory (as `stats.files` lists it). Modules are not affected.\n   */\n  exclude?: readonly string[];\n  /** Output mode. Default: 'html'. */\n  outputMode?: OutputMode;\n  /** Story format directory ID (e.g. 'sugarcube-2'). */\n  formatId?: string;\n  /** Name of the starting passage. Default: 'Start'. */\n  startPassage?: string;\n  /** Extra directories to search for story formats. */\n  formatPaths?: readonly string[];\n  /** Also search TWEEGO_PATH env for formats. Default: true. */\n  useTweegoPath?: boolean;\n  /** Module files to inject into <head>. */\n  modules?: readonly string[];\n  /** Raw HTML file to append to <head>. */\n  headFile?: string;\n  /** Trim passage whitespace. Default: true. */\n  trim?: boolean;\n  /** Twee2 compatibility mode. Default: false. */\n  twee2Compat?: boolean;\n  /** Enable debug/test mode option. Default: false. */\n  testMode?: boolean;\n  /** URLs to SFA-compatible index.json files for remote format lookup. */\n  formatIndices?: readonly string[];\n  /**\n   * Direct URLs to format.js files. Each URL's download is cached under that URL, and is\n   * looked up before the downloads shared by name and version.\n   */\n  formatUrls?: readonly string[];\n  /** Disable remote format fetching. Default: false. */\n  noRemote?: boolean;\n  /**\n   * Cancels the compile. Story format requests still in progress are aborted, and the compile\n   * rejects with the signal's reason. `watch()` aborts its builds, and stops watching, when it aborts.\n   */\n  signal?: AbortSignal;\n  /**\n   * Milliseconds each story format request (an index or a format.js) may take before it fails\n   * with a warning and the next source is tried. 0 turns the limit off. Default: 30000.\n   */\n  formatFetchTimeout?: number;\n  /** Map alias tags to canonical special tags (e.g. { library: 'script' }). */\n  tagAliases?: Record<string, string>;\n  /** Emit source file and line as data- attributes on passage elements. Default: false. */\n  sourceInfo?: boolean;\n  /** Word counting method. Default: 'tweego'. */\n  wordCountMethod?: WordCountMethod;\n}\n\nexport interface CompileToFileOptions extends CompileOptions {\n  /**\n   * Output file path. It is never read as a source, even inside a source folder or\n   * reached through a symbolic link. Naming it as a source, a module or the head\n   * file is a TweeTsError, and nothing is written.\n   */\n  outFile: string;\n}\n\nexport interface WatchOptions extends CompileToFileOptions {\n  /**\n   * Called after each build is written, including one whose diagnostics report errors. Builds\n   * run one at a time and are reported in order, each as it finishes, also while changes keep\n   * arriving: the changes made during a build go into one follow-up build after it.\n   */\n  onBuild?: (result: CompileResult) => void;\n  /**\n   * Called when a build fails with a fatal error (nothing is written), when `onBuild` throws,\n   * and when a watched path can't be watched (the other paths are still watched). An exception\n   * thrown here is reported to the console, and watching goes on.\n   */\n  onError?: (error: Error) => void;\n}\n\n// --- Compile result ---\n\nexport type Diagnostic =\n  | { level: 'warning'; message: string; file?: string; line?: number }\n  | { level: 'error'; message: string; file?: string; line?: number; fatal?: boolean };\n\nexport interface CompileResult {\n  /** The compiled output string (HTML, Twee, JSON, etc.). */\n  output: string;\n  /** The parsed story model (read-only after compilation). */\n  story: ReadonlyStory;\n  /** The format used for compilation (undefined for non-HTML modes). */\n  format?: StoryFormatInfo;\n  /** Collected diagnostics. */\n  diagnostics: Diagnostic[];\n  /** Compilation statistics. */\n  stats: CompileStats;\n}\n\nexport interface CompileStats {\n  passages: number;\n  storyPassages: number;\n  words: number;\n  files: string[];\n}\n\n// --- Passage ---\n\nexport interface SourceLocation {\n  readonly file: string;\n  readonly line: number;\n}\n\nexport interface PassageMetadata {\n  position?: string;\n  size?: string;\n  [key: string]: string | undefined;\n}\n\nexport interface Passage {\n  name: string;\n  tags: string[];\n  text: string;\n  metadata?: PassageMetadata;\n  source?: SourceLocation;\n}\n\n// --- Branded types ---\n\nexport type IFID = string & { readonly __brand: 'IFID' };\n\n// --- Story ---\n\nexport interface Twine1Metadata {\n  settings: Map<string, string>;\n}\n\nexport interface Twine2Metadata {\n  format: string;\n  formatVersion: string;\n  options: Map<string, boolean>;\n  start: string;\n  tags: string;\n  tagColors: Map<string, string>;\n  zoom: number;\n}\n\nexport interface Story {\n  name: string;\n  ifid: IFID;\n  passages: Passage[];\n  legacyIFID: IFID;\n  twine1: Twine1Metadata;\n  twine2: Twine2Metadata;\n}\n\n// --- Readonly story (post-construction) ---\n\nexport type ReadonlyPassage = Readonly<Omit<Passage, 'tags' | 'metadata'>> & {\n  readonly tags: readonly string[];\n  readonly metadata?: Readonly<PassageMetadata>;\n};\n\nexport type ReadonlyStory = Readonly<Omit<Story, 'passages' | 'twine1' | 'twine2'>> & {\n  readonly passages: readonly ReadonlyPassage[];\n  readonly twine1: Readonly<Omit<Twine1Metadata, 'settings'>> & {\n    readonly settings: ReadonlyMap<string, string>;\n  };\n  readonly twine2: Readonly<Omit<Twine2Metadata, 'options' | 'tagColors'>> & {\n    readonly options: ReadonlyMap<string, boolean>;\n    readonly tagColors: ReadonlyMap<string, string>;\n  };\n};\n\n// --- Passage omission (why an output leaves a passage out) ---\n\nexport type OmittingTag = 'Twine.private' | 'script' | 'stylesheet';\n\nexport type PassageOmission =\n  | { readonly kind: 'special-name'; readonly name: 'StoryData' | 'StoryTitle' }\n  | { readonly kind: 'tag'; readonly tag: OmittingTag }\n  | { readonly kind: 'empty-story-settings' };\n\n/** The output whose rules decide which passages a story emits as passages. */\nexport type PassageOutputTarget = 'twine1' | 'twine2';\n\n// --- HTML decompile ---\n\nexport interface DecompileOptions {\n  /**\n   * Trim whitespace at both ends of passage text (and of the Twine 2 story stylesheet and script),\n   * as the Twee lexer does. When false, the stored text is kept exactly. Default: true.\n   */\n  readonly trim?: boolean;\n}\n\n// --- Story inspection ---\n\nexport interface InspectOptions {\n  /**\n   * Check link destinations against this output's passage rules. A link to a passage that the\n   * output leaves out (in Twine 2: `script`, `stylesheet` and `Twine.private` passages,\n   * StoryData, StoryTitle and an empty StorySettings; in Twine 1: `Twine.private` passages) is\n   * then a broken link, and says why. The passages it leaves out also give no links, as their\n   * text never reaches the player, except script passages, which Twine 2 output runs. Without a\n   * target, every source passage gives links, and a link is broken only when no passage has its\n   * name.\n   */\n  readonly target?: PassageOutputTarget;\n}\n\n// --- Story format ---\n\nexport interface StoryFormatInfo {\n  id: string;\n  filename: string;\n  isTwine2: boolean;\n  name: string;\n  version: string;\n  proofing: boolean;\n  author?: string;\n  description?: string;\n  image?: string;\n  url?: string;\n  license?: string;\n}\n\n/**\n * The story format a compile asks for: a directory-style ID (e.g. 'sugarcube-2', which names\n * a format and a major version) or a Twine 2 format name with a version (as StoryData has it).\n */\nexport type FormatRequest =\n  | { readonly kind: 'id'; readonly id: string }\n  | { readonly kind: 'name'; readonly name: string; readonly version: string };\n\nexport interface Twine2FormatJSON {\n  name: string;\n  version: string;\n  proofing?: boolean;\n  source: string;\n  author?: string;\n  description?: string;\n  image?: string;\n  url?: string;\n  license?: string;\n}\n\n/** The result of reading a format.js: its metadata, or why it cannot be used. */\nexport type FormatDecodeResult =\n  { readonly ok: true; readonly data: Twine2FormatJSON } | { readonly ok: false; readonly reason: string };\n\n/**\n * A parsed SemVer version. Build metadata is dropped, since it takes no part in precedence.\n * Each prerelease identifier is kept as written ('beta', '1').\n */\nexport interface SemVer {\n  readonly major: number;\n  readonly minor: number;\n  readonly patch: number;\n  readonly prerelease: readonly string[];\n}\n\n// --- Lexer ---\n\nexport const ItemType = {\n  Error: 0,\n  EOF: 1,\n  Header: 2,\n  Name: 3,\n  Tags: 4,\n  Metadata: 5,\n  Content: 6,\n} as const;\nexport type ItemType = (typeof ItemType)[keyof typeof ItemType];\n\nexport interface LexerItem {\n  type: ItemType;\n  line: number;\n  pos: number;\n  val: string;\n}\n\n// --- Story Format Archive (SFA) ---\n\nexport interface SFAIndexEntry {\n  name: string;\n  version: string;\n  proofing: boolean;\n  files: string[];\n  checksums: Record<string, string>;\n}\n\nexport interface SFAIndex {\n  twine1: SFAIndexEntry[];\n  twine2: SFAIndexEntry[];\n}\n\n/** Options for the network requests that fetch story formats and their indices. */\nexport interface RemoteFetchOptions {\n  /** Aborts the requests; the call then rejects with the signal's reason. */\n  readonly signal?: AbortSignal;\n  /** Milliseconds each request may take before it fails. 0 turns the limit off. Default: 30000. */\n  readonly timeout?: number;\n}\n\n// --- Incremental compilation cache ---\n\nexport interface FileCacheEntry {\n  readonly mtimeMs: number;\n  /**\n   * Identity of the parse options (`trim`, `twee2Compat`) the entry was parsed with. An entry is\n   * reused only when this matches the current options; an entry without it is treated as stale\n   * and reparsed. The value is opaque: leave it to twee-ts to set.\n   */\n  readonly parseOptionsKey?: string;\n  readonly passages: readonly Passage[];\n  readonly diagnostics: readonly Diagnostic[];\n}\n\n// --- Config file ---\n\nexport interface TweeTsConfig {\n  sources?: string[];\n  exclude?: string[];\n  output?: string;\n  outputMode?: OutputMode;\n  formatId?: string;\n  startPassage?: string;\n  formatPaths?: string[];\n  formatIndices?: string[];\n  formatUrls?: string[];\n  useTweegoPath?: boolean;\n  modules?: string[];\n  headFile?: string;\n  trim?: boolean;\n  twee2Compat?: boolean;\n  testMode?: boolean;\n  noRemote?: boolean;\n  /** Milliseconds each story format request may take. 0 turns the limit off. Default: 30000. */\n  formatFetchTimeout?: number;\n  tagAliases?: Record<string, string>;\n  sourceInfo?: boolean;\n  wordCountMethod?: WordCountMethod;\n}\n","/**\n * Twee 3 state-machine lexer implemented as a synchronous generator.\n * Ported from tweelexer.go — Go channels become `yield`.\n */\nimport type { LexerItem } from './types.js';\nimport { ItemType } from './types.js';\n\nconst EOF = -1;\nconst HEADER_DELIM = '::';\nconst NEWLINE_HEADER_DELIM = '\\n::';\n\ntype StateFn = ((ctx: LexerContext) => StateFn | null) | null;\n\nclass LexerContext {\n  readonly input: string;\n  line = 1;\n  start = 0;\n  pos = 0;\n  private items: LexerItem[] = [];\n\n  constructor(input: string) {\n    this.input = input;\n  }\n\n  next(): number {\n    if (this.pos >= this.input.length) return EOF;\n    const ch = this.input.charCodeAt(this.pos);\n    this.pos++;\n    if (ch === 0x0a) this.line++;\n    return ch;\n  }\n\n  peek(): number {\n    if (this.pos >= this.input.length) return EOF;\n    return this.input.charCodeAt(this.pos);\n  }\n\n  backup(): void {\n    if (this.pos > this.start) {\n      this.pos--;\n      if (this.input.charCodeAt(this.pos) === 0x0a) this.line--;\n    } else {\n      throw new Error('backup would leave pos < start');\n    }\n  }\n\n  // Line-counting invariant: next() increments this.line for each newline during\n  // character-by-character scanning. However, Content items are produced by jumping\n  // this.pos directly (e.g. via indexOf) without calling next(), so those newlines\n  // haven't been counted yet. emit() re-counts newlines in [start, pos) for Content\n  // items to compensate. This is safe because this.start is reset to this.pos after\n  // every emit(), so no range is ever counted twice.\n  emit(type: ItemType): void {\n    const val = this.input.slice(this.start, this.pos);\n    this.items.push({ type, line: this.line, pos: this.start, val });\n    if (type === ItemType.Content) {\n      for (let i = this.start; i < this.pos; i++) {\n        if (this.input.charCodeAt(i) === 0x0a) this.line++;\n      }\n    }\n    this.start = this.pos;\n  }\n\n  ignore(): void {\n    for (let i = this.start; i < this.pos; i++) {\n      if (this.input.charCodeAt(i) === 0x0a) this.line++;\n    }\n    this.start = this.pos;\n  }\n\n  acceptRun(valid: string): void {\n    let ch: number;\n    for (ch = this.next(); ch !== EOF && valid.includes(String.fromCharCode(ch)); ch = this.next()) {\n      // consume\n    }\n    if (ch !== EOF) this.backup();\n  }\n\n  errorf(message: string): null {\n    this.items.push({\n      type: ItemType.Error,\n      line: this.line,\n      pos: this.start,\n      val: message,\n    });\n    return null;\n  }\n\n  /** Drain all pending items and return them. */\n  drainItems(): LexerItem[] {\n    const result = this.items;\n    this.items = [];\n    return result;\n  }\n}\n\nfunction acceptQuoted(ctx: LexerContext, quote: number): string | null {\n  for (;;) {\n    const ch = ctx.next();\n    switch (ch) {\n      case 0x5c: {\n        // backslash\n        const r = ctx.next();\n        if (r !== 0x0a && r !== EOF) break;\n        // fall through\n      }\n      // falls through\n      case 0x0a:\n      case EOF:\n        return 'unterminated quoted string';\n      default:\n        if (ch === quote) return null;\n        break;\n    }\n  }\n}\n\n// --- State functions ---\n\nfunction lexProlog(ctx: LexerContext): StateFn {\n  if (ctx.input.startsWith(HEADER_DELIM, ctx.pos)) {\n    return lexHeaderDelim;\n  }\n  const i = ctx.input.indexOf(NEWLINE_HEADER_DELIM, ctx.pos);\n  if (i > -1) {\n    ctx.pos = i + 1; // skip to the newline, then past it\n    ctx.ignore();\n    return lexHeaderDelim;\n  }\n  ctx.emit(ItemType.EOF);\n  return null;\n}\n\nfunction lexContent(ctx: LexerContext): StateFn {\n  if (ctx.input.startsWith(HEADER_DELIM, ctx.pos)) {\n    return lexHeaderDelim;\n  }\n  const i = ctx.input.indexOf(NEWLINE_HEADER_DELIM, ctx.pos);\n  if (i > -1) {\n    ctx.pos = i + 1;\n    ctx.emit(ItemType.Content);\n    return lexHeaderDelim;\n  }\n  ctx.pos = ctx.input.length;\n  if (ctx.pos > ctx.start) {\n    ctx.emit(ItemType.Content);\n  }\n  ctx.emit(ItemType.EOF);\n  return null;\n}\n\nfunction lexHeaderDelim(ctx: LexerContext): StateFn {\n  ctx.pos += HEADER_DELIM.length;\n  ctx.emit(ItemType.Header);\n  return lexName;\n}\n\nfunction lexName(ctx: LexerContext): StateFn {\n  let r: number;\n  outer: for (;;) {\n    r = ctx.next();\n    switch (r) {\n      case 0x5c: {\n        // backslash\n        const next = ctx.next();\n        if (next !== 0x0a && next !== EOF) break;\n        // fall through to terminators\n        r = next;\n      }\n      // falls through\n      case 0x5b: // [\n      case 0x5d: // ]\n      case 0x7b: // {\n      case 0x7d: // }\n      case 0x0a: // \\n\n      case EOF:\n        if (r !== EOF) ctx.backup();\n        break outer;\n    }\n  }\n  // Always emit a name item, even if empty.\n  ctx.emit(ItemType.Name);\n\n  switch (r) {\n    case 0x5b:\n      return lexTags; // [\n    case 0x5d:\n      return ctx.errorf(`unexpected right square bracket ']'`);\n    case 0x7b:\n      return lexMetadata; // {\n    case 0x7d:\n      return ctx.errorf(`unexpected right curly brace '}'`);\n    case 0x0a: // newline\n      ctx.pos++;\n      ctx.ignore();\n      return lexContent;\n  }\n  ctx.emit(ItemType.EOF);\n  return null;\n}\n\nfunction lexNextOptionalBlock(ctx: LexerContext): StateFn {\n  // Consume whitespace.\n  ctx.acceptRun(' \\t');\n  ctx.ignore();\n\n  const r = ctx.peek();\n  switch (r) {\n    case 0x5b:\n      return lexTags; // [\n    case 0x5d:\n      return ctx.errorf(`unexpected right square bracket ']'`);\n    case 0x7b:\n      return lexMetadata; // {\n    case 0x7d:\n      return ctx.errorf(`unexpected right curly brace '}'`);\n    case 0x0a: // newline\n      ctx.pos++;\n      ctx.ignore();\n      return lexContent;\n    case EOF:\n      ctx.emit(ItemType.EOF);\n      return null;\n  }\n  return ctx.errorf(`illegal character '${String.fromCharCode(r)}' amid the optional blocks`);\n}\n\nfunction lexTags(ctx: LexerContext): StateFn {\n  // Consume the left delimiter '['.\n  ctx.pos++;\n\n  for (;;) {\n    const r = ctx.next();\n    switch (r) {\n      case 0x5c: {\n        // backslash\n        const next = ctx.next();\n        if (next !== 0x0a && next !== EOF) break;\n        // fall through\n      }\n      // falls through\n      case 0x0a:\n      case EOF:\n        if (r === 0x0a) ctx.backup();\n        return ctx.errorf('unterminated tag block');\n      case 0x5d: // ]\n        if (ctx.pos > ctx.start) ctx.emit(ItemType.Tags);\n        return lexNextOptionalBlock;\n      case 0x5b: // [\n        return ctx.errorf(`unexpected left square bracket '['`);\n      case 0x7b: // {\n        return ctx.errorf(`unexpected left curly brace '{'`);\n      case 0x7d: // }\n        return ctx.errorf(`unexpected right curly brace '}'`);\n    }\n  }\n}\n\nfunction lexMetadata(ctx: LexerContext): StateFn {\n  // Consume the left delimiter '{'.\n  ctx.pos++;\n\n  let depth = 1;\n  for (;;) {\n    const r = ctx.next();\n    switch (r) {\n      case 0x22: {\n        // double quote\n        const err = acceptQuoted(ctx, 0x22);\n        if (err) return ctx.errorf(err);\n        break;\n      }\n      case 0x0a: // newline\n        ctx.backup();\n      // falls through\n      case EOF:\n        return ctx.errorf('unterminated metadata block');\n      case 0x7b: // {\n        depth++;\n        break;\n      case 0x7d: // }\n        depth--;\n        if (depth === 0) {\n          if (ctx.pos > ctx.start) ctx.emit(ItemType.Metadata);\n          return lexNextOptionalBlock;\n        }\n        break;\n    }\n  }\n}\n\n/**\n * Twee 3 lexer — yields LexerItem tokens from Twee source text.\n *\n * In the Go reference, this uses goroutines and channels.\n * Here we use a synchronous generator that accumulates items per state step.\n */\nexport function* tweeLexer(input: string): Generator<LexerItem, void, undefined> {\n  const ctx = new LexerContext(input);\n  let state: StateFn = lexProlog;\n  while (state !== null) {\n    state = state(ctx);\n    const items = ctx.drainItems();\n    for (const item of items) {\n      yield item;\n    }\n  }\n}\n\n/** Convenience class wrapper for the lexer generator. */\nexport class TweeLexer {\n  private gen: Generator<LexerItem, void, undefined>;\n\n  constructor(input: string) {\n    this.gen = tweeLexer(input);\n  }\n\n  nextItem(): { item: LexerItem; done: boolean } {\n    const result = this.gen.next();\n    if (result.done) {\n      return { item: { type: ItemType.EOF, line: 0, pos: 0, val: '' }, done: true };\n    }\n    return { item: result.value, done: false };\n  }\n\n  *[Symbol.iterator](): Generator<LexerItem, void, undefined> {\n    yield* this.gen;\n  }\n}\n","/**\n * Twee2 to Twee3 header syntax conversion.\n * Ported from twee2compat.go.\n */\n\nconst twee2DetectRe = /^:: *[^[]*?(?: *\\[.*?\\])? *<(.*?)> *$/m;\nconst twee2HeaderRe = /^(:: *[^[]*?)( *\\[.*?\\])?(?: *<(.*?)>)? *$/gm;\nconst twee2BadPosRe = /^(::.*?) *\\{\"position\":\" *\"\\}$/gm;\n\nfunction hasTwee2Syntax(s: string): boolean {\n  return twee2DetectRe.test(s);\n}\n\n/**\n * Convert Twee2-style position blocks `<x,y>` to Twee3 metadata blocks `{\"position\":\"x,y\"}`.\n */\nexport function twee2ToV3(s: string): string {\n  if (!hasTwee2Syntax(s)) return s;\n  let result = s.replace(twee2HeaderRe, (_, p1: string, p2: string | undefined, p3: string | undefined) => {\n    const tags = p2 ?? '';\n    const pos = p3 ?? '';\n    return `${p1}${tags} {\"position\":\"${pos}\"}`;\n  });\n  result = result.replace(twee2BadPosRe, '$1');\n  return result;\n}\n","/**\n * Parse lexer items into Passage[].\n * Ported from storyload.go:loadTwee().\n */\nimport type { Passage, PassageMetadata, Diagnostic } from './types.js';\nimport { ItemType } from './types.js';\nimport { tweeLexer } from './lexer.js';\nimport { tweeUnescape } from './escape.js';\nimport { twee2ToV3 } from './twee2-compat.js';\nimport { normalizeTweeSourceText } from './source-text.js';\n\nexport interface ParseOptions {\n  /** Filename for diagnostics. */\n  filename?: string;\n  /** Trim whitespace from passage content. Default: true. */\n  trim?: boolean;\n  /** Enable Twee2 compatibility. Default: false. */\n  twee2Compat?: boolean;\n}\n\nexport interface ParseResult {\n  passages: Passage[];\n  diagnostics: Diagnostic[];\n}\n\n/**\n * Parse Twee source text into passages.\n *\n * The source is normalized first, as files are when they are read: a leading UTF-8 BOM is\n * removed and CRLF and bare CR line endings become LF. A BOM at the start of a later line,\n * directly before `::` (left there by concatenating files), is removed too, so that line\n * stays a passage header.\n */\nexport function parseTwee(source: string, options: ParseOptions = {}): ParseResult {\n  const { filename = '<inline>', trim = true, twee2Compat = false } = options;\n  const diagnostics: Diagnostic[] = [];\n\n  const normalized = normalizeTweeSourceText(source);\n  const tweeSource = twee2Compat ? twee2ToV3(normalized) : normalized;\n\n  const passages: Passage[] = [];\n  let current: Passage | null = null;\n  let pCount = 0;\n  let lastType: ItemType = ItemType.EOF;\n\n  for (const item of tweeLexer(tweeSource)) {\n    switch (item.type) {\n      case ItemType.Error:\n        diagnostics.push({\n          level: 'error',\n          message: `line ${item.line}: Malformed twee source; ${item.val}.`,\n          file: filename,\n          line: item.line,\n        });\n        // Fatal: return what we have\n        return { passages, diagnostics };\n\n      case ItemType.EOF:\n        if (pCount > 0 && current) {\n          passages.push(current);\n        }\n        return { passages, diagnostics };\n\n      case ItemType.Header:\n        pCount++;\n        if (pCount > 1 && current) {\n          passages.push(current);\n        }\n        current = { name: '', tags: [], text: '', source: { file: filename, line: item.line } };\n        break;\n\n      case ItemType.Name: {\n        if (!current) break;\n        const name = tweeUnescape(item.val).trim();\n        if (name.length === 0) {\n          diagnostics.push({\n            level: 'error',\n            message: `line ${item.line}: Malformed twee source; passage with no name.`,\n            file: filename,\n            line: item.line,\n          });\n          return { passages, diagnostics };\n        }\n        current.name = name;\n        break;\n      }\n\n      case ItemType.Tags: {\n        if (!current) break;\n        if (lastType !== ItemType.Name) {\n          diagnostics.push({\n            level: 'error',\n            message: `line ${item.line}: Malformed twee source; optional tags block must immediately follow the passage name.`,\n            file: filename,\n            line: item.line,\n          });\n          return { passages, diagnostics };\n        }\n        // Strip the surrounding [ and ]\n        const inner = item.val.slice(1, -1);\n        current.tags = tweeUnescape(inner).split(/\\s+/).filter(Boolean);\n        break;\n      }\n\n      case ItemType.Metadata: {\n        if (!current) break;\n        if (lastType !== ItemType.Name && lastType !== ItemType.Tags) {\n          diagnostics.push({\n            level: 'error',\n            message: `line ${item.line}: Malformed twee source; optional metadata block must immediately follow the passage name or tags block.`,\n            file: filename,\n            line: item.line,\n          });\n          return { passages, diagnostics };\n        }\n        try {\n          // The lexer only emits a metadata item that starts with `{` and ends with its closing `}`,\n          // so a successful parse is always an object.\n          const parsed = JSON.parse(item.val) as Record<string, unknown>;\n          const meta: PassageMetadata = {};\n          for (const [key, value] of Object.entries(parsed)) {\n            if (typeof value === 'string') {\n              meta[key] = value;\n            }\n          }\n          current.metadata = meta;\n        } catch (e) {\n          diagnostics.push({\n            level: 'warning',\n            message: `load ${filename}: line ${item.line}: Malformed twee source; could not decode metadata (reason: ${e instanceof Error ? e.message : String(e)}).`,\n            file: filename,\n            line: item.line,\n          });\n        }\n        break;\n      }\n\n      case ItemType.Content: {\n        if (!current) break;\n        if (trim) {\n          current.text = item.val.trim();\n        } else {\n          // Per spec: trailing blank lines MUST be stripped regardless of trim option\n          current.text = item.val.replace(/\\n\\s*$/, '');\n        }\n        break;\n      }\n\n      default: {\n        const _exhaustive: never = item.type;\n        diagnostics.push({\n          level: 'error',\n          message: `line ${item.line}: Unhandled lexer item type: ${_exhaustive}.`,\n          file: filename,\n          line: item.line,\n        });\n        return { passages, diagnostics };\n      }\n    }\n\n    lastType = item.type;\n  }\n\n  // Shouldn't reach here (EOF is always emitted), but just in case:\n  if (pCount > 0 && current) {\n    passages.push(current);\n  }\n  return { passages, diagnostics };\n}\n","// Adapted from https://github.com/mathiasbynens/he/blob/36afe179392226cf1b6ccdb16ebbb7a5a844d93a/src/he.js#L106-L134\n/**\n * C1 Unicode control character reference replacements (code points 128–159).\n * Index i gives the replacement for code point 128+i; 0 means \"no replacement\".\n */\nconst c1 = [\n    8364, 0, 8218, 402, 8222, 8230, 8224, 8225, 710, 8240, 352, 8249, 338, 0,\n    381, 0, 0, 8216, 8217, 8220, 8221, 8226, 8211, 8212, 732, 8482, 353, 8250,\n    339, 0, 382, 376,\n];\n/**\n * True for NUL, UTF-16 surrogates, and values past U+10FFFF.\n * @param codePoint Unicode code point to check.\n */\nfunction isInvalidCodePoint(codePoint) {\n    return (codePoint === 0 ||\n        (codePoint >= 0xd8_00 && codePoint <= 0xdf_ff) ||\n        codePoint > 0x10_ff_ff);\n}\n/**\n * Replace the given code point with U+FFFD if it is NUL (0), a surrogate, or\n * outside the valid Unicode range. Code points in the C1 controls range\n * (128–159) are remapped to their Windows-1252 equivalents, following the\n * HTML spec. All other code points are returned unchanged.\n * @param codePoint Unicode code point to convert.\n */\nexport function replaceCodePoint(codePoint) {\n    if (isInvalidCodePoint(codePoint)) {\n        return 0xff_fd;\n    }\n    if (codePoint >= 128 && codePoint <= 159) {\n        return c1[codePoint - 128] || codePoint;\n    }\n    return codePoint;\n}\n/**\n * XML numeric character references are the referenced Unicode code point.\n * Invalid values still become U+FFFD; the HTML Windows-1252 C1 remap is not\n * applied.\n * @see https://www.w3.org/TR/xml/#NT-CharRef\n * @param codePoint Unicode code point to convert.\n */\nexport function replaceCodePointXML(codePoint) {\n    return isInvalidCodePoint(codePoint) ? 0xff_fd : codePoint;\n}\n/**\n * Convert the code point of a decoded numeric entity to a string, replacing\n * invalid values.\n *\n * Fast path for plain BMP code points: [1..0x7F] and [0xA0..0xD7FF] pass\n * `replaceCodePoint` unchanged (no NUL, C1 remap, surrogate, or out-of-range\n * handling) and fit a single charCode. 0xd760 = 0xD800 (the first surrogate)\n * - 0xA0.\n * @param codePoint Unicode code point to convert.\n */\nexport function codePointToString(codePoint) {\n    return (codePoint - 1) >>> 0 < 0x7f || (codePoint - 0xa0) >>> 0 < 0xd7_60\n        ? String.fromCharCode(codePoint)\n        : String.fromCodePoint(replaceCodePoint(codePoint));\n}\n//# sourceMappingURL=decode-codepoint.js.map","/*\n * Inverse of the encoder's SAFE alphabet (0x21..0x7E minus 0x22, 0x24, 0x5C),\n * precomputed once at module load. Entries for excluded chars stay 0 but\n * are never read.\n */\nconst BASE91_INVERSE = /* #__PURE__ */ (() => {\n    const table = new Uint8Array(127);\n    let code = 0;\n    for (let char = 0x21; char <= 0x7e; char++) {\n        if (char !== 0x22 && char !== 0x24 && char !== 0x5c) {\n            table[char] = code++;\n        }\n    }\n    return table;\n})();\n/**\n * Decode a dictionary-encoded trie string back into its Uint16Array.\n *\n * Stream layout (consumed in this order):\n *   1. dict1 atoms — `dict1AtomCount` uint16 values, delta+RLE encoded.\n *   2. dict2 atoms — `atomCount - dict1AtomCount` values, delta+RLE.\n *   3. dict2 ngrams — `ngramCount - (dictSize - dict1AtomCount)` entries,\n *      each a pair of slot codes that resolve to earlier slots.\n *   4. dict1 ngrams — `dictSize - dict1AtomCount` entries, same shape.\n *   5. data — slot codes, each expanding to one or more uint16 values.\n *\n * Codes use a 91-char base (printable ASCII minus `\"`, `$`, `\\`):\n *   - char1 < dictSize  → 1-char code, slot = char1\n *   - char1 ≥ dictSize  → 2-char code, slot = dictSize + (char1 - dictSize)*91 + char2\n *\n * Slot index → token kind:\n *   [0, A)                  dict1 atoms     (1-char codes)\n *   [A, dictSize)           dict1 ngrams    (1-char codes)\n *   [dictSize, dictSize+D)  dict2 atoms     (2-char codes)\n *   [dictSize+D, end)       dict2 ngrams    (2-char codes)\n *\n * Both atom dicts decode before any ngram, and dict2 ngrams decode before\n * dict1 ngrams. So every ngram entry references slots whose contents are\n * already filled — no forward references to handle.\n *\n * This runs on library import. Flat typed arrays store each slot as either\n * a plain value (`single`, covering every atom) or a range in a shared\n * `pool` (ngrams).\n * @param input Packed trie string.\n * @param resultLength Expected number of uint16 values in the output.\n * @param atomCount Total number of distinct uint16 values in the trie.\n * @param dict1AtomCount Atoms in the 1-char range (`A` above).\n * @param ngramCount Total number of ngram entries (dict1 + dict2).\n * @param dictSize Number of 1-char code slots; the rest of `BASE - dictSize`\n *   first-byte values are 2-char codes.\n */\nexport function decodeTrieDict(input, resultLength, atomCount, dict1AtomCount, ngramCount, dictSize) {\n    const base = 91;\n    const inputLength = input.length;\n    // For 2-char codes, slot = char1 * base - twoCharBias + char2.\n    const twoCharBias = dictSize * (base - 1);\n    let pos = 0;\n    /** Read one slot code at `pos` and return its slot index, advancing pos. */\n    const readSlotCode = () => {\n        const c1 = BASE91_INVERSE[input.charCodeAt(pos++)];\n        return c1 < dictSize\n            ? c1\n            : c1 * base - twoCharBias + BASE91_INVERSE[input.charCodeAt(pos++)];\n    };\n    const dict2AtomCount = atomCount - dict1AtomCount;\n    const slotCount = atomCount + ngramCount;\n    /*\n     * Per-slot contents: atoms (always a single value) live directly in\n     * `single`; ngram slots hold -1 there and expand to\n     * `pool[start[slot] .. start[slot] + length[slot])`.\n     */\n    const single = new Int32Array(slotCount);\n    single.fill(-1, dict1AtomCount, dictSize);\n    single.fill(-1, dictSize + dict2AtomCount, slotCount);\n    const start = new Int32Array(slotCount);\n    const length = new Int32Array(slotCount);\n    /**\n     * Decode `count` ascending uint16 values from a delta+RLE stream into\n     * `single[off..off+count)`.\n     *\n     *   code < 89   → delta = code\n     *   code == 89  → run-length: next char encodes runLength-2; emit `runLength` consecutive +1 values\n     *   code == 90, next < 90  → escape: delta = 89 + next * BASE + after-next\n     *   code == 90, next == 90 → double-escape: extra char for very large deltas\n     * @param count\n     * @param off\n     */\n    function decodeDelta(count, off) {\n        let previous = 0;\n        let slot = off;\n        const end = off + count;\n        while (slot < end) {\n            const code = BASE91_INVERSE[input.charCodeAt(pos++)];\n            if (code < 89) {\n                previous += code;\n                single[slot++] = previous;\n            }\n            else if (code === 89) {\n                let runLength = BASE91_INVERSE[input.charCodeAt(pos++)] + 2;\n                while (runLength--)\n                    single[slot++] = ++previous;\n            }\n            else {\n                const next = BASE91_INVERSE[input.charCodeAt(pos++)];\n                previous +=\n                    89 +\n                        // eslint-disable-next-line unicorn/prefer-minimal-ternary -- branches read a different number of side-effecting input bytes\n                        (next < 90\n                            ? next * base + BASE91_INVERSE[input.charCodeAt(pos++)]\n                            : BASE91_INVERSE[input.charCodeAt(pos++)] * 8281 +\n                                BASE91_INVERSE[input.charCodeAt(pos++)] * base +\n                                BASE91_INVERSE[input.charCodeAt(pos++)]);\n                single[slot++] = previous;\n            }\n        }\n    }\n    // Streams 1 & 2: atoms decoded into their slot ranges.\n    decodeDelta(dict1AtomCount, 0);\n    decodeDelta(dict2AtomCount, dictSize);\n    /*\n     * Streams 3 & 4 are read in two passes: first collect every ngram's two\n     * references and derive its expanded length (each ref resolves to an earlier\n     * slot, so lengths are already known), which sizes the shared pool.\n     * Pool ranges are handed out in decode order, so the second pass fills\n     * the pool contiguously with a single write cursor.\n     */\n    const references = new Int32Array(ngramCount * 2);\n    let poolSize = 0;\n    let ngramIndex = 0;\n    /**\n     * Read `count` ngram entries (each = 2 slot-code references) for the slots\n     * starting at `startSlot`, recording references and assigning pool ranges.\n     * @param count\n     * @param startSlot\n     */\n    function readNgramReferences(count, startSlot) {\n        for (let index = 0; index < count; index++) {\n            const slot = startSlot + index;\n            const a = readSlotCode();\n            const b = readSlotCode();\n            references[ngramIndex * 2] = a;\n            references[ngramIndex * 2 + 1] = b;\n            ngramIndex += 1;\n            start[slot] = poolSize;\n            const entryLength = (single[a] < 0 ? length[a] : 1) +\n                (single[b] < 0 ? length[b] : 1);\n            length[slot] = entryLength;\n            poolSize += entryLength;\n        }\n    }\n    readNgramReferences(ngramCount - dictSize + dict1AtomCount, dictSize + dict2AtomCount);\n    readNgramReferences(dictSize - dict1AtomCount, dict1AtomCount);\n    // Second pass: concatenate each ngram's two halves into the pool.\n    const pool = new Uint16Array(poolSize);\n    let write = 0;\n    for (let index = 0; index < ngramIndex; index++) {\n        for (let half = 0; half < 2; half++) {\n            const source = references[index * 2 + half];\n            const value = single[source];\n            if (value < 0) {\n                let read = start[source];\n                const readEnd = read + length[source];\n                while (read < readEnd)\n                    pool[write++] = pool[read++];\n            }\n            else {\n                pool[write++] = value;\n            }\n        }\n    }\n    // Stream 5: data. Each code expands to its slot's stored values.\n    const out = new Uint16Array(resultLength);\n    let outIndex = 0;\n    while (pos < inputLength) {\n        let slot = BASE91_INVERSE[input.charCodeAt(pos++)];\n        if (slot >= dictSize) {\n            slot =\n                slot * base -\n                    twoCharBias +\n                    BASE91_INVERSE[input.charCodeAt(pos++)];\n        }\n        const value = single[slot];\n        if (value < 0) {\n            let read = start[slot];\n            const readEnd = read + length[slot];\n            while (read < readEnd)\n                out[outIndex++] = pool[read++];\n        }\n        else {\n            out[outIndex++] = value;\n        }\n    }\n    return out;\n}\n//# sourceMappingURL=decode-shared.js.map","// Generated using scripts/write-decode-map.ts\nimport { decodeTrieDict } from \"../internal/decode-shared.js\";\n/** Packed HTML decode trie data. */\nexport const htmlDecodeTree = /* #__PURE__ */ decodeTrieDict(\"!}.&u%}'&}*'~!6*)%&,~!J~!J~%L~y<~!R,~~%Lu~~#GD~~#|)1#%}^%}2%+#.##%##%}&%##%'#%##&%#%#'%#&#%#&#'#%%#&#%##%#)%''%&%#%#'%#%%#%%}%%%#%#&(23#%%#&-%0%('1#(##%#'##+%'*.:1}#%#6-+(%'%%#%%%}#L'2351&('%}&/N'(0(/*-%(%%}#'+&T%7.2}#&%&#%#36/5##%&%%#&#%%#))2%%##%&&'0~!#*+&'%1~!%).'3q?&%'1~!.##%6(~!+%%%(Gw'rT~!E#<nA%#jZ~!H%(~!42##~!*31&~!G%U~#)5~#`3~!J~!Z~%]~%Y~%C~!q~!u~#kz~%#~!6'~!D~!U~!?~#T~!c%~!G#'~%7|~!G~!J~!G&~#pb~(Df}#%}*&}#%##%##%##&#-}&'#'&%#.++}%mI,#,@&(}*%}*'%&##&#%##%}&0}#.},U},%}+%}&%}#%##&}B%(}(%}+%)})%##%#&}&%##%&}<%}>%#%&}*%}(%}9%}/%})%}*%}*%}?&}&%}3%}&*#%})%#%#)}#&#-#+*%E%%'%'#%}#*V##&##I}#&&##%&%#&&Qf%%))w/0+&%#(#.%-''''++++7}>%4'',##1,#%#&%##&#'##&#*#9)%&%}#*}%,#+P(%A&%#'&##wSD',9E00#y#@}(+}&%&>~!#~!X}#*}(&&}(&}(,%}%&#+&}#&}I%#%}%)#(},'%#*}4%%#%}(''}#/##(##),%-##%%)#&}(.}&%#&}%%}*&#%},&&}&%}#%*'#%})%}D&}&%}-&}6&#&}-,%}#%})-(~+`~,=?~I9'9%~!,#%})%})%}@%}?%}(~!?~#<~#pP~#BG~#=1#%K+~#?#~%;)~#A~#mF1~#A'~'X%'~#lR~#N~'N~#r~#m#-~#i'?%#'%~#B%##%,%#~#_%#0%~#]732~,w~2+#:&#%&'0%&>%}#>##F+)#%&&#(+_}4&}-%}(&}@&}O7Fdf0@+/v4}&WU##&/0#&'('B#%}.%}'+#%}#%%&#&%#%##+#&#)#6#'#.},%}c%},%#%##%&#&%#&~#>'*-.%##%##%}#%%}%'~#)D1}#%*&~#_%%'(~#S2%'.}#~#=##*'*-%}&'%'##&&~'E%.#&~#M4}%%##&'%#~#O1##%&#'+~#<B%##%%'%+~#;#@%}#&%#&&%#(~#H1}'%'##&&~#?A}&'~#D#%32}'&&&&~#[}'(#%}'~#;C})&}%%#%~#=&%,3}%'(#%%~#^'#&&)#%'~#Y%-~#d-%'~#^%%&#&&&}#~#b~2t*&'~&(~&@~0%~e~3}%*''0})&}+~!9##-}#%-hD*)1fC#%/&/fB#40~!+#)*4~!+~!K'&:~!/*7~!.#~!H~!L':~%x&~!H#~!*~%1~!I#~!+A~#p'~!F~~#-#~,,(~.Z~!V~%;'B'mq-W~!N~%I%#&&#&}#%},%%}'%}+X#%}#&}(%}'%}<%}#%}%%'}'%}:~![)9@~%>~#UA%-%##&~!C%~!-.9:~!1~!-^2/:a~!y,D*J#-5)/4~%23,~#G~!L1~!0X3`~!2+~!!0-~&E~!W~!o,>Y&]~%cZx_&~#O*9#A#'#+I'%#)~!0B*-5A+-((F&*M#)(-7-5+'-3a5Vi~!Y~!?+[)%3),ERHm~!+:D,VG.+)?fB%%*(%)'(#&80%1'8`K8?`+'Z#&O&'H5#*9)A%%5&3))0%39+.*7#()&&*=4@**L)<'_&*+..;(#*+)./&0#3)%')-8(4ixD(&.}%,('aI:,)%,k2231T)I'#/-W7,/'Q#.'Y24+h')37</31&83##&0#),H(?'&?/1##%#&&#%''-%&&&#(&''&#.-'%#%%(,')*'&#&#'##%(%(#%('#&##%%%%('%#%#%%#%#&%##h>w+v<ayvyvcg.uuhKr}g/v|g>u9i[~>g5uI~=RvdwEg;v/g;uk!!TTSx]@RT!U!#!@VBRUU!'UTe-d0c`e&gSdicedFcrdTaqb.kYcAohdYd@a3e+d}dMdtd.aJ#bqcK`dle/e.e'dwdPdodddjbEb}ogd^ofdpduc6j?l%d{drdqc)d7bacOdQ%T#Y)X.sR[yH>6Vyv3[xwLu>vo'!*.[yBacahoj>6Rew3[xqdZa#!a&#^(X-[yG>6Vyu3[xvg3sEr|g.u/Ri9db0T#^(Xa)!-[y;>6Vylg4wKs{JwNZt3@3r=c4Z([xlg;wKt!cpq's@v7A'*a(a+!-a#[y<3Dt?3Dt'>6Vym3[xmg9rxsNJwLZt4~?r?db1T#`-!(Xa,!0[yS>6Vz%NuQs.g4wKtnJwNZtS@3r>c4Z([y%g;wKtrdga8!a(!#&T*Y-Xa#!a0<or[yc3Dtq>6Vz43[y3JwNZtf@3s!Ju}!%Dti:pm3c_%X#tjB5pkd6q!r]u?voC'*-a.a2!0a&a+[yI3DtI3Ds~3DtH>6Vyw3[xx;:s#~<5pKJwNZtE@3r~d`a)!a2T#a.(!+U.X1[yT3Dt`3Dtv>6Vz&3[y&g9rxwzcxstPu.<rAJwLZtT~?r@dZa%!a.&^*Za(/Reu[ya>6Vz23[y1g3sEr}wkg{NuQRg{ci(U#5@b`~,cg#U(2WnH5wugcRh7dX#T(Y,a'Ta!!a,[yZ<]mj>6Vz,3[y+Pv#5ReZKu+=,%!H}7ABwkaS?Rh:BcW(X#<]mrj:ubv/ARekdg%!(!a.*Ta(Y.X1!#sP>Rl*Dt6[y>>6Vyo3Wf*jOvuumvuRgRJuq*!:9<B@bX~3jVv&v@s@5Re[d/rQt{uAvo&a&a*)a2!,0Wf!3Dt0=Bs'>6Re}3[xy~<5s%JwJZt1~Gs)c;&!#2sJkNuXvzq7rxu,Re8dka4!a8(aEZ+a@Y.X1Xa)[yd=Bs(3DtP>6Vz53[y4cX#X&Re:avRe9~<5s&JwJZtQ~Gs*i^rzvdRg+Jv{%!2sbB@bX}kdga,!Za?&^*T1/!a'Dt+[y6>6Vyf3Wf%g/u;s4hGu6?Rh-JvZ,!c%#&RoX54Rivj7uyvf8RgTKvZB%*!2sGh<vu5Rgq<=C::9bb~#dZ#T&Ta6Y.X*Dt>[y93Wf)coZ(T,6VyifluvRgC@95@B@bX~/hFu34cC#T,k/unq8w8Q5RkUklwQuzunq8w8Q5Rk8d/rJu?v8w9)-&!a0a;a&aIWejg3sEr/h1s<DtDJvyZqY5aws3Jvy!&Wei~Hr1:au5@Bag>23E~5c:Z&bX};kKv?w&unuVu5Rjc;>bs)#~@:Rh.=ay<a]C;b`}Vd6s/t{uAvoaxa()!a,a7%-a#a2Dt,[yF2Wo[>6Vyt3[xuNuPRi&NuPwpi#RoWh?vf8Ri%Jv]!%Ri:KvxD!.'2WeAjZu`q9rxu,Re7woeAg-unLq(qA_/*2Wg_g3u5q^9:4E}/jTrxrzv=Wkkd~0UX#^^Xa-a1a5T&a=U1a'*aEa]!a*aPaA-adok[y54Rn>;:p3~Dp5g9rpsFNvZqjg3uJp4~<5p0Pw;5qlJwNZt*@3p1Pw:5p/Ou!5p2JvG'!6Vye=<qnJvh_[xhg3v,Rh3kOwOw-sDuev/Re^dha[a%!%!a+#Ta7)-5TaCaO!aka!a)sf[yb2>Rl!9ARiq5E}Qg=ucRkBE|oJrJ_@Wk~@Wk{JrJ_@Wk|@WkyJrJ_@Wk}@WkzJvO_[y2g-vMRmiKuYC!)&>Ri;>Ri<@3RkNc](X#@9Rk=g5vuRmhKvDB!+'=]meg3u4Rmgd)#Y'Vz3CARmfd`a+!%T'!+#Ta1Ta6TaM-sTDt9[yA9sYd'%Y#s[[xpj:ueunaXRgEjRq,v-vuqdd2'`#6Rev<32@5>:2<E}5xIo9a*X#Y(;5RePJvD_g>vyRgNj8w)v8<wggs:RgXiZt|vjx,hSq3ah!-(~@:Ro/Ou!5RhWj^v(pyw8unRhUdx-UY#^Ua.a3a70!)%UX1TaDa)'omRiRRhE[y:3Dsz=Br,>6Vyj3[xkg6ruwjcqsrPw;5r*Ku]D'Zt-@3r(~?r.i[vwv]dU1a--U#`a4(g/vsRhPOu!5RhLj:rmu9Wo!~@:wdh@g/vsRiTjXuvvNr}:RhBj^v(pyw8unRn]dz1UYa'a+^Y(!aETZalaRY.Ta?a4[yDJw1!#qLsW>6Vyrfzq-pLflpwRe|Js>%!Dt@3Dt&Jvy_[xs~HrnjMuwpsw'RecKu+D#'!t<~Grl~?rjg5u-x,gwp{ah!-(~@:Rg~Ou!5Rh'jXuvvNr}:Rh#cW#X/c;&!#2sLi[v7u7RgpJv)(!iLrxu,Re6j7v@s@5Se[e7d`aW!Za(a`T.a#!a3!&aDa-!9)Dt_=6s+3[x~~DR|h~DS6avhGun5RkZj3w)v-]mkKunB!&*]kb97R|i<ARk<c:Z(6Vy}Juh'!wziMRoS:F|vkLuauJv5vtvQRh1d='T+Y#VyO~DR|jcF#T'7R|g97R|kJv3'!ay<Rj,Jvh&!:ReXcsa6*a+#a#_aIRf9aLRf?c,Z&Rf5Rf7c.Z&Rf;Rf>cQ#%T'p-Rf8Rf=ct#%'(*!,p,Rf4p+Rf6Rf:Rf<d~'Ua%U*^UYa(!a,-!#a4YaTalaEX0a8a<Weo3Dt/3Dsx=Br93Wen~Dr;~<5p<JwNZt2@3p=Pw:5p;Ou!5r3c7&!#:p>3Ds}KvGB)_6Vyk2sM=<r7x'eovA(!hFu1ARf}cV#X&@r5j6rvwQa^Rf3c=Za'wkghJv__g;unRggA53B9=b^}%j6uduo5Jq;!(hIv%2Re`Ou4ARe_e%a#^^^Xa&!a*a2!&a6YaP!*ad!#a:aE/5Rn?[y@>6Vyp;:pE~DrY~<5pBJwNZt8@3pCh=rt3rWPw:5pAJup_[xoNuPpF9c!#'45pD5ARn)d8#X'X*3@rU72s]h>v<<sSjJpqvewOJq/(!hNw'5ReBk0s2u3w/w'5ReE5@Jq.!a+JQ!&WeU23d(#Y&RjG5]jBk!u7w&u0udARjEe#+^^^Ub#!a2/a`Z(agT1!a-a;|@TaG!aS[yV=Re~fow'RguNuPRe?bz#'>RoUWeL>:Cbb|?JwPZtVg6ruRmzJvD'!6Vz(g/vmRh~Jvy_[y(g9voRgyx*cy(#2>Ri2B9b]~9kIw9u7rluJu3Rg]dI#a%UY'@=p%CAx.gQZ&RhwwygtRm{x5g_Z'+ABqR9Woa=Bp&dV#^*Xa'!&@o{g4v]Rk;Jv{!%Rk[wkkiA5RkiwwfUB=x,fUuqC&*!>RfTg8v0RfV~ARfSd;rJsAuAv9wR'ae+/aO!a@aza/a#[yQ@Wg!2Wemg3sEr0JvB_g>uvReWg2v+Re=KupB_+[y!2AbY~-~Hr2AJwD!(h<~El>h<~El?Kun@+_:9b`}Kg-v/Ri3g;vtwyk_9]k_d=&T#*U.6qh@Ab`|K9:H|CJv[!&3Dtex'fDwC%!Rf[9WlMd[(^X,!a%Z06Vz!@WgBg=v~Rgvg,QRe@awd,#Y+jTv|Q~EfWj]uNr|~FRfXdy#Y&^Ua%!aO.!(a)Ua;=!a@aKap!a-,a!Ta]a[rSa]p?[y82sK=Bq~;:p:~<5p8Pw:5p7d'#Y'Wf(;RnRi[u4w&RgJJvG'!6Vyh=<r#ijuuv/sIKuYD'ZtG@3p9~Gr&d2#`(g<vtRgFj`u5w&rqpxRf2CJuY!+:wfnTOu!5Rg}jNs1ucv&RfwJvA!&3@q|BDcC#T,k/unq8w8Q5RkTklwQuzunq8w8Q5Rk9dga#!a'!a=#a0!:+Tb*b@aO.a4!aba8aFJv^}?!VyR~Dr<g;u%Rn.~<5p[x'e`wNZtR@3p]Pw:5pZhNvjBp.woe_g5u-r4JwF!%DtO3:ooc7&!#:p^3DtpLuGw(!+%)Dtk6Vz#2sd=<r8d'#Y([y#<x3gJt`w@!)%}MRiowzikRij=]ilxAf3,U(#B2Rf#g0v-Rm[ck{`U#]giKv3>)!&6Ri154s,KuGB_%@r68r:dJ|t`#X(9<E|u2@H|rx3gJu?w'!+'1Nu7Reg4=H~+9<wxgY95Rm]xLggZ-`(X}U2:Ri4h<uOawRmsJv__5@bb{jbV~3dka#a'a]!,#a+U=a>b6a3b%!/aKa/)!arwve^VyJ;:pR~DpTg3uJpS~<5pOPw;5qmPw:5pNOu!5pQJvG'!6Vyx=<qoJvA!{~Jup!%@qk7Rn/KvyD!}''[xz;>wkh'?Rh,x8gyt`w5D!&),(SgyccRgztJ@3pPB5p#d'(Y#<]mmifubw&RgoJvE&!82s^JvF&!8Rf,ADb]~;x=h'rNu]vK!,%'*0RnORh)4Rh*AqQg-vaRnNg;wHwkh'ba~4cE#Ta*x3gctyw@'!+%RnFRnD<4Rn@hFvK5RnCxWg[#`&a0Ua()`1Rm75Rg[c]%X#qi8Rg^NvdRj>BwzgZauwji7Rm6A4wgg]d1#&(*,.0a#Rm;Rm<Rm=Rm>Rm?Rm@RmARmBe%#^^^Xaea?aC/b+(,!a+a#!a/!>a&Ta<aKbD!2wphBRnk[yPw}hE|.=Br-3Dtm>6Vy~g6urRf.x,hPrNav!%'RnqRo%Ro#Nu;q[Pw;5r+JwNZtM@3r)d'#Y'Weh;xChL#`&RnmRnoKu}>%(!Rne~Bs-;2wjcussJv+'!aYSO}6@B<5?ba~8LrNvj!.%*ROwungw~ng~:9;Ri^>wtnig;wHRnixDh@|(UZ.x1h@|)!#:2<H|*xHn]#-UX'3Ro)z=iT}6ARns=Bwsn_wpnaRncw]aR(#UXa&Ua*a/=]iPd'#Y&Ro'WnXf{QRm2hNvj]nZd`'T~&1`{|`#9b]{}c:'!#Wl{>@=be}]?cl{{U#:5Abb}Jds#^YaF!a*b4a#a3aPa>&Tb!bH!*a_!Eau?/a&RjY<]gj>6Vz*;:pe~DrZg,QRj1JwNZtX@wihspcJvZ&!VyX9WmOJu|!|N2WmHJvh&!]ht~Bpbcn&T(!#RmQ<s7Nu;padH#X'`+WmJ@>RmKCARhnKup=!)&Wf+:RhqNuPpf9c!#'45pd5AwghpARn(Ls@w!%,)!RmP@Wfe<E|IJva!&WmNg8vsRmLd`*.`#Y'Xa!axRn*]hrA8Rhug5s@rXg8u!RmMd8#X'X*3@rV72smdI*#UY&RmICARho~GsgxVgd)Ta'U-Y&Xa!T#RnEWnA@Wffg1uDRi0hFvK5RnBxGnG&#`%owp)@wsf+bX}Ze-*1!a*^^^Ua|!#a.aq&Ya2!a>.a6!a:aO`aJDtL[y`@Wg#>6Vz12@wzoYRoZNuPRi!NuPRhzg=ucRi,@=b`{Yg=ucRi-ACJvB!&Sh[ebSh]ebi`wUuFRm4Jw2_[y0JvB!.<Ju(!&SoG}6Shd}6<Ju(!&SoH}6She}6Kur@._g5vHRieJvx!{L2G{Kx6gd'T#?Rh82Wi5cZ#X(g1w)Rm5dW-Y(Ta#!a)!#aYa=wnfE=su2>>bU{0j9udv:<svj8uQv-7RgHdE%#^'sq9sp=>Bb_{TJv`!&g/r|snj6v(us5d,#Y(56H}[978H}]Jw5!&g1rushJvB!+j;v{u5?zDhd}6}bj;v{u5?zDhe}6}ce*#`(^^^a[aea!=!a6a*aoXb1a.!aAbL!b>,b'aL!aV@Wf|2Wlg3[y/JwNZt^@3piPw:5pgJunZou3@rsJva&!Vy_g<v~Rm#JvG'!6Vz0=<r{Ju{%!:pj@WfsiXuJu3Rm:JvZ&!WfA~Bph@c4Z&Dtwax5rubx(#:awRk1@d,#Y&RfjRfid1#,Y(@Wfp2Wlrg5s@ryKu[@!,'=]ig9wlk?Rk>g5u-rqJvy'!@9RkQcH(T#=>Ri~@<wkj(Wj(KuZB*!&<7rw@9RkRcH(T#=>Ri}@<wkj)Wj)dg(Ta2Xa9X#`-!a*CARhg@@=I}d9x;c~#X%so=<sj>2@@=aybb}XjWv0Q~EfEj3vLv;<d,#Y(56H}`978H}_dgaPaFa'a/!#a3Y0a_a;a|!1(a7-[yE3[xt;:pJNvZrrg3uJrvJwNZt=@3pIh=rt3rxPw:5pGOu!5rpJvG'!6Vys=<rz@c4Z&Dt(ax5rtJvZ!&~BpH@wsfNg-vaRlNci*U#=<wei<F}a5@Jq.!a*JQ!%@qZ23d(#Y&RjH5]jCk!u7w&u0udARjFd/prq=tyvpaEa(a:.!a1aZ(@@=I}:9wpd%=<sX55w_h}@@=I{t=ay<aU@@=I}T=ay<2@@=I})?C9:9au@9Cb]}DP~=x-fAZ(2Wl1=ay<aU@@=I}>5@d##Y+jTv|vV~EfFj]uNpn~FRfGdgaK!Z2&!a8a-Tb({E!acTbM*!a(DtY[yYd'%Y#sl[y*hHvh>Re5x2c{Z}.j4uCvcawRiMd+#X+_x&d!},<5RkX;2Hzw@x,gavfB-!{CcF&T#Roe;RodwWbBg5urRgaKvHC*_6Vz+<4opieuew&Rmq@d]&Y)X,T#X0Rh}<BqP=4qS9:ReMg/ujReNJw0!/<Jui%!bd{kawwnemRelAxUa?a3#*.&UX(Ya+a/RhvRnQ<o}9Wmtd-#Y&RgSRmw9;Rmxay=Rmyg-vaRmuxEhSrNu,v-voC!%(aR.a(a7+1Ro1>Ro5CE{A9b]{@;5x#eO{:g;urRi+KrNA!%(Ro3>Ro79;Ri_Ku@>{;&!x%gX|{KunA_+g5QRj/g3u5Rj#g>uERj%wio/xRhS&!,!#^1U}wba{8>>@=be}qC@:D5ba{7Ku+A&!}x?ba}t>>@=be}se(aA^^^Uat!b0#{pa+awUazbGa#aLb9bgaWac'a5TbS=Br!d1#`%scp_Jvl!#rT>Re0JvX&!VyN=H{Fcm#U&:pY=ReaJv2&!]h0=]nUJvG'!6Vy|=<r%JrM_=]h2@Wlud'#)U'Wf'b]{i=]h/Jvh!&~BpWg=v]RnMx+ny#'Nu;pVwjnu=]nwxJnx,T#`&Reqwjnt=]nvieu9vrRjLLuYwP(#+!th@wih5pX~Gr'g5v/Rh4KunA'!-CARnP@wwiN:Rm_9x'cvw>!|l=<saKvAA!0&3@q}>w^e1bp#&Re2Re3BDx7gH#T|f5H|eKuZ>!%(:qNAH{]Jv6!+3B2B9=b^{X<5<B92:E{ZLvhwA(a;a%!igQuyRmad+#Y}m@3Rh5d8#X'X*:AqUAHzmaxwbh<aXRnVcF}RT#Nw&cj#U(BWnug/vsRntdka)(a3+.Zb7aYYan1!bVa@Xa}[y^@b[{G=H{+hFu73Rj&Pv#5ReQcK%T#sig1v{Rj'Ku+D#'!t]~Grm~?rkKuMB!01d5#`'Vy.ta3Dtu~Hroc8#'{^45s85AwZbP&!#Rn!wghxWn#KvEA!)&2RlA2RlBx:h|#(T,=]j09Wobz>x]z/@awRoTd+#Y(az]hFhCrm4d,#Y+jTv|Q~EfMj]uNr|~FRfOdCa!Xa9_X#@<plJvf!%b`{(9;Rgwc;.!#2x7cw#T|UDb]|T5Ju={(!=@E{&Jv)&!Ab`{'awJvf!~*>>@=be{#KuY>!+&4Ezyi[ugv&RjIdea+T)#UXa&T-T&a!Rh9auRmW=]kLg5vuRn+g3u4Rn-Ow6ARn,hHus5xNk?#UX(U~)/g8v0RkD~AwkkF?Ri.OuNBwkkA?Ri/d|a2`a*^UYa.!aBTZaTa'Xa;!(!2!-a#b2[yC>6Vyq3[xr2Wi?g1rusVh%s?DtF~<5rbJs;%!DtBfswKtCj[uvuSsEu3RgVx3o:u+wN'*Zt;@3rd~Grh~?rfg8w)Lq)qE&-a%!>bI|`jWv0vV~EfCjTv|vV~Ef@j]uNpn~FRfBcK#T']gWNu7x,k7q4ai(0!hHv8<RhmkMu9vrsBuev/RhlCJvB!,g<v{wchh~@:Rhji[vrv{wchi~@:RhkdS&a5UY#Ta!RgPwwiI5BwciI~@:Rh`x'iJvj'!5]iJPu8Bwch]~@:Rhach)U#h3rp]gLh@t|Ax,hTq3ah!-(~@:Ro0Ou!5RhXj^v(pyw8unRhVd|)`,^UYas!a?/a2Z'a^Ta{Tb7Ta(a#!a,Wf&9sZ3DtAadamov=Bqt3[xig8vsRm~>waiL2b`{QJv*_Ouv2qgj<v]v2BqfdR'X*X#Y-@3qr~Gqv~?p6hHv-]glPup5Lq+q?_%*b_{qF{n9b^{rOu4ARhpKvCD!+&~Bqp:5Dbb}nwoiKl&unuTuBv]v+ueunaXRf0=Jvh!0nKufu8v1w&w7q%w&uHrz:Rgnj5w,uxDJq/(!hNw'5ReCk0s2u3w/w'5ReFd>Za&!*UaA=<wkgsRnSJv^!%Refifw3vyRgOKu_B'!,<]gkiiu:w&Rh<=C@a^<B57@2F{[<B5@aW:=3away9A5aW=<B=C@a^<B57@2F{Ie-#`(^^^bCara.b8aza6!/bZ,!adTbnTbOb+aFaS!aAT9@Wf~2Wli3Dtl2@d,#Y&RfnRfmJwJZtN~GqyJva&!VyMg<v~Rm%iXuJu3Rm9Jv[_=]ih9wlkDRkCd1#`(@Wg>2Wls3cH#T(@<Rj*=>Ri|b~'#23s9h<~El.d'#Y&Dtxi^rzvdRl#d*#U%(o|B2s`hJwSaxRmDKv4B&!1:Rmdd5#`'Vx}to~Hq{x'f1v3(!BA5ba|bJv_&!Wfug1v]ReIdO+U/Y#&G}-8wze=Rh{g1v]ReHg/uQRf/by#)ibQwERl/cH#T(@<Rj+=>Ri{cNu+vlax-!(#a0qa9<Rii2;;bU{H;x<i=&X#Rk`<4wwi=C9H~8xAI(Y#<azRi@45wXI<B9;5bb~7dL(X#Xa(+!aL6Vy{g5QqOau:5au2@ay547EzbxOcU(UX-T#Ta#:Cbb|A?wjh/b_|SOw6ARgtihr}u7Rhy<d1#T)X1@@=I|~=ay<2@@=aybb}Sj3vLv;<d,#Y(56H}A978H}@dGpvs@uAu`vcw9*!aFa+ai%(b!aXa8.a?a[ozWey=sU2@G}Nch&U#Rf_WexKu+D#'!t:~Gr`~?r^j]uNr|~FRg*j^psurwJt|RmcKv)@&!)7Rkv~Br[@wxfO:Rl3co#U'6Rezj_q#vIuavjRltwzeyh@vr5JqD0!>aY?C9:9au@9Cb]}9cl#U*5;5<H||jbuus1ucv&Rfvg1v~d/pppzqFr^a--a~!aMat1(hFv;Wiz@@=Izoj5uuv-7Rix~Cw`fk2WlVcZ#X,k)u3vWs@u2]ktg;wEx'fBq(_2Wg/jTv|vV~EfoJv]!15x'hzqG!(P~EfU~CRl_j6v(us5x4i-#T(2WmZ?C2F|d>Kq<aj1!*jTqIsBv=Wl`~Cw`fi2WlWj`v0u*~>RlR=c>Z,k#u3vWs@u2]kr<c1Z+jTqIsBv=Wla~Cw`fm2WlXdmb3!a{(arZa`bkTa%TbQTa-a9+c'!aM!/[yL=Bqug.w'RifhFvyDRj.g>vgwyk^9]k^Jv3_@WfbAARkhJw2_[x|JvB_wkoIRoKwkoJRoLd'(Y#<]gm=<9<H|yd'%_X#skDtb3awwqkgNulRkgdB#^',9:p'hJwSaxRmEBwVb8@4=H|qLu+w50&!)@3qs~?pU>Awwn;;Rn=c:Z'ARn<=<qwKvC@!/&~BqqJv6!&]eVb^z^xRge'/a%+^`#Sge}6<4Rn3=]n0Pw2>Rn8Jw0!&>Rn:>Rn6cY#a7+!a&=<wkaNw~h3z_c5Z{=wjh#=]nLKv^D!&)Vyz=bW|swYb<WetcG#T(2wxa@qVx@gD#Y&b^|V5JwG&!5bb|pg/w&RgD@x=kHs=uAvn!a%%/'+RmSRh694Ro`g-vaRmRhHv-]mlxCcS#`&ba~.5cD#Ta)P~=d,#Y(56H{>978H{Dd_#{2^Y%_+qbbb{6g3sERhsbU{?dfa.,`a(Xa<!aiX#(55RiG54RiHcI#T'WiU3RiVNvdwtfcRlKNvdd,#Y&RlHRlExQgf.1*^T'X#Sgf}6Wn4=]hfPrk>Rn7Jw0!&>Rn5>Rn9Lunw?&a2!,5<oq@@wqfdRlJj5Q~=d,#Y(~ARfcOuN]fdDKw;ay(}i!547E}j?cI#T(@5bV}iCbV}hdv(^^Tb?a40,b##Tbo!a*bR!a<b|a/!aKai!aU[yK=]o^g:v>ReGJwPZtK<7Rh+h<~El,Pv#5ReR@awwxjCg,ulRjDJv6&!]j!z?aQeeg>w=Sh<eeJw;!&axEzOg,Qosc!#*:wkeJ]eJ>x'h-u(!%Ro.w~h.zPdNZ(X,Ya![x{;9ReY;wkgxRiF:x?ap#Y&RmUg<s2Rkod]+UY0TZ'!a&A9sw<=bczLNvuw{gqzNhJwSaxRmCKuLay!#&s_Rf-55b^{uJvZa!!c%#(55Ri654wmiu5RiuawLu,vp!+}^%b_}Y9;wkgxba}o>A9:=b^}zKuh=a''!3awRk3c*'!#aHRk6c+Z&Rk5Rk4Jv)&!awRjSawd9*`#0?C2@EzMj8u<uJ5RmbjQrquJu3x,k>uq@_+=ayb^|W~ARkEOuN]k@7dhzV^X/X&a-#zRzSb`zXcJzTT#2WkVKvDBzW!%FzY9;5bbzWjQrquJu3Jw3%!b`zU=ayb^zQd:#X(T-a!6Vyywxh}=b]{Jg=u1RiAdGp~qHtzv!w(wA+a+a;<!aJaYai'anasb(=azRmV:Cbb{MLq2vb!%')RjuRjrRjtRjqx3jnqCw3!%')Rk(Rk+Rk&Rk)Lq2vb!%')Rj{RjxRjzRjwLq2vb!%')RjsRjpRjfRjex3jcqCw3!%')Rk'Rk*RjkRjl9<CbbzfOu4ARhxLq2vb!%')RjyRjvRjhRjgx=joq*uKvb!%')+-Rk.Rk%Rj~Rk-Rk#Rj}x=jdq*uKvb!%')+-Rk,Rk!Rj|RjmRjjRjidAq&qKs@uAv8Aa.'*-a@a&0!aM@a5[y73Dsy3Ds|3Dt):wxgI2sHJwJZt.~Gqxwsf0ikrzt}Rl0Jvy_[xj~HqzKv_A|D!&WfP8axRoVcf,U#k(v]v+ueunaXRf1Ju}'!g8u#Ri=jQw!sCunLprq>!,')~<5qeGzq9F{W=c##%s5au:5aU3CBE|;d4#X(D!a&6Vygx(b;#(=]ed?C2F{N<capoq2r[a&!aPa9,'Pw;5s:@@=I|,55w_h|@@=IzcP~=x'fCqB_2Wl2>aU@@=I|1OuNBc1Z+jTqIsBv=Wlc~Cw`fl2WlZ~AcTa%!Z+jTqIsBv=Wlb~Cw`fh2WlYk+uNqJsBv=WlSg,u3dca3#UXaMYa)TaB-=cM|7T#<bI}l5@B932:aV2G{BOuNBJq:|M!5Ezt=<B=C@a^<B57@2F{v>cB{/T#=ay<bI{3Jv6!a.6BKq0ah&+!5E}HP~Ef{978BaU@@=Iza<7d#.Y#978BaU@@=IzH~AJq0!(@@=IzG978BaU@@=IzFe,aU*Y&^^^bvJb,b:bFad!a,c2Ta>aL.bo6!a#CbTa'T#Re{2Wlh2@G{yg6t~Ro_NvdRfticuRQRllJv3&!x&c|zs@Jw3!%RflwpfkRlpKuL;%(!Re<@G|C2GzdhIvuBwgjAg-u0RjAKQB%!(GzZ@G|5NuuRl7d='T+Y#Vy[g<v~Rm!==G|>JvA!)@wma=]m1ifuaw&RmnLs@vT'!|/+[y,g:v>ReTJw1!#qX=x!eC{bLu+wT&)ZtZauq_~Graci&U#F|89:r_Lupvq!.)&2RlG8RfaC=x!eF{_h?rpWlmd&'!#X|&]k::xJey#`'T|+<E|&2@H|%dE#(^,g;u.RiEg6vjRiC9xCkA{O|zY#g=ucRmXKs0@!&*@G|m@awRknJuh!,3d(}gY}eJvj!%Rm):Jw3!%Rm+Rm-Ls0w(&!a(a#@b[|6cZ#X'7RkxWgAOu4ARn'dH'U#Y*Vz-Wm'CARm}d]*#a%^a*T'aK!a<9bV{PC=p*Jw4!&SgxcbB5r]idw(wBRmF7xFkt#&`(Rm/Rm8E|!JuY_9:Rl5=wrgr2:bbxd@xXfB(a*#T+!.X0X1Ta/a'T&RlDRfL>RlyARl9b[z[>RfZ:RlL:RfRwlg/ARl;9;RlxKv,A/!%7s69<74=BA5ba{-8Bde#`a<XaKYa1,a'P~=wxfB2bZ}}?C972@@=I}r8@55B9;5bb}G978B2@@=aybb}3j3vLv;<Jw3&!>Rfk=ayb^}4~Ad1#`*@@=aybb{w2@>==<bbz]dx+UY#^UaF!a9!bB'Ya1.!ajXa#%olRhD[y=3Dt#Ov5BrHKuMB%!(Rf^Wep~HrJwkiQjKr|~FRg)Ku+D#'!t5~GrF~?rDdV)UY,Z/_7RkuG{<~BrBg,rlsO:235B@bX}|d?a1!#`(6Vyn5@d##Y+jTv|vV~EfIj]uNpn~FRfH7Lq2vb1!a9-978BaU@@=Iz9978BbU}#~AJq0!(@@=Iz8978BaU@@=Iz7~AJQ|}!978BbU}!JvkaK!AdUa21-U#`a+(g/vsRn~Ou!5RPj:rmu9WhOjXuvvNr}:RhAj^v(pyw8unRn[kPr}p|u7vwv]RiSBd;pppzq@qHQa?(b.!a.a`@.|xa(hFv;Wiyj5uuv-7Riw~Cw`fg2WlU978BbU|wOuNBJqG!(P~EfD~CRlQcZ#X,k)u3vWs@u2]ksg;wEx'f@q1_2Wg.j]uNpn~FRfqJv]!15x'h{qG!(@@=IzK~CRl^j6v(us5x4i,#T(2WmY?C2F{1>Kq<aj1!*jTqIsBv=Wld~Cw`fj2Wl[j`v0u*~>RlT=c>Z,k#u3vWs@u2]kq<c1Z+jTqIsBv=Wle~Cw`fn2Wl]dn1#c(a(b^a2!b/bAT(bj!aDa7bu,a_a{c0!2T0g:v>ReD2@G{42@G{5~DpM~<5rc=Bx6i>{RT#RnI@zCx]y]z:2Jv[!zr5Awyk]9]k]dD(Y+X#6Vz.g=wKtgwhaCwgmTWj2Lu,w%_+/[y-B;b^xeg3u3Rj-2@bX{*KrJ<!+'@Wg(g?QRlC@Jv`!%b[zIwsfII}8JQ_@w|kW|=Jv(%!AqcOuNBJvEzh!bYzjLs@wP#(0!oy@>RkdJwMZtc3Dtd@BcG#T'9bWxg2@2Fznd*#Y+;2x'c}w<zizixNgwa#Z'U+!/!a'!a+w~g~z6wcn{Rn}wcnzRn|5Rh%=]nJg5vuRmvNvdRlvcprJu}w*az*a#!%.a.'Bot9qT]kj@Wg'ay2Gzv@Jv`!%b[zEwsfHI}1;ck#Ux`<Cbbx_Lu+w!a&0*!wko*wwo,So,}6Juqxf!E}PigQuyRm`d3(`#8>Rn%:A5B;bZ~%KvhCa!a2!x>k7#Uxb@b{#xaRk7Jw0!)>wwhlShl}6>wwhmShm}6CJvB!.x'hhvj{!!5Bwkhhbaz}x'hivjz~!5Bwkhibaz|xEhTrNu,v-vpD!a%&/)a3a.,%Ro2t[CE{)@3re9b]{%wjo09:rgc:Z&Ro6=<riifuaw&RmoKrNA!%(Ro4>Ro89;Ri`dSaL'UYzxZb)7Rka3xRhT&!,!#^1U}vbaz{>>@=be}yC@:D5bazzKu+A&!}{?ba}y>>@=be}wxBh[t`u~vJvr!%a!a()a,a0a4RoC=]o;Ju(!%RoGRhdwjh`=]oAg>w#Ro?g5vuRo=NvdRl|Ku]C.!&;RoEJvB!%RoORoMBx'h[v+_?w~h`}~5?w~hd~!xKh]oiptu-utv.vp!#%&a30a@a'a+(a/aOp(o~p!RoDJu(!%RoHRhewjha=]oBNvdRl}g>w#Ro@g5vuRo>c[#X']o<CauRoRAd-#Y':RkpauRoQKu]C.!&;RoFJvB!%RoNRoPBx'h]v+_?w~ha}t5?w~he}ue!/UbhYacXaW^Tc&a;b:a-c/#b&aja1(!cL+!bKbt!bmcRc9aIc?8[yW3Dtt94Rg`Jv}!&SiRMzBhEebShEMNuPRe>x7gL#TzuwjirRipc<Z&>on;>z=h-MSh.Mwqczx'a7vj&!>Re4@=ResJt__NuPRi*NuPRi)j]uNr|~FRfzKrJ>_+@Wfy@Wf]2WocKrJ<!+'@Wg%g/QRl@@Jv`!&awRl<wsfFIzgLu(w*!.*&ShBMwvhIRhI9;RhNx1hK'!#Sn]Mx1hK~0!#:2<H~7cNu+w7D*'1ZtW>Rn1~?rOc:Z&Rn2=<rQ<7wjh&=BSnLMc]#X(6Vz)w[b=a!U#9wzgMc3#&(RgMRitRis<x,gKt`ax!&+SioM=BSilMc3#&(RgKRinRimKurB,!&SiQMzBhDebShDM6BJQ!(P~Efx978B2@@=I}WLrJw!!,a*&@G}O@9wkibRid@@x'fKwC!&SlDMSfLMjUv~Q~EfKKv3@a+!(hFv-]mpx/hYZ(C5RiWz<o/MwkhY?So/M@x,gbvfB*&!SgEM:SoeeehFu3:Rgbda(,^TZa)X/7Sg[eb:2RgI~BrMC@wgkc:wwkcRerx3h(uUvK!&*,SnOM4Sh*MArRg;wHRh(x=h;rJvPwI!a4',a'0@Wg&=BSh/Mg>w=Rh=g3w*wwgGRgGcW(X#;Sg}M2Gzk@Jv`!&awRl=wsfGIz`dKZ*T'Y-:RhR7RhQg5u-p`j6v(us5d,#Y+~Awkia?RicOuNBwkibba}Ld6p~tyu_vbAa'a+!a/'a3aEa8a!>Sh,ebJv{!&Sh@ebSaReb9;SgwebNuPRi(NvdRl)NuPRi'hHu^<Rm^Jvv_@Wl(g;u1Si/ebKu'B&!*Sh?eb@Wl'z@aPeb95Si.ebcpputyvjB)!,&a+0a%ShAMWeK@G}C@WfJ9;RhMwvhH9w{ia}ix,hJvRA1(!zAn[MRhHx1hJ~*!#hFv(BSn[MBJQ!(@@=I~'978B2@@=I}2db.Ua<'X}+T#a0XaG2G}E;wkg|wuh!Rh!x,hZu,@)!&So0MVy)C5RiXACJvB!&5RiY5RiZg8w)cG}*T#2@bU}=KsA>(!a.3wkhZba~(x,h^u(A!&(SoCMRhb5Bz=h[eb?w~hb~6x,h_u(A!&(SoDMRhc5Bz=h]eb?w~hc~6e)aA1T#T,^^^c-bMb&blcPaP(a/!0!bA=b5c@a(!bfbrc#2afwmhARnjwchORnp2Wlf3DtsNvdRl-2@wpa<]m0bx(#:awRk2@Jw3!%RfhwpfgRlnKQB%!(G{V@G|'NuuRl6d='T+Y#VyUg<v~Rl~==G|<Jv+'!aYShC}6@B<5?ba~8@Jw3'!g2QRljhLrpWlOd+#Y'g.w'rIg>w*wgj@g-u0Rj@Lu+wT&)ZtUauq]~GrGci&U#F|39:rELrNvj!.%*RhCwunfw~nf~:9;Ri]>wtnhg;wHRnhx3hDs@v~!/+'@Wfr@9RkSNu&Rlo=@<5GzoKs0@_+@Wl+@awRkmJuh!-3d(}pY#qWJvj!%Rm(:Jw3!%Rm,Rm*de&!1U-U#`)Re;@G|.@9Ri82@wjfvRlq=@<5GzpLvOvr!).&2RlF8Rf`C=x!eE{.Jw3_g2QRlkhLrpWlPde(!#U{s,UXa*Ta'[y'g:v>ReS;x0PZ&RnlRnn~HrKJw1}f!=x!eB|2w]aP(#Xa&a*Ta.Ua2a7=]iOd'#Y&Ro&WnWg;u.RiDg6vjRiBNvdRlzhNvj]nYJuW_2Wm3x)kFze{9d])!a.!,Y01!#&aC!a3RndC=ox~BrC@2b^{pg,rlse7x'ksuq!%Rm.E{xidw(wBRmGx9o+)X#wwo-So-}69:Rl4@xSf@a#XZ'X)X,Ta(/ARl8b[xc>RfY:RlI:RfQwlg.ARl:9;Rlwdn'#^XafaQa1X1TaHTa)@b[{zcZ#X'7RkwWg@Ou4ARn&x)kG#{,g7u/RkGdH'U#Y*Vz'Wm&CARm|bx#(A]gUbUzJj9Q~=d,#Y(56H}l978H{U7d,0#U*2>ABb_xZ978BbU{e~AJQ{g!978BbU{hxMh?ad{oUYZ.x1h?{l!#:2<H{mx3n[t{vl!,&a%3Ro(z=iS}6ARnr=Bwsn^wvn`Rnbd`*T}B0!#^X'BG{c9b]{a>>@=be}F?JvS!&BG{d7BG}(Bde#`a1X,Ya@!a'P~=wxf@2bZ}I56B2@@=aybb}08@55B9;5bb}<j3vLv;<Jw3&!>Rfg=ayb^}&OuNBKuLA!)a!P~=x#fD{f2@>==<bbzl?C972@@=Ix^d6rSu,v7w*C(0a)a6#B+a%!sQ[y?3Dt%3[xn~<5rLOu!5p@Ku+D#'!t7~GrP~?rNKvlaya7'!h+v-5qMg=t|cd,U#5AAaa5Abb{S@52B5@a[@52B5Gx[iXueu;d<#`a(!/549C;ag>23ExY5@Dah89b^~689Jv)!~2b[~1Lv'w(%*!a#bX|aPrmawRe]keu7uhv-q6rxu,q`xTo]/a5aU!bNaDXbi!b-!ao!b<bwA!#5@B932:aV2G|:d-)Y#hJrL>RhG<7@C5<H|_=Cau:5aj5@B932:bJ|ng>vIbs)#?C2F|9jPv0w.vISh-MKvUaz(.!9ABbb|[5;5<H|Eg>unwfh;9:4E|YjQsBt|vjx'hYq3!(?C2F|J:2<BaY?C2F|GOu!5x,g|p{ah!-(?C2F|c9:4E|OjXuvvNr}:Rh&i[w*t|cd+U#jJvsu)vsSn~Mkfrmu9p}u7vwv]So!McW#Xa!ax5@A5aY:5;5<H|>kJv~vYrquJu3x4ib#T)2@SmZM?C2F|Bj:rmu9@xPhI(a*a#U#`a3-5Abb|L~@:RhK9:4E|0@52B5G|#C::aY?C2F|-:2<BaY?C2F|.5Jvk!a)javYrquJu3x4ia#T)2@SmYM?C2F|HAxPhH(!a#U#`a*-5Abb|4~@:RhJ9:4E|R@52B5G|F:2<BaY?C2F|Sc^#Xa2j=Qq5CJvB!-g<v{z;hhM?C2F|Zi[vrv{z;hiM?C2F|XKsA>!a)-g<v{z;h[eb?C2F|]i[vrv{z;h]eb?C2F|^iZu.vix,hZq3ah!.(?C2F|QOu!5ShXM:2<BaY?C2F|P\", 13_494, 2713, 49, 25, 61);\n//# sourceMappingURL=decode-data-html.js.map","// Generated using scripts/write-decode-map.ts\n/** Packed XML decode trie data. */\nexport const xmlDecodeTree = /* #__PURE__ */ new Uint16Array([\n    512, 26_465, 29_036, 7, 0, 2, 4, 116, 24_638, 116, 24_636, 8693, 29_807,\n    24_610, 621, 1, 0, 0, 3, 112, 24_614, 111, 115, 24_615,\n]);\n//# sourceMappingURL=decode-data-xml.js.map","/**\n * Bit flags & masks for the binary trie encoding used for entity decoding.\n *\n * The trie is a flat `Uint16Array`. Every node starts with one header word:\n *\n *   15..14 VALUE_LENGTH   Number of words the value occupies, +1.\n *                         0 = no value; 1 = value inline in bits 12..0;\n *                         2/3 = value in the 1/2 words after the header.\n *   13     FLAG13         If VALUE_LENGTH > 0: semicolon required (\"strict\"\n *                         entity; `;` is never stored as a branch).\n *                         If VALUE_LENGTH == 0: this node is a compact run.\n *   12..7  BRANCH_LENGTH  Number of branches (or run length for runs).\n *   6..0   JUMP_TABLE     Jump-table offset / single-branch char / first\n *                         run char (see below).\n *\n * Branch data follows the header and any value words. Its shape is selected\n * by (JUMP_TABLE, BRANCH_LENGTH) in the header:\n *\n *   Single branch  JUMP_TABLE = the only child's char, BRANCH_LENGTH = 0.\n *                  No branch words; the child node follows immediately.\n *   Jump table     JUMP_TABLE = first covered char (> 0), BRANCH_LENGTH =\n *                  table length. One word per covered char: 0 = no branch,\n *                  otherwise the child's offset from the END of the table,\n *                  +1 (so 0 stays the no-branch sentinel).\n *   Dictionary     JUMP_TABLE = 0, BRANCH_LENGTH = number of branches.\n *                  ceil(n/2) words of sorted keys packed two per word\n *                  (low byte first), then n pointer words storing the\n *                  child's offset from the END of the branch data.\n *   Compact run    VALUE_LENGTH = 0, FLAG13 set. BRANCH_LENGTH = run\n *                  length (3..63), JUMP_TABLE = first char; remaining run\n *                  chars packed two per word after the header. The target\n *                  node follows the packed words immediately.\n *\n * Pointers are end-relative (rather than relative to the pointer's own\n * position) because that makes the common \"child encoded right after the\n * branch data\" case a small constant, which compresses far better. Offsets\n * to already-encoded (shared) nodes wrap via uint16 modulo arithmetic; the\n * decoder masks navigation results with `& 0xff_ff` to match.\n */\nexport var BinTrieFlags;\n(function (BinTrieFlags) {\n    BinTrieFlags[BinTrieFlags[\"VALUE_LENGTH\"] = 49152] = \"VALUE_LENGTH\";\n    BinTrieFlags[BinTrieFlags[\"FLAG13\"] = 8192] = \"FLAG13\";\n    BinTrieFlags[BinTrieFlags[\"BRANCH_LENGTH\"] = 8064] = \"BRANCH_LENGTH\";\n    BinTrieFlags[BinTrieFlags[\"JUMP_TABLE\"] = 127] = \"JUMP_TABLE\";\n    /** Bits 12..0: the inline value of a VALUE_LENGTH = 1 header word. */\n    BinTrieFlags[BinTrieFlags[\"VALUE_MASK\"] = 8191] = \"VALUE_MASK\";\n})(BinTrieFlags || (BinTrieFlags = {}));\n//# sourceMappingURL=bin-trie-flags.js.map","import { codePointToString, replaceCodePoint, replaceCodePointXML, } from \"./decode-codepoint.js\";\nimport { htmlDecodeTree } from \"./generated/decode-data-html.js\";\nimport { xmlDecodeTree } from \"./generated/decode-data-xml.js\";\nimport { BinTrieFlags } from \"./internal/bin-trie-flags.js\";\nvar CharCodes;\n(function (CharCodes) {\n    CharCodes[CharCodes[\"AMP\"] = 38] = \"AMP\";\n    CharCodes[CharCodes[\"NUM\"] = 35] = \"NUM\";\n    CharCodes[CharCodes[\"SEMI\"] = 59] = \"SEMI\";\n    CharCodes[CharCodes[\"EQUALS\"] = 61] = \"EQUALS\";\n    CharCodes[CharCodes[\"ZERO\"] = 48] = \"ZERO\";\n    CharCodes[CharCodes[\"NINE\"] = 57] = \"NINE\";\n    CharCodes[CharCodes[\"LOWER_A\"] = 97] = \"LOWER_A\";\n    CharCodes[CharCodes[\"LOWER_X\"] = 120] = \"LOWER_X\";\n})(CharCodes || (CharCodes = {}));\n/** Bit that needs to be set to convert an upper case ASCII character to lower case */\nconst TO_LOWER_BIT = 0b10_0000;\n/*\n * `parseNumericEntity` packs its two results into one 32-bit integer:\n * `(consumed << CONSUMED_SHIFT) | codePoint`. The 21-bit code point field\n * fits any valid Unicode value (max 0x10FFFF, clamped before packing); the\n * consumed count excludes `&` and gets the remaining 11 bits. Extract it\n * with `>>>` so the topmost bit isn't treated as a sign.\n *\n * Plain consts rather than a `const enum`: with `isolatedModules`, enum\n * member reads compile to runtime property loads.\n */\nconst CONSUMED_SHIFT = 21;\nconst CODE_POINT_MASK = 0x1f_ff_ff;\n/**\n * Reserved consumed field for counts of at least 2047 characters after `&`.\n * The true count is in `longNumericConsumed`.\n */\nconst CONSUMED_OVERFLOW = 0x7_ff;\n/**\n * Side channel for numeric entities of at least 2048 characters including\n * `&`. Set by `parseNumericEntity` when its consumed count reaches the\n * reserved value `CONSUMED_OVERFLOW`; callers read the true count from here.\n * A module-level slot avoids a tuple allocation on the hot path.\n */\nlet longNumericConsumed = 0;\n/**\n * Extract the consumed count from a `parseNumericEntity` packed result,\n * recovering the true length from `longNumericConsumed` when the packed\n * field contains the sentinel. Read it before the next `parseNumericEntity`\n * call, which may overwrite the side channel. This helper owns that protocol.\n * @param packed Packed result of `parseNumericEntity`.\n */\nfunction unpackConsumed(packed) {\n    const consumed = packed >>> CONSUMED_SHIFT;\n    return consumed === CONSUMED_OVERFLOW ? longNumericConsumed : consumed;\n}\n/**\n * Unsigned subtraction trick: (code - lo) >>> 0 wraps negatives to large\n * values, so a single `<=` covers the entire [lo..hi] range check.\n * @param code Code point to check.\n */\nfunction isNumber(code) {\n    return (code - CharCodes.ZERO) >>> 0 <= 9;\n}\nfunction isHexadecimalCharacter(code) {\n    return ((code | TO_LOWER_BIT) - CharCodes.LOWER_A) >>> 0 <= 5; // F - a\n}\nfunction isAlpha(code) {\n    return ((code | TO_LOWER_BIT) - CharCodes.LOWER_A) >>> 0 <= 25; // Z - a\n}\n/**\n * Checks if the given character is a valid end character for an entity in an attribute.\n *\n * Attribute values that aren't terminated properly aren't parsed, and shouldn't lead to a parser error.\n * See the example in https://html.spec.whatwg.org/multipage/parsing.html#named-character-reference-state\n * @param code Code point to check.\n */\nfunction isEntityInAttributeInvalidEnd(code) {\n    return code === CharCodes.EQUALS || isAlpha(code) || isNumber(code);\n}\nvar EntityDecoderState;\n(function (EntityDecoderState) {\n    EntityDecoderState[EntityDecoderState[\"EntityStart\"] = 0] = \"EntityStart\";\n    EntityDecoderState[EntityDecoderState[\"NumericStart\"] = 1] = \"NumericStart\";\n    EntityDecoderState[EntityDecoderState[\"NumericDecimal\"] = 2] = \"NumericDecimal\";\n    EntityDecoderState[EntityDecoderState[\"NumericHex\"] = 3] = \"NumericHex\";\n    EntityDecoderState[EntityDecoderState[\"NamedEntity\"] = 4] = \"NamedEntity\";\n})(EntityDecoderState || (EntityDecoderState = {}));\n/**\n * Decoding mode for named entities.\n */\nexport var DecodingMode;\n(function (DecodingMode) {\n    /** Entities in text nodes that can end with any character. */\n    DecodingMode[DecodingMode[\"Legacy\"] = 0] = \"Legacy\";\n    /** Only allow entities terminated with a semicolon. */\n    DecodingMode[DecodingMode[\"Strict\"] = 1] = \"Strict\";\n    /** Entities in attributes have limitations on ending characters. */\n    DecodingMode[DecodingMode[\"Attribute\"] = 2] = \"Attribute\";\n})(DecodingMode || (DecodingMode = {}));\n/**\n * Token decoder with support of writing partial entities.\n */\nexport class EntityDecoder {\n    decodeTree;\n    emitCodePoint;\n    errors;\n    /** The current state of the decoder. */\n    state = EntityDecoderState.EntityStart;\n    /** Characters that were consumed while parsing an entity. */\n    consumed = 1;\n    /**\n     * The result of the entity.\n     *\n     * For named entities: the trie index of the best legacy match so far\n     * (0 = none). For numeric entities: the accumulated code point.\n     */\n    result = 0;\n    /** The current index in the decode tree. */\n    treeIndex = 0;\n    /**\n     * Characters consumed since the last recorded legacy match, plus one.\n     * Invariant at the top of the `stateNamedEntity` loop: `excess` equals\n     * the number of unrecorded consumed characters + 1.\n     */\n    // biome-ignore lint/correctness/noUnusedPrivateClassMembers: False positive (read via destructuring)\n    excess = 1;\n    /** The mode in which the decoder is operating. */\n    decodeMode = DecodingMode.Strict;\n    /** The number of characters that have been consumed in the current run. */\n    // biome-ignore lint/correctness/noUnusedPrivateClassMembers: False positive\n    runConsumed = 0;\n    constructor(\n    /** The predefined HTML or XML decode tree. */\n    decodeTree, \n    /**\n     * The function that is called when a codepoint is decoded.\n     *\n     * For named entities that decode to multiple code points, this will\n     * be called multiple times, with the second codepoint, and the same\n     * `consumed` value.\n     * @param codepoint The decoded codepoint.\n     * @param consumed The number of characters consumed by the decoder.\n     */\n    emitCodePoint, \n    /** An object that is used to produce errors. */\n    errors) {\n        this.decodeTree = decodeTree;\n        this.emitCodePoint = emitCodePoint;\n        this.errors = errors;\n    }\n    /**\n     * Resets the instance to make it reusable.\n     * @param decodeMode Entity decoding mode to use.\n     */\n    startEntity(decodeMode) {\n        this.decodeMode = decodeMode;\n        this.state = EntityDecoderState.EntityStart;\n        this.result = 0;\n        this.treeIndex = 0;\n        this.excess = 1;\n        this.consumed = 1;\n        this.runConsumed = 0;\n    }\n    /**\n     * Write an entity to the decoder. This can be called multiple times with partial entities.\n     * If the entity is incomplete, the decoder will return -1.\n     *\n     * Mirrors the non-streaming `decodeWithTrie`, but with the ability to stop decoding if the\n     * entity is incomplete, and resume when the next string is written.\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The offset at which the entity begins. Should be 0 if this is not the first call.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    write(input, offset) {\n        switch (this.state) {\n            case EntityDecoderState.EntityStart: {\n                if (input.charCodeAt(offset) === CharCodes.NUM) {\n                    this.state = EntityDecoderState.NumericStart;\n                    this.consumed += 1;\n                    return this.stateNumericStart(input, offset + 1);\n                }\n                this.state = EntityDecoderState.NamedEntity;\n                return this.stateNamedEntity(input, offset);\n            }\n            case EntityDecoderState.NumericStart: {\n                return this.stateNumericStart(input, offset);\n            }\n            case EntityDecoderState.NumericDecimal: {\n                return this.stateNumericDecimal(input, offset);\n            }\n            case EntityDecoderState.NumericHex: {\n                return this.stateNumericHex(input, offset);\n            }\n            default: {\n                // NamedEntity — the only remaining state.\n                return this.stateNamedEntity(input, offset);\n            }\n        }\n    }\n    /**\n     * Switches between the numeric decimal and hexadecimal states.\n     *\n     * Equivalent to the `Numeric character reference state` in the HTML spec.\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    // eslint-disable-next-line unicorn/consistent-class-member-order\n    stateNumericStart(input, offset) {\n        if (offset >= input.length) {\n            return -1;\n        }\n        if ((input.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) {\n            this.state = EntityDecoderState.NumericHex;\n            this.consumed += 1;\n            return this.stateNumericHex(input, offset + 1);\n        }\n        this.state = EntityDecoderState.NumericDecimal;\n        return this.stateNumericDecimal(input, offset);\n    }\n    /**\n     * Parses a hexadecimal numeric entity.\n     *\n     * Equivalent to the `Hexademical character reference state` in the HTML\n     * spec. Digit parsing matches the hex loop in `parseNumericEntity`.\n     * The accumulated value is preserved for numeric validation callbacks.\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    stateNumericHex(input, offset) {\n        const inputLength = input.length;\n        // Local accumulators; flushed before any exit (see stateNamedEntity).\n        let { result } = this;\n        let { consumed } = this;\n        while (offset < inputLength) {\n            const char = input.charCodeAt(offset);\n            if (isNumber(char) || isHexadecimalCharacter(char)) {\n                // Convert hex digit to value (0-15); 'a'/'A' -> 10.\n                const digit = char <= CharCodes.NINE\n                    ? char - CharCodes.ZERO\n                    : (char | TO_LOWER_BIT) - CharCodes.LOWER_A + 10;\n                result = result * 16 + digit;\n                consumed += 1;\n                offset += 1;\n            }\n            else {\n                this.result = result;\n                this.consumed = consumed;\n                return this.emitNumericEntity(char, 3);\n            }\n        }\n        this.result = result;\n        this.consumed = consumed;\n        return -1; // Incomplete entity\n    }\n    /**\n     * Parses a decimal numeric entity.\n     *\n     * Equivalent to the `Decimal character reference state` in the HTML\n     * spec. Digit parsing matches the decimal loop in `parseNumericEntity`.\n     * The accumulated value is preserved for numeric validation callbacks.\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    stateNumericDecimal(input, offset) {\n        const inputLength = input.length;\n        // Local accumulators; flushed before any exit (see stateNamedEntity).\n        let { result } = this;\n        let { consumed } = this;\n        while (offset < inputLength) {\n            const digit = input.charCodeAt(offset) - CharCodes.ZERO;\n            if (digit >>> 0 > 9) {\n                this.result = result;\n                this.consumed = consumed;\n                return this.emitNumericEntity(digit + CharCodes.ZERO, 2);\n            }\n            result = result * 10 + digit;\n            consumed += 1;\n            offset += 1;\n        }\n        this.result = result;\n        this.consumed = consumed;\n        return -1; // Incomplete entity\n    }\n    /**\n     * Validate and emit a numeric entity.\n     *\n     * Implements the logic from the `Hexademical character reference start\n     * state` and `Numeric character reference end state` in the HTML spec.\n     * @param lastCp The last code point of the entity. Used to see if the\n     *               entity was terminated with a semicolon.\n     * @param expectedLength The minimum number of characters that should be\n     *                       consumed. Used to validate that at least one digit\n     *                       was consumed.\n     * @returns The number of characters that were consumed.\n     */\n    emitNumericEntity(lastCp, expectedLength) {\n        // Ensure we consumed at least one digit.\n        if (this.consumed <= expectedLength) {\n            this.errors?.absenceOfDigitsInNumericCharacterReference(this.consumed);\n            return 0;\n        }\n        // Figure out if this is a legit end of the entity\n        if (lastCp === CharCodes.SEMI) {\n            this.consumed += 1;\n        }\n        else if (this.decodeMode === DecodingMode.Strict) {\n            return 0;\n        }\n        this.emitCodePoint((this.decodeTree === xmlDecodeTree\n            ? replaceCodePointXML\n            : replaceCodePoint)(this.result), this.consumed);\n        if (this.errors) {\n            if (lastCp !== CharCodes.SEMI) {\n                this.errors.missingSemicolonAfterCharacterReference();\n            }\n            this.errors.validateNumericCharacterReference(this.result);\n        }\n        return this.consumed;\n    }\n    /**\n     * Flush locally-tracked walk state back to the fields, then emit the\n     * recorded legacy match or reject (cold path — at most once per\n     * entity). Called after failed navigation (leaf node, branch miss, or\n     * compact-run mismatch). In attribute mode, reject if no legacy was\n     * recorded at the current node, if we descended past it, or if the\n     * pending input character is an invalid attribute terminator.\n     * @param consumed Locally-tracked consumed count.\n     * @param excess Locally-tracked excess count.\n     * @param char Pending input character (may be the mismatching char).\n     * @param valueLength Value length at the current trie node.\n     */\n    flushAndEmitLegacyOrReject(consumed, excess, char, valueLength) {\n        this.consumed = consumed;\n        this.excess = excess;\n        return this.result === 0 ||\n            (this.decodeMode === DecodingMode.Attribute &&\n                (valueLength === 0 ||\n                    excess > 1 ||\n                    isEntityInAttributeInvalidEnd(char)))\n            ? 0\n            : this.emitNotTerminatedNamedEntity();\n    }\n    /**\n     * Parses a named entity.\n     *\n     * Equivalent to the `Named character reference state` in the HTML spec.\n     * @param input The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    stateNamedEntity(input, offset) {\n        const { decodeTree } = this;\n        const inputLength = input.length;\n        const isStrict = this.decodeMode === DecodingMode.Strict;\n        /*\n         * Local copies of the resumable walk state avoid per-character\n         * field writes. They are flushed back to the fields\n         * on every exit (chunk end, and before any emit helper that reads\n         * them). `this.result` is only written at the (rare) record points,\n         * so it stays a direct field write.\n         *\n         * Legacy-match recording happens in two idempotent places: at the\n         * loop top when sitting on a value node, and in the chunk-end\n         * epilogue (so `end()` sees matches that land exactly on a chunk\n         * boundary). Recording applies `consumed += excess - 1; excess = 1`,\n         * which is a no-op when repeated — the loop-top invariant is\n         * `excess` = unrecorded consumed characters + 1.\n         */\n        let { treeIndex } = this;\n        let { excess } = this;\n        let { consumed } = this;\n        let current = decodeTree[treeIndex];\n        while (offset < inputLength) {\n            /*\n             * Descend through value-less jump-table nodes (including the\n             * single-branch encoding) inline, mirroring `decodeWithTrie`:\n             * this avoids a `determineBranch` call per level for the\n             * dominant node shape — including the root on the first write.\n             */\n            while ((current &\n                (BinTrieFlags.VALUE_LENGTH | BinTrieFlags.FLAG13)) ===\n                0 &&\n                (current & BinTrieFlags.JUMP_TABLE) !== 0) {\n                const char = input.charCodeAt(offset);\n                const jumpOffset = current & BinTrieFlags.JUMP_TABLE;\n                const branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;\n                if (branchCount === 0) {\n                    // Single branch encoded inline in the jump offset bits.\n                    if (char !== jumpOffset) {\n                        return this.flushAndEmitLegacyOrReject(consumed, excess, char, 0);\n                    }\n                    treeIndex += 1;\n                }\n                else {\n                    const slot = char - jumpOffset;\n                    if (slot >>> 0 >= branchCount) {\n                        return this.flushAndEmitLegacyOrReject(consumed, excess, char, 0);\n                    }\n                    const stored = decodeTree[treeIndex + 1 + slot];\n                    if (stored === 0) {\n                        return this.flushAndEmitLegacyOrReject(consumed, excess, char, 0);\n                    }\n                    // End-relative: branch data ends at treeIndex+1+branchCount.\n                    treeIndex = (treeIndex + branchCount + stored) & 0xff_ff;\n                }\n                current = decodeTree[treeIndex];\n                offset += 1;\n                excess += 1;\n                /*\n                 * `charCodeAt` past the end returns NaN, which would alias\n                 * to slot 0 after `>>> 0` — bail out explicitly.\n                 */\n                // eslint-disable-next-line unicorn/no-break-in-nested-loop\n                if (offset >= inputLength)\n                    break;\n            }\n            if (offset >= inputLength)\n                break;\n            // Handle compact runs (resumable across chunks).\n            if ((current &\n                (BinTrieFlags.VALUE_LENGTH | BinTrieFlags.FLAG13)) ===\n                BinTrieFlags.FLAG13) {\n                const runLength = (current & BinTrieFlags.BRANCH_LENGTH) >> 7; /* 3..63 */\n                let { runConsumed } = this;\n                // If we are starting a run, check the first char.\n                if (runConsumed === 0) {\n                    const char = input.charCodeAt(offset);\n                    if (char !== (current & BinTrieFlags.JUMP_TABLE)) {\n                        return this.flushAndEmitLegacyOrReject(consumed, excess, char, 0);\n                    }\n                    offset += 1;\n                    excess += 1;\n                    runConsumed = 1;\n                }\n                // Check remaining characters in the run (packed two per uint16 word).\n                while (runConsumed < runLength) {\n                    if (offset >= inputLength) {\n                        this.treeIndex = treeIndex;\n                        this.excess = excess;\n                        this.consumed = consumed;\n                        this.runConsumed = runConsumed;\n                        return -1;\n                    }\n                    const charIndexInPacked = runConsumed - 1;\n                    const packedWord = decodeTree[treeIndex + 1 + (charIndexInPacked >> 1)];\n                    const expectedChar = (packedWord >> ((charIndexInPacked & 1) << 3)) & 0xff;\n                    const char = input.charCodeAt(offset);\n                    if (char !== expectedChar) {\n                        this.runConsumed = 0;\n                        return this.flushAndEmitLegacyOrReject(consumed, excess, char, 0);\n                    }\n                    offset += 1;\n                    excess += 1;\n                    runConsumed += 1;\n                }\n                this.runConsumed = 0;\n                treeIndex += 1 + (runLength >> 1);\n                current = decodeTree[treeIndex];\n                // Loop top handles the landed-on node (record/emit/branch).\n                continue;\n            }\n            // Header plus out-of-line value words; 0 means no value.\n            const valueLength = current >>> 14;\n            const char = input.charCodeAt(offset);\n            if (valueLength !== 0) {\n                // Record a legacy match (FLAG13 clear = semicolon optional).\n                if (!isStrict && (current & BinTrieFlags.FLAG13) === 0) {\n                    this.result = treeIndex;\n                    consumed += excess - 1;\n                    excess = 1;\n                }\n                /*\n                 * Implicit semicolon handling: emit immediately. Covers both\n                 * strict (FLAG13 set) and legacy entities — neither stores\n                 * an explicit `;` branch in the trie.\n                 */\n                if (char === CharCodes.SEMI) {\n                    return this.emitNamedEntityData(treeIndex, valueLength, consumed + excess);\n                }\n                /*\n                 * `valueLength === 1` packs the codepoint into the header\n                 * word's low 13 bits, where branch metadata also lives. Skip\n                 * the branch lookup on leaves so those value bits aren't\n                 * reinterpreted as branch offsets.\n                 */\n                if (valueLength === 1) {\n                    return this.flushAndEmitLegacyOrReject(consumed, excess, char, valueLength);\n                }\n            }\n            // Value-bearing or dictionary node: dispatch through determineBranch.\n            const next = determineBranch(decodeTree, current, treeIndex + (valueLength || 1), char);\n            if (next < 0) {\n                return this.flushAndEmitLegacyOrReject(consumed, excess, char, valueLength);\n            }\n            treeIndex = next;\n            current = decodeTree[treeIndex];\n            offset += 1;\n            excess += 1;\n        }\n        /*\n         * Chunk exhausted. Record a legacy match we may be sitting on, so a\n         * subsequent `end()` emits it, then persist the walk state.\n         */\n        if (!isStrict &&\n            current >>> 14 !== 0 &&\n            (current & BinTrieFlags.FLAG13) === 0) {\n            this.result = treeIndex;\n            consumed += excess - 1;\n            excess = 1;\n        }\n        this.treeIndex = treeIndex;\n        this.excess = excess;\n        this.consumed = consumed;\n        return -1;\n    }\n    /**\n     * Emit a named entity that was not terminated with a semicolon.\n     * @returns The number of characters consumed.\n     */\n    emitNotTerminatedNamedEntity() {\n        const { result, decodeTree } = this;\n        const valueLength = decodeTree[result] >>> 14;\n        this.emitNamedEntityData(result, valueLength, this.consumed);\n        this.errors?.missingSemicolonAfterCharacterReference();\n        return this.consumed;\n    }\n    /**\n     * Emit a named entity.\n     * @param result The index of the entity in the decode tree.\n     * @param valueLength Encoded value length (header plus any value words).\n     * @param consumed The number of characters consumed.\n     * @returns The number of characters consumed.\n     */\n    emitNamedEntityData(result, valueLength, consumed) {\n        const { decodeTree } = this;\n        this.emitCodePoint(valueLength === 1\n            ? decodeTree[result] & BinTrieFlags.VALUE_MASK\n            : decodeTree[result + 1], consumed);\n        if (valueLength === 3) {\n            // Emit the second UTF-16 code unit.\n            this.emitCodePoint(decodeTree[result + 2], consumed);\n        }\n        return consumed;\n    }\n    /**\n     * Signal to the parser that the end of the input was reached.\n     *\n     * Remaining data will be emitted and relevant errors will be produced.\n     * @returns The number of characters consumed.\n     */\n    end() {\n        switch (this.state) {\n            case EntityDecoderState.NamedEntity: {\n                // Emit a named entity if we have one.\n                return this.result !== 0 &&\n                    (this.decodeMode !== DecodingMode.Attribute ||\n                        this.result === this.treeIndex)\n                    ? this.emitNotTerminatedNamedEntity()\n                    : 0;\n            }\n            // Otherwise, emit a numeric entity if we have one.\n            case EntityDecoderState.NumericDecimal: {\n                return this.emitNumericEntity(0, 2);\n            }\n            case EntityDecoderState.NumericHex: {\n                return this.emitNumericEntity(0, 3);\n            }\n            case EntityDecoderState.NumericStart: {\n                this.errors?.absenceOfDigitsInNumericCharacterReference(this.consumed);\n                return 0;\n            }\n            default: {\n                // EntityStart or unknown — return 0.\n                return 0;\n            }\n        }\n    }\n}\n/**\n * Determines the branch of the current node that is taken given the current\n * character. This function is used to traverse the trie.\n *\n * See `BinTrieFlags` for the branch-data layouts handled here.\n * @param decodeTree The trie.\n * @param current The current node's header word.\n * @param nodeIndex Index of the node's first branch-data word (the header\n *   plus any value words have been skipped by the caller).\n * @param char The current character.\n * @returns The index of the next node, or -1 if no branch is taken.\n */\nexport function determineBranch(decodeTree, current, nodeIndex, char) {\n    const branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;\n    const jumpOffset = current & BinTrieFlags.JUMP_TABLE;\n    // Case 1: Single branch or jump table (jumpOffset encodes the first/only char code).\n    if (jumpOffset) {\n        if (branchCount === 0) {\n            // Single branch encoded inline in the jump offset bits.\n            return char === jumpOffset ? nodeIndex : -1;\n        }\n        /*\n         * Jump table: branchCount consecutive slots starting at jumpOffset.\n         * Unsigned comparison handles both < 0 and >= branchCount in one check.\n         */\n        const slot = char - jumpOffset;\n        if (slot >>> 0 >= branchCount)\n            return -1;\n        const stored = decodeTree[nodeIndex + slot];\n        /*\n         * 0 = empty slot (no branch); otherwise the child's offset from the\n         * end of the branch array, +1 (end-relative pointers compress\n         * better). `& 0xff_ff` mirrors the encoder's uint16 wrap for\n         * backreferences to already-encoded nodes.\n         */\n        return stored === 0\n            ? -1\n            : (nodeIndex + branchCount + stored - 1) & 0xff_ff;\n    }\n    /*\n     * Case 2: Packed dictionary. Linear scan — over 90% of dict nodes have\n     * <= 4 branches in the HTML trie, where the constant-factor savings\n     * dominate over binary search's asymptotic edge.\n     */\n    if (branchCount === 0)\n        return -1;\n    const packedKeySlots = (branchCount + 1) >> 1;\n    const branchEnd = nodeIndex + packedKeySlots + branchCount;\n    for (let index = 0; index < branchCount; index++) {\n        const packed = decodeTree[nodeIndex + (index >> 1)];\n        const key = (packed >> ((index & 1) << 3)) & 0xff;\n        if (key === char) {\n            const pointerIndex = nodeIndex + packedKeySlots + index;\n            // Pointers are relative to the end of the branch data.\n            return (branchEnd + decodeTree[pointerIndex]) & 0xff_ff;\n        }\n        // Keys are sorted; if we've passed `char`, no match is possible.\n        if (key > char)\n            return -1;\n    }\n    return -1;\n}\n/**\n * Read the decoded value from a trie node.\n * @param decodeTree The trie.\n * @param nodeIndex The index of the node.\n * @param valueLength The length of the value (1, 2, or 3).\n * @returns The decoded string.\n */\nfunction readTrieValue(decodeTree, nodeIndex, valueLength) {\n    if (valueLength === 1) {\n        return String.fromCharCode(decodeTree[nodeIndex] & BinTrieFlags.VALUE_MASK);\n    }\n    if (valueLength === 2) {\n        return String.fromCharCode(decodeTree[nodeIndex + 1]);\n    }\n    return String.fromCharCode(decodeTree[nodeIndex + 1], decodeTree[nodeIndex + 2]);\n}\n/**\n * Parse a numeric entity (`&#DDD;` or `&#xHHH;`).\n *\n * Encodes the result as `(consumed << CONSUMED_SHIFT) | codepoint` (see\n * the packing comment at the top of the file; overlong entities spill\n * their length into `longNumericConsumed`). Returns 0 when no digits were\n * found.\n *\n * This is the sync counterpart of the streaming\n * `EntityDecoder#stateNumericDecimal` / `#stateNumericHex`. Digit parsing\n * matches those methods; only this packed result needs a value clamp.\n * @param input       The input string.\n * @param numberStart Index of the `#` character.\n * @param inputLength Cached `input.length`.\n */\nfunction parseNumericEntity(input, numberStart, inputLength) {\n    let offset = numberStart + 1; // Skip \"#\"\n    let cp = 0;\n    let digitStart = offset;\n    /*\n     * Separate decimal and hexadecimal loops: each multiplies by a constant\n     * and runs a single digit test, instead of a per-character base check.\n     */\n    if (offset < inputLength &&\n        (input.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) {\n        offset += 1;\n        digitStart = offset;\n        while (offset < inputLength) {\n            const char = input.charCodeAt(offset);\n            if (isNumber(char)) {\n                cp = cp * 16 + (char - CharCodes.ZERO);\n            }\n            else if (isHexadecimalCharacter(char)) {\n                cp = cp * 16 + ((char | TO_LOWER_BIT) - CharCodes.LOWER_A + 10);\n            }\n            else {\n                break;\n            }\n            offset += 1;\n        }\n    }\n    else {\n        while (offset < inputLength) {\n            const digit = input.charCodeAt(offset) - CharCodes.ZERO;\n            if (digit >>> 0 > 9)\n                break;\n            cp = cp * 10 + digit;\n            offset += 1;\n        }\n    }\n    if (offset === digitStart)\n        return 0;\n    // Include the semicolon in consumed when present.\n    if (offset < inputLength && input.charCodeAt(offset) === CharCodes.SEMI) {\n        offset += 1;\n    }\n    /*\n     * Clamp out-of-range values to 0x110000 so they fit the 21-bit field\n     * and decode to U+FFFD. Lengths at or above CONSUMED_OVERFLOW use the\n     * side channel described with the packing constants.\n     */\n    if (cp > 0x10_ff_ff)\n        cp = 0x11_00_00;\n    let consumed = offset - numberStart;\n    if (consumed >= CONSUMED_OVERFLOW) {\n        // eslint-disable-next-line unicorn/no-top-level-assignment-in-function -- deliberate side channel, see `longNumericConsumed`\n        longNumericConsumed = consumed;\n        consumed = CONSUMED_OVERFLOW;\n    }\n    return (consumed << CONSUMED_SHIFT) | cp;\n}\n/**\n * Decode all entities in `input` using the HTML trie.\n *\n * Hard-wired to `htmlDecodeTree`: the inline root navigation below assumes\n * the HTML root's jump-table shape, so this must not be generalized to\n * other tries (the XML trie's dictionary root would silently match no\n * entities — `decodeXML` has its own hand-coded fast path instead).\n * @param input      The string to decode.\n * @param isStrict Only match semicolon-terminated entities.\n * @param isAttribute Whether to apply attribute-specific parsing rules (disallowing certain non-semicolon terminators).\n * @returns The decoded string.\n */\nfunction decodeWithTrie(input, isStrict, isAttribute) {\n    const decodeTree = htmlDecodeTree;\n    // Fast path: no entities at all — return input without any allocation.\n    let offset = input.indexOf(\"&\");\n    if (offset < 0)\n        return input;\n    const inputLength = input.length;\n    /*\n     * `chunkStart` marks the start of the next pending slice. Rejected\n     * entities don't advance it, so consecutive rejections are stitched\n     * into a single `slice` once a real match (or end of input) is hit.\n     */\n    let chunkStart = 0;\n    let result = \"\";\n    /*\n     * Root navigation fields, hoisted out of the per-entity loop. The HTML\n     * root is a multi-branch jump-table covering [A-Za-z]; see the inline\n     * first-iteration comment below.\n     */\n    const root = decodeTree[0];\n    const rootJumpOffset = root & BinTrieFlags.JUMP_TABLE;\n    const rootBranchCount = (root & BinTrieFlags.BRANCH_LENGTH) >> 7;\n    do {\n        const entityStart = offset + 1;\n        // Quick check: entity names must start with [A-Za-z], numeric with #.\n        const firstChar = input.charCodeAt(entityStart);\n        let consumed;\n        let value;\n        if (firstChar === CharCodes.NUM) {\n            const packed = parseNumericEntity(input, entityStart, inputLength);\n            consumed = unpackConsumed(packed);\n            // In strict mode, require semicolon termination.\n            if (isStrict &&\n                consumed > 0 &&\n                input.charCodeAt(entityStart + consumed - 1) !== CharCodes.SEMI) {\n                consumed = 0;\n            }\n            value =\n                consumed === 0\n                    ? \"\"\n                    : codePointToString(packed & CODE_POINT_MASK);\n        }\n        else if (isAlpha(firstChar)) {\n            consumed = 0;\n            value = \"\";\n            /*\n             * The generator guarantees a jump-table root. Consume the first\n             * character directly, then walk from its child.\n             */\n            const rootSlotIndex = firstChar - rootJumpOffset;\n            let nodeIndex;\n            if (rootSlotIndex >>> 0 < rootBranchCount) {\n                const stored = decodeTree[1 + rootSlotIndex];\n                nodeIndex =\n                    stored === 0 ? -1 : (rootBranchCount + stored) & 0xff_ff;\n            }\n            else {\n                nodeIndex = -1;\n            }\n            /*\n             * Best legacy (no-semicolon) match so far, as trie coordinates.\n             * Deferring `readTrieValue` to the end avoids allocating a\n             * string for matches that longer matches supersede.\n             */\n            let bestNodeIndex = 0;\n            let bestValueLength = 0;\n            let current = nodeIndex < 0 ? 0 : decodeTree[nodeIndex];\n            let index = entityStart + 1;\n            /*\n             * Walk the trie from the root child. The `trie` label lets the\n             * inner descent and compact-run loops abandon the entity (and\n             * fall through to the legacy/reject handling) directly.\n             */\n            trie: while (index < inputLength) {\n                /*\n                 * Inline value-less jump tables and single branches. A miss\n                 * falls through to the recorded legacy match or rejection.\n                 */\n                while (\n                // Value-less, non-run node with a nonzero jump offset.\n                (current &\n                    (BinTrieFlags.VALUE_LENGTH | BinTrieFlags.FLAG13)) ===\n                    0 &&\n                    (current & BinTrieFlags.JUMP_TABLE) !== 0) {\n                    const jumpOffset = current & BinTrieFlags.JUMP_TABLE;\n                    const branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;\n                    if (branchCount === 0) {\n                        // Single branch encoded inline in the jump offset bits.\n                        if (input.charCodeAt(index) !== jumpOffset)\n                            break trie;\n                        nodeIndex += 1;\n                    }\n                    else {\n                        const slot = input.charCodeAt(index) - jumpOffset;\n                        if (slot >>> 0 >= branchCount)\n                            break trie;\n                        const stored = decodeTree[nodeIndex + 1 + slot];\n                        if (stored === 0)\n                            break trie;\n                        // End-relative: branch data ends at nodeIndex+1+branchCount.\n                        nodeIndex =\n                            (nodeIndex + branchCount + stored) & 0xff_ff;\n                    }\n                    current = decodeTree[nodeIndex];\n                    index += 1;\n                    /*\n                     * `charCodeAt` past the end returns NaN, which would\n                     * alias to slot 0 after `>>> 0` — bail out explicitly.\n                     */\n                    if (index >= inputLength)\n                        break trie;\n                }\n                // FLAG13 without a value marks a compact run.\n                if ((current &\n                    (BinTrieFlags.VALUE_LENGTH | BinTrieFlags.FLAG13)) ===\n                    BinTrieFlags.FLAG13) {\n                    const runLength = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;\n                    // Check first char (stored in JUMP_TABLE bits).\n                    if (input.charCodeAt(index) !==\n                        (current & BinTrieFlags.JUMP_TABLE)) {\n                        // eslint-disable-next-line unicorn/no-break-in-nested-loop\n                        break;\n                    }\n                    index += 1;\n                    // Check remaining characters (packed two per uint16 word).\n                    const remaining = runLength - 1;\n                    let wordIndex = nodeIndex + 1;\n                    let charIndexInPacked = 0;\n                    /*\n                     * Process pairs: read one packed word, compare low byte then high byte.\n                     * No explicit bounds check needed — charCodeAt returns NaN for OOB,\n                     * which never equals an integer, so the mismatch break fires naturally.\n                     */\n                    for (; charIndexInPacked + 1 < remaining; charIndexInPacked += 2) {\n                        const packed = decodeTree[wordIndex];\n                        if (input.charCodeAt(index) !== (packed & 0xff))\n                            break trie;\n                        index += 1;\n                        if (input.charCodeAt(index) !== ((packed >> 8) & 0xff))\n                            break trie;\n                        index += 1;\n                        wordIndex += 1;\n                    }\n                    // Handle odd trailing char.\n                    if (charIndexInPacked < remaining) {\n                        if (input.charCodeAt(index) !==\n                            (decodeTree[wordIndex] & 0xff))\n                            // eslint-disable-next-line unicorn/no-break-in-nested-loop\n                            break;\n                        index += 1;\n                    }\n                    nodeIndex += 1 + (runLength >> 1);\n                    current = decodeTree[nodeIndex];\n                    // eslint-disable-next-line unicorn/no-break-in-nested-loop\n                    continue;\n                }\n                // Header plus out-of-line value words; 0 means no value.\n                const valueLength = current >>> 14;\n                const char = input.charCodeAt(index);\n                /*\n                 * Check current node for a value before navigating.\n                 * This handles both: (a) values reached via compact runs on the\n                 * previous iteration, and (b) values at regular branch targets.\n                 */\n                if (valueLength !== 0) {\n                    // If char is `;`, emit immediately.\n                    if (char === CharCodes.SEMI) {\n                        consumed = index - entityStart + 1;\n                        // Inline leaves carry the value in the low 13 bits.\n                        value =\n                            valueLength === 1\n                                ? String.fromCharCode(current & BinTrieFlags.VALUE_MASK)\n                                : readTrieValue(decodeTree, nodeIndex, valueLength);\n                        // eslint-disable-next-line unicorn/no-break-in-nested-loop\n                        break;\n                    }\n                    // Record non-terminated (legacy) match (FLAG13 clear = semicolon optional).\n                    if (!isStrict && (current & BinTrieFlags.FLAG13) === 0) {\n                        consumed = index - entityStart;\n                        bestNodeIndex = nodeIndex;\n                        bestValueLength = valueLength;\n                    }\n                    /*\n                     * A valueLength of 1 means the value is packed inline in the header\n                     * word — these are always leaf nodes with no branches, so we can\n                     * stop walking the trie.\n                     */\n                    // eslint-disable-next-line unicorn/no-break-in-nested-loop\n                    if (valueLength === 1)\n                        break;\n                }\n                // Navigate to the next node (valueLength || 1: skip past value words, minimum 1 for header).\n                const next = determineBranch(decodeTree, current, nodeIndex + (valueLength || 1), char);\n                // eslint-disable-next-line unicorn/no-break-in-nested-loop\n                if (next < 0)\n                    break;\n                nodeIndex = next;\n                current = decodeTree[nodeIndex];\n                index += 1;\n            }\n            /*\n             * Post-loop: if the semicolon path didn't set value,\n             * check for a final legacy match. The last navigation may\n             * have landed on a legacy node whose value hasn't been\n             * recorded yet (loop exited before the top-of-loop check\n             * could run).\n             */\n            if (value === \"\") {\n                const finalVL = current >>> 14;\n                if (finalVL !== 0 &&\n                    !isStrict &&\n                    (current & BinTrieFlags.FLAG13) === 0) {\n                    consumed = index - entityStart;\n                    bestNodeIndex = nodeIndex;\n                    bestValueLength = finalVL;\n                }\n                if (consumed > 0) {\n                    value = readTrieValue(decodeTree, bestNodeIndex, bestValueLength);\n                }\n            }\n        }\n        else {\n            consumed = 0;\n            value = \"\";\n        }\n        /*\n         * The attribute end-char rule (HTML spec §13.2.5.73) only applies to\n         * unterminated *named* references.  Semicolon-terminated entities and\n         * numeric entities are always accepted, matching EntityDecoder behavior.\n         *\n         * When `attribute` is false (the common case), short-circuit skips all\n         * the unterminated-named checks entirely.\n         */\n        if (consumed === 0 ||\n            (isAttribute &&\n                firstChar !== CharCodes.NUM &&\n                input.charCodeAt(entityStart + consumed - 1) !==\n                    CharCodes.SEMI &&\n                entityStart + consumed < inputLength &&\n                isEntityInAttributeInvalidEnd(input.charCodeAt(entityStart + consumed)))) {\n            // Rejected: leave `&` in the pending chunk, scan past it.\n            offset = entityStart;\n        }\n        else {\n            if (chunkStart < offset) {\n                result += input.slice(chunkStart, offset);\n            }\n            result += value;\n            offset = chunkStart = entityStart + consumed;\n        }\n        /*\n         * Adjacent entities (`&x;&y;`) are common in entity-dense input;\n         * checking the single character at `offset` first skips the\n         * `indexOf` call (and its per-call overhead) for that case.\n         */\n        if (input.charCodeAt(offset) !== CharCodes.AMP) {\n            offset = input.indexOf(\"&\", offset);\n        }\n    } while (offset >= 0);\n    return result + input.slice(chunkStart);\n}\n/**\n * Decodes an HTML string.\n * @param htmlString The string to decode.\n * @param mode The decoding mode.\n * @returns The decoded string.\n */\nexport function decodeHTML(htmlString, mode = DecodingMode.Legacy) {\n    return decodeWithTrie(htmlString, mode === DecodingMode.Strict, mode === DecodingMode.Attribute);\n}\n/**\n * Decodes an HTML string in an attribute.\n * @param htmlAttribute The string to decode.\n * @returns The decoded string.\n */\nexport function decodeHTMLAttribute(htmlAttribute) {\n    return decodeWithTrie(htmlAttribute, false, true);\n}\n/**\n * Decodes an HTML string, requiring all entities to be terminated by a semicolon.\n * @param htmlString The string to decode.\n * @returns The decoded string.\n */\nexport function decodeHTMLStrict(htmlString) {\n    return decodeWithTrie(htmlString, true, false);\n}\n/**\n * Decodes an XML string, requiring all entities to be terminated by a semicolon.\n *\n * Uses a hand-coded fast path for the 5 XML named entities (amp, lt, gt,\n * quot, apos) plus numeric entities, bypassing the trie entirely.\n * @param xmlString The string to decode.\n * @returns The decoded string.\n */\nexport function decodeXML(xmlString) {\n    let offset = xmlString.indexOf(\"&\");\n    if (offset < 0)\n        return xmlString;\n    let lastIndex = 0;\n    let result = \"\";\n    do {\n        const start = offset + 1;\n        let consumed = 0;\n        let value = \"\";\n        const c1 = xmlString.charCodeAt(start);\n        if (c1 === CharCodes.NUM) {\n            const packed = parseNumericEntity(xmlString, start, xmlString.length);\n            consumed = unpackConsumed(packed);\n            // XML is always strict — require semicolon.\n            if (consumed === 0 ||\n                xmlString.charCodeAt(start + consumed - 1) !== CharCodes.SEMI) {\n                consumed = 0;\n            }\n            else {\n                const codePoint = packed & CODE_POINT_MASK;\n                // Nonzero BMP values below the surrogate range need no replacement.\n                value =\n                    (codePoint - 1) >>> 0 < 0xd7_ff\n                        ? String.fromCharCode(codePoint)\n                        : String.fromCodePoint(replaceCodePointXML(codePoint));\n            }\n        }\n        else {\n            /* eslint-disable unicorn/no-break-in-nested-loop -- Keep XML name dispatch inline with the decode loop. */\n            switch (c1) {\n                // &lt; / &gt;\n                case 0x6c:\n                case 0x67: {\n                    if (xmlString.charCodeAt(start + 1) === 0x74 &&\n                        xmlString.charCodeAt(start + 2) === CharCodes.SEMI) {\n                        consumed = 3;\n                        value = c1 === 0x6c ? \"<\" : \">\";\n                    }\n                    break;\n                }\n                // &amp; / &apos;\n                case 0x61: {\n                    const c2 = xmlString.charCodeAt(start + 1);\n                    if (c2 === 0x6d &&\n                        xmlString.charCodeAt(start + 2) === 0x70 &&\n                        xmlString.charCodeAt(start + 3) === CharCodes.SEMI) {\n                        consumed = 4;\n                        value = \"&\";\n                    }\n                    else if (c2 === 0x70 &&\n                        xmlString.charCodeAt(start + 2) === 0x6f &&\n                        xmlString.charCodeAt(start + 3) === 0x73 &&\n                        xmlString.charCodeAt(start + 4) === CharCodes.SEMI) {\n                        consumed = 5;\n                        value = \"'\";\n                    }\n                    break;\n                }\n                // &quot;\n                case 0x71: {\n                    if (xmlString.charCodeAt(start + 1) === 0x75 &&\n                        xmlString.charCodeAt(start + 2) === 0x6f &&\n                        xmlString.charCodeAt(start + 3) === 0x74 &&\n                        xmlString.charCodeAt(start + 4) === CharCodes.SEMI) {\n                        consumed = 5;\n                        value = '\"';\n                    }\n                    break;\n                }\n            }\n            /* eslint-enable unicorn/no-break-in-nested-loop */\n        }\n        if (consumed > 0) {\n            if (lastIndex < offset)\n                result += xmlString.slice(lastIndex, offset);\n            result += value;\n            offset = lastIndex = start + consumed;\n        }\n        else {\n            offset = start;\n        }\n        /*\n         * Adjacent entities (`&x;&y;`) are common in entity-dense input;\n         * checking the single character at `lastIndex` first skips the\n         * `indexOf` call (and its per-call overhead) for that case.\n         */\n        offset =\n            xmlString.charCodeAt(offset) === CharCodes.AMP\n                ? offset\n                : xmlString.indexOf(\"&\", offset);\n    } while (offset >= 0);\n    return result + xmlString.slice(lastIndex);\n}\nexport { replaceCodePoint, replaceCodePointXML, } from \"./decode-codepoint.js\";\n// Re-export for use by eg. htmlparser2\nexport { htmlDecodeTree } from \"./generated/decode-data-html.js\";\nexport { xmlDecodeTree } from \"./generated/decode-data-xml.js\";\n//# sourceMappingURL=decode.js.map","import { DecodingMode, EntityDecoder, htmlDecodeTree, xmlDecodeTree, } from \"entities/decode\";\nvar CharCodes;\n(function (CharCodes) {\n    CharCodes[CharCodes[\"Tab\"] = 9] = \"Tab\";\n    CharCodes[CharCodes[\"NewLine\"] = 10] = \"NewLine\";\n    CharCodes[CharCodes[\"FormFeed\"] = 12] = \"FormFeed\";\n    CharCodes[CharCodes[\"CarriageReturn\"] = 13] = \"CarriageReturn\";\n    CharCodes[CharCodes[\"Space\"] = 32] = \"Space\";\n    CharCodes[CharCodes[\"ExclamationMark\"] = 33] = \"ExclamationMark\";\n    CharCodes[CharCodes[\"Number\"] = 35] = \"Number\";\n    CharCodes[CharCodes[\"Amp\"] = 38] = \"Amp\";\n    CharCodes[CharCodes[\"SingleQuote\"] = 39] = \"SingleQuote\";\n    CharCodes[CharCodes[\"DoubleQuote\"] = 34] = \"DoubleQuote\";\n    CharCodes[CharCodes[\"Dash\"] = 45] = \"Dash\";\n    CharCodes[CharCodes[\"Slash\"] = 47] = \"Slash\";\n    CharCodes[CharCodes[\"Zero\"] = 48] = \"Zero\";\n    CharCodes[CharCodes[\"Nine\"] = 57] = \"Nine\";\n    CharCodes[CharCodes[\"Semi\"] = 59] = \"Semi\";\n    CharCodes[CharCodes[\"Lt\"] = 60] = \"Lt\";\n    CharCodes[CharCodes[\"Eq\"] = 61] = \"Eq\";\n    CharCodes[CharCodes[\"Gt\"] = 62] = \"Gt\";\n    CharCodes[CharCodes[\"Questionmark\"] = 63] = \"Questionmark\";\n    CharCodes[CharCodes[\"UpperA\"] = 65] = \"UpperA\";\n    CharCodes[CharCodes[\"LowerA\"] = 97] = \"LowerA\";\n    CharCodes[CharCodes[\"UpperF\"] = 70] = \"UpperF\";\n    CharCodes[CharCodes[\"LowerF\"] = 102] = \"LowerF\";\n    CharCodes[CharCodes[\"UpperZ\"] = 90] = \"UpperZ\";\n    CharCodes[CharCodes[\"LowerZ\"] = 122] = \"LowerZ\";\n    CharCodes[CharCodes[\"LowerX\"] = 120] = \"LowerX\";\n    CharCodes[CharCodes[\"OpeningSquareBracket\"] = 91] = \"OpeningSquareBracket\";\n})(CharCodes || (CharCodes = {}));\n/** All the states the tokenizer can be in. */\nvar State;\n(function (State) {\n    State[State[\"Text\"] = 1] = \"Text\";\n    State[State[\"BeforeTagName\"] = 2] = \"BeforeTagName\";\n    State[State[\"InTagName\"] = 3] = \"InTagName\";\n    State[State[\"InSelfClosingTag\"] = 4] = \"InSelfClosingTag\";\n    State[State[\"BeforeClosingTagName\"] = 5] = \"BeforeClosingTagName\";\n    State[State[\"InClosingTagName\"] = 6] = \"InClosingTagName\";\n    State[State[\"AfterClosingTagName\"] = 7] = \"AfterClosingTagName\";\n    // Attributes\n    State[State[\"BeforeAttributeName\"] = 8] = \"BeforeAttributeName\";\n    State[State[\"InAttributeName\"] = 9] = \"InAttributeName\";\n    State[State[\"AfterAttributeName\"] = 10] = \"AfterAttributeName\";\n    State[State[\"BeforeAttributeValue\"] = 11] = \"BeforeAttributeValue\";\n    State[State[\"InAttributeValueDq\"] = 12] = \"InAttributeValueDq\";\n    State[State[\"InAttributeValueSq\"] = 13] = \"InAttributeValueSq\";\n    State[State[\"InAttributeValueNq\"] = 14] = \"InAttributeValueNq\";\n    // Declarations\n    State[State[\"BeforeDeclaration\"] = 15] = \"BeforeDeclaration\";\n    State[State[\"InDeclaration\"] = 16] = \"InDeclaration\";\n    // Processing instructions\n    State[State[\"InProcessingInstruction\"] = 17] = \"InProcessingInstruction\";\n    // Comments & CDATA\n    State[State[\"BeforeComment\"] = 18] = \"BeforeComment\";\n    State[State[\"CDATASequence\"] = 19] = \"CDATASequence\";\n    State[State[\"DeclarationSequence\"] = 20] = \"DeclarationSequence\";\n    State[State[\"InSpecialComment\"] = 21] = \"InSpecialComment\";\n    State[State[\"InCommentLike\"] = 22] = \"InCommentLike\";\n    // Special tags\n    State[State[\"SpecialStartSequence\"] = 23] = \"SpecialStartSequence\";\n    State[State[\"InSpecialTag\"] = 24] = \"InSpecialTag\";\n    State[State[\"InPlainText\"] = 25] = \"InPlainText\";\n    State[State[\"InEntity\"] = 26] = \"InEntity\";\n})(State || (State = {}));\nfunction isWhitespace(c) {\n    return (c === CharCodes.Space ||\n        c === CharCodes.NewLine ||\n        c === CharCodes.Tab ||\n        c === CharCodes.FormFeed ||\n        c === CharCodes.CarriageReturn);\n}\nfunction isEndOfTagSection(c) {\n    return c === CharCodes.Slash || c === CharCodes.Gt || isWhitespace(c);\n}\nfunction isASCIIAlpha(c) {\n    return ((c >= CharCodes.LowerA && c <= CharCodes.LowerZ) ||\n        (c >= CharCodes.UpperA && c <= CharCodes.UpperZ));\n}\n/**\n * Quote style used for parsed attributes.\n */\nexport var QuoteType;\n(function (QuoteType) {\n    QuoteType[QuoteType[\"NoValue\"] = 0] = \"NoValue\";\n    QuoteType[QuoteType[\"Unquoted\"] = 1] = \"Unquoted\";\n    QuoteType[QuoteType[\"Single\"] = 2] = \"Single\";\n    QuoteType[QuoteType[\"Double\"] = 3] = \"Double\";\n})(QuoteType || (QuoteType = {}));\n/**\n * Sequences used to match longer strings.\n *\n * We don't have `Script`, `Style`, or `Title` here. Instead, we re-use the *End\n * sequences with an increased offset.\n */\nconst Sequences = {\n    Empty: new Uint8Array(0),\n    Cdata: new Uint8Array([0x43, 0x44, 0x41, 0x54, 0x41, 0x5b]), // CDATA[\n    CdataEnd: new Uint8Array([0x5d, 0x5d, 0x3e]), // ]]>\n    CommentEnd: new Uint8Array([0x2d, 0x2d, 0x21, 0x3e]), // `--!>`\n    Doctype: new Uint8Array([0x64, 0x6f, 0x63, 0x74, 0x79, 0x70, 0x65]), // `doctype`\n    IframeEnd: new Uint8Array([0x3c, 0x2f, 0x69, 0x66, 0x72, 0x61, 0x6d, 0x65]), // `</iframe`\n    NoembedEnd: new Uint8Array([\n        0x3c, 0x2f, 0x6e, 0x6f, 0x65, 0x6d, 0x62, 0x65, 0x64,\n    ]), // `</noembed`\n    NoframesEnd: new Uint8Array([\n        0x3c, 0x2f, 0x6e, 0x6f, 0x66, 0x72, 0x61, 0x6d, 0x65, 0x73,\n    ]), // `</noframes`\n    Plaintext: new Uint8Array([\n        0x3c, 0x2f, 0x70, 0x6c, 0x61, 0x69, 0x6e, 0x74, 0x65, 0x78, 0x74,\n    ]), // `</plaintext`\n    ScriptEnd: new Uint8Array([0x3c, 0x2f, 0x73, 0x63, 0x72, 0x69, 0x70, 0x74]), // `</script`\n    StyleEnd: new Uint8Array([0x3c, 0x2f, 0x73, 0x74, 0x79, 0x6c, 0x65]), // `</style`\n    TitleEnd: new Uint8Array([0x3c, 0x2f, 0x74, 0x69, 0x74, 0x6c, 0x65]), // `</title`\n    TextareaEnd: new Uint8Array([\n        0x3c, 0x2f, 0x74, 0x65, 0x78, 0x74, 0x61, 0x72, 0x65, 0x61,\n    ]), // `</textarea`\n    XmpEnd: new Uint8Array([0x3c, 0x2f, 0x78, 0x6d, 0x70]), // `</xmp`\n};\n/**\n * Maps the first lowercase character of an HTML tag name to the sequence\n * used for special-tag detection.  All sequences share a common layout\n * where index 2 is the first tag-name character, so matching always\n * continues from offset 3.\n */\nconst specialStartSequences = new Map([\n    [Sequences.IframeEnd[2], Sequences.IframeEnd],\n    [Sequences.NoembedEnd[2], Sequences.NoembedEnd],\n    [Sequences.Plaintext[2], Sequences.Plaintext],\n    [Sequences.ScriptEnd[2], Sequences.ScriptEnd],\n    [Sequences.TitleEnd[2], Sequences.TitleEnd],\n    [Sequences.XmpEnd[2], Sequences.XmpEnd],\n]);\n/**\n * Tokenizer implementation used by `Parser`.\n */\nexport default class Tokenizer {\n    cbs;\n    /** The current state the tokenizer is in. */\n    state = State.Text;\n    /** The read buffer. */\n    buffer = \"\";\n    /** The beginning of the section that is currently being read. */\n    sectionStart = 0;\n    /** The index within the buffer that we are currently looking at. */\n    index = 0;\n    /** The start of the last entity. */\n    entityStart = 0;\n    /** Some behavior, eg. when decoding entities, is done while we are in another state. This keeps track of the other state type. */\n    baseState = State.Text;\n    /** For special parsing behavior inside of script and style tags. */\n    isSpecial = false;\n    /** Indicates whether the tokenizer has been paused. */\n    running = true;\n    /** The offset of the current buffer. */\n    offset = 0;\n    xmlMode;\n    decodeEntities;\n    recognizeSelfClosing;\n    entityDecoder;\n    constructor({ xmlMode = false, decodeEntities = true, recognizeSelfClosing = xmlMode, }, cbs) {\n        this.cbs = cbs;\n        this.xmlMode = xmlMode;\n        this.decodeEntities = decodeEntities;\n        this.recognizeSelfClosing = recognizeSelfClosing;\n        this.entityDecoder = new EntityDecoder(xmlMode ? xmlDecodeTree : htmlDecodeTree, (cp, consumed) => this.emitCodePoint(cp, consumed));\n    }\n    reset() {\n        this.state = State.Text;\n        this.buffer = \"\";\n        this.sectionStart = 0;\n        this.index = 0;\n        this.baseState = State.Text;\n        this.isSpecial = false;\n        this.currentSequence = Sequences.Empty;\n        this.sequenceIndex = 0;\n        this.running = true;\n        this.offset = 0;\n    }\n    write(chunk) {\n        this.offset += this.buffer.length;\n        this.buffer = chunk;\n        this.parse();\n    }\n    end() {\n        if (this.running)\n            this.finish();\n    }\n    pause() {\n        this.running = false;\n    }\n    resume() {\n        this.running = true;\n        if (this.index < this.buffer.length + this.offset) {\n            this.parse();\n        }\n    }\n    stateText(c) {\n        if (c === CharCodes.Lt ||\n            (!this.decodeEntities && this.fastForwardTo(CharCodes.Lt))) {\n            if (this.index > this.sectionStart) {\n                this.cbs.ontext(this.sectionStart, this.index);\n            }\n            this.state = State.BeforeTagName;\n            this.sectionStart = this.index;\n        }\n        else if (this.decodeEntities && c === CharCodes.Amp) {\n            this.startEntity();\n        }\n    }\n    currentSequence = Sequences.Empty;\n    sequenceIndex = 0;\n    enterTagBody() {\n        if (this.currentSequence === Sequences.Plaintext) {\n            this.currentSequence = Sequences.Empty;\n            this.state = State.InPlainText;\n        }\n        else if (this.isSpecial) {\n            this.state = State.InSpecialTag;\n            this.sequenceIndex = 0;\n        }\n        else {\n            this.state = State.Text;\n        }\n    }\n    /**\n     * Match the opening tag name against an HTML text-only tag sequence.\n     *\n     * Some tags share an initial prefix (`script`/`style`, `title`/`textarea`,\n     * `noembed`/`noframes`), so we may switch to an alternate sequence at the\n     * first distinguishing byte.  On a successful full match we fall back to\n     * the normal tag-name state; a later `>` will enter raw-text, RCDATA, or\n     * plaintext mode based on `currentSequence` / `isSpecial`.\n     * @param c Current character code point.\n     */\n    stateSpecialStartSequence(c) {\n        const lower = c | 0x20;\n        // Still matching — check for an alternate sequence at branch points.\n        if (this.sequenceIndex < this.currentSequence.length) {\n            if (lower === this.currentSequence[this.sequenceIndex]) {\n                this.sequenceIndex++;\n                return;\n            }\n            if (this.sequenceIndex === 3) {\n                if (this.currentSequence === Sequences.ScriptEnd &&\n                    lower === Sequences.StyleEnd[3]) {\n                    this.currentSequence = Sequences.StyleEnd;\n                    this.sequenceIndex = 4;\n                    return;\n                }\n                if (this.currentSequence === Sequences.TitleEnd &&\n                    lower === Sequences.TextareaEnd[3]) {\n                    this.currentSequence = Sequences.TextareaEnd;\n                    this.sequenceIndex = 4;\n                    return;\n                }\n            }\n            else if (this.sequenceIndex === 4 &&\n                this.currentSequence === Sequences.NoembedEnd &&\n                lower === Sequences.NoframesEnd[4]) {\n                this.currentSequence = Sequences.NoframesEnd;\n                this.sequenceIndex = 5;\n                return;\n            }\n        }\n        else if (isEndOfTagSection(c)) {\n            // Full match on a valid tag boundary — keep the sequence.\n            this.sequenceIndex = 0;\n            this.state = State.InTagName;\n            this.stateInTagName(c);\n            return;\n        }\n        // No match — abandon special-tag detection.\n        this.isSpecial = false;\n        this.currentSequence = Sequences.Empty;\n        this.sequenceIndex = 0;\n        this.state = State.InTagName;\n        this.stateInTagName(c);\n    }\n    stateCDATASequence(c) {\n        if (c === Sequences.Cdata[this.sequenceIndex]) {\n            if (++this.sequenceIndex === Sequences.Cdata.length) {\n                this.state = State.InCommentLike;\n                this.currentSequence = Sequences.CdataEnd;\n                this.sequenceIndex = 0;\n                this.sectionStart = this.index + 1;\n            }\n        }\n        else {\n            this.sequenceIndex = 0;\n            if (this.xmlMode) {\n                this.state = State.InDeclaration;\n                this.stateInDeclaration(c); // Reconsume the character\n            }\n            else {\n                this.state = State.InSpecialComment;\n                this.stateInSpecialComment(c); // Reconsume the character\n            }\n        }\n    }\n    /**\n     * When we wait for one specific character, we can speed things up\n     * by skipping through the buffer until we find it.\n     * @param c Current character code point.\n     * @returns Whether the character was found.\n     */\n    fastForwardTo(c) {\n        while (++this.index < this.buffer.length + this.offset) {\n            if (this.buffer.charCodeAt(this.index - this.offset) === c) {\n                return true;\n            }\n        }\n        /*\n         * We increment the index at the end of the `parse` loop,\n         * so set it to `buffer.length - 1` here.\n         *\n         * TODO: Refactor `parse` to increment index before calling states.\n         */\n        this.index = this.buffer.length + this.offset - 1;\n        return false;\n    }\n    /**\n     * Emit a comment token and return to the text state.\n     * @param offset Number of characters in the end sequence that have already been matched.\n     */\n    emitComment(offset) {\n        this.cbs.oncomment(this.sectionStart, this.index, offset);\n        this.sequenceIndex = 0;\n        this.sectionStart = this.index + 1;\n        this.state = State.Text;\n    }\n    /**\n     * Comments and CDATA end with `-->` and `]]>`.\n     *\n     * Their common qualities are:\n     * - Their end sequences have a distinct character they start with.\n     * - That character is then repeated, so we have to check multiple repeats.\n     * - All characters but the start character of the sequence can be skipped.\n     * @param c Current character code point.\n     */\n    stateInCommentLike(c) {\n        if (!this.xmlMode &&\n            this.currentSequence === Sequences.CommentEnd &&\n            this.sequenceIndex <= 1 &&\n            /*\n             * We're still at the very start of the comment: the only\n             * characters consumed since `<!--` are the dashes that\n             * advanced sequenceIndex (0 for `<!-->`, 1 for `<!--->`).\n             */\n            this.index === this.sectionStart + this.sequenceIndex &&\n            c === CharCodes.Gt) {\n            // Abruptly closed empty HTML comment.\n            this.emitComment(this.sequenceIndex);\n        }\n        else if (this.currentSequence === Sequences.CommentEnd &&\n            this.sequenceIndex === 2 &&\n            c === CharCodes.Gt) {\n            // `!` is optional here, so the same sequence also accepts `-->`.\n            this.emitComment(2);\n        }\n        else if (this.currentSequence === Sequences.CommentEnd &&\n            this.sequenceIndex === this.currentSequence.length - 1 &&\n            c !== CharCodes.Gt) {\n            this.sequenceIndex = Number(c === CharCodes.Dash);\n        }\n        else if (c === this.currentSequence[this.sequenceIndex]) {\n            if (++this.sequenceIndex === this.currentSequence.length) {\n                if (this.currentSequence === Sequences.CdataEnd) {\n                    this.cbs.oncdata(this.sectionStart, this.index, 2);\n                }\n                else {\n                    this.cbs.oncomment(this.sectionStart, this.index, 3);\n                }\n                this.sequenceIndex = 0;\n                this.sectionStart = this.index + 1;\n                this.state = State.Text;\n            }\n        }\n        else if (this.sequenceIndex === 0) {\n            // Fast-forward to the first character of the sequence\n            if (this.fastForwardTo(this.currentSequence[0])) {\n                this.sequenceIndex = 1;\n            }\n        }\n        else if (c !== this.currentSequence[this.sequenceIndex - 1]) {\n            // Allow long sequences, eg. --->, ]]]>\n            this.sequenceIndex = 0;\n        }\n    }\n    /**\n     * HTML only allows ASCII alpha characters (a-z and A-Z) at the beginning of a tag name.\n     *\n     * XML allows a lot more characters here (@see https://www.w3.org/TR/REC-xml/#NT-NameStartChar).\n     * We allow anything that wouldn't end the tag.\n     * @param c Current character code point.\n     */\n    isTagStartChar(c) {\n        return this.xmlMode ? !isEndOfTagSection(c) : isASCIIAlpha(c);\n    }\n    /**\n     * Scan raw-text / RCDATA content for the matching end tag.\n     *\n     * For RCDATA tags (`<title>`, `<textarea>`) entities are decoded inline.\n     * For raw-text tags (`<script>`, `<style>`, etc.) we fast-forward to `<`.\n     * @param c Current character code point.\n     */\n    stateInSpecialTag(c) {\n        if (this.sequenceIndex === this.currentSequence.length) {\n            if (isEndOfTagSection(c)) {\n                const endOfText = this.index - this.currentSequence.length;\n                if (this.sectionStart < endOfText) {\n                    // Spoof the index so that reported locations match up.\n                    const actualIndex = this.index;\n                    this.index = endOfText;\n                    this.cbs.ontext(this.sectionStart, endOfText);\n                    this.index = actualIndex;\n                }\n                this.isSpecial = false;\n                this.sectionStart = endOfText + 2; // Skip over the `</`\n                this.stateInClosingTagName(c);\n                return; // We are done; skip the rest of the function.\n            }\n            this.sequenceIndex = 0;\n        }\n        if ((c | 0x20) === this.currentSequence[this.sequenceIndex]) {\n            this.sequenceIndex += 1;\n        }\n        else if (this.sequenceIndex === 0) {\n            if (this.currentSequence === Sequences.TitleEnd ||\n                this.currentSequence === Sequences.TextareaEnd) {\n                // RCDATA tags have to parse entities while still looking for their end tag.\n                if (this.decodeEntities && c === CharCodes.Amp) {\n                    this.startEntity();\n                }\n            }\n            else if (this.fastForwardTo(CharCodes.Lt)) {\n                // Outside of RCDATA tags, we can fast-forward.\n                this.sequenceIndex = 1;\n            }\n        }\n        else {\n            // If we see a `<`, set the sequence index to 1; useful for eg. `<</script>`.\n            this.sequenceIndex = Number(c === CharCodes.Lt);\n        }\n    }\n    stateBeforeTagName(c) {\n        if (c === CharCodes.ExclamationMark) {\n            this.state = State.BeforeDeclaration;\n            this.sectionStart = this.index + 1;\n        }\n        else if (c === CharCodes.Questionmark) {\n            if (this.xmlMode) {\n                this.state = State.InProcessingInstruction;\n                this.sequenceIndex = 0;\n                this.sectionStart = this.index + 1;\n            }\n            else {\n                this.state = State.InSpecialComment;\n                this.sectionStart = this.index;\n            }\n        }\n        else if (this.isTagStartChar(c)) {\n            this.sectionStart = this.index;\n            const special = this.xmlMode || this.cbs.isInForeignContext?.()\n                ? undefined\n                : specialStartSequences.get(c | 0x20);\n            if (special === undefined) {\n                this.state = State.InTagName;\n            }\n            else {\n                this.isSpecial = true;\n                this.currentSequence = special;\n                this.sequenceIndex = 3;\n                this.state = State.SpecialStartSequence;\n            }\n        }\n        else if (c === CharCodes.Slash) {\n            this.state = State.BeforeClosingTagName;\n        }\n        else {\n            this.state = State.Text;\n            this.stateText(c);\n        }\n    }\n    stateInTagName(c) {\n        if (isEndOfTagSection(c)) {\n            this.cbs.onopentagname(this.sectionStart, this.index);\n            this.sectionStart = -1;\n            this.state = State.BeforeAttributeName;\n            this.stateBeforeAttributeName(c);\n        }\n    }\n    stateBeforeClosingTagName(c) {\n        if (isWhitespace(c)) {\n            if (this.xmlMode) {\n                // Ignore\n            }\n            else {\n                this.state = State.InSpecialComment;\n                this.sectionStart = this.index;\n            }\n        }\n        else if (c === CharCodes.Gt) {\n            this.state = State.Text;\n            if (!this.xmlMode) {\n                this.sectionStart = this.index + 1;\n            }\n        }\n        else {\n            this.state = this.isTagStartChar(c)\n                ? State.InClosingTagName\n                : State.InSpecialComment;\n            this.sectionStart = this.index;\n        }\n    }\n    stateInClosingTagName(c) {\n        if (isEndOfTagSection(c)) {\n            this.cbs.onclosetag(this.sectionStart, this.index);\n            this.sectionStart = -1;\n            this.state = State.AfterClosingTagName;\n            this.stateAfterClosingTagName(c);\n        }\n    }\n    stateAfterClosingTagName(c) {\n        // Skip everything until \">\"\n        if (c === CharCodes.Gt || this.fastForwardTo(CharCodes.Gt)) {\n            this.state = State.Text;\n            this.sectionStart = this.index + 1;\n        }\n    }\n    stateBeforeAttributeName(c) {\n        if (c === CharCodes.Gt) {\n            this.cbs.onopentagend(this.index);\n            this.enterTagBody();\n            this.sectionStart = this.index + 1;\n        }\n        else if (c === CharCodes.Slash) {\n            this.state = State.InSelfClosingTag;\n        }\n        else if (!isWhitespace(c)) {\n            this.state = State.InAttributeName;\n            this.sectionStart = this.index;\n        }\n    }\n    /**\n     * Handle `/` before `>` in an opening tag.\n     *\n     * In HTML mode, text-only tags ignore the self-closing flag and still enter\n     * their raw-text/RCDATA/plaintext state unless self-closing tags are being\n     * recognized. In XML mode, or for ordinary tags, the tokenizer returns to\n     * regular text parsing after emitting the self-closing callback.\n     * @param c Current character code point.\n     */\n    stateInSelfClosingTag(c) {\n        if (c === CharCodes.Gt) {\n            this.cbs.onselfclosingtag(this.index);\n            this.sectionStart = this.index + 1;\n            if (!this.recognizeSelfClosing) {\n                this.enterTagBody();\n                return;\n            }\n            this.state = State.Text;\n            this.isSpecial = false; // Reset special state, in case of self-closing special tags\n            this.currentSequence = Sequences.Empty;\n        }\n        else if (!isWhitespace(c)) {\n            this.state = State.BeforeAttributeName;\n            this.stateBeforeAttributeName(c);\n        }\n    }\n    stateInAttributeName(c) {\n        if (c === CharCodes.Eq || isEndOfTagSection(c)) {\n            this.cbs.onattribname(this.sectionStart, this.index);\n            this.sectionStart = this.index;\n            this.state = State.AfterAttributeName;\n            this.stateAfterAttributeName(c);\n        }\n    }\n    stateAfterAttributeName(c) {\n        if (c === CharCodes.Eq) {\n            this.state = State.BeforeAttributeValue;\n        }\n        else if (c === CharCodes.Slash || c === CharCodes.Gt) {\n            this.cbs.onattribend(QuoteType.NoValue, this.sectionStart);\n            this.sectionStart = -1;\n            this.state = State.BeforeAttributeName;\n            this.stateBeforeAttributeName(c);\n        }\n        else if (!isWhitespace(c)) {\n            this.cbs.onattribend(QuoteType.NoValue, this.sectionStart);\n            this.state = State.InAttributeName;\n            this.sectionStart = this.index;\n        }\n    }\n    stateBeforeAttributeValue(c) {\n        if (c === CharCodes.DoubleQuote) {\n            this.state = State.InAttributeValueDq;\n            this.sectionStart = this.index + 1;\n        }\n        else if (c === CharCodes.SingleQuote) {\n            this.state = State.InAttributeValueSq;\n            this.sectionStart = this.index + 1;\n        }\n        else if (!isWhitespace(c)) {\n            this.sectionStart = this.index;\n            this.state = State.InAttributeValueNq;\n            this.stateInAttributeValueNoQuotes(c); // Reconsume token\n        }\n    }\n    handleInAttributeValue(c, quote) {\n        if (c === quote ||\n            (!this.decodeEntities && this.fastForwardTo(quote))) {\n            this.cbs.onattribdata(this.sectionStart, this.index);\n            this.sectionStart = -1;\n            this.cbs.onattribend(quote === CharCodes.DoubleQuote\n                ? QuoteType.Double\n                : QuoteType.Single, this.index + 1);\n            this.state = State.BeforeAttributeName;\n        }\n        else if (this.decodeEntities && c === CharCodes.Amp) {\n            this.startEntity();\n        }\n    }\n    stateInAttributeValueDoubleQuotes(c) {\n        this.handleInAttributeValue(c, CharCodes.DoubleQuote);\n    }\n    stateInAttributeValueSingleQuotes(c) {\n        this.handleInAttributeValue(c, CharCodes.SingleQuote);\n    }\n    stateInAttributeValueNoQuotes(c) {\n        if (isWhitespace(c) || c === CharCodes.Gt) {\n            this.cbs.onattribdata(this.sectionStart, this.index);\n            this.sectionStart = -1;\n            this.cbs.onattribend(QuoteType.Unquoted, this.index);\n            this.state = State.BeforeAttributeName;\n            this.stateBeforeAttributeName(c);\n        }\n        else if (this.decodeEntities && c === CharCodes.Amp) {\n            this.startEntity();\n        }\n    }\n    /**\n     * Distinguish between CDATA, declarations, HTML comments, and HTML bogus\n     * comments after `<!`.\n     *\n     * In HTML mode, only real comments and doctypes stay on declaration paths;\n     * everything else becomes a bogus comment terminated by the next `>`.\n     * @param c Current character code point.\n     */\n    stateBeforeDeclaration(c) {\n        if (c === CharCodes.OpeningSquareBracket) {\n            this.state = State.CDATASequence;\n            this.sequenceIndex = 0;\n        }\n        else if (this.xmlMode) {\n            this.state =\n                c === CharCodes.Dash\n                    ? State.BeforeComment\n                    : State.InDeclaration;\n        }\n        else if ((c | 0x20) === Sequences.Doctype[0]) {\n            this.state = State.DeclarationSequence;\n            this.currentSequence = Sequences.Doctype;\n            this.sequenceIndex = 1;\n        }\n        else if (c === CharCodes.Gt) {\n            this.cbs.oncomment(this.sectionStart, this.index, 0);\n            this.state = State.Text;\n            this.sectionStart = this.index + 1;\n        }\n        else if (c === CharCodes.Dash) {\n            this.state = State.BeforeComment;\n        }\n        else {\n            this.state = State.InSpecialComment;\n        }\n    }\n    /**\n     * Continue matching `doctype` after `<!d`.\n     *\n     * A full `doctype` match stays on the declaration path; any other name falls\n     * back to an HTML bogus comment, which matches browser behavior for\n     * non-doctype `<!...>` constructs.\n     * @param c Current character code point.\n     */\n    stateDeclarationSequence(c) {\n        if (this.sequenceIndex === this.currentSequence.length) {\n            this.state = State.InDeclaration;\n            this.stateInDeclaration(c);\n        }\n        else if ((c | 0x20) === this.currentSequence[this.sequenceIndex]) {\n            this.sequenceIndex += 1;\n        }\n        else if (c === CharCodes.Gt) {\n            this.cbs.oncomment(this.sectionStart, this.index, 0);\n            this.state = State.Text;\n            this.sectionStart = this.index + 1;\n        }\n        else {\n            this.state = State.InSpecialComment;\n        }\n    }\n    stateInDeclaration(c) {\n        if (c === CharCodes.Gt || this.fastForwardTo(CharCodes.Gt)) {\n            this.cbs.ondeclaration(this.sectionStart, this.index);\n            this.state = State.Text;\n            this.sectionStart = this.index + 1;\n        }\n    }\n    /**\n     * XML processing instructions (`<?...?>`).\n     *\n     * In HTML mode `<?` is routed to `InSpecialComment` instead, so this\n     * state is only reachable in XML mode.\n     * @param c Current character code point.\n     */\n    stateInProcessingInstruction(c) {\n        if (c === CharCodes.Questionmark) {\n            // Remember that we just consumed `?`, so the next `>` closes the PI.\n            this.sequenceIndex = 1;\n        }\n        else if (c === CharCodes.Gt && this.sequenceIndex === 1) {\n            this.cbs.onprocessinginstruction(this.sectionStart, this.index - 1);\n            this.sequenceIndex = 0;\n            this.state = State.Text;\n            this.sectionStart = this.index + 1;\n        }\n        else {\n            // Keep scanning for the next `?`, which can start a closing `?>`.\n            this.sequenceIndex = Number(this.fastForwardTo(CharCodes.Questionmark));\n        }\n    }\n    stateBeforeComment(c) {\n        if (c === CharCodes.Dash) {\n            this.state = State.InCommentLike;\n            this.currentSequence = Sequences.CommentEnd;\n            this.sequenceIndex = 0;\n            this.sectionStart = this.index + 1;\n        }\n        else if (this.xmlMode) {\n            this.state = State.InDeclaration;\n        }\n        else if (c === CharCodes.Gt) {\n            this.cbs.oncomment(this.sectionStart, this.index, 0);\n            this.state = State.Text;\n            this.sectionStart = this.index + 1;\n        }\n        else {\n            this.state = State.InSpecialComment;\n        }\n    }\n    stateInSpecialComment(c) {\n        if (c === CharCodes.Gt || this.fastForwardTo(CharCodes.Gt)) {\n            this.cbs.oncomment(this.sectionStart, this.index, 0);\n            this.state = State.Text;\n            this.sectionStart = this.index + 1;\n        }\n    }\n    startEntity() {\n        this.baseState = this.state;\n        this.state = State.InEntity;\n        this.entityStart = this.index;\n        this.entityDecoder.startEntity(this.xmlMode\n            ? DecodingMode.Strict\n            : this.baseState === State.Text ||\n                this.baseState === State.InSpecialTag\n                ? DecodingMode.Legacy\n                : DecodingMode.Attribute);\n    }\n    stateInEntity() {\n        const indexInBuffer = this.index - this.offset;\n        const length = this.entityDecoder.write(this.buffer, indexInBuffer);\n        // If `length` is positive, we are done with the entity.\n        if (length >= 0) {\n            this.state = this.baseState;\n            if (length === 0) {\n                this.index -= 1;\n            }\n        }\n        else {\n            if (indexInBuffer < this.buffer.length &&\n                this.buffer.charCodeAt(indexInBuffer) === CharCodes.Amp) {\n                this.state = this.baseState;\n                this.index -= 1;\n                return;\n            }\n            // Mark buffer as consumed.\n            this.index = this.offset + this.buffer.length - 1;\n        }\n    }\n    /**\n     * Remove data that has already been consumed from the buffer.\n     */\n    cleanup() {\n        // If we are inside of text or attributes, emit what we already have.\n        if (this.running && this.sectionStart !== this.index) {\n            if (this.state === State.Text ||\n                this.state === State.InPlainText ||\n                (this.state === State.InSpecialTag && this.sequenceIndex === 0)) {\n                this.cbs.ontext(this.sectionStart, this.index);\n                this.sectionStart = this.index;\n            }\n            else if (this.state === State.InAttributeValueDq ||\n                this.state === State.InAttributeValueSq ||\n                this.state === State.InAttributeValueNq) {\n                this.cbs.onattribdata(this.sectionStart, this.index);\n                this.sectionStart = this.index;\n            }\n        }\n    }\n    shouldContinue() {\n        return this.index < this.buffer.length + this.offset && this.running;\n    }\n    /**\n     * Iterates through the buffer, calling the function corresponding to the current state.\n     *\n     * States that are more likely to be hit are higher up, as a performance improvement.\n     */\n    parse() {\n        while (this.shouldContinue()) {\n            const c = this.buffer.charCodeAt(this.index - this.offset);\n            switch (this.state) {\n                case State.Text: {\n                    this.stateText(c);\n                    break;\n                }\n                case State.InPlainText: {\n                    // Skip to end of buffer; cleanup() emits the text.\n                    this.index = this.buffer.length + this.offset - 1;\n                    break;\n                }\n                case State.SpecialStartSequence: {\n                    this.stateSpecialStartSequence(c);\n                    break;\n                }\n                case State.InSpecialTag: {\n                    this.stateInSpecialTag(c);\n                    break;\n                }\n                case State.CDATASequence: {\n                    this.stateCDATASequence(c);\n                    break;\n                }\n                case State.DeclarationSequence: {\n                    this.stateDeclarationSequence(c);\n                    break;\n                }\n                case State.InAttributeValueDq: {\n                    this.stateInAttributeValueDoubleQuotes(c);\n                    break;\n                }\n                case State.InAttributeName: {\n                    this.stateInAttributeName(c);\n                    break;\n                }\n                case State.InCommentLike: {\n                    this.stateInCommentLike(c);\n                    break;\n                }\n                case State.InSpecialComment: {\n                    this.stateInSpecialComment(c);\n                    break;\n                }\n                case State.BeforeAttributeName: {\n                    this.stateBeforeAttributeName(c);\n                    break;\n                }\n                case State.InTagName: {\n                    this.stateInTagName(c);\n                    break;\n                }\n                case State.InClosingTagName: {\n                    this.stateInClosingTagName(c);\n                    break;\n                }\n                case State.BeforeTagName: {\n                    this.stateBeforeTagName(c);\n                    break;\n                }\n                case State.AfterAttributeName: {\n                    this.stateAfterAttributeName(c);\n                    break;\n                }\n                case State.InAttributeValueSq: {\n                    this.stateInAttributeValueSingleQuotes(c);\n                    break;\n                }\n                case State.BeforeAttributeValue: {\n                    this.stateBeforeAttributeValue(c);\n                    break;\n                }\n                case State.BeforeClosingTagName: {\n                    this.stateBeforeClosingTagName(c);\n                    break;\n                }\n                case State.AfterClosingTagName: {\n                    this.stateAfterClosingTagName(c);\n                    break;\n                }\n                case State.InAttributeValueNq: {\n                    this.stateInAttributeValueNoQuotes(c);\n                    break;\n                }\n                case State.InSelfClosingTag: {\n                    this.stateInSelfClosingTag(c);\n                    break;\n                }\n                case State.InDeclaration: {\n                    this.stateInDeclaration(c);\n                    break;\n                }\n                case State.BeforeDeclaration: {\n                    this.stateBeforeDeclaration(c);\n                    break;\n                }\n                case State.BeforeComment: {\n                    this.stateBeforeComment(c);\n                    break;\n                }\n                case State.InProcessingInstruction: {\n                    this.stateInProcessingInstruction(c);\n                    break;\n                }\n                case State.InEntity: {\n                    this.stateInEntity();\n                    break;\n                }\n            }\n            this.index++;\n        }\n        this.cleanup();\n    }\n    finish() {\n        if (this.state === State.InEntity) {\n            this.entityDecoder.end();\n            this.state = this.baseState;\n        }\n        this.handleTrailingData();\n        this.cbs.onend();\n    }\n    handleTrailingCommentLikeData(endIndex) {\n        if (this.state !== State.InCommentLike) {\n            return false;\n        }\n        if (this.currentSequence === Sequences.CdataEnd) {\n            if (this.xmlMode) {\n                if (this.sectionStart < endIndex) {\n                    this.cbs.oncdata(this.sectionStart, endIndex, 0);\n                }\n            }\n            else {\n                /* In HTML mode, unclosed CDATA is a bogus comment. */\n                const cdataStart = this.sectionStart - Sequences.Cdata.length - 1;\n                this.cbs.oncomment(cdataStart, endIndex, 0);\n            }\n        }\n        else {\n            const offset = this.xmlMode\n                ? 0\n                : Math.min(this.sequenceIndex, Sequences.CommentEnd.length - 1);\n            this.cbs.oncomment(this.sectionStart, endIndex, offset);\n        }\n        return true;\n    }\n    handleTrailingMarkupDeclaration(endIndex) {\n        if (this.xmlMode) {\n            switch (this.state) {\n                case State.InSpecialComment:\n                case State.BeforeComment:\n                case State.CDATASequence:\n                case State.DeclarationSequence:\n                case State.InDeclaration: {\n                    this.cbs.ontext(this.sectionStart, endIndex);\n                    return true;\n                }\n                default: {\n                    return false;\n                }\n            }\n        }\n        switch (this.state) {\n            case State.BeforeDeclaration:\n            case State.InSpecialComment:\n            case State.BeforeComment:\n            case State.CDATASequence: {\n                this.cbs.oncomment(this.sectionStart, endIndex, 0);\n                return true;\n            }\n            case State.DeclarationSequence: {\n                if (this.sequenceIndex !== Sequences.Doctype.length) {\n                    this.cbs.oncomment(this.sectionStart, endIndex, 0);\n                }\n                return true;\n            }\n            case State.InDeclaration: {\n                return true;\n            }\n            default: {\n                return false;\n            }\n        }\n    }\n    /** Handle any trailing data. */\n    handleTrailingData() {\n        const endIndex = this.buffer.length + this.offset;\n        if (this.handleTrailingCommentLikeData(endIndex) ||\n            this.handleTrailingMarkupDeclaration(endIndex)) {\n            return;\n        }\n        // If there is no remaining data, we are done.\n        if (this.sectionStart >= endIndex) {\n            return;\n        }\n        switch (this.state) {\n            case State.InTagName:\n            case State.BeforeAttributeName:\n            case State.BeforeAttributeValue:\n            case State.AfterAttributeName:\n            case State.InAttributeName:\n            case State.InAttributeValueSq:\n            case State.InAttributeValueDq:\n            case State.InAttributeValueNq:\n            case State.InClosingTagName: {\n                /*\n                 * If we are currently in an opening or closing tag, us not calling the\n                 * respective callback signals that the tag should be ignored.\n                 */\n                break;\n            }\n            default: {\n                this.cbs.ontext(this.sectionStart, endIndex);\n            }\n        }\n    }\n    emitCodePoint(cp, consumed) {\n        if (this.baseState !== State.Text &&\n            this.baseState !== State.InSpecialTag) {\n            if (this.sectionStart < this.entityStart) {\n                this.cbs.onattribdata(this.sectionStart, this.entityStart);\n            }\n            this.sectionStart = this.entityStart + consumed;\n            this.index = this.sectionStart - 1;\n            this.cbs.onattribentity(cp);\n        }\n        else {\n            if (this.sectionStart < this.entityStart) {\n                this.cbs.ontext(this.sectionStart, this.entityStart);\n            }\n            this.sectionStart = this.entityStart + consumed;\n            this.index = this.sectionStart - 1;\n            this.cbs.ontextentity(cp, this.sectionStart);\n        }\n    }\n}\n//# sourceMappingURL=Tokenizer.js.map","const { fromCodePoint } = String;\nimport Tokenizer, { QuoteType } from \"./Tokenizer.js\";\nconst formTags = new Set([\n    \"input\",\n    \"option\",\n    \"optgroup\",\n    \"select\",\n    \"button\",\n    \"datalist\",\n    \"textarea\",\n]);\nconst pTag = new Set([\"p\"]);\nconst headingTags = new Set([\"h1\", \"h2\", \"h3\", \"h4\", \"h5\", \"h6\", \"p\"]);\nconst tableSectionTags = new Set([\"thead\", \"tbody\"]);\nconst ddtTags = new Set([\"dd\", \"dt\"]);\nconst rtpTags = new Set([\"rt\", \"rp\"]);\nconst openImpliesClose = new Map([\n    [\"tr\", new Set([\"tr\", \"th\", \"td\"])],\n    [\"th\", new Set([\"th\"])],\n    [\"td\", new Set([\"thead\", \"th\", \"td\"])],\n    [\"body\", new Set([\"head\", \"link\", \"script\"])],\n    [\"a\", new Set([\"a\"])],\n    [\"li\", new Set([\"li\"])],\n    [\"p\", pTag],\n    [\"h1\", headingTags],\n    [\"h2\", headingTags],\n    [\"h3\", headingTags],\n    [\"h4\", headingTags],\n    [\"h5\", headingTags],\n    [\"h6\", headingTags],\n    [\"select\", formTags],\n    [\"input\", formTags],\n    [\"output\", formTags],\n    [\"button\", formTags],\n    [\"datalist\", formTags],\n    [\"textarea\", formTags],\n    [\"option\", new Set([\"option\"])],\n    [\"optgroup\", new Set([\"optgroup\", \"option\"])],\n    [\"dd\", ddtTags],\n    [\"dt\", ddtTags],\n    [\"address\", pTag],\n    [\"article\", pTag],\n    [\"aside\", pTag],\n    [\"blockquote\", pTag],\n    [\"details\", pTag],\n    [\"div\", pTag],\n    [\"dl\", pTag],\n    [\"fieldset\", pTag],\n    [\"figcaption\", pTag],\n    [\"figure\", pTag],\n    [\"footer\", pTag],\n    [\"form\", pTag],\n    [\"header\", pTag],\n    [\"hr\", pTag],\n    [\"main\", pTag],\n    [\"nav\", pTag],\n    [\"ol\", pTag],\n    [\"pre\", pTag],\n    [\"section\", pTag],\n    [\"table\", pTag],\n    [\"ul\", pTag],\n    [\"rt\", rtpTags],\n    [\"rp\", rtpTags],\n    [\"tbody\", tableSectionTags],\n    [\"tfoot\", tableSectionTags],\n]);\nconst DOCUMENT_TYPE = \"doctype\";\nconst voidElements = new Set([\n    \"area\",\n    \"base\",\n    \"basefont\",\n    \"br\",\n    \"col\",\n    \"command\",\n    \"embed\",\n    \"frame\",\n    \"hr\",\n    \"img\",\n    \"input\",\n    \"isindex\",\n    \"keygen\",\n    \"link\",\n    \"meta\",\n    \"param\",\n    \"source\",\n    \"track\",\n    \"wbr\",\n]);\nconst foreignContextElements = new Set([\"math\", \"svg\"]);\n/**\n * Elements that can be used to integrate HTML content within foreign namespaces (e.g., SVG or MathML).\n *\n * Entries must use the SVG-adjusted casing (e.g. \"foreignObject\" not\n * \"foreignobject\") since they are compared against adjusted tag names.\n */\nconst htmlIntegrationElements = new Set([\n    \"mi\",\n    \"mo\",\n    \"mn\",\n    \"ms\",\n    \"mtext\",\n    \"annotation-xml\",\n    \"foreignObject\",\n    \"desc\",\n    \"title\",\n]);\nconst svgTagNameAdjustments = new Map([\n    [\"altglyph\", \"altGlyph\"],\n    [\"altglyphdef\", \"altGlyphDef\"],\n    [\"altglyphitem\", \"altGlyphItem\"],\n    [\"animatecolor\", \"animateColor\"],\n    [\"animatemotion\", \"animateMotion\"],\n    [\"animatetransform\", \"animateTransform\"],\n    [\"clippath\", \"clipPath\"],\n    [\"feblend\", \"feBlend\"],\n    [\"fecolormatrix\", \"feColorMatrix\"],\n    [\"fecomponenttransfer\", \"feComponentTransfer\"],\n    [\"fecomposite\", \"feComposite\"],\n    [\"feconvolvematrix\", \"feConvolveMatrix\"],\n    [\"fediffuselighting\", \"feDiffuseLighting\"],\n    [\"fedisplacementmap\", \"feDisplacementMap\"],\n    [\"fedistantlight\", \"feDistantLight\"],\n    [\"fedropshadow\", \"feDropShadow\"],\n    [\"feflood\", \"feFlood\"],\n    [\"fefunca\", \"feFuncA\"],\n    [\"fefuncb\", \"feFuncB\"],\n    [\"fefuncg\", \"feFuncG\"],\n    [\"fefuncr\", \"feFuncR\"],\n    [\"fegaussianblur\", \"feGaussianBlur\"],\n    [\"feimage\", \"feImage\"],\n    [\"femerge\", \"feMerge\"],\n    [\"femergenode\", \"feMergeNode\"],\n    [\"femorphology\", \"feMorphology\"],\n    [\"feoffset\", \"feOffset\"],\n    [\"fepointlight\", \"fePointLight\"],\n    [\"fespecularlighting\", \"feSpecularLighting\"],\n    [\"fespotlight\", \"feSpotLight\"],\n    [\"fetile\", \"feTile\"],\n    [\"feturbulence\", \"feTurbulence\"],\n    [\"foreignobject\", \"foreignObject\"],\n    [\"glyphref\", \"glyphRef\"],\n    [\"lineargradient\", \"linearGradient\"],\n    [\"radialgradient\", \"radialGradient\"],\n    [\"textpath\", \"textPath\"],\n]);\nvar ForeignContext;\n(function (ForeignContext) {\n    ForeignContext[ForeignContext[\"None\"] = 0] = \"None\";\n    ForeignContext[ForeignContext[\"Svg\"] = 1] = \"Svg\";\n    ForeignContext[ForeignContext[\"MathML\"] = 2] = \"MathML\";\n})(ForeignContext || (ForeignContext = {}));\nconst reNameEnd = /\\s|\\//;\n/**\n * Incremental parser implementation.\n */\nexport class Parser {\n    options;\n    /** The start index of the last event. */\n    startIndex = 0;\n    /** The end index of the last event. */\n    endIndex = 0;\n    /**\n     * Store the start index of the current open tag,\n     * so we can update the start index for attributes.\n     */\n    openTagStart = 0;\n    tagname = \"\";\n    attribname = \"\";\n    attribvalue = \"\";\n    attribs = null;\n    stack = [];\n    foreignContext;\n    cbs;\n    lowerCaseTagNames;\n    lowerCaseAttributeNames;\n    recognizeSelfClosing;\n    /** We are parsing HTML. Inverse of the `xmlMode` option. */\n    htmlMode;\n    tokenizer;\n    buffers = [];\n    bufferOffset = 0;\n    /** The index of the last written buffer. Used when resuming after a `pause()`. */\n    writeIndex = 0;\n    /** Indicates whether the parser has finished running / `.end` has been called. */\n    ended = false;\n    constructor(cbs, options = {}) {\n        this.options = options;\n        this.cbs = cbs ?? {};\n        this.htmlMode = !this.options.xmlMode;\n        this.lowerCaseTagNames = options.lowerCaseTags ?? this.htmlMode;\n        this.lowerCaseAttributeNames =\n            options.lowerCaseAttributeNames ?? this.htmlMode;\n        this.recognizeSelfClosing =\n            options.recognizeSelfClosing ?? !this.htmlMode;\n        this.tokenizer = new (options.Tokenizer ?? Tokenizer)(this.options, this);\n        this.foreignContext = [ForeignContext.None];\n        this.cbs.onparserinit?.(this);\n    }\n    // Tokenizer event handlers\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    ontext(start, endIndex) {\n        const data = this.getSlice(start, endIndex);\n        this.endIndex = endIndex - 1;\n        this.cbs.ontext?.(data);\n        this.startIndex = endIndex;\n    }\n    /**\n     * @param cp Current Unicode code point.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    ontextentity(cp, endIndex) {\n        this.endIndex = endIndex - 1;\n        this.cbs.ontext?.(fromCodePoint(cp));\n        this.startIndex = endIndex;\n    }\n    /** @internal */\n    isInForeignContext() {\n        return this.foreignContext[0] !== ForeignContext.None;\n    }\n    /**\n     * Checks if the current tag is a void element. Override this if you want\n     * to specify your own additional void elements.\n     * @param name Name of the pseudo selector.\n     */\n    isVoidElement(name) {\n        return this.htmlMode && voidElements.has(name);\n    }\n    /**\n     * Read a tag name from the buffer.\n     *\n     * When `lowerCaseTagNames` is enabled (the default in HTML mode), the name\n     * is lowercased and may be adjusted for SVG casing or the `image` → `img`\n     * alias.\n     * @param start Start index of the tag name in the buffer.\n     * @param endIndex End index of the tag name in the buffer.\n     */\n    readTagName(start, endIndex) {\n        const name = this.lowerCaseTagNames\n            ? this.getSlice(start, endIndex).toLowerCase()\n            : this.getSlice(start, endIndex);\n        if (!(this.lowerCaseTagNames && this.htmlMode)) {\n            return name;\n        }\n        if (this.foreignContext[0] === ForeignContext.Svg) {\n            return svgTagNameAdjustments.get(name) ?? name;\n        }\n        /*\n         * Closing tags for SVG elements inside HTML integration points\n         * (e.g. </foreignObject> while inside its own content) need case\n         * adjustment so the name matches what was pushed to the stack.\n         * `foreignContext.length > 1` means a foreign ancestor exists —\n         * the base [None] entry plus at least one pushed context.\n         */\n        if (this.foreignContext.length > 1) {\n            const adjusted = svgTagNameAdjustments.get(name);\n            if (adjusted !== undefined && this.stack.includes(adjusted)) {\n                return adjusted;\n            }\n        }\n        if (!this.isInForeignContext()) {\n            return name === \"image\" ? \"img\" : name;\n        }\n        return name;\n    }\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    onopentagname(start, endIndex) {\n        this.endIndex = endIndex;\n        this.emitOpenTag(this.readTagName(start, endIndex));\n    }\n    emitOpenTag(name) {\n        this.openTagStart = this.startIndex;\n        this.tagname = name;\n        /*\n         * The spec ignores a second <form> when one is already open.\n         * Setting tagname to \"\" suppresses all downstream effects: attribs\n         * stays null so endOpenTag is a no-op, and closeCurrentTag can't\n         * match \"\" on the stack.\n         */\n        if (this.htmlMode && name === \"form\" && this.stack.includes(\"form\")) {\n            this.tagname = \"\";\n            return;\n        }\n        const impliesClose = this.htmlMode && openImpliesClose.get(name);\n        if (impliesClose) {\n            while (this.stack.length > 0 && impliesClose.has(this.stack[0])) {\n                this.popElement(true);\n            }\n        }\n        if (!this.isVoidElement(name)) {\n            this.stack.unshift(name);\n            if (this.htmlMode) {\n                if (name === \"svg\") {\n                    this.foreignContext.unshift(ForeignContext.Svg);\n                }\n                else if (name === \"math\") {\n                    this.foreignContext.unshift(ForeignContext.MathML);\n                }\n                else if (htmlIntegrationElements.has(name)) {\n                    this.foreignContext.unshift(ForeignContext.None);\n                }\n            }\n        }\n        this.cbs.onopentagname?.(name);\n        if (this.cbs.onopentag)\n            this.attribs = {};\n    }\n    endOpenTag(isImplied) {\n        this.startIndex = this.openTagStart;\n        if (this.attribs) {\n            this.cbs.onopentag?.(this.tagname, this.attribs, isImplied);\n            this.attribs = null;\n        }\n        if (this.cbs.onclosetag && this.isVoidElement(this.tagname)) {\n            this.cbs.onclosetag(this.tagname, true);\n        }\n        this.tagname = \"\";\n    }\n    /**\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    onopentagend(endIndex) {\n        this.endIndex = endIndex;\n        this.endOpenTag(false);\n        // Set `startIndex` for next node\n        this.startIndex = endIndex + 1;\n    }\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    onclosetag(start, endIndex) {\n        this.endIndex = endIndex;\n        const name = this.readTagName(start, endIndex);\n        if (!this.isVoidElement(name)) {\n            const pos = this.stack.indexOf(name);\n            if (pos !== -1) {\n                for (let index = 0; index < pos; index++) {\n                    this.popElement(true);\n                }\n                this.popElement(false);\n            }\n            else if (this.htmlMode && name === \"p\") {\n                // Implicit open before close\n                this.emitOpenTag(\"p\");\n                this.closeCurrentTag(true);\n            }\n        }\n        else if (this.htmlMode && name === \"br\") {\n            // We can't use `emitOpenTag` for implicit open, as `br` would be implicitly closed.\n            this.cbs.onopentagname?.(\"br\");\n            this.cbs.onopentag?.(\"br\", {}, true);\n            this.cbs.onclosetag?.(\"br\", false);\n        }\n        // Set `startIndex` for next node\n        this.startIndex = endIndex + 1;\n    }\n    /**\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    onselfclosingtag(endIndex) {\n        this.endIndex = endIndex;\n        if (this.recognizeSelfClosing || this.isInForeignContext()) {\n            this.closeCurrentTag(false);\n            // Set `startIndex` for next node\n            this.startIndex = endIndex + 1;\n        }\n        else {\n            // Ignore the fact that the tag is self-closing.\n            this.onopentagend(endIndex);\n        }\n    }\n    /**\n     * Pop the top element off the stack, emit a close event, and maintain\n     * the foreign context stack.\n     * @param implied Whether this close is implied (not from an explicit end tag).\n     */\n    popElement(implied) {\n        // biome-ignore lint/style/noNonNullAssertion: The element is guaranteed to exist.\n        const element = this.stack.shift();\n        if (this.htmlMode &&\n            (foreignContextElements.has(element) ||\n                htmlIntegrationElements.has(element))) {\n            this.foreignContext.shift();\n        }\n        this.cbs.onclosetag?.(element, implied);\n    }\n    closeCurrentTag(isOpenImplied) {\n        const name = this.tagname;\n        this.endOpenTag(isOpenImplied);\n        // Self-closing tags will be on the top of the stack\n        if (this.stack[0] === name) {\n            this.popElement(!isOpenImplied);\n        }\n    }\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    onattribname(start, endIndex) {\n        this.startIndex = start;\n        const name = this.getSlice(start, endIndex);\n        this.attribname = this.lowerCaseAttributeNames\n            ? name.toLowerCase()\n            : name;\n    }\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    onattribdata(start, endIndex) {\n        this.attribvalue += this.getSlice(start, endIndex);\n    }\n    /**\n     * @param cp Current Unicode code point.\n     * @internal\n     */\n    onattribentity(cp) {\n        this.attribvalue += fromCodePoint(cp);\n    }\n    /**\n     * @param quote Quote type used for the current attribute.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    onattribend(quote, endIndex) {\n        this.endIndex = endIndex;\n        this.cbs.onattribute?.(this.attribname, this.attribvalue, quote === QuoteType.Double\n            ? '\"'\n            : quote === QuoteType.Single\n                ? \"'\"\n                : quote === QuoteType.NoValue\n                    ? undefined\n                    : null);\n        if (this.attribs && !Object.hasOwn(this.attribs, this.attribname)) {\n            this.attribs[this.attribname] = this.attribvalue;\n        }\n        this.attribvalue = \"\";\n    }\n    getInstructionName(value) {\n        const index = value.search(reNameEnd);\n        let name = index < 0 ? value : value.substr(0, index);\n        if (this.lowerCaseTagNames) {\n            name = name.toLowerCase();\n        }\n        return name;\n    }\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    ondeclaration(start, endIndex) {\n        this.endIndex = endIndex;\n        const value = this.getSlice(start, endIndex);\n        if (this.cbs.onprocessinginstruction) {\n            /*\n             * In HTML mode, ondeclaration is only reached for DOCTYPE\n             * (the tokenizer routes everything else to bogus comments).\n             */\n            const name = this.htmlMode\n                ? this.lowerCaseTagNames\n                    ? DOCUMENT_TYPE\n                    : value.slice(0, DOCUMENT_TYPE.length)\n                : this.getInstructionName(value);\n            this.cbs.onprocessinginstruction(`!${name}`, `!${value}`);\n        }\n        // Set `startIndex` for next node\n        this.startIndex = endIndex + 1;\n    }\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @internal\n     */\n    onprocessinginstruction(start, endIndex) {\n        this.endIndex = endIndex;\n        const value = this.getSlice(start, endIndex);\n        if (this.cbs.onprocessinginstruction) {\n            const name = this.getInstructionName(value);\n            this.cbs.onprocessinginstruction(`?${name}`, `?${value}`);\n        }\n        // Set `startIndex` for next node\n        this.startIndex = endIndex + 1;\n    }\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @param offset Offset applied when computing parser indices.\n     * @internal\n     */\n    oncomment(start, endIndex, offset) {\n        this.endIndex = endIndex;\n        this.cbs.oncomment?.(this.getSlice(start, endIndex - offset));\n        this.cbs.oncommentend?.();\n        // Set `startIndex` for next node\n        this.startIndex = endIndex + 1;\n    }\n    /**\n     * @param start Start index for the current parser event.\n     * @param endIndex End index for the current parser event.\n     * @param offset Offset applied when computing parser indices.\n     * @internal\n     */\n    oncdata(start, endIndex, offset) {\n        this.endIndex = endIndex;\n        const value = this.getSlice(start, endIndex - offset);\n        if (!this.htmlMode || this.options.recognizeCDATA) {\n            this.cbs.oncdatastart?.();\n            this.cbs.ontext?.(value);\n            this.cbs.oncdataend?.();\n        }\n        else if (this.isInForeignContext()) {\n            this.cbs.ontext?.(value);\n        }\n        else {\n            this.cbs.oncomment?.(`[CDATA[${value}]]`);\n            this.cbs.oncommentend?.();\n        }\n        // Set `startIndex` for next node\n        this.startIndex = endIndex + 1;\n    }\n    /** @internal */\n    onend() {\n        if (this.cbs.onclosetag) {\n            // Set the end index for all remaining tags\n            this.endIndex = this.startIndex;\n            for (let index = 0; index < this.stack.length; index++) {\n                this.cbs.onclosetag(this.stack[index], true);\n            }\n        }\n        this.cbs.onend?.();\n    }\n    /**\n     * Resets the parser to a blank state, ready to parse a new HTML document\n     */\n    reset() {\n        this.cbs.onreset?.();\n        this.tokenizer.reset();\n        this.tagname = \"\";\n        this.attribname = \"\";\n        this.attribvalue = \"\";\n        this.attribs = null;\n        this.stack.length = 0;\n        this.startIndex = 0;\n        this.endIndex = 0;\n        this.cbs.onparserinit?.(this);\n        this.buffers.length = 0;\n        this.foreignContext.length = 0;\n        this.foreignContext.unshift(ForeignContext.None);\n        this.bufferOffset = 0;\n        this.writeIndex = 0;\n        this.ended = false;\n    }\n    /**\n     * Resets the parser, then parses a complete document and\n     * pushes it to the handler.\n     * @param data Document to parse.\n     */\n    parseComplete(data) {\n        this.reset();\n        this.end(data);\n    }\n    getSlice(start, end) {\n        if (start === end) {\n            return \"\";\n        }\n        while (start - this.bufferOffset >= this.buffers[0].length) {\n            this.shiftBuffer();\n        }\n        let slice = this.buffers[0].slice(start - this.bufferOffset, end - this.bufferOffset);\n        while (end - this.bufferOffset > this.buffers[0].length) {\n            this.shiftBuffer();\n            slice += this.buffers[0].slice(0, end - this.bufferOffset);\n        }\n        return slice;\n    }\n    shiftBuffer() {\n        this.bufferOffset += this.buffers[0].length;\n        this.writeIndex--;\n        this.buffers.shift();\n    }\n    /**\n     * Parses a chunk of data and calls the corresponding callbacks.\n     * @param chunk Chunk to parse.\n     */\n    write(chunk) {\n        if (this.ended) {\n            this.cbs.onerror?.(new Error(\".write() after done!\"));\n            return;\n        }\n        this.buffers.push(chunk);\n        if (this.tokenizer.running) {\n            this.tokenizer.write(chunk);\n            this.writeIndex++;\n        }\n    }\n    /**\n     * Parses the end of the buffer and clears the stack, calls onend.\n     * @param chunk Optional final chunk to parse.\n     */\n    end(chunk) {\n        if (this.ended) {\n            this.cbs.onerror?.(new Error(\".end() after done!\"));\n            return;\n        }\n        if (chunk)\n            this.write(chunk);\n        this.ended = true;\n        this.tokenizer.end();\n    }\n    /**\n     * Pauses parsing. The parser won't emit events until `resume` is called.\n     */\n    pause() {\n        this.tokenizer.pause();\n    }\n    /**\n     * Resumes parsing after `pause` was called.\n     */\n    resume() {\n        this.tokenizer.resume();\n        while (this.tokenizer.running &&\n            this.writeIndex < this.buffers.length) {\n            this.tokenizer.write(this.buffers[this.writeIndex++]);\n        }\n        if (this.ended)\n            this.tokenizer.end();\n    }\n}\n//# sourceMappingURL=Parser.js.map","/** Types of elements found in htmlparser2's DOM */\nexport var ElementType;\n(function (ElementType) {\n    /** Type for the root element of a document */\n    ElementType[\"Root\"] = \"root\";\n    /** Type for Text */\n    ElementType[\"Text\"] = \"text\";\n    /** Type for <? ... ?> */\n    ElementType[\"Directive\"] = \"directive\";\n    /** Type for <!-- ... --> */\n    ElementType[\"Comment\"] = \"comment\";\n    /** Type for <script> tags */\n    ElementType[\"Script\"] = \"script\";\n    /** Type for <style> tags */\n    ElementType[\"Style\"] = \"style\";\n    /** Type for Any tag */\n    ElementType[\"Tag\"] = \"tag\";\n    /** Type for <![CDATA[ ... ]]> */\n    ElementType[\"CDATA\"] = \"cdata\";\n    /** Type for <!doctype ...> */\n    ElementType[\"Doctype\"] = \"doctype\";\n})(ElementType || (ElementType = {}));\n/**\n * Tests whether an element is a tag or not.\n * @param element Element to test\n * @param element.type Node type discriminator to check.\n */\nexport function isTag(element) {\n    return (element.type === ElementType.Tag ||\n        element.type === ElementType.Script ||\n        element.type === ElementType.Style);\n}\n// Exports for backwards compatibility\n/** Type for the root element of a document */\n// eslint-disable-next-line prefer-destructuring\nexport const Root = ElementType.Root;\n/** Type for Text */\n// eslint-disable-next-line prefer-destructuring\nexport const Text = ElementType.Text;\n/** Type for <? ... ?> */\n// eslint-disable-next-line prefer-destructuring\nexport const Directive = ElementType.Directive;\n/** Type for <!-- ... --> */\n// eslint-disable-next-line prefer-destructuring\nexport const Comment = ElementType.Comment;\n/** Type for <script> tags */\n// eslint-disable-next-line prefer-destructuring\nexport const Script = ElementType.Script;\n/** Type for <style> tags */\n// eslint-disable-next-line prefer-destructuring\nexport const Style = ElementType.Style;\n/** Type for Any tag */\n// eslint-disable-next-line prefer-destructuring\nexport const Tag = ElementType.Tag;\n/** Type for <![CDATA[ ... ]]> */\n// eslint-disable-next-line prefer-destructuring\nexport const CDATA = ElementType.CDATA;\n/** Type for <!doctype ...> */\n// eslint-disable-next-line prefer-destructuring\nexport const Doctype = ElementType.Doctype;\n","import { ElementType, isTag as isTagRaw } from \"domelementtype\";\n/**\n * This object will be used as the prototype for Nodes when creating a\n * DOM-Level-1-compliant structure.\n */\nexport class Node {\n    /** Parent of the node */\n    parent = null;\n    /** Previous sibling */\n    prev = null;\n    /** Next sibling */\n    next = null;\n    /** The start index of the node. Requires `withStartIndices` on the handler to be `true. */\n    startIndex = null;\n    /** The end index of the node. Requires `withEndIndices` on the handler to be `true. */\n    endIndex = null;\n    // Read-write aliases for properties\n    /**\n     * Same as {@link parent}.\n     * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.\n     */\n    get parentNode() {\n        return this.parent;\n    }\n    set parentNode(parent) {\n        this.parent = parent;\n    }\n    /**\n     * Same as {@link prev}.\n     * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.\n     */\n    get previousSibling() {\n        return this.prev;\n    }\n    set previousSibling(previous) {\n        this.prev = previous;\n    }\n    /**\n     * Same as {@link next}.\n     * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.\n     */\n    get nextSibling() {\n        return this.next;\n    }\n    set nextSibling(next) {\n        this.next = next;\n    }\n    /**\n     * Clone this node, and optionally its children.\n     * @param recursive Clone child nodes as well.\n     * @returns A clone of the node.\n     */\n    cloneNode(recursive = false) {\n        return cloneNode(this, recursive);\n    }\n}\n/**\n * A node that contains some data.\n */\nexport class DataNode extends Node {\n    data;\n    /**\n     * @param data The content of the data node\n     */\n    constructor(data) {\n        super();\n        this.data = data;\n    }\n    /**\n     * Same as {@link data}.\n     * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.\n     */\n    get nodeValue() {\n        return this.data;\n    }\n    set nodeValue(data) {\n        this.data = data;\n    }\n}\n/**\n * Text within the document.\n */\nexport class Text extends DataNode {\n    type = ElementType.Text;\n    get nodeType() {\n        return 3;\n    }\n}\n/**\n * Comments within the document.\n */\nexport class Comment extends DataNode {\n    type = ElementType.Comment;\n    get nodeType() {\n        return 8;\n    }\n}\n/**\n * Processing instructions, including doc types.\n */\nexport class ProcessingInstruction extends DataNode {\n    type = ElementType.Directive;\n    name;\n    constructor(name, data) {\n        super(data);\n        this.name = name;\n    }\n    get nodeType() {\n        return 1;\n    }\n    /** If this is a doctype, the document type name (parse5 only). */\n    \"x-name\";\n    /** If this is a doctype, the document type public identifier (parse5 only). */\n    \"x-publicId\";\n    /** If this is a doctype, the document type system identifier (parse5 only). */\n    \"x-systemId\";\n}\n/**\n * A node that can have children.\n */\nexport class NodeWithChildren extends Node {\n    children;\n    /**\n     * @param children Children of the node. Only certain node types can have children.\n     */\n    constructor(children) {\n        super();\n        this.children = children;\n    }\n    // Aliases\n    /** First child of the node. */\n    get firstChild() {\n        return this.children[0] ?? null;\n    }\n    /** Last child of the node. */\n    get lastChild() {\n        return this.children.length > 0\n            ? this.children[this.children.length - 1]\n            : null;\n    }\n    /**\n     * Same as {@link children}.\n     * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.\n     */\n    get childNodes() {\n        return this.children;\n    }\n    set childNodes(children) {\n        this.children = children;\n    }\n}\n/**\n * CDATA nodes.\n */\nexport class CDATA extends NodeWithChildren {\n    type = ElementType.CDATA;\n    get nodeType() {\n        return 4;\n    }\n}\n/**\n * The root node of the document.\n */\nexport class Document extends NodeWithChildren {\n    type = ElementType.Root;\n    get nodeType() {\n        return 9;\n    }\n}\n/**\n * An element within the DOM.\n */\nexport class Element extends NodeWithChildren {\n    name;\n    attribs;\n    type;\n    /**\n     * @param name Name of the tag, eg. `div`, `span`.\n     * @param attribs Object mapping attribute names to attribute values.\n     * @param children Children of the node.\n     * @param type Node type used for the new node instance.\n     */\n    constructor(name, attribs, children = [], type = name === \"script\"\n        ? ElementType.Script\n        : name === \"style\"\n            ? ElementType.Style\n            : ElementType.Tag) {\n        super(children);\n        this.name = name;\n        this.attribs = attribs;\n        this.type = type;\n    }\n    get nodeType() {\n        return 1;\n    }\n    // DOM Level 1 aliases\n    /**\n     * Same as {@link name}.\n     * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.\n     */\n    get tagName() {\n        return this.name;\n    }\n    set tagName(name) {\n        this.name = name;\n    }\n    get attributes() {\n        return Object.keys(this.attribs).map((name) => ({\n            name,\n            value: this.attribs[name],\n            namespace: this[\"x-attribsNamespace\"]?.[name],\n            prefix: this[\"x-attribsPrefix\"]?.[name],\n        }));\n    }\n    /** Element namespace (parse5 only). */\n    namespace;\n    /** Element attribute namespaces (parse5 only). */\n    \"x-attribsNamespace\";\n    /** Element attribute namespace-related prefixes (parse5 only). */\n    \"x-attribsPrefix\";\n}\n/**\n * Checks if `node` is an element node.\n * @param node Node to check.\n * @returns `true` if the node is an element node.\n */\nexport function isTag(node) {\n    return isTagRaw(node);\n}\n/**\n * Checks if `node` is a CDATA node.\n * @param node Node to check.\n * @returns `true` if the node is a CDATA node.\n */\nexport function isCDATA(node) {\n    return node.type === ElementType.CDATA;\n}\n/**\n * Checks if `node` is a text node.\n * @param node Node to check.\n * @returns `true` if the node is a text node.\n */\nexport function isText(node) {\n    return node.type === ElementType.Text;\n}\n/**\n * Checks if `node` is a comment node.\n * @param node Node to check.\n * @returns `true` if the node is a comment node.\n */\nexport function isComment(node) {\n    return node.type === ElementType.Comment;\n}\n/**\n * Checks if `node` is a directive node.\n * @param node Node to check.\n * @returns `true` if the node is a directive node.\n */\nexport function isDirective(node) {\n    return node.type === ElementType.Directive;\n}\n/**\n * Checks if `node` is a document node.\n * @param node Node to check.\n * @returns `true` if the node is a document node.\n */\nexport function isDocument(node) {\n    return node.type === ElementType.Root;\n}\n/**\n * Checks if `node` has children.\n * @param node Node to check.\n * @returns `true` if the node has children.\n */\nexport function hasChildren(node) {\n    return Object.hasOwn(node, \"children\");\n}\n/**\n * Clone a node, and optionally its children.\n * @param node Node to clone.\n * @param recursive Clone child nodes as well.\n * @returns A clone of the node.\n */\nexport function cloneNode(node, recursive = false) {\n    let result;\n    if (isText(node)) {\n        result = new Text(node.data);\n    }\n    else if (isComment(node)) {\n        result = new Comment(node.data);\n    }\n    else if (isTag(node)) {\n        const children = recursive ? cloneChildren(node.children) : [];\n        const clone = new Element(node.name, { ...node.attribs }, children);\n        for (const child of children) {\n            child.parent = clone;\n        }\n        if (node.namespace != null) {\n            clone.namespace = node.namespace;\n        }\n        if (node[\"x-attribsNamespace\"]) {\n            clone[\"x-attribsNamespace\"] = { ...node[\"x-attribsNamespace\"] };\n        }\n        if (node[\"x-attribsPrefix\"]) {\n            clone[\"x-attribsPrefix\"] = { ...node[\"x-attribsPrefix\"] };\n        }\n        result = clone;\n    }\n    else if (isCDATA(node)) {\n        const children = recursive ? cloneChildren(node.children) : [];\n        const clone = new CDATA(children);\n        for (const child of children) {\n            child.parent = clone;\n        }\n        result = clone;\n    }\n    else if (isDocument(node)) {\n        const children = recursive ? cloneChildren(node.children) : [];\n        const clone = new Document(children);\n        for (const child of children) {\n            child.parent = clone;\n        }\n        if (node[\"x-mode\"]) {\n            clone[\"x-mode\"] = node[\"x-mode\"];\n        }\n        result = clone;\n    }\n    else if (isDirective(node)) {\n        const instruction = new ProcessingInstruction(node.name, node.data);\n        if (node[\"x-name\"] != null) {\n            instruction[\"x-name\"] = node[\"x-name\"];\n            instruction[\"x-publicId\"] = node[\"x-publicId\"];\n            instruction[\"x-systemId\"] = node[\"x-systemId\"];\n        }\n        result = instruction;\n    }\n    else {\n        throw new Error(`Not implemented yet: ${node.type}`);\n    }\n    result.startIndex = node.startIndex;\n    result.endIndex = node.endIndex;\n    if (node.sourceCodeLocation != null) {\n        result.sourceCodeLocation = node.sourceCodeLocation;\n    }\n    return result;\n}\n/**\n * Clone a list of child nodes.\n * @param childs The child nodes to clone.\n * @returns A list of cloned child nodes.\n */\nfunction cloneChildren(childs) {\n    const children = childs.map((child) => cloneNode(child, true));\n    for (let index = 1; index < children.length; index++) {\n        children[index].prev = children[index - 1];\n        children[index - 1].next = children[index];\n    }\n    return children;\n}\n","import { ElementType } from \"domelementtype\";\nimport { CDATA, Comment, Document, Element, ProcessingInstruction, Text, } from \"./node.js\";\nexport * from \"./node.js\";\n// Default options\nconst defaultOptions = {\n    withStartIndices: false,\n    withEndIndices: false,\n    xmlMode: false,\n};\n/**\n * Event-based handler that builds a DOM tree from parser callbacks.\n */\nexport class DomHandler {\n    /** The elements of the DOM */\n    dom = [];\n    /** The root element for the DOM */\n    root = new Document(this.dom);\n    /** Called once parsing has completed. */\n    callback;\n    /** Settings for the handler. */\n    options;\n    /** Callback whenever a tag is closed. */\n    elementCB;\n    /** Indicated whether parsing has been completed. */\n    done = false;\n    /** Stack of open tags. */\n    tagStack = [this.root];\n    /** A data node that is still being written to. */\n    lastNode = null;\n    /** Reference to the parser instance. Used for location information. */\n    parser = null;\n    /**\n     * @param callback Called once parsing has completed.\n     * @param options Settings for the handler.\n     * @param elementCB Callback whenever a tag is closed.\n     */\n    constructor(callback, options, elementCB) {\n        // Make it possible to skip arguments, for backwards-compatibility\n        if (typeof options === \"function\") {\n            elementCB = options;\n            options = defaultOptions;\n        }\n        if (typeof callback === \"object\") {\n            options = callback;\n            callback = undefined;\n        }\n        this.callback = callback ?? null;\n        this.options = options ?? defaultOptions;\n        this.elementCB = elementCB ?? null;\n    }\n    onparserinit(parser) {\n        this.parser = parser;\n    }\n    // Resets the handler back to starting state\n    onreset() {\n        this.dom = [];\n        this.root = new Document(this.dom);\n        this.done = false;\n        this.tagStack = [this.root];\n        this.lastNode = null;\n        this.parser = null;\n    }\n    // Signals the handler that parsing is done\n    onend() {\n        if (this.done)\n            return;\n        this.done = true;\n        this.parser = null;\n        this.handleCallback(null);\n    }\n    onerror(error) {\n        this.handleCallback(error);\n    }\n    onclosetag() {\n        this.lastNode = null;\n        const element = this.tagStack.pop();\n        if (this.options.withEndIndices && this.parser) {\n            element.endIndex = this.parser.endIndex;\n        }\n        if (this.elementCB)\n            this.elementCB(element);\n    }\n    onopentag(name, attribs) {\n        const type = this.options.xmlMode ? ElementType.Tag : undefined;\n        const element = new Element(name, attribs, undefined, type);\n        this.addNode(element);\n        this.tagStack.push(element);\n    }\n    ontext(data) {\n        const { lastNode } = this;\n        if (lastNode && lastNode.type === ElementType.Text) {\n            lastNode.data += data;\n            if (this.options.withEndIndices && this.parser) {\n                lastNode.endIndex = this.parser.endIndex;\n            }\n        }\n        else {\n            const node = new Text(data);\n            this.addNode(node);\n            this.lastNode = node;\n        }\n    }\n    oncomment(data) {\n        if (this.lastNode && this.lastNode.type === ElementType.Comment) {\n            this.lastNode.data += data;\n            return;\n        }\n        const node = new Comment(data);\n        this.addNode(node);\n        this.lastNode = node;\n    }\n    oncommentend() {\n        this.lastNode = null;\n    }\n    oncdatastart() {\n        const text = new Text(\"\");\n        const node = new CDATA([text]);\n        this.addNode(node);\n        text.parent = node;\n        this.lastNode = text;\n    }\n    oncdataend() {\n        this.lastNode = null;\n    }\n    onprocessinginstruction(name, data) {\n        const node = new ProcessingInstruction(name, data);\n        this.addNode(node);\n    }\n    handleCallback(error) {\n        if (typeof this.callback === \"function\") {\n            this.callback(error, this.dom);\n        }\n        else if (error) {\n            throw error;\n        }\n    }\n    addNode(node) {\n        const parent = this.tagStack[this.tagStack.length - 1];\n        const previousSibling = parent.children[parent.children.length - 1];\n        if (this.options.withStartIndices && this.parser) {\n            node.startIndex = this.parser.startIndex;\n        }\n        if (this.options.withEndIndices && this.parser) {\n            node.endIndex = this.parser.endIndex;\n        }\n        parent.children.push(node);\n        if (previousSibling) {\n            node.prev = previousSibling;\n            previousSibling.next = node;\n        }\n        node.parent = parent;\n        this.lastNode = null;\n    }\n}\nexport default DomHandler;\n","import { Parser } from \"./Parser.js\";\nexport { Parser } from \"./Parser.js\";\nimport { DomHandler, } from \"domhandler\";\nexport { DomHandler, \n// Old name for DomHandler\nDomHandler as DefaultHandler, } from \"domhandler\";\n// Helper methods\n/**\n * Parses the data, returns the resulting document.\n * @param data The data that should be parsed.\n * @param options Optional options for the parser and DOM handler.\n */\nexport function parseDocument(data, options) {\n    const handler = new DomHandler(undefined, options);\n    new Parser(handler, options).end(data);\n    return handler.root;\n}\n/**\n * Creates a parser instance, with an attached DOM handler.\n * @param callback A callback that will be called once parsing has been completed, with the resulting document.\n * @param options Optional options for the parser and DOM handler.\n * @param elementCallback An optional callback that will be called every time a tag has been completed inside of the DOM.\n */\nexport function createDocumentStream(callback, options, elementCallback) {\n    const handler = new DomHandler((error) => callback(error, handler.root), options, elementCallback);\n    return new Parser(handler, options);\n}\n/*\n * All of the following exports exist for backwards-compatibility.\n * They should probably be removed eventually.\n */\nexport * as ElementType from \"domelementtype\";\nexport { default as Tokenizer, QuoteType, } from \"./Tokenizer.js\";\nimport { getFeed } from \"domutils\";\nexport { getFeed } from \"domutils\";\nconst parseFeedDefaultOptions = { xmlMode: true };\n/**\n * Parse a feed.\n * @param feed The feed that should be parsed, as a string.\n * @param options Optionally, options for parsing. When using this, you should set `xmlMode` to `true`.\n */\nexport function parseFeed(feed, options = parseFeedDefaultOptions) {\n    return getFeed(parseDocument(feed, options).children);\n}\nexport * as DomUtils from \"domutils\";\n//# sourceMappingURL=index.js.map","/**\n * Twine HTML decompiler: parse compiled Twine 2 or Twine 1 HTML back into a Story model.\n * Ported from storyload.go:loadHTML().\n */\nimport { parseDocument } from 'htmlparser2';\nimport type { Passage, PassageMetadata, Diagnostic, DecompileOptions } from './types.js';\nimport {\n  createStory,\n  storyAdd,\n  storyPrepend,\n  marshalStoryData,\n  unmarshalStorySettings,\n  withGeneratedName,\n  freeName,\n} from './story.js';\nimport { rot13, tiddlerUnescape } from './escape.js';\nimport { normalizeIFID, validateIFID } from './ifid.js';\nimport { isObfuscatable } from './passage.js';\n\nexport interface DecompileResult {\n  story: import('./types.js').Story;\n  diagnostics: Diagnostic[];\n}\n\n// Structural types matching domhandler's API (avoids direct import of domhandler).\ninterface HtmlNode {\n  type: string;\n  name?: string;\n  attribs?: Record<string, string>;\n  children?: HtmlNode[];\n  data?: string;\n}\n\n/** What decompiling reports beyond what it reads. */\ninterface DecompileChecks {\n  /** Report a missing or invalid `tw-storydata` IFID. */\n  readonly ifid: boolean;\n}\n\n/**\n * Parse a Twine 2 or Twine 1 compiled HTML file back into a Story model.\n * Tweego always trims passage text; here `trim: false` keeps it exactly, as for Twee sources.\n * A missing or invalid `tw-storydata` IFID is reported as a warning; an invalid one is kept as\n * written (uppercased), a missing one stays empty.\n */\nexport function decompileHTML(html: string, options: DecompileOptions = {}): DecompileResult {\n  return decompile(html, options, { ifid: true });\n}\n\n/**\n * `decompileHTML()` for loading an HTML file into a compile. The importer's StoryData passage is\n * checked when it is added to the story being compiled, which reports a missing or invalid IFID,\n * so the IFID is not reported here as well.\n */\nexport function decompileHTMLForImport(html: string, options: DecompileOptions = {}): DecompileResult {\n  return decompile(html, options, { ifid: false });\n}\n\nfunction decompile(html: string, options: DecompileOptions, checks: DecompileChecks): DecompileResult {\n  const diagnostics: Diagnostic[] = [];\n  const story = createStory();\n  const passageText = options.trim === false ? (text: string) => text : (text: string) => text.trim();\n\n  const doc = parseDocument(html) as unknown as HtmlNode;\n\n  // Try Twine 2 first (<tw-storydata>), then Twine 1 (<div id=\"store-area\"> or <div id=\"storeArea\">).\n  const twine2Data = findElement(doc, 'tw-storydata');\n  if (twine2Data) {\n    decompileTwine2(twine2Data, story, passageText, checks, diagnostics);\n    return { story, diagnostics };\n  }\n\n  const twine1Data = findElementByIdPattern(doc, /^store(?:-a|A)rea$/);\n  if (twine1Data) {\n    decompileTwine1(twine1Data, story, passageText, diagnostics);\n    return { story, diagnostics };\n  }\n\n  diagnostics.push({ level: 'error', message: 'Malformed HTML source; story data not found.' });\n  return { story, diagnostics };\n}\n\n/** Turns stored passage text into passage text: trimmed at both ends, or kept as is. */\ntype PassageText = (text: string) => string;\n\nfunction decompileTwine2(\n  storyData: HtmlNode,\n  story: import('./types.js').Story,\n  passageText: PassageText,\n  checks: DecompileChecks,\n  diagnostics: Diagnostic[],\n): void {\n  // Parse tw-storydata attributes.\n  let startnode = 0;\n  const attrs = storyData.attribs ?? {};\n\n  if (attrs['name']) story.name = attrs['name'];\n  if (attrs['startnode']) {\n    const parsed = parseInt(attrs['startnode'], 10);\n    if (Number.isNaN(parsed)) {\n      diagnostics.push({\n        level: 'warning',\n        message: `Cannot parse \"tw-storydata\" content attribute \"startnode\" as an integer; value \"${attrs['startnode']}\".`,\n      });\n    } else {\n      startnode = parsed;\n    }\n  }\n  if (attrs['ifid']) story.ifid = normalizeIFID(attrs['ifid']);\n  if (checks.ifid) diagnostics.push(...storyDataIFIDDiagnostics(attrs['ifid'] ?? ''));\n  if (attrs['zoom']) {\n    const parsed = parseFloat(attrs['zoom']);\n    if (Number.isNaN(parsed)) {\n      diagnostics.push({\n        level: 'warning',\n        message: `Cannot parse \"tw-storydata\" content attribute \"zoom\" as a float; value \"${attrs['zoom']}\".`,\n      });\n    } else {\n      story.twine2.zoom = parsed;\n    }\n  }\n  if (attrs['tags']) story.twine2.tags = attrs['tags'];\n  if (attrs['format']) story.twine2.format = attrs['format'];\n  if (attrs['format-version']) story.twine2.formatVersion = attrs['format-version'];\n  if (attrs['options']) {\n    for (const opt of attrs['options'].split(/\\s+/).filter((s: string) => s.length > 0)) {\n      story.twine2.options.set(opt, true);\n    }\n  }\n\n  // The story stylesheet and script get generated passage names. Ordinary passages may use those\n  // names too, so reserve every real passage name first and give the code passages names left free.\n  const children = storyData.children ?? [];\n  const takenNames = new Set(\n    children.filter((node) => node.type === 'tag' && node.name === 'tw-passagedata').map(passageDataName),\n  );\n\n  // Process child elements.\n  // htmlparser2 uses type 'style'/'script' for those elements instead of 'tag'.\n  for (const node of children) {\n    if (node.type !== 'tag' && node.type !== 'style' && node.type !== 'script') continue;\n\n    switch (node.name) {\n      case 'style':\n      case 'script': {\n        const content = getTextContent(node);\n        // Whitespace alone is no stylesheet or script, whether or not the text is trimmed.\n        if (content.trim().length === 0) continue;\n        const text = passageText(content);\n        const base = node.name === 'style' ? 'Story Stylesheet' : 'Story JavaScript';\n        const name = freeName(base, (n) => !takenNames.has(n));\n        takenNames.add(name);\n        const tags = node.name === 'style' ? ['stylesheet'] : ['script'];\n        // Marked as generated, so that it also yields to passages of other files (see storyAdd()).\n        storyAdd(story, withGeneratedName({ name, tags, text }, { kind: 'code', base }), diagnostics);\n        break;\n      }\n\n      case 'tw-tag': {\n        const tagAttrs = node.attribs ?? {};\n        const tagName = tagAttrs['name'] ?? '';\n        const tagColor = tagAttrs['color'] ?? '';\n        if (tagName) story.twine2.tagColors.set(tagName, tagColor);\n        break;\n      }\n\n      case 'tw-passagedata': {\n        let pid = 0;\n        const pAttrs = node.attribs ?? {};\n        const name = passageDataName(node);\n        const tags = pAttrs['tags'] ? pAttrs['tags'].split(/\\s+/).filter((s: string) => s.length > 0) : [];\n        const metadata: PassageMetadata = {};\n\n        if (pAttrs['pid']) {\n          const parsed = parseInt(pAttrs['pid'], 10);\n          if (Number.isNaN(parsed)) {\n            diagnostics.push({\n              level: 'warning',\n              message: `Cannot parse \"tw-passagedata\" content attribute \"pid\" as an integer; value \"${pAttrs['pid']}\".`,\n            });\n          } else {\n            pid = parsed;\n          }\n        }\n\n        if (pAttrs['position']) metadata.position = pAttrs['position'];\n        if (pAttrs['size']) metadata.size = pAttrs['size'];\n\n        if (pid === startnode && pid !== 0) {\n          story.twine2.start = name;\n        }\n\n        const text = passageText(getTextContent(node));\n        const passage: Passage = { name, tags, text };\n        if (metadata.position || metadata.size) {\n          passage.metadata = metadata;\n        }\n        storyAdd(story, passage, diagnostics);\n        break;\n      }\n    }\n  }\n\n  // Prepend StoryData passage with serialized metadata.\n  storyPrepend(story, { name: 'StoryData', tags: [], text: marshalStoryData(story) }, diagnostics);\n}\n\nfunction passageDataName(node: HtmlNode): string {\n  return node.attribs?.['name'] ?? '';\n}\n\n/** Diagnostics for the `ifid` attribute of `tw-storydata`; `value` is empty when it is missing. */\nfunction storyDataIFIDDiagnostics(value: string): Diagnostic[] {\n  if (value === '') {\n    return [\n      {\n        level: 'warning',\n        message: 'Story IFID not found; the \"tw-storydata\" content attribute \"ifid\" is missing or empty.',\n      },\n    ];\n  }\n  const err = validateIFID(value);\n  if (err === null) return [];\n  return [\n    {\n      level: 'warning',\n      message: `Cannot parse \"tw-storydata\" content attribute \"ifid\" as an IFID; value \"${value}\" (${err}).`,\n    },\n  ];\n}\n\nfunction decompileTwine1(\n  storeArea: HtmlNode,\n  story: import('./types.js').Story,\n  passageText: PassageText,\n  diagnostics: Diagnostic[],\n): void {\n  const passages = (storeArea.children ?? []).filter(isTiddler).map((node) => tiddlerToPassage(node, passageText));\n\n  // When StorySettings says `obfuscate:rot13`, Twine 1.4 (and twee-ts) ROT13-encode the name, tags and text of\n  // every obfuscatable tiddler, so read the settings before adding (and so interpreting) anything else. Whether a\n  // tiddler is obfuscatable is decided on its stored name and tags, which such tiddlers keep unencoded.\n  const obfuscated = isRot13Obfuscated(passages);\n  for (const p of passages) {\n    const passage =\n      obfuscated && isObfuscatable(p) ? { ...p, name: rot13(p.name), tags: p.tags.map(rot13), text: rot13(p.text) } : p;\n    storyAdd(story, passage, diagnostics);\n  }\n}\n\nfunction isTiddler(node: HtmlNode): boolean {\n  return node.type === 'tag' && node.name === 'div' && node.attribs !== undefined && 'tiddler' in node.attribs;\n}\n\nfunction tiddlerToPassage(node: HtmlNode, passageText: PassageText): Passage {\n  const nodeAttrs = node.attribs ?? {};\n  const name = nodeAttrs['tiddler'] ?? '';\n  const tags = nodeAttrs['tags'] ? nodeAttrs['tags'].split(/\\s+/).filter((s: string) => s.length > 0) : [];\n  const text = passageText(tiddlerUnescape(getTextContent(node)));\n\n  const passage: Passage = { name, tags, text };\n  const position = nodeAttrs['twine-position'];\n  if (position) {\n    passage.metadata = { position };\n  }\n  return passage;\n}\n\n/** Whether the StorySettings tiddlers turn on ROT13 obfuscation, read the way the writer reads them. */\nfunction isRot13Obfuscated(passages: readonly Passage[]): boolean {\n  const settings = createStory();\n  for (const p of passages) {\n    // Diagnostics are dropped here; storyAdd() reports them when the passage is added.\n    if (p.name === 'StorySettings') unmarshalStorySettings(settings, p.text, []);\n  }\n  return settings.twine1.settings.get('obfuscate') === 'rot13';\n}\n\nfunction findElement(node: HtmlNode, tagName: string): HtmlNode | undefined {\n  if (node.type === 'tag' && node.name === tagName) return node;\n  for (const child of node.children ?? []) {\n    const found = findElement(child, tagName);\n    if (found) return found;\n  }\n  return undefined;\n}\n\nfunction findElementByIdPattern(node: HtmlNode, idPattern: RegExp): HtmlNode | undefined {\n  if (node.type === 'tag' && node.attribs?.['id'] && idPattern.test(node.attribs['id'])) return node;\n  for (const child of node.children ?? []) {\n    const found = findElementByIdPattern(child, idPattern);\n    if (found) return found;\n  }\n  return undefined;\n}\n\nfunction getTextContent(el: HtmlNode): string {\n  let text = '';\n  for (const child of el.children ?? []) {\n    if (child.type === 'text' && child.data) {\n      text += child.data;\n    }\n  }\n  return text;\n}\n","/**\n * File loading: dispatch by file extension.\n * Ported from storyload.go.\n */\nimport { basename, resolve } from 'node:path';\nimport { statSync } from 'node:fs';\nimport type { Story, Diagnostic, InlineSource, Passage, FileCacheEntry } from './types.js';\nimport { normalizedFileExt, mediaTypeFromFilename, mediaTypeFromExt, fontFormatHint } from './media-types.js';\nimport { storyAdd, storyHas, storyPrepend, withGeneratedName } from './story.js';\nimport { parseTwee } from './parser.js';\nimport { decompileHTMLForImport } from './html-parser.js';\nimport { readUTF8, readBase64, baseNameWithoutExt, decodeText } from './util.js';\nimport type { DecodedText } from './util.js';\nimport { normalizeSourceText } from './source-text.js';\nimport { cssStringEscape } from './escape.js';\n\ninterface LoadOptions {\n  trim?: boolean;\n  twee2Compat?: boolean;\n}\n\n/**\n * Load all source files into a story.\n */\nexport function loadSources(\n  story: Story,\n  filenames: string[],\n  opts: LoadOptions,\n  diagnostics: Diagnostic[],\n  processedFiles: Set<string>,\n): void {\n  for (const filename of filenames) {\n    if (processedFiles.has(filename)) {\n      diagnostics.push({ level: 'warning', message: `load ${filename}: Skipping duplicate.` });\n      continue;\n    }\n\n    const ext = normalizedFileExt(filename);\n    try {\n      switch (ext) {\n        case 'tw':\n        case 'twee':\n          loadTwee(story, filename, opts, diagnostics);\n          break;\n        case 'tw2':\n        case 'twee2':\n          loadTwee(story, filename, { ...opts, twee2Compat: true }, diagnostics);\n          break;\n        case 'htm':\n        case 'html':\n          loadHTML(story, filename, opts, diagnostics);\n          break;\n        case 'css':\n          loadTagged(story, 'stylesheet', filename, diagnostics);\n          break;\n        case 'js':\n          loadTagged(story, 'script', filename, diagnostics);\n          break;\n        case 'otf':\n        case 'ttf':\n        case 'woff':\n        case 'woff2':\n          loadFont(story, filename, diagnostics);\n          break;\n        case 'gif':\n        case 'jpeg':\n        case 'jpg':\n        case 'png':\n        case 'svg':\n        case 'tif':\n        case 'tiff':\n        case 'webp':\n          loadMedia(story, 'Twine.image', filename, diagnostics);\n          break;\n        case 'aac':\n        case 'flac':\n        case 'm4a':\n        case 'mp3':\n        case 'oga':\n        case 'ogg':\n        case 'opus':\n        case 'wav':\n        case 'wave':\n        case 'weba':\n          loadMedia(story, 'Twine.audio', filename, diagnostics);\n          break;\n        case 'mp4':\n        case 'ogv':\n        case 'webm':\n          loadMedia(story, 'Twine.video', filename, diagnostics);\n          break;\n        case 'vtt':\n          loadMedia(story, 'Twine.vtt', filename, diagnostics);\n          break;\n        default:\n          continue;\n      }\n    } catch (e) {\n      diagnostics.push({\n        level: 'error',\n        message: `load ${filename}: ${e instanceof Error ? e.message : String(e)}`,\n        file: filename,\n      });\n      continue;\n    }\n    processedFiles.add(filename);\n  }\n\n  // Prepend StoryTitle if we have a name but no StoryTitle passage.\n  if (story.name !== '' && !story.passages.some((p) => p.name === 'StoryTitle')) {\n    storyPrepend(story, { name: 'StoryTitle', tags: [], text: story.name }, diagnostics);\n  }\n}\n\n/**\n * Load inline sources (string content or InlineSource objects).\n */\nexport function loadInlineSources(\n  story: Story,\n  sources: (string | InlineSource)[],\n  opts: LoadOptions,\n  diagnostics: Diagnostic[],\n): void {\n  for (const source of sources) {\n    if (typeof source === 'string') {\n      // Treat as a file path — handled externally\n      continue;\n    }\n    // Decode and normalize like readUTF8() does for files, so in-memory and on-disk sources load the same.\n    const decoded: DecodedText =\n      typeof source.content === 'string'\n        ? { text: source.content, diagnostics: [] }\n        : decodeText(source.content, source.filename);\n    diagnostics.push(...decoded.diagnostics);\n    const content = normalizeSourceText(decoded.text);\n\n    const ext = normalizedFileExt(source.filename);\n    switch (ext) {\n      case '':\n      case 'tw':\n      case 'twee':\n      case 'tw2':\n      case 'twee2': {\n        const twee2 = ext === 'tw2' || ext === 'twee2' || opts.twee2Compat;\n        const result = parseTwee(content, {\n          filename: source.filename,\n          trim: opts.trim ?? true,\n          twee2Compat: twee2,\n        });\n        diagnostics.push(...result.diagnostics);\n        for (const p of result.passages) {\n          storyAdd(story, p, diagnostics);\n        }\n        break;\n      }\n      case 'css':\n        storyAdd(story, codePassage(basename(source.filename), 'stylesheet', content), diagnostics);\n        break;\n      case 'js':\n        storyAdd(story, codePassage(basename(source.filename), 'script', content), diagnostics);\n        break;\n      default:\n        diagnostics.push({\n          level: 'warning',\n          message: `load ${source.filename}: in-memory sources of type .${ext} are not supported; skipped.`,\n        });\n    }\n  }\n}\n\ninterface ParseResult {\n  passages: Passage[];\n  diagnostics: Diagnostic[];\n}\n\nfunction parseTweeFile(filename: string, opts: LoadOptions): ParseResult {\n  const readDiagnostics: Diagnostic[] = [];\n  const source = readUTF8(filename, readDiagnostics);\n  const result = parseTwee(source, {\n    filename,\n    trim: opts.trim ?? true,\n    twee2Compat: opts.twee2Compat ?? false,\n  });\n  return { passages: result.passages, diagnostics: [...readDiagnostics, ...result.diagnostics] };\n}\n\n/**\n * A stylesheet or script passage named after its file, as Tweego names it. The name only labels\n * the code, so when another passage has it, the passage takes a free one (see `storyAdd()`).\n */\nfunction codePassage(name: string, tag: string, text: string): Passage {\n  return withGeneratedName({ name, tags: [tag], text }, { kind: 'code', base: name });\n}\n\n/** Mark every passage of a parse result as a code passage named after its file. */\nfunction codeNames(result: ParseResult): ParseResult {\n  for (const p of result.passages) withGeneratedName(p, { kind: 'code', base: p.name });\n  return result;\n}\n\nfunction parseTaggedFile(tag: string, filename: string): ParseResult {\n  const diagnostics: Diagnostic[] = [];\n  const source = readUTF8(filename, diagnostics);\n  return { passages: [codePassage(basename(filename), tag, source)], diagnostics };\n}\n\nfunction parseMediaFile(tag: string, filename: string): ParseResult {\n  const source = readBase64(filename);\n  const name = baseNameWithoutExt(filename);\n  const passage = { name, tags: [tag], text: `data:${mediaTypeFromFilename(filename)};base64,${source}` };\n  return {\n    passages: [withGeneratedName(passage, { kind: 'media', base: name, file: filename })],\n    diagnostics: [],\n  };\n}\n\nfunction parseFontFile(filename: string): ParseResult {\n  const source = readBase64(filename);\n  const name = basename(filename);\n  const family = baseNameWithoutExt(filename);\n  const ext = normalizedFileExt(filename);\n  const mediaType = mediaTypeFromExt(ext);\n  const hint = fontFormatHint(ext);\n  return codeNames({\n    passages: [\n      {\n        name,\n        tags: ['stylesheet'],\n        text: `@font-face {\\n\\tfont-family: \"${cssStringEscape(family)}\";\\n\\tsrc: url(\"data:${mediaType};base64,${source}\") format(\"${hint}\");\\n}`,\n      },\n    ],\n    diagnostics: [],\n  });\n}\n\nfunction parseHTMLFile(filename: string, opts: LoadOptions): ParseResult {\n  const readDiagnostics: Diagnostic[] = [];\n  const { story, diagnostics } = decompileHTMLForImport(readUTF8(filename, readDiagnostics), {\n    trim: opts.trim ?? true,\n  });\n  // Twine 2 HTML keeps the story name in an attribute, not a passage. Only passages reach the\n  // outer story (and the cache), so carry the name as a StoryTitle passage, as Twine 1 HTML does.\n  const passages =\n    story.name !== '' && !storyHas(story, 'StoryTitle')\n      ? [{ name: 'StoryTitle', tags: [], text: story.name }, ...story.passages]\n      : story.passages;\n  return { passages, diagnostics: [...readDiagnostics, ...diagnostics] };\n}\n\n/**\n * Identity of the options that affect how a file parses, stored on its cache entry.\n * Twee files depend on `trim` and `twee2Compat`, HTML files on `trim`; every other file type\n * yields the same key for all options.\n */\nfunction parseOptionsKey(filename: string, opts: LoadOptions): string {\n  const ext = normalizedFileExt(filename);\n  const trim = opts.trim ?? true;\n  if (ext === 'htm' || ext === 'html') return JSON.stringify({ trim });\n  const twee2File = ext === 'tw2' || ext === 'twee2';\n  if (!twee2File && ext !== 'tw' && ext !== 'twee') return '';\n  return JSON.stringify({ trim, twee2Compat: twee2File || (opts.twee2Compat ?? false) });\n}\n\nfunction parseFile(filename: string, opts: LoadOptions): ParseResult | undefined {\n  const ext = normalizedFileExt(filename);\n  switch (ext) {\n    case 'tw':\n    case 'twee':\n      return parseTweeFile(filename, opts);\n    case 'tw2':\n    case 'twee2':\n      return parseTweeFile(filename, { ...opts, twee2Compat: true });\n    case 'htm':\n    case 'html':\n      return parseHTMLFile(filename, opts);\n    case 'css':\n      return parseTaggedFile('stylesheet', filename);\n    case 'js':\n      return parseTaggedFile('script', filename);\n    case 'otf':\n    case 'ttf':\n    case 'woff':\n    case 'woff2':\n      return parseFontFile(filename);\n    case 'gif':\n    case 'jpeg':\n    case 'jpg':\n    case 'png':\n    case 'svg':\n    case 'tif':\n    case 'tiff':\n    case 'webp':\n      return parseMediaFile('Twine.image', filename);\n    case 'aac':\n    case 'flac':\n    case 'm4a':\n    case 'mp3':\n    case 'oga':\n    case 'ogg':\n    case 'opus':\n    case 'wav':\n    case 'wave':\n    case 'weba':\n      return parseMediaFile('Twine.audio', filename);\n    case 'mp4':\n    case 'ogv':\n    case 'webm':\n      return parseMediaFile('Twine.video', filename);\n    case 'vtt':\n      return parseMediaFile('Twine.vtt', filename);\n    default:\n      return undefined;\n  }\n}\n\nfunction loadHTML(story: Story, filename: string, opts: LoadOptions, diagnostics: Diagnostic[]): void {\n  const result = parseHTMLFile(filename, opts);\n  diagnostics.push(...result.diagnostics);\n  for (const p of result.passages) {\n    storyAdd(story, p, diagnostics);\n  }\n}\n\nfunction loadTwee(story: Story, filename: string, opts: LoadOptions, diagnostics: Diagnostic[]): void {\n  const result = parseTweeFile(filename, opts);\n  diagnostics.push(...result.diagnostics);\n  for (const p of result.passages) {\n    storyAdd(story, p, diagnostics);\n  }\n}\n\nfunction loadTagged(story: Story, tag: string, filename: string, diagnostics: Diagnostic[]): void {\n  const result = parseTaggedFile(tag, filename);\n  diagnostics.push(...result.diagnostics);\n  for (const p of result.passages) {\n    storyAdd(story, p, diagnostics);\n  }\n}\n\nfunction loadMedia(story: Story, tag: string, filename: string, diagnostics: Diagnostic[]): void {\n  const result = parseMediaFile(tag, filename);\n  for (const p of result.passages) {\n    storyAdd(story, p, diagnostics);\n  }\n}\n\nfunction loadFont(story: Story, filename: string, diagnostics: Diagnostic[]): void {\n  const result = parseFontFile(filename);\n  for (const p of result.passages) {\n    storyAdd(story, p, diagnostics);\n  }\n}\n\n/**\n * Load sources with mtime-based caching for incremental rebuilds.\n * Always creates a fresh Story; cached passages are replayed via storyAdd().\n */\nexport function loadSourcesCached(\n  story: Story,\n  filenames: string[],\n  opts: LoadOptions,\n  diagnostics: Diagnostic[],\n  processedFiles: Set<string>,\n  cache: Map<string, FileCacheEntry>,\n  changedFiles?: ReadonlySet<string>,\n  buildFiles?: ReadonlySet<string>,\n): void {\n  const currentFiles = new Set<string>(buildFiles);\n  // changedFiles may name a file in any form (absolute, `./`-prefixed or relative to the working\n  // directory); it is matched to `filenames`, whatever their form, by resolved path.\n  const changedPaths = changedFiles === undefined ? undefined : new Set([...changedFiles].map((f) => resolve(f)));\n\n  for (const filename of filenames) {\n    if (processedFiles.has(filename)) {\n      diagnostics.push({ level: 'warning', message: `load ${filename}: Skipping duplicate.` });\n      continue;\n    }\n\n    currentFiles.add(filename);\n    const optionsKey = parseOptionsKey(filename, opts);\n    // An entry parsed under other options (or without a recorded key) is stale.\n    const entry = cache.get(filename);\n    const cached = entry?.parseOptionsKey === optionsKey ? entry : undefined;\n    // A file changedFiles names is always reparsed: a save can keep the modification time\n    // (a timestamp-preserving write, or a filesystem with coarse timestamps).\n    const changed = changedPaths?.has(resolve(filename)) ?? false;\n\n    // If changedFiles is provided and this file isn't changed and we have a cache hit, skip stat\n    if (changedPaths && cached && !changed) {\n      diagnostics.push(...cached.diagnostics);\n      for (const p of cached.passages) {\n        storyAdd(story, p, diagnostics);\n      }\n      processedFiles.add(filename);\n      continue;\n    }\n\n    // stat the file to check mtime\n    let mtimeMs: number;\n    try {\n      mtimeMs = statSync(filename).mtimeMs;\n    } catch {\n      // File may have been deleted between getFilenames and here. Its entry goes too, so a\n      // later build that doesn't name it in changedFiles can't replay its old passages.\n      cache.delete(filename);\n      continue;\n    }\n\n    // Cache hit with matching mtime, for a file not known to have changed: replay\n    if (cached && !changed && cached.mtimeMs === mtimeMs) {\n      diagnostics.push(...cached.diagnostics);\n      for (const p of cached.passages) {\n        storyAdd(story, p, diagnostics);\n      }\n      processedFiles.add(filename);\n      continue;\n    }\n\n    // Cache miss: parse and store\n    try {\n      const result = parseFile(filename, opts);\n      if (!result) continue;\n\n      cache.set(filename, {\n        mtimeMs,\n        parseOptionsKey: optionsKey,\n        passages: result.passages,\n        diagnostics: result.diagnostics,\n      });\n\n      diagnostics.push(...result.diagnostics);\n      for (const p of result.passages) {\n        storyAdd(story, p, diagnostics);\n      }\n    } catch (e) {\n      // A file that fails to load keeps no entry: the next build tries it again, and reports\n      // the error again while it persists, rather than replaying its old passages.\n      cache.delete(filename);\n      diagnostics.push({\n        level: 'error',\n        message: `load ${filename}: ${e instanceof Error ? e.message : String(e)}`,\n        file: filename,\n      });\n      continue;\n    }\n    processedFiles.add(filename);\n  }\n\n  // Purge cache entries for deleted files\n  for (const key of cache.keys()) {\n    if (!currentFiles.has(key)) {\n      cache.delete(key);\n    }\n  }\n\n  // Prepend StoryTitle if we have a name but no StoryTitle passage.\n  if (story.name !== '' && !story.passages.some((p) => p.name === 'StoryTitle')) {\n    storyPrepend(story, { name: 'StoryTitle', tags: [], text: story.name }, diagnostics);\n  }\n}\n","/**\n * Single-pass placeholder substitution for story format templates.\n *\n * Every placeholder is found in the template text before anything is inserted, so inserted text (a story title,\n * passage data, a start passage name, module or head file content) is never scanned for placeholders.\n */\n\n/** A placeholder in a template and the text that replaces it. */\nexport interface TemplateSlot {\n  /** Regular expression source matching the placeholder. Must not contain capturing groups. */\n  readonly pattern: string;\n  /** Replace only the first match in the template, or every match. */\n  readonly occurrences: 'first' | 'all';\n  /** Text that replaces a match, given the matched text. Inserted literally and called only for a match. */\n  readonly replacement: (match: string) => string;\n  /**\n   * Whether the match at `offset` in the scanned `text` is a placeholder. A match it rejects is left as it is, and\n   * does not count as the first one. Every match is a placeholder when this is left out.\n   */\n  readonly accepts?: (text: string, offset: number) => boolean;\n}\n\n/** A piece of a template: text to scan for `slots`, or text inserted as is. */\nexport type TemplatePart =\n  | { readonly kind: 'scan'; readonly text: string; readonly slots: readonly TemplateSlot[] }\n  | { readonly kind: 'verbatim'; readonly text: string };\n\n/**\n * An HTML closing head tag: `</head` in any letter case, followed by whitespace, `/` or `>`, up to the next `>`.\n * This is how the HTML tokenizer reads an end tag; it ignores whatever sits between the tag name and the `>`.\n */\nexport const CLOSING_HEAD_TAG = '<\\\\/[Hh][Ee][Aa][Dd](?=[\\\\t\\\\n\\\\f\\\\r />])[^>]*>';\n\n/**\n * The start of an HTML body start tag: `<body` in any letter case, followed by whitespace, `/` or `>` (so not\n * `<bodyx>`). Only the `<body` is matched; the attributes and `>` after it are left alone.\n */\nexport const BODY_START_TAG = '<[Bb][Oo][Dd][Yy](?=[\\\\t\\\\n\\\\f\\\\r />])';\n\n/** The regular expression source matching exactly `text`. */\nexport function literal(text: string): string {\n  return text.replace(/[.*+?^${}()|[\\]\\\\/]/g, '\\\\$&');\n}\n\n/** Replace the `slots` placeholders found in `template`, without scanning inserted text. */\nexport function fillTemplate(template: string, slots: readonly TemplateSlot[]): string {\n  return fillTemplateParts([{ kind: 'scan', text: template, slots }]);\n}\n\n/**\n * Fill the parts of a template in order, joined. A `'first'` slot replaced in one part is not replaced again in a\n * later part that lists the same slot object.\n */\nexport function fillTemplateParts(parts: readonly TemplatePart[]): string {\n  const filled = new Set<TemplateSlot>();\n  return parts\n    .map((part) => {\n      if (part.kind === 'verbatim' || part.slots.length === 0) return part.text;\n      const { slots } = part;\n      const pattern = new RegExp(slots.map((slot) => `(${slot.pattern})`).join('|'), 'g');\n      return part.text.replace(pattern, (match: string, ...groups: unknown[]) => {\n        const slot = slots.find((_, i) => groups[i] !== undefined);\n        if (slot === undefined || (slot.occurrences === 'first' && filled.has(slot))) return match;\n        // After the capture groups come the match offset and the scanned text.\n        const offset = groups[slots.length];\n        if (slot.accepts !== undefined && typeof offset === 'number' && !slot.accepts(part.text, offset)) return match;\n        filled.add(slot);\n        return slot.replacement(match);\n      });\n    })\n    .join('');\n}\n","/**\n * Module/head injection into <head>.\n * Ported from module.go + io.go:modifyHead(). The renderers inject through `placeHead()` while filling the\n * format template, so the closing head tag is looked for in the template only, never in inserted story data.\n */\nimport type { Diagnostic } from './types.js';\nimport { normalizedFileExt, mediaTypeFromExt, fontFormatHint, slugify } from './media-types.js';\nimport { readUTF8, readBase64, baseNameWithoutExt } from './util.js';\nimport { cssStringEscape, scriptContentEscape, styleContentEscape } from './escape.js';\nimport { fillTemplate } from './template.js';\nimport type { TemplateSlot } from './template.js';\n\n/**\n * Load modules and return HTML tags to inject before the closing head tag. `diagnostics` receives a warning for\n * each module that is not valid UTF-8 (it is read as Windows-1252).\n */\nexport function loadModules(filenames: string[], diagnostics?: Diagnostic[]): string {\n  const processed = new Set<string>();\n  const headTags: string[] = [];\n\n  for (const filename of filenames) {\n    if (processed.has(filename)) continue;\n\n    const ext = normalizedFileExt(filename);\n    let tag: string | null = null;\n\n    switch (ext) {\n      case 'css':\n        tag = loadModuleTagged('style', filename, diagnostics);\n        break;\n      case 'js':\n        tag = loadModuleTagged('script', filename, diagnostics);\n        break;\n      case 'otf':\n      case 'ttf':\n      case 'woff':\n      case 'woff2':\n        tag = loadModuleFont(filename);\n        break;\n      default:\n        continue;\n    }\n\n    if (tag) headTags.push(tag);\n    processed.add(filename);\n  }\n\n  return headTags.join('\\n');\n}\n\nfunction loadModuleTagged(tag: 'script' | 'style', filename: string, diagnostics?: Diagnostic[]): string | null {\n  const source = readUTF8(filename, diagnostics).trim();\n  if (source.length === 0) return null;\n\n  const family = baseNameWithoutExt(filename);\n  const idSlug = `${tag}-module-${slugify(family)}`;\n  const mimeType = tag === 'script' ? 'text/javascript' : 'text/css';\n  const content = tag === 'script' ? scriptContentEscape(source) : styleContentEscape(source);\n\n  return `<${tag} id=\"${idSlug}\" type=\"${mimeType}\">${content}</${tag}>`;\n}\n\nfunction loadModuleFont(filename: string): string | null {\n  const source = readBase64(filename);\n  const family = baseNameWithoutExt(filename);\n  const idSlug = `style-module-${slugify(family)}`;\n  const ext = normalizedFileExt(filename);\n  const mediaType = mediaTypeFromExt(ext);\n  const hint = fontFormatHint(ext);\n\n  return `<style id=\"${idSlug}\" type=\"text/css\">@font-face {\\n\\tfont-family: \"${cssStringEscape(family)}\";\\n\\tsrc: url(\"data:${mediaType};base64,${source}\") format(\"${hint}\");\\n}</style>`;\n}\n\n/**\n * Load the module tags and head file content to inject into the head (see `placeHead()`), joined by newlines,\n * or `''` when there is nothing to inject.\n */\nexport function loadHeadContent(modulePaths: string[], headFile?: string, diagnostics?: Diagnostic[]): string {\n  const parts: string[] = [];\n\n  if (modulePaths.length > 0) {\n    const modules = loadModules(modulePaths, diagnostics).trim();\n    if (modules.length > 0) parts.push(modules);\n  }\n\n  if (headFile) {\n    try {\n      const source = readUTF8(headFile, diagnostics).trim();\n      if (source.length > 0) parts.push(source);\n    } catch (e) {\n      diagnostics?.push({\n        level: 'warning',\n        message: `Failed to read head file \"${headFile}\": ${e instanceof Error ? e.message : String(e)}`,\n      });\n    }\n  }\n\n  return parts.join('\\n');\n}\n\n/** Where the head content goes in a template, and the warning when that is not before a closing head tag. */\nexport interface HeadPlacement {\n  /** The template slot that inserts the content, or `undefined` when there is nothing to insert or nowhere to. */\n  readonly slot: TemplateSlot | undefined;\n  readonly diagnostics: readonly Diagnostic[];\n}\n\n/**\n * Place `content` in a template, given the texts that `fillTemplateParts()` scans for the slot (the template, and\n * the footer of a pre-1.4 Twine 1 format):\n *\n * - on its own line before the first closing head tag, as Tweego does; the tag may use any letter case and\n *   whitespace before its `>`, and is kept as written;\n * - in a template with no closing head tag (HTML lets a document leave it out), on its own line before the first\n *   body start tag, where the HTML parser still puts it in the head, with a warning (Tweego drops it);\n * - in a template with neither, nowhere, with a warning.\n *\n * `owner` names the template in the warnings. Empty `content` needs no slot and gets no warning.\n */\nexport function placeHead(content: string, texts: readonly string[], owner: string): HeadPlacement {\n  if (content.length === 0) return { slot: undefined, diagnostics: [] };\n  const scans = texts.map((text) => ({ text, tags: scanHeadTags(text) }));\n  if (scans.some(({ tags }) => tags.closingHead !== undefined)) {\n    return { slot: beforeTag(CLOSING_HEAD_PREFIX, 'closingHead', content), diagnostics: [] };\n  }\n  if (scans.some(({ tags }) => tags.bodyStart !== undefined)) {\n    const message = `${owner} has no closing head tag; the modules and head file were injected before its body start tag.`;\n    return { slot: beforeTag(BODY_START_PREFIX, 'bodyStart', content), diagnostics: [{ level: 'warning', message }] };\n  }\n  const message = `${owner} has no closing head tag and no body start tag; the modules and head file were not injected.`;\n  return { slot: undefined, diagnostics: [{ level: 'warning', message }] };\n}\n\n/** `</head` in any letter case, followed by whitespace, `/` or `>`; the rest of the tag is left alone. */\nconst CLOSING_HEAD_PREFIX = '<\\\\/[Hh][Ee][Aa][Dd](?=[\\\\t\\\\n\\\\f\\\\r />])';\n/** `<body` in any letter case, followed by whitespace, `/` or `>` (so not `<bodyx>`). */\nconst BODY_START_PREFIX = '<[Bb][Oo][Dd][Yy](?=[\\\\t\\\\n\\\\f\\\\r />])';\n\n/** The offsets of the first real closing head tag, body start tag and head start tag end in an HTML text. */\ninterface HeadTags {\n  readonly closingHead: number | undefined;\n  readonly bodyStart: number | undefined;\n}\n\n/** Elements whose content is text, so a tag written there is not a tag. */\nconst RAW_TEXT_ELEMENTS: ReadonlySet<string> = new Set(['script', 'style', 'textarea', 'title']);\n\nconst isSpace = (c: string | undefined): boolean => c === ' ' || c === '\\t' || c === '\\n' || c === '\\f' || c === '\\r';\nconst isLetter = (c: string | undefined): boolean => c !== undefined && /^[A-Za-z]$/.test(c);\n\n/**\n * Find the first closing head tag and body start tag that HTML would read as tags: not those in a comment, in\n * the text of a script, style, textarea or title element, or in a quoted attribute value. A small scanner, not\n * a full HTML tokenizer; it needs no more than the tags and where they end.\n */\nexport function scanHeadTags(html: string): HeadTags {\n  const { closingHead, bodyStart } = scanTags(html);\n  return { closingHead, bodyStart };\n}\n\n/**\n * The offset just after the first real head start tag, where content goes to come first in the head; found like\n * the tags of `scanHeadTags()`, so not one in a comment, a script or an attribute value. `undefined` without one.\n */\nexport function findHeadStartEnd(html: string): number | undefined {\n  return scanTags(html).headStartEnd;\n}\n\nfunction scanTags(html: string): HeadTags & { readonly headStartEnd: number | undefined } {\n  let closingHead: number | undefined;\n  let bodyStart: number | undefined;\n  let headStartEnd: number | undefined;\n  let i = 0;\n\n  while (i < html.length) {\n    const lt = html.indexOf('<', i);\n    if (lt === -1) break;\n    const next = html[lt + 1];\n    if (html.startsWith('<!--', lt)) {\n      const end = html.indexOf('-->', lt + 4);\n      i = end === -1 ? html.length : end + 3;\n    } else if (next === '!' || next === '?') {\n      // A doctype, CDATA section or processing instruction ends at the first `>`.\n      const end = html.indexOf('>', lt);\n      i = end === -1 ? html.length : end + 1;\n    } else if (next === '/' && isLetter(html[lt + 2])) {\n      const { name, end } = readTag(html, lt + 2);\n      if (name === 'head' && closingHead === undefined) closingHead = lt;\n      i = end;\n    } else if (isLetter(next)) {\n      const { name, end } = readTag(html, lt + 1);\n      if (name === 'body' && bodyStart === undefined) bodyStart = lt;\n      if (name === 'head' && headStartEnd === undefined) headStartEnd = end;\n      i = RAW_TEXT_ELEMENTS.has(name) ? rawTextEnd(html, name, end) : end;\n    } else {\n      i = lt + 1;\n    }\n    if (closingHead !== undefined && bodyStart !== undefined) break;\n  }\n\n  return { closingHead, bodyStart, headStartEnd };\n}\n\n/** Read a tag whose name starts at `from`: its lowercase name, and the offset after its `>` (or the end). */\nfunction readTag(html: string, from: number): { name: string; end: number } {\n  let i = from;\n  while (i < html.length && !isSpace(html[i]) && html[i] !== '/' && html[i] !== '>') i++;\n  const name = html.slice(from, i).toLowerCase();\n  // Attributes: a value after `=` may be quoted, and may then hold a `>`.\n  while (i < html.length && html[i] !== '>') {\n    if (html[i] !== '=') {\n      i++;\n      continue;\n    }\n    i++;\n    while (isSpace(html[i])) i++;\n    const quote = html[i];\n    if (quote === '\"' || quote === \"'\") {\n      const close = html.indexOf(quote, i + 1);\n      i = close === -1 ? html.length : close + 1;\n    }\n  }\n  return { name, end: Math.min(i + 1, html.length) };\n}\n\n/** The offset of the end tag that closes a raw text element, given where its text starts (or the end). */\nfunction rawTextEnd(html: string, name: string, from: number): number {\n  const close = new RegExp(`</${name}(?=[\\\\t\\\\n\\\\f\\\\r />])`, 'gi');\n  close.lastIndex = from;\n  return close.exec(html)?.index ?? html.length;\n}\n\n/**\n * The slot that inserts `content` on its own line before the first real tag of the kind `which` names (see\n * `scanHeadTags()`), which is kept as written. A look-alike inside a script or comment is left alone.\n */\nfunction beforeTag(pattern: string, which: 'closingHead' | 'bodyStart', content: string): TemplateSlot {\n  const cache = new Map<string, number | undefined>();\n  const offsetIn = (text: string): number | undefined => {\n    if (!cache.has(text)) cache.set(text, scanHeadTags(text)[which]);\n    return cache.get(text);\n  };\n  return {\n    pattern,\n    occurrences: 'first',\n    replacement: (match) => `${content}\\n${match}`,\n    accepts: (text, offset) => offsetIn(text) === offset,\n  };\n}\n\n/**\n * Inject modules and head file content into `html` the way the renderers inject it into a format template (see\n * `placeHead()`), adding any warning to `diagnostics`.\n */\nexport function modifyHead(html: string, modulePaths: string[], headFile?: string, diagnostics?: Diagnostic[]): string {\n  const placement = placeHead(loadHeadContent(modulePaths, headFile, diagnostics), [html], 'The HTML');\n  diagnostics?.push(...placement.diagnostics);\n  return placement.slot === undefined ? html : fillTemplate(html, [placement.slot]);\n}\n","/**\n * The twee-ts version, read at runtime from the package's own package.json.\n *\n * The release workflow (semantic-release) writes the new version into the\n * published package.json only; git keeps the old one. Reading it at runtime\n * is the only way the CLI and `creator-version` report the published version.\n */\nimport { readFileSync } from 'node:fs';\nimport { dirname, join } from 'node:path';\nimport { fileURLToPath } from 'node:url';\n\nconst PACKAGE_NAME = '@rohal12/twee-ts';\n\n/** Walks up from `startDir` to the nearest package.json named @rohal12/twee-ts and returns its version. */\nexport function findPackageVersion(startDir: string): string | undefined {\n  let dir = startDir;\n  for (;;) {\n    try {\n      const pkg = JSON.parse(readFileSync(join(dir, 'package.json'), 'utf-8')) as { name?: unknown; version?: unknown };\n      if (pkg.name === PACKAGE_NAME && typeof pkg.version === 'string') return pkg.version;\n    } catch {\n      // No readable package.json here; keep walking up.\n    }\n    const parent = dirname(dir);\n    if (parent === dir) return undefined;\n    dir = parent;\n  }\n}\n\n/** This module's directory: `__dirname` in the CJS build, `import.meta.url` in ESM and in source. */\nfunction moduleDir(): string {\n  return typeof __dirname === 'string' ? __dirname : dirname(fileURLToPath(import.meta.url));\n}\n\nexport const VERSION: string = findPackageVersion(moduleDir()) ?? '0.0.0';\n","/**\n * Twine 2 HTML and archive output.\n * Ported from storyout.go.\n */\nimport type {\n  Diagnostic,\n  OmittingTag,\n  PassageOmission,\n  ReadonlyStory,\n  ReadonlyPassage,\n  StoryFormatInfo,\n} from './types.js';\nimport {\n  attrEscape,\n  htmlEscape,\n  commentSanitize,\n  htmlCommentSanitize,\n  scriptContentEscape,\n  styleContentEscape,\n} from './escape.js';\nimport { passageToPassagedata, hasTag } from './passage.js';\nimport { readFormatSource } from './formats.js';\nimport { placeHead } from './modules.js';\nimport { fillTemplate, literal } from './template.js';\nimport type { TemplateSlot } from './template.js';\nimport { VERSION } from './version.js';\n\nconst CREATOR_NAME = 'Twee-ts';\n\nexport function toTwine2Archive(\n  story: ReadonlyStory,\n  startName: string,\n  options?: { readonly sourceInfo?: boolean },\n): string {\n  return getTwine2DataChunk(story, startName, options) + '\\n';\n}\n\n/**\n * Fill the Twine 2 format template: every `{{STORY_NAME}}` gets the escaped story name and the first\n * `{{STORY_DATA}}` the story data (as Tweego does), and `head` goes before the first closing head tag (or, with a\n * warning, the body start tag; see `placeHead()`). All three are found in the template in one pass, so a story\n * name, passage text or head content holding a placeholder or a closing head tag stays literal.\n * `options.diagnostics` receives a warning when the format file is not valid UTF-8, and any warning about where\n * `head` went.\n */\nexport function toTwine2HTML(\n  story: ReadonlyStory,\n  format: StoryFormatInfo,\n  startName: string,\n  options?: { readonly sourceInfo?: boolean; readonly head?: string; readonly diagnostics?: Diagnostic[] },\n): string {\n  const name = htmlEscape(story.name);\n  const template = readFormatSource(format, options?.diagnostics);\n  const placement = placeHead(options?.head ?? '', [template], `Story format \"${format.name}\" ${format.version}`);\n  options?.diagnostics?.push(...placement.diagnostics);\n  const head = placement.slot;\n  const slots: readonly TemplateSlot[] = [\n    { pattern: literal('{{STORY_NAME}}'), occurrences: 'all', replacement: () => name },\n    {\n      pattern: literal('{{STORY_DATA}}'),\n      occurrences: 'first',\n      replacement: () => {\n        // Advertise the format this HTML was built with (as Tweego does), not whatever StoryData named.\n        const built = { ...story, twine2: { ...story.twine2, format: format.name, formatVersion: format.version } };\n        return getTwine2DataChunk(built, startName, options);\n      },\n    },\n    ...(head === undefined ? [] : [head]),\n  ];\n  return fillTemplate(template, slots);\n}\n\nconst OMITTING_TAGS: readonly OmittingTag[] = ['Twine.private', 'script', 'stylesheet'];\n\n/**\n * Why Twine 2 output leaves a passage out of its `<tw-passagedata>` elements,\n * or `undefined` when the passage is emitted (and so can be the starting passage).\n */\nexport function twine2PassageOmission(story: ReadonlyStory, p: ReadonlyPassage): PassageOmission | undefined {\n  if (p.name === 'StoryTitle' || p.name === 'StoryData') return { kind: 'special-name', name: p.name };\n  const tag = OMITTING_TAGS.find((t) => hasTag(p, t));\n  if (tag !== undefined) return { kind: 'tag', tag };\n  // Drop empty StorySettings\n  if (p.name === 'StorySettings' && story.twine1.settings.size === 0) return { kind: 'empty-story-settings' };\n  return undefined;\n}\n\nfunction getTwine2DataChunk(\n  story: ReadonlyStory,\n  startName: string,\n  options?: { readonly sourceInfo?: boolean },\n): string {\n  const parts: string[] = [];\n  let startID = '';\n  let pid = 0;\n\n  // Gather script and stylesheet passages.\n  const scripts: ReadonlyPassage[] = [];\n  const stylesheets: ReadonlyPassage[] = [];\n  for (const p of story.passages) {\n    if (hasTag(p, 'Twine.private')) continue;\n    if (hasTag(p, 'script')) scripts.push(p);\n    else if (hasTag(p, 'stylesheet')) stylesheets.push(p);\n  }\n\n  // Style element\n  let styleContent = '';\n  if (stylesheets.length === 1) {\n    styleContent = stylesheets[0]?.text ?? '';\n  } else if (stylesheets.length > 1) {\n    let pidS = 1;\n    for (const p of stylesheets) {\n      if (pidS > 1 && !styleContent.endsWith('\\n')) styleContent += '\\n';\n      styleContent += `/* twine-user-stylesheet #${pidS}: \"${commentSanitize(p.name)}\" */\\n`;\n      styleContent += p.text;\n      pidS++;\n    }\n  }\n  parts.push(\n    `<style role=\"stylesheet\" id=\"twine-user-stylesheet\" type=\"text/twine-css\">${styleContentEscape(styleContent)}</style>`,\n  );\n\n  // Script element\n  let scriptContent = '';\n  if (scripts.length === 1) {\n    scriptContent = scripts[0]?.text ?? '';\n  } else if (scripts.length > 1) {\n    let pidS = 1;\n    for (const p of scripts) {\n      if (pidS > 1 && !scriptContent.endsWith('\\n')) scriptContent += '\\n';\n      scriptContent += `/* twine-user-script #${pidS}: \"${commentSanitize(p.name)}\" */\\n`;\n      scriptContent += p.text;\n      pidS++;\n    }\n  }\n  parts.push(\n    `<script role=\"script\" id=\"twine-user-script\" type=\"text/twine-javascript\">${scriptContentEscape(scriptContent)}</script>`,\n  );\n\n  // Tag color elements (only spec-valid colors: 7 named colors or hex values)\n  const validTagColors = new Set(['gray', 'red', 'orange', 'yellow', 'green', 'blue', 'purple']);\n  const hexColorPattern = /^#[0-9a-fA-F]{3,8}$/;\n  for (const [tag, color] of story.twine2.tagColors) {\n    if (validTagColors.has(color) || hexColorPattern.test(color)) {\n      parts.push(`<tw-tag name=\"${attrEscape(tag)}\" color=\"${attrEscape(color)}\"></tw-tag>`);\n    }\n  }\n\n  // Normal passage elements\n  pid = 1;\n  for (const p of story.passages) {\n    if (twine2PassageOmission(story, p) !== undefined) continue;\n\n    parts.push(passageToPassagedata(p, pid, options));\n    if (startName === p.name) {\n      startID = String(pid);\n    }\n    pid++;\n  }\n\n  // Build options string\n  const opts: string[] = [];\n  for (const [opt, val] of story.twine2.options) {\n    if (val) opts.push(opt);\n  }\n  const optionsStr = opts.join(' ');\n\n  // Wrap in tw-storydata\n  const zoom = String(story.twine2.zoom);\n\n  const wrapper =\n    `<!-- UUID://${htmlCommentSanitize(story.ifid)}// -->` +\n    `<tw-storydata name=\"${attrEscape(story.name)}\" startnode=\"${attrEscape(startID)}\" ` +\n    `creator=\"${attrEscape(CREATOR_NAME)}\" creator-version=\"${attrEscape(VERSION)}\" ` +\n    `ifid=\"${attrEscape(story.ifid)}\" zoom=\"${attrEscape(zoom)}\" ` +\n    `format=\"${attrEscape(story.twine2.format)}\" ` +\n    `format-version=\"${attrEscape(story.twine2.formatVersion)}\" ` +\n    `options=\"${attrEscape(optionsStr)}\" tags=\"${attrEscape(story.twine2.tags)}\" hidden>`;\n\n  return wrapper + parts.join('') + '</tw-storydata>';\n}\n","/**\n * Twine 1 HTML and archive output.\n * Ported from storyout.go.\n */\nimport { join, dirname } from 'node:path';\nimport type { Diagnostic, PassageOmission, ReadonlyPassage, ReadonlyStory, StoryFormatInfo } from './types.js';\nimport { readUTF8 } from './util.js';\nimport { hasTag, passageToTiddler } from './passage.js';\nimport { readFormatSource } from './formats.js';\nimport { placeHead } from './modules.js';\nimport { fillTemplateParts, literal } from './template.js';\nimport type { TemplateSlot } from './template.js';\nimport { jsStringEscape, htmlCommentSanitize } from './escape.js';\nimport { VERSION } from './version.js';\n\nconst CREATOR_NAME = 'twee-ts';\n\nexport function toTwine1Archive(story: ReadonlyStory, _startName: string): string {\n  const { data, count } = getTwine1PassageChunk(story);\n  return `<div id=\"storeArea\" data-size=\"${count}\">${data}</div>\\n`;\n}\n\n/**\n * Fill the Twine 1 format template. The format's components are inserted first, one after another, as Tweego and\n * Twine 1 do. Then the first of each story placeholder (`\"VERSION\"`, `\"TIME\"`, `\"START_AT\"`, `\"STORY_SIZE\"`,\n * `\"STORY\"`), the IFID comment and `head` (before the first closing head tag or, with a warning, the body start\n * tag; see `placeHead()`) are found in one pass, so a start passage name or story data holding a placeholder or a\n * closing head tag stays literal. `options.diagnostics` receives a warning for each format file that is not valid\n * UTF-8, and any warning about where `head` went.\n */\nexport function toTwine1HTML(\n  story: ReadonlyStory,\n  format: StoryFormatInfo,\n  startName: string,\n  options?: { readonly head?: string; readonly diagnostics?: Diagnostic[] },\n): string {\n  const formatDir = dirname(format.filename);\n  const parentDir = dirname(formatDir);\n  const diagnostics = options?.diagnostics;\n  let template = readFormatSource(format, diagnostics);\n  const { data, count } = getTwine1PassageChunk(story);\n\n  // Component replacements\n  template = tryReplaceComponent(template, '\"USER_LIB\"', join(formatDir, 'userlib.js'), false, diagnostics);\n  template = tryReplaceComponent(template, '\"ENGINE\"', join(parentDir, 'engine.js'), true, diagnostics);\n  template = tryReplaceComponent(template, '\"SUGARCANE\"', join(formatDir, 'code.js'), true, diagnostics);\n  template = tryReplaceComponent(template, '\"JONAH\"', join(formatDir, 'code.js'), true, diagnostics);\n\n  if (story.twine1.settings.get('jquery') === 'on') {\n    template = tryReplaceComponent(template, '\"JQUERY\"', join(parentDir, 'jquery.js'), true, diagnostics);\n  }\n  if (story.twine1.settings.get('modernizr') === 'on') {\n    template = tryReplaceComponent(template, '\"MODERNIZR\"', join(parentDir, 'modernizr.js'), true, diagnostics);\n  }\n\n  // A pre-1.4 format has no \"STORY\" placeholder: the story data and a footer go after the template.\n  const isPre14 = !template.includes('\"STORY\"');\n  const footer = isPre14 ? readFooter(formatDir, diagnostics) : '';\n\n  // The IFID comment and the head content are also looked for in the footer, if the template has no place for them.\n  const storeArea = (template + footer).includes('<div id=\"store-area\"')\n    ? '<div id=\"store-area\"'\n    : '<div id=\"storeArea\"';\n  const safeIfid = htmlCommentSanitize(story.ifid);\n  const ifid: TemplateSlot | undefined = story.ifid\n    ? { pattern: literal(storeArea), occurrences: 'first', replacement: (div) => `<!-- UUID://${safeIfid}// -->${div}` }\n    : undefined;\n  const placement = placeHead(\n    options?.head ?? '',\n    isPre14 ? [template, footer] : [template],\n    `Story format \"${format.name}\"`,\n  );\n  diagnostics?.push(...placement.diagnostics);\n  const late = [ifid, placement.slot].filter((slot) => slot !== undefined);\n\n  // Story instance replacements. \"START_AT\" sits in a script element (`testplay = \"START_AT\";` in Sugarcane),\n  // which jsStringEscape() keeps whole.\n  const displayStart = startName === 'Start' ? '' : startName;\n  const slots: readonly TemplateSlot[] = [\n    firstSlot('\"VERSION\"', `Compiled with ${CREATOR_NAME}, ${VERSION}`),\n    firstSlot('\"TIME\"', `Built on ${new Date().toUTCString()}`),\n    firstSlot('\"START_AT\"', `\"${jsStringEscape(displayStart)}\"`),\n    firstSlot('\"STORY_SIZE\"', `\"${count}\"`),\n    firstSlot('\"STORY\"', data),\n    ...late,\n  ];\n\n  return fillTemplateParts(\n    isPre14\n      ? [\n          { kind: 'scan', text: template, slots },\n          { kind: 'verbatim', text: data },\n          { kind: 'scan', text: footer, slots: late },\n        ]\n      : [{ kind: 'scan', text: template, slots }],\n  );\n}\n\n/** A slot replacing the first `token` with `value`. */\nfunction firstSlot(token: string, value: string): TemplateSlot {\n  return { pattern: literal(token), occurrences: 'first', replacement: () => value };\n}\n\n/** The footer of a pre-1.4 format, or the default one when the format has none. */\nfunction readFooter(formatDir: string, diagnostics: Diagnostic[] | undefined): string {\n  try {\n    return readUTF8(join(formatDir, 'footer.html'), diagnostics);\n  } catch {\n    return '</div>\\n</body>\\n</html>\\n';\n  }\n}\n\n/**\n * Why Twine 1 output leaves a passage out of its tiddlers, or `undefined` when the passage is emitted.\n */\nexport function twine1PassageOmission(p: ReadonlyPassage): PassageOmission | undefined {\n  return hasTag(p, 'Twine.private') ? { kind: 'tag', tag: 'Twine.private' } : undefined;\n}\n\nfunction getTwine1PassageChunk(story: ReadonlyStory): { data: string; count: number } {\n  const obfuscateRot13 = story.twine1.settings.get('obfuscate') === 'rot13';\n  let data = '';\n  let count = 0;\n\n  for (const p of story.passages) {\n    if (twine1PassageOmission(p) !== undefined) continue;\n    count++;\n    data += passageToTiddler(p, count, obfuscateRot13);\n  }\n\n  return { data, count };\n}\n\nfunction tryReplaceComponent(\n  template: string,\n  placeholder: string,\n  componentPath: string,\n  required: boolean,\n  diagnostics: Diagnostic[] | undefined,\n): string {\n  if (!template.includes(placeholder)) return template;\n  try {\n    const content = readUTF8(componentPath, diagnostics);\n    return template.replace(placeholder, () => content);\n  } catch (e) {\n    if (required) {\n      throw new Error(\n        `Required format component not found: ${componentPath}: ${e instanceof Error ? e.message : String(e)}`,\n      );\n    }\n    return template;\n  }\n}\n","/**\n * Twee 3/1 decompile output.\n * Ported from storyout.go.\n */\nimport type { Diagnostic, ReadonlyStory, ReadonlyPassage, OutputMode } from './types.js';\nimport { passageToTwee } from './passage.js';\nimport { createStory, marshalStoryData, unmarshalStoryData } from './story.js';\n\n/**\n * Serialize the story as Twee. The StoryData passage is written from the story model rather than\n * from its loaded text, so changes made after loading (a start passage override, test mode) are kept.\n * Tweego writes the loaded text; its own normalization makes the two the same for an unchanged story.\n *\n * Twee cannot write every passage so that it reads back the same (see `tweeRoundTrip()`); `diagnostics`\n * receives a warning for each passage that will not. Tweego writes the same Twee without one.\n *\n * `addStoryData`: add a StoryData passage when the story has none, so that StoryData fields the\n * compile options set are recorded. Default: false.\n */\nexport function toTwee(\n  story: ReadonlyStory,\n  outMode: OutputMode,\n  options: { readonly addStoryData?: boolean; readonly diagnostics?: Diagnostic[] } = {},\n): string {\n  const written = withEffectiveStoryData(story, options.addStoryData ?? false).map((p) => tweeRoundTrip(p, outMode));\n  options.diagnostics?.push(...written.flatMap(({ diagnostics }) => diagnostics));\n  return written.map(({ passage }) => passageToTwee(passage, outMode)).join('');\n}\n\nfunction withEffectiveStoryData(story: ReadonlyStory, addStoryData: boolean): readonly ReadonlyPassage[] {\n  const storyData: ReadonlyPassage = { name: 'StoryData', tags: [], text: marshalStoryData(story) };\n  const index = story.passages.findIndex((p) => p.name === 'StoryData');\n  if (index !== -1) {\n    return story.passages.map((p, i) => (i === index && isStoryDataJSON(p.text) ? { ...p, text: storyData.text } : p));\n  }\n  if (!addStoryData) return story.passages;\n  // Place it where Twine and the HTML decompiler do: first, or right after a leading StoryTitle.\n  const at = story.passages[0]?.name === 'StoryTitle' ? 1 : 0;\n  return [...story.passages.slice(0, at), storyData, ...story.passages.slice(at)];\n}\n\n/** Whether the text loaded as StoryData. Text that did not is kept as written, for the author to fix. */\nfunction isStoryDataJSON(text: string): boolean {\n  return unmarshalStoryData(createStory(), text) === null;\n}\n\n/** A passage as it is written to Twee, and the warnings about what will not read back the same. */\ninterface WrittenPassage {\n  readonly passage: ReadonlyPassage;\n  readonly diagnostics: readonly Diagnostic[];\n}\n\n/** Characters Twee 3 escapes in names and tags, and Twee 1 cannot write there at all. */\nconst TWEE1_UNWRITABLE = /[[\\]{}\\\\]/;\n\n/**\n * Check that Twee reads `p` back as written, and say what it will not. Twee has no way to escape passage text,\n * and its parser trims names and splits tags at whitespace, so these do not survive:\n *\n * - a text line that starts with `::`, which reads as a new passage header. In stylesheet and script passages such\n *   a line is indented by one space, which keeps the CSS or JavaScript working (only a template literal or a\n *   string continued across lines, in either, would see the space); the warning says so. Other passages' text is\n *   written as it is.\n * - a name that is empty, has leading or trailing whitespace, or holds a line break;\n * - a tag that is empty or holds whitespace;\n * - in Twee 1, which escapes nothing, a name or tag holding `[`, `]`, `{`, `}` or `\\`.\n */\nfunction tweeRoundTrip(p: ReadonlyPassage, outMode: OutputMode): WrittenPassage {\n  const label = `Passage ${JSON.stringify(p.name)}`;\n  const diagnostics: Diagnostic[] = [];\n  const warn = (problem: string): void => {\n    diagnostics.push({\n      level: 'warning',\n      message: `${label} cannot be written as Twee that reads back the same: ${problem}.`,\n    });\n  };\n\n  if (p.name.trim() === '') warn('its name is empty');\n  else if (p.name.trim() !== p.name) warn('its name has leading or trailing whitespace, which Twee drops');\n  if (/[\\r\\n]/.test(p.name)) warn('its name has a line break, which ends a Twee passage header');\n  if (outMode === 'twee1' && TWEE1_UNWRITABLE.test(p.name)) {\n    warn('its name has \"[\", \"]\", \"{\", \"}\" or \"\\\\\", which Twee 1 cannot escape');\n  }\n\n  for (const tag of p.tags) {\n    if (tag === '' || /\\s/.test(tag)) {\n      warn(`its tag ${JSON.stringify(tag)} is empty or has whitespace, which splits tags in Twee`);\n    }\n    if (outMode === 'twee1' && TWEE1_UNWRITABLE.test(tag)) {\n      warn(`its tag ${JSON.stringify(tag)} has \"[\", \"]\", \"{\", \"}\" or \"\\\\\", which Twee 1 cannot escape`);\n    }\n  }\n\n  // Twee source is read with CRLF and CR line endings turned into LF, so a CR breaks a line too.\n  const lines = p.text.split(/(\\r\\n?|\\n)/);\n  const headerLines = lines.flatMap((line, i) => (i % 2 === 0 && line.startsWith('::') ? [i / 2 + 1] : []));\n  if (headerLines.length === 0) return { passage: p, diagnostics };\n\n  const where = `${headerLines.length === 1 ? 'line' : 'lines'} ${headerLines.join(', ')} of its text start${headerLines.length === 1 ? 's' : ''} with \"::\", which Twee reads as a passage header`;\n  if (!p.tags.some((tag) => tag === 'stylesheet' || tag === 'script')) {\n    warn(where);\n    return { passage: p, diagnostics };\n  }\n  diagnostics.push({\n    level: 'warning',\n    message: `${label}: ${where}; ${headerLines.length === 1 ? 'it was' : 'they were'} written indented by one space.`,\n  });\n  const text = lines.map((line, i) => (i % 2 === 0 && line.startsWith('::') ? ` ${line}` : line)).join('');\n  return { passage: { ...p, text }, diagnostics };\n}\n","/**\n * Which passages an output leaves out of its passage elements, and how to say why.\n * The rules themselves live with each output renderer; this module picks one by target.\n */\nimport type { PassageOmission, PassageOutputTarget, ReadonlyPassage, ReadonlyStory } from './types.js';\nimport { twine2PassageOmission } from './output-twine2.js';\nimport { twine1PassageOmission } from './output-twine1.js';\n\n/**\n * Why the `target` output leaves `passage` out of its passage elements, or `undefined` when it\n * emits the passage (and so a link or the start can name it).\n */\nexport function passageOmission(\n  story: ReadonlyStory,\n  passage: ReadonlyPassage,\n  target: PassageOutputTarget,\n): PassageOmission | undefined {\n  switch (target) {\n    case 'twine2':\n      return twine2PassageOmission(story, passage);\n    case 'twine1':\n      return twine1PassageOmission(passage);\n    default: {\n      const _exhaustive: never = target;\n      throw new Error(`unhandled passage output target: ${String(_exhaustive)}`);\n    }\n  }\n}\n\n/** Why a passage is left out, as a predicate: `Passage \"X\" ${describeOmission(o)}`. */\nexport function describeOmission(omission: PassageOmission): string {\n  switch (omission.kind) {\n    case 'special-name':\n      return `is the special \"${omission.name}\" passage`;\n    case 'tag':\n      return `is tagged \"${omission.tag}\"`;\n    case 'empty-story-settings':\n      return 'is an empty \"StorySettings\" passage';\n    default: {\n      const _exhaustive: never = omission;\n      throw new Error(`unhandled passage omission: ${JSON.stringify(_exhaustive)}`);\n    }\n  }\n}\n","/**\n * Starting passage validation: the effective start must exist and be a\n * passage that the output actually emits, or the story has nowhere to begin.\n */\nimport type { Diagnostic, PassageOutputTarget, ReadonlyStory } from './types.js';\nimport { describeOmission, passageOmission } from './passage-omission.js';\n\n/**\n * Check that `startName` names a passage the `target` output emits.\n * Returns the error diagnostics to report (empty when the start is usable).\n */\nexport function startPassageDiagnostics(\n  story: ReadonlyStory,\n  startName: string,\n  target: PassageOutputTarget,\n): readonly Diagnostic[] {\n  const passage = story.passages.find((p) => p.name === startName);\n  if (passage === undefined) {\n    return [{ level: 'error', message: `Starting passage \"${startName}\" not found.` }];\n  }\n  const omission = passageOmission(story, passage, target);\n  if (omission === undefined) return [];\n  return [\n    {\n      level: 'error',\n      message: `Starting passage \"${startName}\" ${describeOmission(omission)}, so it is left out of the story data. Choose a story passage.`,\n    },\n  ];\n}\n","/**\n * Main compiler orchestrator.\n * compile(), compileToFile(), watch().\n * Ported from tweego.go + config.go.\n */\nimport { resolve, sep } from 'node:path';\nimport type {\n  CompileOptions,\n  CompileToFileOptions,\n  WatchOptions,\n  CompileResult,\n  CompileStats,\n  Diagnostic,\n  Story,\n  StoryFormatInfo,\n  OutputMode,\n  InlineSource,\n  FileCacheEntry,\n} from './types.js';\nimport { createStory, storyHas, getStoryStats } from './story.js';\nimport { getFilenames, isExcluded, outputPaths, realPathOf, toBuildOutputs, watchFilesystem } from './filesystem.js';\nimport type { BuildOutputs } from './filesystem.js';\nimport { formatRequestFor, resolveStoryFormat } from './format-resolution.js';\nimport { loadSources, loadInlineSources, loadSourcesCached } from './loader.js';\nimport { applyTagAliases, hasTag } from './passage.js';\nimport { generateIFID } from './ifid.js';\nimport { toTwine2HTML, toTwine2Archive } from './output-twine2.js';\nimport { toTwine1HTML, toTwine1Archive } from './output-twine1.js';\nimport { toTwee } from './output-twee.js';\nimport { loadHeadContent } from './modules.js';\nimport { startPassageDiagnostics } from './start-passage.js';\nimport { clearIndexCache } from './remote-formats.js';\nimport { writeFileAtomic } from './atomic-write.js';\nimport { VERSION } from './version.js';\n\nconst CREATOR_NAME = 'Twee-ts';\n\nconst DEFAULT_FORMAT_ID = 'sugarcube-2';\nconst DEFAULT_START_NAME = 'Start';\n\nexport class TweeTsError extends Error {\n  constructor(\n    message: string,\n    public diagnostics: Diagnostic[] = [],\n  ) {\n    super(message);\n    this.name = 'TweeTsError';\n  }\n}\n\n/**\n * Compile Twee sources to HTML, Twee, or JSON.\n */\nexport async function compile(options: CompileOptions): Promise<CompileResult> {\n  return buildOutput(options);\n}\n\n/**\n * Compile and write to a file. The file is replaced atomically: a reader sees the previous\n * build or the new one, never part of it, and a failed write leaves the previous build.\n */\nexport async function compileToFile(options: CompileToFileOptions): Promise<CompileResult> {\n  const result = await compileForOutputFile(options, options.outFile);\n  // The build may have been aborted after it finished: the previous output stays.\n  options.signal?.throwIfAborted();\n  writeFileAtomic(options.outFile, result.output);\n  return result;\n}\n\n/**\n * Builds as compileToFile() does for `outputs`, without writing them: an output may sit\n * inside a source folder, so its last build is left out of the sources and modules and\n * never read back. `outputs` is the one file the CLI writes, or every path a bundler's\n * build writes (see BuildOutputs). The caller decides whether the result is written.\n * With no outputs (output to stdout, or none), this is compile(). With `cache`, files\n * are cached as compileIncremental() caches them.\n *\n * Throws a TweeTsError when a source, module or head file named directly is an output.\n *\n * Internal, for the CLI and the bundler plugins; not part of the public API.\n */\nexport async function compileForOutputFile(\n  options: CompileOptions,\n  outputs: BuildOutputs | string | undefined,\n  cache?: Map<string, FileCacheEntry>,\n): Promise<CompileResult> {\n  return buildOutput(options, cache, undefined, outputs);\n}\n\n/**\n * Compile with incremental caching support.\n * Plugins and advanced users can manage their own cache and changed-file tracking.\n *\n * Without `changedFiles`, a cached file is reused while its modification time is unchanged.\n * With it, a file it names is always reparsed, whatever its modification time, and every\n * other cached file is reused as it is. A file may be named by an absolute path or by a path\n * relative to the working directory, with or without a leading `./`: entries are matched to\n * the source files by resolved path. A file that fails to load is dropped from the cache, so\n * the next build tries it again.\n */\nexport async function compileIncremental(\n  options: CompileOptions,\n  cache: Map<string, FileCacheEntry>,\n  changedFiles?: ReadonlySet<string>,\n): Promise<CompileResult> {\n  return buildOutput(options, cache, changedFiles);\n}\n\n/**\n * Watch for file changes and recompile. Every build is written to `outFile` (replacing it\n * atomically, as compileToFile() does), including one whose diagnostics report errors.\n * Builds run one at a time, and each one is written and reported as it finishes, in order:\n * changes made during a build go into one follow-up build after it. A watched path that\n * can't be watched is passed to `onError`.\n *\n * Aborting the returned controller, or the `signal` in the options, stops watching and\n * aborts the story format requests of the build in progress.\n */\nexport async function watch(options: WatchOptions): Promise<AbortController> {\n  return watchWithWriteFilter(options, () => true);\n}\n\n/**\n * watch(), writing to `outFile` only the builds `shouldWrite` accepts. A rejected build\n * leaves the output file as it was; `onBuild` receives every build either way.\n *\n * Internal, for the CLI, which keeps the last good output when a rebuild reports errors;\n * not part of the public API.\n */\nexport async function watchWithWriteFilter(\n  options: WatchOptions,\n  shouldWrite: (result: CompileResult) => boolean,\n  hooks: WatchHooks = {},\n): Promise<AbortController> {\n  const controller = new AbortController();\n  const cache = new Map<string, FileCacheEntry>();\n  // Every build runs with the controller's signal, which the caller's own signal also aborts (below).\n  const buildOptions: WatchOptions = { ...options, signal: controller.signal };\n\n  // Separate file paths from inline sources\n  const filePaths = options.sources.filter((s): s is string => typeof s === 'string');\n  const modulePaths = options.modules ?? [];\n  const headPaths = options.headFile ? [options.headFile] : [];\n  const allPaths = [...filePaths, ...modulePaths, ...headPaths];\n\n  // A change to an excluded source builds nothing. `exclude` leaves modules and the\n  // head file alone, so a module (or a file in a module folder) or the head file\n  // still rebuilds when a glob matches it.\n  const exclude = options.exclude ?? [];\n  const notExcludable = [...modulePaths, ...headPaths].map((p) => resolve(p));\n  const ignore = (filename: string): boolean => {\n    if (!isExcluded(filename, exclude)) return false;\n    const abs = resolve(filename);\n    return !notExcludable.some((root) => abs === root || abs.startsWith(root + sep));\n  };\n\n  // One build at a time. Changes reported while a build is in flight wait in `queued` and go\n  // into a single follow-up build once it finishes. Every finished build is delivered first:\n  // it can't be older than what was delivered before it, and delivering each one means a\n  // steady stream of changes still produces regular output and reports.\n  let building = false;\n  let queued: WatchBuildRequest | undefined;\n\n  // onError is the last place an error can go; an exception from it is reported to the\n  // console instead, so that it never ends the watch as an unhandled rejection.\n  const reportError = (error: Error): void => {\n    try {\n      options.onError?.(error);\n    } catch (e) {\n      console.error(`twee-ts watch: onError threw while handling \"${error.message}\": ${toError(e).message}`);\n    }\n  };\n\n  const deliver = (outcome: WatchBuildOutcome): void => {\n    try {\n      if (!outcome.ok) throw outcome.error;\n      if (shouldWrite(outcome.result)) writeFileAtomic(options.outFile, outcome.result.output);\n      options.onBuild?.(outcome.result);\n    } catch (e) {\n      reportError(toError(e));\n    }\n  };\n\n  // Runs `first`, then the follow-up for whatever was queued meanwhile, until nothing is.\n  // `building` is cleared in the same step as the last delivery, so a change reported\n  // right after it starts a new build rather than waiting in `queued`.\n  const drain = async (first: WatchBuildRequest): Promise<void> => {\n    building = true;\n    try {\n      let request: WatchBuildRequest | undefined = first;\n      while (request !== undefined) {\n        const outcome = await buildOutput(buildOptions, cache, request.changedFiles, options.outFile).then(\n          (result): WatchBuildOutcome => ({ ok: true, result }),\n          (e: unknown): WatchBuildOutcome => ({ ok: false, error: toError(e) }),\n        );\n        if (controller.signal.aborted) return;\n        deliver(outcome);\n        request = queued;\n        queued = undefined;\n      }\n    } finally {\n      building = false;\n      hooks.onIdle?.();\n    }\n  };\n\n  const handle = watchFilesystem(\n    allPaths,\n    options.outFile,\n    (changedFiles) => {\n      if (controller.signal.aborted) return;\n      const request: WatchBuildRequest = { changedFiles };\n      if (building) {\n        queued = queued === undefined ? request : mergeBuildRequests(queued, request);\n        return;\n      }\n      drain(request).catch((e: unknown) => reportError(toError(e)));\n    },\n    ignore,\n    reportError,\n  );\n\n  const outer = options.signal;\n  const onOuterAbort = (): void => controller.abort(outer?.reason);\n  controller.signal.addEventListener('abort', () => {\n    queued = undefined;\n    handle.close();\n    outer?.removeEventListener('abort', onOuterAbort);\n  });\n  if (outer?.aborted) onOuterAbort();\n  else outer?.addEventListener('abort', onOuterAbort, { once: true });\n  return controller;\n}\n\n/** Internal hooks into watchWithWriteFilter(); not part of the public API. */\nexport interface WatchHooks {\n  /**\n   * Called each time the watch's builds have run out: the last one was delivered or, after\n   * an abort, dropped, and none is in flight. Lets a test wait for a build to finish when\n   * nothing it does shows.\n   */\n  readonly onIdle?: () => void;\n}\n\n/** A watch-mode build: the files that changed, or `undefined` for a full build. */\ninterface WatchBuildRequest {\n  readonly changedFiles: ReadonlySet<string> | undefined;\n}\n\ntype WatchBuildOutcome =\n  { readonly ok: true; readonly result: CompileResult } | { readonly ok: false; readonly error: Error };\n\n/** One build covering both requests: a full build if either is one, else every changed file. */\nfunction mergeBuildRequests(a: WatchBuildRequest, b: WatchBuildRequest): WatchBuildRequest {\n  if (a.changedFiles === undefined || b.changedFiles === undefined) return { changedFiles: undefined };\n  return { changedFiles: new Set([...a.changedFiles, ...b.changedFiles]) };\n}\n\nfunction toError(e: unknown): Error {\n  return e instanceof Error ? e : new Error(String(e));\n}\n\n/**\n * `outputs`: what the build writes (an output file's path, or a bundler's outputs),\n * which source and module discovery skip, so an output inside a source folder is\n * never loaded back. A source, module or head file named directly that is an output\n * is a TweeTsError, as in Tweego: writing the build would overwrite it.\n */\nasync function buildOutput(\n  options: CompileOptions,\n  cache?: Map<string, FileCacheEntry>,\n  changedFiles?: ReadonlySet<string>,\n  outputs?: BuildOutputs | string,\n): Promise<CompileResult> {\n  const written = toBuildOutputs(outputs);\n  const diagnostics: Diagnostic[] = [];\n  const outputMode: OutputMode = options.outputMode ?? 'html';\n  const trim = options.trim ?? true;\n  const twee2Compat = options.twee2Compat ?? false;\n  const testMode = options.testMode ?? false;\n  const noRemote = options.noRemote ?? false;\n  const sourceInfo = options.sourceInfo ?? false;\n\n  options.signal?.throwIfAborted();\n  const timeout = options.formatFetchTimeout;\n  if (timeout !== undefined && !(timeout >= 0)) {\n    throw new TweeTsError(`formatFetchTimeout must be 0 or more milliseconds, not ${timeout}.`);\n  }\n\n  // Clear per-compile index cache\n  clearIndexCache();\n\n  // Group the sources in the order supplied: each run of file paths is walked (directories\n  // expanded in place) and each run of inline sources is kept together, so a later source\n  // overrides an earlier one whatever kind each is.\n  const groups: SourceGroup[] = [];\n  const outputSources: string[] = [];\n  for (const source of options.sources) {\n    const last = groups[groups.length - 1];\n    if (typeof source === 'string') {\n      if (last?.kind === 'paths') last.paths.push(source);\n      else groups.push({ kind: 'paths', paths: [source] });\n    } else if (last?.kind === 'inline') {\n      last.sources.push(source);\n    } else {\n      groups.push({ kind: 'inline', sources: [source] });\n    }\n  }\n\n  const walked = groups.map((group) => {\n    if (group.kind === 'inline') return group;\n    const found = getFilenames(group.paths, written, options.exclude);\n    diagnostics.push(...found.diagnostics);\n    outputSources.push(...found.outputSources);\n    return { kind: 'files' as const, filenames: found.filenames };\n  });\n  rejectOutputSources(outputSources, diagnostics);\n  // Every file of the build, so that a cache purge while loading one group keeps the others' entries.\n  const buildFiles = new Set(walked.flatMap((group) => (group.kind === 'files' ? group.filenames : [])));\n\n  // Create story and load sources\n  const story = createStory();\n  const processedFiles = new Set<string>();\n\n  for (const group of walked) {\n    if (group.kind === 'inline') {\n      loadInlineSources(story, group.sources, { trim, twee2Compat }, diagnostics);\n    } else if (cache) {\n      loadSourcesCached(\n        story,\n        group.filenames,\n        { trim, twee2Compat },\n        diagnostics,\n        processedFiles,\n        cache,\n        changedFiles,\n        buildFiles,\n      );\n    } else {\n      loadSources(story, group.filenames, { trim, twee2Compat }, diagnostics, processedFiles);\n    }\n  }\n  if (cache && buildFiles.size === 0) {\n    loadSourcesCached(story, [], { trim, twee2Compat }, diagnostics, processedFiles, cache, changedFiles);\n  }\n\n  // Apply tag aliases (e.g. library → script)\n  if (options.tagAliases) {\n    story.passages = applyTagAliases(story.passages, options.tagAliases);\n  }\n\n  // Resolve format: explicit formatId > StoryData format > default, looked up locally,\n  // in the download cache, then remotely. An unavailable request is an error, never another format.\n  let format: StoryFormatInfo | undefined;\n\n  if (outputMode === 'html') {\n    const request = formatRequestFor(\n      options.formatId,\n      story.twine2.format,\n      story.twine2.formatVersion,\n      DEFAULT_FORMAT_ID,\n    );\n    format = await resolveStoryFormat(request, { ...options, noRemote }, diagnostics);\n    // The caller may have aborted while the format was being found.\n    options.signal?.throwIfAborted();\n  }\n\n  // Merge config from StoryData: command-line > StoryData > default.\n  // An explicit override is recorded on the story so JSON output and inspection see it too.\n  if (options.startPassage) story.twine2.start = options.startPassage;\n  const startName = story.twine2.start || DEFAULT_START_NAME;\n\n  // Apply test mode\n  if (testMode) {\n    story.twine2.options.set('debug', true);\n  }\n\n  // Ensure IFID is set before output generation\n  ensureIFID(story, diagnostics);\n\n  // Generate output\n  let output: string;\n\n  switch (outputMode) {\n    case 'twee3':\n    case 'twee1':\n      // Without a StoryData passage, add one only to record what the options changed.\n      output = toTwee(story, outputMode, { addStoryData: Boolean(options.startPassage) || testMode, diagnostics });\n      break;\n\n    case 'twine2-archive':\n      output = toTwine2Archive(story, startName, { sourceInfo });\n      break;\n\n    case 'twine1-archive':\n      output = toTwine1Archive(story, startName);\n      break;\n\n    case 'json':\n      output = storyToJSON(story);\n      break;\n\n    case 'html': {\n      // Sanity checks for HTML mode\n      diagnostics.push(...startPassageDiagnostics(story, startName, format?.isTwine2 === false ? 'twine1' : 'twine2'));\n\n      if (!format) {\n        throw new TweeTsError('No story format available for HTML output.', diagnostics);\n      }\n\n      if (!format.isTwine2 && story.name === '' && !storyHas(story, 'StoryTitle')) {\n        diagnostics.push({\n          level: 'error',\n          message: 'Special passage \"StoryTitle\" not found.',\n        });\n      }\n\n      // Modules and head file, injected before the template's closing head tag while the template is filled\n      const modules = getFilenames(options.modules ?? [], written);\n      diagnostics.push(...modules.diagnostics);\n      const { headFile } = options;\n      const headIsOutput = headFile !== undefined && outputPaths(written).isFile(realPathOf(headFile));\n      rejectOutputSources([...modules.outputSources, ...(headIsOutput ? [headFile] : [])], diagnostics);\n      const head = loadHeadContent(modules.filenames, options.headFile, diagnostics);\n\n      output = format.isTwine2\n        ? toTwine2HTML(story, format, startName, { sourceInfo, head, diagnostics })\n        : toTwine1HTML(story, format, startName, { head, diagnostics });\n      break;\n    }\n\n    default: {\n      const _exhaustive: never = outputMode;\n      throw new TweeTsError(`Unhandled output mode: ${_exhaustive as string}`, diagnostics);\n    }\n  }\n\n  // Compute stats\n  const stats: CompileStats = {\n    ...getStoryStats(story, options.wordCountMethod),\n    files: [...processedFiles],\n  };\n\n  // Nothing is delivered, or written by the caller, for a build that was aborted meanwhile.\n  options.signal?.throwIfAborted();\n  return { output, story, format, diagnostics, stats };\n}\n\n/** A run of sources of one kind, in the order supplied. */\ntype SourceGroup =\n  { readonly kind: 'paths'; readonly paths: string[] } | { readonly kind: 'inline'; readonly sources: InlineSource[] };\n\n/**\n * Throws for the first of `paths`, inputs named directly that are also an output:\n * writing the build would overwrite them. An output found while walking a source\n * folder is skipped instead (see getFilenames).\n */\nfunction rejectOutputSources(paths: readonly string[], diagnostics: readonly Diagnostic[]): void {\n  const [first] = paths;\n  if (first === undefined) return;\n  throw new TweeTsError(`path ${first}: Output file cannot be an input source.`, [...diagnostics]);\n}\n\nfunction ensureIFID(story: Story, diagnostics: Diagnostic[]): void {\n  if (story.ifid !== '') return;\n\n  if (story.legacyIFID !== '') {\n    story.ifid = story.legacyIFID;\n    diagnostics.push({\n      level: 'warning',\n      message: 'Story IFID not found; reusing \"ifid\" entry from the \"StorySettings\" special passage.',\n    });\n  } else {\n    const ifid = generateIFID();\n    story.ifid = ifid;\n    diagnostics.push({\n      level: 'error',\n      message: `Story IFID not found. Add an IFID to your story: {\"ifid\":\"${ifid}\"}`,\n    });\n  }\n}\n\n/**\n * Serialize a Story to JSON per the Twine 2 JSON Output Specification (v1.0):\n * https://github.com/iftechfoundation/twine-specs/blob/master/twine-2-jsonoutput-doc.md\n */\nfunction storyToJSON(story: Story): string {\n  // Gather script and stylesheet content, excluding them from passages.\n  const scripts: string[] = [];\n  const stylesheets: string[] = [];\n  const storyPassages: { name: string; tags: string[]; text: string; metadata?: Record<string, string> }[] = [];\n\n  for (const p of story.passages) {\n    if (p.name === 'StoryTitle' || p.name === 'StoryData') continue;\n    if (hasTag(p, 'Twine.private')) continue;\n\n    if (hasTag(p, 'script')) {\n      scripts.push(p.text);\n    } else if (hasTag(p, 'stylesheet')) {\n      stylesheets.push(p.text);\n    } else {\n      const entry: { name: string; tags: string[]; text: string; metadata?: Record<string, string> } = {\n        name: p.name,\n        tags: p.tags,\n        text: p.text,\n      };\n      if (p.metadata) {\n        const meta: Record<string, string> = {};\n        for (const [key, value] of Object.entries(p.metadata)) {\n          if (typeof value === 'string') meta[key] = value;\n        }\n        if (Object.keys(meta).length > 0) {\n          entry.metadata = meta;\n        }\n      }\n      storyPassages.push(entry);\n    }\n  }\n\n  const obj: Record<string, unknown> = {\n    name: story.name,\n  };\n\n  if (story.ifid) obj.ifid = story.ifid;\n  if (story.twine2.format) obj.format = story.twine2.format;\n  if (story.twine2.formatVersion) obj['format-version'] = story.twine2.formatVersion;\n  if (story.twine2.start) obj.start = story.twine2.start;\n  if (story.twine2.tagColors.size > 0) obj['tag-colors'] = Object.fromEntries(story.twine2.tagColors);\n  if (story.twine2.zoom !== 1) obj.zoom = story.twine2.zoom;\n  obj.creator = CREATOR_NAME;\n  obj['creator-version'] = VERSION;\n  obj.style = stylesheets.join('\\n');\n  obj.script = scripts.join('\\n');\n  obj.passages = storyPassages;\n\n  return JSON.stringify(obj, null, 2);\n}\n","/**\n * How the build plugins turn compile results into bundler errors and warnings.\n */\nimport type { CompileResult, Diagnostic } from '../types.js';\nimport { TweeTsError } from '../compiler.js';\n\n/** An error carrying the file and line the bundler reports (and Vite shows in its overlay). */\nexport interface LocatedError extends Error {\n  id?: string;\n  loc?: { file: string; line: number; column: number };\n}\n\nexport function formatDiagnostic(d: Readonly<Diagnostic>): string {\n  const where = d.file ? `${d.file}${d.line ? `:${d.line}` : ''}: ` : '';\n  // The parser starts its messages with \"line N: \"; the location already says it.\n  const message = d.file && d.line ? d.message.replace(/^line \\d+: /, '') : d.message;\n  return `${where}${message}`;\n}\n\n/** Returns the warnings; throws a LocatedError when the compile reported errors. */\nexport function splitDiagnostics(result: Readonly<CompileResult>): Diagnostic[] {\n  const errors = result.diagnostics.filter((d) => d.level === 'error');\n  if (errors.length === 0) return result.diagnostics.filter((d) => d.level === 'warning');\n  const error: LocatedError = new Error(errors.map(formatDiagnostic).join('\\n'));\n  const [first] = errors;\n  if (first?.file) {\n    error.id = first.file;\n    error.loc = { file: first.file, line: first.line ?? 1, column: 1 };\n  }\n  throw error;\n}\n\n/** An error thrown by the compiler or bundler, with a TweeTsError's error diagnostics folded into its message. */\nexport function fatalError(e: unknown): LocatedError {\n  if (e instanceof TweeTsError) {\n    const errors = e.diagnostics.filter((d) => d.level === 'error').map(formatDiagnostic);\n    return new Error([...errors, e.message].join('\\n'));\n  }\n  return e instanceof Error ? e : new Error(String(e));\n}\n","/**\n * Path helpers for the bundler plugins. Vite reports module ids with forward\n * slashes on every platform, while node:path gives backslashes on Windows, so\n * the Vite plugin compares paths in forward-slash form only. Paths a build\n * writes are compared by real path instead (see filesystem.ts).\n */\nimport { dirname, resolve } from 'node:path';\nimport type { BuildOutputs } from '../filesystem.js';\n\n/** The output settings that say where a bundle is written, as Rollup and Vite pass them to generateBundle. */\nexport interface OutputLocation {\n  readonly dir?: string | undefined;\n  readonly file?: string | undefined;\n}\n\n/**\n * The absolute path a bundle writes the file it emits as `fileName` to: inside\n * `output.dir`, or next to `output.file`, either resolved against the working\n * directory, as the bundler resolves them. Undefined when the output names\n * neither, as for a bundle only generated in memory.\n */\nexport function emittedFilePath(output: OutputLocation, fileName: string): string | undefined {\n  const dir = output.dir ?? (output.file === undefined ? undefined : dirname(output.file));\n  return dir === undefined ? undefined : resolve(dir, fileName);\n}\n\n/**\n * The locations a bundler's `output` option names: one output's settings or an\n * array of them, as a config gives them. Outputs that name neither `dir` nor\n * `file`, and anything that isn't an output's settings, are left out.\n */\nexport function outputLocations(option: unknown): OutputLocation[] {\n  return (Array.isArray(option) ? option : [option]).flatMap((output: unknown): OutputLocation[] => {\n    if (typeof output !== 'object' || output === null) return [];\n    const { dir, file } = output as { readonly dir?: unknown; readonly file?: unknown };\n    const location = {\n      ...(typeof dir === 'string' ? { dir } : {}),\n      ...(typeof file === 'string' ? { file } : {}),\n    };\n    return location.dir === undefined && location.file === undefined ? [] : [location];\n  });\n}\n\n/**\n * Every path the builds of one plugin instance write, gathered from what the\n * bundler reports: each output's location (`output.dir`, `output.file`, the\n * story inside it) and the files of each bundle written there. It is kept across\n * builds, so a compile also leaves out what another output of the same build\n * writes, before or after it, and files an earlier build wrote that the current\n * one doesn't (an old hashed chunk).\n */\nexport interface OutputRecord {\n  /** Records an output location: its folder, its file, and the story it writes. */\n  addLocation(output: OutputLocation): void;\n  /** Records the files a bundle writes to `output`, by output file name. */\n  addFiles(output: OutputLocation, fileNames: Iterable<string>): void;\n  /** Every path recorded so far: `output.dir` folders as folders, the rest as files. */\n  outputs(): BuildOutputs;\n}\n\n/** An empty OutputRecord for a plugin that writes its story as `storyFileName`. */\nexport function createOutputRecord(storyFileName: string): OutputRecord {\n  const files = new Set<string>();\n  const dirs = new Set<string>();\n  const addFiles = (output: OutputLocation, fileNames: Iterable<string>): void => {\n    for (const fileName of fileNames) {\n      const path = emittedFilePath(output, fileName);\n      if (path !== undefined) files.add(path);\n    }\n  };\n  return {\n    addLocation(output) {\n      if (output.dir !== undefined) dirs.add(resolve(output.dir));\n      if (output.file !== undefined) files.add(resolve(output.file));\n      addFiles(output, [storyFileName]);\n    },\n    addFiles,\n    outputs: () => ({ files: [...files], dirs: [...dirs] }),\n  };\n}\n\n/** The path with Windows separators turned into forward slashes. */\nexport function toPosix(path: string): string {\n  return path.replace(/\\\\/g, '/');\n}\n\n/** Whether `file` is one of `dirs` or inside one of them. All paths in forward-slash form. */\nexport function isInside(file: string, dirs: readonly string[]): boolean {\n  return dirs.some((dir) => file === dir || file.startsWith(dir.endsWith('/') ? dir : `${dir}/`));\n}\n\n/**\n * Whether `file` is a temporary copy of a Vite config file. Vite writes one next\n * to the config file each time it loads it (when no node_modules folder is\n * above the config, and always under Deno), then deletes it.\n */\nexport function isViteConfigTemp(file: string): boolean {\n  return /\\.timestamp-\\d+-[0-9a-f]*\\.mjs$/.test(file);\n}\n"],"x_google_ignoreList":[18,19,20,21,22,23,24,25,26,27,28,29],"mappings":";;;;;;;;;;;;AAQA,SAAgB,eAAqB;CACnC,OAAO,WAAW,CAAC,CAAC,YAAY;AAClC;;AAaA,MAAM,iBAAiB;;;;;;;;AASvB,SAAgB,cAAc,OAAqB;CACjD,MAAM,QAAQ,MAAM,YAAY;CAEhC,OADa,MAAM,WAAW,kBAAkB,aAAa,KAAK,MAAM,OAAO,MAAM,MAAM,GAAG,EAAE,IAAI;AAEtG;;;;;;AAOA,SAAgB,aAAa,MAA6B;CACxD,IAAI,OAAO;CAEX,QAAQ,KAAK,QAAb;EACE,KAAK,IACH;EACF,KAAK;GACH,IAAI,KAAK,MAAM,GAAG,CAAC,CAAC,CAAC,YAAY,MAAM,aAAa,KAAK,MAAM,EAAE,MAAM,MACrE,OAAO;GAET,OAAO,KAAK,MAAM,GAAG,EAAE;GACvB;EAEF,SACE,OAAO,wBAAwB,KAAK;CACxC;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,KAAK,KAAK;EAChB,QAAQ,GAAR;GACE,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;IACH,IAAI,OAAO,KACT,OAAO,2BAA2B,GAAG,gBAAgB,IAAI;IAE3D;GACF,KAAK;IACH,IAAI,KAAK,OAAO,KAAK,KACnB,OAAO,oBAAoB,GAAG,gBAAgB,IAAI;IAEpD;GACF,KAAK;IACH,IAAI,CAAC;KAAC;KAAK;KAAK;KAAK;KAAK;KAAK;IAAG,CAAC,CAAC,SAAS,EAAE,GAC7C,OAAO,oBAAoB,GAAG,gBAAgB,IAAI;IAEpD;GACF,SACE,IAAI,CAAC,gBAAgB,KAAK,EAAE,GAC1B,OAAO,2BAA2B,GAAG,gBAAgB,IAAI;EAG/D;CACF;CAEA,OAAO;AACT;;;;;;;;ACpFA,SAAgB,WAAW,GAAmB;CAC5C,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EAAE,QAAQ,MAAM,OAAO,CAAC,CAAC,QAAQ,MAAM,QAAQ,CAAC,CAAC,QAAQ,MAAM,OAAO;AAC/E;;AAGA,SAAgB,eAAe,GAAmB;CAChD,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EACJ,QAAQ,MAAM,OAAO,CAAC,CACtB,QAAQ,MAAM,MAAM,CAAC,CACrB,QAAQ,MAAM,MAAM,CAAC,CACrB,QAAQ,MAAM,QAAQ,CAAC,CACvB,QAAQ,MAAM,OAAO;AAC1B;;AAGA,SAAgB,WAAW,GAAmB;CAC5C,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EACJ,QAAQ,MAAM,OAAO,CAAC,CACtB,QAAQ,MAAM,MAAM,CAAC,CACrB,QAAQ,MAAM,MAAM,CAAC,CACrB,QAAQ,MAAM,QAAQ,CAAC,CACvB,QAAQ,MAAM,OAAO;AAC1B;;AAGA,SAAgB,cAAc,GAAmB;CAC/C,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EACJ,QAAQ,OAAO,KAAK,CAAC,CACrB,QAAQ,MAAM,OAAO,CAAC,CACtB,QAAQ,MAAM,MAAM,CAAC,CACrB,QAAQ,MAAM,MAAM,CAAC,CACrB,QAAQ,MAAM,QAAQ,CAAC,CACvB,QAAQ,OAAO,KAAK,CAAC,CACrB,QAAQ,OAAO,KAAK;AACzB;;AAGA,SAAgB,gBAAgB,GAAmB;CACjD,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EAAE,QAAQ,QAAQ,IAAI,CAAC,CAAC,QAAQ,QAAQ,GAAI,CAAC,CAAC,QAAQ,QAAQ,IAAI;AAC3E;;AAGA,SAAgB,WAAW,GAAmB;CAC5C,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EAAE,QAAQ,eAAe,OAAO,OAAO,EAAE;AAClD;AAEA,MAAM,oBAAsD;CAC1D,MAAM;CACN,MAAK;CACL,KAAK;CACL,MAAM;CACN,MAAM;CACN,KAAM;CACN,KAAK;CACL,UAAU;CACV,UAAU;AACZ;;;;;;;;AASA,SAAgB,eAAe,GAAmB;CAChD,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EAAE,QAAQ,+BAA+B,OAAO,kBAAkB,OAAO,EAAE;AACpF;;;;;;AAOA,SAAgB,gBAAgB,GAAmB;CACjD,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EAAE,QAAQ,8BAA8B,OAC7C,OAAO,QAAQ,OAAO,OAAM,KAAK,OAAO,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,EAC7E;AACF;;AAGA,SAAgB,gBAAgB,GAAmB;CACjD,OAAO,EAAE,QAAQ,SAAS,KAAK;AACjC;;AAGA,SAAgB,oBAAoB,GAAmB;CACrD,OAAO,EAAE,QAAQ,YAAY,QAAQ;AACvC;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,oBAAoB,GAAmB;CACrD,MAAM,UAAU,EAAE,QAAQ,mBAAmB,KAAK;CAClD,OAAO,kBAAkB,OAAO,IAAI,QAAQ,QAAQ,aAAa,KAAK,IAAI;AAC5E;;;;;;AAOA,SAAS,kBAAkB,GAAoB;CAC7C,MAAM,iBAAiB;CACvB,IAAI,MAAM;CACV,SAAS;EAEP,MAAM,OAAO,EAAE,QAAQ,QAAQ,GAAG;EAClC,IAAI,SAAS,IAAI,OAAO;EAGxB,MAAM,cAAc,OAAO;EAC3B,MAAM,QAAQ,EAAE,QAAQ,OAAO,WAAW;EAC1C,eAAe,YAAY;EAC3B,MAAM,QAAQ,eAAe,KAAK,CAAC;EACnC,IAAI,UAAU,QAAS,UAAU,MAAM,QAAQ,MAAM,OAAQ;GAC3D,IAAI,UAAU,IAAI,OAAO;GACzB,MAAM,QAAQ;GACd;EACF;EAEA,MAAM,MAAM,EAAE,QAAQ,OAAO,MAAM,QAAQ,MAAM,EAAE,CAAC,MAAM;EAC1D,IAAI,QAAQ,IAAI,OAAO;EACvB,MAAM,MAAM;CACd;AACF;;;;;;;AAQA,SAAgB,mBAAmB,GAAmB;CACpD,OAAO,EAAE,QAAQ,kBAAkB,KAAK;AAC1C;;AAGA,SAAgB,MAAM,GAAmB;CACvC,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,OAAO,EAAE,QAAQ,cAAc,OAAO;EACpC,MAAM,OAAO,MAAM,MAAM,KAAK;EAC9B,OAAO,OAAO,cAAe,GAAG,WAAW,CAAC,IAAI,OAAO,MAAM,KAAM,IAAI;CACzE,CAAC;AACH;;AAGA,SAAgB,aAAa,GAAmB;CAC9C,IAAI,EAAE,WAAW,GAAG,OAAO;CAC3B,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,IAAI,EAAE,OAAO,MAAM;GACjB;GACA,IAAI,KAAK,EAAE,QAAQ;IACjB,UAAU;IACV;GACF;EACF;EACA,UAAU,EAAE;CACd;CACA,OAAO;AACT;;;ACtLA,MAAM,qCAAqB,IAAI,IAAI;CACjC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAM,YAAY;CAAC;CAAc;CAAU;CAAc;AAAQ;AAEjE,SAAgB,OAAO,GAAoB,KAAsB;CAC/D,OAAO,EAAE,KAAK,SAAS,GAAG;AAC5B;AAEA,SAAgB,UAAU,GAAoB,GAAG,MAAyB;CACxE,OAAO,EAAE,KAAK,MAAM,MAAM,KAAK,SAAS,CAAC,CAAC;AAC5C;AAEA,SAAgB,mBAAmB,GAAoB,QAAyB;CAC9E,OAAO,EAAE,KAAK,MAAM,MAAM,EAAE,WAAW,MAAM,CAAC;AAChD;AAEA,SAAgB,YAAY,GAA6B;CACvD,OAAO,UAAU,GAAG,GAAG,SAAS,KAAK,mBAAmB,GAAG,QAAQ;AACrE;AAEA,SAAgB,YAAY,GAA6B;CACvD,OAAO,mBAAmB,IAAI,EAAE,IAAI;AACtC;AAMA,SAAgB,eAAe,GAA6B;CAC1D,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,YAAY,CAAC;AAC1C;AAEA,SAAgB,oBAAoB,GAA6B;CAC/D,OAAO,EAAE,YAAY,QAAQ,EAAE,SAAS,YAAY,QAAQ,EAAE,SAAS,aAAa;AACtF;AAEA,SAAgB,gBAAgB,GAA6B;CAC3D,OAAO,EAAE,YAAY,QAAQ,EAAE,SAAS,QAAQ,QAAQ,EAAE,SAAS,SAAS;AAC9E;AAEA,SAAgB,eAAe,GAA6B;CAC1D,IAAI,CAAC,EAAE,UAAU,OAAO;CACxB,OAAO,OAAO,OAAO,EAAE,QAAQ,CAAC,CAAC,MAAM,MAAM,KAAK,QAAQ,MAAM,EAAE;AACpE;AAEA,SAAgB,gBAAgB,MAA+B;CAC7D,MAAM,MAA8B,CAAC;CACrC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,GAC5C,IAAI,OAAO,UAAU,YAAY,OAAO,IAAI,OAAO;CAErD,OAAO,KAAK,UAAU,GAAG;AAC3B;;AAgBA,SAAgB,cAAc,GAAoB,SAA6B;CAC7E,IAAI;CACJ,IAAI,YAAY,SAAS;EACvB,SAAS,QAAQ,WAAW,EAAE,IAAI;EAClC,IAAI,EAAE,KAAK,SAAS,GAClB,UAAU,OAAO,WAAW,EAAE,KAAK,KAAK,GAAG,CAAC,IAAI;EAElD,IAAI,eAAe,CAAC,KAAK,EAAE,UACzB,UAAU,MAAM,gBAAgB,EAAE,QAAQ;CAE9C,OAAO;EACL,SAAS,QAAQ,EAAE;EACnB,IAAI,EAAE,KAAK,SAAS,GAClB,UAAU,OAAO,EAAE,KAAK,KAAK,GAAG,IAAI;CAExC;CACA,UAAU;CACV,IAAI,EAAE,KAAK,SAAS,GAClB,UAAU,EAAE,OAAO;CAErB,UAAU;CACV,OAAO;AACT;;AAGA,SAAgB,qBACd,GACA,KACA,SACQ;CACR,IAAI;CACJ,IAAI;CAEJ,IAAI,oBAAoB,CAAC,GACvB,WAAW,EAAE,UAAU,YAAY;MAC9B;EACL,MAAM,IAAI,MAAM;EAChB,MAAM,IAAI,KAAK,MAAM,MAAM,EAAE;EAC7B,MAAM,KAAK,MAAM,IAAI,KAAK;EAC1B,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI;EAC7B,WAAW,GAAG,KAAK,MAAM,GAAG,GAAG,KAAK,MAAM;CAC5C;CAEA,IAAI,gBAAgB,CAAC,GACnB,OAAO,EAAE,UAAU,QAAQ;MAE3B,OAAO;CAGT,IAAI,QAAQ,wBAAwB,IAAI,SAAS,MAAM,eAAe,EAAE,IAAI,CAAC,EAAE,QAAQ,MAAM,WAAW,EAAE,KAAK,KAAK,GAAG,CAAC,CAAC,EAAE,YAAY,MAAM,WAAW,QAAQ,CAAC,EAAE,QAAQ,MAAM,WAAW,IAAI,CAAC;CACjM,IAAI,SAAS,cAAc,EAAE,QAC3B,SAAS,qBAAqB,MAAM,WAAW,EAAE,OAAO,IAAI,CAAC,EAAE,qBAAqB,EAAE,OAAO,KAAK;CAEpG,OAAO,GAAG,MAAM,GAAG,WAAW,EAAE,IAAI,EAAE;AACxC;;;;;;AAOA,SAAgB,eAAe,GAAoD;CACjF,OAAO,EAAE,SAAS,mBAAmB,CAAC,EAAE,KAAK,SAAS,aAAa;AACrE;;;;;;AAOA,SAAgB,iBAAiB,GAAoB,KAAa,iBAAiB,OAAe;CAChG,IAAI;CAEJ,IAAI,oBAAoB,CAAC,GACvB,WAAW,EAAE,UAAU,YAAY;MAC9B;EACL,MAAM,IAAI,MAAM;EAChB,MAAM,IAAI,KAAK,MAAM,MAAM,EAAE;EAC7B,MAAM,KAAK,MAAM,IAAI,KAAK;EAC1B,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI;EAC7B,WAAW,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM;CAC7C;CAEA,MAAM,2BAAU,IAAI,KAAK,EAAA,CAAE,YAAY,CAAC,CAAC,QAAQ,UAAU,EAAE,CAAC,CAAC,MAAM,GAAG,EAAE;CAC1E,MAAM,SAAS,kBAAkB,eAAe,CAAC,IAAI,SAAS,MAAc;CAC5E,MAAM,OAAO,WAAW,OAAO,EAAE,IAAI,CAAC;CACtC,MAAM,OAAO,WAAW,EAAE,KAAK,IAAI,MAAM,CAAC,CAAC,KAAK,GAAG,CAAC;CACpD,OAAO,gBAAgB,MAAM,IAAI,EAAE,QAAQ,MAAM,IAAI,EAAE,WAAW,MAAM,OAAO,EAAE,YAAY,MAAM,MAAM,EAAE,kBAAkB,MAAM,WAAW,QAAQ,CAAC,EAAE,GAAG,cAAc,OAAO,EAAE,IAAI,CAAC,EAAE;AAC5L;;;;;;;AAQA,SAAgB,WAAW,GAAoB,SAA0B,UAAkB;CACzF,QAAQ,QAAR;EACE,KAAK,UAAU;GACb,IAAI,OAAO,EAAE;GACb,OAAO,KAAK,QAAQ,OAAO,EAAE;GAC7B,OAAO,KAAK,QAAQ,0CAA0C,EAAE;GAEhE,MAAM,QAAQ,CAAC,GADI,KAAK,UAAU,MACP,CAAC,CAAC,CAAC;GAC9B,IAAI,UAAU,GAAG,OAAO;GACxB,MAAM,QAAQ,KAAK,MAAM,QAAQ,CAAC;GAClC,OAAO,QAAQ,IAAI,IAAI,QAAQ,IAAI;EACrC;EACA,KAAK,cAAc;GACjB,IAAI,OAAO,EAAE;GAEb,OAAO,KAAK,QAAQ,0CAA0C,EAAE;GAEhE,OAAO,KAAK,QAAQ,cAAc,EAAE;GAEpC,OAAO,KAAK,QAAQ,qCAAqC,IAAI;GAE7D,OAAO,KAAK,QAAQ,YAAY,EAAE;GAElC,OADe,KAAK,MAAM,KAAK,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,CAC9C,CAAC,CAAC;EAChB;EACA,SAEE,MAAM,IAAI,MAAM,gCAAgCA,QAAuB;CAE3E;AACF;;;;;;AAOA,SAAgB,gBAAgB,UAA8B,SAA4C;CACxG,MAAM,UAAU,OAAO,QAAQ,OAAO;CACtC,IAAI,QAAQ,WAAW,GAAG,OAAO,CAAC,GAAG,QAAQ;CAC7C,OAAO,SAAS,KAAK,MAAM;EACzB,MAAM,WAAW,EAAE;EACnB,MAAM,QAAkB,CAAC;EACzB,KAAK,MAAM,CAAC,OAAO,cAAc,SAC/B,IAAI,SAAS,SAAS,KAAK,KAAK,CAAC,SAAS,SAAS,SAAS,KAAK,CAAC,MAAM,SAAS,SAAS,GACxF,MAAM,KAAK,SAAS;EAGxB,OAAO,MAAM,SAAS,IAAI;GAAE,GAAG;GAAG,MAAM,CAAC,GAAG,UAAU,GAAG,KAAK;EAAE,IAAI;CACtE,CAAC;AACH;AAEA,SAAS,MAAM,GAAmB;CAChC,OAAO,IAAI,EAAE;AACf;;;AC7NA,MAAM,+BAAe,IAAI,QAA0B;AAEnD,SAAS,WAAW,OAAyB;CAC3C,MAAM,QAAQ,MAAM,SAAS,KAAK,MAAM,EAAE,IAAI;CAC9C,MAAM,QAAmB;EAAE,UAAU,MAAM;EAAU;EAAO,WAAW,IAAI,IAAI,MAAM,KAAK,MAAM,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;CAAE;CAClH,aAAa,IAAI,OAAO,KAAK;CAC7B,OAAO;AACT;;;;;;AAOA,SAAS,aAAa,OAAyB;CAC7C,MAAM,QAAQ,aAAa,IAAI,KAAK;CACpC,OAAO,UAAU,KAAA,KAAa,MAAM,aAAa,MAAM,YAAY,MAAM,MAAM,WAAW,MAAM,SAAS,SACrG,QACA,WAAW,KAAK;AACtB;;AAYA,SAAS,SAAS,OAAc,MAAsB;CACpD,MAAM,IAAI,aAAa,KAAK,CAAC,CAAC,UAAU,IAAI,IAAI;CAChD,IAAI,MAAM,KAAA,GAAW,OAAO;CAC5B,IAAI,MAAM,SAAS,EAAE,EAAE,SAAS,MAAM,OAAO;CAC7C,OAAO,WAAW,KAAK,CAAC,CAAC,UAAU,IAAI,IAAI,KAAK;AAClD;;AAGA,SAAS,KAAK,OAAc,GAAkB;CAC5C,MAAM,QAAQ,aAAa,KAAK;CAChC,MAAM,UAAU,IAAI,EAAE,MAAM,MAAM,SAAS,MAAM;CACjD,MAAM,MAAM,KAAK,EAAE,IAAI;CACvB,MAAM,SAAS,KAAK,CAAC;AACvB;;AAGA,SAAS,UAAU,OAAc,GAAW,GAAkB;CAC5D,MAAM,UAAU,MAAM,SAAS,EAAE,EAAE,SAAS,EAAE;CAC9C,MAAM,SAAS,KAAK;CAEpB,IAAI,SAAS,WAAW,KAAK;AAC/B;;AAKA,MAAM,wCAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;AACF,CAAC;;AAeD,MAAM,iCAAiB,IAAI,QAAgC;;;;;AAM3D,SAAgB,kBAAkB,GAAY,QAAgC;CAC5E,eAAe,IAAI,GAAG,MAAM;CAC5B,OAAO;AACT;;AAGA,SAAgB,SAAS,MAAc,QAA2C;CAChF,IAAI,OAAO,IAAI,GAAG,OAAO;CACzB,KAAK,IAAI,IAAI,IAAK,KAAK;EACrB,MAAM,YAAY,GAAG,KAAK,GAAG;EAC7B,IAAI,OAAO,SAAS,GAAG,OAAO;CAChC;AACF;;AAGA,SAAS,mBAAmB,OAAc,MAAuB;CAC/D,OAAO,CAAC,sBAAsB,IAAI,IAAI,KAAK,SAAS,OAAO,IAAI,MAAM;AACvE;AAEA,SAAS,aAAa,QAAuB,MAAc,IAAY,aAAiC;CACtG,QAAQ,OAAO,MAAf;EACE,KAAK,QACH;EACF,KAAK,SAAS;GACZ,MAAM,SAAS,sBAAsB,IAAI,IAAI,IACzC,IAAI,KAAK,wCACT,iCAAiC,KAAK;GAC1C,YAAY,KAAK;IACf,OAAO;IACP,SAAS,YAAY,KAAK,UAAU,OAAO,KAAK,gBAAgB,GAAG,KAAK,OAAO;GACjF,CAAC;GACD;EACF;EACA,SAEE,MAAM,IAAI,MAAM,6BAA6B,KAAK,UAAUC,MAAW,GAAG;CAE9E;AACF;;AAGA,SAAS,aAAa,OAAc,GAAY,QAAuB,aAAiC;CACtG,IAAI,mBAAmB,OAAO,EAAE,IAAI,GAAG;EACrC,KAAK,OAAO,CAAC;EACb;CACF;CACA,MAAM,OAAO,SAAS,OAAO,OAAO,MAAM,mBAAmB,OAAO,CAAC,CAAC;CACtE,aAAa,QAAQ,EAAE,MAAM,MAAM,WAAW;CAC9C,KAAK,OAAO,kBAAkB;EAAE,GAAG;EAAG;CAAK,GAAG,MAAM,CAAC;AACvD;;;;;AAMA,SAAS,mBAAmB,OAAc,MAAc,aAAiC;CACvF,MAAM,IAAI,SAAS,OAAO,IAAI;CAC9B,MAAM,WAAW,MAAM,KAAK,KAAA,IAAY,MAAM,SAAS;CACvD,MAAM,SAAS,aAAa,KAAA,IAAY,KAAA,IAAY,eAAe,IAAI,QAAQ;CAC/E,IAAI,aAAa,KAAA,KAAa,WAAW,KAAA,GAAW;CACpD,MAAM,OAAO,SAAS,OAAO,OAAO,MAAM,mBAAmB,OAAO,CAAC,CAAC;CACtE,aAAa,QAAQ,MAAM,MAAM,WAAW;CAC5C,UAAU,OAAO,GAAG,kBAAkB;EAAE,GAAG;EAAU,MAAM;CAAK,GAAG,MAAM,CAAC;AAC5E;AAIA,SAAS,wBAAyC;CAChD,OAAO;EACL,QAAQ;EACR,eAAe;EACf,yBAAS,IAAI,IAAI;EACjB,OAAO;EACP,MAAM;EACN,2BAAW,IAAI,IAAI;EACnB,MAAM;CACR;AACF;AAEA,SAAgB,cAAqB;CACnC,MAAM,QAAe;EACnB,MAAM;EACN,MAAM;EACN,UAAU,CAAC;EACX,YAAY;EACZ,QAAQ,EAAE,0BAAU,IAAI,IAAI,EAAE;EAC9B,QAAQ,sBAAsB;CAChC;CACA,WAAW,KAAK;CAChB,OAAO;AACT;AAEA,SAAgB,SAAS,OAAc,MAAuB;CAC5D,OAAO,SAAS,OAAO,IAAI,MAAM;AACnC;AAWA,SAAgB,YAAY,OAAc,GAAY,aAAiC;CACrF,MAAM,IAAI,SAAS,OAAO,EAAE,IAAI;CAChC,IAAI,MAAM,IACR,KAAK,OAAO,CAAC;MACR;EACL,YAAY,KAAK;GACf,OAAO;GACP,SAAS,+BAA+B,EAAE,KAAK;EACjD,CAAC;EACD,UAAU,OAAO,GAAG,CAAC;CACvB;AACF;AAEA,SAAgB,aAAa,OAAc,GAAY,aAAiC;CACtF,mBAAmB,OAAO,EAAE,MAAM,WAAW;CAC7C,MAAM,IAAI,SAAS,OAAO,EAAE,IAAI;CAChC,IAAI,MAAM,IAAI;EACZ,MAAM,SAAS,QAAQ,CAAC;EAExB,WAAW,KAAK;CAClB,OAAO;EACL,YAAY,KAAK;GACf,OAAO;GACP,SAAS,+BAA+B,EAAE,KAAK;EACjD,CAAC;EACD,UAAU,OAAO,GAAG,CAAC;CACvB;AACF;AAeA,SAAgB,iBAAiB,OAA8B;CAC7D,MAAM,OAAsB,CAAC;CAC7B,IAAI,MAAM,MAAM,KAAK,OAAO,MAAM;CAClC,IAAI,MAAM,OAAO,QAAQ,KAAK,SAAS,MAAM,OAAO;CACpD,IAAI,MAAM,OAAO,eAAe,KAAK,oBAAoB,MAAM,OAAO;CAEtE,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,CAAC,KAAK,QAAQ,MAAM,OAAO,SACpC,IAAI,KAAK,QAAQ,KAAK,GAAG;CAE3B,IAAI,QAAQ,SAAS,GAAG,KAAK,UAAU;CAEvC,IAAI,MAAM,OAAO,OAAO,KAAK,QAAQ,MAAM,OAAO;CAClD,IAAI,MAAM,OAAO,MAAM,KAAK,OAAO,MAAM,OAAO;CAEhD,IAAI,MAAM,OAAO,UAAU,OAAO,GAChC,KAAK,gBAAgB,OAAO,YAAY,MAAM,OAAO,SAAS;CAEhE,IAAI,MAAM,OAAO,SAAS,GAAG,KAAK,OAAO,MAAM,OAAO;CAEtD,OAAO,KAAK,UAAU,MAAM,MAAM,GAAI;AACxC;AAEA,SAAgB,mBAAmB,OAAc,MAA6B;CAC5E,IAAI;CACJ,IAAI;EACF,MAAM,KAAK,MAAM,IAAI;CACvB,SAAS,GAAG;EACV,OAAO,iCAAiC,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;CACnF;CAEA,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC9D,OAAO;CAET,MAAM,OAAO;CAIb,MAAM,SAAS,sBAAsB;CACrC,MAAM,OAAO,OAAO,KAAK,SAAS,WAAW,cAAc,KAAK,IAAI,IAAK;CACzE,IAAI,OAAO,KAAK,WAAW,UAAU,OAAO,SAAS,KAAK;CAC1D,IAAI,OAAO,KAAK,sBAAsB,UAAU,OAAO,gBAAgB,KAAK;CAC5E,IAAI,MAAM,QAAQ,KAAK,OAAO,GACvB;OAAA,MAAM,OAAO,KAAK,SACrB,IAAI,OAAO,QAAQ,UAAU,OAAO,QAAQ,IAAI,KAAK,IAAI;CAAA;CAG7D,IAAI,OAAO,KAAK,UAAU,UAAU,OAAO,QAAQ,KAAK;CACxD,IAAI,OAAO,KAAK,SAAS,UAAU,OAAO,OAAO,KAAK;CACtD,IAAI,OAAO,KAAK,kBAAkB,YAAY,KAAK,kBAAkB,QAAQ,CAAC,MAAM,QAAQ,KAAK,aAAa,GACvG;OAAA,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,aAAa,GAC1D,IAAI,OAAO,UAAU,UAAU,OAAO,UAAU,IAAI,KAAK,KAAK;CAAA;CAGlE,IAAI,OAAO,KAAK,SAAS,YAAY,KAAK,SAAS,GAAG,OAAO,OAAO,KAAK;CACzE,MAAM,SAAS;CAEf,OAAO;AACT;AAIA,SAAgB,uBAAuB,OAAc,MAAc,aAAiC;CAClG,MAAM,WAAqB,CAAC;CAE5B,KAAK,MAAM,WAAW,KAAK,MAAM,IAAI,GAAG;EACtC,MAAM,OAAO,QAAQ,KAAK;EAC1B,IAAI,KAAK,WAAW,GAAG;EAEvB,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,IAAI;GACnB,YAAY,KAAK;IACf,OAAO;IACP,SAAS,8CAA8C,KAAK;GAC9D,CAAC;GACD;EACF;EAEA,MAAM,MAAM,KAAK,MAAM,GAAG,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,YAAY;EACvD,MAAM,MAAM,KACT,MAAM,WAAW,CAAC,CAAC,CACnB,KAAK,CAAC,CACN,YAAY;EAEf,QAAQ,KAAR;GACE,KAAK;IAEH,IADY,aAAa,GACnB,MAAM,MACV,MAAM,aAAa,cAAc,GAAG;IAEtC,SAAS,KAAK,UAAQ;IACtB;GAEF,KAAK;IACH,SAAS,KAAK,UAAQ;IACtB;EACJ;EAEA,MAAM,OAAO,SAAS,IAAI,KAAK,GAAG;CACpC;CAEA,IAAI,SAAS,SAAS,GAAG;EACvB,MAAM,UAAU,SAAS,WAAW,IAAI,UAAU;EAClD,MAAM,UAAU,SAAS,WAAW,IAAI,OAAO;EAC/C,YAAY,KAAK;GACf,OAAO;GACP,SACE,qCAAqC,QAAQ,IAAI,SAAS,KAAK,IAAI,EAAE,kBACpD,QAAQ;EAC7B,CAAC;CACH;AACF;;;;;;;;;;;AAYA,SAAgB,SAAS,OAAc,GAAY,aAAiC;CAClF,MAAM,SAAS,eAAe,IAAI,CAAC;CACnC,IAAI,WAAW,KAAA,GAAW;EACxB,aAAa,OAAO,GAAG,QAAQ,WAAW;EAC1C;CACF;CACA,mBAAmB,OAAO,EAAE,MAAM,WAAW;CAE7C,IAAI,YAAY;CAEhB,QAAQ,EAAE,MAAV;EACE,KAAK;GACH,YAAY,KAAK;IACf,OAAO;IACP,SACE;GACJ,CAAC;GACD;EAEF,KAAK,aAAa;GAChB,MAAM,MAAM,mBAAmB,OAAO,EAAE,IAAI;GAC5C,IAAI,QAAQ,MAAM;IAEhB,IAAI,MAAM,KAAK,SAAS,GAAG;KACzB,MAAM,OAAO,aAAa,MAAM,IAAI;KACpC,IAAI,SAAS,MACX,YAAY,KAAK;MACf,OAAO;MACP,SAAS,yBAAyB,KAAK;KACzC,CAAC;IAEL;IAEA,YAAY;KAAE,GAAG;KAAG,MAAM,iBAAiB,KAAK;IAAE;GACpD,OACE,YAAY,KAAK;IACf,OAAO;IACP,SAAS,0DAA0D,IAAI;GACzE,CAAC;GAEH;EACF;EAEA,KAAK;GACH,uBAAuB,OAAO,EAAE,MAAM,WAAW;GACjD;EAEF,KAAK,cAAc;GACjB,MAAM,UAAU,EAAE,KAAK,KAAK;GAC5B,YAAY;IAAE,GAAG;IAAG,MAAM;GAAQ;GAClC,MAAM,OAAO;GACb;EACF;CACF;CAEA,YAAY,OAAO,WAAW,WAAW;AAC3C;;AAGA,SAAgB,cACd,OACA,kBAAmC,UACyB;CAC5D,IAAI,gBAAgB;CACpB,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,MAAM,UACpB,IAAI,eAAe,CAAC,GAAG;EACrB;EACA,SAAS,WAAW,GAAG,eAAe;CACxC;CAEF,OAAO;EAAE,UAAU,MAAM,SAAS;EAAQ;EAAe;CAAM;AACjE;;;;;;;AC1bA,MAAM,iBAAyC;CAE7C,KAAK;CACL,MAAM;CACN,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,MAAM;CACN,MAAM;CACN,MAAM;CAGN,KAAK;CACL,KAAK;CACL,MAAM;CACN,OAAO;CAGP,KAAK;CACL,MAAM;CACN,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,MAAM;CACN,MAAM;CAGN,KAAK;CAGL,KAAK;CACL,KAAK;CACL,MAAM;AACR;AAEA,SAAgB,iBAAiB,KAAqB;CACpD,OAAO,eAAe,QAAQ;AAChC;AAEA,SAAgB,sBAAsB,UAA0B;CAC9D,OAAO,iBAAiB,kBAAkB,QAAQ,CAAC;AACrD;AAEA,SAAgB,kBAAkB,UAA0B;CAC1D,MAAM,MAAM,QAAQ,QAAQ;CAC5B,IAAI,CAAC,KAAK,OAAO;CACjB,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,YAAY;AAClC;;AAGA,SAAgB,QAAQ,UAA0B;CAChD,OAAO,SAAS,QAAQ,iCAAiC,GAAG;AAC9D;;AA8CA,SAAgB,eAAe,KAAqB;CAClD,QAAQ,KAAR;EACE,KAAK,OACH,OAAO;EACT,KAAK,OACH,OAAO;EACT,SACE,OAAO;CACX;AACF;;;;;;;;;;;;;AC5FA,SAAgB,WAAW,UAAkB,SAAqC;CAChF,IAAI,QAAQ,WAAW,GAAG,OAAO;CAGjC,MAAM,EAAE,gBAAgB;CACxB,IAAI,OAAO,gBAAgB,YACzB,MAAM,IAAI,MAAM,yDAAyD,QAAQ,QAAQ,GAAG;CAE9F,MAAM,MAAM,SAAS,QAAQ,IAAI,GAAG,QAAQ,QAAQ,CAAC,KAAK;CAC1D,OAAO,QAAQ,MAAM,YAAY,YAAY,KAAK,QAAQ,QAAQ,SAAS,EAAE,CAAC,CAAC;AACjF;;AAsBA,MAAa,mBAAiC;CAAE,OAAO,CAAC;CAAG,MAAM,CAAC;AAAE;;AAGpE,SAAgB,eAAe,SAA0D;CACvF,IAAI,YAAY,KAAA,GAAW,OAAO;CAClC,OAAO,OAAO,YAAY,WAAW;EAAE,OAAO,CAAC,OAAO;EAAG,MAAM,CAAC;CAAE,IAAI;AACxE;;;;;;;;AASA,SAAgB,WAAW,MAAsB;CAC/C,MAAM,MAAM,QAAQ,IAAI;CACxB,IAAI;EACF,OAAO,aAAa,OAAO,GAAG;CAChC,QAAQ,CAER;CACA,MAAM,SAAS,QAAQ,GAAG;CAC1B,OAAO,WAAW,MAAM,MAAM,KAAK,WAAW,MAAM,GAAG,SAAS,GAAG,CAAC;AACtE;;AAGA,SAAS,eAAe,OAAe,OAAwB;CAC7D,OAAO,UAAU,SAAS,MAAM,WAAW,MAAM,SAAS,GAAG,IAAI,QAAQ,QAAQ,GAAG;AACtF;AAiBA,SAAgB,YAAY,SAAoC;CAC9D,MAAM,QAAQ,IAAI,IAAI,QAAQ,MAAM,IAAI,UAAU,CAAC;CACnD,MAAM,OAAO,IAAI,IAAI,QAAQ,KAAK,IAAI,UAAU,CAAC;CACjD,MAAM,MAAM,CAAC,GAAG,OAAO,GAAG,IAAI;CAC9B,OAAO;EACL,SAAS,SAAS,MAAM,IAAI,IAAI;EAChC,QAAQ,SAAS,KAAK,IAAI,IAAI;EAC9B,QAAQ,SAAS,KAAK,IAAI,IAAI,KAAK,IAAI,MAAM,WAAW,WAAW,QAAQ,eAAe,QAAQ,IAAI,CAAC;EACvG,SAAS,MAAM,OAAO;GACpB,MAAM,OAAO,WAAW,IAAI;GAC5B,IAAI,MAAM,IAAI,IAAI,GAAG,OAAO;GAC5B,MAAM,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC,QAAQ,QAAQ,eAAe,MAAM,GAAG,CAAC;GAClE,IAAI,OAAO,WAAW,GAAG,OAAO;GAGhC,OADiB,MAAM,IAAI,UAAU,CAAC,CAAC,QAAQ,SAAS,eAAe,MAAM,IAAI,CACnE,CAAC,CAAC,OAAO,SAAS,OAAO,MAAM,QAAQ,QAAQ,QAAQ,eAAe,KAAK,IAAI,CAAC,CAAC;EACjG;CACF;AACF;;;;;;;AAQA,SAAgB,YACd,UACA,MAC6D;CAC7D,MAAM,OAAO,UAAU,QAAQ;CAC/B,IAAI,CAAC,KAAK,eAAe,GAAG,OAAO;EAAE;EAAM;CAAK;CAChD,MAAM,SAAS,SAAS,QAAQ;CAChC,OAAO,OAAO,OAAO,IAAI;EAAE,MAAM;EAAQ,MAAM,WAAW,QAAQ;CAAE,IAAI,KAAA;AAC1E;;;;;;;;;;;;;;;;AA4BA,SAAgB,aACd,WACA,SACA,UAA6B,CAAC,GACb;CACjB,MAAM,YAAsB,CAAC;CAC7B,MAAM,cAA4B,CAAC;CACnC,MAAM,gBAA0B,CAAC;CACjC,MAAM,SAAS,YAAY,eAAe,OAAO,CAAC;CAElD,SAAS,KAAK,UAAkB,GAAkB;EAChD,YAAY,KAAK;GAAE,OAAO;GAAW,SAAS,QAAQ,SAAS,IAAI,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;EAAI,CAAC;CACnH;CAEA,SAAS,QAAQ,UAAwB;EACvC,MAAM,MAAM,QAAQ,QAAQ;EAC5B,MAAM,MAAM,SAAS,QAAQ,IAAI,GAAG,GAAG;EACvC,IAAI,WAAW,OAAO,KAAK,OAAO,GAAG;EACrC,UAAU,KAAK,OAAO,GAAG;CAC3B;CAIA,SAAS,QAAQ,UAAkB,MAAoB;EACrD,IAAI;EACJ,IAAI;GACF,UAAU,YAAY,QAAQ;EAChC,SAAS,GAAG;GACV,KAAK,UAAU,CAAC;GAChB;EACF;EACA,KAAK,MAAM,SAAS,SAAS,UAAU,KAAK,UAAU,KAAK,GAAG,KAAK,MAAM,KAAK,CAAC;CACjF;CAEA,SAAS,UAAU,UAAkB,MAAoB;EACvD,IAAI;EACJ,IAAI;GACF,QAAQ,YAAY,UAAU,IAAI;EACpC,SAAS,GAAG;GACV,KAAK,UAAU,CAAC;GAChB;EACF;EACA,IAAI,UAAU,KAAA,GAAW;EACzB,IAAI,MAAM,KAAK,OAAO,GAChB;OAAA,CAAC,OAAO,OAAO,MAAM,IAAI,GAAG,QAAQ,QAAQ;EAAA,OAC3C,IAAI,MAAM,KAAK,YAAY,KAAK,CAAC,OAAO,MAAM,MAAM,IAAI,GAC7D,QAAQ,UAAU,MAAM,IAAI;CAEhC;CAEA,KAAK,MAAM,YAAY,WAAW;EAChC,IAAI;EACJ,IAAI;GACF,OAAO,SAAS,QAAQ;EAC1B,SAAS,GAAG;GACV,KAAK,UAAU,CAAC;GAChB;EACF;EACA,MAAM,OAAO,WAAW,QAAQ;EAChC,IAAI,KAAK,OAAO,GAAG;GACjB,IAAI,OAAO,OAAO,IAAI,GAAG,cAAc,KAAK,QAAQ;QAC/C,QAAQ,QAAQ;EACvB,OAAO,IAAI,KAAK,YAAY,GAC1B,QAAQ,UAAU,IAAI;CAE1B;CAEA,OAAO;EAAE;EAAW;EAAa;CAAc;AACjD;;;;;;;;;;;;;;;AC5NA,MAAM,aAAa;AACnB,MAAM,SAAS;AACf,MAAM,kBAAkB;AACxB,MAAM,aAAa;AACnB,MAAM,MAAM;;AAGZ,MAAM,iBAAmD;CACvD,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;AACL;;;;;;;AAQA,SAAgB,iBAAiB,MAAc,QAAQ,GAAG,MAAM,KAAK,QAAiB;CACpF,IAAI,MAAM;CAEV,SAAS,KAAK,SAAiB,KAAK,KAAY;EAC9C,MAAM,SAAS,KAAK,MAAM,GAAG,EAAE;EAC/B,MAAM,OAAO,OAAO,MAAM,IAAI,CAAC,CAAC;EAChC,MAAM,SAAS,KAAK,OAAO,YAAY,IAAI;EAC3C,MAAM,IAAI,YAAY,GAAG,QAAQ,WAAW,KAAK,WAAW,QAAQ;CACtE;;CAGA,MAAM,aAAsB,MAAM,MAAO,KAAK,QAAQ,KAAM;CAE5D,MAAM,gBAAgB,OAAwB,MAAM,MAAM,iBAAiB,KAAK,UAAU,KAAK,GAAG;;CAGlG,MAAM,mBAAyB;EAC7B,OAAO,MAAM,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,IAAI,WAAW,KAAK,EAAE,GACpB;QACK,IAAI,KAAK,WAAW,MAAM,GAAG,GAAG;IACrC,MAAM,UAAU,KAAK,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,oBAAoB;IAChE,MAAM,YAAY,KAAK,MAAM,MAAM;GACrC,OAAO,IAAI,KAAK,WAAW,MAAM,GAAG,GAAG;IACrC,MAAM,aAAa,KAAK,QAAQ,MAAM,MAAM,CAAC;IAC7C,IAAI,eAAe,MAAM,aAAa,IAAI,KAAK,KAAK,sBAAsB;IAC1E,MAAM,aAAa;GACrB,OACE;EAEJ;CACF;CAEA,MAAM,WAAW,OAAqB;EACpC,WAAW;EACX,IAAI,KAAK,MAAM,IAAI,KAAK,YAAY,KAAK,UAAU,EAAE,EAAE,aAAa,aAAa,GAAG,GAAG;EACvF;CACF;;CAGA,MAAM,WAAW,UAA0B;EACzC,MAAM,SAAS,KAAK,MAAM,KAAK,KAAK,IAAI,MAAM,OAAO,GAAG,CAAC;EACzD,IAAI,OAAO,WAAW,SAAS,CAAC,IAAI,KAAK,MAAM,GAAG,KAAK,qCAAqC;EAC5F,OAAO;EACP,OAAO,SAAS,QAAQ,EAAE;CAC5B;;CAGA,MAAM,mBAA2B;EAC/B,MAAM,KAAK,KAAK;EAChB,MAAM,SAAS,eAAe;EAC9B,IAAI,WAAW,KAAA,GAAW;GACxB;GACA,OAAO;EACT;EACA,QAAQ,IAAR;GACE,KAAK,IACH,OAAO,KAAK,qBAAqB;GACnC,KAAK;IACH;IACA,OAAO,OAAO,aAAa,QAAQ,CAAC,CAAC;GACvC,KAAK,KAAK;IACR;IACA,IAAI,KAAK,MAAM,KAAK,OAAO,OAAO,aAAa,QAAQ,CAAC,CAAC;IACzD,MAAM,QAAQ,KAAK,QAAQ,KAAK,GAAG;IACnC,IAAI,UAAU,MAAM,SAAS,KAAK,KAAK,iCAAiC;IACxE;IACA,MAAM,YAAY,QAAQ,QAAQ,GAAG;IACrC,IAAI,YAAY,SAAU,KAAK,8BAA8B;IAC7D,MAAM,QAAQ;IACd,OAAO,OAAO,cAAc,SAAS;GACvC;GACA,KAAK;IAEH,OAAO,KAAK,MAAM,OAAO,OAAO,IAAI;IACpC,OAAO;GACT,KAAK;GACL,KAAK;GACL,KAAK;IACH;IACA,OAAO;GACT,KAAK;IACH,IAAI,QAAQ,KAAK,KAAK,MAAM,MAAM,EAAE,GAAG,KAAK,0CAA0C;IACtF;IACA,OAAO;GACT;IACE,IAAI,QAAQ,KAAK,EAAE,GAAG,KAAK,0CAA0C;IAErE;IACA,OAAO;EACX;CACF;CAEA,MAAM,mBAA2B;EAC/B,MAAM,QAAQ,KAAK;EACnB;EACA,IAAI,MAAM;EACV,IAAI,aAAa;EACjB,SAAS;GACP,IAAI,OAAO,KAAK,KAAK,qBAAqB;GAC1C,MAAM,KAAK,KAAK;GAChB,IAAI,OAAO,OAAO;IAChB,OAAO,KAAK,MAAM,YAAY,GAAG;IACjC;IACA,OAAO;GACT;GACA,IAAI,OAAO,QAAQ,OAAO,MAAM,KAAK,qBAAqB;GAC1D,IAAI,OAAO,MAAM;IACf,OAAO,KAAK,MAAM,YAAY,GAAG;IACjC;IACA,OAAO,WAAW;IAClB,aAAa;GACf,OACE;EAEJ;CACF;;CAGA,MAAM,aAAa,YAAwC;EACzD,QAAQ,YAAY;EACpB,MAAM,IAAI,QAAQ,KAAK,IAAI;EAC3B,IAAI,CAAC,KAAK,QAAQ,YAAY,KAAK,OAAO,KAAA;EAC1C,MAAM,QAAQ;EACd,OAAO,EAAE;CACX;CAEA,MAAM,mBAAuC;EAC3C,MAAM,aAAa;EACnB,MAAM,QAAQ,UAAU,MAAM;EAC9B,IAAI,UAAU,KAAA,GAAW,OAAO,KAAA;EAChC,IAAI,gBAAgB,KAAK,KAAK,CAAC,GAAG,KAAK,kBAAkB,UAAU;EAEnE,QADa,MAAM,WAAW,GAAG,IAAI,KAAK,KAC5B,OAAO,QAAQ,KAAK,KAAK,IAAI,MAAM,MAAM,CAAC,IAAI,KAAK;CACnE;CAEA,MAAM,gBAAwB;EAC5B,WAAW;EACX,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,QAAO,OAAO,KAAK,OAAO,WAAW;EAChD,MAAM,aAAa,UAAU,UAAU;EACvC,IAAI,eAAe,KAAA,GAAW,OAAO;EACrC,MAAM,SAAS,WAAW;EAC1B,IAAI,WAAW,KAAA,GAAW,OAAO,OAAO,MAAM;EAC9C,OAAO,KAAK,sCAAsC,aAAa,GAAG,GAAG;CACvE;CAEA,MAAM,mBAA4C;EAChD;EAEA,MAAM,MAA+B,CAAC;EACtC,SAAS;GACP,WAAW;GACX,IAAI,KAAK,MAAM,KAAK;IAClB;IACA,OAAO;GACT;GACA,MAAM,MAAM,QAAQ;GACpB,QAAQ,GAAG;GACX,OAAO,eAAe,KAAK,KAAK;IAAE,OAAO,UAAU;IAAG,YAAY;IAAM,UAAU;IAAM,cAAc;GAAK,CAAC;GAC5G,WAAW;GACX,IAAI,KAAK,MAAM,KAAK;QACf,IAAI,KAAK,MAAM,KAAK,KAAK,iCAAiC,aAAa,GAAG,GAAG;EACpF;CACF;CAEA,MAAM,kBAA6B;EACjC;EACA,MAAM,MAAiB,CAAC;EACxB,SAAS;GACP,WAAW;GACX,IAAI,KAAK,MAAM,KAAK;IAClB;IACA,OAAO;GACT;GACA,IAAI,KAAK,UAAU,CAAC;GACpB,WAAW;GACX,IAAI,KAAK,MAAM,KAAK;QACf,IAAI,KAAK,MAAM,KAAK,KAAK,iCAAiC,aAAa,GAAG,GAAG;EACpF;CACF;CAEA,SAAS,YAAqB;EAC5B,WAAW;EACX,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,KAAK,OAAO,WAAW;EAClC,IAAI,OAAO,KAAK,OAAO,UAAU;EACjC,IAAI,OAAO,QAAO,OAAO,KAAK,OAAO,WAAW;EAChD,MAAM,aAAa;EACnB,MAAM,aAAa,UAAU,UAAU;EACvC,IAAI,eAAe,KAAA,GAAW;GAC5B,IAAI,eAAe,QAAQ,OAAO;GAClC,IAAI,eAAe,SAAS,OAAO;GACnC,IAAI,eAAe,QAAQ,OAAO;GAClC,OAAO,KAAK,yBAAyB,KAAK,UAAU,UAAU,KAAK,UAAU;EAC/E;EACA,MAAM,SAAS,WAAW;EAC1B,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,OAAO,KAAK,cAAc,aAAa,GAAG,GAAG;CAC/C;CAEA,MAAM,QAAQ,UAAU;CACxB,WAAW;CACX,IAAI,MAAM,KAAK,KAAK,cAAc,aAAa,GAAG,EAAE,iBAAiB;CACrE,OAAO;AACT;;;ACtOA,MAAM,cAAc,OAAO,GAAG;AAC9B,MAAMC,YAAU,IAAI,OAAO,OAAO,GAAG,2CAA2C,YAAY,UAAU,YAAY,IAAI;AACtH,MAAM,UAAU;;AAGhB,SAAgB,aAAa,MAA6B;CACxD,MAAM,IAAIA,UAAQ,KAAK,IAAI;CAC3B,IAAI,CAAC,GAAG,OAAO;CACf,OAAO;EACL,OAAO,OAAO,EAAE,EAAE;EAClB,OAAO,OAAO,EAAE,MAAM,CAAC;EACvB,OAAO,OAAO,EAAE,MAAM,CAAC;EACvB,YAAY,EAAE,OAAO,KAAA,IAAY,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,GAAG;CACtD;AACF;;AAGA,SAAS,mBAAmB,GAAW,GAAmB;CACxD,MAAM,WAAW,QAAQ,KAAK,CAAC;CAC/B,MAAM,WAAW,QAAQ,KAAK,CAAC;CAC/B,IAAI,YAAY,UAAU,OAAO,KAAK,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC,CAAC;CAChE,IAAI,aAAa,UAAU,OAAO,WAAW,KAAK;CAClD,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;;AAGA,SAAS,kBAAkB,GAAsB,GAA8B;CAC7E,IAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG,OAAO,KAAK,KAAK,EAAE,SAAS,EAAE,MAAM;CAC1E,MAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;EAC/B,MAAM,QAAQ,mBAAmB,EAAE,MAAM,IAAI,EAAE,MAAM,EAAE;EACvD,IAAI,UAAU,GAAG,OAAO;CAC1B;CACA,OAAO,KAAK,KAAK,EAAE,SAAS,EAAE,MAAM;AACtC;;AAGA,SAAgB,gBAAgB,GAAW,GAAmB;CAC5D,OACE,KAAK,KAAK,EAAE,QAAQ,EAAE,KAAK,KAC3B,KAAK,KAAK,EAAE,QAAQ,EAAE,KAAK,KAC3B,KAAK,KAAK,EAAE,QAAQ,EAAE,KAAK,KAC3B,kBAAkB,EAAE,YAAY,EAAE,UAAU;AAEhD;;AAGA,SAAgB,YAAY,GAAW,GAAoB;CACzD,MAAM,OAAO,aAAa,CAAC;CAC3B,MAAM,QAAQ,aAAa,CAAC;CAC5B,OAAO,SAAS,QAAQ,UAAU,QAAQ,gBAAgB,MAAM,KAAK,MAAM;AAC7E;;;;;;;;;;ACtDA,SAAgB,oBAAoB,MAAsB;CAExD,QADmB,KAAK,WAAW,CAAC,MAAM,QAAS,KAAK,MAAM,CAAC,IAAI,KAAA,CACjD,QAAQ,UAAU,IAAI;AAC1C;;AAGA,MAAM,qBAAqB;;;;;;;AAQ3B,SAAgB,wBAAwB,MAAsB;CAC5D,OAAO,oBAAoB,IAAI,CAAC,CAAC,QAAQ,oBAAoB,EAAE;AACjE;;;;;;;ACTA,MAAM,mBAAmB;;;;;AAMzB,MAAM,cAAc,IAAI,YAAY,SAAS;CAAE,OAAO;CAAM,WAAW;AAAK,CAAC;;;;;;;;;AAU7E,MAAM,kBAAkB;CACtB;CAAQ;CAAM;CAAQ;CAAO;CAAQ;CAAQ;CAAQ;CAAQ;CAAO;CAAQ;CAAO;CAAQ;CAAO;CAAM;CAAO;CAC/G;CAAM;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAAQ;CAAO;CAAQ;CAAO;CAAQ;CAAO;CAAM;CAAO;AAClH;AAEA,SAAS,kBAAkB,OAA2B;CACpD,MAAM,SAAmB,CAAC;CAE1B,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,MAAQ;EACzD,MAAM,QAAQ,MAAM,KAAK,MAAM,SAAS,OAAO,QAAQ,IAAM,IAAI,MAC/D,KAAK,OAAQ,KAAK,MAAQ,gBAAgB,IAAI,QAAS,IAAK,CAC9D;EACA,OAAO,KAAK,OAAO,aAAa,GAAG,KAAK,CAAC;CAC3C;CACA,OAAO,OAAO,KAAK,EAAE;AACvB;;;;;;;;AASA,SAAgB,WAAW,OAAmB,UAA+B;CAC3E,IAAI;EACF,OAAO;GAAE,MAAM,YAAY,OAAO,KAAK;GAAG,aAAa,CAAC;EAAE;CAC5D,QAAQ;EACN,OAAO;GACL,MAAM,kBAAkB,KAAK;GAC7B,aAAa,CACX;IACE,OAAO;IACP,SAAS,QAAQ,SAAS,uCAAuC,iBAAiB;IAClF,MAAM;GACR,CACF;EACF;CACF;AACF;;;;;;;;;;AAWA,SAAgB,SAAS,UAAkB,aAAoC;CAC7E,MAAM,UAAU,WAAW,aAAa,QAAQ,GAAG,QAAQ;CAC3D,aAAa,KAAK,GAAG,QAAQ,WAAW;CACxC,OAAO,oBAAoB,QAAQ,IAAI;AACzC;;AAGA,SAAgB,WAAW,UAA0B;CACnD,OAAO,aAAa,QAAQ,CAAC,CAAC,SAAS,QAAQ;AACjD;;AAGA,SAAgB,mBAAmB,UAA0B;CAC3D,OAAOC,MAAU,QAAQ,CAAC,CAAC;AAC7B;;;;;;;;;;;;ACvEA,MAAM,0BAA0B;;AAGhC,SAAS,mBAAmB,OAAmC;CAC7D,IAAI,YAAY;CAChB,KAAK,MAAM,SAAS,MAAM,SAAS,uBAAuB,GAAG,YAAY,MAAM;CAC/E,OAAO,cAAc,KAAK,KAAA,IAAY,MAAM,MAAM,GAAG,SAAS,IAAI;AACpE;;AAGA,SAAS,WAAW,MAAc,GAAmB;CACnD,IAAI,MAAM;CACV,SAAS;EACP,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,KAAA,KAAa,KAAK,KAAK,EAAE,GAClC;OACK,IAAI,KAAK,WAAW,MAAM,GAAG,GAAG;GACrC,MAAM,UAAU,KAAK,QAAQ,MAAM,GAAG;GACtC,MAAM,YAAY,KAAK,KAAK,SAAS,UAAU;EACjD,OAAO,IAAI,KAAK,WAAW,MAAM,GAAG,GAAG;GACrC,MAAM,QAAQ,KAAK,QAAQ,MAAM,MAAM,CAAC;GACxC,MAAM,UAAU,KAAK,KAAK,SAAS,QAAQ;EAC7C,OACE,OAAO;CAEX;AACF;;AAGA,SAAS,WAAW,MAAc,GAAmB;CACnD,MAAM,QAAQ,KAAK;CACnB,IAAI,MAAM,IAAI;CACd,OAAO,MAAM,KAAK,QAAQ;EACxB,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,MACT,OAAO;OACF,IAAI,OAAO,OAChB,OAAO,MAAM;OACR,IAAI,UAAU,OAAO,OAAO,OAAO,KAAK,MAAM,OAAO,KAAK;GAC/D,MAAM,QAAQ,iBAAiB,MAAM,MAAM,CAAC;GAC5C,IAAI,UAAU,IAAI,OAAO,KAAK;GAC9B,MAAM,QAAQ;EAChB,OACE;CAEJ;CACA,OAAO,KAAK;AACd;AAEA,SAAS,cAAc,MAAc,KAAsB;CACzD,OAAO,KAAK,SAAS,QAAQ,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,OAAO;AAC1E;AAEA,SAAS,aAAa,MAAc,KAAsB;CACxD,MAAM,KAAK,KAAK;CAChB,OAAO,OAAO,QAAO,OAAO,OAAO,OAAO;AAC5C;;AAGA,SAAS,iBAAiB,MAAc,MAAsB;CAC5D,IAAI,QAAQ;CACZ,IAAI,MAAM;CACV,OAAO,MAAM,KAAK,QAChB,IAAI,cAAc,MAAM,GAAG,GACzB,MAAM,WAAW,MAAM,GAAG;MACrB,IAAI,aAAa,MAAM,GAAG,GAC/B,MAAM,WAAW,MAAM,GAAG;MACrB;EACL,IAAI,KAAK,SAAS,KAAK;OAClB,IAAI,KAAK,SAAS,OAAO,EAAE,UAAU,GAAG,OAAO;EACpD;CACF;CAEF,OAAO;AACT;AAEA,MAAM,eAAe;AACrB,MAAM,kBAAkB;;;;;;;AAQxB,SAAS,mBAAmB,MAA4E;CACtG,IAAI,QAAQ;CACZ,IAAI,aAAa;CACjB,IAAI,MAAM;CACV,OAAO,MAAM,KAAK,UAAU,UAAU,IACpC,IAAI,cAAc,MAAM,GAAG,GACzB,MAAM,WAAW,MAAM,GAAG;MACrB,IAAI,aAAa,MAAM,GAAG,GAC/B,MAAM,WAAW,MAAM,GAAG;MACrB,IAAI,KAAK,SAAS,KAAK;EAC5B,IAAI,eAAe,IAAI,aAAa;EACpC;CACF,OAAO,IAAI,KAAK,WAAW,cAAc,GAAG,KAAK,CAAC,gBAAgB,KAAK,KAAK,MAAM,MAAM,EAAE,GAAG;EAC3F,MAAM,QAAQ,WAAW,MAAM,MAAM,EAAmB;EACxD,MAAM,QAAQ,KAAK,WAAW,MAAM,WAAW,MAAM,QAAQ,CAAC,IAAI;EAClE,IAAI,KAAK,WAAW,KAAK,QAAQ;EACjC,OAAO;CACT,OACE;CAGJ,IAAI,UAAU,IAAI,QAAQ;CAC1B,IAAI,UAAU,IAAI,OAAO,KAAA;CACzB,MAAM,QAAQ,iBAAiB,MAAM,KAAK;CAC1C,MAAM,MAAM,UAAU,KAAK,KAAK,YAAY,GAAG,IAAI;CACnD,OAAO,MAAM,QAAQ,KAAA,IAAY;EAAE;EAAO,KAAK,MAAM;CAAE;AACzD;;;;;AAQA,SAAS,kBAAkB,MAAc,OAAe,KAA0B;CAChF,IAAI;EACF,OAAO;GAAE,IAAI;GAAM,OAAO,KAAK,MAAM,KAAK,MAAM,OAAO,GAAG,CAAC;EAAE;CAC/D,QAAQ,CAER;CACA,IAAI;EACF,OAAO;GAAE,IAAI;GAAM,OAAO,iBAAiB,MAAM,OAAO,GAAG;EAAE;CAC/D,SAAS,GAAG;EACV,OAAO;GAAE,IAAI;GAAO,OAAO,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;EAAE;CACxE;AACF;;;AAIA,MAAa,sBAAsB;AAEnC,SAAS,aAAa,KAAkC;CACtD,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC9D,OAAO;EAAE,IAAI;EAAO,QAAQ;CAA4C;CAE1E,MAAM,MAAM;CACZ,IAAI,OAAO,IAAI,YAAY,UAAU,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAwC;CACzG,IAAI,OAAO,IAAI,WAAW,UAAU,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAuC;CACvG,IAAI,CAAC,aAAa,IAAI,OAAO,GAC3B,OAAO;EAAE,IAAI;EAAO,QAAQ,wBAAwB,KAAK,UAAU,IAAI,OAAO,EAAE;CAA2B;CAE7G,MAAM,OAAyB;EAC7B,MAAM,OAAO,IAAI,SAAS,WAAW,IAAI,OAAO;EAChD,SAAS,IAAI;EACb,QAAQ,IAAI;EACZ,UAAU,IAAI,aAAa;CAC7B;CACA,IAAI,OAAO,IAAI,WAAW,UAAU,KAAK,SAAS,IAAI;CACtD,IAAI,OAAO,IAAI,gBAAgB,UAAU,KAAK,cAAc,IAAI;CAChE,IAAI,OAAO,IAAI,UAAU,UAAU,KAAK,QAAQ,IAAI;CACpD,IAAI,OAAO,IAAI,QAAQ,UAAU,KAAK,MAAM,IAAI;CAChD,IAAI,OAAO,IAAI,YAAY,UAAU,KAAK,UAAU,IAAI;CACxD,OAAO;EAAE,IAAI;EAAM;CAAK;AAC1B;;;;;;;;;;AAWA,SAAgB,iBAAiB,QAAoC;CACnE,MAAM,UAAU,mBAAmB,MAAM;CACzC,IAAI,YAAY,KAAA,GACd,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAwD;CAGtF,MAAM,SAAS,kBAAkB,QAAQ,QAAQ,OAAO,QAAQ,GAAG;CACnE,IAAI,OAAO,IAAI,OAAO,aAAa,OAAO,KAAK;CAG/C,MAAM,WAAW,mBAAmB,OAAO,MAAM,QAAQ,OAAO,QAAQ,GAAG,CAAC;CAC5E,MAAM,UAAU,aAAa,KAAA,IAAY,KAAA,IAAY,kBAAkB,UAAU,GAAG,SAAS,MAAM;CACnG,IAAI,SAAS,IAAI,OAAO,aAAa,QAAQ,KAAK;CAClD,OAAO;EAAE,IAAI;EAAO,QAAQ,6CAA6C,OAAO;CAAQ;AAC1F;;;;;;;AAQA,SAAgB,gBAAgB,QAAgB,WAA6C;CAC3F,MAAM,SAAS,iBAAiB,MAAM;CACtC,OAAO,OAAO,KAAK,OAAO,OAAO;AACnC;;AAGA,SAAS,cAAc,KAAuB;CAC5C,IAAI;EACF,OAAO,YAAY,GAAG,CAAC,CAAC,KAAK;CAC/B,QAAQ;EACN,OAAO,CAAC;CACV;AACF;AAEA,SAAS,YAAY,MAAuB;CAC1C,IAAI;EACF,OAAO,SAAS,IAAI,CAAC,CAAC,YAAY;CACpC,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,OAAO,MAAuB;CACrC,IAAI;EACF,OAAO,SAAS,IAAI,CAAC,CAAC,OAAO;CAC/B,QAAQ;EACN,OAAO;CACT;AACF;;;;;AAMA,SAAS,cACP,WACA,IACA,aAC6B;CAC7B,MAAM,YAAY,KAAK,WAAW,EAAE;CACpC,IAAI,CAAC,YAAY,SAAS,GAAG,OAAO,KAAA;CAEpC,KAAK,MAAM,gBAAgB,CAAC,aAAa,aAAa,GAAG;EACvD,MAAM,WAAW,KAAK,WAAW,YAAY;EAC7C,IAAI,CAAC,OAAO,QAAQ,GAAG;EAEvB,IAAI,iBAAiB,eAEnB,OAAO;GAAE;GAAI;GAAU,UAAU;GAAO,MAAM;GAAI,SAAS;GAAI,UAAU;EAAM;EAIjF,MAAM,WAAyB,CAAC;EAChC,IAAI;EACJ,IAAI;GACF,UAAU,iBAAiB,SAAS,UAAU,QAAQ,CAAC;EACzD,SAAS,GAAG;GACV,UAAU;IAAE,IAAI;IAAO,QAAQ,kBAAkB,SAAS,IAAI,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;GAAI;EAC7G;EACA,IAAI,CAAC,QAAQ,IAAI;GACf,aAAa,KAAK,GAAG,QAAQ;GAC7B,aAAa,KAAK;IAChB,OAAO;IACP,SAAS,UAAU,GAAG,qBAAqB,QAAQ,OAAO,IAAI,SAAS;GACzE,CAAC;GACD;EACF;EACA,MAAM,EAAE,SAAS;EACjB,MAAM,SAA0B;GAC9B;GACA;GACA,UAAU;GACV,MAAM,KAAK;GACX,SAAS,KAAK;GACd,UAAU,KAAK,YAAY;EAC7B;EACA,IAAI,KAAK,QAAQ,OAAO,SAAS,KAAK;EACtC,IAAI,KAAK,aAAa,OAAO,cAAc,KAAK;EAChD,IAAI,KAAK,OAAO,OAAO,QAAQ,KAAK;EACpC,IAAI,KAAK,KAAK,OAAO,MAAM,KAAK;EAChC,IAAI,KAAK,SAAS,OAAO,UAAU,KAAK;EACxC,OAAO;CACT;AAEF;;;;;;;;;AAUA,SAAgB,mBACd,YACA,aAC8B;CAC9B,MAAM,0BAAU,IAAI,IAA6B;CACjD,KAAK,MAAM,aAAa,YACtB,KAAK,MAAM,SAAS,cAAc,SAAS,GAAG;EAC5C,MAAM,SAAS,cAAc,WAAW,OAAO,WAAW;EAC1D,IAAI,CAAC,QAAQ;EAEb,QAAQ,OAAO,KAAK;EACpB,QAAQ,IAAI,OAAO,MAAM;CAC3B;CAEF,OAAO;AACT;;AAGA,SAAS,gBAAgB,QAAwC;CAC/D,OAAO,OAAO,YAAY,OAAO,OAAO,aAAa,OAAO,OAAO,IAAI;AACzE;;AAGA,SAAS,YAAY,QAAiC;CACpD,OAAO,QAAQ,QAAQ,OAAO,QAAQ,CAAC;AACzC;;;;;;;;;;AAWA,SAAgB,aAAa,SAA6E;CAExG,MAAM,0BAAU,IAAI,IAAoB;CACxC,KAAK,MAAM,UAAU,QAAQ,OAAO,GAAG;EACrC,MAAM,MAAM,YAAY,MAAM;EAC9B,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG,QAAQ,IAAI,KAAK,QAAQ,IAAI;CACtD;CACA,MAAM,UAAU,WAAoC,QAAQ,IAAI,YAAY,MAAM,CAAC,KAAK;CAExF,MAAM,uBAAO,IAAI,IAA4E;CAC7F,KAAK,MAAM,UAAU,QAAQ,OAAO,GAAG;EACrC,MAAM,UAAU,gBAAgB,MAAM;EACtC,IAAI,CAAC,SAAS;EACd,MAAM,QAAQ,GAAG,OAAO,KAAK,GAAG,QAAQ;EACxC,MAAM,UAAU,KAAK,IAAI,KAAK;EAC9B,MAAM,QAAQ,UAAU,gBAAgB,SAAS,QAAQ,OAAO,IAAI;EACpE,IAAI,QAAQ,KAAM,UAAU,KAAK,WAAW,OAAO,MAAM,IAAI,OAAO,QAAQ,MAAM,GAChF,KAAK,IAAI,OAAO;GAAE;GAAQ;EAAQ,CAAC;CAEvC;CACA,OAAO,IAAI,IACT,CAAC,GAAG,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,YAAY;EACpC,MAAM,UAAU,gBAAgB,MAAM;EACtC,OAAO,YAAY,QAAQ,KAAK,IAAI,GAAG,OAAO,KAAK,GAAG,QAAQ,OAAO,CAAC,EAAE,OAAO,OAAO;CACxF,CAAC,CACH;AACF;;;;;;;;AAkBA,SAAgB,oBAAoB,aAAgC,CAAC,GAAG,gBAAgB,MAAgB;CACtG,MAAM,cAAc;EAAC;EAAgB;EAAiB;EAAiB;EAAgB;CAAS;CAChG,MAAM,4BAAY,IAAI,IAAY;CAGlC,IAAI;EACF,UAAU,IAAI,QAAQ,CAAC;CACzB,QAAQ,CAER;CAGA,UAAU,IAAI,QAAQ,IAAI,CAAC;CAE3B,MAAM,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC,SAAS,SAAS,YAAY,KAAK,QAAQ,KAAK,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,WAAW;CAG3G,MAAM,aAAa,gBAAgB,QAAQ,IAAI,cAAc,KAAA;CAC7D,IAAI,YAAY,KAAK,KAAK,GAAG,WAAW,MAAM,QAAQ,aAAa,UAAU,MAAM,GAAG,CAAC;CAGvF,KAAK,KAAK,GAAG,UAAU;CAEvB,OAAO;AACT;;;;;AAMA,SAAgB,YAAY,GAA4C;CACtE,MAAM,SAAS,aAAa,CAAC;CAC7B,OAAO,SAAS;EAAC,OAAO;EAAO,OAAO;EAAO,OAAO;CAAK,IAAI;AAC/D;;AAaA,SAAgB,aAAa,MAAc,SAAyB;CAClE,MAAM,QAAQ,aAAa,OAAO,CAAC,EAAE,SAAS;CAC9C,OAAO,GAAG,KAAK,YAAY,CAAC,CAAC,QAAQ,QAAQ,GAAG,EAAE,GAAG;AACvD;;AAGA,SAAgB,sBAAsB,SAAgC;CACpE,QAAQ,QAAQ,MAAhB;EACE,KAAK,MACH,OAAO,IAAI,QAAQ,GAAG;EACxB,KAAK,QACH,OAAO,QAAQ,UAAU,IAAI,QAAQ,KAAK,gBAAgB,QAAQ,QAAQ,KAAK,IAAI,QAAQ,KAAK;EAClG,SAEE,MAAM,IAAI,MAAM,6BAA6B,KAAK,UAAUC,OAAW,GAAG;CAE9E;AACF;;AASA,SAAS,oBACP,SACA,YACA,UACA,YACe;CACf,MAAM,SAAS,QAAQ,SAAS,SAAS,aAAa,QAAQ,OAAO,IAAI;CACzE,IAAI;CAEJ,KAAK,MAAM,aAAa,YAAY;EAClC,MAAM,EAAE,MAAM,YAAY,SAAS,SAAS;EAC5C,MAAM,OAAO,aAAa,OAAO;EACjC,IAAI,CAAC,MAAM;EAEX,IAAI,QAAQ,SAAS,MACf;OAAA,aAAa,MAAM,OAAO,MAAM,QAAQ,GAAG,YAAY,GAAG;EAAA,OACzD;GACL,IAAI,KAAK,YAAY,MAAM,QAAQ,KAAK,YAAY,GAAG;GACvD,IAAI,QAAQ;IACV,MAAM,QAAQ,gBAAgB,MAAM,MAAM;IAC1C,IAAI,UAAU,GAAG,OAAO;IACxB,IAAI,KAAK,UAAU,OAAO,OAAO;IACjC,IAAI,CAAC,cAAc,QAAQ,GAAG;GAChC;EACF;EAEA,IAAI,CAAC,QAAQ,gBAAgB,MAAM,KAAK,OAAO,IAAI,GAAG,OAAO;GAAE;GAAW,SAAS;EAAK;CAC1F;CAEA,OAAO,MAAM;AACf;;;;;;;;;;;;;;;;AAiBA,SAAgB,sBACd,SACA,YACA,UACA,UAA+B,CAAC,GACjB;CACf,MAAM,aAAa,QAAQ,cAAc;CACzC,IAAI,QAAQ,SAAS,QAAQ;EAE3B,MAAM,YAAY,oBAAoB,SADpB,WAAW,QAAQ,MAAM,SAAS,CAAC,CAAC,CAAC,SAAS,QAAQ,IACjB,GAAG,UAAU,UAAU;EAC9E,IAAI,cAAc,KAAA,GAAW,OAAO;CACtC;CACA,OAAO,oBAAoB,SAAS,YAAY,UAAU,UAAU;AACtE;;AAGA,SAAgB,oBAAoB,SAAkE;CACpG,OAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,QAAQ,CAAC,CAAC,QAAQ;AACjE;;;;;AAMA,SAAgB,eAAe,SAA+C,IAAyC;CACrH,MAAM,QAAQ,QAAQ,IAAI,EAAE;CAC5B,IAAI,OAAO,OAAO;CAClB,MAAM,SAAS,GAAG,YAAY;CAC9B,OAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,MAAM,EAAE,GAAG,YAAY,MAAM,MAAM;AAClF;;;;;AAyBA,SAAgB,iBAAiB,QAAyB,aAAoC;CAC5F,MAAM,SAAS,SAAS,OAAO,UAAU,WAAW;CACpD,IAAI,CAAC,OAAO,UAAU,OAAO;CAC7B,MAAM,UAAU,iBAAiB,MAAM;CACvC,IAAI,CAAC,QAAQ,IAAI,MAAM,IAAI,MAAM,uBAAuB,OAAO,GAAG,SAAS,QAAQ,QAAQ;CAC3F,OAAO,QAAQ,KAAK;AACtB;;;;;;;;;;;;;;;;;ACtiBA,SAAgB,gBAAgB,MAAc,MAAoB;CAChE,IAAI;CACJ,IAAI;EACF,MAAM,SAAS,mBAAmB,IAAI;EACtC,OAAO,KAAK,QAAQ,MAAM,GAAG,IAAI,SAAS,MAAM,EAAE,GAAG,QAAQ,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE,KAAK;EACxG,cAAc,MAAM,MAAM;GAAE,UAAU;GAAS,MAAM;EAAK,CAAC;EAC3D,gBAAgB,QAAQ,IAAI;EAC5B,WAAW,MAAM,MAAM;CACzB,SAAS,GAAG;EACV,IAAI,SAAS,KAAA,GAAW,OAAO,MAAM,EAAE,OAAO,KAAK,CAAC;EACpD,MAAM,WAAW,MAAM,CAAC;CAC1B;AACF;;AAGA,MAAM,iBAAiB;;;;;;AAOvB,SAAS,mBAAmB,MAAsB;CAChD,IAAI,UAAU;CACd,KAAK,IAAI,QAAQ,GAAG,SAAS,gBAAgB,SAAS;EACpD,MAAM,OAAO,UAAU,SAAS,EAAE,gBAAgB,MAAM,CAAC;EACzD,IAAI,SAAS,KAAA,KAAa,CAAC,KAAK,eAAe,GAAG,OAAO;EACzD,UAAU,QAAQ,QAAQ,OAAO,GAAG,aAAa,OAAO,CAAC;CAC3D;CACA,MAAM,OAAO,uBAAO,IAAI,MAAM,6CAA6C,MAAM,GAAG,EAAE,MAAM,QAAQ,CAAC;AACvG;;;;;AAMA,SAAS,gBAAgB,QAAgB,MAAoB;CAC3D,MAAM,WAAW,SAAS,QAAQ,EAAE,gBAAgB,MAAM,CAAC;CAC3D,IAAI,aAAa,KAAA,GAAW;CAC5B,IAAI;EACF,UAAU,MAAM,SAAS,OAAO,IAAM;CACxC,QAAQ,CAER;AACF;;AAGA,SAAS,WAAW,MAAc,OAAuB;CACvD,MAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;CACrE,MAAM,QAAoC,IAAI,MAAM,gBAAgB,KAAK,IAAI,WAAW,EAAE,MAAM,CAAC;CACjG,IAAI,iBAAiB,SAAS,UAAU,OAAO,MAAM,OAAO,MAAM;CAClE,OAAO;AACT;;;;;;;;;;;;AC3CA,MAAM,sBAAsB,CAC1B,wEACA,wEACF;;AAMA,MAAM,kBAAkB;;AAGxB,SAAgB,cAAsB;CAEpC,MAAM,OADM,QAAQ,IAAI,qBACJ,KAAK,QAAQ,GAAG,QAAQ;CAC5C,OAAO,KAAK,MAAM,WAAW,cAAc;AAC7C;;AAGA,SAAS,iBAAyB;CAChC,OAAO,KAAK,QAAQ,YAAY,CAAC,GAAG,kBAAkB;AACxD;;AAGA,SAAS,YAAY,KAAqB;CACxC,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,KAAK;AACtD;;;;;;AAOA,SAAS,cAAc,SAA0B;CAC/C,OAAO,YAAY,MAAM,YAAY,OAAO,YAAY,QAAQ,CAAC,UAAU,KAAK,OAAO;AACzF;;AAGA,SAASC,WAAS,MAAc,QAAyB;CACvD,MAAM,MAAM,SAAS,MAAM,MAAM;CACjC,OAAO,QAAQ,MAAM,CAAC,WAAW,GAAG,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC,OAAO;AACjE;;AAGA,SAAS,gBAAgB,MAAc,SAAyB;CAC9D,IAAI,CAAC,cAAc,IAAI,GACrB,MAAM,IAAI,MAAM,yDAAyD,KAAK,UAAU,IAAI,GAAG;CAEjG,IAAI,CAAC,cAAc,OAAO,KAAK,CAAC,YAAY,OAAO,GACjD,MAAM,IAAI,MAAM,mCAAmC,KAAK,4BAA4B,KAAK,UAAU,OAAO,GAAG;CAE/G,MAAM,OAAO,QAAQ,YAAY,CAAC;CAClC,MAAM,MAAM,QAAQ,MAAM,MAAM,OAAO;CACvC,IAAI,CAACA,WAAS,MAAM,GAAG,GACrB,MAAM,IAAI,MAAM,gEAAgE,KAAK,IAAI,KAAK;CAEhG,OAAO;AACT;;AAGA,SAAS,aAAa,GAAY,MAAuB;CACvD,OAAO,aAAa,SAAS,UAAU,KAAK,EAAE,SAAS;AACzD;;;;;AAMA,SAAS,qBAAqB,KAAmB;CAC/C,IAAI,UAAU,KAAK,EAAE,gBAAgB,MAAM,CAAC,MAAM,KAAA,GAChD,IAAI;EACF,UAAU,GAAG;EACb;CACF,SAAS,GAAG;EACV,IAAI,CAAC,aAAa,GAAG,QAAQ,GAAG,MAAM;CACxC;CAEF,MAAM,OAAO,UAAU,KAAK,EAAE,gBAAgB,MAAM,CAAC;CACrD,IAAI,SAAS,KAAA,KAAa,KAAK,eAAe,KAAK,CAAC,KAAK,YAAY,GACnE,MAAM,IAAI,MAAM,iEAAiE,IAAI,0BAA0B;AAEnH;;;;;AAMA,SAAS,gBAAgB,MAAc,UAA6B,MAAsB;CACxF,UAAU,MAAM,EAAE,WAAW,KAAK,CAAC;CACnC,MAAM,MAAM,SAAS,QAAQ,QAAQ,YAAY;EAC/C,MAAM,QAAQ,KAAK,QAAQ,OAAO;EAClC,qBAAqB,KAAK;EAC1B,OAAO;CACT,GAAG,IAAI;CAEP,MAAM,aAAa,KAAK,KAAK,WAAW;CACxC,IAAI,UAAU,YAAY,EAAE,gBAAgB,MAAM,CAAC,CAAC,EAAE,eAAe,GACnE,MAAM,IAAI,MAAM,iEAAiE,WAAW,cAAc;CAE5G,gBAAgB,YAAY,IAAI;CAChC,OAAO;AACT;;AAGA,MAAM,6BAAa,IAAI,IAAsB;;AAG7C,SAAgB,kBAAwB;CACtC,WAAW,MAAM;AACnB;;AAUA,MAAM,iCAAiB,IAAI,IAAoC;;;;;;;;AAmB/D,SAAS,aACP,KACA,EAAE,QAAQ,SAAS,YACnB,OACY;CACZ,IAAI,QAAQ,SAAS,OAAO,QAAQ,OAAO,OAAO,MAAM;CACxD,MAAM,UAAW,eAAe,IAAI,GAAG,KAAsC,mBAAmB,KAAK,KAAK;CAC1G,QAAQ;CAER,OAAO,IAAI,SAAY,SAAS,WAAW;EACzC,IAAI,UAAU;EACd,IAAI;EACJ,MAAM,oBAA0B;GAC9B,IAAI,CAAC,SAAS;GACd,UAAU;GACV,QAAQ,oBAAoB,SAAS,OAAO;GAC5C,aAAa,KAAK;GAClB,QAAQ;EACV;EACA,MAAM,UAAU,WAA0B;GACxC,YAAY;GACZ,IAAI,QAAQ,YAAY,GAAG;IACzB,IAAI,eAAe,IAAI,GAAG,MAAM,SAAS,eAAe,OAAO,GAAG;IAClE,QAAQ,WAAW,MAAM,MAAM;GACjC;GACA,OAAO,MAAM;EACf;EACA,MAAM,gBAAsB,OAAO,QAAQ,MAAM;EACjD,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;EACzD,IAAI,UAAU,KAAK,WAAW,iBAAiB,QAAQ,iBAAiB,OAAO,SAAS,CAAC,GAAG,OAAO;EACnG,QAAQ,QAAQ,MACb,UAAU;GACT,YAAY;GACZ,QAAQ,KAAK;EACf,IACC,MAAe;GACd,YAAY;GACZ,OAAO,CAAC;EACV,CACF;CACF,CAAC;AACH;AAEA,SAAS,mBAAsB,KAAa,OAA8D;CACxG,MAAM,aAAa,IAAI,gBAAgB;CACvC,MAAM,UAA4B;EAAE,SAAS,MAAM,WAAW,MAAM;EAAG;EAAY,SAAS;CAAE;CAC9F,eAAe,IAAI,KAAK,OAAO;CAC/B,MAAM,eAAqB;EACzB,IAAI,eAAe,IAAI,GAAG,MAAM,SAAS,eAAe,OAAO,GAAG;CACpE;CACA,QAAQ,QAAQ,KAAK,QAAQ,MAAM;CACnC,OAAO;AACT;;AAGA,SAAS,eAAe,SAAqC;CAC3D,MAAM,UAAU,QAAQ,WAAA;CACxB,IAAI,EAAE,WAAW,IACf,MAAM,IAAI,WAAW,sEAAsE,SAAS;CAEtG,OAAO;AACT;;AAGA,SAAS,YAAY,SAA6B,MAAc,KAA0B;CACxF,MAAM,UAAU,eAAe,OAAO;CACtC,OAAO;EACL,QAAQ,QAAQ;EAChB;EACA,gCAAgB,IAAI,MAAM,aAAa,KAAK,QAAQ,IAAI,oBAAoB,QAAQ,IAAI;CAC1F;AACF;;;;;AAMA,eAAe,WAAW,KAAa,MAAc,QAAuD;CAC1G,MAAM,MAAM,MAAM,MAAM,KAAK,EAAE,OAAO,CAAC;CACvC,IAAI,CAAC,IAAI,IACP,MAAM,IAAI,MAAM,aAAa,KAAK,QAAQ,IAAI,IAAI,IAAI,OAAO,GAAG,IAAI,YAAY;CAElF,OAAO,IAAI,WAAW,MAAM,IAAI,YAAY,CAAC;AAC/C;;AAGA,SAAS,cAAc,KAAa,SAA+D;CACjG,OAAO,aAAa,aAAa,OAAO,YAAY,SAAS,mBAAmB,GAAG,IAAI,WACrF,WAAW,KAAK,mBAAmB,MAAM,CAC3C;AACF;;AAGA,SAAS,eAAe,OAAmB,KAAqB;CAC9D,MAAM,EAAE,SAAS,WAAW,OAAO,GAAG;CACtC,OAAO,KAAK,WAAW,CAAC,MAAM,QAAS,KAAK,MAAM,CAAC,IAAI;AACzD;;AAGA,SAAS,aAAa,KAAoC;CACxD,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAAG,OAAO;CAC1E,MAAM,MAAM;CACZ,OACE,OAAO,IAAI,SAAS,YACpB,OAAO,IAAI,YAAY,YACvB,OAAO,IAAI,cAAc,YACzB,IAAI,cAAc,QAClB,CAAC,MAAM,QAAQ,IAAI,SAAS;AAEhC;;AAGA,SAAS,iBAAiB,MAAyB;CACjD,IAAI,OAAO,SAAS,YAAY,SAAS,MACvC,MAAM,IAAI,MAAM,4BAA4B;CAE9C,MAAM,MAAM;CAGZ,OAAO;EAAE,QAFM,MAAM,QAAQ,IAAI,SAAS,IAAK,IAAI,SAAS,CAAe,OAAO,YAAY,IAAI,CAAC;EAElF,QADF,MAAM,QAAQ,IAAI,SAAS,IAAK,IAAI,SAAS,CAAe,OAAO,YAAY,IAAI,CAAC;CAC3E;AAC1B;;AAGA,eAAsB,WAAW,KAAa,UAA8B,CAAC,GAAsB;CACjG,QAAQ,QAAQ,eAAe;CAC/B,MAAM,SAAS,WAAW,IAAI,GAAG;CACjC,IAAI,QAAQ,OAAO;CAEnB,OAAO,aAAa,UAAU,OAAO,YAAY,SAAS,sBAAsB,GAAG,GAAG,OAAO,WAAW;EACtG,MAAM,OAAO,eAAe,MAAM,WAAW,KAAK,sBAAsB,MAAM,GAAG,GAAG;EACpF,MAAM,OAAO,iBAAiB,KAAK,MAAM,IAAI,CAAC;EAC9C,WAAW,IAAI,KAAK,IAAI;EACxB,OAAO;CACT,CAAC;AACH;;AAgBA,SAAS,oBAAoB,OAAiB,SAAqD;CAKjG,OAAO,sBAAsB,SAAS,CAHpC,IAAI,MAAM,UAAU,CAAC,EAAA,CAAG,KAAK,WAAW;EAAE;EAAO,YAAY;CAAkB,EAAE,GACjF,IAAI,MAAM,UAAU,CAAC,EAAA,CAAG,KAAK,WAAW;EAAE;EAAO,YAAY;CAAkB,EAAE,CAE7C,IAAa,MAAM,EAAE,KAAK;AAClE;;AAGA,eAAsB,aAAa,SAAkC,aAAuC;CAC1G,MAAM,SAAS,MAAM,OAAO,OAAO,OAAO,WAAW,OAAO;CAI5D,OAHY,MAAM,KAAK,IAAI,WAAW,MAAM,CAAC,CAAC,CAC3C,KAAK,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAC3C,KAAK,EACC,MAAM,YAAY,YAAY;AACzC;;AAGA,SAAS,eAAe,UAAkB,OAAsB,YAAyC;CAEvG,OAAO,GADM,SAAS,QAAQ,kBAAkB,EACnC,EAAE,GAAG,WAAW,GAAG,MAAM,KAAK,GAAG,MAAM,QAAQ;AAC9D;;AAGA,SAAS,iBACP,IACA,UACA,MACiB;CACjB,OAAO;EAAE;EAAI;EAAU,UAAU;EAAM,MAAM,KAAK;EAAM,SAAS,KAAK;EAAS,UAAU,KAAK,YAAY;CAAM;AAClH;;;;;;;AAQA,SAAS,oBAAoB,OAAsB,MAAwB,aAA2B;CAEpG,KADoB,KAAK,SAAA,2BAAgC,KAAK,KAAK,YAAY,MAAM,MAAM,KAAK,YAAY,MACzF,YAAY,KAAK,SAAS,MAAM,OAAO,GAAG;CAC7D,MAAM,IAAI,MACR,6BAA6B,YAAY,oBAAoB,MAAM,KAAK,GAAG,MAAM,QAAQ,wBAChE,KAAK,KAAK,GAAG,KAAK,SAC7C;AACF;;;;;;;AAQA,eAAsB,oBACpB,OACA,aACA,UAA8B,CAAC,GACL;CAE1B,gBAAgB,MAAM,MAAM,MAAM,OAAO;CACzC,MAAM,QAAQ,MAAM,cAAc,aAAa,OAAO;CAGtD,MAAM,cAAc,OAAO,KAAK,MAAM,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,EAAE,SAAS,WAAW,CAAC;CAC1F,IAAI,aAAa;EACf,MAAM,WAAW,MAAM,UAAU;EACjC,IAAI,CAAC,UAAU,MAAM,IAAI,MAAM,mCAAmC,YAAY,EAAE;EAChF,IAAI,CAAE,MAAM,aAAa,OAAO,QAAQ,GACtC,MAAM,IAAI,MAAM,oCAAoC,MAAM,KAAK,GAAG,MAAM,SAAS;CAErF;CAGA,MAAM,OAAO,eAAe,OAAO,WAAW;CAC9C,MAAM,KAAK,aAAa,MAAM,MAAM,MAAM,OAAO;CACjD,MAAM,OAAO,gBAAgB,MAAM,EAAE;CACrC,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,oCAAoC,aAAa;CAEnE,oBAAoB,OAAO,MAAM,WAAW;CAG5C,QAAQ,QAAQ,eAAe;CAE/B,OAAO,iBAAiB,IADL,gBAAgB,QAAQ,YAAY,CAAC,GAAG,CAAC,MAAM,MAAM,MAAM,OAAO,GAAG,IACnD,GAAG,IAAI;AAC9C;;;;;;AAOA,eAAsB,kBAAkB,KAAa,UAA8B,CAAC,GAA6B;CAE/G,MAAM,OAAO,eAAe,MADR,cAAc,KAAK,OAAO,GACX,GAAG;CAEtC,MAAM,OAAO,gBAAgB,IAAI;CACjC,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,oCAAoC,KAAK;CAG3D,gBAAgB,KAAK,MAAM,KAAK,OAAO;CAGvC,QAAQ,QAAQ,eAAe;CAC/B,MAAM,aAAa,gBAAgB,eAAe,GAAG,CAAC,YAAY,GAAG,CAAC,GAAG,IAAI;CAC7E,OAAO,iBAAiB,aAAa,KAAK,MAAM,KAAK,OAAO,GAAG,YAAY,IAAI;AACjF;;AAGA,SAAS,sBAAsB,KAA0C;CACvE,MAAM,aAAa,KAAK,eAAe,GAAG,YAAY,GAAG,GAAG,WAAW;CACvE,IAAI;EACF,IAAI,CAAC,WAAW,UAAU,GAAG,OAAO,KAAA;EACpC,MAAM,OAAO,gBAAgB,SAAS,UAAU,CAAC;EACjD,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,OAAO,iBAAiB,aAAa,KAAK,MAAM,KAAK,OAAO,GAAG,YAAY,IAAI;CACjF,QAAQ;EACN;CACF;AACF;;;;;;;;;AAgBA,eAAsB,kBACpB,SACA,MACA,UAAoC,CAAC,GACC;CACtC,IAAI;CACJ,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,SAAS,sBAAsB,GAAG;EACxC,IAAI,QAAQ;GACV,IAAI,QAAQ,SAAS,MAAM,GAAG,OAAO;GACrC;EACF;EACA,IAAI,QAAQ,SAAS;EACrB,IAAI;GACF,MAAM,OAAO,MAAM,kBAAkB,KAAK,OAAO;GACjD,IAAI,QAAQ,SAAS,IAAI,GAAG,OAAO;EACrC,SAAS,GAAG;GACV,IAAI,QAAQ,QAAQ,SAAS,MAAM,QAAQ,OAAO;GAClD,YAAY,QAAQ,CAAC;EACvB;CACF;CACA,IAAI,WAAW,MAAM;AAEvB;;;;;;;;AASA,SAAgB,oBACd,SACA,MACA,UAA+B,CAAC,GACH;CAE7B,OAAO,sBAAsB,SADd,KAAK,SAAS,QAAQ,sBAAsB,GAAG,KAAK,CAAC,CAC9B,IAAS,MAAM,GAAG,OAAO;AACjE;;AAGA,SAAS,QAAQ,SAAwB,MAAgC;CACvE,OAAO,sBAAsB,SAAS,CAAC,IAAI,IAAI,MAAM,CAAC,MAAM,KAAA;AAC9D;AAEA,SAAS,QAAQ,GAAmB;CAClC,OAAO,aAAa,QAAQ,IAAI,IAAI,MAAM,OAAO,CAAC,CAAC;AACrD;;;;;;AA2BA,eAAsB,2BACpB,SACA,SACA,MACA,UAA8B,CAAC,GACO;CACtC,QAAQ,QAAQ,eAAe;CAC/B,IAAI;CAGJ,IAAI;EACF,MAAM,SAAS,MAAM,kBAAkB,SAAS,QAAQ,CAAC,GAAG,OAAO;EACnE,IAAI,QAAQ,OAAO;CACrB,SAAS,GAAG;EACV,IAAI,QAAQ,QAAQ,SAAS,MAAM,QAAQ,OAAO;EAClD,YAAY,QAAQ,CAAC;CACvB;CAGA,MAAM,SAAS,iBAAiB,OAAO;CACvC,IAAI,UAAU,QAAQ,SAAS,UAAU,YAAY,OAAO,SAAS,QAAQ,OAAO,GAAG,OAAO;CAG9F,MAAM,aAAa,CAAC,GAAI,WAAW,CAAC,GAAI,GAAG,mBAAmB;CAC9D,KAAK,MAAM,YAAY,YACrB,IAAI;EAEF,MAAM,SAAS,oBAAoB,MADf,WAAW,UAAU,OAAO,GACN,OAAO;EACjD,IAAI,QAAQ;GAEV,MAAM,MAAM,gBAAgB,OAAO,MAAM,MAAM,OAAO,MAAM,OAAO;GACnE,IAAI,KAAK,OAAO;GAEhB,MAAM,cAAc,eAAe,UAAU,OAAO,OAAO,OAAO,UAAU;GAC5E,OAAO,MAAM,oBAAoB,OAAO,OAAO,aAAa,OAAO;EACrE;CACF,SAAS,GAAG;EACV,IAAI,QAAQ,QAAQ,SAAS,MAAM,QAAQ,OAAO;EAClD,YAAY,QAAQ,CAAC;CACvB;CAIF,IAAI,QAAQ,OAAO;CAGnB,IAAI,WAAW,MAAM;AAEvB;;;;;;AAOA,SAAgB,iBACd,SACA,UAA+B,CAAC,GACH;CAC7B,OAAO,sBAAsB,SAAS,CAAC,GAAG,sBAAsB,CAAC,CAAC,OAAO,CAAC,IAAI,MAAM,GAAG,OAAO;AAChG;;AAGA,SAAS,gBAAgB,MAAc,SAA8C;CACnF,IAAI,CAAC,cAAc,IAAI,KAAK,CAAC,cAAc,OAAO,GAAG,OAAO,KAAA;CAC5D,MAAM,aAAa,KAAK,YAAY,GAAG,MAAM,SAAS,WAAW;CACjE,IAAI;EACF,IAAI,CAAC,WAAW,UAAU,GAAG,OAAO,KAAA;EACpC,MAAM,SAAS,SAAS,UAAU;EAClC,MAAM,KAAK,aAAa,MAAM,OAAO;EACrC,MAAM,OAAO,gBAAgB,QAAQ,EAAE;EACvC,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,OAAO,iBAAiB,IAAI,YAAY,IAAI;CAC9C,QAAQ;EACN;CACF;AACF;;AAGA,SAAgB,wBAAsD;CACpE,MAAM,0BAAU,IAAI,IAA6B;CACjD,MAAM,WAAW,YAAY;CAE7B,IAAI;EACF,IAAI,CAAC,WAAW,QAAQ,GAAG,OAAO;CACpC,QAAQ;EACN,OAAO;CACT;CAEA,IAAI;CACJ,IAAI;EACF,QAAQ,YAAY,QAAQ;CAC9B,QAAQ;EACN,OAAO;CACT;CAEA,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAU,KAAK,UAAU,IAAI;EACnC,IAAI;GACF,IAAI,CAAC,SAAS,OAAO,CAAC,CAAC,YAAY,GAAG;EACxC,QAAQ;GACN;EACF;EAEA,IAAI;EACJ,IAAI;GACF,WAAW,YAAY,OAAO;EAChC,QAAQ;GACN;EACF;EAEA,KAAK,MAAM,WAAW,UAAU;GAC9B,MAAM,OAAO,gBAAgB,MAAM,OAAO;GAC1C,IAAI,MACF,QAAQ,IAAI,GAAG,KAAK,GAAG,GAAG,WAAW,IAAI;EAE7C;CACF;CAEA,OAAO;AACT;;;;AC/lBA,SAAgB,iBACd,UACA,aACA,oBACA,WACe;CACf,IAAI,UAAU,OAAO;EAAE,MAAM;EAAM,IAAI;CAAS;CAChD,IAAI,aAAa,OAAO;EAAE,MAAM;EAAQ,MAAM;EAAa,SAAS;CAAmB;CACvF,OAAO;EAAE,MAAM;EAAM,IAAI;CAAU;AACrC;;;;;AAMA,SAAS,gBACP,KACA,QACA,SAC6B;CAC7B,QAAQ,QAAQ,MAAhB;EACE,KAAK,MACH,OAAO,eAAe,KAAK,QAAQ,EAAE;EACvC,KAAK,QACH,OAAO,sBAAsB,SAAS,oBAAoB,MAAM,IAAI,MAAM,CAAC;EAC7E,SAEE,MAAM,IAAI,MAAM,6BAA6B,KAAK,UAAUC,OAAW,GAAG;CAE9E;AACF;;;;;;;;;;;;;AAcA,eAAsB,mBACpB,SACA,SACA,aACsC;CACtC,MAAM,WAAW,QAAQ,YAAY;CAErC,MAAM,MAAM,mBADO,oBAAoB,QAAQ,aAAa,QAAQ,iBAAiB,IACtD,GAAY,WAAW;CACtD,MAAM,SAAS,aAAa,GAAG;CAC/B,MAAM,SAAS,sBAAsB,OAAO;CAE5C,MAAM,QAAQ,gBAAgB,KAAK,QAAQ,OAAO;CAClD,IAAI,OAAO,OAAO;CAElB,MAAM,eAAmC;EAAE,QAAQ,QAAQ;EAAQ,SAAS,QAAQ;CAAmB;CACvG,MAAM,gBAAgB,OACpB,WACyC;EACzC,IAAI;GACF,OAAO,MAAM,OAAO;EACtB,SAAS,GAAG;GACV,IAAI,QAAQ,QAAQ,SAAS,MAAM,QAAQ,OAAO;GAClD,YAAY,KAAK;IACf,OAAO;IACP,SAAS,kCAAkC,OAAO,IAAI,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;GACjG,CAAC;GACD;EACF;CACF;CAIA,MAAM,SAAS,MAAM,oBACnB,kBAAkB,SAAS,QAAQ,cAAc,CAAC,GAAG;EAAE,GAAG;EAAc,SAAS;CAAS,CAAC,CAC7F;CACA,IAAI,QAAQ,OAAO;CAEnB,MAAM,SAAS,iBAAiB,OAAO;CACvC,IAAI,QAAQ,OAAO;CAEnB,IAAI,CAAC,UAAU;EACb,MAAM,SAAS,MAAM,oBACnB,2BAA2B,SAAS,QAAQ,eAAe,CAAC,GAAG,YAAY,CAC7E;EACA,IAAI,QAAQ,OAAO;CACrB;CAGA,IAAI,QAAQ,SAAS,QAAQ;EAC3B,MAAM,QACJ,sBAAsB,SAAS,oBAAoB,MAAM,IAAI,MAAM,GAAG,EAAE,YAAY,KAAK,CAAC,KAG1F,oBAAoB,SAAS,QAAQ,cAAc,CAAC,GAAG,EAAE,YAAY,KAAK,CAAC,KAC3E,iBAAiB,SAAS,EAAE,YAAY,KAAK,CAAC;EAChD,IAAI,OAAO;GACT,YAAY,KAAK;IACf,OAAO;IACP,SAAS,gBAAgB,OAAO,2BAA2B,MAAM,KAAK,GAAG,MAAM,QAAQ;GACzF,CAAC;GACD,OAAO;EACT;CACF;CAEA,MAAM,SAAS,WAAW,gCAAgC;CAC1D,YAAY,KAAK;EACf,OAAO;EACP,SAAS,gBAAgB,OAAO,mBAAmB,OAAO,WAAW,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK;CACrG,CAAC;AAEH;;;ACqIA,MAAa,WAAW;CACtB,OAAO;CACP,KAAK;CACL,QAAQ;CACR,MAAM;CACN,MAAM;CACN,UAAU;CACV,SAAS;AACX;;;AC/RA,MAAM,MAAM;AACZ,MAAM,eAAe;AACrB,MAAM,uBAAuB;AAI7B,IAAM,eAAN,MAAmB;CACjB;CACA,OAAO;CACP,QAAQ;CACR,MAAM;CACN,QAA6B,CAAC;CAE9B,YAAY,OAAe;EACzB,KAAK,QAAQ;CACf;CAEA,OAAe;EACb,IAAI,KAAK,OAAO,KAAK,MAAM,QAAQ,OAAO;EAC1C,MAAM,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG;EACzC,KAAK;EACL,IAAI,OAAO,IAAM,KAAK;EACtB,OAAO;CACT;CAEA,OAAe;EACb,IAAI,KAAK,OAAO,KAAK,MAAM,QAAQ,OAAO;EAC1C,OAAO,KAAK,MAAM,WAAW,KAAK,GAAG;CACvC;CAEA,SAAe;EACb,IAAI,KAAK,MAAM,KAAK,OAAO;GACzB,KAAK;GACL,IAAI,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM,IAAM,KAAK;EACrD,OACE,MAAM,IAAI,MAAM,gCAAgC;CAEpD;CAQA,KAAK,MAAsB;EACzB,MAAM,MAAM,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG;EACjD,KAAK,MAAM,KAAK;GAAE;GAAM,MAAM,KAAK;GAAM,KAAK,KAAK;GAAO;EAAI,CAAC;EAC/D,IAAI,SAAS,SAAS,SACf;QAAA,IAAI,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,KACrC,IAAI,KAAK,MAAM,WAAW,CAAC,MAAM,IAAM,KAAK;EAAA;EAGhD,KAAK,QAAQ,KAAK;CACpB;CAEA,SAAe;EACb,KAAK,IAAI,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,KACrC,IAAI,KAAK,MAAM,WAAW,CAAC,MAAM,IAAM,KAAK;EAE9C,KAAK,QAAQ,KAAK;CACpB;CAEA,UAAU,OAAqB;EAC7B,IAAI;EACJ,KAAK,KAAK,KAAK,KAAK,GAAG,OAAO,OAAO,MAAM,SAAS,OAAO,aAAa,EAAE,CAAC,GAAG,KAAK,KAAK,KAAK;EAG7F,IAAI,OAAO,KAAK,KAAK,OAAO;CAC9B;CAEA,OAAO,SAAuB;EAC5B,KAAK,MAAM,KAAK;GACd,MAAM,SAAS;GACf,MAAM,KAAK;GACX,KAAK,KAAK;GACV,KAAK;EACP,CAAC;EACD,OAAO;CACT;;CAGA,aAA0B;EACxB,MAAM,SAAS,KAAK;EACpB,KAAK,QAAQ,CAAC;EACd,OAAO;CACT;AACF;AAEA,SAAS,aAAa,KAAmB,OAA8B;CACrE,SAAS;EACP,MAAM,KAAK,IAAI,KAAK;EACpB,QAAQ,IAAR;GACE,KAAK,IAAM;IAET,MAAM,IAAI,IAAI,KAAK;IACnB,IAAI,MAAM,MAAQ,MAAM,KAAK;GAE/B;GAEA,KAAK;GACL,KAAK,KACH,OAAO;GACT,SACE,IAAI,OAAO,OAAO,OAAO;EAE7B;CACF;AACF;AAIA,SAAS,UAAU,KAA4B;CAC7C,IAAI,IAAI,MAAM,WAAW,cAAc,IAAI,GAAG,GAC5C,OAAO;CAET,MAAM,IAAI,IAAI,MAAM,QAAQ,sBAAsB,IAAI,GAAG;CACzD,IAAI,IAAI,IAAI;EACV,IAAI,MAAM,IAAI;EACd,IAAI,OAAO;EACX,OAAO;CACT;CACA,IAAI,KAAK,SAAS,GAAG;CACrB,OAAO;AACT;AAEA,SAAS,WAAW,KAA4B;CAC9C,IAAI,IAAI,MAAM,WAAW,cAAc,IAAI,GAAG,GAC5C,OAAO;CAET,MAAM,IAAI,IAAI,MAAM,QAAQ,sBAAsB,IAAI,GAAG;CACzD,IAAI,IAAI,IAAI;EACV,IAAI,MAAM,IAAI;EACd,IAAI,KAAK,SAAS,OAAO;EACzB,OAAO;CACT;CACA,IAAI,MAAM,IAAI,MAAM;CACpB,IAAI,IAAI,MAAM,IAAI,OAChB,IAAI,KAAK,SAAS,OAAO;CAE3B,IAAI,KAAK,SAAS,GAAG;CACrB,OAAO;AACT;AAEA,SAAS,eAAe,KAA4B;CAClD,IAAI,OAAO;CACX,IAAI,KAAK,SAAS,MAAM;CACxB,OAAO;AACT;AAEA,SAAS,QAAQ,KAA4B;CAC3C,IAAI;CACJ,OAAO,SAAS;EACd,IAAI,IAAI,KAAK;EACb,QAAQ,GAAR;GACE,KAAK,IAAM;IAET,MAAM,OAAO,IAAI,KAAK;IACtB,IAAI,SAAS,MAAQ,SAAS,KAAK;IAEnC,IAAI;GACN;GAEA,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;IACH,IAAI,MAAM,KAAK,IAAI,OAAO;IAC1B,MAAM;EACV;CACF;CAEA,IAAI,KAAK,SAAS,IAAI;CAEtB,QAAQ,GAAR;EACE,KAAK,IACH,OAAO;EACT,KAAK,IACH,OAAO,IAAI,OAAO,qCAAqC;EACzD,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO,IAAI,OAAO,kCAAkC;EACtD,KAAK;GACH,IAAI;GACJ,IAAI,OAAO;GACX,OAAO;CACX;CACA,IAAI,KAAK,SAAS,GAAG;CACrB,OAAO;AACT;AAEA,SAAS,qBAAqB,KAA4B;CAExD,IAAI,UAAU,IAAK;CACnB,IAAI,OAAO;CAEX,MAAM,IAAI,IAAI,KAAK;CACnB,QAAQ,GAAR;EACE,KAAK,IACH,OAAO;EACT,KAAK,IACH,OAAO,IAAI,OAAO,qCAAqC;EACzD,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO,IAAI,OAAO,kCAAkC;EACtD,KAAK;GACH,IAAI;GACJ,IAAI,OAAO;GACX,OAAO;EACT,KAAK;GACH,IAAI,KAAK,SAAS,GAAG;GACrB,OAAO;CACX;CACA,OAAO,IAAI,OAAO,sBAAsB,OAAO,aAAa,CAAC,EAAE,2BAA2B;AAC5F;AAEA,SAAS,QAAQ,KAA4B;CAE3C,IAAI;CAEJ,SAAS;EACP,MAAM,IAAI,IAAI,KAAK;EACnB,QAAQ,GAAR;GACE,KAAK,IAAM;IAET,MAAM,OAAO,IAAI,KAAK;IACtB,IAAI,SAAS,MAAQ,SAAS,KAAK;GAErC;GAEA,KAAK;GACL,KAAK;IACH,IAAI,MAAM,IAAM,IAAI,OAAO;IAC3B,OAAO,IAAI,OAAO,wBAAwB;GAC5C,KAAK;IACH,IAAI,IAAI,MAAM,IAAI,OAAO,IAAI,KAAK,SAAS,IAAI;IAC/C,OAAO;GACT,KAAK,IACH,OAAO,IAAI,OAAO,oCAAoC;GACxD,KAAK,KACH,OAAO,IAAI,OAAO,iCAAiC;GACrD,KAAK,KACH,OAAO,IAAI,OAAO,kCAAkC;EACxD;CACF;AACF;AAEA,SAAS,YAAY,KAA4B;CAE/C,IAAI;CAEJ,IAAI,QAAQ;CACZ,SAEE,QADU,IAAI,KACN,GAAR;EACE,KAAK,IAAM;GAET,MAAM,MAAM,aAAa,KAAK,EAAI;GAClC,IAAI,KAAK,OAAO,IAAI,OAAO,GAAG;GAC9B;EACF;EACA,KAAK,IACH,IAAI,OAAO;EAEb,KAAK,KACH,OAAO,IAAI,OAAO,6BAA6B;EACjD,KAAK;GACH;GACA;EACF,KAAK;GACH;GACA,IAAI,UAAU,GAAG;IACf,IAAI,IAAI,MAAM,IAAI,OAAO,IAAI,KAAK,SAAS,QAAQ;IACnD,OAAO;GACT;CAEJ;AAEJ;;;;;;;AAQA,UAAiB,UAAU,OAAsD;CAC/E,MAAM,MAAM,IAAI,aAAa,KAAK;CAClC,IAAI,QAAiB;CACrB,OAAO,UAAU,MAAM;EACrB,QAAQ,MAAM,GAAG;EACjB,MAAM,QAAQ,IAAI,WAAW;EAC7B,KAAK,MAAM,QAAQ,OACjB,MAAM;CAEV;AACF;;;;;;;AC9SA,MAAM,gBAAgB;AACtB,MAAM,gBAAgB;AACtB,MAAM,gBAAgB;AAEtB,SAAS,eAAe,GAAoB;CAC1C,OAAO,cAAc,KAAK,CAAC;AAC7B;;;;AAKA,SAAgB,UAAU,GAAmB;CAC3C,IAAI,CAAC,eAAe,CAAC,GAAG,OAAO;CAC/B,IAAI,SAAS,EAAE,QAAQ,gBAAgB,GAAG,IAAY,IAAwB,OAA2B;EAGvG,OAAO,GAAG,KAFG,MAAM,GAEC,gBADR,MAAM,GACsB;CAC1C,CAAC;CACD,SAAS,OAAO,QAAQ,eAAe,IAAI;CAC3C,OAAO;AACT;;;;;;;;;;;ACQA,SAAgB,UAAU,QAAgB,UAAwB,CAAC,GAAgB;CACjF,MAAM,EAAE,WAAW,YAAY,OAAO,MAAM,cAAc,UAAU;CACpE,MAAM,cAA4B,CAAC;CAEnC,MAAM,aAAa,wBAAwB,MAAM;CACjD,MAAM,aAAa,cAAc,UAAU,UAAU,IAAI;CAEzD,MAAM,WAAsB,CAAC;CAC7B,IAAI,UAA0B;CAC9B,IAAI,SAAS;CACb,IAAI,WAAqB,SAAS;CAElC,KAAK,MAAM,QAAQ,UAAU,UAAU,GAAG;EACxC,QAAQ,KAAK,MAAb;GACE,KAAK,SAAS;IACZ,YAAY,KAAK;KACf,OAAO;KACP,SAAS,QAAQ,KAAK,KAAK,2BAA2B,KAAK,IAAI;KAC/D,MAAM;KACN,MAAM,KAAK;IACb,CAAC;IAED,OAAO;KAAE;KAAU;IAAY;GAEjC,KAAK,SAAS;IACZ,IAAI,SAAS,KAAK,SAChB,SAAS,KAAK,OAAO;IAEvB,OAAO;KAAE;KAAU;IAAY;GAEjC,KAAK,SAAS;IACZ;IACA,IAAI,SAAS,KAAK,SAChB,SAAS,KAAK,OAAO;IAEvB,UAAU;KAAE,MAAM;KAAI,MAAM,CAAC;KAAG,MAAM;KAAI,QAAQ;MAAE,MAAM;MAAU,MAAM,KAAK;KAAK;IAAE;IACtF;GAEF,KAAK,SAAS,MAAM;IAClB,IAAI,CAAC,SAAS;IACd,MAAM,OAAO,aAAa,KAAK,GAAG,CAAC,CAAC,KAAK;IACzC,IAAI,KAAK,WAAW,GAAG;KACrB,YAAY,KAAK;MACf,OAAO;MACP,SAAS,QAAQ,KAAK,KAAK;MAC3B,MAAM;MACN,MAAM,KAAK;KACb,CAAC;KACD,OAAO;MAAE;MAAU;KAAY;IACjC;IACA,QAAQ,OAAO;IACf;GACF;GAEA,KAAK,SAAS,MAAM;IAClB,IAAI,CAAC,SAAS;IACd,IAAI,aAAa,SAAS,MAAM;KAC9B,YAAY,KAAK;MACf,OAAO;MACP,SAAS,QAAQ,KAAK,KAAK;MAC3B,MAAM;MACN,MAAM,KAAK;KACb,CAAC;KACD,OAAO;MAAE;MAAU;KAAY;IACjC;IAEA,MAAM,QAAQ,KAAK,IAAI,MAAM,GAAG,EAAE;IAClC,QAAQ,OAAO,aAAa,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO;IAC9D;GACF;GAEA,KAAK,SAAS;IACZ,IAAI,CAAC,SAAS;IACd,IAAI,aAAa,SAAS,QAAQ,aAAa,SAAS,MAAM;KAC5D,YAAY,KAAK;MACf,OAAO;MACP,SAAS,QAAQ,KAAK,KAAK;MAC3B,MAAM;MACN,MAAM,KAAK;KACb,CAAC;KACD,OAAO;MAAE;MAAU;KAAY;IACjC;IACA,IAAI;KAGF,MAAM,SAAS,KAAK,MAAM,KAAK,GAAG;KAClC,MAAM,OAAwB,CAAC;KAC/B,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,OAAO,UAAU,UACnB,KAAK,OAAO;KAGhB,QAAQ,WAAW;IACrB,SAAS,GAAG;KACV,YAAY,KAAK;MACf,OAAO;MACP,SAAS,QAAQ,SAAS,SAAS,KAAK,KAAK,8DAA8D,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,EAAE;MACtJ,MAAM;MACN,MAAM,KAAK;KACb,CAAC;IACH;IACA;GAGF,KAAK,SAAS;IACZ,IAAI,CAAC,SAAS;IACd,IAAI,MACF,QAAQ,OAAO,KAAK,IAAI,KAAK;SAG7B,QAAQ,OAAO,KAAK,IAAI,QAAQ,UAAU,EAAE;IAE9C;GAGF,SAAS;IACP,MAAM,cAAqB,KAAK;IAChC,YAAY,KAAK;KACf,OAAO;KACP,SAAS,QAAQ,KAAK,KAAK,+BAA+B,YAAY;KACtE,MAAM;KACN,MAAM,KAAK;IACb,CAAC;IACD,OAAO;KAAE;KAAU;IAAY;GACjC;EACF;EAEA,WAAW,KAAK;CAClB;CAGA,IAAI,SAAS,KAAK,SAChB,SAAS,KAAK,OAAO;CAEvB,OAAO;EAAE;EAAU;CAAY;AACjC;;;;;;;ACnKA,MAAM,KAAK;CACP;CAAM;CAAG;CAAM;CAAK;CAAM;CAAM;CAAM;CAAM;CAAK;CAAM;CAAK;CAAM;CAAK;CACvE;CAAK;CAAG;CAAG;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAK;CAAM;CAAK;CACrE;CAAK;CAAG;CAAK;AACjB;;;;;AAKA,SAAS,mBAAmB,WAAW;CACnC,OAAQ,cAAc,KACjB,aAAa,SAAW,aAAa,SACtC,YAAY;AACpB;;;;;;;;AAQA,SAAgB,iBAAiB,WAAW;CACxC,IAAI,mBAAmB,SAAS,GAC5B,OAAO;CAEX,IAAI,aAAa,OAAO,aAAa,KACjC,OAAO,GAAG,YAAY,QAAQ;CAElC,OAAO;AACX;;;;;;;;AAQA,SAAgB,oBAAoB,WAAW;CAC3C,OAAO,mBAAmB,SAAS,IAAI,QAAU;AACrD;;;ACvCA,MAAM,iBAAiC,uBAAO;CAC1C,MAAM,wBAAQ,IAAI,WAAW,GAAG;CAChC,IAAI,OAAO;CACX,KAAK,IAAI,OAAO,IAAM,QAAQ,KAAM,QAChC,IAAI,SAAS,MAAQ,SAAS,MAAQ,SAAS,IAC3C,MAAM,QAAQ;CAGtB,OAAO;AACX,EAAA,CAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCH,SAAgB,eAAe,OAAO,cAAc,WAAW,gBAAgB,YAAY,UAAU;CACjG,MAAM,OAAO;CACb,MAAM,cAAc,MAAM;CAE1B,MAAM,cAAc,WAAY;CAChC,IAAI,MAAM;;CAEV,MAAM,qBAAqB;EACvB,MAAM,KAAK,eAAe,MAAM,WAAW,KAAK;EAChD,OAAO,KAAK,WACN,KACA,KAAK,OAAO,cAAc,eAAe,MAAM,WAAW,KAAK;CACzE;CACA,MAAM,iBAAiB,YAAY;CACnC,MAAM,YAAY,YAAY;CAM9B,MAAM,SAAS,IAAI,WAAW,SAAS;CACvC,OAAO,KAAK,IAAI,gBAAgB,QAAQ;CACxC,OAAO,KAAK,IAAI,WAAW,gBAAgB,SAAS;CACpD,MAAM,QAAQ,IAAI,WAAW,SAAS;CACtC,MAAM,SAAS,IAAI,WAAW,SAAS;;;;;;;;;;;;CAYvC,SAAS,YAAY,OAAO,KAAK;EAC7B,IAAI,WAAW;EACf,IAAI,OAAO;EACX,MAAM,MAAM,MAAM;EAClB,OAAO,OAAO,KAAK;GACf,MAAM,OAAO,eAAe,MAAM,WAAW,KAAK;GAClD,IAAI,OAAO,IAAI;IACX,YAAY;IACZ,OAAO,UAAU;GACrB,OACK,IAAI,SAAS,IAAI;IAClB,IAAI,YAAY,eAAe,MAAM,WAAW,KAAK,KAAK;IAC1D,OAAO,aACH,OAAO,UAAU,EAAE;GAC3B,OACK;IACD,MAAM,OAAO,eAAe,MAAM,WAAW,KAAK;IAClD,YACI,MAEK,OAAO,KACF,OAAO,OAAO,eAAe,MAAM,WAAW,KAAK,KACnD,eAAe,MAAM,WAAW,KAAK,KAAK,OACxC,eAAe,MAAM,WAAW,KAAK,KAAK,OAC1C,eAAe,MAAM,WAAW,KAAK;IACrD,OAAO,UAAU;GACrB;EACJ;CACJ;CAEA,YAAY,gBAAgB,CAAC;CAC7B,YAAY,gBAAgB,QAAQ;CAQpC,MAAM,aAAa,IAAI,WAAW,aAAa,CAAC;CAChD,IAAI,WAAW;CACf,IAAI,aAAa;;;;;;;CAOjB,SAAS,oBAAoB,OAAO,WAAW;EAC3C,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,SAAS;GACxC,MAAM,OAAO,YAAY;GACzB,MAAM,IAAI,aAAa;GACvB,MAAM,IAAI,aAAa;GACvB,WAAW,aAAa,KAAK;GAC7B,WAAW,aAAa,IAAI,KAAK;GACjC,cAAc;GACd,MAAM,QAAQ;GACd,MAAM,eAAe,OAAO,KAAK,IAAI,OAAO,KAAK,MAC5C,OAAO,KAAK,IAAI,OAAO,KAAK;GACjC,OAAO,QAAQ;GACf,YAAY;EAChB;CACJ;CACA,oBAAoB,aAAa,WAAW,gBAAgB,WAAW,cAAc;CACrF,oBAAoB,WAAW,gBAAgB,cAAc;CAE7D,MAAM,OAAO,IAAI,YAAY,QAAQ;CACrC,IAAI,QAAQ;CACZ,KAAK,IAAI,QAAQ,GAAG,QAAQ,YAAY,SACpC,KAAK,IAAI,OAAO,GAAG,OAAO,GAAG,QAAQ;EACjC,MAAM,SAAS,WAAW,QAAQ,IAAI;EACtC,MAAM,QAAQ,OAAO;EACrB,IAAI,QAAQ,GAAG;GACX,IAAI,OAAO,MAAM;GACjB,MAAM,UAAU,OAAO,OAAO;GAC9B,OAAO,OAAO,SACV,KAAK,WAAW,KAAK;EAC7B,OAEI,KAAK,WAAW;CAExB;CAGJ,MAAM,MAAM,IAAI,YAAY,YAAY;CACxC,IAAI,WAAW;CACf,OAAO,MAAM,aAAa;EACtB,IAAI,OAAO,eAAe,MAAM,WAAW,KAAK;EAChD,IAAI,QAAQ,UACR,OACI,OAAO,OACH,cACA,eAAe,MAAM,WAAW,KAAK;EAEjD,MAAM,QAAQ,OAAO;EACrB,IAAI,QAAQ,GAAG;GACX,IAAI,OAAO,MAAM;GACjB,MAAM,UAAU,OAAO,OAAO;GAC9B,OAAO,OAAO,SACV,IAAI,cAAc,KAAK;EAC/B,OAEI,IAAI,cAAc;CAE1B;CACA,OAAO;AACX;;;;AC9LA,MAAa,iBAAiC,+BAAe,omkBAAomkB,OAAQ,MAAM,IAAI,IAAI,EAAE;;;;ACDzrkB,MAAa,gCAAgC,IAAI,YAAY;CACzD;CAAK;CAAQ;CAAQ;CAAG;CAAG;CAAG;CAAG;CAAK;CAAQ;CAAK;CAAQ;CAAM;CACjE;CAAQ;CAAK;CAAG;CAAG;CAAG;CAAG;CAAK;CAAQ;CAAK;CAAK;AACpD,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACkCD,IAAW;CACV,SAAU,cAAc;CACrB,aAAa,aAAa,kBAAkB,SAAS;CACrD,aAAa,aAAa,YAAY,QAAQ;CAC9C,aAAa,aAAa,mBAAmB,QAAQ;CACrD,aAAa,aAAa,gBAAgB,OAAO;;CAEjD,aAAa,aAAa,gBAAgB,QAAQ;AACtD,EAAA,CAAG,iBAAiB,eAAe,CAAC,EAAE;;;AC3CtC,IAAIC;CACH,SAAU,WAAW;CAClB,UAAU,UAAU,SAAS,MAAM;CACnC,UAAU,UAAU,SAAS,MAAM;CACnC,UAAU,UAAU,UAAU,MAAM;CACpC,UAAU,UAAU,YAAY,MAAM;CACtC,UAAU,UAAU,UAAU,MAAM;CACpC,UAAU,UAAU,UAAU,MAAM;CACpC,UAAU,UAAU,aAAa,MAAM;CACvC,UAAU,UAAU,aAAa,OAAO;AAC5C,EAAA,CAAGA,gBAAc,cAAY,CAAC,EAAE;;AAEhC,MAAM,eAAe;;;;;;AAyCrB,SAAS,SAAS,MAAM;CACpB,OAAQ,OAAOA,YAAU,SAAU,KAAK;AAC5C;AACA,SAAS,uBAAuB,MAAM;CAClC,QAAS,OAAO,gBAAgBA,YAAU,YAAa,KAAK;AAChE;AACA,SAAS,QAAQ,MAAM;CACnB,QAAS,OAAO,gBAAgBA,YAAU,YAAa,KAAK;AAChE;;;;;;;;AAQA,SAAS,8BAA8B,MAAM;CACzC,OAAO,SAASA,YAAU,UAAU,QAAQ,IAAI,KAAK,SAAS,IAAI;AACtE;AACA,IAAI;CACH,SAAU,oBAAoB;CAC3B,mBAAmB,mBAAmB,iBAAiB,KAAK;CAC5D,mBAAmB,mBAAmB,kBAAkB,KAAK;CAC7D,mBAAmB,mBAAmB,oBAAoB,KAAK;CAC/D,mBAAmB,mBAAmB,gBAAgB,KAAK;CAC3D,mBAAmB,mBAAmB,iBAAiB,KAAK;AAChE,EAAA,CAAG,uBAAuB,qBAAqB,CAAC,EAAE;;;;AAIlD,IAAW;CACV,SAAU,cAAc;;CAErB,aAAa,aAAa,YAAY,KAAK;;CAE3C,aAAa,aAAa,YAAY,KAAK;;CAE3C,aAAa,aAAa,eAAe,KAAK;AAClD,EAAA,CAAG,iBAAiB,eAAe,CAAC,EAAE;;;;AAItC,IAAa,gBAAb,MAA2B;CACvB;CACA;CACA;;CAEA,QAAQ,mBAAmB;;CAE3B,WAAW;;;;;;;CAOX,SAAS;;CAET,YAAY;;;;;;CAOZ,SAAS;;CAET,aAAa,aAAa;;CAG1B,cAAc;CACd,YAEA,YAUA,eAEA,QAAQ;EACJ,KAAK,aAAa;EAClB,KAAK,gBAAgB;EACrB,KAAK,SAAS;CAClB;;;;;CAKA,YAAY,YAAY;EACpB,KAAK,aAAa;EAClB,KAAK,QAAQ,mBAAmB;EAChC,KAAK,SAAS;EACd,KAAK,YAAY;EACjB,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,KAAK,cAAc;CACvB;;;;;;;;;;;CAWA,MAAM,OAAO,QAAQ;EACjB,QAAQ,KAAK,OAAb;GACI,KAAK,mBAAmB;IACpB,IAAI,MAAM,WAAW,MAAM,MAAMA,YAAU,KAAK;KAC5C,KAAK,QAAQ,mBAAmB;KAChC,KAAK,YAAY;KACjB,OAAO,KAAK,kBAAkB,OAAO,SAAS,CAAC;IACnD;IACA,KAAK,QAAQ,mBAAmB;IAChC,OAAO,KAAK,iBAAiB,OAAO,MAAM;GAE9C,KAAK,mBAAmB,cACpB,OAAO,KAAK,kBAAkB,OAAO,MAAM;GAE/C,KAAK,mBAAmB,gBACpB,OAAO,KAAK,oBAAoB,OAAO,MAAM;GAEjD,KAAK,mBAAmB,YACpB,OAAO,KAAK,gBAAgB,OAAO,MAAM;GAE7C,SAEI,OAAO,KAAK,iBAAiB,OAAO,MAAM;EAElD;CACJ;;;;;;;;;CAUA,kBAAkB,OAAO,QAAQ;EAC7B,IAAI,UAAU,MAAM,QAChB,OAAO;EAEX,KAAK,MAAM,WAAW,MAAM,IAAI,kBAAkBA,YAAU,SAAS;GACjE,KAAK,QAAQ,mBAAmB;GAChC,KAAK,YAAY;GACjB,OAAO,KAAK,gBAAgB,OAAO,SAAS,CAAC;EACjD;EACA,KAAK,QAAQ,mBAAmB;EAChC,OAAO,KAAK,oBAAoB,OAAO,MAAM;CACjD;;;;;;;;;;;CAWA,gBAAgB,OAAO,QAAQ;EAC3B,MAAM,cAAc,MAAM;EAE1B,IAAI,EAAE,WAAW;EACjB,IAAI,EAAE,aAAa;EACnB,OAAO,SAAS,aAAa;GACzB,MAAM,OAAO,MAAM,WAAW,MAAM;GACpC,IAAI,SAAS,IAAI,KAAK,uBAAuB,IAAI,GAAG;IAEhD,MAAM,QAAQ,QAAQA,YAAU,OAC1B,OAAOA,YAAU,QAChB,OAAO,gBAAgBA,YAAU,UAAU;IAClD,SAAS,SAAS,KAAK;IACvB,YAAY;IACZ,UAAU;GACd,OACK;IACD,KAAK,SAAS;IACd,KAAK,WAAW;IAChB,OAAO,KAAK,kBAAkB,MAAM,CAAC;GACzC;EACJ;EACA,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,OAAO;CACX;;;;;;;;;;;CAWA,oBAAoB,OAAO,QAAQ;EAC/B,MAAM,cAAc,MAAM;EAE1B,IAAI,EAAE,WAAW;EACjB,IAAI,EAAE,aAAa;EACnB,OAAO,SAAS,aAAa;GACzB,MAAM,QAAQ,MAAM,WAAW,MAAM,IAAIA,YAAU;GACnD,IAAI,UAAU,IAAI,GAAG;IACjB,KAAK,SAAS;IACd,KAAK,WAAW;IAChB,OAAO,KAAK,kBAAkB,QAAQA,YAAU,MAAM,CAAC;GAC3D;GACA,SAAS,SAAS,KAAK;GACvB,YAAY;GACZ,UAAU;EACd;EACA,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,OAAO;CACX;;;;;;;;;;;;;CAaA,kBAAkB,QAAQ,gBAAgB;EAEtC,IAAI,KAAK,YAAY,gBAAgB;GACjC,KAAK,QAAQ,2CAA2C,KAAK,QAAQ;GACrE,OAAO;EACX;EAEA,IAAI,WAAWA,YAAU,MACrB,KAAK,YAAY;OAEhB,IAAI,KAAK,eAAe,aAAa,QACtC,OAAO;EAEX,KAAK,eAAe,KAAK,eAAe,gBAClC,sBACA,iBAAA,CAAkB,KAAK,MAAM,GAAG,KAAK,QAAQ;EACnD,IAAI,KAAK,QAAQ;GACb,IAAI,WAAWA,YAAU,MACrB,KAAK,OAAO,wCAAwC;GAExD,KAAK,OAAO,kCAAkC,KAAK,MAAM;EAC7D;EACA,OAAO,KAAK;CAChB;;;;;;;;;;;;;CAaA,2BAA2B,UAAU,QAAQ,MAAM,aAAa;EAC5D,KAAK,WAAW;EAChB,KAAK,SAAS;EACd,OAAO,KAAK,WAAW,KAClB,KAAK,eAAe,aAAa,cAC7B,gBAAgB,KACb,SAAS,KACT,8BAA8B,IAAI,KACxC,IACA,KAAK,6BAA6B;CAC5C;;;;;;;;;CASA,iBAAiB,OAAO,QAAQ;EAC5B,MAAM,EAAE,eAAe;EACvB,MAAM,cAAc,MAAM;EAC1B,MAAM,WAAW,KAAK,eAAe,aAAa;EAelD,IAAI,EAAE,cAAc;EACpB,IAAI,EAAE,WAAW;EACjB,IAAI,EAAE,aAAa;EACnB,IAAI,UAAU,WAAW;EACzB,OAAO,SAAS,aAAa;GAOzB,QAAQ,WACH,aAAa,eAAe,aAAa,aAC1C,MACC,UAAU,aAAa,gBAAgB,GAAG;IAC3C,MAAM,OAAO,MAAM,WAAW,MAAM;IACpC,MAAM,aAAa,UAAU,aAAa;IAC1C,MAAM,eAAe,UAAU,aAAa,kBAAkB;IAC9D,IAAI,gBAAgB,GAAG;KAEnB,IAAI,SAAS,YACT,OAAO,KAAK,2BAA2B,UAAU,QAAQ,MAAM,CAAC;KAEpE,aAAa;IACjB,OACK;KACD,MAAM,OAAO,OAAO;KACpB,IAAI,SAAS,KAAK,aACd,OAAO,KAAK,2BAA2B,UAAU,QAAQ,MAAM,CAAC;KAEpE,MAAM,SAAS,WAAW,YAAY,IAAI;KAC1C,IAAI,WAAW,GACX,OAAO,KAAK,2BAA2B,UAAU,QAAQ,MAAM,CAAC;KAGpE,YAAa,YAAY,cAAc,SAAU;IACrD;IACA,UAAU,WAAW;IACrB,UAAU;IACV,UAAU;IAMV,IAAI,UAAU,aACV;GACR;GACA,IAAI,UAAU,aACV;GAEJ,KAAK,WACA,aAAa,eAAe,aAAa,aAC1C,aAAa,QAAQ;IACrB,MAAM,aAAa,UAAU,aAAa,kBAAkB;IAC5D,IAAI,EAAE,gBAAgB;IAEtB,IAAI,gBAAgB,GAAG;KACnB,MAAM,OAAO,MAAM,WAAW,MAAM;KACpC,IAAI,UAAU,UAAU,aAAa,aACjC,OAAO,KAAK,2BAA2B,UAAU,QAAQ,MAAM,CAAC;KAEpE,UAAU;KACV,UAAU;KACV,cAAc;IAClB;IAEA,OAAO,cAAc,WAAW;KAC5B,IAAI,UAAU,aAAa;MACvB,KAAK,YAAY;MACjB,KAAK,SAAS;MACd,KAAK,WAAW;MAChB,KAAK,cAAc;MACnB,OAAO;KACX;KACA,MAAM,oBAAoB,cAAc;KAExC,MAAM,eADa,WAAW,YAAY,KAAK,qBAAqB,SAC9B,oBAAoB,MAAM,KAAM;KACtE,MAAM,OAAO,MAAM,WAAW,MAAM;KACpC,IAAI,SAAS,cAAc;MACvB,KAAK,cAAc;MACnB,OAAO,KAAK,2BAA2B,UAAU,QAAQ,MAAM,CAAC;KACpE;KACA,UAAU;KACV,UAAU;KACV,eAAe;IACnB;IACA,KAAK,cAAc;IACnB,aAAa,KAAK,aAAa;IAC/B,UAAU,WAAW;IAErB;GACJ;GAEA,MAAM,cAAc,YAAY;GAChC,MAAM,OAAO,MAAM,WAAW,MAAM;GACpC,IAAI,gBAAgB,GAAG;IAEnB,IAAI,CAAC,aAAa,UAAU,aAAa,YAAY,GAAG;KACpD,KAAK,SAAS;KACd,YAAY,SAAS;KACrB,SAAS;IACb;IAMA,IAAI,SAASA,YAAU,MACnB,OAAO,KAAK,oBAAoB,WAAW,aAAa,WAAW,MAAM;IAQ7E,IAAI,gBAAgB,GAChB,OAAO,KAAK,2BAA2B,UAAU,QAAQ,MAAM,WAAW;GAElF;GAEA,MAAM,OAAO,gBAAgB,YAAY,SAAS,aAAa,eAAe,IAAI,IAAI;GACtF,IAAI,OAAO,GACP,OAAO,KAAK,2BAA2B,UAAU,QAAQ,MAAM,WAAW;GAE9E,YAAY;GACZ,UAAU,WAAW;GACrB,UAAU;GACV,UAAU;EACd;EAKA,IAAI,CAAC,YACD,YAAY,OAAO,MAClB,UAAU,aAAa,YAAY,GAAG;GACvC,KAAK,SAAS;GACd,YAAY,SAAS;GACrB,SAAS;EACb;EACA,KAAK,YAAY;EACjB,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,OAAO;CACX;;;;;CAKA,+BAA+B;EAC3B,MAAM,EAAE,QAAQ,eAAe;EAC/B,MAAM,cAAc,WAAW,YAAY;EAC3C,KAAK,oBAAoB,QAAQ,aAAa,KAAK,QAAQ;EAC3D,KAAK,QAAQ,wCAAwC;EACrD,OAAO,KAAK;CAChB;;;;;;;;CAQA,oBAAoB,QAAQ,aAAa,UAAU;EAC/C,MAAM,EAAE,eAAe;EACvB,KAAK,cAAc,gBAAgB,IAC7B,WAAW,UAAU,aAAa,aAClC,WAAW,SAAS,IAAI,QAAQ;EACtC,IAAI,gBAAgB,GAEhB,KAAK,cAAc,WAAW,SAAS,IAAI,QAAQ;EAEvD,OAAO;CACX;;;;;;;CAOA,MAAM;EACF,QAAQ,KAAK,OAAb;GACI,KAAK,mBAAmB,aAEpB,OAAO,KAAK,WAAW,MAClB,KAAK,eAAe,aAAa,aAC9B,KAAK,WAAW,KAAK,aACvB,KAAK,6BAA6B,IAClC;GAGV,KAAK,mBAAmB,gBACpB,OAAO,KAAK,kBAAkB,GAAG,CAAC;GAEtC,KAAK,mBAAmB,YACpB,OAAO,KAAK,kBAAkB,GAAG,CAAC;GAEtC,KAAK,mBAAmB;IACpB,KAAK,QAAQ,2CAA2C,KAAK,QAAQ;IACrE,OAAO;GAEX,SAEI,OAAO;EAEf;CACJ;AACJ;;;;;;;;;;;;;AAaA,SAAgB,gBAAgB,YAAY,SAAS,WAAW,MAAM;CAClE,MAAM,eAAe,UAAU,aAAa,kBAAkB;CAC9D,MAAM,aAAa,UAAU,aAAa;CAE1C,IAAI,YAAY;EACZ,IAAI,gBAAgB,GAEhB,OAAO,SAAS,aAAa,YAAY;EAM7C,MAAM,OAAO,OAAO;EACpB,IAAI,SAAS,KAAK,aACd,OAAO;EACX,MAAM,SAAS,WAAW,YAAY;EAOtC,OAAO,WAAW,IACZ,KACC,YAAY,cAAc,SAAS,IAAK;CACnD;CAMA,IAAI,gBAAgB,GAChB,OAAO;CACX,MAAM,iBAAkB,cAAc,KAAM;CAC5C,MAAM,YAAY,YAAY,iBAAiB;CAC/C,KAAK,IAAI,QAAQ,GAAG,QAAQ,aAAa,SAAS;EAE9C,MAAM,MADS,WAAW,aAAa,SAAS,SACvB,QAAQ,MAAM,KAAM;EAC7C,IAAI,QAAQ,MAGR,OAAQ,YAAY,WAFC,YAAY,iBAAiB,SAEF;EAGpD,IAAI,MAAM,MACN,OAAO;CACf;CACA,OAAO;AACX;;;AC9nBA,IAAI;CACH,SAAU,WAAW;CAClB,UAAU,UAAU,SAAS,KAAK;CAClC,UAAU,UAAU,aAAa,MAAM;CACvC,UAAU,UAAU,cAAc,MAAM;CACxC,UAAU,UAAU,oBAAoB,MAAM;CAC9C,UAAU,UAAU,WAAW,MAAM;CACrC,UAAU,UAAU,qBAAqB,MAAM;CAC/C,UAAU,UAAU,YAAY,MAAM;CACtC,UAAU,UAAU,SAAS,MAAM;CACnC,UAAU,UAAU,iBAAiB,MAAM;CAC3C,UAAU,UAAU,iBAAiB,MAAM;CAC3C,UAAU,UAAU,UAAU,MAAM;CACpC,UAAU,UAAU,WAAW,MAAM;CACrC,UAAU,UAAU,UAAU,MAAM;CACpC,UAAU,UAAU,UAAU,MAAM;CACpC,UAAU,UAAU,UAAU,MAAM;CACpC,UAAU,UAAU,QAAQ,MAAM;CAClC,UAAU,UAAU,QAAQ,MAAM;CAClC,UAAU,UAAU,QAAQ,MAAM;CAClC,UAAU,UAAU,kBAAkB,MAAM;CAC5C,UAAU,UAAU,YAAY,MAAM;CACtC,UAAU,UAAU,YAAY,MAAM;CACtC,UAAU,UAAU,YAAY,MAAM;CACtC,UAAU,UAAU,YAAY,OAAO;CACvC,UAAU,UAAU,YAAY,MAAM;CACtC,UAAU,UAAU,YAAY,OAAO;CACvC,UAAU,UAAU,YAAY,OAAO;CACvC,UAAU,UAAU,0BAA0B,MAAM;AACxD,EAAA,CAAG,cAAc,YAAY,CAAC,EAAE;;AAEhC,IAAI;CACH,SAAU,OAAO;CACd,MAAM,MAAM,UAAU,KAAK;CAC3B,MAAM,MAAM,mBAAmB,KAAK;CACpC,MAAM,MAAM,eAAe,KAAK;CAChC,MAAM,MAAM,sBAAsB,KAAK;CACvC,MAAM,MAAM,0BAA0B,KAAK;CAC3C,MAAM,MAAM,sBAAsB,KAAK;CACvC,MAAM,MAAM,yBAAyB,KAAK;CAE1C,MAAM,MAAM,yBAAyB,KAAK;CAC1C,MAAM,MAAM,qBAAqB,KAAK;CACtC,MAAM,MAAM,wBAAwB,MAAM;CAC1C,MAAM,MAAM,0BAA0B,MAAM;CAC5C,MAAM,MAAM,wBAAwB,MAAM;CAC1C,MAAM,MAAM,wBAAwB,MAAM;CAC1C,MAAM,MAAM,wBAAwB,MAAM;CAE1C,MAAM,MAAM,uBAAuB,MAAM;CACzC,MAAM,MAAM,mBAAmB,MAAM;CAErC,MAAM,MAAM,6BAA6B,MAAM;CAE/C,MAAM,MAAM,mBAAmB,MAAM;CACrC,MAAM,MAAM,mBAAmB,MAAM;CACrC,MAAM,MAAM,yBAAyB,MAAM;CAC3C,MAAM,MAAM,sBAAsB,MAAM;CACxC,MAAM,MAAM,mBAAmB,MAAM;CAErC,MAAM,MAAM,0BAA0B,MAAM;CAC5C,MAAM,MAAM,kBAAkB,MAAM;CACpC,MAAM,MAAM,iBAAiB,MAAM;CACnC,MAAM,MAAM,cAAc,MAAM;AACpC,EAAA,CAAG,UAAU,QAAQ,CAAC,EAAE;AACxB,SAAS,aAAa,GAAG;CACrB,OAAQ,MAAM,UAAU,SACpB,MAAM,UAAU,WAChB,MAAM,UAAU,OAChB,MAAM,UAAU,YAChB,MAAM,UAAU;AACxB;AACA,SAAS,kBAAkB,GAAG;CAC1B,OAAO,MAAM,UAAU,SAAS,MAAM,UAAU,MAAM,aAAa,CAAC;AACxE;AACA,SAAS,aAAa,GAAG;CACrB,OAAS,KAAK,UAAU,UAAU,KAAK,UAAU,UAC5C,KAAK,UAAU,UAAU,KAAK,UAAU;AACjD;;;;AAIA,IAAW;CACV,SAAU,WAAW;CAClB,UAAU,UAAU,aAAa,KAAK;CACtC,UAAU,UAAU,cAAc,KAAK;CACvC,UAAU,UAAU,YAAY,KAAK;CACrC,UAAU,UAAU,YAAY,KAAK;AACzC,EAAA,CAAG,cAAc,YAAY,CAAC,EAAE;;;;;;;AAOhC,MAAM,YAAY;CACd,uBAAO,IAAI,WAAW,CAAC;CACvB,OAAO,IAAI,WAAW;EAAC;EAAM;EAAM;EAAM;EAAM;EAAM;CAAI,CAAC;CAC1D,UAAU,IAAI,WAAW;EAAC;EAAM;EAAM;CAAI,CAAC;CAC3C,YAAY,IAAI,WAAW;EAAC;EAAM;EAAM;EAAM;CAAI,CAAC;CACnD,SAAS,IAAI,WAAW;EAAC;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAAI,CAAC;CAClE,WAAW,IAAI,WAAW;EAAC;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAAI,CAAC;CAC1E,YAAY,IAAI,WAAW;EACvB;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CACpD,CAAC;CACD,aAAa,IAAI,WAAW;EACxB;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAC1D,CAAC;CACD,WAAW,IAAI,WAAW;EACtB;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAChE,CAAC;CACD,WAAW,IAAI,WAAW;EAAC;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAAI,CAAC;CAC1E,UAAU,IAAI,WAAW;EAAC;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAAI,CAAC;CACnE,UAAU,IAAI,WAAW;EAAC;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAAI,CAAC;CACnE,aAAa,IAAI,WAAW;EACxB;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAC1D,CAAC;CACD,QAAQ,IAAI,WAAW;EAAC;EAAM;EAAM;EAAM;EAAM;CAAI,CAAC;AACzD;;;;;;;AAOA,MAAM,wCAAwB,IAAI,IAAI;CAClC,CAAC,UAAU,UAAU,IAAI,UAAU,SAAS;CAC5C,CAAC,UAAU,WAAW,IAAI,UAAU,UAAU;CAC9C,CAAC,UAAU,UAAU,IAAI,UAAU,SAAS;CAC5C,CAAC,UAAU,UAAU,IAAI,UAAU,SAAS;CAC5C,CAAC,UAAU,SAAS,IAAI,UAAU,QAAQ;CAC1C,CAAC,UAAU,OAAO,IAAI,UAAU,MAAM;AAC1C,CAAC;;;;AAID,IAAqB,YAArB,MAA+B;CAC3B;;CAEA,QAAQ,MAAM;;CAEd,SAAS;;CAET,eAAe;;CAEf,QAAQ;;CAER,cAAc;;CAEd,YAAY,MAAM;;CAElB,YAAY;;CAEZ,UAAU;;CAEV,SAAS;CACT;CACA;CACA;CACA;CACA,YAAY,EAAE,UAAU,OAAO,iBAAiB,MAAM,uBAAuB,WAAY,KAAK;EAC1F,KAAK,MAAM;EACX,KAAK,UAAU;EACf,KAAK,iBAAiB;EACtB,KAAK,uBAAuB;EAC5B,KAAK,gBAAgB,IAAI,cAAc,UAAU,gBAAgB,iBAAiB,IAAI,aAAa,KAAK,cAAc,IAAI,QAAQ,CAAC;CACvI;CACA,QAAQ;EACJ,KAAK,QAAQ,MAAM;EACnB,KAAK,SAAS;EACd,KAAK,eAAe;EACpB,KAAK,QAAQ;EACb,KAAK,YAAY,MAAM;EACvB,KAAK,YAAY;EACjB,KAAK,kBAAkB,UAAU;EACjC,KAAK,gBAAgB;EACrB,KAAK,UAAU;EACf,KAAK,SAAS;CAClB;CACA,MAAM,OAAO;EACT,KAAK,UAAU,KAAK,OAAO;EAC3B,KAAK,SAAS;EACd,KAAK,MAAM;CACf;CACA,MAAM;EACF,IAAI,KAAK,SACL,KAAK,OAAO;CACpB;CACA,QAAQ;EACJ,KAAK,UAAU;CACnB;CACA,SAAS;EACL,KAAK,UAAU;EACf,IAAI,KAAK,QAAQ,KAAK,OAAO,SAAS,KAAK,QACvC,KAAK,MAAM;CAEnB;CACA,UAAU,GAAG;EACT,IAAI,MAAM,UAAU,MACf,CAAC,KAAK,kBAAkB,KAAK,cAAc,UAAU,EAAE,GAAI;GAC5D,IAAI,KAAK,QAAQ,KAAK,cAClB,KAAK,IAAI,OAAO,KAAK,cAAc,KAAK,KAAK;GAEjD,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK;EAC7B,OACK,IAAI,KAAK,kBAAkB,MAAM,UAAU,KAC5C,KAAK,YAAY;CAEzB;CACA,kBAAkB,UAAU;CAC5B,gBAAgB;CAChB,eAAe;EACX,IAAI,KAAK,oBAAoB,UAAU,WAAW;GAC9C,KAAK,kBAAkB,UAAU;GACjC,KAAK,QAAQ,MAAM;EACvB,OACK,IAAI,KAAK,WAAW;GACrB,KAAK,QAAQ,MAAM;GACnB,KAAK,gBAAgB;EACzB,OAEI,KAAK,QAAQ,MAAM;CAE3B;;;;;;;;;;;CAWA,0BAA0B,GAAG;EACzB,MAAM,QAAQ,IAAI;EAElB,IAAI,KAAK,gBAAgB,KAAK,gBAAgB,QAAQ;GAClD,IAAI,UAAU,KAAK,gBAAgB,KAAK,gBAAgB;IACpD,KAAK;IACL;GACJ;GACA,IAAI,KAAK,kBAAkB,GAAG;IAC1B,IAAI,KAAK,oBAAoB,UAAU,aACnC,UAAU,UAAU,SAAS,IAAI;KACjC,KAAK,kBAAkB,UAAU;KACjC,KAAK,gBAAgB;KACrB;IACJ;IACA,IAAI,KAAK,oBAAoB,UAAU,YACnC,UAAU,UAAU,YAAY,IAAI;KACpC,KAAK,kBAAkB,UAAU;KACjC,KAAK,gBAAgB;KACrB;IACJ;GACJ,OACK,IAAI,KAAK,kBAAkB,KAC5B,KAAK,oBAAoB,UAAU,cACnC,UAAU,UAAU,YAAY,IAAI;IACpC,KAAK,kBAAkB,UAAU;IACjC,KAAK,gBAAgB;IACrB;GACJ;EACJ,OACK,IAAI,kBAAkB,CAAC,GAAG;GAE3B,KAAK,gBAAgB;GACrB,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,CAAC;GACrB;EACJ;EAEA,KAAK,YAAY;EACjB,KAAK,kBAAkB,UAAU;EACjC,KAAK,gBAAgB;EACrB,KAAK,QAAQ,MAAM;EACnB,KAAK,eAAe,CAAC;CACzB;CACA,mBAAmB,GAAG;EAClB,IAAI,MAAM,UAAU,MAAM,KAAK,gBACvB;OAAA,EAAE,KAAK,kBAAkB,UAAU,MAAM,QAAQ;IACjD,KAAK,QAAQ,MAAM;IACnB,KAAK,kBAAkB,UAAU;IACjC,KAAK,gBAAgB;IACrB,KAAK,eAAe,KAAK,QAAQ;GACrC;SAEC;GACD,KAAK,gBAAgB;GACrB,IAAI,KAAK,SAAS;IACd,KAAK,QAAQ,MAAM;IACnB,KAAK,mBAAmB,CAAC;GAC7B,OACK;IACD,KAAK,QAAQ,MAAM;IACnB,KAAK,sBAAsB,CAAC;GAChC;EACJ;CACJ;;;;;;;CAOA,cAAc,GAAG;EACb,OAAO,EAAE,KAAK,QAAQ,KAAK,OAAO,SAAS,KAAK,QAC5C,IAAI,KAAK,OAAO,WAAW,KAAK,QAAQ,KAAK,MAAM,MAAM,GACrD,OAAO;EASf,KAAK,QAAQ,KAAK,OAAO,SAAS,KAAK,SAAS;EAChD,OAAO;CACX;;;;;CAKA,YAAY,QAAQ;EAChB,KAAK,IAAI,UAAU,KAAK,cAAc,KAAK,OAAO,MAAM;EACxD,KAAK,gBAAgB;EACrB,KAAK,eAAe,KAAK,QAAQ;EACjC,KAAK,QAAQ,MAAM;CACvB;;;;;;;;;;CAUA,mBAAmB,GAAG;EAClB,IAAI,CAAC,KAAK,WACN,KAAK,oBAAoB,UAAU,cACnC,KAAK,iBAAiB,KAMtB,KAAK,UAAU,KAAK,eAAe,KAAK,iBACxC,MAAM,UAAU,IAEhB,KAAK,YAAY,KAAK,aAAa;OAElC,IAAI,KAAK,oBAAoB,UAAU,cACxC,KAAK,kBAAkB,KACvB,MAAM,UAAU,IAEhB,KAAK,YAAY,CAAC;OAEjB,IAAI,KAAK,oBAAoB,UAAU,cACxC,KAAK,kBAAkB,KAAK,gBAAgB,SAAS,KACrD,MAAM,UAAU,IAChB,KAAK,gBAAgB,OAAO,MAAM,UAAU,IAAI;OAE/C,IAAI,MAAM,KAAK,gBAAgB,KAAK,gBACjC;OAAA,EAAE,KAAK,kBAAkB,KAAK,gBAAgB,QAAQ;IACtD,IAAI,KAAK,oBAAoB,UAAU,UACnC,KAAK,IAAI,QAAQ,KAAK,cAAc,KAAK,OAAO,CAAC;SAGjD,KAAK,IAAI,UAAU,KAAK,cAAc,KAAK,OAAO,CAAC;IAEvD,KAAK,gBAAgB;IACrB,KAAK,eAAe,KAAK,QAAQ;IACjC,KAAK,QAAQ,MAAM;GACvB;SAEC,IAAI,KAAK,kBAAkB,GAExB;OAAA,KAAK,cAAc,KAAK,gBAAgB,EAAE,GAC1C,KAAK,gBAAgB;EAAA,OAGxB,IAAI,MAAM,KAAK,gBAAgB,KAAK,gBAAgB,IAErD,KAAK,gBAAgB;CAE7B;;;;;;;;CAQA,eAAe,GAAG;EACd,OAAO,KAAK,UAAU,CAAC,kBAAkB,CAAC,IAAI,aAAa,CAAC;CAChE;;;;;;;;CAQA,kBAAkB,GAAG;EACjB,IAAI,KAAK,kBAAkB,KAAK,gBAAgB,QAAQ;GACpD,IAAI,kBAAkB,CAAC,GAAG;IACtB,MAAM,YAAY,KAAK,QAAQ,KAAK,gBAAgB;IACpD,IAAI,KAAK,eAAe,WAAW;KAE/B,MAAM,cAAc,KAAK;KACzB,KAAK,QAAQ;KACb,KAAK,IAAI,OAAO,KAAK,cAAc,SAAS;KAC5C,KAAK,QAAQ;IACjB;IACA,KAAK,YAAY;IACjB,KAAK,eAAe,YAAY;IAChC,KAAK,sBAAsB,CAAC;IAC5B;GACJ;GACA,KAAK,gBAAgB;EACzB;EACA,KAAK,IAAI,QAAU,KAAK,gBAAgB,KAAK,gBACzC,KAAK,iBAAiB;OAErB,IAAI,KAAK,kBAAkB,GAAG;GAC/B,IAAI,KAAK,oBAAoB,UAAU,YACnC,KAAK,oBAAoB,UAAU,aAE/B;QAAA,KAAK,kBAAkB,MAAM,UAAU,KACvC,KAAK,YAAY;GAAA,OAGpB,IAAI,KAAK,cAAc,UAAU,EAAE,GAEpC,KAAK,gBAAgB;EAE7B,OAGI,KAAK,gBAAgB,OAAO,MAAM,UAAU,EAAE;CAEtD;CACA,mBAAmB,GAAG;EAClB,IAAI,MAAM,UAAU,iBAAiB;GACjC,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC,OACK,IAAI,MAAM,UAAU,cAAc;GACnC,IAAI,KAAK,SAAS;IACd,KAAK,QAAQ,MAAM;IACnB,KAAK,gBAAgB;IACrB,KAAK,eAAe,KAAK,QAAQ;GACrC,OACK;IACD,KAAK,QAAQ,MAAM;IACnB,KAAK,eAAe,KAAK;GAC7B;EACJ,OACK,IAAI,KAAK,eAAe,CAAC,GAAG;GAC7B,KAAK,eAAe,KAAK;GACzB,MAAM,UAAU,KAAK,WAAW,KAAK,IAAI,qBAAqB,IACxD,KAAA,IACA,sBAAsB,IAAI,IAAI,EAAI;GACxC,IAAI,YAAY,KAAA,GACZ,KAAK,QAAQ,MAAM;QAElB;IACD,KAAK,YAAY;IACjB,KAAK,kBAAkB;IACvB,KAAK,gBAAgB;IACrB,KAAK,QAAQ,MAAM;GACvB;EACJ,OACK,IAAI,MAAM,UAAU,OACrB,KAAK,QAAQ,MAAM;OAElB;GACD,KAAK,QAAQ,MAAM;GACnB,KAAK,UAAU,CAAC;EACpB;CACJ;CACA,eAAe,GAAG;EACd,IAAI,kBAAkB,CAAC,GAAG;GACtB,KAAK,IAAI,cAAc,KAAK,cAAc,KAAK,KAAK;GACpD,KAAK,eAAe;GACpB,KAAK,QAAQ,MAAM;GACnB,KAAK,yBAAyB,CAAC;EACnC;CACJ;CACA,0BAA0B,GAAG;EACzB,IAAI,aAAa,CAAC,GAAG;GACjB,IAAI,KAAK,SAAS,CAElB,OACK;IACD,KAAK,QAAQ,MAAM;IACnB,KAAK,eAAe,KAAK;GAC7B;EACJ,OACK,IAAI,MAAM,UAAU,IAAI;GACzB,KAAK,QAAQ,MAAM;GACnB,IAAI,CAAC,KAAK,SACN,KAAK,eAAe,KAAK,QAAQ;EAEzC,OACK;GACD,KAAK,QAAQ,KAAK,eAAe,CAAC,IAC5B,MAAM,mBACN,MAAM;GACZ,KAAK,eAAe,KAAK;EAC7B;CACJ;CACA,sBAAsB,GAAG;EACrB,IAAI,kBAAkB,CAAC,GAAG;GACtB,KAAK,IAAI,WAAW,KAAK,cAAc,KAAK,KAAK;GACjD,KAAK,eAAe;GACpB,KAAK,QAAQ,MAAM;GACnB,KAAK,yBAAyB,CAAC;EACnC;CACJ;CACA,yBAAyB,GAAG;EAExB,IAAI,MAAM,UAAU,MAAM,KAAK,cAAc,UAAU,EAAE,GAAG;GACxD,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC;CACJ;CACA,yBAAyB,GAAG;EACxB,IAAI,MAAM,UAAU,IAAI;GACpB,KAAK,IAAI,aAAa,KAAK,KAAK;GAChC,KAAK,aAAa;GAClB,KAAK,eAAe,KAAK,QAAQ;EACrC,OACK,IAAI,MAAM,UAAU,OACrB,KAAK,QAAQ,MAAM;OAElB,IAAI,CAAC,aAAa,CAAC,GAAG;GACvB,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK;EAC7B;CACJ;;;;;;;;;;CAUA,sBAAsB,GAAG;EACrB,IAAI,MAAM,UAAU,IAAI;GACpB,KAAK,IAAI,iBAAiB,KAAK,KAAK;GACpC,KAAK,eAAe,KAAK,QAAQ;GACjC,IAAI,CAAC,KAAK,sBAAsB;IAC5B,KAAK,aAAa;IAClB;GACJ;GACA,KAAK,QAAQ,MAAM;GACnB,KAAK,YAAY;GACjB,KAAK,kBAAkB,UAAU;EACrC,OACK,IAAI,CAAC,aAAa,CAAC,GAAG;GACvB,KAAK,QAAQ,MAAM;GACnB,KAAK,yBAAyB,CAAC;EACnC;CACJ;CACA,qBAAqB,GAAG;EACpB,IAAI,MAAM,UAAU,MAAM,kBAAkB,CAAC,GAAG;GAC5C,KAAK,IAAI,aAAa,KAAK,cAAc,KAAK,KAAK;GACnD,KAAK,eAAe,KAAK;GACzB,KAAK,QAAQ,MAAM;GACnB,KAAK,wBAAwB,CAAC;EAClC;CACJ;CACA,wBAAwB,GAAG;EACvB,IAAI,MAAM,UAAU,IAChB,KAAK,QAAQ,MAAM;OAElB,IAAI,MAAM,UAAU,SAAS,MAAM,UAAU,IAAI;GAClD,KAAK,IAAI,YAAY,UAAU,SAAS,KAAK,YAAY;GACzD,KAAK,eAAe;GACpB,KAAK,QAAQ,MAAM;GACnB,KAAK,yBAAyB,CAAC;EACnC,OACK,IAAI,CAAC,aAAa,CAAC,GAAG;GACvB,KAAK,IAAI,YAAY,UAAU,SAAS,KAAK,YAAY;GACzD,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK;EAC7B;CACJ;CACA,0BAA0B,GAAG;EACzB,IAAI,MAAM,UAAU,aAAa;GAC7B,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC,OACK,IAAI,MAAM,UAAU,aAAa;GAClC,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC,OACK,IAAI,CAAC,aAAa,CAAC,GAAG;GACvB,KAAK,eAAe,KAAK;GACzB,KAAK,QAAQ,MAAM;GACnB,KAAK,8BAA8B,CAAC;EACxC;CACJ;CACA,uBAAuB,GAAG,OAAO;EAC7B,IAAI,MAAM,SACL,CAAC,KAAK,kBAAkB,KAAK,cAAc,KAAK,GAAI;GACrD,KAAK,IAAI,aAAa,KAAK,cAAc,KAAK,KAAK;GACnD,KAAK,eAAe;GACpB,KAAK,IAAI,YAAY,UAAU,UAAU,cACnC,UAAU,SACV,UAAU,QAAQ,KAAK,QAAQ,CAAC;GACtC,KAAK,QAAQ,MAAM;EACvB,OACK,IAAI,KAAK,kBAAkB,MAAM,UAAU,KAC5C,KAAK,YAAY;CAEzB;CACA,kCAAkC,GAAG;EACjC,KAAK,uBAAuB,GAAG,UAAU,WAAW;CACxD;CACA,kCAAkC,GAAG;EACjC,KAAK,uBAAuB,GAAG,UAAU,WAAW;CACxD;CACA,8BAA8B,GAAG;EAC7B,IAAI,aAAa,CAAC,KAAK,MAAM,UAAU,IAAI;GACvC,KAAK,IAAI,aAAa,KAAK,cAAc,KAAK,KAAK;GACnD,KAAK,eAAe;GACpB,KAAK,IAAI,YAAY,UAAU,UAAU,KAAK,KAAK;GACnD,KAAK,QAAQ,MAAM;GACnB,KAAK,yBAAyB,CAAC;EACnC,OACK,IAAI,KAAK,kBAAkB,MAAM,UAAU,KAC5C,KAAK,YAAY;CAEzB;;;;;;;;;CASA,uBAAuB,GAAG;EACtB,IAAI,MAAM,UAAU,sBAAsB;GACtC,KAAK,QAAQ,MAAM;GACnB,KAAK,gBAAgB;EACzB,OACK,IAAI,KAAK,SACV,KAAK,QACD,MAAM,UAAU,OACV,MAAM,gBACN,MAAM;OAEf,KAAK,IAAI,QAAU,UAAU,QAAQ,IAAI;GAC1C,KAAK,QAAQ,MAAM;GACnB,KAAK,kBAAkB,UAAU;GACjC,KAAK,gBAAgB;EACzB,OACK,IAAI,MAAM,UAAU,IAAI;GACzB,KAAK,IAAI,UAAU,KAAK,cAAc,KAAK,OAAO,CAAC;GACnD,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC,OACK,IAAI,MAAM,UAAU,MACrB,KAAK,QAAQ,MAAM;OAGnB,KAAK,QAAQ,MAAM;CAE3B;;;;;;;;;CASA,yBAAyB,GAAG;EACxB,IAAI,KAAK,kBAAkB,KAAK,gBAAgB,QAAQ;GACpD,KAAK,QAAQ,MAAM;GACnB,KAAK,mBAAmB,CAAC;EAC7B,OACK,KAAK,IAAI,QAAU,KAAK,gBAAgB,KAAK,gBAC9C,KAAK,iBAAiB;OAErB,IAAI,MAAM,UAAU,IAAI;GACzB,KAAK,IAAI,UAAU,KAAK,cAAc,KAAK,OAAO,CAAC;GACnD,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC,OAEI,KAAK,QAAQ,MAAM;CAE3B;CACA,mBAAmB,GAAG;EAClB,IAAI,MAAM,UAAU,MAAM,KAAK,cAAc,UAAU,EAAE,GAAG;GACxD,KAAK,IAAI,cAAc,KAAK,cAAc,KAAK,KAAK;GACpD,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC;CACJ;;;;;;;;CAQA,6BAA6B,GAAG;EAC5B,IAAI,MAAM,UAAU,cAEhB,KAAK,gBAAgB;OAEpB,IAAI,MAAM,UAAU,MAAM,KAAK,kBAAkB,GAAG;GACrD,KAAK,IAAI,wBAAwB,KAAK,cAAc,KAAK,QAAQ,CAAC;GAClE,KAAK,gBAAgB;GACrB,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC,OAGI,KAAK,gBAAgB,OAAO,KAAK,cAAc,UAAU,YAAY,CAAC;CAE9E;CACA,mBAAmB,GAAG;EAClB,IAAI,MAAM,UAAU,MAAM;GACtB,KAAK,QAAQ,MAAM;GACnB,KAAK,kBAAkB,UAAU;GACjC,KAAK,gBAAgB;GACrB,KAAK,eAAe,KAAK,QAAQ;EACrC,OACK,IAAI,KAAK,SACV,KAAK,QAAQ,MAAM;OAElB,IAAI,MAAM,UAAU,IAAI;GACzB,KAAK,IAAI,UAAU,KAAK,cAAc,KAAK,OAAO,CAAC;GACnD,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC,OAEI,KAAK,QAAQ,MAAM;CAE3B;CACA,sBAAsB,GAAG;EACrB,IAAI,MAAM,UAAU,MAAM,KAAK,cAAc,UAAU,EAAE,GAAG;GACxD,KAAK,IAAI,UAAU,KAAK,cAAc,KAAK,OAAO,CAAC;GACnD,KAAK,QAAQ,MAAM;GACnB,KAAK,eAAe,KAAK,QAAQ;EACrC;CACJ;CACA,cAAc;EACV,KAAK,YAAY,KAAK;EACtB,KAAK,QAAQ,MAAM;EACnB,KAAK,cAAc,KAAK;EACxB,KAAK,cAAc,YAAY,KAAK,UAC9B,aAAa,SACb,KAAK,cAAc,MAAM,QACvB,KAAK,cAAc,MAAM,eACvB,aAAa,SACb,aAAa,SAAS;CACpC;CACA,gBAAgB;EACZ,MAAM,gBAAgB,KAAK,QAAQ,KAAK;EACxC,MAAM,SAAS,KAAK,cAAc,MAAM,KAAK,QAAQ,aAAa;EAElE,IAAI,UAAU,GAAG;GACb,KAAK,QAAQ,KAAK;GAClB,IAAI,WAAW,GACX,KAAK,SAAS;EAEtB,OACK;GACD,IAAI,gBAAgB,KAAK,OAAO,UAC5B,KAAK,OAAO,WAAW,aAAa,MAAM,UAAU,KAAK;IACzD,KAAK,QAAQ,KAAK;IAClB,KAAK,SAAS;IACd;GACJ;GAEA,KAAK,QAAQ,KAAK,SAAS,KAAK,OAAO,SAAS;EACpD;CACJ;;;;CAIA,UAAU;EAEN,IAAI,KAAK,WAAW,KAAK,iBAAiB,KAAK,OAAO;GAClD,IAAI,KAAK,UAAU,MAAM,QACrB,KAAK,UAAU,MAAM,eACpB,KAAK,UAAU,MAAM,gBAAgB,KAAK,kBAAkB,GAAI;IACjE,KAAK,IAAI,OAAO,KAAK,cAAc,KAAK,KAAK;IAC7C,KAAK,eAAe,KAAK;GAC7B,OACK,IAAI,KAAK,UAAU,MAAM,sBAC1B,KAAK,UAAU,MAAM,sBACrB,KAAK,UAAU,MAAM,oBAAoB;IACzC,KAAK,IAAI,aAAa,KAAK,cAAc,KAAK,KAAK;IACnD,KAAK,eAAe,KAAK;GAC7B;EACJ;CACJ;CACA,iBAAiB;EACb,OAAO,KAAK,QAAQ,KAAK,OAAO,SAAS,KAAK,UAAU,KAAK;CACjE;;;;;;CAMA,QAAQ;EACJ,OAAO,KAAK,eAAe,GAAG;GAC1B,MAAM,IAAI,KAAK,OAAO,WAAW,KAAK,QAAQ,KAAK,MAAM;GACzD,QAAQ,KAAK,OAAb;IACI,KAAK,MAAM;KACP,KAAK,UAAU,CAAC;KAChB;IAEJ,KAAK,MAAM;KAEP,KAAK,QAAQ,KAAK,OAAO,SAAS,KAAK,SAAS;KAChD;IAEJ,KAAK,MAAM;KACP,KAAK,0BAA0B,CAAC;KAChC;IAEJ,KAAK,MAAM;KACP,KAAK,kBAAkB,CAAC;KACxB;IAEJ,KAAK,MAAM;KACP,KAAK,mBAAmB,CAAC;KACzB;IAEJ,KAAK,MAAM;KACP,KAAK,yBAAyB,CAAC;KAC/B;IAEJ,KAAK,MAAM;KACP,KAAK,kCAAkC,CAAC;KACxC;IAEJ,KAAK,MAAM;KACP,KAAK,qBAAqB,CAAC;KAC3B;IAEJ,KAAK,MAAM;KACP,KAAK,mBAAmB,CAAC;KACzB;IAEJ,KAAK,MAAM;KACP,KAAK,sBAAsB,CAAC;KAC5B;IAEJ,KAAK,MAAM;KACP,KAAK,yBAAyB,CAAC;KAC/B;IAEJ,KAAK,MAAM;KACP,KAAK,eAAe,CAAC;KACrB;IAEJ,KAAK,MAAM;KACP,KAAK,sBAAsB,CAAC;KAC5B;IAEJ,KAAK,MAAM;KACP,KAAK,mBAAmB,CAAC;KACzB;IAEJ,KAAK,MAAM;KACP,KAAK,wBAAwB,CAAC;KAC9B;IAEJ,KAAK,MAAM;KACP,KAAK,kCAAkC,CAAC;KACxC;IAEJ,KAAK,MAAM;KACP,KAAK,0BAA0B,CAAC;KAChC;IAEJ,KAAK,MAAM;KACP,KAAK,0BAA0B,CAAC;KAChC;IAEJ,KAAK,MAAM;KACP,KAAK,yBAAyB,CAAC;KAC/B;IAEJ,KAAK,MAAM;KACP,KAAK,8BAA8B,CAAC;KACpC;IAEJ,KAAK,MAAM;KACP,KAAK,sBAAsB,CAAC;KAC5B;IAEJ,KAAK,MAAM;KACP,KAAK,mBAAmB,CAAC;KACzB;IAEJ,KAAK,MAAM;KACP,KAAK,uBAAuB,CAAC;KAC7B;IAEJ,KAAK,MAAM;KACP,KAAK,mBAAmB,CAAC;KACzB;IAEJ,KAAK,MAAM;KACP,KAAK,6BAA6B,CAAC;KACnC;IAEJ,KAAK,MAAM,UACP,KAAK,cAAc;GAG3B;GACA,KAAK;EACT;EACA,KAAK,QAAQ;CACjB;CACA,SAAS;EACL,IAAI,KAAK,UAAU,MAAM,UAAU;GAC/B,KAAK,cAAc,IAAI;GACvB,KAAK,QAAQ,KAAK;EACtB;EACA,KAAK,mBAAmB;EACxB,KAAK,IAAI,MAAM;CACnB;CACA,8BAA8B,UAAU;EACpC,IAAI,KAAK,UAAU,MAAM,eACrB,OAAO;EAEX,IAAI,KAAK,oBAAoB,UAAU,UAAU;GAC7C,IAAI,KAAK,SACD;QAAA,KAAK,eAAe,UACpB,KAAK,IAAI,QAAQ,KAAK,cAAc,UAAU,CAAC;GAAA,OAGlD;IAED,MAAM,aAAa,KAAK,eAAe,UAAU,MAAM,SAAS;IAChE,KAAK,IAAI,UAAU,YAAY,UAAU,CAAC;GAC9C;EACJ,OACK;GACD,MAAM,SAAS,KAAK,UACd,IACA,KAAK,IAAI,KAAK,eAAe,UAAU,WAAW,SAAS,CAAC;GAClE,KAAK,IAAI,UAAU,KAAK,cAAc,UAAU,MAAM;EAC1D;EACA,OAAO;CACX;CACA,gCAAgC,UAAU;EACtC,IAAI,KAAK,SACL,QAAQ,KAAK,OAAb;GACI,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;IACP,KAAK,IAAI,OAAO,KAAK,cAAc,QAAQ;IAC3C,OAAO;GAEX,SACI,OAAO;EAEf;EAEJ,QAAQ,KAAK,OAAb;GACI,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;IACP,KAAK,IAAI,UAAU,KAAK,cAAc,UAAU,CAAC;IACjD,OAAO;GAEX,KAAK,MAAM;IACP,IAAI,KAAK,kBAAkB,UAAU,QAAQ,QACzC,KAAK,IAAI,UAAU,KAAK,cAAc,UAAU,CAAC;IAErD,OAAO;GAEX,KAAK,MAAM,eACP,OAAO;GAEX,SACI,OAAO;EAEf;CACJ;;CAEA,qBAAqB;EACjB,MAAM,WAAW,KAAK,OAAO,SAAS,KAAK;EAC3C,IAAI,KAAK,8BAA8B,QAAQ,KAC3C,KAAK,gCAAgC,QAAQ,GAC7C;EAGJ,IAAI,KAAK,gBAAgB,UACrB;EAEJ,QAAQ,KAAK,OAAb;GACI,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM,kBAKP;GAEJ,SACI,KAAK,IAAI,OAAO,KAAK,cAAc,QAAQ;EAEnD;CACJ;CACA,cAAc,IAAI,UAAU;EACxB,IAAI,KAAK,cAAc,MAAM,QACzB,KAAK,cAAc,MAAM,cAAc;GACvC,IAAI,KAAK,eAAe,KAAK,aACzB,KAAK,IAAI,aAAa,KAAK,cAAc,KAAK,WAAW;GAE7D,KAAK,eAAe,KAAK,cAAc;GACvC,KAAK,QAAQ,KAAK,eAAe;GACjC,KAAK,IAAI,eAAe,EAAE;EAC9B,OACK;GACD,IAAI,KAAK,eAAe,KAAK,aACzB,KAAK,IAAI,OAAO,KAAK,cAAc,KAAK,WAAW;GAEvD,KAAK,eAAe,KAAK,cAAc;GACvC,KAAK,QAAQ,KAAK,eAAe;GACjC,KAAK,IAAI,aAAa,IAAI,KAAK,YAAY;EAC/C;CACJ;AACJ;;;AC9hCA,MAAM,EAAE,kBAAkB;AAE1B,MAAM,2BAAW,IAAI,IAAI;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;AACJ,CAAC;AACD,MAAM,uBAAO,IAAI,IAAI,CAAC,GAAG,CAAC;AAC1B,MAAM,8BAAc,IAAI,IAAI;CAAC;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;AAAG,CAAC;AACrE,MAAM,mCAAmB,IAAI,IAAI,CAAC,SAAS,OAAO,CAAC;AACnD,MAAM,0BAAU,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;AACpC,MAAM,0BAAU,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;AACpC,MAAM,mCAAmB,IAAI,IAAI;CAC7B,CAAC,sBAAM,IAAI,IAAI;EAAC;EAAM;EAAM;CAAI,CAAC,CAAC;CAClC,CAAC,sBAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;CACtB,CAAC,sBAAM,IAAI,IAAI;EAAC;EAAS;EAAM;CAAI,CAAC,CAAC;CACrC,CAAC,wBAAQ,IAAI,IAAI;EAAC;EAAQ;EAAQ;CAAQ,CAAC,CAAC;CAC5C,CAAC,qBAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;CACpB,CAAC,sBAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;CACtB,CAAC,KAAK,IAAI;CACV,CAAC,MAAM,WAAW;CAClB,CAAC,MAAM,WAAW;CAClB,CAAC,MAAM,WAAW;CAClB,CAAC,MAAM,WAAW;CAClB,CAAC,MAAM,WAAW;CAClB,CAAC,MAAM,WAAW;CAClB,CAAC,UAAU,QAAQ;CACnB,CAAC,SAAS,QAAQ;CAClB,CAAC,UAAU,QAAQ;CACnB,CAAC,UAAU,QAAQ;CACnB,CAAC,YAAY,QAAQ;CACrB,CAAC,YAAY,QAAQ;CACrB,CAAC,0BAAU,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC;CAC9B,CAAC,4BAAY,IAAI,IAAI,CAAC,YAAY,QAAQ,CAAC,CAAC;CAC5C,CAAC,MAAM,OAAO;CACd,CAAC,MAAM,OAAO;CACd,CAAC,WAAW,IAAI;CAChB,CAAC,WAAW,IAAI;CAChB,CAAC,SAAS,IAAI;CACd,CAAC,cAAc,IAAI;CACnB,CAAC,WAAW,IAAI;CAChB,CAAC,OAAO,IAAI;CACZ,CAAC,MAAM,IAAI;CACX,CAAC,YAAY,IAAI;CACjB,CAAC,cAAc,IAAI;CACnB,CAAC,UAAU,IAAI;CACf,CAAC,UAAU,IAAI;CACf,CAAC,QAAQ,IAAI;CACb,CAAC,UAAU,IAAI;CACf,CAAC,MAAM,IAAI;CACX,CAAC,QAAQ,IAAI;CACb,CAAC,OAAO,IAAI;CACZ,CAAC,MAAM,IAAI;CACX,CAAC,OAAO,IAAI;CACZ,CAAC,WAAW,IAAI;CAChB,CAAC,SAAS,IAAI;CACd,CAAC,MAAM,IAAI;CACX,CAAC,MAAM,OAAO;CACd,CAAC,MAAM,OAAO;CACd,CAAC,SAAS,gBAAgB;CAC1B,CAAC,SAAS,gBAAgB;AAC9B,CAAC;AACD,MAAM,gBAAgB;AACtB,MAAM,+BAAe,IAAI,IAAI;CACzB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACJ,CAAC;AACD,MAAM,yCAAyB,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC;;;;;;;AAOtD,MAAM,0CAA0B,IAAI,IAAI;CACpC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACJ,CAAC;AACD,MAAM,wCAAwB,IAAI,IAAI;CAClC,CAAC,YAAY,UAAU;CACvB,CAAC,eAAe,aAAa;CAC7B,CAAC,gBAAgB,cAAc;CAC/B,CAAC,gBAAgB,cAAc;CAC/B,CAAC,iBAAiB,eAAe;CACjC,CAAC,oBAAoB,kBAAkB;CACvC,CAAC,YAAY,UAAU;CACvB,CAAC,WAAW,SAAS;CACrB,CAAC,iBAAiB,eAAe;CACjC,CAAC,uBAAuB,qBAAqB;CAC7C,CAAC,eAAe,aAAa;CAC7B,CAAC,oBAAoB,kBAAkB;CACvC,CAAC,qBAAqB,mBAAmB;CACzC,CAAC,qBAAqB,mBAAmB;CACzC,CAAC,kBAAkB,gBAAgB;CACnC,CAAC,gBAAgB,cAAc;CAC/B,CAAC,WAAW,SAAS;CACrB,CAAC,WAAW,SAAS;CACrB,CAAC,WAAW,SAAS;CACrB,CAAC,WAAW,SAAS;CACrB,CAAC,WAAW,SAAS;CACrB,CAAC,kBAAkB,gBAAgB;CACnC,CAAC,WAAW,SAAS;CACrB,CAAC,WAAW,SAAS;CACrB,CAAC,eAAe,aAAa;CAC7B,CAAC,gBAAgB,cAAc;CAC/B,CAAC,YAAY,UAAU;CACvB,CAAC,gBAAgB,cAAc;CAC/B,CAAC,sBAAsB,oBAAoB;CAC3C,CAAC,eAAe,aAAa;CAC7B,CAAC,UAAU,QAAQ;CACnB,CAAC,gBAAgB,cAAc;CAC/B,CAAC,iBAAiB,eAAe;CACjC,CAAC,YAAY,UAAU;CACvB,CAAC,kBAAkB,gBAAgB;CACnC,CAAC,kBAAkB,gBAAgB;CACnC,CAAC,YAAY,UAAU;AAC3B,CAAC;AACD,IAAI;CACH,SAAU,gBAAgB;CACvB,eAAe,eAAe,UAAU,KAAK;CAC7C,eAAe,eAAe,SAAS,KAAK;CAC5C,eAAe,eAAe,YAAY,KAAK;AACnD,EAAA,CAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAC1C,MAAM,YAAY;;;;AAIlB,IAAa,SAAb,MAAoB;CAChB;;CAEA,aAAa;;CAEb,WAAW;;;;;CAKX,eAAe;CACf,UAAU;CACV,aAAa;CACb,cAAc;CACd,UAAU;CACV,QAAQ,CAAC;CACT;CACA;CACA;CACA;CACA;;CAEA;CACA;CACA,UAAU,CAAC;CACX,eAAe;;CAEf,aAAa;;CAEb,QAAQ;CACR,YAAY,KAAK,UAAU,CAAC,GAAG;EAC3B,KAAK,UAAU;EACf,KAAK,MAAM,OAAO,CAAC;EACnB,KAAK,WAAW,CAAC,KAAK,QAAQ;EAC9B,KAAK,oBAAoB,QAAQ,iBAAiB,KAAK;EACvD,KAAK,0BACD,QAAQ,2BAA2B,KAAK;EAC5C,KAAK,uBACD,QAAQ,wBAAwB,CAAC,KAAK;EAC1C,KAAK,YAAY,KAAK,QAAQ,aAAa,WAAW,KAAK,SAAS,IAAI;EACxE,KAAK,iBAAiB,CAAC,eAAe,IAAI;EAC1C,KAAK,IAAI,eAAe,IAAI;CAChC;;;;;;CAOA,OAAO,OAAO,UAAU;EACpB,MAAM,OAAO,KAAK,SAAS,OAAO,QAAQ;EAC1C,KAAK,WAAW,WAAW;EAC3B,KAAK,IAAI,SAAS,IAAI;EACtB,KAAK,aAAa;CACtB;;;;;;CAMA,aAAa,IAAI,UAAU;EACvB,KAAK,WAAW,WAAW;EAC3B,KAAK,IAAI,SAAS,cAAc,EAAE,CAAC;EACnC,KAAK,aAAa;CACtB;;CAEA,qBAAqB;EACjB,OAAO,KAAK,eAAe,OAAO,eAAe;CACrD;;;;;;CAMA,cAAc,MAAM;EAChB,OAAO,KAAK,YAAY,aAAa,IAAI,IAAI;CACjD;;;;;;;;;;CAUA,YAAY,OAAO,UAAU;EACzB,MAAM,OAAO,KAAK,oBACZ,KAAK,SAAS,OAAO,QAAQ,CAAC,CAAC,YAAY,IAC3C,KAAK,SAAS,OAAO,QAAQ;EACnC,IAAI,EAAE,KAAK,qBAAqB,KAAK,WACjC,OAAO;EAEX,IAAI,KAAK,eAAe,OAAO,eAAe,KAC1C,OAAO,sBAAsB,IAAI,IAAI,KAAK;EAS9C,IAAI,KAAK,eAAe,SAAS,GAAG;GAChC,MAAM,WAAW,sBAAsB,IAAI,IAAI;GAC/C,IAAI,aAAa,KAAA,KAAa,KAAK,MAAM,SAAS,QAAQ,GACtD,OAAO;EAEf;EACA,IAAI,CAAC,KAAK,mBAAmB,GACzB,OAAO,SAAS,UAAU,QAAQ;EAEtC,OAAO;CACX;;;;;;CAMA,cAAc,OAAO,UAAU;EAC3B,KAAK,WAAW;EAChB,KAAK,YAAY,KAAK,YAAY,OAAO,QAAQ,CAAC;CACtD;CACA,YAAY,MAAM;EACd,KAAK,eAAe,KAAK;EACzB,KAAK,UAAU;EAOf,IAAI,KAAK,YAAY,SAAS,UAAU,KAAK,MAAM,SAAS,MAAM,GAAG;GACjE,KAAK,UAAU;GACf;EACJ;EACA,MAAM,eAAe,KAAK,YAAY,iBAAiB,IAAI,IAAI;EAC/D,IAAI,cACA,OAAO,KAAK,MAAM,SAAS,KAAK,aAAa,IAAI,KAAK,MAAM,EAAE,GAC1D,KAAK,WAAW,IAAI;EAG5B,IAAI,CAAC,KAAK,cAAc,IAAI,GAAG;GAC3B,KAAK,MAAM,QAAQ,IAAI;GACvB,IAAI,KAAK,UAAU;IACf,IAAI,SAAS,OACT,KAAK,eAAe,QAAQ,eAAe,GAAG;SAE7C,IAAI,SAAS,QACd,KAAK,eAAe,QAAQ,eAAe,MAAM;SAEhD,IAAI,wBAAwB,IAAI,IAAI,GACrC,KAAK,eAAe,QAAQ,eAAe,IAAI;GAEvD;EACJ;EACA,KAAK,IAAI,gBAAgB,IAAI;EAC7B,IAAI,KAAK,IAAI,WACT,KAAK,UAAU,CAAC;CACxB;CACA,WAAW,WAAW;EAClB,KAAK,aAAa,KAAK;EACvB,IAAI,KAAK,SAAS;GACd,KAAK,IAAI,YAAY,KAAK,SAAS,KAAK,SAAS,SAAS;GAC1D,KAAK,UAAU;EACnB;EACA,IAAI,KAAK,IAAI,cAAc,KAAK,cAAc,KAAK,OAAO,GACtD,KAAK,IAAI,WAAW,KAAK,SAAS,IAAI;EAE1C,KAAK,UAAU;CACnB;;;;;CAKA,aAAa,UAAU;EACnB,KAAK,WAAW;EAChB,KAAK,WAAW,KAAK;EAErB,KAAK,aAAa,WAAW;CACjC;;;;;;CAMA,WAAW,OAAO,UAAU;EACxB,KAAK,WAAW;EAChB,MAAM,OAAO,KAAK,YAAY,OAAO,QAAQ;EAC7C,IAAI,CAAC,KAAK,cAAc,IAAI,GAAG;GAC3B,MAAM,MAAM,KAAK,MAAM,QAAQ,IAAI;GACnC,IAAI,QAAQ,IAAI;IACZ,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAC7B,KAAK,WAAW,IAAI;IAExB,KAAK,WAAW,KAAK;GACzB,OACK,IAAI,KAAK,YAAY,SAAS,KAAK;IAEpC,KAAK,YAAY,GAAG;IACpB,KAAK,gBAAgB,IAAI;GAC7B;EACJ,OACK,IAAI,KAAK,YAAY,SAAS,MAAM;GAErC,KAAK,IAAI,gBAAgB,IAAI;GAC7B,KAAK,IAAI,YAAY,MAAM,CAAC,GAAG,IAAI;GACnC,KAAK,IAAI,aAAa,MAAM,KAAK;EACrC;EAEA,KAAK,aAAa,WAAW;CACjC;;;;;CAKA,iBAAiB,UAAU;EACvB,KAAK,WAAW;EAChB,IAAI,KAAK,wBAAwB,KAAK,mBAAmB,GAAG;GACxD,KAAK,gBAAgB,KAAK;GAE1B,KAAK,aAAa,WAAW;EACjC,OAGI,KAAK,aAAa,QAAQ;CAElC;;;;;;CAMA,WAAW,SAAS;EAEhB,MAAM,UAAU,KAAK,MAAM,MAAM;EACjC,IAAI,KAAK,aACJ,uBAAuB,IAAI,OAAO,KAC/B,wBAAwB,IAAI,OAAO,IACvC,KAAK,eAAe,MAAM;EAE9B,KAAK,IAAI,aAAa,SAAS,OAAO;CAC1C;CACA,gBAAgB,eAAe;EAC3B,MAAM,OAAO,KAAK;EAClB,KAAK,WAAW,aAAa;EAE7B,IAAI,KAAK,MAAM,OAAO,MAClB,KAAK,WAAW,CAAC,aAAa;CAEtC;;;;;;CAMA,aAAa,OAAO,UAAU;EAC1B,KAAK,aAAa;EAClB,MAAM,OAAO,KAAK,SAAS,OAAO,QAAQ;EAC1C,KAAK,aAAa,KAAK,0BACjB,KAAK,YAAY,IACjB;CACV;;;;;;CAMA,aAAa,OAAO,UAAU;EAC1B,KAAK,eAAe,KAAK,SAAS,OAAO,QAAQ;CACrD;;;;;CAKA,eAAe,IAAI;EACf,KAAK,eAAe,cAAc,EAAE;CACxC;;;;;;CAMA,YAAY,OAAO,UAAU;EACzB,KAAK,WAAW;EAChB,KAAK,IAAI,cAAc,KAAK,YAAY,KAAK,aAAa,UAAU,UAAU,SACxE,OACA,UAAU,UAAU,SAChB,MACA,UAAU,UAAU,UAChB,KAAA,IACA,IAAI;EAClB,IAAI,KAAK,WAAW,CAAC,OAAO,OAAO,KAAK,SAAS,KAAK,UAAU,GAC5D,KAAK,QAAQ,KAAK,cAAc,KAAK;EAEzC,KAAK,cAAc;CACvB;CACA,mBAAmB,OAAO;EACtB,MAAM,QAAQ,MAAM,OAAO,SAAS;EACpC,IAAI,OAAO,QAAQ,IAAI,QAAQ,MAAM,OAAO,GAAG,KAAK;EACpD,IAAI,KAAK,mBACL,OAAO,KAAK,YAAY;EAE5B,OAAO;CACX;;;;;;CAMA,cAAc,OAAO,UAAU;EAC3B,KAAK,WAAW;EAChB,MAAM,QAAQ,KAAK,SAAS,OAAO,QAAQ;EAC3C,IAAI,KAAK,IAAI,yBAAyB;GAKlC,MAAM,OAAO,KAAK,WACZ,KAAK,oBACD,gBACA,MAAM,MAAM,GAAG,CAAoB,IACvC,KAAK,mBAAmB,KAAK;GACnC,KAAK,IAAI,wBAAwB,IAAI,QAAQ,IAAI,OAAO;EAC5D;EAEA,KAAK,aAAa,WAAW;CACjC;;;;;;CAMA,wBAAwB,OAAO,UAAU;EACrC,KAAK,WAAW;EAChB,MAAM,QAAQ,KAAK,SAAS,OAAO,QAAQ;EAC3C,IAAI,KAAK,IAAI,yBAAyB;GAClC,MAAM,OAAO,KAAK,mBAAmB,KAAK;GAC1C,KAAK,IAAI,wBAAwB,IAAI,QAAQ,IAAI,OAAO;EAC5D;EAEA,KAAK,aAAa,WAAW;CACjC;;;;;;;CAOA,UAAU,OAAO,UAAU,QAAQ;EAC/B,KAAK,WAAW;EAChB,KAAK,IAAI,YAAY,KAAK,SAAS,OAAO,WAAW,MAAM,CAAC;EAC5D,KAAK,IAAI,eAAe;EAExB,KAAK,aAAa,WAAW;CACjC;;;;;;;CAOA,QAAQ,OAAO,UAAU,QAAQ;EAC7B,KAAK,WAAW;EAChB,MAAM,QAAQ,KAAK,SAAS,OAAO,WAAW,MAAM;EACpD,IAAI,CAAC,KAAK,YAAY,KAAK,QAAQ,gBAAgB;GAC/C,KAAK,IAAI,eAAe;GACxB,KAAK,IAAI,SAAS,KAAK;GACvB,KAAK,IAAI,aAAa;EAC1B,OACK,IAAI,KAAK,mBAAmB,GAC7B,KAAK,IAAI,SAAS,KAAK;OAEtB;GACD,KAAK,IAAI,YAAY,UAAU,MAAM,GAAG;GACxC,KAAK,IAAI,eAAe;EAC5B;EAEA,KAAK,aAAa,WAAW;CACjC;;CAEA,QAAQ;EACJ,IAAI,KAAK,IAAI,YAAY;GAErB,KAAK,WAAW,KAAK;GACrB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,MAAM,QAAQ,SAC3C,KAAK,IAAI,WAAW,KAAK,MAAM,QAAQ,IAAI;EAEnD;EACA,KAAK,IAAI,QAAQ;CACrB;;;;CAIA,QAAQ;EACJ,KAAK,IAAI,UAAU;EACnB,KAAK,UAAU,MAAM;EACrB,KAAK,UAAU;EACf,KAAK,aAAa;EAClB,KAAK,cAAc;EACnB,KAAK,UAAU;EACf,KAAK,MAAM,SAAS;EACpB,KAAK,aAAa;EAClB,KAAK,WAAW;EAChB,KAAK,IAAI,eAAe,IAAI;EAC5B,KAAK,QAAQ,SAAS;EACtB,KAAK,eAAe,SAAS;EAC7B,KAAK,eAAe,QAAQ,eAAe,IAAI;EAC/C,KAAK,eAAe;EACpB,KAAK,aAAa;EAClB,KAAK,QAAQ;CACjB;;;;;;CAMA,cAAc,MAAM;EAChB,KAAK,MAAM;EACX,KAAK,IAAI,IAAI;CACjB;CACA,SAAS,OAAO,KAAK;EACjB,IAAI,UAAU,KACV,OAAO;EAEX,OAAO,QAAQ,KAAK,gBAAgB,KAAK,QAAQ,EAAE,CAAC,QAChD,KAAK,YAAY;EAErB,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC,MAAM,QAAQ,KAAK,cAAc,MAAM,KAAK,YAAY;EACpF,OAAO,MAAM,KAAK,eAAe,KAAK,QAAQ,EAAE,CAAC,QAAQ;GACrD,KAAK,YAAY;GACjB,SAAS,KAAK,QAAQ,EAAE,CAAC,MAAM,GAAG,MAAM,KAAK,YAAY;EAC7D;EACA,OAAO;CACX;CACA,cAAc;EACV,KAAK,gBAAgB,KAAK,QAAQ,EAAE,CAAC;EACrC,KAAK;EACL,KAAK,QAAQ,MAAM;CACvB;;;;;CAKA,MAAM,OAAO;EACT,IAAI,KAAK,OAAO;GACZ,KAAK,IAAI,0BAAU,IAAI,MAAM,sBAAsB,CAAC;GACpD;EACJ;EACA,KAAK,QAAQ,KAAK,KAAK;EACvB,IAAI,KAAK,UAAU,SAAS;GACxB,KAAK,UAAU,MAAM,KAAK;GAC1B,KAAK;EACT;CACJ;;;;;CAKA,IAAI,OAAO;EACP,IAAI,KAAK,OAAO;GACZ,KAAK,IAAI,0BAAU,IAAI,MAAM,oBAAoB,CAAC;GAClD;EACJ;EACA,IAAI,OACA,KAAK,MAAM,KAAK;EACpB,KAAK,QAAQ;EACb,KAAK,UAAU,IAAI;CACvB;;;;CAIA,QAAQ;EACJ,KAAK,UAAU,MAAM;CACzB;;;;CAIA,SAAS;EACL,KAAK,UAAU,OAAO;EACtB,OAAO,KAAK,UAAU,WAClB,KAAK,aAAa,KAAK,QAAQ,QAC/B,KAAK,UAAU,MAAM,KAAK,QAAQ,KAAK,aAAa;EAExD,IAAI,KAAK,OACL,KAAK,UAAU,IAAI;CAC3B;AACJ;;;;ACjoBA,IAAW;CACV,SAAU,aAAa;;CAEpB,YAAY,UAAU;;CAEtB,YAAY,UAAU;;CAEtB,YAAY,eAAe;;CAE3B,YAAY,aAAa;;CAEzB,YAAY,YAAY;;CAExB,YAAY,WAAW;;CAEvB,YAAY,SAAS;;CAErB,YAAY,WAAW;;CAEvB,YAAY,aAAa;AAC7B,EAAA,CAAG,gBAAgB,cAAc,CAAC,EAAE;;;;;;AAMpC,SAAgBC,QAAM,SAAS;CAC3B,OAAQ,QAAQ,SAAS,YAAY,OACjC,QAAQ,SAAS,YAAY,UAC7B,QAAQ,SAAS,YAAY;AACrC;AAIoB,YAAY;AAGZ,YAAY;AAGP,YAAY;AAGd,YAAY;AAGb,YAAY;AAGb,YAAY;AAGd,YAAY;AAGV,YAAY;AAGV,YAAY;;;;;;;ACtDnC,IAAa,OAAb,MAAkB;;CAEd,SAAS;;CAET,OAAO;;CAEP,OAAO;;CAEP,aAAa;;CAEb,WAAW;;;;;CAMX,IAAI,aAAa;EACb,OAAO,KAAK;CAChB;CACA,IAAI,WAAW,QAAQ;EACnB,KAAK,SAAS;CAClB;;;;;CAKA,IAAI,kBAAkB;EAClB,OAAO,KAAK;CAChB;CACA,IAAI,gBAAgB,UAAU;EAC1B,KAAK,OAAO;CAChB;;;;;CAKA,IAAI,cAAc;EACd,OAAO,KAAK;CAChB;CACA,IAAI,YAAY,MAAM;EAClB,KAAK,OAAO;CAChB;;;;;;CAMA,UAAU,YAAY,OAAO;EACzB,OAAO,UAAU,MAAM,SAAS;CACpC;AACJ;;;;AAIA,IAAa,WAAb,cAA8B,KAAK;CAC/B;;;;CAIA,YAAY,MAAM;EACd,MAAM;EACN,KAAK,OAAO;CAChB;;;;;CAKA,IAAI,YAAY;EACZ,OAAO,KAAK;CAChB;CACA,IAAI,UAAU,MAAM;EAChB,KAAK,OAAO;CAChB;AACJ;;;;AAIA,IAAa,OAAb,cAA0B,SAAS;CAC/B,OAAO,YAAY;CACnB,IAAI,WAAW;EACX,OAAO;CACX;AACJ;;;;AAIA,IAAa,UAAb,cAA6B,SAAS;CAClC,OAAO,YAAY;CACnB,IAAI,WAAW;EACX,OAAO;CACX;AACJ;;;;AAIA,IAAa,wBAAb,cAA2C,SAAS;CAChD,OAAO,YAAY;CACnB;CACA,YAAY,MAAM,MAAM;EACpB,MAAM,IAAI;EACV,KAAK,OAAO;CAChB;CACA,IAAI,WAAW;EACX,OAAO;CACX;;CAEA;;CAEA;;CAEA;AACJ;;;;AAIA,IAAa,mBAAb,cAAsC,KAAK;CACvC;;;;CAIA,YAAY,UAAU;EAClB,MAAM;EACN,KAAK,WAAW;CACpB;;CAGA,IAAI,aAAa;EACb,OAAO,KAAK,SAAS,MAAM;CAC/B;;CAEA,IAAI,YAAY;EACZ,OAAO,KAAK,SAAS,SAAS,IACxB,KAAK,SAAS,KAAK,SAAS,SAAS,KACrC;CACV;;;;;CAKA,IAAI,aAAa;EACb,OAAO,KAAK;CAChB;CACA,IAAI,WAAW,UAAU;EACrB,KAAK,WAAW;CACpB;AACJ;;;;AAIA,IAAa,QAAb,cAA2B,iBAAiB;CACxC,OAAO,YAAY;CACnB,IAAI,WAAW;EACX,OAAO;CACX;AACJ;;;;AAIA,IAAa,WAAb,cAA8B,iBAAiB;CAC3C,OAAO,YAAY;CACnB,IAAI,WAAW;EACX,OAAO;CACX;AACJ;;;;AAIA,IAAa,UAAb,cAA6B,iBAAiB;CAC1C;CACA;CACA;;;;;;;CAOA,YAAY,MAAM,SAAS,WAAW,CAAC,GAAG,OAAO,SAAS,WACpD,YAAY,SACZ,SAAS,UACL,YAAY,QACZ,YAAY,KAAK;EACvB,MAAM,QAAQ;EACd,KAAK,OAAO;EACZ,KAAK,UAAU;EACf,KAAK,OAAO;CAChB;CACA,IAAI,WAAW;EACX,OAAO;CACX;;;;;CAMA,IAAI,UAAU;EACV,OAAO,KAAK;CAChB;CACA,IAAI,QAAQ,MAAM;EACd,KAAK,OAAO;CAChB;CACA,IAAI,aAAa;EACb,OAAO,OAAO,KAAK,KAAK,OAAO,CAAC,CAAC,KAAK,UAAU;GAC5C;GACA,OAAO,KAAK,QAAQ;GACpB,WAAW,KAAK,qBAAqB,GAAG;GACxC,QAAQ,KAAK,kBAAkB,GAAG;EACtC,EAAE;CACN;;CAEA;;CAEA;;CAEA;AACJ;;;;;;AAMA,SAAgB,MAAM,MAAM;CACxB,OAAOI,QAAS,IAAI;AACxB;;;;;;AAMA,SAAgB,QAAQ,MAAM;CAC1B,OAAO,KAAK,SAAS,YAAY;AACrC;;;;;;AAMA,SAAgB,OAAO,MAAM;CACzB,OAAO,KAAK,SAAS,YAAY;AACrC;;;;;;AAMA,SAAgB,UAAU,MAAM;CAC5B,OAAO,KAAK,SAAS,YAAY;AACrC;;;;;;AAMA,SAAgB,YAAY,MAAM;CAC9B,OAAO,KAAK,SAAS,YAAY;AACrC;;;;;;AAMA,SAAgB,WAAW,MAAM;CAC7B,OAAO,KAAK,SAAS,YAAY;AACrC;;;;;;;AAeA,SAAgB,UAAU,MAAM,YAAY,OAAO;CAC/C,IAAI;CACJ,IAAI,OAAO,IAAI,GACX,SAAS,IAAI,KAAK,KAAK,IAAI;MAE1B,IAAI,UAAU,IAAI,GACnB,SAAS,IAAI,QAAQ,KAAK,IAAI;MAE7B,IAAI,MAAM,IAAI,GAAG;EAClB,MAAM,WAAW,YAAY,cAAc,KAAK,QAAQ,IAAI,CAAC;EAC7D,MAAM,QAAQ,IAAI,QAAQ,KAAK,MAAM,EAAE,GAAG,KAAK,QAAQ,GAAG,QAAQ;EAClE,KAAK,MAAM,SAAS,UAChB,MAAM,SAAS;EAEnB,IAAI,KAAK,aAAa,MAClB,MAAM,YAAY,KAAK;EAE3B,IAAI,KAAK,uBACL,MAAM,wBAAwB,EAAE,GAAG,KAAK,sBAAsB;EAElE,IAAI,KAAK,oBACL,MAAM,qBAAqB,EAAE,GAAG,KAAK,mBAAmB;EAE5D,SAAS;CACb,OACK,IAAI,QAAQ,IAAI,GAAG;EACpB,MAAM,WAAW,YAAY,cAAc,KAAK,QAAQ,IAAI,CAAC;EAC7D,MAAM,QAAQ,IAAI,MAAM,QAAQ;EAChC,KAAK,MAAM,SAAS,UAChB,MAAM,SAAS;EAEnB,SAAS;CACb,OACK,IAAI,WAAW,IAAI,GAAG;EACvB,MAAM,WAAW,YAAY,cAAc,KAAK,QAAQ,IAAI,CAAC;EAC7D,MAAM,QAAQ,IAAI,SAAS,QAAQ;EACnC,KAAK,MAAM,SAAS,UAChB,MAAM,SAAS;EAEnB,IAAI,KAAK,WACL,MAAM,YAAY,KAAK;EAE3B,SAAS;CACb,OACK,IAAI,YAAY,IAAI,GAAG;EACxB,MAAM,cAAc,IAAI,sBAAsB,KAAK,MAAM,KAAK,IAAI;EAClE,IAAI,KAAK,aAAa,MAAM;GACxB,YAAY,YAAY,KAAK;GAC7B,YAAY,gBAAgB,KAAK;GACjC,YAAY,gBAAgB,KAAK;EACrC;EACA,SAAS;CACb,OAEI,MAAM,IAAI,MAAM,wBAAwB,KAAK,MAAM;CAEvD,OAAO,aAAa,KAAK;CACzB,OAAO,WAAW,KAAK;CACvB,IAAI,KAAK,sBAAsB,MAC3B,OAAO,qBAAqB,KAAK;CAErC,OAAO;AACX;;;;;;AAMA,SAAS,cAAc,QAAQ;CAC3B,MAAM,WAAW,OAAO,KAAK,UAAU,UAAU,OAAO,IAAI,CAAC;CAC7D,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS;EAClD,SAAS,MAAM,CAAC,OAAO,SAAS,QAAQ;EACxC,SAAS,QAAQ,EAAE,CAAC,OAAO,SAAS;CACxC;CACA,OAAO;AACX;;;AClWA,MAAM,iBAAiB;CACnB,kBAAkB;CAClB,gBAAgB;CAChB,SAAS;AACb;;;;AAIA,IAAa,aAAb,MAAwB;;CAEpB,MAAM,CAAC;;CAEP,OAAO,IAAI,SAAS,KAAK,GAAG;;CAE5B;;CAEA;;CAEA;;CAEA,OAAO;;CAEP,WAAW,CAAC,KAAK,IAAI;;CAErB,WAAW;;CAEX,SAAS;;;;;;CAMT,YAAY,UAAU,SAAS,WAAW;EAEtC,IAAI,OAAO,YAAY,YAAY;GAC/B,YAAY;GACZ,UAAU;EACd;EACA,IAAI,OAAO,aAAa,UAAU;GAC9B,UAAU;GACV,WAAW,KAAA;EACf;EACA,KAAK,WAAW,YAAY;EAC5B,KAAK,UAAU,WAAW;EAC1B,KAAK,YAAY,aAAa;CAClC;CACA,aAAa,QAAQ;EACjB,KAAK,SAAS;CAClB;CAEA,UAAU;EACN,KAAK,MAAM,CAAC;EACZ,KAAK,OAAO,IAAI,SAAS,KAAK,GAAG;EACjC,KAAK,OAAO;EACZ,KAAK,WAAW,CAAC,KAAK,IAAI;EAC1B,KAAK,WAAW;EAChB,KAAK,SAAS;CAClB;CAEA,QAAQ;EACJ,IAAI,KAAK,MACL;EACJ,KAAK,OAAO;EACZ,KAAK,SAAS;EACd,KAAK,eAAe,IAAI;CAC5B;CACA,QAAQ,OAAO;EACX,KAAK,eAAe,KAAK;CAC7B;CACA,aAAa;EACT,KAAK,WAAW;EAChB,MAAM,UAAU,KAAK,SAAS,IAAI;EAClC,IAAI,KAAK,QAAQ,kBAAkB,KAAK,QACpC,QAAQ,WAAW,KAAK,OAAO;EAEnC,IAAI,KAAK,WACL,KAAK,UAAU,OAAO;CAC9B;CACA,UAAU,MAAM,SAAS;EAErB,MAAM,UAAU,IAAI,QAAQ,MAAM,SAAS,KAAA,GAD9B,KAAK,QAAQ,UAAU,YAAY,MAAM,KAAA,CACI;EAC1D,KAAK,QAAQ,OAAO;EACpB,KAAK,SAAS,KAAK,OAAO;CAC9B;CACA,OAAO,MAAM;EACT,MAAM,EAAE,aAAa;EACrB,IAAI,YAAY,SAAS,SAAS,YAAY,MAAM;GAChD,SAAS,QAAQ;GACjB,IAAI,KAAK,QAAQ,kBAAkB,KAAK,QACpC,SAAS,WAAW,KAAK,OAAO;EAExC,OACK;GACD,MAAM,OAAO,IAAI,KAAK,IAAI;GAC1B,KAAK,QAAQ,IAAI;GACjB,KAAK,WAAW;EACpB;CACJ;CACA,UAAU,MAAM;EACZ,IAAI,KAAK,YAAY,KAAK,SAAS,SAAS,YAAY,SAAS;GAC7D,KAAK,SAAS,QAAQ;GACtB;EACJ;EACA,MAAM,OAAO,IAAI,QAAQ,IAAI;EAC7B,KAAK,QAAQ,IAAI;EACjB,KAAK,WAAW;CACpB;CACA,eAAe;EACX,KAAK,WAAW;CACpB;CACA,eAAe;EACX,MAAM,OAAO,IAAI,KAAK,EAAE;EACxB,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC;EAC7B,KAAK,QAAQ,IAAI;EACjB,KAAK,SAAS;EACd,KAAK,WAAW;CACpB;CACA,aAAa;EACT,KAAK,WAAW;CACpB;CACA,wBAAwB,MAAM,MAAM;EAChC,MAAM,OAAO,IAAI,sBAAsB,MAAM,IAAI;EACjD,KAAK,QAAQ,IAAI;CACrB;CACA,eAAe,OAAO;EAClB,IAAI,OAAO,KAAK,aAAa,YACzB,KAAK,SAAS,OAAO,KAAK,GAAG;OAE5B,IAAI,OACL,MAAM;CAEd;CACA,QAAQ,MAAM;EACV,MAAM,SAAS,KAAK,SAAS,KAAK,SAAS,SAAS;EACpD,MAAM,kBAAkB,OAAO,SAAS,OAAO,SAAS,SAAS;EACjE,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QACtC,KAAK,aAAa,KAAK,OAAO;EAElC,IAAI,KAAK,QAAQ,kBAAkB,KAAK,QACpC,KAAK,WAAW,KAAK,OAAO;EAEhC,OAAO,SAAS,KAAK,IAAI;EACzB,IAAI,iBAAiB;GACjB,KAAK,OAAO;GACZ,gBAAgB,OAAO;EAC3B;EACA,KAAK,SAAS;EACd,KAAK,WAAW;CACpB;AACJ;;;;;;;;AC7IA,SAAgB,cAAc,MAAM,SAAS;CACzC,MAAM,UAAU,IAAI,WAAW,KAAA,GAAW,OAAO;CACjD,IAAI,OAAO,SAAS,OAAO,CAAC,CAAC,IAAI,IAAI;CACrC,OAAO,QAAQ;AACnB;;;;;;;;;;;;ACsCA,SAAgB,uBAAuB,MAAc,UAA4B,CAAC,GAAoB;CACpG,OAAO,UAAU,MAAM,SAAS,EAAE,MAAM,MAAM,CAAC;AACjD;AAEA,SAAS,UAAU,MAAc,SAA2B,QAA0C;CACpG,MAAM,cAA4B,CAAC;CACnC,MAAM,QAAQ,YAAY;CAC1B,MAAM,cAAc,QAAQ,SAAS,SAAS,SAAiB,QAAQ,SAAiB,KAAK,KAAK;CAElG,MAAM,MAAM,cAAc,IAAI;CAG9B,MAAM,aAAa,YAAY,KAAK,cAAc;CAClD,IAAI,YAAY;EACd,gBAAgB,YAAY,OAAO,aAAa,QAAQ,WAAW;EACnE,OAAO;GAAE;GAAO;EAAY;CAC9B;CAEA,MAAM,aAAa,uBAAuB,KAAK,oBAAoB;CACnE,IAAI,YAAY;EACd,gBAAgB,YAAY,OAAO,aAAa,WAAW;EAC3D,OAAO;GAAE;GAAO;EAAY;CAC9B;CAEA,YAAY,KAAK;EAAE,OAAO;EAAS,SAAS;CAA+C,CAAC;CAC5F,OAAO;EAAE;EAAO;CAAY;AAC9B;AAKA,SAAS,gBACP,WACA,OACA,aACA,QACA,aACM;CAEN,IAAI,YAAY;CAChB,MAAM,QAAQ,UAAU,WAAW,CAAC;CAEpC,IAAI,MAAM,SAAS,MAAM,OAAO,MAAM;CACtC,IAAI,MAAM,cAAc;EACtB,MAAM,SAAS,SAAS,MAAM,cAAc,EAAE;EAC9C,IAAI,OAAO,MAAM,MAAM,GACrB,YAAY,KAAK;GACf,OAAO;GACP,SAAS,mFAAmF,MAAM,aAAa;EACjH,CAAC;OAED,YAAY;CAEhB;CACA,IAAI,MAAM,SAAS,MAAM,OAAO,cAAc,MAAM,OAAO;CAC3D,IAAI,OAAO,MAAM,YAAY,KAAK,GAAG,yBAAyB,MAAM,WAAW,EAAE,CAAC;CAClF,IAAI,MAAM,SAAS;EACjB,MAAM,SAAS,WAAW,MAAM,OAAO;EACvC,IAAI,OAAO,MAAM,MAAM,GACrB,YAAY,KAAK;GACf,OAAO;GACP,SAAS,2EAA2E,MAAM,QAAQ;EACpG,CAAC;OAED,MAAM,OAAO,OAAO;CAExB;CACA,IAAI,MAAM,SAAS,MAAM,OAAO,OAAO,MAAM;CAC7C,IAAI,MAAM,WAAW,MAAM,OAAO,SAAS,MAAM;CACjD,IAAI,MAAM,mBAAmB,MAAM,OAAO,gBAAgB,MAAM;CAChE,IAAI,MAAM,YACR,KAAK,MAAM,OAAO,MAAM,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,MAAc,EAAE,SAAS,CAAC,GAChF,MAAM,OAAO,QAAQ,IAAI,KAAK,IAAI;CAMtC,MAAM,WAAW,UAAU,YAAY,CAAC;CACxC,MAAM,aAAa,IAAI,IACrB,SAAS,QAAQ,SAAS,KAAK,SAAS,SAAS,KAAK,SAAS,gBAAgB,CAAC,CAAC,IAAI,eAAe,CACtG;CAIA,KAAK,MAAM,QAAQ,UAAU;EAC3B,IAAI,KAAK,SAAS,SAAS,KAAK,SAAS,WAAW,KAAK,SAAS,UAAU;EAE5E,QAAQ,KAAK,MAAb;GACE,KAAK;GACL,KAAK,UAAU;IACb,MAAM,UAAU,eAAe,IAAI;IAEnC,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAAG;IACjC,MAAM,OAAO,YAAY,OAAO;IAChC,MAAM,OAAO,KAAK,SAAS,UAAU,qBAAqB;IAC1D,MAAM,OAAO,SAAS,OAAO,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;IACrD,WAAW,IAAI,IAAI;IAGnB,SAAS,OAAO,kBAAkB;KAAE;KAAM,MAF7B,KAAK,SAAS,UAAU,CAAC,YAAY,IAAI,CAAC,QAAQ;KAEf;IAAK,GAAG;KAAE,MAAM;KAAQ;IAAK,CAAC,GAAG,WAAW;IAC5F;GACF;GAEA,KAAK,UAAU;IACb,MAAM,WAAW,KAAK,WAAW,CAAC;IAClC,MAAM,UAAU,SAAS,WAAW;IACpC,MAAM,WAAW,SAAS,YAAY;IACtC,IAAI,SAAS,MAAM,OAAO,UAAU,IAAI,SAAS,QAAQ;IACzD;GACF;GAEA,KAAK,kBAAkB;IACrB,IAAI,MAAM;IACV,MAAM,SAAS,KAAK,WAAW,CAAC;IAChC,MAAM,OAAO,gBAAgB,IAAI;IACjC,MAAM,OAAO,OAAO,UAAU,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,MAAc,EAAE,SAAS,CAAC,IAAI,CAAC;IACjG,MAAM,WAA4B,CAAC;IAEnC,IAAI,OAAO,QAAQ;KACjB,MAAM,SAAS,SAAS,OAAO,QAAQ,EAAE;KACzC,IAAI,OAAO,MAAM,MAAM,GACrB,YAAY,KAAK;MACf,OAAO;MACP,SAAS,+EAA+E,OAAO,OAAO;KACxG,CAAC;UAED,MAAM;IAEV;IAEA,IAAI,OAAO,aAAa,SAAS,WAAW,OAAO;IACnD,IAAI,OAAO,SAAS,SAAS,OAAO,OAAO;IAE3C,IAAI,QAAQ,aAAa,QAAQ,GAC/B,MAAM,OAAO,QAAQ;IAIvB,MAAM,UAAmB;KAAE;KAAM;KAAM,MAD1B,YAAY,eAAe,IAAI,CACF;IAAE;IAC5C,IAAI,SAAS,YAAY,SAAS,MAChC,QAAQ,WAAW;IAErB,SAAS,OAAO,SAAS,WAAW;IACpC;GACF;EACF;CACF;CAGA,aAAa,OAAO;EAAE,MAAM;EAAa,MAAM,CAAC;EAAG,MAAM,iBAAiB,KAAK;CAAE,GAAG,WAAW;AACjG;AAEA,SAAS,gBAAgB,MAAwB;CAC/C,OAAO,KAAK,UAAU,WAAW;AACnC;;AAGA,SAAS,yBAAyB,OAA6B;CAC7D,IAAI,UAAU,IACZ,OAAO,CACL;EACE,OAAO;EACP,SAAS;CACX,CACF;CAEF,MAAM,MAAM,aAAa,KAAK;CAC9B,IAAI,QAAQ,MAAM,OAAO,CAAC;CAC1B,OAAO,CACL;EACE,OAAO;EACP,SAAS,2EAA2E,MAAM,KAAK,IAAI;CACrG,CACF;AACF;AAEA,SAAS,gBACP,WACA,OACA,aACA,aACM;CACN,MAAM,YAAY,UAAU,YAAY,CAAC,EAAA,CAAG,OAAO,SAAS,CAAC,CAAC,KAAK,SAAS,iBAAiB,MAAM,WAAW,CAAC;CAK/G,MAAM,aAAa,kBAAkB,QAAQ;CAC7C,KAAK,MAAM,KAAK,UAGd,SAAS,OADP,cAAc,eAAe,CAAC,IAAI;EAAE,GAAG;EAAG,MAAM,MAAM,EAAE,IAAI;EAAG,MAAM,EAAE,KAAK,IAAI,KAAK;EAAG,MAAM,MAAM,EAAE,IAAI;CAAE,IAAI,GACzF,WAAW;AAExC;AAEA,SAAS,UAAU,MAAyB;CAC1C,OAAO,KAAK,SAAS,SAAS,KAAK,SAAS,SAAS,KAAK,YAAY,KAAA,KAAa,aAAa,KAAK;AACvG;AAEA,SAAS,iBAAiB,MAAgB,aAAmC;CAC3E,MAAM,YAAY,KAAK,WAAW,CAAC;CAKnC,MAAM,UAAmB;EAAE,MAJd,UAAU,cAAc;EAIJ,MAHpB,UAAU,UAAU,UAAU,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,MAAc,EAAE,SAAS,CAAC,IAAI,CAAC;EAGhE,MAF1B,YAAY,gBAAgB,eAAe,IAAI,CAAC,CAEnB;CAAE;CAC5C,MAAM,WAAW,UAAU;CAC3B,IAAI,UACF,QAAQ,WAAW,EAAE,SAAS;CAEhC,OAAO;AACT;;AAGA,SAAS,kBAAkB,UAAuC;CAChE,MAAM,WAAW,YAAY;CAC7B,KAAK,MAAM,KAAK,UAEd,IAAI,EAAE,SAAS,iBAAiB,uBAAuB,UAAU,EAAE,MAAM,CAAC,CAAC;CAE7E,OAAO,SAAS,OAAO,SAAS,IAAI,WAAW,MAAM;AACvD;AAEA,SAAS,YAAY,MAAgB,SAAuC;CAC1E,IAAI,KAAK,SAAS,SAAS,KAAK,SAAS,SAAS,OAAO;CACzD,KAAK,MAAM,SAAS,KAAK,YAAY,CAAC,GAAG;EACvC,MAAM,QAAQ,YAAY,OAAO,OAAO;EACxC,IAAI,OAAO,OAAO;CACpB;AAEF;AAEA,SAAS,uBAAuB,MAAgB,WAAyC;CACvF,IAAI,KAAK,SAAS,SAAS,KAAK,UAAU,SAAS,UAAU,KAAK,KAAK,QAAQ,KAAK,GAAG,OAAO;CAC9F,KAAK,MAAM,SAAS,KAAK,YAAY,CAAC,GAAG;EACvC,MAAM,QAAQ,uBAAuB,OAAO,SAAS;EACrD,IAAI,OAAO,OAAO;CACpB;AAEF;AAEA,SAAS,eAAe,IAAsB;CAC5C,IAAI,OAAO;CACX,KAAK,MAAM,SAAS,GAAG,YAAY,CAAC,GAClC,IAAI,MAAM,SAAS,UAAU,MAAM,MACjC,QAAQ,MAAM;CAGlB,OAAO;AACT;;;;;;;;;;ACxRA,SAAgB,YACd,OACA,WACA,MACA,aACA,gBACM;CACN,KAAK,MAAM,YAAY,WAAW;EAChC,IAAI,eAAe,IAAI,QAAQ,GAAG;GAChC,YAAY,KAAK;IAAE,OAAO;IAAW,SAAS,QAAQ,SAAS;GAAuB,CAAC;GACvF;EACF;EAEA,MAAM,MAAM,kBAAkB,QAAQ;EACtC,IAAI;GACF,QAAQ,KAAR;IACE,KAAK;IACL,KAAK;KACH,SAAS,OAAO,UAAU,MAAM,WAAW;KAC3C;IACF,KAAK;IACL,KAAK;KACH,SAAS,OAAO,UAAU;MAAE,GAAG;MAAM,aAAa;KAAK,GAAG,WAAW;KACrE;IACF,KAAK;IACL,KAAK;KACH,SAAS,OAAO,UAAU,MAAM,WAAW;KAC3C;IACF,KAAK;KACH,WAAW,OAAO,cAAc,UAAU,WAAW;KACrD;IACF,KAAK;KACH,WAAW,OAAO,UAAU,UAAU,WAAW;KACjD;IACF,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;KACH,SAAS,OAAO,UAAU,WAAW;KACrC;IACF,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;KACH,UAAU,OAAO,eAAe,UAAU,WAAW;KACrD;IACF,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;KACH,UAAU,OAAO,eAAe,UAAU,WAAW;KACrD;IACF,KAAK;IACL,KAAK;IACL,KAAK;KACH,UAAU,OAAO,eAAe,UAAU,WAAW;KACrD;IACF,KAAK;KACH,UAAU,OAAO,aAAa,UAAU,WAAW;KACnD;IACF,SACE;GACJ;EACF,SAAS,GAAG;GACV,YAAY,KAAK;IACf,OAAO;IACP,SAAS,QAAQ,SAAS,IAAI,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;IACvE,MAAM;GACR,CAAC;GACD;EACF;EACA,eAAe,IAAI,QAAQ;CAC7B;CAGA,IAAI,MAAM,SAAS,MAAM,CAAC,MAAM,SAAS,MAAM,MAAM,EAAE,SAAS,YAAY,GAC1E,aAAa,OAAO;EAAE,MAAM;EAAc,MAAM,CAAC;EAAG,MAAM,MAAM;CAAK,GAAG,WAAW;AAEvF;;;;AAKA,SAAgB,kBACd,OACA,SACA,MACA,aACM;CACN,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,OAAO,WAAW,UAEpB;EAGF,MAAM,UACJ,OAAO,OAAO,YAAY,WACtB;GAAE,MAAM,OAAO;GAAS,aAAa,CAAC;EAAE,IACxC,WAAW,OAAO,SAAS,OAAO,QAAQ;EAChD,YAAY,KAAK,GAAG,QAAQ,WAAW;EACvC,MAAM,UAAU,oBAAoB,QAAQ,IAAI;EAEhD,MAAM,MAAM,kBAAkB,OAAO,QAAQ;EAC7C,QAAQ,KAAR;GACE,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,SAAS;IACZ,MAAM,QAAQ,QAAQ,SAAS,QAAQ,WAAW,KAAK;IACvD,MAAM,SAAS,UAAU,SAAS;KAChC,UAAU,OAAO;KACjB,MAAM,KAAK,QAAQ;KACnB,aAAa;IACf,CAAC;IACD,YAAY,KAAK,GAAG,OAAO,WAAW;IACtC,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;IAEhC;GACF;GACA,KAAK;IACH,SAAS,OAAO,YAAY,SAAS,OAAO,QAAQ,GAAG,cAAc,OAAO,GAAG,WAAW;IAC1F;GACF,KAAK;IACH,SAAS,OAAO,YAAY,SAAS,OAAO,QAAQ,GAAG,UAAU,OAAO,GAAG,WAAW;IACtF;GACF,SACE,YAAY,KAAK;IACf,OAAO;IACP,SAAS,QAAQ,OAAO,SAAS,+BAA+B,IAAI;GACtE,CAAC;EACL;CACF;AACF;AAOA,SAAS,cAAc,UAAkB,MAAgC;CACvE,MAAM,kBAAgC,CAAC;CAEvC,MAAM,SAAS,UADA,SAAS,UAAU,eACT,GAAQ;EAC/B;EACA,MAAM,KAAK,QAAQ;EACnB,aAAa,KAAK,eAAe;CACnC,CAAC;CACD,OAAO;EAAE,UAAU,OAAO;EAAU,aAAa,CAAC,GAAG,iBAAiB,GAAG,OAAO,WAAW;CAAE;AAC/F;;;;;AAMA,SAAS,YAAY,MAAc,KAAa,MAAuB;CACrE,OAAO,kBAAkB;EAAE;EAAM,MAAM,CAAC,GAAG;EAAG;CAAK,GAAG;EAAE,MAAM;EAAQ,MAAM;CAAK,CAAC;AACpF;;AAGA,SAAS,UAAU,QAAkC;CACnD,KAAK,MAAM,KAAK,OAAO,UAAU,kBAAkB,GAAG;EAAE,MAAM;EAAQ,MAAM,EAAE;CAAK,CAAC;CACpF,OAAO;AACT;AAEA,SAAS,gBAAgB,KAAa,UAA+B;CACnE,MAAM,cAA4B,CAAC;CACnC,MAAM,SAAS,SAAS,UAAU,WAAW;CAC7C,OAAO;EAAE,UAAU,CAAC,YAAY,SAAS,QAAQ,GAAG,KAAK,MAAM,CAAC;EAAG;CAAY;AACjF;AAEA,SAAS,eAAe,KAAa,UAA+B;CAClE,MAAM,SAAS,WAAW,QAAQ;CAClC,MAAM,OAAO,mBAAmB,QAAQ;CAExC,OAAO;EACL,UAAU,CAAC,kBAAkB;GAFb;GAAM,MAAM,CAAC,GAAG;GAAG,MAAM,QAAQ,sBAAsB,QAAQ,EAAE,UAAU;EAE9D,GAAS;GAAE,MAAM;GAAS,MAAM;GAAM,MAAM;EAAS,CAAC,CAAC;EACpF,aAAa,CAAC;CAChB;AACF;AAEA,SAAS,cAAc,UAA+B;CACpD,MAAM,SAAS,WAAW,QAAQ;CAClC,MAAM,OAAO,SAAS,QAAQ;CAC9B,MAAM,SAAS,mBAAmB,QAAQ;CAC1C,MAAM,MAAM,kBAAkB,QAAQ;CACtC,MAAM,YAAY,iBAAiB,GAAG;CACtC,MAAM,OAAO,eAAe,GAAG;CAC/B,OAAO,UAAU;EACf,UAAU,CACR;GACE;GACA,MAAM,CAAC,YAAY;GACnB,MAAM,iCAAiC,gBAAgB,MAAM,EAAE,uBAAuB,UAAU,UAAU,OAAO,aAAa,KAAK;EACrI,CACF;EACA,aAAa,CAAC;CAChB,CAAC;AACH;AAEA,SAAS,cAAc,UAAkB,MAAgC;CACvE,MAAM,kBAAgC,CAAC;CACvC,MAAM,EAAE,OAAO,gBAAgB,uBAAuB,SAAS,UAAU,eAAe,GAAG,EACzF,MAAM,KAAK,QAAQ,KACrB,CAAC;CAOD,OAAO;EAAE,UAHP,MAAM,SAAS,MAAM,CAAC,SAAS,OAAO,YAAY,IAC9C,CAAC;GAAE,MAAM;GAAc,MAAM,CAAC;GAAG,MAAM,MAAM;EAAK,GAAG,GAAG,MAAM,QAAQ,IACtE,MAAM;EACO,aAAa,CAAC,GAAG,iBAAiB,GAAG,WAAW;CAAE;AACvE;;;;;;AAOA,SAAS,gBAAgB,UAAkB,MAA2B;CACpE,MAAM,MAAM,kBAAkB,QAAQ;CACtC,MAAM,OAAO,KAAK,QAAQ;CAC1B,IAAI,QAAQ,SAAS,QAAQ,QAAQ,OAAO,KAAK,UAAU,EAAE,KAAK,CAAC;CACnE,MAAM,YAAY,QAAQ,SAAS,QAAQ;CAC3C,IAAI,CAAC,aAAa,QAAQ,QAAQ,QAAQ,QAAQ,OAAO;CACzD,OAAO,KAAK,UAAU;EAAE;EAAM,aAAa,cAAc,KAAK,eAAe;CAAO,CAAC;AACvF;AAEA,SAAS,UAAU,UAAkB,MAA4C;CAE/E,QADY,kBAAkB,QACpB,GAAV;EACE,KAAK;EACL,KAAK,QACH,OAAO,cAAc,UAAU,IAAI;EACrC,KAAK;EACL,KAAK,SACH,OAAO,cAAc,UAAU;GAAE,GAAG;GAAM,aAAa;EAAK,CAAC;EAC/D,KAAK;EACL,KAAK,QACH,OAAO,cAAc,UAAU,IAAI;EACrC,KAAK,OACH,OAAO,gBAAgB,cAAc,QAAQ;EAC/C,KAAK,MACH,OAAO,gBAAgB,UAAU,QAAQ;EAC3C,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,SACH,OAAO,cAAc,QAAQ;EAC/B,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO,eAAe,eAAe,QAAQ;EAC/C,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO,eAAe,eAAe,QAAQ;EAC/C,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO,eAAe,eAAe,QAAQ;EAC/C,KAAK,OACH,OAAO,eAAe,aAAa,QAAQ;EAC7C,SACE;CACJ;AACF;AAEA,SAAS,SAAS,OAAc,UAAkB,MAAmB,aAAiC;CACpG,MAAM,SAAS,cAAc,UAAU,IAAI;CAC3C,YAAY,KAAK,GAAG,OAAO,WAAW;CACtC,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;AAElC;AAEA,SAAS,SAAS,OAAc,UAAkB,MAAmB,aAAiC;CACpG,MAAM,SAAS,cAAc,UAAU,IAAI;CAC3C,YAAY,KAAK,GAAG,OAAO,WAAW;CACtC,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;AAElC;AAEA,SAAS,WAAW,OAAc,KAAa,UAAkB,aAAiC;CAChG,MAAM,SAAS,gBAAgB,KAAK,QAAQ;CAC5C,YAAY,KAAK,GAAG,OAAO,WAAW;CACtC,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;AAElC;AAEA,SAAS,UAAU,OAAc,KAAa,UAAkB,aAAiC;CAC/F,MAAM,SAAS,eAAe,KAAK,QAAQ;CAC3C,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;AAElC;AAEA,SAAS,SAAS,OAAc,UAAkB,aAAiC;CACjF,MAAM,SAAS,cAAc,QAAQ;CACrC,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;AAElC;;;;;AAMA,SAAgB,kBACd,OACA,WACA,MACA,aACA,gBACA,OACA,cACA,YACM;CACN,MAAM,eAAe,IAAI,IAAY,UAAU;CAG/C,MAAM,eAAe,iBAAiB,KAAA,IAAY,KAAA,IAAY,IAAI,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC,KAAK,MAAM,QAAQ,CAAC,CAAC,CAAC;CAE9G,KAAK,MAAM,YAAY,WAAW;EAChC,IAAI,eAAe,IAAI,QAAQ,GAAG;GAChC,YAAY,KAAK;IAAE,OAAO;IAAW,SAAS,QAAQ,SAAS;GAAuB,CAAC;GACvF;EACF;EAEA,aAAa,IAAI,QAAQ;EACzB,MAAM,aAAa,gBAAgB,UAAU,IAAI;EAEjD,MAAM,QAAQ,MAAM,IAAI,QAAQ;EAChC,MAAM,SAAS,OAAO,oBAAoB,aAAa,QAAQ,KAAA;EAG/D,MAAM,UAAU,cAAc,IAAI,QAAQ,QAAQ,CAAC,KAAK;EAGxD,IAAI,gBAAgB,UAAU,CAAC,SAAS;GACtC,YAAY,KAAK,GAAG,OAAO,WAAW;GACtC,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;GAEhC,eAAe,IAAI,QAAQ;GAC3B;EACF;EAGA,IAAI;EACJ,IAAI;GACF,UAAU,SAAS,QAAQ,CAAC,CAAC;EAC/B,QAAQ;GAGN,MAAM,OAAO,QAAQ;GACrB;EACF;EAGA,IAAI,UAAU,CAAC,WAAW,OAAO,YAAY,SAAS;GACpD,YAAY,KAAK,GAAG,OAAO,WAAW;GACtC,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;GAEhC,eAAe,IAAI,QAAQ;GAC3B;EACF;EAGA,IAAI;GACF,MAAM,SAAS,UAAU,UAAU,IAAI;GACvC,IAAI,CAAC,QAAQ;GAEb,MAAM,IAAI,UAAU;IAClB;IACA,iBAAiB;IACjB,UAAU,OAAO;IACjB,aAAa,OAAO;GACtB,CAAC;GAED,YAAY,KAAK,GAAG,OAAO,WAAW;GACtC,KAAK,MAAM,KAAK,OAAO,UACrB,SAAS,OAAO,GAAG,WAAW;EAElC,SAAS,GAAG;GAGV,MAAM,OAAO,QAAQ;GACrB,YAAY,KAAK;IACf,OAAO;IACP,SAAS,QAAQ,SAAS,IAAI,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;IACvE,MAAM;GACR,CAAC;GACD;EACF;EACA,eAAe,IAAI,QAAQ;CAC7B;CAGA,KAAK,MAAM,OAAO,MAAM,KAAK,GAC3B,IAAI,CAAC,aAAa,IAAI,GAAG,GACvB,MAAM,OAAO,GAAG;CAKpB,IAAI,MAAM,SAAS,MAAM,CAAC,MAAM,SAAS,MAAM,MAAM,EAAE,SAAS,YAAY,GAC1E,aAAa,OAAO;EAAE,MAAM;EAAc,MAAM,CAAC;EAAG,MAAM,MAAM;CAAK,GAAG,WAAW;AAEvF;;;;ACnaA,SAAgB,QAAQ,MAAsB;CAC5C,OAAO,KAAK,QAAQ,wBAAwB,MAAM;AACpD;;AAGA,SAAgB,aAAa,UAAkB,OAAwC;CACrF,OAAO,kBAAkB,CAAC;EAAE,MAAM;EAAQ,MAAM;EAAU;CAAM,CAAC,CAAC;AACpE;;;;;AAMA,SAAgB,kBAAkB,OAAwC;CACxE,MAAM,yBAAS,IAAI,IAAkB;CACrC,OAAO,MACJ,KAAK,SAAS;EACb,IAAI,KAAK,SAAS,cAAc,KAAK,MAAM,WAAW,GAAG,OAAO,KAAK;EACrE,MAAM,EAAE,UAAU;EAClB,MAAM,UAAU,IAAI,OAAO,MAAM,KAAK,SAAS,IAAI,KAAK,QAAQ,EAAE,CAAC,CAAC,KAAK,GAAG,GAAG,GAAG;EAClF,OAAO,KAAK,KAAK,QAAQ,UAAU,OAAe,GAAG,WAAsB;GACzE,MAAM,OAAO,MAAM,MAAM,GAAG,MAAM,OAAO,OAAO,KAAA,CAAS;GACzD,IAAI,SAAS,KAAA,KAAc,KAAK,gBAAgB,WAAW,OAAO,IAAI,IAAI,GAAI,OAAO;GAErF,MAAM,SAAS,OAAO,MAAM;GAC5B,IAAI,KAAK,YAAY,KAAA,KAAa,OAAO,WAAW,YAAY,CAAC,KAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,OAAO;GACzG,OAAO,IAAI,IAAI;GACf,OAAO,KAAK,YAAY,KAAK;EAC/B,CAAC;CACH,CAAC,CAAC,CACD,KAAK,EAAE;AACZ;;;;;;;ACvDA,SAAgB,YAAY,WAAqB,aAAoC;CACnF,MAAM,4BAAY,IAAI,IAAY;CAClC,MAAM,WAAqB,CAAC;CAE5B,KAAK,MAAM,YAAY,WAAW;EAChC,IAAI,UAAU,IAAI,QAAQ,GAAG;EAE7B,MAAM,MAAM,kBAAkB,QAAQ;EACtC,IAAI,MAAqB;EAEzB,QAAQ,KAAR;GACE,KAAK;IACH,MAAM,iBAAiB,SAAS,UAAU,WAAW;IACrD;GACF,KAAK;IACH,MAAM,iBAAiB,UAAU,UAAU,WAAW;IACtD;GACF,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;IACH,MAAM,eAAe,QAAQ;IAC7B;GACF,SACE;EACJ;EAEA,IAAI,KAAK,SAAS,KAAK,GAAG;EAC1B,UAAU,IAAI,QAAQ;CACxB;CAEA,OAAO,SAAS,KAAK,IAAI;AAC3B;AAEA,SAAS,iBAAiB,KAAyB,UAAkB,aAA2C;CAC9G,MAAM,SAAS,SAAS,UAAU,WAAW,CAAC,CAAC,KAAK;CACpD,IAAI,OAAO,WAAW,GAAG,OAAO;CAOhC,OAAO,IAAI,IAAI,OAAO,GAJJ,IAAI,UAAU,QADjB,mBAAmB,QACM,CAAM,IAIjB,UAHZ,QAAQ,WAAW,oBAAoB,WAGR,IAFhC,QAAQ,WAAW,oBAAoB,MAAM,IAAI,mBAAmB,MAAM,EAE9B,IAAI,IAAI;AACtE;AAEA,SAAS,eAAe,UAAiC;CACvD,MAAM,SAAS,WAAW,QAAQ;CAClC,MAAM,SAAS,mBAAmB,QAAQ;CAC1C,MAAM,SAAS,gBAAgB,QAAQ,MAAM;CAC7C,MAAM,MAAM,kBAAkB,QAAQ;CACtC,MAAM,YAAY,iBAAiB,GAAG;CACtC,MAAM,OAAO,eAAe,GAAG;CAE/B,OAAO,cAAc,OAAO,kDAAkD,gBAAgB,MAAM,EAAE,uBAAuB,UAAU,UAAU,OAAO,aAAa,KAAK;AAC5K;;;;;AAMA,SAAgB,gBAAgB,aAAuB,UAAmB,aAAoC;CAC5G,MAAM,QAAkB,CAAC;CAEzB,IAAI,YAAY,SAAS,GAAG;EAC1B,MAAM,UAAU,YAAY,aAAa,WAAW,CAAC,CAAC,KAAK;EAC3D,IAAI,QAAQ,SAAS,GAAG,MAAM,KAAK,OAAO;CAC5C;CAEA,IAAI,UACF,IAAI;EACF,MAAM,SAAS,SAAS,UAAU,WAAW,CAAC,CAAC,KAAK;EACpD,IAAI,OAAO,SAAS,GAAG,MAAM,KAAK,MAAM;CAC1C,SAAS,GAAG;EACV,aAAa,KAAK;GAChB,OAAO;GACP,SAAS,6BAA6B,SAAS,KAAK,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;EAC/F,CAAC;CACH;CAGF,OAAO,MAAM,KAAK,IAAI;AACxB;;;;;;;;;;;;;AAqBA,SAAgB,UAAU,SAAiB,OAA0B,OAA8B;CACjG,IAAI,QAAQ,WAAW,GAAG,OAAO;EAAE,MAAM,KAAA;EAAW,aAAa,CAAC;CAAE;CACpE,MAAM,QAAQ,MAAM,KAAK,UAAU;EAAE;EAAM,MAAM,aAAa,IAAI;CAAE,EAAE;CACtE,IAAI,MAAM,MAAM,EAAE,WAAW,KAAK,gBAAgB,KAAA,CAAS,GACzD,OAAO;EAAE,MAAM,UAAU,qBAAqB,eAAe,OAAO;EAAG,aAAa,CAAC;CAAE;CAEzF,IAAI,MAAM,MAAM,EAAE,WAAW,KAAK,cAAc,KAAA,CAAS,GAAG;EAC1D,MAAM,UAAU,GAAG,MAAM;EACzB,OAAO;GAAE,MAAM,UAAU,mBAAmB,aAAa,OAAO;GAAG,aAAa,CAAC;IAAE,OAAO;IAAW;GAAQ,CAAC;EAAE;CAClH;CAEA,OAAO;EAAE,MAAM,KAAA;EAAW,aAAa,CAAC;GAAE,OAAO;GAAW,SAAA,GADzC,MAAM;EAC2C,CAAC;CAAE;AACzE;;AAGA,MAAM,sBAAsB;;AAE5B,MAAM,oBAAoB;;AAS1B,MAAM,oCAAyC,IAAI,IAAI;CAAC;CAAU;CAAS;CAAY;AAAO,CAAC;AAE/F,MAAM,WAAW,MAAmC,MAAM,OAAO,MAAM,OAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM;AACjH,MAAM,YAAY,MAAmC,MAAM,KAAA,KAAa,aAAa,KAAK,CAAC;;;;;;AAO3F,SAAgB,aAAa,MAAwB;CACnD,MAAM,EAAE,aAAa,cAAc,SAAS,IAAI;CAChD,OAAO;EAAE;EAAa;CAAU;AAClC;;;;;AAMA,SAAgB,iBAAiB,MAAkC;CACjE,OAAO,SAAS,IAAI,CAAC,CAAC;AACxB;AAEA,SAAS,SAAS,MAAwE;CACxF,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,IAAI;CAER,OAAO,IAAI,KAAK,QAAQ;EACtB,MAAM,KAAK,KAAK,QAAQ,KAAK,CAAC;EAC9B,IAAI,OAAO,IAAI;EACf,MAAM,OAAO,KAAK,KAAK;EACvB,IAAI,KAAK,WAAW,QAAQ,EAAE,GAAG;GAC/B,MAAM,MAAM,KAAK,QAAQ,OAAO,KAAK,CAAC;GACtC,IAAI,QAAQ,KAAK,KAAK,SAAS,MAAM;EACvC,OAAO,IAAI,SAAS,OAAO,SAAS,KAAK;GAEvC,MAAM,MAAM,KAAK,QAAQ,KAAK,EAAE;GAChC,IAAI,QAAQ,KAAK,KAAK,SAAS,MAAM;EACvC,OAAO,IAAI,SAAS,OAAO,SAAS,KAAK,KAAK,EAAE,GAAG;GACjD,MAAM,EAAE,MAAM,QAAQ,QAAQ,MAAM,KAAK,CAAC;GAC1C,IAAI,SAAS,UAAU,gBAAgB,KAAA,GAAW,cAAc;GAChE,IAAI;EACN,OAAO,IAAI,SAAS,IAAI,GAAG;GACzB,MAAM,EAAE,MAAM,QAAQ,QAAQ,MAAM,KAAK,CAAC;GAC1C,IAAI,SAAS,UAAU,cAAc,KAAA,GAAW,YAAY;GAC5D,IAAI,SAAS,UAAU,iBAAiB,KAAA,GAAW,eAAe;GAClE,IAAI,kBAAkB,IAAI,IAAI,IAAI,WAAW,MAAM,MAAM,GAAG,IAAI;EAClE,OACE,IAAI,KAAK;EAEX,IAAI,gBAAgB,KAAA,KAAa,cAAc,KAAA,GAAW;CAC5D;CAEA,OAAO;EAAE;EAAa;EAAW;CAAa;AAChD;;AAGA,SAAS,QAAQ,MAAc,MAA6C;CAC1E,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,UAAU,CAAC,QAAQ,KAAK,EAAE,KAAK,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK;CACnF,MAAM,OAAO,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,YAAY;CAE7C,OAAO,IAAI,KAAK,UAAU,KAAK,OAAO,KAAK;EACzC,IAAI,KAAK,OAAO,KAAK;GACnB;GACA;EACF;EACA;EACA,OAAO,QAAQ,KAAK,EAAE,GAAG;EACzB,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,QAAO,UAAU,KAAK;GAClC,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,CAAC;GACvC,IAAI,UAAU,KAAK,KAAK,SAAS,QAAQ;EAC3C;CACF;CACA,OAAO;EAAE;EAAM,KAAK,KAAK,IAAI,IAAI,GAAG,KAAK,MAAM;CAAE;AACnD;;AAGA,SAAS,WAAW,MAAc,MAAc,MAAsB;CACpE,MAAM,QAAQ,IAAI,OAAO,KAAK,KAAK,wBAAwB,IAAI;CAC/D,MAAM,YAAY;CAClB,OAAO,MAAM,KAAK,IAAI,CAAC,EAAE,SAAS,KAAK;AACzC;;;;;AAMA,SAAS,UAAU,SAAiB,OAAoC,SAA+B;CACrG,MAAM,wBAAQ,IAAI,IAAgC;CAClD,MAAM,YAAY,SAAqC;EACrD,IAAI,CAAC,MAAM,IAAI,IAAI,GAAG,MAAM,IAAI,MAAM,aAAa,IAAI,CAAC,CAAC,MAAM;EAC/D,OAAO,MAAM,IAAI,IAAI;CACvB;CACA,OAAO;EACL;EACA,aAAa;EACb,cAAc,UAAU,GAAG,QAAQ,IAAI;EACvC,UAAU,MAAM,WAAW,SAAS,IAAI,MAAM;CAChD;AACF;;;;;;;;;;AC7OA,MAAM,eAAe;;AAGrB,SAAgB,mBAAmB,UAAsC;CACvE,IAAI,MAAM;CACV,SAAS;EACP,IAAI;GACF,MAAM,MAAM,KAAK,MAAM,aAAa,KAAK,KAAK,cAAc,GAAG,OAAO,CAAC;GACvE,IAAI,IAAI,SAAS,gBAAgB,OAAO,IAAI,YAAY,UAAU,OAAO,IAAI;EAC/E,QAAQ,CAER;EACA,MAAM,SAAS,QAAQ,GAAG;EAC1B,IAAI,WAAW,KAAK,OAAO,KAAA;EAC3B,MAAM;CACR;AACF;;AAGA,SAAS,YAAoB;CAC3B,OAAO,OAAO,cAAc,WAAW,YAAY,QAAQ,cAAc,YAAY,GAAG,CAAC;AAC3F;AAEA,MAAa,UAAkB,mBAAmB,UAAU,CAAC,KAAK;;;ACPlE,MAAMC,iBAAe;AAErB,SAAgB,gBACd,OACA,WACA,SACQ;CACR,OAAO,mBAAmB,OAAO,WAAW,OAAO,IAAI;AACzD;;;;;;;;;AAUA,SAAgB,aACd,OACA,QACA,WACA,SACQ;CACR,MAAM,OAAO,WAAW,MAAM,IAAI;CAClC,MAAM,WAAW,iBAAiB,QAAQ,SAAS,WAAW;CAC9D,MAAM,YAAY,UAAU,SAAS,QAAQ,IAAI,CAAC,QAAQ,GAAG,iBAAiB,OAAO,KAAK,IAAI,OAAO,SAAS;CAC9G,SAAS,aAAa,KAAK,GAAG,UAAU,WAAW;CACnD,MAAM,OAAO,UAAU;CAcvB,OAAO,aAAa,UAAU;EAZ5B;GAAE,SAAS,QAAQ,gBAAgB;GAAG,aAAa;GAAO,mBAAmB;EAAK;EAClF;GACE,SAAS,QAAQ,gBAAgB;GACjC,aAAa;GACb,mBAAmB;IAGjB,OAAO,mBAAmB;KADV,GAAG;KAAO,QAAQ;MAAE,GAAG,MAAM;MAAQ,QAAQ,OAAO;MAAM,eAAe,OAAO;KAAQ;IAC1E,GAAG,WAAW,OAAO;GACrD;EACF;EACA,GAAI,SAAS,KAAA,IAAY,CAAC,IAAI,CAAC,IAAI;CAEP,CAAK;AACrC;AAEA,MAAM,gBAAwC;CAAC;CAAiB;CAAU;AAAY;;;;;AAMtF,SAAgB,sBAAsB,OAAsB,GAAiD;CAC3G,IAAI,EAAE,SAAS,gBAAgB,EAAE,SAAS,aAAa,OAAO;EAAE,MAAM;EAAgB,MAAM,EAAE;CAAK;CACnG,MAAM,MAAM,cAAc,MAAM,MAAM,OAAO,GAAG,CAAC,CAAC;CAClD,IAAI,QAAQ,KAAA,GAAW,OAAO;EAAE,MAAM;EAAO;CAAI;CAEjD,IAAI,EAAE,SAAS,mBAAmB,MAAM,OAAO,SAAS,SAAS,GAAG,OAAO,EAAE,MAAM,uBAAuB;AAE5G;AAEA,SAAS,mBACP,OACA,WACA,SACQ;CACR,MAAM,QAAkB,CAAC;CACzB,IAAI,UAAU;CACd,IAAI,MAAM;CAGV,MAAM,UAA6B,CAAC;CACpC,MAAM,cAAiC,CAAC;CACxC,KAAK,MAAM,KAAK,MAAM,UAAU;EAC9B,IAAI,OAAO,GAAG,eAAe,GAAG;EAChC,IAAI,OAAO,GAAG,QAAQ,GAAG,QAAQ,KAAK,CAAC;OAClC,IAAI,OAAO,GAAG,YAAY,GAAG,YAAY,KAAK,CAAC;CACtD;CAGA,IAAI,eAAe;CACnB,IAAI,YAAY,WAAW,GACzB,eAAe,YAAY,EAAE,EAAE,QAAQ;MAClC,IAAI,YAAY,SAAS,GAAG;EACjC,IAAI,OAAO;EACX,KAAK,MAAM,KAAK,aAAa;GAC3B,IAAI,OAAO,KAAK,CAAC,aAAa,SAAS,IAAI,GAAG,gBAAgB;GAC9D,gBAAgB,6BAA6B,KAAK,KAAK,gBAAgB,EAAE,IAAI,EAAE;GAC/E,gBAAgB,EAAE;GAClB;EACF;CACF;CACA,MAAM,KACJ,6EAA6E,mBAAmB,YAAY,EAAE,SAChH;CAGA,IAAI,gBAAgB;CACpB,IAAI,QAAQ,WAAW,GACrB,gBAAgB,QAAQ,EAAE,EAAE,QAAQ;MAC/B,IAAI,QAAQ,SAAS,GAAG;EAC7B,IAAI,OAAO;EACX,KAAK,MAAM,KAAK,SAAS;GACvB,IAAI,OAAO,KAAK,CAAC,cAAc,SAAS,IAAI,GAAG,iBAAiB;GAChE,iBAAiB,yBAAyB,KAAK,KAAK,gBAAgB,EAAE,IAAI,EAAE;GAC5E,iBAAiB,EAAE;GACnB;EACF;CACF;CACA,MAAM,KACJ,6EAA6E,oBAAoB,aAAa,EAAE,WAClH;CAGA,MAAM,iCAAiB,IAAI,IAAI;EAAC;EAAQ;EAAO;EAAU;EAAU;EAAS;EAAQ;CAAQ,CAAC;CAC7F,MAAM,kBAAkB;CACxB,KAAK,MAAM,CAAC,KAAK,UAAU,MAAM,OAAO,WACtC,IAAI,eAAe,IAAI,KAAK,KAAK,gBAAgB,KAAK,KAAK,GACzD,MAAM,KAAK,iBAAiB,WAAW,GAAG,EAAE,WAAW,WAAW,KAAK,EAAE,YAAY;CAKzF,MAAM;CACN,KAAK,MAAM,KAAK,MAAM,UAAU;EAC9B,IAAI,sBAAsB,OAAO,CAAC,MAAM,KAAA,GAAW;EAEnD,MAAM,KAAK,qBAAqB,GAAG,KAAK,OAAO,CAAC;EAChD,IAAI,cAAc,EAAE,MAClB,UAAU,OAAO,GAAG;EAEtB;CACF;CAGA,MAAM,OAAiB,CAAC;CACxB,KAAK,MAAM,CAAC,KAAK,QAAQ,MAAM,OAAO,SACpC,IAAI,KAAK,KAAK,KAAK,GAAG;CAExB,MAAM,aAAa,KAAK,KAAK,GAAG;CAGhC,MAAM,OAAO,OAAO,MAAM,OAAO,IAAI;CAWrC,OAAO,eARU,oBAAoB,MAAM,IAAI,EAAE,4BACxB,WAAW,MAAM,IAAI,EAAE,eAAe,WAAW,OAAO,EAAE,aACrE,WAAWA,cAAY,EAAE,qBAAqB,WAAW,OAAO,EAAE,UACrE,WAAW,MAAM,IAAI,EAAE,UAAU,WAAW,IAAI,EAAE,YAChD,WAAW,MAAM,OAAO,MAAM,EAAE,oBACxB,WAAW,MAAM,OAAO,aAAa,EAAE,aAC9C,WAAW,UAAU,EAAE,UAAU,WAAW,MAAM,OAAO,IAAI,EAAE,aAE5D,MAAM,KAAK,EAAE,IAAI;AACpC;;;;;;;ACrKA,MAAMC,iBAAe;AAErB,SAAgB,gBAAgB,OAAsB,YAA4B;CAChF,MAAM,EAAE,MAAM,UAAU,sBAAsB,KAAK;CACnD,OAAO,kCAAkC,MAAM,IAAI,KAAK;AAC1D;;;;;;;;;AAUA,SAAgB,aACd,OACA,QACA,WACA,SACQ;CACR,MAAM,YAAY,QAAQ,OAAO,QAAQ;CACzC,MAAM,YAAY,QAAQ,SAAS;CACnC,MAAM,cAAc,SAAS;CAC7B,IAAI,WAAW,iBAAiB,QAAQ,WAAW;CACnD,MAAM,EAAE,MAAM,UAAU,sBAAsB,KAAK;CAGnD,WAAW,oBAAoB,UAAU,gBAAc,KAAK,WAAW,YAAY,GAAG,OAAO,WAAW;CACxG,WAAW,oBAAoB,UAAU,cAAY,KAAK,WAAW,WAAW,GAAG,MAAM,WAAW;CACpG,WAAW,oBAAoB,UAAU,iBAAe,KAAK,WAAW,SAAS,GAAG,MAAM,WAAW;CACrG,WAAW,oBAAoB,UAAU,aAAW,KAAK,WAAW,SAAS,GAAG,MAAM,WAAW;CAEjG,IAAI,MAAM,OAAO,SAAS,IAAI,QAAQ,MAAM,MAC1C,WAAW,oBAAoB,UAAU,cAAY,KAAK,WAAW,WAAW,GAAG,MAAM,WAAW;CAEtG,IAAI,MAAM,OAAO,SAAS,IAAI,WAAW,MAAM,MAC7C,WAAW,oBAAoB,UAAU,iBAAe,KAAK,WAAW,cAAc,GAAG,MAAM,WAAW;CAI5G,MAAM,UAAU,CAAC,SAAS,SAAS,WAAS;CAC5C,MAAM,SAAS,UAAU,WAAW,WAAW,WAAW,IAAI;CAG9D,MAAM,aAAa,WAAW,OAAA,CAAQ,SAAS,wBAAsB,IACjE,2BACA;CACJ,MAAM,WAAW,oBAAoB,MAAM,IAAI;CAC/C,MAAM,OAAiC,MAAM,OACzC;EAAE,SAAS,QAAQ,SAAS;EAAG,aAAa;EAAS,cAAc,QAAQ,eAAe,SAAS,QAAQ;CAAM,IACjH,KAAA;CACJ,MAAM,YAAY,UAChB,SAAS,QAAQ,IACjB,UAAU,CAAC,UAAU,MAAM,IAAI,CAAC,QAAQ,GACxC,iBAAiB,OAAO,KAAK,EAC/B;CACA,aAAa,KAAK,GAAG,UAAU,WAAW;CAC1C,MAAM,OAAO,CAAC,MAAM,UAAU,IAAI,CAAC,CAAC,QAAQ,SAAS,SAAS,KAAA,CAAS;CAIvE,MAAM,eAAe,cAAc,UAAU,KAAK;CAClD,MAAM,QAAiC;EACrC,UAAU,eAAa,iBAAiBA,eAAa,IAAI,SAAS;EAClE,UAAU,YAAU,6BAAY,IAAI,KAAK,EAAA,CAAE,YAAY,GAAG;EAC1D,UAAU,gBAAc,IAAI,eAAe,YAAY,EAAE,EAAE;EAC3D,UAAU,kBAAgB,IAAI,MAAM,EAAE;EACtC,UAAU,aAAW,IAAI;EACzB,GAAG;CACL;CAEA,OAAO,kBACL,UACI;EACE;GAAE,MAAM;GAAQ,MAAM;GAAU;EAAM;EACtC;GAAE,MAAM;GAAY,MAAM;EAAK;EAC/B;GAAE,MAAM;GAAQ,MAAM;GAAQ,OAAO;EAAK;CAC5C,IACA,CAAC;EAAE,MAAM;EAAQ,MAAM;EAAU;CAAM,CAAC,CAC9C;AACF;;AAGA,SAAS,UAAU,OAAe,OAA6B;CAC7D,OAAO;EAAE,SAAS,QAAQ,KAAK;EAAG,aAAa;EAAS,mBAAmB;CAAM;AACnF;;AAGA,SAAS,WAAW,WAAmB,aAA+C;CACpF,IAAI;EACF,OAAO,SAAS,KAAK,WAAW,aAAa,GAAG,WAAW;CAC7D,QAAQ;EACN,OAAO;CACT;AACF;;;;AAKA,SAAgB,sBAAsB,GAAiD;CACrF,OAAO,OAAO,GAAG,eAAe,IAAI;EAAE,MAAM;EAAO,KAAK;CAAgB,IAAI,KAAA;AAC9E;AAEA,SAAS,sBAAsB,OAAuD;CACpF,MAAM,iBAAiB,MAAM,OAAO,SAAS,IAAI,WAAW,MAAM;CAClE,IAAI,OAAO;CACX,IAAI,QAAQ;CAEZ,KAAK,MAAM,KAAK,MAAM,UAAU;EAC9B,IAAI,sBAAsB,CAAC,MAAM,KAAA,GAAW;EAC5C;EACA,QAAQ,iBAAiB,GAAG,OAAO,cAAc;CACnD;CAEA,OAAO;EAAE;EAAM;CAAM;AACvB;AAEA,SAAS,oBACP,UACA,aACA,eACA,UACA,aACQ;CACR,IAAI,CAAC,SAAS,SAAS,WAAW,GAAG,OAAO;CAC5C,IAAI;EACF,MAAM,UAAU,SAAS,eAAe,WAAW;EACnD,OAAO,SAAS,QAAQ,mBAAmB,OAAO;CACpD,SAAS,GAAG;EACV,IAAI,UACF,MAAM,IAAI,MACR,wCAAwC,cAAc,IAAI,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,GACrG;EAEF,OAAO;CACT;AACF;;;;;;;;;;;;;;ACrIA,SAAgB,OACd,OACA,SACA,UAAoF,CAAC,GAC7E;CACR,MAAM,UAAU,uBAAuB,OAAO,QAAQ,gBAAgB,KAAK,CAAC,CAAC,KAAK,MAAM,cAAc,GAAG,OAAO,CAAC;CACjH,QAAQ,aAAa,KAAK,GAAG,QAAQ,SAAS,EAAE,kBAAkB,WAAW,CAAC;CAC9E,OAAO,QAAQ,KAAK,EAAE,cAAc,cAAc,SAAS,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE;AAC9E;AAEA,SAAS,uBAAuB,OAAsB,cAAmD;CACvG,MAAM,YAA6B;EAAE,MAAM;EAAa,MAAM,CAAC;EAAG,MAAM,iBAAiB,KAAK;CAAE;CAChG,MAAM,QAAQ,MAAM,SAAS,WAAW,MAAM,EAAE,SAAS,WAAW;CACpE,IAAI,UAAU,IACZ,OAAO,MAAM,SAAS,KAAK,GAAG,MAAO,MAAM,SAAS,gBAAgB,EAAE,IAAI,IAAI;EAAE,GAAG;EAAG,MAAM,UAAU;CAAK,IAAI,CAAE;CAEnH,IAAI,CAAC,cAAc,OAAO,MAAM;CAEhC,MAAM,KAAK,MAAM,SAAS,EAAE,EAAE,SAAS,eAAe,IAAI;CAC1D,OAAO;EAAC,GAAG,MAAM,SAAS,MAAM,GAAG,EAAE;EAAG;EAAW,GAAG,MAAM,SAAS,MAAM,EAAE;CAAC;AAChF;;AAGA,SAAS,gBAAgB,MAAuB;CAC9C,OAAO,mBAAmB,YAAY,GAAG,IAAI,MAAM;AACrD;;AASA,MAAM,mBAAmB;;;;;;;;;;;;;AAczB,SAAS,cAAc,GAAoB,SAAqC;CAC9E,MAAM,QAAQ,WAAW,KAAK,UAAU,EAAE,IAAI;CAC9C,MAAM,cAA4B,CAAC;CACnC,MAAM,QAAQ,YAA0B;EACtC,YAAY,KAAK;GACf,OAAO;GACP,SAAS,GAAG,MAAM,uDAAuD,QAAQ;EACnF,CAAC;CACH;CAEA,IAAI,EAAE,KAAK,KAAK,MAAM,IAAI,KAAK,mBAAmB;MAC7C,IAAI,EAAE,KAAK,KAAK,MAAM,EAAE,MAAM,KAAK,+DAA+D;CACvG,IAAI,SAAS,KAAK,EAAE,IAAI,GAAG,KAAK,6DAA6D;CAC7F,IAAI,YAAY,WAAW,iBAAiB,KAAK,EAAE,IAAI,GACrD,KAAK,+EAAqE;CAG5E,KAAK,MAAM,OAAO,EAAE,MAAM;EACxB,IAAI,QAAQ,MAAM,KAAK,KAAK,GAAG,GAC7B,KAAK,WAAW,KAAK,UAAU,GAAG,EAAE,uDAAuD;EAE7F,IAAI,YAAY,WAAW,iBAAiB,KAAK,GAAG,GAClD,KAAK,WAAW,KAAK,UAAU,GAAG,EAAE,4DAA4D;CAEpG;CAGA,MAAM,QAAQ,EAAE,KAAK,MAAM,YAAY;CACvC,MAAM,cAAc,MAAM,SAAS,MAAM,MAAO,IAAI,MAAM,KAAK,KAAK,WAAW,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAE;CACxG,IAAI,YAAY,WAAW,GAAG,OAAO;EAAE,SAAS;EAAG;CAAY;CAE/D,MAAM,QAAQ,GAAG,YAAY,WAAW,IAAI,SAAS,QAAQ,GAAG,YAAY,KAAK,IAAI,EAAE,oBAAoB,YAAY,WAAW,IAAI,MAAM,GAAG;CAC/I,IAAI,CAAC,EAAE,KAAK,MAAM,QAAQ,QAAQ,gBAAgB,QAAQ,QAAQ,GAAG;EACnE,KAAK,KAAK;EACV,OAAO;GAAE,SAAS;GAAG;EAAY;CACnC;CACA,YAAY,KAAK;EACf,OAAO;EACP,SAAS,GAAG,MAAM,IAAI,MAAM,IAAI,YAAY,WAAW,IAAI,WAAW,YAAY;CACpF,CAAC;CACD,MAAM,OAAO,MAAM,KAAK,MAAM,MAAO,IAAI,MAAM,KAAK,KAAK,WAAW,IAAI,IAAI,IAAI,SAAS,IAAK,CAAC,CAAC,KAAK,EAAE;CACvG,OAAO;EAAE,SAAS;GAAE,GAAG;GAAG;EAAK;EAAG;CAAY;AAChD;;;;;;;ACjGA,SAAgB,gBACd,OACA,SACA,QAC6B;CAC7B,QAAQ,QAAR;EACE,KAAK,UACH,OAAO,sBAAsB,OAAO,OAAO;EAC7C,KAAK,UACH,OAAO,sBAAsB,OAAO;EACtC,SAEE,MAAM,IAAI,MAAM,oCAAoC,OAAOC,MAAW,GAAG;CAE7E;AACF;;AAGA,SAAgB,iBAAiB,UAAmC;CAClE,QAAQ,SAAS,MAAjB;EACE,KAAK,gBACH,OAAO,mBAAmB,SAAS,KAAK;EAC1C,KAAK,OACH,OAAO,cAAc,SAAS,IAAI;EACpC,KAAK,wBACH,OAAO;EACT,SAEE,MAAM,IAAI,MAAM,+BAA+B,KAAK,UAAUA,QAAW,GAAG;CAEhF;AACF;;;;;;;AChCA,SAAgB,wBACd,OACA,WACA,QACuB;CACvB,MAAM,UAAU,MAAM,SAAS,MAAM,MAAM,EAAE,SAAS,SAAS;CAC/D,IAAI,YAAY,KAAA,GACd,OAAO,CAAC;EAAE,OAAO;EAAS,SAAS,qBAAqB,UAAU;CAAc,CAAC;CAEnF,MAAM,WAAW,gBAAgB,OAAO,SAAS,MAAM;CACvD,IAAI,aAAa,KAAA,GAAW,OAAO,CAAC;CACpC,OAAO,CACL;EACE,OAAO;EACP,SAAS,qBAAqB,UAAU,IAAI,iBAAiB,QAAQ,EAAE;CACzE,CACF;AACF;;;ACOA,MAAM,eAAe;AAErB,MAAM,oBAAoB;AAC1B,MAAM,qBAAqB;AAE3B,IAAa,cAAb,cAAiC,MAAM;CAG5B;CAFT,YACE,SACA,cAAmC,CAAC,GACpC;EACA,MAAM,OAAO;EAFN,KAAA,cAAA;EAGP,KAAK,OAAO;CACd;AACF;;;;;;;;;;;;;AAiCA,eAAsB,qBACpB,SACA,SACA,OACwB;CACxB,OAAO,YAAY,SAAS,OAAO,KAAA,GAAW,OAAO;AACvD;;;;;;;AAqLA,eAAe,YACb,SACA,OACA,cACA,SACwB;CACxB,MAAM,UAAU,eAAe,OAAO;CACtC,MAAM,cAA4B,CAAC;CACnC,MAAM,aAAyB,QAAQ,cAAc;CACrD,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,cAAc,QAAQ,eAAe;CAC3C,MAAM,WAAW,QAAQ,YAAY;CACrC,MAAM,WAAW,QAAQ,YAAY;CACrC,MAAM,aAAa,QAAQ,cAAc;CAEzC,QAAQ,QAAQ,eAAe;CAC/B,MAAM,UAAU,QAAQ;CACxB,IAAI,YAAY,KAAA,KAAa,EAAE,WAAW,IACxC,MAAM,IAAI,YAAY,0DAA0D,QAAQ,EAAE;CAI5F,gBAAgB;CAKhB,MAAM,SAAwB,CAAC;CAC/B,MAAM,gBAA0B,CAAC;CACjC,KAAK,MAAM,UAAU,QAAQ,SAAS;EACpC,MAAM,OAAO,OAAO,OAAO,SAAS;EACpC,IAAI,OAAO,WAAW,UAAU;GAC9B,IAAI,MAAM,SAAS,SAAS,KAAK,MAAM,KAAK,MAAM;QAC7C,OAAO,KAAK;IAAE,MAAM;IAAS,OAAO,CAAC,MAAM;GAAE,CAAC;EACrD,OAAO,IAAI,MAAM,SAAS,UACxB,KAAK,QAAQ,KAAK,MAAM;OAExB,OAAO,KAAK;GAAE,MAAM;GAAU,SAAS,CAAC,MAAM;EAAE,CAAC;CAErD;CAEA,MAAM,SAAS,OAAO,KAAK,UAAU;EACnC,IAAI,MAAM,SAAS,UAAU,OAAO;EACpC,MAAM,QAAQ,aAAa,MAAM,OAAO,SAAS,QAAQ,OAAO;EAChE,YAAY,KAAK,GAAG,MAAM,WAAW;EACrC,cAAc,KAAK,GAAG,MAAM,aAAa;EACzC,OAAO;GAAE,MAAM;GAAkB,WAAW,MAAM;EAAU;CAC9D,CAAC;CACD,oBAAoB,eAAe,WAAW;CAE9C,MAAM,aAAa,IAAI,IAAI,OAAO,SAAS,UAAW,MAAM,SAAS,UAAU,MAAM,YAAY,CAAC,CAAE,CAAC;CAGrG,MAAM,QAAQ,YAAY;CAC1B,MAAM,iCAAiB,IAAI,IAAY;CAEvC,KAAK,MAAM,SAAS,QAClB,IAAI,MAAM,SAAS,UACjB,kBAAkB,OAAO,MAAM,SAAS;EAAE;EAAM;CAAY,GAAG,WAAW;MACrE,IAAI,OACT,kBACE,OACA,MAAM,WACN;EAAE;EAAM;CAAY,GACpB,aACA,gBACA,OACA,cACA,UACF;MAEA,YAAY,OAAO,MAAM,WAAW;EAAE;EAAM;CAAY,GAAG,aAAa,cAAc;CAG1F,IAAI,SAAS,WAAW,SAAS,GAC/B,kBAAkB,OAAO,CAAC,GAAG;EAAE;EAAM;CAAY,GAAG,aAAa,gBAAgB,OAAO,YAAY;CAItG,IAAI,QAAQ,YACV,MAAM,WAAW,gBAAgB,MAAM,UAAU,QAAQ,UAAU;CAKrE,IAAI;CAEJ,IAAI,eAAe,QAAQ;EAOzB,SAAS,MAAM,mBANC,iBACd,QAAQ,UACR,MAAM,OAAO,QACb,MAAM,OAAO,eACb,iBAEgC,GAAS;GAAE,GAAG;GAAS;EAAS,GAAG,WAAW;EAEhF,QAAQ,QAAQ,eAAe;CACjC;CAIA,IAAI,QAAQ,cAAc,MAAM,OAAO,QAAQ,QAAQ;CACvD,MAAM,YAAY,MAAM,OAAO,SAAS;CAGxC,IAAI,UACF,MAAM,OAAO,QAAQ,IAAI,SAAS,IAAI;CAIxC,WAAW,OAAO,WAAW;CAG7B,IAAI;CAEJ,QAAQ,YAAR;EACE,KAAK;EACL,KAAK;GAEH,SAAS,OAAO,OAAO,YAAY;IAAE,cAAc,QAAQ,QAAQ,YAAY,KAAK;IAAU;GAAY,CAAC;GAC3G;EAEF,KAAK;GACH,SAAS,gBAAgB,OAAO,WAAW,EAAE,WAAW,CAAC;GACzD;EAEF,KAAK;GACH,SAAS,gBAAgB,OAAO,SAAS;GACzC;EAEF,KAAK;GACH,SAAS,YAAY,KAAK;GAC1B;EAEF,KAAK,QAAQ;GAEX,YAAY,KAAK,GAAG,wBAAwB,OAAO,WAAW,QAAQ,aAAa,QAAQ,WAAW,QAAQ,CAAC;GAE/G,IAAI,CAAC,QACH,MAAM,IAAI,YAAY,8CAA8C,WAAW;GAGjF,IAAI,CAAC,OAAO,YAAY,MAAM,SAAS,MAAM,CAAC,SAAS,OAAO,YAAY,GACxE,YAAY,KAAK;IACf,OAAO;IACP,SAAS;GACX,CAAC;GAIH,MAAM,UAAU,aAAa,QAAQ,WAAW,CAAC,GAAG,OAAO;GAC3D,YAAY,KAAK,GAAG,QAAQ,WAAW;GACvC,MAAM,EAAE,aAAa;GACrB,MAAM,eAAe,aAAa,KAAA,KAAa,YAAY,OAAO,CAAC,CAAC,OAAO,WAAW,QAAQ,CAAC;GAC/F,oBAAoB,CAAC,GAAG,QAAQ,eAAe,GAAI,eAAe,CAAC,QAAQ,IAAI,CAAC,CAAE,GAAG,WAAW;GAChG,MAAM,OAAO,gBAAgB,QAAQ,WAAW,QAAQ,UAAU,WAAW;GAE7E,SAAS,OAAO,WACZ,aAAa,OAAO,QAAQ,WAAW;IAAE;IAAY;IAAM;GAAY,CAAC,IACxE,aAAa,OAAO,QAAQ,WAAW;IAAE;IAAM;GAAY,CAAC;GAChE;EACF;EAEA,SAEE,MAAM,IAAI,YAAY,0BAA0BC,cAAyB,WAAW;CAExF;CAGA,MAAM,QAAsB;EAC1B,GAAG,cAAc,OAAO,QAAQ,eAAe;EAC/C,OAAO,CAAC,GAAG,cAAc;CAC3B;CAGA,QAAQ,QAAQ,eAAe;CAC/B,OAAO;EAAE;EAAQ;EAAO;EAAQ;EAAa;CAAM;AACrD;;;;;;AAWA,SAAS,oBAAoB,OAA0B,aAA0C;CAC/F,MAAM,CAAC,SAAS;CAChB,IAAI,UAAU,KAAA,GAAW;CACzB,MAAM,IAAI,YAAY,QAAQ,MAAM,2CAA2C,CAAC,GAAG,WAAW,CAAC;AACjG;AAEA,SAAS,WAAW,OAAc,aAAiC;CACjE,IAAI,MAAM,SAAS,IAAI;CAEvB,IAAI,MAAM,eAAe,IAAI;EAC3B,MAAM,OAAO,MAAM;EACnB,YAAY,KAAK;GACf,OAAO;GACP,SAAS;EACX,CAAC;CACH,OAAO;EACL,MAAM,OAAO,aAAa;EAC1B,MAAM,OAAO;EACb,YAAY,KAAK;GACf,OAAO;GACP,SAAS,6DAA6D,KAAK;EAC7E,CAAC;CACH;AACF;;;;;AAMA,SAAS,YAAY,OAAsB;CAEzC,MAAM,UAAoB,CAAC;CAC3B,MAAM,cAAwB,CAAC;CAC/B,MAAM,gBAAqG,CAAC;CAE5G,KAAK,MAAM,KAAK,MAAM,UAAU;EAC9B,IAAI,EAAE,SAAS,gBAAgB,EAAE,SAAS,aAAa;EACvD,IAAI,OAAO,GAAG,eAAe,GAAG;EAEhC,IAAI,OAAO,GAAG,QAAQ,GACpB,QAAQ,KAAK,EAAE,IAAI;OACd,IAAI,OAAO,GAAG,YAAY,GAC/B,YAAY,KAAK,EAAE,IAAI;OAClB;GACL,MAAM,QAA2F;IAC/F,MAAM,EAAE;IACR,MAAM,EAAE;IACR,MAAM,EAAE;GACV;GACA,IAAI,EAAE,UAAU;IACd,MAAM,OAA+B,CAAC;IACtC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,EAAE,QAAQ,GAClD,IAAI,OAAO,UAAU,UAAU,KAAK,OAAO;IAE7C,IAAI,OAAO,KAAK,IAAI,CAAC,CAAC,SAAS,GAC7B,MAAM,WAAW;GAErB;GACA,cAAc,KAAK,KAAK;EAC1B;CACF;CAEA,MAAM,MAA+B,EACnC,MAAM,MAAM,KACd;CAEA,IAAI,MAAM,MAAM,IAAI,OAAO,MAAM;CACjC,IAAI,MAAM,OAAO,QAAQ,IAAI,SAAS,MAAM,OAAO;CACnD,IAAI,MAAM,OAAO,eAAe,IAAI,oBAAoB,MAAM,OAAO;CACrE,IAAI,MAAM,OAAO,OAAO,IAAI,QAAQ,MAAM,OAAO;CACjD,IAAI,MAAM,OAAO,UAAU,OAAO,GAAG,IAAI,gBAAgB,OAAO,YAAY,MAAM,OAAO,SAAS;CAClG,IAAI,MAAM,OAAO,SAAS,GAAG,IAAI,OAAO,MAAM,OAAO;CACrD,IAAI,UAAU;CACd,IAAI,qBAAqB;CACzB,IAAI,QAAQ,YAAY,KAAK,IAAI;CACjC,IAAI,SAAS,QAAQ,KAAK,IAAI;CAC9B,IAAI,WAAW;CAEf,OAAO,KAAK,UAAU,KAAK,MAAM,CAAC;AACpC;;;AC5gBA,SAAgB,iBAAiB,GAAiC;CAIhE,OAAO,GAHO,EAAE,OAAO,GAAG,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,SAAS,GAAG,MAAM,KAEpD,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,QAAQ,eAAe,EAAE,IAAI,EAAE;AAE9E;;AAGA,SAAgB,iBAAiB,QAA+C;CAC9E,MAAM,SAAS,OAAO,YAAY,QAAQ,MAAM,EAAE,UAAU,OAAO;CACnE,IAAI,OAAO,WAAW,GAAG,OAAO,OAAO,YAAY,QAAQ,MAAM,EAAE,UAAU,SAAS;CACtF,MAAM,QAAsB,IAAI,MAAM,OAAO,IAAI,gBAAgB,CAAC,CAAC,KAAK,IAAI,CAAC;CAC7E,MAAM,CAAC,SAAS;CAChB,IAAI,OAAO,MAAM;EACf,MAAM,KAAK,MAAM;EACjB,MAAM,MAAM;GAAE,MAAM,MAAM;GAAM,MAAM,MAAM,QAAQ;GAAG,QAAQ;EAAE;CACnE;CACA,MAAM;AACR;;AAGA,SAAgB,WAAW,GAA0B;CACnD,IAAI,aAAa,aAAa;EAC5B,MAAM,SAAS,EAAE,YAAY,QAAQ,MAAM,EAAE,UAAU,OAAO,CAAC,CAAC,IAAI,gBAAgB;EACpF,OAAO,IAAI,MAAM,CAAC,GAAG,QAAQ,EAAE,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC;CACpD;CACA,OAAO,aAAa,QAAQ,IAAI,IAAI,MAAM,OAAO,CAAC,CAAC;AACrD;;;;;;;;;;;;;;;AClBA,SAAgB,gBAAgB,QAAwB,UAAsC;CAC5F,MAAM,MAAM,OAAO,QAAQ,OAAO,SAAS,KAAA,IAAY,KAAA,IAAY,QAAQ,OAAO,IAAI;CACtF,OAAO,QAAQ,KAAA,IAAY,KAAA,IAAY,QAAQ,KAAK,QAAQ;AAC9D;;;;;;AAOA,SAAgB,gBAAgB,QAAmC;CACjE,QAAQ,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAM,EAAA,CAAG,SAAS,WAAsC;EAChG,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM,OAAO,CAAC;EAC3D,MAAM,EAAE,KAAK,SAAS;EACtB,MAAM,WAAW;GACf,GAAI,OAAO,QAAQ,WAAW,EAAE,IAAI,IAAI,CAAC;GACzC,GAAI,OAAO,SAAS,WAAW,EAAE,KAAK,IAAI,CAAC;EAC7C;EACA,OAAO,SAAS,QAAQ,KAAA,KAAa,SAAS,SAAS,KAAA,IAAY,CAAC,IAAI,CAAC,QAAQ;CACnF,CAAC;AACH;;AAoBA,SAAgB,mBAAmB,eAAqC;CACtE,MAAM,wBAAQ,IAAI,IAAY;CAC9B,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,YAAY,QAAwB,cAAsC;EAC9E,KAAK,MAAM,YAAY,WAAW;GAChC,MAAM,OAAO,gBAAgB,QAAQ,QAAQ;GAC7C,IAAI,SAAS,KAAA,GAAW,MAAM,IAAI,IAAI;EACxC;CACF;CACA,OAAO;EACL,YAAY,QAAQ;GAClB,IAAI,OAAO,QAAQ,KAAA,GAAW,KAAK,IAAI,QAAQ,OAAO,GAAG,CAAC;GAC1D,IAAI,OAAO,SAAS,KAAA,GAAW,MAAM,IAAI,QAAQ,OAAO,IAAI,CAAC;GAC7D,SAAS,QAAQ,CAAC,aAAa,CAAC;EAClC;EACA;EACA,gBAAgB;GAAE,OAAO,CAAC,GAAG,KAAK;GAAG,MAAM,CAAC,GAAG,IAAI;EAAE;CACvD;AACF;;AAGA,SAAgB,QAAQ,MAAsB;CAC5C,OAAO,KAAK,QAAQ,OAAO,GAAG;AAChC;;AAGA,SAAgB,SAAS,MAAc,MAAkC;CACvE,OAAO,KAAK,MAAM,QAAQ,SAAS,OAAO,KAAK,WAAW,IAAI,SAAS,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE,CAAC;AAChG;;;;;;AAOA,SAAgB,iBAAiB,MAAuB;CACtD,OAAO,kCAAkC,KAAK,IAAI;AACpD"}