drizzle-cube 0.4.29 → 0.4.30

package/dist/client/chunks/core-Y9e-sNfb.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"core-Y9e-sNfb.js","sources":["../../../node_modules/highlight.js/lib/core.js"],"sourcesContent":["/* eslint-disable no-multi-assign */\n\nfunction deepFreeze(obj) {\n  if (obj instanceof Map) {\n    obj.clear =\n      obj.delete =\n      obj.set =\n        function () {\n          throw new Error('map is read-only');\n        };\n  } else if (obj instanceof Set) {\n    obj.add =\n      obj.clear =\n      obj.delete =\n        function () {\n          throw new Error('set is read-only');\n        };\n  }\n\n  // Freeze self\n  Object.freeze(obj);\n\n  Object.getOwnPropertyNames(obj).forEach((name) => {\n    const prop = obj[name];\n    const type = typeof prop;\n\n    // Freeze prop if it is an object or function and also not already frozen\n    if ((type === 'object' || type === 'function') && !Object.isFrozen(prop)) {\n      deepFreeze(prop);\n    }\n  });\n\n  return obj;\n}\n\n/** @typedef {import('highlight.js').CallbackResponse} CallbackResponse */\n/** @typedef {import('highlight.js').CompiledMode} CompiledMode */\n/** @implements CallbackResponse */\n\nclass Response {\n  /**\n   * @param {CompiledMode} mode\n   */\n  constructor(mode) {\n    // eslint-disable-next-line no-undefined\n    if (mode.data === undefined) mode.data = {};\n\n    this.data = mode.data;\n    this.isMatchIgnored = false;\n  }\n\n  ignoreMatch() {\n    this.isMatchIgnored = true;\n  }\n}\n\n/**\n * @param {string} value\n * @returns {string}\n */\nfunction escapeHTML(value) {\n  return value\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n    .replace(/'/g, '&#x27;');\n}\n\n/**\n * performs a shallow merge of multiple objects into one\n *\n * @template T\n * @param {T} original\n * @param {Record<string,any>[]} objects\n * @returns {T} a single new object\n */\nfunction inherit$1(original, ...objects) {\n  /** @type Record<string,any> */\n  const result = Object.create(null);\n\n  for (const key in original) {\n    result[key] = original[key];\n  }\n  objects.forEach(function(obj) {\n    for (const key in obj) {\n      result[key] = obj[key];\n    }\n  });\n  return /** @type {T} */ (result);\n}\n\n/**\n * @typedef {object} Renderer\n * @property {(text: string) => void} addText\n * @property {(node: Node) => void} openNode\n * @property {(node: Node) => void} closeNode\n * @property {() => string} value\n */\n\n/** @typedef {{scope?: string, language?: string, sublanguage?: boolean}} Node */\n/** @typedef {{walk: (r: Renderer) => void}} Tree */\n/** */\n\nconst SPAN_CLOSE = '</span>';\n\n/**\n * Determines if a node needs to be wrapped in <span>\n *\n * @param {Node} node */\nconst emitsWrappingTags = (node) => {\n  // rarely we can have a sublanguage where language is undefined\n  // TODO: track down why\n  return !!node.scope;\n};\n\n/**\n *\n * @param {string} name\n * @param {{prefix:string}} options\n */\nconst scopeToCSSClass = (name, { prefix }) => {\n  // sub-language\n  if (name.startsWith(\"language:\")) {\n    return name.replace(\"language:\", \"language-\");\n  }\n  // tiered scope: comment.line\n  if (name.includes(\".\")) {\n    const pieces = name.split(\".\");\n    return [\n      `${prefix}${pieces.shift()}`,\n      ...(pieces.map((x, i) => `${x}${\"_\".repeat(i + 1)}`))\n    ].join(\" \");\n  }\n  // simple scope\n  return `${prefix}${name}`;\n};\n\n/** @type {Renderer} */\nclass HTMLRenderer {\n  /**\n   * Creates a new HTMLRenderer\n   *\n   * @param {Tree} parseTree - the parse tree (must support `walk` API)\n   * @param {{classPrefix: string}} options\n   */\n  constructor(parseTree, options) {\n    this.buffer = \"\";\n    this.classPrefix = options.classPrefix;\n    parseTree.walk(this);\n  }\n\n  /**\n   * Adds texts to the output stream\n   *\n   * @param {string} text */\n  addText(text) {\n    this.buffer += escapeHTML(text);\n  }\n\n  /**\n   * Adds a node open to the output stream (if needed)\n   *\n   * @param {Node} node */\n  openNode(node) {\n    if (!emitsWrappingTags(node)) return;\n\n    const className = scopeToCSSClass(node.scope,\n      { prefix: this.classPrefix });\n    this.span(className);\n  }\n\n  /**\n   * Adds a node close to the output stream (if needed)\n   *\n   * @param {Node} node */\n  closeNode(node) {\n    if (!emitsWrappingTags(node)) return;\n\n    this.buffer += SPAN_CLOSE;\n  }\n\n  /**\n   * returns the accumulated buffer\n  */\n  value() {\n    return this.buffer;\n  }\n\n  // helpers\n\n  /**\n   * Builds a span element\n   *\n   * @param {string} className */\n  span(className) {\n    this.buffer += `<span class=\"${className}\">`;\n  }\n}\n\n/** @typedef {{scope?: string, language?: string, children: Node[]} | string} Node */\n/** @typedef {{scope?: string, language?: string, children: Node[]} } DataNode */\n/** @typedef {import('highlight.js').Emitter} Emitter */\n/**  */\n\n/** @returns {DataNode} */\nconst newNode = (opts = {}) => {\n  /** @type DataNode */\n  const result = { children: [] };\n  Object.assign(result, opts);\n  return result;\n};\n\nclass TokenTree {\n  constructor() {\n    /** @type DataNode */\n    this.rootNode = newNode();\n    this.stack = [this.rootNode];\n  }\n\n  get top() {\n    return this.stack[this.stack.length - 1];\n  }\n\n  get root() { return this.rootNode; }\n\n  /** @param {Node} node */\n  add(node) {\n    this.top.children.push(node);\n  }\n\n  /** @param {string} scope */\n  openNode(scope) {\n    /** @type Node */\n    const node = newNode({ scope });\n    this.add(node);\n    this.stack.push(node);\n  }\n\n  closeNode() {\n    if (this.stack.length > 1) {\n      return this.stack.pop();\n    }\n    // eslint-disable-next-line no-undefined\n    return undefined;\n  }\n\n  closeAllNodes() {\n    while (this.closeNode());\n  }\n\n  toJSON() {\n    return JSON.stringify(this.rootNode, null, 4);\n  }\n\n  /**\n   * @typedef { import(\"./html_renderer\").Renderer } Renderer\n   * @param {Renderer} builder\n   */\n  walk(builder) {\n    // this does not\n    return this.constructor._walk(builder, this.rootNode);\n    // this works\n    // return TokenTree._walk(builder, this.rootNode);\n  }\n\n  /**\n   * @param {Renderer} builder\n   * @param {Node} node\n   */\n  static _walk(builder, node) {\n    if (typeof node === \"string\") {\n      builder.addText(node);\n    } else if (node.children) {\n      builder.openNode(node);\n      node.children.forEach((child) => this._walk(builder, child));\n      builder.closeNode(node);\n    }\n    return builder;\n  }\n\n  /**\n   * @param {Node} node\n   */\n  static _collapse(node) {\n    if (typeof node === \"string\") return;\n    if (!node.children) return;\n\n    if (node.children.every(el => typeof el === \"string\")) {\n      // node.text = node.children.join(\"\");\n      // delete node.children;\n      node.children = [node.children.join(\"\")];\n    } else {\n      node.children.forEach((child) => {\n        TokenTree._collapse(child);\n      });\n    }\n  }\n}\n\n/**\n  Currently this is all private API, but this is the minimal API necessary\n  that an Emitter must implement to fully support the parser.\n\n  Minimal interface:\n\n  - addText(text)\n  - __addSublanguage(emitter, subLanguageName)\n  - startScope(scope)\n  - endScope()\n  - finalize()\n  - toHTML()\n\n*/\n\n/**\n * @implements {Emitter}\n */\nclass TokenTreeEmitter extends TokenTree {\n  /**\n   * @param {*} options\n   */\n  constructor(options) {\n    super();\n    this.options = options;\n  }\n\n  /**\n   * @param {string} text\n   */\n  addText(text) {\n    if (text === \"\") { return; }\n\n    this.add(text);\n  }\n\n  /** @param {string} scope */\n  startScope(scope) {\n    this.openNode(scope);\n  }\n\n  endScope() {\n    this.closeNode();\n  }\n\n  /**\n   * @param {Emitter & {root: DataNode}} emitter\n   * @param {string} name\n   */\n  __addSublanguage(emitter, name) {\n    /** @type DataNode */\n    const node = emitter.root;\n    if (name) node.scope = `language:${name}`;\n\n    this.add(node);\n  }\n\n  toHTML() {\n    const renderer = new HTMLRenderer(this, this.options);\n    return renderer.value();\n  }\n\n  finalize() {\n    this.closeAllNodes();\n    return true;\n  }\n}\n\n/**\n * @param {string} value\n * @returns {RegExp}\n * */\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction source(re) {\n  if (!re) return null;\n  if (typeof re === \"string\") return re;\n\n  return re.source;\n}\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction lookahead(re) {\n  return concat('(?=', re, ')');\n}\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction anyNumberOfTimes(re) {\n  return concat('(?:', re, ')*');\n}\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction optional(re) {\n  return concat('(?:', re, ')?');\n}\n\n/**\n * @param {...(RegExp | string) } args\n * @returns {string}\n */\nfunction concat(...args) {\n  const joined = args.map((x) => source(x)).join(\"\");\n  return joined;\n}\n\n/**\n * @param { Array<string | RegExp | Object> } args\n * @returns {object}\n */\nfunction stripOptionsFromArgs(args) {\n  const opts = args[args.length - 1];\n\n  if (typeof opts === 'object' && opts.constructor === Object) {\n    args.splice(args.length - 1, 1);\n    return opts;\n  } else {\n    return {};\n  }\n}\n\n/** @typedef { {capture?: boolean} } RegexEitherOptions */\n\n/**\n * Any of the passed expresssions may match\n *\n * Creates a huge this | this | that | that match\n * @param {(RegExp | string)[] | [...(RegExp | string)[], RegexEitherOptions]} args\n * @returns {string}\n */\nfunction either(...args) {\n  /** @type { object & {capture?: boolean} }  */\n  const opts = stripOptionsFromArgs(args);\n  const joined = '('\n    + (opts.capture ? \"\" : \"?:\")\n    + args.map((x) => source(x)).join(\"|\") + \")\";\n  return joined;\n}\n\n/**\n * @param {RegExp | string} re\n * @returns {number}\n */\nfunction countMatchGroups(re) {\n  return (new RegExp(re.toString() + '|')).exec('').length - 1;\n}\n\n/**\n * Does lexeme start with a regular expression match at the beginning\n * @param {RegExp} re\n * @param {string} lexeme\n */\nfunction startsWith(re, lexeme) {\n  const match = re && re.exec(lexeme);\n  return match && match.index === 0;\n}\n\n// BACKREF_RE matches an open parenthesis or backreference. To avoid\n// an incorrect parse, it additionally matches the following:\n// - [...] elements, where the meaning of parentheses and escapes change\n// - other escape sequences, so we do not misparse escape sequences as\n//   interesting elements\n// - non-matching or lookahead parentheses, which do not capture. These\n//   follow the '(' with a '?'.\nconst BACKREF_RE = /\\[(?:[^\\\\\\]]|\\\\.)*\\]|\\(\\??|\\\\([1-9][0-9]*)|\\\\./;\n\n// **INTERNAL** Not intended for outside usage\n// join logically computes regexps.join(separator), but fixes the\n// backreferences so they continue to match.\n// it also places each individual regular expression into it's own\n// match group, keeping track of the sequencing of those match groups\n// is currently an exercise for the caller. :-)\n/**\n * @param {(string | RegExp)[]} regexps\n * @param {{joinWith: string}} opts\n * @returns {string}\n */\nfunction _rewriteBackreferences(regexps, { joinWith }) {\n  let numCaptures = 0;\n\n  return regexps.map((regex) => {\n    numCaptures += 1;\n    const offset = numCaptures;\n    let re = source(regex);\n    let out = '';\n\n    while (re.length > 0) {\n      const match = BACKREF_RE.exec(re);\n      if (!match) {\n        out += re;\n        break;\n      }\n      out += re.substring(0, match.index);\n      re = re.substring(match.index + match[0].length);\n      if (match[0][0] === '\\\\' && match[1]) {\n        // Adjust the backreference.\n        out += '\\\\' + String(Number(match[1]) + offset);\n      } else {\n        out += match[0];\n        if (match[0] === '(') {\n          numCaptures++;\n        }\n      }\n    }\n    return out;\n  }).map(re => `(${re})`).join(joinWith);\n}\n\n/** @typedef {import('highlight.js').Mode} Mode */\n/** @typedef {import('highlight.js').ModeCallback} ModeCallback */\n\n// Common regexps\nconst MATCH_NOTHING_RE = /\\b\\B/;\nconst IDENT_RE = '[a-zA-Z]\\\\w*';\nconst UNDERSCORE_IDENT_RE = '[a-zA-Z_]\\\\w*';\nconst NUMBER_RE = '\\\\b\\\\d+(\\\\.\\\\d+)?';\nconst C_NUMBER_RE = '(-?)(\\\\b0[xX][a-fA-F0-9]+|(\\\\b\\\\d+(\\\\.\\\\d*)?|\\\\.\\\\d+)([eE][-+]?\\\\d+)?)'; // 0x..., 0..., decimal, float\nconst BINARY_NUMBER_RE = '\\\\b(0b[01]+)'; // 0b...\nconst RE_STARTERS_RE = '!|!=|!==|%|%=|&|&&|&=|\\\\*|\\\\*=|\\\\+|\\\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\\\?|\\\\[|\\\\{|\\\\(|\\\\^|\\\\^=|\\\\||\\\\|=|\\\\|\\\\||~';\n\n/**\n* @param { Partial<Mode> & {binary?: string | RegExp} } opts\n*/\nconst SHEBANG = (opts = {}) => {\n  const beginShebang = /^#![ ]*\\//;\n  if (opts.binary) {\n    opts.begin = concat(\n      beginShebang,\n      /.*\\b/,\n      opts.binary,\n      /\\b.*/);\n  }\n  return inherit$1({\n    scope: 'meta',\n    begin: beginShebang,\n    end: /$/,\n    relevance: 0,\n    /** @type {ModeCallback} */\n    \"on:begin\": (m, resp) => {\n      if (m.index !== 0) resp.ignoreMatch();\n    }\n  }, opts);\n};\n\n// Common modes\nconst BACKSLASH_ESCAPE = {\n  begin: '\\\\\\\\[\\\\s\\\\S]', relevance: 0\n};\nconst APOS_STRING_MODE = {\n  scope: 'string',\n  begin: '\\'',\n  end: '\\'',\n  illegal: '\\\\n',\n  contains: [BACKSLASH_ESCAPE]\n};\nconst QUOTE_STRING_MODE = {\n  scope: 'string',\n  begin: '\"',\n  end: '\"',\n  illegal: '\\\\n',\n  contains: [BACKSLASH_ESCAPE]\n};\nconst PHRASAL_WORDS_MODE = {\n  begin: /\\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\\b/\n};\n/**\n * Creates a comment mode\n *\n * @param {string | RegExp} begin\n * @param {string | RegExp} end\n * @param {Mode | {}} [modeOptions]\n * @returns {Partial<Mode>}\n */\nconst COMMENT = function(begin, end, modeOptions = {}) {\n  const mode = inherit$1(\n    {\n      scope: 'comment',\n      begin,\n      end,\n      contains: []\n    },\n    modeOptions\n  );\n  mode.contains.push({\n    scope: 'doctag',\n    // hack to avoid the space from being included. the space is necessary to\n    // match here to prevent the plain text rule below from gobbling up doctags\n    begin: '[ ]*(?=(TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):)',\n    end: /(TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):/,\n    excludeBegin: true,\n    relevance: 0\n  });\n  const ENGLISH_WORD = either(\n    // list of common 1 and 2 letter words in English\n    \"I\",\n    \"a\",\n    \"is\",\n    \"so\",\n    \"us\",\n    \"to\",\n    \"at\",\n    \"if\",\n    \"in\",\n    \"it\",\n    \"on\",\n    // note: this is not an exhaustive list of contractions, just popular ones\n    /[A-Za-z]+['](d|ve|re|ll|t|s|n)/, // contractions - can't we'd they're let's, etc\n    /[A-Za-z]+[-][a-z]+/, // `no-way`, etc.\n    /[A-Za-z][a-z]{2,}/ // allow capitalized words at beginning of sentences\n  );\n  // looking like plain text, more likely to be a comment\n  mode.contains.push(\n    {\n      // TODO: how to include \", (, ) without breaking grammars that use these for\n      // comment delimiters?\n      // begin: /[ ]+([()\"]?([A-Za-z'-]{3,}|is|a|I|so|us|[tT][oO]|at|if|in|it|on)[.]?[()\":]?([.][ ]|[ ]|\\))){3}/\n      // ---\n\n      // this tries to find sequences of 3 english words in a row (without any\n      // \"programming\" type syntax) this gives us a strong signal that we've\n      // TRULY found a comment - vs perhaps scanning with the wrong language.\n      // It's possible to find something that LOOKS like the start of the\n      // comment - but then if there is no readable text - good chance it is a\n      // false match and not a comment.\n      //\n      // for a visual example please see:\n      // https://github.com/highlightjs/highlight.js/issues/2827\n\n      begin: concat(\n        /[ ]+/, // necessary to prevent us gobbling up doctags like /* @author Bob Mcgill */\n        '(',\n        ENGLISH_WORD,\n        /[.]?[:]?([.][ ]|[ ])/,\n        '){3}') // look for 3 words in a row\n    }\n  );\n  return mode;\n};\nconst C_LINE_COMMENT_MODE = COMMENT('//', '$');\nconst C_BLOCK_COMMENT_MODE = COMMENT('/\\\\*', '\\\\*/');\nconst HASH_COMMENT_MODE = COMMENT('#', '$');\nconst NUMBER_MODE = {\n  scope: 'number',\n  begin: NUMBER_RE,\n  relevance: 0\n};\nconst C_NUMBER_MODE = {\n  scope: 'number',\n  begin: C_NUMBER_RE,\n  relevance: 0\n};\nconst BINARY_NUMBER_MODE = {\n  scope: 'number',\n  begin: BINARY_NUMBER_RE,\n  relevance: 0\n};\nconst REGEXP_MODE = {\n  scope: \"regexp\",\n  begin: /\\/(?=[^/\\n]*\\/)/,\n  end: /\\/[gimuy]*/,\n  contains: [\n    BACKSLASH_ESCAPE,\n    {\n      begin: /\\[/,\n      end: /\\]/,\n      relevance: 0,\n      contains: [BACKSLASH_ESCAPE]\n    }\n  ]\n};\nconst TITLE_MODE = {\n  scope: 'title',\n  begin: IDENT_RE,\n  relevance: 0\n};\nconst UNDERSCORE_TITLE_MODE = {\n  scope: 'title',\n  begin: UNDERSCORE_IDENT_RE,\n  relevance: 0\n};\nconst METHOD_GUARD = {\n  // excludes method names from keyword processing\n  begin: '\\\\.\\\\s*' + UNDERSCORE_IDENT_RE,\n  relevance: 0\n};\n\n/**\n * Adds end same as begin mechanics to a mode\n *\n * Your mode must include at least a single () match group as that first match\n * group is what is used for comparison\n * @param {Partial<Mode>} mode\n */\nconst END_SAME_AS_BEGIN = function(mode) {\n  return Object.assign(mode,\n    {\n      /** @type {ModeCallback} */\n      'on:begin': (m, resp) => { resp.data._beginMatch = m[1]; },\n      /** @type {ModeCallback} */\n      'on:end': (m, resp) => { if (resp.data._beginMatch !== m[1]) resp.ignoreMatch(); }\n    });\n};\n\nvar MODES = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  APOS_STRING_MODE: APOS_STRING_MODE,\n  BACKSLASH_ESCAPE: BACKSLASH_ESCAPE,\n  BINARY_NUMBER_MODE: BINARY_NUMBER_MODE,\n  BINARY_NUMBER_RE: BINARY_NUMBER_RE,\n  COMMENT: COMMENT,\n  C_BLOCK_COMMENT_MODE: C_BLOCK_COMMENT_MODE,\n  C_LINE_COMMENT_MODE: C_LINE_COMMENT_MODE,\n  C_NUMBER_MODE: C_NUMBER_MODE,\n  C_NUMBER_RE: C_NUMBER_RE,\n  END_SAME_AS_BEGIN: END_SAME_AS_BEGIN,\n  HASH_COMMENT_MODE: HASH_COMMENT_MODE,\n  IDENT_RE: IDENT_RE,\n  MATCH_NOTHING_RE: MATCH_NOTHING_RE,\n  METHOD_GUARD: METHOD_GUARD,\n  NUMBER_MODE: NUMBER_MODE,\n  NUMBER_RE: NUMBER_RE,\n  PHRASAL_WORDS_MODE: PHRASAL_WORDS_MODE,\n  QUOTE_STRING_MODE: QUOTE_STRING_MODE,\n  REGEXP_MODE: REGEXP_MODE,\n  RE_STARTERS_RE: RE_STARTERS_RE,\n  SHEBANG: SHEBANG,\n  TITLE_MODE: TITLE_MODE,\n  UNDERSCORE_IDENT_RE: UNDERSCORE_IDENT_RE,\n  UNDERSCORE_TITLE_MODE: UNDERSCORE_TITLE_MODE\n});\n\n/**\n@typedef {import('highlight.js').CallbackResponse} CallbackResponse\n@typedef {import('highlight.js').CompilerExt} CompilerExt\n*/\n\n// Grammar extensions / plugins\n// See: https://github.com/highlightjs/highlight.js/issues/2833\n\n// Grammar extensions allow \"syntactic sugar\" to be added to the grammar modes\n// without requiring any underlying changes to the compiler internals.\n\n// `compileMatch` being the perfect small example of now allowing a grammar\n// author to write `match` when they desire to match a single expression rather\n// than being forced to use `begin`.  The extension then just moves `match` into\n// `begin` when it runs.  Ie, no features have been added, but we've just made\n// the experience of writing (and reading grammars) a little bit nicer.\n\n// ------\n\n// TODO: We need negative look-behind support to do this properly\n/**\n * Skip a match if it has a preceding dot\n *\n * This is used for `beginKeywords` to prevent matching expressions such as\n * `bob.keyword.do()`. The mode compiler automatically wires this up as a\n * special _internal_ 'on:begin' callback for modes with `beginKeywords`\n * @param {RegExpMatchArray} match\n * @param {CallbackResponse} response\n */\nfunction skipIfHasPrecedingDot(match, response) {\n  const before = match.input[match.index - 1];\n  if (before === \".\") {\n    response.ignoreMatch();\n  }\n}\n\n/**\n *\n * @type {CompilerExt}\n */\nfunction scopeClassName(mode, _parent) {\n  // eslint-disable-next-line no-undefined\n  if (mode.className !== undefined) {\n    mode.scope = mode.className;\n    delete mode.className;\n  }\n}\n\n/**\n * `beginKeywords` syntactic sugar\n * @type {CompilerExt}\n */\nfunction beginKeywords(mode, parent) {\n  if (!parent) return;\n  if (!mode.beginKeywords) return;\n\n  // for languages with keywords that include non-word characters checking for\n  // a word boundary is not sufficient, so instead we check for a word boundary\n  // or whitespace - this does no harm in any case since our keyword engine\n  // doesn't allow spaces in keywords anyways and we still check for the boundary\n  // first\n  mode.begin = '\\\\b(' + mode.beginKeywords.split(' ').join('|') + ')(?!\\\\.)(?=\\\\b|\\\\s)';\n  mode.__beforeBegin = skipIfHasPrecedingDot;\n  mode.keywords = mode.keywords || mode.beginKeywords;\n  delete mode.beginKeywords;\n\n  // prevents double relevance, the keywords themselves provide\n  // relevance, the mode doesn't need to double it\n  // eslint-disable-next-line no-undefined\n  if (mode.relevance === undefined) mode.relevance = 0;\n}\n\n/**\n * Allow `illegal` to contain an array of illegal values\n * @type {CompilerExt}\n */\nfunction compileIllegal(mode, _parent) {\n  if (!Array.isArray(mode.illegal)) return;\n\n  mode.illegal = either(...mode.illegal);\n}\n\n/**\n * `match` to match a single expression for readability\n * @type {CompilerExt}\n */\nfunction compileMatch(mode, _parent) {\n  if (!mode.match) return;\n  if (mode.begin || mode.end) throw new Error(\"begin & end are not supported with match\");\n\n  mode.begin = mode.match;\n  delete mode.match;\n}\n\n/**\n * provides the default 1 relevance to all modes\n * @type {CompilerExt}\n */\nfunction compileRelevance(mode, _parent) {\n  // eslint-disable-next-line no-undefined\n  if (mode.relevance === undefined) mode.relevance = 1;\n}\n\n// allow beforeMatch to act as a \"qualifier\" for the match\n// the full match begin must be [beforeMatch][begin]\nconst beforeMatchExt = (mode, parent) => {\n  if (!mode.beforeMatch) return;\n  // starts conflicts with endsParent which we need to make sure the child\n  // rule is not matched multiple times\n  if (mode.starts) throw new Error(\"beforeMatch cannot be used with starts\");\n\n  const originalMode = Object.assign({}, mode);\n  Object.keys(mode).forEach((key) => { delete mode[key]; });\n\n  mode.keywords = originalMode.keywords;\n  mode.begin = concat(originalMode.beforeMatch, lookahead(originalMode.begin));\n  mode.starts = {\n    relevance: 0,\n    contains: [\n      Object.assign(originalMode, { endsParent: true })\n    ]\n  };\n  mode.relevance = 0;\n\n  delete originalMode.beforeMatch;\n};\n\n// keywords that should have no default relevance value\nconst COMMON_KEYWORDS = [\n  'of',\n  'and',\n  'for',\n  'in',\n  'not',\n  'or',\n  'if',\n  'then',\n  'parent', // common variable name\n  'list', // common variable name\n  'value' // common variable name\n];\n\nconst DEFAULT_KEYWORD_SCOPE = \"keyword\";\n\n/**\n * Given raw keywords from a language definition, compile them.\n *\n * @param {string | Record<string,string|string[]> | Array<string>} rawKeywords\n * @param {boolean} caseInsensitive\n */\nfunction compileKeywords(rawKeywords, caseInsensitive, scopeName = DEFAULT_KEYWORD_SCOPE) {\n  /** @type {import(\"highlight.js/private\").KeywordDict} */\n  const compiledKeywords = Object.create(null);\n\n  // input can be a string of keywords, an array of keywords, or a object with\n  // named keys representing scopeName (which can then point to a string or array)\n  if (typeof rawKeywords === 'string') {\n    compileList(scopeName, rawKeywords.split(\" \"));\n  } else if (Array.isArray(rawKeywords)) {\n    compileList(scopeName, rawKeywords);\n  } else {\n    Object.keys(rawKeywords).forEach(function(scopeName) {\n      // collapse all our objects back into the parent object\n      Object.assign(\n        compiledKeywords,\n        compileKeywords(rawKeywords[scopeName], caseInsensitive, scopeName)\n      );\n    });\n  }\n  return compiledKeywords;\n\n  // ---\n\n  /**\n   * Compiles an individual list of keywords\n   *\n   * Ex: \"for if when while|5\"\n   *\n   * @param {string} scopeName\n   * @param {Array<string>} keywordList\n   */\n  function compileList(scopeName, keywordList) {\n    if (caseInsensitive) {\n      keywordList = keywordList.map(x => x.toLowerCase());\n    }\n    keywordList.forEach(function(keyword) {\n      const pair = keyword.split('|');\n      compiledKeywords[pair[0]] = [scopeName, scoreForKeyword(pair[0], pair[1])];\n    });\n  }\n}\n\n/**\n * Returns the proper score for a given keyword\n *\n * Also takes into account comment keywords, which will be scored 0 UNLESS\n * another score has been manually assigned.\n * @param {string} keyword\n * @param {string} [providedScore]\n */\nfunction scoreForKeyword(keyword, providedScore) {\n  // manual scores always win over common keywords\n  // so you can force a score of 1 if you really insist\n  if (providedScore) {\n    return Number(providedScore);\n  }\n\n  return commonKeyword(keyword) ? 0 : 1;\n}\n\n/**\n * Determines if a given keyword is common or not\n *\n * @param {string} keyword */\nfunction commonKeyword(keyword) {\n  return COMMON_KEYWORDS.includes(keyword.toLowerCase());\n}\n\n/*\n\nFor the reasoning behind this please see:\nhttps://github.com/highlightjs/highlight.js/issues/2880#issuecomment-747275419\n\n*/\n\n/**\n * @type {Record<string, boolean>}\n */\nconst seenDeprecations = {};\n\n/**\n * @param {string} message\n */\nconst error = (message) => {\n  console.error(message);\n};\n\n/**\n * @param {string} message\n * @param {any} args\n */\nconst warn = (message, ...args) => {\n  console.log(`WARN: ${message}`, ...args);\n};\n\n/**\n * @param {string} version\n * @param {string} message\n */\nconst deprecated = (version, message) => {\n  if (seenDeprecations[`${version}/${message}`]) return;\n\n  console.log(`Deprecated as of ${version}. ${message}`);\n  seenDeprecations[`${version}/${message}`] = true;\n};\n\n/* eslint-disable no-throw-literal */\n\n/**\n@typedef {import('highlight.js').CompiledMode} CompiledMode\n*/\n\nconst MultiClassError = new Error();\n\n/**\n * Renumbers labeled scope names to account for additional inner match\n * groups that otherwise would break everything.\n *\n * Lets say we 3 match scopes:\n *\n *   { 1 => ..., 2 => ..., 3 => ... }\n *\n * So what we need is a clean match like this:\n *\n *   (a)(b)(c) => [ \"a\", \"b\", \"c\" ]\n *\n * But this falls apart with inner match groups:\n *\n * (a)(((b)))(c) => [\"a\", \"b\", \"b\", \"b\", \"c\" ]\n *\n * Our scopes are now \"out of alignment\" and we're repeating `b` 3 times.\n * What needs to happen is the numbers are remapped:\n *\n *   { 1 => ..., 2 => ..., 5 => ... }\n *\n * We also need to know that the ONLY groups that should be output\n * are 1, 2, and 5.  This function handles this behavior.\n *\n * @param {CompiledMode} mode\n * @param {Array<RegExp | string>} regexes\n * @param {{key: \"beginScope\"|\"endScope\"}} opts\n */\nfunction remapScopeNames(mode, regexes, { key }) {\n  let offset = 0;\n  const scopeNames = mode[key];\n  /** @type Record<number,boolean> */\n  const emit = {};\n  /** @type Record<number,string> */\n  const positions = {};\n\n  for (let i = 1; i <= regexes.length; i++) {\n    positions[i + offset] = scopeNames[i];\n    emit[i + offset] = true;\n    offset += countMatchGroups(regexes[i - 1]);\n  }\n  // we use _emit to keep track of which match groups are \"top-level\" to avoid double\n  // output from inside match groups\n  mode[key] = positions;\n  mode[key]._emit = emit;\n  mode[key]._multi = true;\n}\n\n/**\n * @param {CompiledMode} mode\n */\nfunction beginMultiClass(mode) {\n  if (!Array.isArray(mode.begin)) return;\n\n  if (mode.skip || mode.excludeBegin || mode.returnBegin) {\n    error(\"skip, excludeBegin, returnBegin not compatible with beginScope: {}\");\n    throw MultiClassError;\n  }\n\n  if (typeof mode.beginScope !== \"object\" || mode.beginScope === null) {\n    error(\"beginScope must be object\");\n    throw MultiClassError;\n  }\n\n  remapScopeNames(mode, mode.begin, { key: \"beginScope\" });\n  mode.begin = _rewriteBackreferences(mode.begin, { joinWith: \"\" });\n}\n\n/**\n * @param {CompiledMode} mode\n */\nfunction endMultiClass(mode) {\n  if (!Array.isArray(mode.end)) return;\n\n  if (mode.skip || mode.excludeEnd || mode.returnEnd) {\n    error(\"skip, excludeEnd, returnEnd not compatible with endScope: {}\");\n    throw MultiClassError;\n  }\n\n  if (typeof mode.endScope !== \"object\" || mode.endScope === null) {\n    error(\"endScope must be object\");\n    throw MultiClassError;\n  }\n\n  remapScopeNames(mode, mode.end, { key: \"endScope\" });\n  mode.end = _rewriteBackreferences(mode.end, { joinWith: \"\" });\n}\n\n/**\n * this exists only to allow `scope: {}` to be used beside `match:`\n * Otherwise `beginScope` would necessary and that would look weird\n\n  {\n    match: [ /def/, /\\w+/ ]\n    scope: { 1: \"keyword\" , 2: \"title\" }\n  }\n\n * @param {CompiledMode} mode\n */\nfunction scopeSugar(mode) {\n  if (mode.scope && typeof mode.scope === \"object\" && mode.scope !== null) {\n    mode.beginScope = mode.scope;\n    delete mode.scope;\n  }\n}\n\n/**\n * @param {CompiledMode} mode\n */\nfunction MultiClass(mode) {\n  scopeSugar(mode);\n\n  if (typeof mode.beginScope === \"string\") {\n    mode.beginScope = { _wrap: mode.beginScope };\n  }\n  if (typeof mode.endScope === \"string\") {\n    mode.endScope = { _wrap: mode.endScope };\n  }\n\n  beginMultiClass(mode);\n  endMultiClass(mode);\n}\n\n/**\n@typedef {import('highlight.js').Mode} Mode\n@typedef {import('highlight.js').CompiledMode} CompiledMode\n@typedef {import('highlight.js').Language} Language\n@typedef {import('highlight.js').HLJSPlugin} HLJSPlugin\n@typedef {import('highlight.js').CompiledLanguage} CompiledLanguage\n*/\n\n// compilation\n\n/**\n * Compiles a language definition result\n *\n * Given the raw result of a language definition (Language), compiles this so\n * that it is ready for highlighting code.\n * @param {Language} language\n * @returns {CompiledLanguage}\n */\nfunction compileLanguage(language) {\n  /**\n   * Builds a regex with the case sensitivity of the current language\n   *\n   * @param {RegExp | string} value\n   * @param {boolean} [global]\n   */\n  function langRe(value, global) {\n    return new RegExp(\n      source(value),\n      'm'\n      + (language.case_insensitive ? 'i' : '')\n      + (language.unicodeRegex ? 'u' : '')\n      + (global ? 'g' : '')\n    );\n  }\n\n  /**\n    Stores multiple regular expressions and allows you to quickly search for\n    them all in a string simultaneously - returning the first match.  It does\n    this by creating a huge (a|b|c) regex - each individual item wrapped with ()\n    and joined by `|` - using match groups to track position.  When a match is\n    found checking which position in the array has content allows us to figure\n    out which of the original regexes / match groups triggered the match.\n\n    The match object itself (the result of `Regex.exec`) is returned but also\n    enhanced by merging in any meta-data that was registered with the regex.\n    This is how we keep track of which mode matched, and what type of rule\n    (`illegal`, `begin`, end, etc).\n  */\n  class MultiRegex {\n    constructor() {\n      this.matchIndexes = {};\n      // @ts-ignore\n      this.regexes = [];\n      this.matchAt = 1;\n      this.position = 0;\n    }\n\n    // @ts-ignore\n    addRule(re, opts) {\n      opts.position = this.position++;\n      // @ts-ignore\n      this.matchIndexes[this.matchAt] = opts;\n      this.regexes.push([opts, re]);\n      this.matchAt += countMatchGroups(re) + 1;\n    }\n\n    compile() {\n      if (this.regexes.length === 0) {\n        // avoids the need to check length every time exec is called\n        // @ts-ignore\n        this.exec = () => null;\n      }\n      const terminators = this.regexes.map(el => el[1]);\n      this.matcherRe = langRe(_rewriteBackreferences(terminators, { joinWith: '|' }), true);\n      this.lastIndex = 0;\n    }\n\n    /** @param {string} s */\n    exec(s) {\n      this.matcherRe.lastIndex = this.lastIndex;\n      const match = this.matcherRe.exec(s);\n      if (!match) { return null; }\n\n      // eslint-disable-next-line no-undefined\n      const i = match.findIndex((el, i) => i > 0 && el !== undefined);\n      // @ts-ignore\n      const matchData = this.matchIndexes[i];\n      // trim off any earlier non-relevant match groups (ie, the other regex\n      // match groups that make up the multi-matcher)\n      match.splice(0, i);\n\n      return Object.assign(match, matchData);\n    }\n  }\n\n  /*\n    Created to solve the key deficiently with MultiRegex - there is no way to\n    test for multiple matches at a single location.  Why would we need to do\n    that?  In the future a more dynamic engine will allow certain matches to be\n    ignored.  An example: if we matched say the 3rd regex in a large group but\n    decided to ignore it - we'd need to started testing again at the 4th\n    regex... but MultiRegex itself gives us no real way to do that.\n\n    So what this class creates MultiRegexs on the fly for whatever search\n    position they are needed.\n\n    NOTE: These additional MultiRegex objects are created dynamically.  For most\n    grammars most of the time we will never actually need anything more than the\n    first MultiRegex - so this shouldn't have too much overhead.\n\n    Say this is our search group, and we match regex3, but wish to ignore it.\n\n      regex1 | regex2 | regex3 | regex4 | regex5    ' ie, startAt = 0\n\n    What we need is a new MultiRegex that only includes the remaining\n    possibilities:\n\n      regex4 | regex5                               ' ie, startAt = 3\n\n    This class wraps all that complexity up in a simple API... `startAt` decides\n    where in the array of expressions to start doing the matching. It\n    auto-increments, so if a match is found at position 2, then startAt will be\n    set to 3.  If the end is reached startAt will return to 0.\n\n    MOST of the time the parser will be setting startAt manually to 0.\n  */\n  class ResumableMultiRegex {\n    constructor() {\n      // @ts-ignore\n      this.rules = [];\n      // @ts-ignore\n      this.multiRegexes = [];\n      this.count = 0;\n\n      this.lastIndex = 0;\n      this.regexIndex = 0;\n    }\n\n    // @ts-ignore\n    getMatcher(index) {\n      if (this.multiRegexes[index]) return this.multiRegexes[index];\n\n      const matcher = new MultiRegex();\n      this.rules.slice(index).forEach(([re, opts]) => matcher.addRule(re, opts));\n      matcher.compile();\n      this.multiRegexes[index] = matcher;\n      return matcher;\n    }\n\n    resumingScanAtSamePosition() {\n      return this.regexIndex !== 0;\n    }\n\n    considerAll() {\n      this.regexIndex = 0;\n    }\n\n    // @ts-ignore\n    addRule(re, opts) {\n      this.rules.push([re, opts]);\n      if (opts.type === \"begin\") this.count++;\n    }\n\n    /** @param {string} s */\n    exec(s) {\n      const m = this.getMatcher(this.regexIndex);\n      m.lastIndex = this.lastIndex;\n      let result = m.exec(s);\n\n      // The following is because we have no easy way to say \"resume scanning at the\n      // existing position but also skip the current rule ONLY\". What happens is\n      // all prior rules are also skipped which can result in matching the wrong\n      // thing. Example of matching \"booger\":\n\n      // our matcher is [string, \"booger\", number]\n      //\n      // ....booger....\n\n      // if \"booger\" is ignored then we'd really need a regex to scan from the\n      // SAME position for only: [string, number] but ignoring \"booger\" (if it\n      // was the first match), a simple resume would scan ahead who knows how\n      // far looking only for \"number\", ignoring potential string matches (or\n      // future \"booger\" matches that might be valid.)\n\n      // So what we do: We execute two matchers, one resuming at the same\n      // position, but the second full matcher starting at the position after:\n\n      //     /--- resume first regex match here (for [number])\n      //     |/---- full match here for [string, \"booger\", number]\n      //     vv\n      // ....booger....\n\n      // Which ever results in a match first is then used. So this 3-4 step\n      // process essentially allows us to say \"match at this position, excluding\n      // a prior rule that was ignored\".\n      //\n      // 1. Match \"booger\" first, ignore. Also proves that [string] does non match.\n      // 2. Resume matching for [number]\n      // 3. Match at index + 1 for [string, \"booger\", number]\n      // 4. If #2 and #3 result in matches, which came first?\n      if (this.resumingScanAtSamePosition()) {\n        if (result && result.index === this.lastIndex) ; else { // use the second matcher result\n          const m2 = this.getMatcher(0);\n          m2.lastIndex = this.lastIndex + 1;\n          result = m2.exec(s);\n        }\n      }\n\n      if (result) {\n        this.regexIndex += result.position + 1;\n        if (this.regexIndex === this.count) {\n          // wrap-around to considering all matches again\n          this.considerAll();\n        }\n      }\n\n      return result;\n    }\n  }\n\n  /**\n   * Given a mode, builds a huge ResumableMultiRegex that can be used to walk\n   * the content and find matches.\n   *\n   * @param {CompiledMode} mode\n   * @returns {ResumableMultiRegex}\n   */\n  function buildModeRegex(mode) {\n    const mm = new ResumableMultiRegex();\n\n    mode.contains.forEach(term => mm.addRule(term.begin, { rule: term, type: \"begin\" }));\n\n    if (mode.terminatorEnd) {\n      mm.addRule(mode.terminatorEnd, { type: \"end\" });\n    }\n    if (mode.illegal) {\n      mm.addRule(mode.illegal, { type: \"illegal\" });\n    }\n\n    return mm;\n  }\n\n  /** skip vs abort vs ignore\n   *\n   * @skip   - The mode is still entered and exited normally (and contains rules apply),\n   *           but all content is held and added to the parent buffer rather than being\n   *           output when the mode ends.  Mostly used with `sublanguage` to build up\n   *           a single large buffer than can be parsed by sublanguage.\n   *\n   *             - The mode begin ands ends normally.\n   *             - Content matched is added to the parent mode buffer.\n   *             - The parser cursor is moved forward normally.\n   *\n   * @abort  - A hack placeholder until we have ignore.  Aborts the mode (as if it\n   *           never matched) but DOES NOT continue to match subsequent `contains`\n   *           modes.  Abort is bad/suboptimal because it can result in modes\n   *           farther down not getting applied because an earlier rule eats the\n   *           content but then aborts.\n   *\n   *             - The mode does not begin.\n   *             - Content matched by `begin` is added to the mode buffer.\n   *             - The parser cursor is moved forward accordingly.\n   *\n   * @ignore - Ignores the mode (as if it never matched) and continues to match any\n   *           subsequent `contains` modes.  Ignore isn't technically possible with\n   *           the current parser implementation.\n   *\n   *             - The mode does not begin.\n   *             - Content matched by `begin` is ignored.\n   *             - The parser cursor is not moved forward.\n   */\n\n  /**\n   * Compiles an individual mode\n   *\n   * This can raise an error if the mode contains certain detectable known logic\n   * issues.\n   * @param {Mode} mode\n   * @param {CompiledMode | null} [parent]\n   * @returns {CompiledMode | never}\n   */\n  function compileMode(mode, parent) {\n    const cmode = /** @type CompiledMode */ (mode);\n    if (mode.isCompiled) return cmode;\n\n    [\n      scopeClassName,\n      // do this early so compiler extensions generally don't have to worry about\n      // the distinction between match/begin\n      compileMatch,\n      MultiClass,\n      beforeMatchExt\n    ].forEach(ext => ext(mode, parent));\n\n    language.compilerExtensions.forEach(ext => ext(mode, parent));\n\n    // __beforeBegin is considered private API, internal use only\n    mode.__beforeBegin = null;\n\n    [\n      beginKeywords,\n      // do this later so compiler extensions that come earlier have access to the\n      // raw array if they wanted to perhaps manipulate it, etc.\n      compileIllegal,\n      // default to 1 relevance if not specified\n      compileRelevance\n    ].forEach(ext => ext(mode, parent));\n\n    mode.isCompiled = true;\n\n    let keywordPattern = null;\n    if (typeof mode.keywords === \"object\" && mode.keywords.$pattern) {\n      // we need a copy because keywords might be compiled multiple times\n      // so we can't go deleting $pattern from the original on the first\n      // pass\n      mode.keywords = Object.assign({}, mode.keywords);\n      keywordPattern = mode.keywords.$pattern;\n      delete mode.keywords.$pattern;\n    }\n    keywordPattern = keywordPattern || /\\w+/;\n\n    if (mode.keywords) {\n      mode.keywords = compileKeywords(mode.keywords, language.case_insensitive);\n    }\n\n    cmode.keywordPatternRe = langRe(keywordPattern, true);\n\n    if (parent) {\n      if (!mode.begin) mode.begin = /\\B|\\b/;\n      cmode.beginRe = langRe(cmode.begin);\n      if (!mode.end && !mode.endsWithParent) mode.end = /\\B|\\b/;\n      if (mode.end) cmode.endRe = langRe(cmode.end);\n      cmode.terminatorEnd = source(cmode.end) || '';\n      if (mode.endsWithParent && parent.terminatorEnd) {\n        cmode.terminatorEnd += (mode.end ? '|' : '') + parent.terminatorEnd;\n      }\n    }\n    if (mode.illegal) cmode.illegalRe = langRe(/** @type {RegExp | string} */ (mode.illegal));\n    if (!mode.contains) mode.contains = [];\n\n    mode.contains = [].concat(...mode.contains.map(function(c) {\n      return expandOrCloneMode(c === 'self' ? mode : c);\n    }));\n    mode.contains.forEach(function(c) { compileMode(/** @type Mode */ (c), cmode); });\n\n    if (mode.starts) {\n      compileMode(mode.starts, parent);\n    }\n\n    cmode.matcher = buildModeRegex(cmode);\n    return cmode;\n  }\n\n  if (!language.compilerExtensions) language.compilerExtensions = [];\n\n  // self is not valid at the top-level\n  if (language.contains && language.contains.includes('self')) {\n    throw new Error(\"ERR: contains `self` is not supported at the top-level of a language.  See documentation.\");\n  }\n\n  // we need a null object, which inherit will guarantee\n  language.classNameAliases = inherit$1(language.classNameAliases || {});\n\n  return compileMode(/** @type Mode */ (language));\n}\n\n/**\n * Determines if a mode has a dependency on it's parent or not\n *\n * If a mode does have a parent dependency then often we need to clone it if\n * it's used in multiple places so that each copy points to the correct parent,\n * where-as modes without a parent can often safely be re-used at the bottom of\n * a mode chain.\n *\n * @param {Mode | null} mode\n * @returns {boolean} - is there a dependency on the parent?\n * */\nfunction dependencyOnParent(mode) {\n  if (!mode) return false;\n\n  return mode.endsWithParent || dependencyOnParent(mode.starts);\n}\n\n/**\n * Expands a mode or clones it if necessary\n *\n * This is necessary for modes with parental dependenceis (see notes on\n * `dependencyOnParent`) and for nodes that have `variants` - which must then be\n * exploded into their own individual modes at compile time.\n *\n * @param {Mode} mode\n * @returns {Mode | Mode[]}\n * */\nfunction expandOrCloneMode(mode) {\n  if (mode.variants && !mode.cachedVariants) {\n    mode.cachedVariants = mode.variants.map(function(variant) {\n      return inherit$1(mode, { variants: null }, variant);\n    });\n  }\n\n  // EXPAND\n  // if we have variants then essentially \"replace\" the mode with the variants\n  // this happens in compileMode, where this function is called from\n  if (mode.cachedVariants) {\n    return mode.cachedVariants;\n  }\n\n  // CLONE\n  // if we have dependencies on parents then we need a unique\n  // instance of ourselves, so we can be reused with many\n  // different parents without issue\n  if (dependencyOnParent(mode)) {\n    return inherit$1(mode, { starts: mode.starts ? inherit$1(mode.starts) : null });\n  }\n\n  if (Object.isFrozen(mode)) {\n    return inherit$1(mode);\n  }\n\n  // no special dependency issues, just return ourselves\n  return mode;\n}\n\nvar version = \"11.11.1\";\n\nclass HTMLInjectionError extends Error {\n  constructor(reason, html) {\n    super(reason);\n    this.name = \"HTMLInjectionError\";\n    this.html = html;\n  }\n}\n\n/*\nSyntax highlighting with language autodetection.\nhttps://highlightjs.org/\n*/\n\n\n\n/**\n@typedef {import('highlight.js').Mode} Mode\n@typedef {import('highlight.js').CompiledMode} CompiledMode\n@typedef {import('highlight.js').CompiledScope} CompiledScope\n@typedef {import('highlight.js').Language} Language\n@typedef {import('highlight.js').HLJSApi} HLJSApi\n@typedef {import('highlight.js').HLJSPlugin} HLJSPlugin\n@typedef {import('highlight.js').PluginEvent} PluginEvent\n@typedef {import('highlight.js').HLJSOptions} HLJSOptions\n@typedef {import('highlight.js').LanguageFn} LanguageFn\n@typedef {import('highlight.js').HighlightedHTMLElement} HighlightedHTMLElement\n@typedef {import('highlight.js').BeforeHighlightContext} BeforeHighlightContext\n@typedef {import('highlight.js/private').MatchType} MatchType\n@typedef {import('highlight.js/private').KeywordData} KeywordData\n@typedef {import('highlight.js/private').EnhancedMatch} EnhancedMatch\n@typedef {import('highlight.js/private').AnnotatedError} AnnotatedError\n@typedef {import('highlight.js').AutoHighlightResult} AutoHighlightResult\n@typedef {import('highlight.js').HighlightOptions} HighlightOptions\n@typedef {import('highlight.js').HighlightResult} HighlightResult\n*/\n\n\nconst escape = escapeHTML;\nconst inherit = inherit$1;\nconst NO_MATCH = Symbol(\"nomatch\");\nconst MAX_KEYWORD_HITS = 7;\n\n/**\n * @param {any} hljs - object that is extended (legacy)\n * @returns {HLJSApi}\n */\nconst HLJS = function(hljs) {\n  // Global internal variables used within the highlight.js library.\n  /** @type {Record<string, Language>} */\n  const languages = Object.create(null);\n  /** @type {Record<string, string>} */\n  const aliases = Object.create(null);\n  /** @type {HLJSPlugin[]} */\n  const plugins = [];\n\n  // safe/production mode - swallows more errors, tries to keep running\n  // even if a single syntax or parse hits a fatal error\n  let SAFE_MODE = true;\n  const LANGUAGE_NOT_FOUND = \"Could not find the language '{}', did you forget to load/include a language module?\";\n  /** @type {Language} */\n  const PLAINTEXT_LANGUAGE = { disableAutodetect: true, name: 'Plain text', contains: [] };\n\n  // Global options used when within external APIs. This is modified when\n  // calling the `hljs.configure` function.\n  /** @type HLJSOptions */\n  let options = {\n    ignoreUnescapedHTML: false,\n    throwUnescapedHTML: false,\n    noHighlightRe: /^(no-?highlight)$/i,\n    languageDetectRe: /\\blang(?:uage)?-([\\w-]+)\\b/i,\n    classPrefix: 'hljs-',\n    cssSelector: 'pre code',\n    languages: null,\n    // beta configuration options, subject to change, welcome to discuss\n    // https://github.com/highlightjs/highlight.js/issues/1086\n    __emitter: TokenTreeEmitter\n  };\n\n  /* Utility functions */\n\n  /**\n   * Tests a language name to see if highlighting should be skipped\n   * @param {string} languageName\n   */\n  function shouldNotHighlight(languageName) {\n    return options.noHighlightRe.test(languageName);\n  }\n\n  /**\n   * @param {HighlightedHTMLElement} block - the HTML element to determine language for\n   */\n  function blockLanguage(block) {\n    let classes = block.className + ' ';\n\n    classes += block.parentNode ? block.parentNode.className : '';\n\n    // language-* takes precedence over non-prefixed class names.\n    const match = options.languageDetectRe.exec(classes);\n    if (match) {\n      const language = getLanguage(match[1]);\n      if (!language) {\n        warn(LANGUAGE_NOT_FOUND.replace(\"{}\", match[1]));\n        warn(\"Falling back to no-highlight mode for this block.\", block);\n      }\n      return language ? match[1] : 'no-highlight';\n    }\n\n    return classes\n      .split(/\\s+/)\n      .find((_class) => shouldNotHighlight(_class) || getLanguage(_class));\n  }\n\n  /**\n   * Core highlighting function.\n   *\n   * OLD API\n   * highlight(lang, code, ignoreIllegals, continuation)\n   *\n   * NEW API\n   * highlight(code, {lang, ignoreIllegals})\n   *\n   * @param {string} codeOrLanguageName - the language to use for highlighting\n   * @param {string | HighlightOptions} optionsOrCode - the code to highlight\n   * @param {boolean} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n   *\n   * @returns {HighlightResult} Result - an object that represents the result\n   * @property {string} language - the language name\n   * @property {number} relevance - the relevance score\n   * @property {string} value - the highlighted HTML code\n   * @property {string} code - the original raw code\n   * @property {CompiledMode} top - top of the current mode stack\n   * @property {boolean} illegal - indicates whether any illegal matches were found\n  */\n  function highlight(codeOrLanguageName, optionsOrCode, ignoreIllegals) {\n    let code = \"\";\n    let languageName = \"\";\n    if (typeof optionsOrCode === \"object\") {\n      code = codeOrLanguageName;\n      ignoreIllegals = optionsOrCode.ignoreIllegals;\n      languageName = optionsOrCode.language;\n    } else {\n      // old API\n      deprecated(\"10.7.0\", \"highlight(lang, code, ...args) has been deprecated.\");\n      deprecated(\"10.7.0\", \"Please use highlight(code, options) instead.\\nhttps://github.com/highlightjs/highlight.js/issues/2277\");\n      languageName = codeOrLanguageName;\n      code = optionsOrCode;\n    }\n\n    // https://github.com/highlightjs/highlight.js/issues/3149\n    // eslint-disable-next-line no-undefined\n    if (ignoreIllegals === undefined) { ignoreIllegals = true; }\n\n    /** @type {BeforeHighlightContext} */\n    const context = {\n      code,\n      language: languageName\n    };\n    // the plugin can change the desired language or the code to be highlighted\n    // just be changing the object it was passed\n    fire(\"before:highlight\", context);\n\n    // a before plugin can usurp the result completely by providing it's own\n    // in which case we don't even need to call highlight\n    const result = context.result\n      ? context.result\n      : _highlight(context.language, context.code, ignoreIllegals);\n\n    result.code = context.code;\n    // the plugin can change anything in result to suite it\n    fire(\"after:highlight\", result);\n\n    return result;\n  }\n\n  /**\n   * private highlight that's used internally and does not fire callbacks\n   *\n   * @param {string} languageName - the language to use for highlighting\n   * @param {string} codeToHighlight - the code to highlight\n   * @param {boolean?} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n   * @param {CompiledMode?} [continuation] - current continuation mode, if any\n   * @returns {HighlightResult} - result of the highlight operation\n  */\n  function _highlight(languageName, codeToHighlight, ignoreIllegals, continuation) {\n    const keywordHits = Object.create(null);\n\n    /**\n     * Return keyword data if a match is a keyword\n     * @param {CompiledMode} mode - current mode\n     * @param {string} matchText - the textual match\n     * @returns {KeywordData | false}\n     */\n    function keywordData(mode, matchText) {\n      return mode.keywords[matchText];\n    }\n\n    function processKeywords() {\n      if (!top.keywords) {\n        emitter.addText(modeBuffer);\n        return;\n      }\n\n      let lastIndex = 0;\n      top.keywordPatternRe.lastIndex = 0;\n      let match = top.keywordPatternRe.exec(modeBuffer);\n      let buf = \"\";\n\n      while (match) {\n        buf += modeBuffer.substring(lastIndex, match.index);\n        const word = language.case_insensitive ? match[0].toLowerCase() : match[0];\n        const data = keywordData(top, word);\n        if (data) {\n          const [kind, keywordRelevance] = data;\n          emitter.addText(buf);\n          buf = \"\";\n\n          keywordHits[word] = (keywordHits[word] || 0) + 1;\n          if (keywordHits[word] <= MAX_KEYWORD_HITS) relevance += keywordRelevance;\n          if (kind.startsWith(\"_\")) {\n            // _ implied for relevance only, do not highlight\n            // by applying a class name\n            buf += match[0];\n          } else {\n            const cssClass = language.classNameAliases[kind] || kind;\n            emitKeyword(match[0], cssClass);\n          }\n        } else {\n          buf += match[0];\n        }\n        lastIndex = top.keywordPatternRe.lastIndex;\n        match = top.keywordPatternRe.exec(modeBuffer);\n      }\n      buf += modeBuffer.substring(lastIndex);\n      emitter.addText(buf);\n    }\n\n    function processSubLanguage() {\n      if (modeBuffer === \"\") return;\n      /** @type HighlightResult */\n      let result = null;\n\n      if (typeof top.subLanguage === 'string') {\n        if (!languages[top.subLanguage]) {\n          emitter.addText(modeBuffer);\n          return;\n        }\n        result = _highlight(top.subLanguage, modeBuffer, true, continuations[top.subLanguage]);\n        continuations[top.subLanguage] = /** @type {CompiledMode} */ (result._top);\n      } else {\n        result = highlightAuto(modeBuffer, top.subLanguage.length ? top.subLanguage : null);\n      }\n\n      // Counting embedded language score towards the host language may be disabled\n      // with zeroing the containing mode relevance. Use case in point is Markdown that\n      // allows XML everywhere and makes every XML snippet to have a much larger Markdown\n      // score.\n      if (top.relevance > 0) {\n        relevance += result.relevance;\n      }\n      emitter.__addSublanguage(result._emitter, result.language);\n    }\n\n    function processBuffer() {\n      if (top.subLanguage != null) {\n        processSubLanguage();\n      } else {\n        processKeywords();\n      }\n      modeBuffer = '';\n    }\n\n    /**\n     * @param {string} text\n     * @param {string} scope\n     */\n    function emitKeyword(keyword, scope) {\n      if (keyword === \"\") return;\n\n      emitter.startScope(scope);\n      emitter.addText(keyword);\n      emitter.endScope();\n    }\n\n    /**\n     * @param {CompiledScope} scope\n     * @param {RegExpMatchArray} match\n     */\n    function emitMultiClass(scope, match) {\n      let i = 1;\n      const max = match.length - 1;\n      while (i <= max) {\n        if (!scope._emit[i]) { i++; continue; }\n        const klass = language.classNameAliases[scope[i]] || scope[i];\n        const text = match[i];\n        if (klass) {\n          emitKeyword(text, klass);\n        } else {\n          modeBuffer = text;\n          processKeywords();\n          modeBuffer = \"\";\n        }\n        i++;\n      }\n    }\n\n    /**\n     * @param {CompiledMode} mode - new mode to start\n     * @param {RegExpMatchArray} match\n     */\n    function startNewMode(mode, match) {\n      if (mode.scope && typeof mode.scope === \"string\") {\n        emitter.openNode(language.classNameAliases[mode.scope] || mode.scope);\n      }\n      if (mode.beginScope) {\n        // beginScope just wraps the begin match itself in a scope\n        if (mode.beginScope._wrap) {\n          emitKeyword(modeBuffer, language.classNameAliases[mode.beginScope._wrap] || mode.beginScope._wrap);\n          modeBuffer = \"\";\n        } else if (mode.beginScope._multi) {\n          // at this point modeBuffer should just be the match\n          emitMultiClass(mode.beginScope, match);\n          modeBuffer = \"\";\n        }\n      }\n\n      top = Object.create(mode, { parent: { value: top } });\n      return top;\n    }\n\n    /**\n     * @param {CompiledMode } mode - the mode to potentially end\n     * @param {RegExpMatchArray} match - the latest match\n     * @param {string} matchPlusRemainder - match plus remainder of content\n     * @returns {CompiledMode | void} - the next mode, or if void continue on in current mode\n     */\n    function endOfMode(mode, match, matchPlusRemainder) {\n      let matched = startsWith(mode.endRe, matchPlusRemainder);\n\n      if (matched) {\n        if (mode[\"on:end\"]) {\n          const resp = new Response(mode);\n          mode[\"on:end\"](match, resp);\n          if (resp.isMatchIgnored) matched = false;\n        }\n\n        if (matched) {\n          while (mode.endsParent && mode.parent) {\n            mode = mode.parent;\n          }\n          return mode;\n        }\n      }\n      // even if on:end fires an `ignore` it's still possible\n      // that we might trigger the end node because of a parent mode\n      if (mode.endsWithParent) {\n        return endOfMode(mode.parent, match, matchPlusRemainder);\n      }\n    }\n\n    /**\n     * Handle matching but then ignoring a sequence of text\n     *\n     * @param {string} lexeme - string containing full match text\n     */\n    function doIgnore(lexeme) {\n      if (top.matcher.regexIndex === 0) {\n        // no more regexes to potentially match here, so we move the cursor forward one\n        // space\n        modeBuffer += lexeme[0];\n        return 1;\n      } else {\n        // no need to move the cursor, we still have additional regexes to try and\n        // match at this very spot\n        resumeScanAtSamePosition = true;\n        return 0;\n      }\n    }\n\n    /**\n     * Handle the start of a new potential mode match\n     *\n     * @param {EnhancedMatch} match - the current match\n     * @returns {number} how far to advance the parse cursor\n     */\n    function doBeginMatch(match) {\n      const lexeme = match[0];\n      const newMode = match.rule;\n\n      const resp = new Response(newMode);\n      // first internal before callbacks, then the public ones\n      const beforeCallbacks = [newMode.__beforeBegin, newMode[\"on:begin\"]];\n      for (const cb of beforeCallbacks) {\n        if (!cb) continue;\n        cb(match, resp);\n        if (resp.isMatchIgnored) return doIgnore(lexeme);\n      }\n\n      if (newMode.skip) {\n        modeBuffer += lexeme;\n      } else {\n        if (newMode.excludeBegin) {\n          modeBuffer += lexeme;\n        }\n        processBuffer();\n        if (!newMode.returnBegin && !newMode.excludeBegin) {\n          modeBuffer = lexeme;\n        }\n      }\n      startNewMode(newMode, match);\n      return newMode.returnBegin ? 0 : lexeme.length;\n    }\n\n    /**\n     * Handle the potential end of mode\n     *\n     * @param {RegExpMatchArray} match - the current match\n     */\n    function doEndMatch(match) {\n      const lexeme = match[0];\n      const matchPlusRemainder = codeToHighlight.substring(match.index);\n\n      const endMode = endOfMode(top, match, matchPlusRemainder);\n      if (!endMode) { return NO_MATCH; }\n\n      const origin = top;\n      if (top.endScope && top.endScope._wrap) {\n        processBuffer();\n        emitKeyword(lexeme, top.endScope._wrap);\n      } else if (top.endScope && top.endScope._multi) {\n        processBuffer();\n        emitMultiClass(top.endScope, match);\n      } else if (origin.skip) {\n        modeBuffer += lexeme;\n      } else {\n        if (!(origin.returnEnd || origin.excludeEnd)) {\n          modeBuffer += lexeme;\n        }\n        processBuffer();\n        if (origin.excludeEnd) {\n          modeBuffer = lexeme;\n        }\n      }\n      do {\n        if (top.scope) {\n          emitter.closeNode();\n        }\n        if (!top.skip && !top.subLanguage) {\n          relevance += top.relevance;\n        }\n        top = top.parent;\n      } while (top !== endMode.parent);\n      if (endMode.starts) {\n        startNewMode(endMode.starts, match);\n      }\n      return origin.returnEnd ? 0 : lexeme.length;\n    }\n\n    function processContinuations() {\n      const list = [];\n      for (let current = top; current !== language; current = current.parent) {\n        if (current.scope) {\n          list.unshift(current.scope);\n        }\n      }\n      list.forEach(item => emitter.openNode(item));\n    }\n\n    /** @type {{type?: MatchType, index?: number, rule?: Mode}}} */\n    let lastMatch = {};\n\n    /**\n     *  Process an individual match\n     *\n     * @param {string} textBeforeMatch - text preceding the match (since the last match)\n     * @param {EnhancedMatch} [match] - the match itself\n     */\n    function processLexeme(textBeforeMatch, match) {\n      const lexeme = match && match[0];\n\n      // add non-matched text to the current mode buffer\n      modeBuffer += textBeforeMatch;\n\n      if (lexeme == null) {\n        processBuffer();\n        return 0;\n      }\n\n      // we've found a 0 width match and we're stuck, so we need to advance\n      // this happens when we have badly behaved rules that have optional matchers to the degree that\n      // sometimes they can end up matching nothing at all\n      // Ref: https://github.com/highlightjs/highlight.js/issues/2140\n      if (lastMatch.type === \"begin\" && match.type === \"end\" && lastMatch.index === match.index && lexeme === \"\") {\n        // spit the \"skipped\" character that our regex choked on back into the output sequence\n        modeBuffer += codeToHighlight.slice(match.index, match.index + 1);\n        if (!SAFE_MODE) {\n          /** @type {AnnotatedError} */\n          const err = new Error(`0 width match regex (${languageName})`);\n          err.languageName = languageName;\n          err.badRule = lastMatch.rule;\n          throw err;\n        }\n        return 1;\n      }\n      lastMatch = match;\n\n      if (match.type === \"begin\") {\n        return doBeginMatch(match);\n      } else if (match.type === \"illegal\" && !ignoreIllegals) {\n        // illegal match, we do not continue processing\n        /** @type {AnnotatedError} */\n        const err = new Error('Illegal lexeme \"' + lexeme + '\" for mode \"' + (top.scope || '<unnamed>') + '\"');\n        err.mode = top;\n        throw err;\n      } else if (match.type === \"end\") {\n        const processed = doEndMatch(match);\n        if (processed !== NO_MATCH) {\n          return processed;\n        }\n      }\n\n      // edge case for when illegal matches $ (end of line) which is technically\n      // a 0 width match but not a begin/end match so it's not caught by the\n      // first handler (when ignoreIllegals is true)\n      if (match.type === \"illegal\" && lexeme === \"\") {\n        // advance so we aren't stuck in an infinite loop\n        modeBuffer += \"\\n\";\n        return 1;\n      }\n\n      // infinite loops are BAD, this is a last ditch catch all. if we have a\n      // decent number of iterations yet our index (cursor position in our\n      // parsing) still 3x behind our index then something is very wrong\n      // so we bail\n      if (iterations > 100000 && iterations > match.index * 3) {\n        const err = new Error('potential infinite loop, way more iterations than matches');\n        throw err;\n      }\n\n      /*\n      Why might be find ourselves here?  An potential end match that was\n      triggered but could not be completed.  IE, `doEndMatch` returned NO_MATCH.\n      (this could be because a callback requests the match be ignored, etc)\n\n      This causes no real harm other than stopping a few times too many.\n      */\n\n      modeBuffer += lexeme;\n      return lexeme.length;\n    }\n\n    const language = getLanguage(languageName);\n    if (!language) {\n      error(LANGUAGE_NOT_FOUND.replace(\"{}\", languageName));\n      throw new Error('Unknown language: \"' + languageName + '\"');\n    }\n\n    const md = compileLanguage(language);\n    let result = '';\n    /** @type {CompiledMode} */\n    let top = continuation || md;\n    /** @type Record<string,CompiledMode> */\n    const continuations = {}; // keep continuations for sub-languages\n    const emitter = new options.__emitter(options);\n    processContinuations();\n    let modeBuffer = '';\n    let relevance = 0;\n    let index = 0;\n    let iterations = 0;\n    let resumeScanAtSamePosition = false;\n\n    try {\n      if (!language.__emitTokens) {\n        top.matcher.considerAll();\n\n        for (;;) {\n          iterations++;\n          if (resumeScanAtSamePosition) {\n            // only regexes not matched previously will now be\n            // considered for a potential match\n            resumeScanAtSamePosition = false;\n          } else {\n            top.matcher.considerAll();\n          }\n          top.matcher.lastIndex = index;\n\n          const match = top.matcher.exec(codeToHighlight);\n          // console.log(\"match\", match[0], match.rule && match.rule.begin)\n\n          if (!match) break;\n\n          const beforeMatch = codeToHighlight.substring(index, match.index);\n          const processedCount = processLexeme(beforeMatch, match);\n          index = match.index + processedCount;\n        }\n        processLexeme(codeToHighlight.substring(index));\n      } else {\n        language.__emitTokens(codeToHighlight, emitter);\n      }\n\n      emitter.finalize();\n      result = emitter.toHTML();\n\n      return {\n        language: languageName,\n        value: result,\n        relevance,\n        illegal: false,\n        _emitter: emitter,\n        _top: top\n      };\n    } catch (err) {\n      if (err.message && err.message.includes('Illegal')) {\n        return {\n          language: languageName,\n          value: escape(codeToHighlight),\n          illegal: true,\n          relevance: 0,\n          _illegalBy: {\n            message: err.message,\n            index,\n            context: codeToHighlight.slice(index - 100, index + 100),\n            mode: err.mode,\n            resultSoFar: result\n          },\n          _emitter: emitter\n        };\n      } else if (SAFE_MODE) {\n        return {\n          language: languageName,\n          value: escape(codeToHighlight),\n          illegal: false,\n          relevance: 0,\n          errorRaised: err,\n          _emitter: emitter,\n          _top: top\n        };\n      } else {\n        throw err;\n      }\n    }\n  }\n\n  /**\n   * returns a valid highlight result, without actually doing any actual work,\n   * auto highlight starts with this and it's possible for small snippets that\n   * auto-detection may not find a better match\n   * @param {string} code\n   * @returns {HighlightResult}\n   */\n  function justTextHighlightResult(code) {\n    const result = {\n      value: escape(code),\n      illegal: false,\n      relevance: 0,\n      _top: PLAINTEXT_LANGUAGE,\n      _emitter: new options.__emitter(options)\n    };\n    result._emitter.addText(code);\n    return result;\n  }\n\n  /**\n  Highlighting with language detection. Accepts a string with the code to\n  highlight. Returns an object with the following properties:\n\n  - language (detected language)\n  - relevance (int)\n  - value (an HTML string with highlighting markup)\n  - secondBest (object with the same structure for second-best heuristically\n    detected language, may be absent)\n\n    @param {string} code\n    @param {Array<string>} [languageSubset]\n    @returns {AutoHighlightResult}\n  */\n  function highlightAuto(code, languageSubset) {\n    languageSubset = languageSubset || options.languages || Object.keys(languages);\n    const plaintext = justTextHighlightResult(code);\n\n    const results = languageSubset.filter(getLanguage).filter(autoDetection).map(name =>\n      _highlight(name, code, false)\n    );\n    results.unshift(plaintext); // plaintext is always an option\n\n    const sorted = results.sort((a, b) => {\n      // sort base on relevance\n      if (a.relevance !== b.relevance) return b.relevance - a.relevance;\n\n      // always award the tie to the base language\n      // ie if C++ and Arduino are tied, it's more likely to be C++\n      if (a.language && b.language) {\n        if (getLanguage(a.language).supersetOf === b.language) {\n          return 1;\n        } else if (getLanguage(b.language).supersetOf === a.language) {\n          return -1;\n        }\n      }\n\n      // otherwise say they are equal, which has the effect of sorting on\n      // relevance while preserving the original ordering - which is how ties\n      // have historically been settled, ie the language that comes first always\n      // wins in the case of a tie\n      return 0;\n    });\n\n    const [best, secondBest] = sorted;\n\n    /** @type {AutoHighlightResult} */\n    const result = best;\n    result.secondBest = secondBest;\n\n    return result;\n  }\n\n  /**\n   * Builds new class name for block given the language name\n   *\n   * @param {HTMLElement} element\n   * @param {string} [currentLang]\n   * @param {string} [resultLang]\n   */\n  function updateClassName(element, currentLang, resultLang) {\n    const language = (currentLang && aliases[currentLang]) || resultLang;\n\n    element.classList.add(\"hljs\");\n    element.classList.add(`language-${language}`);\n  }\n\n  /**\n   * Applies highlighting to a DOM node containing code.\n   *\n   * @param {HighlightedHTMLElement} element - the HTML element to highlight\n  */\n  function highlightElement(element) {\n    /** @type HTMLElement */\n    let node = null;\n    const language = blockLanguage(element);\n\n    if (shouldNotHighlight(language)) return;\n\n    fire(\"before:highlightElement\",\n      { el: element, language });\n\n    if (element.dataset.highlighted) {\n      console.log(\"Element previously highlighted. To highlight again, first unset `dataset.highlighted`.\", element);\n      return;\n    }\n\n    // we should be all text, no child nodes (unescaped HTML) - this is possibly\n    // an HTML injection attack - it's likely too late if this is already in\n    // production (the code has likely already done its damage by the time\n    // we're seeing it)... but we yell loudly about this so that hopefully it's\n    // more likely to be caught in development before making it to production\n    if (element.children.length > 0) {\n      if (!options.ignoreUnescapedHTML) {\n        console.warn(\"One of your code blocks includes unescaped HTML. This is a potentially serious security risk.\");\n        console.warn(\"https://github.com/highlightjs/highlight.js/wiki/security\");\n        console.warn(\"The element with unescaped HTML:\");\n        console.warn(element);\n      }\n      if (options.throwUnescapedHTML) {\n        const err = new HTMLInjectionError(\n          \"One of your code blocks includes unescaped HTML.\",\n          element.innerHTML\n        );\n        throw err;\n      }\n    }\n\n    node = element;\n    const text = node.textContent;\n    const result = language ? highlight(text, { language, ignoreIllegals: true }) : highlightAuto(text);\n\n    element.innerHTML = result.value;\n    element.dataset.highlighted = \"yes\";\n    updateClassName(element, language, result.language);\n    element.result = {\n      language: result.language,\n      // TODO: remove with version 11.0\n      re: result.relevance,\n      relevance: result.relevance\n    };\n    if (result.secondBest) {\n      element.secondBest = {\n        language: result.secondBest.language,\n        relevance: result.secondBest.relevance\n      };\n    }\n\n    fire(\"after:highlightElement\", { el: element, result, text });\n  }\n\n  /**\n   * Updates highlight.js global options with the passed options\n   *\n   * @param {Partial<HLJSOptions>} userOptions\n   */\n  function configure(userOptions) {\n    options = inherit(options, userOptions);\n  }\n\n  // TODO: remove v12, deprecated\n  const initHighlighting = () => {\n    highlightAll();\n    deprecated(\"10.6.0\", \"initHighlighting() deprecated.  Use highlightAll() now.\");\n  };\n\n  // TODO: remove v12, deprecated\n  function initHighlightingOnLoad() {\n    highlightAll();\n    deprecated(\"10.6.0\", \"initHighlightingOnLoad() deprecated.  Use highlightAll() now.\");\n  }\n\n  let wantsHighlight = false;\n\n  /**\n   * auto-highlights all pre>code elements on the page\n   */\n  function highlightAll() {\n    function boot() {\n      // if a highlight was requested before DOM was loaded, do now\n      highlightAll();\n    }\n\n    // if we are called too early in the loading process\n    if (document.readyState === \"loading\") {\n      // make sure the event listener is only added once\n      if (!wantsHighlight) {\n        window.addEventListener('DOMContentLoaded', boot, false);\n      }\n      wantsHighlight = true;\n      return;\n    }\n\n    const blocks = document.querySelectorAll(options.cssSelector);\n    blocks.forEach(highlightElement);\n  }\n\n  /**\n   * Register a language grammar module\n   *\n   * @param {string} languageName\n   * @param {LanguageFn} languageDefinition\n   */\n  function registerLanguage(languageName, languageDefinition) {\n    let lang = null;\n    try {\n      lang = languageDefinition(hljs);\n    } catch (error$1) {\n      error(\"Language definition for '{}' could not be registered.\".replace(\"{}\", languageName));\n      // hard or soft error\n      if (!SAFE_MODE) { throw error$1; } else { error(error$1); }\n      // languages that have serious errors are replaced with essentially a\n      // \"plaintext\" stand-in so that the code blocks will still get normal\n      // css classes applied to them - and one bad language won't break the\n      // entire highlighter\n      lang = PLAINTEXT_LANGUAGE;\n    }\n    // give it a temporary name if it doesn't have one in the meta-data\n    if (!lang.name) lang.name = languageName;\n    languages[languageName] = lang;\n    lang.rawDefinition = languageDefinition.bind(null, hljs);\n\n    if (lang.aliases) {\n      registerAliases(lang.aliases, { languageName });\n    }\n  }\n\n  /**\n   * Remove a language grammar module\n   *\n   * @param {string} languageName\n   */\n  function unregisterLanguage(languageName) {\n    delete languages[languageName];\n    for (const alias of Object.keys(aliases)) {\n      if (aliases[alias] === languageName) {\n        delete aliases[alias];\n      }\n    }\n  }\n\n  /**\n   * @returns {string[]} List of language internal names\n   */\n  function listLanguages() {\n    return Object.keys(languages);\n  }\n\n  /**\n   * @param {string} name - name of the language to retrieve\n   * @returns {Language | undefined}\n   */\n  function getLanguage(name) {\n    name = (name || '').toLowerCase();\n    return languages[name] || languages[aliases[name]];\n  }\n\n  /**\n   *\n   * @param {string|string[]} aliasList - single alias or list of aliases\n   * @param {{languageName: string}} opts\n   */\n  function registerAliases(aliasList, { languageName }) {\n    if (typeof aliasList === 'string') {\n      aliasList = [aliasList];\n    }\n    aliasList.forEach(alias => { aliases[alias.toLowerCase()] = languageName; });\n  }\n\n  /**\n   * Determines if a given language has auto-detection enabled\n   * @param {string} name - name of the language\n   */\n  function autoDetection(name) {\n    const lang = getLanguage(name);\n    return lang && !lang.disableAutodetect;\n  }\n\n  /**\n   * Upgrades the old highlightBlock plugins to the new\n   * highlightElement API\n   * @param {HLJSPlugin} plugin\n   */\n  function upgradePluginAPI(plugin) {\n    // TODO: remove with v12\n    if (plugin[\"before:highlightBlock\"] && !plugin[\"before:highlightElement\"]) {\n      plugin[\"before:highlightElement\"] = (data) => {\n        plugin[\"before:highlightBlock\"](\n          Object.assign({ block: data.el }, data)\n        );\n      };\n    }\n    if (plugin[\"after:highlightBlock\"] && !plugin[\"after:highlightElement\"]) {\n      plugin[\"after:highlightElement\"] = (data) => {\n        plugin[\"after:highlightBlock\"](\n          Object.assign({ block: data.el }, data)\n        );\n      };\n    }\n  }\n\n  /**\n   * @param {HLJSPlugin} plugin\n   */\n  function addPlugin(plugin) {\n    upgradePluginAPI(plugin);\n    plugins.push(plugin);\n  }\n\n  /**\n   * @param {HLJSPlugin} plugin\n   */\n  function removePlugin(plugin) {\n    const index = plugins.indexOf(plugin);\n    if (index !== -1) {\n      plugins.splice(index, 1);\n    }\n  }\n\n  /**\n   *\n   * @param {PluginEvent} event\n   * @param {any} args\n   */\n  function fire(event, args) {\n    const cb = event;\n    plugins.forEach(function(plugin) {\n      if (plugin[cb]) {\n        plugin[cb](args);\n      }\n    });\n  }\n\n  /**\n   * DEPRECATED\n   * @param {HighlightedHTMLElement} el\n   */\n  function deprecateHighlightBlock(el) {\n    deprecated(\"10.7.0\", \"highlightBlock will be removed entirely in v12.0\");\n    deprecated(\"10.7.0\", \"Please use highlightElement now.\");\n\n    return highlightElement(el);\n  }\n\n  /* Interface definition */\n  Object.assign(hljs, {\n    highlight,\n    highlightAuto,\n    highlightAll,\n    highlightElement,\n    // TODO: Remove with v12 API\n    highlightBlock: deprecateHighlightBlock,\n    configure,\n    initHighlighting,\n    initHighlightingOnLoad,\n    registerLanguage,\n    unregisterLanguage,\n    listLanguages,\n    getLanguage,\n    registerAliases,\n    autoDetection,\n    inherit,\n    addPlugin,\n    removePlugin\n  });\n\n  hljs.debugMode = function() { SAFE_MODE = false; };\n  hljs.safeMode = function() { SAFE_MODE = true; };\n  hljs.versionString = version;\n\n  hljs.regex = {\n    concat: concat,\n    lookahead: lookahead,\n    either: either,\n    optional: optional,\n    anyNumberOfTimes: anyNumberOfTimes\n  };\n\n  for (const key in MODES) {\n    // @ts-ignore\n    if (typeof MODES[key] === \"object\") {\n      // @ts-ignore\n      deepFreeze(MODES[key]);\n    }\n  }\n\n  // merge all the modes/regexes into our main object\n  Object.assign(hljs, MODES);\n\n  return hljs;\n};\n\n// Other names for the variable may break build script\nconst highlight = HLJS({});\n\n// returns a new instance of the highlighter to be used for extensions\n// check https://github.com/wooorm/lowlight/issues/47\nhighlight.newInstance = () => HLJS({});\n\nmodule.exports = highlight;\nhighlight.HighlightJS = highlight;\nhighlight.default = highlight;\n"],"names":["deepFreeze","obj","name","prop","type","Response","mode","escapeHTML","value","inherit$1","original","objects","result","key","SPAN_CLOSE","emitsWrappingTags","node","scopeToCSSClass","prefix","pieces","x","i","HTMLRenderer","parseTree","options","text","className","newNode","opts","TokenTree","scope","builder","child","el","TokenTreeEmitter","emitter","source","re","lookahead","concat","anyNumberOfTimes","optional","args","stripOptionsFromArgs","either","countMatchGroups","startsWith","lexeme","match","BACKREF_RE","_rewriteBackreferences","regexps","joinWith","numCaptures","regex","offset","out","MATCH_NOTHING_RE","IDENT_RE","UNDERSCORE_IDENT_RE","NUMBER_RE","C_NUMBER_RE","BINARY_NUMBER_RE","RE_STARTERS_RE","SHEBANG","beginShebang","m","resp","BACKSLASH_ESCAPE","APOS_STRING_MODE","QUOTE_STRING_MODE","PHRASAL_WORDS_MODE","COMMENT","begin","end","modeOptions","ENGLISH_WORD","C_LINE_COMMENT_MODE","C_BLOCK_COMMENT_MODE","HASH_COMMENT_MODE","NUMBER_MODE","C_NUMBER_MODE","BINARY_NUMBER_MODE","REGEXP_MODE","TITLE_MODE","UNDERSCORE_TITLE_MODE","METHOD_GUARD","MODES","skipIfHasPrecedingDot","response","scopeClassName","_parent","beginKeywords","parent","compileIllegal","compileMatch","compileRelevance","beforeMatchExt","originalMode","COMMON_KEYWORDS","DEFAULT_KEYWORD_SCOPE","compileKeywords","rawKeywords","caseInsensitive","scopeName","compiledKeywords","compileList","keywordList","keyword","pair","scoreForKeyword","providedScore","commonKeyword","seenDeprecations","error","message","warn","deprecated","version","MultiClassError","remapScopeNames","regexes","scopeNames","emit","positions","beginMultiClass","endMultiClass","scopeSugar","MultiClass","compileLanguage","language","langRe","global","MultiRegex","terminators","s","matchData","ResumableMultiRegex","index","matcher","m2","buildModeRegex","mm","term","compileMode","cmode","ext","keywordPattern","c","expandOrCloneMode","dependencyOnParent","variant","HTMLInjectionError","reason","html","escape","inherit","NO_MATCH","MAX_KEYWORD_HITS","HLJS","hljs","languages","aliases","plugins","SAFE_MODE","LANGUAGE_NOT_FOUND","PLAINTEXT_LANGUAGE","shouldNotHighlight","languageName","blockLanguage","block","classes","getLanguage","_class","highlight","codeOrLanguageName","optionsOrCode","ignoreIllegals","code","context","fire","_highlight","codeToHighlight","continuation","keywordHits","keywordData","matchText","processKeywords","top","modeBuffer","lastIndex","buf","word","data","kind","keywordRelevance","relevance","cssClass","emitKeyword","processSubLanguage","continuations","highlightAuto","processBuffer","emitMultiClass","max","klass","startNewMode","endOfMode","matchPlusRemainder","matched","doIgnore","resumeScanAtSamePosition","doBeginMatch","newMode","beforeCallbacks","cb","doEndMatch","endMode","origin","processContinuations","list","current","item","lastMatch","processLexeme","textBeforeMatch","err","processed","iterations","md","beforeMatch","processedCount","justTextHighlightResult","languageSubset","plaintext","results","autoDetection","sorted","a","b","best","secondBest","updateClassName","element","currentLang","resultLang","highlightElement","configure","userOptions","initHighlighting","highlightAll","initHighlightingOnLoad","wantsHighlight","boot","registerLanguage","languageDefinition","lang","error$1","registerAliases","unregisterLanguage","alias","listLanguages","aliasList","upgradePluginAPI","plugin","addPlugin","removePlugin","event","deprecateHighlightBlock","core"],"mappings":";;;;;AAEA,WAASA,GAAWC,GAAK;AACvB,WAAIA,aAAe,MACjBA,EAAI,QACFA,EAAI,SACJA,EAAI,MACF,WAAY;AACV,YAAM,IAAI,MAAM,kBAAkB;AAAA,IAC5C,IACaA,aAAe,QACxBA,EAAI,MACFA,EAAI,QACJA,EAAI,SACF,WAAY;AACV,YAAM,IAAI,MAAM,kBAAkB;AAAA,IAC5C,IAIE,OAAO,OAAOA,CAAG,GAEjB,OAAO,oBAAoBA,CAAG,EAAE,QAAQ,CAACC,MAAS;AAChD,YAAMC,IAAOF,EAAIC,CAAI,GACfE,IAAO,OAAOD;AAGpB,OAAKC,MAAS,YAAYA,MAAS,eAAe,CAAC,OAAO,SAASD,CAAI,KACrEH,GAAWG,CAAI;AAAA,IAErB,CAAG,GAEMF;AAAA,EACT;AAAA,EAMA,MAAMI,GAAS;AAAA;AAAA;AAAA;AAAA,IAIb,YAAYC,GAAM;AAEhB,MAAIA,EAAK,SAAS,WAAWA,EAAK,OAAO,CAAA,IAEzC,KAAK,OAAOA,EAAK,MACjB,KAAK,iBAAiB;AAAA,IAC1B;AAAA,IAEE,cAAc;AACZ,WAAK,iBAAiB;AAAA,IAC1B;AAAA,EACA;AAMA,WAASC,GAAWC,GAAO;AACzB,WAAOA,EACJ,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ,EACtB,QAAQ,MAAM,QAAQ;AAAA,EAC3B;AAUA,WAASC,EAAUC,MAAaC,GAAS;AAEvC,UAAMC,IAAS,uBAAO,OAAO,IAAI;AAEjC,eAAWC,KAAOH;AAChB,MAAAE,EAAOC,CAAG,IAAIH,EAASG,CAAG;AAE5B,WAAAF,EAAQ,QAAQ,SAASV,GAAK;AAC5B,iBAAWY,KAAOZ;AAChB,QAAAW,EAAOC,CAAG,IAAIZ,EAAIY,CAAG;AAAA,IAE3B,CAAG;AAAA,IACwBD;AAAA,EAC3B;AAcA,QAAME,KAAa,WAMbC,KAAoB,CAACC,MAGlB,CAAC,CAACA,EAAK,OAQVC,KAAkB,CAACf,GAAM,EAAE,QAAAgB,EAAM,MAAO;AAE5C,QAAIhB,EAAK,WAAW,WAAW;AAC7B,aAAOA,EAAK,QAAQ,aAAa,WAAW;AAG9C,QAAIA,EAAK,SAAS,GAAG,GAAG;AACtB,YAAMiB,IAASjB,EAAK,MAAM,GAAG;AAC7B,aAAO;AAAA,QACL,GAAGgB,CAAM,GAAGC,EAAO,MAAK,CAAE;AAAA,QAC1B,GAAIA,EAAO,IAAI,CAACC,GAAGC,MAAM,GAAGD,CAAC,GAAG,IAAI,OAAOC,IAAI,CAAC,CAAC,EAAE;AAAA,MACzD,EAAM,KAAK,GAAG;AAAA,IACd;AAEE,WAAO,GAAGH,CAAM,GAAGhB,CAAI;AAAA,EACzB;AAAA,EAGA,MAAMoB,GAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOjB,YAAYC,GAAWC,GAAS;AAC9B,WAAK,SAAS,IACd,KAAK,cAAcA,EAAQ,aAC3BD,EAAU,KAAK,IAAI;AAAA,IACvB;AAAA;AAAA;AAAA;AAAA;AAAA,IAME,QAAQE,GAAM;AACZ,WAAK,UAAUlB,GAAWkB,CAAI;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA;AAAA,IAME,SAAST,GAAM;AACb,UAAI,CAACD,GAAkBC,CAAI,EAAG;AAE9B,YAAMU,IAAYT;AAAA,QAAgBD,EAAK;AAAA,QACrC,EAAE,QAAQ,KAAK;MAAa;AAC9B,WAAK,KAAKU,CAAS;AAAA,IACvB;AAAA;AAAA;AAAA;AAAA;AAAA,IAME,UAAUV,GAAM;AACd,MAAKD,GAAkBC,CAAI,MAE3B,KAAK,UAAUF;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA,IAKE,QAAQ;AACN,aAAO,KAAK;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQE,KAAKY,GAAW;AACd,WAAK,UAAU,gBAAgBA,CAAS;AAAA,IAC5C;AAAA,EACA;AAQA,QAAMC,KAAU,CAACC,IAAO,OAAO;AAE7B,UAAMhB,IAAS,EAAE,UAAU,GAAE;AAC7B,kBAAO,OAAOA,GAAQgB,CAAI,GACnBhB;AAAA,EACT;AAAA,EAEA,MAAMiB,EAAU;AAAA,IACd,cAAc;AAEZ,WAAK,WAAWF,GAAO,GACvB,KAAK,QAAQ,CAAC,KAAK,QAAQ;AAAA,IAC/B;AAAA,IAEE,IAAI,MAAM;AACR,aAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAAA,IAC3C;AAAA,IAEE,IAAI,OAAO;AAAE,aAAO,KAAK;AAAA,IAAS;AAAA;AAAA,IAGlC,IAAIX,GAAM;AACR,WAAK,IAAI,SAAS,KAAKA,CAAI;AAAA,IAC/B;AAAA;AAAA,IAGE,SAASc,GAAO;AAEd,YAAMd,IAAOW,GAAQ,EAAE,OAAAG,GAAO;AAC9B,WAAK,IAAId,CAAI,GACb,KAAK,MAAM,KAAKA,CAAI;AAAA,IACxB;AAAA,IAEE,YAAY;AACV,UAAI,KAAK,MAAM,SAAS;AACtB,eAAO,KAAK,MAAM,IAAG;AAAA,IAI3B;AAAA,IAEE,gBAAgB;AACd,aAAO,KAAK,cAAY;AAAA,IAC5B;AAAA,IAEE,SAAS;AACP,aAAO,KAAK,UAAU,KAAK,UAAU,MAAM,CAAC;AAAA,IAChD;AAAA;AAAA;AAAA;AAAA;AAAA,IAME,KAAKe,GAAS;AAEZ,aAAO,KAAK,YAAY,MAAMA,GAAS,KAAK,QAAQ;AAAA,IAGxD;AAAA;AAAA;AAAA;AAAA;AAAA,IAME,OAAO,MAAMA,GAASf,GAAM;AAC1B,aAAI,OAAOA,KAAS,WAClBe,EAAQ,QAAQf,CAAI,IACXA,EAAK,aACde,EAAQ,SAASf,CAAI,GACrBA,EAAK,SAAS,QAAQ,CAACgB,MAAU,KAAK,MAAMD,GAASC,CAAK,CAAC,GAC3DD,EAAQ,UAAUf,CAAI,IAEjBe;AAAA,IACX;AAAA;AAAA;AAAA;AAAA,IAKE,OAAO,UAAUf,GAAM;AACrB,MAAI,OAAOA,KAAS,YACfA,EAAK,aAENA,EAAK,SAAS,MAAM,CAAAiB,MAAM,OAAOA,KAAO,QAAQ,IAGlDjB,EAAK,WAAW,CAACA,EAAK,SAAS,KAAK,EAAE,CAAC,IAEvCA,EAAK,SAAS,QAAQ,CAACgB,MAAU;AAC/B,QAAAH,EAAU,UAAUG,CAAK;AAAA,MACjC,CAAO;AAAA,IAEP;AAAA,EACA;AAAA,EAoBA,MAAME,WAAyBL,EAAU;AAAA;AAAA;AAAA;AAAA,IAIvC,YAAYL,GAAS;AACnB,YAAK,GACL,KAAK,UAAUA;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA,IAKE,QAAQC,GAAM;AACZ,MAAIA,MAAS,MAEb,KAAK,IAAIA,CAAI;AAAA,IACjB;AAAA;AAAA,IAGE,WAAWK,GAAO;AAChB,WAAK,SAASA,CAAK;AAAA,IACvB;AAAA,IAEE,WAAW;AACT,WAAK,UAAS;AAAA,IAClB;AAAA;AAAA;AAAA;AAAA;AAAA,IAME,iBAAiBK,GAASjC,GAAM;AAE9B,YAAMc,IAAOmB,EAAQ;AACrB,MAAIjC,MAAMc,EAAK,QAAQ,YAAYd,CAAI,KAEvC,KAAK,IAAIc,CAAI;AAAA,IACjB;AAAA,IAEE,SAAS;AAEP,aADiB,IAAIM,GAAa,MAAM,KAAK,OAAO,EACpC,MAAK;AAAA,IACzB;AAAA,IAEE,WAAW;AACT,kBAAK,cAAa,GACX;AAAA,IACX;AAAA,EACA;AAWA,WAASc,EAAOC,GAAI;AAClB,WAAKA,IACD,OAAOA,KAAO,WAAiBA,IAE5BA,EAAG,SAHM;AAAA,EAIlB;AAMA,WAASC,GAAUD,GAAI;AACrB,WAAOE,EAAO,OAAOF,GAAI,GAAG;AAAA,EAC9B;AAMA,WAASG,GAAiBH,GAAI;AAC5B,WAAOE,EAAO,OAAOF,GAAI,IAAI;AAAA,EAC/B;AAMA,WAASI,GAASJ,GAAI;AACpB,WAAOE,EAAO,OAAOF,GAAI,IAAI;AAAA,EAC/B;AAMA,WAASE,KAAUG,GAAM;AAEvB,WADeA,EAAK,IAAI,CAACtB,MAAMgB,EAAOhB,CAAC,CAAC,EAAE,KAAK,EAAE;AAAA,EAEnD;AAMA,WAASuB,GAAqBD,GAAM;AAClC,UAAMd,IAAOc,EAAKA,EAAK,SAAS,CAAC;AAEjC,WAAI,OAAOd,KAAS,YAAYA,EAAK,gBAAgB,UACnDc,EAAK,OAAOA,EAAK,SAAS,GAAG,CAAC,GACvBd,KAEA,CAAA;AAAA,EAEX;AAWA,WAASgB,KAAUF,GAAM;AAMvB,WAHe,OADFC,GAAqBD,CAAI,EAE5B,UAAU,KAAK,QACrBA,EAAK,IAAI,CAACtB,MAAMgB,EAAOhB,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;AAAA,EAE7C;AAMA,WAASyB,GAAiBR,GAAI;AAC5B,WAAQ,IAAI,OAAOA,EAAG,SAAQ,IAAK,GAAG,EAAG,KAAK,EAAE,EAAE,SAAS;AAAA,EAC7D;AAOA,WAASS,GAAWT,GAAIU,GAAQ;AAC9B,UAAMC,IAAQX,KAAMA,EAAG,KAAKU,CAAM;AAClC,WAAOC,KAASA,EAAM,UAAU;AAAA,EAClC;AASA,QAAMC,KAAa;AAanB,WAASC,EAAuBC,GAAS,EAAE,UAAAC,KAAY;AACrD,QAAIC,IAAc;AAElB,WAAOF,EAAQ,IAAI,CAACG,MAAU;AAC5B,MAAAD,KAAe;AACf,YAAME,IAASF;AACf,UAAIhB,IAAKD,EAAOkB,CAAK,GACjBE,IAAM;AAEV,aAAOnB,EAAG,SAAS,KAAG;AACpB,cAAMW,IAAQC,GAAW,KAAKZ,CAAE;AAChC,YAAI,CAACW,GAAO;AACV,UAAAQ,KAAOnB;AACP;AAAA,QACR;AACM,QAAAmB,KAAOnB,EAAG,UAAU,GAAGW,EAAM,KAAK,GAClCX,IAAKA,EAAG,UAAUW,EAAM,QAAQA,EAAM,CAAC,EAAE,MAAM,GAC3CA,EAAM,CAAC,EAAE,CAAC,MAAM,QAAQA,EAAM,CAAC,IAEjCQ,KAAO,OAAO,OAAO,OAAOR,EAAM,CAAC,CAAC,IAAIO,CAAM,KAE9CC,KAAOR,EAAM,CAAC,GACVA,EAAM,CAAC,MAAM,OACfK;AAAA,MAGV;AACI,aAAOG;AAAA,IACX,CAAG,EAAE,IAAI,CAAAnB,MAAM,IAAIA,CAAE,GAAG,EAAE,KAAKe,CAAQ;AAAA,EACvC;AAMA,QAAMK,KAAmB,QACnBC,KAAW,gBACXC,IAAsB,iBACtBC,KAAY,qBACZC,KAAc,0EACdC,KAAmB,gBACnBC,KAAiB,gJAKjBC,KAAU,CAACpC,IAAO,OAAO;AAC7B,UAAMqC,IAAe;AACrB,WAAIrC,EAAK,WACPA,EAAK,QAAQW;AAAA,MACX0B;AAAA,MACA;AAAA,MACArC,EAAK;AAAA,MACL;AAAA,IAAM,IAEHnB,EAAU;AAAA,MACf,OAAO;AAAA,MACP,OAAOwD;AAAA,MACP,KAAK;AAAA,MACL,WAAW;AAAA;AAAA,MAEX,YAAY,CAACC,GAAGC,MAAS;AACvB,QAAID,EAAE,UAAU,KAAGC,EAAK,YAAW;AAAA,MACzC;AAAA,OACKvC,CAAI;AAAA,EACT,GAGMwC,IAAmB;AAAA,IACvB,OAAO;AAAA,IAAgB,WAAW;AAAA,KAE9BC,KAAmB;AAAA,IACvB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,KAAK;AAAA,IACL,SAAS;AAAA,IACT,UAAU,CAACD,CAAgB;AAAA,KAEvBE,KAAoB;AAAA,IACxB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,KAAK;AAAA,IACL,SAAS;AAAA,IACT,UAAU,CAACF,CAAgB;AAAA,KAEvBG,KAAqB;AAAA,IACzB,OAAO;AAAA,KAUHC,IAAU,SAASC,GAAOC,GAAKC,IAAc,CAAA,GAAI;AACrD,UAAMrE,IAAOG;AAAA,MACX;AAAA,QACE,OAAO;AAAA,QACP,OAAAgE;AAAA,QACA,KAAAC;AAAA,QACA,UAAU,CAAA;AAAA;MAEZC;AAAA;AAEF,IAAArE,EAAK,SAAS,KAAK;AAAA,MACjB,OAAO;AAAA;AAAA;AAAA,MAGP,OAAO;AAAA,MACP,KAAK;AAAA,MACL,cAAc;AAAA,MACd,WAAW;AAAA,IACf,CAAG;AACD,UAAMsE,IAAehC;AAAA;AAAA,MAEnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAEA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAGF,WAAAtC,EAAK,SAAS;AAAA,MACZ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAgBE,OAAOiC;AAAA,UACL;AAAA;AAAA,UACA;AAAA,UACAqC;AAAA,UACA;AAAA,UACA;AAAA,QAAM;AAAA;AAAA,MACd;AAAA,OAEStE;AAAA,EACT,GACMuE,KAAsBL,EAAQ,MAAM,GAAG,GACvCM,KAAuBN,EAAQ,QAAQ,MAAM,GAC7CO,KAAoBP,EAAQ,KAAK,GAAG,GACpCQ,KAAc;AAAA,IAClB,OAAO;AAAA,IACP,OAAOpB;AAAA,IACP,WAAW;AAAA,KAEPqB,KAAgB;AAAA,IACpB,OAAO;AAAA,IACP,OAAOpB;AAAA,IACP,WAAW;AAAA,KAEPqB,KAAqB;AAAA,IACzB,OAAO;AAAA,IACP,OAAOpB;AAAA,IACP,WAAW;AAAA,KAEPqB,KAAc;AAAA,IAClB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,MACRf;AAAA,MACA;AAAA,QACE,OAAO;AAAA,QACP,KAAK;AAAA,QACL,WAAW;AAAA,QACX,UAAU,CAACA,CAAgB;AAAA,MACjC;AAAA,IACA;AAAA,KAEMgB,KAAa;AAAA,IACjB,OAAO;AAAA,IACP,OAAO1B;AAAA,IACP,WAAW;AAAA,KAEP2B,KAAwB;AAAA,IAC5B,OAAO;AAAA,IACP,OAAO1B;AAAA,IACP,WAAW;AAAA,KAEP2B,KAAe;AAAA;AAAA,IAEnB,OAAO,YAAY3B;AAAA,IACnB,WAAW;AAAA;AAoBb,MAAI4B,IAAqB,uBAAO,OAAO;AAAA,IACrC,WAAW;AAAA,IACX,kBAAkBlB;AAAA,IAClB,kBAAkBD;AAAA,IAClB,oBAAoBc;AAAA,IACpB,kBAAkBpB;AAAA,IAClB,SAASU;AAAA,IACT,sBAAsBM;AAAA,IACtB,qBAAqBD;AAAA,IACrB,eAAeI;AAAA,IACf,aAAapB;AAAA,IACb,mBArBwB,SAASvD,GAAM;AACvC,aAAO,OAAO;AAAA,QAAOA;AAAA,QACnB;AAAA;AAAA,UAEE,YAAY,CAAC4D,GAAGC,MAAS;AAAE,YAAAA,EAAK,KAAK,cAAcD,EAAE,CAAC;AAAA,UAAE;AAAA;AAAA,UAExD,UAAU,CAACA,GAAGC,MAAS;AAAE,YAAIA,EAAK,KAAK,gBAAgBD,EAAE,CAAC,KAAGC,EAAK,YAAW;AAAA,UAAG;AAAA,QACtF;AAAA,MAAK;AAAA,IACL;AAAA,IAcE,mBAAmBY;AAAA,IACnB,UAAUrB;AAAA,IACV,kBAAkBD;AAAA,IAClB,cAAc6B;AAAA,IACd,aAAaN;AAAA,IACb,WAAWpB;AAAA,IACX,oBAAoBW;AAAA,IACpB,mBAAmBD;AAAA,IACnB,aAAaa;AAAA,IACb,gBAAgBpB;AAAA,IAChB,SAASC;AAAA,IACT,YAAYoB;AAAA,IACZ,qBAAqBzB;AAAA,IACrB,uBAAuB0B;AAAA,EACzB,CAAC;AA+BD,WAASG,GAAsBxC,GAAOyC,GAAU;AAE9C,IADezC,EAAM,MAAMA,EAAM,QAAQ,CAAC,MAC3B,OACbyC,EAAS,YAAW;AAAA,EAExB;AAMA,WAASC,GAAepF,GAAMqF,GAAS;AAErC,IAAIrF,EAAK,cAAc,WACrBA,EAAK,QAAQA,EAAK,WAClB,OAAOA,EAAK;AAAA,EAEhB;AAMA,WAASsF,GAActF,GAAMuF,GAAQ;AACnC,IAAKA,KACAvF,EAAK,kBAOVA,EAAK,QAAQ,SAASA,EAAK,cAAc,MAAM,GAAG,EAAE,KAAK,GAAG,IAAI,uBAChEA,EAAK,gBAAgBkF,IACrBlF,EAAK,WAAWA,EAAK,YAAYA,EAAK,eACtC,OAAOA,EAAK,eAKRA,EAAK,cAAc,WAAWA,EAAK,YAAY;AAAA,EACrD;AAMA,WAASwF,GAAexF,GAAMqF,GAAS;AACrC,IAAK,MAAM,QAAQrF,EAAK,OAAO,MAE/BA,EAAK,UAAUsC,EAAO,GAAGtC,EAAK,OAAO;AAAA,EACvC;AAMA,WAASyF,GAAazF,GAAMqF,GAAS;AACnC,QAAKrF,EAAK,OACV;AAAA,UAAIA,EAAK,SAASA,EAAK,IAAK,OAAM,IAAI,MAAM,0CAA0C;AAEtF,MAAAA,EAAK,QAAQA,EAAK,OAClB,OAAOA,EAAK;AAAA;AAAA,EACd;AAMA,WAAS0F,GAAiB1F,GAAMqF,GAAS;AAEvC,IAAIrF,EAAK,cAAc,WAAWA,EAAK,YAAY;AAAA,EACrD;AAIA,QAAM2F,KAAiB,CAAC3F,GAAMuF,MAAW;AACvC,QAAI,CAACvF,EAAK,YAAa;AAGvB,QAAIA,EAAK,OAAQ,OAAM,IAAI,MAAM,wCAAwC;AAEzE,UAAM4F,IAAe,OAAO,OAAO,CAAA,GAAI5F,CAAI;AAC3C,WAAO,KAAKA,CAAI,EAAE,QAAQ,CAACO,MAAQ;AAAE,aAAOP,EAAKO,CAAG;AAAA,KAAI,GAExDP,EAAK,WAAW4F,EAAa,UAC7B5F,EAAK,QAAQiC,EAAO2D,EAAa,aAAa5D,GAAU4D,EAAa,KAAK,CAAC,GAC3E5F,EAAK,SAAS;AAAA,MACZ,WAAW;AAAA,MACX,UAAU;AAAA,QACR,OAAO,OAAO4F,GAAc,EAAE,YAAY,GAAI,CAAE;AAAA,MACtD;AAAA,OAEE5F,EAAK,YAAY,GAEjB,OAAO4F,EAAa;AAAA,EACtB,GAGMC,KAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,KAGIC,KAAwB;AAQ9B,WAASC,GAAgBC,GAAaC,GAAiBC,IAAYJ,IAAuB;AAExF,UAAMK,IAAmB,uBAAO,OAAO,IAAI;AAI3C,WAAI,OAAOH,KAAgB,WACzBI,EAAYF,GAAWF,EAAY,MAAM,GAAG,CAAC,IACpC,MAAM,QAAQA,CAAW,IAClCI,EAAYF,GAAWF,CAAW,IAElC,OAAO,KAAKA,CAAW,EAAE,QAAQ,SAASE,GAAW;AAEnD,aAAO;AAAA,QACLC;AAAA,QACAJ,GAAgBC,EAAYE,CAAS,GAAGD,GAAiBC,CAAS;AAAA;IAE1E,CAAK,GAEIC;AAYP,aAASC,EAAYF,GAAWG,GAAa;AAC3C,MAAIJ,MACFI,IAAcA,EAAY,IAAI,CAAAvF,MAAKA,EAAE,YAAW,CAAE,IAEpDuF,EAAY,QAAQ,SAASC,GAAS;AACpC,cAAMC,IAAOD,EAAQ,MAAM,GAAG;AAC9B,QAAAH,EAAiBI,EAAK,CAAC,CAAC,IAAI,CAACL,GAAWM,GAAgBD,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC,CAAC;AAAA,MAC/E,CAAK;AAAA,IACL;AAAA,EACA;AAUA,WAASC,GAAgBF,GAASG,GAAe;AAG/C,WAAIA,IACK,OAAOA,CAAa,IAGtBC,GAAcJ,CAAO,IAAI,IAAI;AAAA,EACtC;AAMA,WAASI,GAAcJ,GAAS;AAC9B,WAAOT,GAAgB,SAASS,EAAQ,YAAW,CAAE;AAAA,EACvD;AAYA,QAAMK,KAAmB,CAAA,GAKnBC,IAAQ,CAACC,MAAY;AACzB,YAAQ,MAAMA,CAAO;AAAA,EACvB,GAMMC,KAAO,CAACD,MAAYzE,MAAS;AACjC,YAAQ,IAAI,SAASyE,CAAO,IAAI,GAAGzE,CAAI;AAAA,EACzC,GAMM2E,IAAa,CAACC,GAASH,MAAY;AACvC,IAAIF,GAAiB,GAAGK,CAAO,IAAIH,CAAO,EAAE,MAE5C,QAAQ,IAAI,oBAAoBG,CAAO,KAAKH,CAAO,EAAE,GACrDF,GAAiB,GAAGK,CAAO,IAAIH,CAAO,EAAE,IAAI;AAAA,EAC9C,GAQMI,IAAkB,IAAI,MAAK;AA8BjC,WAASC,GAAgBlH,GAAMmH,GAAS,EAAE,KAAA5G,EAAG,GAAI;AAC/C,QAAI0C,IAAS;AACb,UAAMmE,IAAapH,EAAKO,CAAG,GAErB8G,IAAO,CAAA,GAEPC,IAAY,CAAA;AAElB,aAASvG,IAAI,GAAGA,KAAKoG,EAAQ,QAAQpG;AACnC,MAAAuG,EAAUvG,IAAIkC,CAAM,IAAImE,EAAWrG,CAAC,GACpCsG,EAAKtG,IAAIkC,CAAM,IAAI,IACnBA,KAAUV,GAAiB4E,EAAQpG,IAAI,CAAC,CAAC;AAI3C,IAAAf,EAAKO,CAAG,IAAI+G,GACZtH,EAAKO,CAAG,EAAE,QAAQ8G,GAClBrH,EAAKO,CAAG,EAAE,SAAS;AAAA,EACrB;AAKA,WAASgH,GAAgBvH,GAAM;AAC7B,QAAK,MAAM,QAAQA,EAAK,KAAK,GAE7B;AAAA,UAAIA,EAAK,QAAQA,EAAK,gBAAgBA,EAAK;AACzC,cAAA4G,EAAM,oEAAoE,GACpEK;AAGR,UAAI,OAAOjH,EAAK,cAAe,YAAYA,EAAK,eAAe;AAC7D,cAAA4G,EAAM,2BAA2B,GAC3BK;AAGR,MAAAC,GAAgBlH,GAAMA,EAAK,OAAO,EAAE,KAAK,cAAc,GACvDA,EAAK,QAAQ4C,EAAuB5C,EAAK,OAAO,EAAE,UAAU,IAAI;AAAA;AAAA,EAClE;AAKA,WAASwH,GAAcxH,GAAM;AAC3B,QAAK,MAAM,QAAQA,EAAK,GAAG,GAE3B;AAAA,UAAIA,EAAK,QAAQA,EAAK,cAAcA,EAAK;AACvC,cAAA4G,EAAM,8DAA8D,GAC9DK;AAGR,UAAI,OAAOjH,EAAK,YAAa,YAAYA,EAAK,aAAa;AACzD,cAAA4G,EAAM,yBAAyB,GACzBK;AAGR,MAAAC,GAAgBlH,GAAMA,EAAK,KAAK,EAAE,KAAK,YAAY,GACnDA,EAAK,MAAM4C,EAAuB5C,EAAK,KAAK,EAAE,UAAU,IAAI;AAAA;AAAA,EAC9D;AAaA,WAASyH,GAAWzH,GAAM;AACxB,IAAIA,EAAK,SAAS,OAAOA,EAAK,SAAU,YAAYA,EAAK,UAAU,SACjEA,EAAK,aAAaA,EAAK,OACvB,OAAOA,EAAK;AAAA,EAEhB;AAKA,WAAS0H,GAAW1H,GAAM;AACxB,IAAAyH,GAAWzH,CAAI,GAEX,OAAOA,EAAK,cAAe,aAC7BA,EAAK,aAAa,EAAE,OAAOA,EAAK,WAAU,IAExC,OAAOA,EAAK,YAAa,aAC3BA,EAAK,WAAW,EAAE,OAAOA,EAAK,SAAQ,IAGxCuH,GAAgBvH,CAAI,GACpBwH,GAAcxH,CAAI;AAAA,EACpB;AAoBA,WAAS2H,GAAgBC,GAAU;AAOjC,aAASC,EAAO3H,GAAO4H,GAAQ;AAC7B,aAAO,IAAI;AAAA,QACThG,EAAO5B,CAAK;AAAA,QACZ,OACG0H,EAAS,mBAAmB,MAAM,OAClCA,EAAS,eAAe,MAAM,OAC9BE,IAAS,MAAM;AAAA;IAExB;AAAA,IAeE,MAAMC,EAAW;AAAA,MACf,cAAc;AACZ,aAAK,eAAe,CAAA,GAEpB,KAAK,UAAU,CAAA,GACf,KAAK,UAAU,GACf,KAAK,WAAW;AAAA,MACtB;AAAA;AAAA,MAGI,QAAQhG,GAAIT,GAAM;AAChB,QAAAA,EAAK,WAAW,KAAK,YAErB,KAAK,aAAa,KAAK,OAAO,IAAIA,GAClC,KAAK,QAAQ,KAAK,CAACA,GAAMS,CAAE,CAAC,GAC5B,KAAK,WAAWQ,GAAiBR,CAAE,IAAI;AAAA,MAC7C;AAAA,MAEI,UAAU;AACR,QAAI,KAAK,QAAQ,WAAW,MAG1B,KAAK,OAAO,MAAM;AAEpB,cAAMiG,IAAc,KAAK,QAAQ,IAAI,CAAArG,MAAMA,EAAG,CAAC,CAAC;AAChD,aAAK,YAAYkG,EAAOjF,EAAuBoF,GAAa,EAAE,UAAU,KAAK,GAAG,EAAI,GACpF,KAAK,YAAY;AAAA,MACvB;AAAA;AAAA,MAGI,KAAKC,GAAG;AACN,aAAK,UAAU,YAAY,KAAK;AAChC,cAAMvF,IAAQ,KAAK,UAAU,KAAKuF,CAAC;AACnC,YAAI,CAACvF;AAAS,iBAAO;AAGrB,cAAM3B,IAAI2B,EAAM,UAAU,CAACf,GAAIZ,MAAMA,IAAI,KAAKY,MAAO,MAAS,GAExDuG,IAAY,KAAK,aAAanH,CAAC;AAGrC,eAAA2B,EAAM,OAAO,GAAG3B,CAAC,GAEV,OAAO,OAAO2B,GAAOwF,CAAS;AAAA,MAC3C;AAAA,IACA;AAAA,IAiCE,MAAMC,EAAoB;AAAA,MACxB,cAAc;AAEZ,aAAK,QAAQ,CAAA,GAEb,KAAK,eAAe,CAAA,GACpB,KAAK,QAAQ,GAEb,KAAK,YAAY,GACjB,KAAK,aAAa;AAAA,MACxB;AAAA;AAAA,MAGI,WAAWC,GAAO;AAChB,YAAI,KAAK,aAAaA,CAAK,EAAG,QAAO,KAAK,aAAaA,CAAK;AAE5D,cAAMC,IAAU,IAAIN,EAAU;AAC9B,oBAAK,MAAM,MAAMK,CAAK,EAAE,QAAQ,CAAC,CAACrG,GAAIT,CAAI,MAAM+G,EAAQ,QAAQtG,GAAIT,CAAI,CAAC,GACzE+G,EAAQ,QAAO,GACf,KAAK,aAAaD,CAAK,IAAIC,GACpBA;AAAA,MACb;AAAA,MAEI,6BAA6B;AAC3B,eAAO,KAAK,eAAe;AAAA,MACjC;AAAA,MAEI,cAAc;AACZ,aAAK,aAAa;AAAA,MACxB;AAAA;AAAA,MAGI,QAAQtG,GAAIT,GAAM;AAChB,aAAK,MAAM,KAAK,CAACS,GAAIT,CAAI,CAAC,GACtBA,EAAK,SAAS,WAAS,KAAK;AAAA,MACtC;AAAA;AAAA,MAGI,KAAK2G,GAAG;AACN,cAAMrE,IAAI,KAAK,WAAW,KAAK,UAAU;AACzC,QAAAA,EAAE,YAAY,KAAK;AACnB,YAAItD,IAASsD,EAAE,KAAKqE,CAAC;AAiCrB,YAAI,KAAK,gCACH,EAAA3H,KAAUA,EAAO,UAAU,KAAK,YAAkB;AACpD,gBAAMgI,IAAK,KAAK,WAAW,CAAC;AAC5B,UAAAA,EAAG,YAAY,KAAK,YAAY,GAChChI,IAASgI,EAAG,KAAKL,CAAC;AAAA,QAC5B;AAGM,eAAI3H,MACF,KAAK,cAAcA,EAAO,WAAW,GACjC,KAAK,eAAe,KAAK,SAE3B,KAAK,YAAW,IAIbA;AAAA,MACb;AAAA,IACA;AASE,aAASiI,EAAevI,GAAM;AAC5B,YAAMwI,IAAK,IAAIL,EAAmB;AAElC,aAAAnI,EAAK,SAAS,QAAQ,CAAAyI,MAAQD,EAAG,QAAQC,EAAK,OAAO,EAAE,MAAMA,GAAM,MAAM,QAAO,CAAE,CAAC,GAE/EzI,EAAK,iBACPwI,EAAG,QAAQxI,EAAK,eAAe,EAAE,MAAM,OAAO,GAE5CA,EAAK,WACPwI,EAAG,QAAQxI,EAAK,SAAS,EAAE,MAAM,WAAW,GAGvCwI;AAAA,IACX;AAyCE,aAASE,EAAY1I,GAAMuF,GAAQ;AACjC,YAAMoD;AAAA;AAAA,QAAmC3I;AAAA;AACzC,UAAIA,EAAK,WAAY,QAAO2I;AAE5B;AAAA,QACEvD;AAAA;AAAA;AAAA,QAGAK;AAAA,QACAiC;AAAA,QACA/B;AAAA,QACA,QAAQ,CAAAiD,MAAOA,EAAI5I,GAAMuF,CAAM,CAAC,GAElCqC,EAAS,mBAAmB,QAAQ,CAAAgB,MAAOA,EAAI5I,GAAMuF,CAAM,CAAC,GAG5DvF,EAAK,gBAAgB,MAErB;AAAA,QACEsF;AAAA;AAAA;AAAA,QAGAE;AAAA;AAAA,QAEAE;AAAA,QACA,QAAQ,CAAAkD,MAAOA,EAAI5I,GAAMuF,CAAM,CAAC,GAElCvF,EAAK,aAAa;AAElB,UAAI6I,IAAiB;AACrB,aAAI,OAAO7I,EAAK,YAAa,YAAYA,EAAK,SAAS,aAIrDA,EAAK,WAAW,OAAO,OAAO,CAAA,GAAIA,EAAK,QAAQ,GAC/C6I,IAAiB7I,EAAK,SAAS,UAC/B,OAAOA,EAAK,SAAS,WAEvB6I,IAAiBA,KAAkB,OAE/B7I,EAAK,aACPA,EAAK,WAAW+F,GAAgB/F,EAAK,UAAU4H,EAAS,gBAAgB,IAG1Ee,EAAM,mBAAmBd,EAAOgB,GAAgB,EAAI,GAEhDtD,MACGvF,EAAK,UAAOA,EAAK,QAAQ,UAC9B2I,EAAM,UAAUd,EAAOc,EAAM,KAAK,GAC9B,CAAC3I,EAAK,OAAO,CAACA,EAAK,mBAAgBA,EAAK,MAAM,UAC9CA,EAAK,QAAK2I,EAAM,QAAQd,EAAOc,EAAM,GAAG,IAC5CA,EAAM,gBAAgB7G,EAAO6G,EAAM,GAAG,KAAK,IACvC3I,EAAK,kBAAkBuF,EAAO,kBAChCoD,EAAM,kBAAkB3I,EAAK,MAAM,MAAM,MAAMuF,EAAO,iBAGtDvF,EAAK,YAAS2I,EAAM,YAAYd;AAAA;AAAA,QAAuC7H,EAAK;AAAA,MAAO,IAClFA,EAAK,aAAUA,EAAK,WAAW,CAAA,IAEpCA,EAAK,WAAW,CAAA,EAAG,OAAO,GAAGA,EAAK,SAAS,IAAI,SAAS8I,GAAG;AACzD,eAAOC,GAAkBD,MAAM,SAAS9I,IAAO8I,CAAC;AAAA,MACtD,CAAK,CAAC,GACF9I,EAAK,SAAS,QAAQ,SAAS8I,GAAG;AAAE,QAAAJ;AAAA;AAAA,UAA+BI;AAAA,UAAIH;AAAA,QAAK;AAAA,OAAI,GAE5E3I,EAAK,UACP0I,EAAY1I,EAAK,QAAQuF,CAAM,GAGjCoD,EAAM,UAAUJ,EAAeI,CAAK,GAC7BA;AAAA,IACX;AAKE,QAHKf,EAAS,uBAAoBA,EAAS,qBAAqB,CAAA,IAG5DA,EAAS,YAAYA,EAAS,SAAS,SAAS,MAAM;AACxD,YAAM,IAAI,MAAM,2FAA2F;AAI7G,WAAAA,EAAS,mBAAmBzH,EAAUyH,EAAS,oBAAoB,CAAA,CAAE,GAE9Dc;AAAA;AAAA,MAA+Bd;AAAA,IAAQ;AAAA,EAChD;AAaA,WAASoB,GAAmBhJ,GAAM;AAChC,WAAKA,IAEEA,EAAK,kBAAkBgJ,GAAmBhJ,EAAK,MAAM,IAF1C;AAAA,EAGpB;AAYA,WAAS+I,GAAkB/I,GAAM;AAU/B,WATIA,EAAK,YAAY,CAACA,EAAK,mBACzBA,EAAK,iBAAiBA,EAAK,SAAS,IAAI,SAASiJ,GAAS;AACxD,aAAO9I,EAAUH,GAAM,EAAE,UAAU,KAAI,GAAIiJ,CAAO;AAAA,IACxD,CAAK,IAMCjJ,EAAK,iBACAA,EAAK,iBAOVgJ,GAAmBhJ,CAAI,IAClBG,EAAUH,GAAM,EAAE,QAAQA,EAAK,SAASG,EAAUH,EAAK,MAAM,IAAI,KAAI,CAAE,IAG5E,OAAO,SAASA,CAAI,IACfG,EAAUH,CAAI,IAIhBA;AAAA,EACT;AAEA,MAAIgH,KAAU;AAAA,EAEd,MAAMkC,WAA2B,MAAM;AAAA,IACrC,YAAYC,GAAQC,GAAM;AACxB,YAAMD,CAAM,GACZ,KAAK,OAAO,sBACZ,KAAK,OAAOC;AAAA,IAChB;AAAA,EACA;AA+BA,QAAMC,IAASpJ,IACTqJ,KAAUnJ,GACVoJ,KAAW,uBAAO,SAAS,GAC3BC,KAAmB,GAMnBC,KAAO,SAASC,GAAM;AAG1B,UAAMC,IAAY,uBAAO,OAAO,IAAI,GAE9BC,IAAU,uBAAO,OAAO,IAAI,GAE5BC,IAAU,CAAA;AAIhB,QAAIC,IAAY;AAChB,UAAMC,IAAqB,uFAErBC,IAAqB,EAAE,mBAAmB,IAAM,MAAM,cAAc,UAAU,GAAE;AAKtF,QAAI9I,IAAU;AAAA,MACZ,qBAAqB;AAAA,MACrB,oBAAoB;AAAA,MACpB,eAAe;AAAA,MACf,kBAAkB;AAAA,MAClB,aAAa;AAAA,MACb,aAAa;AAAA,MACb,WAAW;AAAA;AAAA;AAAA,MAGX,WAAWU;AAAA;AASb,aAASqI,EAAmBC,GAAc;AACxC,aAAOhJ,EAAQ,cAAc,KAAKgJ,CAAY;AAAA,IAClD;AAKE,aAASC,EAAcC,GAAO;AAC5B,UAAIC,IAAUD,EAAM,YAAY;AAEhC,MAAAC,KAAWD,EAAM,aAAaA,EAAM,WAAW,YAAY;AAG3D,YAAM1H,IAAQxB,EAAQ,iBAAiB,KAAKmJ,CAAO;AACnD,UAAI3H,GAAO;AACT,cAAMkF,IAAW0C,EAAY5H,EAAM,CAAC,CAAC;AACrC,eAAKkF,MACHd,GAAKiD,EAAmB,QAAQ,MAAMrH,EAAM,CAAC,CAAC,CAAC,GAC/CoE,GAAK,qDAAqDsD,CAAK,IAE1DxC,IAAWlF,EAAM,CAAC,IAAI;AAAA,MACnC;AAEI,aAAO2H,EACJ,MAAM,KAAK,EACX,KAAK,CAACE,MAAWN,EAAmBM,CAAM,KAAKD,EAAYC,CAAM,CAAC;AAAA,IACzE;AAuBE,aAASC,EAAUC,GAAoBC,GAAeC,GAAgB;AACpE,UAAIC,IAAO,IACPV,IAAe;AACnB,MAAI,OAAOQ,KAAkB,YAC3BE,IAAOH,GACPE,IAAiBD,EAAc,gBAC/BR,IAAeQ,EAAc,aAG7B3D,EAAW,UAAU,qDAAqD,GAC1EA,EAAW,UAAU;AAAA,wDAAuG,GAC5HmD,IAAeO,GACfG,IAAOF,IAKLC,MAAmB,WAAaA,IAAiB;AAGrD,YAAME,IAAU;AAAA,QACd,MAAAD;AAAA,QACA,UAAUV;AAAA;AAIZ,MAAAY,EAAK,oBAAoBD,CAAO;AAIhC,YAAMvK,IAASuK,EAAQ,SACnBA,EAAQ,SACRE,EAAWF,EAAQ,UAAUA,EAAQ,MAAMF,CAAc;AAE7D,aAAArK,EAAO,OAAOuK,EAAQ,MAEtBC,EAAK,mBAAmBxK,CAAM,GAEvBA;AAAA,IACX;AAWE,aAASyK,EAAWb,GAAcc,GAAiBL,GAAgBM,GAAc;AAC/E,YAAMC,IAAc,uBAAO,OAAO,IAAI;AAQtC,eAASC,EAAYnL,GAAMoL,GAAW;AACpC,eAAOpL,EAAK,SAASoL,CAAS;AAAA,MACpC;AAEI,eAASC,IAAkB;AACzB,YAAI,CAACC,EAAI,UAAU;AACjB,UAAAzJ,EAAQ,QAAQ0J,CAAU;AAC1B;AAAA,QACR;AAEM,YAAIC,IAAY;AAChB,QAAAF,EAAI,iBAAiB,YAAY;AACjC,YAAI5I,IAAQ4I,EAAI,iBAAiB,KAAKC,CAAU,GAC5CE,IAAM;AAEV,eAAO/I,KAAO;AACZ,UAAA+I,KAAOF,EAAW,UAAUC,GAAW9I,EAAM,KAAK;AAClD,gBAAMgJ,IAAO9D,EAAS,mBAAmBlF,EAAM,CAAC,EAAE,YAAW,IAAKA,EAAM,CAAC,GACnEiJ,IAAOR,EAAYG,GAAKI,CAAI;AAClC,cAAIC,GAAM;AACR,kBAAM,CAACC,GAAMC,EAAgB,IAAIF;AAMjC,gBALA9J,EAAQ,QAAQ4J,CAAG,GACnBA,IAAM,IAENP,EAAYQ,CAAI,KAAKR,EAAYQ,CAAI,KAAK,KAAK,GAC3CR,EAAYQ,CAAI,KAAKlC,OAAkBsC,KAAaD,KACpDD,EAAK,WAAW,GAAG;AAGrB,cAAAH,KAAO/I,EAAM,CAAC;AAAA,iBACT;AACL,oBAAMqJ,KAAWnE,EAAS,iBAAiBgE,CAAI,KAAKA;AACpD,cAAAI,EAAYtJ,EAAM,CAAC,GAAGqJ,EAAQ;AAAA,YAC1C;AAAA,UACA;AACU,YAAAN,KAAO/I,EAAM,CAAC;AAEhB,UAAA8I,IAAYF,EAAI,iBAAiB,WACjC5I,IAAQ4I,EAAI,iBAAiB,KAAKC,CAAU;AAAA,QACpD;AACM,QAAAE,KAAOF,EAAW,UAAUC,CAAS,GACrC3J,EAAQ,QAAQ4J,CAAG;AAAA,MACzB;AAEI,eAASQ,IAAqB;AAC5B,YAAIV,MAAe,GAAI;AAEvB,YAAIjL,IAAS;AAEb,YAAI,OAAOgL,EAAI,eAAgB,UAAU;AACvC,cAAI,CAAC3B,EAAU2B,EAAI,WAAW,GAAG;AAC/B,YAAAzJ,EAAQ,QAAQ0J,CAAU;AAC1B;AAAA,UACV;AACQ,UAAAjL,IAASyK,EAAWO,EAAI,aAAaC,GAAY,IAAMW,GAAcZ,EAAI,WAAW,CAAC,GACrFY,GAAcZ,EAAI,WAAW;AAAA,UAAiChL,EAAO;AAAA,QAC7E;AACQ,UAAAA,IAAS6L,GAAcZ,GAAYD,EAAI,YAAY,SAASA,EAAI,cAAc,IAAI;AAOpF,QAAIA,EAAI,YAAY,MAClBQ,KAAaxL,EAAO,YAEtBuB,EAAQ,iBAAiBvB,EAAO,UAAUA,EAAO,QAAQ;AAAA,MAC/D;AAEI,eAAS8L,IAAgB;AACvB,QAAId,EAAI,eAAe,OACrBW,EAAkB,IAElBZ,EAAe,GAEjBE,IAAa;AAAA,MACnB;AAMI,eAASS,EAAY1F,GAAS9E,GAAO;AACnC,QAAI8E,MAAY,OAEhBzE,EAAQ,WAAWL,CAAK,GACxBK,EAAQ,QAAQyE,CAAO,GACvBzE,EAAQ,SAAQ;AAAA,MACtB;AAMI,eAASwK,GAAe7K,GAAOkB,GAAO;AACpC,YAAI3B,IAAI;AACR,cAAMuL,IAAM5J,EAAM,SAAS;AAC3B,eAAO3B,KAAKuL,KAAK;AACf,cAAI,CAAC9K,EAAM,MAAMT,CAAC,GAAG;AAAE,YAAAA;AAAK;AAAA,UAAS;AACrC,gBAAMwL,IAAQ3E,EAAS,iBAAiBpG,EAAMT,CAAC,CAAC,KAAKS,EAAMT,CAAC,GACtDI,IAAOuB,EAAM3B,CAAC;AACpB,UAAIwL,IACFP,EAAY7K,GAAMoL,CAAK,KAEvBhB,IAAapK,GACbkK,EAAe,GACfE,IAAa,KAEfxK;AAAA,QACR;AAAA,MACA;AAMI,eAASyL,GAAaxM,GAAM0C,GAAO;AACjC,eAAI1C,EAAK,SAAS,OAAOA,EAAK,SAAU,YACtC6B,EAAQ,SAAS+F,EAAS,iBAAiB5H,EAAK,KAAK,KAAKA,EAAK,KAAK,GAElEA,EAAK,eAEHA,EAAK,WAAW,SAClBgM,EAAYT,GAAY3D,EAAS,iBAAiB5H,EAAK,WAAW,KAAK,KAAKA,EAAK,WAAW,KAAK,GACjGuL,IAAa,MACJvL,EAAK,WAAW,WAEzBqM,GAAerM,EAAK,YAAY0C,CAAK,GACrC6I,IAAa,MAIjBD,IAAM,OAAO,OAAOtL,GAAM,EAAE,QAAQ,EAAE,OAAOsL,EAAG,GAAI,GAC7CA;AAAA,MACb;AAQI,eAASmB,GAAUzM,GAAM0C,GAAOgK,GAAoB;AAClD,YAAIC,IAAUnK,GAAWxC,EAAK,OAAO0M,CAAkB;AAEvD,YAAIC,GAAS;AACX,cAAI3M,EAAK,QAAQ,GAAG;AAClB,kBAAM6D,IAAO,IAAI9D,GAASC,CAAI;AAC9B,YAAAA,EAAK,QAAQ,EAAE0C,GAAOmB,CAAI,GACtBA,EAAK,mBAAgB8I,IAAU;AAAA,UAC7C;AAEQ,cAAIA,GAAS;AACX,mBAAO3M,EAAK,cAAcA,EAAK;AAC7B,cAAAA,IAAOA,EAAK;AAEd,mBAAOA;AAAA,UACjB;AAAA,QACA;AAGM,YAAIA,EAAK;AACP,iBAAOyM,GAAUzM,EAAK,QAAQ0C,GAAOgK,CAAkB;AAAA,MAE/D;AAOI,eAASE,GAASnK,GAAQ;AACxB,eAAI6I,EAAI,QAAQ,eAAe,KAG7BC,KAAc9I,EAAO,CAAC,GACf,MAIPoK,KAA2B,IACpB;AAAA,MAEf;AAQI,eAASC,GAAapK,GAAO;AAC3B,cAAMD,IAASC,EAAM,CAAC,GAChBqK,IAAUrK,EAAM,MAEhBmB,IAAO,IAAI9D,GAASgN,CAAO,GAE3BC,IAAkB,CAACD,EAAQ,eAAeA,EAAQ,UAAU,CAAC;AACnE,mBAAWE,KAAMD;AACf,cAAKC,MACLA,EAAGvK,GAAOmB,CAAI,GACVA,EAAK;AAAgB,mBAAO+I,GAASnK,CAAM;AAGjD,eAAIsK,EAAQ,OACVxB,KAAc9I,KAEVsK,EAAQ,iBACVxB,KAAc9I,IAEhB2J,EAAa,GACT,CAACW,EAAQ,eAAe,CAACA,EAAQ,iBACnCxB,IAAa9I,KAGjB+J,GAAaO,GAASrK,CAAK,GACpBqK,EAAQ,cAAc,IAAItK,EAAO;AAAA,MAC9C;AAOI,eAASyK,GAAWxK,GAAO;AACzB,cAAMD,IAASC,EAAM,CAAC,GAChBgK,IAAqB1B,EAAgB,UAAUtI,EAAM,KAAK,GAE1DyK,IAAUV,GAAUnB,GAAK5I,GAAOgK,CAAkB;AACxD,YAAI,CAACS;AAAW,iBAAO5D;AAEvB,cAAM6D,IAAS9B;AACf,QAAIA,EAAI,YAAYA,EAAI,SAAS,SAC/Bc,EAAa,GACbJ,EAAYvJ,GAAQ6I,EAAI,SAAS,KAAK,KAC7BA,EAAI,YAAYA,EAAI,SAAS,UACtCc,EAAa,GACbC,GAAef,EAAI,UAAU5I,CAAK,KACzB0K,EAAO,OAChB7B,KAAc9I,KAER2K,EAAO,aAAaA,EAAO,eAC/B7B,KAAc9I,IAEhB2J,EAAa,GACTgB,EAAO,eACT7B,IAAa9I;AAGjB;AACE,UAAI6I,EAAI,SACNzJ,EAAQ,UAAS,GAEf,CAACyJ,EAAI,QAAQ,CAACA,EAAI,gBACpBQ,KAAaR,EAAI,YAEnBA,IAAMA,EAAI;AAAA,eACHA,MAAQ6B,EAAQ;AACzB,eAAIA,EAAQ,UACVX,GAAaW,EAAQ,QAAQzK,CAAK,GAE7B0K,EAAO,YAAY,IAAI3K,EAAO;AAAA,MAC3C;AAEI,eAAS4K,KAAuB;AAC9B,cAAMC,IAAO,CAAA;AACb,iBAASC,IAAUjC,GAAKiC,MAAY3F,GAAU2F,IAAUA,EAAQ;AAC9D,UAAIA,EAAQ,SACVD,EAAK,QAAQC,EAAQ,KAAK;AAG9B,QAAAD,EAAK,QAAQ,CAAAE,MAAQ3L,EAAQ,SAAS2L,CAAI,CAAC;AAAA,MACjD;AAGI,UAAIC,IAAY,CAAA;AAQhB,eAASC,GAAcC,GAAiBjL,GAAO;AAC7C,cAAMD,IAASC,KAASA,EAAM,CAAC;AAK/B,YAFA6I,KAAcoC,GAEVlL,KAAU;AACZ,iBAAA2J,EAAa,GACN;AAOT,YAAIqB,EAAU,SAAS,WAAW/K,EAAM,SAAS,SAAS+K,EAAU,UAAU/K,EAAM,SAASD,MAAW,IAAI;AAG1G,cADA8I,KAAcP,EAAgB,MAAMtI,EAAM,OAAOA,EAAM,QAAQ,CAAC,GAC5D,CAACoH,GAAW;AAEd,kBAAM8D,IAAM,IAAI,MAAM,wBAAwB1D,CAAY,GAAG;AAC7D,kBAAA0D,EAAI,eAAe1D,GACnB0D,EAAI,UAAUH,EAAU,MAClBG;AAAA,UAChB;AACQ,iBAAO;AAAA,QACf;AAGM,YAFAH,IAAY/K,GAERA,EAAM,SAAS;AACjB,iBAAOoK,GAAapK,CAAK;AACpB,YAAIA,EAAM,SAAS,aAAa,CAACiI,GAAgB;AAGtD,gBAAMiD,IAAM,IAAI,MAAM,qBAAqBnL,IAAS,kBAAkB6I,EAAI,SAAS,eAAe,GAAG;AACrG,gBAAAsC,EAAI,OAAOtC,GACLsC;AAAA,QACd,WAAiBlL,EAAM,SAAS,OAAO;AAC/B,gBAAMmL,IAAYX,GAAWxK,CAAK;AAClC,cAAImL,MAActE;AAChB,mBAAOsE;AAAA,QAEjB;AAKM,YAAInL,EAAM,SAAS,aAAaD,MAAW;AAEzC,iBAAA8I,KAAc;AAAA,GACP;AAOT,YAAIuC,KAAa,OAAUA,KAAapL,EAAM,QAAQ;AAEpD,gBADY,IAAI,MAAM,2DAA2D;AAYnF,eAAA6I,KAAc9I,GACPA,EAAO;AAAA,MACpB;AAEI,YAAMmF,IAAW0C,EAAYJ,CAAY;AACzC,UAAI,CAACtC;AACH,cAAAhB,EAAMmD,EAAmB,QAAQ,MAAMG,CAAY,CAAC,GAC9C,IAAI,MAAM,wBAAwBA,IAAe,GAAG;AAG5D,YAAM6D,KAAKpG,GAAgBC,CAAQ;AACnC,UAAItH,KAAS,IAETgL,IAAML,KAAgB8C;AAE1B,YAAM7B,KAAgB,CAAA,GAChBrK,IAAU,IAAIX,EAAQ,UAAUA,CAAO;AAC7C,MAAAmM,GAAoB;AACpB,UAAI9B,IAAa,IACbO,IAAY,GACZ1D,IAAQ,GACR0F,KAAa,GACbjB,KAA2B;AAE/B,UAAI;AACF,YAAKjF,EAAS;AAyBZ,UAAAA,EAAS,aAAaoD,GAAiBnJ,CAAO;AAAA,aAzBpB;AAG1B,eAFAyJ,EAAI,QAAQ,YAAW,OAEd;AACP,YAAAwC,MACIjB,KAGFA,KAA2B,KAE3BvB,EAAI,QAAQ,YAAW,GAEzBA,EAAI,QAAQ,YAAYlD;AAExB,kBAAM1F,IAAQ4I,EAAI,QAAQ,KAAKN,CAAe;AAG9C,gBAAI,CAACtI,EAAO;AAEZ,kBAAMsL,IAAchD,EAAgB,UAAU5C,GAAO1F,EAAM,KAAK,GAC1DuL,IAAiBP,GAAcM,GAAatL,CAAK;AACvD,YAAA0F,IAAQ1F,EAAM,QAAQuL;AAAA,UAChC;AACQ,UAAAP,GAAc1C,EAAgB,UAAU5C,CAAK,CAAC;AAAA,QACtD;AAIM,eAAAvG,EAAQ,SAAQ,GAChBvB,KAASuB,EAAQ,OAAM,GAEhB;AAAA,UACL,UAAUqI;AAAA,UACV,OAAO5J;AAAA,UACP,WAAAwL;AAAA,UACA,SAAS;AAAA,UACT,UAAUjK;AAAA,UACV,MAAMyJ;AAAA;MAEd,SAAasC,GAAK;AACZ,YAAIA,EAAI,WAAWA,EAAI,QAAQ,SAAS,SAAS;AAC/C,iBAAO;AAAA,YACL,UAAU1D;AAAA,YACV,OAAOb,EAAO2B,CAAe;AAAA,YAC7B,SAAS;AAAA,YACT,WAAW;AAAA,YACX,YAAY;AAAA,cACV,SAAS4C,EAAI;AAAA,cACb,OAAAxF;AAAA,cACA,SAAS4C,EAAgB,MAAM5C,IAAQ,KAAKA,IAAQ,GAAG;AAAA,cACvD,MAAMwF,EAAI;AAAA,cACV,aAAatN;AAAA;YAEf,UAAUuB;AAAA;AAEP,YAAIiI;AACT,iBAAO;AAAA,YACL,UAAUI;AAAA,YACV,OAAOb,EAAO2B,CAAe;AAAA,YAC7B,SAAS;AAAA,YACT,WAAW;AAAA,YACX,aAAa4C;AAAA,YACb,UAAU/L;AAAA,YACV,MAAMyJ;AAAA;AAGR,cAAMsC;AAAA,MAEd;AAAA,IACA;AASE,aAASM,EAAwBtD,GAAM;AACrC,YAAMtK,IAAS;AAAA,QACb,OAAO+I,EAAOuB,CAAI;AAAA,QAClB,SAAS;AAAA,QACT,WAAW;AAAA,QACX,MAAMZ;AAAA,QACN,UAAU,IAAI9I,EAAQ,UAAUA,CAAO;AAAA;AAEzC,aAAAZ,EAAO,SAAS,QAAQsK,CAAI,GACrBtK;AAAA,IACX;AAgBE,aAAS6L,GAAcvB,GAAMuD,GAAgB;AAC3C,MAAAA,IAAiBA,KAAkBjN,EAAQ,aAAa,OAAO,KAAKyI,CAAS;AAC7E,YAAMyE,IAAYF,EAAwBtD,CAAI,GAExCyD,IAAUF,EAAe,OAAO7D,CAAW,EAAE,OAAOgE,EAAa,EAAE;AAAA,QAAI,CAAA1O,MAC3EmL,EAAWnL,GAAMgL,GAAM,EAAK;AAAA;AAE9B,MAAAyD,EAAQ,QAAQD,CAAS;AAEzB,YAAMG,IAASF,EAAQ,KAAK,CAACG,GAAGC,MAAM;AAEpC,YAAID,EAAE,cAAcC,EAAE,UAAW,QAAOA,EAAE,YAAYD,EAAE;AAIxD,YAAIA,EAAE,YAAYC,EAAE,UAAU;AAC5B,cAAInE,EAAYkE,EAAE,QAAQ,EAAE,eAAeC,EAAE;AAC3C,mBAAO;AACF,cAAInE,EAAYmE,EAAE,QAAQ,EAAE,eAAeD,EAAE;AAClD,mBAAO;AAAA,QAEjB;AAMM,eAAO;AAAA,MACb,CAAK,GAEK,CAACE,GAAMC,CAAU,IAAIJ,GAGrBjO,IAASoO;AACf,aAAApO,EAAO,aAAaqO,GAEbrO;AAAA,IACX;AASE,aAASsO,GAAgBC,GAASC,GAAaC,GAAY;AACzD,YAAMnH,IAAYkH,KAAelF,EAAQkF,CAAW,KAAMC;AAE1D,MAAAF,EAAQ,UAAU,IAAI,MAAM,GAC5BA,EAAQ,UAAU,IAAI,YAAYjH,CAAQ,EAAE;AAAA,IAChD;AAOE,aAASoH,GAAiBH,GAAS;AAEjC,UAAInO,IAAO;AACX,YAAMkH,IAAWuC,EAAc0E,CAAO;AAEtC,UAAI5E,EAAmBrC,CAAQ,EAAG;AAKlC,UAHAkD;AAAA,QAAK;AAAA,QACH,EAAE,IAAI+D,GAAS,UAAAjH;MAAU,GAEvBiH,EAAQ,QAAQ,aAAa;AAC/B,gBAAQ,IAAI,0FAA0FA,CAAO;AAC7G;AAAA,MACN;AAOI,UAAIA,EAAQ,SAAS,SAAS,MACvB3N,EAAQ,wBACX,QAAQ,KAAK,+FAA+F,GAC5G,QAAQ,KAAK,2DAA2D,GACxE,QAAQ,KAAK,kCAAkC,GAC/C,QAAQ,KAAK2N,CAAO,IAElB3N,EAAQ;AAKV,cAJY,IAAIgI;AAAA,UACd;AAAA,UACA2F,EAAQ;AAAA;AAMd,MAAAnO,IAAOmO;AACP,YAAM1N,IAAOT,EAAK,aACZJ,IAASsH,IAAW4C,EAAUrJ,GAAM,EAAE,UAAAyG,GAAU,gBAAgB,GAAI,CAAE,IAAIuE,GAAchL,CAAI;AAElG,MAAA0N,EAAQ,YAAYvO,EAAO,OAC3BuO,EAAQ,QAAQ,cAAc,OAC9BD,GAAgBC,GAASjH,GAAUtH,EAAO,QAAQ,GAClDuO,EAAQ,SAAS;AAAA,QACf,UAAUvO,EAAO;AAAA;AAAA,QAEjB,IAAIA,EAAO;AAAA,QACX,WAAWA,EAAO;AAAA,SAEhBA,EAAO,eACTuO,EAAQ,aAAa;AAAA,QACnB,UAAUvO,EAAO,WAAW;AAAA,QAC5B,WAAWA,EAAO,WAAW;AAAA,UAIjCwK,EAAK,0BAA0B,EAAE,IAAI+D,GAAS,QAAAvO,GAAQ,MAAAa,GAAM;AAAA,IAChE;AAOE,aAAS8N,GAAUC,GAAa;AAC9B,MAAAhO,IAAUoI,GAAQpI,GAASgO,CAAW;AAAA,IAC1C;AAGE,UAAMC,KAAmB,MAAM;AAC7B,MAAAC,EAAY,GACZrI,EAAW,UAAU,yDAAyD;AAAA,IAClF;AAGE,aAASsI,KAAyB;AAChC,MAAAD,EAAY,GACZrI,EAAW,UAAU,+DAA+D;AAAA,IACxF;AAEE,QAAIuI,KAAiB;AAKrB,aAASF,IAAe;AACtB,eAASG,IAAO;AAEd,QAAAH,EAAY;AAAA,MAClB;AAGI,UAAI,SAAS,eAAe,WAAW;AAErC,QAAKE,MACH,OAAO,iBAAiB,oBAAoBC,GAAM,EAAK,GAEzDD,KAAiB;AACjB;AAAA,MACN;AAGI,MADe,SAAS,iBAAiBpO,EAAQ,WAAW,EACrD,QAAQ8N,EAAgB;AAAA,IACnC;AAQE,aAASQ,GAAiBtF,GAAcuF,GAAoB;AAC1D,UAAIC,IAAO;AACX,UAAI;AACF,QAAAA,IAAOD,EAAmB/F,CAAI;AAAA,MACpC,SAAaiG,GAAS;AAGhB,YAFA/I,EAAM,wDAAwD,QAAQ,MAAMsD,CAAY,CAAC,GAEpFJ;AAAqC,UAAAlD,EAAM+I,CAAO;AAAA;AAArC,gBAAMA;AAKxB,QAAAD,IAAO1F;AAAA,MACb;AAEI,MAAK0F,EAAK,SAAMA,EAAK,OAAOxF,IAC5BP,EAAUO,CAAY,IAAIwF,GAC1BA,EAAK,gBAAgBD,EAAmB,KAAK,MAAM/F,CAAI,GAEnDgG,EAAK,WACPE,GAAgBF,EAAK,SAAS,EAAE,cAAAxF,EAAY,CAAE;AAAA,IAEpD;AAOE,aAAS2F,GAAmB3F,GAAc;AACxC,aAAOP,EAAUO,CAAY;AAC7B,iBAAW4F,KAAS,OAAO,KAAKlG,CAAO;AACrC,QAAIA,EAAQkG,CAAK,MAAM5F,KACrB,OAAON,EAAQkG,CAAK;AAAA,IAG5B;AAKE,aAASC,KAAgB;AACvB,aAAO,OAAO,KAAKpG,CAAS;AAAA,IAChC;AAME,aAASW,EAAY1K,GAAM;AACzB,aAAAA,KAAQA,KAAQ,IAAI,YAAW,GACxB+J,EAAU/J,CAAI,KAAK+J,EAAUC,EAAQhK,CAAI,CAAC;AAAA,IACrD;AAOE,aAASgQ,GAAgBI,GAAW,EAAE,cAAA9F,KAAgB;AACpD,MAAI,OAAO8F,KAAc,aACvBA,IAAY,CAACA,CAAS,IAExBA,EAAU,QAAQ,CAAAF,MAAS;AAAE,QAAAlG,EAAQkG,EAAM,aAAa,IAAI5F;AAAA,OAAe;AAAA,IAC/E;AAME,aAASoE,GAAc1O,GAAM;AAC3B,YAAM8P,IAAOpF,EAAY1K,CAAI;AAC7B,aAAO8P,KAAQ,CAACA,EAAK;AAAA,IACzB;AAOE,aAASO,GAAiBC,GAAQ;AAEhC,MAAIA,EAAO,uBAAuB,KAAK,CAACA,EAAO,yBAAyB,MACtEA,EAAO,yBAAyB,IAAI,CAACvE,MAAS;AAC5C,QAAAuE,EAAO,uBAAuB;AAAA,UAC5B,OAAO,OAAO,EAAE,OAAOvE,EAAK,GAAE,GAAIA,CAAI;AAAA;MAEhD,IAEQuE,EAAO,sBAAsB,KAAK,CAACA,EAAO,wBAAwB,MACpEA,EAAO,wBAAwB,IAAI,CAACvE,MAAS;AAC3C,QAAAuE,EAAO,sBAAsB;AAAA,UAC3B,OAAO,OAAO,EAAE,OAAOvE,EAAK,GAAE,GAAIA,CAAI;AAAA;MAEhD;AAAA,IAEA;AAKE,aAASwE,GAAUD,GAAQ;AACzB,MAAAD,GAAiBC,CAAM,GACvBrG,EAAQ,KAAKqG,CAAM;AAAA,IACvB;AAKE,aAASE,GAAaF,GAAQ;AAC5B,YAAM9H,IAAQyB,EAAQ,QAAQqG,CAAM;AACpC,MAAI9H,MAAU,MACZyB,EAAQ,OAAOzB,GAAO,CAAC;AAAA,IAE7B;AAOE,aAAS0C,EAAKuF,GAAOjO,GAAM;AACzB,YAAM6K,IAAKoD;AACX,MAAAxG,EAAQ,QAAQ,SAASqG,GAAQ;AAC/B,QAAIA,EAAOjD,CAAE,KACXiD,EAAOjD,CAAE,EAAE7K,CAAI;AAAA,MAEvB,CAAK;AAAA,IACL;AAME,aAASkO,GAAwB3O,GAAI;AACnC,aAAAoF,EAAW,UAAU,kDAAkD,GACvEA,EAAW,UAAU,kCAAkC,GAEhDiI,GAAiBrN,CAAE;AAAA,IAC9B;AAGE,WAAO,OAAO+H,GAAM;AAAA,MAClB,WAAAc;AAAA,MACA,eAAA2B;AAAA,MACA,cAAAiD;AAAA,MACA,kBAAAJ;AAAA;AAAA,MAEA,gBAAgBsB;AAAA,MAChB,WAAArB;AAAA,MACA,kBAAAE;AAAA,MACA,wBAAAE;AAAA,MACA,kBAAAG;AAAA,MACA,oBAAAK;AAAA,MACA,eAAAE;AAAA,MACA,aAAAzF;AAAA,MACA,iBAAAsF;AAAA,MACA,eAAAtB;AAAA,MACA,SAAAhF;AAAA,MACA,WAAA6G;AAAA,MACA,cAAAC;AAAA,IACJ,CAAG,GAED1G,EAAK,YAAY,WAAW;AAAE,MAAAI,IAAY;AAAA,IAAM,GAChDJ,EAAK,WAAW,WAAW;AAAE,MAAAI,IAAY;AAAA,IAAK,GAC9CJ,EAAK,gBAAgB1C,IAErB0C,EAAK,QAAQ;AAAA,MACX,QAAQzH;AAAA,MACR,WAAWD;AAAA,MACX,QAAQM;AAAA,MACR,UAAUH;AAAA,MACV,kBAAkBD;AAAA;AAGpB,eAAW3B,KAAO0E;AAEhB,MAAI,OAAOA,EAAM1E,CAAG,KAAM,YAExBb,GAAWuF,EAAM1E,CAAG,CAAC;AAKzB,kBAAO,OAAOmJ,GAAMzE,CAAK,GAElByE;AAAA,EACT,GAGMc,IAAYf,GAAK,EAAE;AAIzB,SAAAe,EAAU,cAAc,MAAMf,GAAK,EAAE,GAErC8G,KAAiB/F,GACjBA,EAAU,cAAcA,GACxBA,EAAU,UAAUA;;;;","x_google_ignoreList":[0]}

