@allurereport/web-components 3.20.1 → 3.22.0

package/dist/MarkdownPreview-C-NFR_X3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MarkdownPreview-C-NFR_X3.js","sources":["../../web-commons/dist/sanitize.js","../../web-commons/dist/prose.js","../../../node_modules/mdurl/lib/decode.mjs","../../../node_modules/mdurl/lib/encode.mjs","../../../node_modules/mdurl/lib/format.mjs","../../../node_modules/mdurl/lib/parse.mjs","../../../node_modules/uc.micro/build/index.mjs","../../../node_modules/markdown-it/node_modules/entities/dist/decode-codepoint.js","../../../node_modules/markdown-it/node_modules/entities/dist/internal/decode-shared.js","../../../node_modules/markdown-it/node_modules/entities/dist/generated/decode-data-html.js","../../../node_modules/markdown-it/node_modules/entities/dist/internal/bin-trie-flags.js","../../../node_modules/markdown-it/node_modules/entities/dist/decode.js","../../../node_modules/linkify-it/build/index.mjs","../../../node_modules/punycode.js/punycode.es6.js","../../../node_modules/markdown-it/dist/markdown-it.mjs","../src/components/Attachment/iframe.ts","../src/components/Attachment/MarkdownPreview.tsx"],"sourcesContent":["import DOMPurify from \"dompurify\";\nexport const sanitize = (html, config) => DOMPurify.sanitize(html, config);\nconst IFRAME_SANITIZE_CONFIG = {\n    USE_PROFILES: { html: true },\n};\nexport const sanitizeIframeHtml = (html) => sanitize(html, IFRAME_SANITIZE_CONFIG);\n","export const proseStyles = `\nhtml, body {\n  margin: 0;\n  padding: 0;\n  overflow-x: hidden;\n  overflow-y: hidden;\n  background: var(--color-bg-primary);\n}\n\nbody {\n  color: var(--color-text-primary);\n  font-family: var(--font-family);\n  font-size: var(--font-size-m);\n  line-height: var(--line-height-m);\n}\n\np {\n  margin-top: 0;\n  margin-bottom: 10px;\n}\n\np:last-child {\n  margin-bottom: 0;\n}\n\nh1,\nh2,\nh3,\nh4,\nh5,\nh6 {\n  font-weight: var(--font-weight-bold) !important;\n  line-height: var(--line-height-l) !important;\n  margin: 16px 0 10px;\n}\n\nh1:first-child,\nh2:first-child,\nh3:first-child,\nh4:first-child,\nh5:first-child,\nh6:first-child {\n  margin-top: 0;\n}\n\nh1 {\n  font-size: var(--font-size-xl) !important;\n}\n\nh2,\nh3 {\n  font-size: var(--font-size-l) !important;\n}\n\nh4 {\n  font-size: var(--font-size-m) !important;\n}\n\nh5,\nh6 {\n  font-size: var(--font-size-s) !important;\n}\n\nh6 {\n  color: var(--color-text-secondary);\n}\n\nstrong,\nb {\n  font-weight: var(--font-weight-bold) !important;\n}\n\nem,\ni {\n  font-style: italic !important;\n}\n\ndel,\ns {\n  text-decoration: line-through;\n}\n\na {\n  color: var(--color-text-primary);\n  text-decoration: underline;\n}\n\na:hover {\n  color: var(--color-text-secondary);\n}\n\ncode {\n  font-family: var(--font-family-mono) !important;\n  font-size: var(--font-size-m-code) !important;\n  padding: 0.2em 0.4em;\n  background: var(--color-control-bg);\n  border-radius: 4px;\n}\n\npre {\n  font-family: var(--font-family-mono) !important;\n  font-size: var(--font-size-s) !important;\n  line-height: 1.45 !important;\n  padding: 16px;\n  overflow: auto;\n  background: var(--color-control-bg);\n  border-radius: 6px;\n  margin-bottom: 16px;\n}\n\npre code {\n  padding: 0;\n  background: transparent;\n  font-size: inherit !important;\n  border-radius: 0;\n}\n\nblockquote {\n  padding: 0 1em;\n  border-left: 0.25em solid var(--color-border-default);\n  color: var(--color-text-secondary);\n  margin-bottom: 16px;\n}\n\nul,\nol {\n  padding-left: 2em;\n  margin-bottom: 10px;\n}\n\nul {\n  list-style: disc !important;\n}\n\nol {\n  list-style: decimal !important;\n}\n\nli + li {\n  margin-top: 0.25em;\n}\n\nhr {\n  height: 0.25em;\n  padding: 0;\n  margin: 24px 0;\n  background-color: var(--color-border-default);\n  border: 0 !important;\n}\n\ntable {\n  border-spacing: 0;\n  border-collapse: collapse;\n  margin-bottom: 16px;\n  display: block;\n  width: max-content;\n  max-width: 100%;\n  overflow-x: auto;\n  overflow-y: hidden;\n  transform: translateZ(0);\n  contain: layout paint;\n}\n\nth,\ntd {\n  padding: 6px 13px;\n  border: 1px solid var(--color-border-default) !important;\n  white-space: nowrap;\n}\n\nth {\n  font-weight: var(--font-weight-bold) !important;\n  position: sticky;\n  top: 0;\n  z-index: 1;\n  background: var(--color-bg-primary);\n}\n\ntr:nth-child(2n) {\n  background: var(--color-control-bg);\n}\n\nimg {\n  max-width: 100% !important;\n  height: auto !important;\n  display: inline-block !important;\n  vertical-align: middle !important;\n}\n\nabbr,\nabbr[title] {\n  text-decoration: underline dotted;\n  cursor: help;\n  border-bottom: none;\n}\n\nkbd {\n  display: inline-block;\n  padding: 3px 5px;\n  font-family: var(--font-family-mono) !important;\n  font-size: 11px;\n  line-height: 10px;\n  color: var(--color-text-primary);\n  vertical-align: middle;\n  background-color: var(--color-control-bg);\n  border: solid 1px var(--color-border-medium);\n  border-bottom-color: var(--color-border-medium);\n  border-radius: 6px;\n  box-shadow: inset 0 -1px 0 var(--color-border-medium);\n}\n\nsamp {\n  font-family: var(--font-family-mono) !important;\n  font-size: 85% !important;\n}\n\nvar {\n  font-family: var(--font-family-mono) !important;\n  font-style: italic !important;\n  font-weight: var(--font-weight-bold) !important;\n}\n\nmark {\n  background-color: var(--color-intent-primary-bg);\n  color: var(--color-intent-primary-on-bg);\n  padding: 0.1em 0.2em;\n  border-radius: 2px;\n}\n\nsmall {\n  font-size: 85% !important;\n}\n\nsub,\nsup {\n  font-size: 75% !important;\n  line-height: 0 !important;\n  position: relative !important;\n  vertical-align: baseline !important;\n}\n\nsub {\n  bottom: -0.25em !important;\n}\n\nsup {\n  top: -0.5em !important;\n}\n\nins {\n  text-decoration: underline;\n  background-color: var(--color-intent-success-bg-subtle);\n  color: var(--color-text-primary);\n  text-decoration-color: var(--color-intent-success-text);\n}\n\ndfn {\n  font-style: italic !important;\n  font-weight: var(--font-weight-bold) !important;\n}\n\ncite {\n  font-style: italic !important;\n}\n\nq {\n  font-style: italic !important;\n}\n\nq::before {\n  content: open-quote;\n}\n\nq::after {\n  content: close-quote;\n}\n\ntime {\n  font-variant-numeric: tabular-nums;\n}\n\ndl {\n  padding: 0;\n  margin-bottom: 16px;\n}\n\ndt {\n  padding: 0;\n  margin-top: 16px;\n  font-size: 1em;\n  font-style: italic;\n  font-weight: var(--font-weight-bold) !important;\n}\n\ndt:first-child {\n  margin-top: 0;\n}\n\ndd {\n  padding: 0 0 0 16px;\n  margin-left: 0;\n  margin-bottom: 16px;\n}\n\nfigure {\n  margin: 16px 0;\n  display: block;\n}\n\nfigcaption {\n  margin-top: 8px;\n  font-size: var(--font-size-s) !important;\n  color: var(--color-text-secondary);\n  font-style: italic;\n  text-align: center;\n}\n\ndetails {\n  display: block;\n  margin-bottom: 16px;\n}\n\nsummary {\n  display: list-item;\n  cursor: pointer;\n  font-weight: var(--font-weight-bold) !important;\n  margin-bottom: 8px;\n}\n\nsummary:hover {\n  color: var(--color-text-secondary);\n}\n\nsummary::marker {\n  color: var(--color-text-secondary);\n}\n\ndetails[open] summary {\n  margin-bottom: 16px;\n}\n\narticle,\nsection,\naside,\nnav {\n  display: block;\n  margin-bottom: 16px;\n}\n\nheader,\nfooter {\n  display: block;\n  margin-bottom: 16px;\n}\n\naddress {\n  display: block;\n  font-style: italic;\n  margin-bottom: 16px;\n}\n`;\nconst CSS_VAR_PATTERN = /var\\(\\s*(--[\\w-]+)\\s*(?:,\\s*([^)]+))?\\)/g;\nconst resolveCssValue = (value, rootStyles, visitedVars) => {\n    return value.replace(CSS_VAR_PATTERN, (_, variableName, fallback) => {\n        if (visitedVars.has(variableName)) {\n            return fallback ? resolveCssValue(fallback.trim(), rootStyles, visitedVars) : \"\";\n        }\n        const nextVisited = new Set(visitedVars);\n        nextVisited.add(variableName);\n        const variableValue = rootStyles.getPropertyValue(variableName).trim();\n        if (variableValue) {\n            return resolveCssValue(variableValue, rootStyles, nextVisited);\n        }\n        return fallback ? resolveCssValue(fallback.trim(), rootStyles, nextVisited) : \"\";\n    });\n};\nexport const resolveCssVarDeclarations = (cssText) => {\n    if (typeof globalThis === \"undefined\" || !globalThis.document) {\n        return \"\";\n    }\n    const rootStyles = globalThis.getComputedStyle(globalThis.document.documentElement);\n    const variableNames = Array.from(new Set(cssText.match(/--[\\w-]+/g) ?? []));\n    return variableNames\n        .map((name) => {\n        const rawValue = rootStyles.getPropertyValue(name).trim();\n        const value = resolveCssValue(rawValue, rootStyles, new Set([name])).trim();\n        return value ? `${name}: ${value};` : \"\";\n    })\n        .filter(Boolean)\n        .join(\"\\n\");\n};\n","/* eslint-disable no-bitwise */\n\nconst decodeCache = {}\n\nfunction getDecodeCache (exclude) {\n  let cache = decodeCache[exclude]\n  if (cache) { return cache }\n\n  cache = decodeCache[exclude] = []\n\n  for (let i = 0; i < 128; i++) {\n    const ch = String.fromCharCode(i)\n    cache.push(ch)\n  }\n\n  for (let i = 0; i < exclude.length; i++) {\n    const ch = exclude.charCodeAt(i)\n    cache[ch] = '%' + ('0' + ch.toString(16).toUpperCase()).slice(-2)\n  }\n\n  return cache\n}\n\n// Decode percent-encoded string.\n//\nfunction decode (string, exclude) {\n  if (typeof exclude !== 'string') {\n    exclude = decode.defaultChars\n  }\n\n  const cache = getDecodeCache(exclude)\n\n  return string.replace(/(%[a-f0-9]{2})+/gi, function (seq) {\n    let result = ''\n\n    for (let i = 0, l = seq.length; i < l; i += 3) {\n      const b1 = parseInt(seq.slice(i + 1, i + 3), 16)\n\n      if (b1 < 0x80) {\n        result += cache[b1]\n        continue\n      }\n\n      if ((b1 & 0xE0) === 0xC0 && (i + 3 < l)) {\n        // 110xxxxx 10xxxxxx\n        const b2 = parseInt(seq.slice(i + 4, i + 6), 16)\n\n        if ((b2 & 0xC0) === 0x80) {\n          const chr = ((b1 << 6) & 0x7C0) | (b2 & 0x3F)\n\n          if (chr < 0x80) {\n            result += '\\ufffd\\ufffd'\n          } else {\n            result += String.fromCharCode(chr)\n          }\n\n          i += 3\n          continue\n        }\n      }\n\n      if ((b1 & 0xF0) === 0xE0 && (i + 6 < l)) {\n        // 1110xxxx 10xxxxxx 10xxxxxx\n        const b2 = parseInt(seq.slice(i + 4, i + 6), 16)\n        const b3 = parseInt(seq.slice(i + 7, i + 9), 16)\n\n        if ((b2 & 0xC0) === 0x80 && (b3 & 0xC0) === 0x80) {\n          const chr = ((b1 << 12) & 0xF000) | ((b2 << 6) & 0xFC0) | (b3 & 0x3F)\n\n          if (chr < 0x800 || (chr >= 0xD800 && chr <= 0xDFFF)) {\n            result += '\\ufffd\\ufffd\\ufffd'\n          } else {\n            result += String.fromCharCode(chr)\n          }\n\n          i += 6\n          continue\n        }\n      }\n\n      if ((b1 & 0xF8) === 0xF0 && (i + 9 < l)) {\n        // 111110xx 10xxxxxx 10xxxxxx 10xxxxxx\n        const b2 = parseInt(seq.slice(i + 4, i + 6), 16)\n        const b3 = parseInt(seq.slice(i + 7, i + 9), 16)\n        const b4 = parseInt(seq.slice(i + 10, i + 12), 16)\n\n        if ((b2 & 0xC0) === 0x80 && (b3 & 0xC0) === 0x80 && (b4 & 0xC0) === 0x80) {\n          let chr = ((b1 << 18) & 0x1C0000) | ((b2 << 12) & 0x3F000) | ((b3 << 6) & 0xFC0) | (b4 & 0x3F)\n\n          if (chr < 0x10000 || chr > 0x10FFFF) {\n            result += '\\ufffd\\ufffd\\ufffd\\ufffd'\n          } else {\n            chr -= 0x10000\n            result += String.fromCharCode(0xD800 + (chr >> 10), 0xDC00 + (chr & 0x3FF))\n          }\n\n          i += 9\n          continue\n        }\n      }\n\n      result += '\\ufffd'\n    }\n\n    return result\n  })\n}\n\ndecode.defaultChars = ';/?:@&=+$,#'\ndecode.componentChars = ''\n\nexport default decode\n","const encodeCache = {}\n\n// Create a lookup array where anything but characters in `chars` string\n// and alphanumeric chars is percent-encoded.\n//\nfunction getEncodeCache (exclude) {\n  let cache = encodeCache[exclude]\n  if (cache) { return cache }\n\n  cache = encodeCache[exclude] = []\n\n  for (let i = 0; i < 128; i++) {\n    const ch = String.fromCharCode(i)\n\n    if (/^[0-9a-z]$/i.test(ch)) {\n      // always allow unencoded alphanumeric characters\n      cache.push(ch)\n    } else {\n      cache.push('%' + ('0' + i.toString(16).toUpperCase()).slice(-2))\n    }\n  }\n\n  for (let i = 0; i < exclude.length; i++) {\n    cache[exclude.charCodeAt(i)] = exclude[i]\n  }\n\n  return cache\n}\n\n// Encode unsafe characters with percent-encoding, skipping already\n// encoded sequences.\n//\n//  - string       - string to encode\n//  - exclude      - list of characters to ignore (in addition to a-zA-Z0-9)\n//  - keepEscaped  - don't encode '%' in a correct escape sequence (default: true)\n//\nfunction encode (string, exclude, keepEscaped) {\n  if (typeof exclude !== 'string') {\n    // encode(string, keepEscaped)\n    keepEscaped = exclude\n    exclude = encode.defaultChars\n  }\n\n  if (typeof keepEscaped === 'undefined') {\n    keepEscaped = true\n  }\n\n  const cache = getEncodeCache(exclude)\n  let result = ''\n\n  for (let i = 0, l = string.length; i < l; i++) {\n    const code = string.charCodeAt(i)\n\n    if (keepEscaped && code === 0x25 /* % */ && i + 2 < l) {\n      if (/^[0-9a-f]{2}$/i.test(string.slice(i + 1, i + 3))) {\n        result += string.slice(i, i + 3)\n        i += 2\n        continue\n      }\n    }\n\n    if (code < 128) {\n      result += cache[code]\n      continue\n    }\n\n    if (code >= 0xD800 && code <= 0xDFFF) {\n      if (code >= 0xD800 && code <= 0xDBFF && i + 1 < l) {\n        const nextCode = string.charCodeAt(i + 1)\n        if (nextCode >= 0xDC00 && nextCode <= 0xDFFF) {\n          result += encodeURIComponent(string[i] + string[i + 1])\n          i++\n          continue\n        }\n      }\n      result += '%EF%BF%BD'\n      continue\n    }\n\n    result += encodeURIComponent(string[i])\n  }\n\n  return result\n}\n\nencode.defaultChars = \";/?:@&=+$,-_.!~*'()#\"\nencode.componentChars = \"-_.!~*'()\"\n\nexport default encode\n","export default function format (url) {\n  let result = ''\n\n  result += url.protocol || ''\n  result += url.slashes ? '//' : ''\n  result += url.auth ? url.auth + '@' : ''\n\n  if (url.hostname && url.hostname.indexOf(':') !== -1) {\n    // ipv6 address\n    result += '[' + url.hostname + ']'\n  } else {\n    result += url.hostname || ''\n  }\n\n  result += url.port ? ':' + url.port : ''\n  result += url.pathname || ''\n  result += url.search || ''\n  result += url.hash || ''\n\n  return result\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n//\n// Changes from joyent/node:\n//\n// 1. No leading slash in paths,\n//    e.g. in `url.parse('http://foo?bar')` pathname is ``, not `/`\n//\n// 2. Backslashes are not replaced with slashes,\n//    so `http:\\\\example.org\\` is treated like a relative path\n//\n// 3. Trailing colon is treated like a part of the path,\n//    i.e. in `http://example.org:foo` pathname is `:foo`\n//\n// 4. Nothing is URL-encoded in the resulting object,\n//    (in joyent/node some chars in auth and paths are encoded)\n//\n// 5. `url.parse()` does not have `parseQueryString` argument\n//\n// 6. Removed extraneous result properties: `host`, `path`, `query`, etc.,\n//    which can be constructed using other parts of the url.\n//\n\nfunction Url () {\n  this.protocol = null\n  this.slashes = null\n  this.auth = null\n  this.port = null\n  this.hostname = null\n  this.hash = null\n  this.search = null\n  this.pathname = null\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nconst protocolPattern = /^([a-z0-9.+-]+:)/i\nconst portPattern = /:[0-9]*$/\n\n// Special case for a simple path URL\n/* eslint-disable-next-line no-useless-escape */\nconst simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/\n\n// RFC 2396: characters reserved for delimiting URLs.\n// We actually just auto-escape these.\nconst delims = ['<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t']\n\n// RFC 2396: characters not allowed for various reasons.\nconst unwise = ['{', '}', '|', '\\\\', '^', '`'].concat(delims)\n\n// Allowed by RFCs, but cause of XSS attacks.  Always escape these.\nconst autoEscape = ['\\''].concat(unwise)\n// Characters that are never ever allowed in a hostname.\n// Note that any invalid chars are also handled, but these\n// are the ones that are *expected* to be seen, so we fast-path\n// them.\nconst nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape)\nconst hostEndingChars = ['/', '?', '#']\nconst hostnameMaxLen = 255\nconst hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/\nconst hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/\n// protocols that can allow \"unsafe\" and \"unwise\" chars.\n// protocols that never have a hostname.\nconst hostlessProtocol = {\n  javascript: true,\n  'javascript:': true\n}\n// protocols that always contain a // bit.\nconst slashedProtocol = {\n  http: true,\n  https: true,\n  ftp: true,\n  gopher: true,\n  file: true,\n  'http:': true,\n  'https:': true,\n  'ftp:': true,\n  'gopher:': true,\n  'file:': true\n}\n\nfunction urlParse (url, slashesDenoteHost) {\n  if (url && url instanceof Url) return url\n\n  const u = new Url()\n  u.parse(url, slashesDenoteHost)\n  return u\n}\n\nUrl.prototype.parse = function (url, slashesDenoteHost) {\n  let lowerProto, hec, slashes\n  let rest = url\n\n  // trim before proceeding.\n  // This is to support parse stuff like \"  http://foo.com  \\n\"\n  rest = rest.trim()\n\n  if (!slashesDenoteHost && url.split('#').length === 1) {\n    // Try fast path regexp\n    const simplePath = simplePathPattern.exec(rest)\n    if (simplePath) {\n      this.pathname = simplePath[1]\n      if (simplePath[2]) {\n        this.search = simplePath[2]\n      }\n      return this\n    }\n  }\n\n  let proto = protocolPattern.exec(rest)\n  if (proto) {\n    proto = proto[0]\n    lowerProto = proto.toLowerCase()\n    this.protocol = proto\n    rest = rest.substr(proto.length)\n  }\n\n  // figure out if it's got a host\n  // user@server is *always* interpreted as a hostname, and url\n  // resolution will treat //foo/bar as host=foo,path=bar because that's\n  // how the browser resolves relative URLs.\n  /* eslint-disable-next-line no-useless-escape */\n  if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n    slashes = rest.substr(0, 2) === '//'\n    if (slashes && !(proto && hostlessProtocol[proto])) {\n      rest = rest.substr(2)\n      this.slashes = true\n    }\n  }\n\n  if (!hostlessProtocol[proto] &&\n      (slashes || (proto && !slashedProtocol[proto]))) {\n    // there's a hostname.\n    // the first instance of /, ?, ;, or # ends the host.\n    //\n    // If there is an @ in the hostname, then non-host chars *are* allowed\n    // to the left of the last @ sign, unless some host-ending character\n    // comes *before* the @-sign.\n    // URLs are obnoxious.\n    //\n    // ex:\n    // http://a@b@c/ => user:a@b host:c\n    // http://a@b?@c => user:a host:c path:/?@c\n\n    // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n    // Review our test case against browsers more comprehensively.\n\n    // find the first instance of any hostEndingChars\n    let hostEnd = -1\n    for (let i = 0; i < hostEndingChars.length; i++) {\n      hec = rest.indexOf(hostEndingChars[i])\n      if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {\n        hostEnd = hec\n      }\n    }\n\n    // at this point, either we have an explicit point where the\n    // auth portion cannot go past, or the last @ char is the decider.\n    let auth, atSign\n    if (hostEnd === -1) {\n      // atSign can be anywhere.\n      atSign = rest.lastIndexOf('@')\n    } else {\n      // atSign must be in auth portion.\n      // http://a@b/c@d => host:b auth:a path:/c@d\n      atSign = rest.lastIndexOf('@', hostEnd)\n    }\n\n    // Now we have a portion which is definitely the auth.\n    // Pull that off.\n    if (atSign !== -1) {\n      auth = rest.slice(0, atSign)\n      rest = rest.slice(atSign + 1)\n      this.auth = auth\n    }\n\n    // the host is the remaining to the left of the first non-host char\n    hostEnd = -1\n    for (let i = 0; i < nonHostChars.length; i++) {\n      hec = rest.indexOf(nonHostChars[i])\n      if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {\n        hostEnd = hec\n      }\n    }\n    // if we still have not hit it, then the entire thing is a host.\n    if (hostEnd === -1) {\n      hostEnd = rest.length\n    }\n\n    if (rest[hostEnd - 1] === ':') { hostEnd-- }\n    const host = rest.slice(0, hostEnd)\n    rest = rest.slice(hostEnd)\n\n    // pull out port.\n    this.parseHost(host)\n\n    // we've indicated that there is a hostname,\n    // so even if it's empty, it has to be present.\n    this.hostname = this.hostname || ''\n\n    // if hostname begins with [ and ends with ]\n    // assume that it's an IPv6 address.\n    const ipv6Hostname = this.hostname[0] === '[' &&\n        this.hostname[this.hostname.length - 1] === ']'\n\n    // validate a little.\n    if (!ipv6Hostname) {\n      const hostparts = this.hostname.split(/\\./)\n      for (let i = 0, l = hostparts.length; i < l; i++) {\n        const part = hostparts[i]\n        if (!part) { continue }\n        if (!part.match(hostnamePartPattern)) {\n          let newpart = ''\n          for (let j = 0, k = part.length; j < k; j++) {\n            if (part.charCodeAt(j) > 127) {\n              // we replace non-ASCII char with a temporary placeholder\n              // we need this to make sure size of hostname is not\n              // broken by replacing non-ASCII by nothing\n              newpart += 'x'\n            } else {\n              newpart += part[j]\n            }\n          }\n          // we test again with ASCII char only\n          if (!newpart.match(hostnamePartPattern)) {\n            const validParts = hostparts.slice(0, i)\n            const notHost = hostparts.slice(i + 1)\n            const bit = part.match(hostnamePartStart)\n            if (bit) {\n              validParts.push(bit[1])\n              notHost.unshift(bit[2])\n            }\n            if (notHost.length) {\n              rest = notHost.join('.') + rest\n            }\n            this.hostname = validParts.join('.')\n            break\n          }\n        }\n      }\n    }\n\n    if (this.hostname.length > hostnameMaxLen) {\n      this.hostname = ''\n    }\n\n    // strip [ and ] from the hostname\n    // the host field still retains them, though\n    if (ipv6Hostname) {\n      this.hostname = this.hostname.substr(1, this.hostname.length - 2)\n    }\n  }\n\n  // chop off from the tail first.\n  const hash = rest.indexOf('#')\n  if (hash !== -1) {\n    // got a fragment string.\n    this.hash = rest.substr(hash)\n    rest = rest.slice(0, hash)\n  }\n  const qm = rest.indexOf('?')\n  if (qm !== -1) {\n    this.search = rest.substr(qm)\n    rest = rest.slice(0, qm)\n  }\n  if (rest) { this.pathname = rest }\n  if (slashedProtocol[lowerProto] &&\n      this.hostname && !this.pathname) {\n    this.pathname = ''\n  }\n\n  return this\n}\n\nUrl.prototype.parseHost = function (host) {\n  let port = portPattern.exec(host)\n  if (port) {\n    port = port[0]\n    if (port !== ':') {\n      this.port = port.substr(1)\n    }\n    host = host.substr(0, host.length - port.length)\n  }\n  if (host) { this.hostname = host }\n}\n\nexport default urlParse\n","const Any = /[\\0-\\uD7FF\\uE000-\\uFFFF]|[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]|[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF]/;\nconst Cc = /[\\0-\\x1F\\x7F-\\x9F]/;\nconst Cf = /[\\xAD\\u0600-\\u0605\\u061C\\u06DD\\u070F\\u0890\\u0891\\u08E2\\u180E\\u200B-\\u200F\\u202A-\\u202E\\u2060-\\u2064\\u2066-\\u206F\\uFEFF\\uFFF9-\\uFFFB]|\\uD804[\\uDCBD\\uDCCD]|\\uD80D[\\uDC30-\\uDC3F]|\\uD82F[\\uDCA0-\\uDCA3]|\\uD834[\\uDD73-\\uDD7A]|\\uDB40[\\uDC01\\uDC20-\\uDC7F]/;\nconst P = /[!-#%-\\*,-\\/:;\\?@\\[-\\]_\\{\\}\\xA1\\xA7\\xAB\\xB6\\xB7\\xBB\\xBF\\u037E\\u0387\\u055A-\\u055F\\u0589\\u058A\\u05BE\\u05C0\\u05C3\\u05C6\\u05F3\\u05F4\\u0609\\u060A\\u060C\\u060D\\u061B\\u061D-\\u061F\\u066A-\\u066D\\u06D4\\u0700-\\u070D\\u07F7-\\u07F9\\u0830-\\u083E\\u085E\\u0964\\u0965\\u0970\\u09FD\\u0A76\\u0AF0\\u0C77\\u0C84\\u0DF4\\u0E4F\\u0E5A\\u0E5B\\u0F04-\\u0F12\\u0F14\\u0F3A-\\u0F3D\\u0F85\\u0FD0-\\u0FD4\\u0FD9\\u0FDA\\u104A-\\u104F\\u10FB\\u1360-\\u1368\\u1400\\u166E\\u169B\\u169C\\u16EB-\\u16ED\\u1735\\u1736\\u17D4-\\u17D6\\u17D8-\\u17DA\\u1800-\\u180A\\u1944\\u1945\\u1A1E\\u1A1F\\u1AA0-\\u1AA6\\u1AA8-\\u1AAD\\u1B4E\\u1B4F\\u1B5A-\\u1B60\\u1B7D-\\u1B7F\\u1BFC-\\u1BFF\\u1C3B-\\u1C3F\\u1C7E\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u2010-\\u2027\\u2030-\\u2043\\u2045-\\u2051\\u2053-\\u205E\\u207D\\u207E\\u208D\\u208E\\u2308-\\u230B\\u2329\\u232A\\u2768-\\u2775\\u27C5\\u27C6\\u27E6-\\u27EF\\u2983-\\u2998\\u29D8-\\u29DB\\u29FC\\u29FD\\u2CF9-\\u2CFC\\u2CFE\\u2CFF\\u2D70\\u2E00-\\u2E2E\\u2E30-\\u2E4F\\u2E52-\\u2E5D\\u3001-\\u3003\\u3008-\\u3011\\u3014-\\u301F\\u3030\\u303D\\u30A0\\u30FB\\uA4FE\\uA4FF\\uA60D-\\uA60F\\uA673\\uA67E\\uA6F2-\\uA6F7\\uA874-\\uA877\\uA8CE\\uA8CF\\uA8F8-\\uA8FA\\uA8FC\\uA92E\\uA92F\\uA95F\\uA9C1-\\uA9CD\\uA9DE\\uA9DF\\uAA5C-\\uAA5F\\uAADE\\uAADF\\uAAF0\\uAAF1\\uABEB\\uFD3E\\uFD3F\\uFE10-\\uFE19\\uFE30-\\uFE52\\uFE54-\\uFE61\\uFE63\\uFE68\\uFE6A\\uFE6B\\uFF01-\\uFF03\\uFF05-\\uFF0A\\uFF0C-\\uFF0F\\uFF1A\\uFF1B\\uFF1F\\uFF20\\uFF3B-\\uFF3D\\uFF3F\\uFF5B\\uFF5D\\uFF5F-\\uFF65]|\\uD800[\\uDD00-\\uDD02\\uDF9F\\uDFD0]|\\uD801\\uDD6F|\\uD802[\\uDC57\\uDD1F\\uDD3F\\uDE50-\\uDE58\\uDE7F\\uDEF0-\\uDEF6\\uDF39-\\uDF3F\\uDF99-\\uDF9C]|\\uD803[\\uDD6E\\uDEAD\\uDED0\\uDF55-\\uDF59\\uDF86-\\uDF89]|\\uD804[\\uDC47-\\uDC4D\\uDCBB\\uDCBC\\uDCBE-\\uDCC1\\uDD40-\\uDD43\\uDD74\\uDD75\\uDDC5-\\uDDC8\\uDDCD\\uDDDB\\uDDDD-\\uDDDF\\uDE38-\\uDE3D\\uDEA9\\uDFD4\\uDFD5\\uDFD7\\uDFD8]|\\uD805[\\uDC4B-\\uDC4F\\uDC5A\\uDC5B\\uDC5D\\uDCC6\\uDDC1-\\uDDD7\\uDE41-\\uDE43\\uDE60-\\uDE6C\\uDEB9\\uDF3C-\\uDF3E]|\\uD806[\\uDC3B\\uDD44-\\uDD46\\uDDE2\\uDE3F-\\uDE46\\uDE9A-\\uDE9C\\uDE9E-\\uDEA2\\uDF00-\\uDF09\\uDFE1]|\\uD807[\\uDC41-\\uDC45\\uDC70\\uDC71\\uDEF7\\uDEF8\\uDF43-\\uDF4F\\uDFFF]|\\uD809[\\uDC70-\\uDC74]|\\uD80B[\\uDFF1\\uDFF2]|\\uD81A[\\uDE6E\\uDE6F\\uDEF5\\uDF37-\\uDF3B\\uDF44]|\\uD81B[\\uDD6D-\\uDD6F\\uDE97-\\uDE9A\\uDFE2]|\\uD82F\\uDC9F|\\uD836[\\uDE87-\\uDE8B]|\\uD839\\uDDFF|\\uD83A[\\uDD5E\\uDD5F]/;\nconst S = /[\\$\\+<->\\^`\\|~\\xA2-\\xA6\\xA8\\xA9\\xAC\\xAE-\\xB1\\xB4\\xB8\\xD7\\xF7\\u02C2-\\u02C5\\u02D2-\\u02DF\\u02E5-\\u02EB\\u02ED\\u02EF-\\u02FF\\u0375\\u0384\\u0385\\u03F6\\u0482\\u058D-\\u058F\\u0606-\\u0608\\u060B\\u060E\\u060F\\u06DE\\u06E9\\u06FD\\u06FE\\u07F6\\u07FE\\u07FF\\u0888\\u09F2\\u09F3\\u09FA\\u09FB\\u0AF1\\u0B70\\u0BF3-\\u0BFA\\u0C7F\\u0D4F\\u0D79\\u0E3F\\u0F01-\\u0F03\\u0F13\\u0F15-\\u0F17\\u0F1A-\\u0F1F\\u0F34\\u0F36\\u0F38\\u0FBE-\\u0FC5\\u0FC7-\\u0FCC\\u0FCE\\u0FCF\\u0FD5-\\u0FD8\\u109E\\u109F\\u1390-\\u1399\\u166D\\u17DB\\u1940\\u19DE-\\u19FF\\u1B61-\\u1B6A\\u1B74-\\u1B7C\\u1FBD\\u1FBF-\\u1FC1\\u1FCD-\\u1FCF\\u1FDD-\\u1FDF\\u1FED-\\u1FEF\\u1FFD\\u1FFE\\u2044\\u2052\\u207A-\\u207C\\u208A-\\u208C\\u20A0-\\u20C1\\u2100\\u2101\\u2103-\\u2106\\u2108\\u2109\\u2114\\u2116-\\u2118\\u211E-\\u2123\\u2125\\u2127\\u2129\\u212E\\u213A\\u213B\\u2140-\\u2144\\u214A-\\u214D\\u214F\\u218A\\u218B\\u2190-\\u2307\\u230C-\\u2328\\u232B-\\u2429\\u2440-\\u244A\\u249C-\\u24E9\\u2500-\\u2767\\u2794-\\u27C4\\u27C7-\\u27E5\\u27F0-\\u2982\\u2999-\\u29D7\\u29DC-\\u29FB\\u29FE-\\u2B73\\u2B76-\\u2BFF\\u2CE5-\\u2CEA\\u2E50\\u2E51\\u2E80-\\u2E99\\u2E9B-\\u2EF3\\u2F00-\\u2FD5\\u2FF0-\\u2FFF\\u3004\\u3012\\u3013\\u3020\\u3036\\u3037\\u303E\\u303F\\u309B\\u309C\\u3190\\u3191\\u3196-\\u319F\\u31C0-\\u31E5\\u31EF\\u3200-\\u321E\\u322A-\\u3247\\u3250\\u3260-\\u327F\\u328A-\\u32B0\\u32C0-\\u33FF\\u4DC0-\\u4DFF\\uA490-\\uA4C6\\uA700-\\uA716\\uA720\\uA721\\uA789\\uA78A\\uA828-\\uA82B\\uA836-\\uA839\\uAA77-\\uAA79\\uAB5B\\uAB6A\\uAB6B\\uFB29\\uFBB2-\\uFBD2\\uFD40-\\uFD4F\\uFD90\\uFD91\\uFDC8-\\uFDCF\\uFDFC-\\uFDFF\\uFE62\\uFE64-\\uFE66\\uFE69\\uFF04\\uFF0B\\uFF1C-\\uFF1E\\uFF3E\\uFF40\\uFF5C\\uFF5E\\uFFE0-\\uFFE6\\uFFE8-\\uFFEE\\uFFFC\\uFFFD]|\\uD800[\\uDD37-\\uDD3F\\uDD79-\\uDD89\\uDD8C-\\uDD8E\\uDD90-\\uDD9C\\uDDA0\\uDDD0-\\uDDFC]|\\uD802[\\uDC77\\uDC78\\uDEC8]|\\uD803[\\uDD8E\\uDD8F\\uDED1-\\uDED8]|\\uD805\\uDF3F|\\uD807[\\uDFD5-\\uDFF1]|\\uD81A[\\uDF3C-\\uDF3F\\uDF45]|\\uD82F\\uDC9C|\\uD833[\\uDC00-\\uDCEF\\uDCFA-\\uDCFC\\uDD00-\\uDEB3\\uDEBA-\\uDED0\\uDEE0-\\uDEF0\\uDF50-\\uDFC3]|\\uD834[\\uDC00-\\uDCF5\\uDD00-\\uDD26\\uDD29-\\uDD64\\uDD6A-\\uDD6C\\uDD83\\uDD84\\uDD8C-\\uDDA9\\uDDAE-\\uDDEA\\uDE00-\\uDE41\\uDE45\\uDF00-\\uDF56]|\\uD835[\\uDEC1\\uDEDB\\uDEFB\\uDF15\\uDF35\\uDF4F\\uDF6F\\uDF89\\uDFA9\\uDFC3]|\\uD836[\\uDC00-\\uDDFF\\uDE37-\\uDE3A\\uDE6D-\\uDE74\\uDE76-\\uDE83\\uDE85\\uDE86]|\\uD838[\\uDD4F\\uDEFF]|\\uD83B[\\uDCAC\\uDCB0\\uDD2E\\uDEF0\\uDEF1]|\\uD83C[\\uDC00-\\uDC2B\\uDC30-\\uDC93\\uDCA0-\\uDCAE\\uDCB1-\\uDCBF\\uDCC1-\\uDCCF\\uDCD1-\\uDCF5\\uDD0D-\\uDDAD\\uDDE6-\\uDE02\\uDE10-\\uDE3B\\uDE40-\\uDE48\\uDE50\\uDE51\\uDE60-\\uDE65\\uDF00-\\uDFFF]|\\uD83D[\\uDC00-\\uDED8\\uDEDC-\\uDEEC\\uDEF0-\\uDEFC\\uDF00-\\uDFD9\\uDFE0-\\uDFEB\\uDFF0]|\\uD83E[\\uDC00-\\uDC0B\\uDC10-\\uDC47\\uDC50-\\uDC59\\uDC60-\\uDC87\\uDC90-\\uDCAD\\uDCB0-\\uDCBB\\uDCC0\\uDCC1\\uDCD0-\\uDCD8\\uDD00-\\uDE57\\uDE60-\\uDE6D\\uDE70-\\uDE7C\\uDE80-\\uDE8A\\uDE8E-\\uDEC6\\uDEC8\\uDECD-\\uDEDC\\uDEDF-\\uDEEA\\uDEEF-\\uDEF8\\uDF00-\\uDF92\\uDF94-\\uDFEF\\uDFFA]/;\nconst Z = /[ \\xA0\\u1680\\u2000-\\u200A\\u2028\\u2029\\u202F\\u205F\\u3000]/;\n\nexport { Any, Cc, Cf, P, S, Z };\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","/**\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 { Any, Cc, P, Z } from \"uc.micro\";\n//#region src/rebuilder.ts\nvar REBuilder = class {\n\tsrc_Any = Any.source;\n\tsrc_Cc = Cc.source;\n\tsrc_Z = Z.source;\n\tsrc_P = P.source;\n\tsrc_ZPCc = [\n\t\tthis.src_Z,\n\t\tthis.src_P,\n\t\tthis.src_Cc\n\t].join(\"|\");\n\tsrc_ZCc = [this.src_Z, this.src_Cc].join(\"|\");\n\tcache = {};\n\topts = {\n\t\tmaxLength: 1e4,\n\t\turlAuth: false,\n\t\tschema_names: []\n\t};\n\tconstructor(opts = {}) {\n\t\tthis.opts = {\n\t\t\t...this.opts,\n\t\t\t...opts\n\t\t};\n\t}\n\tset(opts = {}) {\n\t\tthis.opts = {\n\t\t\t...this.opts,\n\t\t\t...opts\n\t\t};\n\t\tthis.cache = {};\n\t\treturn this;\n\t}\n\tescapeRE(str) {\n\t\treturn str.replace(/[.?*+^$[\\]\\\\(){}|-]/g, \"\\\\$&\");\n\t}\n\tnestedPairRE(open, close, depth = 4) {\n\t\tconst openRE = this.escapeRE(open);\n\t\tconst closeRE = this.escapeRE(close);\n\t\tconst atom = `(?:(?!${this.src_ZCc}|${openRE}|${closeRE}).)`;\n\t\tlet pair = `${openRE}${atom}{0,1000}${closeRE}`;\n\t\tfor (let level = 2; level <= depth; level++) pair = `${openRE}(?:${atom}|${pair}){0,1000}${closeRE}`;\n\t\treturn pair;\n\t}\n\tget_text_separators() {\n\t\treturn this.cache.text_separators ??= /[><\\uff5c]/;\n\t}\n\tget_pseudo_letter() {\n\t\treturn this.cache.src_pseudo_letter ??= new RegExp(`(?:(?!${this.get_text_separators().source}|${this.src_ZPCc})${this.src_Any})`);\n\t}\n\tget_ipv4_addr() {\n\t\treturn this.cache.src_ip4 ??= /* @__PURE__ */ new RegExp(\"(?:(?:25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])[.]){3}(?:25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\");\n\t}\n\tget_ipv6_addr() {\n\t\tconst h16 = \"[0-9A-Fa-f]{1,4}\";\n\t\tconst ls32 = `(?:(?:${h16}:${h16})|${this.get_ipv4_addr().source})`;\n\t\treturn this.cache.src_ip6_addr ??= new RegExp(`(?:(?:${h16}:){6}${ls32}|::(?:${h16}:){5}${ls32}|(?:${h16})?::(?:${h16}:){4}${ls32}|(?:(?:${h16}:){0,1}${h16})?::(?:${h16}:){3}${ls32}|(?:(?:${h16}:){0,2}${h16})?::(?:${h16}:){2}${ls32}|(?:(?:${h16}:){0,3}${h16})?::${h16}:${ls32}|(?:(?:${h16}:){0,4}${h16})?::${ls32}|(?:(?:${h16}:){0,5}${h16})?::${h16}|(?:(?:${h16}:){0,6}${h16})?::)`);\n\t}\n\tget_ipv6_url_host() {\n\t\treturn this.cache.src_ip6_host ??= new RegExp(`\\\\[${this.get_ipv6_addr().source}\\\\]`);\n\t}\n\tget_ipv6_mail_host() {\n\t\treturn this.cache.src_ipv6_mail_host ??= new RegExp(`\\\\[IPv6:${this.get_ipv6_addr().source}\\\\]`);\n\t}\n\tget_auth() {\n\t\treturn this.cache.src_auth ??= new RegExp(`(?:(?:(?!${this.src_ZCc}|[@/\\\\[\\\\]()]).){1,50}@)?`);\n\t}\n\tget_port() {\n\t\treturn this.cache.src_port ??= /* @__PURE__ */ new RegExp(\"(?::(?:6(?:[0-4]\\\\d{3}|5(?:[0-4]\\\\d{2}|5(?:[0-2]\\\\d|3[0-5])))|[1-5]?\\\\d{1,4}))?\");\n\t}\n\tget_host_terminator() {\n\t\treturn this.cache.src_host_terminator ??= new RegExp(`(?=$|${this.get_text_separators().source}|${this.src_ZPCc})(?!${this.opts[\"---\"] ? \"-(?!--)|\" : \"-|\"}_|:\\\\d|\\\\.-|\\\\.(?!$|${this.src_ZPCc}))`);\n\t}\n\tget_path_terminator() {\n\t\treturn this.cache.src_path_terminator ??= new RegExp(`${this.src_ZPCc}|${this.get_text_separators().source}`);\n\t}\n\tget_path() {\n\t\treturn this.cache.src_path ??= new RegExp(`(?:[/?#](?:${this.nestedPairRE(\"[\", \"]\")}|${this.nestedPairRE(\"(\", \")\")}|${this.nestedPairRE(\"{\", \"}\")}|\\\\\"(?:(?!${this.src_ZCc}|[\"]).){1,100}\\\\\"|\\\\'(?:(?!${this.src_ZCc}|[']).){1,100}\\\\'|\\\\'(?=${this.get_pseudo_letter().source}|[-])|\\\\.{2,20}[:]?[a-zA-Z0-9%/&]|\\\\.(?!${this.src_ZCc}|[.]|$)|` + (this.opts[\"---\"] ? \"\\\\-(?!--(?:[^-]|$))(?:-{0,19})|\" : \"\\\\-{1,20}|\") + `,(?!${this.src_ZCc}|$)|;(?!${this.src_ZCc}|$)|\\\\!{1,20}(?!${this.src_ZCc}|[!]|$)|\\\\?(?!${this.src_ZCc}|[?]|$)|` + this.get_path_extra().source + `[\\\\\\\\/:%@#&=_~*]|(?!${this.get_path_terminator().source}).){1,${this.opts.maxLength}}|\\\\/)?`);\n\t}\n\tget_mail_name() {\n\t\treturn this.cache.src_mail_name ??= /* @__PURE__ */ new RegExp(\"[-!#$%&'*+/=?^_`{|}~a-zA-Z0-9](?:[-!#$%&'*+/=?^_`{|}~a-zA-Z0-9]|[.](?=[-!#$%&'*+/=?^_`{|}~a-zA-Z0-9])){0,63}\");\n\t}\n\tget_xn() {\n\t\treturn this.cache.src_xn ??= /* @__PURE__ */ new RegExp(\"xn--[a-z0-9\\\\-]{1,59}\");\n\t}\n\tget_tld() {\n\t\tif (this.cache.tld) return this.cache.tld;\n\t\tconst tlds_src = [...new Set(this.opts.tlds || [])].sort().reverse().join(\"|\");\n\t\tthis.cache.tld = new RegExp(`${tlds_src || \"$#none#$\"}|${this.get_xn().source}`);\n\t\treturn this.cache.tld;\n\t}\n\tget_domain_root() {\n\t\treturn this.cache.src_domain_root ??= new RegExp(\"(?:\" + this.get_xn().source + `|${this.get_pseudo_letter().source}{1,63})`);\n\t}\n\tget_domain() {\n\t\treturn this.cache.src_domain ??= new RegExp(\"(?:\" + this.get_xn().source + `|(?:${this.get_pseudo_letter().source})|(?:${this.get_pseudo_letter().source}(?:-|${this.get_pseudo_letter().source}){0,61}${this.get_pseudo_letter().source}))`);\n\t}\n\tget_url_host_port() {\n\t\treturn this.cache.url_host_port ??= new RegExp(\"(?:\" + this.get_ipv6_url_host().source + `|(?:(?:(?:${this.get_domain().source})\\\\.){0,10}${this.get_domain().source}))` + this.get_port().source + this.get_host_terminator().source);\n\t}\n\tget_fuzzy_url_host_port() {\n\t\treturn this.cache.fuzzy_url_host_port ??= new RegExp(\"(?:\" + (this.opts.fuzzyIP ? this.get_ipv4_addr().source + \"|\" : \"\") + `(?:(?:(?:${this.get_domain().source})\\\\.){1,10}(?:${this.get_tld().source})))` + this.get_host_terminator().source);\n\t}\n\tget_mail_host() {\n\t\treturn this.cache.src_mail_host ??= new RegExp(\"(?:\" + this.get_ipv6_mail_host().source + `|(?:(?:(?:${this.get_domain().source})\\\\.){0,4}${this.get_domain().source}))` + this.get_host_terminator().source);\n\t}\n\tget_fuzzy_mail_host() {\n\t\treturn this.cache.src_fuzzy_mail_host ??= new RegExp(\"(?:\" + this.get_ipv6_mail_host().source + `|(?:(?:(?:${this.get_domain().source})[.]){1,4}${this.get_domain_root().source}))` + this.get_host_terminator().source);\n\t}\n\tget_path_extra() {\n\t\treturn this.cache.src_path_extra ??= /* @__PURE__ */ new RegExp(\"\");\n\t}\n\tget_fuzzy_mail_host_search() {\n\t\treturn this.cache.mail_fuzzy_host_search ??= new RegExp(`@${this.get_fuzzy_mail_host().source}`, \"ig\");\n\t}\n\tget_fuzzy_link_search() {\n\t\treturn this.cache.link_fuzzy_search ??= new RegExp(`(^|(?![.:/\\\\-_@])(?:[$+<=>^\\`|\\uff5c]|${this.src_ZPCc}))(?:(?![$+<=>^\\`|\\uff5c])${this.get_fuzzy_url_host_port().source}${this.get_path().source})`, \"ig\");\n\t}\n\tget_http_validator() {\n\t\treturn this.cache.http_validator ??= new RegExp(\"\\\\/\\\\/\" + (this.opts.urlAuth ? this.get_auth().source : \"\") + this.get_url_host_port().source + this.get_path().source, \"iy\");\n\t}\n\tget_relative_proto_validator() {\n\t\treturn this.cache.relative_proto_validator ??= new RegExp((this.opts.urlAuth ? this.get_auth().source : \"\") + `(?:localhost|${this.get_ipv6_url_host().source}|(?:(?:${this.get_domain().source})[.]){1,10}${this.get_domain_root().source})` + this.get_port().source + this.get_host_terminator().source + this.get_path().source, \"iy\");\n\t}\n\tget_mail_name_validator() {\n\t\treturn this.cache.mail_name_validator ??= new RegExp(`(?:^|${this.get_text_separators().source}|\"|\\\\(|${this.src_ZCc})(${this.get_mail_name().source})$`);\n\t}\n\tget_mailto_validator() {\n\t\treturn this.cache.mailto_validator ??= new RegExp(`${this.get_mail_name().source}@${this.get_mail_host().source}`, \"iy\");\n\t}\n\tget_schema_names() {\n\t\treturn this.cache.schema_names ??= new RegExp((this.opts.schema_names || []).map((name) => this.escapeRE(name)).join(\"|\"));\n\t}\n\tget_schema_search() {\n\t\treturn this.cache.schema_search ??= new RegExp(`(^|(?!_)(?:[><\\uff5c]|${this.src_ZPCc}))(${this.get_schema_names().source})`, \"ig\");\n\t}\n\tget_schema_at_start() {\n\t\treturn this.cache.schema_at_start ??= new RegExp(`^${this.get_schema_search().source}`, \"i\");\n\t}\n};\n//#endregion\n//#region src/linkifyit.ts\nvar web_schema = {\n\tvalidate: (text, pos, self) => {\n\t\tconst re = self.re.get_http_validator();\n\t\tre.lastIndex = pos;\n\t\tconst m = re.exec(text);\n\t\treturn m ? m[0].length : 0;\n\t},\n\tnormalize: (match, self) => self.normalize(match)\n};\nvar defaultSchemas = {\n\t\"http:\": web_schema,\n\t\"https:\": web_schema,\n\t\"ftp:\": web_schema,\n\t\"//\": {\n\t\tvalidate: function(text, pos, self) {\n\t\t\tconst re = self.re.get_relative_proto_validator();\n\t\t\tre.lastIndex = pos;\n\t\t\tconst m = re.exec(text);\n\t\t\tif (m) {\n\t\t\t\tif (pos >= 3 && text[pos - 3] === \":\") return 0;\n\t\t\t\tif (pos >= 3 && text[pos - 3] === \"/\") return 0;\n\t\t\t\treturn m[0].length;\n\t\t\t}\n\t\t\treturn 0;\n\t\t},\n\t\tnormalize: (match, self) => self.normalize(match)\n\t},\n\t\"mailto:\": {\n\t\tvalidate: function(text, pos, self) {\n\t\t\tconst re = self.re.get_mailto_validator();\n\t\t\tre.lastIndex = pos;\n\t\t\tconst m = re.exec(text);\n\t\t\treturn m ? m[0].length : 0;\n\t\t},\n\t\tnormalize: (match, self) => self.normalize(match)\n\t}\n};\nvar tlds_2ch = \"a:cdefgilmnoqrstuwxz|b:abdefghijmnorstvwyz|c:acdfghiklmnoruvwxyz|d:ejkmoz|e:cegrstu|f:ijkmor|g:abdefghilmnpqrstuwy|h:kmnrtu|i:delmnoqrst|j:emop|k:eghimnprwyz|l:abcikrstuvy|m:acdeghklmnopqrstuvwxyz|n:acefgilopruz|o:m|p:aefghklmnrstwy|q:a|r:eosuw|s:abcdeghijklmnortuvxyz|t:cdfghjklmnortvwz|u:agksyz|v:aceginu|w:fs|y:et|z:amw\";\nvar tlds_default = \"biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|рф\";\nfunction unpackTlds() {\n\tconst result = tlds_default.split(\"|\");\n\ttlds_2ch.split(\"|\").forEach((item) => {\n\t\tconst sep = item.indexOf(\":\");\n\t\tconst prefix = item.slice(0, sep);\n\t\tfor (const suffix of item.slice(sep + 1)) result.push(prefix + suffix);\n\t});\n\treturn result;\n}\nvar defaultOptions = {\n\tfuzzyLink: false,\n\tfuzzyEmail: true,\n\tfuzzyIP: false,\n\t\"---\": false,\n\ttlds: unpackTlds(),\n\turlAuth: false,\n\tmaxLength: 1e4\n};\n/**\n* Match result returned by {@link LinkifyIt.match} and\n* {@link LinkifyIt.matchAtStart}.\n*\n* @category types\n*/\nvar Match = class {\n\t/** Prefix (protocol) for matched string. Empty for fuzzy links. */\n\tschema;\n\t/** First position of matched string. */\n\tindex;\n\t/** Next position after matched string. */\n\tlastIndex;\n\t/** Matched string. */\n\traw;\n\t/** Normalized text of matched string. */\n\ttext;\n\t/** Normalized URL of matched string. */\n\turl;\n\tconstructor(text, schema, index, lastIndex) {\n\t\tconst raw = text.slice(index, lastIndex);\n\t\tthis.schema = schema.toLowerCase();\n\t\tthis.index = index;\n\t\tthis.lastIndex = lastIndex;\n\t\tthis.raw = raw;\n\t\tthis.text = raw;\n\t\tthis.url = raw;\n\t}\n};\n/** Linkifier instance. */\nvar LinkifyIt = class {\n\t__opts__;\n\t__schemas__;\n\tre;\n\t/**\n\t* Creates new linkifier instance.\n\t*\n\t* By default understands:\n\t*\n\t* - `http(s)://...` , `ftp://...`, `mailto:...` & `//...` links\n\t* - \"fuzzy\" emails (foo@bar.com).\n\t*\n\t* See {@link LinkifyConstructorOptions} for available options.\n\t*\n\t* @param options Recognition options.\n\t*\n\t* @example\n\t* ```javascript\n\t* import { LinkifyIt } from 'linkify-it'\n\t*\n\t* const linkify = new LinkifyIt({ fuzzyLink: true })\n\t*\n\t* linkify\n\t*   .tlds(require('tlds'))       // Reload with full TLD list\n\t*   .tlds('onion', true)         // Add unofficial `.onion` domain\n\t*   .add('ftp:', null)           // Disable `ftp:` protocol\n\t*   .set({ fuzzyIP: true })      // Enable IPs in fuzzy links\n\t*\n\t* console.log(linkify.test('Site github.com!')) // true\n\t* console.log(linkify.match('Site github.com!'))\n\t* ```\n\t*/\n\tconstructor(options = {}) {\n\t\tconst { rebuilder, ...linkifyOptions } = options;\n\t\tthis.__opts__ = {\n\t\t\t...defaultOptions,\n\t\t\t...linkifyOptions\n\t\t};\n\t\tthis.__schemas__ = { ...defaultSchemas };\n\t\tthis.re = rebuilder || new REBuilder();\n\t\tthis.re.set({\n\t\t\t...this.__opts__,\n\t\t\tschema_names: Object.keys(this.__schemas__)\n\t\t});\n\t}\n\t/**\n\t* Add new rule definition.\n\t*\n\t* `schema` is a link prefix (usually, protocol name with `:` at the end,\n\t* `skype:` for example). `linkify-it` makes sure that prefix is not\n\t* preceded with alphanumeric char and symbols. Only whitespaces and\n\t* punctuation allowed.\n\t*\n\t* `definition` is a rule to check tail after link prefix. To disable an\n\t* existing rule, pass `null`.\n\t*\n\t* @param schema Rule name (fixed pattern prefix).\n\t* @param definition Schema definition, or `null` to disable the rule.\n\t*\n\t* See [twitter mentions example](https://github.com/markdown-it/linkify-it/blob/master/examples/twitter.mjs).\n\t*/\n\tadd(schema, definition = null) {\n\t\tif (!definition) delete this.__schemas__[schema];\n\t\telse {\n\t\t\tconst def = {\n\t\t\t\tnormalize: (match, self) => self.normalize(match),\n\t\t\t\t...definition\n\t\t\t};\n\t\t\tthis.__schemas__[schema] = def;\n\t\t}\n\t\tthis.re.set({\n\t\t\t...this.__opts__,\n\t\t\tschema_names: Object.keys(this.__schemas__)\n\t\t});\n\t\treturn this;\n\t}\n\t/**\n\t* Set recognition options for links without schema.\n\t*\n\t* @param options Recognition options.\n\t*/\n\tset(options = {}) {\n\t\tthis.__opts__ = {\n\t\t\t...this.__opts__,\n\t\t\t...options\n\t\t};\n\t\tthis.re.set({\n\t\t\t...this.__opts__,\n\t\t\tschema_names: Object.keys(this.__schemas__)\n\t\t});\n\t\treturn this;\n\t}\n\t/**\n\t* Searches linkifiable pattern and returns `true` on success or `false` on fail.\n\t*\n\t* @param text Text to scan.\n\t*/\n\ttest(text) {\n\t\tif (!text.length) return false;\n\t\tlet m, re;\n\t\tre = this.re.get_schema_search();\n\t\tre.lastIndex = 0;\n\t\twhile ((m = re.exec(text)) !== null) if (this.testSchemaAt(text, m[2], re.lastIndex)) return true;\n\t\tif (this.__opts__.fuzzyLink && this.__schemas__[\"http:\"]) {\n\t\t\tre = this.re.get_fuzzy_link_search();\n\t\t\tre.lastIndex = 0;\n\t\t\tif (re.exec(text) !== null) return true;\n\t\t}\n\t\tif (this.__opts__.fuzzyEmail && this.__schemas__[\"mailto:\"]) {\n\t\t\tif (text.indexOf(\"@\") >= 0) {\n\t\t\t\tconst mailHostRe = this.re.get_fuzzy_mail_host_search();\n\t\t\t\tconst mailNameRe = this.re.get_mail_name_validator();\n\t\t\t\tmailHostRe.lastIndex = 0;\n\t\t\t\twhile ((m = mailHostRe.exec(text)) !== null) {\n\t\t\t\t\tconst name = text.slice(Math.max(0, m.index - 65), m.index);\n\t\t\t\t\tif (mailNameRe.test(name)) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t/**\n\t* Similar to {@link LinkifyIt.test} but checks only specific protocol tail exactly\n\t* at given position. Returns length of found pattern (0 on fail).\n\t*\n\t* @param text Text to scan.\n\t* @param schema Rule (schema) name.\n\t* @param pos Text offset to check from.\n\t*/\n\ttestSchemaAt(text, schema, pos) {\n\t\tif (!this.__schemas__[schema.toLowerCase()]) return 0;\n\t\treturn this.__schemas__[schema.toLowerCase()].validate(text.slice(0, pos + this.__opts__.maxLength), pos, this);\n\t}\n\t/**\n\t* Returns array of found link descriptions or `null` on fail. We strongly\n\t* recommend to use {@link LinkifyIt.test} first, for best speed.\n\t*\n\t* @param text Text to scan.\n\t*/\n\tmatch(text) {\n\t\tconst result = [];\n\t\tconst schemaRe = this.re.get_schema_search();\n\t\tlet fuzzyLinkRe;\n\t\tlet mailHostRe;\n\t\tlet mailNameRe;\n\t\tlet fuzzyLinkCandidate;\n\t\tlet fuzzyEmailCandidate;\n\t\tlet schemaPrefix;\n\t\tlet schemaDone = false;\n\t\tlet fuzzyLinkDone = false;\n\t\tlet fuzzyEmailDone = false;\n\t\tlet pos = 0;\n\t\tif (!text.length) return null;\n\t\tschemaRe.lastIndex = 0;\n\t\tif (this.__opts__.fuzzyLink && this.__schemas__[\"http:\"]) {\n\t\t\tfuzzyLinkRe = this.re.get_fuzzy_link_search();\n\t\t\tfuzzyLinkRe.lastIndex = 0;\n\t\t}\n\t\tif (this.__opts__.fuzzyEmail && this.__schemas__[\"mailto:\"]) {\n\t\t\tmailHostRe = this.re.get_fuzzy_mail_host_search();\n\t\t\tmailHostRe.lastIndex = 0;\n\t\t\tmailNameRe = this.re.get_mail_name_validator();\n\t\t}\n\t\tfor (;;) {\n\t\t\tconst scanFrom = Math.max(pos - 1, 0);\n\t\t\tif (mailHostRe && mailNameRe && !fuzzyEmailDone && (!fuzzyEmailCandidate || fuzzyEmailCandidate.index < pos)) {\n\t\t\t\tif (mailHostRe.lastIndex < scanFrom) mailHostRe.lastIndex = scanFrom;\n\t\t\t\tfor (;;) {\n\t\t\t\t\tconst m = mailHostRe.exec(text);\n\t\t\t\t\tif (!m) {\n\t\t\t\t\t\tfuzzyEmailDone = true;\n\t\t\t\t\t\tfuzzyEmailCandidate = void 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tconst name = mailNameRe.exec(text.slice(Math.max(0, m.index - 65), m.index));\n\t\t\t\t\tif (!name) continue;\n\t\t\t\t\tfuzzyEmailCandidate = {\n\t\t\t\t\t\tschema: \"mailto:\",\n\t\t\t\t\t\tindex: m.index - name[1].length,\n\t\t\t\t\t\tlastIndex: m.index + m[0].length\n\t\t\t\t\t};\n\t\t\t\t\tif (fuzzyEmailCandidate.index >= pos) break;\n\t\t\t\t\tif (mailHostRe.lastIndex < scanFrom) mailHostRe.lastIndex = scanFrom;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (fuzzyLinkRe && !fuzzyLinkDone && (!fuzzyLinkCandidate || fuzzyLinkCandidate.index < pos)) {\n\t\t\t\tif (fuzzyLinkRe.lastIndex < scanFrom) fuzzyLinkRe.lastIndex = scanFrom;\n\t\t\t\tfor (;;) {\n\t\t\t\t\tconst m = fuzzyLinkRe.exec(text);\n\t\t\t\t\tif (!m) {\n\t\t\t\t\t\tfuzzyLinkDone = true;\n\t\t\t\t\t\tfuzzyLinkCandidate = void 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tfuzzyLinkCandidate = {\n\t\t\t\t\t\tschema: \"\",\n\t\t\t\t\t\tindex: m.index + m[1].length,\n\t\t\t\t\t\tlastIndex: m.index + m[0].length\n\t\t\t\t\t};\n\t\t\t\t\tif (fuzzyLinkCandidate.index >= pos) break;\n\t\t\t\t\tif (fuzzyLinkRe.lastIndex < scanFrom) fuzzyLinkRe.lastIndex = scanFrom;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet fuzzyCandidate = fuzzyEmailCandidate;\n\t\t\tif (!fuzzyCandidate || fuzzyLinkCandidate && (fuzzyLinkCandidate.index < fuzzyCandidate.index || fuzzyLinkCandidate.index === fuzzyCandidate.index && fuzzyLinkCandidate.lastIndex > fuzzyCandidate.lastIndex)) fuzzyCandidate = fuzzyLinkCandidate;\n\t\t\tlet schemaCandidate;\n\t\t\tif (!schemaDone) for (;;) {\n\t\t\t\tif (!schemaPrefix) {\n\t\t\t\t\tif (schemaRe.lastIndex < scanFrom) schemaRe.lastIndex = scanFrom;\n\t\t\t\t\tconst m = schemaRe.exec(text);\n\t\t\t\t\tif (!m) {\n\t\t\t\t\t\tschemaDone = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tschemaPrefix = {\n\t\t\t\t\t\tschema: m[2],\n\t\t\t\t\t\tindex: m.index + m[1].length,\n\t\t\t\t\t\tlastIndex: m.index + m[0].length\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t\tif (schemaPrefix.index < pos) {\n\t\t\t\t\tschemaPrefix = void 0;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (fuzzyCandidate && schemaPrefix.index > fuzzyCandidate.index) break;\n\t\t\t\tconst prefix = schemaPrefix;\n\t\t\t\tschemaPrefix = void 0;\n\t\t\t\tconst len = this.testSchemaAt(text, prefix.schema, prefix.lastIndex);\n\t\t\t\tif (len) {\n\t\t\t\t\tschemaCandidate = {\n\t\t\t\t\t\tschema: prefix.schema,\n\t\t\t\t\t\tindex: prefix.index,\n\t\t\t\t\t\tlastIndex: prefix.lastIndex + len\n\t\t\t\t\t};\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet candidate = schemaCandidate;\n\t\t\tif (!candidate || fuzzyEmailCandidate && (fuzzyEmailCandidate.index < candidate.index || fuzzyEmailCandidate.index === candidate.index && fuzzyEmailCandidate.lastIndex > candidate.lastIndex)) candidate = fuzzyEmailCandidate;\n\t\t\tif (!candidate || fuzzyLinkCandidate && (fuzzyLinkCandidate.index < candidate.index || fuzzyLinkCandidate.index === candidate.index && fuzzyLinkCandidate.lastIndex > candidate.lastIndex)) candidate = fuzzyLinkCandidate;\n\t\t\tif (!candidate) break;\n\t\t\tif (candidate === fuzzyEmailCandidate) fuzzyEmailCandidate = void 0;\n\t\t\telse if (candidate === fuzzyLinkCandidate) fuzzyLinkCandidate = void 0;\n\t\t\tconst match = new Match(text, candidate.schema, candidate.index, candidate.lastIndex);\n\t\t\tif (match.schema) this.__schemas__[match.schema].normalize(match, this);\n\t\t\telse this.normalize(match);\n\t\t\tresult.push(match);\n\t\t\tpos = candidate.lastIndex;\n\t\t}\n\t\tif (result.length) return result;\n\t\treturn null;\n\t}\n\t/**\n\t* Returns fully-formed (not fuzzy) link if it starts at the beginning\n\t* of the string, and null otherwise.\n\t*\n\t* @param text Text to scan.\n\t*/\n\tmatchAtStart(text) {\n\t\tif (!text.length) return null;\n\t\tconst m = this.re.get_schema_at_start().exec(text);\n\t\tif (!m) return null;\n\t\tconst len = this.testSchemaAt(text, m[2], m[0].length);\n\t\tif (!len) return null;\n\t\tconst match = new Match(text, m[2], m.index + m[1].length, m.index + m[0].length + len);\n\t\tthis.__schemas__[match.schema].normalize(match, this);\n\t\treturn match;\n\t}\n\t/**\n\t* Load (or merge) new TLDs list. Those are used for fuzzy links (without\n\t* prefix) to avoid false positives. By default this algorithm is used:\n\t*\n\t* - hostname with any 2-letter root zones are ok.\n\t* - biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|рф\n\t*   are ok.\n\t* - encoded (`xn--...`) root zones are ok.\n\t*\n\t* If list is replaced, then exact match for 2-chars root zones will be checked.\n\t*\n\t* @param list List of TLDs.\n\t* @param keepOld Merge with current list if `true` (`false` by default).\n\t*/\n\ttlds(list, keepOld = false) {\n\t\tlist = Array.isArray(list) ? list : [list];\n\t\tif (!keepOld) this.__opts__.tlds = list;\n\t\telse this.__opts__.tlds = this.__opts__.tlds.concat(list);\n\t\tthis.re.set({\n\t\t\t...this.__opts__,\n\t\t\tschema_names: Object.keys(this.__schemas__)\n\t\t});\n\t\treturn this;\n\t}\n\t/**\n\t* Default normalizer (if schema does not define its own).\n\t*\n\t* @param match Match to normalize.\n\t*/\n\tnormalize(match) {\n\t\tif (!match.schema) match.url = `http://${match.url}`;\n\t\tif (match.schema === \"mailto:\" && !/^mailto:/i.test(match.url)) match.url = `mailto:${match.url}`;\n\t}\n};\nfunction linkifyit(options = {}) {\n\treturn new LinkifyIt(options);\n}\n//#endregion\nexport { LinkifyIt, REBuilder, linkifyit };\n\n//# sourceMappingURL=index.mjs.map","'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7F]/; // Note: U+007F DEL is excluded too.\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n\t'overflow': 'Overflow: input needs wider integers to process',\n\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n\tthrow new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, callback) {\n\tconst result = [];\n\tlet length = array.length;\n\twhile (length--) {\n\t\tresult[length] = callback(array[length]);\n\t}\n\treturn result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {String} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(domain, callback) {\n\tconst parts = domain.split('@');\n\tlet result = '';\n\tif (parts.length > 1) {\n\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t// the local part (i.e. everything up to `@`) intact.\n\t\tresult = parts[0] + '@';\n\t\tdomain = parts[1];\n\t}\n\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\tdomain = domain.replace(regexSeparators, '\\x2E');\n\tconst labels = domain.split('.');\n\tconst encoded = map(labels, callback).join('.');\n\treturn result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n\tconst output = [];\n\tlet counter = 0;\n\tconst length = string.length;\n\twhile (counter < length) {\n\t\tconst value = string.charCodeAt(counter++);\n\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t// It's a high surrogate, and there is a next character.\n\t\t\tconst extra = string.charCodeAt(counter++);\n\t\t\tif ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t} else {\n\t\t\t\t// It's an unmatched surrogate; only append this code unit, in case the\n\t\t\t\t// next code unit is the high surrogate of a surrogate pair.\n\t\t\t\toutput.push(value);\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t} else {\n\t\t\toutput.push(value);\n\t\t}\n\t}\n\treturn output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = codePoints => String.fromCodePoint(...codePoints);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n\tif (codePoint >= 0x30 && codePoint < 0x3A) {\n\t\treturn 26 + (codePoint - 0x30);\n\t}\n\tif (codePoint >= 0x41 && codePoint < 0x5B) {\n\t\treturn codePoint - 0x41;\n\t}\n\tif (codePoint >= 0x61 && codePoint < 0x7B) {\n\t\treturn codePoint - 0x61;\n\t}\n\treturn base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n\t//  0..25 map to ASCII a..z or A..Z\n\t// 26..35 map to ASCII 0..9\n\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n\tlet k = 0;\n\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\tdelta += floor(delta / numPoints);\n\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\tdelta = floor(delta / baseMinusTMin);\n\t}\n\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n\t// Don't use UCS-2.\n\tconst output = [];\n\tconst inputLength = input.length;\n\tlet i = 0;\n\tlet n = initialN;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points: let `basic` be the number of input code\n\t// points before the last delimiter, or `0` if there is none, then copy\n\t// the first basic code points to the output.\n\n\tlet basic = input.lastIndexOf(delimiter);\n\tif (basic < 0) {\n\t\tbasic = 0;\n\t}\n\n\tfor (let j = 0; j < basic; ++j) {\n\t\t// if it's not a basic code point\n\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\terror('not-basic');\n\t\t}\n\t\toutput.push(input.charCodeAt(j));\n\t}\n\n\t// Main decoding loop: start just after the last delimiter if any basic code\n\t// points were copied; start at the beginning otherwise.\n\n\tfor (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t// `index` is the index of the next character to be consumed.\n\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t// which gets added to `i`. The overflow checking is easier\n\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t// value at the end to obtain `delta`.\n\t\tconst oldi = i;\n\t\tfor (let w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\tif (index >= inputLength) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\n\t\t\tconst digit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\tif (digit >= base) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\t\t\tif (digit > floor((maxInt - i) / w)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\ti += digit * w;\n\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\tif (digit < t) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst baseMinusT = base - t;\n\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tw *= baseMinusT;\n\n\t\t}\n\n\t\tconst out = output.length + 1;\n\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t// incrementing `n` each time, so we'll fix that now:\n\t\tif (floor(i / out) > maxInt - n) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tn += floor(i / out);\n\t\ti %= out;\n\n\t\t// Insert `n` at position `i` of the output.\n\t\toutput.splice(i++, 0, n);\n\n\t}\n\n\treturn String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n\tconst output = [];\n\n\t// Convert the input in UCS-2 to an array of Unicode code points.\n\tinput = ucs2decode(input);\n\n\t// Cache the length.\n\tconst inputLength = input.length;\n\n\t// Initialize the state.\n\tlet n = initialN;\n\tlet delta = 0;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points.\n\tfor (const currentValue of input) {\n\t\tif (currentValue < 0x80) {\n\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t}\n\t}\n\n\tconst basicLength = output.length;\n\tlet handledCPCount = basicLength;\n\n\t// `handledCPCount` is the number of code points that have been handled;\n\t// `basicLength` is the number of basic code points.\n\n\t// Finish the basic string with a delimiter unless it's empty.\n\tif (basicLength) {\n\t\toutput.push(delimiter);\n\t}\n\n\t// Main encoding loop:\n\twhile (handledCPCount < inputLength) {\n\n\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t// larger one:\n\t\tlet m = maxInt;\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\tm = currentValue;\n\t\t\t}\n\t\t}\n\n\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t// but guard against overflow.\n\t\tconst handledCPCountPlusOne = handledCPCount + 1;\n\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\tn = m;\n\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\t\t\tif (currentValue === n) {\n\t\t\t\t// Represent delta as a generalized variable-length integer.\n\t\t\t\tlet q = delta;\n\t\t\t\tfor (let k = base; /* no condition */; k += base) {\n\t\t\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tconst qMinusT = q - t;\n\t\t\t\t\tconst baseMinusT = base - t;\n\t\t\t\t\toutput.push(\n\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t);\n\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t}\n\n\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);\n\t\t\t\tdelta = 0;\n\t\t\t\t++handledCPCount;\n\t\t\t}\n\t\t}\n\n\t\t++delta;\n\t\t++n;\n\n\t}\n\treturn output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexPunycode.test(string)\n\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t: string;\n\t});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexNonASCII.test(string)\n\t\t\t? 'xn--' + encode(string)\n\t\t\t: string;\n\t});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n\t/**\n\t * A string representing the current Punycode.js version number.\n\t * @memberOf punycode\n\t * @type String\n\t */\n\t'version': '2.3.1',\n\t/**\n\t * An object of methods to convert from JavaScript's internal character\n\t * representation (UCS-2) to Unicode code points, and back.\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode\n\t * @type Object\n\t */\n\t'ucs2': {\n\t\t'decode': ucs2decode,\n\t\t'encode': ucs2encode\n\t},\n\t'decode': decode,\n\t'encode': encode,\n\t'toASCII': toASCII,\n\t'toUnicode': toUnicode\n};\n\nexport { ucs2decode, ucs2encode, decode, encode, toASCII, toUnicode };\nexport default punycode;\n","/*! markdown-it 15.0.3 https://github.com/markdown-it/markdown-it @license MIT */\nimport * as mdurl from \"mdurl\";\nimport * as ucmicro from \"uc.micro\";\nimport { decodeHTMLStrict } from \"entities\";\nimport { LinkifyIt } from \"linkify-it\";\nimport punycode from \"punycode.js\";\n//#region \\0rolldown/runtime.js\nvar __defProp = Object.defineProperty;\nvar __exportAll = (all, no_symbols) => {\n\tlet target = {};\n\tfor (var name in all) __defProp(target, name, {\n\t\tget: all[name],\n\t\tenumerable: true\n\t});\n\tif (!no_symbols) __defProp(target, Symbol.toStringTag, { value: \"Module\" });\n\treturn target;\n};\n//#endregion\n//#region src/common/utils.ts\n/**\n* Common utility functions exposed through `md.utils` for use by plugins.\n*\n* @module md.utils\n*/\nvar utils_exports = /* @__PURE__ */ __exportAll({\n\tarrayReplaceAt: () => arrayReplaceAt,\n\tasciiTrim: () => asciiTrim,\n\tcallable: () => callable,\n\tescapeHtml: () => escapeHtml,\n\tescapeRE: () => escapeRE,\n\tfromCodePoint: () => fromCodePoint,\n\tisMdAsciiPunct: () => isMdAsciiPunct,\n\tisPunctChar: () => isPunctChar,\n\tisPunctCharCode: () => isPunctCharCode,\n\tisSpace: () => isSpace,\n\tisValidEntityCode: () => isValidEntityCode,\n\tisWhiteSpace: () => isWhiteSpace,\n\tlib: () => lib,\n\tnormalizeReference: () => normalizeReference,\n\tunescapeAll: () => unescapeAll,\n\tunescapeMd: () => unescapeMd\n});\nfunction callable(cls) {\n\tconst wrapper = function(...args) {\n\t\treturn Reflect.construct(cls, args, new.target && new.target !== wrapper ? new.target : cls);\n\t};\n\tObject.defineProperty(wrapper, \"name\", { value: cls.name });\n\tObject.setPrototypeOf(wrapper, cls);\n\twrapper.prototype = cls.prototype;\n\treturn wrapper;\n}\n/**\n* Returns a copy of a token array with the token at `pos` replaced by\n* `newElements`. Used to transform token streams without modifying the\n* original array.\n*/\nfunction arrayReplaceAt(src, pos, newElements) {\n\treturn [].concat(src.slice(0, pos), newElements, src.slice(pos + 1));\n}\n/** Checks whether a code point can be decoded from a numeric HTML entity. */\nfunction isValidEntityCode(c) {\n\tif (c >= 55296 && c <= 57343) return false;\n\tif (c >= 64976 && c <= 65007) return false;\n\tif ((c & 65535) === 65535 || (c & 65535) === 65534) return false;\n\tif (c >= 0 && c <= 8) return false;\n\tif (c === 11) return false;\n\tif (c >= 14 && c <= 31) return false;\n\tif (c >= 127 && c <= 159) return false;\n\tif (c > 1114111) return false;\n\treturn true;\n}\n/**\n* Converts a Unicode code point to a string, like `String.fromCodePoint()`,\n* but does not throw for invalid input.\n*/\nfunction fromCodePoint(c) {\n\tif (c > 65535) {\n\t\tc -= 65536;\n\t\tconst surrogate1 = 55296 + (c >> 10);\n\t\tconst surrogate2 = 56320 + (c & 1023);\n\t\treturn String.fromCharCode(surrogate1, surrogate2);\n\t}\n\treturn String.fromCharCode(c);\n}\nvar UNESCAPE_MD_RE = /\\\\([!\"#$%&'()*+,\\-./:;<=>?@[\\\\\\]^_`{|}~])/g;\nvar UNESCAPE_ALL_RE = new RegExp(`${UNESCAPE_MD_RE.source}|${/&([a-z#][a-z0-9]{1,31});/gi.source}`, \"gi\");\nvar DIGITAL_ENTITY_TEST_RE = /^#((?:x[a-f0-9]{1,8}|[0-9]{1,8}))$/i;\nfunction replaceEntityPattern(match, name) {\n\tif (name.charCodeAt(0) === 35 && DIGITAL_ENTITY_TEST_RE.test(name)) {\n\t\tconst code = name[1].toLowerCase() === \"x\" ? parseInt(name.slice(2), 16) : parseInt(name.slice(1), 10);\n\t\tif (isValidEntityCode(code)) return fromCodePoint(code);\n\t\treturn match;\n\t}\n\tconst decoded = decodeHTMLStrict(match);\n\tif (decoded !== match) return decoded;\n\treturn match;\n}\n/** Decodes Markdown backslash escapes. */\nfunction unescapeMd(str) {\n\tif (str.indexOf(\"\\\\\") < 0) return str;\n\treturn str.replace(UNESCAPE_MD_RE, \"$1\");\n}\n/**\n* Decodes Markdown backslash escapes and HTML character references in link\n* destinations, link titles, and fenced code info strings.\n*/\nfunction unescapeAll(str) {\n\tif (str.indexOf(\"\\\\\") < 0 && str.indexOf(\"&\") < 0) return str;\n\treturn str.replace(UNESCAPE_ALL_RE, function(match, escaped, entity) {\n\t\tif (escaped) return escaped;\n\t\treturn replaceEntityPattern(match, entity);\n\t});\n}\nvar HTML_ESCAPE_TEST_RE = /[&<>\"]/;\nvar HTML_ESCAPE_REPLACE_RE = /[&<>\"]/g;\nvar HTML_REPLACEMENTS = {\n\t\"&\": \"&amp;\",\n\t\"<\": \"&lt;\",\n\t\">\": \"&gt;\",\n\t\"\\\"\": \"&quot;\"\n};\nfunction replaceUnsafeChar(ch) {\n\treturn HTML_REPLACEMENTS[ch];\n}\n/** Escapes HTML special characters in a string. */\nfunction escapeHtml(str) {\n\tif (HTML_ESCAPE_TEST_RE.test(str)) return str.replace(HTML_ESCAPE_REPLACE_RE, replaceUnsafeChar);\n\treturn str;\n}\nvar REGEXP_ESCAPE_RE = /[.?*+^$[\\]\\\\(){}|-]/g;\n/** Escapes regular expression metacharacters in a string. */\nfunction escapeRE(str) {\n\treturn str.replace(REGEXP_ESCAPE_RE, \"\\\\$&\");\n}\n/** Checks whether a character code is an ASCII space or tab. */\nfunction isSpace(code) {\n\tswitch (code) {\n\t\tcase 9:\n\t\tcase 32: return true;\n\t}\n\treturn false;\n}\n/**\n* Checks whether a character code is whitespace recognized by Markdown.\n*\n* Matches the Unicode `Zs` category or `\\t`, `\\f`, `\\v`, `\\r`, `\\n`.\n*/\nfunction isWhiteSpace(code) {\n\tif (code >= 8192 && code <= 8202) return true;\n\tswitch (code) {\n\t\tcase 9:\n\t\tcase 10:\n\t\tcase 11:\n\t\tcase 12:\n\t\tcase 13:\n\t\tcase 32:\n\t\tcase 160:\n\t\tcase 5760:\n\t\tcase 8239:\n\t\tcase 8287:\n\t\tcase 12288: return true;\n\t}\n\treturn false;\n}\n/**\n* Checks whether a character is Unicode punctuation or a symbol.\n*\n* Does not support astral characters.\n*/\nfunction isPunctChar(ch) {\n\treturn ucmicro.P.test(ch) || ucmicro.S.test(ch);\n}\n/** Checks whether a Unicode code point is punctuation or a symbol. */\nfunction isPunctCharCode(code) {\n\treturn isPunctChar(fromCodePoint(code));\n}\n/**\n* Markdown ASCII punctuation characters.\n*\n*     !, \", #, $, %, &, ', (, ), *, +, ,, -, ., /, :, ;, <, =, >, ?, @,\n*     [, \\, ], ^, _, `, {, |, }, or ~\n*\n* http://spec.commonmark.org/0.15/#ascii-punctuation-character\n*\n* Don't confuse with Unicode punctuation. It lacks some characters in the\n* ASCII range.\n*/\nfunction isMdAsciiPunct(ch) {\n\tswitch (ch) {\n\t\tcase 33:\n\t\tcase 34:\n\t\tcase 35:\n\t\tcase 36:\n\t\tcase 37:\n\t\tcase 38:\n\t\tcase 39:\n\t\tcase 40:\n\t\tcase 41:\n\t\tcase 42:\n\t\tcase 43:\n\t\tcase 44:\n\t\tcase 45:\n\t\tcase 46:\n\t\tcase 47:\n\t\tcase 58:\n\t\tcase 59:\n\t\tcase 60:\n\t\tcase 61:\n\t\tcase 62:\n\t\tcase 63:\n\t\tcase 64:\n\t\tcase 91:\n\t\tcase 92:\n\t\tcase 93:\n\t\tcase 94:\n\t\tcase 95:\n\t\tcase 96:\n\t\tcase 123:\n\t\tcase 124:\n\t\tcase 125:\n\t\tcase 126: return true;\n\t\tdefault: return false;\n\t}\n}\n/** Normalizes `[reference labels]` for case-insensitive lookup. */\nfunction normalizeReference(str) {\n\tstr = str.trim().replace(/\\s+/g, \" \");\n\treturn str.toLowerCase().toUpperCase();\n}\nfunction isAsciiTrimmable(c) {\n\treturn c === 32 || c === 9 || c === 10 || c === 13;\n}\n/**\n* \"Light\" `.trim()` for blocks (headings, paragraphs), where Unicode spaces\n* should be preserved.\n*/\nfunction asciiTrim(str) {\n\tlet start = 0;\n\tfor (; start < str.length; start++) if (!isAsciiTrimmable(str.charCodeAt(start))) break;\n\tlet end = str.length - 1;\n\tfor (; end >= start; end--) if (!isAsciiTrimmable(str.charCodeAt(end))) break;\n\treturn str.slice(start, end + 1);\n}\n/**\n* Libraries commonly used by markdown-it and its plugins, re-exported to\n* reduce duplicate dependencies in browser bundles.\n*/\nvar lib = {\n\tmdurl,\n\tucmicro\n};\n//#endregion\n//#region src/helpers/parse_link_label.ts\n/** Finds the end of a link or image label (`[label]`). */\nfunction parseLinkLabel(state, start, disableNested) {\n\tlet level, found, marker, prevPos;\n\tconst max = state.posMax;\n\tconst oldPos = state.pos;\n\tstate.pos = start + 1;\n\tlevel = 1;\n\twhile (state.pos < max) {\n\t\tmarker = state.src.charCodeAt(state.pos);\n\t\tif (marker === 93) {\n\t\t\tlevel--;\n\t\t\tif (level === 0) {\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tprevPos = state.pos;\n\t\tstate.md.inline.skipToken(state);\n\t\tif (marker === 91) {\n\t\t\tif (prevPos === state.pos - 1) level++;\n\t\t\telse if (disableNested) {\n\t\t\t\tstate.pos = oldPos;\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\t}\n\tlet labelEnd = -1;\n\tif (found) labelEnd = state.pos;\n\tstate.pos = oldPos;\n\treturn labelEnd;\n}\n//#endregion\n//#region src/helpers/parse_link_destination.ts\n/** Parses the destination in `[label](destination \"title\")`. */\nfunction parseLinkDestination(str, start, max) {\n\tlet code;\n\tlet pos = start;\n\tconst result = {\n\t\tok: false,\n\t\tpos: 0,\n\t\tstr: \"\"\n\t};\n\tif (str.charCodeAt(pos) === 60) {\n\t\tpos++;\n\t\twhile (pos < max) {\n\t\t\tcode = str.charCodeAt(pos);\n\t\t\tif (code === 10) return result;\n\t\t\tif (code === 60) return result;\n\t\t\tif (code === 62) {\n\t\t\t\tresult.pos = pos + 1;\n\t\t\t\tresult.str = unescapeAll(str.slice(start + 1, pos));\n\t\t\t\tresult.ok = true;\n\t\t\t\treturn result;\n\t\t\t}\n\t\t\tif (code === 92 && pos + 1 < max) {\n\t\t\t\tpos += 2;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tpos++;\n\t\t}\n\t\treturn result;\n\t}\n\tlet level = 0;\n\twhile (pos < max) {\n\t\tcode = str.charCodeAt(pos);\n\t\tif (code === 32) break;\n\t\tif (code < 32 || code === 127) break;\n\t\tif (code === 92 && pos + 1 < max) {\n\t\t\tif (str.charCodeAt(pos + 1) === 32) {\n\t\t\t\tpos++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tpos += 2;\n\t\t\tcontinue;\n\t\t}\n\t\tif (code === 40) {\n\t\t\tlevel++;\n\t\t\tif (level > 32) return result;\n\t\t}\n\t\tif (code === 41) {\n\t\t\tif (level === 0) break;\n\t\t\tlevel--;\n\t\t}\n\t\tpos++;\n\t}\n\tif (start === pos) return result;\n\tif (level !== 0) return result;\n\tresult.str = unescapeAll(str.slice(start, pos));\n\tresult.pos = pos;\n\tresult.ok = true;\n\treturn result;\n}\n//#endregion\n//#region src/helpers/parse_link_title.ts\n/**\n* Parses the optional title in `[label](destination \"title\")` or\n* `[label]: destination \"title\"`.\n*\n* `prev_state` continues a reference title on the next source line.\n*/\nfunction parseLinkTitle(str, start, max, prev_state) {\n\tlet code;\n\tlet pos = start;\n\tconst state = {\n\t\tok: false,\n\t\tcan_continue: false,\n\t\tpos: 0,\n\t\tstr: \"\",\n\t\tmarker: 0\n\t};\n\tif (prev_state) {\n\t\tstate.str = prev_state.str;\n\t\tstate.marker = prev_state.marker;\n\t} else {\n\t\tif (pos >= max) return state;\n\t\tlet marker = str.charCodeAt(pos);\n\t\tif (marker !== 34 && marker !== 39 && marker !== 40) return state;\n\t\tstart++;\n\t\tpos++;\n\t\tif (marker === 40) marker = 41;\n\t\tstate.marker = marker;\n\t}\n\twhile (pos < max) {\n\t\tcode = str.charCodeAt(pos);\n\t\tif (code === state.marker) {\n\t\t\tstate.pos = pos + 1;\n\t\t\tstate.str += unescapeAll(str.slice(start, pos));\n\t\t\tstate.ok = true;\n\t\t\treturn state;\n\t\t} else if (code === 40 && state.marker === 41) return state;\n\t\telse if (code === 92 && pos + 1 < max) pos++;\n\t\tpos++;\n\t}\n\tstate.can_continue = true;\n\tstate.str += unescapeAll(str.slice(start, pos));\n\treturn state;\n}\n//#endregion\n//#region src/helpers/index.ts\n/**\n* Functions used to parse links and images, split out of parser rules because\n* of their size.\n*\n* @module md.helpers\n*/\nvar helpers_exports = /* @__PURE__ */ __exportAll({\n\tparseLinkDestination: () => parseLinkDestination,\n\tparseLinkLabel: () => parseLinkLabel,\n\tparseLinkTitle: () => parseLinkTitle\n});\n//#endregion\n//#region \\0@oxc-project+runtime@0.154.0/helpers/esm/typeof.js\nfunction _typeof(o) {\n\t\"@babel/helpers - typeof\";\n\treturn _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(o) {\n\t\treturn typeof o;\n\t} : function(o) {\n\t\treturn o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n\t}, _typeof(o);\n}\n//#endregion\n//#region \\0@oxc-project+runtime@0.154.0/helpers/esm/toPrimitive.js\nfunction toPrimitive(t, r) {\n\tif (\"object\" != _typeof(t) || !t) return t;\n\tvar e = t[Symbol.toPrimitive];\n\tif (void 0 !== e) {\n\t\tvar i = e.call(t, r || \"default\");\n\t\tif (\"object\" != _typeof(i)) return i;\n\t\tthrow new TypeError(\"@@toPrimitive must return a primitive value.\");\n\t}\n\treturn (\"string\" === r ? String : Number)(t);\n}\n//#endregion\n//#region \\0@oxc-project+runtime@0.154.0/helpers/esm/toPropertyKey.js\nfunction toPropertyKey(t) {\n\tvar i = toPrimitive(t, \"string\");\n\treturn \"symbol\" == _typeof(i) ? i : i + \"\";\n}\n//#endregion\n//#region \\0@oxc-project+runtime@0.154.0/helpers/esm/defineProperty.js\nfunction _defineProperty(e, r, t) {\n\treturn (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n\t\tvalue: t,\n\t\tenumerable: !0,\n\t\tconfigurable: !0,\n\t\twritable: !0\n\t}) : e[r] = t, e;\n}\n//#endregion\n//#region src/token.ts\n/**\n* Represents one item in the parsed token stream, storing parsed data and\n* providing helpers for managing HTML attributes.\n*/\nvar Token = class {\n\tconstructor(type, tag, nesting) {\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Source map info. Format: `[ line_begin, line_end ]`\n\t\t\t*/\n\t\t\t\"map\",\n\t\t\tnull\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* nesting level, the same as `state.level`\n\t\t\t*/\n\t\t\t\"level\",\n\t\t\t0\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* An array of child nodes (inline and img tokens)\n\t\t\t*/\n\t\t\t\"children\",\n\t\t\tnull\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* In a case of self-closing tag (code, html, fence, etc.),\n\t\t\t* it has contents of this tag.\n\t\t\t*/\n\t\t\t\"content\",\n\t\t\t\"\"\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* '*' or '_' for emphasis, fence string for fence, etc.\n\t\t\t*/\n\t\t\t\"markup\",\n\t\t\t\"\"\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Additional information:\n\t\t\t*\n\t\t\t* - Info string for \"fence\" tokens\n\t\t\t* - The value \"auto\" for autolink \"link_open\" and \"link_close\" tokens\n\t\t\t* - The string value of the item marker for ordered-list \"list_item_open\" tokens\n\t\t\t*/\n\t\t\t\"info\",\n\t\t\t\"\"\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* True for block-level tokens, false for inline tokens.\n\t\t\t* Used in renderer to calculate line breaks\n\t\t\t*/\n\t\t\t\"block\",\n\t\t\tfalse\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* If it's true, ignore this element when rendering. Used for tight lists\n\t\t\t* to hide paragraphs.\n\t\t\t*/\n\t\t\t\"hidden\",\n\t\t\tfalse\n\t\t);\n\t\tthis.type = type;\n\t\tthis.tag = tag;\n\t\tthis.attrs = null;\n\t\tthis.nesting = nesting;\n\t\tthis.meta = null;\n\t}\n\t/**\n\t* Search attribute index by name.\n\t*/\n\tattrIndex(name) {\n\t\tif (!this.attrs) return -1;\n\t\tconst attrs = this.attrs;\n\t\tfor (let i = 0, len = attrs.length; i < len; i++) if (attrs[i][0] === name) return i;\n\t\treturn -1;\n\t}\n\t/**\n\t* Add `[ name, value ]` attribute to list. Init attrs if necessary\n\t*/\n\tattrPush(attrData) {\n\t\tif (this.attrs) this.attrs.push(attrData);\n\t\telse this.attrs = [attrData];\n\t}\n\t/**\n\t* Set `name` attribute to `value`. Override old value if exists.\n\t*/\n\tattrSet(name, value) {\n\t\tconst idx = this.attrIndex(name);\n\t\tconst attrData = [name, value];\n\t\tif (idx < 0) this.attrPush(attrData);\n\t\telse this.attrs[idx] = attrData;\n\t}\n\t/**\n\t* Get the value of attribute `name`, or null if it does not exist.\n\t*/\n\tattrGet(name) {\n\t\tconst idx = this.attrIndex(name);\n\t\tlet value = null;\n\t\tif (idx >= 0) value = this.attrs[idx][1];\n\t\treturn value;\n\t}\n\t/**\n\t* Join value to existing attribute via space. Or create new attribute if not\n\t* exists. Useful to operate with token classes.\n\t*/\n\tattrJoin(name, value) {\n\t\tconst idx = this.attrIndex(name);\n\t\tif (idx < 0) this.attrPush([name, value]);\n\t\telse this.attrs[idx][1] = `${this.attrs[idx][1]} ${value}`;\n\t}\n};\n//#endregion\n//#region src/ruler.ts\n/**\n* Helper class, used by {@link MarkdownIt.core}, {@link MarkdownIt.block} and\n* {@link MarkdownIt.inline} to manage sequences of functions (rules):\n*\n* - keep rules in defined order\n* - assign the name to each rule\n* - enable/disable rules\n* - add/replace rules\n* - allow assign rules to additional named chains (in the same)\n* - cacheing lists of active rules\n*\n* You will not need use this class directly until write plugins. For simple\n* rules control use {@link MarkdownIt.disable}, {@link MarkdownIt.enable} and\n* {@link MarkdownIt.use}.\n*/\nvar Ruler = class {\n\tconstructor() {\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/** @internal */\n\t\t\t\"__rules__\",\n\t\t\t[]\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/** @internal */\n\t\t\t\"__cache__\",\n\t\t\tnull\n\t\t);\n\t}\n\t/** @internal */\n\t__find__(name) {\n\t\tfor (let i = 0; i < this.__rules__.length; i++) if (this.__rules__[i].name === name) return i;\n\t\treturn -1;\n\t}\n\t/** @internal */\n\t__compile__() {\n\t\tconst chains = /* @__PURE__ */ new Set();\n\t\tthis.__rules__.forEach((rule) => {\n\t\t\tif (!rule.enabled) return;\n\t\t\trule.alt.forEach((altName) => {\n\t\t\t\tif (altName) chains.add(altName);\n\t\t\t});\n\t\t});\n\t\tthis.__cache__ = Object.create(null);\n\t\tthis.__cache__[\"\"] = [];\n\t\tthis.__rules__.forEach((rule) => {\n\t\t\tif (rule.enabled) this.__cache__[\"\"].push(rule.fn);\n\t\t});\n\t\tchains.forEach((chain) => {\n\t\t\tthis.__cache__[chain] = [];\n\t\t\tthis.__rules__.forEach((rule) => {\n\t\t\t\tif (rule.enabled && rule.alt.indexOf(chain) >= 0) this.__cache__[chain].push(rule.fn);\n\t\t\t});\n\t\t});\n\t}\n\t/**\n\t* Replace rule by name with new function & options. Throws error if name not\n\t* found.\n\t*\n\t* @example Replace existing typographer replacement rule with new one\n\t* ```javascript\n\t* import MarkdownIt from 'markdown-it'\n\t* const md = new MarkdownIt()\n\t*\n\t* md.core.ruler.at('replacements', function replace(state) {\n\t*   //...\n\t* });\n\t* ```\n\t*/\n\tat(name, fn, options = {}) {\n\t\tconst index = this.__find__(name);\n\t\tif (index === -1) throw new Error(`Parser rule not found: ${name}`);\n\t\tthis.__rules__[index].fn = fn;\n\t\tthis.__rules__[index].alt = options.alt || [];\n\t\tthis.__cache__ = null;\n\t}\n\t/**\n\t* Add new rule to chain before one with given name. See also\n\t* {@link Ruler.after}, {@link Ruler.push}.\n\t*\n\t* @example\n\t* ```javascript\n\t* import MarkdownIt from 'markdown-it'\n\t* const md = new MarkdownIt()\n\t*\n\t* md.block.ruler.before('paragraph', 'my_rule', function replace(state) {\n\t*   //...\n\t* });\n\t* ```\n\t*/\n\tbefore(beforeName, ruleName, fn, options = {}) {\n\t\tconst index = this.__find__(beforeName);\n\t\tif (index === -1) throw new Error(`Parser rule not found: ${beforeName}`);\n\t\tthis.__rules__.splice(index, 0, {\n\t\t\tname: ruleName,\n\t\t\tenabled: true,\n\t\t\tfn,\n\t\t\talt: options.alt || []\n\t\t});\n\t\tthis.__cache__ = null;\n\t}\n\t/**\n\t* Add new rule to chain after one with given name. See also\n\t* {@link Ruler.before}, {@link Ruler.push}.\n\t*\n\t* @example\n\t* ```javascript\n\t* import MarkdownIt from 'markdown-it'\n\t* const md = new MarkdownIt()\n\t*\n\t* md.inline.ruler.after('text', 'my_rule', function replace(state) {\n\t*   //...\n\t* });\n\t* ```\n\t*/\n\tafter(afterName, ruleName, fn, options = {}) {\n\t\tconst index = this.__find__(afterName);\n\t\tif (index === -1) throw new Error(`Parser rule not found: ${afterName}`);\n\t\tthis.__rules__.splice(index + 1, 0, {\n\t\t\tname: ruleName,\n\t\t\tenabled: true,\n\t\t\tfn,\n\t\t\talt: options.alt || []\n\t\t});\n\t\tthis.__cache__ = null;\n\t}\n\t/**\n\t* Push new rule to the end of chain. See also\n\t* {@link Ruler.before}, {@link Ruler.after}.\n\t*\n\t* @example\n\t* ```javascript\n\t* import MarkdownIt from 'markdown-it'\n\t* const md = new MarkdownIt()\n\t*\n\t* md.core.ruler.push('my_rule', function replace(state) {\n\t*   //...\n\t* });\n\t* ```\n\t*/\n\tpush(ruleName, fn, options = {}) {\n\t\tthis.__rules__.push({\n\t\t\tname: ruleName,\n\t\t\tenabled: true,\n\t\t\tfn,\n\t\t\talt: options.alt || []\n\t\t});\n\t\tthis.__cache__ = null;\n\t}\n\t/**\n\t* Enable rules with given names. If any rule name not found - throw Error.\n\t* Errors can be disabled by second param.\n\t*\n\t* See also {@link Ruler.disable}, {@link Ruler.enableOnly}.\n\t*\n\t* Returns list of found rule names (if no exception happened).\n\t*/\n\tenable(list, ignoreInvalid = false) {\n\t\tif (!Array.isArray(list)) list = [list];\n\t\tconst result = [];\n\t\tlist.forEach((name) => {\n\t\t\tconst idx = this.__find__(name);\n\t\t\tif (idx < 0) {\n\t\t\t\tif (ignoreInvalid) return;\n\t\t\t\tthrow new Error(`Rules manager: invalid rule name ${name}`);\n\t\t\t}\n\t\t\tthis.__rules__[idx].enabled = true;\n\t\t\tresult.push(name);\n\t\t});\n\t\tthis.__cache__ = null;\n\t\treturn result;\n\t}\n\t/**\n\t* Enable rules with given names, and disable everything else. If any rule name\n\t* not found - throw Error. Errors can be disabled by second param.\n\t*\n\t* See also {@link Ruler.disable}, {@link Ruler.enable}.\n\t*/\n\tenableOnly(list, ignoreInvalid = false) {\n\t\tif (!Array.isArray(list)) list = [list];\n\t\tthis.__rules__.forEach((rule) => {\n\t\t\trule.enabled = false;\n\t\t});\n\t\tthis.enable(list, ignoreInvalid);\n\t}\n\t/**\n\t* Disable rules with given names. If any rule name not found - throw Error.\n\t* Errors can be disabled by second param.\n\t*\n\t* See also {@link Ruler.enable}, {@link Ruler.enableOnly}.\n\t*\n\t* Returns list of found rule names (if no exception happened).\n\t*/\n\tdisable(list, ignoreInvalid = false) {\n\t\tif (!Array.isArray(list)) list = [list];\n\t\tconst result = [];\n\t\tlist.forEach((name) => {\n\t\t\tconst idx = this.__find__(name);\n\t\t\tif (idx < 0) {\n\t\t\t\tif (ignoreInvalid) return;\n\t\t\t\tthrow new Error(`Rules manager: invalid rule name ${name}`);\n\t\t\t}\n\t\t\tthis.__rules__[idx].enabled = false;\n\t\t\tresult.push(name);\n\t\t});\n\t\tthis.__cache__ = null;\n\t\treturn result;\n\t}\n\t/**\n\t* Return array of active functions (rules) for given chain name. It analyzes\n\t* rules configuration, compiles caches if not exists and returns result.\n\t*\n\t* Default chain name is `''` (empty string). It can't be skipped. That's\n\t* done intentionally, to keep signature monomorphic for high speed.\n\t*/\n\tgetRules(chainName) {\n\t\tif (!this.__cache__) this.__compile__();\n\t\treturn this.__cache__[chainName] || [];\n\t}\n};\n//#endregion\n//#region src/renderer.ts\nvar default_rules = {};\ndefault_rules.code_inline = function(tokens, idx, options, env, slf) {\n\tconst token = tokens[idx];\n\treturn `<code${slf.renderAttrs(token)}>${escapeHtml(token.content)}</code>`;\n};\ndefault_rules.code_block = function(tokens, idx, options, env, slf) {\n\tconst token = tokens[idx];\n\treturn `<pre${slf.renderAttrs(token)}><code>${escapeHtml(tokens[idx].content)}</code></pre>\\n`;\n};\ndefault_rules.fence = function(tokens, idx, options, env, slf) {\n\tconst token = tokens[idx];\n\tconst info = token.info ? unescapeAll(token.info).trim() : \"\";\n\tlet langName = \"\";\n\tlet langAttrs = \"\";\n\tif (info) {\n\t\tconst arr = info.split(/(\\s+)/g);\n\t\tlangName = arr[0];\n\t\tlangAttrs = arr.slice(2).join(\"\");\n\t}\n\tlet highlighted;\n\tif (options.highlight) highlighted = options.highlight(token.content, langName, langAttrs) || escapeHtml(token.content);\n\telse highlighted = escapeHtml(token.content);\n\tif (highlighted.indexOf(\"<pre\") === 0) return highlighted + \"\\n\";\n\tif (info) {\n\t\tconst i = token.attrIndex(\"class\");\n\t\tconst tmpAttrs = token.attrs ? token.attrs.slice() : [];\n\t\tif (i < 0) tmpAttrs.push([\"class\", `${options.langPrefix}${langName}`]);\n\t\telse {\n\t\t\ttmpAttrs[i] = [tmpAttrs[i][0], tmpAttrs[i][1]];\n\t\t\ttmpAttrs[i][1] += ` ${options.langPrefix}${langName}`;\n\t\t}\n\t\tconst tmpToken = { attrs: tmpAttrs };\n\t\treturn `<pre><code${slf.renderAttrs(tmpToken)}>${highlighted}</code></pre>\\n`;\n\t}\n\treturn `<pre><code${slf.renderAttrs(token)}>${highlighted}</code></pre>\\n`;\n};\ndefault_rules.image = function(tokens, idx, options, env, slf) {\n\tconst token = tokens[idx];\n\ttoken.attrs[token.attrIndex(\"alt\")][1] = slf.renderInlineAsText(token.children, options, env);\n\treturn slf.renderToken(tokens, idx, options);\n};\ndefault_rules.hardbreak = function(tokens, idx, options) {\n\treturn options.xhtmlOut ? \"<br />\\n\" : \"<br>\\n\";\n};\ndefault_rules.softbreak = function(tokens, idx, options) {\n\treturn options.breaks ? options.xhtmlOut ? \"<br />\\n\" : \"<br>\\n\" : \"\\n\";\n};\ndefault_rules.text = function(tokens, idx) {\n\treturn escapeHtml(tokens[idx].content);\n};\ndefault_rules.html_block = function(tokens, idx) {\n\treturn tokens[idx].content;\n};\ndefault_rules.html_inline = function(tokens, idx) {\n\treturn tokens[idx].content;\n};\n/**\n* Generates HTML from parsed token stream. Each instance has independent\n* copy of rules. Those can be rewritten with ease. Also, you can add new\n* rules if you create plugin and adds new token types.\n*\n* Creates new renderer instance and fills {@link Renderer.rules} with defaults.\n*/\nvar Renderer = class {\n\tconstructor() {\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Contains render rules for tokens. Can be updated and extended.\n\t\t\t*\n\t\t\t* See [source code](https://github.com/markdown-it/markdown-it/blob/master/src/renderer.ts)\n\t\t\t* for more details and examples.\n\t\t\t*\n\t\t\t* @example Custom render rules\n\t\t\t* ```javascript\n\t\t\t* import MarkdownIt from 'markdown-it'\n\t\t\t* const md = new MarkdownIt()\n\t\t\t*\n\t\t\t* md.renderer.rules.strong_open  = function () { return '<b>'; };\n\t\t\t* md.renderer.rules.strong_close = function () { return '</b>'; };\n\t\t\t*\n\t\t\t* const result = md.renderInline(...);\n\t\t\t* ```\n\t\t\t*\n\t\t\t* @example Each rule is called as independent static function with fixed signature\n\t\t\t* ```javascript\n\t\t\t* function my_token_render(tokens, idx, options, env, renderer) {\n\t\t\t*   // ...\n\t\t\t*   return renderedHTML;\n\t\t\t* }\n\t\t\t* ```\n\t\t\t*/\n\t\t\t\"rules\",\n\t\t\tObject.assign({}, default_rules)\n\t\t);\n\t}\n\t/**\n\t* Render token attributes to string.\n\t*/\n\trenderAttrs(token) {\n\t\tlet i, l, result;\n\t\tif (!token.attrs) return \"\";\n\t\tresult = \"\";\n\t\tfor (i = 0, l = token.attrs.length; i < l; i++) result += ` ${escapeHtml(token.attrs[i][0])}=\"${escapeHtml(String(token.attrs[i][1]))}\"`;\n\t\treturn result;\n\t}\n\t/**\n\t* Default token renderer. Can be overriden by custom function\n\t* in {@link Renderer.rules}.\n\t*/\n\trenderToken(tokens, idx, options) {\n\t\tconst token = tokens[idx];\n\t\tlet result = \"\";\n\t\tif (token.hidden) return \"\";\n\t\tlet prev = idx - 1;\n\t\twhile (prev >= 0 && tokens[prev].hidden && tokens[prev].nesting === 0) prev--;\n\t\tif (token.block && token.nesting !== -1 && prev >= 0 && tokens[prev].hidden && tokens[prev].nesting === -1) result += \"\\n\";\n\t\tresult += (token.nesting === -1 ? \"</\" : \"<\") + token.tag;\n\t\tresult += this.renderAttrs(token);\n\t\tif (token.nesting === 0 && options.xhtmlOut) result += \" /\";\n\t\tlet needLf = false;\n\t\tif (token.block) {\n\t\t\tneedLf = true;\n\t\t\tif (token.nesting === 1) {\n\t\t\t\tlet next = idx + 1;\n\t\t\t\twhile (next < tokens.length && tokens[next].hidden && tokens[next].nesting === 0) next++;\n\t\t\t\tif (next < tokens.length) {\n\t\t\t\t\tconst nextToken = tokens[next];\n\t\t\t\t\tif (nextToken.type === \"inline\" || nextToken.hidden) needLf = false;\n\t\t\t\t\telse if (nextToken.nesting === -1 && nextToken.tag === token.tag) needLf = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tresult += needLf ? \">\\n\" : \">\";\n\t\treturn result;\n\t}\n\t/**\n\t* The same as {@link Renderer.render}, but for single token of `inline` type.\n\t*/\n\trenderInline(tokens, options, env) {\n\t\tlet result = \"\";\n\t\tconst rules = this.rules;\n\t\tfor (let i = 0, len = tokens.length; i < len; i++) {\n\t\t\tconst type = tokens[i].type;\n\t\t\tif (typeof rules[type] !== \"undefined\") result += rules[type](tokens, i, options, env, this);\n\t\t\telse result += this.renderToken(tokens, i, options);\n\t\t}\n\t\treturn result;\n\t}\n\t/**\n\t* Special kludge for image `alt` attributes to conform CommonMark spec.\n\t* Don't try to use it! Spec requires to show `alt` content with stripped markup,\n\t* instead of simple escaping.\n\t*/\n\trenderInlineAsText(tokens, options, env) {\n\t\tlet result = \"\";\n\t\tfor (let i = 0, len = tokens.length; i < len; i++) switch (tokens[i].type) {\n\t\t\tcase \"text\":\n\t\t\tcase \"code_inline\":\n\t\t\t\tresult += tokens[i].content;\n\t\t\t\tbreak;\n\t\t\tcase \"image\":\n\t\t\t\tresult += this.renderInlineAsText(tokens[i].children, options, env);\n\t\t\t\tbreak;\n\t\t\tcase \"html_inline\":\n\t\t\tcase \"html_block\":\n\t\t\t\tresult += tokens[i].content;\n\t\t\t\tbreak;\n\t\t\tcase \"softbreak\":\n\t\t\tcase \"hardbreak\": result += \"\\n\";\n\t\t}\n\t\treturn result;\n\t}\n\t/**\n\t* Takes token stream and generates HTML. Probably, you will never need to call\n\t* this method directly.\n\t*/\n\trender(tokens, options, env) {\n\t\tlet result = \"\";\n\t\tconst rules = this.rules;\n\t\tfor (let i = 0, len = tokens.length; i < len; i++) {\n\t\t\tconst type = tokens[i].type;\n\t\t\tif (type === \"inline\") result += this.renderInline(tokens[i].children, options, env);\n\t\t\telse if (typeof rules[type] !== \"undefined\") result += rules[type](tokens, i, options, env, this);\n\t\t\telse result += this.renderToken(tokens, i, options);\n\t\t}\n\t\treturn result;\n\t}\n};\n//#endregion\n//#region src/rules_core/state_core.ts\n/** Mutable state passed through the core rules chain. */\nvar StateCore = class {\n\tconstructor(src, md, env) {\n\t\t_defineProperty(this, \"tokens\", []);\n\t\t_defineProperty(this, \"inlineMode\", false);\n\t\t_defineProperty(this, \"Token\", Token);\n\t\tthis.src = src;\n\t\tthis.env = env;\n\t\tthis.md = md;\n\t}\n};\n//#endregion\n//#region src/rules_core/normalize.ts\nvar UNNORMALIZED_NEWLINE_RE = /\\r\\n?/g;\nvar NULL_RE = /\\0/g;\nfunction normalize(state) {\n\tlet str;\n\tstr = state.src.replace(UNNORMALIZED_NEWLINE_RE, \"\\n\");\n\tstr = str.replace(NULL_RE, \"�\");\n\tstate.src = str;\n}\n//#endregion\n//#region src/rules_core/block.ts\nfunction block(state) {\n\tlet token;\n\tif (state.inlineMode) {\n\t\ttoken = new state.Token(\"inline\", \"\", 0);\n\t\ttoken.content = state.src;\n\t\ttoken.map = [0, 1];\n\t\ttoken.children = [];\n\t\tstate.tokens.push(token);\n\t} else state.md.block.parse(state.src, state.md, state.env, state.tokens);\n}\n//#endregion\n//#region src/rules_core/strip_references.ts\nfunction strip_references(state) {\n\tconst tokens = state.tokens;\n\tlet last = 0;\n\tfor (let curr = 0; curr < tokens.length; curr++) {\n\t\tif (tokens[curr].type === \"reference_definition\") continue;\n\t\tif (curr !== last) tokens[last] = tokens[curr];\n\t\tlast++;\n\t}\n\tif (tokens.length !== last) tokens.length = last;\n}\n//#endregion\n//#region src/rules_core/inline.ts\nfunction inline(state) {\n\tconst tokens = state.tokens;\n\tfor (let i = 0, l = tokens.length; i < l; i++) {\n\t\tconst tok = tokens[i];\n\t\tif (tok.type === \"inline\") state.md.inline.parse(tok.content, state.md, state.env, tok.children);\n\t}\n}\n//#endregion\n//#region src/rules_core/linkify.ts\nfunction isLinkOpen$1(str) {\n\treturn /^<a[>\\s]/i.test(str);\n}\nfunction isLinkClose$1(str) {\n\treturn /^<\\/a\\s*>/i.test(str);\n}\nfunction linkify$1(state) {\n\tconst blockTokens = state.tokens;\n\tif (!state.md.options.linkify) return;\n\tfor (let j = 0, l = blockTokens.length; j < l; j++) {\n\t\tif (blockTokens[j].type !== \"inline\" || !state.md.linkify.test(blockTokens[j].content)) continue;\n\t\tconst tokens = blockTokens[j].children;\n\t\tconst replacements = [];\n\t\tlet htmlLinkLevel = 0;\n\t\tfor (let i = tokens.length - 1; i >= 0; i--) {\n\t\t\tconst currentToken = tokens[i];\n\t\t\tif (currentToken.type === \"link_close\") {\n\t\t\t\ti--;\n\t\t\t\twhile (tokens[i].level !== currentToken.level && tokens[i].type !== \"link_open\") i--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (currentToken.type === \"html_inline\") {\n\t\t\t\tif (isLinkOpen$1(currentToken.content) && htmlLinkLevel > 0) htmlLinkLevel--;\n\t\t\t\tif (isLinkClose$1(currentToken.content)) htmlLinkLevel++;\n\t\t\t}\n\t\t\tif (htmlLinkLevel > 0) continue;\n\t\t\tif (currentToken.type === \"text\" && state.md.linkify.test(currentToken.content)) {\n\t\t\t\tconst text = currentToken.content;\n\t\t\t\tlet links = state.md.linkify.match(text);\n\t\t\t\tconst nodes = [];\n\t\t\t\tlet level = currentToken.level;\n\t\t\t\tlet lastPos = 0;\n\t\t\t\tif (links.length > 0 && links[0].index === 0 && i > 0 && tokens[i - 1].type === \"text_special\") links = links.slice(1);\n\t\t\t\tfor (let ln = 0; ln < links.length; ln++) {\n\t\t\t\t\tconst url = links[ln].url;\n\t\t\t\t\tconst fullUrl = state.md.normalizeLink(url);\n\t\t\t\t\tif (!state.md.validateLink(fullUrl)) continue;\n\t\t\t\t\tlet urlText = links[ln].text;\n\t\t\t\t\tif (!links[ln].schema) urlText = state.md.normalizeLinkText(`http://${urlText}`).replace(/^http:\\/\\//, \"\");\n\t\t\t\t\telse if (links[ln].schema === \"mailto:\" && !/^mailto:/i.test(urlText)) urlText = state.md.normalizeLinkText(`mailto:${urlText}`).replace(/^mailto:/, \"\");\n\t\t\t\t\telse urlText = state.md.normalizeLinkText(urlText);\n\t\t\t\t\tconst pos = links[ln].index;\n\t\t\t\t\tif (pos > lastPos) {\n\t\t\t\t\t\tconst token = new state.Token(\"text\", \"\", 0);\n\t\t\t\t\t\ttoken.content = text.slice(lastPos, pos);\n\t\t\t\t\t\ttoken.level = level;\n\t\t\t\t\t\tnodes.push(token);\n\t\t\t\t\t}\n\t\t\t\t\tconst token_o = new state.Token(\"link_open\", \"a\", 1);\n\t\t\t\t\ttoken_o.attrs = [[\"href\", fullUrl]];\n\t\t\t\t\ttoken_o.level = level++;\n\t\t\t\t\ttoken_o.markup = \"linkify\";\n\t\t\t\t\ttoken_o.info = \"auto\";\n\t\t\t\t\tnodes.push(token_o);\n\t\t\t\t\tconst token_t = new state.Token(\"text\", \"\", 0);\n\t\t\t\t\ttoken_t.content = urlText;\n\t\t\t\t\ttoken_t.level = level;\n\t\t\t\t\tnodes.push(token_t);\n\t\t\t\t\tconst token_c = new state.Token(\"link_close\", \"a\", -1);\n\t\t\t\t\ttoken_c.level = --level;\n\t\t\t\t\ttoken_c.markup = \"linkify\";\n\t\t\t\t\ttoken_c.info = \"auto\";\n\t\t\t\t\tnodes.push(token_c);\n\t\t\t\t\tlastPos = links[ln].lastIndex;\n\t\t\t\t}\n\t\t\t\tif (lastPos < text.length) {\n\t\t\t\t\tconst token = new state.Token(\"text\", \"\", 0);\n\t\t\t\t\ttoken.content = text.slice(lastPos);\n\t\t\t\t\ttoken.level = level;\n\t\t\t\t\tnodes.push(token);\n\t\t\t\t}\n\t\t\t\treplacements.push({\n\t\t\t\t\tindex: i,\n\t\t\t\t\tnodes\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\tif (replacements.length > 0) {\n\t\t\tlet newTokensLength = tokens.length;\n\t\t\tfor (const replacement of replacements) newTokensLength += replacement.nodes.length - 1;\n\t\t\tconst newTokens = new Array(newTokensLength);\n\t\t\tlet replacementIndex = 0;\n\t\t\tlet newTokenIndex = 0;\n\t\t\treplacements.reverse();\n\t\t\tfor (let i = 0; i < tokens.length; i++) {\n\t\t\t\tconst replacement = replacements[replacementIndex];\n\t\t\t\tif ((replacement === null || replacement === void 0 ? void 0 : replacement.index) === i) {\n\t\t\t\t\tfor (const node of replacement.nodes) newTokens[newTokenIndex++] = node;\n\t\t\t\t\treplacementIndex++;\n\t\t\t\t} else newTokens[newTokenIndex++] = tokens[i];\n\t\t\t}\n\t\t\tblockTokens[j].children = newTokens;\n\t\t}\n\t}\n}\n//#endregion\n//#region src/rules_core/replacements.ts\nvar RARE_RE = /\\+-|\\.\\.|\\?\\?\\?\\?|!!!!|,,|--/;\nvar SCOPED_ABBR_TEST_RE = /\\((c|tm|r)\\)/i;\nvar SCOPED_ABBR_RE = /\\((c|tm|r)\\)/gi;\nvar SCOPED_ABBR = {\n\tc: \"©\",\n\tr: \"®\",\n\ttm: \"™\"\n};\nfunction replaceFn(match, name) {\n\treturn SCOPED_ABBR[name.toLowerCase()];\n}\nfunction replace_scoped(inlineTokens) {\n\tlet inside_autolink = 0;\n\tfor (let i = inlineTokens.length - 1; i >= 0; i--) {\n\t\tconst token = inlineTokens[i];\n\t\tif (token.type === \"text\" && !inside_autolink) token.content = token.content.replace(SCOPED_ABBR_RE, replaceFn);\n\t\tif (token.type === \"link_open\" && token.info === \"auto\") inside_autolink--;\n\t\tif (token.type === \"link_close\" && token.info === \"auto\") inside_autolink++;\n\t}\n}\nfunction replace_rare(inlineTokens) {\n\tlet inside_autolink = 0;\n\tfor (let i = inlineTokens.length - 1; i >= 0; i--) {\n\t\tconst token = inlineTokens[i];\n\t\tif (token.type === \"text\" && !inside_autolink) {\n\t\t\tif (RARE_RE.test(token.content)) token.content = token.content.replace(/\\+-/g, \"±\").replace(/\\.{2,}/g, \"…\").replace(/([?!])…/g, \"$1..\").replace(/([?!]){4,}/g, \"$1$1$1\").replace(/,{2,}/g, \",\").replace(/(^|[^-])---(?=[^-]|$)/gm, \"$1—\").replace(/(^|\\s)--(?=\\s|$)/gm, \"$1–\").replace(/(^|[^-\\s])--(?=[^-\\s]|$)/gm, \"$1–\");\n\t\t}\n\t\tif (token.type === \"link_open\" && token.info === \"auto\") inside_autolink--;\n\t\tif (token.type === \"link_close\" && token.info === \"auto\") inside_autolink++;\n\t}\n}\nfunction replace(state) {\n\tlet blkIdx;\n\tif (!state.md.options.typographer) return;\n\tfor (blkIdx = state.tokens.length - 1; blkIdx >= 0; blkIdx--) {\n\t\tif (state.tokens[blkIdx].type !== \"inline\") continue;\n\t\tif (SCOPED_ABBR_TEST_RE.test(state.tokens[blkIdx].content)) replace_scoped(state.tokens[blkIdx].children);\n\t\tif (RARE_RE.test(state.tokens[blkIdx].content)) replace_rare(state.tokens[blkIdx].children);\n\t}\n}\n//#endregion\n//#region src/rules_core/smartquotes.ts\nvar QUOTE_TEST_RE = /['\"]/;\nvar QUOTE_RE = /['\"]/g;\nvar APOSTROPHE = \"’\";\nvar MAX_OPENERS = 1e3;\nfunction truncateStack(stack, heads, length) {\n\twhile (stack.length > length) {\n\t\tconst item = stack.pop();\n\t\tif (item.isSingleQuote) heads.single = item.prevSameQuoteIdx;\n\t\telse heads.double = item.prevSameQuoteIdx;\n\t}\n}\nfunction addReplacement(replacements, tokenIdx, pos, ch) {\n\tif (!replacements[tokenIdx]) replacements[tokenIdx] = [];\n\treplacements[tokenIdx].push({\n\t\tpos,\n\t\tch\n\t});\n}\nfunction applyReplacements(str, replacements) {\n\tlet result = \"\";\n\tlet lastPos = 0;\n\treplacements.sort((a, b) => a.pos - b.pos);\n\tfor (let i = 0; i < replacements.length; i++) {\n\t\tconst replacement = replacements[i];\n\t\tresult += str.slice(lastPos, replacement.pos) + replacement.ch;\n\t\tlastPos = replacement.pos + 1;\n\t}\n\treturn result + str.slice(lastPos);\n}\nfunction process_inlines(tokens, state) {\n\tlet j;\n\tconst stack = [];\n\tconst heads = {\n\t\tsingle: -1,\n\t\tdouble: -1\n\t};\n\tconst replacements = {};\n\tfor (let i = 0; i < tokens.length; i++) {\n\t\tconst token = tokens[i];\n\t\tconst thisLevel = tokens[i].level;\n\t\tfor (j = stack.length - 1; j >= 0; j--) if (stack[j].level <= thisLevel) break;\n\t\ttruncateStack(stack, heads, j + 1);\n\t\tif (token.type !== \"text\") continue;\n\t\tconst text = token.content;\n\t\tlet pos = 0;\n\t\tconst max = text.length;\n\t\tOUTER: while (pos < max) {\n\t\t\tQUOTE_RE.lastIndex = pos;\n\t\t\tconst t = QUOTE_RE.exec(text);\n\t\t\tif (!t) break;\n\t\t\tlet canOpen = true;\n\t\t\tlet canClose = true;\n\t\t\tpos = t.index + 1;\n\t\t\tconst isSingle = t[0] === \"'\";\n\t\t\tlet lastChar = 32;\n\t\t\tif (t.index - 1 >= 0) lastChar = text.charCodeAt(t.index - 1);\n\t\t\telse for (j = i - 1; j >= 0; j--) {\n\t\t\t\tif (tokens[j].type === \"softbreak\" || tokens[j].type === \"hardbreak\") break;\n\t\t\t\tif (!tokens[j].content) continue;\n\t\t\t\tlastChar = tokens[j].content.charCodeAt(tokens[j].content.length - 1);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tlet nextChar = 32;\n\t\t\tif (pos < max) nextChar = text.charCodeAt(pos);\n\t\t\telse for (j = i + 1; j < tokens.length; j++) {\n\t\t\t\tif (tokens[j].type === \"softbreak\" || tokens[j].type === \"hardbreak\") break;\n\t\t\t\tif (!tokens[j].content) continue;\n\t\t\t\tnextChar = tokens[j].content.charCodeAt(0);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tconst isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctCharCode(lastChar);\n\t\t\tconst isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctCharCode(nextChar);\n\t\t\tconst isLastWhiteSpace = isWhiteSpace(lastChar);\n\t\t\tconst isNextWhiteSpace = isWhiteSpace(nextChar);\n\t\t\tif (isNextWhiteSpace) canOpen = false;\n\t\t\telse if (isNextPunctChar) {\n\t\t\t\tif (!(isLastWhiteSpace || isLastPunctChar)) canOpen = false;\n\t\t\t}\n\t\t\tif (isLastWhiteSpace) canClose = false;\n\t\t\telse if (isLastPunctChar) {\n\t\t\t\tif (!(isNextWhiteSpace || isNextPunctChar)) canClose = false;\n\t\t\t}\n\t\t\tif (nextChar === 34 && t[0] === \"\\\"\") {\n\t\t\t\tif (lastChar >= 48 && lastChar <= 57) canClose = canOpen = false;\n\t\t\t}\n\t\t\tif (canOpen && canClose) {\n\t\t\t\tcanOpen = isLastPunctChar;\n\t\t\t\tcanClose = isNextPunctChar;\n\t\t\t}\n\t\t\tif (!canOpen && !canClose) {\n\t\t\t\tif (isSingle) addReplacement(replacements, i, t.index, APOSTROPHE);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (canClose) {\n\t\t\t\tj = isSingle ? heads.single : heads.double;\n\t\t\t\tif (j >= 0 && stack[j].level === thisLevel) {\n\t\t\t\t\tconst item = stack[j];\n\t\t\t\t\tlet openQuote;\n\t\t\t\t\tlet closeQuote;\n\t\t\t\t\tif (isSingle) {\n\t\t\t\t\t\topenQuote = state.md.options.quotes[2];\n\t\t\t\t\t\tcloseQuote = state.md.options.quotes[3];\n\t\t\t\t\t} else {\n\t\t\t\t\t\topenQuote = state.md.options.quotes[0];\n\t\t\t\t\t\tcloseQuote = state.md.options.quotes[1];\n\t\t\t\t\t}\n\t\t\t\t\taddReplacement(replacements, i, t.index, closeQuote);\n\t\t\t\t\taddReplacement(replacements, item.tokenIdx, item.contentPos, openQuote);\n\t\t\t\t\ttruncateStack(stack, heads, j);\n\t\t\t\t\tcontinue OUTER;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (canOpen) {\n\t\t\t\tif (stack.length >= MAX_OPENERS) return;\n\t\t\t\tstack.push({\n\t\t\t\t\ttokenIdx: i,\n\t\t\t\t\tcontentPos: t.index,\n\t\t\t\t\tisSingleQuote: isSingle,\n\t\t\t\t\tlevel: thisLevel,\n\t\t\t\t\tprevSameQuoteIdx: isSingle ? heads.single : heads.double\n\t\t\t\t});\n\t\t\t\tif (isSingle) heads.single = stack.length - 1;\n\t\t\t\telse heads.double = stack.length - 1;\n\t\t\t} else if (canClose && isSingle) addReplacement(replacements, i, t.index, APOSTROPHE);\n\t\t}\n\t}\n\tObject.keys(replacements).forEach(function(tokenIdx) {\n\t\tconst idx = Number(tokenIdx);\n\t\ttokens[idx].content = applyReplacements(tokens[idx].content, replacements[tokenIdx]);\n\t});\n}\nfunction smartquotes(state) {\n\tif (!state.md.options.typographer) return;\n\tfor (let blkIdx = state.tokens.length - 1; blkIdx >= 0; blkIdx--) {\n\t\tif (state.tokens[blkIdx].type !== \"inline\" || !QUOTE_TEST_RE.test(state.tokens[blkIdx].content)) continue;\n\t\tprocess_inlines(state.tokens[blkIdx].children, state);\n\t}\n}\n//#endregion\n//#region src/rules_core/text_join.ts\nfunction join_alt(tokens) {\n\tlet curr, last;\n\tconst max = tokens.length;\n\tfor (curr = 0; curr < max; curr++) if (tokens[curr].type === \"text_special\") tokens[curr].type = \"text\";\n\tfor (curr = last = 0; curr < max; curr++) if (tokens[curr].type === \"text\" && curr + 1 < max && tokens[curr + 1].type === \"text\") tokens[curr + 1].content = tokens[curr].content + tokens[curr + 1].content;\n\telse {\n\t\tif (curr !== last) tokens[last] = tokens[curr];\n\t\tlast++;\n\t}\n\tif (curr !== last) tokens.length = last;\n}\nfunction text_join(state) {\n\tlet curr, last;\n\tconst blockTokens = state.tokens;\n\tconst l = blockTokens.length;\n\tfor (let j = 0; j < l; j++) {\n\t\tif (blockTokens[j].type !== \"inline\") continue;\n\t\tconst tokens = blockTokens[j].children;\n\t\tconst max = tokens.length;\n\t\tfor (curr = 0; curr < max; curr++) {\n\t\t\tif (tokens[curr].type === \"text_special\") tokens[curr].type = \"text\";\n\t\t\tif (tokens[curr].children) join_alt(tokens[curr].children);\n\t\t}\n\t\tfor (curr = last = 0; curr < max; curr++) if (tokens[curr].type === \"text\" && curr + 1 < max && tokens[curr + 1].type === \"text\") tokens[curr + 1].content = tokens[curr].content + tokens[curr + 1].content;\n\t\telse {\n\t\t\tif (curr !== last) tokens[last] = tokens[curr];\n\t\t\tlast++;\n\t\t}\n\t\tif (curr !== last) tokens.length = last;\n\t}\n}\n//#endregion\n//#region src/parser_core.ts\nvar _rules$2 = [\n\t[\"normalize\", normalize],\n\t[\"block\", block],\n\t[\"strip_references\", strip_references],\n\t[\"inline\", inline],\n\t[\"linkify\", linkify$1],\n\t[\"replacements\", replace],\n\t[\"smartquotes\", smartquotes],\n\t[\"text_join\", text_join]\n];\n/**\n* Top-level rules executor. Glues block/inline parsers and does intermediate\n* transformations.\n*/\nvar ParserCore = class {\n\tconstructor() {\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* {@link Ruler} instance. Keep configuration of core rules.\n\t\t\t*/\n\t\t\t\"ruler\",\n\t\t\tnew Ruler()\n\t\t);\n\t\t_defineProperty(this, \"State\", StateCore);\n\t\tfor (let i = 0; i < _rules$2.length; i++) this.ruler.push(_rules$2[i][0], _rules$2[i][1]);\n\t}\n\t/**\n\t* Executes core chain rules.\n\t*/\n\tprocess(state) {\n\t\tconst rules = this.ruler.getRules(\"\");\n\t\tfor (let i = 0, l = rules.length; i < l; i++) rules[i](state);\n\t}\n};\n//#endregion\n//#region src/rules_block/state_block.ts\n/** Mutable state passed to block rules while tokenizing a source document. */\nvar StateBlock = class {\n\tconstructor(src, md, env, tokens) {\n\t\t_defineProperty(this, \"bMarks\", []);\n\t\t_defineProperty(this, \"eMarks\", []);\n\t\t_defineProperty(this, \"tShift\", []);\n\t\t_defineProperty(this, \"sCount\", []);\n\t\t_defineProperty(this, \"bsCount\", []);\n\t\t_defineProperty(this, \"blkIndent\", 0);\n\t\t_defineProperty(this, \"line\", 0);\n\t\t_defineProperty(this, \"lineMax\", 0);\n\t\t_defineProperty(this, \"tight\", false);\n\t\t_defineProperty(this, \"listIndent\", -1);\n\t\t_defineProperty(this, \"parentType\", \"root\");\n\t\t_defineProperty(this, \"level\", 0);\n\t\t_defineProperty(this, \"Token\", Token);\n\t\tthis.src = src;\n\t\tthis.md = md;\n\t\tthis.env = env;\n\t\tthis.tokens = tokens;\n\t\tconst s = this.src;\n\t\tfor (let start = 0, pos = 0, indent = 0, offset = 0, len = s.length, indent_found = false; pos < len; pos++) {\n\t\t\tconst ch = s.charCodeAt(pos);\n\t\t\tif (!indent_found) {\n\t\t\t\tif (isSpace(ch)) {\n\t\t\t\t\tindent++;\n\t\t\t\t\tif (ch === 9) offset += 4 - offset % 4;\n\t\t\t\t\telse offset++;\n\t\t\t\t\tcontinue;\n\t\t\t\t} else indent_found = true;\n\t\t\t}\n\t\t\tif (ch === 10 || pos === len - 1) {\n\t\t\t\tif (ch !== 10) pos++;\n\t\t\t\tthis.bMarks.push(start);\n\t\t\t\tthis.eMarks.push(pos);\n\t\t\t\tthis.tShift.push(indent);\n\t\t\t\tthis.sCount.push(offset);\n\t\t\t\tthis.bsCount.push(0);\n\t\t\t\tindent_found = false;\n\t\t\t\tindent = 0;\n\t\t\t\toffset = 0;\n\t\t\t\tstart = pos + 1;\n\t\t\t}\n\t\t}\n\t\tthis.bMarks.push(s.length);\n\t\tthis.eMarks.push(s.length);\n\t\tthis.tShift.push(0);\n\t\tthis.sCount.push(0);\n\t\tthis.bsCount.push(0);\n\t\tthis.lineMax = this.bMarks.length - 1;\n\t}\n\tpush(type, tag, nesting) {\n\t\tconst token = new Token(type, tag, nesting);\n\t\ttoken.block = true;\n\t\tif (nesting < 0) this.level--;\n\t\ttoken.level = this.level;\n\t\tif (nesting > 0) this.level++;\n\t\tthis.tokens.push(token);\n\t\treturn token;\n\t}\n\tisEmpty(line) {\n\t\treturn this.bMarks[line] + this.tShift[line] >= this.eMarks[line];\n\t}\n\tskipEmptyLines(from) {\n\t\tfor (let max = this.lineMax; from < max; from++) if (this.bMarks[from] + this.tShift[from] < this.eMarks[from]) break;\n\t\treturn from;\n\t}\n\tskipSpaces(pos) {\n\t\tfor (let max = this.src.length; pos < max; pos++) if (!isSpace(this.src.charCodeAt(pos))) break;\n\t\treturn pos;\n\t}\n\tskipSpacesBack(pos, min) {\n\t\tif (pos <= min) return pos;\n\t\twhile (pos > min) if (!isSpace(this.src.charCodeAt(--pos))) return pos + 1;\n\t\treturn pos;\n\t}\n\tskipChars(pos, code) {\n\t\tfor (let max = this.src.length; pos < max; pos++) if (this.src.charCodeAt(pos) !== code) break;\n\t\treturn pos;\n\t}\n\tskipCharsBack(pos, code, min) {\n\t\tif (pos <= min) return pos;\n\t\twhile (pos > min) if (code !== this.src.charCodeAt(--pos)) return pos + 1;\n\t\treturn pos;\n\t}\n\tgetLines(begin, end, indent, keepLastLF) {\n\t\tif (begin >= end) return \"\";\n\t\tconst queue = new Array(end - begin);\n\t\tfor (let i = 0, line = begin; line < end; line++, i++) {\n\t\t\tlet lineIndent = 0;\n\t\t\tconst lineStart = this.bMarks[line];\n\t\t\tlet first = lineStart;\n\t\t\tlet last;\n\t\t\tif (line + 1 < end || keepLastLF) last = this.eMarks[line] + 1;\n\t\t\telse last = this.eMarks[line];\n\t\t\twhile (first < last && lineIndent < indent) {\n\t\t\t\tconst ch = this.src.charCodeAt(first);\n\t\t\t\tif (isSpace(ch)) {\n\t\t\t\t\tif (ch === 9) lineIndent += 4 - (lineIndent + this.bsCount[line]) % 4;\n\t\t\t\t\telse lineIndent++;\n\t\t\t\t} else if (first - lineStart < this.tShift[line]) lineIndent++;\n\t\t\t\telse break;\n\t\t\t\tfirst++;\n\t\t\t}\n\t\t\tif (lineIndent > indent) queue[i] = new Array(lineIndent - indent + 1).join(\" \") + this.src.slice(first, last);\n\t\t\telse queue[i] = this.src.slice(first, last);\n\t\t}\n\t\treturn queue.join(\"\");\n\t}\n};\n//#endregion\n//#region src/rules_block/table.ts\nvar MAX_AUTOCOMPLETED_CELLS = 65536;\nfunction getLine(state, line) {\n\tconst pos = state.bMarks[line] + state.tShift[line];\n\tconst max = state.eMarks[line];\n\treturn state.src.slice(pos, max);\n}\nfunction escapedSplit(str) {\n\tconst result = [];\n\tconst max = str.length;\n\tlet pos = 0;\n\tlet ch = str.charCodeAt(pos);\n\tlet isEscaped = false;\n\tlet lastPos = 0;\n\tlet current = \"\";\n\twhile (pos < max) {\n\t\tif (ch === 124) {\n\t\t\tif (!isEscaped) {\n\t\t\t\tresult.push(current + str.substring(lastPos, pos));\n\t\t\t\tcurrent = \"\";\n\t\t\t\tlastPos = pos + 1;\n\t\t\t} else {\n\t\t\t\tcurrent += str.substring(lastPos, pos - 1);\n\t\t\t\tlastPos = pos;\n\t\t\t}\n\t\t}\n\t\tisEscaped = ch === 92;\n\t\tpos++;\n\t\tch = str.charCodeAt(pos);\n\t}\n\tresult.push(current + str.substring(lastPos));\n\treturn result;\n}\nfunction table(state, startLine, endLine, silent) {\n\tif (startLine + 2 > endLine) return false;\n\tlet nextLine = startLine + 1;\n\tif (state.sCount[nextLine] < state.blkIndent) return false;\n\tif (state.sCount[nextLine] - state.blkIndent >= 4) return false;\n\tlet pos = state.bMarks[nextLine] + state.tShift[nextLine];\n\tif (pos >= state.eMarks[nextLine]) return false;\n\tconst firstCh = state.src.charCodeAt(pos++);\n\tif (firstCh !== 124 && firstCh !== 45 && firstCh !== 58) return false;\n\tif (pos >= state.eMarks[nextLine]) return false;\n\tconst secondCh = state.src.charCodeAt(pos++);\n\tif (secondCh !== 124 && secondCh !== 45 && secondCh !== 58 && !isSpace(secondCh)) return false;\n\tif (firstCh === 45 && isSpace(secondCh)) return false;\n\twhile (pos < state.eMarks[nextLine]) {\n\t\tconst ch = state.src.charCodeAt(pos);\n\t\tif (ch !== 124 && ch !== 45 && ch !== 58 && !isSpace(ch)) return false;\n\t\tpos++;\n\t}\n\tlet lineText = getLine(state, startLine + 1);\n\tlet columns = lineText.split(\"|\");\n\tconst aligns = [];\n\tfor (let i = 0; i < columns.length; i++) {\n\t\tconst t = columns[i].trim();\n\t\tif (!t) {\n\t\t\tif (i === 0 || i === columns.length - 1) continue;\n\t\t\telse return false;\n\t\t}\n\t\tif (!/^:?-+:?$/.test(t)) return false;\n\t\tif (t.charCodeAt(t.length - 1) === 58) aligns.push(t.charCodeAt(0) === 58 ? \"center\" : \"right\");\n\t\telse if (t.charCodeAt(0) === 58) aligns.push(\"left\");\n\t\telse aligns.push(\"\");\n\t}\n\tlineText = getLine(state, startLine).trim();\n\tif (lineText.indexOf(\"|\") === -1) return false;\n\tif (state.sCount[startLine] - state.blkIndent >= 4) return false;\n\tcolumns = escapedSplit(lineText);\n\tif (columns.length && columns[0] === \"\") columns.shift();\n\tif (columns.length && columns[columns.length - 1] === \"\") columns.pop();\n\tconst columnCount = columns.length;\n\tif (columnCount === 0 || columnCount !== aligns.length) return false;\n\tif (silent) return true;\n\tconst oldParentType = state.parentType;\n\tstate.parentType = \"table\";\n\tconst terminatorRules = state.md.block.ruler.getRules(\"blockquote\");\n\tconst token_to = state.push(\"table_open\", \"table\", 1);\n\tconst tableLines = [startLine, 0];\n\ttoken_to.map = tableLines;\n\tconst token_tho = state.push(\"thead_open\", \"thead\", 1);\n\ttoken_tho.map = [startLine, startLine + 1];\n\tconst token_htro = state.push(\"tr_open\", \"tr\", 1);\n\ttoken_htro.map = [startLine, startLine + 1];\n\tfor (let i = 0; i < columns.length; i++) {\n\t\tconst token_ho = state.push(\"th_open\", \"th\", 1);\n\t\tif (aligns[i]) token_ho.attrs = [[\"style\", `text-align:${aligns[i]}`]];\n\t\tconst token_il = state.push(\"inline\", \"\", 0);\n\t\ttoken_il.content = columns[i].trim();\n\t\ttoken_il.children = [];\n\t\tstate.push(\"th_close\", \"th\", -1);\n\t}\n\tstate.push(\"tr_close\", \"tr\", -1);\n\tstate.push(\"thead_close\", \"thead\", -1);\n\tlet tbodyLines;\n\tlet autocompletedCells = 0;\n\tfor (nextLine = startLine + 2; nextLine < endLine; nextLine++) {\n\t\tif (state.sCount[nextLine] < state.blkIndent) break;\n\t\tlet terminate = false;\n\t\tfor (let i = 0, l = terminatorRules.length; i < l; i++) if (terminatorRules[i](state, nextLine, endLine, true)) {\n\t\t\tterminate = true;\n\t\t\tbreak;\n\t\t}\n\t\tif (terminate) break;\n\t\tlineText = getLine(state, nextLine).trim();\n\t\tif (!lineText) break;\n\t\tif (state.sCount[nextLine] - state.blkIndent >= 4) break;\n\t\tcolumns = escapedSplit(lineText);\n\t\tif (columns.length && columns[0] === \"\") columns.shift();\n\t\tif (columns.length && columns[columns.length - 1] === \"\") columns.pop();\n\t\tautocompletedCells += columnCount - columns.length;\n\t\tif (autocompletedCells > MAX_AUTOCOMPLETED_CELLS) break;\n\t\tif (nextLine === startLine + 2) {\n\t\t\tconst token_tbo = state.push(\"tbody_open\", \"tbody\", 1);\n\t\t\ttoken_tbo.map = tbodyLines = [startLine + 2, 0];\n\t\t}\n\t\tconst token_tro = state.push(\"tr_open\", \"tr\", 1);\n\t\ttoken_tro.map = [nextLine, nextLine + 1];\n\t\tfor (let i = 0; i < columnCount; i++) {\n\t\t\tconst token_tdo = state.push(\"td_open\", \"td\", 1);\n\t\t\tif (aligns[i]) token_tdo.attrs = [[\"style\", `text-align:${aligns[i]}`]];\n\t\t\tconst token_il = state.push(\"inline\", \"\", 0);\n\t\t\ttoken_il.content = columns[i] ? columns[i].trim() : \"\";\n\t\t\ttoken_il.children = [];\n\t\t\tstate.push(\"td_close\", \"td\", -1);\n\t\t}\n\t\tstate.push(\"tr_close\", \"tr\", -1);\n\t}\n\tif (tbodyLines) {\n\t\tstate.push(\"tbody_close\", \"tbody\", -1);\n\t\ttbodyLines[1] = nextLine;\n\t}\n\tstate.push(\"table_close\", \"table\", -1);\n\ttableLines[1] = nextLine;\n\tstate.parentType = oldParentType;\n\tstate.line = nextLine;\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/code.ts\nfunction code(state, startLine, endLine) {\n\tif (state.sCount[startLine] - state.blkIndent < 4) return false;\n\tlet nextLine = startLine + 1;\n\tlet last = nextLine;\n\twhile (nextLine < endLine) {\n\t\tif (state.isEmpty(nextLine)) {\n\t\t\tnextLine++;\n\t\t\tcontinue;\n\t\t}\n\t\tif (state.sCount[nextLine] - state.blkIndent >= 4) {\n\t\t\tnextLine++;\n\t\t\tlast = nextLine;\n\t\t\tcontinue;\n\t\t}\n\t\tbreak;\n\t}\n\tstate.line = last;\n\tconst token = state.push(\"code_block\", \"code\", 0);\n\ttoken.content = state.getLines(startLine, last, 4 + state.blkIndent, false) + \"\\n\";\n\ttoken.map = [startLine, state.line];\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/fence.ts\nfunction fence(state, startLine, endLine, silent) {\n\tlet pos = state.bMarks[startLine] + state.tShift[startLine];\n\tlet max = state.eMarks[startLine];\n\tif (state.sCount[startLine] - state.blkIndent >= 4) return false;\n\tif (pos + 3 > max) return false;\n\tconst marker = state.src.charCodeAt(pos);\n\tif (marker !== 126 && marker !== 96) return false;\n\tlet mem = pos;\n\tpos = state.skipChars(pos, marker);\n\tlet len = pos - mem;\n\tif (len < 3) return false;\n\tconst markup = state.src.slice(mem, pos);\n\tconst params = state.src.slice(pos, max);\n\tif (marker === 96) {\n\t\tif (params.indexOf(String.fromCharCode(marker)) >= 0) return false;\n\t}\n\tif (silent) return true;\n\tlet nextLine = startLine;\n\tlet haveEndMarker = false;\n\tfor (;;) {\n\t\tnextLine++;\n\t\tif (nextLine >= endLine) break;\n\t\tpos = mem = state.bMarks[nextLine] + state.tShift[nextLine];\n\t\tmax = state.eMarks[nextLine];\n\t\tif (pos < max && state.sCount[nextLine] < state.blkIndent) break;\n\t\tif (state.src.charCodeAt(pos) !== marker) continue;\n\t\tif (state.sCount[nextLine] - state.blkIndent >= 4) continue;\n\t\tpos = state.skipChars(pos, marker);\n\t\tif (pos - mem < len) continue;\n\t\tpos = state.skipSpaces(pos);\n\t\tif (pos < max) continue;\n\t\thaveEndMarker = true;\n\t\tbreak;\n\t}\n\tlen = state.sCount[startLine];\n\tstate.line = nextLine + (haveEndMarker ? 1 : 0);\n\tconst token = state.push(\"fence\", \"code\", 0);\n\ttoken.info = params;\n\ttoken.content = state.getLines(startLine + 1, nextLine, len, true);\n\ttoken.markup = markup;\n\ttoken.map = [startLine, state.line];\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/blockquote.ts\nfunction blockquote(state, startLine, endLine, silent) {\n\tlet pos = state.bMarks[startLine] + state.tShift[startLine];\n\tlet max = state.eMarks[startLine];\n\tconst oldLineMax = state.lineMax;\n\tif (state.sCount[startLine] - state.blkIndent >= 4) return false;\n\tif (state.src.charCodeAt(pos) !== 62) return false;\n\tif (silent) return true;\n\tconst oldBMarks = [];\n\tconst oldBSCount = [];\n\tconst oldSCount = [];\n\tconst oldTShift = [];\n\tconst terminatorRules = state.md.block.ruler.getRules(\"blockquote\");\n\tconst oldParentType = state.parentType;\n\tstate.parentType = \"blockquote\";\n\tlet lastLineEmpty = false;\n\tlet nextLine;\n\tfor (nextLine = startLine; nextLine < endLine; nextLine++) {\n\t\tconst isOutdented = state.sCount[nextLine] < state.blkIndent;\n\t\tpos = state.bMarks[nextLine] + state.tShift[nextLine];\n\t\tmax = state.eMarks[nextLine];\n\t\tif (pos >= max) break;\n\t\tif (state.src.charCodeAt(pos++) === 62 && !isOutdented) {\n\t\t\tlet initial = state.sCount[nextLine] + 1;\n\t\t\tlet spaceAfterMarker;\n\t\t\tlet adjustTab;\n\t\t\tif (state.src.charCodeAt(pos) === 32) {\n\t\t\t\tpos++;\n\t\t\t\tinitial++;\n\t\t\t\tadjustTab = false;\n\t\t\t\tspaceAfterMarker = true;\n\t\t\t} else if (state.src.charCodeAt(pos) === 9) {\n\t\t\t\tspaceAfterMarker = true;\n\t\t\t\tif ((state.bsCount[nextLine] + initial) % 4 === 3) {\n\t\t\t\t\tpos++;\n\t\t\t\t\tinitial++;\n\t\t\t\t\tadjustTab = false;\n\t\t\t\t} else adjustTab = true;\n\t\t\t} else spaceAfterMarker = false;\n\t\t\tlet offset = initial;\n\t\t\toldBMarks.push(state.bMarks[nextLine]);\n\t\t\tstate.bMarks[nextLine] = pos;\n\t\t\twhile (pos < max) {\n\t\t\t\tconst ch = state.src.charCodeAt(pos);\n\t\t\t\tif (isSpace(ch)) {\n\t\t\t\t\tif (ch === 9) offset += 4 - (offset + state.bsCount[nextLine] + (adjustTab ? 1 : 0)) % 4;\n\t\t\t\t\telse offset++;\n\t\t\t\t} else break;\n\t\t\t\tpos++;\n\t\t\t}\n\t\t\tlastLineEmpty = pos >= max;\n\t\t\toldBSCount.push(state.bsCount[nextLine]);\n\t\t\tstate.bsCount[nextLine] = state.sCount[nextLine] + 1 + (spaceAfterMarker ? 1 : 0);\n\t\t\toldSCount.push(state.sCount[nextLine]);\n\t\t\tstate.sCount[nextLine] = offset - initial;\n\t\t\toldTShift.push(state.tShift[nextLine]);\n\t\t\tstate.tShift[nextLine] = pos - state.bMarks[nextLine];\n\t\t\tcontinue;\n\t\t}\n\t\tif (lastLineEmpty) break;\n\t\tlet terminate = false;\n\t\tfor (let i = 0, l = terminatorRules.length; i < l; i++) if (terminatorRules[i](state, nextLine, endLine, true)) {\n\t\t\tterminate = true;\n\t\t\tbreak;\n\t\t}\n\t\tif (terminate) {\n\t\t\tstate.lineMax = nextLine;\n\t\t\tif (state.blkIndent !== 0) {\n\t\t\t\toldBMarks.push(state.bMarks[nextLine]);\n\t\t\t\toldBSCount.push(state.bsCount[nextLine]);\n\t\t\t\toldTShift.push(state.tShift[nextLine]);\n\t\t\t\toldSCount.push(state.sCount[nextLine]);\n\t\t\t\tstate.sCount[nextLine] -= state.blkIndent;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\toldBMarks.push(state.bMarks[nextLine]);\n\t\toldBSCount.push(state.bsCount[nextLine]);\n\t\toldTShift.push(state.tShift[nextLine]);\n\t\toldSCount.push(state.sCount[nextLine]);\n\t\tstate.sCount[nextLine] = -1;\n\t}\n\tconst oldIndent = state.blkIndent;\n\tstate.blkIndent = 0;\n\tconst token_o = state.push(\"blockquote_open\", \"blockquote\", 1);\n\ttoken_o.markup = \">\";\n\tconst lines = [startLine, 0];\n\ttoken_o.map = lines;\n\tstate.md.block.tokenize(state, startLine, nextLine);\n\tconst token_c = state.push(\"blockquote_close\", \"blockquote\", -1);\n\ttoken_c.markup = \">\";\n\tstate.lineMax = oldLineMax;\n\tstate.parentType = oldParentType;\n\tlines[1] = state.line;\n\tfor (let i = 0; i < oldTShift.length; i++) {\n\t\tstate.bMarks[i + startLine] = oldBMarks[i];\n\t\tstate.tShift[i + startLine] = oldTShift[i];\n\t\tstate.sCount[i + startLine] = oldSCount[i];\n\t\tstate.bsCount[i + startLine] = oldBSCount[i];\n\t}\n\tstate.blkIndent = oldIndent;\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/hr.ts\nfunction hr(state, startLine, endLine, silent) {\n\tconst max = state.eMarks[startLine];\n\tif (state.sCount[startLine] - state.blkIndent >= 4) return false;\n\tlet pos = state.bMarks[startLine] + state.tShift[startLine];\n\tconst marker = state.src.charCodeAt(pos++);\n\tif (marker !== 42 && marker !== 45 && marker !== 95) return false;\n\tlet cnt = 1;\n\twhile (pos < max) {\n\t\tconst ch = state.src.charCodeAt(pos++);\n\t\tif (ch !== marker && !isSpace(ch)) return false;\n\t\tif (ch === marker) cnt++;\n\t}\n\tif (cnt < 3) return false;\n\tif (silent) return true;\n\tstate.line = startLine + 1;\n\tconst token = state.push(\"hr\", \"hr\", 0);\n\ttoken.map = [startLine, state.line];\n\ttoken.markup = Array(cnt + 1).join(String.fromCharCode(marker));\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/list.ts\nfunction skipBulletListMarker(state, startLine) {\n\tconst max = state.eMarks[startLine];\n\tlet pos = state.bMarks[startLine] + state.tShift[startLine];\n\tconst marker = state.src.charCodeAt(pos++);\n\tif (marker !== 42 && marker !== 45 && marker !== 43) return -1;\n\tif (pos < max) {\n\t\tif (!isSpace(state.src.charCodeAt(pos))) return -1;\n\t}\n\treturn pos;\n}\nfunction skipOrderedListMarker(state, startLine) {\n\tconst start = state.bMarks[startLine] + state.tShift[startLine];\n\tconst max = state.eMarks[startLine];\n\tlet pos = start;\n\tif (pos + 1 >= max) return -1;\n\tlet ch = state.src.charCodeAt(pos++);\n\tif (ch < 48 || ch > 57) return -1;\n\tfor (;;) {\n\t\tif (pos >= max) return -1;\n\t\tch = state.src.charCodeAt(pos++);\n\t\tif (ch >= 48 && ch <= 57) {\n\t\t\tif (pos - start >= 10) return -1;\n\t\t\tcontinue;\n\t\t}\n\t\tif (ch === 41 || ch === 46) break;\n\t\treturn -1;\n\t}\n\tif (pos < max) {\n\t\tch = state.src.charCodeAt(pos);\n\t\tif (!isSpace(ch)) return -1;\n\t}\n\treturn pos;\n}\nfunction markTightParagraphs(state, idx) {\n\tconst level = state.level + 2;\n\tfor (let i = idx + 2, l = state.tokens.length - 2; i < l; i++) if (state.tokens[i].level === level && state.tokens[i].type === \"paragraph_open\") {\n\t\tstate.tokens[i + 2].hidden = true;\n\t\tstate.tokens[i].hidden = true;\n\t\ti += 2;\n\t}\n}\nfunction list(state, startLine, endLine, silent) {\n\tlet max, pos, start, token;\n\tlet nextLine = startLine;\n\tlet tight = true;\n\tif (state.sCount[nextLine] - state.blkIndent >= 4) return false;\n\tif (state.listIndent >= 0 && state.sCount[nextLine] - state.listIndent >= 4 && state.sCount[nextLine] < state.blkIndent) return false;\n\tlet isTerminatingParagraph = false;\n\tif (silent && state.parentType === \"paragraph\") {\n\t\tif (state.sCount[nextLine] >= state.blkIndent) isTerminatingParagraph = true;\n\t}\n\tlet isOrdered;\n\tlet markerValue;\n\tlet posAfterMarker;\n\tif ((posAfterMarker = skipOrderedListMarker(state, nextLine)) >= 0) {\n\t\tisOrdered = true;\n\t\tstart = state.bMarks[nextLine] + state.tShift[nextLine];\n\t\tmarkerValue = Number(state.src.slice(start, posAfterMarker - 1));\n\t\tif (isTerminatingParagraph && markerValue !== 1) return false;\n\t} else if ((posAfterMarker = skipBulletListMarker(state, nextLine)) >= 0) isOrdered = false;\n\telse return false;\n\tif (isTerminatingParagraph) {\n\t\tif (state.skipSpaces(posAfterMarker) >= state.eMarks[nextLine]) return false;\n\t}\n\tif (silent) return true;\n\tconst markerCharCode = state.src.charCodeAt(posAfterMarker - 1);\n\tconst listTokIdx = state.tokens.length;\n\tif (isOrdered) {\n\t\ttoken = state.push(\"ordered_list_open\", \"ol\", 1);\n\t\tif (markerValue !== 1) token.attrs = [[\"start\", markerValue]];\n\t} else token = state.push(\"bullet_list_open\", \"ul\", 1);\n\tconst listLines = [nextLine, 0];\n\ttoken.map = listLines;\n\ttoken.markup = String.fromCharCode(markerCharCode);\n\tlet prevEmptyEnd = false;\n\tconst terminatorRules = state.md.block.ruler.getRules(\"list\");\n\tconst oldParentType = state.parentType;\n\tstate.parentType = \"list\";\n\twhile (nextLine < endLine) {\n\t\tpos = posAfterMarker;\n\t\tmax = state.eMarks[nextLine];\n\t\tconst initial = state.sCount[nextLine] + posAfterMarker - (state.bMarks[nextLine] + state.tShift[nextLine]);\n\t\tlet offset = initial;\n\t\twhile (pos < max) {\n\t\t\tconst ch = state.src.charCodeAt(pos);\n\t\t\tif (ch === 9) offset += 4 - (offset + state.bsCount[nextLine]) % 4;\n\t\t\telse if (ch === 32) offset++;\n\t\t\telse break;\n\t\t\tpos++;\n\t\t}\n\t\tconst contentStart = pos;\n\t\tlet indentAfterMarker;\n\t\tif (contentStart >= max) indentAfterMarker = 1;\n\t\telse indentAfterMarker = offset - initial;\n\t\tif (indentAfterMarker > 4) indentAfterMarker = 1;\n\t\tconst indent = initial + indentAfterMarker;\n\t\ttoken = state.push(\"list_item_open\", \"li\", 1);\n\t\ttoken.markup = String.fromCharCode(markerCharCode);\n\t\tconst itemLines = [nextLine, 0];\n\t\ttoken.map = itemLines;\n\t\tif (isOrdered) token.info = state.src.slice(start, posAfterMarker - 1);\n\t\tconst oldTight = state.tight;\n\t\tconst oldTShift = state.tShift[nextLine];\n\t\tconst oldSCount = state.sCount[nextLine];\n\t\tconst oldListIndent = state.listIndent;\n\t\tstate.listIndent = state.blkIndent;\n\t\tstate.blkIndent = indent;\n\t\tstate.tight = true;\n\t\tstate.tShift[nextLine] = contentStart - state.bMarks[nextLine];\n\t\tstate.sCount[nextLine] = offset;\n\t\tif (contentStart >= max && state.isEmpty(nextLine + 1)) state.line = Math.min(state.line + 2, endLine);\n\t\telse state.md.block.tokenize(state, nextLine, endLine);\n\t\tif (!state.tight || prevEmptyEnd) tight = false;\n\t\tprevEmptyEnd = state.line - nextLine > 1 && state.isEmpty(state.line - 1);\n\t\tstate.blkIndent = state.listIndent;\n\t\tstate.listIndent = oldListIndent;\n\t\tstate.tShift[nextLine] = oldTShift;\n\t\tstate.sCount[nextLine] = oldSCount;\n\t\tstate.tight = oldTight;\n\t\ttoken = state.push(\"list_item_close\", \"li\", -1);\n\t\ttoken.markup = String.fromCharCode(markerCharCode);\n\t\tnextLine = state.line;\n\t\titemLines[1] = nextLine;\n\t\tif (nextLine >= endLine) break;\n\t\tif (state.sCount[nextLine] < state.blkIndent) break;\n\t\tif (state.sCount[nextLine] - state.blkIndent >= 4) break;\n\t\tlet terminate = false;\n\t\tfor (let i = 0, l = terminatorRules.length; i < l; i++) if (terminatorRules[i](state, nextLine, endLine, true)) {\n\t\t\tterminate = true;\n\t\t\tbreak;\n\t\t}\n\t\tif (terminate) break;\n\t\tif (isOrdered) {\n\t\t\tposAfterMarker = skipOrderedListMarker(state, nextLine);\n\t\t\tif (posAfterMarker < 0) break;\n\t\t\tstart = state.bMarks[nextLine] + state.tShift[nextLine];\n\t\t} else {\n\t\t\tposAfterMarker = skipBulletListMarker(state, nextLine);\n\t\t\tif (posAfterMarker < 0) break;\n\t\t}\n\t\tif (markerCharCode !== state.src.charCodeAt(posAfterMarker - 1)) break;\n\t}\n\tif (isOrdered) token = state.push(\"ordered_list_close\", \"ol\", -1);\n\telse token = state.push(\"bullet_list_close\", \"ul\", -1);\n\ttoken.markup = String.fromCharCode(markerCharCode);\n\tlistLines[1] = nextLine;\n\tstate.line = nextLine;\n\tstate.parentType = oldParentType;\n\tif (tight) markTightParagraphs(state, listTokIdx);\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/reference.ts\nvar MAX_LABEL_LENGTH = 999;\nfunction countCodePoints(str) {\n\tlet length = str.length;\n\tfor (let i = 0; i < str.length - 1; i++) {\n\t\tconst high = str.charCodeAt(i);\n\t\tif (high < 55296 || high > 56319) continue;\n\t\tconst low = str.charCodeAt(i + 1);\n\t\tif (low >= 56320 && low <= 57343) {\n\t\t\tlength--;\n\t\t\ti++;\n\t\t}\n\t}\n\treturn length;\n}\nfunction lineEnd(state, line) {\n\treturn Math.min(state.eMarks[line] + 1, state.src.length);\n}\nfunction getNextLinePos(state, nextLine) {\n\tconst endLine = state.lineMax;\n\tif (nextLine >= endLine || state.isEmpty(nextLine)) return -1;\n\tlet isContinuation = false;\n\tif (state.sCount[nextLine] - state.blkIndent > 3) isContinuation = true;\n\tif (state.sCount[nextLine] < 0) isContinuation = true;\n\tif (!isContinuation) {\n\t\tconst terminatorRules = state.md.block.ruler.getRules(\"reference\");\n\t\tconst oldParentType = state.parentType;\n\t\tstate.parentType = \"reference\";\n\t\tlet terminate = false;\n\t\tfor (let i = 0, l = terminatorRules.length; i < l; i++) if (terminatorRules[i](state, nextLine, endLine, true)) {\n\t\t\tterminate = true;\n\t\t\tbreak;\n\t\t}\n\t\tstate.parentType = oldParentType;\n\t\tif (terminate) return -1;\n\t}\n\treturn state.bMarks[nextLine] + state.tShift[nextLine];\n}\nfunction reference(state, startLine, _endLine, silent) {\n\tconst src = state.src;\n\tlet pos = state.bMarks[startLine] + state.tShift[startLine];\n\tlet nextLine = startLine + 1;\n\tif (state.sCount[startLine] - state.blkIndent >= 4) return false;\n\tif (src.charCodeAt(pos) !== 91) return false;\n\tlet max = lineEnd(state, startLine);\n\tlet rawLabel = \"\";\n\tlet labelEnd = -1;\n\tlet segmentStart = ++pos;\n\twhile (pos < max) {\n\t\tif (rawLabel.length + pos - segmentStart > MAX_LABEL_LENGTH * 2) return false;\n\t\tlet ch = src.charCodeAt(pos);\n\t\tif (ch === 91) return false;\n\t\tif (ch === 93) {\n\t\t\tlabelEnd = pos;\n\t\t\tbreak;\n\t\t}\n\t\tif (ch === 92) ch = src.charCodeAt(++pos);\n\t\tif (ch === 10 && pos < max) {\n\t\t\tconst nextPos = getNextLinePos(state, nextLine);\n\t\t\tif (nextPos < 0) return false;\n\t\t\trawLabel += src.slice(segmentStart, max);\n\t\t\tpos = segmentStart = nextPos;\n\t\t\tmax = lineEnd(state, nextLine++);\n\t\t\tcontinue;\n\t\t}\n\t\tpos++;\n\t}\n\tif (labelEnd < 0 || src.charCodeAt(labelEnd + 1) !== 58) return false;\n\trawLabel += src.slice(segmentStart, labelEnd);\n\tif (rawLabel.length > MAX_LABEL_LENGTH && countCodePoints(rawLabel) > MAX_LABEL_LENGTH) return false;\n\tpos = labelEnd + 2;\n\twhile (pos < max) {\n\t\tconst ch = src.charCodeAt(pos);\n\t\tif (ch === 10) {\n\t\t\tconst nextPos = getNextLinePos(state, nextLine);\n\t\t\tif (nextPos < 0) break;\n\t\t\tpos = nextPos;\n\t\t\tmax = lineEnd(state, nextLine++);\n\t\t} else if (isSpace(ch)) pos++;\n\t\telse break;\n\t}\n\tconst destRes = state.md.helpers.parseLinkDestination(src, pos, max);\n\tif (!destRes.ok) return false;\n\tconst href = state.md.normalizeLink(destRes.str);\n\tif (!state.md.validateLink(href)) return false;\n\tpos = destRes.pos;\n\tconst destEndPos = pos;\n\tconst destEndMax = max;\n\tconst destEndLineNo = nextLine;\n\twhile (pos < max) {\n\t\tconst ch = src.charCodeAt(pos);\n\t\tif (ch === 10) {\n\t\t\tconst nextPos = getNextLinePos(state, nextLine);\n\t\t\tif (nextPos < 0) break;\n\t\t\tpos = nextPos;\n\t\t\tmax = lineEnd(state, nextLine++);\n\t\t} else if (isSpace(ch)) pos++;\n\t\telse break;\n\t}\n\tconst titleStart = pos;\n\tlet titleRes = state.md.helpers.parseLinkTitle(src, pos, max);\n\twhile (titleRes.can_continue) {\n\t\tconst nextPos = getNextLinePos(state, nextLine);\n\t\tif (nextPos < 0) break;\n\t\tpos = nextPos;\n\t\tmax = lineEnd(state, nextLine++);\n\t\ttitleRes = state.md.helpers.parseLinkTitle(src, pos, max, titleRes);\n\t}\n\tlet title;\n\tif (titleStart !== destEndPos && titleRes.ok) {\n\t\ttitle = titleRes.str;\n\t\tpos = titleRes.pos;\n\t} else {\n\t\ttitle = \"\";\n\t\tpos = destEndPos;\n\t\tmax = destEndMax;\n\t\tnextLine = destEndLineNo;\n\t}\n\twhile (pos < max) {\n\t\tif (!isSpace(src.charCodeAt(pos))) break;\n\t\tpos++;\n\t}\n\tif (pos < max && src.charCodeAt(pos) !== 10) {\n\t\tif (title) {\n\t\t\ttitle = \"\";\n\t\t\tpos = destEndPos;\n\t\t\tmax = destEndMax;\n\t\t\tnextLine = destEndLineNo;\n\t\t\twhile (pos < max) {\n\t\t\t\tif (!isSpace(src.charCodeAt(pos))) break;\n\t\t\t\tpos++;\n\t\t\t}\n\t\t}\n\t}\n\tif (pos < max && src.charCodeAt(pos) !== 10) return false;\n\tconst label = normalizeReference(rawLabel);\n\tif (!label) return false;\n\t/* istanbul ignore if */\n\tif (silent) return true;\n\tif (typeof state.env.references === \"undefined\") state.env.references = {};\n\tif (typeof state.env.references[label] === \"undefined\") state.env.references[label] = {\n\t\ttitle,\n\t\thref\n\t};\n\tconst token = state.push(\"reference_definition\", \"\", 0);\n\ttoken.map = [startLine, nextLine];\n\ttoken.hidden = true;\n\tconst meta = Object.create(null);\n\tmeta.label = label;\n\ttoken.meta = meta;\n\tstate.line = nextLine;\n\treturn true;\n}\n//#endregion\n//#region src/common/html_blocks.ts\nvar html_blocks_default = [\n\t\"address\",\n\t\"article\",\n\t\"aside\",\n\t\"base\",\n\t\"basefont\",\n\t\"blockquote\",\n\t\"body\",\n\t\"caption\",\n\t\"center\",\n\t\"col\",\n\t\"colgroup\",\n\t\"dd\",\n\t\"details\",\n\t\"dialog\",\n\t\"dir\",\n\t\"div\",\n\t\"dl\",\n\t\"dt\",\n\t\"fieldset\",\n\t\"figcaption\",\n\t\"figure\",\n\t\"footer\",\n\t\"form\",\n\t\"frame\",\n\t\"frameset\",\n\t\"h1\",\n\t\"h2\",\n\t\"h3\",\n\t\"h4\",\n\t\"h5\",\n\t\"h6\",\n\t\"head\",\n\t\"header\",\n\t\"hr\",\n\t\"html\",\n\t\"iframe\",\n\t\"legend\",\n\t\"li\",\n\t\"link\",\n\t\"main\",\n\t\"menu\",\n\t\"menuitem\",\n\t\"nav\",\n\t\"noframes\",\n\t\"ol\",\n\t\"optgroup\",\n\t\"option\",\n\t\"p\",\n\t\"param\",\n\t\"search\",\n\t\"section\",\n\t\"summary\",\n\t\"table\",\n\t\"tbody\",\n\t\"td\",\n\t\"tfoot\",\n\t\"th\",\n\t\"thead\",\n\t\"title\",\n\t\"tr\",\n\t\"track\",\n\t\"ul\"\n];\n//#endregion\n//#region src/common/html_re.ts\nvar open_tag = `<[A-Za-z][A-Za-z0-9\\\\-]*(?:\\\\s+[a-zA-Z_:][a-zA-Z0-9:._-]*(?:\\\\s*=\\\\s*(?:[^\"'=<>\\`\\\\x00-\\\\x20]+|'[^']*'|\"[^\"]*\"))?)*\\\\s*\\\\/?>`;\nvar close_tag = \"<\\\\/[A-Za-z][A-Za-z0-9\\\\-]*\\\\s*>\";\nnew RegExp(`^(?:${open_tag}|${close_tag}|<!---?>|<!--(?:[^-]|-[^-]|--[^>])*-->|<[?][\\\\s\\\\S]*?[?]>|<![A-Za-z][^>]*>|<!\\\\[CDATA\\\\[[\\\\s\\\\S]*?\\\\]\\\\]>)`);\nvar HTML_OPEN_CLOSE_TAG_RE = new RegExp(`^(?:${open_tag}|${close_tag})`);\n//#endregion\n//#region src/rules_block/html_block.ts\nvar HTML_SEQUENCES = [\n\t[\n\t\t/^<(script|pre|style|textarea)(?=(\\s|>|$))/i,\n\t\t/<\\/(script|pre|style|textarea)>/i,\n\t\ttrue\n\t],\n\t[\n\t\t/^<!--/,\n\t\t/-->/,\n\t\ttrue\n\t],\n\t[\n\t\t/^<\\?/,\n\t\t/\\?>/,\n\t\ttrue\n\t],\n\t[\n\t\t/^<![A-Za-z]/,\n\t\t/>/,\n\t\ttrue\n\t],\n\t[\n\t\t/^<!\\[CDATA\\[/,\n\t\t/\\]\\]>/,\n\t\ttrue\n\t],\n\t[\n\t\tnew RegExp(`^</?(${html_blocks_default.join(\"|\")})(?=(\\\\s|/?>|$))`, \"i\"),\n\t\t/^$/,\n\t\ttrue\n\t],\n\t[\n\t\tnew RegExp(`${HTML_OPEN_CLOSE_TAG_RE.source}\\\\s*$`),\n\t\t/^$/,\n\t\tfalse\n\t]\n];\nfunction html_block(state, startLine, endLine, silent) {\n\tlet pos = state.bMarks[startLine] + state.tShift[startLine];\n\tlet max = state.eMarks[startLine];\n\tif (state.sCount[startLine] - state.blkIndent >= 4) return false;\n\tif (!state.md.options.html) return false;\n\tif (state.src.charCodeAt(pos) !== 60) return false;\n\tlet lineText = state.src.slice(pos, max);\n\tlet i = 0;\n\tfor (; i < HTML_SEQUENCES.length; i++) if (HTML_SEQUENCES[i][0].test(lineText)) break;\n\tif (i === HTML_SEQUENCES.length) return false;\n\tif (silent) return HTML_SEQUENCES[i][2];\n\tlet nextLine = startLine + 1;\n\tconst endsOnBlankLine = HTML_SEQUENCES[i][1].test(\"\");\n\tif (!HTML_SEQUENCES[i][1].test(lineText)) for (; nextLine < endLine; nextLine++) {\n\t\tif (state.sCount[nextLine] < state.blkIndent) {\n\t\t\tif (endsOnBlankLine || !state.isEmpty(nextLine)) break;\n\t\t}\n\t\tpos = state.bMarks[nextLine] + state.tShift[nextLine];\n\t\tmax = state.eMarks[nextLine];\n\t\tlineText = state.src.slice(pos, max);\n\t\tif (HTML_SEQUENCES[i][1].test(lineText)) {\n\t\t\tif (lineText.length !== 0) nextLine++;\n\t\t\tbreak;\n\t\t}\n\t}\n\tstate.line = nextLine;\n\tconst token = state.push(\"html_block\", \"\", 0);\n\ttoken.map = [startLine, nextLine];\n\ttoken.content = state.getLines(startLine, nextLine, state.blkIndent, true);\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/heading.ts\nfunction heading(state, startLine, endLine, silent) {\n\tlet pos = state.bMarks[startLine] + state.tShift[startLine];\n\tlet max = state.eMarks[startLine];\n\tif (state.sCount[startLine] - state.blkIndent >= 4) return false;\n\tlet ch = state.src.charCodeAt(pos);\n\tif (ch !== 35 || pos >= max) return false;\n\tlet level = 1;\n\tch = state.src.charCodeAt(++pos);\n\twhile (ch === 35 && pos < max && level <= 6) {\n\t\tlevel++;\n\t\tch = state.src.charCodeAt(++pos);\n\t}\n\tif (level > 6 || pos < max && !isSpace(ch)) return false;\n\tif (silent) return true;\n\tmax = state.skipSpacesBack(max, pos);\n\tconst tmp = state.skipCharsBack(max, 35, pos);\n\tif (tmp > pos && isSpace(state.src.charCodeAt(tmp - 1))) max = tmp;\n\tstate.line = startLine + 1;\n\tconst token_o = state.push(\"heading_open\", `h${level}`, 1);\n\ttoken_o.markup = \"########\".slice(0, level);\n\ttoken_o.map = [startLine, state.line];\n\tconst token_i = state.push(\"inline\", \"\", 0);\n\ttoken_i.content = asciiTrim(state.src.slice(pos, max));\n\ttoken_i.map = [startLine, state.line];\n\ttoken_i.children = [];\n\tconst token_c = state.push(\"heading_close\", `h${level}`, -1);\n\ttoken_c.markup = \"########\".slice(0, level);\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/lheading.ts\nfunction lheading(state, startLine, endLine) {\n\tconst terminatorRules = state.md.block.ruler.getRules(\"paragraph\");\n\tif (state.sCount[startLine] - state.blkIndent >= 4) return false;\n\tconst oldParentType = state.parentType;\n\tstate.parentType = \"paragraph\";\n\tlet level = 0;\n\tlet marker;\n\tlet nextLine = startLine + 1;\n\tfor (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {\n\t\tif (state.sCount[nextLine] - state.blkIndent > 3) continue;\n\t\tif (state.sCount[nextLine] >= state.blkIndent) {\n\t\t\tlet pos = state.bMarks[nextLine] + state.tShift[nextLine];\n\t\t\tconst max = state.eMarks[nextLine];\n\t\t\tif (pos < max) {\n\t\t\t\tmarker = state.src.charCodeAt(pos);\n\t\t\t\tif (marker === 45 || marker === 61) {\n\t\t\t\t\tpos = state.skipChars(pos, marker);\n\t\t\t\t\tpos = state.skipSpaces(pos);\n\t\t\t\t\tif (pos >= max) {\n\t\t\t\t\t\tlevel = marker === 61 ? 1 : 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (state.sCount[nextLine] < 0) continue;\n\t\tlet terminate = false;\n\t\tfor (let i = 0, l = terminatorRules.length; i < l; i++) if (terminatorRules[i](state, nextLine, endLine, true)) {\n\t\t\tterminate = true;\n\t\t\tbreak;\n\t\t}\n\t\tif (terminate) break;\n\t}\n\tif (!level) {\n\t\tstate.parentType = oldParentType;\n\t\treturn false;\n\t}\n\tconst content = asciiTrim(state.getLines(startLine, nextLine, state.blkIndent, false));\n\tstate.line = nextLine + 1;\n\tconst token_o = state.push(\"heading_open\", `h${level}`, 1);\n\ttoken_o.markup = String.fromCharCode(marker);\n\ttoken_o.map = [startLine, state.line];\n\tconst token_i = state.push(\"inline\", \"\", 0);\n\ttoken_i.content = content;\n\ttoken_i.map = [startLine, state.line - 1];\n\ttoken_i.children = [];\n\tconst token_c = state.push(\"heading_close\", `h${level}`, -1);\n\ttoken_c.markup = String.fromCharCode(marker);\n\tstate.parentType = oldParentType;\n\treturn true;\n}\n//#endregion\n//#region src/rules_block/paragraph.ts\nfunction paragraph(state, startLine, endLine) {\n\tconst terminatorRules = state.md.block.ruler.getRules(\"paragraph\");\n\tconst oldParentType = state.parentType;\n\tlet nextLine = startLine + 1;\n\tstate.parentType = \"paragraph\";\n\tfor (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {\n\t\tif (state.sCount[nextLine] - state.blkIndent > 3) continue;\n\t\tif (state.sCount[nextLine] < 0) continue;\n\t\tlet terminate = false;\n\t\tfor (let i = 0, l = terminatorRules.length; i < l; i++) if (terminatorRules[i](state, nextLine, endLine, true)) {\n\t\t\tterminate = true;\n\t\t\tbreak;\n\t\t}\n\t\tif (terminate) break;\n\t}\n\tconst content = asciiTrim(state.getLines(startLine, nextLine, state.blkIndent, false));\n\tstate.line = nextLine;\n\tconst token_o = state.push(\"paragraph_open\", \"p\", 1);\n\ttoken_o.map = [startLine, state.line];\n\tconst token_i = state.push(\"inline\", \"\", 0);\n\ttoken_i.content = content;\n\ttoken_i.map = [startLine, state.line];\n\ttoken_i.children = [];\n\tstate.push(\"paragraph_close\", \"p\", -1);\n\tstate.parentType = oldParentType;\n\treturn true;\n}\n//#endregion\n//#region src/parser_block.ts\nvar _rules$1 = [\n\t[\n\t\t\"table\",\n\t\ttable,\n\t\t[\"paragraph\", \"reference\"]\n\t],\n\t[\"code\", code],\n\t[\n\t\t\"fence\",\n\t\tfence,\n\t\t[\n\t\t\t\"paragraph\",\n\t\t\t\"reference\",\n\t\t\t\"blockquote\",\n\t\t\t\"list\"\n\t\t]\n\t],\n\t[\n\t\t\"blockquote\",\n\t\tblockquote,\n\t\t[\n\t\t\t\"paragraph\",\n\t\t\t\"reference\",\n\t\t\t\"blockquote\",\n\t\t\t\"list\"\n\t\t]\n\t],\n\t[\n\t\t\"hr\",\n\t\thr,\n\t\t[\n\t\t\t\"paragraph\",\n\t\t\t\"reference\",\n\t\t\t\"blockquote\",\n\t\t\t\"list\"\n\t\t]\n\t],\n\t[\n\t\t\"list\",\n\t\tlist,\n\t\t[\n\t\t\t\"paragraph\",\n\t\t\t\"reference\",\n\t\t\t\"blockquote\"\n\t\t]\n\t],\n\t[\"reference\", reference],\n\t[\n\t\t\"html_block\",\n\t\thtml_block,\n\t\t[\n\t\t\t\"paragraph\",\n\t\t\t\"reference\",\n\t\t\t\"blockquote\"\n\t\t]\n\t],\n\t[\n\t\t\"heading\",\n\t\theading,\n\t\t[\n\t\t\t\"paragraph\",\n\t\t\t\"reference\",\n\t\t\t\"blockquote\"\n\t\t]\n\t],\n\t[\"lheading\", lheading],\n\t[\"paragraph\", paragraph]\n];\n/**\n* Block-level tokenizer.\n*/\nvar ParserBlock = class {\n\tconstructor() {\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* {@link Ruler} instance. Keep configuration of block rules.\n\t\t\t*/\n\t\t\t\"ruler\",\n\t\t\tnew Ruler()\n\t\t);\n\t\t_defineProperty(this, \"State\", StateBlock);\n\t\tfor (let i = 0; i < _rules$1.length; i++) this.ruler.push(_rules$1[i][0], _rules$1[i][1], { alt: (_rules$1[i][2] || []).slice() });\n\t}\n\ttokenize(state, startLine, endLine) {\n\t\tconst rules = this.ruler.getRules(\"\");\n\t\tconst len = rules.length;\n\t\tconst maxNesting = state.md.options.maxNesting;\n\t\tlet line = startLine;\n\t\tlet hasEmptyLines = false;\n\t\twhile (line < endLine) {\n\t\t\tstate.line = line = state.skipEmptyLines(line);\n\t\t\tif (line >= endLine) break;\n\t\t\tif (state.sCount[line] < state.blkIndent) break;\n\t\t\tif (state.level >= maxNesting) {\n\t\t\t\tstate.line = endLine;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tconst prevLine = state.line;\n\t\t\tlet ok = false;\n\t\t\tfor (let i = 0; i < len; i++) {\n\t\t\t\tok = rules[i](state, line, endLine, false);\n\t\t\t\tif (ok) {\n\t\t\t\t\tif (prevLine >= state.line) throw new Error(\"block rule didn't increment state.line\");\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!ok) throw new Error(\"none of the block rules matched\");\n\t\t\tstate.tight = !hasEmptyLines;\n\t\t\tif (state.isEmpty(state.line - 1)) hasEmptyLines = true;\n\t\t\tline = state.line;\n\t\t\tif (line < endLine && state.isEmpty(line)) {\n\t\t\t\thasEmptyLines = true;\n\t\t\t\tline++;\n\t\t\t\tstate.line = line;\n\t\t\t}\n\t\t}\n\t}\n\t/**\n\t* Process input string and push block tokens into `outTokens`\n\t*/\n\tparse(src, md, env, outTokens) {\n\t\tif (!src) return;\n\t\tconst state = new this.State(src, md, env, outTokens);\n\t\tthis.tokenize(state, state.line, state.lineMax);\n\t}\n};\n//#endregion\n//#region src/rules_inline/state_inline.ts\n/** Mutable state passed to inline rules while tokenizing inline content. */\nvar StateInline = class {\n\tconstructor(src, md, env, outTokens) {\n\t\t_defineProperty(this, \"pos\", 0);\n\t\t_defineProperty(this, \"level\", 0);\n\t\t_defineProperty(this, \"pending\", \"\");\n\t\t_defineProperty(this, \"pendingLevel\", 0);\n\t\t_defineProperty(this, \"cache\", {});\n\t\t_defineProperty(this, \"backticks\", {});\n\t\t_defineProperty(this, \"backticksScanned\", false);\n\t\t_defineProperty(this, \"skipHtmlSpecial\", false);\n\t\t_defineProperty(this, \"linkLevel\", 0);\n\t\t_defineProperty(this, \"delimiters\", []);\n\t\t_defineProperty(this, \"_prev_delimiters\", []);\n\t\t_defineProperty(this, \"Token\", Token);\n\t\tthis.src = src;\n\t\tthis.env = env;\n\t\tthis.md = md;\n\t\tthis.tokens = outTokens;\n\t\tthis.tokens_meta = Array(outTokens.length);\n\t\tthis.posMax = this.src.length;\n\t}\n\tpushPending() {\n\t\tconst token = new Token(\"text\", \"\", 0);\n\t\ttoken.content = this.pending;\n\t\ttoken.level = this.pendingLevel;\n\t\tthis.tokens.push(token);\n\t\tthis.pending = \"\";\n\t\treturn token;\n\t}\n\tpush(type, tag, nesting) {\n\t\tif (this.pending) this.pushPending();\n\t\tconst token = new Token(type, tag, nesting);\n\t\tlet token_meta = void 0;\n\t\tif (nesting < 0) {\n\t\t\tthis.level--;\n\t\t\tthis.delimiters = this._prev_delimiters.pop();\n\t\t}\n\t\ttoken.level = this.level;\n\t\tif (nesting > 0) {\n\t\t\tthis.level++;\n\t\t\tthis._prev_delimiters.push(this.delimiters);\n\t\t\tthis.delimiters = [];\n\t\t\ttoken_meta = { delimiters: this.delimiters };\n\t\t}\n\t\tthis.pendingLevel = this.level;\n\t\tthis.tokens.push(token);\n\t\tthis.tokens_meta.push(token_meta);\n\t\treturn token;\n\t}\n\tscanDelims(start, canSplitWord) {\n\t\tconst max = this.posMax;\n\t\tconst marker = this.src.charCodeAt(start);\n\t\tlet lastChar;\n\t\tif (start === 0) lastChar = 32;\n\t\telse if (start === 1) {\n\t\t\tlastChar = this.src.charCodeAt(0);\n\t\t\tif ((lastChar & 63488) === 55296) lastChar = 65533;\n\t\t} else {\n\t\t\tlastChar = this.src.charCodeAt(start - 1);\n\t\t\tif ((lastChar & 64512) === 56320) {\n\t\t\t\tconst highSurr = this.src.charCodeAt(start - 2);\n\t\t\t\tlastChar = (highSurr & 64512) === 55296 ? 65536 + (highSurr - 55296 << 10) + (lastChar - 56320) : 65533;\n\t\t\t} else if ((lastChar & 64512) === 55296) lastChar = 65533;\n\t\t}\n\t\tlet pos = start;\n\t\twhile (pos < max && this.src.charCodeAt(pos) === marker) pos++;\n\t\tconst count = pos - start;\n\t\tlet nextChar = pos < max ? this.src.charCodeAt(pos) : 32;\n\t\tif ((nextChar & 64512) === 55296) {\n\t\t\tconst lowSurr = this.src.charCodeAt(pos + 1);\n\t\t\tnextChar = (lowSurr & 64512) === 56320 ? 65536 + (nextChar - 55296 << 10) + (lowSurr - 56320) : 65533;\n\t\t} else if ((nextChar & 64512) === 56320) nextChar = 65533;\n\t\tconst isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctCharCode(lastChar);\n\t\tconst isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctCharCode(nextChar);\n\t\tconst isLastWhiteSpace = isWhiteSpace(lastChar);\n\t\tconst isNextWhiteSpace = isWhiteSpace(nextChar);\n\t\tconst left_flanking = !isNextWhiteSpace && (!isNextPunctChar || isLastWhiteSpace || isLastPunctChar);\n\t\tconst right_flanking = !isLastWhiteSpace && (!isLastPunctChar || isNextWhiteSpace || isNextPunctChar);\n\t\treturn {\n\t\t\tcan_open: left_flanking && (canSplitWord || !right_flanking || isLastPunctChar),\n\t\t\tcan_close: right_flanking && (canSplitWord || !left_flanking || isNextPunctChar),\n\t\t\tlength: count\n\t\t};\n\t}\n};\n//#endregion\n//#region src/rules_inline/text.ts\nfunction isTerminatorChar(ch) {\n\tswitch (ch) {\n\t\tcase 10:\n\t\tcase 33:\n\t\tcase 35:\n\t\tcase 36:\n\t\tcase 37:\n\t\tcase 38:\n\t\tcase 42:\n\t\tcase 43:\n\t\tcase 45:\n\t\tcase 58:\n\t\tcase 60:\n\t\tcase 61:\n\t\tcase 62:\n\t\tcase 64:\n\t\tcase 91:\n\t\tcase 92:\n\t\tcase 93:\n\t\tcase 94:\n\t\tcase 95:\n\t\tcase 96:\n\t\tcase 123:\n\t\tcase 125:\n\t\tcase 126: return true;\n\t\tdefault: return false;\n\t}\n}\nfunction text(state, silent) {\n\tlet pos = state.pos;\n\twhile (pos < state.posMax && !isTerminatorChar(state.src.charCodeAt(pos))) pos++;\n\tif (pos === state.pos) return false;\n\tif (!silent) state.pending += state.src.slice(state.pos, pos);\n\tstate.pos = pos;\n\treturn true;\n}\n//#endregion\n//#region src/rules_inline/linkify.ts\nfunction isAsciiAlpha(code) {\n\treturn code >= 65 && code <= 90 || code >= 97 && code <= 122;\n}\nfunction isSchemeChar(code) {\n\treturn code >= 65 && code <= 90 || code >= 97 && code <= 122 || code >= 48 && code <= 57 || code === 43 || code === 45 || code === 46;\n}\nfunction linkify(state, silent) {\n\tif (!state.md.options.linkify) return false;\n\tif (state.linkLevel > 0) return false;\n\tconst pos = state.pos;\n\tconst max = state.posMax;\n\tif (pos + 3 > max) return false;\n\tif (state.src.charCodeAt(pos) !== 58) return false;\n\tif (state.src.charCodeAt(pos + 1) !== 47) return false;\n\tif (state.src.charCodeAt(pos + 2) !== 47) return false;\n\tconst protoMin = pos - Math.min(10, state.pending.length, pos);\n\tlet protoStart = pos;\n\twhile (protoStart > protoMin && isSchemeChar(state.src.charCodeAt(protoStart - 1))) protoStart--;\n\tif (protoStart === pos || !isAsciiAlpha(state.src.charCodeAt(protoStart))) return false;\n\tconst protoLength = pos - protoStart;\n\tconst link = state.md.linkify.matchAtStart(state.src.slice(protoStart));\n\tif (!link) return false;\n\tlet url = link.url;\n\tif (url.length <= protoLength) return false;\n\tlet urlEnd = url.length;\n\twhile (urlEnd > 0 && url.charCodeAt(urlEnd - 1) === 42) urlEnd--;\n\tif (urlEnd !== url.length) url = url.slice(0, urlEnd);\n\tconst fullUrl = state.md.normalizeLink(url);\n\tif (!state.md.validateLink(fullUrl)) return false;\n\tif (!silent) {\n\t\tstate.pending = state.pending.slice(0, -protoLength);\n\t\tconst token_o = state.push(\"link_open\", \"a\", 1);\n\t\ttoken_o.attrs = [[\"href\", fullUrl]];\n\t\ttoken_o.markup = \"linkify\";\n\t\ttoken_o.info = \"auto\";\n\t\tconst token_t = state.push(\"text\", \"\", 0);\n\t\ttoken_t.content = state.md.normalizeLinkText(url);\n\t\tconst token_c = state.push(\"link_close\", \"a\", -1);\n\t\ttoken_c.markup = \"linkify\";\n\t\ttoken_c.info = \"auto\";\n\t}\n\tstate.pos += url.length - protoLength;\n\treturn true;\n}\n//#endregion\n//#region src/rules_inline/newline.ts\nfunction newline(state, silent) {\n\tlet pos = state.pos;\n\tif (state.src.charCodeAt(pos) !== 10) return false;\n\tconst pmax = state.pending.length - 1;\n\tconst max = state.posMax;\n\tif (!silent) {\n\t\tif (pmax >= 0 && state.pending.charCodeAt(pmax) === 32) {\n\t\t\tif (pmax >= 1 && state.pending.charCodeAt(pmax - 1) === 32) {\n\t\t\t\tlet ws = pmax - 1;\n\t\t\t\twhile (ws >= 1 && state.pending.charCodeAt(ws - 1) === 32) ws--;\n\t\t\t\tstate.pending = state.pending.slice(0, ws);\n\t\t\t\tstate.push(\"hardbreak\", \"br\", 0);\n\t\t\t} else {\n\t\t\t\tstate.pending = state.pending.slice(0, -1);\n\t\t\t\tstate.push(\"softbreak\", \"br\", 0);\n\t\t\t}\n\t\t} else state.push(\"softbreak\", \"br\", 0);\n\t}\n\tpos++;\n\twhile (pos < max && isSpace(state.src.charCodeAt(pos))) pos++;\n\tstate.pos = pos;\n\treturn true;\n}\n//#endregion\n//#region src/rules_inline/escape.ts\nvar ESCAPED = [];\nfor (let i = 0; i < 256; i++) ESCAPED.push(0);\n\"\\\\!\\\"#$%&'()*+,./:;<=>?@[]^_`{|}~-\".split(\"\").forEach(function(ch) {\n\tESCAPED[ch.charCodeAt(0)] = 1;\n});\nfunction escape(state, silent) {\n\tlet pos = state.pos;\n\tconst max = state.posMax;\n\tif (state.src.charCodeAt(pos) !== 92) return false;\n\tpos++;\n\tif (pos >= max) return false;\n\tlet ch1 = state.src.charCodeAt(pos);\n\tif (ch1 === 10) {\n\t\tif (!silent) state.push(\"hardbreak\", \"br\", 0);\n\t\tpos++;\n\t\twhile (pos < max) {\n\t\t\tch1 = state.src.charCodeAt(pos);\n\t\t\tif (!isSpace(ch1)) break;\n\t\t\tpos++;\n\t\t}\n\t\tstate.pos = pos;\n\t\treturn true;\n\t}\n\tif (ch1 === 32) {\n\t\tif (!silent) {\n\t\t\tconst token = state.push(\"text_special\", \"\", 0);\n\t\t\ttoken.content = \"\\\\\";\n\t\t\ttoken.markup = \"\\\\\";\n\t\t\ttoken.info = \"escape\";\n\t\t}\n\t\tstate.pos = pos;\n\t\treturn true;\n\t}\n\tlet escapedStr = state.src[pos];\n\tif (ch1 >= 55296 && ch1 <= 56319 && pos + 1 < max) {\n\t\tconst ch2 = state.src.charCodeAt(pos + 1);\n\t\tif (ch2 >= 56320 && ch2 <= 57343) {\n\t\t\tescapedStr += state.src[pos + 1];\n\t\t\tpos++;\n\t\t}\n\t}\n\tconst origStr = \"\\\\\" + escapedStr;\n\tif (!silent) {\n\t\tconst token = state.push(\"text_special\", \"\", 0);\n\t\tif (ch1 < 256 && ESCAPED[ch1] !== 0) token.content = escapedStr;\n\t\telse token.content = origStr;\n\t\ttoken.markup = origStr;\n\t\ttoken.info = \"escape\";\n\t}\n\tstate.pos = pos + 1;\n\treturn true;\n}\n//#endregion\n//#region src/rules_inline/backticks.ts\nfunction buildLastRuns(src) {\n\tconst lastRuns = {};\n\tlet pos = 0;\n\twhile ((pos = src.indexOf(\"`\", pos)) !== -1) {\n\t\tconst start = pos;\n\t\twhile (src.charCodeAt(++pos) === 96);\n\t\tlastRuns[pos - start] = start;\n\t}\n\treturn lastRuns;\n}\nfunction backtick(state, silent) {\n\tvar _state$backticks$open;\n\tconst start = state.pos;\n\tif (state.src.charCodeAt(start) !== 96) return false;\n\tconst max = state.posMax;\n\tlet pos = start + 1;\n\twhile (pos < max && state.src.charCodeAt(pos) === 96) pos++;\n\tconst marker = state.src.slice(start, pos);\n\tconst openerLength = marker.length;\n\tif (!state.backticksScanned) {\n\t\tstate.backticks = buildLastRuns(state.src);\n\t\tstate.backticksScanned = true;\n\t}\n\tif (((_state$backticks$open = state.backticks[openerLength]) !== null && _state$backticks$open !== void 0 ? _state$backticks$open : -1) >= pos) {\n\t\tlet matchEnd = pos;\n\t\tlet matchStart;\n\t\twhile ((matchStart = state.src.indexOf(\"`\", matchEnd)) !== -1 && matchStart < max) {\n\t\t\tmatchEnd = matchStart + 1;\n\t\t\twhile (state.src.charCodeAt(matchEnd) === 96) matchEnd++;\n\t\t\tif (matchEnd > max) break;\n\t\t\tif (matchEnd - matchStart === openerLength) {\n\t\t\t\tif (!silent) {\n\t\t\t\t\tconst token = state.push(\"code_inline\", \"code\", 0);\n\t\t\t\t\ttoken.markup = marker;\n\t\t\t\t\tlet content = state.src.slice(pos, matchStart).replace(/\\n/g, \" \");\n\t\t\t\t\tif (content.startsWith(\" \") && content.endsWith(\" \") && /[^ ]/.test(content)) content = content.slice(1, -1);\n\t\t\t\t\ttoken.content = content;\n\t\t\t\t}\n\t\t\t\tstate.pos = matchEnd;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\tif (!silent) state.pending += marker;\n\tstate.pos = pos;\n\treturn true;\n}\n//#endregion\n//#region src/rules_inline/strikethrough.ts\nfunction strikethrough_tokenize(state, silent) {\n\tconst start = state.pos;\n\tconst marker = state.src.charCodeAt(start);\n\tif (silent) return false;\n\tif (marker !== 126) return false;\n\tconst scanned = state.scanDelims(state.pos, true);\n\tlet len = scanned.length;\n\tconst ch = String.fromCharCode(marker);\n\tif (len < 2) return false;\n\tlet token;\n\tif (len % 2) {\n\t\ttoken = state.push(\"text\", \"\", 0);\n\t\ttoken.content = ch;\n\t\tlen--;\n\t}\n\tfor (let i = 0; i < len; i += 2) {\n\t\ttoken = state.push(\"text\", \"\", 0);\n\t\ttoken.content = ch + ch;\n\t\tstate.delimiters.push({\n\t\t\tmarker,\n\t\t\tlength: 0,\n\t\t\ttoken: state.tokens.length - 1,\n\t\t\tend: -1,\n\t\t\topen: scanned.can_open,\n\t\t\tclose: scanned.can_close\n\t\t});\n\t}\n\tstate.pos += scanned.length;\n\treturn true;\n}\nfunction postProcess$1(state, delimiters) {\n\tlet token;\n\tconst loneMarkers = [];\n\tconst max = delimiters.length;\n\tfor (let i = 0; i < max; i++) {\n\t\tconst startDelim = delimiters[i];\n\t\tif (startDelim.marker !== 126) continue;\n\t\tif (startDelim.end === -1) continue;\n\t\tconst endDelim = delimiters[startDelim.end];\n\t\ttoken = state.tokens[startDelim.token];\n\t\ttoken.type = \"s_open\";\n\t\ttoken.tag = \"s\";\n\t\ttoken.nesting = 1;\n\t\ttoken.markup = \"~~\";\n\t\ttoken.content = \"\";\n\t\ttoken = state.tokens[endDelim.token];\n\t\ttoken.type = \"s_close\";\n\t\ttoken.tag = \"s\";\n\t\ttoken.nesting = -1;\n\t\ttoken.markup = \"~~\";\n\t\ttoken.content = \"\";\n\t\tif (state.tokens[endDelim.token - 1].type === \"text\" && state.tokens[endDelim.token - 1].content === \"~\") loneMarkers.push(endDelim.token - 1);\n\t}\n\twhile (loneMarkers.length) {\n\t\tconst i = loneMarkers.pop();\n\t\tlet j = i + 1;\n\t\twhile (j < state.tokens.length && state.tokens[j].type === \"s_close\") j++;\n\t\tj--;\n\t\tif (i !== j) {\n\t\t\ttoken = state.tokens[j];\n\t\t\tstate.tokens[j] = state.tokens[i];\n\t\t\tstate.tokens[i] = token;\n\t\t}\n\t}\n}\nfunction strikethrough_postProcess(state) {\n\tconst tokens_meta = state.tokens_meta;\n\tconst max = state.tokens_meta.length;\n\tpostProcess$1(state, state.delimiters);\n\tfor (let curr = 0; curr < max; curr++) {\n\t\tvar _tokens_meta$curr;\n\t\tconst delimiters = (_tokens_meta$curr = tokens_meta[curr]) === null || _tokens_meta$curr === void 0 ? void 0 : _tokens_meta$curr.delimiters;\n\t\tif (delimiters) postProcess$1(state, delimiters);\n\t}\n}\nvar strikethrough_default = {\n\ttokenize: strikethrough_tokenize,\n\tpostProcess: strikethrough_postProcess\n};\n//#endregion\n//#region src/rules_inline/emphasis.ts\nfunction emphasis_tokenize(state, silent) {\n\tconst start = state.pos;\n\tconst marker = state.src.charCodeAt(start);\n\tif (silent) return false;\n\tif (marker !== 95 && marker !== 42) return false;\n\tconst scanned = state.scanDelims(state.pos, marker === 42);\n\tfor (let i = 0; i < scanned.length; i++) {\n\t\tconst token = state.push(\"text\", \"\", 0);\n\t\ttoken.content = String.fromCharCode(marker);\n\t\tstate.delimiters.push({\n\t\t\tmarker,\n\t\t\tlength: scanned.length,\n\t\t\ttoken: state.tokens.length - 1,\n\t\t\tend: -1,\n\t\t\topen: scanned.can_open,\n\t\t\tclose: scanned.can_close\n\t\t});\n\t}\n\tstate.pos += scanned.length;\n\treturn true;\n}\nfunction postProcess(state, delimiters) {\n\tconst max = delimiters.length;\n\tfor (let i = max - 1; i >= 0; i--) {\n\t\tconst startDelim = delimiters[i];\n\t\tif (startDelim.marker !== 95 && startDelim.marker !== 42) continue;\n\t\tif (startDelim.end === -1) continue;\n\t\tconst endDelim = delimiters[startDelim.end];\n\t\tconst isStrong = i > 0 && delimiters[i - 1].end === startDelim.end + 1 && delimiters[i - 1].marker === startDelim.marker && delimiters[i - 1].token === startDelim.token - 1 && delimiters[startDelim.end + 1].token === endDelim.token + 1;\n\t\tconst ch = String.fromCharCode(startDelim.marker);\n\t\tconst token_o = state.tokens[startDelim.token];\n\t\ttoken_o.type = isStrong ? \"strong_open\" : \"em_open\";\n\t\ttoken_o.tag = isStrong ? \"strong\" : \"em\";\n\t\ttoken_o.nesting = 1;\n\t\ttoken_o.markup = isStrong ? ch + ch : ch;\n\t\ttoken_o.content = \"\";\n\t\tconst token_c = state.tokens[endDelim.token];\n\t\ttoken_c.type = isStrong ? \"strong_close\" : \"em_close\";\n\t\ttoken_c.tag = isStrong ? \"strong\" : \"em\";\n\t\ttoken_c.nesting = -1;\n\t\ttoken_c.markup = isStrong ? ch + ch : ch;\n\t\ttoken_c.content = \"\";\n\t\tif (isStrong) {\n\t\t\tstate.tokens[delimiters[i - 1].token].content = \"\";\n\t\t\tstate.tokens[delimiters[startDelim.end + 1].token].content = \"\";\n\t\t\ti--;\n\t\t}\n\t}\n}\nfunction emphasis_post_process(state) {\n\tconst tokens_meta = state.tokens_meta;\n\tconst max = state.tokens_meta.length;\n\tpostProcess(state, state.delimiters);\n\tfor (let curr = 0; curr < max; curr++) {\n\t\tvar _tokens_meta$curr;\n\t\tconst delimiters = (_tokens_meta$curr = tokens_meta[curr]) === null || _tokens_meta$curr === void 0 ? void 0 : _tokens_meta$curr.delimiters;\n\t\tif (delimiters) postProcess(state, delimiters);\n\t}\n}\nvar emphasis_default = {\n\ttokenize: emphasis_tokenize,\n\tpostProcess: emphasis_post_process\n};\n//#endregion\n//#region src/rules_inline/link.ts\nfunction link(state, silent) {\n\tlet code, label, res, ref;\n\tlet href = \"\";\n\tlet title = \"\";\n\tlet start = state.pos;\n\tlet parseReference = true;\n\tif (state.src.charCodeAt(state.pos) !== 91) return false;\n\tconst oldPos = state.pos;\n\tconst max = state.posMax;\n\tconst labelStart = state.pos + 1;\n\tconst labelEnd = state.md.helpers.parseLinkLabel(state, state.pos, true);\n\tif (labelEnd < 0) return false;\n\tlet pos = labelEnd + 1;\n\tif (pos < max && state.src.charCodeAt(pos) === 40) {\n\t\tparseReference = false;\n\t\tpos++;\n\t\tfor (; pos < max; pos++) {\n\t\t\tcode = state.src.charCodeAt(pos);\n\t\t\tif (!isSpace(code) && code !== 10) break;\n\t\t}\n\t\tif (pos >= max) return false;\n\t\tstart = pos;\n\t\tres = state.md.helpers.parseLinkDestination(state.src, pos, state.posMax);\n\t\tif (res.ok) {\n\t\t\thref = state.md.normalizeLink(res.str);\n\t\t\tif (state.md.validateLink(href)) pos = res.pos;\n\t\t\telse href = \"\";\n\t\t\tstart = pos;\n\t\t\tfor (; pos < max; pos++) {\n\t\t\t\tcode = state.src.charCodeAt(pos);\n\t\t\t\tif (!isSpace(code) && code !== 10) break;\n\t\t\t}\n\t\t\tres = state.md.helpers.parseLinkTitle(state.src, pos, state.posMax);\n\t\t\tif (pos < max && start !== pos && res.ok) {\n\t\t\t\ttitle = res.str;\n\t\t\t\tpos = res.pos;\n\t\t\t\tfor (; pos < max; pos++) {\n\t\t\t\t\tcode = state.src.charCodeAt(pos);\n\t\t\t\t\tif (!isSpace(code) && code !== 10) break;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (pos >= max || state.src.charCodeAt(pos) !== 41) parseReference = true;\n\t\tpos++;\n\t}\n\tif (parseReference) {\n\t\tif (typeof state.env.references === \"undefined\") return false;\n\t\tif (pos < max && state.src.charCodeAt(pos) === 91) {\n\t\t\tstart = pos + 1;\n\t\t\tpos = state.md.helpers.parseLinkLabel(state, pos);\n\t\t\tif (pos >= 0) label = state.src.slice(start, pos++);\n\t\t\telse pos = labelEnd + 1;\n\t\t} else pos = labelEnd + 1;\n\t\tif (!label) label = state.src.slice(labelStart, labelEnd);\n\t\tlabel = normalizeReference(label);\n\t\tref = state.env.references[label];\n\t\tif (!ref) {\n\t\t\tstate.pos = oldPos;\n\t\t\treturn false;\n\t\t}\n\t\thref = ref.href;\n\t\ttitle = ref.title;\n\t}\n\tif (!silent) {\n\t\tstate.pos = labelStart;\n\t\tstate.posMax = labelEnd;\n\t\tconst token_o = state.push(\"link_open\", \"a\", 1);\n\t\tconst attrs = [[\"href\", href]];\n\t\ttoken_o.attrs = attrs;\n\t\tif (title) attrs.push([\"title\", title]);\n\t\tif (label) {\n\t\t\tconst meta = Object.create(null);\n\t\t\tmeta.label = label;\n\t\t\ttoken_o.meta = meta;\n\t\t}\n\t\tstate.linkLevel++;\n\t\tstate.md.inline.tokenize(state);\n\t\tstate.linkLevel--;\n\t\tstate.push(\"link_close\", \"a\", -1);\n\t}\n\tstate.pos = pos;\n\tstate.posMax = max;\n\treturn true;\n}\n//#endregion\n//#region src/rules_inline/image.ts\nfunction image(state, silent) {\n\tlet code, content, label, pos, ref, res, title, start;\n\tlet href = \"\";\n\tconst oldPos = state.pos;\n\tconst max = state.posMax;\n\tif (state.src.charCodeAt(state.pos) !== 33) return false;\n\tif (state.src.charCodeAt(state.pos + 1) !== 91) return false;\n\tconst labelStart = state.pos + 2;\n\tconst labelEnd = state.md.helpers.parseLinkLabel(state, state.pos + 1, false);\n\tif (labelEnd < 0) return false;\n\tpos = labelEnd + 1;\n\tif (pos < max && state.src.charCodeAt(pos) === 40) {\n\t\tpos++;\n\t\tfor (; pos < max; pos++) {\n\t\t\tcode = state.src.charCodeAt(pos);\n\t\t\tif (!isSpace(code) && code !== 10) break;\n\t\t}\n\t\tif (pos >= max) return false;\n\t\tstart = pos;\n\t\tres = state.md.helpers.parseLinkDestination(state.src, pos, state.posMax);\n\t\tif (res.ok) {\n\t\t\thref = state.md.normalizeLink(res.str);\n\t\t\tif (state.md.validateLink(href)) pos = res.pos;\n\t\t\telse href = \"\";\n\t\t}\n\t\tstart = pos;\n\t\tfor (; pos < max; pos++) {\n\t\t\tcode = state.src.charCodeAt(pos);\n\t\t\tif (!isSpace(code) && code !== 10) break;\n\t\t}\n\t\tres = state.md.helpers.parseLinkTitle(state.src, pos, state.posMax);\n\t\tif (pos < max && start !== pos && res.ok) {\n\t\t\ttitle = res.str;\n\t\t\tpos = res.pos;\n\t\t\tfor (; pos < max; pos++) {\n\t\t\t\tcode = state.src.charCodeAt(pos);\n\t\t\t\tif (!isSpace(code) && code !== 10) break;\n\t\t\t}\n\t\t} else title = \"\";\n\t\tif (pos >= max || state.src.charCodeAt(pos) !== 41) {\n\t\t\tstate.pos = oldPos;\n\t\t\treturn false;\n\t\t}\n\t\tpos++;\n\t} else {\n\t\tif (typeof state.env.references === \"undefined\") return false;\n\t\tif (pos < max && state.src.charCodeAt(pos) === 91) {\n\t\t\tstart = pos + 1;\n\t\t\tpos = state.md.helpers.parseLinkLabel(state, pos);\n\t\t\tif (pos >= 0) label = state.src.slice(start, pos++);\n\t\t\telse pos = labelEnd + 1;\n\t\t} else pos = labelEnd + 1;\n\t\tif (!label) label = state.src.slice(labelStart, labelEnd);\n\t\tlabel = normalizeReference(label);\n\t\tref = state.env.references[label];\n\t\tif (!ref) {\n\t\t\tstate.pos = oldPos;\n\t\t\treturn false;\n\t\t}\n\t\thref = ref.href;\n\t\ttitle = ref.title;\n\t}\n\tif (!silent) {\n\t\tcontent = state.src.slice(labelStart, labelEnd);\n\t\tconst tokens = [];\n\t\tstate.md.inline.parse(content, state.md, state.env, tokens);\n\t\tconst token = state.push(\"image\", \"img\", 0);\n\t\tconst attrs = [[\"src\", href], [\"alt\", \"\"]];\n\t\ttoken.attrs = attrs;\n\t\ttoken.children = tokens;\n\t\ttoken.content = content;\n\t\tif (title) attrs.push([\"title\", title]);\n\t\tif (label) {\n\t\t\tconst meta = Object.create(null);\n\t\t\tmeta.label = label;\n\t\t\ttoken.meta = meta;\n\t\t}\n\t}\n\tstate.pos = pos;\n\tstate.posMax = max;\n\treturn true;\n}\n//#endregion\n//#region src/rules_inline/autolink.ts\nvar EMAIL_RE = /^([a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*)$/;\nvar AUTOLINK_RE = /^([a-zA-Z][a-zA-Z0-9+.-]{1,31}):([^<>\\x00-\\x20]*)$/;\nfunction autolink(state, silent) {\n\tlet pos = state.pos;\n\tif (state.src.charCodeAt(pos) !== 60) return false;\n\tconst start = state.pos;\n\tconst max = state.posMax;\n\tfor (;;) {\n\t\tif (++pos >= max) return false;\n\t\tconst ch = state.src.charCodeAt(pos);\n\t\tif (ch === 60) return false;\n\t\tif (ch === 62) break;\n\t}\n\tconst url = state.src.slice(start + 1, pos);\n\tif (AUTOLINK_RE.test(url)) {\n\t\tconst fullUrl = state.md.normalizeLink(url);\n\t\tif (!state.md.validateLink(fullUrl)) return false;\n\t\tif (!silent) {\n\t\t\tconst token_o = state.push(\"link_open\", \"a\", 1);\n\t\t\ttoken_o.attrs = [[\"href\", fullUrl]];\n\t\t\ttoken_o.markup = \"autolink\";\n\t\t\ttoken_o.info = \"auto\";\n\t\t\tconst token_t = state.push(\"text\", \"\", 0);\n\t\t\ttoken_t.content = state.md.normalizeLinkText(url);\n\t\t\tconst token_c = state.push(\"link_close\", \"a\", -1);\n\t\t\ttoken_c.markup = \"autolink\";\n\t\t\ttoken_c.info = \"auto\";\n\t\t}\n\t\tstate.pos += url.length + 2;\n\t\treturn true;\n\t}\n\tif (EMAIL_RE.test(url)) {\n\t\tconst fullUrl = state.md.normalizeLink(`mailto:${url}`);\n\t\tif (!state.md.validateLink(fullUrl)) return false;\n\t\tif (!silent) {\n\t\t\tconst token_o = state.push(\"link_open\", \"a\", 1);\n\t\t\ttoken_o.attrs = [[\"href\", fullUrl]];\n\t\t\ttoken_o.markup = \"autolink\";\n\t\t\ttoken_o.info = \"auto\";\n\t\t\tconst token_t = state.push(\"text\", \"\", 0);\n\t\t\ttoken_t.content = state.md.normalizeLinkText(url);\n\t\t\tconst token_c = state.push(\"link_close\", \"a\", -1);\n\t\t\ttoken_c.markup = \"autolink\";\n\t\t\ttoken_c.info = \"auto\";\n\t\t}\n\t\tstate.pos += url.length + 2;\n\t\treturn true;\n\t}\n\treturn false;\n}\n//#endregion\n//#region src/rules_inline/html_inline.ts\nfunction isLinkOpen(str) {\n\treturn /^<a[>\\s]/i.test(str);\n}\nfunction isLinkClose(str) {\n\treturn /^<\\/a\\s*>/i.test(str);\n}\nfunction isLetter(ch) {\n\tconst lc = ch | 32;\n\treturn lc >= 97 && lc <= 122;\n}\nfunction scanSpecial(state, pos) {\n\tconst src = state.src;\n\tlet start;\n\tlet terminator;\n\tif (src.startsWith(\"<!--\", pos)) {\n\t\tif (src.startsWith(\">\", pos + 4)) return pos + 5;\n\t\tif (src.startsWith(\"->\", pos + 4)) return pos + 6;\n\t\tstart = pos + 4;\n\t\tterminator = \"-->\";\n\t} else if (src.startsWith(\"<![CDATA[\", pos)) {\n\t\tstart = pos + 9;\n\t\tterminator = \"]]>\";\n\t} else if (src.charCodeAt(pos + 1) === 63) {\n\t\tstart = pos + 2;\n\t\tterminator = \"?>\";\n\t} else if (isLetter(src.charCodeAt(pos + 2))) {\n\t\tstart = pos + 3;\n\t\tterminator = \">\";\n\t} else return -1;\n\tif (state.skipHtmlSpecial) return -1;\n\tconst end = src.indexOf(terminator, start);\n\tif (end < 0) {\n\t\tstate.skipHtmlSpecial = true;\n\t\treturn -1;\n\t}\n\treturn end + terminator.length;\n}\nfunction html_inline(state, silent) {\n\tif (!state.md.options.html) return false;\n\tconst max = state.posMax;\n\tconst pos = state.pos;\n\tif (state.src.charCodeAt(pos) !== 60 || pos + 2 >= max) return false;\n\tlet end;\n\tconst ch = state.src.charCodeAt(pos + 1);\n\tif (ch === 33 || ch === 63) end = scanSpecial(state, pos);\n\telse if (ch === 47 || isLetter(ch)) {\n\t\tconst match = state.src.slice(pos).match(HTML_OPEN_CLOSE_TAG_RE);\n\t\tend = match ? pos + match[0].length : -1;\n\t} else return false;\n\tif (end < 0) return false;\n\tif (!silent) {\n\t\tconst token = state.push(\"html_inline\", \"\", 0);\n\t\ttoken.content = state.src.slice(pos, end);\n\t\tif (isLinkOpen(token.content)) state.linkLevel++;\n\t\tif (isLinkClose(token.content)) state.linkLevel--;\n\t}\n\tstate.pos = end;\n\treturn true;\n}\n//#endregion\n//#region src/rules_inline/entity.ts\nvar DIGITAL_RE = /^&#((?:x[a-f0-9]{1,6}|[0-9]{1,7}));/i;\nvar NAMED_RE = /^&([a-z][a-z0-9]{1,31});/i;\nfunction entity(state, silent) {\n\tconst pos = state.pos;\n\tconst max = state.posMax;\n\tif (state.src.charCodeAt(pos) !== 38) return false;\n\tif (pos + 1 >= max) return false;\n\tif (state.src.charCodeAt(pos + 1) === 35) {\n\t\tconst match = state.src.slice(pos).match(DIGITAL_RE);\n\t\tif (match) {\n\t\t\tif (!silent) {\n\t\t\t\tconst code = match[1][0].toLowerCase() === \"x\" ? parseInt(match[1].slice(1), 16) : parseInt(match[1], 10);\n\t\t\t\tconst token = state.push(\"text_special\", \"\", 0);\n\t\t\t\ttoken.content = isValidEntityCode(code) ? fromCodePoint(code) : fromCodePoint(65533);\n\t\t\t\ttoken.markup = match[0];\n\t\t\t\ttoken.info = \"entity\";\n\t\t\t}\n\t\t\tstate.pos += match[0].length;\n\t\t\treturn true;\n\t\t}\n\t} else {\n\t\tconst match = state.src.slice(pos).match(NAMED_RE);\n\t\tif (match) {\n\t\t\tconst decoded = decodeHTMLStrict(match[0]);\n\t\t\tif (decoded !== match[0]) {\n\t\t\t\tif (!silent) {\n\t\t\t\t\tconst token = state.push(\"text_special\", \"\", 0);\n\t\t\t\t\ttoken.content = decoded;\n\t\t\t\t\ttoken.markup = match[0];\n\t\t\t\t\ttoken.info = \"entity\";\n\t\t\t\t}\n\t\t\t\tstate.pos += match[0].length;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n//#endregion\n//#region src/rules_inline/balance_pairs.ts\nfunction processDelimiters(delimiters) {\n\tconst openersBottom = {};\n\tconst max = delimiters.length;\n\tif (!max) return;\n\tlet headerIdx = 0;\n\tlet lastTokenIdx = -2;\n\tconst jumps = [];\n\tfor (let closerIdx = 0; closerIdx < max; closerIdx++) {\n\t\tconst closer = delimiters[closerIdx];\n\t\tjumps.push(0);\n\t\tif (delimiters[headerIdx].marker !== closer.marker || lastTokenIdx !== closer.token - 1) headerIdx = closerIdx;\n\t\tlastTokenIdx = closer.token;\n\t\tcloser.length = closer.length || 0;\n\t\tif (!closer.close) continue;\n\t\tif (!openersBottom.hasOwnProperty(closer.marker)) openersBottom[closer.marker] = [\n\t\t\t-1,\n\t\t\t-1,\n\t\t\t-1,\n\t\t\t-1,\n\t\t\t-1,\n\t\t\t-1\n\t\t];\n\t\tconst minOpenerIdx = openersBottom[closer.marker][(closer.open ? 3 : 0) + closer.length % 3];\n\t\tlet openerIdx = headerIdx - jumps[headerIdx] - 1;\n\t\tlet newMinOpenerIdx = openerIdx;\n\t\tfor (; openerIdx > minOpenerIdx; openerIdx -= jumps[openerIdx] + 1) {\n\t\t\tconst opener = delimiters[openerIdx];\n\t\t\tif (opener.marker !== closer.marker) continue;\n\t\t\tif (opener.open && opener.end < 0) {\n\t\t\t\tlet isOddMatch = false;\n\t\t\t\tif (opener.close || closer.open) {\n\t\t\t\t\tif ((opener.length + closer.length) % 3 === 0) {\n\t\t\t\t\t\tif (opener.length % 3 !== 0 || closer.length % 3 !== 0) isOddMatch = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!isOddMatch) {\n\t\t\t\t\tconst lastJump = openerIdx > 0 && !delimiters[openerIdx - 1].open ? jumps[openerIdx - 1] + 1 : 0;\n\t\t\t\t\tjumps[closerIdx] = closerIdx - openerIdx + lastJump;\n\t\t\t\t\tjumps[openerIdx] = lastJump;\n\t\t\t\t\tcloser.open = false;\n\t\t\t\t\topener.end = closerIdx;\n\t\t\t\t\topener.close = false;\n\t\t\t\t\tnewMinOpenerIdx = -1;\n\t\t\t\t\tlastTokenIdx = -2;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (newMinOpenerIdx !== -1) openersBottom[closer.marker][(closer.open ? 3 : 0) + (closer.length || 0) % 3] = newMinOpenerIdx;\n\t}\n}\nfunction link_pairs(state) {\n\tconst tokens_meta = state.tokens_meta;\n\tconst max = state.tokens_meta.length;\n\tprocessDelimiters(state.delimiters);\n\tfor (let curr = 0; curr < max; curr++) {\n\t\tvar _tokens_meta$curr;\n\t\tconst delimiters = (_tokens_meta$curr = tokens_meta[curr]) === null || _tokens_meta$curr === void 0 ? void 0 : _tokens_meta$curr.delimiters;\n\t\tif (delimiters) processDelimiters(delimiters);\n\t}\n}\n//#endregion\n//#region src/rules_inline/fragments_join.ts\nfunction fragments_join(state) {\n\tlet curr, last;\n\tlet level = 0;\n\tconst tokens = state.tokens;\n\tconst max = state.tokens.length;\n\tfor (curr = last = 0; curr < max; curr++) {\n\t\tif (tokens[curr].nesting < 0) level--;\n\t\ttokens[curr].level = level;\n\t\tif (tokens[curr].nesting > 0) level++;\n\t\tif (tokens[curr].type === \"text\" && curr + 1 < max && tokens[curr + 1].type === \"text\") tokens[curr + 1].content = tokens[curr].content + tokens[curr + 1].content;\n\t\telse {\n\t\t\tif (curr !== last) tokens[last] = tokens[curr];\n\t\t\tlast++;\n\t\t}\n\t}\n\tif (curr !== last) tokens.length = last;\n}\n//#endregion\n//#region src/parser_inline.ts\nvar _rules = [\n\t[\"text\", text],\n\t[\"linkify\", linkify],\n\t[\"newline\", newline],\n\t[\"escape\", escape],\n\t[\"backticks\", backtick],\n\t[\"strikethrough\", strikethrough_default.tokenize],\n\t[\"emphasis\", emphasis_default.tokenize],\n\t[\"link\", link],\n\t[\"image\", image],\n\t[\"autolink\", autolink],\n\t[\"html_inline\", html_inline],\n\t[\"entity\", entity]\n];\nvar _rules2 = [\n\t[\"balance_pairs\", link_pairs],\n\t[\"strikethrough\", strikethrough_default.postProcess],\n\t[\"emphasis\", emphasis_default.postProcess],\n\t[\"fragments_join\", fragments_join]\n];\n/**\n* Tokenizes paragraph content.\n*/\nvar ParserInline = class {\n\tconstructor() {\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* {@link Ruler} instance. Keep configuration of inline rules.\n\t\t\t*/\n\t\t\t\"ruler\",\n\t\t\tnew Ruler()\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* {@link Ruler} instance. Second ruler used for post-processing\n\t\t\t* (e.g. in emphasis-like rules).\n\t\t\t*/\n\t\t\t\"ruler2\",\n\t\t\tnew Ruler()\n\t\t);\n\t\t_defineProperty(this, \"State\", StateInline);\n\t\tfor (let i = 0; i < _rules.length; i++) this.ruler.push(_rules[i][0], _rules[i][1]);\n\t\tfor (let i = 0; i < _rules2.length; i++) this.ruler2.push(_rules2[i][0], _rules2[i][1]);\n\t}\n\tskipToken(state) {\n\t\tconst pos = state.pos;\n\t\tconst rules = this.ruler.getRules(\"\");\n\t\tconst len = rules.length;\n\t\tconst maxNesting = state.md.options.maxNesting;\n\t\tconst cache = state.cache;\n\t\tif (typeof cache[pos] !== \"undefined\") {\n\t\t\tstate.pos = cache[pos];\n\t\t\treturn;\n\t\t}\n\t\tlet ok = false;\n\t\tif (state.level < maxNesting) for (let i = 0; i < len; i++) {\n\t\t\tstate.level++;\n\t\t\tok = rules[i](state, true);\n\t\t\tstate.level--;\n\t\t\tif (ok) {\n\t\t\t\tif (pos >= state.pos) throw new Error(\"inline rule didn't increment state.pos\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\telse state.pos = state.posMax;\n\t\tif (!ok) state.pos++;\n\t\tcache[pos] = state.pos;\n\t}\n\ttokenize(state) {\n\t\tconst rules = this.ruler.getRules(\"\");\n\t\tconst len = rules.length;\n\t\tconst end = state.posMax;\n\t\tconst maxNesting = state.md.options.maxNesting;\n\t\twhile (state.pos < end) {\n\t\t\tconst prevPos = state.pos;\n\t\t\tlet ok = false;\n\t\t\tif (state.level < maxNesting) for (let i = 0; i < len; i++) {\n\t\t\t\tok = rules[i](state, false);\n\t\t\t\tif (ok) {\n\t\t\t\t\tif (prevPos >= state.pos) throw new Error(\"inline rule didn't increment state.pos\");\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tif (state.pos >= end) break;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tstate.pending += state.src[state.pos++];\n\t\t}\n\t\tif (state.pending) state.pushPending();\n\t}\n\t/**\n\t* Process input string and push inline tokens into `outTokens`\n\t*/\n\tparse(str, md, env, outTokens) {\n\t\tconst state = new this.State(str, md, env, outTokens);\n\t\tthis.tokenize(state);\n\t\tconst rules = this.ruler2.getRules(\"\");\n\t\tconst len = rules.length;\n\t\tfor (let i = 0; i < len; i++) rules[i](state);\n\t}\n};\n//#endregion\n//#region src/markdownit.ts\nvar config = {\n\tdefault: {\n\t\toptions: {\n\t\t\thtml: false,\n\t\t\txhtmlOut: false,\n\t\t\tbreaks: false,\n\t\t\tlangPrefix: \"language-\",\n\t\t\tlinkify: false,\n\t\t\ttypographer: false,\n\t\t\tquotes: \"“”‘’\",\n\t\t\thighlight: null,\n\t\t\tmaxNesting: 100\n\t\t},\n\t\tcomponents: {\n\t\t\tcore: {},\n\t\t\tblock: {},\n\t\t\tinline: {}\n\t\t}\n\t},\n\tzero: {\n\t\toptions: {\n\t\t\thtml: false,\n\t\t\txhtmlOut: false,\n\t\t\tbreaks: false,\n\t\t\tlangPrefix: \"language-\",\n\t\t\tlinkify: false,\n\t\t\ttypographer: false,\n\t\t\tquotes: \"“”‘’\",\n\t\t\thighlight: null,\n\t\t\tmaxNesting: 20\n\t\t},\n\t\tcomponents: {\n\t\t\tcore: { rules: [\n\t\t\t\t\"normalize\",\n\t\t\t\t\"block\",\n\t\t\t\t\"strip_references\",\n\t\t\t\t\"inline\",\n\t\t\t\t\"text_join\"\n\t\t\t] },\n\t\t\tblock: { rules: [\"paragraph\"] },\n\t\t\tinline: {\n\t\t\t\trules: [\"text\"],\n\t\t\t\trules2: [\"balance_pairs\", \"fragments_join\"]\n\t\t\t}\n\t\t}\n\t},\n\tcommonmark: {\n\t\toptions: {\n\t\t\thtml: true,\n\t\t\txhtmlOut: true,\n\t\t\tbreaks: false,\n\t\t\tlangPrefix: \"language-\",\n\t\t\tlinkify: false,\n\t\t\ttypographer: false,\n\t\t\tquotes: \"“”‘’\",\n\t\t\thighlight: null,\n\t\t\tmaxNesting: 20\n\t\t},\n\t\tcomponents: {\n\t\t\tcore: { rules: [\n\t\t\t\t\"normalize\",\n\t\t\t\t\"block\",\n\t\t\t\t\"strip_references\",\n\t\t\t\t\"inline\",\n\t\t\t\t\"text_join\"\n\t\t\t] },\n\t\t\tblock: { rules: [\n\t\t\t\t\"blockquote\",\n\t\t\t\t\"code\",\n\t\t\t\t\"fence\",\n\t\t\t\t\"heading\",\n\t\t\t\t\"hr\",\n\t\t\t\t\"html_block\",\n\t\t\t\t\"lheading\",\n\t\t\t\t\"list\",\n\t\t\t\t\"reference\",\n\t\t\t\t\"paragraph\"\n\t\t\t] },\n\t\t\tinline: {\n\t\t\t\trules: [\n\t\t\t\t\t\"autolink\",\n\t\t\t\t\t\"backticks\",\n\t\t\t\t\t\"emphasis\",\n\t\t\t\t\t\"entity\",\n\t\t\t\t\t\"escape\",\n\t\t\t\t\t\"html_inline\",\n\t\t\t\t\t\"image\",\n\t\t\t\t\t\"link\",\n\t\t\t\t\t\"newline\",\n\t\t\t\t\t\"text\"\n\t\t\t\t],\n\t\t\t\trules2: [\n\t\t\t\t\t\"balance_pairs\",\n\t\t\t\t\t\"emphasis\",\n\t\t\t\t\t\"fragments_join\"\n\t\t\t\t]\n\t\t\t}\n\t\t}\n\t}\n};\nvar BAD_PROTO_RE = /^(vbscript|javascript|file|data):/;\nvar GOOD_DATA_RE = /^data:image\\/(gif|png|jpeg|webp);/;\nvar RECODE_HOSTNAME_FOR = [\n\t\"http:\",\n\t\"https:\",\n\t\"mailto:\"\n];\n/**\n* Parses Markdown into tokens and renders them to HTML.\n*\n* @category Main\n*/\nvar MarkdownIt = class {\n\t/**\n\t* Link validation function. CommonMark allows too much in links. By default\n\t* we disable `javascript:`, `vbscript:`, `file:` schemas, and almost all `data:...` schemas\n\t* except some embedded image types.\n\t*\n\t* You can change this behaviour:\n\t*\n\t* @example\n\t* ```javascript\n\t* import MarkdownIt from 'markdown-it'\n\t* const md = new MarkdownIt()\n\t*\n\t* // enable everything\n\t* md.validateLink = function () { return true; }\n\t* ```\n\t*/\n\tvalidateLink(url) {\n\t\tconst str = url.trim().toLowerCase();\n\t\treturn BAD_PROTO_RE.test(str) ? GOOD_DATA_RE.test(str) : true;\n\t}\n\t/**\n\t* Function used to encode link url to a machine-readable format,\n\t* which includes url-encoding, punycode, etc.\n\t*/\n\tnormalizeLink(url) {\n\t\tconst parsed = mdurl.parse(url, true);\n\t\tif (parsed.hostname) {\n\t\t\tif (!parsed.protocol || RECODE_HOSTNAME_FOR.indexOf(parsed.protocol) >= 0) try {\n\t\t\t\tparsed.hostname = punycode.toASCII(parsed.hostname);\n\t\t\t} catch (er) {}\n\t\t}\n\t\tif (parsed.auth) parsed.auth = mdurl.encode(parsed.auth);\n\t\tif (parsed.hostname) parsed.hostname = mdurl.encode(parsed.hostname);\n\t\tif (parsed.pathname) parsed.pathname = mdurl.encode(parsed.pathname);\n\t\tif (parsed.search) parsed.search = mdurl.encode(parsed.search);\n\t\tif (parsed.hash) parsed.hash = mdurl.encode(parsed.hash);\n\t\treturn mdurl.format(parsed);\n\t}\n\t/**\n\t* Function used to decode link url to a human-readable format`\n\t*/\n\tnormalizeLinkText(url) {\n\t\tconst parsed = mdurl.parse(url, true);\n\t\tif (parsed.hostname) {\n\t\t\tif (!parsed.protocol || RECODE_HOSTNAME_FOR.indexOf(parsed.protocol) >= 0) try {\n\t\t\t\tparsed.hostname = punycode.toUnicode(parsed.hostname);\n\t\t\t} catch (er) {}\n\t\t}\n\t\treturn mdurl.decode(mdurl.format(parsed), mdurl.decode.defaultChars + \"%\");\n\t}\n\tconstructor(...args) {\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Instance of {@link ParserInline}. You may need it to add new rules when\n\t\t\t* writing plugins. For simple rules control use {@link MarkdownIt.disable}\n\t\t\t* and {@link MarkdownIt.enable}.\n\t\t\t*/\n\t\t\t\"inline\",\n\t\t\tnew ParserInline()\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Instance of {@link ParserBlock}. You may need it to add new rules when\n\t\t\t* writing plugins. For simple rules control use {@link MarkdownIt.disable}\n\t\t\t* and {@link MarkdownIt.enable}.\n\t\t\t*/\n\t\t\t\"block\",\n\t\t\tnew ParserBlock()\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Instance of {@link ParserCore} chain executor. You may need it to add new\n\t\t\t* rules when writing plugins. For simple rules control use\n\t\t\t* {@link MarkdownIt.disable} and {@link MarkdownIt.enable}.\n\t\t\t*/\n\t\t\t\"core\",\n\t\t\tnew ParserCore()\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Instance of {@link Renderer}. Use it to modify output look. Or to add rendering\n\t\t\t* rules for new token types, generated by plugins.\n\t\t\t*\n\t\t\t* See {@link Renderer} docs and\n\t\t\t* [source code](https://github.com/markdown-it/markdown-it/blob/master/src/renderer.ts).\n\t\t\t*\n\t\t\t* @example\n\t\t\t* ```javascript\n\t\t\t* import MarkdownIt from 'markdown-it'\n\t\t\t* const md = new MarkdownIt()\n\t\t\t*\n\t\t\t* function myToken(tokens, idx, options, env, self) {\n\t\t\t*   //...\n\t\t\t*   return result;\n\t\t\t* };\n\t\t\t*\n\t\t\t* md.renderer.rules['my_token'] = myToken\n\t\t\t* ```\n\t\t\t*/\n\t\t\t\"renderer\",\n\t\t\tnew Renderer()\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* [linkify-it](https://github.com/markdown-it/linkify-it) instance.\n\t\t\t* Used by [linkify](https://github.com/markdown-it/markdown-it/blob/master/src/rules_core/linkify.ts)\n\t\t\t* rule.\n\t\t\t*/\n\t\t\t\"linkify\",\n\t\t\tnew LinkifyIt()\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Assorted utility functions, useful to write plugins. See details\n\t\t\t* [here](https://github.com/markdown-it/markdown-it/blob/master/src/common/utils.ts).\n\t\t\t*/\n\t\t\t\"utils\",\n\t\t\tutils_exports\n\t\t);\n\t\t_defineProperty(\n\t\t\tthis,\n\t\t\t/**\n\t\t\t* Link components parser functions, useful to write plugins. See details\n\t\t\t* [here](https://github.com/markdown-it/markdown-it/blob/master/src/helpers).\n\t\t\t*/\n\t\t\t\"helpers\",\n\t\t\tObject.assign({}, helpers_exports)\n\t\t);\n\t\tconst [presetNameOrOptions, options] = args;\n\t\tif (typeof presetNameOrOptions === \"string\") {\n\t\t\tthis.configure(presetNameOrOptions);\n\t\t\tif (options) this.set(options);\n\t\t} else {\n\t\t\tthis.configure(\"default\");\n\t\t\tthis.set(presetNameOrOptions || {});\n\t\t}\n\t}\n\t/**\n\t* Set parser options (in the same format as in constructor). Probably, you\n\t* will never need it, but you can change options after constructor call.\n\t*\n\t* __Note:__ To achieve the best possible performance, don't modify a\n\t* `markdown-it` instance options on the fly. If you need multiple configurations\n\t* it's best to create multiple instances and initialize each with separate\n\t* config.\n\t*\n\t* @example\n\t* ```javascript\n\t* import MarkdownIt from 'markdown-it'\n\t*\n\t* const md = new MarkdownIt()\n\t*   .set({ html: true, breaks: true })\n\t*   .set({ typographer: true })\n\t* ```\n\t*/\n\tset(options) {\n\t\tObject.assign(this.options, options);\n\t\treturn this;\n\t}\n\t/**\n\t* Batch load of all options and compenent settings. This is internal method,\n\t* and you probably will not need it. But if you will - see available presets\n\t* and data structure [here](https://github.com/markdown-it/markdown-it/tree/master/src/presets)\n\t*\n\t* We strongly recommend to use presets instead of direct config loads. That\n\t* will give better compatibility with next versions.\n\t*/\n\tconfigure(presets) {\n\t\tlet p;\n\t\tif (typeof presets === \"string\") {\n\t\t\tconst presetName = presets;\n\t\t\tp = config[presetName];\n\t\t\tif (!p) throw new Error(`Wrong 'markdown-it' preset \"${presetName}\", check name`);\n\t\t} else p = presets;\n\t\tif (!p) throw new Error(\"Wrong `markdown-it` preset, can't be empty\");\n\t\tif (p.options) this.options = { ...p.options };\n\t\tconst components = p.components;\n\t\tif (components) {\n\t\t\tvar _components$inline;\n\t\t\t[\n\t\t\t\t\"core\",\n\t\t\t\t\"block\",\n\t\t\t\t\"inline\"\n\t\t\t].forEach((name) => {\n\t\t\t\tvar _components$name;\n\t\t\t\tconst rules = (_components$name = components[name]) === null || _components$name === void 0 ? void 0 : _components$name.rules;\n\t\t\t\tif (rules) this[name].ruler.enableOnly(rules);\n\t\t\t});\n\t\t\tconst rules2 = (_components$inline = components.inline) === null || _components$inline === void 0 ? void 0 : _components$inline.rules2;\n\t\t\tif (rules2) this.inline.ruler2.enableOnly(rules2);\n\t\t}\n\t\treturn this;\n\t}\n\t/**\n\t* Enable list or rules. It will automatically find appropriate components,\n\t* containing rules with given names. If rule not found, and `ignoreInvalid`\n\t* not set - throws exception.\n\t*\n\t* @example\n\t* ```javascript\n\t* import MarkdownIt from 'markdown-it'\n\t*\n\t* const md = new MarkdownIt()\n\t*   .enable(['sub', 'sup'])\n\t*   .disable('smartquotes')\n\t* ```\n\t*/\n\tenable(list, ignoreInvalid = false) {\n\t\tlet result = [];\n\t\tif (!Array.isArray(list)) list = [list];\n\t\t[\n\t\t\t\"core\",\n\t\t\t\"block\",\n\t\t\t\"inline\"\n\t\t].forEach((chain) => {\n\t\t\tresult = result.concat(this[chain].ruler.enable(list, true));\n\t\t});\n\t\tresult = result.concat(this.inline.ruler2.enable(list, true));\n\t\tconst missed = list.filter((name) => result.indexOf(name) < 0);\n\t\tif (missed.length && !ignoreInvalid) throw new Error(`MarkdownIt. Failed to enable unknown rule(s): ${missed}`);\n\t\treturn this;\n\t}\n\t/**\n\t* The same as {@link MarkdownIt.enable}, but turn specified rules off.\n\t*/\n\tdisable(list, ignoreInvalid = false) {\n\t\tlet result = [];\n\t\tif (!Array.isArray(list)) list = [list];\n\t\t[\n\t\t\t\"core\",\n\t\t\t\"block\",\n\t\t\t\"inline\"\n\t\t].forEach((chain) => {\n\t\t\tresult = result.concat(this[chain].ruler.disable(list, true));\n\t\t});\n\t\tresult = result.concat(this.inline.ruler2.disable(list, true));\n\t\tconst missed = list.filter((name) => result.indexOf(name) < 0);\n\t\tif (missed.length && !ignoreInvalid) throw new Error(`MarkdownIt. Failed to disable unknown rule(s): ${missed}`);\n\t\treturn this;\n\t}\n\t/**\n\t* Load specified plugin with given params into current parser instance.\n\t* It's just a sugar to call `plugin(md, params)` with curring.\n\t*\n\t* @example\n\t* ```javascript\n\t* import MarkdownIt from 'markdown-it'\n\t* import iterator from 'markdown-it-for-inline'\n\t*\n\t* const md = new MarkdownIt()\n\t*   .use(iterator, 'foo_replace', 'text', function (tokens, idx) {\n\t*     tokens[idx].content = tokens[idx].content.replace(/foo/g, 'bar')\n\t*   })\n\t* ```\n\t*/\n\tuse(plugin, ...params) {\n\t\tplugin.apply(plugin, [this, ...params]);\n\t\treturn this;\n\t}\n\t/**\n\t* Parse input string and return list of block tokens (special token type\n\t* \"inline\" will contain list of inline tokens). You should not call this\n\t* method directly, until you write custom renderer (for example, to produce\n\t* AST).\n\t*\n\t* `env` is used to pass data between \"distributed\" rules and return additional\n\t* metadata like reference info, needed for the renderer. It also can be used to\n\t* inject data in specific cases. Usually, you will be ok to pass `{}`,\n\t* and then pass updated object to renderer.\n\t*/\n\tparse(src, env) {\n\t\tif (typeof src !== \"string\") throw new Error(\"Input data should be a String\");\n\t\tconst state = new this.core.State(src, this, env);\n\t\tthis.core.process(state);\n\t\treturn state.tokens;\n\t}\n\t/**\n\t* Render markdown string into html. It does all magic for you :).\n\t*\n\t* `env` can be used to inject additional metadata (`{}` by default).\n\t* But you will not need it with high probability. See also comment\n\t* in {@link MarkdownIt.parse}.\n\t*/\n\trender(src, env = {}) {\n\t\treturn this.renderer.render(this.parse(src, env), this.options, env);\n\t}\n\t/**\n\t* The same as {@link MarkdownIt.parse} but skip all block rules. It returns\n\t* the block tokens list with the single `inline` element, containing parsed\n\t* inline tokens in `children` property. Also updates `env` object.\n\t*/\n\tparseInline(src, env) {\n\t\tconst state = new this.core.State(src, this, env);\n\t\tstate.inlineMode = true;\n\t\tthis.core.process(state);\n\t\treturn state.tokens;\n\t}\n\t/**\n\t* Similar to {@link MarkdownIt.render} but for single paragraph content.\n\t* Result will NOT be wrapped into `<p>` tags.\n\t*/\n\trenderInline(src, env = {}) {\n\t\treturn this.renderer.render(this.parseInline(src, env), this.options, env);\n\t}\n};\n_defineProperty(MarkdownIt, \"Token\", Token);\n_defineProperty(MarkdownIt, \"Ruler\", Ruler);\n_defineProperty(MarkdownIt, \"Renderer\", Renderer);\n_defineProperty(MarkdownIt, \"ParserCore\", ParserCore);\n_defineProperty(MarkdownIt, \"StateCore\", StateCore);\n_defineProperty(MarkdownIt, \"ParserBlock\", ParserBlock);\n_defineProperty(MarkdownIt, \"StateBlock\", StateBlock);\n_defineProperty(MarkdownIt, \"ParserInline\", ParserInline);\n_defineProperty(MarkdownIt, \"StateInline\", StateInline);\n//#endregion\n//#region src/index.ts\n/**\n* Default package export.\n*\n* For backward compatibility, the {@link MarkdownIt} class is wrapped so\n* legacy code can call it without `new`. New code should instantiate it as a\n* regular class with `new`. The compatibility wrapper may be removed in a\n* future release.\n*\n* @category Main\n*/\nvar MarkdownItCallable = callable(MarkdownIt);\n//#endregion\nexport { MarkdownItCallable as default };\n\n//# sourceMappingURL=markdown-it.mjs.map",null,null],"names":["IFRAME_SANITIZE_CONFIG","USE_PROFILES","html","sanitizeIframeHtml","sanitize","config","DOMPurify","proseStyles","CSS_VAR_PATTERN","resolveCssValue","value","rootStyles","visitedVars","replace","_","variableName","fallback","has","trim","nextVisited","Set","add","variableValue","getPropertyValue","decodeCache","decode","string","exclude","defaultChars","cache","i","ch","String","fromCharCode","push","length","charCodeAt","toString","toUpperCase","slice","getDecodeCache","seq","result","l","b1","parseInt","b2","chr","b3","b4","componentChars","encodeCache","encode","keepEscaped","test","getEncodeCache","code","nextCode","encodeURIComponent","format","url","protocol","slashes","auth","hostname","indexOf","port","pathname","search","hash","Url","this","protocolPattern","portPattern","simplePathPattern","unwise","concat","autoEscape","nonHostChars","hostEndingChars","hostnamePartPattern","hostnamePartStart","hostlessProtocol","javascript","slashedProtocol","http","https","ftp","gopher","file","urlParse","slashesDenoteHost","u","parse","prototype","lowerProto","hec","rest","split","simplePath","exec","proto","toLowerCase","substr","match","atSign","hostEnd","lastIndexOf","host","parseHost","ipv6Hostname","hostparts","part","newpart","j","k","validParts","notHost","bit","unshift","join","qm","Any","Cc","P","S","Z","c1","codePointToString","codePoint","fromCodePoint","isInvalidCodePoint","replaceCodePoint","BASE91_INVERSE","table","Uint8Array","char","decodeTrieDict","input","resultLength","atomCount","dict1AtomCount","ngramCount","dictSize","inputLength","twoCharBias","pos","readSlotCode","dict2AtomCount","slotCount","single","Int32Array","fill","start","decodeDelta","count","off","previous","slot","end","runLength","next","references","poolSize","ngramIndex","readNgramReferences","startSlot","index","a","b","entryLength","pool","Uint16Array","write","half","source","read","readEnd","out","outIndex","htmlDecodeTree","BinTrieFlags","CharCodes","CONSUMED_OVERFLOW","longNumericConsumed","unpackConsumed","packed","consumed","isNumber","ZERO","isHexadecimalCharacter","LOWER_A","isAlpha","EntityDecoderState","DecodingMode","determineBranch","decodeTree","current","nodeIndex","branchCount","BRANCH_LENGTH","jumpOffset","JUMP_TABLE","stored","packedKeySlots","branchEnd","key","readTrieValue","valueLength","VALUE_MASK","parseNumericEntity","numberStart","offset","cp","digitStart","LOWER_X","digit","SEMI","decodeHTMLStrict","htmlString","isStrict","isAttribute","chunkStart","root","rootJumpOffset","rootBranchCount","entityStart","firstChar","NUM","rootSlotIndex","bestNodeIndex","bestValueLength","trie","VALUE_LENGTH","FLAG13","remaining","wordIndex","charIndexInPacked","AMP","decodeWithTrie","REBuilder","src_Any","src_Cc","src_Z","src_P","src_ZPCc","src_ZCc","opts","maxLength","urlAuth","schema_names","constructor","set","escapeRE","str","nestedPairRE","open","close","depth","openRE","closeRE","atom","pair","level","get_text_separators","text_separators","get_pseudo_letter","src_pseudo_letter","RegExp","get_ipv4_addr","src_ip4","get_ipv6_addr","h16","ls32","src_ip6_addr","get_ipv6_url_host","src_ip6_host","get_ipv6_mail_host","src_ipv6_mail_host","get_auth","src_auth","get_port","src_port","get_host_terminator","src_host_terminator","get_path_terminator","src_path_terminator","get_path","src_path","get_path_extra","get_mail_name","src_mail_name","get_xn","src_xn","get_tld","tld","tlds_src","tlds","sort","reverse","get_domain_root","src_domain_root","get_domain","src_domain","get_url_host_port","url_host_port","get_fuzzy_url_host_port","fuzzy_url_host_port","fuzzyIP","get_mail_host","src_mail_host","get_fuzzy_mail_host","src_fuzzy_mail_host","src_path_extra","get_fuzzy_mail_host_search","mail_fuzzy_host_search","get_fuzzy_link_search","link_fuzzy_search","get_http_validator","http_validator","get_relative_proto_validator","relative_proto_validator","get_mail_name_validator","mail_name_validator","get_mailto_validator","mailto_validator","get_schema_names","map","name","get_schema_search","schema_search","get_schema_at_start","schema_at_start","web_schema","validate","text","self","re","lastIndex","m","normalize","defaultSchemas","defaultOptions","fuzzyLink","fuzzyEmail","forEach","item","sep","prefix","suffix","unpackTlds","Match","schema","raw","LinkifyIt","__opts__","__schemas__","options","rebuilder","linkifyOptions","Object","keys","definition","def","testSchemaAt","mailHostRe","mailNameRe","Math","max","schemaRe","fuzzyLinkRe","fuzzyLinkCandidate","fuzzyEmailCandidate","schemaPrefix","schemaDone","fuzzyLinkDone","fuzzyEmailDone","scanFrom","schemaCandidate","fuzzyCandidate","len","candidate","matchAtStart","list","keepOld","Array","isArray","maxInt","base","regexPunycode","regexNonASCII","regexSeparators","errors","overflow","floor","stringFromCharCode","error","type","RangeError","mapDomain","domain","callback","parts","encoded","array","ucs2decode","output","counter","extra","digitToBasic","flag","adapt","delta","numPoints","firstTime","baseMinusTMin","n","bias","basic","oldi","w","t","baseMinusT","splice","currentValue","basicLength","handledCPCount","handledCPCountPlusOne","q","qMinusT","punycode","__defProp","defineProperty","__exportAll","all","no_symbols","target","get","enumerable","Symbol","toStringTag","utils_exports","arrayReplaceAt","asciiTrim","callable","escapeHtml","isMdAsciiPunct","isPunctChar","isPunctCharCode","isSpace","isValidEntityCode","isWhiteSpace","lib","normalizeReference","unescapeAll","unescapeMd","cls","wrapper","args","Reflect","construct","setPrototypeOf","src","newElements","c","surrogate1","surrogate2","UNESCAPE_MD_RE","UNESCAPE_ALL_RE","DIGITAL_ENTITY_TEST_RE","escaped","entity","decoded","replaceEntityPattern","HTML_ESCAPE_TEST_RE","HTML_ESCAPE_REPLACE_RE","HTML_REPLACEMENTS","replaceUnsafeChar","REGEXP_ESCAPE_RE","ucmicro.P","ucmicro.S","isAsciiTrimmable","mdurl","ucmicro","parseLinkLabel","state","disableNested","found","marker","prevPos","posMax","oldPos","md","inline","skipToken","labelEnd","parseLinkDestination","ok","parseLinkTitle","prev_state","can_continue","helpers_exports","_typeof","o","iterator","toPropertyKey","r","e","toPrimitive","call","TypeError","Number","_defineProperty","configurable","writable","Token","tag","nesting","attrs","meta","attrIndex","attrPush","attrData","attrSet","idx","attrGet","attrJoin","Ruler","__find__","__rules__","__compile__","chains","rule","enabled","alt","altName","__cache__","create","fn","chain","at","Error","before","beforeName","ruleName","after","afterName","enable","ignoreInvalid","enableOnly","disable","getRules","chainName","default_rules","tokens","env","slf","token","renderAttrs","content","info","highlighted","langName","langAttrs","arr","highlight","tmpAttrs","langPrefix","tmpToken","renderInlineAsText","children","renderToken","xhtmlOut","breaks","Renderer","assign","hidden","prev","block","needLf","nextToken","renderInline","rules","render","StateCore","UNNORMALIZED_NEWLINE_RE","NULL_RE","isLinkClose$1","RARE_RE","SCOPED_ABBR_TEST_RE","SCOPED_ABBR_RE","SCOPED_ABBR","tm","replaceFn","replace_scoped","inlineTokens","inside_autolink","replace_rare","QUOTE_TEST_RE","QUOTE_RE","truncateStack","stack","heads","pop","isSingleQuote","prevSameQuoteIdx","double","addReplacement","replacements","tokenIdx","process_inlines","thisLevel","canOpen","canClose","isSingle","lastChar","nextChar","isLastPunctChar","isNextPunctChar","isLastWhiteSpace","isNextWhiteSpace","openQuote","closeQuote","quotes","contentPos","lastPos","replacement","applyReplacements","join_alt","curr","last","_rules$2","inlineMode","tok","blockTokens","linkify","htmlLinkLevel","currentToken","links","nodes","ln","fullUrl","normalizeLink","validateLink","urlText","normalizeLinkText","token_o","markup","token_t","token_c","newTokensLength","newTokens","replacementIndex","newTokenIndex","node","blkIdx","typographer","ParserCore","ruler","process","StateBlock","s","indent","indent_found","bMarks","eMarks","tShift","sCount","bsCount","lineMax","isEmpty","line","skipEmptyLines","from","skipSpaces","skipSpacesBack","min","skipChars","skipCharsBack","getLines","begin","keepLastLF","queue","lineIndent","lineStart","first","getLine","escapedSplit","isEscaped","substring","skipBulletListMarker","startLine","skipOrderedListMarker","lineEnd","getNextLinePos","nextLine","endLine","isContinuation","blkIndent","terminatorRules","oldParentType","parentType","terminate","HTML_OPEN_CLOSE_TAG_RE","HTML_SEQUENCES","_rules$1","silent","firstCh","secondCh","lineText","columns","aligns","shift","columnCount","tableLines","token_ho","token_il","tbodyLines","autocompletedCells","token_tdo","mem","params","haveEndMarker","oldLineMax","oldBMarks","oldBSCount","oldSCount","oldTShift","lastLineEmpty","isOutdented","spaceAfterMarker","adjustTab","initial","oldIndent","lines","tokenize","cnt","tight","listIndent","isOrdered","markerValue","posAfterMarker","isTerminatingParagraph","markerCharCode","listTokIdx","listLines","prevEmptyEnd","contentStart","indentAfterMarker","itemLines","oldTight","oldListIndent","markTightParagraphs","_endLine","rawLabel","segmentStart","MAX_LABEL_LENGTH","nextPos","high","low","countCodePoints","destRes","helpers","href","destEndPos","destEndMax","destEndLineNo","titleStart","title","titleRes","label","endsOnBlankLine","tmp","token_i","ParserBlock","maxNesting","hasEmptyLines","prevLine","outTokens","State","StateInline","tokens_meta","pushPending","pending","pendingLevel","token_meta","delimiters","_prev_delimiters","scanDelims","canSplitWord","highSurr","lowSurr","left_flanking","right_flanking","can_open","can_close","isTerminatorChar","isSchemeChar","ESCAPED","postProcess$1","loneMarkers","startDelim","endDelim","strikethrough_default","scanned","postProcess","_tokens_meta$curr","isStrong","emphasis_default","EMAIL_RE","AUTOLINK_RE","isLetter","lc","DIGITAL_RE","NAMED_RE","processDelimiters","openersBottom","headerIdx","lastTokenIdx","jumps","closerIdx","closer","hasOwnProperty","minOpenerIdx","openerIdx","newMinOpenerIdx","opener","isOddMatch","lastJump","_rules","linkLevel","protoMin","protoStart","isAsciiAlpha","protoLength","link","urlEnd","pmax","ws","ch1","escapedStr","ch2","origStr","_state$backticks$open","openerLength","backticksScanned","backticks","lastRuns","buildLastRuns","matchStart","matchEnd","startsWith","endsWith","res","ref","parseReference","labelStart","terminator","skipHtmlSpecial","scanSpecial","isLinkClose","_rules2","ParserInline","ruler2","default","components","core","zero","rules2","commonmark","BAD_PROTO_RE","GOOD_DATA_RE","RECODE_HOSTNAME_FOR","MarkdownIt","parsed","mdurl.parse","er","mdurl.encode","mdurl.format","mdurl.decode","presetNameOrOptions","configure","presets","p","_components$inline","_components$name","missed","filter","use","plugin","apply","renderer","parseInline","MarkdownItCallable","MarkdownPreview","attachment","height","setHeight","useState","currentTheme","themeStore","rawText","sanitized","useMemo","srcDoc","iframeThemeVars","cssText","globalThis","document","getComputedStyle","documentElement","rawValue","Boolean","resolveCssVarDeclarations","_jsx","className","styles","width","undefined","frameBorder","sandbox","onLoad","iframe","currentTarget","contentDocument","body","bodyRectHeight","getBoundingClientRect","scrollHeight","offsetHeight","ceil","getIframeContentHeight"],"mappings":"ifACO,MACDA,EAAyB,CAC3BC,aAAc,CAAEC,MAAM,IAEbC,EAAsBD,GAJXE,EAACF,EAAMG,IAAWC,EAAUF,SAASF,EAAMG,GAIvBD,CAASF,EAAMF,GCL9CO,EAAc,40LAyWrBC,EAAkB,2CAClBC,EAAkBA,CAACC,EAAOC,EAAYC,IACjCF,EAAMG,QAAQL,GAAiB,CAACM,EAAGC,EAAcC,KACpD,GAAIJ,EAAYK,IAAIF,GAChB,OAAOC,EAAWP,EAAgBO,EAASE,OAAQP,EAAYC,GAAe,GAElF,MAAMO,EAAc,IAAIC,IAAIR,GAC5BO,EAAYE,IAAIN,GAChB,MAAMO,EAAgBX,EAAWY,iBAAiBR,GAAcG,OAChE,OAAII,EACOb,EAAgBa,EAAeX,EAAYQ,GAE/CH,EAAWP,EAAgBO,EAASE,OAAQP,EAAYQ,GAAe,EAAE,ICnXlFK,EAAc,CAAA,EAuBpB,SAASC,EAAQC,EAAQC,GACA,iBAAZA,IACTA,EAAUF,EAAOG,cAGnB,MAAMC,EA1BR,SAAyBF,GACvB,IAAIE,EAAQL,EAAYG,GACxB,GAAIE,EAAS,OAAOA,EAEpBA,EAAQL,EAAYG,GAAW,GAE/B,IAAK,IAAIG,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B,MAAMC,EAAKC,OAAOC,aAAaH,GAC/BD,EAAMK,KAAKH,EACb,CAEA,IAAK,IAAID,EAAI,EAAGA,EAAIH,EAAQQ,OAAQL,IAAK,CACvC,MAAMC,EAAKJ,EAAQS,WAAWN,GAC9BD,EAAME,GAAM,KAAO,IAAMA,EAAGM,SAAS,IAAIC,eAAeC,OAAM,EAChE,CAEA,OAAOV,CACT,CASgBW,CAAeb,GAE7B,OAAOD,EAAOb,QAAQ,qBAAqB,SAAU4B,GACnD,IAAIC,EAAS,GAEb,IAAK,IAAIZ,EAAI,EAAGa,EAAIF,EAAIN,OAAQL,EAAIa,EAAGb,GAAK,EAAG,CAC7C,MAAMc,EAAKC,SAASJ,EAAIF,MAAMT,EAAI,EAAGA,EAAI,GAAI,IAE7C,GAAIc,EAAK,IACPF,GAAUb,EAAMe,OADlB,CAKA,GAAoB,MAAV,IAALA,IAAwBd,EAAI,EAAIa,EAAI,CAEvC,MAAMG,EAAKD,SAASJ,EAAIF,MAAMT,EAAI,EAAGA,EAAI,GAAI,IAE7C,GAAoB,MAAV,IAALgB,GAAqB,CACxB,MAAMC,EAAQH,GAAM,EAAK,KAAe,GAALE,EAGjCJ,GADEK,EAAM,IACE,KAEAf,OAAOC,aAAac,GAGhCjB,GAAK,EACL,QACF,CACF,CAEA,GAAoB,MAAV,IAALc,IAAwBd,EAAI,EAAIa,EAAI,CAEvC,MAAMG,EAAKD,SAASJ,EAAIF,MAAMT,EAAI,EAAGA,EAAI,GAAI,IACvCkB,EAAKH,SAASJ,EAAIF,MAAMT,EAAI,EAAGA,EAAI,GAAI,IAE7C,GAAoB,MAAV,IAALgB,IAAuC,MAAV,IAALE,GAAqB,CAChD,MAAMD,EAAQH,GAAM,GAAM,MAAYE,GAAM,EAAK,KAAe,GAALE,EAGzDN,GADEK,EAAM,MAAUA,GAAO,OAAUA,GAAO,MAChC,MAEAf,OAAOC,aAAac,GAGhCjB,GAAK,EACL,QACF,CACF,CAEA,GAAoB,MAAV,IAALc,IAAwBd,EAAI,EAAIa,EAAI,CAEvC,MAAMG,EAAKD,SAASJ,EAAIF,MAAMT,EAAI,EAAGA,EAAI,GAAI,IACvCkB,EAAKH,SAASJ,EAAIF,MAAMT,EAAI,EAAGA,EAAI,GAAI,IACvCmB,EAAKJ,SAASJ,EAAIF,MAAMT,EAAI,GAAIA,EAAI,IAAK,IAE/C,GAAoB,MAAV,IAALgB,IAAuC,MAAV,IAALE,IAAuC,MAAV,IAALC,GAAqB,CACxE,IAAIF,EAAQH,GAAM,GAAM,QAAcE,GAAM,GAAM,OAAaE,GAAM,EAAK,KAAe,GAALC,EAEhFF,EAAM,OAAWA,EAAM,QACzBL,GAAU,QAEVK,GAAO,MACPL,GAAUV,OAAOC,aAAa,OAAUc,GAAO,IAAK,OAAgB,KAANA,KAGhEjB,GAAK,EACL,QACF,CACF,CAEAY,GAAU,GA5DV,CA6DF,CAEA,OAAOA,CACT,GACF,CAEAjB,EAAOG,aAAe,cACtBH,EAAOyB,eAAiB,GC7GxB,MAAMC,EAAc,CAAA,EAoCpB,SAASC,EAAQ1B,EAAQC,EAAS0B,GACT,iBAAZ1B,IAET0B,EAAc1B,EACdA,EAAUyB,EAAOxB,mBAGQ,IAAhByB,IACTA,GAAc,GAGhB,MAAMxB,EA1CR,SAAyBF,GACvB,IAAIE,EAAQsB,EAAYxB,GACxB,GAAIE,EAAS,OAAOA,EAEpBA,EAAQsB,EAAYxB,GAAW,GAE/B,IAAK,IAAIG,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B,MAAMC,EAAKC,OAAOC,aAAaH,GAE3B,cAAcwB,KAAKvB,GAErBF,EAAMK,KAAKH,GAEXF,EAAMK,KAAK,KAAO,IAAMJ,EAAEO,SAAS,IAAIC,eAAeC,OAAM,GAEhE,CAEA,IAAK,IAAIT,EAAI,EAAGA,EAAIH,EAAQQ,OAAQL,IAClCD,EAAMF,EAAQS,WAAWN,IAAMH,EAAQG,GAGzC,OAAOD,CACT,CAoBgB0B,CAAe5B,GAC7B,IAAIe,EAAS,GAEb,IAAK,IAAIZ,EAAI,EAAGa,EAAIjB,EAAOS,OAAQL,EAAIa,EAAGb,IAAK,CAC7C,MAAM0B,EAAO9B,EAAOU,WAAWN,GAE/B,GAAIuB,GAAwB,KAATG,GAAyB1B,EAAI,EAAIa,GAC9C,iBAAiBW,KAAK5B,EAAOa,MAAMT,EAAI,EAAGA,EAAI,IAChDY,GAAUhB,EAAOa,MAAMT,EAAGA,EAAI,GAC9BA,GAAK,OAKT,GAAI0B,EAAO,IACTd,GAAUb,EAAM2B,QAIlB,GAAIA,GAAQ,OAAUA,GAAQ,MAA9B,CACE,GAAIA,GAAQ,OAAUA,GAAQ,OAAU1B,EAAI,EAAIa,EAAG,CACjD,MAAMc,EAAW/B,EAAOU,WAAWN,EAAI,GACvC,GAAI2B,GAAY,OAAUA,GAAY,MAAQ,CAC5Cf,GAAUgB,mBAAmBhC,EAAOI,GAAKJ,EAAOI,EAAI,IACpDA,IACA,QACF,CACF,CACAY,GAAU,WAEZ,MAEAA,GAAUgB,mBAAmBhC,EAAOI,GACtC,CAEA,OAAOY,CACT,CCnFe,SAASiB,EAAQC,GAC9B,IAAIlB,EAAS,GAkBb,OAhBAA,GAAUkB,EAAIC,UAAY,GAC1BnB,GAAUkB,EAAIE,QAAU,KAAO,GAC/BpB,GAAUkB,EAAIG,KAAOH,EAAIG,KAAO,IAAM,GAElCH,EAAII,eAAYJ,EAAII,SAASC,QAAQ,KAEvCvB,GAAU,IAAMkB,EAAII,SAAW,IAE/BtB,GAAUkB,EAAII,UAAY,GAG5BtB,GAAUkB,EAAIM,KAAO,IAAMN,EAAIM,KAAO,GACtCxB,GAAUkB,EAAIO,UAAY,GAC1BzB,GAAUkB,EAAIQ,QAAU,GACxB1B,GAAUkB,EAAIS,MAAQ,GAEf3B,CACT,CCsBA,SAAS4B,IACPC,KAAKV,SAAW,KAChBU,KAAKT,QAAU,KACfS,KAAKR,KAAO,KACZQ,KAAKL,KAAO,KACZK,KAAKP,SAAW,KAChBO,KAAKF,KAAO,KACZE,KAAKH,OAAS,KACdG,KAAKJ,SAAW,IAClB,CFkCAf,EAAOxB,aAAe,uBACtBwB,EAAOF,eAAiB,YE7BxB,MAAMsB,EAAkB,oBAClBC,EAAc,WAIdC,EAAoB,qCAOpBC,EAAS,CAAC,IAAK,IAAK,IAAK,KAAM,IAAK,KAAKC,OAHhC,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,OAM/CC,EAAa,CAAC,KAAMD,OAAOD,GAK3BG,EAAe,CAAC,IAAK,IAAK,IAAK,IAAK,KAAKF,OAAOC,GAChDE,EAAkB,CAAC,IAAK,IAAK,KAE7BC,EAAsB,yBACtBC,EAAoB,+BAGpBC,EAAmB,CACvBC,YAAY,EACZ,eAAe,GAGXC,EAAkB,CACtBC,MAAM,EACNC,OAAO,EACPC,KAAK,EACLC,QAAQ,EACRC,MAAM,EACN,SAAS,EACT,UAAU,EACV,QAAQ,EACR,WAAW,EACX,SAAS,GAGX,SAASC,EAAU9B,EAAK+B,GACtB,GAAI/B,GAAOA,aAAeU,EAAK,OAAOV,EAEtC,MAAMgC,EAAI,IAAItB,EAEd,OADAsB,EAAEC,MAAMjC,EAAK+B,GACNC,CACT,CAEAtB,EAAIwB,UAAUD,MAAQ,SAAUjC,EAAK+B,GACnC,IAAII,EAAYC,EAAKlC,EACjBmC,EAAOrC,EAMX,GAFAqC,EAAOA,EAAK/E,QAEPyE,GAA+C,IAA1B/B,EAAIsC,MAAM,KAAK/D,OAAc,CAErD,MAAMgE,EAAazB,EAAkB0B,KAAKH,GAC1C,GAAIE,EAKF,OAJA5B,KAAKJ,SAAWgC,EAAW,GACvBA,EAAW,KACb5B,KAAKH,OAAS+B,EAAW,IAEpB5B,IAEX,CAEA,IAAI8B,EAAQ7B,EAAgB4B,KAAKH,GAqBjC,GApBII,IACFA,EAAQA,EAAM,GACdN,EAAaM,EAAMC,cACnB/B,KAAKV,SAAWwC,EAChBJ,EAAOA,EAAKM,OAAOF,EAAMlE,UAQvBwD,GAAqBU,GAASJ,EAAKO,MAAM,2BAC3C1C,EAAgC,OAAtBmC,EAAKM,OAAO,EAAG,IACrBzC,GAAauC,GAASnB,EAAiBmB,KACzCJ,EAAOA,EAAKM,OAAO,GACnBhC,KAAKT,SAAU,KAIdoB,EAAiBmB,KACjBvC,GAAYuC,IAAUjB,EAAgBiB,IAAU,CAiBnD,IAUItC,EAAM0C,EAVNC,GAAU,EACd,IAAK,IAAI5E,EAAI,EAAGA,EAAIiD,EAAgB5C,OAAQL,IAC1CkE,EAAMC,EAAKhC,QAAQc,EAAgBjD,KACvB,IAARkE,KAA2B,IAAZU,GAAkBV,EAAMU,KACzCA,EAAUV,GASZS,GAFc,IAAZC,EAEOT,EAAKU,YAAY,KAIjBV,EAAKU,YAAY,IAAKD,IAKlB,IAAXD,IACF1C,EAAOkC,EAAK1D,MAAM,EAAGkE,GACrBR,EAAOA,EAAK1D,MAAMkE,EAAS,GAC3BlC,KAAKR,KAAOA,GAId2C,GAAU,EACV,IAAK,IAAI5E,EAAI,EAAGA,EAAIgD,EAAa3C,OAAQL,IACvCkE,EAAMC,EAAKhC,QAAQa,EAAahD,KACpB,IAARkE,KAA2B,IAAZU,GAAkBV,EAAMU,KACzCA,EAAUV,IAIE,IAAZU,IACFA,EAAUT,EAAK9D,QAGS,MAAtB8D,EAAKS,EAAU,IAAcA,IACjC,MAAME,EAAOX,EAAK1D,MAAM,EAAGmE,GAC3BT,EAAOA,EAAK1D,MAAMmE,GAGlBnC,KAAKsC,UAAUD,GAIfrC,KAAKP,SAAWO,KAAKP,UAAY,GAIjC,MAAM8C,EAAoC,MAArBvC,KAAKP,SAAS,IACa,MAA5CO,KAAKP,SAASO,KAAKP,SAAS7B,OAAS,GAGzC,IAAK2E,EAAc,CACjB,MAAMC,EAAYxC,KAAKP,SAASkC,MAAM,MACtC,IAAK,IAAIpE,EAAI,EAAGa,EAAIoE,EAAU5E,OAAQL,EAAIa,EAAGb,IAAK,CAChD,MAAMkF,EAAOD,EAAUjF,GACvB,GAAKkF,IACAA,EAAKR,MAAMxB,GAAsB,CACpC,IAAIiC,EAAU,GACd,IAAK,IAAIC,EAAI,EAAGC,EAAIH,EAAK7E,OAAQ+E,EAAIC,EAAGD,IAClCF,EAAK5E,WAAW8E,GAAK,IAIvBD,GAAW,IAEXA,GAAWD,EAAKE,GAIpB,IAAKD,EAAQT,MAAMxB,GAAsB,CACvC,MAAMoC,EAAaL,EAAUxE,MAAM,EAAGT,GAChCuF,EAAUN,EAAUxE,MAAMT,EAAI,GAC9BwF,EAAMN,EAAKR,MAAMvB,GACnBqC,IACFF,EAAWlF,KAAKoF,EAAI,IACpBD,EAAQE,QAAQD,EAAI,KAElBD,EAAQlF,SACV8D,EAAOoB,EAAQG,KAAK,KAAOvB,GAE7B1B,KAAKP,SAAWoD,EAAWI,KAAK,KAChC,KACF,CACF,CACF,CACF,CAEIjD,KAAKP,SAAS7B,OAxLC,MAyLjBoC,KAAKP,SAAW,IAKd8C,IACFvC,KAAKP,SAAWO,KAAKP,SAASuC,OAAO,EAAGhC,KAAKP,SAAS7B,OAAS,GAEnE,CAGA,MAAMkC,EAAO4B,EAAKhC,QAAQ,MACb,IAATI,IAEFE,KAAKF,KAAO4B,EAAKM,OAAOlC,GACxB4B,EAAOA,EAAK1D,MAAM,EAAG8B,IAEvB,MAAMoD,EAAKxB,EAAKhC,QAAQ,KAWxB,OAVW,IAAPwD,IACFlD,KAAKH,OAAS6B,EAAKM,OAAOkB,GAC1BxB,EAAOA,EAAK1D,MAAM,EAAGkF,IAEnBxB,IAAQ1B,KAAKJ,SAAW8B,GACxBb,EAAgBW,IAChBxB,KAAKP,WAAaO,KAAKJ,WACzBI,KAAKJ,SAAW,IAGXI,IACT,EAEAD,EAAIwB,UAAUe,UAAY,SAAUD,GAClC,IAAI1C,EAAOO,EAAY2B,KAAKQ,GACxB1C,IACFA,EAAOA,EAAK,GACC,MAATA,IACFK,KAAKL,KAAOA,EAAKqC,OAAO,IAE1BK,EAAOA,EAAKL,OAAO,EAAGK,EAAKzE,OAAS+B,EAAK/B,SAEvCyE,IAAQrC,KAAKP,SAAW4C,EAC9B,wFCjTA,MAAMc,EAAM,mIACNC,EAAK,qBAELC,EAAI,6jEACJC,EAAI,8lFACJC,EAAI,0HAHC,wQCIX,MAAMC,EAAe,CACjB,KAAM,EAAG,KAAM,IAAK,KAAM,KAAM,KAAM,KAAM,IAAK,KAAM,IAAK,KAAM,IAAK,EACvE,IAAK,EAAG,EAAG,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,IAAK,KAAM,IAAK,KACrE,IAAK,EAAG,IAAK,KAuDX,SAAUC,EAAkBC,GAC9B,OAAQA,EAAY,IAAO,EAAI,KAASA,EAAY,MAAU,EAAI,MAC5DjG,OAAOC,aAAagG,GACpBjG,OAAOkG,cApCX,SAA2BD,GAC7B,OAhBJ,SAA4BA,GACxB,OACkB,IAAdA,GACCA,GAAa,OAAWA,GAAa,OACtCA,EAAY,OAEpB,CAUQE,CAAmBF,GACZ,MAGPA,GAAa,KAAOA,GAAa,KAC1BF,EAAGE,EAAY,MAGnBA,CACX,CA0B+BG,CAAiBH,GAChD,CC/DA,MAAMI,iBAAiC,MACnC,MAAMC,EAAQ,IAAIC,WAAW,KAC7B,IAAI/E,EAAO,EACX,IAAK,IAAIgF,EAAO,GAAMA,GAAQ,IAAMA,IACnB,KAATA,GAA0B,KAATA,GAA0B,KAATA,IAClCF,EAAME,GAAQhF,KAGtB,OAAO8E,CACV,EATsC,GA+CjC,SAAUG,EACZC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MACMC,EAAcN,EAAMvG,OAEpB8G,KAAcF,EAEpB,IAAIG,EAAM,EAGV,MAAMC,EAAeA,KACjB,MAAMpB,EAAKM,EAAeK,EAAMtG,WAAW8G,MAC3C,OAAOnB,EAAKgB,EACNhB,EAXG,GAYHA,EAAYkB,EAAcZ,EAAeK,EAAMtG,WAAW8G,KAAO,EAGrEE,EAAiBR,EAAYC,EAC7BQ,EAAYT,EAAYE,EAOxBQ,EAAS,IAAIC,WAAWF,GAC9BC,EAAOE,QAASX,EAAgBE,GAChCO,EAAOE,MAAK,EAAIT,EAAWK,EAAgBC,GAC3C,MAAMI,EAAQ,IAAIF,WAAWF,GACvBlH,EAAS,IAAIoH,WAAWF,GAa9B,SAASK,EAAYC,EAAeC,GAChC,IAAIC,EAAW,EACXC,EAAOF,EACX,MAAMG,EAAMH,EAAMD,EAClB,KAAOG,EAAOC,GAAK,CACf,MAAMvG,EAAO6E,EAAeK,EAAMtG,WAAW8G,MAC7C,GAAI1F,EAAO,GACPqG,GAAYrG,EACZ8F,EAAOQ,KAAUD,OACd,GAAa,KAATrG,EAAa,CACpB,IAAIwG,EAAY3B,EAAeK,EAAMtG,WAAW8G,MAAU,EAC1D,KAAOc,KAAaV,EAAOQ,OAAYD,CAC3C,KAAO,CACH,MAAMI,EAAO5B,EAAeK,EAAMtG,WAAW8G,MAC7CW,GACI,IAECI,EAAO,GAzDX,GA0DSA,EAAc5B,EAAeK,EAAMtG,WAAW8G,MACJ,KAA1Cb,EAAeK,EAAMtG,WAAW8G,MA3DzC,GA4DSb,EAAeK,EAAMtG,WAAW8G,MAChCb,EAAeK,EAAMtG,WAAW8G,OAC1CI,EAAOQ,KAAUD,CACrB,CACJ,CACJ,CAGAH,EAAYb,EAAgB,GAC5Ba,EAAYN,EAAgBL,GAS5B,MAAMmB,EAAa,IAAIX,WAAwB,EAAbT,GAClC,IAAIqB,EAAW,EACXC,EAAa,EAQjB,SAASC,EAAoBV,EAAeW,GACxC,IAAK,IAAIC,EAAQ,EAAGA,EAAQZ,EAAOY,IAAS,CACxC,MAAMT,EAAOQ,EAAYC,EACnBC,EAAIrB,IACJsB,EAAItB,IACVe,EAAwB,EAAbE,GAAkBI,EAC7BN,EAAwB,EAAbE,EAAiB,GAAKK,EACjCL,GAAc,EACdX,EAAMK,GAAQK,EACd,MAAMO,GACDpB,EAAOkB,GAAK,EAAIrI,EAAOqI,GAAK,IAC5BlB,EAAOmB,GAAK,EAAItI,EAAOsI,GAAK,GACjCtI,EAAO2H,GAAQY,EACfP,GAAYO,CAChB,CACJ,CACAL,EACIvB,EAAaC,EAAWF,EACxBE,EAAWK,GAEfiB,EAAoBtB,EAAWF,EAAgBA,GAG/C,MAAM8B,EAAO,IAAIC,YAAYT,GAC7B,IAAIU,EAAQ,EACZ,IAAK,IAAIN,EAAQ,EAAGA,EAAQH,EAAYG,IACpC,IAAK,IAAIO,EAAO,EAAGA,EAAO,EAAGA,IAAQ,CACjC,MAAMC,EAASb,EAAmB,EAARK,EAAYO,GAChCpK,EAAQ4I,EAAOyB,GACrB,GAAIrK,EAAQ,EAAG,CACX,IAAIsK,EAAOvB,EAAMsB,GACjB,MAAME,EAAUD,EAAO7I,EAAO4I,GAC9B,KAAOC,EAAOC,GAASN,EAAKE,KAAWF,EAAKK,IAChD,MACIL,EAAKE,KAAWnK,CAExB,CAIJ,MAAMwK,EAAM,IAAIN,YAAYjC,GAC5B,IAAIwC,EAAW,EACf,KAAOjC,EAAMF,GAAa,CACtB,IAAIc,EAAOzB,EAAeK,EAAMtG,WAAW8G,MACvCY,GAAQf,IACRe,EArIK,GAsIDA,EACAb,EACAZ,EAAeK,EAAMtG,WAAW8G,OAExC,MAAMxI,EAAQ4I,EAAOQ,GACrB,GAAIpJ,EAAQ,EAAG,CACX,IAAIsK,EAAOvB,EAAMK,GACjB,MAAMmB,EAAUD,EAAO7I,EAAO2H,GAC9B,KAAOkB,EAAOC,GAASC,EAAIC,KAAcR,EAAKK,IAClD,MACIE,EAAIC,KAAczK,CAE1B,CACA,OAAOwK,CACX,CC5MO,MAAME,iBAA8C3C,EACvD,mmkBACA,MACA,KACA,GACA,GACA,IC6BJ,IAAkB4C,EC9BPC,GD8BX,SAAkBD,GACdA,EAAAA,EAAA,aAAA,OAAA,eACAA,EAAAA,EAAA,OAAA,MAAA,SACAA,EAAAA,EAAA,cAAA,MAAA,gBACAA,EAAAA,EAAA,WAAA,KAAA,aAEAA,EAAAA,EAAA,WAAA,MAAA,YACH,CAPD,CAAkBA,IAAAA,EAAY,CAAA,IC9B9B,SAAWC,GACPA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,QAAA,KAAA,SACH,CATD,CAAWA,IAAAA,EAAS,CAAA,IAYpB,MAkBMC,EAAoB,KAQ1B,IAAIC,EAAsB,EAS1B,SAASC,EAAeC,GACpB,MAAMC,EAAWD,IAxBE,GAyBnB,OAAOC,IAAaJ,EAAoBC,EAAsBG,CAClE,CAOA,SAASC,EAASpI,GACd,OAAQA,EAAO8H,EAAUO,OAAU,GAAK,CAC5C,CAEA,SAASC,EAAuBtI,GAC5B,OAlDiB,GAkDRA,GAAuB8H,EAAUS,UAAa,GAAK,CAChE,CAEA,SAASC,EAAQxI,GACb,OAtDiB,GAsDRA,GAAuB8H,EAAUS,UAAa,GAAK,EAChE,CAaA,IAAWE,EAWCC,EAknBN,SAAUC,EACZC,EACAC,EACAC,EACA9D,GAEA,MAAM+D,GAAeF,EAAUhB,EAAamB,gBAAkB,EACxDC,EAAaJ,EAAUhB,EAAaqB,WAG1C,GAAID,EAAY,CACZ,GAAoB,IAAhBF,EAEA,OAAO/D,IAASiE,EAAaH,GAAY,EAO7C,MAAMxC,EAAOtB,EAAOiE,EACpB,GAAI3C,IAAS,GAAKyC,EAAa,OAAO,EACtC,MAAMI,EAASP,EAAWE,EAAYxC,GAOtC,OAAkB,IAAX6C,GACD,EACCL,EAAYC,EAAcI,EAAS,EAAK,KACnD,CAOA,GAAoB,IAAhBJ,EAAmB,OAAO,EAC9B,MAAMK,EAAkBL,EAAc,GAAM,EACtCM,EAAYP,EAAYM,EAAiBL,EAC/C,IAAK,IAAIhC,EAAQ,EAAGA,EAAQgC,EAAahC,IAAS,CAC9C,MACMuC,EADSV,EAAWE,GAAa/B,GAAS,OACf,EAARA,IAAc,GAAM,IAC7C,GAAIuC,IAAQtE,EAAM,CAGd,OAAQqE,EAAYT,EAFCE,EAAYM,EAAiBrC,GAEF,KACpD,CAEA,GAAIuC,EAAMtE,EAAM,OAAO,CAC3B,CACA,OAAO,CACX,CASA,SAASuE,EACLX,EACAE,EACAU,GAEA,OAAoB,IAAhBA,EACOhL,OAAOC,aACVmK,EAAWE,GAAajB,EAAa4B,YAGzB,IAAhBD,EACOhL,OAAOC,aAAamK,EAAWE,EAAY,IAE/CtK,OAAOC,aACVmK,EAAWE,EAAY,GACvBF,EAAWE,EAAY,GAE/B,CAiBA,SAASY,EACLxE,EACAyE,EACAnE,GAEA,IAAIoE,EAASD,EAAc,EACvBE,EAAK,EACLC,EAAaF,EAMjB,GACIA,EAASpE,IAhzBI,GAizBZN,EAAMtG,WAAWgL,MAA4B9B,EAAUiC,QAIxD,IAFAH,GAAU,EACVE,EAAaF,EACNA,EAASpE,GAAa,CACzB,MAAMR,EAAOE,EAAMtG,WAAWgL,GAC9B,GAAIxB,EAASpD,GACT6E,EAAU,GAALA,GAAW7E,EAAO8C,EAAUO,UAC9B,KAAIC,EAAuBtD,GAG9B,MAFA6E,EAAU,GAALA,IA1zBA,GA0zBY7E,GAAuB8C,EAAUS,QAAU,GAGhE,CACAqB,GAAU,CACd,MAEA,KAAOA,EAASpE,GAAa,CACzB,MAAMwE,EAAQ9E,EAAMtG,WAAWgL,GAAU9B,EAAUO,KACnD,GAAI2B,IAAU,EAAI,EAAG,MACrBH,EAAU,GAALA,EAAUG,EACfJ,GAAU,CACd,CAGJ,GAAIA,IAAWE,EAAY,OAAO,EAG9BF,EAASpE,GAAeN,EAAMtG,WAAWgL,KAAY9B,EAAUmC,OAC/DL,GAAU,GAQVC,EAAK,UAAYA,EAAK,SAC1B,IAAI1B,EAAWyB,EAASD,EAMxB,OALIxB,GAAYJ,IAEZC,EAAsBG,EACtBA,EAAWJ,GAEPI,GAh1BW,GAg1BmB0B,CAC1C,CAqWM,SAAUK,GAAiBC,GAC7B,OAxVJ,SACIjF,EACAkF,EACAC,GAEA,MAAMzB,EAAahB,EAEnB,IAAIgC,EAAS1E,EAAMzE,QAAQ,KAC3B,GAAImJ,EAAS,EAAG,OAAO1E,EAEvB,MAAMM,EAAcN,EAAMvG,OAM1B,IAAI2L,EAAa,EACbpL,EAAS,GAOb,MAAMqL,EAAO3B,EAAW,GAClB4B,EAAiBD,EAAO1C,EAAaqB,WACrCuB,GAAmBF,EAAO1C,EAAamB,gBAAkB,EAE/D,EAAG,CACC,MAAM0B,EAAcd,EAAS,EAGvBe,EAAYzF,EAAMtG,WAAW8L,GACnC,IAAIvC,EACAjL,EACJ,GAAIyN,IAAc7C,EAAU8C,IAAK,CAC7B,MAAM1C,EAASwB,EAAmBxE,EAAOwF,EAAalF,GACtD2C,EAAWF,EAAeC,GAItBC,EAAW,GACXjD,EAAMtG,WAAW8L,EAAcvC,EAAW,KAAOL,EAAUmC,OAE3D9B,EAAW,GAEfjL,EACiB,IAAbiL,EACM,GACA3D,EA/4BE,QA+4BgB0D,EAChC,MAAO,GAAIM,EAAQmC,GAAY,CAC3BxC,EAAW,EACXjL,EAAQ,GAMR,MAAM2N,EAAgBF,EAAYH,EAClC,IAAI1B,EACJ,GAAI+B,IAAkB,EAAIJ,EAAiB,CACvC,MAAMtB,EAASP,EAAW,EAAIiC,GAC9B/B,EACe,IAAXK,GAAe,EAAMsB,EAAkBtB,EAAU,KACzD,MACIL,GAAY,EAQhB,IAAIgC,EAAgB,EAChBC,EAAkB,EAClBlC,EAAUC,EAAY,EAAI,EAAIF,EAAWE,GACzC/B,EAAQ2D,EAAc,EAO1BM,EAAM,KAAOjE,EAAQvB,GAAa,CAK9B,OAEKqD,GACIhB,EAAaoD,aAAepD,EAAaqD,UAE7CrC,EAAUhB,EAAaqB,YAC1B,CACE,MAAMD,EAAaJ,EAAUhB,EAAaqB,WACpCH,GACDF,EAAUhB,EAAamB,gBAAkB,EAC9C,GAAoB,IAAhBD,EAAmB,CAEnB,GAAI7D,EAAMtG,WAAWmI,KAAWkC,EAAY,MAAM+B,EAClDlC,GAAa,CACjB,KAAO,CACH,MAAMxC,EAAOpB,EAAMtG,WAAWmI,GAASkC,EACvC,GAAI3C,IAAS,GAAKyC,EAAa,MAAMiC,EACrC,MAAM7B,EAASP,EAAWE,EAAY,EAAIxC,GAC1C,GAAe,IAAX6C,EAAc,MAAM6B,EAExBlC,EACKA,EAAYC,EAAcI,EAAU,KAC7C,CAOA,GANAN,EAAUD,EAAWE,GACrB/B,GAAS,EAKLA,GAASvB,EAAa,MAAMwF,CACpC,CAGA,IACKnC,GACIhB,EAAaoD,aAAepD,EAAaqD,WAC9CrD,EAAaqD,OACf,CACE,MAAM1E,GACDqC,EAAUhB,EAAamB,gBAAkB,EAG9C,GACI9D,EAAMtG,WAAWmI,MAChB8B,EAAUhB,EAAaqB,YAGxB,MAEJnC,GAAS,EAGT,MAAMoE,EAAY3E,EAAY,EAC9B,IAAI4E,EAAYtC,EAAY,EACxBuC,EAAoB,EAOxB,KAEIA,EAAoB,EAAIF,EACxBE,GAAqB,EACvB,CACE,MAAMnD,EAASU,EAAWwC,GAC1B,GAAIlG,EAAMtG,WAAWmI,MAAqB,IAATmB,GAC7B,MAAM8C,EAEV,GADAjE,GAAS,EACL7B,EAAMtG,WAAWmI,MAAamB,GAAU,EAAK,KAC7C,MAAM8C,EACVjE,GAAS,EACTqE,GAAa,CACjB,CAEA,GAAIC,EAAoBF,EAAW,CAC/B,GACIjG,EAAMtG,WAAWmI,MACQ,IAAxB6B,EAAWwC,IAGZ,MACJrE,GAAS,CACb,CAEA+B,GAAa,GAAKtC,GAAa,GAC/BqC,EAAUD,EAAWE,GAErB,QACJ,CAGA,MAAMU,EAAcX,IAAY,GAC1B7D,EAAOE,EAAMtG,WAAWmI,GAO9B,GAAoB,IAAhByC,EAAmB,CAEnB,GAAIxE,IAAS8C,EAAUmC,KAAM,CACzB9B,EAAWpB,EAAQ2D,EAAc,EAEjCxN,EACoB,IAAhBsM,EACMhL,OAAOC,aACHoK,EAAUhB,EAAa4B,YAE3BF,EACIX,EACAE,EACAU,GAGd,KACJ,CAeA,GAAoB,IAAhBA,EAAmB,KAC3B,CAGA,MAAM/C,EAAOkC,EACTC,EACAC,EACAC,GAAaU,GAAe,GAC5BxE,GAGJ,GAAIyB,EAAO,EAAG,MAEdqC,EAAYrC,EACZoC,EAAUD,EAAWE,GACrB/B,GAAS,CACb,CASc,KAAV7J,GAWIiL,EAAW,IACXjL,EAAQqM,EACJX,EACAkC,EACAC,GAIhB,MACI5C,EAAW,EACXjL,EAAQ,GAYK,IAAbiL,GACCkC,EAUDT,EAASc,GAELJ,EAAaV,IACb1K,GAAUgG,EAAMnG,MAAMuL,EAAYV,IAEtC1K,GAAUhC,EACV0M,EAASU,EAAaI,EAAcvC,GAQpCjD,EAAMtG,WAAWgL,KAAY9B,EAAUwD,MACvC1B,EAAS1E,EAAMzE,QAAQ,IAAKmJ,GAEpC,OAASA,GAAU,GAEnB,OAAO1K,EAASgG,EAAMnG,MAAMuL,EAChC,CAkCWiB,CAAepB,EAAY,GAAM,EAC5C,EAhoCA,SAAW1B,GACPA,EAAAA,EAAA,YAAA,GAAA,cACAA,EAAAA,EAAA,aAAA,GAAA,eACAA,EAAAA,EAAA,eAAA,GAAA,iBACAA,EAAAA,EAAA,WAAA,GAAA,aACAA,EAAAA,EAAA,YAAA,GAAA,aACH,CAND,CAAWA,IAAAA,EAAkB,CAAA,IAW7B,SAAYC,GAERA,EAAAA,EAAA,OAAA,GAAA,SAEAA,EAAAA,EAAA,OAAA,GAAA,SAEAA,EAAAA,EAAA,UAAA,GAAA,WACH,CAPD,CAAYA,IAAAA,EAAY,CAAA,IClGxB,IAAI8C,GAAY,MACfC,QAAUvH,EAAIqD,OACdmE,OAASvH,EAAGoD,OACZoE,MAAQrH,EAAEiD,OACVqE,MAAQxH,EAAEmD,OACVsE,SAAW,CACV9K,KAAK4K,MACL5K,KAAK6K,MACL7K,KAAK2K,QACJ1H,KAAK,KACP8H,QAAU,CAAC/K,KAAK4K,MAAO5K,KAAK2K,QAAQ1H,KAAK,KACzC3F,MAAQ,CAAA,EACR0N,KAAO,CACNC,UAAW,IACXC,SAAS,EACTC,aAAc,IAEf,WAAAC,CAAYJ,EAAO,IAClBhL,KAAKgL,KAAO,IACRhL,KAAKgL,QACLA,EAEL,CACA,GAAAK,CAAIL,EAAO,IAMV,OALAhL,KAAKgL,KAAO,IACRhL,KAAKgL,QACLA,GAEJhL,KAAK1C,MAAQ,CAAA,EACN0C,IACR,CACA,QAAAsL,CAASC,GACR,OAAOA,EAAIjP,QAAQ,uBAAwB,OAC5C,CACA,YAAAkP,CAAaC,EAAMC,EAAOC,EAAQ,GACjC,MAAMC,EAAS5L,KAAKsL,SAASG,GACvBI,EAAU7L,KAAKsL,SAASI,GACxBI,EAAO,SAAS9L,KAAK+K,WAAWa,KAAUC,OAChD,IAAIE,EAAO,GAAGH,IAASE,YAAeD,IACtC,IAAK,IAAIG,EAAQ,EAAGA,GAASL,EAAOK,IAASD,EAAO,GAAGH,OAAYE,KAAQC,aAAgBF,IAC3F,OAAOE,CACR,CACA,mBAAAE,GACC,OAAOjM,KAAK1C,MAAM4O,kBAAoB,YACvC,CACA,iBAAAC,GACC,OAAOnM,KAAK1C,MAAM8O,oBAAsB,IAAIC,OAAO,SAASrM,KAAKiM,sBAAsBzF,UAAUxG,KAAK8K,YAAY9K,KAAK0K,WACxH,CACA,aAAA4B,GACC,OAAOtM,KAAK1C,MAAMiP,yBAA4B,IAAIF,OAAO,iHAC1D,CACA,aAAAG,GACC,MAAMC,EAAM,mBACNC,EAAO,SAASD,KAAOA,MAAQzM,KAAKsM,gBAAgB9F,UAC1D,OAAOxG,KAAK1C,MAAMqP,eAAiB,IAAIN,OAAO,SAASI,SAAWC,UAAaD,SAAWC,QAAWD,WAAaA,SAAWC,WAAcD,WAAaA,WAAaA,SAAWC,WAAcD,WAAaA,WAAaA,SAAWC,WAAcD,WAAaA,QAAUA,KAAOC,WAAcD,WAAaA,QAAUC,WAAcD,WAAaA,QAAUA,WAAaA,WAAaA,SACpX,CACA,iBAAAG,GACC,OAAO5M,KAAK1C,MAAMuP,eAAiB,IAAIR,OAAO,MAAMrM,KAAKwM,gBAAgBhG,YAC1E,CACA,kBAAAsG,GACC,OAAO9M,KAAK1C,MAAMyP,qBAAuB,IAAIV,OAAO,WAAWrM,KAAKwM,gBAAgBhG,YACrF,CACA,QAAAwG,GACC,OAAOhN,KAAK1C,MAAM2P,WAAa,IAAIZ,OAAO,YAAYrM,KAAK+K,mCAC5D,CACA,QAAAmC,GACC,OAAOlN,KAAK1C,MAAM6P,0BAA6B,IAAId,OAAO,kFAC3D,CACA,mBAAAe,GACC,OAAOpN,KAAK1C,MAAM+P,sBAAwB,IAAIhB,OAAO,QAAQrM,KAAKiM,sBAAsBzF,UAAUxG,KAAK8K,eAAe9K,KAAKgL,KAAK,OAAS,WAAa,2BAA2BhL,KAAK8K,aACvL,CACA,mBAAAwC,GACC,OAAOtN,KAAK1C,MAAMiQ,sBAAwB,IAAIlB,OAAO,GAAGrM,KAAK8K,YAAY9K,KAAKiM,sBAAsBzF,SACrG,CACA,QAAAgH,GACC,OAAOxN,KAAK1C,MAAMmQ,WAAa,IAAIpB,OAAO,cAAcrM,KAAKwL,aAAa,IAAK,QAAQxL,KAAKwL,aAAa,IAAK,QAAQxL,KAAKwL,aAAa,IAAK,iBAAiBxL,KAAK+K,qCAAqC/K,KAAK+K,kCAAkC/K,KAAKmM,oBAAoB3F,iDAAiDxG,KAAK+K,mBAAqB/K,KAAKgL,KAAK,OAAS,kCAAoC,cAAgB,OAAOhL,KAAK+K,kBAAkB/K,KAAK+K,0BAA0B/K,KAAK+K,wBAAwB/K,KAAK+K,kBAAoB/K,KAAK0N,iBAAiBlH,OAAS,uBAAuBxG,KAAKsN,sBAAsB9G,eAAexG,KAAKgL,KAAKC,mBACxnB,CACA,aAAA0C,GACC,OAAO3N,KAAK1C,MAAMsQ,+BAAkC,IAAIvB,OAAO,+GAChE,CACA,MAAAwB,GACC,OAAO7N,KAAK1C,MAAMwQ,wBAA2B,IAAIzB,OAAO,wBACzD,CACA,OAAA0B,GACC,GAAI/N,KAAK1C,MAAM0Q,IAAK,OAAOhO,KAAK1C,MAAM0Q,IACtC,MAAMC,EAAW,IAAI,IAAIpR,IAAImD,KAAKgL,KAAKkD,MAAQ,KAAKC,OAAOC,UAAUnL,KAAK,KAE1E,OADAjD,KAAK1C,MAAM0Q,IAAM,IAAI3B,OAAO,GAAG4B,GAAY,cAAcjO,KAAK6N,SAASrH,UAChExG,KAAK1C,MAAM0Q,GACnB,CACA,eAAAK,GACC,OAAOrO,KAAK1C,MAAMgR,kBAAoB,IAAIjC,OAAO,MAAQrM,KAAK6N,SAASrH,OAAS,IAAIxG,KAAKmM,oBAAoB3F,gBAC9G,CACA,UAAA+H,GACC,OAAOvO,KAAK1C,MAAMkR,aAAe,IAAInC,OAAO,MAAQrM,KAAK6N,SAASrH,OAAS,OAAOxG,KAAKmM,oBAAoB3F,cAAcxG,KAAKmM,oBAAoB3F,cAAcxG,KAAKmM,oBAAoB3F,gBAAgBxG,KAAKmM,oBAAoB3F,WACnO,CACA,iBAAAiI,GACC,OAAOzO,KAAK1C,MAAMoR,gBAAkB,IAAIrC,OAAO,MAAQrM,KAAK4M,oBAAoBpG,OAAS,aAAaxG,KAAKuO,aAAa/H,oBAAoBxG,KAAKuO,aAAa/H,WAAaxG,KAAKkN,WAAW1G,OAASxG,KAAKoN,sBAAsB5G,OAChO,CACA,uBAAAmI,GACC,OAAO3O,KAAK1C,MAAMsR,sBAAwB,IAAIvC,OAAO,OAASrM,KAAKgL,KAAK6D,QAAU7O,KAAKsM,gBAAgB9F,OAAS,IAAM,IAAM,YAAYxG,KAAKuO,aAAa/H,uBAAuBxG,KAAK+N,UAAUvH,YAAcxG,KAAKoN,sBAAsB5G,OAC1O,CACA,aAAAsI,GACC,OAAO9O,KAAK1C,MAAMyR,gBAAkB,IAAI1C,OAAO,MAAQrM,KAAK8M,qBAAqBtG,OAAS,aAAaxG,KAAKuO,aAAa/H,mBAAmBxG,KAAKuO,aAAa/H,WAAaxG,KAAKoN,sBAAsB5G,OACvM,CACA,mBAAAwI,GACC,OAAOhP,KAAK1C,MAAM2R,sBAAwB,IAAI5C,OAAO,MAAQrM,KAAK8M,qBAAqBtG,OAAS,aAAaxG,KAAKuO,aAAa/H,mBAAmBxG,KAAKqO,kBAAkB7H,WAAaxG,KAAKoN,sBAAsB5G,OAClN,CACA,cAAAkH,GACC,OAAO1N,KAAK1C,MAAM4R,gCAAmC,IAAI7C,OAAO,GACjE,CACA,0BAAA8C,GACC,OAAOnP,KAAK1C,MAAM8R,yBAA2B,IAAI/C,OAAO,IAAIrM,KAAKgP,sBAAsBxI,SAAU,KAClG,CACA,qBAAA6I,GACC,OAAOrP,KAAK1C,MAAMgS,oBAAsB,IAAIjD,OAAO,oCAAyCrM,KAAK8K,gCAAqC9K,KAAK2O,0BAA0BnI,SAASxG,KAAKwN,WAAWhH,UAAW,KAC1M,CACA,kBAAA+I,GACC,OAAOvP,KAAK1C,MAAMkS,iBAAmB,IAAInD,OAAO,UAAYrM,KAAKgL,KAAKE,QAAUlL,KAAKgN,WAAWxG,OAAS,IAAMxG,KAAKyO,oBAAoBjI,OAASxG,KAAKwN,WAAWhH,OAAQ,KAC1K,CACA,4BAAAiJ,GACC,OAAOzP,KAAK1C,MAAMoS,2BAA6B,IAAIrD,QAAQrM,KAAKgL,KAAKE,QAAUlL,KAAKgN,WAAWxG,OAAS,IAAM,gBAAgBxG,KAAK4M,oBAAoBpG,gBAAgBxG,KAAKuO,aAAa/H,oBAAoBxG,KAAKqO,kBAAkB7H,UAAYxG,KAAKkN,WAAW1G,OAASxG,KAAKoN,sBAAsB5G,OAASxG,KAAKwN,WAAWhH,OAAQ,KACtU,CACA,uBAAAmJ,GACC,OAAO3P,KAAK1C,MAAMsS,sBAAwB,IAAIvD,OAAO,QAAQrM,KAAKiM,sBAAsBzF,gBAAgBxG,KAAK+K,YAAY/K,KAAK2N,gBAAgBnH,WAC/I,CACA,oBAAAqJ,GACC,OAAO7P,KAAK1C,MAAMwS,mBAAqB,IAAIzD,OAAO,GAAGrM,KAAK2N,gBAAgBnH,UAAUxG,KAAK8O,gBAAgBtI,SAAU,KACpH,CACA,gBAAAuJ,GACC,OAAO/P,KAAK1C,MAAM6N,eAAiB,IAAIkB,QAAQrM,KAAKgL,KAAKG,cAAgB,IAAI6E,KAAKC,GAASjQ,KAAKsL,SAAS2E,KAAOhN,KAAK,KACtH,CACA,iBAAAiN,GACC,OAAOlQ,KAAK1C,MAAM6S,gBAAkB,IAAI9D,OAAO,oBAAyBrM,KAAK8K,cAAc9K,KAAK+P,mBAAmBvJ,UAAW,KAC/H,CACA,mBAAA4J,GACC,OAAOpQ,KAAK1C,MAAM+S,kBAAoB,IAAIhE,OAAO,IAAIrM,KAAKkQ,oBAAoB1J,SAAU,IACzF,GAIG8J,GAAa,CAChBC,SAAU,CAACC,EAAM7L,EAAK8L,KACrB,MAAMC,EAAKD,EAAKC,GAAGnB,qBACnBmB,EAAGC,UAAYhM,EACf,MAAMiM,EAAIF,EAAG7O,KAAK2O,GAClB,OAAOI,EAAIA,EAAE,GAAGhT,OAAS,CAAC,EAE3BiT,UAAW,CAAC5O,EAAOwO,IAASA,EAAKI,UAAU5O,IAExC6O,GAAiB,CACpB,QAASR,GACT,SAAUA,GACV,OAAQA,GACR,KAAM,CACLC,SAAU,SAASC,EAAM7L,EAAK8L,GAC7B,MAAMC,EAAKD,EAAKC,GAAGjB,+BACnBiB,EAAGC,UAAYhM,EACf,MAAMiM,EAAIF,EAAG7O,KAAK2O,GAClB,OAAII,EACCjM,GAAO,GAAuB,MAAlB6L,EAAK7L,EAAM,IACvBA,GAAO,GAAuB,MAAlB6L,EAAK7L,EAAM,GADmB,EAEvCiM,EAAE,GAAGhT,OAEN,CACR,EACAiT,UAAW,CAAC5O,EAAOwO,IAASA,EAAKI,UAAU5O,IAE5C,UAAW,CACVsO,SAAU,SAASC,EAAM7L,EAAK8L,GAC7B,MAAMC,EAAKD,EAAKC,GAAGb,uBACnBa,EAAGC,UAAYhM,EACf,MAAMiM,EAAIF,EAAG7O,KAAK2O,GAClB,OAAOI,EAAIA,EAAE,GAAGhT,OAAS,CAC1B,EACAiT,UAAW,CAAC5O,EAAOwO,IAASA,EAAKI,UAAU5O,KAc7C,IAAI8O,GAAiB,CACpBC,WAAW,EACXC,YAAY,EACZpC,SAAS,EACT,OAAO,EACPX,KAdD,WACC,MAAM/P,EAFY,8EAEUwD,MAAM,KAMlC,MATc,qUAILA,MAAM,KAAKuP,SAASC,IAC5B,MAAMC,EAAMD,EAAKzR,QAAQ,KACnB2R,EAASF,EAAKnT,MAAM,EAAGoT,GAC7B,IAAK,MAAME,KAAUH,EAAKnT,MAAMoT,EAAM,GAAIjT,EAAOR,KAAK0T,EAASC,EAAO,IAEhEnT,CACR,CAMOoT,GACNrG,SAAS,EACTD,UAAW,KAQRuG,GAAQ,MAEXC,OAEAzL,MAEA2K,UAEAe,IAEAlB,KAEAnR,IACA,WAAA+L,CAAYoF,EAAMiB,EAAQzL,EAAO2K,GAChC,MAAMe,EAAMlB,EAAKxS,MAAMgI,EAAO2K,GAC9B3Q,KAAKyR,OAASA,EAAO1P,cACrB/B,KAAKgG,MAAQA,EACbhG,KAAK2Q,UAAYA,EACjB3Q,KAAK0R,IAAMA,EACX1R,KAAKwQ,KAAOkB,EACZ1R,KAAKX,IAAMqS,CACZ,GAGGC,GAAY,MACfC,SACAC,YACAnB,GA6BA,WAAAtF,CAAY0G,EAAU,IACrB,MAAMC,UAAEA,KAAcC,GAAmBF,EACzC9R,KAAK4R,SAAW,IACZb,MACAiB,GAEJhS,KAAK6R,YAAc,IAAKf,IACxB9Q,KAAK0Q,GAAKqB,GAAa,IAAItH,GAC3BzK,KAAK0Q,GAAGrF,IAAI,IACRrL,KAAK4R,SACRzG,aAAc8G,OAAOC,KAAKlS,KAAK6R,cAEjC,CAiBA,GAAA/U,CAAI2U,EAAQU,EAAa,MACxB,GAAKA,EACA,CACJ,MAAMC,EAAM,CACXvB,UAAW,CAAC5O,EAAOwO,IAASA,EAAKI,UAAU5O,MACxCkQ,GAEJnS,KAAK6R,YAAYJ,GAAUW,CAC5B,aAPwBpS,KAAK6R,YAAYJ,GAYzC,OAJAzR,KAAK0Q,GAAGrF,IAAI,IACRrL,KAAK4R,SACRzG,aAAc8G,OAAOC,KAAKlS,KAAK6R,eAEzB7R,IACR,CAMA,GAAAqL,CAAIyG,EAAU,IASb,OARA9R,KAAK4R,SAAW,IACZ5R,KAAK4R,YACLE,GAEJ9R,KAAK0Q,GAAGrF,IAAI,IACRrL,KAAK4R,SACRzG,aAAc8G,OAAOC,KAAKlS,KAAK6R,eAEzB7R,IACR,CAMA,IAAAjB,CAAKyR,GACJ,IAAKA,EAAK5S,OAAQ,OAAO,EACzB,IAAIgT,EAAGF,EAGP,IAFAA,EAAK1Q,KAAK0Q,GAAGR,oBACbQ,EAAGC,UAAY,EACgB,QAAvBC,EAAIF,EAAG7O,KAAK2O,QAAqBxQ,KAAKqS,aAAa7B,EAAMI,EAAE,GAAIF,EAAGC,WAAY,OAAO,EAC7F,GAAI3Q,KAAK4R,SAASZ,WAAahR,KAAK6R,YAAY,WAC/CnB,EAAK1Q,KAAK0Q,GAAGrB,wBACbqB,EAAGC,UAAY,EACO,OAAlBD,EAAG7O,KAAK2O,IAAgB,OAAO,EAEpC,GAAIxQ,KAAK4R,SAASX,YAAcjR,KAAK6R,YAAY,YAC5CrB,EAAK9Q,QAAQ,MAAQ,EAAG,CAC3B,MAAM4S,EAAatS,KAAK0Q,GAAGvB,6BACrBoD,EAAavS,KAAK0Q,GAAGf,0BAE3B,IADA2C,EAAW3B,UAAY,EACgB,QAA/BC,EAAI0B,EAAWzQ,KAAK2O,KAAiB,CAC5C,MAAMP,EAAOO,EAAKxS,MAAMwU,KAAKC,IAAI,EAAG7B,EAAE5K,MAAQ,IAAK4K,EAAE5K,OACrD,GAAIuM,EAAWxT,KAAKkR,GAAO,OAAO,CACnC,CACD,CAED,OAAO,CACR,CASA,YAAAoC,CAAa7B,EAAMiB,EAAQ9M,GAC1B,OAAK3E,KAAK6R,YAAYJ,EAAO1P,eACtB/B,KAAK6R,YAAYJ,EAAO1P,eAAewO,SAASC,EAAKxS,MAAM,EAAG2G,EAAM3E,KAAK4R,SAAS3G,WAAYtG,EAAK3E,MADtD,CAErD,CAOA,KAAAiC,CAAMuO,GACL,MAAMrS,EAAS,GACTuU,EAAW1S,KAAK0Q,GAAGR,oBACzB,IAAIyC,EACAL,EACAC,EACAK,EACAC,EACAC,EACAC,GAAa,EACbC,GAAgB,EAChBC,GAAiB,EACjBtO,EAAM,EACV,IAAK6L,EAAK5S,OAAQ,OAAO,KAWzB,IAVA8U,EAAS/B,UAAY,EACjB3Q,KAAK4R,SAASZ,WAAahR,KAAK6R,YAAY,WAC/Cc,EAAc3S,KAAK0Q,GAAGrB,wBACtBsD,EAAYhC,UAAY,GAErB3Q,KAAK4R,SAASX,YAAcjR,KAAK6R,YAAY,aAChDS,EAAatS,KAAK0Q,GAAGvB,6BACrBmD,EAAW3B,UAAY,EACvB4B,EAAavS,KAAK0Q,GAAGf,6BAEb,CACR,MAAMuD,EAAWV,KAAKC,IAAI9N,EAAM,EAAG,GACnC,GAAI2N,GAAcC,IAAeU,KAAoBJ,GAAuBA,EAAoB7M,MAAQrB,GAEvG,IADI2N,EAAW3B,UAAYuC,IAAUZ,EAAW3B,UAAYuC,KACnD,CACR,MAAMtC,EAAI0B,EAAWzQ,KAAK2O,GAC1B,IAAKI,EAAG,CACPqC,GAAiB,EACjBJ,OAAsB,EACtB,KACD,CACA,MAAM5C,EAAOsC,EAAW1Q,KAAK2O,EAAKxS,MAAMwU,KAAKC,IAAI,EAAG7B,EAAE5K,MAAQ,IAAK4K,EAAE5K,QACrE,GAAKiK,EAAL,CAMA,GALA4C,EAAsB,CACrBpB,OAAQ,UACRzL,MAAO4K,EAAE5K,MAAQiK,EAAK,GAAGrS,OACzB+S,UAAWC,EAAE5K,MAAQ4K,EAAE,GAAGhT,QAEvBiV,EAAoB7M,OAASrB,EAAK,MAClC2N,EAAW3B,UAAYuC,IAAUZ,EAAW3B,UAAYuC,EAPjD,CAQZ,CAED,GAAIP,IAAgBK,KAAmBJ,GAAsBA,EAAmB5M,MAAQrB,GAEvF,IADIgO,EAAYhC,UAAYuC,IAAUP,EAAYhC,UAAYuC,KACrD,CACR,MAAMtC,EAAI+B,EAAY9Q,KAAK2O,GAC3B,IAAKI,EAAG,CACPoC,GAAgB,EAChBJ,OAAqB,EACrB,KACD,CAMA,GALAA,EAAqB,CACpBnB,OAAQ,GACRzL,MAAO4K,EAAE5K,MAAQ4K,EAAE,GAAGhT,OACtB+S,UAAWC,EAAE5K,MAAQ4K,EAAE,GAAGhT,QAEvBgV,EAAmB5M,OAASrB,EAAK,MACjCgO,EAAYhC,UAAYuC,IAAUP,EAAYhC,UAAYuC,EAC/D,CAED,IAEIC,EAFAC,EAAiBP,EAGrB,KAFKO,GAAkBR,IAAuBA,EAAmB5M,MAAQoN,EAAepN,OAAS4M,EAAmB5M,QAAUoN,EAAepN,OAAS4M,EAAmBjC,UAAYyC,EAAezC,cAAYyC,EAAiBR,IAE5NG,EAAY,OAAS,CACzB,IAAKD,EAAc,CACdJ,EAAS/B,UAAYuC,IAAUR,EAAS/B,UAAYuC,GACxD,MAAMtC,EAAI8B,EAAS7Q,KAAK2O,GACxB,IAAKI,EAAG,CACPmC,GAAa,EACb,KACD,CACAD,EAAe,CACdrB,OAAQb,EAAE,GACV5K,MAAO4K,EAAE5K,MAAQ4K,EAAE,GAAGhT,OACtB+S,UAAWC,EAAE5K,MAAQ4K,EAAE,GAAGhT,OAE5B,CACA,GAAIkV,EAAa9M,MAAQrB,EAAK,CAC7BmO,OAAe,EACf,QACD,CACA,GAAIM,GAAkBN,EAAa9M,MAAQoN,EAAepN,MAAO,MACjE,MAAMqL,EAASyB,EACfA,OAAe,EACf,MAAMO,EAAMrT,KAAKqS,aAAa7B,EAAMa,EAAOI,OAAQJ,EAAOV,WAC1D,GAAI0C,EAAK,CACRF,EAAkB,CACjB1B,OAAQJ,EAAOI,OACfzL,MAAOqL,EAAOrL,MACd2K,UAAWU,EAAOV,UAAY0C,GAE/B,KACD,CACD,CACA,IAAIC,EAAYH,EAGhB,KAFKG,GAAaT,IAAwBA,EAAoB7M,MAAQsN,EAAUtN,OAAS6M,EAAoB7M,QAAUsN,EAAUtN,OAAS6M,EAAoBlC,UAAY2C,EAAU3C,cAAY2C,EAAYT,KACvMS,GAAaV,IAAuBA,EAAmB5M,MAAQsN,EAAUtN,OAAS4M,EAAmB5M,QAAUsN,EAAUtN,OAAS4M,EAAmBjC,UAAY2C,EAAU3C,cAAY2C,EAAYV,IACnMU,EAAW,MACZA,IAAcT,EAAqBA,OAAsB,EACpDS,IAAcV,IAAoBA,OAAqB,GAChE,MAAM3Q,EAAQ,IAAIuP,GAAMhB,EAAM8C,EAAU7B,OAAQ6B,EAAUtN,MAAOsN,EAAU3C,WACvE1O,EAAMwP,OAAQzR,KAAK6R,YAAY5P,EAAMwP,QAAQZ,UAAU5O,EAAOjC,MAC7DA,KAAK6Q,UAAU5O,GACpB9D,EAAOR,KAAKsE,GACZ0C,EAAM2O,EAAU3C,SACjB,CACA,OAAIxS,EAAOP,OAAeO,EACnB,IACR,CAOA,YAAAoV,CAAa/C,GACZ,IAAKA,EAAK5S,OAAQ,OAAO,KACzB,MAAMgT,EAAI5Q,KAAK0Q,GAAGN,sBAAsBvO,KAAK2O,GAC7C,IAAKI,EAAG,OAAO,KACf,MAAMyC,EAAMrT,KAAKqS,aAAa7B,EAAMI,EAAE,GAAIA,EAAE,GAAGhT,QAC/C,IAAKyV,EAAK,OAAO,KACjB,MAAMpR,EAAQ,IAAIuP,GAAMhB,EAAMI,EAAE,GAAIA,EAAE5K,MAAQ4K,EAAE,GAAGhT,OAAQgT,EAAE5K,MAAQ4K,EAAE,GAAGhT,OAASyV,GAEnF,OADArT,KAAK6R,YAAY5P,EAAMwP,QAAQZ,UAAU5O,EAAOjC,MACzCiC,CACR,CAeA,IAAAiM,CAAKsF,EAAMC,GAAU,GAQpB,OAPAD,EAAOE,MAAMC,QAAQH,GAAQA,EAAO,CAACA,GAEhCxT,KAAK4R,SAAS1D,KADduF,EACqBzT,KAAK4R,SAAS1D,KAAK7N,OAAOmT,GADjBA,EAEnCxT,KAAK0Q,GAAGrF,IAAI,IACRrL,KAAK4R,SACRzG,aAAc8G,OAAOC,KAAKlS,KAAK6R,eAEzB7R,IACR,CAMA,SAAA6Q,CAAU5O,GACJA,EAAMwP,SAAQxP,EAAM5C,IAAM,UAAU4C,EAAM5C,OAC1B,YAAjB4C,EAAMwP,QAAyB,YAAY1S,KAAKkD,EAAM5C,OAAM4C,EAAM5C,IAAM,UAAU4C,EAAM5C,MAC7F,GC9gBD,MAAMuU,GAAS,WAGTC,GAAO,GAUPC,GAAgB,QAChBC,GAAgB,aAChBC,GAAkB,4BAGlBC,GAAS,CACdC,SAAY,kDACZ,YAAa,iDACb,gBAAiB,iBAKZC,GAAQ3B,KAAK2B,MACbC,GAAqB3W,OAAOC,aAUlC,SAAS2W,GAAMC,GACd,MAAM,IAAIC,WAAWN,GAAOK,GAC7B,CA6BA,SAASE,GAAUC,EAAQC,GAC1B,MAAMC,EAAQF,EAAO9S,MAAM,KAC3B,IAAIxD,EAAS,GACTwW,EAAM/W,OAAS,IAGlBO,EAASwW,EAAM,GAAK,IACpBF,EAASE,EAAM,IAIhB,MACMC,EA/BP,SAAaC,EAAOH,GACnB,MAAMvW,EAAS,GACf,IAAIP,EAASiX,EAAMjX,OACnB,KAAOA,KACNO,EAAOP,GAAU8W,EAASG,EAAMjX,IAEjC,OAAOO,CACR,CAwBiB6R,EAFhByE,EAASA,EAAOnY,QAAQ0X,GAAiB,MACnBrS,MAAM,KACA+S,GAAUzR,KAAK,KAC3C,OAAO9E,EAASyW,CACjB,CAeA,SAASE,GAAW3X,GACnB,MAAM4X,EAAS,GACf,IAAIC,EAAU,EACd,MAAMpX,EAAST,EAAOS,OACtB,KAAOoX,EAAUpX,GAAQ,CACxB,MAAMzB,EAAQgB,EAAOU,WAAWmX,KAChC,GAAI7Y,GAAS,OAAUA,GAAS,OAAU6Y,EAAUpX,EAAQ,CAE3D,MAAMqX,EAAQ9X,EAAOU,WAAWmX,KACR,QAAX,MAARC,GACJF,EAAOpX,OAAe,KAARxB,IAAkB,KAAe,KAAR8Y,GAAiB,QAIxDF,EAAOpX,KAAKxB,GACZ6Y,IAEF,MACCD,EAAOpX,KAAKxB,EAEd,CACA,OAAO4Y,CACR,CAUA,MAmCMG,GAAe,SAASjM,EAAOkM,GAGpC,OAAOlM,EAAQ,GAAK,IAAMA,EAAQ,MAAgB,GAARkM,IAAc,EACzD,EAOMC,GAAQ,SAASC,EAAOC,EAAWC,GACxC,IAAI3S,EAAI,EAGR,IAFAyS,EAAQE,EAAYpB,GAAMkB,EA1Kd,KA0K8BA,GAAS,EACnDA,GAASlB,GAAMkB,EAAQC,GACOD,EAAQG,IAA2B5S,GAAKiR,GACrEwB,EAAQlB,GAAMkB,EA3JMxB,IA6JrB,OAAOM,GAAMvR,EAAI,GAAsByS,GAASA,EAhLpC,IAiLb,EASMnY,GAAS,SAASiH,GAEvB,MAAM4Q,EAAS,GACTtQ,EAAcN,EAAMvG,OAC1B,IAAIL,EAAI,EACJkY,EA5LY,IA6LZC,EA9Le,GAoMfC,EAAQxR,EAAM/B,YAlMD,KAmMbuT,EAAQ,IACXA,EAAQ,GAGT,IAAK,IAAIhT,EAAI,EAAGA,EAAIgT,IAAShT,EAExBwB,EAAMtG,WAAW8E,IAAM,KAC1B0R,GAAM,aAEPU,EAAOpX,KAAKwG,EAAMtG,WAAW8E,IAM9B,IAAK,IAAIqD,EAAQ2P,EAAQ,EAAIA,EAAQ,EAAI,EAAG3P,EAAQvB,GAAwC,CAO3F,MAAMmR,EAAOrY,EACb,IAAK,IAAIsY,EAAI,EAAGjT,EAAIiR,IAA0BjR,GAAKiR,GAAM,CAEpD7N,GAASvB,GACZ4P,GAAM,iBAGP,MAAMpL,GA9FqBvF,EA8FAS,EAAMtG,WAAWmI,OA7F7B,IAAQtC,EAAY,GACvBA,EAAY,GAAlB,GAEJA,GAAa,IAAQA,EAAY,GAC7BA,EAAY,GAEhBA,GAAa,IAAQA,EAAY,IAC7BA,EAAY,GAEbmQ,GAsFD5K,GAAS4K,IACZQ,GAAM,iBAEHpL,EAAQkL,IAAOP,GAASrW,GAAKsY,IAChCxB,GAAM,YAGP9W,GAAK0L,EAAQ4M,EACb,MAAMC,EAAIlT,GAAK8S,EAhPL,EAgPoB9S,GAAK8S,EA/OzB,MA+O8C9S,EAAI8S,EAE5D,GAAIzM,EAAQ6M,EACX,MAGD,MAAMC,EAAalC,GAAOiC,EACtBD,EAAI1B,GAAMP,GAASmC,IACtB1B,GAAM,YAGPwB,GAAKE,CAEN,CAEA,MAAMpP,EAAMoO,EAAOnX,OAAS,EAC5B8X,EAAON,GAAM7X,EAAIqY,EAAMjP,EAAa,GAARiP,GAIxBzB,GAAM5W,EAAIoJ,GAAOiN,GAAS6B,GAC7BpB,GAAM,YAGPoB,GAAKtB,GAAM5W,EAAIoJ,GACfpJ,GAAKoJ,EAGLoO,EAAOiB,OAAOzY,IAAK,EAAGkY,EAEvB,CAtIoB,IAAS/R,EAwI7B,OAAOjG,OAAOkG,iBAAiBoR,EAChC,EASMlW,GAAS,SAASsF,GACvB,MAAM4Q,EAAS,GAMTtQ,GAHNN,EAAQ2Q,GAAW3Q,IAGOvG,OAG1B,IAAI6X,EA/RY,IAgSZJ,EAAQ,EACRK,EAlSe,GAqSnB,IAAK,MAAMO,KAAgB9R,EACtB8R,EAAe,KAClBlB,EAAOpX,KAAKyW,GAAmB6B,IAIjC,MAAMC,EAAcnB,EAAOnX,OAC3B,IAAIuY,EAAiBD,EAWrB,IALIA,GACHnB,EAAOpX,KAjTS,KAqTVwY,EAAiB1R,GAAa,CAIpC,IAAImM,EAAIgD,GACR,IAAK,MAAMqC,KAAgB9R,EACtB8R,GAAgBR,GAAKQ,EAAerF,IACvCA,EAAIqF,GAMN,MAAMG,EAAwBD,EAAiB,EAC3CvF,EAAI6E,EAAItB,IAAOP,GAASyB,GAASe,IACpC/B,GAAM,YAGPgB,IAAUzE,EAAI6E,GAAKW,EACnBX,EAAI7E,EAEJ,IAAK,MAAMqF,KAAgB9R,EAI1B,GAHI8R,EAAeR,KAAOJ,EAAQzB,IACjCS,GAAM,YAEH4B,IAAiBR,EAAG,CAEvB,IAAIY,EAAIhB,EACR,IAAK,IAAIzS,EAAIiR,IAA0BjR,GAAKiR,GAAM,CACjD,MAAMiC,EAAIlT,GAAK8S,EAxVP,EAwVsB9S,GAAK8S,EAvV3B,MAuVgD9S,EAAI8S,EAC5D,GAAIW,EAAIP,EACP,MAED,MAAMQ,EAAUD,EAAIP,EACdC,EAAalC,GAAOiC,EAC1Bf,EAAOpX,KACNyW,GAAmBc,GAAaY,EAAIQ,EAAUP,EAAY,KAE3DM,EAAIlC,GAAMmC,EAAUP,EACrB,CAEAhB,EAAOpX,KAAKyW,GAAmBc,GAAamB,EAAG,KAC/CX,EAAON,GAAMC,EAAOe,EAAuBD,IAAmBD,GAC9Db,EAAQ,IACNc,CACH,GAGCd,IACAI,CAEH,CACA,OAAOV,EAAO9R,KAAK,GACpB,EA2CMsT,GAXU,SAASpS,GACxB,OAAOqQ,GAAUrQ,GAAO,SAAShH,GAChC,OAAO4W,GAAchV,KAAK5B,GACvB,OAAS0B,GAAO1B,GAChBA,CACJ,GACD,EAKMoZ,GA9BY,SAASpS,GAC1B,OAAOqQ,GAAUrQ,GAAO,SAAShH,GAChC,OAAO2W,GAAc/U,KAAK5B,GACvBD,GAAOC,EAAOa,MAAM,GAAG+D,eACvB5E,CACJ,GACD;;ACnYA,IAAIqZ,GAAYvE,OAAOwE,eACnBC,GAAc,CAACC,EAAKC,KACvB,IAAIC,EAAS,CAAA,EACb,IAAK,IAAI5G,KAAQ0G,EAAKH,GAAUK,EAAQ5G,EAAM,CAC7C6G,IAAKH,EAAI1G,GACT8G,YAAY,IAGb,OADiBP,GAAUK,EAAQG,OAAOC,YAAa,CAAE9a,MAAO,WACzD0a,CAAM,EASVK,kBAAgCR,GAAY,CAC/CS,eAAgB,IAAMA,GACtBC,UAAW,IAAMA,GACjBC,SAAU,IAAMA,GAChBC,WAAY,IAAMA,GAClBhM,SAAU,IAAMA,GAChB3H,cAAe,IAAMA,GACrB4T,eAAgB,IAAMA,GACtBC,YAAa,IAAMA,GACnBC,gBAAiB,IAAMA,GACvBC,QAAS,IAAMA,GACfC,kBAAmB,IAAMA,GACzBC,aAAc,IAAMA,GACpBC,IAAK,IAAMA,GACXC,mBAAoB,IAAMA,GAC1BC,YAAa,IAAMA,GACnBC,WAAY,IAAMA,KAEnB,SAASX,GAASY,GACjB,MAAMC,EAAU,YAAYC,GAC3B,OAAOC,QAAQC,UAAUJ,EAAKE,2BAAmCD,aAAuBD,EACzF,EAIA,OAHAhG,OAAOwE,eAAeyB,EAAS,OAAQ,CAAE/b,MAAO8b,EAAIhI,OACpDgC,OAAOqG,eAAeJ,EAASD,GAC/BC,EAAQ3W,UAAY0W,EAAI1W,UACjB2W,CACR,CAMA,SAASf,GAAeoB,EAAK5T,EAAK6T,GACjC,MAAO,GAAGnY,OAAOkY,EAAIva,MAAM,EAAG2G,GAAM6T,EAAaD,EAAIva,MAAM2G,EAAM,GAClE,CAEA,SAASgT,GAAkBc,GAC1B,QAAIA,GAAK,OAASA,GAAK,WACnBA,GAAK,OAASA,GAAK,YACH,OAAfA,GAAwC,QAAX,MAAJA,QAC1BA,GAAK,GAAKA,GAAK,KACT,KAANA,MACAA,GAAK,IAAMA,GAAK,QAChBA,GAAK,KAAOA,GAAK,QACjBA,EAAI,cAET,CAKA,SAAS9U,GAAc8U,GACtB,GAAIA,EAAI,MAAO,CAEd,MAAMC,EAAa,QADnBD,GAAK,QAC4B,IAC3BE,EAAa,OAAa,KAAJF,GAC5B,OAAOhb,OAAOC,aAAagb,EAAYC,EACxC,CACA,OAAOlb,OAAOC,aAAa+a,EAC5B,CACA,IAAIG,GAAiB,6CACjBC,GAAkB,IAAIxM,OAAO,GAAGuM,GAAepS,UAAU,6BAA6BA,SAAU,MAChGsS,GAAyB,sCAY7B,SAASd,GAAWzM,GACnB,OAAIA,EAAI7L,QAAQ,MAAQ,EAAU6L,EAC3BA,EAAIjP,QAAQsc,GAAgB,KACpC,CAKA,SAASb,GAAYxM,GACpB,OAAIA,EAAI7L,QAAQ,MAAQ,GAAK6L,EAAI7L,QAAQ,KAAO,EAAU6L,EACnDA,EAAIjP,QAAQuc,IAAiB,SAAS5W,EAAO8W,EAASC,GAC5D,OAAID,GAtBN,SAA8B9W,EAAOgO,GACpC,GAA2B,KAAvBA,EAAKpS,WAAW,IAAaib,GAAuB/Z,KAAKkR,GAAO,CACnE,MAAMhR,EAAiC,MAA1BgR,EAAK,GAAGlO,cAAwBzD,SAAS2R,EAAKjS,MAAM,GAAI,IAAMM,SAAS2R,EAAKjS,MAAM,GAAI,IACnG,OAAI2Z,GAAkB1Y,GAAc0E,GAAc1E,GAC3CgD,CACR,CACA,MAAMgX,EAAU9P,GAAiBlH,GACjC,OAAIgX,IAAYhX,EAAcgX,EACvBhX,CACR,CAcSiX,CAAqBjX,EAAO+W,EACpC,GACD,CACA,IAAIG,GAAsB,SACtBC,GAAyB,UACzBC,GAAoB,CACvB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAM,UAEP,SAASC,GAAkB9b,GAC1B,OAAO6b,GAAkB7b,EAC1B,CAEA,SAAS8Z,GAAW/L,GACnB,OAAI4N,GAAoBpa,KAAKwM,GAAaA,EAAIjP,QAAQ8c,GAAwBE,IACvE/N,CACR,CACA,IAAIgO,GAAmB,uBAEvB,SAASjO,GAASC,GACjB,OAAOA,EAAIjP,QAAQid,GAAkB,OACtC,CAEA,SAAS7B,GAAQzY,GAChB,OAAQA,GACP,KAAK,EACL,KAAK,GAAI,OAAO,EAEjB,OAAO,CACR,CAMA,SAAS2Y,GAAa3Y,GACrB,GAAIA,GAAQ,MAAQA,GAAQ,KAAM,OAAO,EACzC,OAAQA,GACP,KAAK,EACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,MAAO,OAAO,EAEpB,OAAO,CACR,CAMA,SAASuY,GAAYha,GACpB,OAAOgc,EAAUza,KAAKvB,IAAOic,EAAU1a,KAAKvB,EAC7C,CAEA,SAASia,GAAgBxY,GACxB,OAAOuY,GAAY7T,GAAc1E,GAClC,CAYA,SAASsY,GAAe/Z,GACvB,OAAQA,GACP,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACL,KAAK,IAAK,OAAO,EACjB,QAAS,OAAO,EAElB,CAEA,SAASsa,GAAmBvM,GAE3B,OADAA,EAAMA,EAAI5O,OAAOL,QAAQ,OAAQ,MACtByF,cAAchE,aAC1B,CACA,SAAS2b,GAAiBjB,GACzB,OAAa,KAANA,GAAkB,IAANA,GAAiB,KAANA,GAAkB,KAANA,CAC3C,CAKA,SAASrB,GAAU7L,GAClB,IAAIrG,EAAQ,EACZ,KAAOA,EAAQqG,EAAI3N,QAAsB8b,GAAiBnO,EAAI1N,WAAWqH,IAA9CA,KAC3B,IAAIM,EAAM+F,EAAI3N,OAAS,EACvB,KAAO4H,GAAON,GAAmBwU,GAAiBnO,EAAI1N,WAAW2H,IAA5CA,KACrB,OAAO+F,EAAIvN,MAAMkH,EAAOM,EAAM,EAC/B,CAKA,IAAIqS,GAAM,CACT8B,QACAC,WAKD,SAASC,GAAeC,EAAO5U,EAAO6U,GACrC,IAAI/N,EAAOgO,EAAOC,EAAQC,EAC1B,MAAMzH,EAAMqH,EAAMK,OACZC,EAASN,EAAMnV,IAGrB,IAFAmV,EAAMnV,IAAMO,EAAQ,EACpB8G,EAAQ,EACD8N,EAAMnV,IAAM8N,GAAK,CAEvB,GADAwH,EAASH,EAAMvB,IAAI1a,WAAWic,EAAMnV,KACrB,KAAXsV,IACHjO,IACc,IAAVA,GAAa,CAChBgO,GAAQ,EACR,KACD,CAID,GAFAE,EAAUJ,EAAMnV,IAChBmV,EAAMO,GAAGC,OAAOC,UAAUT,GACX,KAAXG,EACH,GAAIC,IAAYJ,EAAMnV,IAAM,EAAGqH,SAC1B,GAAI+N,EAER,OADAD,EAAMnV,IAAMyV,GACL,CAGV,CACA,IAAII,GAAW,EAGf,OAFIR,IAAOQ,EAAWV,EAAMnV,KAC5BmV,EAAMnV,IAAMyV,EACLI,CACR,CAIA,SAASC,GAAqBlP,EAAKrG,EAAOuN,GACzC,IAAIxT,EACA0F,EAAMO,EACV,MAAM/G,EAAS,CACduc,IAAI,EACJ/V,IAAK,EACL4G,IAAK,IAEN,GAA4B,KAAxBA,EAAI1N,WAAW8G,GAAa,CAE/B,IADAA,IACOA,EAAM8N,GAAK,CAEjB,GADAxT,EAAOsM,EAAI1N,WAAW8G,GACT,KAAT1F,EAAa,OAAOd,EACxB,GAAa,KAATc,EAAa,OAAOd,EACxB,GAAa,KAATc,EAIH,OAHAd,EAAOwG,IAAMA,EAAM,EACnBxG,EAAOoN,IAAMwM,GAAYxM,EAAIvN,MAAMkH,EAAQ,EAAGP,IAC9CxG,EAAOuc,IAAK,EACLvc,EAEK,KAATc,GAAe0F,EAAM,EAAI8N,EAC5B9N,GAAO,EAGRA,GACD,CACA,OAAOxG,CACR,CACA,IAAI6N,EAAQ,EACZ,KAAOrH,EAAM8N,IACZxT,EAAOsM,EAAI1N,WAAW8G,GACT,KAAT1F,MACAA,EAAO,IAAe,MAATA,IACjB,GAAa,KAATA,GAAe0F,EAAM,EAAI8N,EAA7B,CACC,GAAgC,KAA5BlH,EAAI1N,WAAW8G,EAAM,GAAW,CACnCA,IACA,QACD,CACAA,GAAO,CAER,KAPA,CAQA,GAAa,KAAT1F,IACH+M,IACIA,EAAQ,IAAI,OAAO7N,EAExB,GAAa,KAATc,EAAa,CAChB,GAAc,IAAV+M,EAAa,MACjBA,GACD,CACArH,GATA,CAWD,OAAIO,IAAUP,GACA,IAAVqH,IACJ7N,EAAOoN,IAAMwM,GAAYxM,EAAIvN,MAAMkH,EAAOP,IAC1CxG,EAAOwG,IAAMA,EACbxG,EAAOuc,IAAK,GAJcvc,CAM3B,CASA,SAASwc,GAAepP,EAAKrG,EAAOuN,EAAKmI,GACxC,IAAI3b,EACA0F,EAAMO,EACV,MAAM4U,EAAQ,CACbY,IAAI,EACJG,cAAc,EACdlW,IAAK,EACL4G,IAAK,GACL0O,OAAQ,GAET,GAAIW,EACHd,EAAMvO,IAAMqP,EAAWrP,IACvBuO,EAAMG,OAASW,EAAWX,WACpB,CACN,GAAItV,GAAO8N,EAAK,OAAOqH,EACvB,IAAIG,EAAS1O,EAAI1N,WAAW8G,GAC5B,GAAe,KAAXsV,GAA4B,KAAXA,GAA4B,KAAXA,EAAe,OAAOH,EAC5D5U,IACAP,IACe,KAAXsV,IAAeA,EAAS,IAC5BH,EAAMG,OAASA,CAChB,CACA,KAAOtV,EAAM8N,GAAK,CAEjB,GADAxT,EAAOsM,EAAI1N,WAAW8G,GAClB1F,IAAS6a,EAAMG,OAIlB,OAHAH,EAAMnV,IAAMA,EAAM,EAClBmV,EAAMvO,KAAOwM,GAAYxM,EAAIvN,MAAMkH,EAAOP,IAC1CmV,EAAMY,IAAK,EACJZ,EACD,GAAa,KAAT7a,GAAgC,KAAjB6a,EAAMG,OAAe,OAAOH,EACpC,KAAT7a,GAAe0F,EAAM,EAAI8N,GAAK9N,IACvCA,GACD,CAGA,OAFAmV,EAAMe,cAAe,EACrBf,EAAMvO,KAAOwM,GAAYxM,EAAIvN,MAAMkH,EAAOP,IACnCmV,CACR,CASA,IAAIgB,kBAAkCpE,GAAY,CACjD+D,qBAAsB,IAAMA,GAC5BZ,eAAgB,IAAMA,GACtBc,eAAgB,IAAMA,KAIvB,SAASI,GAAQC,GAEhB,OAAOD,GAAU,mBAAqB/D,QAAU,iBAAmBA,OAAOiE,SAAW,SAASD,GAC7F,cAAcA,CACf,EAAI,SAASA,GACZ,OAAOA,GAAK,mBAAqBhE,QAAUgE,EAAE5P,cAAgB4L,QAAUgE,IAAMhE,OAAOzV,UAAY,gBAAkByZ,CACnH,EAAGD,GAAQC,EACZ,CAeA,SAASE,GAAcpF,GACtB,IAAIvY,EAbL,SAAqBuY,EAAGqF,GACvB,GAAI,UAAYJ,GAAQjF,KAAOA,EAAG,OAAOA,EACzC,IAAIsF,EAAItF,EAAEkB,OAAOqE,aACjB,QAAI,IAAWD,EAAG,CACjB,IAAI7d,EAAI6d,EAAEE,KAAKxF,EAAGqF,GAClB,GAAI,UAAYJ,GAAQxd,GAAI,OAAOA,EACnC,MAAM,IAAIge,UAAU,+CACrB,CACA,OAAQ,WAAaJ,EAAI1d,OAAS+d,QAAQ1F,EAC3C,CAISuF,CAAYvF,EAAG,UACvB,MAAO,UAAYiF,GAAQxd,GAAKA,EAAIA,EAAI,EACzC,CAGA,SAASke,GAAgBL,EAAGD,EAAGrF,GAC9B,OAAQqF,EAAID,GAAcC,MAAOC,EAAInJ,OAAOwE,eAAe2E,EAAGD,EAAG,CAChEhf,MAAO2Z,EACPiB,YAAY,EACZ2E,cAAc,EACdC,UAAU,IACNP,EAAED,GAAKrF,EAAGsF,CAChB,CAOA,IAAIQ,GAAQ,MACX,WAAAxQ,CAAYkJ,EAAMuH,EAAKC,GACtBL,GACCzb,KAIA,MACA,MAEDyb,GACCzb,KAIA,QACA,GAEDyb,GACCzb,KAIA,WACA,MAEDyb,GACCzb,KAKA,UACA,IAEDyb,GACCzb,KAIA,SACA,IAEDyb,GACCzb,KAQA,OACA,IAEDyb,GACCzb,KAKA,SACA,GAEDyb,GACCzb,KAKA,UACA,GAEDA,KAAKsU,KAAOA,EACZtU,KAAK6b,IAAMA,EACX7b,KAAK+b,MAAQ,KACb/b,KAAK8b,QAAUA,EACf9b,KAAKgc,KAAO,IACb,CAIA,SAAAC,CAAUhM,GACT,IAAKjQ,KAAK+b,MAAO,OAAO,EACxB,MAAMA,EAAQ/b,KAAK+b,MACnB,IAAK,IAAIxe,EAAI,EAAG8V,EAAM0I,EAAMne,OAAQL,EAAI8V,EAAK9V,IAAK,GAAIwe,EAAMxe,GAAG,KAAO0S,EAAM,OAAO1S,EACnF,OAAO,CACR,CAIA,QAAA2e,CAASC,GACJnc,KAAK+b,MAAO/b,KAAK+b,MAAMpe,KAAKwe,GAC3Bnc,KAAK+b,MAAQ,CAACI,EACpB,CAIA,OAAAC,CAAQnM,EAAM9T,GACb,MAAMkgB,EAAMrc,KAAKic,UAAUhM,GACrBkM,EAAW,CAAClM,EAAM9T,GACpBkgB,EAAM,EAAGrc,KAAKkc,SAASC,GACtBnc,KAAK+b,MAAMM,GAAOF,CACxB,CAIA,OAAAG,CAAQrM,GACP,MAAMoM,EAAMrc,KAAKic,UAAUhM,GAC3B,IAAI9T,EAAQ,KAEZ,OADIkgB,GAAO,IAAGlgB,EAAQ6D,KAAK+b,MAAMM,GAAK,IAC/BlgB,CACR,CAKA,QAAAogB,CAAStM,EAAM9T,GACd,MAAMkgB,EAAMrc,KAAKic,UAAUhM,GACvBoM,EAAM,EAAGrc,KAAKkc,SAAS,CAACjM,EAAM9T,IAC7B6D,KAAK+b,MAAMM,GAAK,GAAK,GAAGrc,KAAK+b,MAAMM,GAAK,MAAMlgB,GACpD,GAmBGqgB,GAAQ,MACX,WAAApR,GACCqQ,GACCzb,KAEA,YACA,IAEDyb,GACCzb,KAEA,YACA,KAEF,CAEA,QAAAyc,CAASxM,GACR,IAAK,IAAI1S,EAAI,EAAGA,EAAIyC,KAAK0c,UAAU9e,OAAQL,IAAK,GAAIyC,KAAK0c,UAAUnf,GAAG0S,OAASA,EAAM,OAAO1S,EAC5F,OAAO,CACR,CAEA,WAAAof,GACC,MAAMC,iBAAyB,IAAI/f,IACnCmD,KAAK0c,UAAUxL,SAAS2L,IAClBA,EAAKC,SACVD,EAAKE,IAAI7L,SAAS8L,IACbA,GAASJ,EAAO9f,IAAIkgB,EAAQ,GAC/B,IAEHhd,KAAKid,UAAYhL,OAAOiL,OAAO,MAC/Bld,KAAKid,UAAU,IAAM,GACrBjd,KAAK0c,UAAUxL,SAAS2L,IACnBA,EAAKC,SAAS9c,KAAKid,UAAU,IAAItf,KAAKkf,EAAKM,GAAG,IAEnDP,EAAO1L,SAASkM,IACfpd,KAAKid,UAAUG,GAAS,GACxBpd,KAAK0c,UAAUxL,SAAS2L,IACnBA,EAAKC,SAAWD,EAAKE,IAAIrd,QAAQ0d,IAAU,GAAGpd,KAAKid,UAAUG,GAAOzf,KAAKkf,EAAKM,GAAG,GACpF,GAEJ,CAeA,EAAAE,CAAGpN,EAAMkN,EAAIrL,EAAU,CAAA,GACtB,MAAM9L,EAAQhG,KAAKyc,SAASxM,GAC5B,IAAc,IAAVjK,EAAc,MAAM,IAAIsX,MAAM,0BAA0BrN,KAC5DjQ,KAAK0c,UAAU1W,GAAOmX,GAAKA,EAC3Bnd,KAAK0c,UAAU1W,GAAO+W,IAAMjL,EAAQiL,KAAO,GAC3C/c,KAAKid,UAAY,IAClB,CAeA,MAAAM,CAAOC,EAAYC,EAAUN,EAAIrL,EAAU,CAAA,GAC1C,MAAM9L,EAAQhG,KAAKyc,SAASe,GAC5B,IAAc,IAAVxX,EAAc,MAAM,IAAIsX,MAAM,0BAA0BE,KAC5Dxd,KAAK0c,UAAU1G,OAAOhQ,EAAO,EAAG,CAC/BiK,KAAMwN,EACNX,SAAS,EACTK,KACAJ,IAAKjL,EAAQiL,KAAO,KAErB/c,KAAKid,UAAY,IAClB,CAeA,KAAAS,CAAMC,EAAWF,EAAUN,EAAIrL,EAAU,CAAA,GACxC,MAAM9L,EAAQhG,KAAKyc,SAASkB,GAC5B,IAAc,IAAV3X,EAAc,MAAM,IAAIsX,MAAM,0BAA0BK,KAC5D3d,KAAK0c,UAAU1G,OAAOhQ,EAAQ,EAAG,EAAG,CACnCiK,KAAMwN,EACNX,SAAS,EACTK,KACAJ,IAAKjL,EAAQiL,KAAO,KAErB/c,KAAKid,UAAY,IAClB,CAeA,IAAAtf,CAAK8f,EAAUN,EAAIrL,EAAU,CAAA,GAC5B9R,KAAK0c,UAAU/e,KAAK,CACnBsS,KAAMwN,EACNX,SAAS,EACTK,KACAJ,IAAKjL,EAAQiL,KAAO,KAErB/c,KAAKid,UAAY,IAClB,CASA,MAAAW,CAAOpK,EAAMqK,GAAgB,GACvBnK,MAAMC,QAAQH,KAAOA,EAAO,CAACA,IAClC,MAAMrV,EAAS,GAWf,OAVAqV,EAAKtC,SAASjB,IACb,MAAMoM,EAAMrc,KAAKyc,SAASxM,GAC1B,GAAIoM,EAAM,EAAG,CACZ,GAAIwB,EAAe,OACnB,MAAM,IAAIP,MAAM,oCAAoCrN,IACrD,CACAjQ,KAAK0c,UAAUL,GAAKS,SAAU,EAC9B3e,EAAOR,KAAKsS,EAAK,IAElBjQ,KAAKid,UAAY,KACV9e,CACR,CAOA,UAAA2f,CAAWtK,EAAMqK,GAAgB,GAC3BnK,MAAMC,QAAQH,KAAOA,EAAO,CAACA,IAClCxT,KAAK0c,UAAUxL,SAAS2L,IACvBA,EAAKC,SAAU,CAAK,IAErB9c,KAAK4d,OAAOpK,EAAMqK,EACnB,CASA,OAAAE,CAAQvK,EAAMqK,GAAgB,GACxBnK,MAAMC,QAAQH,KAAOA,EAAO,CAACA,IAClC,MAAMrV,EAAS,GAWf,OAVAqV,EAAKtC,SAASjB,IACb,MAAMoM,EAAMrc,KAAKyc,SAASxM,GAC1B,GAAIoM,EAAM,EAAG,CACZ,GAAIwB,EAAe,OACnB,MAAM,IAAIP,MAAM,oCAAoCrN,IACrD,CACAjQ,KAAK0c,UAAUL,GAAKS,SAAU,EAC9B3e,EAAOR,KAAKsS,EAAK,IAElBjQ,KAAKid,UAAY,KACV9e,CACR,CAQA,QAAA6f,CAASC,GAER,OADKje,KAAKid,WAAWjd,KAAK2c,cACnB3c,KAAKid,UAAUgB,IAAc,EACrC,GAIGC,GAAgB,CACpBA,YAA4B,SAASC,EAAQ9B,EAAKvK,EAASsM,EAAKC,GAC/D,MAAMC,EAAQH,EAAO9B,GACrB,MAAO,QAAQgC,EAAIE,YAAYD,MAAUhH,GAAWgH,EAAME,iBAC3D,EACAN,WAA2B,SAASC,EAAQ9B,EAAKvK,EAASsM,EAAKC,GAC9D,MAAMC,EAAQH,EAAO9B,GACrB,MAAO,OAAOgC,EAAIE,YAAYD,YAAgBhH,GAAW6G,EAAO9B,GAAKmC,yBACtE,EACAN,MAAsB,SAASC,EAAQ9B,EAAKvK,EAASsM,EAAKC,GACzD,MAAMC,EAAQH,EAAO9B,GACfoC,EAAOH,EAAMG,KAAO1G,GAAYuG,EAAMG,MAAM9hB,OAAS,GAC3D,IAOI+hB,EAPAC,EAAW,GACXC,EAAY,GAChB,GAAIH,EAAM,CACT,MAAMI,EAAMJ,EAAK9c,MAAM,UACvBgd,EAAWE,EAAI,GACfD,EAAYC,EAAI7gB,MAAM,GAAGiF,KAAK,GAC/B,CAIA,GAFuByb,EAAnB5M,EAAQgN,WAAyBhN,EAAQgN,UAAUR,EAAME,QAASG,EAAUC,IAC7DtH,GAAWgH,EAAME,SACA,IAAhCE,EAAYhf,QAAQ,QAAe,OAAOgf,EAAc,KAC5D,GAAID,EAAM,CACT,MAAMlhB,EAAI+gB,EAAMrC,UAAU,SACpB8C,EAAWT,EAAMvC,MAAQuC,EAAMvC,MAAM/d,QAAU,GACjDT,EAAI,EAAGwhB,EAASphB,KAAK,CAAC,QAAS,GAAGmU,EAAQkN,aAAaL,OAE1DI,EAASxhB,GAAK,CAACwhB,EAASxhB,GAAG,GAAIwhB,EAASxhB,GAAG,IAC3CwhB,EAASxhB,GAAG,IAAM,IAAIuU,EAAQkN,aAAaL,KAE5C,MAAMM,EAAW,CAAElD,MAAOgD,GAC1B,MAAO,aAAaV,EAAIE,YAAYU,MAAaP,kBAClD,CACA,MAAO,aAAaL,EAAIE,YAAYD,MAAUI,kBAC/C,EACAR,MAAsB,SAASC,EAAQ9B,EAAKvK,EAASsM,EAAKC,GACzD,MAAMC,EAAQH,EAAO9B,GAErB,OADAiC,EAAMvC,MAAMuC,EAAMrC,UAAU,QAAQ,GAAKoC,EAAIa,mBAAmBZ,EAAMa,SAAUrN,EAASsM,GAClFC,EAAIe,YAAYjB,EAAQ9B,EAAKvK,EACrC,EACAoM,UAA0B,SAASC,EAAQ9B,EAAKvK,GAC/C,OAAOA,EAAQuN,SAAW,WAAa,QACxC,EACAnB,UAA0B,SAASC,EAAQ9B,EAAKvK,GAC/C,OAAOA,EAAQwN,OAASxN,EAAQuN,SAAW,WAAa,SAAW,IACpE,EACAnB,KAAqB,SAASC,EAAQ9B,GACrC,OAAO/E,GAAW6G,EAAO9B,GAAKmC,QAC/B,EACAN,WAA2B,SAASC,EAAQ9B,GAC3C,OAAO8B,EAAO9B,GAAKmC,OACpB,EACAN,YAA4B,SAASC,EAAQ9B,GAC5C,OAAO8B,EAAO9B,GAAKmC,OACpB,GAQIe,GAAW,MACd,WAAAnU,GACCqQ,GACCzb,KA0BA,QACAiS,OAAOuN,OAAO,CAAA,EAAItB,IAEpB,CAIA,WAAAK,CAAYD,GACX,IAAI/gB,EAAGa,EAAGD,EACV,IAAKmgB,EAAMvC,MAAO,MAAO,GAEzB,IADA5d,EAAS,GACJZ,EAAI,EAAGa,EAAIkgB,EAAMvC,MAAMne,OAAQL,EAAIa,EAAGb,IAAKY,GAAU,IAAImZ,GAAWgH,EAAMvC,MAAMxe,GAAG,QAAQ+Z,GAAW7Z,OAAO6gB,EAAMvC,MAAMxe,GAAG,QACjI,OAAOY,CACR,CAKA,WAAAihB,CAAYjB,EAAQ9B,EAAKvK,GACxB,MAAMwM,EAAQH,EAAO9B,GACrB,IAAIle,EAAS,GACb,GAAImgB,EAAMmB,OAAQ,MAAO,GACzB,IAAIC,EAAOrD,EAAM,EACjB,KAAOqD,GAAQ,GAAKvB,EAAOuB,GAAMD,QAAmC,IAAzBtB,EAAOuB,GAAM5D,SAAe4D,IACnEpB,EAAMqB,QAA2B,IAAlBrB,EAAMxC,SAAkB4D,GAAQ,GAAKvB,EAAOuB,GAAMD,SAAmC,IAAzBtB,EAAOuB,GAAM5D,UAAgB3d,GAAU,MACtHA,KAA6B,IAAlBmgB,EAAMxC,QAAiB,KAAO,KAAOwC,EAAMzC,IACtD1d,GAAU6B,KAAKue,YAAYD,GACL,IAAlBA,EAAMxC,SAAiBhK,EAAQuN,WAAUlhB,GAAU,MACvD,IAAIyhB,GAAS,EACb,GAAItB,EAAMqB,QACTC,GAAS,EACa,IAAlBtB,EAAMxC,SAAe,CACxB,IAAIpW,EAAO2W,EAAM,EACjB,KAAO3W,EAAOyY,EAAOvgB,QAAUugB,EAAOzY,GAAM+Z,QAAmC,IAAzBtB,EAAOzY,GAAMoW,SAAepW,IAClF,GAAIA,EAAOyY,EAAOvgB,OAAQ,CACzB,MAAMiiB,EAAY1B,EAAOzY,IACF,WAAnBma,EAAUvL,MAAqBuL,EAAUJ,aACpCI,EAAU/D,SAAkB+D,EAAUhE,MAAQyC,EAAMzC,OADR+D,GAAS,EAE/D,CACD,CAGD,OADAzhB,GAAUyhB,EAAS,MAAQ,IACpBzhB,CACR,CAIA,YAAA2hB,CAAa3B,EAAQrM,EAASsM,GAC7B,IAAIjgB,EAAS,GACb,MAAM4hB,EAAQ/f,KAAK+f,MACnB,IAAK,IAAIxiB,EAAI,EAAG8V,EAAM8K,EAAOvgB,OAAQL,EAAI8V,EAAK9V,IAAK,CAClD,MAAM+W,EAAO6J,EAAO5gB,GAAG+W,UACI,IAAhByL,EAAMzL,GAAuBnW,GAAU4hB,EAAMzL,GAAM6J,EAAQ5gB,EAAGuU,EAASsM,EAAKpe,MAClF7B,GAAU6B,KAAKof,YAAYjB,EAAQ5gB,EAAGuU,EAC5C,CACA,OAAO3T,CACR,CAMA,kBAAA+gB,CAAmBf,EAAQrM,EAASsM,GACnC,IAAIjgB,EAAS,GACb,IAAK,IAAIZ,EAAI,EAAG8V,EAAM8K,EAAOvgB,OAAQL,EAAI8V,EAAK9V,IAAK,OAAQ4gB,EAAO5gB,GAAG+W,MACpE,IAAK,OACL,IAAK,cAML,IAAK,cACL,IAAK,aACJnW,GAAUggB,EAAO5gB,GAAGihB,QACpB,MAND,IAAK,QACJrgB,GAAU6B,KAAKkf,mBAAmBf,EAAO5gB,GAAG4hB,SAAUrN,EAASsM,GAC/D,MAKD,IAAK,YACL,IAAK,YAAajgB,GAAU,KAE7B,OAAOA,CACR,CAKA,MAAA6hB,CAAO7B,EAAQrM,EAASsM,GACvB,IAAIjgB,EAAS,GACb,MAAM4hB,EAAQ/f,KAAK+f,MACnB,IAAK,IAAIxiB,EAAI,EAAG8V,EAAM8K,EAAOvgB,OAAQL,EAAI8V,EAAK9V,IAAK,CAClD,MAAM+W,EAAO6J,EAAO5gB,GAAG+W,KACV,WAATA,EAAmBnW,GAAU6B,KAAK8f,aAAa3B,EAAO5gB,GAAG4hB,SAAUrN,EAASsM,QAChD,IAAhB2B,EAAMzL,GAAuBnW,GAAU4hB,EAAMzL,GAAM6J,EAAQ5gB,EAAGuU,EAASsM,EAAKpe,MACvF7B,GAAU6B,KAAKof,YAAYjB,EAAQ5gB,EAAGuU,EAC5C,CACA,OAAO3T,CACR,GAKG8hB,GAAY,MACf,WAAA7U,CAAYmN,EAAK8B,EAAI+D,GACpB3C,GAAgBzb,KAAM,SAAU,IAChCyb,GAAgBzb,KAAM,cAAc,GACpCyb,GAAgBzb,KAAM,QAAS4b,IAC/B5b,KAAKuY,IAAMA,EACXvY,KAAKoe,IAAMA,EACXpe,KAAKqa,GAAKA,CACX,GAIG6F,GAA0B,SAC1BC,GAAU,MA6Cd,SAASC,GAAc7U,GACtB,MAAO,aAAaxM,KAAKwM,EAC1B,CA4FA,IAAI8U,GAAU,+BACVC,GAAsB,gBACtBC,GAAiB,iBACjBC,GAAc,CACjB/H,EAAG,IACH0C,EAAG,IACHsF,GAAI,KAEL,SAASC,GAAUze,EAAOgO,GACzB,OAAOuQ,GAAYvQ,EAAKlO,cACzB,CACA,SAAS4e,GAAeC,GACvB,IAAIC,EAAkB,EACtB,IAAK,IAAItjB,EAAIqjB,EAAahjB,OAAS,EAAGL,GAAK,EAAGA,IAAK,CAClD,MAAM+gB,EAAQsC,EAAarjB,GACR,SAAf+gB,EAAMhK,MAAoBuM,IAAiBvC,EAAME,QAAUF,EAAME,QAAQliB,QAAQikB,GAAgBG,KAClF,cAAfpC,EAAMhK,MAAuC,SAAfgK,EAAMG,MAAiBoC,IACtC,eAAfvC,EAAMhK,MAAwC,SAAfgK,EAAMG,MAAiBoC,GAC3D,CACD,CACA,SAASC,GAAaF,GACrB,IAAIC,EAAkB,EACtB,IAAK,IAAItjB,EAAIqjB,EAAahjB,OAAS,EAAGL,GAAK,EAAGA,IAAK,CAClD,MAAM+gB,EAAQsC,EAAarjB,GACR,SAAf+gB,EAAMhK,MAAoBuM,GACzBR,GAAQthB,KAAKuf,EAAME,WAAUF,EAAME,QAAUF,EAAME,QAAQliB,QAAQ,OAAQ,KAAKA,QAAQ,UAAW,KAAKA,QAAQ,WAAY,QAAQA,QAAQ,cAAe,UAAUA,QAAQ,SAAU,KAAKA,QAAQ,0BAA2B,OAAOA,QAAQ,qBAAsB,OAAOA,QAAQ,6BAA8B,QAEnS,cAAfgiB,EAAMhK,MAAuC,SAAfgK,EAAMG,MAAiBoC,IACtC,eAAfvC,EAAMhK,MAAwC,SAAfgK,EAAMG,MAAiBoC,GAC3D,CACD,CAYA,IAAIE,GAAgB,OAChBC,GAAW,QAGf,SAASC,GAAcC,EAAOC,EAAOvjB,GACpC,KAAOsjB,EAAMtjB,OAASA,GAAQ,CAC7B,MAAMuT,EAAO+P,EAAME,MACfjQ,EAAKkQ,cAAeF,EAAMpc,OAASoM,EAAKmQ,iBACvCH,EAAMI,OAASpQ,EAAKmQ,gBAC1B,CACD,CACA,SAASE,GAAeC,EAAcC,EAAU/c,EAAKnH,GAC/CikB,EAAaC,KAAWD,EAAaC,GAAY,IACtDD,EAAaC,GAAU/jB,KAAK,CAC3BgH,MACAnH,MAEF,CAYA,SAASmkB,GAAgBxD,EAAQrE,GAChC,IAAInX,EACJ,MAAMue,EAAQ,GACRC,EAAQ,CACbpc,QAAQ,EACRwc,QAAQ,GAEHE,EAAe,CAAA,EACrB,IAAK,IAAIlkB,EAAI,EAAGA,EAAI4gB,EAAOvgB,OAAQL,IAAK,CACvC,MAAM+gB,EAAQH,EAAO5gB,GACfqkB,EAAYzD,EAAO5gB,GAAGyO,MAC5B,IAAKrJ,EAAIue,EAAMtjB,OAAS,EAAG+E,GAAK,KAAYue,EAAMve,GAAGqJ,OAAS4V,GAA3Bjf,KAEnC,GADAse,GAAcC,EAAOC,EAAOxe,EAAI,GACb,SAAf2b,EAAMhK,KAAiB,SAC3B,MAAM9D,EAAO8N,EAAME,QACnB,IAAI7Z,EAAM,EACV,MAAM8N,EAAMjC,EAAK5S,OACV,KAAO+G,EAAM8N,GAAK,CACxBuO,GAASrQ,UAAYhM,EACrB,MAAMmR,EAAIkL,GAASnf,KAAK2O,GACxB,IAAKsF,EAAG,MACR,IAAI+L,GAAU,EACVC,GAAW,EACfnd,EAAMmR,EAAE9P,MAAQ,EAChB,MAAM+b,EAAoB,MAATjM,EAAE,GACnB,IAAIkM,EAAW,GACf,GAAIlM,EAAE9P,MAAQ,GAAK,EAAGgc,EAAWxR,EAAK3S,WAAWiY,EAAE9P,MAAQ,QACtD,IAAKrD,EAAIpF,EAAI,EAAGoF,GAAK,IACF,cAAnBwb,EAAOxb,GAAG2R,MAA2C,cAAnB6J,EAAOxb,GAAG2R,MADpB3R,IAE5B,GAAKwb,EAAOxb,GAAG6b,QAAf,CACAwD,EAAW7D,EAAOxb,GAAG6b,QAAQ3gB,WAAWsgB,EAAOxb,GAAG6b,QAAQ5gB,OAAS,GACnE,KAFwB,CAIzB,IAAIqkB,EAAW,GACf,GAAItd,EAAM8N,EAAKwP,EAAWzR,EAAK3S,WAAW8G,QACrC,IAAKhC,EAAIpF,EAAI,EAAGoF,EAAIwb,EAAOvgB,SACR,cAAnBugB,EAAOxb,GAAG2R,MAA2C,cAAnB6J,EAAOxb,GAAG2R,MADT3R,IAEvC,GAAKwb,EAAOxb,GAAG6b,QAAf,CACAyD,EAAW9D,EAAOxb,GAAG6b,QAAQ3gB,WAAW,GACxC,KAFwB,CAIzB,MAAMqkB,EAAkB3K,GAAeyK,IAAavK,GAAgBuK,GAC9DG,EAAkB5K,GAAe0K,IAAaxK,GAAgBwK,GAC9DG,EAAmBxK,GAAaoK,GAChCK,EAAmBzK,GAAaqK,GAgBtC,GAfII,EAAkBR,GAAU,EACvBM,IACFC,GAAoBF,IAAkBL,GAAU,IAEnDO,EAAkBN,GAAW,EACxBI,IACFG,GAAoBF,IAAkBL,GAAW,IAEvC,KAAbG,GAA4B,MAATnM,EAAE,IACpBkM,GAAY,IAAMA,GAAY,KAAIF,EAAWD,GAAU,GAExDA,GAAWC,IACdD,EAAUK,EACVJ,EAAWK,GAEPN,GAAYC,EAIjB,GAAIA,IACHnf,EAAIof,EAAWZ,EAAMpc,OAASoc,EAAMI,OAChC5e,GAAK,GAAKue,EAAMve,GAAGqJ,QAAU4V,GAFlC,CAGE,MAAMzQ,EAAO+P,EAAMve,GACnB,IAAI2f,EACAC,EACAR,GACHO,EAAYxI,EAAMO,GAAGvI,QAAQ0Q,OAAO,GACpCD,EAAazI,EAAMO,GAAGvI,QAAQ0Q,OAAO,KAErCF,EAAYxI,EAAMO,GAAGvI,QAAQ0Q,OAAO,GACpCD,EAAazI,EAAMO,GAAGvI,QAAQ0Q,OAAO,IAEtChB,GAAeC,EAAclkB,EAAGuY,EAAE9P,MAAOuc,GACzCf,GAAeC,EAActQ,EAAKuQ,SAAUvQ,EAAKsR,WAAYH,GAC7DrB,GAAcC,EAAOC,EAAOxe,EAG9B,MACA,GAAIkf,EAAS,CACZ,GAAIX,EAAMtjB,QA9GI,IA8GmB,OACjCsjB,EAAMvjB,KAAK,CACV+jB,SAAUnkB,EACVklB,WAAY3M,EAAE9P,MACdqb,cAAeU,EACf/V,MAAO4V,EACPN,iBAAkBS,EAAWZ,EAAMpc,OAASoc,EAAMI,SAE/CQ,EAAUZ,EAAMpc,OAASmc,EAAMtjB,OAAS,EACvCujB,EAAMI,OAASL,EAAMtjB,OAAS,CACpC,MAAWkkB,GAAYC,GAAUP,GAAeC,EAAclkB,EAAGuY,EAAE9P,MAzHrD,UAwFT+b,GAAUP,GAAeC,EAAclkB,EAAGuY,EAAE9P,MAxFnC,IA0Hf,CACD,CACAiM,OAAOC,KAAKuP,GAAcvQ,SAAQ,SAASwQ,GAC1C,MAAMrF,EAAMb,OAAOkG,GACnBvD,EAAO9B,GAAKmC,QA9Gd,SAA2BjT,EAAKkW,GAC/B,IAAItjB,EAAS,GACTukB,EAAU,EACdjB,EAAatT,MAAK,CAAClI,EAAGC,IAAMD,EAAEtB,IAAMuB,EAAEvB,MACtC,IAAK,IAAIpH,EAAI,EAAGA,EAAIkkB,EAAa7jB,OAAQL,IAAK,CAC7C,MAAMolB,EAAclB,EAAalkB,GACjCY,GAAUoN,EAAIvN,MAAM0kB,EAASC,EAAYhe,KAAOge,EAAYnlB,GAC5DklB,EAAUC,EAAYhe,IAAM,CAC7B,CACA,OAAOxG,EAASoN,EAAIvN,MAAM0kB,EAC3B,CAoGwBE,CAAkBzE,EAAO9B,GAAKmC,QAASiD,EAAaC,GAC3E,GACD,CAUA,SAASmB,GAAS1E,GACjB,IAAI2E,EAAMC,EACV,MAAMtQ,EAAM0L,EAAOvgB,OACnB,IAAKklB,EAAO,EAAGA,EAAOrQ,EAAKqQ,IAAkC,iBAAtB3E,EAAO2E,GAAMxO,OAAyB6J,EAAO2E,GAAMxO,KAAO,QACjG,IAAKwO,EAAOC,EAAO,EAAGD,EAAOrQ,EAAKqQ,IAAkC,SAAtB3E,EAAO2E,GAAMxO,MAAmBwO,EAAO,EAAIrQ,GAAiC,SAA1B0L,EAAO2E,EAAO,GAAGxO,KAAiB6J,EAAO2E,EAAO,GAAGtE,QAAUL,EAAO2E,GAAMtE,QAAUL,EAAO2E,EAAO,GAAGtE,SAEhMsE,IAASC,IAAM5E,EAAO4E,GAAQ5E,EAAO2E,IACzCC,KAEGD,IAASC,IAAM5E,EAAOvgB,OAASmlB,EACpC,CAuBA,IAAIC,GAAW,CACd,CAAC,YAlWF,SAAmBlJ,GAClB,IAAIvO,EACJA,EAAMuO,EAAMvB,IAAIjc,QAAQ4jB,GAAyB,MACjD3U,EAAMA,EAAIjP,QAAQ6jB,GAAS,KAC3BrG,EAAMvB,IAAMhN,CACb,GA8VC,CAAC,QA3VF,SAAeuO,GACd,IAAIwE,EACAxE,EAAMmJ,YACT3E,EAAQ,IAAIxE,EAAM8B,MAAM,SAAU,GAAI,GACtC0C,EAAME,QAAU1E,EAAMvB,IACtB+F,EAAMtO,IAAM,CAAC,EAAG,GAChBsO,EAAMa,SAAW,GACjBrF,EAAMqE,OAAOxgB,KAAK2gB,IACZxE,EAAMO,GAAGsF,MAAMre,MAAMwY,EAAMvB,IAAKuB,EAAMO,GAAIP,EAAMsE,IAAKtE,EAAMqE,OACnE,GAmVC,CAAC,mBAhVF,SAA0BrE,GACzB,MAAMqE,EAASrE,EAAMqE,OACrB,IAAI4E,EAAO,EACX,IAAK,IAAID,EAAO,EAAGA,EAAO3E,EAAOvgB,OAAQklB,IACd,yBAAtB3E,EAAO2E,GAAMxO,OACbwO,IAASC,IAAM5E,EAAO4E,GAAQ5E,EAAO2E,IACzCC,KAEG5E,EAAOvgB,SAAWmlB,IAAM5E,EAAOvgB,OAASmlB,EAC7C,GAwUC,CAAC,SArUF,SAAgBjJ,GACf,MAAMqE,EAASrE,EAAMqE,OACrB,IAAK,IAAI5gB,EAAI,EAAGa,EAAI+f,EAAOvgB,OAAQL,EAAIa,EAAGb,IAAK,CAC9C,MAAM2lB,EAAM/E,EAAO5gB,GACF,WAAb2lB,EAAI5O,MAAmBwF,EAAMO,GAAGC,OAAOhZ,MAAM4hB,EAAI1E,QAAS1E,EAAMO,GAAIP,EAAMsE,IAAK8E,EAAI/D,SACxF,CACD,GAgUC,CAAC,UAvTF,SAAmBrF,GAClB,MAAMqJ,EAAcrJ,EAAMqE,OAP3B,IAAsB5S,EAQrB,GAAKuO,EAAMO,GAAGvI,QAAQsR,QACtB,IAAK,IAAIzgB,EAAI,EAAGvE,EAAI+kB,EAAYvlB,OAAQ+E,EAAIvE,EAAGuE,IAAK,CACnD,GAA4B,WAAxBwgB,EAAYxgB,GAAG2R,OAAsBwF,EAAMO,GAAG+I,QAAQrkB,KAAKokB,EAAYxgB,GAAG6b,SAAU,SACxF,MAAML,EAASgF,EAAYxgB,GAAGwc,SACxBsC,EAAe,GACrB,IAAI4B,EAAgB,EACpB,IAAK,IAAI9lB,EAAI4gB,EAAOvgB,OAAS,EAAGL,GAAK,EAAGA,IAAK,CAC5C,MAAM+lB,EAAenF,EAAO5gB,GAC5B,GAA0B,eAAtB+lB,EAAahP,MASjB,GAJ0B,gBAAtBgP,EAAahP,OArBE/I,EAsBD+X,EAAa9E,QArB1B,YAAYzf,KAAKwM,IAqBqB8X,EAAgB,GAAGA,IACzDjD,GAAckD,EAAa9E,UAAU6E,OAEtCA,EAAgB,IACM,SAAtBC,EAAahP,MAAmBwF,EAAMO,GAAG+I,QAAQrkB,KAAKukB,EAAa9E,SAAU,CAChF,MAAMhO,EAAO8S,EAAa9E,QAC1B,IAAI+E,EAAQzJ,EAAMO,GAAG+I,QAAQnhB,MAAMuO,GACnC,MAAMgT,EAAQ,GACd,IAAIxX,EAAQsX,EAAatX,MACrB0W,EAAU,EACVa,EAAM3lB,OAAS,GAAwB,IAAnB2lB,EAAM,GAAGvd,OAAezI,EAAI,GAA4B,iBAAvB4gB,EAAO5gB,EAAI,GAAG+W,OAAyBiP,EAAQA,EAAMvlB,MAAM,IACpH,IAAK,IAAIylB,EAAK,EAAGA,EAAKF,EAAM3lB,OAAQ6lB,IAAM,CACzC,MAAMpkB,EAAMkkB,EAAME,GAAIpkB,IAChBqkB,EAAU5J,EAAMO,GAAGsJ,cAActkB,GACvC,IAAKya,EAAMO,GAAGuJ,aAAaF,GAAU,SACrC,IAAIG,EAAUN,EAAME,GAAIjT,KAGnBqT,EAFAN,EAAME,GAAIhS,OACe,YAArB8R,EAAME,GAAIhS,QAAyB,YAAY1S,KAAK8kB,GAC9C/J,EAAMO,GAAGyJ,kBAAkBD,GADuC/J,EAAMO,GAAGyJ,kBAAkB,UAAUD,KAAWvnB,QAAQ,WAAY,IADpHwd,EAAMO,GAAGyJ,kBAAkB,UAAUD,KAAWvnB,QAAQ,aAAc,IAGvG,MAAMqI,EAAM4e,EAAME,GAAIzd,MACtB,GAAIrB,EAAM+d,EAAS,CAClB,MAAMpE,EAAQ,IAAIxE,EAAM8B,MAAM,OAAQ,GAAI,GAC1C0C,EAAME,QAAUhO,EAAKxS,MAAM0kB,EAAS/d,GACpC2Z,EAAMtS,MAAQA,EACdwX,EAAM7lB,KAAK2gB,EACZ,CACA,MAAMyF,EAAU,IAAIjK,EAAM8B,MAAM,YAAa,IAAK,GAClDmI,EAAQhI,MAAQ,CAAC,CAAC,OAAQ2H,IAC1BK,EAAQ/X,MAAQA,IAChB+X,EAAQC,OAAS,UACjBD,EAAQtF,KAAO,OACf+E,EAAM7lB,KAAKomB,GACX,MAAME,EAAU,IAAInK,EAAM8B,MAAM,OAAQ,GAAI,GAC5CqI,EAAQzF,QAAUqF,EAClBI,EAAQjY,MAAQA,EAChBwX,EAAM7lB,KAAKsmB,GACX,MAAMC,EAAU,IAAIpK,EAAM8B,MAAM,aAAc,QAC9CsI,EAAQlY,QAAUA,EAClBkY,EAAQF,OAAS,UACjBE,EAAQzF,KAAO,OACf+E,EAAM7lB,KAAKumB,GACXxB,EAAUa,EAAME,GAAI9S,SACrB,CACA,GAAI+R,EAAUlS,EAAK5S,OAAQ,CAC1B,MAAM0gB,EAAQ,IAAIxE,EAAM8B,MAAM,OAAQ,GAAI,GAC1C0C,EAAME,QAAUhO,EAAKxS,MAAM0kB,GAC3BpE,EAAMtS,MAAQA,EACdwX,EAAM7lB,KAAK2gB,EACZ,CACAmD,EAAa9jB,KAAK,CACjBqI,MAAOzI,EACPimB,SAEF,OAzDC,IADAjmB,IACO4gB,EAAO5gB,GAAGyO,QAAUsX,EAAatX,OAA4B,cAAnBmS,EAAO5gB,GAAG+W,MAAsB/W,GA0DnF,CACA,GAAIkkB,EAAa7jB,OAAS,EAAG,CAC5B,IAAIumB,EAAkBhG,EAAOvgB,OAC7B,IAAK,MAAM+kB,KAAelB,EAAc0C,GAAmBxB,EAAYa,MAAM5lB,OAAS,EACtF,MAAMwmB,EAAY,IAAI1Q,MAAMyQ,GAC5B,IAAIE,EAAmB,EACnBC,EAAgB,EACpB7C,EAAarT,UACb,IAAK,IAAI7Q,EAAI,EAAGA,EAAI4gB,EAAOvgB,OAAQL,IAAK,CACvC,MAAMolB,EAAclB,EAAa4C,GACjC,IAAK1B,aAAiD,EAASA,EAAY3c,SAAWzI,EAAG,CACxF,IAAK,MAAMgnB,KAAQ5B,EAAYa,MAAOY,EAAUE,KAAmBC,EACnEF,GACD,MAAOD,EAAUE,KAAmBnG,EAAO5gB,EAC5C,CACA4lB,EAAYxgB,GAAGwc,SAAWiF,CAC3B,CACD,CACD,GAgOC,CAAC,eA9LF,SAAiBtK,GAChB,IAAI0K,EACJ,GAAK1K,EAAMO,GAAGvI,QAAQ2S,YACtB,IAAKD,EAAS1K,EAAMqE,OAAOvgB,OAAS,EAAG4mB,GAAU,EAAGA,IACjB,WAA9B1K,EAAMqE,OAAOqG,GAAQlQ,OACrBgM,GAAoBvhB,KAAK+a,EAAMqE,OAAOqG,GAAQhG,UAAUmC,GAAe7G,EAAMqE,OAAOqG,GAAQrF,UAC5FkB,GAAQthB,KAAK+a,EAAMqE,OAAOqG,GAAQhG,UAAUsC,GAAahH,EAAMqE,OAAOqG,GAAQrF,UAEpF,GAuLC,CAAC,cAjDF,SAAqBrF,GACpB,GAAKA,EAAMO,GAAGvI,QAAQ2S,YACtB,IAAK,IAAID,EAAS1K,EAAMqE,OAAOvgB,OAAS,EAAG4mB,GAAU,EAAGA,IACrB,WAA9B1K,EAAMqE,OAAOqG,GAAQlQ,MAAsByM,GAAchiB,KAAK+a,EAAMqE,OAAOqG,GAAQhG,UACvFmD,GAAgB7H,EAAMqE,OAAOqG,GAAQrF,SAAUrF,EAEjD,GA4CC,CAAC,YA9BF,SAAmBA,GAClB,IAAIgJ,EAAMC,EACV,MAAMI,EAAcrJ,EAAMqE,OACpB/f,EAAI+kB,EAAYvlB,OACtB,IAAK,IAAI+E,EAAI,EAAGA,EAAIvE,EAAGuE,IAAK,CAC3B,GAA4B,WAAxBwgB,EAAYxgB,GAAG2R,KAAmB,SACtC,MAAM6J,EAASgF,EAAYxgB,GAAGwc,SACxB1M,EAAM0L,EAAOvgB,OACnB,IAAKklB,EAAO,EAAGA,EAAOrQ,EAAKqQ,IACA,iBAAtB3E,EAAO2E,GAAMxO,OAAyB6J,EAAO2E,GAAMxO,KAAO,QAC1D6J,EAAO2E,GAAM3D,UAAU0D,GAAS1E,EAAO2E,GAAM3D,UAElD,IAAK2D,EAAOC,EAAO,EAAGD,EAAOrQ,EAAKqQ,IAAkC,SAAtB3E,EAAO2E,GAAMxO,MAAmBwO,EAAO,EAAIrQ,GAAiC,SAA1B0L,EAAO2E,EAAO,GAAGxO,KAAiB6J,EAAO2E,EAAO,GAAGtE,QAAUL,EAAO2E,GAAMtE,QAAUL,EAAO2E,EAAO,GAAGtE,SAEhMsE,IAASC,IAAM5E,EAAO4E,GAAQ5E,EAAO2E,IACzCC,KAEGD,IAASC,IAAM5E,EAAOvgB,OAASmlB,EACpC,CACD,IAiBI2B,GAAa,MAChB,WAAAtZ,GACCqQ,GACCzb,KAIA,QACA,IAAIwc,IAELf,GAAgBzb,KAAM,QAASigB,IAC/B,IAAK,IAAI1iB,EAAI,EAAGA,EAAIylB,GAASplB,OAAQL,IAAKyC,KAAK2kB,MAAMhnB,KAAKqlB,GAASzlB,GAAG,GAAIylB,GAASzlB,GAAG,GACvF,CAIA,OAAAqnB,CAAQ9K,GACP,MAAMiG,EAAQ/f,KAAK2kB,MAAM3G,SAAS,IAClC,IAAK,IAAIzgB,EAAI,EAAGa,EAAI2hB,EAAMniB,OAAQL,EAAIa,EAAGb,IAAKwiB,EAAMxiB,GAAGuc,EACxD,GAKG+K,GAAa,MAChB,WAAAzZ,CAAYmN,EAAK8B,EAAI+D,EAAKD,GACzB1C,GAAgBzb,KAAM,SAAU,IAChCyb,GAAgBzb,KAAM,SAAU,IAChCyb,GAAgBzb,KAAM,SAAU,IAChCyb,GAAgBzb,KAAM,SAAU,IAChCyb,GAAgBzb,KAAM,UAAW,IACjCyb,GAAgBzb,KAAM,YAAa,GACnCyb,GAAgBzb,KAAM,OAAQ,GAC9Byb,GAAgBzb,KAAM,UAAW,GACjCyb,GAAgBzb,KAAM,SAAS,GAC/Byb,GAAgBzb,KAAM,iBACtByb,GAAgBzb,KAAM,aAAc,QACpCyb,GAAgBzb,KAAM,QAAS,GAC/Byb,GAAgBzb,KAAM,QAAS4b,IAC/B5b,KAAKuY,IAAMA,EACXvY,KAAKqa,GAAKA,EACVra,KAAKoe,IAAMA,EACXpe,KAAKme,OAASA,EACd,MAAM2G,EAAI9kB,KAAKuY,IACf,IAAK,IAAIrT,EAAQ,EAAGP,EAAM,EAAGogB,EAAS,EAAGlc,EAAS,EAAGwK,EAAMyR,EAAElnB,OAAQonB,GAAe,EAAOrgB,EAAM0O,EAAK1O,IAAO,CAC5G,MAAMnH,EAAKsnB,EAAEjnB,WAAW8G,GACxB,IAAKqgB,EAAc,CAClB,GAAItN,GAAQla,GAAK,CAChBunB,IACW,IAAPvnB,EAAUqL,GAAU,EAAIA,EAAS,EAChCA,IACL,QACD,CAAOmc,GAAe,CACvB,CACW,KAAPxnB,GAAamH,IAAQ0O,EAAM,IACnB,KAAP7V,GAAWmH,IACf3E,KAAKilB,OAAOtnB,KAAKuH,GACjBlF,KAAKklB,OAAOvnB,KAAKgH,GACjB3E,KAAKmlB,OAAOxnB,KAAKonB,GACjB/kB,KAAKolB,OAAOznB,KAAKkL,GACjB7I,KAAKqlB,QAAQ1nB,KAAK,GAClBqnB,GAAe,EACfD,EAAS,EACTlc,EAAS,EACT3D,EAAQP,EAAM,EAEhB,CACA3E,KAAKilB,OAAOtnB,KAAKmnB,EAAElnB,QACnBoC,KAAKklB,OAAOvnB,KAAKmnB,EAAElnB,QACnBoC,KAAKmlB,OAAOxnB,KAAK,GACjBqC,KAAKolB,OAAOznB,KAAK,GACjBqC,KAAKqlB,QAAQ1nB,KAAK,GAClBqC,KAAKslB,QAAUtlB,KAAKilB,OAAOrnB,OAAS,CACrC,CACA,IAAAD,CAAK2W,EAAMuH,EAAKC,GACf,MAAMwC,EAAQ,IAAI1C,GAAMtH,EAAMuH,EAAKC,GAMnC,OALAwC,EAAMqB,OAAQ,EACV7D,EAAU,GAAG9b,KAAKgM,QACtBsS,EAAMtS,MAAQhM,KAAKgM,MACf8P,EAAU,GAAG9b,KAAKgM,QACtBhM,KAAKme,OAAOxgB,KAAK2gB,GACVA,CACR,CACA,OAAAiH,CAAQC,GACP,OAAOxlB,KAAKilB,OAAOO,GAAQxlB,KAAKmlB,OAAOK,IAASxlB,KAAKklB,OAAOM,EAC7D,CACA,cAAAC,CAAeC,GACd,IAAK,IAAIjT,EAAMzS,KAAKslB,QAASI,EAAOjT,KAAiBzS,KAAKilB,OAAOS,GAAQ1lB,KAAKmlB,OAAOO,GAAQ1lB,KAAKklB,OAAOQ,IAAhEA,KACzC,OAAOA,CACR,CACA,UAAAC,CAAWhhB,GACV,IAAK,IAAI8N,EAAMzS,KAAKuY,IAAI3a,OAAQ+G,EAAM8N,GAAiBiF,GAAQ1X,KAAKuY,IAAI1a,WAAW8G,IAAxCA,KAC3C,OAAOA,CACR,CACA,cAAAihB,CAAejhB,EAAKkhB,GACnB,GAAIlhB,GAAOkhB,EAAK,OAAOlhB,EACvB,KAAOA,EAAMkhB,OAAUnO,GAAQ1X,KAAKuY,IAAI1a,aAAa8G,IAAO,OAAOA,EAAM,EACzE,OAAOA,CACR,CACA,SAAAmhB,CAAUnhB,EAAK1F,GACd,IAAK,IAAIwT,EAAMzS,KAAKuY,IAAI3a,OAAQ+G,EAAM8N,GAAgBzS,KAAKuY,IAAI1a,WAAW8G,KAAS1F,EAAxC0F,KAC3C,OAAOA,CACR,CACA,aAAAohB,CAAcphB,EAAK1F,EAAM4mB,GACxB,GAAIlhB,GAAOkhB,EAAK,OAAOlhB,EACvB,KAAOA,EAAMkhB,MAAS5mB,IAASe,KAAKuY,IAAI1a,aAAa8G,GAAM,OAAOA,EAAM,EACxE,OAAOA,CACR,CACA,QAAAqhB,CAASC,EAAOzgB,EAAKuf,EAAQmB,GAC5B,GAAID,GAASzgB,EAAK,MAAO,GACzB,MAAM2gB,EAAQ,IAAIzS,MAAMlO,EAAMygB,GAC9B,IAAK,IAAI1oB,EAAI,EAAGioB,EAAOS,EAAOT,EAAOhgB,EAAKggB,IAAQjoB,IAAK,CACtD,IAAI6oB,EAAa,EACjB,MAAMC,EAAYrmB,KAAKilB,OAAOO,GAC9B,IACIzC,EADAuD,EAAQD,EAIZ,IAFkCtD,EAA9ByC,EAAO,EAAIhgB,GAAO0gB,EAAmBlmB,KAAKklB,OAAOM,GAAQ,EACjDxlB,KAAKklB,OAAOM,GACjBc,EAAQvD,GAAQqD,EAAarB,GAAQ,CAC3C,MAAMvnB,EAAKwC,KAAKuY,IAAI1a,WAAWyoB,GAC/B,GAAI5O,GAAQla,GACA,IAAPA,EAAU4oB,GAAc,GAAKA,EAAapmB,KAAKqlB,QAAQG,IAAS,EAC/DY,QACC,MAAIE,EAAQD,EAAYrmB,KAAKmlB,OAAOK,IACtC,MAD6CY,GAC7C,CACLE,GACD,CACyBH,EAAM5oB,GAA3B6oB,EAAarB,EAAmB,IAAIrR,MAAM0S,EAAarB,EAAS,GAAG9hB,KAAK,KAAOjD,KAAKuY,IAAIva,MAAMsoB,EAAOvD,GACzF/iB,KAAKuY,IAAIva,MAAMsoB,EAAOvD,EACvC,CACA,OAAOoD,EAAMljB,KAAK,GACnB,GAKD,SAASsjB,GAAQzM,EAAO0L,GACvB,MAAM7gB,EAAMmV,EAAMmL,OAAOO,GAAQ1L,EAAMqL,OAAOK,GACxC/S,EAAMqH,EAAMoL,OAAOM,GACzB,OAAO1L,EAAMvB,IAAIva,MAAM2G,EAAK8N,EAC7B,CACA,SAAS+T,GAAajb,GACrB,MAAMpN,EAAS,GACTsU,EAAMlH,EAAI3N,OAChB,IAAI+G,EAAM,EACNnH,EAAK+N,EAAI1N,WAAW8G,GACpB8hB,GAAY,EACZ/D,EAAU,EACV5a,EAAU,GACd,KAAOnD,EAAM8N,GACD,MAAPjV,IACEipB,GAKJ3e,GAAWyD,EAAImb,UAAUhE,EAAS/d,EAAM,GACxC+d,EAAU/d,IALVxG,EAAOR,KAAKmK,EAAUyD,EAAImb,UAAUhE,EAAS/d,IAC7CmD,EAAU,GACV4a,EAAU/d,EAAM,IAMlB8hB,EAAmB,KAAPjpB,EACZmH,IACAnH,EAAK+N,EAAI1N,WAAW8G,GAGrB,OADAxG,EAAOR,KAAKmK,EAAUyD,EAAImb,UAAUhE,IAC7BvkB,CACR,CA+SA,SAASwoB,GAAqB7M,EAAO8M,GACpC,MAAMnU,EAAMqH,EAAMoL,OAAO0B,GACzB,IAAIjiB,EAAMmV,EAAMmL,OAAO2B,GAAa9M,EAAMqL,OAAOyB,GACjD,MAAM3M,EAASH,EAAMvB,IAAI1a,WAAW8G,KACpC,OAAe,KAAXsV,GAA4B,KAAXA,GAA4B,KAAXA,GAClCtV,EAAM8N,IACJiF,GAAQoC,EAAMvB,IAAI1a,WAAW8G,KAFyB,EAIrDA,CACR,CACA,SAASkiB,GAAsB/M,EAAO8M,GACrC,MAAM1hB,EAAQ4U,EAAMmL,OAAO2B,GAAa9M,EAAMqL,OAAOyB,GAC/CnU,EAAMqH,EAAMoL,OAAO0B,GACzB,IAAIjiB,EAAMO,EACV,GAAIP,EAAM,GAAK8N,EAAK,OAAO,EAC3B,IAAIjV,EAAKsc,EAAMvB,IAAI1a,WAAW8G,KAC9B,GAAInH,EAAK,IAAMA,EAAK,GAAI,OAAO,EAC/B,OAAS,CACR,GAAImH,GAAO8N,EAAK,OAAO,EAEvB,GADAjV,EAAKsc,EAAMvB,IAAI1a,WAAW8G,OACtBnH,GAAM,IAAMA,GAAM,IAAtB,CAIA,GAAW,KAAPA,GAAoB,KAAPA,EAAW,MAC5B,OAAO,CAFP,CAFC,GAAImH,EAAMO,GAAS,GAAI,OAAO,CAKhC,CACA,OAAIP,EAAM8N,IACTjV,EAAKsc,EAAMvB,IAAI1a,WAAW8G,IACrB+S,GAAQla,KAAY,EAEnBmH,CACR,CAuIA,SAASmiB,GAAQhN,EAAO0L,GACvB,OAAOhT,KAAKqT,IAAI/L,EAAMoL,OAAOM,GAAQ,EAAG1L,EAAMvB,IAAI3a,OACnD,CACA,SAASmpB,GAAejN,EAAOkN,GAC9B,MAAMC,EAAUnN,EAAMwL,QACtB,GAAI0B,GAAYC,GAAWnN,EAAMyL,QAAQyB,GAAW,OAAO,EAC3D,IAAIE,GAAiB,EAGrB,GAFIpN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,UAAY,IAAGD,GAAiB,GAC/DpN,EAAMsL,OAAO4B,GAAY,IAAGE,GAAiB,IAC5CA,EAAgB,CACpB,MAAME,EAAkBtN,EAAMO,GAAGsF,MAAMgF,MAAM3G,SAAS,aAChDqJ,EAAgBvN,EAAMwN,WAC5BxN,EAAMwN,WAAa,YACnB,IAAIC,GAAY,EAChB,IAAK,IAAIhqB,EAAI,EAAGa,EAAIgpB,EAAgBxpB,OAAQL,EAAIa,EAAGb,IAAK,GAAI6pB,EAAgB7pB,GAAGuc,EAAOkN,EAAUC,GAAS,GAAO,CAC/GM,GAAY,EACZ,KACD,CAEA,GADAzN,EAAMwN,WAAaD,EACfE,EAAW,OAAO,CACvB,CACA,OAAOzN,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,EAC9C,CAsHA,IAqEIQ,GAAyB,IAAInb,OAAO,yKAGpCob,GAAiB,CACpB,CACC,6CACA,oCACA,GAED,CACC,QACA,OACA,GAED,CACC,OACA,OACA,GAED,CACC,cACA,KACA,GAED,CACC,eACA,SACA,GAED,CACC,IAAIpb,OAAO,QAnGa,CACzB,UACA,UACA,QACA,OACA,WACA,aACA,OACA,UACA,SACA,MACA,WACA,KACA,UACA,SACA,MACA,MACA,KACA,KACA,WACA,aACA,SACA,SACA,OACA,QACA,WACA,KACA,KACA,KACA,KACA,KACA,KACA,OACA,SACA,KACA,OACA,SACA,SACA,KACA,OACA,OACA,OACA,WACA,MACA,WACA,KACA,WACA,SACA,IACA,QACA,SACA,UACA,UACA,QACA,QACA,KACA,QACA,KACA,QACA,QACA,KACA,QACA,MAqCwCpJ,KAAK,uBAAwB,KACpE,MACA,GAED,CACC,IAAIoJ,OAAO,GAAGmb,GAAuBhhB,eACrC,MACA,IAqJF,IAAIkhB,GAAW,CACd,CACC,QAl2BF,SAAe5N,EAAO8M,EAAWK,EAASU,GACzC,GAAIf,EAAY,EAAIK,EAAS,OAAO,EACpC,IAAID,EAAWJ,EAAY,EAC3B,GAAI9M,EAAMsL,OAAO4B,GAAYlN,EAAMqN,UAAW,OAAO,EACrD,GAAIrN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,WAAa,EAAG,OAAO,EAC1D,IAAIxiB,EAAMmV,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,GAChD,GAAIriB,GAAOmV,EAAMoL,OAAO8B,GAAW,OAAO,EAC1C,MAAMY,EAAU9N,EAAMvB,IAAI1a,WAAW8G,KACrC,GAAgB,MAAZijB,GAA+B,KAAZA,GAA8B,KAAZA,EAAgB,OAAO,EAChE,GAAIjjB,GAAOmV,EAAMoL,OAAO8B,GAAW,OAAO,EAC1C,MAAMa,EAAW/N,EAAMvB,IAAI1a,WAAW8G,KACtC,GAAiB,MAAbkjB,GAAiC,KAAbA,GAAgC,KAAbA,IAAoBnQ,GAAQmQ,GAAW,OAAO,EACzF,GAAgB,KAAZD,GAAkBlQ,GAAQmQ,GAAW,OAAO,EAChD,KAAOljB,EAAMmV,EAAMoL,OAAO8B,IAAW,CACpC,MAAMxpB,EAAKsc,EAAMvB,IAAI1a,WAAW8G,GAChC,GAAW,MAAPnH,GAAqB,KAAPA,GAAoB,KAAPA,IAAcka,GAAQla,GAAK,OAAO,EACjEmH,GACD,CACA,IAAImjB,EAAWvB,GAAQzM,EAAO8M,EAAY,GACtCmB,EAAUD,EAASnmB,MAAM,KAC7B,MAAMqmB,EAAS,GACf,IAAK,IAAIzqB,EAAI,EAAGA,EAAIwqB,EAAQnqB,OAAQL,IAAK,CACxC,MAAMuY,EAAIiS,EAAQxqB,GAAGZ,OACrB,IAAKmZ,EAAG,CACP,GAAU,IAANvY,GAAWA,IAAMwqB,EAAQnqB,OAAS,EAAG,SACpC,OAAO,CACb,CACA,IAAK,WAAWmB,KAAK+W,GAAI,OAAO,EACG,KAA/BA,EAAEjY,WAAWiY,EAAElY,OAAS,GAAWoqB,EAAOrqB,KAAyB,KAApBmY,EAAEjY,WAAW,GAAY,SAAW,SAC1D,KAApBiY,EAAEjY,WAAW,GAAWmqB,EAAOrqB,KAAK,QACxCqqB,EAAOrqB,KAAK,GAClB,CAEA,GADAmqB,EAAWvB,GAAQzM,EAAO8M,GAAWjqB,QACP,IAA1BmrB,EAASpoB,QAAQ,KAAa,OAAO,EACzC,GAAIoa,EAAMsL,OAAOwB,GAAa9M,EAAMqN,WAAa,EAAG,OAAO,EAC3DY,EAAUvB,GAAasB,GACnBC,EAAQnqB,QAAyB,KAAfmqB,EAAQ,IAAWA,EAAQE,QAC7CF,EAAQnqB,QAA0C,KAAhCmqB,EAAQA,EAAQnqB,OAAS,IAAWmqB,EAAQ3G,MAClE,MAAM8G,EAAcH,EAAQnqB,OAC5B,GAAoB,IAAhBsqB,GAAqBA,IAAgBF,EAAOpqB,OAAQ,OAAO,EAC/D,GAAI+pB,EAAQ,OAAO,EACnB,MAAMN,EAAgBvN,EAAMwN,WAC5BxN,EAAMwN,WAAa,QACnB,MAAMF,EAAkBtN,EAAMO,GAAGsF,MAAMgF,MAAM3G,SAAS,cAEhDmK,EAAa,CAACvB,EAAW,GADd9M,EAAMnc,KAAK,aAAc,QAAS,GAE1CqS,IAAMmY,EACGrO,EAAMnc,KAAK,aAAc,QAAS,GAC1CqS,IAAM,CAAC4W,EAAWA,EAAY,GACrB9M,EAAMnc,KAAK,UAAW,KAAM,GACpCqS,IAAM,CAAC4W,EAAWA,EAAY,GACzC,IAAK,IAAIrpB,EAAI,EAAGA,EAAIwqB,EAAQnqB,OAAQL,IAAK,CACxC,MAAM6qB,EAAWtO,EAAMnc,KAAK,UAAW,KAAM,GACzCqqB,EAAOzqB,KAAI6qB,EAASrM,MAAQ,CAAC,CAAC,QAAS,cAAciM,EAAOzqB,QAChE,MAAM8qB,EAAWvO,EAAMnc,KAAK,SAAU,GAAI,GAC1C0qB,EAAS7J,QAAUuJ,EAAQxqB,GAAGZ,OAC9B0rB,EAASlJ,SAAW,GACpBrF,EAAMnc,KAAK,WAAY,MAAM,EAC9B,CAGA,IAAI2qB,EAFJxO,EAAMnc,KAAK,WAAY,MAAM,GAC7Bmc,EAAMnc,KAAK,cAAe,SAAS,GAEnC,IAAI4qB,EAAqB,EACzB,IAAKvB,EAAWJ,EAAY,EAAGI,EAAWC,KACrCnN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,WADeH,IAAY,CAE9D,IAAIO,GAAY,EAChB,IAAK,IAAIhqB,EAAI,EAAGa,EAAIgpB,EAAgBxpB,OAAQL,EAAIa,EAAGb,IAAK,GAAI6pB,EAAgB7pB,GAAGuc,EAAOkN,EAAUC,GAAS,GAAO,CAC/GM,GAAY,EACZ,KACD,CACA,GAAIA,EAAW,MAEf,GADAO,EAAWvB,GAAQzM,EAAOkN,GAAUrqB,QAC/BmrB,EAAU,MACf,GAAIhO,EAAMsL,OAAO4B,GAAYlN,EAAMqN,WAAa,EAAG,MAKnD,GAJAY,EAAUvB,GAAasB,GACnBC,EAAQnqB,QAAyB,KAAfmqB,EAAQ,IAAWA,EAAQE,QAC7CF,EAAQnqB,QAA0C,KAAhCmqB,EAAQA,EAAQnqB,OAAS,IAAWmqB,EAAQ3G,MAClEmH,GAAsBL,EAAcH,EAAQnqB,OACxC2qB,EA9GwB,MA8GsB,MAClD,GAAIvB,IAAaJ,EAAY,EAAG,CACb9M,EAAMnc,KAAK,aAAc,QAAS,GAC1CqS,IAAMsY,EAAa,CAAC1B,EAAY,EAAG,EAC9C,CACkB9M,EAAMnc,KAAK,UAAW,KAAM,GACpCqS,IAAM,CAACgX,EAAUA,EAAW,GACtC,IAAK,IAAIzpB,EAAI,EAAGA,EAAI2qB,EAAa3qB,IAAK,CACrC,MAAMirB,EAAY1O,EAAMnc,KAAK,UAAW,KAAM,GAC1CqqB,EAAOzqB,KAAIirB,EAAUzM,MAAQ,CAAC,CAAC,QAAS,cAAciM,EAAOzqB,QACjE,MAAM8qB,EAAWvO,EAAMnc,KAAK,SAAU,GAAI,GAC1C0qB,EAAS7J,QAAUuJ,EAAQxqB,GAAKwqB,EAAQxqB,GAAGZ,OAAS,GACpD0rB,EAASlJ,SAAW,GACpBrF,EAAMnc,KAAK,WAAY,MAAM,EAC9B,CACAmc,EAAMnc,KAAK,WAAY,MAAM,EAC9B,CASA,OARI2qB,IACHxO,EAAMnc,KAAK,cAAe,SAAS,GACnC2qB,EAAW,GAAKtB,GAEjBlN,EAAMnc,KAAK,cAAe,SAAS,GACnCwqB,EAAW,GAAKnB,EAChBlN,EAAMwN,WAAaD,EACnBvN,EAAM0L,KAAOwB,GACN,CACR,EA4vBE,CAAC,YAAa,cAEf,CAAC,OA3vBF,SAAclN,EAAO8M,EAAWK,GAC/B,GAAInN,EAAMsL,OAAOwB,GAAa9M,EAAMqN,UAAY,EAAG,OAAO,EAC1D,IAAIH,EAAWJ,EAAY,EACvB7D,EAAOiE,EACX,KAAOA,EAAWC,GACjB,GAAInN,EAAMyL,QAAQyB,GACjBA,QADD,CAIA,KAAIlN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,WAAa,GAKhD,MAJCH,IACAjE,EAAOiE,CAHR,CAQDlN,EAAM0L,KAAOzC,EACb,MAAMzE,EAAQxE,EAAMnc,KAAK,aAAc,OAAQ,GAG/C,OAFA2gB,EAAME,QAAU1E,EAAMkM,SAASY,EAAW7D,EAAM,EAAIjJ,EAAMqN,WAAW,GAAS,KAC9E7I,EAAMtO,IAAM,CAAC4W,EAAW9M,EAAM0L,OACvB,CACR,GAuuBC,CACC,QAruBF,SAAe1L,EAAO8M,EAAWK,EAASU,GACzC,IAAIhjB,EAAMmV,EAAMmL,OAAO2B,GAAa9M,EAAMqL,OAAOyB,GAC7CnU,EAAMqH,EAAMoL,OAAO0B,GACvB,GAAI9M,EAAMsL,OAAOwB,GAAa9M,EAAMqN,WAAa,EAAG,OAAO,EAC3D,GAAIxiB,EAAM,EAAI8N,EAAK,OAAO,EAC1B,MAAMwH,EAASH,EAAMvB,IAAI1a,WAAW8G,GACpC,GAAe,MAAXsV,GAA6B,KAAXA,EAAe,OAAO,EAC5C,IAAIwO,EAAM9jB,EACVA,EAAMmV,EAAMgM,UAAUnhB,EAAKsV,GAC3B,IAAI5G,EAAM1O,EAAM8jB,EAChB,GAAIpV,EAAM,EAAG,OAAO,EACpB,MAAM2Q,EAASlK,EAAMvB,IAAIva,MAAMyqB,EAAK9jB,GAC9B+jB,EAAS5O,EAAMvB,IAAIva,MAAM2G,EAAK8N,GACpC,GAAe,KAAXwH,GACCyO,EAAOhpB,QAAQjC,OAAOC,aAAauc,KAAY,EAAG,OAAO,EAE9D,GAAI0N,EAAQ,OAAO,EACnB,IAAIX,EAAWJ,EACX+B,GAAgB,EACpB,MACC3B,MACIA,GAAYC,MAChBtiB,EAAM8jB,EAAM3O,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,GAClDvU,EAAMqH,EAAMoL,OAAO8B,KACfriB,EAAM8N,GAAOqH,EAAMsL,OAAO4B,GAAYlN,EAAMqN,aAChD,GAAIrN,EAAMvB,IAAI1a,WAAW8G,KAASsV,KAC9BH,EAAMsL,OAAO4B,GAAYlN,EAAMqN,WAAa,IAChDxiB,EAAMmV,EAAMgM,UAAUnhB,EAAKsV,GACvBtV,EAAM8jB,EAAMpV,IAChB1O,EAAMmV,EAAM6L,WAAWhhB,GACnBA,EAAM8N,KAAV,CACAkW,GAAgB,EAChB,KAFe,CAIhBtV,EAAMyG,EAAMsL,OAAOwB,GACnB9M,EAAM0L,KAAOwB,GAAY2B,EAAgB,EAAI,GAC7C,MAAMrK,EAAQxE,EAAMnc,KAAK,QAAS,OAAQ,GAK1C,OAJA2gB,EAAMG,KAAOiK,EACbpK,EAAME,QAAU1E,EAAMkM,SAASY,EAAY,EAAGI,EAAU3T,GAAK,GAC7DiL,EAAM0F,OAASA,EACf1F,EAAMtO,IAAM,CAAC4W,EAAW9M,EAAM0L,OACvB,CACR,EA6rBE,CACC,YACA,YACA,aACA,SAGF,CACC,aAlsBF,SAAoB1L,EAAO8M,EAAWK,EAASU,GAC9C,IAAIhjB,EAAMmV,EAAMmL,OAAO2B,GAAa9M,EAAMqL,OAAOyB,GAC7CnU,EAAMqH,EAAMoL,OAAO0B,GACvB,MAAMgC,EAAa9O,EAAMwL,QACzB,GAAIxL,EAAMsL,OAAOwB,GAAa9M,EAAMqN,WAAa,EAAG,OAAO,EAC3D,GAAkC,KAA9BrN,EAAMvB,IAAI1a,WAAW8G,GAAa,OAAO,EAC7C,GAAIgjB,EAAQ,OAAO,EACnB,MAAMkB,EAAY,GACZC,EAAa,GACbC,EAAY,GACZC,EAAY,GACZ5B,EAAkBtN,EAAMO,GAAGsF,MAAMgF,MAAM3G,SAAS,cAChDqJ,EAAgBvN,EAAMwN,WAC5BxN,EAAMwN,WAAa,aACnB,IACIN,EADAiC,GAAgB,EAEpB,IAAKjC,EAAWJ,EAAWI,EAAWC,EAASD,IAAY,CAC1D,MAAMkC,EAAcpP,EAAMsL,OAAO4B,GAAYlN,EAAMqN,UAGnD,GAFAxiB,EAAMmV,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,GAC5CvU,EAAMqH,EAAMoL,OAAO8B,GACfriB,GAAO8N,EAAK,MAChB,GAAoC,KAAhCqH,EAAMvB,IAAI1a,WAAW8G,OAAkBukB,EAAa,CACvD,IACIC,EACAC,EAFAC,EAAUvP,EAAMsL,OAAO4B,GAAY,EAGL,KAA9BlN,EAAMvB,IAAI1a,WAAW8G,IACxBA,IACA0kB,IACAD,GAAY,EACZD,GAAmB,GACqB,IAA9BrP,EAAMvB,IAAI1a,WAAW8G,IAC/BwkB,GAAmB,GACdrP,EAAMuL,QAAQ2B,GAAYqC,GAAW,GAAM,GAC/C1kB,IACA0kB,IACAD,GAAY,GACNA,GAAY,GACbD,GAAmB,EAC1B,IAAItgB,EAASwgB,EAGb,IAFAR,EAAUlrB,KAAKmc,EAAMmL,OAAO+B,IAC5BlN,EAAMmL,OAAO+B,GAAYriB,EAClBA,EAAM8N,GAAK,CACjB,MAAMjV,EAAKsc,EAAMvB,IAAI1a,WAAW8G,GAChC,IAAI+S,GAAQla,GAGL,MAFK,IAAPA,EAAUqL,GAAU,GAAKA,EAASiR,EAAMuL,QAAQ2B,IAAaoC,EAAY,EAAI,IAAM,EAClFvgB,IAENlE,GACD,CACAskB,EAAgBtkB,GAAO8N,EACvBqW,EAAWnrB,KAAKmc,EAAMuL,QAAQ2B,IAC9BlN,EAAMuL,QAAQ2B,GAAYlN,EAAMsL,OAAO4B,GAAY,GAAKmC,EAAmB,EAAI,GAC/EJ,EAAUprB,KAAKmc,EAAMsL,OAAO4B,IAC5BlN,EAAMsL,OAAO4B,GAAYne,EAASwgB,EAClCL,EAAUrrB,KAAKmc,EAAMqL,OAAO6B,IAC5BlN,EAAMqL,OAAO6B,GAAYriB,EAAMmV,EAAMmL,OAAO+B,GAC5C,QACD,CACA,GAAIiC,EAAe,MACnB,IAAI1B,GAAY,EAChB,IAAK,IAAIhqB,EAAI,EAAGa,EAAIgpB,EAAgBxpB,OAAQL,EAAIa,EAAGb,IAAK,GAAI6pB,EAAgB7pB,GAAGuc,EAAOkN,EAAUC,GAAS,GAAO,CAC/GM,GAAY,EACZ,KACD,CACA,GAAIA,EAAW,CACdzN,EAAMwL,QAAU0B,EACQ,IAApBlN,EAAMqN,YACT0B,EAAUlrB,KAAKmc,EAAMmL,OAAO+B,IAC5B8B,EAAWnrB,KAAKmc,EAAMuL,QAAQ2B,IAC9BgC,EAAUrrB,KAAKmc,EAAMqL,OAAO6B,IAC5B+B,EAAUprB,KAAKmc,EAAMsL,OAAO4B,IAC5BlN,EAAMsL,OAAO4B,IAAalN,EAAMqN,WAEjC,KACD,CACA0B,EAAUlrB,KAAKmc,EAAMmL,OAAO+B,IAC5B8B,EAAWnrB,KAAKmc,EAAMuL,QAAQ2B,IAC9BgC,EAAUrrB,KAAKmc,EAAMqL,OAAO6B,IAC5B+B,EAAUprB,KAAKmc,EAAMsL,OAAO4B,IAC5BlN,EAAMsL,OAAO4B,IAAY,CAC1B,CACA,MAAMsC,EAAYxP,EAAMqN,UACxBrN,EAAMqN,UAAY,EAClB,MAAMpD,EAAUjK,EAAMnc,KAAK,kBAAmB,aAAc,GAC5DomB,EAAQC,OAAS,IACjB,MAAMuF,EAAQ,CAAC3C,EAAW,GAC1B7C,EAAQ/T,IAAMuZ,EACdzP,EAAMO,GAAGsF,MAAM6J,SAAS1P,EAAO8M,EAAWI,GAC1BlN,EAAMnc,KAAK,mBAAoB,cAAc,GACrDqmB,OAAS,IACjBlK,EAAMwL,QAAUsD,EAChB9O,EAAMwN,WAAaD,EACnBkC,EAAM,GAAKzP,EAAM0L,KACjB,IAAK,IAAIjoB,EAAI,EAAGA,EAAIyrB,EAAUprB,OAAQL,IACrCuc,EAAMmL,OAAO1nB,EAAIqpB,GAAaiC,EAAUtrB,GACxCuc,EAAMqL,OAAO5nB,EAAIqpB,GAAaoC,EAAUzrB,GACxCuc,EAAMsL,OAAO7nB,EAAIqpB,GAAamC,EAAUxrB,GACxCuc,EAAMuL,QAAQ9nB,EAAIqpB,GAAakC,EAAWvrB,GAG3C,OADAuc,EAAMqN,UAAYmC,GACX,CACR,EA+lBE,CACC,YACA,YACA,aACA,SAGF,CACC,KApmBF,SAAYxP,EAAO8M,EAAWK,EAASU,GACtC,MAAMlV,EAAMqH,EAAMoL,OAAO0B,GACzB,GAAI9M,EAAMsL,OAAOwB,GAAa9M,EAAMqN,WAAa,EAAG,OAAO,EAC3D,IAAIxiB,EAAMmV,EAAMmL,OAAO2B,GAAa9M,EAAMqL,OAAOyB,GACjD,MAAM3M,EAASH,EAAMvB,IAAI1a,WAAW8G,KACpC,GAAe,KAAXsV,GAA4B,KAAXA,GAA4B,KAAXA,EAAe,OAAO,EAC5D,IAAIwP,EAAM,EACV,KAAO9kB,EAAM8N,GAAK,CACjB,MAAMjV,EAAKsc,EAAMvB,IAAI1a,WAAW8G,KAChC,GAAInH,IAAOyc,IAAWvC,GAAQla,GAAK,OAAO,EACtCA,IAAOyc,GAAQwP,GACpB,CACA,GAAIA,EAAM,EAAG,OAAO,EACpB,GAAI9B,EAAQ,OAAO,EACnB7N,EAAM0L,KAAOoB,EAAY,EACzB,MAAMtI,EAAQxE,EAAMnc,KAAK,KAAM,KAAM,GAGrC,OAFA2gB,EAAMtO,IAAM,CAAC4W,EAAW9M,EAAM0L,MAC9BlH,EAAM0F,OAAStQ,MAAM+V,EAAM,GAAGxmB,KAAKxF,OAAOC,aAAauc,KAChD,CACR,EAmlBE,CACC,YACA,YACA,aACA,SAGF,CACC,OA/iBF,SAAcH,EAAO8M,EAAWK,EAASU,GACxC,IAAIlV,EAAK9N,EAAKO,EAAOoZ,EACjB0I,EAAWJ,EACX8C,GAAQ,EACZ,GAAI5P,EAAMsL,OAAO4B,GAAYlN,EAAMqN,WAAa,EAAG,OAAO,EAC1D,GAAIrN,EAAM6P,YAAc,GAAK7P,EAAMsL,OAAO4B,GAAYlN,EAAM6P,YAAc,GAAK7P,EAAMsL,OAAO4B,GAAYlN,EAAMqN,UAAW,OAAO,EAChI,IAIIyC,EACAC,EACAC,EANAC,GAAyB,EAO7B,GANIpC,GAA+B,cAArB7N,EAAMwN,YACfxN,EAAMsL,OAAO4B,IAAalN,EAAMqN,YAAW4C,GAAyB,IAKpED,EAAiBjD,GAAsB/M,EAAOkN,KAAc,GAIhE,GAHA4C,GAAY,EACZ1kB,EAAQ4U,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,GAC9C6C,EAAcrO,OAAO1B,EAAMvB,IAAIva,MAAMkH,EAAO4kB,EAAiB,IACzDC,GAA0C,IAAhBF,EAAmB,OAAO,MAClD,OAAKC,EAAiBnD,GAAqB7M,EAAOkN,KAAc,GAClE,OAAO,EAD8D4C,GAAY,CACrE,CACjB,GAAIG,GACCjQ,EAAM6L,WAAWmE,IAAmBhQ,EAAMoL,OAAO8B,GAAW,OAAO,EAExE,GAAIW,EAAQ,OAAO,EACnB,MAAMqC,EAAiBlQ,EAAMvB,IAAI1a,WAAWisB,EAAiB,GACvDG,EAAanQ,EAAMqE,OAAOvgB,OAC5BgsB,GACHtL,EAAQxE,EAAMnc,KAAK,oBAAqB,KAAM,GAC1B,IAAhBksB,IAAmBvL,EAAMvC,MAAQ,CAAC,CAAC,QAAS8N,MAC1CvL,EAAQxE,EAAMnc,KAAK,mBAAoB,KAAM,GACpD,MAAMusB,EAAY,CAAClD,EAAU,GAC7B1I,EAAMtO,IAAMka,EACZ5L,EAAM0F,OAASvmB,OAAOC,aAAassB,GACnC,IAAIG,GAAe,EACnB,MAAM/C,EAAkBtN,EAAMO,GAAGsF,MAAMgF,MAAM3G,SAAS,QAChDqJ,EAAgBvN,EAAMwN,WAE5B,IADAxN,EAAMwN,WAAa,OACZN,EAAWC,GAAS,CAC1BtiB,EAAMmlB,EACNrX,EAAMqH,EAAMoL,OAAO8B,GACnB,MAAMqC,EAAUvP,EAAMsL,OAAO4B,GAAY8C,GAAkBhQ,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,IACjG,IAAIne,EAASwgB,EACb,KAAO1kB,EAAM8N,GAAK,CACjB,MAAMjV,EAAKsc,EAAMvB,IAAI1a,WAAW8G,GAChC,GAAW,IAAPnH,EAAUqL,GAAU,GAAKA,EAASiR,EAAMuL,QAAQ2B,IAAa,MAC5D,IAAW,KAAPxpB,EACJ,MADeqL,GACf,CACLlE,GACD,CACA,MAAMylB,EAAezlB,EACrB,IAAI0lB,EACqBA,EAArBD,GAAgB3X,EAAyB,EACpB5J,EAASwgB,EAC9BgB,EAAoB,IAAGA,EAAoB,GAC/C,MAAMtF,EAASsE,EAAUgB,EACzB/L,EAAQxE,EAAMnc,KAAK,iBAAkB,KAAM,GAC3C2gB,EAAM0F,OAASvmB,OAAOC,aAAassB,GACnC,MAAMM,EAAY,CAACtD,EAAU,GAC7B1I,EAAMtO,IAAMsa,EACRV,IAAWtL,EAAMG,KAAO3E,EAAMvB,IAAIva,MAAMkH,EAAO4kB,EAAiB,IACpE,MAAMS,EAAWzQ,EAAM4P,MACjBV,EAAYlP,EAAMqL,OAAO6B,GACzB+B,EAAYjP,EAAMsL,OAAO4B,GACzBwD,EAAgB1Q,EAAM6P,WAmB5B,GAlBA7P,EAAM6P,WAAa7P,EAAMqN,UACzBrN,EAAMqN,UAAYpC,EAClBjL,EAAM4P,OAAQ,EACd5P,EAAMqL,OAAO6B,GAAYoD,EAAetQ,EAAMmL,OAAO+B,GACrDlN,EAAMsL,OAAO4B,GAAYne,EACrBuhB,GAAgB3X,GAAOqH,EAAMyL,QAAQyB,EAAW,GAAIlN,EAAM0L,KAAOhT,KAAKqT,IAAI/L,EAAM0L,KAAO,EAAGyB,GACzFnN,EAAMO,GAAGsF,MAAM6J,SAAS1P,EAAOkN,EAAUC,GACzCnN,EAAM4P,QAASS,IAAcT,GAAQ,GAC1CS,EAAerQ,EAAM0L,KAAOwB,EAAW,GAAKlN,EAAMyL,QAAQzL,EAAM0L,KAAO,GACvE1L,EAAMqN,UAAYrN,EAAM6P,WACxB7P,EAAM6P,WAAaa,EACnB1Q,EAAMqL,OAAO6B,GAAYgC,EACzBlP,EAAMsL,OAAO4B,GAAY+B,EACzBjP,EAAM4P,MAAQa,EACdjM,EAAQxE,EAAMnc,KAAK,kBAAmB,MAAM,GAC5C2gB,EAAM0F,OAASvmB,OAAOC,aAAassB,GACnChD,EAAWlN,EAAM0L,KACjB8E,EAAU,GAAKtD,EACXA,GAAYC,EAAS,MACzB,GAAInN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,UAAW,MAC9C,GAAIrN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,WAAa,EAAG,MACnD,IAAII,GAAY,EAChB,IAAK,IAAIhqB,EAAI,EAAGa,EAAIgpB,EAAgBxpB,OAAQL,EAAIa,EAAGb,IAAK,GAAI6pB,EAAgB7pB,GAAGuc,EAAOkN,EAAUC,GAAS,GAAO,CAC/GM,GAAY,EACZ,KACD,CACA,GAAIA,EAAW,MACf,GAAIqC,EAAW,CAEd,GADAE,EAAiBjD,GAAsB/M,EAAOkN,GAC1C8C,EAAiB,EAAG,MACxB5kB,EAAQ4U,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,EAC/C,MAEC,GADA8C,EAAiBnD,GAAqB7M,EAAOkN,GACzC8C,EAAiB,EAAG,MAEzB,GAAIE,IAAmBlQ,EAAMvB,IAAI1a,WAAWisB,EAAiB,GAAI,KAClE,CAQA,OAPexL,EAAXsL,EAAmB9P,EAAMnc,KAAK,qBAAsB,SAC3Cmc,EAAMnc,KAAK,oBAAqB,MAAM,GACnD2gB,EAAM0F,OAASvmB,OAAOC,aAAassB,GACnCE,EAAU,GAAKlD,EACflN,EAAM0L,KAAOwB,EACblN,EAAMwN,WAAaD,EACfqC,GAnHL,SAA6B5P,EAAOuC,GACnC,MAAMrQ,EAAQ8N,EAAM9N,MAAQ,EAC5B,IAAK,IAAIzO,EAAI8e,EAAM,EAAGje,EAAI0b,EAAMqE,OAAOvgB,OAAS,EAAGL,EAAIa,EAAGb,IAASuc,EAAMqE,OAAO5gB,GAAGyO,QAAUA,GAAkC,mBAAzB8N,EAAMqE,OAAO5gB,GAAG+W,OACrHwF,EAAMqE,OAAO5gB,EAAI,GAAGkiB,QAAS,EAC7B3F,EAAMqE,OAAO5gB,GAAGkiB,QAAS,EACzBliB,GAAK,EAEP,CA4GYktB,CAAoB3Q,EAAOmQ,IAC/B,CACR,EAocE,CACC,YACA,YACA,eAGF,CAAC,YAlaF,SAAmBnQ,EAAO8M,EAAW8D,EAAU/C,GAC9C,MAAMpP,EAAMuB,EAAMvB,IAClB,IAAI5T,EAAMmV,EAAMmL,OAAO2B,GAAa9M,EAAMqL,OAAOyB,GAC7CI,EAAWJ,EAAY,EAC3B,GAAI9M,EAAMsL,OAAOwB,GAAa9M,EAAMqN,WAAa,EAAG,OAAO,EAC3D,GAA4B,KAAxB5O,EAAI1a,WAAW8G,GAAa,OAAO,EACvC,IAAI8N,EAAMqU,GAAQhN,EAAO8M,GACrB+D,EAAW,GACXnQ,GAAW,EACXoQ,IAAiBjmB,EACrB,KAAOA,EAAM8N,GAAK,CACjB,GAAIkY,EAAS/sB,OAAS+G,EAAMimB,EAAeC,KAAsB,OAAO,EACxE,IAAIrtB,EAAK+a,EAAI1a,WAAW8G,GACxB,GAAW,KAAPnH,EAAW,OAAO,EACtB,GAAW,KAAPA,EAAW,CACdgd,EAAW7V,EACX,KACD,CAEA,GADW,KAAPnH,IAAWA,EAAK+a,EAAI1a,aAAa8G,IAC1B,KAAPnH,GAAamH,EAAM8N,EAAvB,CACC,MAAMqY,EAAU/D,GAAejN,EAAOkN,GACtC,GAAI8D,EAAU,EAAG,OAAO,EACxBH,GAAYpS,EAAIva,MAAM4sB,EAAcnY,GACpC9N,EAAMimB,EAAeE,EACrBrY,EAAMqU,GAAQhN,EAAOkN,IAEtB,MACAriB,GACD,CACA,GAAI6V,EAAW,GAAsC,KAAjCjC,EAAI1a,WAAW2c,EAAW,GAAW,OAAO,EAEhE,GADAmQ,GAAYpS,EAAIva,MAAM4sB,EAAcpQ,GAChCmQ,EAAS/sB,OApES,KACvB,SAAyB2N,GACxB,IAAI3N,EAAS2N,EAAI3N,OACjB,IAAK,IAAIL,EAAI,EAAGA,EAAIgO,EAAI3N,OAAS,EAAGL,IAAK,CACxC,MAAMwtB,EAAOxf,EAAI1N,WAAWN,GAC5B,GAAIwtB,EAAO,OAASA,EAAO,MAAO,SAClC,MAAMC,EAAMzf,EAAI1N,WAAWN,EAAI,GAC3BytB,GAAO,OAASA,GAAO,QAC1BptB,IACAL,IAEF,CACA,OAAOK,CACR,CAuD2CqtB,CAAgBN,GApEpC,IAoEkE,OAAO,EAE/F,IADAhmB,EAAM6V,EAAW,EACV7V,EAAM8N,GAAK,CACjB,MAAMjV,EAAK+a,EAAI1a,WAAW8G,GAC1B,GAAW,KAAPnH,EAAW,CACd,MAAMstB,EAAU/D,GAAejN,EAAOkN,GACtC,GAAI8D,EAAU,EAAG,MACjBnmB,EAAMmmB,EACNrY,EAAMqU,GAAQhN,EAAOkN,IACtB,KAAO,KAAItP,GAAQla,GACd,MADmBmH,GACnB,CACN,CACA,MAAMumB,EAAUpR,EAAMO,GAAG8Q,QAAQ1Q,qBAAqBlC,EAAK5T,EAAK8N,GAChE,IAAKyY,EAAQxQ,GAAI,OAAO,EACxB,MAAM0Q,EAAOtR,EAAMO,GAAGsJ,cAAcuH,EAAQ3f,KAC5C,IAAKuO,EAAMO,GAAGuJ,aAAawH,GAAO,OAAO,EACzCzmB,EAAMumB,EAAQvmB,IACd,MAAM0mB,EAAa1mB,EACb2mB,EAAa7Y,EACb8Y,EAAgBvE,EACtB,KAAOriB,EAAM8N,GAAK,CACjB,MAAMjV,EAAK+a,EAAI1a,WAAW8G,GAC1B,GAAW,KAAPnH,EAAW,CACd,MAAMstB,EAAU/D,GAAejN,EAAOkN,GACtC,GAAI8D,EAAU,EAAG,MACjBnmB,EAAMmmB,EACNrY,EAAMqU,GAAQhN,EAAOkN,IACtB,KAAO,KAAItP,GAAQla,GACd,MADmBmH,GACnB,CACN,CACA,MAAM6mB,EAAa7mB,EACnB,IAQI8mB,EARAC,EAAW5R,EAAMO,GAAG8Q,QAAQxQ,eAAepC,EAAK5T,EAAK8N,GACzD,KAAOiZ,EAAS7Q,cAAc,CAC7B,MAAMiQ,EAAU/D,GAAejN,EAAOkN,GACtC,GAAI8D,EAAU,EAAG,MACjBnmB,EAAMmmB,EACNrY,EAAMqU,GAAQhN,EAAOkN,KACrB0E,EAAW5R,EAAMO,GAAG8Q,QAAQxQ,eAAepC,EAAK5T,EAAK8N,EAAKiZ,EAC3D,CAWA,IATIF,IAAeH,GAAcK,EAAShR,IACzC+Q,EAAQC,EAASngB,IACjB5G,EAAM+mB,EAAS/mB,MAEf8mB,EAAQ,GACR9mB,EAAM0mB,EACN5Y,EAAM6Y,EACNtE,EAAWuE,GAEL5mB,EAAM8N,GACPiF,GAAQa,EAAI1a,WAAW8G,KAC5BA,IAED,GAAIA,EAAM8N,GAA+B,KAAxB8F,EAAI1a,WAAW8G,IAC3B8mB,EAKH,IAJAA,EAAQ,GACR9mB,EAAM0mB,EACN5Y,EAAM6Y,EACNtE,EAAWuE,EACJ5mB,EAAM8N,GACPiF,GAAQa,EAAI1a,WAAW8G,KAC5BA,IAIH,GAAIA,EAAM8N,GAA+B,KAAxB8F,EAAI1a,WAAW8G,GAAa,OAAO,EACpD,MAAMgnB,EAAQ7T,GAAmB6S,GACjC,IAAKgB,EAAO,OAAO,EAEnB,GAAIhE,EAAQ,OAAO,OACiB,IAAzB7N,EAAMsE,IAAIzY,aAA4BmU,EAAMsE,IAAIzY,WAAa,CAAA,QAC7B,IAAhCmU,EAAMsE,IAAIzY,WAAWgmB,KAAwB7R,EAAMsE,IAAIzY,WAAWgmB,GAAS,CACrFF,QACAL,SAED,MAAM9M,EAAQxE,EAAMnc,KAAK,uBAAwB,GAAI,GACrD2gB,EAAMtO,IAAM,CAAC4W,EAAWI,GACxB1I,EAAMmB,QAAS,EACf,MAAMzD,EAAO/J,OAAOiL,OAAO,MAI3B,OAHAlB,EAAK2P,MAAQA,EACbrN,EAAMtC,KAAOA,EACblC,EAAM0L,KAAOwB,GACN,CACR,GAiTC,CACC,aAlMF,SAAoBlN,EAAO8M,EAAWK,EAASU,GAC9C,IAAIhjB,EAAMmV,EAAMmL,OAAO2B,GAAa9M,EAAMqL,OAAOyB,GAC7CnU,EAAMqH,EAAMoL,OAAO0B,GACvB,GAAI9M,EAAMsL,OAAOwB,GAAa9M,EAAMqN,WAAa,EAAG,OAAO,EAC3D,IAAKrN,EAAMO,GAAGvI,QAAQnW,KAAM,OAAO,EACnC,GAAkC,KAA9Bme,EAAMvB,IAAI1a,WAAW8G,GAAa,OAAO,EAC7C,IAAImjB,EAAWhO,EAAMvB,IAAIva,MAAM2G,EAAK8N,GAChClV,EAAI,EACR,KAAOA,EAAIkqB,GAAe7pB,SAAiB6pB,GAAelqB,GAAG,GAAGwB,KAAK+oB,GAAnCvqB,KAClC,GAAIA,IAAMkqB,GAAe7pB,OAAQ,OAAO,EACxC,GAAI+pB,EAAQ,OAAOF,GAAelqB,GAAG,GACrC,IAAIypB,EAAWJ,EAAY,EAC3B,MAAMgF,EAAkBnE,GAAelqB,GAAG,GAAGwB,KAAK,IAClD,IAAK0oB,GAAelqB,GAAG,GAAGwB,KAAK+oB,GAAW,KAAOd,EAAWC,MACvDnN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,aAC9ByE,GAAoB9R,EAAMyL,QAAQyB,IAF6BA,IAOpE,GAHAriB,EAAMmV,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,GAC5CvU,EAAMqH,EAAMoL,OAAO8B,GACnBc,EAAWhO,EAAMvB,IAAIva,MAAM2G,EAAK8N,GAC5BgV,GAAelqB,GAAG,GAAGwB,KAAK+oB,GAAW,CAChB,IAApBA,EAASlqB,QAAcopB,IAC3B,KACD,CAEDlN,EAAM0L,KAAOwB,EACb,MAAM1I,EAAQxE,EAAMnc,KAAK,aAAc,GAAI,GAG3C,OAFA2gB,EAAMtO,IAAM,CAAC4W,EAAWI,GACxB1I,EAAME,QAAU1E,EAAMkM,SAASY,EAAWI,EAAUlN,EAAMqN,WAAW,IAC9D,CACR,EAsKE,CACC,YACA,YACA,eAGF,CACC,UA1KF,SAAiBrN,EAAO8M,EAAWK,EAASU,GAC3C,IAAIhjB,EAAMmV,EAAMmL,OAAO2B,GAAa9M,EAAMqL,OAAOyB,GAC7CnU,EAAMqH,EAAMoL,OAAO0B,GACvB,GAAI9M,EAAMsL,OAAOwB,GAAa9M,EAAMqN,WAAa,EAAG,OAAO,EAC3D,IAAI3pB,EAAKsc,EAAMvB,IAAI1a,WAAW8G,GAC9B,GAAW,KAAPnH,GAAamH,GAAO8N,EAAK,OAAO,EACpC,IAAIzG,EAAQ,EAEZ,IADAxO,EAAKsc,EAAMvB,IAAI1a,aAAa8G,GACd,KAAPnH,GAAamH,EAAM8N,GAAOzG,GAAS,GACzCA,IACAxO,EAAKsc,EAAMvB,IAAI1a,aAAa8G,GAE7B,GAAIqH,EAAQ,GAAKrH,EAAM8N,IAAQiF,GAAQla,GAAK,OAAO,EACnD,GAAImqB,EAAQ,OAAO,EACnBlV,EAAMqH,EAAM8L,eAAenT,EAAK9N,GAChC,MAAMknB,EAAM/R,EAAMiM,cAActT,EAAK,GAAI9N,GACrCknB,EAAMlnB,GAAO+S,GAAQoC,EAAMvB,IAAI1a,WAAWguB,EAAM,MAAKpZ,EAAMoZ,GAC/D/R,EAAM0L,KAAOoB,EAAY,EACzB,MAAM7C,EAAUjK,EAAMnc,KAAK,eAAgB,IAAIqO,IAAS,GACxD+X,EAAQC,OAAS,WAAWhmB,MAAM,EAAGgO,GACrC+X,EAAQ/T,IAAM,CAAC4W,EAAW9M,EAAM0L,MAChC,MAAMsG,EAAUhS,EAAMnc,KAAK,SAAU,GAAI,GAMzC,OALAmuB,EAAQtN,QAAUpH,GAAU0C,EAAMvB,IAAIva,MAAM2G,EAAK8N,IACjDqZ,EAAQ9b,IAAM,CAAC4W,EAAW9M,EAAM0L,MAChCsG,EAAQ3M,SAAW,GACHrF,EAAMnc,KAAK,gBAAiB,IAAIqO,QACxCgY,OAAS,WAAWhmB,MAAM,EAAGgO,IAC9B,CACR,EAgJE,CACC,YACA,YACA,eAGF,CAAC,WAnJF,SAAkB8N,EAAO8M,EAAWK,GACnC,MAAMG,EAAkBtN,EAAMO,GAAGsF,MAAMgF,MAAM3G,SAAS,aACtD,GAAIlE,EAAMsL,OAAOwB,GAAa9M,EAAMqN,WAAa,EAAG,OAAO,EAC3D,MAAME,EAAgBvN,EAAMwN,WAC5BxN,EAAMwN,WAAa,YACnB,IACIrN,EADAjO,EAAQ,EAERgb,EAAWJ,EAAY,EAC3B,KAAOI,EAAWC,IAAYnN,EAAMyL,QAAQyB,GAAWA,IAAY,CAClE,GAAIlN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,UAAY,EAAG,SAClD,GAAIrN,EAAMsL,OAAO4B,IAAalN,EAAMqN,UAAW,CAC9C,IAAIxiB,EAAMmV,EAAMmL,OAAO+B,GAAYlN,EAAMqL,OAAO6B,GAChD,MAAMvU,EAAMqH,EAAMoL,OAAO8B,GACzB,GAAIriB,EAAM8N,IACTwH,EAASH,EAAMvB,IAAI1a,WAAW8G,IACf,KAAXsV,GAA4B,KAAXA,KACpBtV,EAAMmV,EAAMgM,UAAUnhB,EAAKsV,GAC3BtV,EAAMmV,EAAM6L,WAAWhhB,GACnBA,GAAO8N,IAAK,CACfzG,EAAmB,KAAXiO,EAAgB,EAAI,EAC5B,KACD,CAGH,CACA,GAAIH,EAAMsL,OAAO4B,GAAY,EAAG,SAChC,IAAIO,GAAY,EAChB,IAAK,IAAIhqB,EAAI,EAAGa,EAAIgpB,EAAgBxpB,OAAQL,EAAIa,EAAGb,IAAK,GAAI6pB,EAAgB7pB,GAAGuc,EAAOkN,EAAUC,GAAS,GAAO,CAC/GM,GAAY,EACZ,KACD,CACA,GAAIA,EAAW,KAChB,CACA,IAAKvb,EAEJ,OADA8N,EAAMwN,WAAaD,GACZ,EAER,MAAM7I,EAAUpH,GAAU0C,EAAMkM,SAASY,EAAWI,EAAUlN,EAAMqN,WAAW,IAC/ErN,EAAM0L,KAAOwB,EAAW,EACxB,MAAMjD,EAAUjK,EAAMnc,KAAK,eAAgB,IAAIqO,IAAS,GACxD+X,EAAQC,OAASvmB,OAAOC,aAAauc,GACrC8J,EAAQ/T,IAAM,CAAC4W,EAAW9M,EAAM0L,MAChC,MAAMsG,EAAUhS,EAAMnc,KAAK,SAAU,GAAI,GAOzC,OANAmuB,EAAQtN,QAAUA,EAClBsN,EAAQ9b,IAAM,CAAC4W,EAAW9M,EAAM0L,KAAO,GACvCsG,EAAQ3M,SAAW,GACHrF,EAAMnc,KAAK,gBAAiB,IAAIqO,QACxCgY,OAASvmB,OAAOC,aAAauc,GACrCH,EAAMwN,WAAaD,GACZ,CACR,GAkGC,CAAC,YA/FF,SAAmBvN,EAAO8M,EAAWK,GACpC,MAAMG,EAAkBtN,EAAMO,GAAGsF,MAAMgF,MAAM3G,SAAS,aAChDqJ,EAAgBvN,EAAMwN,WAC5B,IAAIN,EAAWJ,EAAY,EAE3B,IADA9M,EAAMwN,WAAa,YACZN,EAAWC,IAAYnN,EAAMyL,QAAQyB,GAAWA,IAAY,CAClE,GAAIlN,EAAMsL,OAAO4B,GAAYlN,EAAMqN,UAAY,EAAG,SAClD,GAAIrN,EAAMsL,OAAO4B,GAAY,EAAG,SAChC,IAAIO,GAAY,EAChB,IAAK,IAAIhqB,EAAI,EAAGa,EAAIgpB,EAAgBxpB,OAAQL,EAAIa,EAAGb,IAAK,GAAI6pB,EAAgB7pB,GAAGuc,EAAOkN,EAAUC,GAAS,GAAO,CAC/GM,GAAY,EACZ,KACD,CACA,GAAIA,EAAW,KAChB,CACA,MAAM/I,EAAUpH,GAAU0C,EAAMkM,SAASY,EAAWI,EAAUlN,EAAMqN,WAAW,IAC/ErN,EAAM0L,KAAOwB,EACGlN,EAAMnc,KAAK,iBAAkB,IAAK,GAC1CqS,IAAM,CAAC4W,EAAW9M,EAAM0L,MAChC,MAAMsG,EAAUhS,EAAMnc,KAAK,SAAU,GAAI,GAMzC,OALAmuB,EAAQtN,QAAUA,EAClBsN,EAAQ9b,IAAM,CAAC4W,EAAW9M,EAAM0L,MAChCsG,EAAQ3M,SAAW,GACnBrF,EAAMnc,KAAK,kBAAmB,KAAK,GACnCmc,EAAMwN,WAAaD,GACZ,CACR,IA0EI0E,GAAc,MACjB,WAAA3gB,GACCqQ,GACCzb,KAIA,QACA,IAAIwc,IAELf,GAAgBzb,KAAM,QAAS6kB,IAC/B,IAAK,IAAItnB,EAAI,EAAGA,EAAImqB,GAAS9pB,OAAQL,IAAKyC,KAAK2kB,MAAMhnB,KAAK+pB,GAASnqB,GAAG,GAAImqB,GAASnqB,GAAG,GAAI,CAAEwf,KAAM2K,GAASnqB,GAAG,IAAM,IAAIS,SACzH,CACA,QAAAwrB,CAAS1P,EAAO8M,EAAWK,GAC1B,MAAMlH,EAAQ/f,KAAK2kB,MAAM3G,SAAS,IAC5B3K,EAAM0M,EAAMniB,OACZouB,EAAalS,EAAMO,GAAGvI,QAAQka,WACpC,IAAIxG,EAAOoB,EACPqF,GAAgB,EACpB,KAAOzG,EAAOyB,IACbnN,EAAM0L,KAAOA,EAAO1L,EAAM2L,eAAeD,KACrCA,GAAQyB,OACRnN,EAAMsL,OAAOI,GAAQ1L,EAAMqN,YAHT,CAItB,GAAIrN,EAAM9N,OAASggB,EAAY,CAC9BlS,EAAM0L,KAAOyB,EACb,KACD,CACA,MAAMiF,EAAWpS,EAAM0L,KACvB,IAAI9K,GAAK,EACT,IAAK,IAAInd,EAAI,EAAGA,EAAI8V,EAAK9V,IAExB,GADAmd,EAAKqF,EAAMxiB,GAAGuc,EAAO0L,EAAMyB,GAAS,GAChCvM,EAAI,CACP,GAAIwR,GAAYpS,EAAM0L,KAAM,MAAM,IAAIlI,MAAM,0CAC5C,KACD,CAED,IAAK5C,EAAI,MAAM,IAAI4C,MAAM,mCACzBxD,EAAM4P,OAASuC,EACXnS,EAAMyL,QAAQzL,EAAM0L,KAAO,KAAIyG,GAAgB,GACnDzG,EAAO1L,EAAM0L,KACTA,EAAOyB,GAAWnN,EAAMyL,QAAQC,KACnCyG,GAAgB,EAChBzG,IACA1L,EAAM0L,KAAOA,EAEf,CACD,CAIA,KAAAlkB,CAAMiX,EAAK8B,EAAI+D,EAAK+N,GACnB,IAAK5T,EAAK,OACV,MAAMuB,EAAQ,IAAI9Z,KAAKosB,MAAM7T,EAAK8B,EAAI+D,EAAK+N,GAC3CnsB,KAAKwpB,SAAS1P,EAAOA,EAAM0L,KAAM1L,EAAMwL,QACxC,GAKG+G,GAAc,MACjB,WAAAjhB,CAAYmN,EAAK8B,EAAI+D,EAAK+N,GACzB1Q,GAAgBzb,KAAM,MAAO,GAC7Byb,GAAgBzb,KAAM,QAAS,GAC/Byb,GAAgBzb,KAAM,UAAW,IACjCyb,GAAgBzb,KAAM,eAAgB,GACtCyb,GAAgBzb,KAAM,QAAS,IAC/Byb,GAAgBzb,KAAM,YAAa,IACnCyb,GAAgBzb,KAAM,oBAAoB,GAC1Cyb,GAAgBzb,KAAM,mBAAmB,GACzCyb,GAAgBzb,KAAM,YAAa,GACnCyb,GAAgBzb,KAAM,aAAc,IACpCyb,GAAgBzb,KAAM,mBAAoB,IAC1Cyb,GAAgBzb,KAAM,QAAS4b,IAC/B5b,KAAKuY,IAAMA,EACXvY,KAAKoe,IAAMA,EACXpe,KAAKqa,GAAKA,EACVra,KAAKme,OAASgO,EACdnsB,KAAKssB,YAAc5Y,MAAMyY,EAAUvuB,QACnCoC,KAAKma,OAASna,KAAKuY,IAAI3a,MACxB,CACA,WAAA2uB,GACC,MAAMjO,EAAQ,IAAI1C,GAAM,OAAQ,GAAI,GAKpC,OAJA0C,EAAME,QAAUxe,KAAKwsB,QACrBlO,EAAMtS,MAAQhM,KAAKysB,aACnBzsB,KAAKme,OAAOxgB,KAAK2gB,GACjBte,KAAKwsB,QAAU,GACRlO,CACR,CACA,IAAA3gB,CAAK2W,EAAMuH,EAAKC,GACX9b,KAAKwsB,SAASxsB,KAAKusB,cACvB,MAAMjO,EAAQ,IAAI1C,GAAMtH,EAAMuH,EAAKC,GACnC,IAAI4Q,EAeJ,OAdI5Q,EAAU,IACb9b,KAAKgM,QACLhM,KAAK2sB,WAAa3sB,KAAK4sB,iBAAiBxL,OAEzC9C,EAAMtS,MAAQhM,KAAKgM,MACf8P,EAAU,IACb9b,KAAKgM,QACLhM,KAAK4sB,iBAAiBjvB,KAAKqC,KAAK2sB,YAChC3sB,KAAK2sB,WAAa,GAClBD,EAAa,CAAEC,WAAY3sB,KAAK2sB,aAEjC3sB,KAAKysB,aAAezsB,KAAKgM,MACzBhM,KAAKme,OAAOxgB,KAAK2gB,GACjBte,KAAKssB,YAAY3uB,KAAK+uB,GACfpO,CACR,CACA,UAAAuO,CAAW3nB,EAAO4nB,GACjB,MAAMra,EAAMzS,KAAKma,OACXF,EAASja,KAAKuY,IAAI1a,WAAWqH,GACnC,IAAI8c,EACJ,GAAc,IAAV9c,EAAa8c,EAAW,QACvB,GAAc,IAAV9c,EACR8c,EAAWhiB,KAAKuY,IAAI1a,WAAW,GACJ,QAAX,MAAXmkB,KAA6BA,EAAW,YAG7C,GADAA,EAAWhiB,KAAKuY,IAAI1a,WAAWqH,EAAQ,GACZ,QAAX,MAAX8c,GAA6B,CACjC,MAAM+K,EAAW/sB,KAAKuY,IAAI1a,WAAWqH,EAAQ,GAC7C8c,EAAkC,QAAX,MAAX+K,GAA8B,OAASA,EAAW,OAAS,KAAO/K,EAAW,OAAS,KACnG,MAAkC,QAAX,MAAXA,KAA6BA,EAAW,OAErD,IAAIrd,EAAMO,EACV,KAAOP,EAAM8N,GAAOzS,KAAKuY,IAAI1a,WAAW8G,KAASsV,GAAQtV,IACzD,MAAMS,EAAQT,EAAMO,EACpB,IAAI+c,EAAWtd,EAAM8N,EAAMzS,KAAKuY,IAAI1a,WAAW8G,GAAO,GACtD,GAA2B,QAAX,MAAXsd,GAA6B,CACjC,MAAM+K,EAAUhtB,KAAKuY,IAAI1a,WAAW8G,EAAM,GAC1Csd,EAAiC,QAAX,MAAV+K,GAA6B,OAAS/K,EAAW,OAAS,KAAO+K,EAAU,OAAS,KACjG,MAAkC,QAAX,MAAX/K,KAA6BA,EAAW,OACpD,MAAMC,EAAkB3K,GAAeyK,IAAavK,GAAgBuK,GAC9DG,EAAkB5K,GAAe0K,IAAaxK,GAAgBwK,GAC9DG,EAAmBxK,GAAaoK,GAChCK,EAAmBzK,GAAaqK,GAChCgL,GAAiB5K,KAAsBF,GAAmBC,GAAoBF,GAC9EgL,GAAkB9K,KAAsBF,GAAmBG,GAAoBF,GACrF,MAAO,CACNgL,SAAUF,IAAkBH,IAAiBI,GAAkBhL,GAC/DkL,UAAWF,IAAmBJ,IAAiBG,GAAiB9K,GAChEvkB,OAAQwH,EAEV,GAID,SAASioB,GAAiB7vB,GACzB,OAAQA,GACP,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IAAK,OAAO,EACjB,QAAS,OAAO,EAElB,CAcA,SAAS8vB,GAAaruB,GACrB,OAAOA,GAAQ,IAAMA,GAAQ,IAAMA,GAAQ,IAAMA,GAAQ,KAAOA,GAAQ,IAAMA,GAAQ,IAAe,KAATA,GAAwB,KAATA,GAAwB,KAATA,CAC3H,CAkEA,IAAIsuB,GAAU,GACd,IAAK,IAAIhwB,EAAI,EAAGA,EAAI,IAAKA,IAAKgwB,GAAQ5vB,KAAK,GAoI3C,SAAS6vB,GAAc1T,EAAO6S,GAC7B,IAAIrO,EACJ,MAAMmP,EAAc,GACdhb,EAAMka,EAAW/uB,OACvB,IAAK,IAAIL,EAAI,EAAGA,EAAIkV,EAAKlV,IAAK,CAC7B,MAAMmwB,EAAaf,EAAWpvB,GAC9B,GAA0B,MAAtBmwB,EAAWzT,OAAgB,SAC/B,QAAIyT,EAAWloB,IAAY,SAC3B,MAAMmoB,EAAWhB,EAAWe,EAAWloB,KACvC8Y,EAAQxE,EAAMqE,OAAOuP,EAAWpP,OAChCA,EAAMhK,KAAO,SACbgK,EAAMzC,IAAM,IACZyC,EAAMxC,QAAU,EAChBwC,EAAM0F,OAAS,KACf1F,EAAME,QAAU,GAChBF,EAAQxE,EAAMqE,OAAOwP,EAASrP,OAC9BA,EAAMhK,KAAO,UACbgK,EAAMzC,IAAM,IACZyC,EAAMxC,SAAU,EAChBwC,EAAM0F,OAAS,KACf1F,EAAME,QAAU,GAC8B,SAA1C1E,EAAMqE,OAAOwP,EAASrP,MAAQ,GAAGhK,MAAgE,MAA7CwF,EAAMqE,OAAOwP,EAASrP,MAAQ,GAAGE,SAAiBiP,EAAY9vB,KAAKgwB,EAASrP,MAAQ,EAC7I,CACA,KAAOmP,EAAY7vB,QAAQ,CAC1B,MAAML,EAAIkwB,EAAYrM,MACtB,IAAIze,EAAIpF,EAAI,EACZ,KAAOoF,EAAImX,EAAMqE,OAAOvgB,QAAmC,YAAzBkc,EAAMqE,OAAOxb,GAAG2R,MAAoB3R,IACtEA,IACIpF,IAAMoF,IACT2b,EAAQxE,EAAMqE,OAAOxb,GACrBmX,EAAMqE,OAAOxb,GAAKmX,EAAMqE,OAAO5gB,GAC/Buc,EAAMqE,OAAO5gB,GAAK+gB,EAEpB,CACD,CArKA,qCAAqC3c,MAAM,IAAIuP,SAAQ,SAAS1T,GAC/D+vB,GAAQ/vB,EAAGK,WAAW,IAAM,CAC7B,IA8KA,IAAI+vB,GAAwB,CAC3BpE,SA5ED,SAAgC1P,EAAO6N,GACtC,MAAMziB,EAAQ4U,EAAMnV,IACdsV,EAASH,EAAMvB,IAAI1a,WAAWqH,GACpC,GAAIyiB,EAAQ,OAAO,EACnB,GAAe,MAAX1N,EAAgB,OAAO,EAC3B,MAAM4T,EAAU/T,EAAM+S,WAAW/S,EAAMnV,KAAK,GAC5C,IAAI0O,EAAMwa,EAAQjwB,OAClB,MAAMJ,EAAKC,OAAOC,aAAauc,GAC/B,GAAI5G,EAAM,EAAG,OAAO,EACpB,IAAIiL,EACAjL,EAAM,IACTiL,EAAQxE,EAAMnc,KAAK,OAAQ,GAAI,GAC/B2gB,EAAME,QAAUhhB,EAChB6V,KAED,IAAK,IAAI9V,EAAI,EAAGA,EAAI8V,EAAK9V,GAAK,EAC7B+gB,EAAQxE,EAAMnc,KAAK,OAAQ,GAAI,GAC/B2gB,EAAME,QAAUhhB,EAAKA,EACrBsc,EAAM6S,WAAWhvB,KAAK,CACrBsc,SACArc,OAAQ,EACR0gB,MAAOxE,EAAMqE,OAAOvgB,OAAS,EAC7B4H,KAAK,EACLiG,KAAMoiB,EAAQV,SACdzhB,MAAOmiB,EAAQT,YAIjB,OADAtT,EAAMnV,KAAOkpB,EAAQjwB,QACd,CACR,EAgDCkwB,YAZD,SAAmChU,GAClC,MAAMwS,EAAcxS,EAAMwS,YACpB7Z,EAAMqH,EAAMwS,YAAY1uB,OAC9B4vB,GAAc1T,EAAOA,EAAM6S,YAC3B,IAAK,IAAI7J,EAAO,EAAGA,EAAOrQ,EAAKqQ,IAAQ,CACtC,IAAIiL,EACJ,MAAMpB,EAAyD,QAA3CoB,EAAoBzB,EAAYxJ,UAAyC,IAAtBiL,OAA+B,EAASA,EAAkBpB,WAC7HA,GAAYa,GAAc1T,EAAO6S,EACtC,CACD,GA4BA,SAASmB,GAAYhU,EAAO6S,GAE3B,IAAK,IAAIpvB,EADGovB,EAAW/uB,OACJ,EAAGL,GAAK,EAAGA,IAAK,CAClC,MAAMmwB,EAAaf,EAAWpvB,GAC9B,GAA0B,KAAtBmwB,EAAWzT,QAAuC,KAAtByT,EAAWzT,OAAe,SAC1D,QAAIyT,EAAWloB,IAAY,SAC3B,MAAMmoB,EAAWhB,EAAWe,EAAWloB,KACjCwoB,EAAWzwB,EAAI,GAAKovB,EAAWpvB,EAAI,GAAGiI,MAAQkoB,EAAWloB,IAAM,GAAKmnB,EAAWpvB,EAAI,GAAG0c,SAAWyT,EAAWzT,QAAU0S,EAAWpvB,EAAI,GAAG+gB,QAAUoP,EAAWpP,MAAQ,GAAKqO,EAAWe,EAAWloB,IAAM,GAAG8Y,QAAUqP,EAASrP,MAAQ,EACpO9gB,EAAKC,OAAOC,aAAagwB,EAAWzT,QACpC8J,EAAUjK,EAAMqE,OAAOuP,EAAWpP,OACxCyF,EAAQzP,KAAO0Z,EAAW,cAAgB,UAC1CjK,EAAQlI,IAAMmS,EAAW,SAAW,KACpCjK,EAAQjI,QAAU,EAClBiI,EAAQC,OAASgK,EAAWxwB,EAAKA,EAAKA,EACtCumB,EAAQvF,QAAU,GAClB,MAAM0F,EAAUpK,EAAMqE,OAAOwP,EAASrP,OACtC4F,EAAQ5P,KAAO0Z,EAAW,eAAiB,WAC3C9J,EAAQrI,IAAMmS,EAAW,SAAW,KACpC9J,EAAQpI,SAAU,EAClBoI,EAAQF,OAASgK,EAAWxwB,EAAKA,EAAKA,EACtC0mB,EAAQ1F,QAAU,GACdwP,IACHlU,EAAMqE,OAAOwO,EAAWpvB,EAAI,GAAG+gB,OAAOE,QAAU,GAChD1E,EAAMqE,OAAOwO,EAAWe,EAAWloB,IAAM,GAAG8Y,OAAOE,QAAU,GAC7DjhB,IAEF,CACD,CAWA,IAAI0wB,GAAmB,CACtBzE,SA5DD,SAA2B1P,EAAO6N,GACjC,MAAMziB,EAAQ4U,EAAMnV,IACdsV,EAASH,EAAMvB,IAAI1a,WAAWqH,GACpC,GAAIyiB,EAAQ,OAAO,EACnB,GAAe,KAAX1N,GAA4B,KAAXA,EAAe,OAAO,EAC3C,MAAM4T,EAAU/T,EAAM+S,WAAW/S,EAAMnV,IAAgB,KAAXsV,GAC5C,IAAK,IAAI1c,EAAI,EAAGA,EAAIswB,EAAQjwB,OAAQL,IAAK,CAC1Buc,EAAMnc,KAAK,OAAQ,GAAI,GAC/B6gB,QAAU/gB,OAAOC,aAAauc,GACpCH,EAAM6S,WAAWhvB,KAAK,CACrBsc,SACArc,OAAQiwB,EAAQjwB,OAChB0gB,MAAOxE,EAAMqE,OAAOvgB,OAAS,EAC7B4H,KAAK,EACLiG,KAAMoiB,EAAQV,SACdzhB,MAAOmiB,EAAQT,WAEjB,CAEA,OADAtT,EAAMnV,KAAOkpB,EAAQjwB,QACd,CACR,EAyCCkwB,YAZD,SAA+BhU,GAC9B,MAAMwS,EAAcxS,EAAMwS,YACpB7Z,EAAMqH,EAAMwS,YAAY1uB,OAC9BkwB,GAAYhU,EAAOA,EAAM6S,YACzB,IAAK,IAAI7J,EAAO,EAAGA,EAAOrQ,EAAKqQ,IAAQ,CACtC,IAAIiL,EACJ,MAAMpB,EAAyD,QAA3CoB,EAAoBzB,EAAYxJ,UAAyC,IAAtBiL,OAA+B,EAASA,EAAkBpB,WAC7HA,GAAYmB,GAAYhU,EAAO6S,EACpC,CACD,GAiLA,IAAIuB,GAAW,yIACXC,GAAc,qDAyDlB,SAASC,GAAS5wB,GACjB,MAAM6wB,EAAU,GAAL7wB,EACX,OAAO6wB,GAAM,IAAMA,GAAM,GAC1B,CAoDA,IAAIC,GAAa,uCACbC,GAAW,4BAuCf,SAASC,GAAkB7B,GAC1B,MAAM8B,EAAgB,CAAA,EAChBhc,EAAMka,EAAW/uB,OACvB,IAAK6U,EAAK,OACV,IAAIic,EAAY,EACZC,GAAe,EACnB,MAAMC,EAAQ,GACd,IAAK,IAAIC,EAAY,EAAGA,EAAYpc,EAAKoc,IAAa,CACrD,MAAMC,EAASnC,EAAWkC,GAK1B,GAJAD,EAAMjxB,KAAK,GACPgvB,EAAW+B,GAAWzU,SAAW6U,EAAO7U,QAAU0U,IAAiBG,EAAOxQ,MAAQ,IAAGoQ,EAAYG,GACrGF,EAAeG,EAAOxQ,MACtBwQ,EAAOlxB,OAASkxB,EAAOlxB,QAAU,GAC5BkxB,EAAOpjB,MAAO,SACd+iB,EAAcM,eAAeD,EAAO7U,UAASwU,EAAcK,EAAO7U,QAAU,EAChF,GACA,GACA,GACA,GACA,GACA,IAED,MAAM+U,EAAeP,EAAcK,EAAO7U,SAAS6U,EAAOrjB,KAAO,EAAI,GAAKqjB,EAAOlxB,OAAS,GAC1F,IAAIqxB,EAAYP,EAAYE,EAAMF,GAAa,EAC3CQ,EAAkBD,EACtB,KAAOA,EAAYD,EAAcC,GAAaL,EAAMK,GAAa,EAAG,CACnE,MAAME,EAASxC,EAAWsC,GAC1B,GAAIE,EAAOlV,SAAW6U,EAAO7U,SACzBkV,EAAO1jB,MAAQ0jB,EAAO3pB,IAAM,GAAG,CAClC,IAAI4pB,GAAa,EAMjB,IALID,EAAOzjB,OAASojB,EAAOrjB,QACrB0jB,EAAOvxB,OAASkxB,EAAOlxB,QAAU,GAAM,IACvCuxB,EAAOvxB,OAAS,GAAM,GAAKkxB,EAAOlxB,OAAS,GAAM,IAAGwxB,GAAa,KAGlEA,EAAY,CAChB,MAAMC,EAAWJ,EAAY,IAAMtC,EAAWsC,EAAY,GAAGxjB,KAAOmjB,EAAMK,EAAY,GAAK,EAAI,EAC/FL,EAAMC,GAAaA,EAAYI,EAAYI,EAC3CT,EAAMK,GAAaI,EACnBP,EAAOrjB,MAAO,EACd0jB,EAAO3pB,IAAMqpB,EACbM,EAAOzjB,OAAQ,EACfwjB,GAAkB,EAClBP,GAAe,EACf,KACD,CACD,CACD,EACwB,IAApBO,IAAwBT,EAAcK,EAAO7U,SAAS6U,EAAOrjB,KAAO,EAAI,IAAMqjB,EAAOlxB,QAAU,GAAK,GAAKsxB,EAC9G,CACD,CAgCA,IAAII,GAAS,CACZ,CAAC,OAhuBF,SAAcxV,EAAO6N,GACpB,IAAIhjB,EAAMmV,EAAMnV,IAChB,KAAOA,EAAMmV,EAAMK,SAAWkT,GAAiBvT,EAAMvB,IAAI1a,WAAW8G,KAAOA,IAC3E,OAAIA,IAAQmV,EAAMnV,MACbgjB,IAAQ7N,EAAM0S,SAAW1S,EAAMvB,IAAIva,MAAM8b,EAAMnV,IAAKA,IACzDmV,EAAMnV,IAAMA,GACL,EACR,GA0tBC,CAAC,UAjtBF,SAAiBmV,EAAO6N,GACvB,IAAK7N,EAAMO,GAAGvI,QAAQsR,QAAS,OAAO,EACtC,GAAItJ,EAAMyV,UAAY,EAAG,OAAO,EAChC,MAAM5qB,EAAMmV,EAAMnV,IAElB,GAAIA,EAAM,EADEmV,EAAMK,OACC,OAAO,EAC1B,GAAkC,KAA9BL,EAAMvB,IAAI1a,WAAW8G,GAAa,OAAO,EAC7C,GAAsC,KAAlCmV,EAAMvB,IAAI1a,WAAW8G,EAAM,GAAW,OAAO,EACjD,GAAsC,KAAlCmV,EAAMvB,IAAI1a,WAAW8G,EAAM,GAAW,OAAO,EACjD,MAAM6qB,EAAW7qB,EAAM6N,KAAKqT,IAAI,GAAI/L,EAAM0S,QAAQ5uB,OAAQ+G,GAC1D,IAAI8qB,EAAa9qB,EACjB,KAAO8qB,EAAaD,GAAYlC,GAAaxT,EAAMvB,IAAI1a,WAAW4xB,EAAa,KAAKA,IACpF,GAAIA,IAAe9qB,IAlBpB,SAAsB1F,GACrB,OAAOA,GAAQ,IAAMA,GAAQ,IAAMA,GAAQ,IAAMA,GAAQ,GAC1D,CAgB4BywB,CAAa5V,EAAMvB,IAAI1a,WAAW4xB,IAAc,OAAO,EAClF,MAAME,EAAchrB,EAAM8qB,EACpBG,EAAO9V,EAAMO,GAAG+I,QAAQ7P,aAAauG,EAAMvB,IAAIva,MAAMyxB,IAC3D,IAAKG,EAAM,OAAO,EAClB,IAAIvwB,EAAMuwB,EAAKvwB,IACf,GAAIA,EAAIzB,QAAU+xB,EAAa,OAAO,EACtC,IAAIE,EAASxwB,EAAIzB,OACjB,KAAOiyB,EAAS,GAAoC,KAA/BxwB,EAAIxB,WAAWgyB,EAAS,IAAWA,IACpDA,IAAWxwB,EAAIzB,SAAQyB,EAAMA,EAAIrB,MAAM,EAAG6xB,IAC9C,MAAMnM,EAAU5J,EAAMO,GAAGsJ,cAActkB,GACvC,IAAKya,EAAMO,GAAGuJ,aAAaF,GAAU,OAAO,EAC5C,IAAKiE,EAAQ,CACZ7N,EAAM0S,QAAU1S,EAAM0S,QAAQxuB,MAAM,GAAI2xB,GACxC,MAAM5L,EAAUjK,EAAMnc,KAAK,YAAa,IAAK,GAC7ComB,EAAQhI,MAAQ,CAAC,CAAC,OAAQ2H,IAC1BK,EAAQC,OAAS,UACjBD,EAAQtF,KAAO,OACC3E,EAAMnc,KAAK,OAAQ,GAAI,GAC/B6gB,QAAU1E,EAAMO,GAAGyJ,kBAAkBzkB,GAC7C,MAAM6kB,EAAUpK,EAAMnc,KAAK,aAAc,KAAK,GAC9CumB,EAAQF,OAAS,UACjBE,EAAQzF,KAAO,MAChB,CAEA,OADA3E,EAAMnV,KAAOtF,EAAIzB,OAAS+xB,GACnB,CACR,GA6qBC,CAAC,UA1qBF,SAAiB7V,EAAO6N,GACvB,IAAIhjB,EAAMmV,EAAMnV,IAChB,GAAkC,KAA9BmV,EAAMvB,IAAI1a,WAAW8G,GAAa,OAAO,EAC7C,MAAMmrB,EAAOhW,EAAM0S,QAAQ5uB,OAAS,EAC9B6U,EAAMqH,EAAMK,OAClB,IAAKwN,EACJ,GAAImI,GAAQ,GAAwC,KAAnChW,EAAM0S,QAAQ3uB,WAAWiyB,GACzC,GAAIA,GAAQ,GAA4C,KAAvChW,EAAM0S,QAAQ3uB,WAAWiyB,EAAO,GAAW,CAC3D,IAAIC,EAAKD,EAAO,EAChB,KAAOC,GAAM,GAA0C,KAArCjW,EAAM0S,QAAQ3uB,WAAWkyB,EAAK,IAAWA,IAC3DjW,EAAM0S,QAAU1S,EAAM0S,QAAQxuB,MAAM,EAAG+xB,GACvCjW,EAAMnc,KAAK,YAAa,KAAM,EAC/B,MACCmc,EAAM0S,QAAU1S,EAAM0S,QAAQxuB,MAAM,MACpC8b,EAAMnc,KAAK,YAAa,KAAM,QAEzBmc,EAAMnc,KAAK,YAAa,KAAM,GAGtC,IADAgH,IACOA,EAAM8N,GAAOiF,GAAQoC,EAAMvB,IAAI1a,WAAW8G,KAAOA,IAExD,OADAmV,EAAMnV,IAAMA,GACL,CACR,GAqpBC,CAAC,SA7oBF,SAAgBmV,EAAO6N,GACtB,IAAIhjB,EAAMmV,EAAMnV,IAChB,MAAM8N,EAAMqH,EAAMK,OAClB,GAAkC,KAA9BL,EAAMvB,IAAI1a,WAAW8G,GAAa,OAAO,EAE7C,GADAA,IACIA,GAAO8N,EAAK,OAAO,EACvB,IAAIud,EAAMlW,EAAMvB,IAAI1a,WAAW8G,GAC/B,GAAY,KAARqrB,EAAY,CAGf,IAFKrI,GAAQ7N,EAAMnc,KAAK,YAAa,KAAM,GAC3CgH,IACOA,EAAM8N,IACZud,EAAMlW,EAAMvB,IAAI1a,WAAW8G,GACtB+S,GAAQsY,KACbrrB,IAGD,OADAmV,EAAMnV,IAAMA,GACL,CACR,CACA,GAAY,KAARqrB,EAAY,CACf,IAAKrI,EAAQ,CACZ,MAAMrJ,EAAQxE,EAAMnc,KAAK,eAAgB,GAAI,GAC7C2gB,EAAME,QAAU,KAChBF,EAAM0F,OAAS,KACf1F,EAAMG,KAAO,QACd,CAEA,OADA3E,EAAMnV,IAAMA,GACL,CACR,CACA,IAAIsrB,EAAanW,EAAMvB,IAAI5T,GAC3B,GAAIqrB,GAAO,OAASA,GAAO,OAASrrB,EAAM,EAAI8N,EAAK,CAClD,MAAMyd,EAAMpW,EAAMvB,IAAI1a,WAAW8G,EAAM,GACnCurB,GAAO,OAASA,GAAO,QAC1BD,GAAcnW,EAAMvB,IAAI5T,EAAM,GAC9BA,IAEF,CACA,MAAMwrB,EAAU,KAAOF,EACvB,IAAKtI,EAAQ,CACZ,MAAMrJ,EAAQxE,EAAMnc,KAAK,eAAgB,GAAI,GACzCqyB,EAAM,KAAwB,IAAjBzC,GAAQyC,GAAY1R,EAAME,QAAUyR,EAChD3R,EAAME,QAAU2R,EACrB7R,EAAM0F,OAASmM,EACf7R,EAAMG,KAAO,QACd,CAEA,OADA3E,EAAMnV,IAAMA,EAAM,GACX,CACR,GAgmBC,CAAC,YAnlBF,SAAkBmV,EAAO6N,GACxB,IAAIyI,EACJ,MAAMlrB,EAAQ4U,EAAMnV,IACpB,GAAoC,KAAhCmV,EAAMvB,IAAI1a,WAAWqH,GAAe,OAAO,EAC/C,MAAMuN,EAAMqH,EAAMK,OAClB,IAAIxV,EAAMO,EAAQ,EAClB,KAAOP,EAAM8N,GAAqC,KAA9BqH,EAAMvB,IAAI1a,WAAW8G,IAAaA,IACtD,MAAMsV,EAASH,EAAMvB,IAAIva,MAAMkH,EAAOP,GAChC0rB,EAAepW,EAAOrc,OAK5B,GAJKkc,EAAMwW,mBACVxW,EAAMyW,UApBR,SAAuBhY,GACtB,MAAMiY,EAAW,CAAA,EACjB,IAAI7rB,EAAM,EACV,WAAQA,EAAM4T,EAAI7Y,QAAQ,IAAKiF,KAAc,CAC5C,MAAMO,EAAQP,EACd,KAAiC,KAA1B4T,EAAI1a,aAAa8G,KACxB6rB,EAAS7rB,EAAMO,GAASA,CACzB,CACA,OAAOsrB,CACR,CAWoBC,CAAc3W,EAAMvB,KACtCuB,EAAMwW,kBAAmB,IAEuC,QAA3DF,EAAwBtW,EAAMyW,UAAUF,UAAqD,IAA1BD,EAAmCA,GAAwB,IAAOzrB,EAAK,CAC/I,IACI+rB,EADAC,EAAWhsB,EAEf,MAA2D,KAAnD+rB,EAAa5W,EAAMvB,IAAI7Y,QAAQ,IAAKixB,KAAqBD,EAAaje,GAAK,CAElF,IADAke,EAAWD,EAAa,EACkB,KAAnC5W,EAAMvB,IAAI1a,WAAW8yB,IAAkBA,IAC9C,GAAIA,EAAWle,EAAK,MACpB,GAAIke,EAAWD,IAAeL,EAAc,CAC3C,IAAK1I,EAAQ,CACZ,MAAMrJ,EAAQxE,EAAMnc,KAAK,cAAe,OAAQ,GAChD2gB,EAAM0F,OAAS/J,EACf,IAAIuE,EAAU1E,EAAMvB,IAAIva,MAAM2G,EAAK+rB,GAAYp0B,QAAQ,MAAO,KAC1DkiB,EAAQoS,WAAW,MAAQpS,EAAQqS,SAAS,MAAQ,OAAO9xB,KAAKyf,KAAUA,EAAUA,EAAQxgB,MAAM,OACtGsgB,EAAME,QAAUA,CACjB,CAEA,OADA1E,EAAMnV,IAAMgsB,GACL,CACR,CACD,CACD,CAGA,OAFKhJ,IAAQ7N,EAAM0S,SAAWvS,GAC9BH,EAAMnV,IAAMA,GACL,CACR,GAgjBC,CAAC,gBAAiBipB,GAAsBpE,UACxC,CAAC,WAAYyE,GAAiBzE,UAC9B,CAAC,OA7ZF,SAAc1P,EAAO6N,GACpB,IAAI1oB,EAAM0sB,EAAOmF,EAAKC,EAClB3F,EAAO,GACPK,EAAQ,GACRvmB,EAAQ4U,EAAMnV,IACdqsB,GAAiB,EACrB,GAAwC,KAApClX,EAAMvB,IAAI1a,WAAWic,EAAMnV,KAAa,OAAO,EACnD,MAAMyV,EAASN,EAAMnV,IACf8N,EAAMqH,EAAMK,OACZ8W,EAAanX,EAAMnV,IAAM,EACzB6V,EAAWV,EAAMO,GAAG8Q,QAAQtR,eAAeC,EAAOA,EAAMnV,KAAK,GACnE,GAAI6V,EAAW,EAAG,OAAO,EACzB,IAAI7V,EAAM6V,EAAW,EACrB,GAAI7V,EAAM8N,GAAqC,KAA9BqH,EAAMvB,IAAI1a,WAAW8G,GAAa,CAGlD,IAFAqsB,GAAiB,EACjBrsB,IACOA,EAAM8N,IACZxT,EAAO6a,EAAMvB,IAAI1a,WAAW8G,GACvB+S,GAAQzY,IAAkB,KAATA,GAFL0F,KAIlB,GAAIA,GAAO8N,EAAK,OAAO,EAGvB,GAFAvN,EAAQP,EACRmsB,EAAMhX,EAAMO,GAAG8Q,QAAQ1Q,qBAAqBX,EAAMvB,IAAK5T,EAAKmV,EAAMK,QAC9D2W,EAAIpW,GAAI,CAKX,IAJA0Q,EAAOtR,EAAMO,GAAGsJ,cAAcmN,EAAIvlB,KAC9BuO,EAAMO,GAAGuJ,aAAawH,GAAOzmB,EAAMmsB,EAAInsB,IACtCymB,EAAO,GACZlmB,EAAQP,EACDA,EAAM8N,IACZxT,EAAO6a,EAAMvB,IAAI1a,WAAW8G,GACvB+S,GAAQzY,IAAkB,KAATA,GAFL0F,KAKlB,GADAmsB,EAAMhX,EAAMO,GAAG8Q,QAAQxQ,eAAeb,EAAMvB,IAAK5T,EAAKmV,EAAMK,QACxDxV,EAAM8N,GAAOvN,IAAUP,GAAOmsB,EAAIpW,GAGrC,IAFA+Q,EAAQqF,EAAIvlB,IACZ5G,EAAMmsB,EAAInsB,IACHA,EAAM8N,IACZxT,EAAO6a,EAAMvB,IAAI1a,WAAW8G,GACvB+S,GAAQzY,IAAkB,KAATA,GAFL0F,KAKpB,EACIA,GAAO8N,GAAqC,KAA9BqH,EAAMvB,IAAI1a,WAAW8G,MAAaqsB,GAAiB,GACrErsB,GACD,CACA,GAAIqsB,EAAgB,CACnB,QAAoC,IAAzBlX,EAAMsE,IAAIzY,WAA4B,OAAO,EAUxD,GATIhB,EAAM8N,GAAqC,KAA9BqH,EAAMvB,IAAI1a,WAAW8G,IACrCO,EAAQP,EAAM,EACdA,EAAMmV,EAAMO,GAAG8Q,QAAQtR,eAAeC,EAAOnV,GACzCA,GAAO,EAAGgnB,EAAQ7R,EAAMvB,IAAIva,MAAMkH,EAAOP,KACxCA,EAAM6V,EAAW,GAChB7V,EAAM6V,EAAW,EACnBmR,IAAOA,EAAQ7R,EAAMvB,IAAIva,MAAMizB,EAAYzW,IAChDmR,EAAQ7T,GAAmB6T,GAC3BoF,EAAMjX,EAAMsE,IAAIzY,WAAWgmB,IACtBoF,EAEJ,OADAjX,EAAMnV,IAAMyV,GACL,EAERgR,EAAO2F,EAAI3F,KACXK,EAAQsF,EAAItF,KACb,CACA,IAAK9D,EAAQ,CACZ7N,EAAMnV,IAAMssB,EACZnX,EAAMK,OAASK,EACf,MAAMuJ,EAAUjK,EAAMnc,KAAK,YAAa,IAAK,GACvCoe,EAAQ,CAAC,CAAC,OAAQqP,IAGxB,GAFArH,EAAQhI,MAAQA,EACZ0P,GAAO1P,EAAMpe,KAAK,CAAC,QAAS8tB,IAC5BE,EAAO,CACV,MAAM3P,EAAO/J,OAAOiL,OAAO,MAC3BlB,EAAK2P,MAAQA,EACb5H,EAAQ/H,KAAOA,CAChB,CACAlC,EAAMyV,YACNzV,EAAMO,GAAGC,OAAOkP,SAAS1P,GACzBA,EAAMyV,YACNzV,EAAMnc,KAAK,aAAc,KAAK,EAC/B,CAGA,OAFAmc,EAAMnV,IAAMA,EACZmV,EAAMK,OAAS1H,GACR,CACR,GA2UC,CAAC,QAxUF,SAAeqH,EAAO6N,GACrB,IAAI1oB,EAAMuf,EAASmN,EAAOhnB,EAAKosB,EAAKD,EAAKrF,EAAOvmB,EAC5CkmB,EAAO,GACX,MAAMhR,EAASN,EAAMnV,IACf8N,EAAMqH,EAAMK,OAClB,GAAwC,KAApCL,EAAMvB,IAAI1a,WAAWic,EAAMnV,KAAa,OAAO,EACnD,GAA4C,KAAxCmV,EAAMvB,IAAI1a,WAAWic,EAAMnV,IAAM,GAAW,OAAO,EACvD,MAAMssB,EAAanX,EAAMnV,IAAM,EACzB6V,EAAWV,EAAMO,GAAG8Q,QAAQtR,eAAeC,EAAOA,EAAMnV,IAAM,GAAG,GACvE,GAAI6V,EAAW,EAAG,OAAO,EAEzB,GADA7V,EAAM6V,EAAW,EACb7V,EAAM8N,GAAqC,KAA9BqH,EAAMvB,IAAI1a,WAAW8G,GAAa,CAElD,IADAA,IACOA,EAAM8N,IACZxT,EAAO6a,EAAMvB,IAAI1a,WAAW8G,GACvB+S,GAAQzY,IAAkB,KAATA,GAFL0F,KAIlB,GAAIA,GAAO8N,EAAK,OAAO,EASvB,IARAvN,EAAQP,EACRmsB,EAAMhX,EAAMO,GAAG8Q,QAAQ1Q,qBAAqBX,EAAMvB,IAAK5T,EAAKmV,EAAMK,QAC9D2W,EAAIpW,KACP0Q,EAAOtR,EAAMO,GAAGsJ,cAAcmN,EAAIvlB,KAC9BuO,EAAMO,GAAGuJ,aAAawH,GAAOzmB,EAAMmsB,EAAInsB,IACtCymB,EAAO,IAEblmB,EAAQP,EACDA,EAAM8N,IACZxT,EAAO6a,EAAMvB,IAAI1a,WAAW8G,GACvB+S,GAAQzY,IAAkB,KAATA,GAFL0F,KAKlB,GADAmsB,EAAMhX,EAAMO,GAAG8Q,QAAQxQ,eAAeb,EAAMvB,IAAK5T,EAAKmV,EAAMK,QACxDxV,EAAM8N,GAAOvN,IAAUP,GAAOmsB,EAAIpW,GAGrC,IAFA+Q,EAAQqF,EAAIvlB,IACZ5G,EAAMmsB,EAAInsB,IACHA,EAAM8N,IACZxT,EAAO6a,EAAMvB,IAAI1a,WAAW8G,GACvB+S,GAAQzY,IAAkB,KAATA,GAFL0F,UAIZ8mB,EAAQ,GACf,GAAI9mB,GAAO8N,GAAqC,KAA9BqH,EAAMvB,IAAI1a,WAAW8G,GAEtC,OADAmV,EAAMnV,IAAMyV,GACL,EAERzV,GACD,KAAO,CACN,QAAoC,IAAzBmV,EAAMsE,IAAIzY,WAA4B,OAAO,EAUxD,GATIhB,EAAM8N,GAAqC,KAA9BqH,EAAMvB,IAAI1a,WAAW8G,IACrCO,EAAQP,EAAM,EACdA,EAAMmV,EAAMO,GAAG8Q,QAAQtR,eAAeC,EAAOnV,GACzCA,GAAO,EAAGgnB,EAAQ7R,EAAMvB,IAAIva,MAAMkH,EAAOP,KACxCA,EAAM6V,EAAW,GAChB7V,EAAM6V,EAAW,EACnBmR,IAAOA,EAAQ7R,EAAMvB,IAAIva,MAAMizB,EAAYzW,IAChDmR,EAAQ7T,GAAmB6T,GAC3BoF,EAAMjX,EAAMsE,IAAIzY,WAAWgmB,IACtBoF,EAEJ,OADAjX,EAAMnV,IAAMyV,GACL,EAERgR,EAAO2F,EAAI3F,KACXK,EAAQsF,EAAItF,KACb,CACA,IAAK9D,EAAQ,CACZnJ,EAAU1E,EAAMvB,IAAIva,MAAMizB,EAAYzW,GACtC,MAAM2D,EAAS,GACfrE,EAAMO,GAAGC,OAAOhZ,MAAMkd,EAAS1E,EAAMO,GAAIP,EAAMsE,IAAKD,GACpD,MAAMG,EAAQxE,EAAMnc,KAAK,QAAS,MAAO,GACnCoe,EAAQ,CAAC,CAAC,MAAOqP,GAAO,CAAC,MAAO,KAKtC,GAJA9M,EAAMvC,MAAQA,EACduC,EAAMa,SAAWhB,EACjBG,EAAME,QAAUA,EACZiN,GAAO1P,EAAMpe,KAAK,CAAC,QAAS8tB,IAC5BE,EAAO,CACV,MAAM3P,EAAO/J,OAAOiL,OAAO,MAC3BlB,EAAK2P,MAAQA,EACbrN,EAAMtC,KAAOA,CACd,CACD,CAGA,OAFAlC,EAAMnV,IAAMA,EACZmV,EAAMK,OAAS1H,GACR,CACR,GAwPC,CAAC,WAnPF,SAAkBqH,EAAO6N,GACxB,IAAIhjB,EAAMmV,EAAMnV,IAChB,GAAkC,KAA9BmV,EAAMvB,IAAI1a,WAAW8G,GAAa,OAAO,EAC7C,MAAMO,EAAQ4U,EAAMnV,IACd8N,EAAMqH,EAAMK,OAClB,OAAS,CACR,KAAMxV,GAAO8N,EAAK,OAAO,EACzB,MAAMjV,EAAKsc,EAAMvB,IAAI1a,WAAW8G,GAChC,GAAW,KAAPnH,EAAW,OAAO,EACtB,GAAW,KAAPA,EAAW,KAChB,CACA,MAAM6B,EAAMya,EAAMvB,IAAIva,MAAMkH,EAAQ,EAAGP,GACvC,GAAIwpB,GAAYpvB,KAAKM,GAAM,CAC1B,MAAMqkB,EAAU5J,EAAMO,GAAGsJ,cAActkB,GACvC,IAAKya,EAAMO,GAAGuJ,aAAaF,GAAU,OAAO,EAC5C,IAAKiE,EAAQ,CACZ,MAAM5D,EAAUjK,EAAMnc,KAAK,YAAa,IAAK,GAC7ComB,EAAQhI,MAAQ,CAAC,CAAC,OAAQ2H,IAC1BK,EAAQC,OAAS,WACjBD,EAAQtF,KAAO,OACC3E,EAAMnc,KAAK,OAAQ,GAAI,GAC/B6gB,QAAU1E,EAAMO,GAAGyJ,kBAAkBzkB,GAC7C,MAAM6kB,EAAUpK,EAAMnc,KAAK,aAAc,KAAK,GAC9CumB,EAAQF,OAAS,WACjBE,EAAQzF,KAAO,MAChB,CAEA,OADA3E,EAAMnV,KAAOtF,EAAIzB,OAAS,GACnB,CACR,CACA,GAAIswB,GAASnvB,KAAKM,GAAM,CACvB,MAAMqkB,EAAU5J,EAAMO,GAAGsJ,cAAc,UAAUtkB,KACjD,IAAKya,EAAMO,GAAGuJ,aAAaF,GAAU,OAAO,EAC5C,IAAKiE,EAAQ,CACZ,MAAM5D,EAAUjK,EAAMnc,KAAK,YAAa,IAAK,GAC7ComB,EAAQhI,MAAQ,CAAC,CAAC,OAAQ2H,IAC1BK,EAAQC,OAAS,WACjBD,EAAQtF,KAAO,OACC3E,EAAMnc,KAAK,OAAQ,GAAI,GAC/B6gB,QAAU1E,EAAMO,GAAGyJ,kBAAkBzkB,GAC7C,MAAM6kB,EAAUpK,EAAMnc,KAAK,aAAc,KAAK,GAC9CumB,EAAQF,OAAS,WACjBE,EAAQzF,KAAO,MAChB,CAEA,OADA3E,EAAMnV,KAAOtF,EAAIzB,OAAS,GACnB,CACR,CACA,OAAO,CACR,GAqMC,CAAC,cA7JF,SAAqBkc,EAAO6N,GAC3B,IAAK7N,EAAMO,GAAGvI,QAAQnW,KAAM,OAAO,EACnC,MAAM8W,EAAMqH,EAAMK,OACZxV,EAAMmV,EAAMnV,IAClB,GAAkC,KAA9BmV,EAAMvB,IAAI1a,WAAW8G,IAAeA,EAAM,GAAK8N,EAAK,OAAO,EAC/D,IAAIjN,EACJ,MAAMhI,EAAKsc,EAAMvB,IAAI1a,WAAW8G,EAAM,GACtC,GAAW,KAAPnH,GAAoB,KAAPA,EAAWgI,EAlC7B,SAAqBsU,EAAOnV,GAC3B,MAAM4T,EAAMuB,EAAMvB,IAClB,IAAIrT,EACAgsB,EACJ,GAAI3Y,EAAIqY,WAAW,UAAQjsB,GAAM,CAChC,GAAI4T,EAAIqY,WAAW,IAAKjsB,EAAM,GAAI,OAAOA,EAAM,EAC/C,GAAI4T,EAAIqY,WAAW,KAAMjsB,EAAM,GAAI,OAAOA,EAAM,EAChDO,EAAQP,EAAM,EACdusB,EAAa,QACd,MAAO,GAAI3Y,EAAIqY,WAAW,YAAajsB,GACtCO,EAAQP,EAAM,EACdusB,EAAa,WACP,GAAgC,KAA5B3Y,EAAI1a,WAAW8G,EAAM,GAC/BO,EAAQP,EAAM,EACdusB,EAAa,SACP,KAAI9C,GAAS7V,EAAI1a,WAAW8G,EAAM,IAGlC,OAAO,EAFbO,EAAQP,EAAM,EACdusB,EAAa,GACE,CAChB,GAAIpX,EAAMqX,gBAAiB,OAAO,EAClC,MAAM3rB,EAAM+S,EAAI7Y,QAAQwxB,EAAYhsB,GACpC,OAAIM,EAAM,GACTsU,EAAMqX,iBAAkB,GACjB,GAED3rB,EAAM0rB,EAAWtzB,MACzB,CAQmCwzB,CAAYtX,EAAOnV,OAChD,IAAW,KAAPnH,IAAa4wB,GAAS5wB,GAGxB,OAAO,EAHsB,CACnC,MAAMyE,EAAQ6X,EAAMvB,IAAIva,MAAM2G,GAAK1C,MAAMulB,IACzChiB,EAAMvD,EAAQ0C,EAAM1C,EAAM,GAAGrE,QAAS,CACvC,CAAmB,CACnB,GAAI4H,EAAM,EAAG,OAAO,EACpB,IAAKmiB,EAAQ,CACZ,MAAMrJ,EAAQxE,EAAMnc,KAAK,cAAe,GAAI,GAC5C2gB,EAAME,QAAU1E,EAAMvB,IAAIva,MAAM2G,EAAKa,GApDnB+F,EAqDH+S,EAAME,QApDf,YAAYzf,KAAKwM,IAoDQuO,EAAMyV,YAlDvC,SAAqBhkB,GACpB,MAAO,aAAaxM,KAAKwM,EAC1B,CAiDM8lB,CAAY/S,EAAME,UAAU1E,EAAMyV,WACvC,CAvDD,IAAoBhkB,EAyDnB,OADAuO,EAAMnV,IAAMa,GACL,CACR,GAyIC,CAAC,SApIF,SAAgBsU,EAAO6N,GACtB,MAAMhjB,EAAMmV,EAAMnV,IACZ8N,EAAMqH,EAAMK,OAClB,GAAkC,KAA9BL,EAAMvB,IAAI1a,WAAW8G,GAAa,OAAO,EAC7C,GAAIA,EAAM,GAAK8N,EAAK,OAAO,EAC3B,GAAsC,KAAlCqH,EAAMvB,IAAI1a,WAAW8G,EAAM,GAAW,CACzC,MAAM1C,EAAQ6X,EAAMvB,IAAIva,MAAM2G,GAAK1C,MAAMqsB,IACzC,GAAIrsB,EAAO,CACV,IAAK0lB,EAAQ,CACZ,MAAM1oB,EAAqC,MAA9BgD,EAAM,GAAG,GAAGF,cAAwBzD,SAAS2D,EAAM,GAAGjE,MAAM,GAAI,IAAMM,SAAS2D,EAAM,GAAI,IAChGqc,EAAQxE,EAAMnc,KAAK,eAAgB,GAAI,GAC7C2gB,EAAME,QAAU7G,GAAkB1Y,GAAQ0E,GAAc1E,GAAQ0E,GAAc,OAC9E2a,EAAM0F,OAAS/hB,EAAM,GACrBqc,EAAMG,KAAO,QACd,CAEA,OADA3E,EAAMnV,KAAO1C,EAAM,GAAGrE,QACf,CACR,CACD,KAAO,CACN,MAAMqE,EAAQ6X,EAAMvB,IAAIva,MAAM2G,GAAK1C,MAAMssB,IACzC,GAAItsB,EAAO,CACV,MAAMgX,EAAU9P,GAAiBlH,EAAM,IACvC,GAAIgX,IAAYhX,EAAM,GAAI,CACzB,IAAK0lB,EAAQ,CACZ,MAAMrJ,EAAQxE,EAAMnc,KAAK,eAAgB,GAAI,GAC7C2gB,EAAME,QAAUvF,EAChBqF,EAAM0F,OAAS/hB,EAAM,GACrBqc,EAAMG,KAAO,QACd,CAEA,OADA3E,EAAMnV,KAAO1C,EAAM,GAAGrE,QACf,CACR,CACD,CACD,CACA,OAAO,CACR,IAmGI0zB,GAAU,CACb,CAAC,gBA9CF,SAAoBxX,GACnB,MAAMwS,EAAcxS,EAAMwS,YACpB7Z,EAAMqH,EAAMwS,YAAY1uB,OAC9B4wB,GAAkB1U,EAAM6S,YACxB,IAAK,IAAI7J,EAAO,EAAGA,EAAOrQ,EAAKqQ,IAAQ,CACtC,IAAIiL,EACJ,MAAMpB,EAAyD,QAA3CoB,EAAoBzB,EAAYxJ,UAAyC,IAAtBiL,OAA+B,EAASA,EAAkBpB,WAC7HA,GAAY6B,GAAkB7B,EACnC,CACD,GAsCC,CAAC,gBAAiBiB,GAAsBE,aACxC,CAAC,WAAYG,GAAiBH,aAC9B,CAAC,iBArCF,SAAwBhU,GACvB,IAAIgJ,EAAMC,EACN/W,EAAQ,EACZ,MAAMmS,EAASrE,EAAMqE,OACf1L,EAAMqH,EAAMqE,OAAOvgB,OACzB,IAAKklB,EAAOC,EAAO,EAAGD,EAAOrQ,EAAKqQ,IAC7B3E,EAAO2E,GAAMhH,QAAU,GAAG9P,IAC9BmS,EAAO2E,GAAM9W,MAAQA,EACjBmS,EAAO2E,GAAMhH,QAAU,GAAG9P,IACJ,SAAtBmS,EAAO2E,GAAMxO,MAAmBwO,EAAO,EAAIrQ,GAAiC,SAA1B0L,EAAO2E,EAAO,GAAGxO,KAAiB6J,EAAO2E,EAAO,GAAGtE,QAAUL,EAAO2E,GAAMtE,QAAUL,EAAO2E,EAAO,GAAGtE,SAEtJsE,IAASC,IAAM5E,EAAO4E,GAAQ5E,EAAO2E,IACzCC,KAGED,IAASC,IAAM5E,EAAOvgB,OAASmlB,EACpC,IA0BIwO,GAAe,MAClB,WAAAnmB,GACCqQ,GACCzb,KAIA,QACA,IAAIwc,IAELf,GACCzb,KAKA,SACA,IAAIwc,IAELf,GAAgBzb,KAAM,QAASqsB,IAC/B,IAAK,IAAI9uB,EAAI,EAAGA,EAAI+xB,GAAO1xB,OAAQL,IAAKyC,KAAK2kB,MAAMhnB,KAAK2xB,GAAO/xB,GAAG,GAAI+xB,GAAO/xB,GAAG,IAChF,IAAK,IAAIA,EAAI,EAAGA,EAAI+zB,GAAQ1zB,OAAQL,IAAKyC,KAAKwxB,OAAO7zB,KAAK2zB,GAAQ/zB,GAAG,GAAI+zB,GAAQ/zB,GAAG,GACrF,CACA,SAAAgd,CAAUT,GACT,MAAMnV,EAAMmV,EAAMnV,IACZob,EAAQ/f,KAAK2kB,MAAM3G,SAAS,IAC5B3K,EAAM0M,EAAMniB,OACZouB,EAAalS,EAAMO,GAAGvI,QAAQka,WAC9B1uB,EAAQwc,EAAMxc,MACpB,QAA0B,IAAfA,EAAMqH,GAEhB,YADAmV,EAAMnV,IAAMrH,EAAMqH,IAGnB,IAAI+V,GAAK,EACT,GAAIZ,EAAM9N,MAAQggB,GAAY,IAAK,IAAIzuB,EAAI,EAAGA,EAAI8V,EAAK9V,IAItD,GAHAuc,EAAM9N,QACN0O,EAAKqF,EAAMxiB,GAAGuc,GAAO,GACrBA,EAAM9N,QACF0O,EAAI,CACP,GAAI/V,GAAOmV,EAAMnV,IAAK,MAAM,IAAI2Y,MAAM,0CACtC,KACD,OAEIxD,EAAMnV,IAAMmV,EAAMK,OAClBO,GAAIZ,EAAMnV,MACfrH,EAAMqH,GAAOmV,EAAMnV,GACpB,CACA,QAAA6kB,CAAS1P,GACR,MAAMiG,EAAQ/f,KAAK2kB,MAAM3G,SAAS,IAC5B3K,EAAM0M,EAAMniB,OACZ4H,EAAMsU,EAAMK,OACZ6R,EAAalS,EAAMO,GAAGvI,QAAQka,WACpC,KAAOlS,EAAMnV,IAAMa,GAAK,CACvB,MAAM0U,EAAUJ,EAAMnV,IACtB,IAAI+V,GAAK,EACT,GAAIZ,EAAM9N,MAAQggB,EAAY,IAAK,IAAIzuB,EAAI,EAAGA,EAAI8V,EAAK9V,IAEtD,GADAmd,EAAKqF,EAAMxiB,GAAGuc,GAAO,GACjBY,EAAI,CACP,GAAIR,GAAWJ,EAAMnV,IAAK,MAAM,IAAI2Y,MAAM,0CAC1C,KACD,CAED,GAAI5C,GACH,GAAIZ,EAAMnV,KAAOa,EAAK,WAGvBsU,EAAM0S,SAAW1S,EAAMvB,IAAIuB,EAAMnV,MAClC,CACImV,EAAM0S,SAAS1S,EAAMyS,aAC1B,CAIA,KAAAjrB,CAAMiK,EAAK8O,EAAI+D,EAAK+N,GACnB,MAAMrS,EAAQ,IAAI9Z,KAAKosB,MAAM7gB,EAAK8O,EAAI+D,EAAK+N,GAC3CnsB,KAAKwpB,SAAS1P,GACd,MAAMiG,EAAQ/f,KAAKwxB,OAAOxT,SAAS,IAC7B3K,EAAM0M,EAAMniB,OAClB,IAAK,IAAIL,EAAI,EAAGA,EAAI8V,EAAK9V,IAAKwiB,EAAMxiB,GAAGuc,EACxC,GAIGhe,GAAS,CACZ21B,QAAS,CACR3f,QAAS,CACRnW,MAAM,EACN0jB,UAAU,EACVC,QAAQ,EACRN,WAAY,YACZoE,SAAS,EACTqB,aAAa,EACbjC,OAAQ,OACR1D,UAAW,KACXkN,WAAY,KAEb0F,WAAY,CACXC,KAAM,CAAA,EACNhS,MAAO,CAAA,EACPrF,OAAQ,CAAA,IAGVsX,KAAM,CACL9f,QAAS,CACRnW,MAAM,EACN0jB,UAAU,EACVC,QAAQ,EACRN,WAAY,YACZoE,SAAS,EACTqB,aAAa,EACbjC,OAAQ,OACR1D,UAAW,KACXkN,WAAY,IAEb0F,WAAY,CACXC,KAAM,CAAE5R,MAAO,CACd,YACA,QACA,mBACA,SACA,cAEDJ,MAAO,CAAEI,MAAO,CAAC,cACjBzF,OAAQ,CACPyF,MAAO,CAAC,QACR8R,OAAQ,CAAC,gBAAiB,qBAI7BC,WAAY,CACXhgB,QAAS,CACRnW,MAAM,EACN0jB,UAAU,EACVC,QAAQ,EACRN,WAAY,YACZoE,SAAS,EACTqB,aAAa,EACbjC,OAAQ,OACR1D,UAAW,KACXkN,WAAY,IAEb0F,WAAY,CACXC,KAAM,CAAE5R,MAAO,CACd,YACA,QACA,mBACA,SACA,cAEDJ,MAAO,CAAEI,MAAO,CACf,aACA,OACA,QACA,UACA,KACA,aACA,WACA,OACA,YACA,cAEDzF,OAAQ,CACPyF,MAAO,CACN,WACA,YACA,WACA,SACA,SACA,cACA,QACA,OACA,UACA,QAED8R,OAAQ,CACP,gBACA,WACA,sBAMDE,GAAe,oCACfC,GAAe,oCACfC,GAAsB,CACzB,QACA,SACA,WAOGC,GAAa,MAiBhB,YAAAtO,CAAavkB,GACZ,MAAMkM,EAAMlM,EAAI1C,OAAOoF,cACvB,OAAOgwB,GAAahzB,KAAKwM,IAAOymB,GAAajzB,KAAKwM,EACnD,CAKA,aAAAoY,CAActkB,GACb,MAAM8yB,EAASC,EAAY/yB,GAAK,GAChC,GAAI8yB,EAAO1yB,YACL0yB,EAAO7yB,UAAY2yB,GAAoBvyB,QAAQyyB,EAAO7yB,WAAa,GAAG,IAC1E6yB,EAAO1yB,SAAW8W,GAAiB4b,EAAO1yB,SAC3C,CAAE,MAAO4yB,GAAK,CAOf,OALIF,EAAO3yB,OAAM2yB,EAAO3yB,KAAO8yB,EAAaH,EAAO3yB,OAC/C2yB,EAAO1yB,WAAU0yB,EAAO1yB,SAAW6yB,EAAaH,EAAO1yB,WACvD0yB,EAAOvyB,WAAUuyB,EAAOvyB,SAAW0yB,EAAaH,EAAOvyB,WACvDuyB,EAAOtyB,SAAQsyB,EAAOtyB,OAASyyB,EAAaH,EAAOtyB,SACnDsyB,EAAOryB,OAAMqyB,EAAOryB,KAAOwyB,EAAaH,EAAOryB,OAC5CyyB,EAAaJ,EACrB,CAIA,iBAAArO,CAAkBzkB,GACjB,MAAM8yB,EAASC,EAAY/yB,GAAK,GAChC,GAAI8yB,EAAO1yB,YACL0yB,EAAO7yB,UAAY2yB,GAAoBvyB,QAAQyyB,EAAO7yB,WAAa,GAAG,IAC1E6yB,EAAO1yB,SAAW8W,GAAmB4b,EAAO1yB,SAC7C,CAAE,MAAO4yB,GAAK,CAEf,OAAOG,EAAaD,EAAaJ,GAASK,EAAan1B,aAAe,IACvE,CACA,WAAA+N,IAAe+M,GACdsD,GACCzb,KAMA,SACA,IAAIuxB,IAEL9V,GACCzb,KAMA,QACA,IAAI+rB,IAELtQ,GACCzb,KAMA,OACA,IAAI0kB,IAELjJ,GACCzb,KAqBA,WACA,IAAIuf,IAEL9D,GACCzb,KAMA,UACA,IAAI2R,IAEL8J,GACCzb,KAKA,QACAkX,IAEDuE,GACCzb,KAKA,UACAiS,OAAOuN,OAAO,CAAA,EAAI1E,KAEnB,MAAO2X,EAAqB3gB,GAAWqG,EACJ,iBAAxBsa,GACVzyB,KAAK0yB,UAAUD,GACX3gB,GAAS9R,KAAKqL,IAAIyG,KAEtB9R,KAAK0yB,UAAU,WACf1yB,KAAKqL,IAAIonB,GAAuB,IAElC,CAmBA,GAAApnB,CAAIyG,GAEH,OADAG,OAAOuN,OAAOxf,KAAK8R,QAASA,GACrB9R,IACR,CASA,SAAA0yB,CAAUC,GACT,IAAIC,EACJ,GAAuB,iBAAZD,EAAsB,CAGhC,GADAC,EAAI92B,GADe62B,IAEdC,EAAG,MAAM,IAAItV,MAAM,+BAFLqV,iBAGpB,MAAOC,EAAID,EACX,IAAKC,EAAG,MAAM,IAAItV,MAAM,8CACpBsV,EAAE9gB,UAAS9R,KAAK8R,QAAU,IAAK8gB,EAAE9gB,UACrC,MAAM4f,EAAakB,EAAElB,WACrB,GAAIA,EAAY,CACf,IAAImB,EACJ,CACC,OACA,QACA,UACC3hB,SAASjB,IACV,IAAI6iB,EACJ,MAAM/S,EAAkD,QAAzC+S,EAAmBpB,EAAWzhB,UAAwC,IAArB6iB,OAA8B,EAASA,EAAiB/S,MACpHA,GAAO/f,KAAKiQ,GAAM0U,MAAM7G,WAAWiC,EAAM,IAE9C,MAAM8R,EAAsD,QAA5CgB,EAAqBnB,EAAWpX,cAA2C,IAAvBuY,OAAgC,EAASA,EAAmBhB,OAC5HA,GAAQ7xB,KAAKsa,OAAOkX,OAAO1T,WAAW+T,EAC3C,CACA,OAAO7xB,IACR,CAeA,MAAA4d,CAAOpK,EAAMqK,GAAgB,GAC5B,IAAI1f,EAAS,GACRuV,MAAMC,QAAQH,KAAOA,EAAO,CAACA,IAClC,CACC,OACA,QACA,UACCtC,SAASkM,IACVjf,EAASA,EAAOkC,OAAOL,KAAKod,GAAOuH,MAAM/G,OAAOpK,GAAM,GAAM,IAE7DrV,EAASA,EAAOkC,OAAOL,KAAKsa,OAAOkX,OAAO5T,OAAOpK,GAAM,IACvD,MAAMuf,EAASvf,EAAKwf,QAAQ/iB,GAAS9R,EAAOuB,QAAQuQ,GAAQ,IAC5D,GAAI8iB,EAAOn1B,SAAWigB,EAAe,MAAM,IAAIP,MAAM,iDAAiDyV,KACtG,OAAO/yB,IACR,CAIA,OAAA+d,CAAQvK,EAAMqK,GAAgB,GAC7B,IAAI1f,EAAS,GACRuV,MAAMC,QAAQH,KAAOA,EAAO,CAACA,IAClC,CACC,OACA,QACA,UACCtC,SAASkM,IACVjf,EAASA,EAAOkC,OAAOL,KAAKod,GAAOuH,MAAM5G,QAAQvK,GAAM,GAAM,IAE9DrV,EAASA,EAAOkC,OAAOL,KAAKsa,OAAOkX,OAAOzT,QAAQvK,GAAM,IACxD,MAAMuf,EAASvf,EAAKwf,QAAQ/iB,GAAS9R,EAAOuB,QAAQuQ,GAAQ,IAC5D,GAAI8iB,EAAOn1B,SAAWigB,EAAe,MAAM,IAAIP,MAAM,kDAAkDyV,KACvG,OAAO/yB,IACR,CAgBA,GAAAizB,CAAIC,KAAWxK,GAEd,OADAwK,EAAOC,MAAMD,EAAQ,CAAClzB,QAAS0oB,IACxB1oB,IACR,CAYA,KAAAsB,CAAMiX,EAAK6F,GACV,GAAmB,iBAAR7F,EAAkB,MAAM,IAAI+E,MAAM,iCAC7C,MAAMxD,EAAQ,IAAI9Z,KAAK2xB,KAAKvF,MAAM7T,EAAKvY,KAAMoe,GAE7C,OADApe,KAAK2xB,KAAK/M,QAAQ9K,GACXA,EAAMqE,MACd,CAQA,MAAA6B,CAAOzH,EAAK6F,EAAM,IACjB,OAAOpe,KAAKozB,SAASpT,OAAOhgB,KAAKsB,MAAMiX,EAAK6F,GAAMpe,KAAK8R,QAASsM,EACjE,CAMA,WAAAiV,CAAY9a,EAAK6F,GAChB,MAAMtE,EAAQ,IAAI9Z,KAAK2xB,KAAKvF,MAAM7T,EAAKvY,KAAMoe,GAG7C,OAFAtE,EAAMmJ,YAAa,EACnBjjB,KAAK2xB,KAAK/M,QAAQ9K,GACXA,EAAMqE,MACd,CAKA,YAAA2B,CAAavH,EAAK6F,EAAM,IACvB,OAAOpe,KAAKozB,SAASpT,OAAOhgB,KAAKqzB,YAAY9a,EAAK6F,GAAMpe,KAAK8R,QAASsM,EACvE,GAED3C,GAAgByW,GAAY,QAAStW,IACrCH,GAAgByW,GAAY,QAAS1V,IACrCf,GAAgByW,GAAY,WAAY3S,IACxC9D,GAAgByW,GAAY,aAAcxN,IAC1CjJ,GAAgByW,GAAY,YAAajS,IACzCxE,GAAgByW,GAAY,cAAenG,IAC3CtQ,GAAgByW,GAAY,aAAcrN,IAC1CpJ,GAAgByW,GAAY,eAAgBX,IAC5C9V,GAAgByW,GAAY,cAAe7F,IAa3C,IAAIiH,GAAqBjc,GAAS6a,IC11H3B,MCSD7X,GAAK,IAAI6X,GAMFqB,GAAuEA,EAAGC,iBACrF,MAAOC,EAAQC,GAAaC,EAAS,GAC/BC,EAAeC,EAAW13B,MAAM2L,QAEhCgsB,EAAUN,EAAWhjB,MAAQ,GAC7BujB,EAAYC,GAAQ,IACnBF,EAGEl4B,EAAmBye,GAAG2F,OAAO8T,IAF3B,IAGR,CAACA,IAEEG,EAASD,GAAQ,KACrB,IAAKD,EAAW,MAAO,GAEvB,MAAMG,Ef0VgCC,KACtC,GAA0B,oBAAfC,aAA+BA,WAAWC,SACjD,MAAO,GAEX,MAAMj4B,EAAag4B,WAAWE,iBAAiBF,WAAWC,SAASE,iBAEnE,OADsB7gB,MAAMgS,KAAK,IAAI7oB,IAAIs3B,EAAQlyB,MAAM,cAAgB,KAElE+N,KAAKC,IACN,MAAMukB,EAAWp4B,EAAWY,iBAAiBiT,GAAMtT,OAC7CR,EAAQD,EAAgBs4B,EAAUp4B,EAAY,IAAIS,IAAI,CAACoT,KAAQtT,OACrE,OAAOR,EAAQ,GAAG8T,MAAS9T,KAAW,EAAE,IAEvC62B,OAAOyB,SACPxxB,KAAK,KAAK,EevWSyxB,CAA0B14B,GAClD,MAAO,sCACS43B,gEAGAM,0BACPl4B,wGAGH+3B,mBACF,GACH,CAACH,EAAcG,IAOlB,OAAKA,EAKHY,SAAKC,UAAWC,EAAO,+BAA8B,cAAc,8BAA6B1V,SAC7F8U,GACCU,YACElJ,MAAM,sBACNwI,OAAQA,EACRa,MAAM,OACNrB,OAAQA,QAAUsB,EAClBC,YAAa,EACbC,QAAQ,oBACRC,OAnBY9Z,IAClB,MAAM+Z,EAAS/Z,EAAEga,cACjB1B,ED7CmCyB,KACrC,MAAMZ,EAAkBY,EAAOE,iBAAiBd,gBAC1Ce,EAAOH,EAAOE,iBAAiBC,KAC/BC,EAAiBD,GAAME,wBAAwB/B,QAAU,EACzDgC,EAAejjB,KAAKC,IAAI6iB,GAAMG,cAAgB,EAAGlB,GAAiBkB,cAAgB,GAClFC,EAAeljB,KAAKC,IAAI6iB,GAAMI,cAAgB,EAAGnB,GAAiBmB,cAAgB,GAExF,OAAOljB,KAAKmjB,KAAKnjB,KAAKC,IAAI8iB,EAAgBE,EAAcC,GAAc,ECsC1DE,CAAuBT,GAAQ,MAIlC,IAgBD","x_google_ignoreList":[2,3,4,5,6,7,8,9,10,11,12,13,14]}