ember-repl 7.0.1 → 7.0.2

package/dist/index-C8S2G0FH.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-C8S2G0FH.js","sources":["../../../node_modules/.pnpm/micromark-util-sanitize-uri@2.0.1/node_modules/micromark-util-sanitize-uri/index.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/blockquote.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/break.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/code.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/delete.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/emphasis.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/footnote-reference.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/heading.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/html.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/revert.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/image-reference.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/image.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/inline-code.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/link-reference.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/link.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/list-item.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/list.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/paragraph.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/root.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/strong.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/table.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/table-row.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/table-cell.js","../../../node_modules/.pnpm/trim-lines@3.0.1/node_modules/trim-lines/index.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/text.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/thematic-break.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/handlers/index.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/footer.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/state.js","../../../node_modules/.pnpm/mdast-util-to-hast@13.2.0/node_modules/mdast-util-to-hast/lib/index.js","../../../node_modules/.pnpm/remark-rehype@11.1.2/node_modules/remark-rehype/lib/index.js"],"sourcesContent":["import { asciiAlphanumeric } from 'micromark-util-character';\nimport { encode } from 'micromark-util-encode';\n/**\n * Make a value safe for injection as a URL.\n *\n * This encodes unsafe characters with percent-encoding and skips already\n * encoded sequences (see `normalizeUri`).\n * Further unsafe characters are encoded as character references (see\n * `micromark-util-encode`).\n *\n * A regex of allowed protocols can be given, in which case the URL is\n * sanitized.\n * For example, `/^(https?|ircs?|mailto|xmpp)$/i` can be used for `a[href]`, or\n * `/^https?$/i` for `img[src]` (this is what `github.com` allows).\n * If the URL includes an unknown protocol (one not matched by `protocol`, such\n * as a dangerous example, `javascript:`), the value is ignored.\n *\n * @param {string | null | undefined} url\n *   URI to sanitize.\n * @param {RegExp | null | undefined} [protocol]\n *   Allowed protocols.\n * @returns {string}\n *   Sanitized URI.\n */\nexport function sanitizeUri(url, protocol) {\n  const value = encode(normalizeUri(url || ''));\n  if (!protocol) {\n    return value;\n  }\n  const colon = value.indexOf(':');\n  const questionMark = value.indexOf('?');\n  const numberSign = value.indexOf('#');\n  const slash = value.indexOf('/');\n  if (\n  // If there is no protocol, it’s relative.\n  colon < 0 ||\n  // If the first colon is after a `?`, `#`, or `/`, it’s not a protocol.\n  slash > -1 && colon > slash || questionMark > -1 && colon > questionMark || numberSign > -1 && colon > numberSign ||\n  // It is a protocol, it should be allowed.\n  protocol.test(value.slice(0, colon))) {\n    return value;\n  }\n  return '';\n}\n\n/**\n * Normalize a URL.\n *\n * Encode unsafe characters with percent-encoding, skipping already encoded\n * sequences.\n *\n * @param {string} value\n *   URI to normalize.\n * @returns {string}\n *   Normalized URI.\n */\nexport function normalizeUri(value) {\n  /** @type {Array<string>} */\n  const result = [];\n  let index = -1;\n  let start = 0;\n  let skip = 0;\n  while (++index < value.length) {\n    const code = value.charCodeAt(index);\n    /** @type {string} */\n    let replace = '';\n\n    // A correct percent encoded value.\n    if (code === 37 && asciiAlphanumeric(value.charCodeAt(index + 1)) && asciiAlphanumeric(value.charCodeAt(index + 2))) {\n      skip = 2;\n    }\n    // ASCII.\n    else if (code < 128) {\n      if (!/[!#$&-;=?-Z_a-z~]/.test(String.fromCharCode(code))) {\n        replace = String.fromCharCode(code);\n      }\n    }\n    // Astral.\n    else if (code > 55_295 && code < 57_344) {\n      const next = value.charCodeAt(index + 1);\n\n      // A correct surrogate pair.\n      if (code < 56_320 && next > 56_319 && next < 57_344) {\n        replace = String.fromCharCode(code, next);\n        skip = 1;\n      }\n      // Lone surrogate.\n      else {\n        replace = \"\\uFFFD\";\n      }\n    }\n    // Unicode.\n    else {\n      replace = String.fromCharCode(code);\n    }\n    if (replace) {\n      result.push(value.slice(start, index), encodeURIComponent(replace));\n      start = index + skip + 1;\n      replace = '';\n    }\n    if (skip) {\n      index += skip;\n      skip = 0;\n    }\n  }\n  return result.join('') + value.slice(start);\n}","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Blockquote} Blockquote\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `blockquote` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Blockquote} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function blockquote(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'blockquote',\n    properties: {},\n    children: state.wrap(state.all(node), true)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Text} Text\n * @typedef {import('mdast').Break} Break\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `break` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Break} node\n *   mdast node.\n * @returns {Array<Element | Text>}\n *   hast element content.\n */\nexport function hardBreak(state, node) {\n  /** @type {Element} */\n  const result = {type: 'element', tagName: 'br', properties: {}, children: []}\n  state.patch(node, result)\n  return [state.applyData(node, result), {type: 'text', value: '\\n'}]\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').Code} Code\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `code` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Code} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function code(state, node) {\n  const value = node.value ? node.value + '\\n' : ''\n  /** @type {Properties} */\n  const properties = {}\n\n  if (node.lang) {\n    properties.className = ['language-' + node.lang]\n  }\n\n  // Create `<code>`.\n  /** @type {Element} */\n  let result = {\n    type: 'element',\n    tagName: 'code',\n    properties,\n    children: [{type: 'text', value}]\n  }\n\n  if (node.meta) {\n    result.data = {meta: node.meta}\n  }\n\n  state.patch(node, result)\n  result = state.applyData(node, result)\n\n  // Create `<pre>`.\n  result = {type: 'element', tagName: 'pre', properties: {}, children: [result]}\n  state.patch(node, result)\n  return result\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Delete} Delete\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `delete` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Delete} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function strikethrough(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'del',\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Emphasis} Emphasis\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `emphasis` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Emphasis} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function emphasis(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'em',\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').FootnoteReference} FootnoteReference\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\n\n/**\n * Turn an mdast `footnoteReference` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {FootnoteReference} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function footnoteReference(state, node) {\n  const clobberPrefix =\n    typeof state.options.clobberPrefix === 'string'\n      ? state.options.clobberPrefix\n      : 'user-content-'\n  const id = String(node.identifier).toUpperCase()\n  const safeId = normalizeUri(id.toLowerCase())\n  const index = state.footnoteOrder.indexOf(id)\n  /** @type {number} */\n  let counter\n\n  let reuseCounter = state.footnoteCounts.get(id)\n\n  if (reuseCounter === undefined) {\n    reuseCounter = 0\n    state.footnoteOrder.push(id)\n    counter = state.footnoteOrder.length\n  } else {\n    counter = index + 1\n  }\n\n  reuseCounter += 1\n  state.footnoteCounts.set(id, reuseCounter)\n\n  /** @type {Element} */\n  const link = {\n    type: 'element',\n    tagName: 'a',\n    properties: {\n      href: '#' + clobberPrefix + 'fn-' + safeId,\n      id:\n        clobberPrefix +\n        'fnref-' +\n        safeId +\n        (reuseCounter > 1 ? '-' + reuseCounter : ''),\n      dataFootnoteRef: true,\n      ariaDescribedBy: ['footnote-label']\n    },\n    children: [{type: 'text', value: String(counter)}]\n  }\n  state.patch(node, link)\n\n  /** @type {Element} */\n  const sup = {\n    type: 'element',\n    tagName: 'sup',\n    properties: {},\n    children: [link]\n  }\n  state.patch(node, sup)\n  return state.applyData(node, sup)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Heading} Heading\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `heading` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Heading} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function heading(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'h' + node.depth,\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Html} Html\n * @typedef {import('../state.js').State} State\n * @typedef {import('../../index.js').Raw} Raw\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `html` node into hast (`raw` node in dangerous mode, otherwise\n * nothing).\n *\n * @param {State} state\n *   Info passed around.\n * @param {Html} node\n *   mdast node.\n * @returns {Element | Raw | undefined}\n *   hast node.\n */\nexport function html(state, node) {\n  if (state.options.allowDangerousHtml) {\n    /** @type {Raw} */\n    const result = {type: 'raw', value: node.value}\n    state.patch(node, result)\n    return state.applyData(node, result)\n  }\n\n  return undefined\n}\n","/**\n * @typedef {import('hast').ElementContent} ElementContent\n *\n * @typedef {import('mdast').Nodes} Nodes\n * @typedef {import('mdast').Reference} Reference\n *\n * @typedef {import('./state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Return the content of a reference without definition as plain text.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Extract<Nodes, Reference>} node\n *   Reference node (image, link).\n * @returns {Array<ElementContent>}\n *   hast content.\n */\nexport function revert(state, node) {\n  const subtype = node.referenceType\n  let suffix = ']'\n\n  if (subtype === 'collapsed') {\n    suffix += '[]'\n  } else if (subtype === 'full') {\n    suffix += '[' + (node.label || node.identifier) + ']'\n  }\n\n  if (node.type === 'imageReference') {\n    return [{type: 'text', value: '![' + node.alt + suffix}]\n  }\n\n  const contents = state.all(node)\n  const head = contents[0]\n\n  if (head && head.type === 'text') {\n    head.value = '[' + head.value\n  } else {\n    contents.unshift({type: 'text', value: '['})\n  }\n\n  const tail = contents[contents.length - 1]\n\n  if (tail && tail.type === 'text') {\n    tail.value += suffix\n  } else {\n    contents.push({type: 'text', value: suffix})\n  }\n\n  return contents\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').ImageReference} ImageReference\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\nimport {revert} from '../revert.js'\n\n/**\n * Turn an mdast `imageReference` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {ImageReference} node\n *   mdast node.\n * @returns {Array<ElementContent> | ElementContent}\n *   hast node.\n */\nexport function imageReference(state, node) {\n  const id = String(node.identifier).toUpperCase()\n  const definition = state.definitionById.get(id)\n\n  if (!definition) {\n    return revert(state, node)\n  }\n\n  /** @type {Properties} */\n  const properties = {src: normalizeUri(definition.url || ''), alt: node.alt}\n\n  if (definition.title !== null && definition.title !== undefined) {\n    properties.title = definition.title\n  }\n\n  /** @type {Element} */\n  const result = {type: 'element', tagName: 'img', properties, children: []}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').Image} Image\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\n\n/**\n * Turn an mdast `image` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Image} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function image(state, node) {\n  /** @type {Properties} */\n  const properties = {src: normalizeUri(node.url)}\n\n  if (node.alt !== null && node.alt !== undefined) {\n    properties.alt = node.alt\n  }\n\n  if (node.title !== null && node.title !== undefined) {\n    properties.title = node.title\n  }\n\n  /** @type {Element} */\n  const result = {type: 'element', tagName: 'img', properties, children: []}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Text} Text\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `inlineCode` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {InlineCode} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function inlineCode(state, node) {\n  /** @type {Text} */\n  const text = {type: 'text', value: node.value.replace(/\\r?\\n|\\r/g, ' ')}\n  state.patch(node, text)\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'code',\n    properties: {},\n    children: [text]\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').LinkReference} LinkReference\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\nimport {revert} from '../revert.js'\n\n/**\n * Turn an mdast `linkReference` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {LinkReference} node\n *   mdast node.\n * @returns {Array<ElementContent> | ElementContent}\n *   hast node.\n */\nexport function linkReference(state, node) {\n  const id = String(node.identifier).toUpperCase()\n  const definition = state.definitionById.get(id)\n\n  if (!definition) {\n    return revert(state, node)\n  }\n\n  /** @type {Properties} */\n  const properties = {href: normalizeUri(definition.url || '')}\n\n  if (definition.title !== null && definition.title !== undefined) {\n    properties.title = definition.title\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'a',\n    properties,\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').Link} Link\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\n\n/**\n * Turn an mdast `link` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Link} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function link(state, node) {\n  /** @type {Properties} */\n  const properties = {href: normalizeUri(node.url)}\n\n  if (node.title !== null && node.title !== undefined) {\n    properties.title = node.title\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'a',\n    properties,\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `listItem` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {ListItem} node\n *   mdast node.\n * @param {Parents | undefined} parent\n *   Parent of `node`.\n * @returns {Element}\n *   hast node.\n */\nexport function listItem(state, node, parent) {\n  const results = state.all(node)\n  const loose = parent ? listLoose(parent) : listItemLoose(node)\n  /** @type {Properties} */\n  const properties = {}\n  /** @type {Array<ElementContent>} */\n  const children = []\n\n  if (typeof node.checked === 'boolean') {\n    const head = results[0]\n    /** @type {Element} */\n    let paragraph\n\n    if (head && head.type === 'element' && head.tagName === 'p') {\n      paragraph = head\n    } else {\n      paragraph = {type: 'element', tagName: 'p', properties: {}, children: []}\n      results.unshift(paragraph)\n    }\n\n    if (paragraph.children.length > 0) {\n      paragraph.children.unshift({type: 'text', value: ' '})\n    }\n\n    paragraph.children.unshift({\n      type: 'element',\n      tagName: 'input',\n      properties: {type: 'checkbox', checked: node.checked, disabled: true},\n      children: []\n    })\n\n    // According to github-markdown-css, this class hides bullet.\n    // See: <https://github.com/sindresorhus/github-markdown-css>.\n    properties.className = ['task-list-item']\n  }\n\n  let index = -1\n\n  while (++index < results.length) {\n    const child = results[index]\n\n    // Add eols before nodes, except if this is a loose, first paragraph.\n    if (\n      loose ||\n      index !== 0 ||\n      child.type !== 'element' ||\n      child.tagName !== 'p'\n    ) {\n      children.push({type: 'text', value: '\\n'})\n    }\n\n    if (child.type === 'element' && child.tagName === 'p' && !loose) {\n      children.push(...child.children)\n    } else {\n      children.push(child)\n    }\n  }\n\n  const tail = results[results.length - 1]\n\n  // Add a final eol.\n  if (tail && (loose || tail.type !== 'element' || tail.tagName !== 'p')) {\n    children.push({type: 'text', value: '\\n'})\n  }\n\n  /** @type {Element} */\n  const result = {type: 'element', tagName: 'li', properties, children}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n\n/**\n * @param {Parents} node\n * @return {Boolean}\n */\nfunction listLoose(node) {\n  let loose = false\n  if (node.type === 'list') {\n    loose = node.spread || false\n    const children = node.children\n    let index = -1\n\n    while (!loose && ++index < children.length) {\n      loose = listItemLoose(children[index])\n    }\n  }\n\n  return loose\n}\n\n/**\n * @param {ListItem} node\n * @return {Boolean}\n */\nfunction listItemLoose(node) {\n  const spread = node.spread\n\n  return spread === null || spread === undefined\n    ? node.children.length > 1\n    : spread\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').List} List\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `list` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {List} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function list(state, node) {\n  /** @type {Properties} */\n  const properties = {}\n  const results = state.all(node)\n  let index = -1\n\n  if (typeof node.start === 'number' && node.start !== 1) {\n    properties.start = node.start\n  }\n\n  // Like GitHub, add a class for custom styling.\n  while (++index < results.length) {\n    const child = results[index]\n\n    if (\n      child.type === 'element' &&\n      child.tagName === 'li' &&\n      child.properties &&\n      Array.isArray(child.properties.className) &&\n      child.properties.className.includes('task-list-item')\n    ) {\n      properties.className = ['contains-task-list']\n      break\n    }\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: node.ordered ? 'ol' : 'ul',\n    properties,\n    children: state.wrap(results, true)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Paragraph} Paragraph\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `paragraph` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Paragraph} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function paragraph(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'p',\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Parents} HastParents\n * @typedef {import('hast').Root} HastRoot\n * @typedef {import('mdast').Root} MdastRoot\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `root` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {MdastRoot} node\n *   mdast node.\n * @returns {HastParents}\n *   hast node.\n */\nexport function root(state, node) {\n  /** @type {HastRoot} */\n  const result = {type: 'root', children: state.wrap(state.all(node))}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Strong} Strong\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `strong` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Strong} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function strong(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'strong',\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Table} Table\n * @typedef {import('../state.js').State} State\n */\n\nimport {pointEnd, pointStart} from 'unist-util-position'\n\n/**\n * Turn an mdast `table` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Table} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function table(state, node) {\n  const rows = state.all(node)\n  const firstRow = rows.shift()\n  /** @type {Array<Element>} */\n  const tableContent = []\n\n  if (firstRow) {\n    /** @type {Element} */\n    const head = {\n      type: 'element',\n      tagName: 'thead',\n      properties: {},\n      children: state.wrap([firstRow], true)\n    }\n    state.patch(node.children[0], head)\n    tableContent.push(head)\n  }\n\n  if (rows.length > 0) {\n    /** @type {Element} */\n    const body = {\n      type: 'element',\n      tagName: 'tbody',\n      properties: {},\n      children: state.wrap(rows, true)\n    }\n\n    const start = pointStart(node.children[1])\n    const end = pointEnd(node.children[node.children.length - 1])\n    if (start && end) body.position = {start, end}\n    tableContent.push(body)\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'table',\n    properties: {},\n    children: state.wrap(tableContent, true)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('mdast').TableRow} TableRow\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `tableRow` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {TableRow} node\n *   mdast node.\n * @param {Parents | undefined} parent\n *   Parent of `node`.\n * @returns {Element}\n *   hast node.\n */\nexport function tableRow(state, node, parent) {\n  const siblings = parent ? parent.children : undefined\n  // Generate a body row when without parent.\n  const rowIndex = siblings ? siblings.indexOf(node) : 1\n  const tagName = rowIndex === 0 ? 'th' : 'td'\n  // To do: option to use `style`?\n  const align = parent && parent.type === 'table' ? parent.align : undefined\n  const length = align ? align.length : node.children.length\n  let cellIndex = -1\n  /** @type {Array<ElementContent>} */\n  const cells = []\n\n  while (++cellIndex < length) {\n    // Note: can also be undefined.\n    const cell = node.children[cellIndex]\n    /** @type {Properties} */\n    const properties = {}\n    const alignValue = align ? align[cellIndex] : undefined\n\n    if (alignValue) {\n      properties.align = alignValue\n    }\n\n    /** @type {Element} */\n    let result = {type: 'element', tagName, properties, children: []}\n\n    if (cell) {\n      result.children = state.all(cell)\n      state.patch(cell, result)\n      result = state.applyData(cell, result)\n    }\n\n    cells.push(result)\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'tr',\n    properties: {},\n    children: state.wrap(cells, true)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').TableCell} TableCell\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `tableCell` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {TableCell} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function tableCell(state, node) {\n  // Note: this function is normally not called: see `table-row` for how rows\n  // and their cells are compiled.\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'td', // Assume body cell.\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","const tab = 9 /* `\\t` */\nconst space = 32 /* ` ` */\n\n/**\n * Remove initial and final spaces and tabs at the line breaks in `value`.\n * Does not trim initial and final spaces and tabs of the value itself.\n *\n * @param {string} value\n *   Value to trim.\n * @returns {string}\n *   Trimmed value.\n */\nexport function trimLines(value) {\n  const source = String(value)\n  const search = /\\r?\\n|\\r/g\n  let match = search.exec(source)\n  let last = 0\n  /** @type {Array<string>} */\n  const lines = []\n\n  while (match) {\n    lines.push(\n      trimLine(source.slice(last, match.index), last > 0, true),\n      match[0]\n    )\n\n    last = match.index + match[0].length\n    match = search.exec(source)\n  }\n\n  lines.push(trimLine(source.slice(last), last > 0, false))\n\n  return lines.join('')\n}\n\n/**\n * @param {string} value\n *   Line to trim.\n * @param {boolean} start\n *   Whether to trim the start of the line.\n * @param {boolean} end\n *   Whether to trim the end of the line.\n * @returns {string}\n *   Trimmed line.\n */\nfunction trimLine(value, start, end) {\n  let startIndex = 0\n  let endIndex = value.length\n\n  if (start) {\n    let code = value.codePointAt(startIndex)\n\n    while (code === tab || code === space) {\n      startIndex++\n      code = value.codePointAt(startIndex)\n    }\n  }\n\n  if (end) {\n    let code = value.codePointAt(endIndex - 1)\n\n    while (code === tab || code === space) {\n      endIndex--\n      code = value.codePointAt(endIndex - 1)\n    }\n  }\n\n  return endIndex > startIndex ? value.slice(startIndex, endIndex) : ''\n}\n","/**\n * @typedef {import('hast').Element} HastElement\n * @typedef {import('hast').Text} HastText\n * @typedef {import('mdast').Text} MdastText\n * @typedef {import('../state.js').State} State\n */\n\nimport {trimLines} from 'trim-lines'\n\n/**\n * Turn an mdast `text` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {MdastText} node\n *   mdast node.\n * @returns {HastElement | HastText}\n *   hast node.\n */\nexport function text(state, node) {\n  /** @type {HastText} */\n  const result = {type: 'text', value: trimLines(String(node.value))}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').ThematicBreak} ThematicBreak\n * @typedef {import('../state.js').State} State\n */\n\n// Make VS Code show references to the above types.\n''\n\n/**\n * Turn an mdast `thematicBreak` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {ThematicBreak} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function thematicBreak(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'hr',\n    properties: {},\n    children: []\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n","import {blockquote} from './blockquote.js'\nimport {hardBreak} from './break.js'\nimport {code} from './code.js'\nimport {strikethrough} from './delete.js'\nimport {emphasis} from './emphasis.js'\nimport {footnoteReference} from './footnote-reference.js'\nimport {heading} from './heading.js'\nimport {html} from './html.js'\nimport {imageReference} from './image-reference.js'\nimport {image} from './image.js'\nimport {inlineCode} from './inline-code.js'\nimport {linkReference} from './link-reference.js'\nimport {link} from './link.js'\nimport {listItem} from './list-item.js'\nimport {list} from './list.js'\nimport {paragraph} from './paragraph.js'\nimport {root} from './root.js'\nimport {strong} from './strong.js'\nimport {table} from './table.js'\nimport {tableRow} from './table-row.js'\nimport {tableCell} from './table-cell.js'\nimport {text} from './text.js'\nimport {thematicBreak} from './thematic-break.js'\n\n/**\n * Default handlers for nodes.\n *\n * @satisfies {import('../state.js').Handlers}\n */\nexport const handlers = {\n  blockquote,\n  break: hardBreak,\n  code,\n  delete: strikethrough,\n  emphasis,\n  footnoteReference,\n  heading,\n  html,\n  imageReference,\n  image,\n  inlineCode,\n  linkReference,\n  link,\n  listItem,\n  list,\n  paragraph,\n  // @ts-expect-error: root is different, but hard to type.\n  root,\n  strong,\n  table,\n  tableCell,\n  tableRow,\n  text,\n  thematicBreak,\n  toml: ignore,\n  yaml: ignore,\n  definition: ignore,\n  footnoteDefinition: ignore\n}\n\n// Return nothing for nodes that are ignored.\nfunction ignore() {\n  return undefined\n}\n","/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n *\n * @typedef {import('./state.js').State} State\n */\n\n/**\n * @callback FootnoteBackContentTemplate\n *   Generate content for the backreference dynamically.\n *\n *   For the following markdown:\n *\n *   ```markdown\n *   Alpha[^micromark], bravo[^micromark], and charlie[^remark].\n *\n *   [^remark]: things about remark\n *   [^micromark]: things about micromark\n *   ```\n *\n *   This function will be called with:\n *\n *   *  `0` and `0` for the backreference from `things about micromark` to\n *      `alpha`, as it is the first used definition, and the first call to it\n *   *  `0` and `1` for the backreference from `things about micromark` to\n *      `bravo`, as it is the first used definition, and the second call to it\n *   *  `1` and `0` for the backreference from `things about remark` to\n *      `charlie`, as it is the second used definition\n * @param {number} referenceIndex\n *   Index of the definition in the order that they are first referenced,\n *   0-indexed.\n * @param {number} rereferenceIndex\n *   Index of calls to the same definition, 0-indexed.\n * @returns {Array<ElementContent> | ElementContent | string}\n *   Content for the backreference when linking back from definitions to their\n *   reference.\n *\n * @callback FootnoteBackLabelTemplate\n *   Generate a back label dynamically.\n *\n *   For the following markdown:\n *\n *   ```markdown\n *   Alpha[^micromark], bravo[^micromark], and charlie[^remark].\n *\n *   [^remark]: things about remark\n *   [^micromark]: things about micromark\n *   ```\n *\n *   This function will be called with:\n *\n *   *  `0` and `0` for the backreference from `things about micromark` to\n *      `alpha`, as it is the first used definition, and the first call to it\n *   *  `0` and `1` for the backreference from `things about micromark` to\n *      `bravo`, as it is the first used definition, and the second call to it\n *   *  `1` and `0` for the backreference from `things about remark` to\n *      `charlie`, as it is the second used definition\n * @param {number} referenceIndex\n *   Index of the definition in the order that they are first referenced,\n *   0-indexed.\n * @param {number} rereferenceIndex\n *   Index of calls to the same definition, 0-indexed.\n * @returns {string}\n *   Back label to use when linking back from definitions to their reference.\n */\n\nimport structuredClone from '@ungap/structured-clone'\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\n\n/**\n * Generate the default content that GitHub uses on backreferences.\n *\n * @param {number} _\n *   Index of the definition in the order that they are first referenced,\n *   0-indexed.\n * @param {number} rereferenceIndex\n *   Index of calls to the same definition, 0-indexed.\n * @returns {Array<ElementContent>}\n *   Content.\n */\nexport function defaultFootnoteBackContent(_, rereferenceIndex) {\n  /** @type {Array<ElementContent>} */\n  const result = [{type: 'text', value: '↩'}]\n\n  if (rereferenceIndex > 1) {\n    result.push({\n      type: 'element',\n      tagName: 'sup',\n      properties: {},\n      children: [{type: 'text', value: String(rereferenceIndex)}]\n    })\n  }\n\n  return result\n}\n\n/**\n * Generate the default label that GitHub uses on backreferences.\n *\n * @param {number} referenceIndex\n *   Index of the definition in the order that they are first referenced,\n *   0-indexed.\n * @param {number} rereferenceIndex\n *   Index of calls to the same definition, 0-indexed.\n * @returns {string}\n *   Label.\n */\nexport function defaultFootnoteBackLabel(referenceIndex, rereferenceIndex) {\n  return (\n    'Back to reference ' +\n    (referenceIndex + 1) +\n    (rereferenceIndex > 1 ? '-' + rereferenceIndex : '')\n  )\n}\n\n/**\n * Generate a hast footer for called footnote definitions.\n *\n * @param {State} state\n *   Info passed around.\n * @returns {Element | undefined}\n *   `section` element or `undefined`.\n */\n// eslint-disable-next-line complexity\nexport function footer(state) {\n  const clobberPrefix =\n    typeof state.options.clobberPrefix === 'string'\n      ? state.options.clobberPrefix\n      : 'user-content-'\n  const footnoteBackContent =\n    state.options.footnoteBackContent || defaultFootnoteBackContent\n  const footnoteBackLabel =\n    state.options.footnoteBackLabel || defaultFootnoteBackLabel\n  const footnoteLabel = state.options.footnoteLabel || 'Footnotes'\n  const footnoteLabelTagName = state.options.footnoteLabelTagName || 'h2'\n  const footnoteLabelProperties = state.options.footnoteLabelProperties || {\n    className: ['sr-only']\n  }\n  /** @type {Array<ElementContent>} */\n  const listItems = []\n  let referenceIndex = -1\n\n  while (++referenceIndex < state.footnoteOrder.length) {\n    const definition = state.footnoteById.get(\n      state.footnoteOrder[referenceIndex]\n    )\n\n    if (!definition) {\n      continue\n    }\n\n    const content = state.all(definition)\n    const id = String(definition.identifier).toUpperCase()\n    const safeId = normalizeUri(id.toLowerCase())\n    let rereferenceIndex = 0\n    /** @type {Array<ElementContent>} */\n    const backReferences = []\n    const counts = state.footnoteCounts.get(id)\n\n    // eslint-disable-next-line no-unmodified-loop-condition\n    while (counts !== undefined && ++rereferenceIndex <= counts) {\n      if (backReferences.length > 0) {\n        backReferences.push({type: 'text', value: ' '})\n      }\n\n      let children =\n        typeof footnoteBackContent === 'string'\n          ? footnoteBackContent\n          : footnoteBackContent(referenceIndex, rereferenceIndex)\n\n      if (typeof children === 'string') {\n        children = {type: 'text', value: children}\n      }\n\n      backReferences.push({\n        type: 'element',\n        tagName: 'a',\n        properties: {\n          href:\n            '#' +\n            clobberPrefix +\n            'fnref-' +\n            safeId +\n            (rereferenceIndex > 1 ? '-' + rereferenceIndex : ''),\n          dataFootnoteBackref: '',\n          ariaLabel:\n            typeof footnoteBackLabel === 'string'\n              ? footnoteBackLabel\n              : footnoteBackLabel(referenceIndex, rereferenceIndex),\n          className: ['data-footnote-backref']\n        },\n        children: Array.isArray(children) ? children : [children]\n      })\n    }\n\n    const tail = content[content.length - 1]\n\n    if (tail && tail.type === 'element' && tail.tagName === 'p') {\n      const tailTail = tail.children[tail.children.length - 1]\n      if (tailTail && tailTail.type === 'text') {\n        tailTail.value += ' '\n      } else {\n        tail.children.push({type: 'text', value: ' '})\n      }\n\n      tail.children.push(...backReferences)\n    } else {\n      content.push(...backReferences)\n    }\n\n    /** @type {Element} */\n    const listItem = {\n      type: 'element',\n      tagName: 'li',\n      properties: {id: clobberPrefix + 'fn-' + safeId},\n      children: state.wrap(content, true)\n    }\n\n    state.patch(definition, listItem)\n\n    listItems.push(listItem)\n  }\n\n  if (listItems.length === 0) {\n    return\n  }\n\n  return {\n    type: 'element',\n    tagName: 'section',\n    properties: {dataFootnotes: true, className: ['footnotes']},\n    children: [\n      {\n        type: 'element',\n        tagName: footnoteLabelTagName,\n        properties: {\n          ...structuredClone(footnoteLabelProperties),\n          id: 'footnote-label'\n        },\n        children: [{type: 'text', value: footnoteLabel}]\n      },\n      {type: 'text', value: '\\n'},\n      {\n        type: 'element',\n        tagName: 'ol',\n        properties: {},\n        children: state.wrap(listItems, true)\n      },\n      {type: 'text', value: '\\n'}\n    ]\n  }\n}\n","/**\n * @typedef {import('hast').Element} HastElement\n * @typedef {import('hast').ElementContent} HastElementContent\n * @typedef {import('hast').Nodes} HastNodes\n * @typedef {import('hast').Properties} HastProperties\n * @typedef {import('hast').RootContent} HastRootContent\n * @typedef {import('hast').Text} HastText\n *\n * @typedef {import('mdast').Definition} MdastDefinition\n * @typedef {import('mdast').FootnoteDefinition} MdastFootnoteDefinition\n * @typedef {import('mdast').Nodes} MdastNodes\n * @typedef {import('mdast').Parents} MdastParents\n *\n * @typedef {import('vfile').VFile} VFile\n *\n * @typedef {import('./footer.js').FootnoteBackContentTemplate} FootnoteBackContentTemplate\n * @typedef {import('./footer.js').FootnoteBackLabelTemplate} FootnoteBackLabelTemplate\n */\n\n/**\n * @callback Handler\n *   Handle a node.\n * @param {State} state\n *   Info passed around.\n * @param {any} node\n *   mdast node to handle.\n * @param {MdastParents | undefined} parent\n *   Parent of `node`.\n * @returns {Array<HastElementContent> | HastElementContent | undefined}\n *   hast node.\n *\n * @typedef {Partial<Record<MdastNodes['type'], Handler>>} Handlers\n *   Handle nodes.\n *\n * @typedef Options\n *   Configuration (optional).\n * @property {boolean | null | undefined} [allowDangerousHtml=false]\n *   Whether to persist raw HTML in markdown in the hast tree (default:\n *   `false`).\n * @property {string | null | undefined} [clobberPrefix='user-content-']\n *   Prefix to use before the `id` property on footnotes to prevent them from\n *   *clobbering* (default: `'user-content-'`).\n *\n *   Pass `''` for trusted markdown and when you are careful with\n *   polyfilling.\n *   You could pass a different prefix.\n *\n *   DOM clobbering is this:\n *\n *   ```html\n *   <p id=\"x\"></p>\n *   <script>alert(x) // `x` now refers to the `p#x` DOM element</script>\n *   ```\n *\n *   The above example shows that elements are made available by browsers, by\n *   their ID, on the `window` object.\n *   This is a security risk because you might be expecting some other variable\n *   at that place.\n *   It can also break polyfills.\n *   Using a prefix solves these problems.\n * @property {VFile | null | undefined} [file]\n *   Corresponding virtual file representing the input document (optional).\n * @property {FootnoteBackContentTemplate | string | null | undefined} [footnoteBackContent]\n *   Content of the backreference back to references (default: `defaultFootnoteBackContent`).\n *\n *   The default value is:\n *\n *   ```js\n *   function defaultFootnoteBackContent(_, rereferenceIndex) {\n *     const result = [{type: 'text', value: '↩'}]\n *\n *     if (rereferenceIndex > 1) {\n *       result.push({\n *         type: 'element',\n *         tagName: 'sup',\n *         properties: {},\n *         children: [{type: 'text', value: String(rereferenceIndex)}]\n *       })\n *     }\n *\n *     return result\n *   }\n *   ```\n *\n *   This content is used in the `a` element of each backreference (the `↩`\n *   links).\n * @property {FootnoteBackLabelTemplate | string | null | undefined} [footnoteBackLabel]\n *   Label to describe the backreference back to references (default:\n *   `defaultFootnoteBackLabel`).\n *\n *   The default value is:\n *\n *   ```js\n *   function defaultFootnoteBackLabel(referenceIndex, rereferenceIndex) {\n *    return (\n *      'Back to reference ' +\n *      (referenceIndex + 1) +\n *      (rereferenceIndex > 1 ? '-' + rereferenceIndex : '')\n *    )\n *   }\n *   ```\n *\n *   Change it when the markdown is not in English.\n *\n *   This label is used in the `ariaLabel` property on each backreference\n *   (the `↩` links).\n *   It affects users of assistive technology.\n * @property {string | null | undefined} [footnoteLabel='Footnotes']\n *   Textual label to use for the footnotes section (default: `'Footnotes'`).\n *\n *   Change it when the markdown is not in English.\n *\n *   This label is typically hidden visually (assuming a `sr-only` CSS class\n *   is defined that does that) and so affects screen readers only.\n *   If you do have such a class, but want to show this section to everyone,\n *   pass different properties with the `footnoteLabelProperties` option.\n * @property {HastProperties | null | undefined} [footnoteLabelProperties={className: ['sr-only']}]\n *   Properties to use on the footnote label (default: `{className:\n *   ['sr-only']}`).\n *\n *   Change it to show the label and add other properties.\n *\n *   This label is typically hidden visually (assuming an `sr-only` CSS class\n *   is defined that does that) and so affects screen readers only.\n *   If you do have such a class, but want to show this section to everyone,\n *   pass an empty string.\n *   You can also add different properties.\n *\n *   > **Note**: `id: 'footnote-label'` is always added, because footnote\n *   > calls use it with `aria-describedby` to provide an accessible label.\n * @property {string | null | undefined} [footnoteLabelTagName='h2']\n *   HTML tag name to use for the footnote label element (default: `'h2'`).\n *\n *   Change it to match your document structure.\n *\n *   This label is typically hidden visually (assuming a `sr-only` CSS class\n *   is defined that does that) and so affects screen readers only.\n *   If you do have such a class, but want to show this section to everyone,\n *   pass different properties with the `footnoteLabelProperties` option.\n * @property {Handlers | null | undefined} [handlers]\n *   Extra handlers for nodes (optional).\n * @property {Array<MdastNodes['type']> | null | undefined} [passThrough]\n *   List of custom mdast node types to pass through (keep) in hast (note that\n *   the node itself is passed, but eventual children are transformed)\n *   (optional).\n * @property {Handler | null | undefined} [unknownHandler]\n *   Handler for all unknown nodes (optional).\n *\n * @typedef State\n *   Info passed around.\n * @property {(node: MdastNodes) => Array<HastElementContent>} all\n *   Transform the children of an mdast parent to hast.\n * @property {<Type extends HastNodes>(from: MdastNodes, to: Type) => HastElement | Type} applyData\n *   Honor the `data` of `from`, and generate an element instead of `node`.\n * @property {Map<string, MdastDefinition>} definitionById\n *   Definitions by their identifier.\n * @property {Map<string, MdastFootnoteDefinition>} footnoteById\n *   Footnote definitions by their identifier.\n * @property {Map<string, number>} footnoteCounts\n *   Counts for how often the same footnote was called.\n * @property {Array<string>} footnoteOrder\n *   Identifiers of order when footnote calls first appear in tree order.\n * @property {Handlers} handlers\n *   Applied handlers.\n * @property {(node: MdastNodes, parent: MdastParents | undefined) => Array<HastElementContent> | HastElementContent | undefined} one\n *   Transform an mdast node to hast.\n * @property {Options} options\n *   Configuration.\n * @property {(from: MdastNodes, node: HastNodes) => undefined} patch\n *   Copy a node’s positional info.\n * @property {<Type extends HastRootContent>(nodes: Array<Type>, loose?: boolean | undefined) => Array<HastText | Type>} wrap\n *   Wrap `nodes` with line endings between each node, adds initial/final line endings when `loose`.\n */\n\nimport structuredClone from '@ungap/structured-clone'\nimport {visit} from 'unist-util-visit'\nimport {position} from 'unist-util-position'\nimport {handlers as defaultHandlers} from './handlers/index.js'\n\nconst own = {}.hasOwnProperty\n\n/** @type {Options} */\nconst emptyOptions = {}\n\n/**\n * Create `state` from an mdast tree.\n *\n * @param {MdastNodes} tree\n *   mdast node to transform.\n * @param {Options | null | undefined} [options]\n *   Configuration (optional).\n * @returns {State}\n *   `state` function.\n */\nexport function createState(tree, options) {\n  const settings = options || emptyOptions\n  /** @type {Map<string, MdastDefinition>} */\n  const definitionById = new Map()\n  /** @type {Map<string, MdastFootnoteDefinition>} */\n  const footnoteById = new Map()\n  /** @type {Map<string, number>} */\n  const footnoteCounts = new Map()\n  /** @type {Handlers} */\n  // @ts-expect-error: the root handler returns a root.\n  // Hard to type.\n  const handlers = {...defaultHandlers, ...settings.handlers}\n\n  /** @type {State} */\n  const state = {\n    all,\n    applyData,\n    definitionById,\n    footnoteById,\n    footnoteCounts,\n    footnoteOrder: [],\n    handlers,\n    one,\n    options: settings,\n    patch,\n    wrap\n  }\n\n  visit(tree, function (node) {\n    if (node.type === 'definition' || node.type === 'footnoteDefinition') {\n      const map = node.type === 'definition' ? definitionById : footnoteById\n      const id = String(node.identifier).toUpperCase()\n\n      // Mimick CM behavior of link definitions.\n      // See: <https://github.com/syntax-tree/mdast-util-definitions/blob/9032189/lib/index.js#L20-L21>.\n      if (!map.has(id)) {\n        // @ts-expect-error: node type matches map.\n        map.set(id, node)\n      }\n    }\n  })\n\n  return state\n\n  /**\n   * Transform an mdast node into a hast node.\n   *\n   * @param {MdastNodes} node\n   *   mdast node.\n   * @param {MdastParents | undefined} [parent]\n   *   Parent of `node`.\n   * @returns {Array<HastElementContent> | HastElementContent | undefined}\n   *   Resulting hast node.\n   */\n  function one(node, parent) {\n    const type = node.type\n    const handle = state.handlers[type]\n\n    if (own.call(state.handlers, type) && handle) {\n      return handle(state, node, parent)\n    }\n\n    if (state.options.passThrough && state.options.passThrough.includes(type)) {\n      if ('children' in node) {\n        const {children, ...shallow} = node\n        const result = structuredClone(shallow)\n        // @ts-expect-error: TS doesn’t understand…\n        result.children = state.all(node)\n        // @ts-expect-error: TS doesn’t understand…\n        return result\n      }\n\n      // @ts-expect-error: it’s custom.\n      return structuredClone(node)\n    }\n\n    const unknown = state.options.unknownHandler || defaultUnknownHandler\n\n    return unknown(state, node, parent)\n  }\n\n  /**\n   * Transform the children of an mdast node into hast nodes.\n   *\n   * @param {MdastNodes} parent\n   *   mdast node to compile\n   * @returns {Array<HastElementContent>}\n   *   Resulting hast nodes.\n   */\n  function all(parent) {\n    /** @type {Array<HastElementContent>} */\n    const values = []\n\n    if ('children' in parent) {\n      const nodes = parent.children\n      let index = -1\n      while (++index < nodes.length) {\n        const result = state.one(nodes[index], parent)\n\n        // To do: see if we van clean this? Can we merge texts?\n        if (result) {\n          if (index && nodes[index - 1].type === 'break') {\n            if (!Array.isArray(result) && result.type === 'text') {\n              result.value = trimMarkdownSpaceStart(result.value)\n            }\n\n            if (!Array.isArray(result) && result.type === 'element') {\n              const head = result.children[0]\n\n              if (head && head.type === 'text') {\n                head.value = trimMarkdownSpaceStart(head.value)\n              }\n            }\n          }\n\n          if (Array.isArray(result)) {\n            values.push(...result)\n          } else {\n            values.push(result)\n          }\n        }\n      }\n    }\n\n    return values\n  }\n}\n\n/**\n * Copy a node’s positional info.\n *\n * @param {MdastNodes} from\n *   mdast node to copy from.\n * @param {HastNodes} to\n *   hast node to copy into.\n * @returns {undefined}\n *   Nothing.\n */\nfunction patch(from, to) {\n  if (from.position) to.position = position(from)\n}\n\n/**\n * Honor the `data` of `from` and maybe generate an element instead of `to`.\n *\n * @template {HastNodes} Type\n *   Node type.\n * @param {MdastNodes} from\n *   mdast node to use data from.\n * @param {Type} to\n *   hast node to change.\n * @returns {HastElement | Type}\n *   Nothing.\n */\nfunction applyData(from, to) {\n  /** @type {HastElement | Type} */\n  let result = to\n\n  // Handle `data.hName`, `data.hProperties, `data.hChildren`.\n  if (from && from.data) {\n    const hName = from.data.hName\n    const hChildren = from.data.hChildren\n    const hProperties = from.data.hProperties\n\n    if (typeof hName === 'string') {\n      // Transforming the node resulted in an element with a different name\n      // than wanted:\n      if (result.type === 'element') {\n        result.tagName = hName\n      }\n      // Transforming the node resulted in a non-element, which happens for\n      // raw, text, and root nodes (unless custom handlers are passed).\n      // The intent of `hName` is to create an element, but likely also to keep\n      // the content around (otherwise: pass `hChildren`).\n      else {\n        /** @type {Array<HastElementContent>} */\n        // @ts-expect-error: assume no doctypes in `root`.\n        const children = 'children' in result ? result.children : [result]\n        result = {type: 'element', tagName: hName, properties: {}, children}\n      }\n    }\n\n    if (result.type === 'element' && hProperties) {\n      Object.assign(result.properties, structuredClone(hProperties))\n    }\n\n    if (\n      'children' in result &&\n      result.children &&\n      hChildren !== null &&\n      hChildren !== undefined\n    ) {\n      result.children = hChildren\n    }\n  }\n\n  return result\n}\n\n/**\n * Transform an unknown node.\n *\n * @param {State} state\n *   Info passed around.\n * @param {MdastNodes} node\n *   Unknown mdast node.\n * @returns {HastElement | HastText}\n *   Resulting hast node.\n */\nfunction defaultUnknownHandler(state, node) {\n  const data = node.data || {}\n  /** @type {HastElement | HastText} */\n  const result =\n    'value' in node &&\n    !(own.call(data, 'hProperties') || own.call(data, 'hChildren'))\n      ? {type: 'text', value: node.value}\n      : {\n          type: 'element',\n          tagName: 'div',\n          properties: {},\n          children: state.all(node)\n        }\n\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n\n/**\n * Wrap `nodes` with line endings between each node.\n *\n * @template {HastRootContent} Type\n *   Node type.\n * @param {Array<Type>} nodes\n *   List of nodes to wrap.\n * @param {boolean | undefined} [loose=false]\n *   Whether to add line endings at start and end (default: `false`).\n * @returns {Array<HastText | Type>}\n *   Wrapped nodes.\n */\nexport function wrap(nodes, loose) {\n  /** @type {Array<HastText | Type>} */\n  const result = []\n  let index = -1\n\n  if (loose) {\n    result.push({type: 'text', value: '\\n'})\n  }\n\n  while (++index < nodes.length) {\n    if (index) result.push({type: 'text', value: '\\n'})\n    result.push(nodes[index])\n  }\n\n  if (loose && nodes.length > 0) {\n    result.push({type: 'text', value: '\\n'})\n  }\n\n  return result\n}\n\n/**\n * Trim spaces and tabs at the start of `value`.\n *\n * @param {string} value\n *   Value to trim.\n * @returns {string}\n *   Result.\n */\nfunction trimMarkdownSpaceStart(value) {\n  let index = 0\n  let code = value.charCodeAt(index)\n\n  while (code === 9 || code === 32) {\n    index++\n    code = value.charCodeAt(index)\n  }\n\n  return value.slice(index)\n}\n","/**\n * @typedef {import('hast').Nodes} HastNodes\n * @typedef {import('mdast').Nodes} MdastNodes\n * @typedef {import('./state.js').Options} Options\n */\n\nimport {ok as assert} from 'devlop'\nimport {footer} from './footer.js'\nimport {createState} from './state.js'\n\n/**\n * Transform mdast to hast.\n *\n * ##### Notes\n *\n * ###### HTML\n *\n * Raw HTML is available in mdast as `html` nodes and can be embedded in hast\n * as semistandard `raw` nodes.\n * Most utilities ignore `raw` nodes but two notable ones don’t:\n *\n * *   `hast-util-to-html` also has an option `allowDangerousHtml` which will\n *     output the raw HTML.\n *     This is typically discouraged as noted by the option name but is useful\n *     if you completely trust authors\n * *   `hast-util-raw` can handle the raw embedded HTML strings by parsing them\n *     into standard hast nodes (`element`, `text`, etc).\n *     This is a heavy task as it needs a full HTML parser, but it is the only\n *     way to support untrusted content\n *\n * ###### Footnotes\n *\n * Many options supported here relate to footnotes.\n * Footnotes are not specified by CommonMark, which we follow by default.\n * They are supported by GitHub, so footnotes can be enabled in markdown with\n * `mdast-util-gfm`.\n *\n * The options `footnoteBackLabel` and `footnoteLabel` define natural language\n * that explains footnotes, which is hidden for sighted users but shown to\n * assistive technology.\n * When your page is not in English, you must define translated values.\n *\n * Back references use ARIA attributes, but the section label itself uses a\n * heading that is hidden with an `sr-only` class.\n * To show it to sighted users, define different attributes in\n * `footnoteLabelProperties`.\n *\n * ###### Clobbering\n *\n * Footnotes introduces a problem, as it links footnote calls to footnote\n * definitions on the page through `id` attributes generated from user content,\n * which results in DOM clobbering.\n *\n * DOM clobbering is this:\n *\n * ```html\n * <p id=x></p>\n * <script>alert(x) // `x` now refers to the DOM `p#x` element</script>\n * ```\n *\n * Elements by their ID are made available by browsers on the `window` object,\n * which is a security risk.\n * Using a prefix solves this problem.\n *\n * More information on how to handle clobbering and the prefix is explained in\n * Example: headings (DOM clobbering) in `rehype-sanitize`.\n *\n * ###### Unknown nodes\n *\n * Unknown nodes are nodes with a type that isn’t in `handlers` or `passThrough`.\n * The default behavior for unknown nodes is:\n *\n * *   when the node has a `value` (and doesn’t have `data.hName`,\n *     `data.hProperties`, or `data.hChildren`, see later), create a hast `text`\n *     node\n * *   otherwise, create a `<div>` element (which could be changed with\n *     `data.hName`), with its children mapped from mdast to hast as well\n *\n * This behavior can be changed by passing an `unknownHandler`.\n *\n * @param {MdastNodes} tree\n *   mdast tree.\n * @param {Options | null | undefined} [options]\n *   Configuration (optional).\n * @returns {HastNodes}\n *   hast tree.\n */\nexport function toHast(tree, options) {\n  const state = createState(tree, options)\n  const node = state.one(tree, undefined)\n  const foot = footer(state)\n  /** @type {HastNodes} */\n  const result = Array.isArray(node)\n    ? {type: 'root', children: node}\n    : node || {type: 'root', children: []}\n\n  if (foot) {\n    // If there’s a footer, there were definitions, meaning block\n    // content.\n    // So `result` is a parent node.\n    assert('children' in result)\n    result.children.push({type: 'text', value: '\\n'}, foot)\n  }\n\n  return result\n}\n","/**\n * @import {Root as HastRoot} from 'hast'\n * @import {Root as MdastRoot} from 'mdast'\n * @import {Options as ToHastOptions} from 'mdast-util-to-hast'\n * @import {Processor} from 'unified'\n * @import {VFile} from 'vfile'\n */\n\n/**\n * @typedef {Omit<ToHastOptions, 'file'>} Options\n *\n * @callback TransformBridge\n *   Bridge-mode.\n *\n *   Runs the destination with the new hast tree.\n *   Discards result.\n * @param {MdastRoot} tree\n *   Tree.\n * @param {VFile} file\n *   File.\n * @returns {Promise<undefined>}\n *   Nothing.\n *\n * @callback TransformMutate\n *  Mutate-mode.\n *\n *  Further transformers run on the hast tree.\n * @param {MdastRoot} tree\n *   Tree.\n * @param {VFile} file\n *   File.\n * @returns {HastRoot}\n *   Tree (hast).\n */\n\nimport {toHast} from 'mdast-util-to-hast'\n\n/**\n * Turn markdown into HTML.\n *\n * ##### Notes\n *\n * ###### Signature\n *\n * * if a processor is given,\n *   runs the (rehype) plugins used on it with a hast tree,\n *   then discards the result (*bridge mode*)\n * * otherwise,\n *   returns a hast tree,\n *   the plugins used after `remarkRehype` are rehype plugins (*mutate mode*)\n *\n * > 👉 **Note**:\n * > It’s highly unlikely that you want to pass a `processor`.\n *\n * ###### HTML\n *\n * Raw HTML is available in mdast as `html` nodes and can be embedded in hast\n * as semistandard `raw` nodes.\n * Most plugins ignore `raw` nodes but two notable ones don’t:\n *\n * * `rehype-stringify` also has an option `allowDangerousHtml` which will\n *   output the raw HTML.\n *   This is typically discouraged as noted by the option name but is useful if\n *   you completely trust authors\n * * `rehype-raw` can handle the raw embedded HTML strings by parsing them\n *   into standard hast nodes (`element`, `text`, etc);\n *   this is a heavy task as it needs a full HTML parser,\n *   but it is the only way to support untrusted content\n *\n * ###### Footnotes\n *\n * Many options supported here relate to footnotes.\n * Footnotes are not specified by CommonMark,\n * which we follow by default.\n * They are supported by GitHub,\n * so footnotes can be enabled in markdown with `remark-gfm`.\n *\n * The options `footnoteBackLabel` and `footnoteLabel` define natural language\n * that explains footnotes,\n * which is hidden for sighted users but shown to assistive technology.\n * When your page is not in English,\n * you must define translated values.\n *\n * Back references use ARIA attributes,\n * but the section label itself uses a heading that is hidden with an\n * `sr-only` class.\n * To show it to sighted users,\n * define different attributes in `footnoteLabelProperties`.\n *\n * ###### Clobbering\n *\n * Footnotes introduces a problem,\n * as it links footnote calls to footnote definitions on the page through `id`\n * attributes generated from user content,\n * which results in DOM clobbering.\n *\n * DOM clobbering is this:\n *\n * ```html\n * <p id=x></p>\n * <script>alert(x) // `x` now refers to the DOM `p#x` element</script>\n * ```\n *\n * Elements by their ID are made available by browsers on the `window` object,\n * which is a security risk.\n * Using a prefix solves this problem.\n *\n * More information on how to handle clobbering and the prefix is explained in\n * *Example: headings (DOM clobbering)* in `rehype-sanitize`.\n *\n * ###### Unknown nodes\n *\n * Unknown nodes are nodes with a type that isn’t in `handlers` or `passThrough`.\n * The default behavior for unknown nodes is:\n *\n * * when the node has a `value`\n *   (and doesn’t have `data.hName`, `data.hProperties`, or `data.hChildren`,\n *   see later),\n *   create a hast `text` node\n * * otherwise,\n *   create a `<div>` element (which could be changed with `data.hName`),\n *   with its children mapped from mdast to hast as well\n *\n * This behavior can be changed by passing an `unknownHandler`.\n *\n * @overload\n * @param {Processor} processor\n * @param {Readonly<Options> | null | undefined} [options]\n * @returns {TransformBridge}\n *\n * @overload\n * @param {Readonly<Options> | null | undefined} [options]\n * @returns {TransformMutate}\n *\n * @overload\n * @param {Readonly<Options> | Processor | null | undefined} [destination]\n * @param {Readonly<Options> | null | undefined} [options]\n * @returns {TransformBridge | TransformMutate}\n *\n * @param {Readonly<Options> | Processor | null | undefined} [destination]\n *   Processor or configuration (optional).\n * @param {Readonly<Options> | null | undefined} [options]\n *   When a processor was given,\n *   configuration (optional).\n * @returns {TransformBridge | TransformMutate}\n *   Transform.\n */\nexport default function remarkRehype(destination, options) {\n  if (destination && 'run' in destination) {\n    /**\n     * @type {TransformBridge}\n     */\n    return async function (tree, file) {\n      // Cast because root in -> root out.\n      const hastTree = /** @type {HastRoot} */ (\n        toHast(tree, {file, ...options})\n      )\n      await destination.run(hastTree, file)\n    }\n  }\n\n  /**\n   * @type {TransformMutate}\n   */\n  return function (tree, file) {\n    // Cast because root in -> root out.\n    // To do: in the future, disallow ` || options` fallback.\n    // With `unified-engine`, `destination` can be `undefined` but\n    // `options` will be the file set.\n    // We should not pass that as `options`.\n    return /** @type {HastRoot} */ (\n      toHast(tree, {file, ...(destination || options)})\n    )\n  }\n}\n"],"names":["normalizeUri","value","result","index","start","skip","length","code","charCodeAt","replace","asciiAlphanumeric","test","String","fromCharCode","next","push","slice","encodeURIComponent","join","blockquote","state","node","type","tagName","properties","children","wrap","all","patch","applyData","hardBreak","lang","className","meta","data","strikethrough","emphasis","footnoteReference","clobberPrefix","options","id","identifier","toUpperCase","safeId","toLowerCase","footnoteOrder","indexOf","counter","reuseCounter","footnoteCounts","get","undefined","set","link","href","dataFootnoteRef","ariaDescribedBy","sup","heading","depth","html","allowDangerousHtml","revert","subtype","referenceType","suffix","label","alt","contents","head","unshift","tail","imageReference","definition","definitionById","src","url","title","image","inlineCode","text","linkReference","listItem","parent","results","loose","listLoose","listItemLoose","checked","paragraph","disabled","child","spread","list","Array","isArray","includes","ordered","root","strong","table","rows","firstRow","shift","tableContent","body","pointStart","end","pointEnd","position","tableRow","siblings","rowIndex","align","cellIndex","cells","cell","alignValue","tableCell","tab","space","trimLines","source","search","match","exec","last","lines","trimLine","startIndex","endIndex","codePointAt","thematicBreak","handlers","break","delete","toml","ignore","yaml","footnoteDefinition","defaultFootnoteBackContent","_","rereferenceIndex","defaultFootnoteBackLabel","referenceIndex","footer","footnoteBackContent","footnoteBackLabel","footnoteLabel","footnoteLabelTagName","footnoteLabelProperties","listItems","footnoteById","content","backReferences","counts","dataFootnoteBackref","ariaLabel","tailTail","dataFootnotes","structuredClone","own","hasOwnProperty","emptyOptions","createState","tree","settings","Map","defaultHandlers","one","visit","map","has","handle","call","passThrough","shallow","unknown","unknownHandler","defaultUnknownHandler","values","nodes","trimMarkdownSpaceStart","from","to","hName","hChildren","hProperties","Object","assign","toHast","foot","remarkRehype","destination","file","hastTree","run"],"mappings":";;;;AA6CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASA,YAAYA,CAACC,KAAK,EAAE;AAClC;EACA,MAAMC,MAAM,GAAG,EAAE;EACjB,IAAIC,KAAK,GAAG,EAAE;EACd,IAAIC,KAAK,GAAG,CAAC;EACb,IAAIC,IAAI,GAAG,CAAC;AACZ,EAAA,OAAO,EAAEF,KAAK,GAAGF,KAAK,CAACK,MAAM,EAAE;AAC7B,IAAA,MAAMC,IAAI,GAAGN,KAAK,CAACO,UAAU,CAACL,KAAK,CAAC;AACpC;IACA,IAAIM,OAAO,GAAG,EAAE;;AAEhB;IACA,IAAIF,IAAI,KAAK,EAAE,IAAIG,iBAAiB,CAACT,KAAK,CAACO,UAAU,CAACL,KAAK,GAAG,CAAC,CAAC,CAAC,IAAIO,iBAAiB,CAACT,KAAK,CAACO,UAAU,CAACL,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE;AACnHE,MAAAA,IAAI,GAAG,CAAC;AACV,IAAA;AACA;AAAA,SACK,IAAIE,IAAI,GAAG,GAAG,EAAE;AACnB,MAAA,IAAI,CAAC,mBAAmB,CAACI,IAAI,CAACC,MAAM,CAACC,YAAY,CAACN,IAAI,CAAC,CAAC,EAAE;AACxDE,QAAAA,OAAO,GAAGG,MAAM,CAACC,YAAY,CAACN,IAAI,CAAC;AACrC,MAAA;AACF,IAAA;AACA;SACK,IAAIA,IAAI,GAAG,MAAM,IAAIA,IAAI,GAAG,MAAM,EAAE;MACvC,MAAMO,IAAI,GAAGb,KAAK,CAACO,UAAU,CAACL,KAAK,GAAG,CAAC,CAAC;;AAExC;MACA,IAAII,IAAI,GAAG,MAAM,IAAIO,IAAI,GAAG,MAAM,IAAIA,IAAI,GAAG,MAAM,EAAE;QACnDL,OAAO,GAAGG,MAAM,CAACC,YAAY,CAACN,IAAI,EAAEO,IAAI,CAAC;AACzCT,QAAAA,IAAI,GAAG,CAAC;AACV,MAAA;AACA;WACK;AACHI,QAAAA,OAAO,GAAG,QAAQ;AACpB,MAAA;AACF,IAAA;AACA;SACK;AACHA,MAAAA,OAAO,GAAGG,MAAM,CAACC,YAAY,CAACN,IAAI,CAAC;AACrC,IAAA;AACA,IAAA,IAAIE,OAAO,EAAE;AACXP,MAAAA,MAAM,CAACa,IAAI,CAACd,KAAK,CAACe,KAAK,CAACZ,KAAK,EAAED,KAAK,CAAC,EAAEc,kBAAkB,CAACR,OAAO,CAAC,CAAC;AACnEL,MAAAA,KAAK,GAAGD,KAAK,GAAGE,IAAI,GAAG,CAAC;AACxBI,MAAAA,OAAO,GAAG,EAAE;AACd,IAAA;AACA,IAAA,IAAIJ,IAAI,EAAE;AACRF,MAAAA,KAAK,IAAIE,IAAI;AACbA,MAAAA,IAAI,GAAG,CAAC;AACV,IAAA;AACF,EAAA;AACA,EAAA,OAAOH,MAAM,CAACgB,IAAI,CAAC,EAAE,CAAC,GAAGjB,KAAK,CAACe,KAAK,CAACZ,KAAK,CAAC;AAC7C;;AC1GA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASe,UAAUA,CAACC,KAAK,EAAEC,IAAI,EAAE;AACtC;AACA,EAAA,MAAMnB,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,YAAY;IACrBC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAACN,KAAK,CAACO,GAAG,CAACN,IAAI,CAAC,EAAE,IAAI;GAC3C;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC7BA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS4B,SAASA,CAACV,KAAK,EAAEC,IAAI,EAAE;AACrC;AACA,EAAA,MAAMnB,MAAM,GAAG;AAACoB,IAAAA,IAAI,EAAE,SAAS;AAAEC,IAAAA,OAAO,EAAE,IAAI;IAAEC,UAAU,EAAE,EAAE;AAAEC,IAAAA,QAAQ,EAAE;GAAG;AAC7EL,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;EACzB,OAAO,CAACkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC,EAAE;AAACoB,IAAAA,IAAI,EAAE,MAAM;AAAErB,IAAAA,KAAK,EAAE;AAAI,GAAC,CAAC;AACrE;;ACzBA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASM,IAAIA,CAACa,KAAK,EAAEC,IAAI,EAAE;AAChC,EAAA,MAAMpB,KAAK,GAAGoB,IAAI,CAACpB,KAAK,GAAGoB,IAAI,CAACpB,KAAK,GAAG,IAAI,GAAG,EAAE;AACjD;EACA,MAAMuB,UAAU,GAAG,EAAE;EAErB,IAAIH,IAAI,CAACU,IAAI,EAAE;IACbP,UAAU,CAACQ,SAAS,GAAG,CAAC,WAAW,GAAGX,IAAI,CAACU,IAAI,CAAC;AAClD,EAAA;;AAEA;AACA;AACA,EAAA,IAAI7B,MAAM,GAAG;AACXoB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,MAAM;IACfC,UAAU;AACVC,IAAAA,QAAQ,EAAE,CAAC;AAACH,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA;KAAM;GACjC;EAED,IAAIoB,IAAI,CAACY,IAAI,EAAE;IACb/B,MAAM,CAACgC,IAAI,GAAG;MAACD,IAAI,EAAEZ,IAAI,CAACY;KAAK;AACjC,EAAA;AAEAb,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;EACzBA,MAAM,GAAGkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;;AAEtC;AACAA,EAAAA,MAAM,GAAG;AAACoB,IAAAA,IAAI,EAAE,SAAS;AAAEC,IAAAA,OAAO,EAAE,KAAK;IAAEC,UAAU,EAAE,EAAE;IAAEC,QAAQ,EAAE,CAACvB,MAAM;GAAE;AAC9EkB,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOA,MAAM;AACf;;ACjDA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASiC,aAAaA,CAACf,KAAK,EAAEC,IAAI,EAAE;AACzC;AACA,EAAA,MAAMnB,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,KAAK;IACdC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC7BA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASkC,QAAQA,CAAChB,KAAK,EAAEC,IAAI,EAAE;AACpC;AACA,EAAA,MAAMnB,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,IAAI;IACbC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC7BA;AACA;AACA;AACA;AACA;;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASmC,iBAAiBA,CAACjB,KAAK,EAAEC,IAAI,EAAE;AAC7C,EAAA,MAAMiB,aAAa,GACjB,OAAOlB,KAAK,CAACmB,OAAO,CAACD,aAAa,KAAK,QAAQ,GAC3ClB,KAAK,CAACmB,OAAO,CAACD,aAAa,GAC3B,eAAe;EACrB,MAAME,EAAE,GAAG5B,MAAM,CAACS,IAAI,CAACoB,UAAU,CAAC,CAACC,WAAW,EAAE;EAChD,MAAMC,MAAM,GAAG3C,YAAY,CAACwC,EAAE,CAACI,WAAW,EAAE,CAAC;EAC7C,MAAMzC,KAAK,GAAGiB,KAAK,CAACyB,aAAa,CAACC,OAAO,CAACN,EAAE,CAAC;AAC7C;AACA,EAAA,IAAIO,OAAO;EAEX,IAAIC,YAAY,GAAG5B,KAAK,CAAC6B,cAAc,CAACC,GAAG,CAACV,EAAE,CAAC;EAE/C,IAAIQ,YAAY,KAAKG,SAAS,EAAE;AAC9BH,IAAAA,YAAY,GAAG,CAAC;AAChB5B,IAAAA,KAAK,CAACyB,aAAa,CAAC9B,IAAI,CAACyB,EAAE,CAAC;AAC5BO,IAAAA,OAAO,GAAG3B,KAAK,CAACyB,aAAa,CAACvC,MAAM;AACtC,EAAA,CAAC,MAAM;IACLyC,OAAO,GAAG5C,KAAK,GAAG,CAAC;AACrB,EAAA;AAEA6C,EAAAA,YAAY,IAAI,CAAC;EACjB5B,KAAK,CAAC6B,cAAc,CAACG,GAAG,CAACZ,EAAE,EAAEQ,YAAY,CAAC;;AAE1C;AACA,EAAA,MAAMK,IAAI,GAAG;AACX/B,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,GAAG;AACZC,IAAAA,UAAU,EAAE;AACV8B,MAAAA,IAAI,EAAE,GAAG,GAAGhB,aAAa,GAAG,KAAK,GAAGK,MAAM;AAC1CH,MAAAA,EAAE,EACAF,aAAa,GACb,QAAQ,GACRK,MAAM,IACLK,YAAY,GAAG,CAAC,GAAG,GAAG,GAAGA,YAAY,GAAG,EAAE,CAAC;AAC9CO,MAAAA,eAAe,EAAE,IAAI;MACrBC,eAAe,EAAE,CAAC,gBAAgB;KACnC;AACD/B,IAAAA,QAAQ,EAAE,CAAC;AAACH,MAAAA,IAAI,EAAE,MAAM;MAAErB,KAAK,EAAEW,MAAM,CAACmC,OAAO;KAAE;GAClD;AACD3B,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEgC,IAAI,CAAC;;AAEvB;AACA,EAAA,MAAMI,GAAG,GAAG;AACVnC,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,KAAK;IACdC,UAAU,EAAE,EAAE;IACdC,QAAQ,EAAE,CAAC4B,IAAI;GAChB;AACDjC,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEoC,GAAG,CAAC;AACtB,EAAA,OAAOrC,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEoC,GAAG,CAAC;AACnC;;ACrEA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,OAAOA,CAACtC,KAAK,EAAEC,IAAI,EAAE;AACnC;AACA,EAAA,MAAMnB,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,GAAG,GAAGF,IAAI,CAACsC,KAAK;IACzBnC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC7BA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS0D,IAAIA,CAACxC,KAAK,EAAEC,IAAI,EAAE;AAChC,EAAA,IAAID,KAAK,CAACmB,OAAO,CAACsB,kBAAkB,EAAE;AACpC;AACA,IAAA,MAAM3D,MAAM,GAAG;AAACoB,MAAAA,IAAI,EAAE,KAAK;MAAErB,KAAK,EAAEoB,IAAI,CAACpB;KAAM;AAC/CmB,IAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,IAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC,EAAA;AAEA,EAAA,OAAOiD,SAAS;AAClB;;AC9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASW,MAAMA,CAAC1C,KAAK,EAAEC,IAAI,EAAE;AAClC,EAAA,MAAM0C,OAAO,GAAG1C,IAAI,CAAC2C,aAAa;EAClC,IAAIC,MAAM,GAAG,GAAG;EAEhB,IAAIF,OAAO,KAAK,WAAW,EAAE;AAC3BE,IAAAA,MAAM,IAAI,IAAI;AAChB,EAAA,CAAC,MAAM,IAAIF,OAAO,KAAK,MAAM,EAAE;AAC7BE,IAAAA,MAAM,IAAI,GAAG,IAAI5C,IAAI,CAAC6C,KAAK,IAAI7C,IAAI,CAACoB,UAAU,CAAC,GAAG,GAAG;AACvD,EAAA;AAEA,EAAA,IAAIpB,IAAI,CAACC,IAAI,KAAK,gBAAgB,EAAE;AAClC,IAAA,OAAO,CAAC;AAACA,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE,IAAI,GAAGoB,IAAI,CAAC8C,GAAG,GAAGF;AAAM,KAAC,CAAC;AAC1D,EAAA;AAEA,EAAA,MAAMG,QAAQ,GAAGhD,KAAK,CAACO,GAAG,CAACN,IAAI,CAAC;AAChC,EAAA,MAAMgD,IAAI,GAAGD,QAAQ,CAAC,CAAC,CAAC;AAExB,EAAA,IAAIC,IAAI,IAAIA,IAAI,CAAC/C,IAAI,KAAK,MAAM,EAAE;AAChC+C,IAAAA,IAAI,CAACpE,KAAK,GAAG,GAAG,GAAGoE,IAAI,CAACpE,KAAK;AAC/B,EAAA,CAAC,MAAM;IACLmE,QAAQ,CAACE,OAAO,CAAC;AAAChD,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE;AAAG,KAAC,CAAC;AAC9C,EAAA;EAEA,MAAMsE,IAAI,GAAGH,QAAQ,CAACA,QAAQ,CAAC9D,MAAM,GAAG,CAAC,CAAC;AAE1C,EAAA,IAAIiE,IAAI,IAAIA,IAAI,CAACjD,IAAI,KAAK,MAAM,EAAE;IAChCiD,IAAI,CAACtE,KAAK,IAAIgE,MAAM;AACtB,EAAA,CAAC,MAAM;IACLG,QAAQ,CAACrD,IAAI,CAAC;AAACO,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAEgE;AAAM,KAAC,CAAC;AAC9C,EAAA;AAEA,EAAA,OAAOG,QAAQ;AACjB;;ACtDA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASI,cAAcA,CAACpD,KAAK,EAAEC,IAAI,EAAE;EAC1C,MAAMmB,EAAE,GAAG5B,MAAM,CAACS,IAAI,CAACoB,UAAU,CAAC,CAACC,WAAW,EAAE;EAChD,MAAM+B,UAAU,GAAGrD,KAAK,CAACsD,cAAc,CAACxB,GAAG,CAACV,EAAE,CAAC;EAE/C,IAAI,CAACiC,UAAU,EAAE;AACf,IAAA,OAAOX,MAAM,CAAC1C,KAAK,EAAEC,IAAI,CAAC;AAC5B,EAAA;;AAEA;AACA,EAAA,MAAMG,UAAU,GAAG;IAACmD,GAAG,EAAE3E,YAAY,CAACyE,UAAU,CAACG,GAAG,IAAI,EAAE,CAAC;IAAET,GAAG,EAAE9C,IAAI,CAAC8C;GAAI;EAE3E,IAAIM,UAAU,CAACI,KAAK,KAAK,IAAI,IAAIJ,UAAU,CAACI,KAAK,KAAK1B,SAAS,EAAE;AAC/D3B,IAAAA,UAAU,CAACqD,KAAK,GAAGJ,UAAU,CAACI,KAAK;AACrC,EAAA;;AAEA;AACA,EAAA,MAAM3E,MAAM,GAAG;AAACoB,IAAAA,IAAI,EAAE,SAAS;AAAEC,IAAAA,OAAO,EAAE,KAAK;IAAEC,UAAU;AAAEC,IAAAA,QAAQ,EAAE;GAAG;AAC1EL,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;ACxCA;AACA;AACA;AACA;AACA;AACA;;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS4E,KAAKA,CAAC1D,KAAK,EAAEC,IAAI,EAAE;AACjC;AACA,EAAA,MAAMG,UAAU,GAAG;AAACmD,IAAAA,GAAG,EAAE3E,YAAY,CAACqB,IAAI,CAACuD,GAAG;GAAE;EAEhD,IAAIvD,IAAI,CAAC8C,GAAG,KAAK,IAAI,IAAI9C,IAAI,CAAC8C,GAAG,KAAKhB,SAAS,EAAE;AAC/C3B,IAAAA,UAAU,CAAC2C,GAAG,GAAG9C,IAAI,CAAC8C,GAAG;AAC3B,EAAA;EAEA,IAAI9C,IAAI,CAACwD,KAAK,KAAK,IAAI,IAAIxD,IAAI,CAACwD,KAAK,KAAK1B,SAAS,EAAE;AACnD3B,IAAAA,UAAU,CAACqD,KAAK,GAAGxD,IAAI,CAACwD,KAAK;AAC/B,EAAA;;AAEA;AACA,EAAA,MAAM3E,MAAM,GAAG;AAACoB,IAAAA,IAAI,EAAE,SAAS;AAAEC,IAAAA,OAAO,EAAE,KAAK;IAAEC,UAAU;AAAEC,IAAAA,QAAQ,EAAE;GAAG;AAC1EL,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;ACnCA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS6E,UAAUA,CAAC3D,KAAK,EAAEC,IAAI,EAAE;AACtC;AACA,EAAA,MAAM2D,IAAI,GAAG;AAAC1D,IAAAA,IAAI,EAAE,MAAM;IAAErB,KAAK,EAAEoB,IAAI,CAACpB,KAAK,CAACQ,OAAO,CAAC,WAAW,EAAE,GAAG;GAAE;AACxEW,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAE2D,IAAI,CAAC;;AAEvB;AACA,EAAA,MAAM9E,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,MAAM;IACfC,UAAU,EAAE,EAAE;IACdC,QAAQ,EAAE,CAACuD,IAAI;GAChB;AACD5D,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AClCA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS+E,aAAaA,CAAC7D,KAAK,EAAEC,IAAI,EAAE;EACzC,MAAMmB,EAAE,GAAG5B,MAAM,CAACS,IAAI,CAACoB,UAAU,CAAC,CAACC,WAAW,EAAE;EAChD,MAAM+B,UAAU,GAAGrD,KAAK,CAACsD,cAAc,CAACxB,GAAG,CAACV,EAAE,CAAC;EAE/C,IAAI,CAACiC,UAAU,EAAE;AACf,IAAA,OAAOX,MAAM,CAAC1C,KAAK,EAAEC,IAAI,CAAC;AAC5B,EAAA;;AAEA;AACA,EAAA,MAAMG,UAAU,GAAG;AAAC8B,IAAAA,IAAI,EAAEtD,YAAY,CAACyE,UAAU,CAACG,GAAG,IAAI,EAAE;GAAE;EAE7D,IAAIH,UAAU,CAACI,KAAK,KAAK,IAAI,IAAIJ,UAAU,CAACI,KAAK,KAAK1B,SAAS,EAAE;AAC/D3B,IAAAA,UAAU,CAACqD,KAAK,GAAGJ,UAAU,CAACI,KAAK;AACrC,EAAA;;AAEA;AACA,EAAA,MAAM3E,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,GAAG;IACZC,UAAU;AACVC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC7CA;AACA;AACA;AACA;AACA;AACA;;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASmD,IAAIA,CAACjC,KAAK,EAAEC,IAAI,EAAE;AAChC;AACA,EAAA,MAAMG,UAAU,GAAG;AAAC8B,IAAAA,IAAI,EAAEtD,YAAY,CAACqB,IAAI,CAACuD,GAAG;GAAE;EAEjD,IAAIvD,IAAI,CAACwD,KAAK,KAAK,IAAI,IAAIxD,IAAI,CAACwD,KAAK,KAAK1B,SAAS,EAAE;AACnD3B,IAAAA,UAAU,CAACqD,KAAK,GAAGxD,IAAI,CAACwD,KAAK;AAC/B,EAAA;;AAEA;AACA,EAAA,MAAM3E,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,GAAG;IACZC,UAAU;AACVC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;ACpCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASgF,QAAQA,CAAC9D,KAAK,EAAEC,IAAI,EAAE8D,MAAM,EAAE;AAC5C,EAAA,MAAMC,OAAO,GAAGhE,KAAK,CAACO,GAAG,CAACN,IAAI,CAAC;AAC/B,EAAA,MAAMgE,KAAK,GAAGF,MAAM,GAAGG,SAAS,CAACH,MAAM,CAAC,GAAGI,aAAa,CAAClE,IAAI,CAAC;AAC9D;EACA,MAAMG,UAAU,GAAG,EAAE;AACrB;EACA,MAAMC,QAAQ,GAAG,EAAE;AAEnB,EAAA,IAAI,OAAOJ,IAAI,CAACmE,OAAO,KAAK,SAAS,EAAE;AACrC,IAAA,MAAMnB,IAAI,GAAGe,OAAO,CAAC,CAAC,CAAC;AACvB;AACA,IAAA,IAAIK,SAAS;AAEb,IAAA,IAAIpB,IAAI,IAAIA,IAAI,CAAC/C,IAAI,KAAK,SAAS,IAAI+C,IAAI,CAAC9C,OAAO,KAAK,GAAG,EAAE;AAC3DkE,MAAAA,SAAS,GAAGpB,IAAI;AAClB,IAAA,CAAC,MAAM;AACLoB,MAAAA,SAAS,GAAG;AAACnE,QAAAA,IAAI,EAAE,SAAS;AAAEC,QAAAA,OAAO,EAAE,GAAG;QAAEC,UAAU,EAAE,EAAE;AAAEC,QAAAA,QAAQ,EAAE;OAAG;AACzE2D,MAAAA,OAAO,CAACd,OAAO,CAACmB,SAAS,CAAC;AAC5B,IAAA;AAEA,IAAA,IAAIA,SAAS,CAAChE,QAAQ,CAACnB,MAAM,GAAG,CAAC,EAAE;AACjCmF,MAAAA,SAAS,CAAChE,QAAQ,CAAC6C,OAAO,CAAC;AAAChD,QAAAA,IAAI,EAAE,MAAM;AAAErB,QAAAA,KAAK,EAAE;AAAG,OAAC,CAAC;AACxD,IAAA;AAEAwF,IAAAA,SAAS,CAAChE,QAAQ,CAAC6C,OAAO,CAAC;AACzBhD,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,OAAO,EAAE,OAAO;AAChBC,MAAAA,UAAU,EAAE;AAACF,QAAAA,IAAI,EAAE,UAAU;QAAEkE,OAAO,EAAEnE,IAAI,CAACmE,OAAO;AAAEE,QAAAA,QAAQ,EAAE;OAAK;AACrEjE,MAAAA,QAAQ,EAAE;AACZ,KAAC,CAAC;;AAEF;AACA;AACAD,IAAAA,UAAU,CAACQ,SAAS,GAAG,CAAC,gBAAgB,CAAC;AAC3C,EAAA;EAEA,IAAI7B,KAAK,GAAG,EAAE;AAEd,EAAA,OAAO,EAAEA,KAAK,GAAGiF,OAAO,CAAC9E,MAAM,EAAE;AAC/B,IAAA,MAAMqF,KAAK,GAAGP,OAAO,CAACjF,KAAK,CAAC;;AAE5B;AACA,IAAA,IACEkF,KAAK,IACLlF,KAAK,KAAK,CAAC,IACXwF,KAAK,CAACrE,IAAI,KAAK,SAAS,IACxBqE,KAAK,CAACpE,OAAO,KAAK,GAAG,EACrB;MACAE,QAAQ,CAACV,IAAI,CAAC;AAACO,QAAAA,IAAI,EAAE,MAAM;AAAErB,QAAAA,KAAK,EAAE;AAAI,OAAC,CAAC;AAC5C,IAAA;AAEA,IAAA,IAAI0F,KAAK,CAACrE,IAAI,KAAK,SAAS,IAAIqE,KAAK,CAACpE,OAAO,KAAK,GAAG,IAAI,CAAC8D,KAAK,EAAE;AAC/D5D,MAAAA,QAAQ,CAACV,IAAI,CAAC,GAAG4E,KAAK,CAAClE,QAAQ,CAAC;AAClC,IAAA,CAAC,MAAM;AACLA,MAAAA,QAAQ,CAACV,IAAI,CAAC4E,KAAK,CAAC;AACtB,IAAA;AACF,EAAA;EAEA,MAAMpB,IAAI,GAAGa,OAAO,CAACA,OAAO,CAAC9E,MAAM,GAAG,CAAC,CAAC;;AAExC;AACA,EAAA,IAAIiE,IAAI,KAAKc,KAAK,IAAId,IAAI,CAACjD,IAAI,KAAK,SAAS,IAAIiD,IAAI,CAAChD,OAAO,KAAK,GAAG,CAAC,EAAE;IACtEE,QAAQ,CAACV,IAAI,CAAC;AAACO,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE;AAAI,KAAC,CAAC;AAC5C,EAAA;;AAEA;AACA,EAAA,MAAMC,MAAM,GAAG;AAACoB,IAAAA,IAAI,EAAE,SAAS;AAAEC,IAAAA,OAAO,EAAE,IAAI;IAAEC,UAAU;AAAEC,IAAAA;GAAS;AACrEL,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AAEA;AACA;AACA;AACA;AACA,SAASoF,SAASA,CAACjE,IAAI,EAAE;EACvB,IAAIgE,KAAK,GAAG,KAAK;AACjB,EAAA,IAAIhE,IAAI,CAACC,IAAI,KAAK,MAAM,EAAE;AACxB+D,IAAAA,KAAK,GAAGhE,IAAI,CAACuE,MAAM,IAAI,KAAK;AAC5B,IAAA,MAAMnE,QAAQ,GAAGJ,IAAI,CAACI,QAAQ;IAC9B,IAAItB,KAAK,GAAG,EAAE;IAEd,OAAO,CAACkF,KAAK,IAAI,EAAElF,KAAK,GAAGsB,QAAQ,CAACnB,MAAM,EAAE;AAC1C+E,MAAAA,KAAK,GAAGE,aAAa,CAAC9D,QAAQ,CAACtB,KAAK,CAAC,CAAC;AACxC,IAAA;AACF,EAAA;AAEA,EAAA,OAAOkF,KAAK;AACd;;AAEA;AACA;AACA;AACA;AACA,SAASE,aAAaA,CAAClE,IAAI,EAAE;AAC3B,EAAA,MAAMuE,MAAM,GAAGvE,IAAI,CAACuE,MAAM;AAE1B,EAAA,OAAOA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAKzC,SAAS,GAC1C9B,IAAI,CAACI,QAAQ,CAACnB,MAAM,GAAG,CAAC,GACxBsF,MAAM;AACZ;;AC5HA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,IAAIA,CAACzE,KAAK,EAAEC,IAAI,EAAE;AAChC;EACA,MAAMG,UAAU,GAAG,EAAE;AACrB,EAAA,MAAM4D,OAAO,GAAGhE,KAAK,CAACO,GAAG,CAACN,IAAI,CAAC;EAC/B,IAAIlB,KAAK,GAAG,EAAE;AAEd,EAAA,IAAI,OAAOkB,IAAI,CAACjB,KAAK,KAAK,QAAQ,IAAIiB,IAAI,CAACjB,KAAK,KAAK,CAAC,EAAE;AACtDoB,IAAAA,UAAU,CAACpB,KAAK,GAAGiB,IAAI,CAACjB,KAAK;AAC/B,EAAA;;AAEA;AACA,EAAA,OAAO,EAAED,KAAK,GAAGiF,OAAO,CAAC9E,MAAM,EAAE;AAC/B,IAAA,MAAMqF,KAAK,GAAGP,OAAO,CAACjF,KAAK,CAAC;AAE5B,IAAA,IACEwF,KAAK,CAACrE,IAAI,KAAK,SAAS,IACxBqE,KAAK,CAACpE,OAAO,KAAK,IAAI,IACtBoE,KAAK,CAACnE,UAAU,IAChBsE,KAAK,CAACC,OAAO,CAACJ,KAAK,CAACnE,UAAU,CAACQ,SAAS,CAAC,IACzC2D,KAAK,CAACnE,UAAU,CAACQ,SAAS,CAACgE,QAAQ,CAAC,gBAAgB,CAAC,EACrD;AACAxE,MAAAA,UAAU,CAACQ,SAAS,GAAG,CAAC,oBAAoB,CAAC;AAC7C,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;AACA,EAAA,MAAM9B,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAEF,IAAI,CAAC4E,OAAO,GAAG,IAAI,GAAG,IAAI;IACnCzE,UAAU;AACVC,IAAAA,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAAC0D,OAAO,EAAE,IAAI;GACnC;AACDhE,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;ACvDA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASuF,SAASA,CAACrE,KAAK,EAAEC,IAAI,EAAE;AACrC;AACA,EAAA,MAAMnB,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,GAAG;IACZC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC7BA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASgG,IAAIA,CAAC9E,KAAK,EAAEC,IAAI,EAAE;AAChC;AACA,EAAA,MAAMnB,MAAM,GAAG;AAACoB,IAAAA,IAAI,EAAE,MAAM;IAAEG,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAACN,KAAK,CAACO,GAAG,CAACN,IAAI,CAAC;GAAE;AACpED,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;ACzBA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASiG,MAAMA,CAAC/E,KAAK,EAAEC,IAAI,EAAE;AAClC;AACA,EAAA,MAAMnB,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,QAAQ;IACjBC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC7BA;AACA;AACA;AACA;AACA;;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASkG,KAAKA,CAAChF,KAAK,EAAEC,IAAI,EAAE;AACjC,EAAA,MAAMgF,IAAI,GAAGjF,KAAK,CAACO,GAAG,CAACN,IAAI,CAAC;AAC5B,EAAA,MAAMiF,QAAQ,GAAGD,IAAI,CAACE,KAAK,EAAE;AAC7B;EACA,MAAMC,YAAY,GAAG,EAAE;AAEvB,EAAA,IAAIF,QAAQ,EAAE;AACZ;AACA,IAAA,MAAMjC,IAAI,GAAG;AACX/C,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,OAAO,EAAE,OAAO;MAChBC,UAAU,EAAE,EAAE;MACdC,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAAC,CAAC4E,QAAQ,CAAC,EAAE,IAAI;KACtC;IACDlF,KAAK,CAACQ,KAAK,CAACP,IAAI,CAACI,QAAQ,CAAC,CAAC,CAAC,EAAE4C,IAAI,CAAC;AACnCmC,IAAAA,YAAY,CAACzF,IAAI,CAACsD,IAAI,CAAC;AACzB,EAAA;AAEA,EAAA,IAAIgC,IAAI,CAAC/F,MAAM,GAAG,CAAC,EAAE;AACnB;AACA,IAAA,MAAMmG,IAAI,GAAG;AACXnF,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,OAAO,EAAE,OAAO;MAChBC,UAAU,EAAE,EAAE;AACdC,MAAAA,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAAC2E,IAAI,EAAE,IAAI;KAChC;IAED,MAAMjG,KAAK,GAAGsG,UAAU,CAACrF,IAAI,CAACI,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC1C,IAAA,MAAMkF,GAAG,GAAGC,QAAQ,CAACvF,IAAI,CAACI,QAAQ,CAACJ,IAAI,CAACI,QAAQ,CAACnB,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7D,IAAA,IAAIF,KAAK,IAAIuG,GAAG,EAAEF,IAAI,CAACI,QAAQ,GAAG;MAACzG,KAAK;AAAEuG,MAAAA;KAAI;AAC9CH,IAAAA,YAAY,CAACzF,IAAI,CAAC0F,IAAI,CAAC;AACzB,EAAA;;AAEA;AACA,EAAA,MAAMvG,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,OAAO;IAChBC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAAC8E,YAAY,EAAE,IAAI;GACxC;AACDpF,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC5DA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS4G,QAAQA,CAAC1F,KAAK,EAAEC,IAAI,EAAE8D,MAAM,EAAE;EAC5C,MAAM4B,QAAQ,GAAG5B,MAAM,GAAGA,MAAM,CAAC1D,QAAQ,GAAG0B,SAAS;AACrD;EACA,MAAM6D,QAAQ,GAAGD,QAAQ,GAAGA,QAAQ,CAACjE,OAAO,CAACzB,IAAI,CAAC,GAAG,CAAC;EACtD,MAAME,OAAO,GAAGyF,QAAQ,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI;AAC5C;AACA,EAAA,MAAMC,KAAK,GAAG9B,MAAM,IAAIA,MAAM,CAAC7D,IAAI,KAAK,OAAO,GAAG6D,MAAM,CAAC8B,KAAK,GAAG9D,SAAS;AAC1E,EAAA,MAAM7C,MAAM,GAAG2G,KAAK,GAAGA,KAAK,CAAC3G,MAAM,GAAGe,IAAI,CAACI,QAAQ,CAACnB,MAAM;EAC1D,IAAI4G,SAAS,GAAG,EAAE;AAClB;EACA,MAAMC,KAAK,GAAG,EAAE;AAEhB,EAAA,OAAO,EAAED,SAAS,GAAG5G,MAAM,EAAE;AAC3B;AACA,IAAA,MAAM8G,IAAI,GAAG/F,IAAI,CAACI,QAAQ,CAACyF,SAAS,CAAC;AACrC;IACA,MAAM1F,UAAU,GAAG,EAAE;IACrB,MAAM6F,UAAU,GAAGJ,KAAK,GAAGA,KAAK,CAACC,SAAS,CAAC,GAAG/D,SAAS;AAEvD,IAAA,IAAIkE,UAAU,EAAE;MACd7F,UAAU,CAACyF,KAAK,GAAGI,UAAU;AAC/B,IAAA;;AAEA;AACA,IAAA,IAAInH,MAAM,GAAG;AAACoB,MAAAA,IAAI,EAAE,SAAS;MAAEC,OAAO;MAAEC,UAAU;AAAEC,MAAAA,QAAQ,EAAE;KAAG;AAEjE,IAAA,IAAI2F,IAAI,EAAE;MACRlH,MAAM,CAACuB,QAAQ,GAAGL,KAAK,CAACO,GAAG,CAACyF,IAAI,CAAC;AACjChG,MAAAA,KAAK,CAACQ,KAAK,CAACwF,IAAI,EAAElH,MAAM,CAAC;MACzBA,MAAM,GAAGkB,KAAK,CAACS,SAAS,CAACuF,IAAI,EAAElH,MAAM,CAAC;AACxC,IAAA;AAEAiH,IAAAA,KAAK,CAACpG,IAAI,CAACb,MAAM,CAAC;AACpB,EAAA;;AAEA;AACA,EAAA,MAAMA,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,IAAI;IACbC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAACyF,KAAK,EAAE,IAAI;GACjC;AACD/F,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;ACpEA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASoH,SAASA,CAAClG,KAAK,EAAEC,IAAI,EAAE;AACrC;AACA;AACA;AACA,EAAA,MAAMnB,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,IAAI;AAAE;IACfC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AACDD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AC/BA,MAAMqH,GAAG,GAAG,CAAC,CAAA;AACb,MAAMC,KAAK,GAAG,EAAE,CAAA;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,SAASA,CAACxH,KAAK,EAAE;AAC/B,EAAA,MAAMyH,MAAM,GAAG9G,MAAM,CAACX,KAAK,CAAC;EAC5B,MAAM0H,MAAM,GAAG,WAAW;AAC1B,EAAA,IAAIC,KAAK,GAAGD,MAAM,CAACE,IAAI,CAACH,MAAM,CAAC;EAC/B,IAAII,IAAI,GAAG,CAAC;AACZ;EACA,MAAMC,KAAK,GAAG,EAAE;AAEhB,EAAA,OAAOH,KAAK,EAAE;IACZG,KAAK,CAAChH,IAAI,CACRiH,QAAQ,CAACN,MAAM,CAAC1G,KAAK,CAAC8G,IAAI,EAAEF,KAAK,CAACzH,KAAK,CAAC,EAAE2H,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,EACzDF,KAAK,CAAC,CAAC,CACT,CAAC;IAEDE,IAAI,GAAGF,KAAK,CAACzH,KAAK,GAAGyH,KAAK,CAAC,CAAC,CAAC,CAACtH,MAAM;AACpCsH,IAAAA,KAAK,GAAGD,MAAM,CAACE,IAAI,CAACH,MAAM,CAAC;AAC7B,EAAA;AAEAK,EAAAA,KAAK,CAAChH,IAAI,CAACiH,QAAQ,CAACN,MAAM,CAAC1G,KAAK,CAAC8G,IAAI,CAAC,EAAEA,IAAI,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;AAEzD,EAAA,OAAOC,KAAK,CAAC7G,IAAI,CAAC,EAAE,CAAC;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS8G,QAAQA,CAAC/H,KAAK,EAAEG,KAAK,EAAEuG,GAAG,EAAE;EACnC,IAAIsB,UAAU,GAAG,CAAC;AAClB,EAAA,IAAIC,QAAQ,GAAGjI,KAAK,CAACK,MAAM;AAE3B,EAAA,IAAIF,KAAK,EAAE;AACT,IAAA,IAAIG,IAAI,GAAGN,KAAK,CAACkI,WAAW,CAACF,UAAU,CAAC;AAExC,IAAA,OAAO1H,IAAI,KAAKgH,GAAG,IAAIhH,IAAI,KAAKiH,KAAK,EAAE;AACrCS,MAAAA,UAAU,EAAE;AACZ1H,MAAAA,IAAI,GAAGN,KAAK,CAACkI,WAAW,CAACF,UAAU,CAAC;AACtC,IAAA;AACF,EAAA;AAEA,EAAA,IAAItB,GAAG,EAAE;IACP,IAAIpG,IAAI,GAAGN,KAAK,CAACkI,WAAW,CAACD,QAAQ,GAAG,CAAC,CAAC;AAE1C,IAAA,OAAO3H,IAAI,KAAKgH,GAAG,IAAIhH,IAAI,KAAKiH,KAAK,EAAE;AACrCU,MAAAA,QAAQ,EAAE;MACV3H,IAAI,GAAGN,KAAK,CAACkI,WAAW,CAACD,QAAQ,GAAG,CAAC,CAAC;AACxC,IAAA;AACF,EAAA;AAEA,EAAA,OAAOA,QAAQ,GAAGD,UAAU,GAAGhI,KAAK,CAACe,KAAK,CAACiH,UAAU,EAAEC,QAAQ,CAAC,GAAG,EAAE;AACvE;;ACpEA;AACA;AACA;AACA;AACA;AACA;;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASlD,IAAIA,CAAC5D,KAAK,EAAEC,IAAI,EAAE;AAChC;AACA,EAAA,MAAMnB,MAAM,GAAG;AAACoB,IAAAA,IAAI,EAAE,MAAM;IAAErB,KAAK,EAAEwH,SAAS,CAAC7G,MAAM,CAACS,IAAI,CAACpB,KAAK,CAAC;GAAE;AACnEmB,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;ACxBA;AACA;AACA;AACA;AACA;;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASkI,aAAaA,CAAChH,KAAK,EAAEC,IAAI,EAAE;AACzC;AACA,EAAA,MAAMnB,MAAM,GAAG;AACboB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,IAAI;IACbC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAE;GACX;AACDL,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;ACLA;AACA;AACA;AACA;AACA;AACO,MAAMmI,QAAQ,GAAG;EACtBlH,UAAU;AACVmH,EAAAA,KAAK,EAAExG,SAAS;EAChBvB,IAAI;AACJgI,EAAAA,MAAM,EAAEpG,aAAa;EACrBC,QAAQ;EACRC,iBAAiB;EACjBqB,OAAO;EACPE,IAAI;EACJY,cAAc;EACdM,KAAK;EACLC,UAAU;EACVE,aAAa;EACb5B,IAAI;EACJ6B,QAAQ;EACRW,IAAI;EACJJ,SAAS;AACT;EACAS,IAAI;EACJC,MAAM;EACNC,KAAK;EACLkB,SAAS;EACTR,QAAQ;EACR9B,IAAI;EACJoD,aAAa;AACbI,EAAAA,IAAI,EAAEC,MAAM;AACZC,EAAAA,IAAI,EAAED,MAAM;AACZhE,EAAAA,UAAU,EAAEgE,MAAM;AAClBE,EAAAA,kBAAkB,EAAEF;AACtB;;AAEA;AACA,SAASA,MAAMA,GAAG;AAChB,EAAA,OAAOtF,SAAS;AAClB;;AC/DA;AACA;AACA;AACA;AACA;AACA;;;AAgEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASyF,0BAA0BA,CAACC,CAAC,EAAEC,gBAAgB,EAAE;AAC9D;EACA,MAAM5I,MAAM,GAAG,CAAC;AAACoB,IAAAA,IAAI,EAAE,MAAM;AAAErB,IAAAA,KAAK,EAAE;AAAG,GAAC,CAAC;EAE3C,IAAI6I,gBAAgB,GAAG,CAAC,EAAE;IACxB5I,MAAM,CAACa,IAAI,CAAC;AACVO,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,OAAO,EAAE,KAAK;MACdC,UAAU,EAAE,EAAE;AACdC,MAAAA,QAAQ,EAAE,CAAC;AAACH,QAAAA,IAAI,EAAE,MAAM;QAAErB,KAAK,EAAEW,MAAM,CAACkI,gBAAgB;OAAE;AAC5D,KAAC,CAAC;AACJ,EAAA;AAEA,EAAA,OAAO5I,MAAM;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS6I,wBAAwBA,CAACC,cAAc,EAAEF,gBAAgB,EAAE;AACzE,EAAA,OACE,oBAAoB,IACnBE,cAAc,GAAG,CAAC,CAAC,IACnBF,gBAAgB,GAAG,CAAC,GAAG,GAAG,GAAGA,gBAAgB,GAAG,EAAE,CAAC;AAExD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASG,MAAMA,CAAC7H,KAAK,EAAE;AAC5B,EAAA,MAAMkB,aAAa,GACjB,OAAOlB,KAAK,CAACmB,OAAO,CAACD,aAAa,KAAK,QAAQ,GAC3ClB,KAAK,CAACmB,OAAO,CAACD,aAAa,GAC3B,eAAe;EACrB,MAAM4G,mBAAmB,GACvB9H,KAAK,CAACmB,OAAO,CAAC2G,mBAAmB,IAAIN,0BAA0B;EACjE,MAAMO,iBAAiB,GACrB/H,KAAK,CAACmB,OAAO,CAAC4G,iBAAiB,IAAIJ,wBAAwB;EAC7D,MAAMK,aAAa,GAAGhI,KAAK,CAACmB,OAAO,CAAC6G,aAAa,IAAI,WAAW;EAChE,MAAMC,oBAAoB,GAAGjI,KAAK,CAACmB,OAAO,CAAC8G,oBAAoB,IAAI,IAAI;AACvE,EAAA,MAAMC,uBAAuB,GAAGlI,KAAK,CAACmB,OAAO,CAAC+G,uBAAuB,IAAI;IACvEtH,SAAS,EAAE,CAAC,SAAS;GACtB;AACD;EACA,MAAMuH,SAAS,GAAG,EAAE;EACpB,IAAIP,cAAc,GAAG,EAAE;EAEvB,OAAO,EAAEA,cAAc,GAAG5H,KAAK,CAACyB,aAAa,CAACvC,MAAM,EAAE;AACpD,IAAA,MAAMmE,UAAU,GAAGrD,KAAK,CAACoI,YAAY,CAACtG,GAAG,CACvC9B,KAAK,CAACyB,aAAa,CAACmG,cAAc,CACpC,CAAC;IAED,IAAI,CAACvE,UAAU,EAAE;AACf,MAAA;AACF,IAAA;AAEA,IAAA,MAAMgF,OAAO,GAAGrI,KAAK,CAACO,GAAG,CAAC8C,UAAU,CAAC;IACrC,MAAMjC,EAAE,GAAG5B,MAAM,CAAC6D,UAAU,CAAChC,UAAU,CAAC,CAACC,WAAW,EAAE;IACtD,MAAMC,MAAM,GAAG3C,YAAY,CAACwC,EAAE,CAACI,WAAW,EAAE,CAAC;IAC7C,IAAIkG,gBAAgB,GAAG,CAAC;AACxB;IACA,MAAMY,cAAc,GAAG,EAAE;IACzB,MAAMC,MAAM,GAAGvI,KAAK,CAAC6B,cAAc,CAACC,GAAG,CAACV,EAAE,CAAC;;AAE3C;IACA,OAAOmH,MAAM,KAAKxG,SAAS,IAAI,EAAE2F,gBAAgB,IAAIa,MAAM,EAAE;AAC3D,MAAA,IAAID,cAAc,CAACpJ,MAAM,GAAG,CAAC,EAAE;QAC7BoJ,cAAc,CAAC3I,IAAI,CAAC;AAACO,UAAAA,IAAI,EAAE,MAAM;AAAErB,UAAAA,KAAK,EAAE;AAAG,SAAC,CAAC;AACjD,MAAA;AAEA,MAAA,IAAIwB,QAAQ,GACV,OAAOyH,mBAAmB,KAAK,QAAQ,GACnCA,mBAAmB,GACnBA,mBAAmB,CAACF,cAAc,EAAEF,gBAAgB,CAAC;AAE3D,MAAA,IAAI,OAAOrH,QAAQ,KAAK,QAAQ,EAAE;AAChCA,QAAAA,QAAQ,GAAG;AAACH,UAAAA,IAAI,EAAE,MAAM;AAAErB,UAAAA,KAAK,EAAEwB;SAAS;AAC5C,MAAA;MAEAiI,cAAc,CAAC3I,IAAI,CAAC;AAClBO,QAAAA,IAAI,EAAE,SAAS;AACfC,QAAAA,OAAO,EAAE,GAAG;AACZC,QAAAA,UAAU,EAAE;AACV8B,UAAAA,IAAI,EACF,GAAG,GACHhB,aAAa,GACb,QAAQ,GACRK,MAAM,IACLmG,gBAAgB,GAAG,CAAC,GAAG,GAAG,GAAGA,gBAAgB,GAAG,EAAE,CAAC;AACtDc,UAAAA,mBAAmB,EAAE,EAAE;AACvBC,UAAAA,SAAS,EACP,OAAOV,iBAAiB,KAAK,QAAQ,GACjCA,iBAAiB,GACjBA,iBAAiB,CAACH,cAAc,EAAEF,gBAAgB,CAAC;UACzD9G,SAAS,EAAE,CAAC,uBAAuB;SACpC;QACDP,QAAQ,EAAEqE,KAAK,CAACC,OAAO,CAACtE,QAAQ,CAAC,GAAGA,QAAQ,GAAG,CAACA,QAAQ;AAC1D,OAAC,CAAC;AACJ,IAAA;IAEA,MAAM8C,IAAI,GAAGkF,OAAO,CAACA,OAAO,CAACnJ,MAAM,GAAG,CAAC,CAAC;AAExC,IAAA,IAAIiE,IAAI,IAAIA,IAAI,CAACjD,IAAI,KAAK,SAAS,IAAIiD,IAAI,CAAChD,OAAO,KAAK,GAAG,EAAE;AAC3D,MAAA,MAAMuI,QAAQ,GAAGvF,IAAI,CAAC9C,QAAQ,CAAC8C,IAAI,CAAC9C,QAAQ,CAACnB,MAAM,GAAG,CAAC,CAAC;AACxD,MAAA,IAAIwJ,QAAQ,IAAIA,QAAQ,CAACxI,IAAI,KAAK,MAAM,EAAE;QACxCwI,QAAQ,CAAC7J,KAAK,IAAI,GAAG;AACvB,MAAA,CAAC,MAAM;AACLsE,QAAAA,IAAI,CAAC9C,QAAQ,CAACV,IAAI,CAAC;AAACO,UAAAA,IAAI,EAAE,MAAM;AAAErB,UAAAA,KAAK,EAAE;AAAG,SAAC,CAAC;AAChD,MAAA;AAEAsE,MAAAA,IAAI,CAAC9C,QAAQ,CAACV,IAAI,CAAC,GAAG2I,cAAc,CAAC;AACvC,IAAA,CAAC,MAAM;AACLD,MAAAA,OAAO,CAAC1I,IAAI,CAAC,GAAG2I,cAAc,CAAC;AACjC,IAAA;;AAEA;AACA,IAAA,MAAMxE,QAAQ,GAAG;AACf5D,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,OAAO,EAAE,IAAI;AACbC,MAAAA,UAAU,EAAE;AAACgB,QAAAA,EAAE,EAAEF,aAAa,GAAG,KAAK,GAAGK;OAAO;AAChDlB,MAAAA,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAAC+H,OAAO,EAAE,IAAI;KACnC;AAEDrI,IAAAA,KAAK,CAACQ,KAAK,CAAC6C,UAAU,EAAES,QAAQ,CAAC;AAEjCqE,IAAAA,SAAS,CAACxI,IAAI,CAACmE,QAAQ,CAAC;AAC1B,EAAA;AAEA,EAAA,IAAIqE,SAAS,CAACjJ,MAAM,KAAK,CAAC,EAAE;AAC1B,IAAA;AACF,EAAA;EAEA,OAAO;AACLgB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,SAAS;AAClBC,IAAAA,UAAU,EAAE;AAACuI,MAAAA,aAAa,EAAE,IAAI;MAAE/H,SAAS,EAAE,CAAC,WAAW;KAAE;AAC3DP,IAAAA,QAAQ,EAAE,CACR;AACEH,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,OAAO,EAAE8H,oBAAoB;AAC7B7H,MAAAA,UAAU,EAAE;QACV,GAAGwI,eAAe,CAACV,uBAAuB,CAAC;AAC3C9G,QAAAA,EAAE,EAAE;OACL;AACDf,MAAAA,QAAQ,EAAE,CAAC;AAACH,QAAAA,IAAI,EAAE,MAAM;AAAErB,QAAAA,KAAK,EAAEmJ;OAAc;AACjD,KAAC,EACD;AAAC9H,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE;AAAI,KAAC,EAC3B;AACEqB,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,OAAO,EAAE,IAAI;MACbC,UAAU,EAAE,EAAE;AACdC,MAAAA,QAAQ,EAAEL,KAAK,CAACM,IAAI,CAAC6H,SAAS,EAAE,IAAI;AACtC,KAAC,EACD;AAACjI,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE;KAAK;GAE9B;AACH;;AC3PA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAkKA,MAAMgK,GAAG,GAAG,EAAE,CAACC,cAAc;;AAE7B;AACA,MAAMC,YAAY,GAAG,EAAE;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,WAAWA,CAACC,IAAI,EAAE9H,OAAO,EAAE;AACzC,EAAA,MAAM+H,QAAQ,GAAG/H,OAAO,IAAI4H,YAAY;AACxC;AACA,EAAA,MAAMzF,cAAc,GAAG,IAAI6F,GAAG,EAAE;AAChC;AACA,EAAA,MAAMf,YAAY,GAAG,IAAIe,GAAG,EAAE;AAC9B;AACA,EAAA,MAAMtH,cAAc,GAAG,IAAIsH,GAAG,EAAE;AAChC;AACA;AACA;AACA,EAAA,MAAMlC,UAAQ,GAAG;AAAC,IAAA,GAAGmC,QAAe;AAAE,IAAA,GAAGF,QAAQ,CAACjC;GAAS;;AAE3D;AACA,EAAA,MAAMjH,KAAK,GAAG;IACZO,GAAG;IACHE,SAAS;IACT6C,cAAc;IACd8E,YAAY;IACZvG,cAAc;AACdJ,IAAAA,aAAa,EAAE,EAAE;cACjBwF,UAAQ;IACRoC,GAAG;AACHlI,IAAAA,OAAO,EAAE+H,QAAQ;IACjB1I,KAAK;AACLF,IAAAA;GACD;AAEDgJ,EAAAA,KAAK,CAACL,IAAI,EAAE,UAAUhJ,IAAI,EAAE;IAC1B,IAAIA,IAAI,CAACC,IAAI,KAAK,YAAY,IAAID,IAAI,CAACC,IAAI,KAAK,oBAAoB,EAAE;MACpE,MAAMqJ,GAAG,GAAGtJ,IAAI,CAACC,IAAI,KAAK,YAAY,GAAGoD,cAAc,GAAG8E,YAAY;MACtE,MAAMhH,EAAE,GAAG5B,MAAM,CAACS,IAAI,CAACoB,UAAU,CAAC,CAACC,WAAW,EAAE;;AAEhD;AACA;AACA,MAAA,IAAI,CAACiI,GAAG,CAACC,GAAG,CAACpI,EAAE,CAAC,EAAE;AAChB;AACAmI,QAAAA,GAAG,CAACvH,GAAG,CAACZ,EAAE,EAAEnB,IAAI,CAAC;AACnB,MAAA;AACF,IAAA;AACF,EAAA,CAAC,CAAC;AAEF,EAAA,OAAOD,KAAK;;AAEZ;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,SAASqJ,GAAGA,CAACpJ,IAAI,EAAE8D,MAAM,EAAE;AACzB,IAAA,MAAM7D,IAAI,GAAGD,IAAI,CAACC,IAAI;AACtB,IAAA,MAAMuJ,MAAM,GAAGzJ,KAAK,CAACiH,QAAQ,CAAC/G,IAAI,CAAC;AAEnC,IAAA,IAAI2I,GAAG,CAACa,IAAI,CAAC1J,KAAK,CAACiH,QAAQ,EAAE/G,IAAI,CAAC,IAAIuJ,MAAM,EAAE;AAC5C,MAAA,OAAOA,MAAM,CAACzJ,KAAK,EAAEC,IAAI,EAAE8D,MAAM,CAAC;AACpC,IAAA;AAEA,IAAA,IAAI/D,KAAK,CAACmB,OAAO,CAACwI,WAAW,IAAI3J,KAAK,CAACmB,OAAO,CAACwI,WAAW,CAAC/E,QAAQ,CAAC1E,IAAI,CAAC,EAAE;MACzE,IAAI,UAAU,IAAID,IAAI,EAAE;QACtB,MAAM;UAACI,QAAQ;UAAE,GAAGuJ;AAAO,SAAC,GAAG3J,IAAI;AACnC,QAAA,MAAMnB,MAAM,GAAG8J,eAAe,CAACgB,OAAO,CAAC;AACvC;QACA9K,MAAM,CAACuB,QAAQ,GAAGL,KAAK,CAACO,GAAG,CAACN,IAAI,CAAC;AACjC;AACA,QAAA,OAAOnB,MAAM;AACf,MAAA;;AAEA;MACA,OAAO8J,eAAe,CAAC3I,IAAI,CAAC;AAC9B,IAAA;IAEA,MAAM4J,OAAO,GAAG7J,KAAK,CAACmB,OAAO,CAAC2I,cAAc,IAAIC,qBAAqB;AAErE,IAAA,OAAOF,OAAO,CAAC7J,KAAK,EAAEC,IAAI,EAAE8D,MAAM,CAAC;AACrC,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASxD,GAAGA,CAACwD,MAAM,EAAE;AACnB;IACA,MAAMiG,MAAM,GAAG,EAAE;IAEjB,IAAI,UAAU,IAAIjG,MAAM,EAAE;AACxB,MAAA,MAAMkG,KAAK,GAAGlG,MAAM,CAAC1D,QAAQ;MAC7B,IAAItB,KAAK,GAAG,EAAE;AACd,MAAA,OAAO,EAAEA,KAAK,GAAGkL,KAAK,CAAC/K,MAAM,EAAE;AAC7B,QAAA,MAAMJ,MAAM,GAAGkB,KAAK,CAACqJ,GAAG,CAACY,KAAK,CAAClL,KAAK,CAAC,EAAEgF,MAAM,CAAC;;AAE9C;AACA,QAAA,IAAIjF,MAAM,EAAE;AACV,UAAA,IAAIC,KAAK,IAAIkL,KAAK,CAAClL,KAAK,GAAG,CAAC,CAAC,CAACmB,IAAI,KAAK,OAAO,EAAE;AAC9C,YAAA,IAAI,CAACwE,KAAK,CAACC,OAAO,CAAC7F,MAAM,CAAC,IAAIA,MAAM,CAACoB,IAAI,KAAK,MAAM,EAAE;cACpDpB,MAAM,CAACD,KAAK,GAAGqL,sBAAsB,CAACpL,MAAM,CAACD,KAAK,CAAC;AACrD,YAAA;AAEA,YAAA,IAAI,CAAC6F,KAAK,CAACC,OAAO,CAAC7F,MAAM,CAAC,IAAIA,MAAM,CAACoB,IAAI,KAAK,SAAS,EAAE;AACvD,cAAA,MAAM+C,IAAI,GAAGnE,MAAM,CAACuB,QAAQ,CAAC,CAAC,CAAC;AAE/B,cAAA,IAAI4C,IAAI,IAAIA,IAAI,CAAC/C,IAAI,KAAK,MAAM,EAAE;gBAChC+C,IAAI,CAACpE,KAAK,GAAGqL,sBAAsB,CAACjH,IAAI,CAACpE,KAAK,CAAC;AACjD,cAAA;AACF,YAAA;AACF,UAAA;AAEA,UAAA,IAAI6F,KAAK,CAACC,OAAO,CAAC7F,MAAM,CAAC,EAAE;AACzBkL,YAAAA,MAAM,CAACrK,IAAI,CAAC,GAAGb,MAAM,CAAC;AACxB,UAAA,CAAC,MAAM;AACLkL,YAAAA,MAAM,CAACrK,IAAI,CAACb,MAAM,CAAC;AACrB,UAAA;AACF,QAAA;AACF,MAAA;AACF,IAAA;AAEA,IAAA,OAAOkL,MAAM;AACf,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASxJ,KAAKA,CAAC2J,IAAI,EAAEC,EAAE,EAAE;EACvB,IAAID,IAAI,CAAC1E,QAAQ,EAAE2E,EAAE,CAAC3E,QAAQ,GAAGA,QAAQ,CAAC0E,IAAI,CAAC;AACjD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS1J,SAASA,CAAC0J,IAAI,EAAEC,EAAE,EAAE;AAC3B;EACA,IAAItL,MAAM,GAAGsL,EAAE;;AAEf;AACA,EAAA,IAAID,IAAI,IAAIA,IAAI,CAACrJ,IAAI,EAAE;AACrB,IAAA,MAAMuJ,KAAK,GAAGF,IAAI,CAACrJ,IAAI,CAACuJ,KAAK;AAC7B,IAAA,MAAMC,SAAS,GAAGH,IAAI,CAACrJ,IAAI,CAACwJ,SAAS;AACrC,IAAA,MAAMC,WAAW,GAAGJ,IAAI,CAACrJ,IAAI,CAACyJ,WAAW;AAEzC,IAAA,IAAI,OAAOF,KAAK,KAAK,QAAQ,EAAE;AAC7B;AACA;AACA,MAAA,IAAIvL,MAAM,CAACoB,IAAI,KAAK,SAAS,EAAE;QAC7BpB,MAAM,CAACqB,OAAO,GAAGkK,KAAK;AACxB,MAAA;AACA;AACA;AACA;AACA;WACK;AACH;AACA;AACA,QAAA,MAAMhK,QAAQ,GAAG,UAAU,IAAIvB,MAAM,GAAGA,MAAM,CAACuB,QAAQ,GAAG,CAACvB,MAAM,CAAC;AAClEA,QAAAA,MAAM,GAAG;AAACoB,UAAAA,IAAI,EAAE,SAAS;AAAEC,UAAAA,OAAO,EAAEkK,KAAK;UAAEjK,UAAU,EAAE,EAAE;AAAEC,UAAAA;SAAS;AACtE,MAAA;AACF,IAAA;AAEA,IAAA,IAAIvB,MAAM,CAACoB,IAAI,KAAK,SAAS,IAAIqK,WAAW,EAAE;MAC5CC,MAAM,CAACC,MAAM,CAAC3L,MAAM,CAACsB,UAAU,EAAEwI,eAAe,CAAC2B,WAAW,CAAC,CAAC;AAChE,IAAA;AAEA,IAAA,IACE,UAAU,IAAIzL,MAAM,IACpBA,MAAM,CAACuB,QAAQ,IACfiK,SAAS,KAAK,IAAI,IAClBA,SAAS,KAAKvI,SAAS,EACvB;MACAjD,MAAM,CAACuB,QAAQ,GAAGiK,SAAS;AAC7B,IAAA;AACF,EAAA;AAEA,EAAA,OAAOxL,MAAM;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASiL,qBAAqBA,CAAC/J,KAAK,EAAEC,IAAI,EAAE;AAC1C,EAAA,MAAMa,IAAI,GAAGb,IAAI,CAACa,IAAI,IAAI,EAAE;AAC5B;EACA,MAAMhC,MAAM,GACV,OAAO,IAAImB,IAAI,IACf,EAAE4I,GAAG,CAACa,IAAI,CAAC5I,IAAI,EAAE,aAAa,CAAC,IAAI+H,GAAG,CAACa,IAAI,CAAC5I,IAAI,EAAE,WAAW,CAAC,CAAC,GAC3D;AAACZ,IAAAA,IAAI,EAAE,MAAM;IAAErB,KAAK,EAAEoB,IAAI,CAACpB;AAAK,GAAC,GACjC;AACEqB,IAAAA,IAAI,EAAE,SAAS;AACfC,IAAAA,OAAO,EAAE,KAAK;IACdC,UAAU,EAAE,EAAE;AACdC,IAAAA,QAAQ,EAAEL,KAAK,CAACO,GAAG,CAACN,IAAI;GACzB;AAEPD,EAAAA,KAAK,CAACQ,KAAK,CAACP,IAAI,EAAEnB,MAAM,CAAC;AACzB,EAAA,OAAOkB,KAAK,CAACS,SAAS,CAACR,IAAI,EAAEnB,MAAM,CAAC;AACtC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASwB,IAAIA,CAAC2J,KAAK,EAAEhG,KAAK,EAAE;AACjC;EACA,MAAMnF,MAAM,GAAG,EAAE;EACjB,IAAIC,KAAK,GAAG,EAAE;AAEd,EAAA,IAAIkF,KAAK,EAAE;IACTnF,MAAM,CAACa,IAAI,CAAC;AAACO,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE;AAAI,KAAC,CAAC;AAC1C,EAAA;AAEA,EAAA,OAAO,EAAEE,KAAK,GAAGkL,KAAK,CAAC/K,MAAM,EAAE;AAC7B,IAAA,IAAIH,KAAK,EAAED,MAAM,CAACa,IAAI,CAAC;AAACO,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE;AAAI,KAAC,CAAC;AACnDC,IAAAA,MAAM,CAACa,IAAI,CAACsK,KAAK,CAAClL,KAAK,CAAC,CAAC;AAC3B,EAAA;AAEA,EAAA,IAAIkF,KAAK,IAAIgG,KAAK,CAAC/K,MAAM,GAAG,CAAC,EAAE;IAC7BJ,MAAM,CAACa,IAAI,CAAC;AAACO,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE;AAAI,KAAC,CAAC;AAC1C,EAAA;AAEA,EAAA,OAAOC,MAAM;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASoL,sBAAsBA,CAACrL,KAAK,EAAE;EACrC,IAAIE,KAAK,GAAG,CAAC;AACb,EAAA,IAAII,IAAI,GAAGN,KAAK,CAACO,UAAU,CAACL,KAAK,CAAC;AAElC,EAAA,OAAOI,IAAI,KAAK,CAAC,IAAIA,IAAI,KAAK,EAAE,EAAE;AAChCJ,IAAAA,KAAK,EAAE;AACPI,IAAAA,IAAI,GAAGN,KAAK,CAACO,UAAU,CAACL,KAAK,CAAC;AAChC,EAAA;AAEA,EAAA,OAAOF,KAAK,CAACe,KAAK,CAACb,KAAK,CAAC;AAC3B;;ACxdA;AACA;AACA;AACA;AACA;;;AAMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS2L,MAAMA,CAACzB,IAAI,EAAE9H,OAAO,EAAE;AACpC,EAAA,MAAMnB,KAAK,GAAGgJ,WAAW,CAACC,IAAI,EAAE9H,OAAO,CAAC;EACxC,MAAMlB,IAAI,GAAGD,KAAK,CAACqJ,GAAG,CAACJ,IAAI,EAAElH,SAAS,CAAC;AACvC,EAAA,MAAM4I,IAAI,GAAG9C,MAAM,CAAC7H,KAAK,CAAC;AAC1B;EACA,MAAMlB,MAAM,GAAG4F,KAAK,CAACC,OAAO,CAAC1E,IAAI,CAAC,GAC9B;AAACC,IAAAA,IAAI,EAAE,MAAM;AAAEG,IAAAA,QAAQ,EAAEJ;GAAK,GAC9BA,IAAI,IAAI;AAACC,IAAAA,IAAI,EAAE,MAAM;AAAEG,IAAAA,QAAQ,EAAE;GAAG;AAExC,EAAA,IAAIsK,IAAI,EAAE;AAKR7L,IAAAA,MAAM,CAACuB,QAAQ,CAACV,IAAI,CAAC;AAACO,MAAAA,IAAI,EAAE,MAAM;AAAErB,MAAAA,KAAK,EAAE;KAAK,EAAE8L,IAAI,CAAC;AACzD,EAAA;AAEA,EAAA,OAAO7L,MAAM;AACf;;ACzGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AA+BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAS8L,YAAYA,CAACC,WAAW,EAAE1J,OAAO,EAAE;AACzD,EAAA,IAAI0J,WAAW,IAAI,KAAK,IAAIA,WAAW,EAAE;AACvC;AACJ;AACA;AACI,IAAA,OAAO,gBAAgB5B,IAAI,EAAE6B,IAAI,EAAE;AACjC;AACA,MAAA,MAAMC,QAAQ;MACZL,MAAM,CAACzB,IAAI,EAAE;QAAC6B,IAAI;QAAE,GAAG3J;AAAO,OAAC,CAChC;AACD,MAAA,MAAM0J,WAAW,CAACG,GAAG,CAACD,QAAQ,EAAED,IAAI,CAAC;IACvC,CAAC;AACH,EAAA;;AAEA;AACF;AACA;AACE,EAAA,OAAO,UAAU7B,IAAI,EAAE6B,IAAI,EAAE;AAC3B;AACA;AACA;AACA;AACA;AACA,IAAA,8BACEJ,MAAM,CAACzB,IAAI,EAAE;MAAC6B,IAAI;MAAE,IAAID,WAAW,IAAI1J,OAAO;AAAC,KAAC,CAAC;EAErD,CAAC;AACH;;;;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]}

package/dist/index-CCcIVEUK.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-CCcIVEUK.js","sources":["../../../node_modules/.pnpm/unist-util-is@6.0.0/node_modules/unist-util-is/lib/index.js","../../../node_modules/.pnpm/unist-util-visit-parents@6.0.1/node_modules/unist-util-visit-parents/lib/color.js","../../../node_modules/.pnpm/unist-util-visit-parents@6.0.1/node_modules/unist-util-visit-parents/lib/index.js","../../../node_modules/.pnpm/unist-util-visit@5.0.0/node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test) ? anyFactory(test) : propsFactory(test)\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propsFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n","/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n  return d\n}\n","/**\n * @typedef {import('unist').Node} UnistNode\n * @typedef {import('unist').Parent} UnistParent\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends Array<any>\n *   ? MatchesOne<Value, Check[keyof Check]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {InternalAncestor<InclusiveDescendant<Tree>, Child>} Ancestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<VisitedParents>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Tree type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly<ActionTuple>} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} test\n *   `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n *   Handle each node.\n * @param {boolean | null | undefined} [reverse]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n  /** @type {Test} */\n  let check\n\n  if (typeof test === 'function' && typeof visitor !== 'function') {\n    reverse = visitor\n    // @ts-expect-error no visitor given, so `visitor` is test.\n    visitor = test\n  } else {\n    // @ts-expect-error visitor given, so `test` isn’t a visitor.\n    check = test\n  }\n\n  const is = convert(check)\n  const step = reverse ? -1 : 1\n\n  factory(tree, undefined, [])()\n\n  /**\n   * @param {UnistNode} node\n   * @param {number | undefined} index\n   * @param {Array<UnistParent>} parents\n   */\n  function factory(node, index, parents) {\n    const value = /** @type {Record<string, unknown>} */ (\n      node && typeof node === 'object' ? node : {}\n    )\n\n    if (typeof value.type === 'string') {\n      const name =\n        // `hast`\n        typeof value.tagName === 'string'\n          ? value.tagName\n          : // `xast`\n          typeof value.name === 'string'\n          ? value.name\n          : undefined\n\n      Object.defineProperty(visit, 'name', {\n        value:\n          'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n      })\n    }\n\n    return visit\n\n    function visit() {\n      /** @type {Readonly<ActionTuple>} */\n      let result = empty\n      /** @type {Readonly<ActionTuple>} */\n      let subresult\n      /** @type {number} */\n      let offset\n      /** @type {Array<UnistParent>} */\n      let grandparents\n\n      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n        // @ts-expect-error: `visitor` is now a visitor.\n        result = toResult(visitor(node, parents))\n\n        if (result[0] === EXIT) {\n          return result\n        }\n      }\n\n      if ('children' in node && node.children) {\n        const nodeAsParent = /** @type {UnistParent} */ (node)\n\n        if (nodeAsParent.children && result[0] !== SKIP) {\n          offset = (reverse ? nodeAsParent.children.length : -1) + step\n          grandparents = parents.concat(nodeAsParent)\n\n          while (offset > -1 && offset < nodeAsParent.children.length) {\n            const child = nodeAsParent.children[offset]\n\n            subresult = factory(child, offset, grandparents)()\n\n            if (subresult[0] === EXIT) {\n              return subresult\n            }\n\n            offset =\n              typeof subresult[1] === 'number' ? subresult[1] : offset + step\n          }\n        }\n      }\n\n      return result\n    }\n  }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {Readonly<ActionTuple>}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return value === null || value === undefined ? empty : [value]\n}\n","/**\n * @typedef {import('unist').Node} UnistNode\n * @typedef {import('unist').Parent} UnistParent\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n// To do: use types from `unist-util-visit-parents` when it’s released.\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends Array<any>\n *   ? MatchesOne<Value, Check[keyof Check]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends UnistNode ? number | undefined : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends UnistParent ? Ancestor | undefined : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [Ancestor=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Visited, Parent<Ancestor, Visited>>} BuildVisitorFromMatch\n *   Build a typed `Visitor` function from a node and all possible parents.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Visited\n *   Node type.\n * @template {UnistParent} Ancestor\n *   Parent type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     Matches<Descendant, Check>,\n *     Extract<Descendant, UnistParent>\n *   >\n * )} BuildVisitorFromDescendants\n *   Build a typed `Visitor` function from a list of descendants and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Node type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} testOrVisitor\n *   `unist-util-is`-compatible test (optional, omit to pass a visitor).\n * @param {Visitor | boolean | null | undefined} [visitorOrReverse]\n *   Handle each node (when test is omitted, pass `reverse`).\n * @param {boolean | null | undefined} [maybeReverse=false]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {\n  /** @type {boolean | null | undefined} */\n  let reverse\n  /** @type {Test} */\n  let test\n  /** @type {Visitor} */\n  let visitor\n\n  if (\n    typeof testOrVisitor === 'function' &&\n    typeof visitorOrReverse !== 'function'\n  ) {\n    test = undefined\n    visitor = testOrVisitor\n    reverse = visitorOrReverse\n  } else {\n    // @ts-expect-error: assume the overload with test was given.\n    test = testOrVisitor\n    // @ts-expect-error: assume the overload with test was given.\n    visitor = visitorOrReverse\n    reverse = maybeReverse\n  }\n\n  visitParents(tree, test, overload, reverse)\n\n  /**\n   * @param {UnistNode} node\n   * @param {Array<UnistParent>} parents\n   */\n  function overload(node, parents) {\n    const parent = parents[parents.length - 1]\n    const index = parent ? parent.children.indexOf(node) : undefined\n    return visitor(node, index, parent)\n  }\n}\n"],"names":["convert","test","undefined","ok","castFactory","Array","isArray","anyFactory","propsFactory","typeFactory","Error","tests","checks","index","length","any","parameters","apply","check","checkAsRecord","all","node","nodeAsRecord","key","type","testFunction","value","parent","Boolean","looksLikeANode","call","color","d","empty","CONTINUE","EXIT","SKIP","visitParents","tree","visitor","reverse","is","step","factory","parents","name","tagName","Object","defineProperty","visit","result","subresult","offset","grandparents","toResult","children","nodeAsParent","concat","child","testOrVisitor","visitorOrReverse","maybeReverse","overload","indexOf"],"mappings":"AAAA;AACA;AACA;AACA;;;AAsHA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;MACaA,OAAO;AAClB;AACA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEI;AACJ;AACA;AACA;AACI,UAAUC,IAAI,EAAE;AACd,EAAA,IAAIA,IAAI,KAAK,IAAI,IAAIA,IAAI,KAAKC,SAAS,EAAE;AACvC,IAAA,OAAOC,EAAE;AACX,EAAA;AAEA,EAAA,IAAI,OAAOF,IAAI,KAAK,UAAU,EAAE;IAC9B,OAAOG,WAAW,CAACH,IAAI,CAAC;AAC1B,EAAA;AAEA,EAAA,IAAI,OAAOA,IAAI,KAAK,QAAQ,EAAE;AAC5B,IAAA,OAAOI,KAAK,CAACC,OAAO,CAACL,IAAI,CAAC,GAAGM,UAAU,CAACN,IAAI,CAAC,GAAGO,YAAY,CAACP,IAAI,CAAC;AACpE,EAAA;AAEA,EAAA,IAAI,OAAOA,IAAI,KAAK,QAAQ,EAAE;IAC5B,OAAOQ,WAAW,CAACR,IAAI,CAAC;AAC1B,EAAA;AAEA,EAAA,MAAM,IAAIS,KAAK,CAAC,8CAA8C,CAAC;AACjE;;AAGJ;AACA;AACA;AACA;AACA,SAASH,UAAUA,CAACI,KAAK,EAAE;AACzB;EACA,MAAMC,MAAM,GAAG,EAAE;EACjB,IAAIC,KAAK,GAAG,EAAE;AAEd,EAAA,OAAO,EAAEA,KAAK,GAAGF,KAAK,CAACG,MAAM,EAAE;IAC7BF,MAAM,CAACC,KAAK,CAAC,GAAGb,OAAO,CAACW,KAAK,CAACE,KAAK,CAAC,CAAC;AACvC,EAAA;EAEA,OAAOT,WAAW,CAACW,GAAG,CAAC;;AAEvB;AACF;AACA;AACA;AACE,EAAA,SAASA,GAAGA,CAAC,GAAGC,UAAU,EAAE;IAC1B,IAAIH,KAAK,GAAG,EAAE;AAEd,IAAA,OAAO,EAAEA,KAAK,GAAGD,MAAM,CAACE,MAAM,EAAE;AAC9B,MAAA,IAAIF,MAAM,CAACC,KAAK,CAAC,CAACI,KAAK,CAAC,IAAI,EAAED,UAAU,CAAC,EAAE,OAAO,IAAI;AACxD,IAAA;AAEA,IAAA,OAAO,KAAK;AACd,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASR,YAAYA,CAACU,KAAK,EAAE;EAC3B,MAAMC,aAAa,yCAA2CD,KAAM;EAEpE,OAAOd,WAAW,CAACgB,GAAG,CAAC;;AAEvB;AACF;AACA;AACA;EACE,SAASA,GAAGA,CAACC,IAAI,EAAE;AACjB,IAAA,MAAMC,YAAY;AAChB,0BAAwBD,IACzB;;AAED;AACA,IAAA,IAAIE,GAAG;IAEP,KAAKA,GAAG,IAAIL,KAAK,EAAE;MACjB,IAAII,YAAY,CAACC,GAAG,CAAC,KAAKJ,aAAa,CAACI,GAAG,CAAC,EAAE,OAAO,KAAK;AAC5D,IAAA;AAEA,IAAA,OAAO,IAAI;AACb,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASd,WAAWA,CAACS,KAAK,EAAE;EAC1B,OAAOd,WAAW,CAACoB,IAAI,CAAC;;AAExB;AACF;AACA;EACE,SAASA,IAAIA,CAACH,IAAI,EAAE;AAClB,IAAA,OAAOA,IAAI,IAAIA,IAAI,CAACG,IAAI,KAAKN,KAAK;AACpC,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASd,WAAWA,CAACqB,YAAY,EAAE;AACjC,EAAA,OAAOP,KAAK;;AAEZ;AACF;AACA;AACA;AACE,EAAA,SAASA,KAAKA,CAACQ,KAAK,EAAEb,KAAK,EAAEc,MAAM,EAAE;AACnC,IAAA,OAAOC,OAAO,CACZC,cAAc,CAACH,KAAK,CAAC,IACnBD,YAAY,CAACK,IAAI,CACf,IAAI,EACJJ,KAAK,EACL,OAAOb,KAAK,KAAK,QAAQ,GAAGA,KAAK,GAAGX,SAAS,EAC7CyB,MAAM,IAAIzB,SACZ,CACJ,CAAC;AACH,EAAA;AACF;AAEA,SAASC,EAAEA,GAAG;AACZ,EAAA,OAAO,IAAI;AACb;;AAEA;AACA;AACA;AACA;AACA,SAAS0B,cAAcA,CAACH,KAAK,EAAE;EAC7B,OAAOA,KAAK,KAAK,IAAI,IAAI,OAAOA,KAAK,KAAK,QAAQ,IAAI,MAAM,IAAIA,KAAK;AACvE;;AClSA;AACA;AACA;AACA;AACO,SAASK,KAAKA,CAACC,CAAC,EAAE;AACvB,EAAA,OAAOA,CAAC;AACV;;ACNA;AACA;AACA;AACA;;;AA2NA;AACA,MAAMC,KAAK,GAAG,EAAE;;AAEhB;AACA;AACA;AACO,MAAMC,QAAQ,GAAG;;AAExB;AACA;AACA;AACO,MAAMC,IAAI,GAAG;;AAEpB;AACA;AACA;AACO,MAAMC,IAAI,GAAG;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,YAAYA,CAACC,IAAI,EAAErC,IAAI,EAAEsC,OAAO,EAAEC,OAAO,EAAE;AACzD;AACA,EAAA,IAAItB,KAAK;EAET,IAAI,OAAOjB,IAAI,KAAK,UAAU,IAAI,OAAOsC,OAAO,KAAK,UAAU,EAAE;AAC/DC,IAAAA,OAAO,GAAGD,OAAO;AACjB;AACAA,IAAAA,OAAO,GAAGtC,IAAI;AAChB,EAAA,CAAC,MAAM;AACL;AACAiB,IAAAA,KAAK,GAAGjB,IAAI;AACd,EAAA;AAEA,EAAA,MAAMwC,EAAE,GAAGzC,OAAO,CAACkB,KAAK,CAAC;AACzB,EAAA,MAAMwB,IAAI,GAAGF,OAAO,GAAG,EAAE,GAAG,CAAC;EAE7BG,OAAO,CAACL,IAAI,EAAEpC,SAAS,EAAE,EAAE,CAAC,EAAE;;AAE9B;AACF;AACA;AACA;AACA;AACE,EAAA,SAASyC,OAAOA,CAACtB,IAAI,EAAER,KAAK,EAAE+B,OAAO,EAAE;AACrC,IAAA,MAAMlB,KAAK;IACTL,IAAI,IAAI,OAAOA,IAAI,KAAK,QAAQ,GAAGA,IAAI,GAAG,EAC3C;AAED,IAAA,IAAI,OAAOK,KAAK,CAACF,IAAI,KAAK,QAAQ,EAAE;AAClC,MAAA,MAAMqB,IAAI;AACR;MACA,OAAOnB,KAAK,CAACoB,OAAO,KAAK,QAAQ,GAC7BpB,KAAK,CAACoB,OAAO;AACb;MACF,OAAOpB,KAAK,CAACmB,IAAI,KAAK,QAAQ,GAC5BnB,KAAK,CAACmB,IAAI,GACV3C,SAAS;AAEf6C,MAAAA,MAAM,CAACC,cAAc,CAACC,KAAK,EAAE,MAAM,EAAE;QACnCvB,KAAK,EACH,QAAQ,GAAGK,KAAK,CAACV,IAAI,CAACG,IAAI,IAAIqB,IAAI,GAAG,GAAG,GAAGA,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG;AACnE,OAAC,CAAC;AACJ,IAAA;AAEA,IAAA,OAAOI,KAAK;IAEZ,SAASA,KAAKA,GAAG;AACf;MACA,IAAIC,MAAM,GAAGjB,KAAK;AAClB;AACA,MAAA,IAAIkB,SAAS;AACb;AACA,MAAA,IAAIC,MAAM;AACV;AACA,MAAA,IAAIC,YAAY;MAEhB,IAAI,CAACpD,IAAI,IAAIwC,EAAE,CAACpB,IAAI,EAAER,KAAK,EAAE+B,OAAO,CAACA,OAAO,CAAC9B,MAAM,GAAG,CAAC,CAAC,IAAIZ,SAAS,CAAC,EAAE;AACtE;QACAgD,MAAM,GAAGI,QAAQ,CAACf,OAAO,CAAClB,IAAI,EAAEuB,OAAO,CAAC,CAAC;AAEzC,QAAA,IAAIM,MAAM,CAAC,CAAC,CAAC,KAAKf,IAAI,EAAE;AACtB,UAAA,OAAOe,MAAM;AACf,QAAA;AACF,MAAA;AAEA,MAAA,IAAI,UAAU,IAAI7B,IAAI,IAAIA,IAAI,CAACkC,QAAQ,EAAE;QACvC,MAAMC,YAAY,6BAA+BnC,IAAK;QAEtD,IAAImC,YAAY,CAACD,QAAQ,IAAIL,MAAM,CAAC,CAAC,CAAC,KAAKd,IAAI,EAAE;AAC/CgB,UAAAA,MAAM,GAAG,CAACZ,OAAO,GAAGgB,YAAY,CAACD,QAAQ,CAACzC,MAAM,GAAG,EAAE,IAAI4B,IAAI;AAC7DW,UAAAA,YAAY,GAAGT,OAAO,CAACa,MAAM,CAACD,YAAY,CAAC;AAE3C,UAAA,OAAOJ,MAAM,GAAG,EAAE,IAAIA,MAAM,GAAGI,YAAY,CAACD,QAAQ,CAACzC,MAAM,EAAE;AAC3D,YAAA,MAAM4C,KAAK,GAAGF,YAAY,CAACD,QAAQ,CAACH,MAAM,CAAC;YAE3CD,SAAS,GAAGR,OAAO,CAACe,KAAK,EAAEN,MAAM,EAAEC,YAAY,CAAC,EAAE;AAElD,YAAA,IAAIF,SAAS,CAAC,CAAC,CAAC,KAAKhB,IAAI,EAAE;AACzB,cAAA,OAAOgB,SAAS;AAClB,YAAA;AAEAC,YAAAA,MAAM,GACJ,OAAOD,SAAS,CAAC,CAAC,CAAC,KAAK,QAAQ,GAAGA,SAAS,CAAC,CAAC,CAAC,GAAGC,MAAM,GAAGV,IAAI;AACnE,UAAA;AACF,QAAA;AACF,MAAA;AAEA,MAAA,OAAOQ,MAAM;AACf,IAAA;AACF,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASI,QAAQA,CAAC5B,KAAK,EAAE;AACvB,EAAA,IAAIrB,KAAK,CAACC,OAAO,CAACoB,KAAK,CAAC,EAAE;AACxB,IAAA,OAAOA,KAAK;AACd,EAAA;AAEA,EAAA,IAAI,OAAOA,KAAK,KAAK,QAAQ,EAAE;AAC7B,IAAA,OAAO,CAACQ,QAAQ,EAAER,KAAK,CAAC;AAC1B,EAAA;AAEA,EAAA,OAAOA,KAAK,KAAK,IAAI,IAAIA,KAAK,KAAKxB,SAAS,GAAG+B,KAAK,GAAG,CAACP,KAAK,CAAC;AAChE;;AC7YA;AACA;AACA;AACA;AACA;;;AAmOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASuB,KAAKA,CAACX,IAAI,EAAEqB,aAAa,EAAEC,gBAAgB,EAAEC,YAAY,EAAE;AACzE;AACA,EAAA,IAAIrB,OAAO;AACX;AACA,EAAA,IAAIvC,IAAI;AACR;AACA,EAAA,IAAIsC,OAAO;EAEX,IACE,OAAOoB,aAAa,KAAK,UAAU,IACnC,OAAOC,gBAAgB,KAAK,UAAU,EACtC;AACA3D,IAAAA,IAAI,GAAGC,SAAS;AAChBqC,IAAAA,OAAO,GAAGoB,aAAa;AACvBnB,IAAAA,OAAO,GAAGoB,gBAAgB;AAC5B,EAAA,CAAC,MAAM;AACL;AACA3D,IAAAA,IAAI,GAAG0D,aAAa;AACpB;AACApB,IAAAA,OAAO,GAAGqB,gBAAgB;AAC1BpB,IAAAA,OAAO,GAAGqB,YAAY;AACxB,EAAA;EAEAxB,YAAY,CAACC,IAAI,EAAErC,IAAI,EAAE6D,QAAQ,EAAEtB,OAAO,CAAC;;AAE3C;AACF;AACA;AACA;AACE,EAAA,SAASsB,QAAQA,CAACzC,IAAI,EAAEuB,OAAO,EAAE;IAC/B,MAAMjB,MAAM,GAAGiB,OAAO,CAACA,OAAO,CAAC9B,MAAM,GAAG,CAAC,CAAC;AAC1C,IAAA,MAAMD,KAAK,GAAGc,MAAM,GAAGA,MAAM,CAAC4B,QAAQ,CAACQ,OAAO,CAAC1C,IAAI,CAAC,GAAGnB,SAAS;AAChE,IAAA,OAAOqC,OAAO,CAAClB,IAAI,EAAER,KAAK,EAAEc,MAAM,CAAC;AACrC,EAAA;AACF;;;;","x_google_ignoreList":[0,1,2,3]}

package/dist/index-D8szzCn3.js

@@ -1,2 +0,0 @@
-export { C as CONTINUE, E as EXIT, S as SKIP, v as visit } from './index-CCcIVEUK.js';
-//# sourceMappingURL=index-D8szzCn3.js.map

package/dist/index-D8szzCn3.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-D8szzCn3.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}