package/dist/client/chunks/flow-utils-CjQZG5qq.js

@@ -1,16 +0,0 @@
-function o(e) {
-  if (!e || typeof e != "object") return !1;
-  const n = e;
-  return Array.isArray(n.nodes) && Array.isArray(n.links) && (n.nodes.length === 0 || typeof n.nodes[0] == "object" && n.nodes[0] !== null && "id" in n.nodes[0]);
-}
-function r(e) {
-  return typeof e == "object" && e !== null && "flow" in e && typeof e.flow == "object";
-}
-const s = 0, t = 5;
-export {
-  s as F,
-  r as a,
-  t as b,
-  o as i
-};
-//# sourceMappingURL=flow-utils-CjQZG5qq.js.map

package/dist/client/chunks/flow-utils-CjQZG5qq.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"flow-utils-CjQZG5qq.js","sources":["../../../src/client/types/flow.ts"],"sourcesContent":["/**\n * Flow Analysis Types\n *\n * Types for Flow analysis mode which visualizes user journeys using Sankey diagrams.\n * Flow analysis explores paths BEFORE and AFTER a defined starting step (bidirectional),\n * unlike funnel which only tracks linear forward progression.\n */\n\nimport type { Filter } from '../types'\nimport type { FunnelBindingKey } from './funnel'\n\n// ============================================================================\n// Starting Step Definition\n// ============================================================================\n\n/**\n * Starting step definition for flow analysis\n * The starting step is the anchor point from which we explore paths\n * in both directions (before and after)\n */\nexport interface FlowStartingStep {\n  /** Display name for the starting step */\n  name: string\n  /** Filters that define which events qualify as the starting step */\n  filters: Filter[]\n}\n\n// ============================================================================\n// Server Query Format\n// ============================================================================\n\n/**\n * Server flow query format\n * This is the shape sent to the server for execution\n * Wrapped in { flow: {...} } similar to funnel queries\n */\nexport interface ServerFlowQuery {\n  flow: FlowQueryConfig\n}\n\n/**\n * Flow query configuration\n * Contains all parameters needed for server-side flow analysis\n */\nexport interface FlowQueryConfig {\n  /**\n   * Binding key that identifies individual entities (e.g., userId)\n   * Can be a single string like 'Events.userId' or array for multi-cube\n   */\n  bindingKey: string | { cube: string; dimension: string }[]\n\n  /**\n   * Time dimension used for ordering events\n   * Can be a single string like 'Events.timestamp' or array for multi-cube\n   */\n  timeDimension: string | { cube: string; dimension: string }[]\n\n  /**\n   * The starting step from which we explore paths\n   * Defines the anchor point for bidirectional flow analysis\n   */\n  startingStep: {\n    /** Display name for the starting step */\n    name: string\n    /** Filter(s) that identify events for this starting step */\n    filter?: Filter | Filter[]\n  }\n\n  /** Number of steps to explore BEFORE the starting step (0-5) */\n  stepsBefore: number\n\n  /** Number of steps to explore AFTER the starting step (0-5) */\n  stepsAfter: number\n\n  /**\n   * Event dimension that categorizes events (e.g., 'Events.eventType')\n   * This dimension's values become the node labels in the Sankey diagram\n   */\n  eventDimension: string\n\n  /**\n   * Optional limit on the number of entities to process\n   * Useful for performance on large datasets\n   */\n  entityLimit?: number\n\n  /**\n   * Output mode for flow data aggregation\n   * - 'sankey': Aggregate by (layer, event_type) - standard flow visualization where paths can converge\n   * - 'sunburst': Path-qualified nodes for hierarchical tree visualization where each path is unique\n   * @default 'sankey'\n   */\n  outputMode?: 'sankey' | 'sunburst'\n\n  /**\n   * Join strategy for fetching steps\n   * - 'auto' (default): use lateral when supported, otherwise window\n   * - 'lateral': force lateral joins\n   * - 'window': force window function strategy\n   */\n  joinStrategy: 'auto' | 'lateral' | 'window'\n}\n\n// ============================================================================\n// Sankey Result Types\n// ============================================================================\n\n/**\n * A node in the Sankey diagram\n * Represents an event type at a specific layer (distance from starting step)\n */\nexport interface SankeyNode {\n  /**\n   * Unique identifier for this node\n   * Format: \"before_{depth}_{eventType}\" or \"after_{depth}_{eventType}\" or \"start_{eventType}\"\n   * Examples: \"before_2_Signup\", \"start_Purchase\", \"after_1_Checkout\"\n   */\n  id: string\n\n  /** Display name (typically the event type value) */\n  name: string\n\n  /**\n   * Layer position in the Sankey diagram\n   * Negative for steps before starting step, 0 for starting step, positive for after\n   * Example: -2, -1, 0, 1, 2 for a flow with 2 steps before and 2 after\n   */\n  layer: number\n\n  /** Total count of entities passing through this node */\n  value?: number\n}\n\n/**\n * A link (edge) in the Sankey diagram\n * Represents a transition between two nodes\n */\nexport interface SankeyLink {\n  /** Source node ID */\n  source: string\n\n  /** Target node ID */\n  target: string\n\n  /** Count of entities that follow this path */\n  value: number\n}\n\n/**\n * Complete flow result row returned from server\n * Contains the full Sankey diagram data\n */\nexport interface FlowResultRow {\n  nodes: SankeyNode[]\n  links: SankeyLink[]\n}\n\n/**\n * Chart-ready flow data format\n * Same structure as FlowResultRow, used for chart components\n */\nexport interface FlowChartData {\n  nodes: SankeyNode[]\n  links: SankeyLink[]\n}\n\n// ============================================================================\n// Flow Slice State (for Zustand store)\n// ============================================================================\n\n/**\n * Flow mode state for the AnalysisBuilder store\n * Contains all UI state needed to configure a flow analysis\n */\nexport interface FlowSliceState {\n  /** Selected cube for flow analysis (must be an eventStream cube) */\n  flowCube: string | null\n\n  /** Binding key that identifies entities (reuses funnel binding key type) */\n  flowBindingKey: FunnelBindingKey | null\n\n  /** Time dimension for ordering events */\n  flowTimeDimension: string | null\n\n  /** Starting step configuration */\n  startingStep: FlowStartingStep\n\n  /** Number of steps to explore before starting step (0-5, default 3) */\n  stepsBefore: number\n\n  /** Number of steps to explore after starting step (0-5, default 3) */\n  stepsAfter: number\n\n  /** Event dimension that categorizes events */\n  eventDimension: string | null\n\n  /** Join strategy for flow execution */\n  joinStrategy: 'auto' | 'lateral' | 'window'\n}\n\n/**\n * Flow slice actions for the store\n */\nexport interface FlowSliceActions {\n  setFlowCube: (cube: string | null) => void\n  setFlowBindingKey: (key: FunnelBindingKey | null) => void\n  setFlowTimeDimension: (dim: string | null) => void\n  setEventDimension: (dim: string | null) => void\n  setStartingStepName: (name: string) => void\n  setStartingStepFilters: (filters: Filter[]) => void\n  addStartingStepFilter: (filter: Filter) => void\n  removeStartingStepFilter: (index: number) => void\n  updateStartingStepFilter: (index: number, filter: Filter) => void\n  setStepsBefore: (count: number) => void\n  setStepsAfter: (count: number) => void\n  setJoinStrategy: (strategy: 'auto' | 'lateral' | 'window') => void\n  isFlowMode: () => boolean\n  isFlowModeEnabled: () => boolean\n  buildFlowQuery: () => ServerFlowQuery | null\n}\n\n// ============================================================================\n// Type Guards\n// ============================================================================\n\n/**\n * Type guard to check if data is Sankey/Flow chart data\n */\nexport function isSankeyData(data: unknown): data is FlowChartData {\n  if (!data || typeof data !== 'object') return false\n  const d = data as Record<string, unknown>\n  return (\n    Array.isArray(d.nodes) &&\n    Array.isArray(d.links) &&\n    (d.nodes.length === 0 ||\n      (typeof d.nodes[0] === 'object' &&\n        d.nodes[0] !== null &&\n        'id' in d.nodes[0]))\n  )\n}\n\n/**\n * Type guard to detect server flow query format\n * Used to distinguish { flow: {...} } from CubeQuery, MultiQueryConfig, or ServerFunnelQuery\n */\nexport function isServerFlowQuery(obj: unknown): obj is ServerFlowQuery {\n  return (\n    typeof obj === 'object' &&\n    obj !== null &&\n    'flow' in obj &&\n    typeof (obj as { flow: unknown }).flow === 'object'\n  )\n}\n\n// ============================================================================\n// Default Values\n// ============================================================================\n\n/**\n * Default flow slice state for store initialization\n */\nexport const defaultFlowSliceState: FlowSliceState = {\n  flowCube: null,\n  flowBindingKey: null,\n  flowTimeDimension: null,\n  startingStep: {\n    name: '',\n    filters: [],\n  },\n  stepsBefore: 3,\n  stepsAfter: 3,\n  eventDimension: null,\n  joinStrategy: 'auto',\n}\n\n/**\n * Minimum and maximum values for step depth\n */\nexport const FLOW_MIN_DEPTH = 0\nexport const FLOW_MAX_DEPTH = 5\n"],"names":["isSankeyData","data","d","isServerFlowQuery","obj","FLOW_MIN_DEPTH","FLOW_MAX_DEPTH"],"mappings":"AAoOO,SAASA,EAAaC,GAAsC;AACjE,MAAI,CAACA,KAAQ,OAAOA,KAAS,SAAU,QAAO;AAC9C,QAAMC,IAAID;AACV,SACE,MAAM,QAAQC,EAAE,KAAK,KACrB,MAAM,QAAQA,EAAE,KAAK,MACpBA,EAAE,MAAM,WAAW,KACjB,OAAOA,EAAE,MAAM,CAAC,KAAM,YACrBA,EAAE,MAAM,CAAC,MAAM,QACf,QAAQA,EAAE,MAAM,CAAC;AAEzB;AAMO,SAASC,EAAkBC,GAAsC;AACtE,SACE,OAAOA,KAAQ,YACfA,MAAQ,QACR,UAAUA,KACV,OAAQA,EAA0B,QAAS;AAE/C;AA0BO,MAAMC,IAAiB,GACjBC,IAAiB;"}

package/dist/client/chunks/funnel-utils-CyonoNeC.js

@@ -1,135 +0,0 @@
-function h(n, e) {
-  if (typeof n.dimension == "string")
-    return n.dimension;
-  const i = n.dimension, t = c(e);
-  if (!t)
-    return i[0]?.dimension || "";
-  const r = i.find((s) => s.cube === t);
-  return r ? r.dimension : i[0]?.dimension || "";
-}
-function c(n) {
-  if (n.measures && n.measures.length > 0) {
-    const e = n.measures[0].split(".");
-    if (e.length >= 2)
-      return e[0];
-  }
-  if (n.dimensions && n.dimensions.length > 0) {
-    const e = n.dimensions[0].split(".");
-    if (e.length >= 2)
-      return e[0];
-  }
-  if (n.timeDimensions && n.timeDimensions.length > 0) {
-    const e = n.timeDimensions[0].dimension.split(".");
-    if (e.length >= 2)
-      return e[0];
-  }
-  return null;
-}
-function v(n, e, i, t) {
-  const r = n.map((s, o) => ({
-    id: `step-${o}`,
-    name: i?.[o] || `Step ${o + 1}`,
-    query: s,
-    timeToConvert: t?.[o] || void 0
-  }));
-  return {
-    id: `funnel-${Date.now()}`,
-    name: "Funnel Analysis",
-    bindingKey: e,
-    steps: r,
-    countUnique: !0
-  };
-}
-function b(n) {
-  return n.length > 0 && typeof n[0] == "object" && n[0] !== null && "__stepIndex" in n[0];
-}
-function C(n, e, i, t, r = !0) {
-  const s = e.dimension, o = d(n, e), u = n.map((p, m) => {
-    const a = {
-      name: i?.[m] || `Step ${m + 1}`
-    }, f = g(p);
-    f && (a.filter = f);
-    const l = t?.[m];
-    return l && (a.timeToConvert = l), a;
-  });
-  return {
-    funnel: {
-      bindingKey: s,
-      timeDimension: o,
-      steps: u,
-      includeTimeMetrics: r
-    }
-  };
-}
-function d(n, e) {
-  if (!Array.isArray(e.dimension)) {
-    for (const o of n)
-      if (o.timeDimensions?.length)
-        return o.timeDimensions[0].dimension;
-    const s = c(n[0]);
-    if (s)
-      return `${s}.createdAt`;
-    throw new Error("Funnel requires at least one time dimension in step queries");
-  }
-  const t = [], r = e.dimension;
-  for (const s of r) {
-    const o = n.find((u) => c(u) === s.cube);
-    o?.timeDimensions?.length ? t.push({
-      cube: s.cube,
-      dimension: o.timeDimensions[0].dimension
-    }) : t.push({
-      cube: s.cube,
-      dimension: `${s.cube}.createdAt`
-    });
-  }
-  return t;
-}
-function g(n) {
-  if (!n.filters?.length)
-    return;
-  const e = n.filters.filter((i) => "member" in i);
-  if (e.length !== 0)
-    return e.length === 1 ? e[0] : e;
-}
-function F(n, e) {
-  return n?.length ? n.map((t, r) => ({
-    // Map server fields to client format
-    name: e?.[r] || t.step,
-    value: t.count,
-    // Convert cumulative rate to percentage
-    percentage: t.cumulativeConversionRate * 100,
-    // Convert step-to-step rate to percentage (null for first step)
-    conversionRate: t.conversionRate !== null ? t.conversionRate * 100 : null,
-    stepIndex: t.stepIndex,
-    // Include time metrics for optional display
-    avgSecondsToConvert: t.avgSecondsToConvert,
-    medianSecondsToConvert: t.medianSecondsToConvert,
-    p90SecondsToConvert: t.p90SecondsToConvert
-  })) : [];
-}
-function $(n) {
-  if (n == null)
-    return "-";
-  if (n < 60)
-    return `${Math.round(n)}s`;
-  if (n < 3600) {
-    const i = n / 60;
-    return i < 10 ? `${i.toFixed(1)}m` : `${Math.round(i)}m`;
-  }
-  if (n < 86400) {
-    const i = n / 3600;
-    return i < 10 ? `${i.toFixed(1)}h` : `${Math.round(i)}h`;
-  }
-  const e = n / 86400;
-  return e < 10 ? `${e.toFixed(1)}d` : `${Math.round(e)}d`;
-}
-export {
-  c as a,
-  C as b,
-  v as c,
-  $ as f,
-  h as g,
-  b as i,
-  F as t
-};
-//# sourceMappingURL=funnel-utils-CyonoNeC.js.map

package/dist/client/chunks/funnel-utils-CyonoNeC.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"funnel-utils-CyonoNeC.js","sources":["../../../src/client/utils/funnelExecution.ts"],"sourcesContent":["/**\n * Funnel Query Execution Utilities\n *\n * Handles sequential execution of funnel queries where each step\n * filters based on binding key values from the previous step.\n */\n\nimport type { CubeQuery, SimpleFilter } from '../types'\n\n/**\n * Default maximum number of binding key values to pass between funnel steps.\n * Limits the size of the IN clause to prevent performance issues.\n */\nexport const DEFAULT_BINDING_KEY_LIMIT = 500\nimport type {\n  FunnelBindingKey,\n  FunnelBindingKeyMapping,\n  FunnelConfig,\n  FunnelStep,\n  FunnelStepResult,\n  FunnelExecutionResult,\n  FunnelChartData,\n} from '../types/funnel'\n\n/**\n * Extract the binding key field name for a specific query/cube.\n *\n * For simple binding keys (string), returns the dimension directly.\n * For cross-cube mappings, finds the mapping for the cube used in the query.\n *\n * @param bindingKey - The funnel binding key configuration\n * @param query - The cube query (used to determine which cube is being queried)\n * @returns The binding key field name (e.g., \"Users.userId\")\n */\nexport function getBindingKeyField(\n  bindingKey: FunnelBindingKey,\n  query: CubeQuery\n): string {\n  // Simple case: single dimension name\n  if (typeof bindingKey.dimension === 'string') {\n    return bindingKey.dimension\n  }\n\n  // Cross-cube case: find the mapping for this query's cube\n  const mappings = bindingKey.dimension as FunnelBindingKeyMapping[]\n\n  // Extract cube name from query fields\n  const cubeName = getCubeNameFromQuery(query)\n  if (!cubeName) {\n    // If we can't determine the cube, use the first mapping\n    return mappings[0]?.dimension || ''\n  }\n\n  // Find matching mapping\n  const mapping = mappings.find(m => m.cube === cubeName)\n  if (mapping) {\n    return mapping.dimension\n  }\n\n  // Fallback to first mapping if no match found\n  return mappings[0]?.dimension || ''\n}\n\n/**\n * Extract the cube name from a query by looking at measures/dimensions\n */\nexport function getCubeNameFromQuery(query: CubeQuery): string | null {\n  // Check measures first\n  if (query.measures && query.measures.length > 0) {\n    const parts = query.measures[0].split('.')\n    if (parts.length >= 2) {\n      return parts[0]\n    }\n  }\n\n  // Then check dimensions\n  if (query.dimensions && query.dimensions.length > 0) {\n    const parts = query.dimensions[0].split('.')\n    if (parts.length >= 2) {\n      return parts[0]\n    }\n  }\n\n  // Then check time dimensions\n  if (query.timeDimensions && query.timeDimensions.length > 0) {\n    const parts = query.timeDimensions[0].dimension.split('.')\n    if (parts.length >= 2) {\n      return parts[0]\n    }\n  }\n\n  return null\n}\n\n/**\n * Result from extracting binding key values\n */\nexport interface ExtractedBindingKeyValues {\n  /** Binding key values (limited to max if specified) */\n  values: (string | number)[]\n  /** Total count of unique values before limiting */\n  totalCount: number\n  /** Whether values were truncated due to limit */\n  wasTruncated: boolean\n}\n\n/**\n * Extract unique values for the binding key from query result data\n *\n * @deprecated This function was used for client-side funnel execution.\n * Server-side funnel execution is now the default approach.\n *\n * @param data - Raw data from query result\n * @param bindingKeyField - The field name to extract values from\n * @param limit - Maximum number of values to return (default: DEFAULT_BINDING_KEY_LIMIT)\n * @returns Object with values array, total count, and truncation flag\n */\nexport function extractBindingKeyValues(\n  data: unknown[],\n  bindingKeyField: string,\n  limit: number = DEFAULT_BINDING_KEY_LIMIT\n): ExtractedBindingKeyValues {\n  const values = new Set<string | number>()\n\n  for (const row of data) {\n    if (typeof row === 'object' && row !== null) {\n      const value = (row as Record<string, unknown>)[bindingKeyField]\n      if (value !== null && value !== undefined) {\n        // Convert to string or number\n        if (typeof value === 'number') {\n          values.add(value)\n        } else {\n          values.add(String(value))\n        }\n      }\n    }\n  }\n\n  const allValues = Array.from(values)\n  const totalCount = allValues.length\n\n  // Sort values for consistent ordering (enables query cache hits)\n  // Numbers sort numerically, strings sort alphabetically\n  allValues.sort((a, b) => {\n    if (typeof a === 'number' && typeof b === 'number') {\n      return a - b\n    }\n    return String(a).localeCompare(String(b))\n  })\n\n  const limitedValues = limit > 0 ? allValues.slice(0, limit) : allValues\n\n  return {\n    values: limitedValues,\n    totalCount,\n    wasTruncated: limitedValues.length < totalCount,\n  }\n}\n\n/**\n * Build a step query with binding key filter applied.\n *\n * @deprecated This function was used for client-side funnel execution.\n * Server-side funnel execution is now the default approach.\n *\n * For the first step (no previous values), returns the original query\n * with the binding key dimension ensured.\n *\n * For subsequent steps, adds an IN filter for the previous step's\n * binding key values.\n *\n * @param step - The funnel step configuration\n * @param bindingKey - The funnel binding key configuration\n * @param previousBindingKeyValues - Binding key values from previous step (null for first step)\n * @returns Modified CubeQuery with binding key filter\n */\nexport function buildStepQuery(\n  step: FunnelStep,\n  bindingKey: FunnelBindingKey,\n  previousBindingKeyValues: (string | number)[] | null\n): CubeQuery {\n  const query: CubeQuery = { ...step.query }\n\n  // Get binding key field for this query\n  const bindingKeyField = getBindingKeyField(bindingKey, query)\n\n  // Ensure binding key dimension is in the query (needed to extract values for next step)\n  if (!query.dimensions?.includes(bindingKeyField)) {\n    query.dimensions = [...(query.dimensions || []), bindingKeyField]\n  }\n\n  // Add IN filter for previous step's binding key values (except for first step)\n  if (previousBindingKeyValues && previousBindingKeyValues.length > 0) {\n    const inFilter: SimpleFilter = {\n      member: bindingKeyField,\n      operator: 'in',\n      values: previousBindingKeyValues,\n    }\n    query.filters = [...(query.filters || []), inFilter]\n  }\n\n  return query\n}\n\n/**\n * Calculate conversion metrics for a step\n *\n * @deprecated This function was used for client-side funnel execution.\n * Server-side funnel execution now calculates metrics directly.\n */\nexport function calculateStepMetrics(\n  currentCount: number,\n  previousCount: number | null,\n  firstStepCount: number\n): {\n  conversionRate: number | null\n  cumulativeConversionRate: number\n} {\n  const conversionRate =\n    previousCount !== null && previousCount > 0\n      ? currentCount / previousCount\n      : null\n\n  const cumulativeConversionRate =\n    firstStepCount > 0 ? currentCount / firstStepCount : 1.0\n\n  return { conversionRate, cumulativeConversionRate }\n}\n\n/**\n * Build a funnel step result from query execution\n *\n * @deprecated This function was used for client-side funnel execution.\n * Server-side funnel execution now returns results directly.\n */\nexport function buildStepResult(\n  step: FunnelStep,\n  stepIndex: number,\n  data: unknown[],\n  bindingKeyField: string,\n  countUnique: boolean,\n  previousCount: number | null,\n  firstStepCount: number,\n  executionTime: number,\n  error: Error | null = null,\n  bindingKeyLimit: number = DEFAULT_BINDING_KEY_LIMIT\n): FunnelStepResult {\n  // Extract binding key values (with limit applied)\n  const extracted = error\n    ? { values: [], totalCount: 0, wasTruncated: false }\n    : extractBindingKeyValues(data, bindingKeyField, bindingKeyLimit)\n\n  // Calculate count based on total unique values (before truncation)\n  const count = error\n    ? 0\n    : countUnique\n      ? extracted.totalCount\n      : data.length\n\n  // Calculate conversion metrics\n  const { conversionRate, cumulativeConversionRate } = calculateStepMetrics(\n    count,\n    previousCount,\n    firstStepCount || count // Use current count as first step count if this is step 0\n  )\n\n  return {\n    stepIndex,\n    stepName: step.name,\n    stepId: step.id,\n    data,\n    bindingKeyValues: extracted.values,\n    bindingKeyTotalCount: extracted.totalCount,\n    count,\n    conversionRate,\n    cumulativeConversionRate,\n    executionTime,\n    error,\n  }\n}\n\n/**\n * Convert step results to chart-ready data format\n *\n * @deprecated Use transformServerFunnelResult() instead.\n * Server-side funnel execution returns data in a compatible format.\n */\nexport function buildFunnelChartData(\n  stepResults: FunnelStepResult[]\n): FunnelChartData[] {\n  if (stepResults.length === 0) return []\n\n  const firstStepCount = stepResults[0]?.count || 0\n\n  return stepResults.map((result, index) => ({\n    name: result.stepName,\n    value: result.count,\n    percentage: firstStepCount > 0 ? (result.count / firstStepCount) * 100 : 0,\n    conversionRate: result.conversionRate,\n    stepIndex: index,\n  }))\n}\n\n/**\n * Build the complete funnel execution result\n *\n * @deprecated This function was used for client-side funnel execution.\n * Server-side funnel execution now builds results directly.\n */\nexport function buildFunnelResult(\n  config: FunnelConfig,\n  stepResults: FunnelStepResult[],\n  status: FunnelExecutionResult['status'],\n  error: Error | null = null,\n  currentStepIndex: number | null = null\n): FunnelExecutionResult {\n  const firstStepCount = stepResults[0]?.count || 0\n  const lastStepCount = stepResults[stepResults.length - 1]?.count || 0\n  const totalExecutionTime = stepResults.reduce((sum, r) => sum + r.executionTime, 0)\n\n  return {\n    config,\n    steps: stepResults,\n    summary: {\n      totalEntries: firstStepCount,\n      totalCompletions: lastStepCount,\n      overallConversionRate: firstStepCount > 0 ? lastStepCount / firstStepCount : 0,\n      totalExecutionTime,\n    },\n    chartData: buildFunnelChartData(stepResults),\n    status,\n    error,\n    currentStepIndex,\n  }\n}\n\n/**\n * Create an empty/initial funnel result\n *\n * @deprecated This function was used for client-side funnel execution.\n * Server-side funnel execution manages state differently.\n */\nexport function createEmptyFunnelResult(\n  config: FunnelConfig\n): FunnelExecutionResult {\n  return {\n    config,\n    steps: [],\n    summary: {\n      totalEntries: 0,\n      totalCompletions: 0,\n      overallConversionRate: 0,\n      totalExecutionTime: 0,\n    },\n    chartData: [],\n    status: 'idle',\n    error: null,\n    currentStepIndex: null,\n  }\n}\n\n/**\n * Build a FunnelConfig from multi-query config state.\n * Used to convert AnalysisBuilder state to funnel configuration.\n *\n * @deprecated Use the dedicated funnel mode (analysisType === 'funnel') instead.\n * This function supports backward compatibility with legacy multi-query funnel mode\n * (mergeStrategy === 'funnel'). For new implementations, use the dedicated funnel\n * state in the store which provides better UX with step-based configuration.\n *\n * @param queries - Array of CubeQuery objects (one per step)\n * @param bindingKey - The binding key configuration\n * @param stepLabels - Optional labels for each step\n * @param stepTimeToConvert - Optional time window for each step\n * @returns FunnelConfig ready for execution\n */\nexport function buildFunnelConfigFromQueries(\n  queries: CubeQuery[],\n  bindingKey: FunnelBindingKey,\n  stepLabels?: string[],\n  stepTimeToConvert?: (string | null)[]\n): FunnelConfig {\n  const steps: FunnelStep[] = queries.map((query, index) => ({\n    id: `step-${index}`,\n    name: stepLabels?.[index] || `Step ${index + 1}`,\n    query,\n    timeToConvert: stepTimeToConvert?.[index] || undefined,\n  }))\n\n  return {\n    id: `funnel-${Date.now()}`,\n    name: 'Funnel Analysis',\n    bindingKey,\n    steps,\n    countUnique: true,\n  }\n}\n\n/**\n * Check if funnel execution should stop early\n * (e.g., when no binding key values remain)\n */\nexport function shouldStopFunnelExecution(\n  stepResult: FunnelStepResult\n): boolean {\n  return stepResult.bindingKeyValues.length === 0 || stepResult.error !== null\n}\n\n/**\n * Metadata fields injected into funnel result data\n * (for compatibility with existing chart/table components)\n */\nexport interface FunnelMetadata {\n  __stepIndex: number\n  __stepName: string\n  __stepId: string\n  __conversionRate: number | null\n  __cumulativeRate: number\n}\n\n/**\n * Check if data contains funnel metadata\n */\nexport function isFunnelData(data: unknown[]): boolean {\n  return (\n    data.length > 0 &&\n    typeof data[0] === 'object' &&\n    data[0] !== null &&\n    '__stepIndex' in data[0]\n  )\n}\n\n// =============================================================================\n// Server-Side Funnel Support\n// =============================================================================\n\n/**\n * Server-side funnel step definition (for FunnelQueryConfig)\n */\nexport interface ServerFunnelStep {\n  name: string\n  filter?: SimpleFilter | SimpleFilter[]\n  timeToConvert?: string\n}\n\n/**\n * Server-side funnel query configuration\n */\nexport interface ServerFunnelQueryConfig {\n  bindingKey: string | FunnelBindingKeyMapping[]\n  timeDimension: string | Array<{ cube: string; dimension: string }>\n  steps: ServerFunnelStep[]\n  includeTimeMetrics?: boolean\n  globalTimeWindow?: string\n}\n\n/**\n * Server-side funnel result row\n */\nexport interface ServerFunnelResultRow {\n  step: string\n  stepIndex: number\n  count: number\n  conversionRate: number | null\n  cumulativeConversionRate: number\n  avgSecondsToConvert?: number | null\n  medianSecondsToConvert?: number | null\n  p90SecondsToConvert?: number | null\n  minSecondsToConvert?: number | null\n  maxSecondsToConvert?: number | null\n}\n\n/**\n * Query shape for server-side funnel execution\n */\nexport interface ServerFunnelQuery {\n  funnel: ServerFunnelQueryConfig\n}\n\n/**\n * Build a server-side funnel query from client state.\n *\n * Transforms the client-side FunnelConfig format into a SemanticQuery\n * with `funnel` property that the server can execute.\n *\n * @param queries - Array of CubeQuery objects (one per step)\n * @param bindingKey - The binding key configuration\n * @param stepLabels - Optional labels for each step\n * @param stepTimeToConvert - Optional time window for each step (ISO 8601 duration)\n * @param includeTimeMetrics - Whether to include time-to-convert metrics\n * @returns Query object with funnel configuration for server execution\n */\nexport function buildServerFunnelQuery(\n  queries: CubeQuery[],\n  bindingKey: FunnelBindingKey,\n  stepLabels?: string[],\n  stepTimeToConvert?: (string | null)[],\n  includeTimeMetrics: boolean = true\n): ServerFunnelQuery {\n  // 1. Unwrap binding key from client format (client wraps in { dimension: ... })\n  const serverBindingKey = bindingKey.dimension\n\n  // 2. Extract time dimension from queries\n  const timeDimension = extractTimeDimensionFromQueries(queries, bindingKey)\n\n  // 3. Convert each CubeQuery to a server FunnelStep\n  const steps: ServerFunnelStep[] = queries.map((query, index) => {\n    const step: ServerFunnelStep = {\n      name: stepLabels?.[index] || `Step ${index + 1}`,\n    }\n\n    // Extract filters from query\n    const filter = extractFiltersFromQuery(query)\n    if (filter) {\n      step.filter = filter\n    }\n\n    // Add time-to-convert constraint if specified\n    const timeConstraint = stepTimeToConvert?.[index]\n    if (timeConstraint) {\n      step.timeToConvert = timeConstraint\n    }\n\n    return step\n  })\n\n  return {\n    funnel: {\n      bindingKey: serverBindingKey,\n      timeDimension,\n      steps,\n      includeTimeMetrics,\n    },\n  }\n}\n\n/**\n * Extract time dimension from queries.\n *\n * For single-cube funnels, returns the first time dimension found.\n * For cross-cube funnels (with binding key mappings), builds a mapping array.\n *\n * @param queries - Array of CubeQuery objects\n * @param bindingKey - The binding key configuration (to detect cross-cube)\n * @returns Time dimension string or mapping array\n */\nfunction extractTimeDimensionFromQueries(\n  queries: CubeQuery[],\n  bindingKey: FunnelBindingKey\n): string | Array<{ cube: string; dimension: string }> {\n  // Check if this is a cross-cube funnel\n  const isCrossCube = Array.isArray(bindingKey.dimension)\n\n  if (!isCrossCube) {\n    // Single-cube: find first time dimension\n    for (const query of queries) {\n      if (query.timeDimensions?.length) {\n        return query.timeDimensions[0].dimension\n      }\n    }\n    // Fallback: try to infer from measures/dimensions\n    const cubeName = getCubeNameFromQuery(queries[0])\n    if (cubeName) {\n      return `${cubeName}.createdAt` // Common convention\n    }\n    throw new Error('Funnel requires at least one time dimension in step queries')\n  }\n\n  // Cross-cube: build mapping for each cube\n  const mappings: Array<{ cube: string; dimension: string }> = []\n  const bindingMappings = bindingKey.dimension as FunnelBindingKeyMapping[]\n\n  for (const mapping of bindingMappings) {\n    // Find time dimension for this cube from queries\n    const cubeQuery = queries.find(q => getCubeNameFromQuery(q) === mapping.cube)\n    if (cubeQuery?.timeDimensions?.length) {\n      mappings.push({\n        cube: mapping.cube,\n        dimension: cubeQuery.timeDimensions[0].dimension,\n      })\n    } else {\n      // Fallback to common convention\n      mappings.push({\n        cube: mapping.cube,\n        dimension: `${mapping.cube}.createdAt`,\n      })\n    }\n  }\n\n  return mappings\n}\n\n/**\n * Extract filters from a CubeQuery for server funnel step.\n *\n * @param query - The CubeQuery\n * @returns Filter or array of filters, or undefined if no filters\n */\nfunction extractFiltersFromQuery(query: CubeQuery): SimpleFilter | SimpleFilter[] | undefined {\n  if (!query.filters?.length) {\n    return undefined\n  }\n\n  // Filter out any binding key filters (server handles those)\n  const filters = query.filters.filter(f => {\n    // Keep only SimpleFilter with member (not grouped filters for now)\n    if ('member' in f) {\n      return true\n    }\n    return false\n  }) as SimpleFilter[]\n\n  if (filters.length === 0) {\n    return undefined\n  }\n\n  if (filters.length === 1) {\n    return filters[0]\n  }\n\n  return filters\n}\n\n/**\n * Transform server funnel result rows to client FunnelChartData format.\n *\n * Maps the server's FunnelResultRow[] to the client's FunnelChartData[]\n * format expected by FunnelChart component.\n *\n * @param serverResult - Raw data from server (FunnelResultRow[])\n * @param stepNames - Optional step names to override server names\n * @returns FunnelChartData[] ready for FunnelChart component\n */\nexport function transformServerFunnelResult(\n  serverResult: unknown[],\n  stepNames?: string[]\n): FunnelChartData[] {\n  if (!serverResult?.length) {\n    return []\n  }\n\n  const rows = serverResult as ServerFunnelResultRow[]\n\n  return rows.map((row, index) => ({\n    // Map server fields to client format\n    name: stepNames?.[index] || row.step,\n    value: row.count,\n    // Convert cumulative rate to percentage\n    percentage: row.cumulativeConversionRate * 100,\n    // Convert step-to-step rate to percentage (null for first step)\n    conversionRate: row.conversionRate !== null ? row.conversionRate * 100 : null,\n    stepIndex: row.stepIndex,\n    // Include time metrics for optional display\n    avgSecondsToConvert: row.avgSecondsToConvert,\n    medianSecondsToConvert: row.medianSecondsToConvert,\n    p90SecondsToConvert: row.p90SecondsToConvert,\n  }))\n}\n\n/**\n * Format a duration in seconds to a human-readable string.\n *\n * @param seconds - Duration in seconds\n * @returns Formatted string (e.g., \"45s\", \"2.5m\", \"1.3h\", \"3.2d\")\n */\nexport function formatDuration(seconds: number | null | undefined): string {\n  if (seconds === null || seconds === undefined) {\n    return '-'\n  }\n\n  if (seconds < 60) {\n    return `${Math.round(seconds)}s`\n  }\n\n  if (seconds < 3600) {\n    const minutes = seconds / 60\n    return minutes < 10 ? `${minutes.toFixed(1)}m` : `${Math.round(minutes)}m`\n  }\n\n  if (seconds < 86400) {\n    const hours = seconds / 3600\n    return hours < 10 ? `${hours.toFixed(1)}h` : `${Math.round(hours)}h`\n  }\n\n  const days = seconds / 86400\n  return days < 10 ? `${days.toFixed(1)}d` : `${Math.round(days)}d`\n}\n"],"names":["getBindingKeyField","bindingKey","query","mappings","cubeName","getCubeNameFromQuery","mapping","m","parts","buildFunnelConfigFromQueries","queries","stepLabels","stepTimeToConvert","steps","index","isFunnelData","data","buildServerFunnelQuery","includeTimeMetrics","serverBindingKey","timeDimension","extractTimeDimensionFromQueries","step","filter","extractFiltersFromQuery","timeConstraint","bindingMappings","cubeQuery","q","filters","f","transformServerFunnelResult","serverResult","stepNames","row","formatDuration","seconds","minutes","hours","days"],"mappings":"AAkCO,SAASA,EACdC,GACAC,GACQ;AAER,MAAI,OAAOD,EAAW,aAAc;AAClC,WAAOA,EAAW;AAIpB,QAAME,IAAWF,EAAW,WAGtBG,IAAWC,EAAqBH,CAAK;AAC3C,MAAI,CAACE;AAEH,WAAOD,EAAS,CAAC,GAAG,aAAa;AAInC,QAAMG,IAAUH,EAAS,KAAK,CAAAI,MAAKA,EAAE,SAASH,CAAQ;AACtD,SAAIE,IACKA,EAAQ,YAIVH,EAAS,CAAC,GAAG,aAAa;AACnC;AAKO,SAASE,EAAqBH,GAAiC;AAEpE,MAAIA,EAAM,YAAYA,EAAM,SAAS,SAAS,GAAG;AAC/C,UAAMM,IAAQN,EAAM,SAAS,CAAC,EAAE,MAAM,GAAG;AACzC,QAAIM,EAAM,UAAU;AAClB,aAAOA,EAAM,CAAC;AAAA,EAElB;AAGA,MAAIN,EAAM,cAAcA,EAAM,WAAW,SAAS,GAAG;AACnD,UAAMM,IAAQN,EAAM,WAAW,CAAC,EAAE,MAAM,GAAG;AAC3C,QAAIM,EAAM,UAAU;AAClB,aAAOA,EAAM,CAAC;AAAA,EAElB;AAGA,MAAIN,EAAM,kBAAkBA,EAAM,eAAe,SAAS,GAAG;AAC3D,UAAMM,IAAQN,EAAM,eAAe,CAAC,EAAE,UAAU,MAAM,GAAG;AACzD,QAAIM,EAAM,UAAU;AAClB,aAAOA,EAAM,CAAC;AAAA,EAElB;AAEA,SAAO;AACT;AA4RO,SAASC,EACdC,GACAT,GACAU,GACAC,GACc;AACd,QAAMC,IAAsBH,EAAQ,IAAI,CAACR,GAAOY,OAAW;AAAA,IACzD,IAAI,QAAQA,CAAK;AAAA,IACjB,MAAMH,IAAaG,CAAK,KAAK,QAAQA,IAAQ,CAAC;AAAA,IAC9C,OAAAZ;AAAA,IACA,eAAeU,IAAoBE,CAAK,KAAK;AAAA,EAAA,EAC7C;AAEF,SAAO;AAAA,IACL,IAAI,UAAU,KAAK,IAAA,CAAK;AAAA,IACxB,MAAM;AAAA,IACN,YAAAb;AAAA,IACA,OAAAY;AAAA,IACA,aAAa;AAAA,EAAA;AAEjB;AA2BO,SAASE,EAAaC,GAA0B;AACrD,SACEA,EAAK,SAAS,KACd,OAAOA,EAAK,CAAC,KAAM,YACnBA,EAAK,CAAC,MAAM,QACZ,iBAAiBA,EAAK,CAAC;AAE3B;AA8DO,SAASC,EACdP,GACAT,GACAU,GACAC,GACAM,IAA8B,IACX;AAEnB,QAAMC,IAAmBlB,EAAW,WAG9BmB,IAAgBC,EAAgCX,GAAST,CAAU,GAGnEY,IAA4BH,EAAQ,IAAI,CAACR,GAAOY,MAAU;AAC9D,UAAMQ,IAAyB;AAAA,MAC7B,MAAMX,IAAaG,CAAK,KAAK,QAAQA,IAAQ,CAAC;AAAA,IAAA,GAI1CS,IAASC,EAAwBtB,CAAK;AAC5C,IAAIqB,MACFD,EAAK,SAASC;AAIhB,UAAME,IAAiBb,IAAoBE,CAAK;AAChD,WAAIW,MACFH,EAAK,gBAAgBG,IAGhBH;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,YAAYH;AAAA,MACZ,eAAAC;AAAA,MACA,OAAAP;AAAA,MACA,oBAAAK;AAAA,IAAA;AAAA,EACF;AAEJ;AAYA,SAASG,EACPX,GACAT,GACqD;AAIrD,MAAI,CAFgB,MAAM,QAAQA,EAAW,SAAS,GAEpC;AAEhB,eAAWC,KAASQ;AAClB,UAAIR,EAAM,gBAAgB;AACxB,eAAOA,EAAM,eAAe,CAAC,EAAE;AAInC,UAAME,IAAWC,EAAqBK,EAAQ,CAAC,CAAC;AAChD,QAAIN;AACF,aAAO,GAAGA,CAAQ;AAEpB,UAAM,IAAI,MAAM,6DAA6D;AAAA,EAC/E;AAGA,QAAMD,IAAuD,CAAA,GACvDuB,IAAkBzB,EAAW;AAEnC,aAAWK,KAAWoB,GAAiB;AAErC,UAAMC,IAAYjB,EAAQ,KAAK,CAAAkB,MAAKvB,EAAqBuB,CAAC,MAAMtB,EAAQ,IAAI;AAC5E,IAAIqB,GAAW,gBAAgB,SAC7BxB,EAAS,KAAK;AAAA,MACZ,MAAMG,EAAQ;AAAA,MACd,WAAWqB,EAAU,eAAe,CAAC,EAAE;AAAA,IAAA,CACxC,IAGDxB,EAAS,KAAK;AAAA,MACZ,MAAMG,EAAQ;AAAA,MACd,WAAW,GAAGA,EAAQ,IAAI;AAAA,IAAA,CAC3B;AAAA,EAEL;AAEA,SAAOH;AACT;AAQA,SAASqB,EAAwBtB,GAA6D;AAC5F,MAAI,CAACA,EAAM,SAAS;AAClB;AAIF,QAAM2B,IAAU3B,EAAM,QAAQ,OAAO,CAAA4B,MAE/B,YAAYA,CAIjB;AAED,MAAID,EAAQ,WAAW;AAIvB,WAAIA,EAAQ,WAAW,IACdA,EAAQ,CAAC,IAGXA;AACT;AAYO,SAASE,EACdC,GACAC,GACmB;AACnB,SAAKD,GAAc,SAINA,EAED,IAAI,CAACE,GAAKpB,OAAW;AAAA;AAAA,IAE/B,MAAMmB,IAAYnB,CAAK,KAAKoB,EAAI;AAAA,IAChC,OAAOA,EAAI;AAAA;AAAA,IAEX,YAAYA,EAAI,2BAA2B;AAAA;AAAA,IAE3C,gBAAgBA,EAAI,mBAAmB,OAAOA,EAAI,iBAAiB,MAAM;AAAA,IACzE,WAAWA,EAAI;AAAA;AAAA,IAEf,qBAAqBA,EAAI;AAAA,IACzB,wBAAwBA,EAAI;AAAA,IAC5B,qBAAqBA,EAAI;AAAA,EAAA,EACzB,IAlBO,CAAA;AAmBX;AAQO,SAASC,EAAeC,GAA4C;AACzE,MAAIA,KAAY;AACd,WAAO;AAGT,MAAIA,IAAU;AACZ,WAAO,GAAG,KAAK,MAAMA,CAAO,CAAC;AAG/B,MAAIA,IAAU,MAAM;AAClB,UAAMC,IAAUD,IAAU;AAC1B,WAAOC,IAAU,KAAK,GAAGA,EAAQ,QAAQ,CAAC,CAAC,MAAM,GAAG,KAAK,MAAMA,CAAO,CAAC;AAAA,EACzE;AAEA,MAAID,IAAU,OAAO;AACnB,UAAME,IAAQF,IAAU;AACxB,WAAOE,IAAQ,KAAK,GAAGA,EAAM,QAAQ,CAAC,CAAC,MAAM,GAAG,KAAK,MAAMA,CAAK,CAAC;AAAA,EACnE;AAEA,QAAMC,IAAOH,IAAU;AACvB,SAAOG,IAAO,KAAK,GAAGA,EAAK,QAAQ,CAAC,CAAC,MAAM,GAAG,KAAK,MAAMA,CAAI,CAAC;AAChE;"}