@mx-space/cli 0.1.1 → 0.2.1

package/dist/{LexicalMarkdown.dev-C8e-eh6y.mjs.map → LexicalMarkdown.dev-CRWkZwlp.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"LexicalMarkdown.dev-C8e-eh6y.mjs","names":["$findMatchingParent","$findMatchingParent$1"],"sources":["../../../node_modules/.pnpm/@lexical+markdown@0.44.0/node_modules/@lexical/markdown/LexicalMarkdown.dev.mjs"],"sourcesContent":["/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nimport { $isParagraphNode, $isTextNode, $getRoot, $isElementNode, $isDecoratorNode, $isLineBreakNode, $getSelection, $createTextNode, $createParagraphNode, $createLineBreakNode, $createTabNode, createState, $setState, $getState, $findMatchingParent as $findMatchingParent$1, mergeRegister, COLLABORATION_TAG, HISTORIC_TAG, $isRangeSelection, $addUpdateTag, HISTORY_PUSH_TAG, KEY_ENTER_COMMAND, COMMAND_PRIORITY_LOW, $isRootOrShadowRoot, $createRangeSelection, $setSelection } from 'lexical';\nimport { $isListNode, $isListItemNode, ListNode, ListItemNode, $createListItemNode, $createListNode } from '@lexical/list';\nimport { $isQuoteNode, HeadingNode, QuoteNode, $isHeadingNode, $createQuoteNode, $createHeadingNode } from '@lexical/rich-text';\nimport { $findMatchingParent } from '@lexical/utils';\nimport { CodeNode, $createCodeNode, $isCodeNode } from '@lexical/code-core';\nimport { LinkNode, $isLinkNode, $createLinkNode, $isAutoLinkNode } from '@lexical/link';\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction indexBy(list, callback) {\n  const index = {};\n  for (const item of list) {\n    const key = callback(item);\n    if (!key) {\n      continue;\n    }\n    if (index[key]) {\n      index[key].push(item);\n    } else {\n      index[key] = [item];\n    }\n  }\n  return index;\n}\nfunction transformersByType(transformers) {\n  const byType = indexBy(transformers, t => t.type);\n  return {\n    element: byType.element || [],\n    multilineElement: byType['multiline-element'] || [],\n    textFormat: byType['text-format'] || [],\n    textMatch: byType['text-match'] || []\n  };\n}\nconst PUNCTUATION_OR_SPACE = /[!-/:-@[-`{-~\\s]/;\nconst WHITESPACE = /[ \\t\\n\\r\\f]/;\nconst PUNCTUATION = /[!\"#$%&'()*+,\\-./:;<=>?@[\\]^_`{|}~]/;\nconst MARKDOWN_EMPTY_LINE_REG_EXP = /^\\s{0,3}$/;\nfunction isEmptyParagraph(node) {\n  if (!$isParagraphNode(node)) {\n    return false;\n  }\n  const firstChild = node.getFirstChild();\n  return firstChild == null || node.getChildrenSize() === 1 && $isTextNode(firstChild) && MARKDOWN_EMPTY_LINE_REG_EXP.test(firstChild.getTextContent());\n}\nfunction unescapeText(value) {\n  return value.replace(/\\\\([!-/:-@[-`{-~])/g, '$1').replace(/&#(\\d+);/g, (_, codePoint) => String.fromCodePoint(Number(codePoint)));\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n\n/**\n * Renders string from markdown. The selection is moved to the start after the operation.\n */\nfunction createMarkdownExport(transformers, shouldPreserveNewLines = false) {\n  const byType = transformersByType(transformers);\n  const elementTransformers = [...byType.multilineElement, ...byType.element];\n  const isNewlineDelimited = !shouldPreserveNewLines;\n\n  // Export only uses text formats that are responsible for single format\n  // e.g. it will filter out *** (bold, italic) and instead use separate ** and *\n  const textFormatTransformers = byType.textFormat.filter(transformer => transformer.format.length === 1)\n  // Make sure all text transformers that contain 'code' in their format are at the end of the array. Otherwise, formatted code like\n  // <strong><code>code</code></strong> will be exported as `**Bold Code**`, as the code format will be applied first, and the bold format\n  // will be applied second and thus skipped entirely, as the code format will prevent any further formatting.\n  .sort((a, b) => {\n    return Number(a.format.includes('code')) - Number(b.format.includes('code'));\n  });\n  return node => {\n    const output = [];\n    const children = (node || $getRoot()).getChildren();\n    for (let i = 0; i < children.length; i++) {\n      const child = children[i];\n      const result = exportTopLevelElements(child, elementTransformers, textFormatTransformers, byType.textMatch, shouldPreserveNewLines);\n      if (result != null) {\n        output.push(\n        // separate consecutive group of texts with a line break: eg. [\"hello\", \"world\"] -> [\"hello\", \"/nworld\"]\n        isNewlineDelimited && i > 0 && !isEmptyParagraph(child) && !isEmptyParagraph(children[i - 1]) ? '\\n'.concat(result) : result);\n      }\n    }\n    // Ensure consecutive groups of texts are at least \\n\\n apart while each empty paragraph render as a newline.\n    // Eg. [\"hello\", \"\", \"\", \"hi\", \"\\nworld\"] -> \"hello\\n\\n\\nhi\\n\\nworld\"\n    return output.join('\\n');\n  };\n}\nfunction exportTopLevelElements(node, elementTransformers, textTransformersIndex, textMatchTransformers, shouldPreserveNewLines) {\n  for (const transformer of elementTransformers) {\n    if (!transformer.export) {\n      continue;\n    }\n    const result = transformer.export(node, _node => exportChildren(_node, textTransformersIndex, textMatchTransformers, undefined, undefined, shouldPreserveNewLines));\n    if (result != null) {\n      return result;\n    }\n  }\n  if ($isElementNode(node)) {\n    return exportChildren(node, textTransformersIndex, textMatchTransformers, undefined, undefined, shouldPreserveNewLines);\n  } else if ($isDecoratorNode(node)) {\n    return node.getTextContent();\n  } else {\n    return null;\n  }\n}\nfunction exportChildren(node, textTransformersIndex, textMatchTransformers, unclosedTags, unclosableTags, shouldPreserveNewLines = false) {\n  const output = [];\n  const children = node.getChildren();\n  // keep track of unclosed tags from the very beginning\n  if (!unclosedTags) {\n    unclosedTags = [];\n  }\n  if (!unclosableTags) {\n    unclosableTags = [];\n  }\n  mainLoop: for (const child of children) {\n    for (const transformer of textMatchTransformers) {\n      if (!transformer.export) {\n        continue;\n      }\n      const result = transformer.export(child, parentNode => exportChildren(parentNode, textTransformersIndex, textMatchTransformers, unclosedTags,\n      // Add current unclosed tags to the list of unclosable tags - we don't want nested tags from\n      // textmatch transformers to close the outer ones, as that may result in invalid markdown.\n      // E.g. **text [text**](https://lexical.io)\n      // is invalid markdown, as the closing ** is inside the link.\n      //\n      [...unclosableTags, ...unclosedTags], shouldPreserveNewLines), (textNode, textContent) => exportTextFormat(textNode, textContent, textTransformersIndex, unclosedTags, unclosableTags, shouldPreserveNewLines));\n      if (result != null) {\n        output.push(result);\n        continue mainLoop;\n      }\n    }\n    if ($isLineBreakNode(child)) {\n      output.push('\\n');\n    } else if ($isTextNode(child)) {\n      output.push(exportTextFormat(child, child.getTextContent(), textTransformersIndex, unclosedTags, unclosableTags, shouldPreserveNewLines));\n    } else if ($isElementNode(child)) {\n      // empty paragraph returns \"\"\n      output.push(exportChildren(child, textTransformersIndex, textMatchTransformers, unclosedTags, unclosableTags, shouldPreserveNewLines));\n    } else if ($isDecoratorNode(child)) {\n      output.push(child.getTextContent());\n    }\n  }\n  return output.join('');\n}\nfunction exportTextFormat(node, textContent, textTransformers,\n// unclosed tags include the markdown tags that haven't been closed yet, and their associated formats\nunclosedTags, unclosableTags, shouldPreserveNewLines = false) {\n  // This function handles the case of a string looking like this: \"   foo   \"\n  // Where it would be invalid markdown to generate: \"**   foo   **\"\n  // If the node has no format, we use the original text.\n  // Otherwise, we escape leading and trailing whitespaces to their corresponding code points,\n  // ensuring the returned string maintains its original formatting, e.g., \"**&#32;&#32;&#32;foo&#32;&#32;&#32;**\".\n\n  let output = textContent;\n  if (!node.hasFormat('code')) {\n    // Preserve literal backslashes when preserving source newlines.\n    output = shouldPreserveNewLines ? output.replace(/([*_`~])/g, '\\\\$1') : output.replace(/([*_`~\\\\])/g, '\\\\$1');\n  }\n\n  // Extract leading and trailing whitespaces.\n  // CommonMark flanking rules require formatting tags to be adjacent to non-whitespace characters.\n  const match = output.match(/^(\\s*)(.*?)(\\s*)$/s) || ['', '', output, ''];\n  const leadingSpace = match[1];\n  const trimmedOutput = match[2];\n  const trailingSpace = match[3];\n  const isWhitespaceOnly = trimmedOutput === '';\n\n  // the opening tags to be added to the result\n  let openingTags = '';\n  // the closing tags to be added to the result\n  let closingTagsBefore = '';\n  let closingTagsAfter = '';\n  const prevNode = getTextSibling(node, true);\n  const nextNode = getTextSibling(node, false);\n  const applied = new Set();\n  for (const transformer of textTransformers) {\n    const format = transformer.format[0];\n    const tag = transformer.tag;\n\n    // dedup applied formats\n    if (checkHasFormat(node, format) && !applied.has(format)) {\n      applied.add(format);\n\n      // append the tag to openingTags, if it's not applied to the previous nodes,\n      // or the nodes before that (which would result in an unclosed tag)\n      if (!checkHasFormat(prevNode, format) || !unclosedTags.find(element => element.tag === tag)) {\n        unclosedTags.push({\n          format,\n          tag\n        });\n        openingTags += tag;\n      }\n    }\n  }\n\n  // close any tags in the same order they were applied, if necessary\n  for (let i = 0; i < unclosedTags.length; i++) {\n    const nodeHasFormat = hasFormat(node, unclosedTags[i].format);\n    const nextNodeHasFormat = hasFormat(nextNode, unclosedTags[i].format);\n\n    // prevent adding closing tag if next sibling will do it\n    if (nodeHasFormat && nextNodeHasFormat) {\n      continue;\n    }\n    const unhandledUnclosedTags = [...unclosedTags]; // Shallow copy to avoid modifying the original array\n\n    while (unhandledUnclosedTags.length > i) {\n      const unclosedTag = unhandledUnclosedTags.pop();\n\n      // If tag is unclosable, don't close it and leave it in the original array,\n      // So that it can be closed when it's no longer unclosable\n      if (unclosableTags && unclosedTag && unclosableTags.find(element => element.tag === unclosedTag.tag)) {\n        continue;\n      }\n      if (unclosedTag && typeof unclosedTag.tag === 'string') {\n        if (!nodeHasFormat) {\n          // Handles cases where the tag has not been closed before, e.g. if the previous node\n          // was a text match transformer that did not account for closing tags of the next node (e.g. a link)\n          closingTagsBefore += unclosedTag.tag;\n        } else if (!nextNodeHasFormat) {\n          closingTagsAfter += unclosedTag.tag;\n        }\n      }\n      // Mutate the original array to remove the closed tag\n      unclosedTags.pop();\n    }\n    break;\n  }\n  // If the node is entirely whitespace, we don't apply opening/closing tags around it.\n  // However, it must still output closing tags from previous nodes.\n  if (isWhitespaceOnly && !node.hasFormat('code')) {\n    return closingTagsBefore + output;\n  }\n\n  // Flanking Compliance: Notice how openingTags and closingTagsAfter are placed INSIDE the whitespace boundaries!\n  return closingTagsBefore + leadingSpace + openingTags + trimmedOutput + closingTagsAfter + trailingSpace;\n}\nfunction getTextSibling(node, backward) {\n  const sibling = backward ? node.getPreviousSibling() : node.getNextSibling();\n  if ($isTextNode(sibling)) {\n    return sibling;\n  }\n  return null;\n}\nfunction hasFormat(node, format) {\n  return $isTextNode(node) && node.hasFormat(format);\n}\nfunction checkHasFormat(n, f) {\n  if (!hasFormat(n, f)) {\n    return false;\n  }\n  if (f === 'code') {\n    return true;\n  }\n  if (n && /^\\s*$/.test(n.getTextContent())) {\n    return false;\n  }\n  return true;\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction findOutermostTextFormatTransformer(textNode, textFormatTransformersIndex) {\n  const textContent = textNode.getTextContent();\n\n  // Find code span first. Emphasis delimiters inside inline elements (e.g., code spans)\n  // should not be processed. Currently only code spans are handled; other inline elements\n  // (e.g., links, raw HTML) may need similar treatment in the future.\n  const codeRegex = textFormatTransformersIndex.fullMatchRegExpByTag['`'];\n  const codeTransformer = textFormatTransformersIndex.transformersByTag['`'];\n  const excludeRanges = [];\n  let codeMatch = null;\n  if (codeRegex && codeTransformer) {\n    const globalRegex = new RegExp(codeRegex.source, 'g');\n    const matches = Array.from(textContent.matchAll(globalRegex));\n    for (const match of matches) {\n      // Group 1 captures the character preceding the opening backtick (or an\n      // empty string when the span starts at position 0). Offset past it so\n      // startIndex points to the backtick itself.\n      const startIndex = match.index + match[1].length;\n      const endIndex = match.index + match[0].length;\n      if (!codeMatch) {\n        codeMatch = {\n          content: match[3],\n          endIndex,\n          startIndex,\n          tag: '`'\n        };\n      }\n      excludeRanges.push({\n        end: endIndex,\n        start: startIndex\n      });\n    }\n  }\n  const delimiters = scanDelimiters(textContent, textFormatTransformersIndex, excludeRanges);\n  const emphasisMatch = delimiters.length > 0 ? processEmphasis(textContent, delimiters, textFormatTransformersIndex) : null;\n  let resultMatch = null;\n  let resultTransformer = null;\n  if (codeMatch && emphasisMatch) {\n    if (emphasisMatch.startIndex <= codeMatch.startIndex && emphasisMatch.endIndex >= codeMatch.endIndex) {\n      resultMatch = emphasisMatch;\n      resultTransformer = textFormatTransformersIndex.transformersByTag[emphasisMatch.tag];\n    } else {\n      resultMatch = codeMatch;\n      resultTransformer = codeTransformer;\n    }\n  } else if (codeMatch) {\n    resultMatch = codeMatch;\n    resultTransformer = codeTransformer;\n  } else if (emphasisMatch) {\n    resultMatch = emphasisMatch;\n    resultTransformer = textFormatTransformersIndex.transformersByTag[emphasisMatch.tag];\n  }\n  if (!resultMatch || !resultTransformer) {\n    return null;\n  }\n  const regexMatch = [textContent.slice(resultMatch.startIndex, resultMatch.endIndex), resultMatch.tag, resultMatch.content];\n  regexMatch.index = resultMatch.startIndex;\n  regexMatch.input = textContent;\n  return {\n    endIndex: resultMatch.endIndex,\n    match: regexMatch,\n    startIndex: resultMatch.startIndex,\n    transformer: resultTransformer\n  };\n}\nfunction scanDelimiters(text, transformersIndex, excludeRanges = []) {\n  const delimiters = [];\n  const delimiterChars = new Set(Object.keys(transformersIndex.transformersByTag).filter(tag => tag[0] !== '`').map(tag => tag[0]));\n  const isEscaped = index => {\n    let count = 0;\n    for (let i = index - 1; i >= 0 && text[i] === '\\\\'; i--) {\n      count++;\n    }\n    return count % 2 === 1;\n  };\n  const isInExcludedRange = index => {\n    return excludeRanges.some(range => index >= range.start && index < range.end);\n  };\n  let i = 0;\n  while (i < text.length) {\n    const char = text[i];\n    if (!delimiterChars.has(char) || isEscaped(i) || isInExcludedRange(i)) {\n      i++;\n      continue;\n    }\n    let len = 1;\n    while (i + len < text.length && text[i + len] === char) {\n      len++;\n    }\n    const canOpen = canEmphasis(char, text, i, len, true);\n    const canClose = canEmphasis(char, text, i, len, false);\n    if (canOpen || canClose) {\n      delimiters.push({\n        active: true,\n        canClose,\n        canOpen,\n        char,\n        index: i,\n        length: len,\n        originalLength: len\n      });\n    }\n    i += len;\n  }\n  return delimiters;\n}\nfunction processEmphasis(text, delimiters, transformersIndex) {\n  const openersBottom = {};\n  let currentPos = 0;\n  let result = null;\n  while (currentPos < delimiters.length) {\n    const closer = delimiters[currentPos];\n    if (!closer.active || !closer.canClose || closer.length === 0) {\n      currentPos++;\n      continue;\n    }\n    const bottomKey = `${closer.char}${closer.canOpen}`;\n    const bottom = openersBottom[bottomKey] ?? -1;\n    let foundOpener = false;\n    for (let openIdx = currentPos - 1; openIdx > bottom; openIdx--) {\n      const opener = delimiters[openIdx];\n      if (!opener.active || !opener.canOpen || opener.length === 0 || opener.char !== closer.char) {\n        continue;\n      }\n\n      // Rule of 3\n      if (opener.canClose || closer.canOpen) {\n        const sum = opener.originalLength + closer.originalLength;\n        if (sum % 3 === 0 && opener.originalLength % 3 !== 0 && closer.originalLength % 3 !== 0) {\n          continue;\n        }\n      }\n      const maxLen = Math.min(opener.length, closer.length);\n      const matchedTag = Object.keys(transformersIndex.transformersByTag).filter(t => t[0] === opener.char && t.length <= maxLen).sort((a, b) => b.length - a.length)[0];\n      if (!matchedTag) {\n        continue;\n      }\n      foundOpener = true;\n      const matchLen = matchedTag.length;\n      const match = {\n        content: text.slice(opener.index + opener.length, closer.index),\n        endIndex: closer.index + matchLen,\n        startIndex: opener.index + (opener.length - matchLen),\n        tag: matchedTag\n      };\n      if (!result || match.startIndex < result.startIndex || match.startIndex === result.startIndex && match.endIndex > result.endIndex) {\n        result = match;\n      }\n      for (let j = openIdx + 1; j < currentPos; j++) {\n        delimiters[j].active = false;\n      }\n      opener.length -= matchLen;\n      closer.length -= matchLen;\n      opener.active = opener.length > 0;\n      if (closer.length > 0) {\n        closer.index += matchLen;\n      } else {\n        closer.active = false;\n        currentPos++;\n      }\n      break;\n    }\n    if (!foundOpener) {\n      openersBottom[bottomKey] = currentPos - 1;\n      if (!closer.canOpen) {\n        closer.active = false;\n      }\n      currentPos++;\n    }\n  }\n  return result;\n}\nfunction canEmphasis(char, text, index, length, isOpen) {\n  if (!isFlanking(text, index, length, isOpen)) {\n    return false;\n  }\n  if (char === '*') {\n    return true;\n  }\n  if (char === '_') {\n    if (!isFlanking(text, index, length, !isOpen)) {\n      return true;\n    }\n    const adjacentChar = isOpen ? text[index - 1] : text[index + length];\n    return adjacentChar !== undefined && PUNCTUATION.test(adjacentChar);\n  }\n  return true;\n}\nfunction isFlanking(text, index, length, isLeft) {\n  const charBefore = text[index - 1];\n  const charAfter = text[index + length];\n  const [primary, secondary] = isLeft ? [charAfter, charBefore] : [charBefore, charAfter];\n  if (primary === undefined || WHITESPACE.test(primary)) {\n    return false;\n  }\n  if (!PUNCTUATION.test(primary)) {\n    return true;\n  }\n  return secondary === undefined || WHITESPACE.test(secondary) || PUNCTUATION.test(secondary);\n}\nfunction importTextFormatTransformer(textNode, startIndex, endIndex, transformer, match) {\n  const textContent = textNode.getTextContent();\n\n  // No text matches - we can safely process the text format match\n  let transformedNode, nodeAfter, nodeBefore;\n\n  // If matching full content there's no need to run splitText and can reuse existing textNode\n  // to update its content and apply format. E.g. for **_Hello_** string after applying bold\n  // format (**) it will reuse the same text node to apply italic (_)\n  if (match[0] === textContent) {\n    transformedNode = textNode;\n  } else {\n    if (startIndex === 0) {\n      [transformedNode, nodeAfter] = textNode.splitText(endIndex);\n    } else {\n      [nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex);\n    }\n  }\n  transformedNode.setTextContent(match[2]);\n  if (transformer) {\n    for (const format of transformer.format) {\n      if (!transformedNode.hasFormat(format)) {\n        transformedNode.toggleFormat(format);\n      }\n    }\n  }\n  return {\n    nodeAfter: nodeAfter,\n    nodeBefore: nodeBefore,\n    transformedNode: transformedNode\n  };\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction findOutermostTextMatchTransformer(textNode_, textMatchTransformers) {\n  const textNode = textNode_;\n  let foundMatchStartIndex = undefined;\n  let foundMatchEndIndex = undefined;\n  let foundMatchTransformer = undefined;\n  let foundMatch = undefined;\n  for (const transformer of textMatchTransformers) {\n    if (!transformer.replace || !transformer.importRegExp) {\n      continue;\n    }\n    const match = textNode.getTextContent().match(transformer.importRegExp);\n    if (!match) {\n      continue;\n    }\n    const startIndex = match.index || 0;\n    const endIndex = transformer.getEndIndex ? transformer.getEndIndex(textNode, match) : startIndex + match[0].length;\n    if (endIndex === false) {\n      continue;\n    }\n    if (foundMatchStartIndex === undefined || foundMatchEndIndex === undefined ||\n    // Wraps previous match or is strictly before it.\n    startIndex < foundMatchStartIndex && (endIndex > foundMatchEndIndex || endIndex <= foundMatchStartIndex)) {\n      foundMatchStartIndex = startIndex;\n      foundMatchEndIndex = endIndex;\n      foundMatchTransformer = transformer;\n      foundMatch = match;\n    }\n  }\n  if (foundMatchStartIndex === undefined || foundMatchEndIndex === undefined || foundMatchTransformer === undefined || foundMatch === undefined) {\n    return null;\n  }\n  return {\n    endIndex: foundMatchEndIndex,\n    match: foundMatch,\n    startIndex: foundMatchStartIndex,\n    transformer: foundMatchTransformer\n  };\n}\nfunction importFoundTextMatchTransformer(textNode, startIndex, endIndex, transformer, match) {\n  let transformedNode, nodeAfter, nodeBefore;\n  if (startIndex === 0) {\n    [transformedNode, nodeAfter] = textNode.splitText(endIndex);\n  } else {\n    [nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex);\n  }\n  if (!transformer.replace) {\n    return null;\n  }\n  const potentialTransformedNode = transformer.replace(transformedNode, match);\n  return {\n    nodeAfter,\n    nodeBefore,\n    transformedNode: potentialTransformedNode || undefined\n  };\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n\n/**\n * Returns true if the node can contain transformable markdown.\n * Code nodes cannot contain transformable markdown.\n * For example, `code **bold**` should not be transformed to\n * <code>code <strong>bold</strong></code>.\n */\nfunction canContainTransformableMarkdown(node) {\n  return $isTextNode(node) && !node.hasFormat('code');\n}\n\n/**\n * Handles applying both text format and text match transformers.\n * It finds the outermost text format or text match and applies it,\n * then recursively calls itself to apply the next outermost transformer,\n * until there are no more transformers to apply.\n */\nfunction importTextTransformers(textNode, textFormatTransformersIndex, textMatchTransformers) {\n  let foundTextFormat = findOutermostTextFormatTransformer(textNode, textFormatTransformersIndex);\n  let foundTextMatch = findOutermostTextMatchTransformer(textNode, textMatchTransformers);\n  if (foundTextFormat && foundTextMatch) {\n    // Find the outermost transformer\n    if (foundTextFormat.startIndex <= foundTextMatch.startIndex && foundTextFormat.endIndex >= foundTextMatch.endIndex ||\n    // foundTextMatch is not contained within foundTextFormat\n    foundTextMatch.startIndex > foundTextFormat.endIndex) {\n      // foundTextFormat wraps foundTextMatch - apply foundTextFormat by setting foundTextMatch to null\n      foundTextMatch = null;\n    } else {\n      // foundTextMatch wraps foundTextFormat - apply foundTextMatch by setting foundTextFormat to null\n      foundTextFormat = null;\n    }\n  }\n  if (foundTextFormat) {\n    const result = importTextFormatTransformer(textNode, foundTextFormat.startIndex, foundTextFormat.endIndex, foundTextFormat.transformer, foundTextFormat.match);\n    if (canContainTransformableMarkdown(result.nodeAfter)) {\n      importTextTransformers(result.nodeAfter, textFormatTransformersIndex, textMatchTransformers);\n    }\n    if (canContainTransformableMarkdown(result.nodeBefore)) {\n      importTextTransformers(result.nodeBefore, textFormatTransformersIndex, textMatchTransformers);\n    }\n    if (canContainTransformableMarkdown(result.transformedNode)) {\n      importTextTransformers(result.transformedNode, textFormatTransformersIndex, textMatchTransformers);\n    }\n  } else if (foundTextMatch) {\n    const result = importFoundTextMatchTransformer(textNode, foundTextMatch.startIndex, foundTextMatch.endIndex, foundTextMatch.transformer, foundTextMatch.match);\n    if (!result) {\n      return;\n    }\n    if (canContainTransformableMarkdown(result.nodeAfter)) {\n      importTextTransformers(result.nodeAfter, textFormatTransformersIndex, textMatchTransformers);\n    }\n    if (canContainTransformableMarkdown(result.nodeBefore)) {\n      importTextTransformers(result.nodeBefore, textFormatTransformersIndex, textMatchTransformers);\n    }\n    if (canContainTransformableMarkdown(result.transformedNode)) {\n      importTextTransformers(result.transformedNode, textFormatTransformersIndex, textMatchTransformers);\n    }\n  }\n\n  // Handle escape characters\n  const textContent = textNode.getTextContent();\n  const unescapedText = unescapeText(textContent);\n  textNode.setTextContent(unescapedText);\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n/**\n * Renders markdown from a string. The selection is moved to the start after the operation.\n */\nfunction createMarkdownImport(transformers, shouldPreserveNewLines = false) {\n  const byType = transformersByType(transformers);\n  const textFormatTransformersIndex = createTextFormatTransformersIndex(byType.textFormat);\n  return (markdownString, node) => {\n    const lines = markdownString.split('\\n');\n    const linesLength = lines.length;\n    const root = node || $getRoot();\n    root.clear();\n    for (let i = 0; i < linesLength; i++) {\n      const lineText = lines[i];\n      const [imported, shiftedIndex] = $importMultiline(lines, i, byType.multilineElement, root);\n      if (imported) {\n        // If a multiline markdown element was imported, we don't want to process the lines that were part of it anymore.\n        // There could be other sub-markdown elements (both multiline and normal ones) matching within this matched multiline element's children.\n        // However, it would be the responsibility of the matched multiline transformer to decide how it wants to handle them.\n        // We cannot handle those, as there is no way for us to know how to maintain the correct order of generated lexical nodes for possible children.\n        i = shiftedIndex; // Next loop will start from the line after the last line of the multiline element\n        continue;\n      }\n      $importBlocks(lineText, root, byType.element, textFormatTransformersIndex, byType.textMatch, shouldPreserveNewLines);\n    }\n    const children = root.getChildren();\n    for (const child of children) {\n      // By default, removing empty paragraphs as md does not really\n      // allow empty lines and uses them as delimiter.\n      // If you need empty lines set shouldPreserveNewLines = true.\n      if (!shouldPreserveNewLines && isEmptyParagraph(child) && root.getChildrenSize() > 1) {\n        child.remove();\n        continue;\n      }\n      // Convert all '\\t' into TabNode.\n      if ($isElementNode(child)) {\n        for (const textNode of child.getAllTextNodes()) {\n          $normalizeMarkdownTextNode(textNode);\n        }\n      }\n    }\n    if ($getSelection() !== null) {\n      root.selectStart();\n    }\n  };\n}\n\n/**\n *\n * @returns first element of the returned tuple is a boolean indicating if a multiline element was imported. The second element is the index of the last line that was processed.\n */\nfunction $importMultiline(lines, startLineIndex, multilineElementTransformers, rootNode) {\n  for (const transformer of multilineElementTransformers) {\n    const {\n      handleImportAfterStartMatch,\n      regExpEnd,\n      regExpStart,\n      replace\n    } = transformer;\n    const startMatch = lines[startLineIndex].match(regExpStart);\n    if (!startMatch) {\n      continue; // Try next transformer\n    }\n    if (handleImportAfterStartMatch) {\n      const result = handleImportAfterStartMatch({\n        lines,\n        rootNode,\n        startLineIndex,\n        startMatch,\n        transformer\n      });\n      if (result === null) {\n        continue;\n      } else if (result) {\n        return result;\n      }\n    }\n    const regexpEndRegex = typeof regExpEnd === 'object' && 'regExp' in regExpEnd ? regExpEnd.regExp : regExpEnd;\n    const isEndOptional = regExpEnd && typeof regExpEnd === 'object' && 'optional' in regExpEnd ? regExpEnd.optional : !regExpEnd;\n    let endLineIndex = startLineIndex;\n    const linesLength = lines.length;\n\n    // check every single line for the closing match. It could also be on the same line as the opening match.\n    while (endLineIndex < linesLength) {\n      const endMatch = regexpEndRegex ? lines[endLineIndex].match(regexpEndRegex) : null;\n      if (!endMatch) {\n        if (!isEndOptional || isEndOptional && endLineIndex < linesLength - 1 // Optional end, but didn't reach the end of the document yet => continue searching for potential closing match\n        ) {\n          endLineIndex++;\n          continue; // Search next line for closing match\n        }\n      }\n\n      // Now, check if the closing match matched is the same as the opening match.\n      // If it is, we need to continue searching for the actual closing match.\n      if (endMatch && startLineIndex === endLineIndex && endMatch.index === startMatch.index) {\n        endLineIndex++;\n        continue; // Search next line for closing match\n      }\n\n      // At this point, we have found the closing match. Next: calculate the lines in between open and closing match\n      // This should not include the matches themselves, and be split up by lines\n      const linesInBetween = [];\n      if (endMatch && startLineIndex === endLineIndex) {\n        linesInBetween.push(lines[startLineIndex].slice(startMatch[0].length, -endMatch[0].length));\n      } else {\n        for (let i = startLineIndex; i <= endLineIndex; i++) {\n          if (i === startLineIndex) {\n            const text = lines[i].slice(startMatch[0].length);\n            linesInBetween.push(text); // Also include empty text\n          } else if (i === endLineIndex && endMatch) {\n            const text = lines[i].slice(0, -endMatch[0].length);\n            linesInBetween.push(text); // Also include empty text\n          } else {\n            linesInBetween.push(lines[i]);\n          }\n        }\n      }\n      if (replace(rootNode, null, startMatch, endMatch, linesInBetween, true) !== false) {\n        // Return here. This $importMultiline function is run line by line and should only process a single multiline element at a time.\n        return [true, endLineIndex];\n      }\n\n      // The replace function returned false, despite finding the matching open and close tags => this transformer does not want to handle it.\n      // Thus, we continue letting the remaining transformers handle the passed lines of text from the beginning\n      break;\n    }\n  }\n\n  // No multiline transformer handled this line successfully\n  return [false, startLineIndex];\n}\nfunction $importBlocks(lineText, rootNode, elementTransformers, textFormatTransformersIndex, textMatchTransformers, shouldPreserveNewLines) {\n  const textNode = $createTextNode(lineText);\n  const elementNode = $createParagraphNode();\n  elementNode.append(textNode);\n  rootNode.append(elementNode);\n  for (const {\n    regExp,\n    replace\n  } of elementTransformers) {\n    const match = lineText.match(regExp);\n    if (match) {\n      textNode.setTextContent(lineText.slice(match[0].length));\n      if (replace(elementNode, [textNode], match, true) !== false) {\n        break;\n      }\n    }\n  }\n  importTextTransformers(textNode, textFormatTransformersIndex, textMatchTransformers);\n\n  // If no transformer found and we left with original paragraph node\n  // can check if its content can be appended to the previous node\n  // if it's a paragraph, quote or list\n  if (elementNode.isAttached() && lineText.length > 0) {\n    const previousNode = elementNode.getPreviousSibling();\n    if (!shouldPreserveNewLines && (\n    // Only append if we're not preserving newlines\n    $isParagraphNode(previousNode) || $isQuoteNode(previousNode) || $isListNode(previousNode))) {\n      let targetNode = previousNode;\n      if ($isListNode(previousNode)) {\n        const lastDescendant = previousNode.getLastDescendant();\n        if (lastDescendant == null) {\n          targetNode = null;\n        } else {\n          targetNode = $findMatchingParent(lastDescendant, $isListItemNode);\n        }\n      }\n      if (targetNode != null && targetNode.getTextContentSize() > 0) {\n        const lastChild = targetNode.getLastChild();\n        if ($isTextNode(lastChild)) {\n          const lastText = lastChild.getTextContent();\n          if (lastText.endsWith('\\\\')) {\n            lastChild.setTextContent(lastText.slice(0, -1));\n          } else if (/ {2,}$/.test(lastText)) {\n            lastChild.setTextContent(lastText.replace(/ {2,}$/, ''));\n          }\n        }\n        targetNode.splice(targetNode.getChildrenSize(), 0, [$createLineBreakNode(), ...elementNode.getChildren()]);\n        elementNode.remove();\n      }\n    }\n  }\n}\n\n// Look in node for '\\t' and create a TabNode for each occurrence.\nfunction $normalizeMarkdownTextNode(textNode) {\n  const tabOffsets = new Set();\n  const text = textNode.getTextContent();\n  let index = text.indexOf('\\t');\n\n  // Find all tab occurrences\n  while (index !== -1) {\n    tabOffsets.add(index);\n    tabOffsets.add(index + 1);\n    index = text.indexOf('\\t', index + 1);\n  }\n\n  // Split node to isolate each tab then replace '\\t' into TabNode\n  const splitNodes = textNode.splitText(...tabOffsets);\n  splitNodes.forEach(node => {\n    if (node.getTextContent() === '\\t') {\n      node.replace($createTabNode());\n    }\n  });\n}\nfunction createTextFormatTransformersIndex(textTransformers) {\n  const transformersByTag = {};\n  const fullMatchRegExpByTag = {};\n  const openTagsRegExp = [];\n  for (const transformer of textTransformers) {\n    const {\n      tag\n    } = transformer;\n    transformersByTag[tag] = transformer;\n    const tagRegExp = tag.replace(/(\\*|\\^|\\+)/g, '\\\\$1');\n    openTagsRegExp.push(tagRegExp);\n\n    // Single-char tag (e.g. \"*\")\n    if (tag.length === 1) {\n      if (tag === '`') {\n        // Capture the preceding character in group 1 (empty string at start-of-string\n        // via the ^ branch) rather than using a negative lookbehind, which is not\n        // supported in Safari < 16.4. Consumers must add match[1].length to\n        // match.index to find the real start of the span (see importTextFormatTransformer.ts).\n        fullMatchRegExpByTag[tag] = new RegExp(`(^|[^\\\\\\\\\\`])(\\`)((?:\\\\\\\\\\`|[^\\`])+?)(\\`)(?!\\`)`);\n      } else {\n        fullMatchRegExpByTag[tag] = new RegExp(`(^|[^\\\\\\\\${tagRegExp}])(${tagRegExp})((\\\\\\\\${tagRegExp})?.*?[^${tagRegExp}\\\\s](\\\\\\\\${tagRegExp})?)(${tagRegExp})(?![\\\\\\\\${tagRegExp}])`);\n      }\n    } else {\n      // Multi-char tags (e.g. \"**\")\n      fullMatchRegExpByTag[tag] = new RegExp(`(^|[^\\\\\\\\])(${tagRegExp})((\\\\\\\\${tagRegExp})?.*?[^\\\\s](\\\\\\\\${tagRegExp})?)(${tagRegExp})(?!\\\\\\\\)`);\n    }\n  }\n  return {\n    // Reg exp to find open tag + content + close tag\n    fullMatchRegExpByTag,\n    // Regexp to locate *any* potential opening tag (longest first).\n    // The former (?<!\\\\) escape guard has been removed — the delimiter\n    // scanner's isEscaped() check handles escape filtering at match time.\n    openTagsRegExp: new RegExp(`(${openTagsRegExp.join('|')})`, 'g'),\n    transformersByTag\n  };\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n// Do not require this module directly! Use normal `invariant` calls.\n\nfunction formatDevErrorMessage(message) {\n  throw new Error(message);\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nconst ORDERED_LIST_REGEX = /^(\\s*)(\\d{1,})\\.\\s/;\nconst UNORDERED_LIST_REGEX = /^(\\s*)[-*+]\\s/;\nconst CHECK_LIST_REGEX = /^(\\s*)(?:[-*+]\\s)?\\s?(\\[(\\s|x)?\\])\\s/i;\nconst HEADING_REGEX = /^(#{1,6})\\s/;\nconst QUOTE_REGEX = /^>\\s/;\nconst CODE_START_REGEX = /^([ \\t]*`{3,})([\\w-]+)?[ \\t]?/;\nconst CODE_END_REGEX = /^[ \\t]*`{3,}$/;\nconst CODE_SINGLE_LINE_REGEX = /^[ \\t]*```[^`]+(?:(?:`{1,2}|`{4,})[^`]+)*```(?:[^`]|$)/;\nconst TABLE_ROW_REG_EXP = /^(?:\\|)(.+)(?:\\|)\\s?$/;\nconst TABLE_ROW_DIVIDER_REG_EXP = /^(\\| ?:?-*:? ?)+\\|\\s?$/;\nconst TAG_START_REGEX = /^<[a-z_][\\w-]*(?:\\s[^<>]*)?\\/?>/i;\nconst TAG_END_REGEX = /^<\\/[a-z_][\\w-]*\\s*>/i;\nconst ENDS_WITH = regex => new RegExp(`(?:${regex.source})$`, regex.flags);\nconst listMarkerState = createState('mdListMarker', {\n  parse: v => typeof v === 'string' && /^[-*+]$/.test(v) ? v : '-',\n  resetOnCopyNode: true\n});\nconst codeFenceState = createState('mdCodeFence', {\n  parse: val => {\n    if (typeof val === 'string' && /^`{3,}$/.test(val)) {\n      return val;\n    }\n    return '```';\n  },\n  resetOnCopyNode: true\n});\nconst createBlockNode = createNode => {\n  return (parentNode, children, match, isImport) => {\n    const node = createNode(match);\n    node.append(...children);\n    parentNode.replace(node);\n    if (!isImport) {\n      node.select(0, 0);\n    }\n  };\n};\n\n// Amount of spaces that define indentation level\n// TODO: should be an option\nconst LIST_INDENT_SIZE = 4;\nfunction getIndent(whitespaces) {\n  const tabs = whitespaces.match(/\\t/g);\n  const spaces = whitespaces.match(/ /g);\n  let indent = 0;\n  if (tabs) {\n    indent += tabs.length;\n  }\n  if (spaces) {\n    indent += Math.floor(spaces.length / LIST_INDENT_SIZE);\n  }\n  return indent;\n}\nconst listReplace = listType => {\n  return (parentNode, children, match, isImport) => {\n    const previousNode = parentNode.getPreviousSibling();\n    const nextNode = parentNode.getNextSibling();\n    const listItem = $createListItemNode(listType === 'check' ? match[3] === 'x' : undefined);\n    const firstMatchChar = match[0].trim()[0];\n    const listMarker = (listType === 'bullet' || listType === 'check') && firstMatchChar === listMarkerState.parse(firstMatchChar) ? firstMatchChar : undefined;\n    if ($isListNode(nextNode) && nextNode.getListType() === listType) {\n      if (listMarker) {\n        $setState(nextNode, listMarkerState, listMarker);\n      }\n      const firstChild = nextNode.getFirstChild();\n      if (firstChild !== null) {\n        firstChild.insertBefore(listItem);\n      } else {\n        // should never happen, but let's handle gracefully, just in case.\n        nextNode.append(listItem);\n      }\n      parentNode.remove();\n    } else if ($isListNode(previousNode) && previousNode.getListType() === listType) {\n      if (listMarker) {\n        $setState(previousNode, listMarkerState, listMarker);\n      }\n      previousNode.append(listItem);\n      parentNode.remove();\n    } else {\n      const list = $createListNode(listType, listType === 'number' ? Number(match[2]) : undefined);\n      if (listMarker) {\n        $setState(list, listMarkerState, listMarker);\n      }\n      list.append(listItem);\n      parentNode.replace(list);\n    }\n    listItem.append(...children);\n    if (!isImport) {\n      listItem.select(0, 0);\n    }\n    const indent = getIndent(match[1]);\n    if (indent) {\n      listItem.setIndent(indent);\n    }\n  };\n};\nconst $listExport = (listNode, exportChildren, depth) => {\n  const output = [];\n  const children = listNode.getChildren();\n  let index = 0;\n  for (const listItemNode of children) {\n    if ($isListItemNode(listItemNode)) {\n      if (listItemNode.getChildrenSize() === 1) {\n        const firstChild = listItemNode.getFirstChild();\n        if ($isListNode(firstChild)) {\n          output.push($listExport(firstChild, exportChildren, depth + 1));\n          continue;\n        }\n      }\n      const indent = ' '.repeat(depth * LIST_INDENT_SIZE);\n      const listType = listNode.getListType();\n      const listMarker = $getState(listNode, listMarkerState);\n      const prefix = listType === 'number' ? `${listNode.getStart() + index}. ` : listType === 'check' ? `${listMarker} [${listItemNode.getChecked() ? 'x' : ' '}] ` : listMarker + ' ';\n      let childrenText = exportChildren(listItemNode);\n      if (listType !== 'number') {\n        childrenText = childrenText.replace(/^(\\s{0,3}\\d+)(\\.\\s)/, '$1\\\\$2');\n      }\n      output.push(indent + prefix + childrenText);\n      index++;\n    }\n  }\n  return output.join('\\n');\n};\nconst HEADING = {\n  dependencies: [HeadingNode],\n  export: (node, exportChildren) => {\n    if (!$isHeadingNode(node)) {\n      return null;\n    }\n    const level = Number(node.getTag().slice(1));\n    return '#'.repeat(level) + ' ' + exportChildren(node);\n  },\n  regExp: HEADING_REGEX,\n  replace: createBlockNode(match => {\n    const tag = 'h' + match[1].length;\n    return $createHeadingNode(tag);\n  }),\n  type: 'element'\n};\nconst QUOTE = {\n  dependencies: [QuoteNode],\n  export: (node, exportChildren) => {\n    if (!$isQuoteNode(node)) {\n      return null;\n    }\n    const lines = exportChildren(node).split('\\n');\n    const output = [];\n    for (const line of lines) {\n      output.push('> ' + line);\n    }\n    return output.join('\\n');\n  },\n  regExp: QUOTE_REGEX,\n  replace: (parentNode, children, _match, isImport) => {\n    if (isImport) {\n      const previousNode = parentNode.getPreviousSibling();\n      if ($isQuoteNode(previousNode)) {\n        previousNode.splice(previousNode.getChildrenSize(), 0, [$createLineBreakNode(), ...children]);\n        parentNode.remove();\n        return;\n      }\n    }\n    const node = $createQuoteNode();\n    node.append(...children);\n    parentNode.replace(node);\n    if (!isImport) {\n      node.select(0, 0);\n    }\n  },\n  type: 'element'\n};\nconst CODE = {\n  dependencies: [CodeNode],\n  export: node => {\n    if (!$isCodeNode(node)) {\n      return null;\n    }\n    const textContent = node.getTextContent();\n    let fence = $getState(node, codeFenceState);\n    if (textContent.indexOf(fence) > -1) {\n      const backticks = textContent.match(/`{3,}/g);\n      if (backticks) {\n        const maxLength = Math.max(...backticks.map(b => b.length));\n        fence = '`'.repeat(maxLength + 1);\n      }\n    }\n    return fence + (node.getLanguage() || '') + (textContent ? '\\n' + textContent : '') + '\\n' + fence;\n  },\n  handleImportAfterStartMatch: ({\n    lines,\n    rootNode,\n    startLineIndex,\n    startMatch\n  }) => {\n    const fence = startMatch[1];\n    const fenceLength = fence.trim().length;\n    const currentLine = lines[startLineIndex];\n    const afterFenceIndex = startMatch.index + fence.length;\n    const afterFence = currentLine.slice(afterFenceIndex);\n    const singleLineEndRegex = new RegExp(`\\`{${fenceLength},}$`);\n    if (singleLineEndRegex.test(afterFence)) {\n      const endMatch = afterFence.match(singleLineEndRegex);\n      const content = afterFence.slice(0, afterFence.lastIndexOf(endMatch[0]));\n      const fakeStartMatch = [...startMatch];\n      fakeStartMatch[2] = '';\n      CODE.replace(rootNode, null, fakeStartMatch, endMatch, [content], true);\n      return [true, startLineIndex];\n    }\n    const multilineEndRegex = new RegExp(`^[ \\\\t]*\\`{${fenceLength},}$`);\n    for (let i = startLineIndex + 1; i < lines.length; i++) {\n      const line = lines[i];\n      if (multilineEndRegex.test(line)) {\n        const endMatch = line.match(multilineEndRegex);\n        const linesInBetween = lines.slice(startLineIndex + 1, i);\n        const afterFullMatch = currentLine.slice(startMatch[0].length);\n        if (afterFullMatch.length > 0) {\n          linesInBetween.unshift(afterFullMatch);\n        }\n        CODE.replace(rootNode, null, startMatch, endMatch, linesInBetween, true);\n        return [true, i];\n      }\n    }\n    const linesInBetween = lines.slice(startLineIndex + 1);\n    const afterFullMatch = currentLine.slice(startMatch[0].length);\n    if (afterFullMatch.length > 0) {\n      linesInBetween.unshift(afterFullMatch);\n    }\n    CODE.replace(rootNode, null, startMatch, null, linesInBetween, true);\n    return [true, lines.length - 1];\n  },\n  regExpEnd: {\n    optional: true,\n    regExp: CODE_END_REGEX\n  },\n  regExpStart: CODE_START_REGEX,\n  replace: (rootNode, children, startMatch, endMatch, linesInBetween, isImport) => {\n    let codeBlockNode;\n    let code;\n    const fence = startMatch[1] ? startMatch[1].trim() : '```';\n    const language = startMatch[2] || undefined;\n    if (!children && linesInBetween) {\n      if (linesInBetween.length === 1) {\n        if (endMatch) {\n          codeBlockNode = $createCodeNode(language);\n          code = linesInBetween[0];\n        } else {\n          codeBlockNode = $createCodeNode(language);\n          code = linesInBetween[0].startsWith(' ') ? linesInBetween[0].slice(1) : linesInBetween[0];\n        }\n      } else {\n        codeBlockNode = $createCodeNode(language);\n        if (linesInBetween.length > 0) {\n          if (linesInBetween[0].trim().length === 0) {\n            linesInBetween.shift();\n          } else if (linesInBetween[0].startsWith(' ')) {\n            linesInBetween[0] = linesInBetween[0].slice(1);\n          }\n        }\n        while (linesInBetween.length > 0 && !linesInBetween[linesInBetween.length - 1].length) {\n          linesInBetween.pop();\n        }\n        code = linesInBetween.join('\\n');\n      }\n      $setState(codeBlockNode, codeFenceState, fence);\n      const textNode = $createTextNode(code);\n      codeBlockNode.append(textNode);\n      rootNode.append(codeBlockNode);\n    } else if (children) {\n      createBlockNode(match => {\n        return $createCodeNode(match ? match[2] : undefined);\n      })(rootNode, children, startMatch, isImport);\n    }\n  },\n  type: 'multiline-element'\n};\nconst UNORDERED_LIST = {\n  dependencies: [ListNode, ListItemNode],\n  export: (node, exportChildren) => {\n    return $isListNode(node) ? $listExport(node, exportChildren, 0) : null;\n  },\n  regExp: UNORDERED_LIST_REGEX,\n  replace: listReplace('bullet'),\n  type: 'element'\n};\nconst CHECK_LIST = {\n  dependencies: [ListNode, ListItemNode],\n  export: (node, exportChildren) => {\n    return $isListNode(node) ? $listExport(node, exportChildren, 0) : null;\n  },\n  regExp: CHECK_LIST_REGEX,\n  replace: listReplace('check'),\n  type: 'element'\n};\nconst ORDERED_LIST = {\n  dependencies: [ListNode, ListItemNode],\n  export: (node, exportChildren) => {\n    return $isListNode(node) ? $listExport(node, exportChildren, 0) : null;\n  },\n  regExp: ORDERED_LIST_REGEX,\n  replace: listReplace('number'),\n  type: 'element'\n};\nconst INLINE_CODE = {\n  format: ['code'],\n  tag: '`',\n  type: 'text-format'\n};\nconst HIGHLIGHT = {\n  format: ['highlight'],\n  tag: '==',\n  type: 'text-format'\n};\nconst BOLD_ITALIC_STAR = {\n  format: ['bold', 'italic'],\n  tag: '***',\n  type: 'text-format'\n};\nconst BOLD_ITALIC_UNDERSCORE = {\n  format: ['bold', 'italic'],\n  intraword: false,\n  tag: '___',\n  type: 'text-format'\n};\nconst BOLD_STAR = {\n  format: ['bold'],\n  tag: '**',\n  type: 'text-format'\n};\nconst BOLD_UNDERSCORE = {\n  format: ['bold'],\n  intraword: false,\n  tag: '__',\n  type: 'text-format'\n};\nconst STRIKETHROUGH = {\n  format: ['strikethrough'],\n  tag: '~~',\n  type: 'text-format'\n};\nconst ITALIC_STAR = {\n  format: ['italic'],\n  tag: '*',\n  type: 'text-format'\n};\nconst ITALIC_UNDERSCORE = {\n  format: ['italic'],\n  intraword: false,\n  tag: '_',\n  type: 'text-format'\n};\n\n// Order of text transformers matters:\n//\n// - code should go first as it prevents any transformations inside\n// - then longer tags match (e.g. ** or __ should go before * or _)\nconst LINK = {\n  dependencies: [LinkNode],\n  export: (node, exportChildren, exportFormat) => {\n    if (!$isLinkNode(node) || $isAutoLinkNode(node)) {\n      return null;\n    }\n    const textContent = exportChildren(node);\n    let title = node.getTitle();\n    if (title != null) {\n      title = title.replace(/([\\\\\"])/g, '\\\\$1');\n    }\n    const linkContent = title ? `[${textContent}](${node.getURL()} \"${title}\")` : `[${textContent}](${node.getURL()})`;\n    return linkContent;\n  },\n  importRegExp: /(?:\\[(.+?)\\])(?:\\((?:([^()\\s]+)(?:\\s\"((?:[^\"]*\\\\\")*[^\"]*)\"\\s*)?)\\))/,\n  regExp: /(?:\\[([^[\\]]*(?:\\[[^[\\]]*\\][^[\\]]*)*)\\])(?:\\((?:([^()\\s]+)(?:\\s\"((?:[^\"]*\\\\\")*[^\"]*)\"\\s*)?)\\))$/,\n  replace: (textNode, match) => {\n    // https://spec.commonmark.org/0.31.2/#inline-link\n    if ($findMatchingParent$1(textNode, $isLinkNode)) {\n      return;\n    }\n    const [, linkText, rawLinkUrl, rawLinkTitle] = match;\n    const linkUrl = rawLinkUrl != null ? unescapeText(rawLinkUrl) : undefined;\n    const linkTitle = rawLinkTitle != null ? unescapeText(rawLinkTitle) : undefined;\n    const linkNode = $createLinkNode(linkUrl, {\n      title: linkTitle\n    });\n    const openBracketAmount = linkText.split('[').length - 1;\n    const closeBracketAmount = linkText.split(']').length - 1;\n    let parsedLinkText = linkText;\n    let outsideLinkText = '';\n    if (openBracketAmount < closeBracketAmount) {\n      return;\n    } else if (openBracketAmount > closeBracketAmount) {\n      const linkTextParts = linkText.split('[');\n      outsideLinkText = '[' + linkTextParts[0];\n      parsedLinkText = linkTextParts.slice(1).join('[');\n    }\n    const linkTextNode = $createTextNode(parsedLinkText);\n    linkTextNode.setFormat(textNode.getFormat());\n    linkNode.append(linkTextNode);\n    textNode.replace(linkNode);\n    if (outsideLinkText) {\n      linkNode.insertBefore($createTextNode(outsideLinkText));\n    }\n    return linkTextNode;\n  },\n  trigger: ')',\n  type: 'text-match'\n};\nconst ELEMENT_TRANSFORMERS = [HEADING, QUOTE, UNORDERED_LIST, ORDERED_LIST];\nconst MULTILINE_ELEMENT_TRANSFORMERS = [CODE];\n\n// Order of text format transformers matters:\n//\n// - code should go first as it prevents any transformations inside\n// - then longer tags match (e.g. ** or __ should go before * or _)\nconst TEXT_FORMAT_TRANSFORMERS = [INLINE_CODE, BOLD_ITALIC_STAR, BOLD_ITALIC_UNDERSCORE, BOLD_STAR, BOLD_UNDERSCORE, HIGHLIGHT, ITALIC_STAR, ITALIC_UNDERSCORE, STRIKETHROUGH];\nconst TEXT_MATCH_TRANSFORMERS = [LINK];\nconst TRANSFORMERS = [...ELEMENT_TRANSFORMERS, ...MULTILINE_ELEMENT_TRANSFORMERS, ...TEXT_FORMAT_TRANSFORMERS, ...TEXT_MATCH_TRANSFORMERS];\nfunction normalizeMarkdown(input, shouldMergeAdjacentLines = false) {\n  const lines = input.split('\\n');\n  let inCodeBlock = false;\n  const sanitizedLines = [];\n  for (let i = 0; i < lines.length; i++) {\n    const rawLine = lines[i];\n    const line = rawLine.trimEnd();\n    const lastLine = sanitizedLines[sanitizedLines.length - 1];\n\n    // Code blocks of ```single line``` don't toggle the inCodeBlock flag\n    if (CODE_SINGLE_LINE_REGEX.test(line)) {\n      sanitizedLines.push(line);\n      continue;\n    }\n\n    // Detect the start or end of a code block\n    if (CODE_START_REGEX.test(line) || CODE_END_REGEX.test(line)) {\n      inCodeBlock = !inCodeBlock;\n      sanitizedLines.push(line);\n      continue;\n    }\n\n    // If we are inside a code block, keep the line unchanged\n    if (inCodeBlock) {\n      sanitizedLines.push(rawLine);\n      continue;\n    }\n\n    // In markdown the concept of \"empty paragraphs\" does not exist.\n    // Blocks must be separated by an empty line. Non-empty adjacent lines must be merged.\n    if (line === '' || lastLine === '' || !lastLine || HEADING_REGEX.test(lastLine) || HEADING_REGEX.test(line) || QUOTE_REGEX.test(line) || ORDERED_LIST_REGEX.test(line) || UNORDERED_LIST_REGEX.test(line) || CHECK_LIST_REGEX.test(line) || TABLE_ROW_REG_EXP.test(line) || TABLE_ROW_DIVIDER_REG_EXP.test(line) || !shouldMergeAdjacentLines || TAG_START_REGEX.test(line) || TAG_END_REGEX.test(line) || ENDS_WITH(TAG_END_REGEX).test(lastLine) || ENDS_WITH(TAG_START_REGEX).test(lastLine) || CODE_END_REGEX.test(lastLine)) {\n      // When not merging, preserve trailing whitespace (e.g. hard line-break\n      // markers \"  \" or non-breaking spaces). Whitespace-only lines still\n      // collapse to '' because trimEnd() already reduced them, so they\n      // continue to act as paragraph separators.\n      sanitizedLines.push(!shouldMergeAdjacentLines && line !== '' ? rawLine : line);\n    } else {\n      sanitizedLines[sanitizedLines.length - 1] = lastLine + ' ' + line.trimStart();\n    }\n  }\n  return sanitizedLines.join('\\n');\n}\n\nfunction runElementTransformers(parentNode, anchorNode, anchorOffset, elementTransformers) {\n  const grandParentNode = parentNode.getParent();\n  if (!$isRootOrShadowRoot(grandParentNode) || parentNode.getFirstChild() !== anchorNode) {\n    return false;\n  }\n  const textContent = anchorNode.getTextContent();\n\n  // Checking for anchorOffset position to prevent any checks for cases when caret is too far\n  // from a line start to be a part of block-level markdown trigger.\n  //\n  // TODO:\n  // Can have a quick check if caret is close enough to the beginning of the string (e.g. offset less than 10-20)\n  // since otherwise it won't be a markdown shortcut, but tables are exception\n  if (textContent[anchorOffset - 1] !== ' ') {\n    return false;\n  }\n  for (const {\n    regExp,\n    replace\n  } of elementTransformers) {\n    const match = textContent.match(regExp);\n    if (match && match[0].length === (match[0].endsWith(' ') ? anchorOffset : anchorOffset - 1)) {\n      const nextSiblings = anchorNode.getNextSiblings();\n      const [leadingNode, remainderNode] = anchorNode.splitText(anchorOffset);\n      const siblings = remainderNode ? [remainderNode, ...nextSiblings] : nextSiblings;\n      if (replace(parentNode, siblings, match, false) !== false) {\n        leadingNode.remove();\n        return true;\n      }\n    }\n  }\n  return false;\n}\nfunction runMultilineElementTransformers(parentNode, anchorNode, anchorOffset, elementTransformers, triggerOnEnter) {\n  const grandParentNode = parentNode.getParent();\n  if (!$isRootOrShadowRoot(grandParentNode) || parentNode.getFirstChild() !== anchorNode) {\n    return false;\n  }\n  const textContent = anchorNode.getTextContent();\n  if (!triggerOnEnter) {\n    // Checking for anchorOffset position to prevent any checks for cases when caret is too far\n    // from a line start to be a part of block-level markdown trigger.\n    //\n    // TODO:\n    // Can have a quick check if caret is close enough to the beginning of the string (e.g. offset less than 10-20)\n    // since otherwise it won't be a markdown shortcut, but tables are exception\n    if (textContent[anchorOffset - 1] !== ' ') {\n      return false;\n    }\n  }\n  for (const {\n    regExpStart,\n    replace,\n    regExpEnd\n  } of elementTransformers) {\n    if (regExpEnd && !('optional' in regExpEnd) || regExpEnd && 'optional' in regExpEnd && !regExpEnd.optional) {\n      continue;\n    }\n    const match = textContent.match(regExpStart);\n    if (match) {\n      const matchLength = triggerOnEnter || match[0].endsWith(' ') ? anchorOffset : anchorOffset - 1;\n      if (match[0].length !== matchLength) {\n        continue;\n      }\n      const nextSiblings = anchorNode.getNextSiblings();\n      const [leadingNode, remainderNode] = anchorNode.splitText(anchorOffset);\n      const siblings = remainderNode ? [remainderNode, ...nextSiblings] : nextSiblings;\n      if (replace(parentNode, siblings, match, null, null, false) !== false) {\n        leadingNode.remove();\n        return true;\n      }\n    }\n  }\n  return false;\n}\nfunction runTextMatchTransformers(anchorNode, anchorOffset, transformersByTrigger) {\n  let textContent = anchorNode.getTextContent();\n  const lastChar = textContent[anchorOffset - 1];\n  const transformers = transformersByTrigger[lastChar];\n  if (transformers == null) {\n    return false;\n  }\n\n  // If typing in the middle of content, remove the tail to do\n  // reg exp match up to a string end (caret position)\n  if (anchorOffset < textContent.length) {\n    textContent = textContent.slice(0, anchorOffset);\n  }\n  for (const transformer of transformers) {\n    if (!transformer.replace || !transformer.regExp) {\n      continue;\n    }\n    const match = textContent.match(transformer.regExp);\n    if (match === null) {\n      continue;\n    }\n    const startIndex = match.index || 0;\n    const endIndex = startIndex + match[0].length;\n    let replaceNode;\n    if (startIndex === 0) {\n      [replaceNode] = anchorNode.splitText(endIndex);\n    } else {\n      [, replaceNode] = anchorNode.splitText(startIndex, endIndex);\n    }\n    replaceNode.selectNext(0, 0);\n    transformer.replace(replaceNode, match);\n    return true;\n  }\n  return false;\n}\nfunction $runTextFormatTransformers(anchorNode, anchorOffset, textFormatTransformers) {\n  const textContent = anchorNode.getTextContent();\n  const closeTagEndIndex = anchorOffset - 1;\n  const closeChar = textContent[closeTagEndIndex];\n  // Quick check if we're possibly at the end of inline markdown style\n  const matchers = textFormatTransformers[closeChar];\n  if (!matchers) {\n    return false;\n  }\n  for (const matcher of matchers) {\n    const {\n      tag\n    } = matcher;\n    const tagLength = tag.length;\n    const closeTagStartIndex = closeTagEndIndex - tagLength + 1;\n\n    // If tag is not single char check if rest of it matches with text content\n    if (tagLength > 1) {\n      if (!isEqualSubString(textContent, closeTagStartIndex, tag, 0, tagLength)) {\n        continue;\n      }\n    }\n\n    // Space before closing tag cancels inline markdown\n    if (textContent[closeTagStartIndex - 1] === ' ') {\n      continue;\n    }\n\n    // Some tags can not be used within words, hence should have newline/space/punctuation after it\n    const afterCloseTagChar = textContent[closeTagEndIndex + 1];\n    if (matcher.intraword === false && afterCloseTagChar && !PUNCTUATION_OR_SPACE.test(afterCloseTagChar)) {\n      continue;\n    }\n    const closeNode = anchorNode;\n    let openNode = closeNode;\n    let openTagStartIndex = getOpenTagStartIndex(textContent, closeTagStartIndex, tag);\n\n    // Go through text node siblings and search for opening tag\n    // if haven't found it within the same text node as closing tag\n    let sibling = openNode;\n    while (openTagStartIndex < 0 && (sibling = sibling.getPreviousSibling())) {\n      if ($isLineBreakNode(sibling)) {\n        break;\n      }\n      if ($isTextNode(sibling)) {\n        if (sibling.hasFormat('code')) {\n          continue;\n        }\n        const siblingTextContent = sibling.getTextContent();\n        openNode = sibling;\n        openTagStartIndex = getOpenTagStartIndex(siblingTextContent, siblingTextContent.length, tag);\n      }\n    }\n\n    // Opening tag is not found\n    if (openTagStartIndex < 0) {\n      continue;\n    }\n\n    // No content between opening and closing tag\n    if (openNode === closeNode && openTagStartIndex + tagLength === closeTagStartIndex) {\n      continue;\n    }\n\n    // Checking longer tags for repeating chars (e.g. *** vs **)\n    const prevOpenNodeText = openNode.getTextContent();\n    if (openTagStartIndex > 0 && prevOpenNodeText[openTagStartIndex - 1] === closeChar) {\n      continue;\n    }\n\n    // Some tags can not be used within words, hence should have newline/space/punctuation before it\n    const beforeOpenTagChar = prevOpenNodeText[openTagStartIndex - 1];\n    if (matcher.intraword === false && beforeOpenTagChar && !PUNCTUATION_OR_SPACE.test(beforeOpenTagChar)) {\n      continue;\n    }\n\n    // Per CommonMark, code spans take precedence over other inline formatting\n    if (!matcher.format.includes('code') && $isInsideUnclosedCodeSpan(openNode, openTagStartIndex)) {\n      continue;\n    }\n\n    // Clean text from opening and closing tags (starting from closing tag\n    // to prevent any offset shifts if we start from opening one)\n    const prevCloseNodeText = closeNode.getTextContent();\n    const closeNodeText = prevCloseNodeText.slice(0, closeTagStartIndex) + prevCloseNodeText.slice(closeTagEndIndex + 1);\n    closeNode.setTextContent(closeNodeText);\n    const openNodeText = openNode === closeNode ? closeNodeText : prevOpenNodeText;\n    openNode.setTextContent(openNodeText.slice(0, openTagStartIndex) + openNodeText.slice(openTagStartIndex + tagLength));\n    const selection = $getSelection();\n    const nextSelection = $createRangeSelection();\n    $setSelection(nextSelection);\n    // Adjust offset based on deleted chars\n    const newOffset = closeTagEndIndex - tagLength * (openNode === closeNode ? 2 : 1) + 1;\n    nextSelection.anchor.set(openNode.__key, openTagStartIndex, 'text');\n    nextSelection.focus.set(closeNode.__key, newOffset, 'text');\n\n    // Apply formatting to selected text\n    for (const format of matcher.format) {\n      if (!nextSelection.hasFormat(format)) {\n        nextSelection.formatText(format);\n      }\n    }\n\n    // Collapse selection up to the focus point\n    nextSelection.anchor.set(nextSelection.focus.key, nextSelection.focus.offset, nextSelection.focus.type);\n\n    // Remove formatting from collapsed selection\n    for (const format of matcher.format) {\n      if (nextSelection.hasFormat(format)) {\n        nextSelection.toggleFormat(format);\n      }\n    }\n    if ($isRangeSelection(selection)) {\n      nextSelection.format = selection.format;\n    }\n    return true;\n  }\n  return false;\n}\n\n// Per CommonMark spec, code spans take precedence over other inline\n// formatting. Returns true if there is an unclosed backtick (code span\n// opener) in the text preceding the given offset, which means the offset\n// is inside a code span that hasn't been closed yet.\nfunction $isInsideUnclosedCodeSpan(node, offset) {\n  let backtickCount = 0;\n  const text = node.getTextContent();\n  for (let i = 0; i < offset; i++) {\n    if (text[i] === '`') {\n      backtickCount++;\n    }\n  }\n  return backtickCount % 2 !== 0;\n}\nfunction getOpenTagStartIndex(string, maxIndex, tag) {\n  const tagLength = tag.length;\n  for (let i = maxIndex; i >= tagLength; i--) {\n    const startIndex = i - tagLength;\n    if (isEqualSubString(string, startIndex, tag, 0, tagLength) &&\n    // Space after opening tag cancels transformation\n    string[startIndex + tagLength] !== ' ') {\n      return startIndex;\n    }\n  }\n  return -1;\n}\nfunction isEqualSubString(stringA, aStart, stringB, bStart, length) {\n  for (let i = 0; i < length; i++) {\n    if (stringA[aStart + i] !== stringB[bStart + i]) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction registerMarkdownShortcuts(editor, transformers = TRANSFORMERS) {\n  const byType = transformersByType(transformers);\n  const textFormatTransformersByTrigger = indexBy(byType.textFormat, ({\n    tag\n  }) => tag[tag.length - 1]);\n  const textMatchTransformersByTrigger = indexBy(byType.textMatch, ({\n    trigger\n  }) => trigger);\n  for (const transformer of transformers) {\n    const type = transformer.type;\n    if (type === 'element' || type === 'text-match' || type === 'multiline-element') {\n      const dependencies = transformer.dependencies;\n      for (const node of dependencies) {\n        if (!editor.hasNode(node)) {\n          {\n            formatDevErrorMessage(`MarkdownShortcuts: missing dependency ${node.getType()} for transformer. Ensure node dependency is included in editor initial config.`);\n          }\n        }\n      }\n    }\n  }\n  const $transform = (parentNode, anchorNode, anchorOffset) => {\n    if (runElementTransformers(parentNode, anchorNode, anchorOffset, byType.element)) {\n      return true;\n    }\n    if (runMultilineElementTransformers(parentNode, anchorNode, anchorOffset, byType.multilineElement)) {\n      return true;\n    }\n    if (runTextMatchTransformers(anchorNode, anchorOffset, textMatchTransformersByTrigger)) {\n      return true;\n    }\n    if ($runTextFormatTransformers(anchorNode, anchorOffset, textFormatTransformersByTrigger)) {\n      return true;\n    }\n    return false;\n  };\n  return mergeRegister(editor.registerUpdateListener(({\n    tags,\n    dirtyLeaves,\n    editorState,\n    prevEditorState\n  }) => {\n    // Ignore updates from collaboration and undo/redo (as changes already calculated)\n    if (tags.has(COLLABORATION_TAG) || tags.has(HISTORIC_TAG)) {\n      return;\n    }\n\n    // If editor is still composing (i.e. backticks) we must wait before the user confirms the key\n    if (editor.isComposing()) {\n      return;\n    }\n    const selection = editorState.read($getSelection);\n    const prevSelection = prevEditorState.read($getSelection);\n\n    // We expect selection to be a collapsed range and not match previous one (as we want\n    // to trigger transforms only as user types)\n    if (!$isRangeSelection(prevSelection) || !$isRangeSelection(selection) || !selection.isCollapsed() || selection.is(prevSelection)) {\n      return;\n    }\n    const anchorKey = selection.anchor.key;\n    const anchorOffset = selection.anchor.offset;\n    const anchorNode = editorState._nodeMap.get(anchorKey);\n    if (!$isTextNode(anchorNode) || !dirtyLeaves.has(anchorKey) || anchorOffset !== 1 && anchorOffset > prevSelection.anchor.offset + 1) {\n      return;\n    }\n    editor.update(() => {\n      if (!canContainTransformableMarkdown(anchorNode)) {\n        return;\n      }\n      const parentNode = anchorNode.getParent();\n      if (parentNode === null || $isCodeNode(parentNode)) {\n        return;\n      }\n      if ($transform(parentNode, anchorNode, selection.anchor.offset)) {\n        $addUpdateTag(HISTORY_PUSH_TAG);\n      }\n    });\n  }), editor.registerCommand(KEY_ENTER_COMMAND, event => {\n    if (event !== null && event.shiftKey) {\n      return false;\n    }\n    const selection = $getSelection();\n    if (!$isRangeSelection(selection) || !selection.isCollapsed()) {\n      return false;\n    }\n    const anchorOffset = selection.anchor.offset;\n    const anchorNode = selection.anchor.getNode();\n    if (!$isTextNode(anchorNode) || !canContainTransformableMarkdown(anchorNode)) {\n      return false;\n    }\n    const parentNode = anchorNode.getParent();\n    if (parentNode === null || $isCodeNode(parentNode)) {\n      return false;\n    }\n    const textContent = anchorNode.getTextContent();\n    if (anchorOffset !== textContent.length) {\n      return false;\n    }\n    if (runMultilineElementTransformers(parentNode, anchorNode, anchorOffset, byType.multilineElement, true)) {\n      if (event !== null) {\n        event.preventDefault();\n      }\n      return true;\n    }\n    return false;\n  }, COMMAND_PRIORITY_LOW));\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n\n/**\n * Renders markdown from a string. The selection is moved to the start after the operation.\n *\n *  @param {boolean} [shouldPreserveNewLines] By setting this to true, new lines will be preserved between conversions\n *  @param {boolean} [shouldMergeAdjacentLines] By setting this to true, adjacent non empty lines will be merged according to commonmark spec: https://spec.commonmark.org/0.24/#example-177. Not applicable if shouldPreserveNewLines = true.\n */\nfunction $convertFromMarkdownString(markdown, transformers = TRANSFORMERS, node, shouldPreserveNewLines = false, shouldMergeAdjacentLines = false) {\n  const sanitizedMarkdown = shouldPreserveNewLines ? markdown : normalizeMarkdown(markdown, shouldMergeAdjacentLines);\n  const importMarkdown = createMarkdownImport(transformers, shouldPreserveNewLines);\n  return importMarkdown(sanitizedMarkdown, node);\n}\n\n/**\n * Renders string from markdown. The selection is moved to the start after the operation.\n */\nfunction $convertToMarkdownString(transformers = TRANSFORMERS, node, shouldPreserveNewLines = false) {\n  const exportMarkdown = createMarkdownExport(transformers, shouldPreserveNewLines);\n  return exportMarkdown(node);\n}\n\nexport { $convertFromMarkdownString, $convertToMarkdownString, BOLD_ITALIC_STAR, BOLD_ITALIC_UNDERSCORE, BOLD_STAR, BOLD_UNDERSCORE, CHECK_LIST, CODE, ELEMENT_TRANSFORMERS, HEADING, HIGHLIGHT, INLINE_CODE, ITALIC_STAR, ITALIC_UNDERSCORE, LINK, MULTILINE_ELEMENT_TRANSFORMERS, ORDERED_LIST, QUOTE, STRIKETHROUGH, TEXT_FORMAT_TRANSFORMERS, TEXT_MATCH_TRANSFORMERS, TRANSFORMERS, UNORDERED_LIST, registerMarkdownShortcuts };\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;AAuBA,SAAS,QAAQ,MAAM,UAAU;CAC/B,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,QAAQ,MAAM;EACvB,MAAM,MAAM,SAAS,IAAI;EACzB,IAAI,CAAC,KACH;EAEF,IAAI,MAAM,MACR,MAAM,KAAK,KAAK,IAAI;OAEpB,MAAM,OAAO,CAAC,IAAI;CAEtB;CACA,OAAO;AACT;AACA,SAAS,mBAAmB,cAAc;CACxC,MAAM,SAAS,QAAQ,eAAc,MAAK,EAAE,IAAI;CAChD,OAAO;EACL,SAAS,OAAO,WAAW,CAAC;EAC5B,kBAAkB,OAAO,wBAAwB,CAAC;EAClD,YAAY,OAAO,kBAAkB,CAAC;EACtC,WAAW,OAAO,iBAAiB,CAAC;CACtC;AACF;AACA,MAAM,uBAAuB;AAC7B,MAAM,aAAa;AACnB,MAAM,cAAc;AACpB,MAAM,8BAA8B;AACpC,SAAS,iBAAiB,MAAM;CAC9B,IAAI,CAAC,iBAAiB,IAAI,GACxB,OAAO;CAET,MAAM,aAAa,KAAK,cAAc;CACtC,OAAO,cAAc,QAAQ,KAAK,gBAAgB,MAAM,KAAK,YAAY,UAAU,KAAK,4BAA4B,KAAK,WAAW,eAAe,CAAC;AACtJ;AACA,SAAS,aAAa,OAAO;CAC3B,OAAO,MAAM,QAAQ,uBAAuB,IAAI,EAAE,QAAQ,cAAc,GAAG,cAAc,OAAO,cAAc,OAAO,SAAS,CAAC,CAAC;AAClI;;;;;;;;;;;AAcA,SAAS,qBAAqB,cAAc,yBAAyB,OAAO;CAC1E,MAAM,SAAS,mBAAmB,YAAY;CAC9C,MAAM,sBAAsB,CAAC,GAAG,OAAO,kBAAkB,GAAG,OAAO,OAAO;CAC1E,MAAM,qBAAqB,CAAC;CAI5B,MAAM,yBAAyB,OAAO,WAAW,QAAO,gBAAe,YAAY,OAAO,WAAW,CAAC,EAIrG,MAAM,GAAG,MAAM;EACd,OAAO,OAAO,EAAE,OAAO,SAAS,MAAM,CAAC,IAAI,OAAO,EAAE,OAAO,SAAS,MAAM,CAAC;CAC7E,CAAC;CACD,QAAO,SAAQ;EACb,MAAM,SAAS,CAAC;EAChB,MAAM,YAAY,QAAQ,SAAS,GAAG,YAAY;EAClD,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GACxC,MAAM,QAAQ,SAAS;GACvB,MAAM,SAAS,uBAAuB,OAAO,qBAAqB,wBAAwB,OAAO,WAAW,sBAAsB;GAClI,IAAI,UAAU,MACZ,OAAO,KAEP,sBAAsB,IAAI,KAAK,CAAC,iBAAiB,KAAK,KAAK,CAAC,iBAAiB,SAAS,IAAI,EAAE,IAAI,KAAK,OAAO,MAAM,IAAI,MAAM;EAEhI;EAGA,OAAO,OAAO,KAAK,IAAI;CACzB;AACF;AACA,SAAS,uBAAuB,MAAM,qBAAqB,uBAAuB,uBAAuB,wBAAwB;CAC/H,KAAK,MAAM,eAAe,qBAAqB;EAC7C,IAAI,CAAC,YAAY,QACf;EAEF,MAAM,SAAS,YAAY,OAAO,OAAM,UAAS,eAAe,OAAO,uBAAuB,uBAAuB,KAAA,GAAW,KAAA,GAAW,sBAAsB,CAAC;EAClK,IAAI,UAAU,MACZ,OAAO;CAEX;CACA,IAAI,eAAe,IAAI,GACrB,OAAO,eAAe,MAAM,uBAAuB,uBAAuB,KAAA,GAAW,KAAA,GAAW,sBAAsB;MACjH,IAAI,iBAAiB,IAAI,GAC9B,OAAO,KAAK,eAAe;MAE3B,OAAO;AAEX;AACA,SAAS,eAAe,MAAM,uBAAuB,uBAAuB,cAAc,gBAAgB,yBAAyB,OAAO;CACxI,MAAM,SAAS,CAAC;CAChB,MAAM,WAAW,KAAK,YAAY;CAElC,IAAI,CAAC,cACH,eAAe,CAAC;CAElB,IAAI,CAAC,gBACH,iBAAiB,CAAC;CAEpB,UAAU,KAAK,MAAM,SAAS,UAAU;EACtC,KAAK,MAAM,eAAe,uBAAuB;GAC/C,IAAI,CAAC,YAAY,QACf;GAEF,MAAM,SAAS,YAAY,OAAO,QAAO,eAAc,eAAe,YAAY,uBAAuB,uBAAuB,cAMhI,CAAC,GAAG,gBAAgB,GAAG,YAAY,GAAG,sBAAsB,IAAI,UAAU,gBAAgB,iBAAiB,UAAU,aAAa,uBAAuB,cAAc,gBAAgB,sBAAsB,CAAC;GAC9M,IAAI,UAAU,MAAM;IAClB,OAAO,KAAK,MAAM;IAClB,SAAS;GACX;EACF;EACA,IAAI,iBAAiB,KAAK,GACxB,OAAO,KAAK,IAAI;OACX,IAAI,YAAY,KAAK,GAC1B,OAAO,KAAK,iBAAiB,OAAO,MAAM,eAAe,GAAG,uBAAuB,cAAc,gBAAgB,sBAAsB,CAAC;OACnI,IAAI,eAAe,KAAK,GAE7B,OAAO,KAAK,eAAe,OAAO,uBAAuB,uBAAuB,cAAc,gBAAgB,sBAAsB,CAAC;OAChI,IAAI,iBAAiB,KAAK,GAC/B,OAAO,KAAK,MAAM,eAAe,CAAC;CAEtC;CACA,OAAO,OAAO,KAAK,EAAE;AACvB;AACA,SAAS,iBAAiB,MAAM,aAAa,kBAE7C,cAAc,gBAAgB,yBAAyB,OAAO;CAO5D,IAAI,SAAS;CACb,IAAI,CAAC,KAAK,UAAU,MAAM,GAExB,SAAS,yBAAyB,OAAO,QAAQ,aAAa,MAAM,IAAI,OAAO,QAAQ,eAAe,MAAM;CAK9G,MAAM,QAAQ,OAAO,MAAM,oBAAoB,KAAK;EAAC;EAAI;EAAI;EAAQ;CAAE;CACvE,MAAM,eAAe,MAAM;CAC3B,MAAM,gBAAgB,MAAM;CAC5B,MAAM,gBAAgB,MAAM;CAC5B,MAAM,mBAAmB,kBAAkB;CAG3C,IAAI,cAAc;CAElB,IAAI,oBAAoB;CACxB,IAAI,mBAAmB;CACvB,MAAM,WAAW,eAAe,MAAM,IAAI;CAC1C,MAAM,WAAW,eAAe,MAAM,KAAK;CAC3C,MAAM,0BAAU,IAAI,IAAI;CACxB,KAAK,MAAM,eAAe,kBAAkB;EAC1C,MAAM,SAAS,YAAY,OAAO;EAClC,MAAM,MAAM,YAAY;EAGxB,IAAI,eAAe,MAAM,MAAM,KAAK,CAAC,QAAQ,IAAI,MAAM,GAAG;GACxD,QAAQ,IAAI,MAAM;GAIlB,IAAI,CAAC,eAAe,UAAU,MAAM,KAAK,CAAC,aAAa,MAAK,YAAW,QAAQ,QAAQ,GAAG,GAAG;IAC3F,aAAa,KAAK;KAChB;KACA;IACF,CAAC;IACD,eAAe;GACjB;EACF;CACF;CAGA,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,gBAAgB,UAAU,MAAM,aAAa,GAAG,MAAM;EAC5D,MAAM,oBAAoB,UAAU,UAAU,aAAa,GAAG,MAAM;EAGpE,IAAI,iBAAiB,mBACnB;EAEF,MAAM,wBAAwB,CAAC,GAAG,YAAY;EAE9C,OAAO,sBAAsB,SAAS,GAAG;GACvC,MAAM,cAAc,sBAAsB,IAAI;GAI9C,IAAI,kBAAkB,eAAe,eAAe,MAAK,YAAW,QAAQ,QAAQ,YAAY,GAAG,GACjG;GAEF,IAAI,eAAe,OAAO,YAAY,QAAQ;QACxC,CAAC,eAGH,qBAAqB,YAAY;SAC5B,IAAI,CAAC,mBACV,oBAAoB,YAAY;GAAA;GAIpC,aAAa,IAAI;EACnB;EACA;CACF;CAGA,IAAI,oBAAoB,CAAC,KAAK,UAAU,MAAM,GAC5C,OAAO,oBAAoB;CAI7B,OAAO,oBAAoB,eAAe,cAAc,gBAAgB,mBAAmB;AAC7F;AACA,SAAS,eAAe,MAAM,UAAU;CACtC,MAAM,UAAU,WAAW,KAAK,mBAAmB,IAAI,KAAK,eAAe;CAC3E,IAAI,YAAY,OAAO,GACrB,OAAO;CAET,OAAO;AACT;AACA,SAAS,UAAU,MAAM,QAAQ;CAC/B,OAAO,YAAY,IAAI,KAAK,KAAK,UAAU,MAAM;AACnD;AACA,SAAS,eAAe,GAAG,GAAG;CAC5B,IAAI,CAAC,UAAU,GAAG,CAAC,GACjB,OAAO;CAET,IAAI,MAAM,QACR,OAAO;CAET,IAAI,KAAK,QAAQ,KAAK,EAAE,eAAe,CAAC,GACtC,OAAO;CAET,OAAO;AACT;;;;;;;;AAUA,SAAS,mCAAmC,UAAU,6BAA6B;CACjF,MAAM,cAAc,SAAS,eAAe;CAK5C,MAAM,YAAY,4BAA4B,qBAAqB;CACnE,MAAM,kBAAkB,4BAA4B,kBAAkB;CACtE,MAAM,gBAAgB,CAAC;CACvB,IAAI,YAAY;CAChB,IAAI,aAAa,iBAAiB;EAChC,MAAM,cAAc,IAAI,OAAO,UAAU,QAAQ,GAAG;EACpD,MAAM,UAAU,MAAM,KAAK,YAAY,SAAS,WAAW,CAAC;EAC5D,KAAK,MAAM,SAAS,SAAS;GAI3B,MAAM,aAAa,MAAM,QAAQ,MAAM,GAAG;GAC1C,MAAM,WAAW,MAAM,QAAQ,MAAM,GAAG;GACxC,IAAI,CAAC,WACH,YAAY;IACV,SAAS,MAAM;IACf;IACA;IACA,KAAK;GACP;GAEF,cAAc,KAAK;IACjB,KAAK;IACL,OAAO;GACT,CAAC;EACH;CACF;CACA,MAAM,aAAa,eAAe,aAAa,6BAA6B,aAAa;CACzF,MAAM,gBAAgB,WAAW,SAAS,IAAI,gBAAgB,aAAa,YAAY,2BAA2B,IAAI;CACtH,IAAI,cAAc;CAClB,IAAI,oBAAoB;CACxB,IAAI,aAAa,eACf,IAAI,cAAc,cAAc,UAAU,cAAc,cAAc,YAAY,UAAU,UAAU;EACpG,cAAc;EACd,oBAAoB,4BAA4B,kBAAkB,cAAc;CAClF,OAAO;EACL,cAAc;EACd,oBAAoB;CACtB;MACK,IAAI,WAAW;EACpB,cAAc;EACd,oBAAoB;CACtB,OAAO,IAAI,eAAe;EACxB,cAAc;EACd,oBAAoB,4BAA4B,kBAAkB,cAAc;CAClF;CACA,IAAI,CAAC,eAAe,CAAC,mBACnB,OAAO;CAET,MAAM,aAAa;EAAC,YAAY,MAAM,YAAY,YAAY,YAAY,QAAQ;EAAG,YAAY;EAAK,YAAY;CAAO;CACzH,WAAW,QAAQ,YAAY;CAC/B,WAAW,QAAQ;CACnB,OAAO;EACL,UAAU,YAAY;EACtB,OAAO;EACP,YAAY,YAAY;EACxB,aAAa;CACf;AACF;AACA,SAAS,eAAe,MAAM,mBAAmB,gBAAgB,CAAC,GAAG;CACnE,MAAM,aAAa,CAAC;CACpB,MAAM,iBAAiB,IAAI,IAAI,OAAO,KAAK,kBAAkB,iBAAiB,EAAE,QAAO,QAAO,IAAI,OAAO,GAAG,EAAE,KAAI,QAAO,IAAI,EAAE,CAAC;CAChI,MAAM,aAAY,UAAS;EACzB,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,QAAQ,GAAG,KAAK,KAAK,KAAK,OAAO,MAAM,KAClD;EAEF,OAAO,QAAQ,MAAM;CACvB;CACA,MAAM,qBAAoB,UAAS;EACjC,OAAO,cAAc,MAAK,UAAS,SAAS,MAAM,SAAS,QAAQ,MAAM,GAAG;CAC9E;CACA,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QAAQ;EACtB,MAAM,OAAO,KAAK;EAClB,IAAI,CAAC,eAAe,IAAI,IAAI,KAAK,UAAU,CAAC,KAAK,kBAAkB,CAAC,GAAG;GACrE;GACA;EACF;EACA,IAAI,MAAM;EACV,OAAO,IAAI,MAAM,KAAK,UAAU,KAAK,IAAI,SAAS,MAChD;EAEF,MAAM,UAAU,YAAY,MAAM,MAAM,GAAG,KAAK,IAAI;EACpD,MAAM,WAAW,YAAY,MAAM,MAAM,GAAG,KAAK,KAAK;EACtD,IAAI,WAAW,UACb,WAAW,KAAK;GACd,QAAQ;GACR;GACA;GACA;GACA,OAAO;GACP,QAAQ;GACR,gBAAgB;EAClB,CAAC;EAEH,KAAK;CACP;CACA,OAAO;AACT;AACA,SAAS,gBAAgB,MAAM,YAAY,mBAAmB;CAC5D,MAAM,gBAAgB,CAAC;CACvB,IAAI,aAAa;CACjB,IAAI,SAAS;CACb,OAAO,aAAa,WAAW,QAAQ;EACrC,MAAM,SAAS,WAAW;EAC1B,IAAI,CAAC,OAAO,UAAU,CAAC,OAAO,YAAY,OAAO,WAAW,GAAG;GAC7D;GACA;EACF;EACA,MAAM,YAAY,GAAG,OAAO,OAAO,OAAO;EAC1C,MAAM,SAAS,cAAc,cAAc;EAC3C,IAAI,cAAc;EAClB,KAAK,IAAI,UAAU,aAAa,GAAG,UAAU,QAAQ,WAAW;GAC9D,MAAM,SAAS,WAAW;GAC1B,IAAI,CAAC,OAAO,UAAU,CAAC,OAAO,WAAW,OAAO,WAAW,KAAK,OAAO,SAAS,OAAO,MACrF;GAIF,IAAI,OAAO,YAAY,OAAO;SAChB,OAAO,iBAAiB,OAAO,kBACjC,MAAM,KAAK,OAAO,iBAAiB,MAAM,KAAK,OAAO,iBAAiB,MAAM,GACpF;GAAA;GAGJ,MAAM,SAAS,KAAK,IAAI,OAAO,QAAQ,OAAO,MAAM;GACpD,MAAM,aAAa,OAAO,KAAK,kBAAkB,iBAAiB,EAAE,QAAO,MAAK,EAAE,OAAO,OAAO,QAAQ,EAAE,UAAU,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE;GAChK,IAAI,CAAC,YACH;GAEF,cAAc;GACd,MAAM,WAAW,WAAW;GAC5B,MAAM,QAAQ;IACZ,SAAS,KAAK,MAAM,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;IAC9D,UAAU,OAAO,QAAQ;IACzB,YAAY,OAAO,SAAS,OAAO,SAAS;IAC5C,KAAK;GACP;GACA,IAAI,CAAC,UAAU,MAAM,aAAa,OAAO,cAAc,MAAM,eAAe,OAAO,cAAc,MAAM,WAAW,OAAO,UACvH,SAAS;GAEX,KAAK,IAAI,IAAI,UAAU,GAAG,IAAI,YAAY,KACxC,WAAW,GAAG,SAAS;GAEzB,OAAO,UAAU;GACjB,OAAO,UAAU;GACjB,OAAO,SAAS,OAAO,SAAS;GAChC,IAAI,OAAO,SAAS,GAClB,OAAO,SAAS;QACX;IACL,OAAO,SAAS;IAChB;GACF;GACA;EACF;EACA,IAAI,CAAC,aAAa;GAChB,cAAc,aAAa,aAAa;GACxC,IAAI,CAAC,OAAO,SACV,OAAO,SAAS;GAElB;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,YAAY,MAAM,MAAM,OAAO,QAAQ,QAAQ;CACtD,IAAI,CAAC,WAAW,MAAM,OAAO,QAAQ,MAAM,GACzC,OAAO;CAET,IAAI,SAAS,KACX,OAAO;CAET,IAAI,SAAS,KAAK;EAChB,IAAI,CAAC,WAAW,MAAM,OAAO,QAAQ,CAAC,MAAM,GAC1C,OAAO;EAET,MAAM,eAAe,SAAS,KAAK,QAAQ,KAAK,KAAK,QAAQ;EAC7D,OAAO,iBAAiB,KAAA,KAAa,YAAY,KAAK,YAAY;CACpE;CACA,OAAO;AACT;AACA,SAAS,WAAW,MAAM,OAAO,QAAQ,QAAQ;CAC/C,MAAM,aAAa,KAAK,QAAQ;CAChC,MAAM,YAAY,KAAK,QAAQ;CAC/B,MAAM,CAAC,SAAS,aAAa,SAAS,CAAC,WAAW,UAAU,IAAI,CAAC,YAAY,SAAS;CACtF,IAAI,YAAY,KAAA,KAAa,WAAW,KAAK,OAAO,GAClD,OAAO;CAET,IAAI,CAAC,YAAY,KAAK,OAAO,GAC3B,OAAO;CAET,OAAO,cAAc,KAAA,KAAa,WAAW,KAAK,SAAS,KAAK,YAAY,KAAK,SAAS;AAC5F;AACA,SAAS,4BAA4B,UAAU,YAAY,UAAU,aAAa,OAAO;CACvF,MAAM,cAAc,SAAS,eAAe;CAG5C,IAAI,iBAAiB,WAAW;CAKhC,IAAI,MAAM,OAAO,aACf,kBAAkB;MAElB,IAAI,eAAe,GACjB,CAAC,iBAAiB,aAAa,SAAS,UAAU,QAAQ;MAE1D,CAAC,YAAY,iBAAiB,aAAa,SAAS,UAAU,YAAY,QAAQ;CAGtF,gBAAgB,eAAe,MAAM,EAAE;CACvC,IAAI;OACG,MAAM,UAAU,YAAY,QAC/B,IAAI,CAAC,gBAAgB,UAAU,MAAM,GACnC,gBAAgB,aAAa,MAAM;CAAA;CAIzC,OAAO;EACM;EACC;EACK;CACnB;AACF;;;;;;;;AAUA,SAAS,kCAAkC,WAAW,uBAAuB;CAC3E,MAAM,WAAW;CACjB,IAAI,uBAAuB,KAAA;CAC3B,IAAI,qBAAqB,KAAA;CACzB,IAAI,wBAAwB,KAAA;CAC5B,IAAI,aAAa,KAAA;CACjB,KAAK,MAAM,eAAe,uBAAuB;EAC/C,IAAI,CAAC,YAAY,WAAW,CAAC,YAAY,cACvC;EAEF,MAAM,QAAQ,SAAS,eAAe,EAAE,MAAM,YAAY,YAAY;EACtE,IAAI,CAAC,OACH;EAEF,MAAM,aAAa,MAAM,SAAS;EAClC,MAAM,WAAW,YAAY,cAAc,YAAY,YAAY,UAAU,KAAK,IAAI,aAAa,MAAM,GAAG;EAC5G,IAAI,aAAa,OACf;EAEF,IAAI,yBAAyB,KAAA,KAAa,uBAAuB,KAAA,KAEjE,aAAa,yBAAyB,WAAW,sBAAsB,YAAY,uBAAuB;GACxG,uBAAuB;GACvB,qBAAqB;GACrB,wBAAwB;GACxB,aAAa;EACf;CACF;CACA,IAAI,yBAAyB,KAAA,KAAa,uBAAuB,KAAA,KAAa,0BAA0B,KAAA,KAAa,eAAe,KAAA,GAClI,OAAO;CAET,OAAO;EACL,UAAU;EACV,OAAO;EACP,YAAY;EACZ,aAAa;CACf;AACF;AACA,SAAS,gCAAgC,UAAU,YAAY,UAAU,aAAa,OAAO;CAC3F,IAAI,iBAAiB,WAAW;CAChC,IAAI,eAAe,GACjB,CAAC,iBAAiB,aAAa,SAAS,UAAU,QAAQ;MAE1D,CAAC,YAAY,iBAAiB,aAAa,SAAS,UAAU,YAAY,QAAQ;CAEpF,IAAI,CAAC,YAAY,SACf,OAAO;CAET,MAAM,2BAA2B,YAAY,QAAQ,iBAAiB,KAAK;CAC3E,OAAO;EACL;EACA;EACA,iBAAiB,4BAA4B,KAAA;CAC/C;AACF;;;;;;;;;;;;;;AAiBA,SAAS,gCAAgC,MAAM;CAC7C,OAAO,YAAY,IAAI,KAAK,CAAC,KAAK,UAAU,MAAM;AACpD;;;;;;;AAQA,SAAS,uBAAuB,UAAU,6BAA6B,uBAAuB;CAC5F,IAAI,kBAAkB,mCAAmC,UAAU,2BAA2B;CAC9F,IAAI,iBAAiB,kCAAkC,UAAU,qBAAqB;CACtF,IAAI,mBAAmB,gBAErB,IAAI,gBAAgB,cAAc,eAAe,cAAc,gBAAgB,YAAY,eAAe,YAE1G,eAAe,aAAa,gBAAgB,UAE1C,iBAAiB;MAGjB,kBAAkB;CAGtB,IAAI,iBAAiB;EACnB,MAAM,SAAS,4BAA4B,UAAU,gBAAgB,YAAY,gBAAgB,UAAU,gBAAgB,aAAa,gBAAgB,KAAK;EAC7J,IAAI,gCAAgC,OAAO,SAAS,GAClD,uBAAuB,OAAO,WAAW,6BAA6B,qBAAqB;EAE7F,IAAI,gCAAgC,OAAO,UAAU,GACnD,uBAAuB,OAAO,YAAY,6BAA6B,qBAAqB;EAE9F,IAAI,gCAAgC,OAAO,eAAe,GACxD,uBAAuB,OAAO,iBAAiB,6BAA6B,qBAAqB;CAErG,OAAO,IAAI,gBAAgB;EACzB,MAAM,SAAS,gCAAgC,UAAU,eAAe,YAAY,eAAe,UAAU,eAAe,aAAa,eAAe,KAAK;EAC7J,IAAI,CAAC,QACH;EAEF,IAAI,gCAAgC,OAAO,SAAS,GAClD,uBAAuB,OAAO,WAAW,6BAA6B,qBAAqB;EAE7F,IAAI,gCAAgC,OAAO,UAAU,GACnD,uBAAuB,OAAO,YAAY,6BAA6B,qBAAqB;EAE9F,IAAI,gCAAgC,OAAO,eAAe,GACxD,uBAAuB,OAAO,iBAAiB,6BAA6B,qBAAqB;CAErG;CAIA,MAAM,gBAAgB,aADF,SAAS,eACgB,CAAC;CAC9C,SAAS,eAAe,aAAa;AACvC;;;;;;;;;;;AAaA,SAAS,qBAAqB,cAAc,yBAAyB,OAAO;CAC1E,MAAM,SAAS,mBAAmB,YAAY;CAC9C,MAAM,8BAA8B,kCAAkC,OAAO,UAAU;CACvF,QAAQ,gBAAgB,SAAS;EAC/B,MAAM,QAAQ,eAAe,MAAM,IAAI;EACvC,MAAM,cAAc,MAAM;EAC1B,MAAM,OAAO,QAAQ,SAAS;EAC9B,KAAK,MAAM;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,KAAK;GACpC,MAAM,WAAW,MAAM;GACvB,MAAM,CAAC,UAAU,gBAAgB,iBAAiB,OAAO,GAAG,OAAO,kBAAkB,IAAI;GACzF,IAAI,UAAU;IAKZ,IAAI;IACJ;GACF;GACA,cAAc,UAAU,MAAM,OAAO,SAAS,6BAA6B,OAAO,WAAW,sBAAsB;EACrH;EACA,MAAM,WAAW,KAAK,YAAY;EAClC,KAAK,MAAM,SAAS,UAAU;GAI5B,IAAI,CAAC,0BAA0B,iBAAiB,KAAK,KAAK,KAAK,gBAAgB,IAAI,GAAG;IACpF,MAAM,OAAO;IACb;GACF;GAEA,IAAI,eAAe,KAAK,GACtB,KAAK,MAAM,YAAY,MAAM,gBAAgB,GAC3C,2BAA2B,QAAQ;EAGzC;EACA,IAAI,cAAc,MAAM,MACtB,KAAK,YAAY;CAErB;AACF;;;;;AAMA,SAAS,iBAAiB,OAAO,gBAAgB,8BAA8B,UAAU;CACvF,KAAK,MAAM,eAAe,8BAA8B;EACtD,MAAM,EACJ,6BACA,WACA,aACA,YACE;EACJ,MAAM,aAAa,MAAM,gBAAgB,MAAM,WAAW;EAC1D,IAAI,CAAC,YACH;EAEF,IAAI,6BAA6B;GAC/B,MAAM,SAAS,4BAA4B;IACzC;IACA;IACA;IACA;IACA;GACF,CAAC;GACD,IAAI,WAAW,MACb;QACK,IAAI,QACT,OAAO;EAEX;EACA,MAAM,iBAAiB,OAAO,cAAc,YAAY,YAAY,YAAY,UAAU,SAAS;EACnG,MAAM,gBAAgB,aAAa,OAAO,cAAc,YAAY,cAAc,YAAY,UAAU,WAAW,CAAC;EACpH,IAAI,eAAe;EACnB,MAAM,cAAc,MAAM;EAG1B,OAAO,eAAe,aAAa;GACjC,MAAM,WAAW,iBAAiB,MAAM,cAAc,MAAM,cAAc,IAAI;GAC9E,IAAI,CAAC;QACC,CAAC,iBAAiB,iBAAiB,eAAe,cAAc,GAClE;KACA;KACA;IACF;;GAKF,IAAI,YAAY,mBAAmB,gBAAgB,SAAS,UAAU,WAAW,OAAO;IACtF;IACA;GACF;GAIA,MAAM,iBAAiB,CAAC;GACxB,IAAI,YAAY,mBAAmB,cACjC,eAAe,KAAK,MAAM,gBAAgB,MAAM,WAAW,GAAG,QAAQ,CAAC,SAAS,GAAG,MAAM,CAAC;QAE1F,KAAK,IAAI,IAAI,gBAAgB,KAAK,cAAc,KAC9C,IAAI,MAAM,gBAAgB;IACxB,MAAM,OAAO,MAAM,GAAG,MAAM,WAAW,GAAG,MAAM;IAChD,eAAe,KAAK,IAAI;GAC1B,OAAO,IAAI,MAAM,gBAAgB,UAAU;IACzC,MAAM,OAAO,MAAM,GAAG,MAAM,GAAG,CAAC,SAAS,GAAG,MAAM;IAClD,eAAe,KAAK,IAAI;GAC1B,OACE,eAAe,KAAK,MAAM,EAAE;GAIlC,IAAI,QAAQ,UAAU,MAAM,YAAY,UAAU,gBAAgB,IAAI,MAAM,OAE1E,OAAO,CAAC,MAAM,YAAY;GAK5B;EACF;CACF;CAGA,OAAO,CAAC,OAAO,cAAc;AAC/B;AACA,SAAS,cAAc,UAAU,UAAU,qBAAqB,6BAA6B,uBAAuB,wBAAwB;CAC1I,MAAM,WAAW,gBAAgB,QAAQ;CACzC,MAAM,cAAc,qBAAqB;CACzC,YAAY,OAAO,QAAQ;CAC3B,SAAS,OAAO,WAAW;CAC3B,KAAK,MAAM,EACT,QACA,aACG,qBAAqB;EACxB,MAAM,QAAQ,SAAS,MAAM,MAAM;EACnC,IAAI,OAAO;GACT,SAAS,eAAe,SAAS,MAAM,MAAM,GAAG,MAAM,CAAC;GACvD,IAAI,QAAQ,aAAa,CAAC,QAAQ,GAAG,OAAO,IAAI,MAAM,OACpD;EAEJ;CACF;CACA,uBAAuB,UAAU,6BAA6B,qBAAqB;CAKnF,IAAI,YAAY,WAAW,KAAK,SAAS,SAAS,GAAG;EACnD,MAAM,eAAe,YAAY,mBAAmB;EACpD,IAAI,CAAC,2BAEL,iBAAiB,YAAY,KAAK,aAAa,YAAY,KAAK,YAAY,YAAY,IAAI;GAC1F,IAAI,aAAa;GACjB,IAAI,YAAY,YAAY,GAAG;IAC7B,MAAM,iBAAiB,aAAa,kBAAkB;IACtD,IAAI,kBAAkB,MACpB,aAAa;SAEb,aAAaA,sBAAoB,gBAAgB,eAAe;GAEpE;GACA,IAAI,cAAc,QAAQ,WAAW,mBAAmB,IAAI,GAAG;IAC7D,MAAM,YAAY,WAAW,aAAa;IAC1C,IAAI,YAAY,SAAS,GAAG;KAC1B,MAAM,WAAW,UAAU,eAAe;KAC1C,IAAI,SAAS,SAAS,IAAI,GACxB,UAAU,eAAe,SAAS,MAAM,GAAG,EAAE,CAAC;UACzC,IAAI,SAAS,KAAK,QAAQ,GAC/B,UAAU,eAAe,SAAS,QAAQ,UAAU,EAAE,CAAC;IAE3D;IACA,WAAW,OAAO,WAAW,gBAAgB,GAAG,GAAG,CAAC,qBAAqB,GAAG,GAAG,YAAY,YAAY,CAAC,CAAC;IACzG,YAAY,OAAO;GACrB;EACF;CACF;AACF;AAGA,SAAS,2BAA2B,UAAU;CAC5C,MAAM,6BAAa,IAAI,IAAI;CAC3B,MAAM,OAAO,SAAS,eAAe;CACrC,IAAI,QAAQ,KAAK,QAAQ,GAAI;CAG7B,OAAO,UAAU,IAAI;EACnB,WAAW,IAAI,KAAK;EACpB,WAAW,IAAI,QAAQ,CAAC;EACxB,QAAQ,KAAK,QAAQ,KAAM,QAAQ,CAAC;CACtC;CAIA,SAD4B,UAAU,GAAG,UAChC,EAAE,SAAQ,SAAQ;EACzB,IAAI,KAAK,eAAe,MAAM,KAC5B,KAAK,QAAQ,eAAe,CAAC;CAEjC,CAAC;AACH;AACA,SAAS,kCAAkC,kBAAkB;CAC3D,MAAM,oBAAoB,CAAC;CAC3B,MAAM,uBAAuB,CAAC;CAC9B,MAAM,iBAAiB,CAAC;CACxB,KAAK,MAAM,eAAe,kBAAkB;EAC1C,MAAM,EACJ,QACE;EACJ,kBAAkB,OAAO;EACzB,MAAM,YAAY,IAAI,QAAQ,eAAe,MAAM;EACnD,eAAe,KAAK,SAAS;EAG7B,IAAI,IAAI,WAAW,GACjB,IAAI,QAAQ,KAKV,qBAAqB,OAAO,IAAI,OAAO,iDAAiD;OAExF,qBAAqB,OAAO,IAAI,OAAO,YAAY,UAAU,KAAK,UAAU,SAAS,UAAU,SAAS,UAAU,WAAW,UAAU,MAAM,UAAU,WAAW,UAAU,GAAG;OAIjL,qBAAqB,OAAO,IAAI,OAAO,eAAe,UAAU,SAAS,UAAU,kBAAkB,UAAU,MAAM,UAAU,UAAU;CAE7I;CACA,OAAO;EAEL;EAIA,gBAAgB,IAAI,OAAO,IAAI,eAAe,KAAK,GAAG,EAAE,IAAI,GAAG;EAC/D;CACF;AACF;;;;;;;;AAYA,SAAS,sBAAsB,SAAS;CACtC,MAAM,IAAI,MAAM,OAAO;AACzB;;;;;;;;AAUA,MAAM,qBAAqB;AAC3B,MAAM,uBAAuB;AAC7B,MAAM,mBAAmB;AACzB,MAAM,gBAAgB;AACtB,MAAM,cAAc;AACpB,MAAM,mBAAmB;AACzB,MAAM,iBAAiB;AACvB,MAAM,yBAAyB;AAC/B,MAAM,oBAAoB;AAC1B,MAAM,4BAA4B;AAClC,MAAM,kBAAkB;AACxB,MAAM,gBAAgB;AACtB,MAAM,aAAY,UAAS,IAAI,OAAO,MAAM,MAAM,OAAO,KAAK,MAAM,KAAK;AACzE,MAAM,kBAAkB,YAAY,gBAAgB;CAClD,QAAO,MAAK,OAAO,MAAM,YAAY,UAAU,KAAK,CAAC,IAAI,IAAI;CAC7D,iBAAiB;AACnB,CAAC;AACD,MAAM,iBAAiB,YAAY,eAAe;CAChD,QAAO,QAAO;EACZ,IAAI,OAAO,QAAQ,YAAY,UAAU,KAAK,GAAG,GAC/C,OAAO;EAET,OAAO;CACT;CACA,iBAAiB;AACnB,CAAC;AACD,MAAM,mBAAkB,eAAc;CACpC,QAAQ,YAAY,UAAU,OAAO,aAAa;EAChD,MAAM,OAAO,WAAW,KAAK;EAC7B,KAAK,OAAO,GAAG,QAAQ;EACvB,WAAW,QAAQ,IAAI;EACvB,IAAI,CAAC,UACH,KAAK,OAAO,GAAG,CAAC;CAEpB;AACF;AAIA,MAAM,mBAAmB;AACzB,SAAS,UAAU,aAAa;CAC9B,MAAM,OAAO,YAAY,MAAM,KAAK;CACpC,MAAM,SAAS,YAAY,MAAM,IAAI;CACrC,IAAI,SAAS;CACb,IAAI,MACF,UAAU,KAAK;CAEjB,IAAI,QACF,UAAU,KAAK,MAAM,OAAO,SAAS,gBAAgB;CAEvD,OAAO;AACT;AACA,MAAM,eAAc,aAAY;CAC9B,QAAQ,YAAY,UAAU,OAAO,aAAa;EAChD,MAAM,eAAe,WAAW,mBAAmB;EACnD,MAAM,WAAW,WAAW,eAAe;EAC3C,MAAM,WAAW,oBAAoB,aAAa,UAAU,MAAM,OAAO,MAAM,KAAA,CAAS;EACxF,MAAM,iBAAiB,MAAM,GAAG,KAAK,EAAE;EACvC,MAAM,cAAc,aAAa,YAAY,aAAa,YAAY,mBAAmB,gBAAgB,MAAM,cAAc,IAAI,iBAAiB,KAAA;EAClJ,IAAI,YAAY,QAAQ,KAAK,SAAS,YAAY,MAAM,UAAU;GAChE,IAAI,YACF,UAAU,UAAU,iBAAiB,UAAU;GAEjD,MAAM,aAAa,SAAS,cAAc;GAC1C,IAAI,eAAe,MACjB,WAAW,aAAa,QAAQ;QAGhC,SAAS,OAAO,QAAQ;GAE1B,WAAW,OAAO;EACpB,OAAO,IAAI,YAAY,YAAY,KAAK,aAAa,YAAY,MAAM,UAAU;GAC/E,IAAI,YACF,UAAU,cAAc,iBAAiB,UAAU;GAErD,aAAa,OAAO,QAAQ;GAC5B,WAAW,OAAO;EACpB,OAAO;GACL,MAAM,OAAO,gBAAgB,UAAU,aAAa,WAAW,OAAO,MAAM,EAAE,IAAI,KAAA,CAAS;GAC3F,IAAI,YACF,UAAU,MAAM,iBAAiB,UAAU;GAE7C,KAAK,OAAO,QAAQ;GACpB,WAAW,QAAQ,IAAI;EACzB;EACA,SAAS,OAAO,GAAG,QAAQ;EAC3B,IAAI,CAAC,UACH,SAAS,OAAO,GAAG,CAAC;EAEtB,MAAM,SAAS,UAAU,MAAM,EAAE;EACjC,IAAI,QACF,SAAS,UAAU,MAAM;CAE7B;AACF;AACA,MAAM,eAAe,UAAU,gBAAgB,UAAU;CACvD,MAAM,SAAS,CAAC;CAChB,MAAM,WAAW,SAAS,YAAY;CACtC,IAAI,QAAQ;CACZ,KAAK,MAAM,gBAAgB,UACzB,IAAI,gBAAgB,YAAY,GAAG;EACjC,IAAI,aAAa,gBAAgB,MAAM,GAAG;GACxC,MAAM,aAAa,aAAa,cAAc;GAC9C,IAAI,YAAY,UAAU,GAAG;IAC3B,OAAO,KAAK,YAAY,YAAY,gBAAgB,QAAQ,CAAC,CAAC;IAC9D;GACF;EACF;EACA,MAAM,SAAS,IAAI,OAAO,QAAQ,gBAAgB;EAClD,MAAM,WAAW,SAAS,YAAY;EACtC,MAAM,aAAa,UAAU,UAAU,eAAe;EACtD,MAAM,SAAS,aAAa,WAAW,GAAG,SAAS,SAAS,IAAI,MAAM,MAAM,aAAa,UAAU,GAAG,WAAW,IAAI,aAAa,WAAW,IAAI,MAAM,IAAI,MAAM,aAAa;EAC9K,IAAI,eAAe,eAAe,YAAY;EAC9C,IAAI,aAAa,UACf,eAAe,aAAa,QAAQ,uBAAuB,QAAQ;EAErE,OAAO,KAAK,SAAS,SAAS,YAAY;EAC1C;CACF;CAEF,OAAO,OAAO,KAAK,IAAI;AACzB;AACA,MAAM,UAAU;CACd,cAAc,CAAC,WAAW;CAC1B,SAAS,MAAM,mBAAmB;EAChC,IAAI,CAAC,eAAe,IAAI,GACtB,OAAO;EAET,MAAM,QAAQ,OAAO,KAAK,OAAO,EAAE,MAAM,CAAC,CAAC;EAC3C,OAAO,IAAI,OAAO,KAAK,IAAI,MAAM,eAAe,IAAI;CACtD;CACA,QAAQ;CACR,SAAS,iBAAgB,UAAS;EAEhC,OAAO,mBADK,MAAM,MAAM,GAAG,MACE;CAC/B,CAAC;CACD,MAAM;AACR;AACA,MAAM,QAAQ;CACZ,cAAc,CAAC,SAAS;CACxB,SAAS,MAAM,mBAAmB;EAChC,IAAI,CAAC,aAAa,IAAI,GACpB,OAAO;EAET,MAAM,QAAQ,eAAe,IAAI,EAAE,MAAM,IAAI;EAC7C,MAAM,SAAS,CAAC;EAChB,KAAK,MAAM,QAAQ,OACjB,OAAO,KAAK,OAAO,IAAI;EAEzB,OAAO,OAAO,KAAK,IAAI;CACzB;CACA,QAAQ;CACR,UAAU,YAAY,UAAU,QAAQ,aAAa;EACnD,IAAI,UAAU;GACZ,MAAM,eAAe,WAAW,mBAAmB;GACnD,IAAI,aAAa,YAAY,GAAG;IAC9B,aAAa,OAAO,aAAa,gBAAgB,GAAG,GAAG,CAAC,qBAAqB,GAAG,GAAG,QAAQ,CAAC;IAC5F,WAAW,OAAO;IAClB;GACF;EACF;EACA,MAAM,OAAO,iBAAiB;EAC9B,KAAK,OAAO,GAAG,QAAQ;EACvB,WAAW,QAAQ,IAAI;EACvB,IAAI,CAAC,UACH,KAAK,OAAO,GAAG,CAAC;CAEpB;CACA,MAAM;AACR;AACA,MAAM,OAAO;CACX,cAAc,CAAC,QAAQ;CACvB,SAAQ,SAAQ;EACd,IAAI,CAAC,YAAY,IAAI,GACnB,OAAO;EAET,MAAM,cAAc,KAAK,eAAe;EACxC,IAAI,QAAQ,UAAU,MAAM,cAAc;EAC1C,IAAI,YAAY,QAAQ,KAAK,IAAI,IAAI;GACnC,MAAM,YAAY,YAAY,MAAM,QAAQ;GAC5C,IAAI,WAAW;IACb,MAAM,YAAY,KAAK,IAAI,GAAG,UAAU,KAAI,MAAK,EAAE,MAAM,CAAC;IAC1D,QAAQ,IAAI,OAAO,YAAY,CAAC;GAClC;EACF;EACA,OAAO,SAAS,KAAK,YAAY,KAAK,OAAO,cAAc,OAAO,cAAc,MAAM,OAAO;CAC/F;CACA,8BAA8B,EAC5B,OACA,UACA,gBACA,iBACI;EACJ,MAAM,QAAQ,WAAW;EACzB,MAAM,cAAc,MAAM,KAAK,EAAE;EACjC,MAAM,cAAc,MAAM;EAC1B,MAAM,kBAAkB,WAAW,QAAQ,MAAM;EACjD,MAAM,aAAa,YAAY,MAAM,eAAe;EACpD,MAAM,qBAAqB,IAAI,OAAO,MAAM,YAAY,IAAI;EAC5D,IAAI,mBAAmB,KAAK,UAAU,GAAG;GACvC,MAAM,WAAW,WAAW,MAAM,kBAAkB;GACpD,MAAM,UAAU,WAAW,MAAM,GAAG,WAAW,YAAY,SAAS,EAAE,CAAC;GACvE,MAAM,iBAAiB,CAAC,GAAG,UAAU;GACrC,eAAe,KAAK;GACpB,KAAK,QAAQ,UAAU,MAAM,gBAAgB,UAAU,CAAC,OAAO,GAAG,IAAI;GACtE,OAAO,CAAC,MAAM,cAAc;EAC9B;EACA,MAAM,oBAAoB,IAAI,OAAO,cAAc,YAAY,IAAI;EACnE,KAAK,IAAI,IAAI,iBAAiB,GAAG,IAAI,MAAM,QAAQ,KAAK;GACtD,MAAM,OAAO,MAAM;GACnB,IAAI,kBAAkB,KAAK,IAAI,GAAG;IAChC,MAAM,WAAW,KAAK,MAAM,iBAAiB;IAC7C,MAAM,iBAAiB,MAAM,MAAM,iBAAiB,GAAG,CAAC;IACxD,MAAM,iBAAiB,YAAY,MAAM,WAAW,GAAG,MAAM;IAC7D,IAAI,eAAe,SAAS,GAC1B,eAAe,QAAQ,cAAc;IAEvC,KAAK,QAAQ,UAAU,MAAM,YAAY,UAAU,gBAAgB,IAAI;IACvE,OAAO,CAAC,MAAM,CAAC;GACjB;EACF;EACA,MAAM,iBAAiB,MAAM,MAAM,iBAAiB,CAAC;EACrD,MAAM,iBAAiB,YAAY,MAAM,WAAW,GAAG,MAAM;EAC7D,IAAI,eAAe,SAAS,GAC1B,eAAe,QAAQ,cAAc;EAEvC,KAAK,QAAQ,UAAU,MAAM,YAAY,MAAM,gBAAgB,IAAI;EACnE,OAAO,CAAC,MAAM,MAAM,SAAS,CAAC;CAChC;CACA,WAAW;EACT,UAAU;EACV,QAAQ;CACV;CACA,aAAa;CACb,UAAU,UAAU,UAAU,YAAY,UAAU,gBAAgB,aAAa;EAC/E,IAAI;EACJ,IAAI;EACJ,MAAM,QAAQ,WAAW,KAAK,WAAW,GAAG,KAAK,IAAI;EACrD,MAAM,WAAW,WAAW,MAAM,KAAA;EAClC,IAAI,CAAC,YAAY,gBAAgB;GAC/B,IAAI,eAAe,WAAW,GAC5B,IAAI,UAAU;IACZ,gBAAgB,gBAAgB,QAAQ;IACxC,OAAO,eAAe;GACxB,OAAO;IACL,gBAAgB,gBAAgB,QAAQ;IACxC,OAAO,eAAe,GAAG,WAAW,GAAG,IAAI,eAAe,GAAG,MAAM,CAAC,IAAI,eAAe;GACzF;QACK;IACL,gBAAgB,gBAAgB,QAAQ;IACxC,IAAI,eAAe,SAAS;SACtB,eAAe,GAAG,KAAK,EAAE,WAAW,GACtC,eAAe,MAAM;UAChB,IAAI,eAAe,GAAG,WAAW,GAAG,GACzC,eAAe,KAAK,eAAe,GAAG,MAAM,CAAC;IAAA;IAGjD,OAAO,eAAe,SAAS,KAAK,CAAC,eAAe,eAAe,SAAS,GAAG,QAC7E,eAAe,IAAI;IAErB,OAAO,eAAe,KAAK,IAAI;GACjC;GACA,UAAU,eAAe,gBAAgB,KAAK;GAC9C,MAAM,WAAW,gBAAgB,IAAI;GACrC,cAAc,OAAO,QAAQ;GAC7B,SAAS,OAAO,aAAa;EAC/B,OAAO,IAAI,UACT,iBAAgB,UAAS;GACvB,OAAO,gBAAgB,QAAQ,MAAM,KAAK,KAAA,CAAS;EACrD,CAAC,EAAE,UAAU,UAAU,YAAY,QAAQ;CAE/C;CACA,MAAM;AACR;AACA,MAAM,iBAAiB;CACrB,cAAc,CAAC,UAAU,YAAY;CACrC,SAAS,MAAM,mBAAmB;EAChC,OAAO,YAAY,IAAI,IAAI,YAAY,MAAM,gBAAgB,CAAC,IAAI;CACpE;CACA,QAAQ;CACR,SAAS,YAAY,QAAQ;CAC7B,MAAM;AACR;AACA,MAAM,aAAa;CACjB,cAAc,CAAC,UAAU,YAAY;CACrC,SAAS,MAAM,mBAAmB;EAChC,OAAO,YAAY,IAAI,IAAI,YAAY,MAAM,gBAAgB,CAAC,IAAI;CACpE;CACA,QAAQ;CACR,SAAS,YAAY,OAAO;CAC5B,MAAM;AACR;AACA,MAAM,eAAe;CACnB,cAAc,CAAC,UAAU,YAAY;CACrC,SAAS,MAAM,mBAAmB;EAChC,OAAO,YAAY,IAAI,IAAI,YAAY,MAAM,gBAAgB,CAAC,IAAI;CACpE;CACA,QAAQ;CACR,SAAS,YAAY,QAAQ;CAC7B,MAAM;AACR;AACA,MAAM,cAAc;CAClB,QAAQ,CAAC,MAAM;CACf,KAAK;CACL,MAAM;AACR;AACA,MAAM,YAAY;CAChB,QAAQ,CAAC,WAAW;CACpB,KAAK;CACL,MAAM;AACR;AACA,MAAM,mBAAmB;CACvB,QAAQ,CAAC,QAAQ,QAAQ;CACzB,KAAK;CACL,MAAM;AACR;AACA,MAAM,yBAAyB;CAC7B,QAAQ,CAAC,QAAQ,QAAQ;CACzB,WAAW;CACX,KAAK;CACL,MAAM;AACR;AACA,MAAM,YAAY;CAChB,QAAQ,CAAC,MAAM;CACf,KAAK;CACL,MAAM;AACR;AACA,MAAM,kBAAkB;CACtB,QAAQ,CAAC,MAAM;CACf,WAAW;CACX,KAAK;CACL,MAAM;AACR;AACA,MAAM,gBAAgB;CACpB,QAAQ,CAAC,eAAe;CACxB,KAAK;CACL,MAAM;AACR;AACA,MAAM,cAAc;CAClB,QAAQ,CAAC,QAAQ;CACjB,KAAK;CACL,MAAM;AACR;AACA,MAAM,oBAAoB;CACxB,QAAQ,CAAC,QAAQ;CACjB,WAAW;CACX,KAAK;CACL,MAAM;AACR;AAMA,MAAM,OAAO;CACX,cAAc,CAAC,QAAQ;CACvB,SAAS,MAAM,gBAAgB,iBAAiB;EAC9C,IAAI,CAAC,YAAY,IAAI,KAAK,gBAAgB,IAAI,GAC5C,OAAO;EAET,MAAM,cAAc,eAAe,IAAI;EACvC,IAAI,QAAQ,KAAK,SAAS;EAC1B,IAAI,SAAS,MACX,QAAQ,MAAM,QAAQ,YAAY,MAAM;EAG1C,OADoB,QAAQ,IAAI,YAAY,IAAI,KAAK,OAAO,EAAE,IAAI,MAAM,MAAM,IAAI,YAAY,IAAI,KAAK,OAAO,EAAE;CAElH;CACA,cAAc;CACd,QAAQ;CACR,UAAU,UAAU,UAAU;EAE5B,IAAIC,oBAAsB,UAAU,WAAW,GAC7C;EAEF,MAAM,GAAG,UAAU,YAAY,gBAAgB;EAG/C,MAAM,WAAW,gBAFD,cAAc,OAAO,aAAa,UAAU,IAAI,KAAA,GAEtB,EACxC,OAFgB,gBAAgB,OAAO,aAAa,YAAY,IAAI,KAAA,EAGtE,CAAC;EACD,MAAM,oBAAoB,SAAS,MAAM,GAAG,EAAE,SAAS;EACvD,MAAM,qBAAqB,SAAS,MAAM,GAAG,EAAE,SAAS;EACxD,IAAI,iBAAiB;EACrB,IAAI,kBAAkB;EACtB,IAAI,oBAAoB,oBACtB;OACK,IAAI,oBAAoB,oBAAoB;GACjD,MAAM,gBAAgB,SAAS,MAAM,GAAG;GACxC,kBAAkB,MAAM,cAAc;GACtC,iBAAiB,cAAc,MAAM,CAAC,EAAE,KAAK,GAAG;EAClD;EACA,MAAM,eAAe,gBAAgB,cAAc;EACnD,aAAa,UAAU,SAAS,UAAU,CAAC;EAC3C,SAAS,OAAO,YAAY;EAC5B,SAAS,QAAQ,QAAQ;EACzB,IAAI,iBACF,SAAS,aAAa,gBAAgB,eAAe,CAAC;EAExD,OAAO;CACT;CACA,SAAS;CACT,MAAM;AACR;AACA,MAAM,uBAAuB;CAAC;CAAS;CAAO;CAAgB;AAAY;AAC1E,MAAM,iCAAiC,CAAC,IAAI;AAM5C,MAAM,2BAA2B;CAAC;CAAa;CAAkB;CAAwB;CAAW;CAAiB;CAAW;CAAa;CAAmB;AAAa;AAC7K,MAAM,0BAA0B,CAAC,IAAI;AACrC,MAAM,eAAe;CAAC,GAAG;CAAsB,GAAG;CAAgC,GAAG;CAA0B,GAAG;AAAuB;AACzI,SAAS,kBAAkB,OAAO,2BAA2B,OAAO;CAClE,MAAM,QAAQ,MAAM,MAAM,IAAI;CAC9B,IAAI,cAAc;CAClB,MAAM,iBAAiB,CAAC;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,UAAU,MAAM;EACtB,MAAM,OAAO,QAAQ,QAAQ;EAC7B,MAAM,WAAW,eAAe,eAAe,SAAS;EAGxD,IAAI,uBAAuB,KAAK,IAAI,GAAG;GACrC,eAAe,KAAK,IAAI;GACxB;EACF;EAGA,IAAI,iBAAiB,KAAK,IAAI,KAAK,eAAe,KAAK,IAAI,GAAG;GAC5D,cAAc,CAAC;GACf,eAAe,KAAK,IAAI;GACxB;EACF;EAGA,IAAI,aAAa;GACf,eAAe,KAAK,OAAO;GAC3B;EACF;EAIA,IAAI,SAAS,MAAM,aAAa,MAAM,CAAC,YAAY,cAAc,KAAK,QAAQ,KAAK,cAAc,KAAK,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,mBAAmB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,iBAAiB,KAAK,IAAI,KAAK,kBAAkB,KAAK,IAAI,KAAK,0BAA0B,KAAK,IAAI,KAAK,CAAC,4BAA4B,gBAAgB,KAAK,IAAI,KAAK,cAAc,KAAK,IAAI,KAAK,UAAU,aAAa,EAAE,KAAK,QAAQ,KAAK,UAAU,eAAe,EAAE,KAAK,QAAQ,KAAK,eAAe,KAAK,QAAQ,GAK7f,eAAe,KAAK,CAAC,4BAA4B,SAAS,KAAK,UAAU,IAAI;OAE7E,eAAe,eAAe,SAAS,KAAK,WAAW,MAAM,KAAK,UAAU;CAEhF;CACA,OAAO,eAAe,KAAK,IAAI;AACjC;AAEA,SAAS,uBAAuB,YAAY,YAAY,cAAc,qBAAqB;CAEzF,IAAI,CAAC,oBADmB,WAAW,UACI,CAAC,KAAK,WAAW,cAAc,MAAM,YAC1E,OAAO;CAET,MAAM,cAAc,WAAW,eAAe;CAQ9C,IAAI,YAAY,eAAe,OAAO,KACpC,OAAO;CAET,KAAK,MAAM,EACT,QACA,aACG,qBAAqB;EACxB,MAAM,QAAQ,YAAY,MAAM,MAAM;EACtC,IAAI,SAAS,MAAM,GAAG,YAAY,MAAM,GAAG,SAAS,GAAG,IAAI,eAAe,eAAe,IAAI;GAC3F,MAAM,eAAe,WAAW,gBAAgB;GAChD,MAAM,CAAC,aAAa,iBAAiB,WAAW,UAAU,YAAY;GAEtE,IAAI,QAAQ,YADK,gBAAgB,CAAC,eAAe,GAAG,YAAY,IAAI,cAClC,OAAO,KAAK,MAAM,OAAO;IACzD,YAAY,OAAO;IACnB,OAAO;GACT;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,gCAAgC,YAAY,YAAY,cAAc,qBAAqB,gBAAgB;CAElH,IAAI,CAAC,oBADmB,WAAW,UACI,CAAC,KAAK,WAAW,cAAc,MAAM,YAC1E,OAAO;CAET,MAAM,cAAc,WAAW,eAAe;CAC9C,IAAI,CAAC;MAOC,YAAY,eAAe,OAAO,KACpC,OAAO;CAAA;CAGX,KAAK,MAAM,EACT,aACA,SACA,eACG,qBAAqB;EACxB,IAAI,aAAa,EAAE,cAAc,cAAc,aAAa,cAAc,aAAa,CAAC,UAAU,UAChG;EAEF,MAAM,QAAQ,YAAY,MAAM,WAAW;EAC3C,IAAI,OAAO;GACT,MAAM,cAAc,kBAAkB,MAAM,GAAG,SAAS,GAAG,IAAI,eAAe,eAAe;GAC7F,IAAI,MAAM,GAAG,WAAW,aACtB;GAEF,MAAM,eAAe,WAAW,gBAAgB;GAChD,MAAM,CAAC,aAAa,iBAAiB,WAAW,UAAU,YAAY;GAEtE,IAAI,QAAQ,YADK,gBAAgB,CAAC,eAAe,GAAG,YAAY,IAAI,cAClC,OAAO,MAAM,MAAM,KAAK,MAAM,OAAO;IACrE,YAAY,OAAO;IACnB,OAAO;GACT;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,yBAAyB,YAAY,cAAc,uBAAuB;CACjF,IAAI,cAAc,WAAW,eAAe;CAE5C,MAAM,eAAe,sBADJ,YAAY,eAAe;CAE5C,IAAI,gBAAgB,MAClB,OAAO;CAKT,IAAI,eAAe,YAAY,QAC7B,cAAc,YAAY,MAAM,GAAG,YAAY;CAEjD,KAAK,MAAM,eAAe,cAAc;EACtC,IAAI,CAAC,YAAY,WAAW,CAAC,YAAY,QACvC;EAEF,MAAM,QAAQ,YAAY,MAAM,YAAY,MAAM;EAClD,IAAI,UAAU,MACZ;EAEF,MAAM,aAAa,MAAM,SAAS;EAClC,MAAM,WAAW,aAAa,MAAM,GAAG;EACvC,IAAI;EACJ,IAAI,eAAe,GACjB,CAAC,eAAe,WAAW,UAAU,QAAQ;OAE7C,GAAG,eAAe,WAAW,UAAU,YAAY,QAAQ;EAE7D,YAAY,WAAW,GAAG,CAAC;EAC3B,YAAY,QAAQ,aAAa,KAAK;EACtC,OAAO;CACT;CACA,OAAO;AACT;AACA,SAAS,2BAA2B,YAAY,cAAc,wBAAwB;CACpF,MAAM,cAAc,WAAW,eAAe;CAC9C,MAAM,mBAAmB,eAAe;CACxC,MAAM,YAAY,YAAY;CAE9B,MAAM,WAAW,uBAAuB;CACxC,IAAI,CAAC,UACH,OAAO;CAET,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,EACJ,QACE;EACJ,MAAM,YAAY,IAAI;EACtB,MAAM,qBAAqB,mBAAmB,YAAY;EAG1D,IAAI,YAAY;OACV,CAAC,iBAAiB,aAAa,oBAAoB,KAAK,GAAG,SAAS,GACtE;EAAA;EAKJ,IAAI,YAAY,qBAAqB,OAAO,KAC1C;EAIF,MAAM,oBAAoB,YAAY,mBAAmB;EACzD,IAAI,QAAQ,cAAc,SAAS,qBAAqB,CAAC,qBAAqB,KAAK,iBAAiB,GAClG;EAEF,MAAM,YAAY;EAClB,IAAI,WAAW;EACf,IAAI,oBAAoB,qBAAqB,aAAa,oBAAoB,GAAG;EAIjF,IAAI,UAAU;EACd,OAAO,oBAAoB,MAAM,UAAU,QAAQ,mBAAmB,IAAI;GACxE,IAAI,iBAAiB,OAAO,GAC1B;GAEF,IAAI,YAAY,OAAO,GAAG;IACxB,IAAI,QAAQ,UAAU,MAAM,GAC1B;IAEF,MAAM,qBAAqB,QAAQ,eAAe;IAClD,WAAW;IACX,oBAAoB,qBAAqB,oBAAoB,mBAAmB,QAAQ,GAAG;GAC7F;EACF;EAGA,IAAI,oBAAoB,GACtB;EAIF,IAAI,aAAa,aAAa,oBAAoB,cAAc,oBAC9D;EAIF,MAAM,mBAAmB,SAAS,eAAe;EACjD,IAAI,oBAAoB,KAAK,iBAAiB,oBAAoB,OAAO,WACvE;EAIF,MAAM,oBAAoB,iBAAiB,oBAAoB;EAC/D,IAAI,QAAQ,cAAc,SAAS,qBAAqB,CAAC,qBAAqB,KAAK,iBAAiB,GAClG;EAIF,IAAI,CAAC,QAAQ,OAAO,SAAS,MAAM,KAAK,0BAA0B,UAAU,iBAAiB,GAC3F;EAKF,MAAM,oBAAoB,UAAU,eAAe;EACnD,MAAM,gBAAgB,kBAAkB,MAAM,GAAG,kBAAkB,IAAI,kBAAkB,MAAM,mBAAmB,CAAC;EACnH,UAAU,eAAe,aAAa;EACtC,MAAM,eAAe,aAAa,YAAY,gBAAgB;EAC9D,SAAS,eAAe,aAAa,MAAM,GAAG,iBAAiB,IAAI,aAAa,MAAM,oBAAoB,SAAS,CAAC;EACpH,MAAM,YAAY,cAAc;EAChC,MAAM,gBAAgB,sBAAsB;EAC5C,cAAc,aAAa;EAE3B,MAAM,YAAY,mBAAmB,aAAa,aAAa,YAAY,IAAI,KAAK;EACpF,cAAc,OAAO,IAAI,SAAS,OAAO,mBAAmB,MAAM;EAClE,cAAc,MAAM,IAAI,UAAU,OAAO,WAAW,MAAM;EAG1D,KAAK,MAAM,UAAU,QAAQ,QAC3B,IAAI,CAAC,cAAc,UAAU,MAAM,GACjC,cAAc,WAAW,MAAM;EAKnC,cAAc,OAAO,IAAI,cAAc,MAAM,KAAK,cAAc,MAAM,QAAQ,cAAc,MAAM,IAAI;EAGtG,KAAK,MAAM,UAAU,QAAQ,QAC3B,IAAI,cAAc,UAAU,MAAM,GAChC,cAAc,aAAa,MAAM;EAGrC,IAAI,kBAAkB,SAAS,GAC7B,cAAc,SAAS,UAAU;EAEnC,OAAO;CACT;CACA,OAAO;AACT;AAMA,SAAS,0BAA0B,MAAM,QAAQ;CAC/C,IAAI,gBAAgB;CACpB,MAAM,OAAO,KAAK,eAAe;CACjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAC1B,IAAI,KAAK,OAAO,KACd;CAGJ,OAAO,gBAAgB,MAAM;AAC/B;AACA,SAAS,qBAAqB,QAAQ,UAAU,KAAK;CACnD,MAAM,YAAY,IAAI;CACtB,KAAK,IAAI,IAAI,UAAU,KAAK,WAAW,KAAK;EAC1C,MAAM,aAAa,IAAI;EACvB,IAAI,iBAAiB,QAAQ,YAAY,KAAK,GAAG,SAAS,KAE1D,OAAO,aAAa,eAAe,KACjC,OAAO;CAEX;CACA,OAAO;AACT;AACA,SAAS,iBAAiB,SAAS,QAAQ,SAAS,QAAQ,QAAQ;CAClE,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAC1B,IAAI,QAAQ,SAAS,OAAO,QAAQ,SAAS,IAC3C,OAAO;CAGX,OAAO;AACT;AACA,SAAS,0BAA0B,QAAQ,eAAe,cAAc;CACtE,MAAM,SAAS,mBAAmB,YAAY;CAC9C,MAAM,kCAAkC,QAAQ,OAAO,aAAa,EAClE,UACI,IAAI,IAAI,SAAS,EAAE;CACzB,MAAM,iCAAiC,QAAQ,OAAO,YAAY,EAChE,cACI,OAAO;CACb,KAAK,MAAM,eAAe,cAAc;EACtC,MAAM,OAAO,YAAY;EACzB,IAAI,SAAS,aAAa,SAAS,gBAAgB,SAAS,qBAAqB;GAC/E,MAAM,eAAe,YAAY;GACjC,KAAK,MAAM,QAAQ,cACjB,IAAI,CAAC,OAAO,QAAQ,IAAI,GAEpB,sBAAsB,yCAAyC,KAAK,QAAQ,EAAE,+EAA+E;EAIrK;CACF;CACA,MAAM,cAAc,YAAY,YAAY,iBAAiB;EAC3D,IAAI,uBAAuB,YAAY,YAAY,cAAc,OAAO,OAAO,GAC7E,OAAO;EAET,IAAI,gCAAgC,YAAY,YAAY,cAAc,OAAO,gBAAgB,GAC/F,OAAO;EAET,IAAI,yBAAyB,YAAY,cAAc,8BAA8B,GACnF,OAAO;EAET,IAAI,2BAA2B,YAAY,cAAc,+BAA+B,GACtF,OAAO;EAET,OAAO;CACT;CACA,OAAO,cAAc,OAAO,wBAAwB,EAClD,MACA,aACA,aACA,sBACI;EAEJ,IAAI,KAAK,IAAI,iBAAiB,KAAK,KAAK,IAAI,YAAY,GACtD;EAIF,IAAI,OAAO,YAAY,GACrB;EAEF,MAAM,YAAY,YAAY,KAAK,aAAa;EAChD,MAAM,gBAAgB,gBAAgB,KAAK,aAAa;EAIxD,IAAI,CAAC,kBAAkB,aAAa,KAAK,CAAC,kBAAkB,SAAS,KAAK,CAAC,UAAU,YAAY,KAAK,UAAU,GAAG,aAAa,GAC9H;EAEF,MAAM,YAAY,UAAU,OAAO;EACnC,MAAM,eAAe,UAAU,OAAO;EACtC,MAAM,aAAa,YAAY,SAAS,IAAI,SAAS;EACrD,IAAI,CAAC,YAAY,UAAU,KAAK,CAAC,YAAY,IAAI,SAAS,KAAK,iBAAiB,KAAK,eAAe,cAAc,OAAO,SAAS,GAChI;EAEF,OAAO,aAAa;GAClB,IAAI,CAAC,gCAAgC,UAAU,GAC7C;GAEF,MAAM,aAAa,WAAW,UAAU;GACxC,IAAI,eAAe,QAAQ,YAAY,UAAU,GAC/C;GAEF,IAAI,WAAW,YAAY,YAAY,UAAU,OAAO,MAAM,GAC5D,cAAc,gBAAgB;EAElC,CAAC;CACH,CAAC,GAAG,OAAO,gBAAgB,oBAAmB,UAAS;EACrD,IAAI,UAAU,QAAQ,MAAM,UAC1B,OAAO;EAET,MAAM,YAAY,cAAc;EAChC,IAAI,CAAC,kBAAkB,SAAS,KAAK,CAAC,UAAU,YAAY,GAC1D,OAAO;EAET,MAAM,eAAe,UAAU,OAAO;EACtC,MAAM,aAAa,UAAU,OAAO,QAAQ;EAC5C,IAAI,CAAC,YAAY,UAAU,KAAK,CAAC,gCAAgC,UAAU,GACzE,OAAO;EAET,MAAM,aAAa,WAAW,UAAU;EACxC,IAAI,eAAe,QAAQ,YAAY,UAAU,GAC/C,OAAO;EAGT,IAAI,iBADgB,WAAW,eACA,EAAE,QAC/B,OAAO;EAET,IAAI,gCAAgC,YAAY,YAAY,cAAc,OAAO,kBAAkB,IAAI,GAAG;GACxG,IAAI,UAAU,MACZ,MAAM,eAAe;GAEvB,OAAO;EACT;EACA,OAAO;CACT,GAAG,oBAAoB,CAAC;AAC1B;;;;;;;;;;;;;;AAiBA,SAAS,2BAA2B,UAAU,eAAe,cAAc,MAAM,yBAAyB,OAAO,2BAA2B,OAAO;CACjJ,MAAM,oBAAoB,yBAAyB,WAAW,kBAAkB,UAAU,wBAAwB;CAElH,OADuB,qBAAqB,cAAc,sBACtC,EAAE,mBAAmB,IAAI;AAC/C;;;;AAKA,SAAS,yBAAyB,eAAe,cAAc,MAAM,yBAAyB,OAAO;CAEnG,OADuB,qBAAqB,cAAc,sBACtC,EAAE,IAAI;AAC5B"}
+{"version":3,"file":"LexicalMarkdown.dev-CRWkZwlp.mjs","names":["$findMatchingParent","$findMatchingParent$1"],"sources":["../../../node_modules/.pnpm/@lexical+markdown@0.44.0/node_modules/@lexical/markdown/LexicalMarkdown.dev.mjs"],"sourcesContent":["/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nimport { $isParagraphNode, $isTextNode, $getRoot, $isElementNode, $isDecoratorNode, $isLineBreakNode, $getSelection, $createTextNode, $createParagraphNode, $createLineBreakNode, $createTabNode, createState, $setState, $getState, $findMatchingParent as $findMatchingParent$1, mergeRegister, COLLABORATION_TAG, HISTORIC_TAG, $isRangeSelection, $addUpdateTag, HISTORY_PUSH_TAG, KEY_ENTER_COMMAND, COMMAND_PRIORITY_LOW, $isRootOrShadowRoot, $createRangeSelection, $setSelection } from 'lexical';\nimport { $isListNode, $isListItemNode, ListNode, ListItemNode, $createListItemNode, $createListNode } from '@lexical/list';\nimport { $isQuoteNode, HeadingNode, QuoteNode, $isHeadingNode, $createQuoteNode, $createHeadingNode } from '@lexical/rich-text';\nimport { $findMatchingParent } from '@lexical/utils';\nimport { CodeNode, $createCodeNode, $isCodeNode } from '@lexical/code-core';\nimport { LinkNode, $isLinkNode, $createLinkNode, $isAutoLinkNode } from '@lexical/link';\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction indexBy(list, callback) {\n  const index = {};\n  for (const item of list) {\n    const key = callback(item);\n    if (!key) {\n      continue;\n    }\n    if (index[key]) {\n      index[key].push(item);\n    } else {\n      index[key] = [item];\n    }\n  }\n  return index;\n}\nfunction transformersByType(transformers) {\n  const byType = indexBy(transformers, t => t.type);\n  return {\n    element: byType.element || [],\n    multilineElement: byType['multiline-element'] || [],\n    textFormat: byType['text-format'] || [],\n    textMatch: byType['text-match'] || []\n  };\n}\nconst PUNCTUATION_OR_SPACE = /[!-/:-@[-`{-~\\s]/;\nconst WHITESPACE = /[ \\t\\n\\r\\f]/;\nconst PUNCTUATION = /[!\"#$%&'()*+,\\-./:;<=>?@[\\]^_`{|}~]/;\nconst MARKDOWN_EMPTY_LINE_REG_EXP = /^\\s{0,3}$/;\nfunction isEmptyParagraph(node) {\n  if (!$isParagraphNode(node)) {\n    return false;\n  }\n  const firstChild = node.getFirstChild();\n  return firstChild == null || node.getChildrenSize() === 1 && $isTextNode(firstChild) && MARKDOWN_EMPTY_LINE_REG_EXP.test(firstChild.getTextContent());\n}\nfunction unescapeText(value) {\n  return value.replace(/\\\\([!-/:-@[-`{-~])/g, '$1').replace(/&#(\\d+);/g, (_, codePoint) => String.fromCodePoint(Number(codePoint)));\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n\n/**\n * Renders string from markdown. The selection is moved to the start after the operation.\n */\nfunction createMarkdownExport(transformers, shouldPreserveNewLines = false) {\n  const byType = transformersByType(transformers);\n  const elementTransformers = [...byType.multilineElement, ...byType.element];\n  const isNewlineDelimited = !shouldPreserveNewLines;\n\n  // Export only uses text formats that are responsible for single format\n  // e.g. it will filter out *** (bold, italic) and instead use separate ** and *\n  const textFormatTransformers = byType.textFormat.filter(transformer => transformer.format.length === 1)\n  // Make sure all text transformers that contain 'code' in their format are at the end of the array. Otherwise, formatted code like\n  // <strong><code>code</code></strong> will be exported as `**Bold Code**`, as the code format will be applied first, and the bold format\n  // will be applied second and thus skipped entirely, as the code format will prevent any further formatting.\n  .sort((a, b) => {\n    return Number(a.format.includes('code')) - Number(b.format.includes('code'));\n  });\n  return node => {\n    const output = [];\n    const children = (node || $getRoot()).getChildren();\n    for (let i = 0; i < children.length; i++) {\n      const child = children[i];\n      const result = exportTopLevelElements(child, elementTransformers, textFormatTransformers, byType.textMatch, shouldPreserveNewLines);\n      if (result != null) {\n        output.push(\n        // separate consecutive group of texts with a line break: eg. [\"hello\", \"world\"] -> [\"hello\", \"/nworld\"]\n        isNewlineDelimited && i > 0 && !isEmptyParagraph(child) && !isEmptyParagraph(children[i - 1]) ? '\\n'.concat(result) : result);\n      }\n    }\n    // Ensure consecutive groups of texts are at least \\n\\n apart while each empty paragraph render as a newline.\n    // Eg. [\"hello\", \"\", \"\", \"hi\", \"\\nworld\"] -> \"hello\\n\\n\\nhi\\n\\nworld\"\n    return output.join('\\n');\n  };\n}\nfunction exportTopLevelElements(node, elementTransformers, textTransformersIndex, textMatchTransformers, shouldPreserveNewLines) {\n  for (const transformer of elementTransformers) {\n    if (!transformer.export) {\n      continue;\n    }\n    const result = transformer.export(node, _node => exportChildren(_node, textTransformersIndex, textMatchTransformers, undefined, undefined, shouldPreserveNewLines));\n    if (result != null) {\n      return result;\n    }\n  }\n  if ($isElementNode(node)) {\n    return exportChildren(node, textTransformersIndex, textMatchTransformers, undefined, undefined, shouldPreserveNewLines);\n  } else if ($isDecoratorNode(node)) {\n    return node.getTextContent();\n  } else {\n    return null;\n  }\n}\nfunction exportChildren(node, textTransformersIndex, textMatchTransformers, unclosedTags, unclosableTags, shouldPreserveNewLines = false) {\n  const output = [];\n  const children = node.getChildren();\n  // keep track of unclosed tags from the very beginning\n  if (!unclosedTags) {\n    unclosedTags = [];\n  }\n  if (!unclosableTags) {\n    unclosableTags = [];\n  }\n  mainLoop: for (const child of children) {\n    for (const transformer of textMatchTransformers) {\n      if (!transformer.export) {\n        continue;\n      }\n      const result = transformer.export(child, parentNode => exportChildren(parentNode, textTransformersIndex, textMatchTransformers, unclosedTags,\n      // Add current unclosed tags to the list of unclosable tags - we don't want nested tags from\n      // textmatch transformers to close the outer ones, as that may result in invalid markdown.\n      // E.g. **text [text**](https://lexical.io)\n      // is invalid markdown, as the closing ** is inside the link.\n      //\n      [...unclosableTags, ...unclosedTags], shouldPreserveNewLines), (textNode, textContent) => exportTextFormat(textNode, textContent, textTransformersIndex, unclosedTags, unclosableTags, shouldPreserveNewLines));\n      if (result != null) {\n        output.push(result);\n        continue mainLoop;\n      }\n    }\n    if ($isLineBreakNode(child)) {\n      output.push('\\n');\n    } else if ($isTextNode(child)) {\n      output.push(exportTextFormat(child, child.getTextContent(), textTransformersIndex, unclosedTags, unclosableTags, shouldPreserveNewLines));\n    } else if ($isElementNode(child)) {\n      // empty paragraph returns \"\"\n      output.push(exportChildren(child, textTransformersIndex, textMatchTransformers, unclosedTags, unclosableTags, shouldPreserveNewLines));\n    } else if ($isDecoratorNode(child)) {\n      output.push(child.getTextContent());\n    }\n  }\n  return output.join('');\n}\nfunction exportTextFormat(node, textContent, textTransformers,\n// unclosed tags include the markdown tags that haven't been closed yet, and their associated formats\nunclosedTags, unclosableTags, shouldPreserveNewLines = false) {\n  // This function handles the case of a string looking like this: \"   foo   \"\n  // Where it would be invalid markdown to generate: \"**   foo   **\"\n  // If the node has no format, we use the original text.\n  // Otherwise, we escape leading and trailing whitespaces to their corresponding code points,\n  // ensuring the returned string maintains its original formatting, e.g., \"**&#32;&#32;&#32;foo&#32;&#32;&#32;**\".\n\n  let output = textContent;\n  if (!node.hasFormat('code')) {\n    // Preserve literal backslashes when preserving source newlines.\n    output = shouldPreserveNewLines ? output.replace(/([*_`~])/g, '\\\\$1') : output.replace(/([*_`~\\\\])/g, '\\\\$1');\n  }\n\n  // Extract leading and trailing whitespaces.\n  // CommonMark flanking rules require formatting tags to be adjacent to non-whitespace characters.\n  const match = output.match(/^(\\s*)(.*?)(\\s*)$/s) || ['', '', output, ''];\n  const leadingSpace = match[1];\n  const trimmedOutput = match[2];\n  const trailingSpace = match[3];\n  const isWhitespaceOnly = trimmedOutput === '';\n\n  // the opening tags to be added to the result\n  let openingTags = '';\n  // the closing tags to be added to the result\n  let closingTagsBefore = '';\n  let closingTagsAfter = '';\n  const prevNode = getTextSibling(node, true);\n  const nextNode = getTextSibling(node, false);\n  const applied = new Set();\n  for (const transformer of textTransformers) {\n    const format = transformer.format[0];\n    const tag = transformer.tag;\n\n    // dedup applied formats\n    if (checkHasFormat(node, format) && !applied.has(format)) {\n      applied.add(format);\n\n      // append the tag to openingTags, if it's not applied to the previous nodes,\n      // or the nodes before that (which would result in an unclosed tag)\n      if (!checkHasFormat(prevNode, format) || !unclosedTags.find(element => element.tag === tag)) {\n        unclosedTags.push({\n          format,\n          tag\n        });\n        openingTags += tag;\n      }\n    }\n  }\n\n  // close any tags in the same order they were applied, if necessary\n  for (let i = 0; i < unclosedTags.length; i++) {\n    const nodeHasFormat = hasFormat(node, unclosedTags[i].format);\n    const nextNodeHasFormat = hasFormat(nextNode, unclosedTags[i].format);\n\n    // prevent adding closing tag if next sibling will do it\n    if (nodeHasFormat && nextNodeHasFormat) {\n      continue;\n    }\n    const unhandledUnclosedTags = [...unclosedTags]; // Shallow copy to avoid modifying the original array\n\n    while (unhandledUnclosedTags.length > i) {\n      const unclosedTag = unhandledUnclosedTags.pop();\n\n      // If tag is unclosable, don't close it and leave it in the original array,\n      // So that it can be closed when it's no longer unclosable\n      if (unclosableTags && unclosedTag && unclosableTags.find(element => element.tag === unclosedTag.tag)) {\n        continue;\n      }\n      if (unclosedTag && typeof unclosedTag.tag === 'string') {\n        if (!nodeHasFormat) {\n          // Handles cases where the tag has not been closed before, e.g. if the previous node\n          // was a text match transformer that did not account for closing tags of the next node (e.g. a link)\n          closingTagsBefore += unclosedTag.tag;\n        } else if (!nextNodeHasFormat) {\n          closingTagsAfter += unclosedTag.tag;\n        }\n      }\n      // Mutate the original array to remove the closed tag\n      unclosedTags.pop();\n    }\n    break;\n  }\n  // If the node is entirely whitespace, we don't apply opening/closing tags around it.\n  // However, it must still output closing tags from previous nodes.\n  if (isWhitespaceOnly && !node.hasFormat('code')) {\n    return closingTagsBefore + output;\n  }\n\n  // Flanking Compliance: Notice how openingTags and closingTagsAfter are placed INSIDE the whitespace boundaries!\n  return closingTagsBefore + leadingSpace + openingTags + trimmedOutput + closingTagsAfter + trailingSpace;\n}\nfunction getTextSibling(node, backward) {\n  const sibling = backward ? node.getPreviousSibling() : node.getNextSibling();\n  if ($isTextNode(sibling)) {\n    return sibling;\n  }\n  return null;\n}\nfunction hasFormat(node, format) {\n  return $isTextNode(node) && node.hasFormat(format);\n}\nfunction checkHasFormat(n, f) {\n  if (!hasFormat(n, f)) {\n    return false;\n  }\n  if (f === 'code') {\n    return true;\n  }\n  if (n && /^\\s*$/.test(n.getTextContent())) {\n    return false;\n  }\n  return true;\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction findOutermostTextFormatTransformer(textNode, textFormatTransformersIndex) {\n  const textContent = textNode.getTextContent();\n\n  // Find code span first. Emphasis delimiters inside inline elements (e.g., code spans)\n  // should not be processed. Currently only code spans are handled; other inline elements\n  // (e.g., links, raw HTML) may need similar treatment in the future.\n  const codeRegex = textFormatTransformersIndex.fullMatchRegExpByTag['`'];\n  const codeTransformer = textFormatTransformersIndex.transformersByTag['`'];\n  const excludeRanges = [];\n  let codeMatch = null;\n  if (codeRegex && codeTransformer) {\n    const globalRegex = new RegExp(codeRegex.source, 'g');\n    const matches = Array.from(textContent.matchAll(globalRegex));\n    for (const match of matches) {\n      // Group 1 captures the character preceding the opening backtick (or an\n      // empty string when the span starts at position 0). Offset past it so\n      // startIndex points to the backtick itself.\n      const startIndex = match.index + match[1].length;\n      const endIndex = match.index + match[0].length;\n      if (!codeMatch) {\n        codeMatch = {\n          content: match[3],\n          endIndex,\n          startIndex,\n          tag: '`'\n        };\n      }\n      excludeRanges.push({\n        end: endIndex,\n        start: startIndex\n      });\n    }\n  }\n  const delimiters = scanDelimiters(textContent, textFormatTransformersIndex, excludeRanges);\n  const emphasisMatch = delimiters.length > 0 ? processEmphasis(textContent, delimiters, textFormatTransformersIndex) : null;\n  let resultMatch = null;\n  let resultTransformer = null;\n  if (codeMatch && emphasisMatch) {\n    if (emphasisMatch.startIndex <= codeMatch.startIndex && emphasisMatch.endIndex >= codeMatch.endIndex) {\n      resultMatch = emphasisMatch;\n      resultTransformer = textFormatTransformersIndex.transformersByTag[emphasisMatch.tag];\n    } else {\n      resultMatch = codeMatch;\n      resultTransformer = codeTransformer;\n    }\n  } else if (codeMatch) {\n    resultMatch = codeMatch;\n    resultTransformer = codeTransformer;\n  } else if (emphasisMatch) {\n    resultMatch = emphasisMatch;\n    resultTransformer = textFormatTransformersIndex.transformersByTag[emphasisMatch.tag];\n  }\n  if (!resultMatch || !resultTransformer) {\n    return null;\n  }\n  const regexMatch = [textContent.slice(resultMatch.startIndex, resultMatch.endIndex), resultMatch.tag, resultMatch.content];\n  regexMatch.index = resultMatch.startIndex;\n  regexMatch.input = textContent;\n  return {\n    endIndex: resultMatch.endIndex,\n    match: regexMatch,\n    startIndex: resultMatch.startIndex,\n    transformer: resultTransformer\n  };\n}\nfunction scanDelimiters(text, transformersIndex, excludeRanges = []) {\n  const delimiters = [];\n  const delimiterChars = new Set(Object.keys(transformersIndex.transformersByTag).filter(tag => tag[0] !== '`').map(tag => tag[0]));\n  const isEscaped = index => {\n    let count = 0;\n    for (let i = index - 1; i >= 0 && text[i] === '\\\\'; i--) {\n      count++;\n    }\n    return count % 2 === 1;\n  };\n  const isInExcludedRange = index => {\n    return excludeRanges.some(range => index >= range.start && index < range.end);\n  };\n  let i = 0;\n  while (i < text.length) {\n    const char = text[i];\n    if (!delimiterChars.has(char) || isEscaped(i) || isInExcludedRange(i)) {\n      i++;\n      continue;\n    }\n    let len = 1;\n    while (i + len < text.length && text[i + len] === char) {\n      len++;\n    }\n    const canOpen = canEmphasis(char, text, i, len, true);\n    const canClose = canEmphasis(char, text, i, len, false);\n    if (canOpen || canClose) {\n      delimiters.push({\n        active: true,\n        canClose,\n        canOpen,\n        char,\n        index: i,\n        length: len,\n        originalLength: len\n      });\n    }\n    i += len;\n  }\n  return delimiters;\n}\nfunction processEmphasis(text, delimiters, transformersIndex) {\n  const openersBottom = {};\n  let currentPos = 0;\n  let result = null;\n  while (currentPos < delimiters.length) {\n    const closer = delimiters[currentPos];\n    if (!closer.active || !closer.canClose || closer.length === 0) {\n      currentPos++;\n      continue;\n    }\n    const bottomKey = `${closer.char}${closer.canOpen}`;\n    const bottom = openersBottom[bottomKey] ?? -1;\n    let foundOpener = false;\n    for (let openIdx = currentPos - 1; openIdx > bottom; openIdx--) {\n      const opener = delimiters[openIdx];\n      if (!opener.active || !opener.canOpen || opener.length === 0 || opener.char !== closer.char) {\n        continue;\n      }\n\n      // Rule of 3\n      if (opener.canClose || closer.canOpen) {\n        const sum = opener.originalLength + closer.originalLength;\n        if (sum % 3 === 0 && opener.originalLength % 3 !== 0 && closer.originalLength % 3 !== 0) {\n          continue;\n        }\n      }\n      const maxLen = Math.min(opener.length, closer.length);\n      const matchedTag = Object.keys(transformersIndex.transformersByTag).filter(t => t[0] === opener.char && t.length <= maxLen).sort((a, b) => b.length - a.length)[0];\n      if (!matchedTag) {\n        continue;\n      }\n      foundOpener = true;\n      const matchLen = matchedTag.length;\n      const match = {\n        content: text.slice(opener.index + opener.length, closer.index),\n        endIndex: closer.index + matchLen,\n        startIndex: opener.index + (opener.length - matchLen),\n        tag: matchedTag\n      };\n      if (!result || match.startIndex < result.startIndex || match.startIndex === result.startIndex && match.endIndex > result.endIndex) {\n        result = match;\n      }\n      for (let j = openIdx + 1; j < currentPos; j++) {\n        delimiters[j].active = false;\n      }\n      opener.length -= matchLen;\n      closer.length -= matchLen;\n      opener.active = opener.length > 0;\n      if (closer.length > 0) {\n        closer.index += matchLen;\n      } else {\n        closer.active = false;\n        currentPos++;\n      }\n      break;\n    }\n    if (!foundOpener) {\n      openersBottom[bottomKey] = currentPos - 1;\n      if (!closer.canOpen) {\n        closer.active = false;\n      }\n      currentPos++;\n    }\n  }\n  return result;\n}\nfunction canEmphasis(char, text, index, length, isOpen) {\n  if (!isFlanking(text, index, length, isOpen)) {\n    return false;\n  }\n  if (char === '*') {\n    return true;\n  }\n  if (char === '_') {\n    if (!isFlanking(text, index, length, !isOpen)) {\n      return true;\n    }\n    const adjacentChar = isOpen ? text[index - 1] : text[index + length];\n    return adjacentChar !== undefined && PUNCTUATION.test(adjacentChar);\n  }\n  return true;\n}\nfunction isFlanking(text, index, length, isLeft) {\n  const charBefore = text[index - 1];\n  const charAfter = text[index + length];\n  const [primary, secondary] = isLeft ? [charAfter, charBefore] : [charBefore, charAfter];\n  if (primary === undefined || WHITESPACE.test(primary)) {\n    return false;\n  }\n  if (!PUNCTUATION.test(primary)) {\n    return true;\n  }\n  return secondary === undefined || WHITESPACE.test(secondary) || PUNCTUATION.test(secondary);\n}\nfunction importTextFormatTransformer(textNode, startIndex, endIndex, transformer, match) {\n  const textContent = textNode.getTextContent();\n\n  // No text matches - we can safely process the text format match\n  let transformedNode, nodeAfter, nodeBefore;\n\n  // If matching full content there's no need to run splitText and can reuse existing textNode\n  // to update its content and apply format. E.g. for **_Hello_** string after applying bold\n  // format (**) it will reuse the same text node to apply italic (_)\n  if (match[0] === textContent) {\n    transformedNode = textNode;\n  } else {\n    if (startIndex === 0) {\n      [transformedNode, nodeAfter] = textNode.splitText(endIndex);\n    } else {\n      [nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex);\n    }\n  }\n  transformedNode.setTextContent(match[2]);\n  if (transformer) {\n    for (const format of transformer.format) {\n      if (!transformedNode.hasFormat(format)) {\n        transformedNode.toggleFormat(format);\n      }\n    }\n  }\n  return {\n    nodeAfter: nodeAfter,\n    nodeBefore: nodeBefore,\n    transformedNode: transformedNode\n  };\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nfunction findOutermostTextMatchTransformer(textNode_, textMatchTransformers) {\n  const textNode = textNode_;\n  let foundMatchStartIndex = undefined;\n  let foundMatchEndIndex = undefined;\n  let foundMatchTransformer = undefined;\n  let foundMatch = undefined;\n  for (const transformer of textMatchTransformers) {\n    if (!transformer.replace || !transformer.importRegExp) {\n      continue;\n    }\n    const match = textNode.getTextContent().match(transformer.importRegExp);\n    if (!match) {\n      continue;\n    }\n    const startIndex = match.index || 0;\n    const endIndex = transformer.getEndIndex ? transformer.getEndIndex(textNode, match) : startIndex + match[0].length;\n    if (endIndex === false) {\n      continue;\n    }\n    if (foundMatchStartIndex === undefined || foundMatchEndIndex === undefined ||\n    // Wraps previous match or is strictly before it.\n    startIndex < foundMatchStartIndex && (endIndex > foundMatchEndIndex || endIndex <= foundMatchStartIndex)) {\n      foundMatchStartIndex = startIndex;\n      foundMatchEndIndex = endIndex;\n      foundMatchTransformer = transformer;\n      foundMatch = match;\n    }\n  }\n  if (foundMatchStartIndex === undefined || foundMatchEndIndex === undefined || foundMatchTransformer === undefined || foundMatch === undefined) {\n    return null;\n  }\n  return {\n    endIndex: foundMatchEndIndex,\n    match: foundMatch,\n    startIndex: foundMatchStartIndex,\n    transformer: foundMatchTransformer\n  };\n}\nfunction importFoundTextMatchTransformer(textNode, startIndex, endIndex, transformer, match) {\n  let transformedNode, nodeAfter, nodeBefore;\n  if (startIndex === 0) {\n    [transformedNode, nodeAfter] = textNode.splitText(endIndex);\n  } else {\n    [nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex);\n  }\n  if (!transformer.replace) {\n    return null;\n  }\n  const potentialTransformedNode = transformer.replace(transformedNode, match);\n  return {\n    nodeAfter,\n    nodeBefore,\n    transformedNode: potentialTransformedNode || undefined\n  };\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n\n/**\n * Returns true if the node can contain transformable markdown.\n * Code nodes cannot contain transformable markdown.\n * For example, `code **bold**` should not be transformed to\n * <code>code <strong>bold</strong></code>.\n */\nfunction canContainTransformableMarkdown(node) {\n  return $isTextNode(node) && !node.hasFormat('code');\n}\n\n/**\n * Handles applying both text format and text match transformers.\n * It finds the outermost text format or text match and applies it,\n * then recursively calls itself to apply the next outermost transformer,\n * until there are no more transformers to apply.\n */\nfunction importTextTransformers(textNode, textFormatTransformersIndex, textMatchTransformers) {\n  let foundTextFormat = findOutermostTextFormatTransformer(textNode, textFormatTransformersIndex);\n  let foundTextMatch = findOutermostTextMatchTransformer(textNode, textMatchTransformers);\n  if (foundTextFormat && foundTextMatch) {\n    // Find the outermost transformer\n    if (foundTextFormat.startIndex <= foundTextMatch.startIndex && foundTextFormat.endIndex >= foundTextMatch.endIndex ||\n    // foundTextMatch is not contained within foundTextFormat\n    foundTextMatch.startIndex > foundTextFormat.endIndex) {\n      // foundTextFormat wraps foundTextMatch - apply foundTextFormat by setting foundTextMatch to null\n      foundTextMatch = null;\n    } else {\n      // foundTextMatch wraps foundTextFormat - apply foundTextMatch by setting foundTextFormat to null\n      foundTextFormat = null;\n    }\n  }\n  if (foundTextFormat) {\n    const result = importTextFormatTransformer(textNode, foundTextFormat.startIndex, foundTextFormat.endIndex, foundTextFormat.transformer, foundTextFormat.match);\n    if (canContainTransformableMarkdown(result.nodeAfter)) {\n      importTextTransformers(result.nodeAfter, textFormatTransformersIndex, textMatchTransformers);\n    }\n    if (canContainTransformableMarkdown(result.nodeBefore)) {\n      importTextTransformers(result.nodeBefore, textFormatTransformersIndex, textMatchTransformers);\n    }\n    if (canContainTransformableMarkdown(result.transformedNode)) {\n      importTextTransformers(result.transformedNode, textFormatTransformersIndex, textMatchTransformers);\n    }\n  } else if (foundTextMatch) {\n    const result = importFoundTextMatchTransformer(textNode, foundTextMatch.startIndex, foundTextMatch.endIndex, foundTextMatch.transformer, foundTextMatch.match);\n    if (!result) {\n      return;\n    }\n    if (canContainTransformableMarkdown(result.nodeAfter)) {\n      importTextTransformers(result.nodeAfter, textFormatTransformersIndex, textMatchTransformers);\n    }\n    if (canContainTransformableMarkdown(result.nodeBefore)) {\n      importTextTransformers(result.nodeBefore, textFormatTransformersIndex, textMatchTransformers);\n    }\n    if (canContainTransformableMarkdown(result.transformedNode)) {\n      importTextTransformers(result.transformedNode, textFormatTransformersIndex, textMatchTransformers);\n    }\n  }\n\n  // Handle escape characters\n  const textContent = textNode.getTextContent();\n  const unescapedText = unescapeText(textContent);\n  textNode.setTextContent(unescapedText);\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n/**\n * Renders markdown from a string. The selection is moved to the start after the operation.\n */\nfunction createMarkdownImport(transformers, shouldPreserveNewLines = false) {\n  const byType = transformersByType(transformers);\n  const textFormatTransformersIndex = createTextFormatTransformersIndex(byType.textFormat);\n  return (markdownString, node) => {\n    const lines = markdownString.split('\\n');\n    const linesLength = lines.length;\n    const root = node || $getRoot();\n    root.clear();\n    for (let i = 0; i < linesLength; i++) {\n      const lineText = lines[i];\n      const [imported, shiftedIndex] = $importMultiline(lines, i, byType.multilineElement, root);\n      if (imported) {\n        // If a multiline markdown element was imported, we don't want to process the lines that were part of it anymore.\n        // There could be other sub-markdown elements (both multiline and normal ones) matching within this matched multiline element's children.\n        // However, it would be the responsibility of the matched multiline transformer to decide how it wants to handle them.\n        // We cannot handle those, as there is no way for us to know how to maintain the correct order of generated lexical nodes for possible children.\n        i = shiftedIndex; // Next loop will start from the line after the last line of the multiline element\n        continue;\n      }\n      $importBlocks(lineText, root, byType.element, textFormatTransformersIndex, byType.textMatch, shouldPreserveNewLines);\n    }\n    const children = root.getChildren();\n    for (const child of children) {\n      // By default, removing empty paragraphs as md does not really\n      // allow empty lines and uses them as delimiter.\n      // If you need empty lines set shouldPreserveNewLines = true.\n      if (!shouldPreserveNewLines && isEmptyParagraph(child) && root.getChildrenSize() > 1) {\n        child.remove();\n        continue;\n      }\n      // Convert all '\\t' into TabNode.\n      if ($isElementNode(child)) {\n        for (const textNode of child.getAllTextNodes()) {\n          $normalizeMarkdownTextNode(textNode);\n        }\n      }\n    }\n    if ($getSelection() !== null) {\n      root.selectStart();\n    }\n  };\n}\n\n/**\n *\n * @returns first element of the returned tuple is a boolean indicating if a multiline element was imported. The second element is the index of the last line that was processed.\n */\nfunction $importMultiline(lines, startLineIndex, multilineElementTransformers, rootNode) {\n  for (const transformer of multilineElementTransformers) {\n    const {\n      handleImportAfterStartMatch,\n      regExpEnd,\n      regExpStart,\n      replace\n    } = transformer;\n    const startMatch = lines[startLineIndex].match(regExpStart);\n    if (!startMatch) {\n      continue; // Try next transformer\n    }\n    if (handleImportAfterStartMatch) {\n      const result = handleImportAfterStartMatch({\n        lines,\n        rootNode,\n        startLineIndex,\n        startMatch,\n        transformer\n      });\n      if (result === null) {\n        continue;\n      } else if (result) {\n        return result;\n      }\n    }\n    const regexpEndRegex = typeof regExpEnd === 'object' && 'regExp' in regExpEnd ? regExpEnd.regExp : regExpEnd;\n    const isEndOptional = regExpEnd && typeof regExpEnd === 'object' && 'optional' in regExpEnd ? regExpEnd.optional : !regExpEnd;\n    let endLineIndex = startLineIndex;\n    const linesLength = lines.length;\n\n    // check every single line for the closing match. It could also be on the same line as the opening match.\n    while (endLineIndex < linesLength) {\n      const endMatch = regexpEndRegex ? lines[endLineIndex].match(regexpEndRegex) : null;\n      if (!endMatch) {\n        if (!isEndOptional || isEndOptional && endLineIndex < linesLength - 1 // Optional end, but didn't reach the end of the document yet => continue searching for potential closing match\n        ) {\n          endLineIndex++;\n          continue; // Search next line for closing match\n        }\n      }\n\n      // Now, check if the closing match matched is the same as the opening match.\n      // If it is, we need to continue searching for the actual closing match.\n      if (endMatch && startLineIndex === endLineIndex && endMatch.index === startMatch.index) {\n        endLineIndex++;\n        continue; // Search next line for closing match\n      }\n\n      // At this point, we have found the closing match. Next: calculate the lines in between open and closing match\n      // This should not include the matches themselves, and be split up by lines\n      const linesInBetween = [];\n      if (endMatch && startLineIndex === endLineIndex) {\n        linesInBetween.push(lines[startLineIndex].slice(startMatch[0].length, -endMatch[0].length));\n      } else {\n        for (let i = startLineIndex; i <= endLineIndex; i++) {\n          if (i === startLineIndex) {\n            const text = lines[i].slice(startMatch[0].length);\n            linesInBetween.push(text); // Also include empty text\n          } else if (i === endLineIndex && endMatch) {\n            const text = lines[i].slice(0, -endMatch[0].length);\n            linesInBetween.push(text); // Also include empty text\n          } else {\n            linesInBetween.push(lines[i]);\n          }\n        }\n      }\n      if (replace(rootNode, null, startMatch, endMatch, linesInBetween, true) !== false) {\n        // Return here. This $importMultiline function is run line by line and should only process a single multiline element at a time.\n        return [true, endLineIndex];\n      }\n\n      // The replace function returned false, despite finding the matching open and close tags => this transformer does not want to handle it.\n      // Thus, we continue letting the remaining transformers handle the passed lines of text from the beginning\n      break;\n    }\n  }\n\n  // No multiline transformer handled this line successfully\n  return [false, startLineIndex];\n}\nfunction $importBlocks(lineText, rootNode, elementTransformers, textFormatTransformersIndex, textMatchTransformers, shouldPreserveNewLines) {\n  const textNode = $createTextNode(lineText);\n  const elementNode = $createParagraphNode();\n  elementNode.append(textNode);\n  rootNode.append(elementNode);\n  for (const {\n    regExp,\n    replace\n  } of elementTransformers) {\n    const match = lineText.match(regExp);\n    if (match) {\n      textNode.setTextContent(lineText.slice(match[0].length));\n      if (replace(elementNode, [textNode], match, true) !== false) {\n        break;\n      }\n    }\n  }\n  importTextTransformers(textNode, textFormatTransformersIndex, textMatchTransformers);\n\n  // If no transformer found and we left with original paragraph node\n  // can check if its content can be appended to the previous node\n  // if it's a paragraph, quote or list\n  if (elementNode.isAttached() && lineText.length > 0) {\n    const previousNode = elementNode.getPreviousSibling();\n    if (!shouldPreserveNewLines && (\n    // Only append if we're not preserving newlines\n    $isParagraphNode(previousNode) || $isQuoteNode(previousNode) || $isListNode(previousNode))) {\n      let targetNode = previousNode;\n      if ($isListNode(previousNode)) {\n        const lastDescendant = previousNode.getLastDescendant();\n        if (lastDescendant == null) {\n          targetNode = null;\n        } else {\n          targetNode = $findMatchingParent(lastDescendant, $isListItemNode);\n        }\n      }\n      if (targetNode != null && targetNode.getTextContentSize() > 0) {\n        const lastChild = targetNode.getLastChild();\n        if ($isTextNode(lastChild)) {\n          const lastText = lastChild.getTextContent();\n          if (lastText.endsWith('\\\\')) {\n            lastChild.setTextContent(lastText.slice(0, -1));\n          } else if (/ {2,}$/.test(lastText)) {\n            lastChild.setTextContent(lastText.replace(/ {2,}$/, ''));\n          }\n        }\n        targetNode.splice(targetNode.getChildrenSize(), 0, [$createLineBreakNode(), ...elementNode.getChildren()]);\n        elementNode.remove();\n      }\n    }\n  }\n}\n\n// Look in node for '\\t' and create a TabNode for each occurrence.\nfunction $normalizeMarkdownTextNode(textNode) {\n  const tabOffsets = new Set();\n  const text = textNode.getTextContent();\n  let index = text.indexOf('\\t');\n\n  // Find all tab occurrences\n  while (index !== -1) {\n    tabOffsets.add(index);\n    tabOffsets.add(index + 1);\n    index = text.indexOf('\\t', index + 1);\n  }\n\n  // Split node to isolate each tab then replace '\\t' into TabNode\n  const splitNodes = textNode.splitText(...tabOffsets);\n  splitNodes.forEach(node => {\n    if (node.getTextContent() === '\\t') {\n      node.replace($createTabNode());\n    }\n  });\n}\nfunction createTextFormatTransformersIndex(textTransformers) {\n  const transformersByTag = {};\n  const fullMatchRegExpByTag = {};\n  const openTagsRegExp = [];\n  for (const transformer of textTransformers) {\n    const {\n      tag\n    } = transformer;\n    transformersByTag[tag] = transformer;\n    const tagRegExp = tag.replace(/(\\*|\\^|\\+)/g, '\\\\$1');\n    openTagsRegExp.push(tagRegExp);\n\n    // Single-char tag (e.g. \"*\")\n    if (tag.length === 1) {\n      if (tag === '`') {\n        // Capture the preceding character in group 1 (empty string at start-of-string\n        // via the ^ branch) rather than using a negative lookbehind, which is not\n        // supported in Safari < 16.4. Consumers must add match[1].length to\n        // match.index to find the real start of the span (see importTextFormatTransformer.ts).\n        fullMatchRegExpByTag[tag] = new RegExp(`(^|[^\\\\\\\\\\`])(\\`)((?:\\\\\\\\\\`|[^\\`])+?)(\\`)(?!\\`)`);\n      } else {\n        fullMatchRegExpByTag[tag] = new RegExp(`(^|[^\\\\\\\\${tagRegExp}])(${tagRegExp})((\\\\\\\\${tagRegExp})?.*?[^${tagRegExp}\\\\s](\\\\\\\\${tagRegExp})?)(${tagRegExp})(?![\\\\\\\\${tagRegExp}])`);\n      }\n    } else {\n      // Multi-char tags (e.g. \"**\")\n      fullMatchRegExpByTag[tag] = new RegExp(`(^|[^\\\\\\\\])(${tagRegExp})((\\\\\\\\${tagRegExp})?.*?[^\\\\s](\\\\\\\\${tagRegExp})?)(${tagRegExp})(?!\\\\\\\\)`);\n    }\n  }\n  return {\n    // Reg exp to find open tag + content + close tag\n    fullMatchRegExpByTag,\n    // Regexp to locate *any* potential opening tag (longest first).\n    // The former (?<!\\\\) escape guard has been removed — the delimiter\n    // scanner's isEscaped() check handles escape filtering at match time.\n    openTagsRegExp: new RegExp(`(${openTagsRegExp.join('|')})`, 'g'),\n    transformersByTag\n  };\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n// Do not require this module directly! Use normal `invariant` calls.\n\nfunction formatDevErrorMessage(message) {\n  throw new Error(message);\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\nconst ORDERED_LIST_REGEX = /^(\\s*)(\\d{1,})\\.\\s/;\nconst UNORDERED_LIST_REGEX = /^(\\s*)[-*+]\\s/;\nconst CHECK_LIST_REGEX = /^(\\s*)(?:[-*+]\\s)?\\s?(\\[(\\s|x)?\\])\\s/i;\nconst HEADING_REGEX = /^(#{1,6})\\s/;\nconst QUOTE_REGEX = /^>\\s/;\nconst CODE_START_REGEX = /^([ \\t]*`{3,})([\\w-]+)?[ \\t]?/;\nconst CODE_END_REGEX = /^[ \\t]*`{3,}$/;\nconst CODE_SINGLE_LINE_REGEX = /^[ \\t]*```[^`]+(?:(?:`{1,2}|`{4,})[^`]+)*```(?:[^`]|$)/;\nconst TABLE_ROW_REG_EXP = /^(?:\\|)(.+)(?:\\|)\\s?$/;\nconst TABLE_ROW_DIVIDER_REG_EXP = /^(\\| ?:?-*:? ?)+\\|\\s?$/;\nconst TAG_START_REGEX = /^<[a-z_][\\w-]*(?:\\s[^<>]*)?\\/?>/i;\nconst TAG_END_REGEX = /^<\\/[a-z_][\\w-]*\\s*>/i;\nconst ENDS_WITH = regex => new RegExp(`(?:${regex.source})$`, regex.flags);\nconst listMarkerState = createState('mdListMarker', {\n  parse: v => typeof v === 'string' && /^[-*+]$/.test(v) ? v : '-',\n  resetOnCopyNode: true\n});\nconst codeFenceState = createState('mdCodeFence', {\n  parse: val => {\n    if (typeof val === 'string' && /^`{3,}$/.test(val)) {\n      return val;\n    }\n    return '```';\n  },\n  resetOnCopyNode: true\n});\nconst createBlockNode = createNode => {\n  return (parentNode, children, match, isImport) => {\n    const node = createNode(match);\n    node.append(...children);\n    parentNode.replace(node);\n    if (!isImport) {\n      node.select(0, 0);\n    }\n  };\n};\n\n// Amount of spaces that define indentation level\n// TODO: should be an option\nconst LIST_INDENT_SIZE = 4;\nfunction getIndent(whitespaces) {\n  const tabs = whitespaces.match(/\\t/g);\n  const spaces = whitespaces.match(/ /g);\n  let indent = 0;\n  if (tabs) {\n    indent += tabs.length;\n  }\n  if (spaces) {\n    indent += Math.floor(spaces.length / LIST_INDENT_SIZE);\n  }\n  return indent;\n}\nconst listReplace = listType => {\n  return (parentNode, children, match, isImport) => {\n    const previousNode = parentNode.getPreviousSibling();\n    const nextNode = parentNode.getNextSibling();\n    const listItem = $createListItemNode(listType === 'check' ? match[3] === 'x' : undefined);\n    const firstMatchChar = match[0].trim()[0];\n    const listMarker = (listType === 'bullet' || listType === 'check') && firstMatchChar === listMarkerState.parse(firstMatchChar) ? firstMatchChar : undefined;\n    if ($isListNode(nextNode) && nextNode.getListType() === listType) {\n      if (listMarker) {\n        $setState(nextNode, listMarkerState, listMarker);\n      }\n      const firstChild = nextNode.getFirstChild();\n      if (firstChild !== null) {\n        firstChild.insertBefore(listItem);\n      } else {\n        // should never happen, but let's handle gracefully, just in case.\n        nextNode.append(listItem);\n      }\n      parentNode.remove();\n    } else if ($isListNode(previousNode) && previousNode.getListType() === listType) {\n      if (listMarker) {\n        $setState(previousNode, listMarkerState, listMarker);\n      }\n      previousNode.append(listItem);\n      parentNode.remove();\n    } else {\n      const list = $createListNode(listType, listType === 'number' ? Number(match[2]) : undefined);\n      if (listMarker) {\n        $setState(list, listMarkerState, listMarker);\n      }\n      list.append(listItem);\n      parentNode.replace(list);\n    }\n    listItem.append(...children);\n    if (!isImport) {\n      listItem.select(0, 0);\n    }\n    const indent = getIndent(match[1]);\n    if (indent) {\n      listItem.setIndent(indent);\n    }\n  };\n};\nconst $listExport = (listNode, exportChildren, depth) => {\n  const output = [];\n  const children = listNode.getChildren();\n  let index = 0;\n  for (const listItemNode of children) {\n    if ($isListItemNode(listItemNode)) {\n      if (listItemNode.getChildrenSize() === 1) {\n        const firstChild = listItemNode.getFirstChild();\n        if ($isListNode(firstChild)) {\n          output.push($listExport(firstChild, exportChildren, depth + 1));\n          continue;\n        }\n      }\n      const indent = ' '.repeat(depth * LIST_INDENT_SIZE);\n      const listType = listNode.getListType();\n      const listMarker = $getState(listNode, listMarkerState);\n      const prefix = listType === 'number' ? `${listNode.getStart() + index}. ` : listType === 'check' ? `${listMarker} [${listItemNode.getChecked() ? 'x' : ' '}] ` : listMarker + ' ';\n      let childrenText = exportChildren(listItemNode);\n      if (listType !== 'number') {\n        childrenText = childrenText.replace(/^(\\s{0,3}\\d+)(\\.\\s)/, '$1\\\\$2');\n      }\n      output.push(indent + prefix + childrenText);\n      index++;\n    }\n  }\n  return output.join('\\n');\n};\nconst HEADING = {\n  dependencies: [HeadingNode],\n  export: (node, exportChildren) => {\n    if (!$isHeadingNode(node)) {\n      return null;\n    }\n    const level = Number(node.getTag().slice(1));\n    return '#'.repeat(level) + ' ' + exportChildren(node);\n  },\n  regExp: HEADING_REGEX,\n  replace: createBlockNode(match => {\n    const tag = 'h' + match[1].length;\n    return $createHeadingNode(tag);\n  }),\n  type: 'element'\n};\nconst QUOTE = {\n  dependencies: [QuoteNode],\n  export: (node, exportChildren) => {\n    if (!$isQuoteNode(node)) {\n      return null;\n    }\n    const lines = exportChildren(node).split('\\n');\n    const output = [];\n    for (const line of lines) {\n      output.push('> ' + line);\n    }\n    return output.join('\\n');\n  },\n  regExp: QUOTE_REGEX,\n  replace: (parentNode, children, _match, isImport) => {\n    if (isImport) {\n      const previousNode = parentNode.getPreviousSibling();\n      if ($isQuoteNode(previousNode)) {\n        previousNode.splice(previousNode.getChildrenSize(), 0, [$createLineBreakNode(), ...children]);\n        parentNode.remove();\n        return;\n      }\n    }\n    const node = $createQuoteNode();\n    node.append(...children);\n    parentNode.replace(node);\n    if (!isImport) {\n      node.select(0, 0);\n    }\n  },\n  type: 'element'\n};\nconst CODE = {\n  dependencies: [CodeNode],\n  export: node => {\n    if (!$isCodeNode(node)) {\n      return null;\n    }\n    const textContent = node.getTextContent();\n    let fence = $getState(node, codeFenceState);\n    if (textContent.indexOf(fence) > -1) {\n      const backticks = textContent.match(/`{3,}/g);\n      if (backticks) {\n        const maxLength = Math.max(...backticks.map(b => b.length));\n        fence = '`'.repeat(maxLength + 1);\n      }\n    }\n    return fence + (node.getLanguage() || '') + (textContent ? '\\n' + textContent : '') + '\\n' + fence;\n  },\n  handleImportAfterStartMatch: ({\n    lines,\n    rootNode,\n    startLineIndex,\n    startMatch\n  }) => {\n    const fence = startMatch[1];\n    const fenceLength = fence.trim().length;\n    const currentLine = lines[startLineIndex];\n    const afterFenceIndex = startMatch.index + fence.length;\n    const afterFence = currentLine.slice(afterFenceIndex);\n    const singleLineEndRegex = new RegExp(`\\`{${fenceLength},}$`);\n    if (singleLineEndRegex.test(afterFence)) {\n      const endMatch = afterFence.match(singleLineEndRegex);\n      const content = afterFence.slice(0, afterFence.lastIndexOf(endMatch[0]));\n      const fakeStartMatch = [...startMatch];\n      fakeStartMatch[2] = '';\n      CODE.replace(rootNode, null, fakeStartMatch, endMatch, [content], true);\n      return [true, startLineIndex];\n    }\n    const multilineEndRegex = new RegExp(`^[ \\\\t]*\\`{${fenceLength},}$`);\n    for (let i = startLineIndex + 1; i < lines.length; i++) {\n      const line = lines[i];\n      if (multilineEndRegex.test(line)) {\n        const endMatch = line.match(multilineEndRegex);\n        const linesInBetween = lines.slice(startLineIndex + 1, i);\n        const afterFullMatch = currentLine.slice(startMatch[0].length);\n        if (afterFullMatch.length > 0) {\n          linesInBetween.unshift(afterFullMatch);\n        }\n        CODE.replace(rootNode, null, startMatch, endMatch, linesInBetween, true);\n        return [true, i];\n      }\n    }\n    const linesInBetween = lines.slice(startLineIndex + 1);\n    const afterFullMatch = currentLine.slice(startMatch[0].length);\n    if (afterFullMatch.length > 0) {\n      linesInBetween.unshift(afterFullMatch);\n    }\n    CODE.replace(rootNode, null, startMatch, null, linesInBetween, true);\n    return [true, lines.length - 1];\n  },\n  regExpEnd: {\n    optional: true,\n    regExp: CODE_END_REGEX\n  },\n  regExpStart: CODE_START_REGEX,\n  replace: (rootNode, children, startMatch, endMatch, linesInBetween, isImport) => {\n    let codeBlockNode;\n    let code;\n    const fence = startMatch[1] ? startMatch[1].trim() : '```';\n    const language = startMatch[2] || undefined;\n    if (!children && linesInBetween) {\n      if (linesInBetween.length === 1) {\n        if (endMatch) {\n          codeBlockNode = $createCodeNode(language);\n          code = linesInBetween[0];\n        } else {\n          codeBlockNode = $createCodeNode(language);\n          code = linesInBetween[0].startsWith(' ') ? linesInBetween[0].slice(1) : linesInBetween[0];\n        }\n      } else {\n        codeBlockNode = $createCodeNode(language);\n        if (linesInBetween.length > 0) {\n          if (linesInBetween[0].trim().length === 0) {\n            linesInBetween.shift();\n          } else if (linesInBetween[0].startsWith(' ')) {\n            linesInBetween[0] = linesInBetween[0].slice(1);\n          }\n        }\n        while (linesInBetween.length > 0 && !linesInBetween[linesInBetween.length - 1].length) {\n          linesInBetween.pop();\n        }\n        code = linesInBetween.join('\\n');\n      }\n      $setState(codeBlockNode, codeFenceState, fence);\n      const textNode = $createTextNode(code);\n      codeBlockNode.append(textNode);\n      rootNode.append(codeBlockNode);\n    } else if (children) {\n      createBlockNode(match => {\n        return $createCodeNode(match ? match[2] : undefined);\n      })(rootNode, children, startMatch, isImport);\n    }\n  },\n  type: 'multiline-element'\n};\nconst UNORDERED_LIST = {\n  dependencies: [ListNode, ListItemNode],\n  export: (node, exportChildren) => {\n    return $isListNode(node) ? $listExport(node, exportChildren, 0) : null;\n  },\n  regExp: UNORDERED_LIST_REGEX,\n  replace: listReplace('bullet'),\n  type: 'element'\n};\nconst CHECK_LIST = {\n  dependencies: [ListNode, ListItemNode],\n  export: (node, exportChildren) => {\n    return $isListNode(node) ? $listExport(node, exportChildren, 0) : null;\n  },\n  regExp: CHECK_LIST_REGEX,\n  replace: listReplace('check'),\n  type: 'element'\n};\nconst ORDERED_LIST = {\n  dependencies: [ListNode, ListItemNode],\n  export: (node, exportChildren) => {\n    return $isListNode(node) ? $listExport(node, exportChildren, 0) : null;\n  },\n  regExp: ORDERED_LIST_REGEX,\n  replace: listReplace('number'),\n  type: 'element'\n};\nconst INLINE_CODE = {\n  format: ['code'],\n  tag: '`',\n  type: 'text-format'\n};\nconst HIGHLIGHT = {\n  format: ['highlight'],\n  tag: '==',\n  type: 'text-format'\n};\nconst BOLD_ITALIC_STAR = {\n  format: ['bold', 'italic'],\n  tag: '***',\n  type: 'text-format'\n};\nconst BOLD_ITALIC_UNDERSCORE = {\n  format: ['bold', 'italic'],\n  intraword: false,\n  tag: '___',\n  type: 'text-format'\n};\nconst BOLD_STAR = {\n  format: ['bold'],\n  tag: '**',\n  type: 'text-format'\n};\nconst BOLD_UNDERSCORE = {\n  format: ['bold'],\n  intraword: false,\n  tag: '__',\n  type: 'text-format'\n};\nconst STRIKETHROUGH = {\n  format: ['strikethrough'],\n  tag: '~~',\n  type: 'text-format'\n};\nconst ITALIC_STAR = {\n  format: ['italic'],\n  tag: '*',\n  type: 'text-format'\n};\nconst ITALIC_UNDERSCORE = {\n  format: ['italic'],\n  intraword: false,\n  tag: '_',\n  type: 'text-format'\n};\n\n// Order of text transformers matters:\n//\n// - code should go first as it prevents any transformations inside\n// - then longer tags match (e.g. ** or __ should go before * or _)\nconst LINK = {\n  dependencies: [LinkNode],\n  export: (node, exportChildren, exportFormat) => {\n    if (!$isLinkNode(node) || $isAutoLinkNode(node)) {\n      return null;\n    }\n    const textContent = exportChildren(node);\n    let title = node.getTitle();\n    if (title != null) {\n      title = title.replace(/([\\\\\"])/g, '\\\\$1');\n    }\n    const linkContent = title ? `[${textContent}](${node.getURL()} \"${title}\")` : `[${textContent}](${node.getURL()})`;\n    return linkContent;\n  },\n  importRegExp: /(?:\\[(.+?)\\])(?:\\((?:([^()\\s]+)(?:\\s\"((?:[^\"]*\\\\\")*[^\"]*)\"\\s*)?)\\))/,\n  regExp: /(?:\\[([^[\\]]*(?:\\[[^[\\]]*\\][^[\\]]*)*)\\])(?:\\((?:([^()\\s]+)(?:\\s\"((?:[^\"]*\\\\\")*[^\"]*)\"\\s*)?)\\))$/,\n  replace: (textNode, match) => {\n    // https://spec.commonmark.org/0.31.2/#inline-link\n    if ($findMatchingParent$1(textNode, $isLinkNode)) {\n      return;\n    }\n    const [, linkText, rawLinkUrl, rawLinkTitle] = match;\n    const linkUrl = rawLinkUrl != null ? unescapeText(rawLinkUrl) : undefined;\n    const linkTitle = rawLinkTitle != null ? unescapeText(rawLinkTitle) : undefined;\n    const linkNode = $createLinkNode(linkUrl, {\n      title: linkTitle\n    });\n    const openBracketAmount = linkText.split('[').length - 1;\n    const closeBracketAmount = linkText.split(']').length - 1;\n    let parsedLinkText = linkText;\n    let outsideLinkText = '';\n    if (openBracketAmount < closeBracketAmount) {\n      return;\n    } else if (openBracketAmount > closeBracketAmount) {\n      const linkTextParts = linkText.split('[');\n      outsideLinkText = '[' + linkTextParts[0];\n      parsedLinkText = linkTextParts.slice(1).join('[');\n    }\n    const linkTextNode = $createTextNode(parsedLinkText);\n    linkTextNode.setFormat(textNode.getFormat());\n    linkNode.append(linkTextNode);\n    textNode.replace(linkNode);\n    if (outsideLinkText) {\n      linkNode.insertBefore($createTextNode(outsideLinkText));\n    }\n    return linkTextNode;\n  },\n  trigger: ')',\n  type: 'text-match'\n};\nconst ELEMENT_TRANSFORMERS = [HEADING, QUOTE, UNORDERED_LIST, ORDERED_LIST];\nconst MULTILINE_ELEMENT_TRANSFORMERS = [CODE];\n\n// Order of text format transformers matters:\n//\n// - code should go first as it prevents any transformations inside\n// - then longer tags match (e.g. ** or __ should go before * or _)\nconst TEXT_FORMAT_TRANSFORMERS = [INLINE_CODE, BOLD_ITALIC_STAR, BOLD_ITALIC_UNDERSCORE, BOLD_STAR, BOLD_UNDERSCORE, HIGHLIGHT, ITALIC_STAR, ITALIC_UNDERSCORE, STRIKETHROUGH];\nconst TEXT_MATCH_TRANSFORMERS = [LINK];\nconst TRANSFORMERS = [...ELEMENT_TRANSFORMERS, ...MULTILINE_ELEMENT_TRANSFORMERS, ...TEXT_FORMAT_TRANSFORMERS, ...TEXT_MATCH_TRANSFORMERS];\nfunction normalizeMarkdown(input, shouldMergeAdjacentLines = false) {\n  const lines = input.split('\\n');\n  let inCodeBlock = false;\n  const sanitizedLines = [];\n  for (let i = 0; i < lines.length; i++) {\n    const rawLine = lines[i];\n    const line = rawLine.trimEnd();\n    const lastLine = sanitizedLines[sanitizedLines.length - 1];\n\n    // Code blocks of ```single line``` don't toggle the inCodeBlock flag\n    if (CODE_SINGLE_LINE_REGEX.test(line)) {\n      sanitizedLines.push(line);\n      continue;\n    }\n\n    // Detect the start or end of a code block\n    if (CODE_START_REGEX.test(line) || CODE_END_REGEX.test(line)) {\n      inCodeBlock = !inCodeBlock;\n      sanitizedLines.push(line);\n      continue;\n    }\n\n    // If we are inside a code block, keep the line unchanged\n    if (inCodeBlock) {\n      sanitizedLines.push(rawLine);\n      continue;\n    }\n\n    // In markdown the concept of \"empty paragraphs\" does not exist.\n    // Blocks must be separated by an empty line. Non-empty adjacent lines must be merged.\n    if (line === '' || lastLine === '' || !lastLine || HEADING_REGEX.test(lastLine) || HEADING_REGEX.test(line) || QUOTE_REGEX.test(line) || ORDERED_LIST_REGEX.test(line) || UNORDERED_LIST_REGEX.test(line) || CHECK_LIST_REGEX.test(line) || TABLE_ROW_REG_EXP.test(line) || TABLE_ROW_DIVIDER_REG_EXP.test(line) || !shouldMergeAdjacentLines || TAG_START_REGEX.test(line) || TAG_END_REGEX.test(line) || ENDS_WITH(TAG_END_REGEX).test(lastLine) || ENDS_WITH(TAG_START_REGEX).test(lastLine) || CODE_END_REGEX.test(lastLine)) {\n      // When not merging, preserve trailing whitespace (e.g. hard line-break\n      // markers \"  \" or non-breaking spaces). Whitespace-only lines still\n      // collapse to '' because trimEnd() already reduced them, so they\n      // continue to act as paragraph separators.\n      sanitizedLines.push(!shouldMergeAdjacentLines && line !== '' ? rawLine : line);\n    } else {\n      sanitizedLines[sanitizedLines.length - 1] = lastLine + ' ' + line.trimStart();\n    }\n  }\n  return sanitizedLines.join('\\n');\n}\n\nfunction runElementTransformers(parentNode, anchorNode, anchorOffset, elementTransformers) {\n  const grandParentNode = parentNode.getParent();\n  if (!$isRootOrShadowRoot(grandParentNode) || parentNode.getFirstChild() !== anchorNode) {\n    return false;\n  }\n  const textContent = anchorNode.getTextContent();\n\n  // Checking for anchorOffset position to prevent any checks for cases when caret is too far\n  // from a line start to be a part of block-level markdown trigger.\n  //\n  // TODO:\n  // Can have a quick check if caret is close enough to the beginning of the string (e.g. offset less than 10-20)\n  // since otherwise it won't be a markdown shortcut, but tables are exception\n  if (textContent[anchorOffset - 1] !== ' ') {\n    return false;\n  }\n  for (const {\n    regExp,\n    replace\n  } of elementTransformers) {\n    const match = textContent.match(regExp);\n    if (match && match[0].length === (match[0].endsWith(' ') ? anchorOffset : anchorOffset - 1)) {\n      const nextSiblings = anchorNode.getNextSiblings();\n      const [leadingNode, remainderNode] = anchorNode.splitText(anchorOffset);\n      const siblings = remainderNode ? [remainderNode, ...nextSiblings] : nextSiblings;\n      if (replace(parentNode, siblings, match, false) !== false) {\n        leadingNode.remove();\n        return true;\n      }\n    }\n  }\n  return false;\n}\nfunction runMultilineElementTransformers(parentNode, anchorNode, anchorOffset, elementTransformers, triggerOnEnter) {\n  const grandParentNode = parentNode.getParent();\n  if (!$isRootOrShadowRoot(grandParentNode) || parentNode.getFirstChild() !== anchorNode) {\n    return false;\n  }\n  const textContent = anchorNode.getTextContent();\n  if (!triggerOnEnter) {\n    // Checking for anchorOffset position to prevent any checks for cases when caret is too far\n    // from a line start to be a part of block-level markdown trigger.\n    //\n    // TODO:\n    // Can have a quick check if caret is close enough to the beginning of the string (e.g. offset less than 10-20)\n    // since otherwise it won't be a markdown shortcut, but tables are exception\n    if (textContent[anchorOffset - 1] !== ' ') {\n      return false;\n    }\n  }\n  for (const {\n    regExpStart,\n    replace,\n    regExpEnd\n  } of elementTransformers) {\n    if (regExpEnd && !('optional' in regExpEnd) || regExpEnd && 'optional' in regExpEnd && !regExpEnd.optional) {\n      continue;\n    }\n    const match = textContent.match(regExpStart);\n    if (match) {\n      const matchLength = triggerOnEnter || match[0].endsWith(' ') ? anchorOffset : anchorOffset - 1;\n      if (match[0].length !== matchLength) {\n        continue;\n      }\n      const nextSiblings = anchorNode.getNextSiblings();\n      const [leadingNode, remainderNode] = anchorNode.splitText(anchorOffset);\n      const siblings = remainderNode ? [remainderNode, ...nextSiblings] : nextSiblings;\n      if (replace(parentNode, siblings, match, null, null, false) !== false) {\n        leadingNode.remove();\n        return true;\n      }\n    }\n  }\n  return false;\n}\nfunction runTextMatchTransformers(anchorNode, anchorOffset, transformersByTrigger) {\n  let textContent = anchorNode.getTextContent();\n  const lastChar = textContent[anchorOffset - 1];\n  const transformers = transformersByTrigger[lastChar];\n  if (transformers == null) {\n    return false;\n  }\n\n  // If typing in the middle of content, remove the tail to do\n  // reg exp match up to a string end (caret position)\n  if (anchorOffset < textContent.length) {\n    textContent = textContent.slice(0, anchorOffset);\n  }\n  for (const transformer of transformers) {\n    if (!transformer.replace || !transformer.regExp) {\n      continue;\n    }\n    const match = textContent.match(transformer.regExp);\n    if (match === null) {\n      continue;\n    }\n    const startIndex = match.index || 0;\n    const endIndex = startIndex + match[0].length;\n    let replaceNode;\n    if (startIndex === 0) {\n      [replaceNode] = anchorNode.splitText(endIndex);\n    } else {\n      [, replaceNode] = anchorNode.splitText(startIndex, endIndex);\n    }\n    replaceNode.selectNext(0, 0);\n    transformer.replace(replaceNode, match);\n    return true;\n  }\n  return false;\n}\nfunction $runTextFormatTransformers(anchorNode, anchorOffset, textFormatTransformers) {\n  const textContent = anchorNode.getTextContent();\n  const closeTagEndIndex = anchorOffset - 1;\n  const closeChar = textContent[closeTagEndIndex];\n  // Quick check if we're possibly at the end of inline markdown style\n  const matchers = textFormatTransformers[closeChar];\n  if (!matchers) {\n    return false;\n  }\n  for (const matcher of matchers) {\n    const {\n      tag\n    } = matcher;\n    const tagLength = tag.length;\n    const closeTagStartIndex = closeTagEndIndex - tagLength + 1;\n\n    // If tag is not single char check if rest of it matches with text content\n    if (tagLength > 1) {\n      if (!isEqualSubString(textContent, closeTagStartIndex, tag, 0, tagLength)) {\n        continue;\n      }\n    }\n\n    // Space before closing tag cancels inline markdown\n    if (textContent[closeTagStartIndex - 1] === ' ') {\n      continue;\n    }\n\n    // Some tags can not be used within words, hence should have newline/space/punctuation after it\n    const afterCloseTagChar = textContent[closeTagEndIndex + 1];\n    if (matcher.intraword === false && afterCloseTagChar && !PUNCTUATION_OR_SPACE.test(afterCloseTagChar)) {\n      continue;\n    }\n    const closeNode = anchorNode;\n    let openNode = closeNode;\n    let openTagStartIndex = getOpenTagStartIndex(textContent, closeTagStartIndex, tag);\n\n    // Go through text node siblings and search for opening tag\n    // if haven't found it within the same text node as closing tag\n    let sibling = openNode;\n    while (openTagStartIndex < 0 && (sibling = sibling.getPreviousSibling())) {\n      if ($isLineBreakNode(sibling)) {\n        break;\n      }\n      if ($isTextNode(sibling)) {\n        if (sibling.hasFormat('code')) {\n          continue;\n        }\n        const siblingTextContent = sibling.getTextContent();\n        openNode = sibling;\n        openTagStartIndex = getOpenTagStartIndex(siblingTextContent, siblingTextContent.length, tag);\n      }\n    }\n\n    // Opening tag is not found\n    if (openTagStartIndex < 0) {\n      continue;\n    }\n\n    // No content between opening and closing tag\n    if (openNode === closeNode && openTagStartIndex + tagLength === closeTagStartIndex) {\n      continue;\n    }\n\n    // Checking longer tags for repeating chars (e.g. *** vs **)\n    const prevOpenNodeText = openNode.getTextContent();\n    if (openTagStartIndex > 0 && prevOpenNodeText[openTagStartIndex - 1] === closeChar) {\n      continue;\n    }\n\n    // Some tags can not be used within words, hence should have newline/space/punctuation before it\n    const beforeOpenTagChar = prevOpenNodeText[openTagStartIndex - 1];\n    if (matcher.intraword === false && beforeOpenTagChar && !PUNCTUATION_OR_SPACE.test(beforeOpenTagChar)) {\n      continue;\n    }\n\n    // Per CommonMark, code spans take precedence over other inline formatting\n    if (!matcher.format.includes('code') && $isInsideUnclosedCodeSpan(openNode, openTagStartIndex)) {\n      continue;\n    }\n\n    // Clean text from opening and closing tags (starting from closing tag\n    // to prevent any offset shifts if we start from opening one)\n    const prevCloseNodeText = closeNode.getTextContent();\n    const closeNodeText = prevCloseNodeText.slice(0, closeTagStartIndex) + prevCloseNodeText.slice(closeTagEndIndex + 1);\n    closeNode.setTextContent(closeNodeText);\n    const openNodeText = openNode === closeNode ? closeNodeText : prevOpenNodeText;\n    openNode.setTextContent(openNodeText.slice(0, openTagStartIndex) + openNodeText.slice(openTagStartIndex + tagLength));\n    const selection = $getSelection();\n    const nextSelection = $createRangeSelection();\n    $setSelection(nextSelection);\n    // Adjust offset based on deleted chars\n    const newOffset = closeTagEndIndex - tagLength * (openNode === closeNode ? 2 : 1) + 1;\n    nextSelection.anchor.set(openNode.__key, openTagStartIndex, 'text');\n    nextSelection.focus.set(closeNode.__key, newOffset, 'text');\n\n    // Apply formatting to selected text\n    for (const format of matcher.format) {\n      if (!nextSelection.hasFormat(format)) {\n        nextSelection.formatText(format);\n      }\n    }\n\n    // Collapse selection up to the focus point\n    nextSelection.anchor.set(nextSelection.focus.key, nextSelection.focus.offset, nextSelection.focus.type);\n\n    // Remove formatting from collapsed selection\n    for (const format of matcher.format) {\n      if (nextSelection.hasFormat(format)) {\n        nextSelection.toggleFormat(format);\n      }\n    }\n    if ($isRangeSelection(selection)) {\n      nextSelection.format = selection.format;\n    }\n    return true;\n  }\n  return false;\n}\n\n// Per CommonMark spec, code spans take precedence over other inline\n// formatting. Returns true if there is an unclosed backtick (code span\n// opener) in the text preceding the given offset, which means the offset\n// is inside a code span that hasn't been closed yet.\nfunction $isInsideUnclosedCodeSpan(node, offset) {\n  let backtickCount = 0;\n  const text = node.getTextContent();\n  for (let i = 0; i < offset; i++) {\n    if (text[i] === '`') {\n      backtickCount++;\n    }\n  }\n  return backtickCount % 2 !== 0;\n}\nfunction getOpenTagStartIndex(string, maxIndex, tag) {\n  const tagLength = tag.length;\n  for (let i = maxIndex; i >= tagLength; i--) {\n    const startIndex = i - tagLength;\n    if (isEqualSubString(string, startIndex, tag, 0, tagLength) &&\n    // Space after opening tag cancels transformation\n    string[startIndex + tagLength] !== ' ') {\n      return startIndex;\n    }\n  }\n  return -1;\n}\nfunction isEqualSubString(stringA, aStart, stringB, bStart, length) {\n  for (let i = 0; i < length; i++) {\n    if (stringA[aStart + i] !== stringB[bStart + i]) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction registerMarkdownShortcuts(editor, transformers = TRANSFORMERS) {\n  const byType = transformersByType(transformers);\n  const textFormatTransformersByTrigger = indexBy(byType.textFormat, ({\n    tag\n  }) => tag[tag.length - 1]);\n  const textMatchTransformersByTrigger = indexBy(byType.textMatch, ({\n    trigger\n  }) => trigger);\n  for (const transformer of transformers) {\n    const type = transformer.type;\n    if (type === 'element' || type === 'text-match' || type === 'multiline-element') {\n      const dependencies = transformer.dependencies;\n      for (const node of dependencies) {\n        if (!editor.hasNode(node)) {\n          {\n            formatDevErrorMessage(`MarkdownShortcuts: missing dependency ${node.getType()} for transformer. Ensure node dependency is included in editor initial config.`);\n          }\n        }\n      }\n    }\n  }\n  const $transform = (parentNode, anchorNode, anchorOffset) => {\n    if (runElementTransformers(parentNode, anchorNode, anchorOffset, byType.element)) {\n      return true;\n    }\n    if (runMultilineElementTransformers(parentNode, anchorNode, anchorOffset, byType.multilineElement)) {\n      return true;\n    }\n    if (runTextMatchTransformers(anchorNode, anchorOffset, textMatchTransformersByTrigger)) {\n      return true;\n    }\n    if ($runTextFormatTransformers(anchorNode, anchorOffset, textFormatTransformersByTrigger)) {\n      return true;\n    }\n    return false;\n  };\n  return mergeRegister(editor.registerUpdateListener(({\n    tags,\n    dirtyLeaves,\n    editorState,\n    prevEditorState\n  }) => {\n    // Ignore updates from collaboration and undo/redo (as changes already calculated)\n    if (tags.has(COLLABORATION_TAG) || tags.has(HISTORIC_TAG)) {\n      return;\n    }\n\n    // If editor is still composing (i.e. backticks) we must wait before the user confirms the key\n    if (editor.isComposing()) {\n      return;\n    }\n    const selection = editorState.read($getSelection);\n    const prevSelection = prevEditorState.read($getSelection);\n\n    // We expect selection to be a collapsed range and not match previous one (as we want\n    // to trigger transforms only as user types)\n    if (!$isRangeSelection(prevSelection) || !$isRangeSelection(selection) || !selection.isCollapsed() || selection.is(prevSelection)) {\n      return;\n    }\n    const anchorKey = selection.anchor.key;\n    const anchorOffset = selection.anchor.offset;\n    const anchorNode = editorState._nodeMap.get(anchorKey);\n    if (!$isTextNode(anchorNode) || !dirtyLeaves.has(anchorKey) || anchorOffset !== 1 && anchorOffset > prevSelection.anchor.offset + 1) {\n      return;\n    }\n    editor.update(() => {\n      if (!canContainTransformableMarkdown(anchorNode)) {\n        return;\n      }\n      const parentNode = anchorNode.getParent();\n      if (parentNode === null || $isCodeNode(parentNode)) {\n        return;\n      }\n      if ($transform(parentNode, anchorNode, selection.anchor.offset)) {\n        $addUpdateTag(HISTORY_PUSH_TAG);\n      }\n    });\n  }), editor.registerCommand(KEY_ENTER_COMMAND, event => {\n    if (event !== null && event.shiftKey) {\n      return false;\n    }\n    const selection = $getSelection();\n    if (!$isRangeSelection(selection) || !selection.isCollapsed()) {\n      return false;\n    }\n    const anchorOffset = selection.anchor.offset;\n    const anchorNode = selection.anchor.getNode();\n    if (!$isTextNode(anchorNode) || !canContainTransformableMarkdown(anchorNode)) {\n      return false;\n    }\n    const parentNode = anchorNode.getParent();\n    if (parentNode === null || $isCodeNode(parentNode)) {\n      return false;\n    }\n    const textContent = anchorNode.getTextContent();\n    if (anchorOffset !== textContent.length) {\n      return false;\n    }\n    if (runMultilineElementTransformers(parentNode, anchorNode, anchorOffset, byType.multilineElement, true)) {\n      if (event !== null) {\n        event.preventDefault();\n      }\n      return true;\n    }\n    return false;\n  }, COMMAND_PRIORITY_LOW));\n}\n\n/**\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n\n/**\n * Renders markdown from a string. The selection is moved to the start after the operation.\n *\n *  @param {boolean} [shouldPreserveNewLines] By setting this to true, new lines will be preserved between conversions\n *  @param {boolean} [shouldMergeAdjacentLines] By setting this to true, adjacent non empty lines will be merged according to commonmark spec: https://spec.commonmark.org/0.24/#example-177. Not applicable if shouldPreserveNewLines = true.\n */\nfunction $convertFromMarkdownString(markdown, transformers = TRANSFORMERS, node, shouldPreserveNewLines = false, shouldMergeAdjacentLines = false) {\n  const sanitizedMarkdown = shouldPreserveNewLines ? markdown : normalizeMarkdown(markdown, shouldMergeAdjacentLines);\n  const importMarkdown = createMarkdownImport(transformers, shouldPreserveNewLines);\n  return importMarkdown(sanitizedMarkdown, node);\n}\n\n/**\n * Renders string from markdown. The selection is moved to the start after the operation.\n */\nfunction $convertToMarkdownString(transformers = TRANSFORMERS, node, shouldPreserveNewLines = false) {\n  const exportMarkdown = createMarkdownExport(transformers, shouldPreserveNewLines);\n  return exportMarkdown(node);\n}\n\nexport { $convertFromMarkdownString, $convertToMarkdownString, BOLD_ITALIC_STAR, BOLD_ITALIC_UNDERSCORE, BOLD_STAR, BOLD_UNDERSCORE, CHECK_LIST, CODE, ELEMENT_TRANSFORMERS, HEADING, HIGHLIGHT, INLINE_CODE, ITALIC_STAR, ITALIC_UNDERSCORE, LINK, MULTILINE_ELEMENT_TRANSFORMERS, ORDERED_LIST, QUOTE, STRIKETHROUGH, TEXT_FORMAT_TRANSFORMERS, TEXT_MATCH_TRANSFORMERS, TRANSFORMERS, UNORDERED_LIST, registerMarkdownShortcuts };\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;AAuBA,SAAS,QAAQ,MAAM,UAAU;CAC/B,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,QAAQ,MAAM;EACvB,MAAM,MAAM,SAAS,IAAI;EACzB,IAAI,CAAC,KACH;EAEF,IAAI,MAAM,MACR,MAAM,KAAK,KAAK,IAAI;OAEpB,MAAM,OAAO,CAAC,IAAI;CAEtB;CACA,OAAO;AACT;AACA,SAAS,mBAAmB,cAAc;CACxC,MAAM,SAAS,QAAQ,eAAc,MAAK,EAAE,IAAI;CAChD,OAAO;EACL,SAAS,OAAO,WAAW,CAAC;EAC5B,kBAAkB,OAAO,wBAAwB,CAAC;EAClD,YAAY,OAAO,kBAAkB,CAAC;EACtC,WAAW,OAAO,iBAAiB,CAAC;CACtC;AACF;AACA,MAAM,uBAAuB;AAC7B,MAAM,aAAa;AACnB,MAAM,cAAc;AACpB,MAAM,8BAA8B;AACpC,SAAS,iBAAiB,MAAM;CAC9B,IAAI,CAAC,iBAAiB,IAAI,GACxB,OAAO;CAET,MAAM,aAAa,KAAK,cAAc;CACtC,OAAO,cAAc,QAAQ,KAAK,gBAAgB,MAAM,KAAK,YAAY,UAAU,KAAK,4BAA4B,KAAK,WAAW,eAAe,CAAC;AACtJ;AACA,SAAS,aAAa,OAAO;CAC3B,OAAO,MAAM,QAAQ,uBAAuB,IAAI,EAAE,QAAQ,cAAc,GAAG,cAAc,OAAO,cAAc,OAAO,SAAS,CAAC,CAAC;AAClI;;;;;;;;;;;AAcA,SAAS,qBAAqB,cAAc,yBAAyB,OAAO;CAC1E,MAAM,SAAS,mBAAmB,YAAY;CAC9C,MAAM,sBAAsB,CAAC,GAAG,OAAO,kBAAkB,GAAG,OAAO,OAAO;CAC1E,MAAM,qBAAqB,CAAC;CAI5B,MAAM,yBAAyB,OAAO,WAAW,QAAO,gBAAe,YAAY,OAAO,WAAW,CAAC,EAIrG,MAAM,GAAG,MAAM;EACd,OAAO,OAAO,EAAE,OAAO,SAAS,MAAM,CAAC,IAAI,OAAO,EAAE,OAAO,SAAS,MAAM,CAAC;CAC7E,CAAC;CACD,QAAO,SAAQ;EACb,MAAM,SAAS,CAAC;EAChB,MAAM,YAAY,QAAQ,SAAS,GAAG,YAAY;EAClD,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GACxC,MAAM,QAAQ,SAAS;GACvB,MAAM,SAAS,uBAAuB,OAAO,qBAAqB,wBAAwB,OAAO,WAAW,sBAAsB;GAClI,IAAI,UAAU,MACZ,OAAO,KAEP,sBAAsB,IAAI,KAAK,CAAC,iBAAiB,KAAK,KAAK,CAAC,iBAAiB,SAAS,IAAI,EAAE,IAAI,KAAK,OAAO,MAAM,IAAI,MAAM;EAEhI;EAGA,OAAO,OAAO,KAAK,IAAI;CACzB;AACF;AACA,SAAS,uBAAuB,MAAM,qBAAqB,uBAAuB,uBAAuB,wBAAwB;CAC/H,KAAK,MAAM,eAAe,qBAAqB;EAC7C,IAAI,CAAC,YAAY,QACf;EAEF,MAAM,SAAS,YAAY,OAAO,OAAM,UAAS,eAAe,OAAO,uBAAuB,uBAAuB,KAAA,GAAW,KAAA,GAAW,sBAAsB,CAAC;EAClK,IAAI,UAAU,MACZ,OAAO;CAEX;CACA,IAAI,eAAe,IAAI,GACrB,OAAO,eAAe,MAAM,uBAAuB,uBAAuB,KAAA,GAAW,KAAA,GAAW,sBAAsB;MACjH,IAAI,iBAAiB,IAAI,GAC9B,OAAO,KAAK,eAAe;MAE3B,OAAO;AAEX;AACA,SAAS,eAAe,MAAM,uBAAuB,uBAAuB,cAAc,gBAAgB,yBAAyB,OAAO;CACxI,MAAM,SAAS,CAAC;CAChB,MAAM,WAAW,KAAK,YAAY;CAElC,IAAI,CAAC,cACH,eAAe,CAAC;CAElB,IAAI,CAAC,gBACH,iBAAiB,CAAC;CAEpB,UAAU,KAAK,MAAM,SAAS,UAAU;EACtC,KAAK,MAAM,eAAe,uBAAuB;GAC/C,IAAI,CAAC,YAAY,QACf;GAEF,MAAM,SAAS,YAAY,OAAO,QAAO,eAAc,eAAe,YAAY,uBAAuB,uBAAuB,cAMhI,CAAC,GAAG,gBAAgB,GAAG,YAAY,GAAG,sBAAsB,IAAI,UAAU,gBAAgB,iBAAiB,UAAU,aAAa,uBAAuB,cAAc,gBAAgB,sBAAsB,CAAC;GAC9M,IAAI,UAAU,MAAM;IAClB,OAAO,KAAK,MAAM;IAClB,SAAS;GACX;EACF;EACA,IAAI,iBAAiB,KAAK,GACxB,OAAO,KAAK,IAAI;OACX,IAAI,YAAY,KAAK,GAC1B,OAAO,KAAK,iBAAiB,OAAO,MAAM,eAAe,GAAG,uBAAuB,cAAc,gBAAgB,sBAAsB,CAAC;OACnI,IAAI,eAAe,KAAK,GAE7B,OAAO,KAAK,eAAe,OAAO,uBAAuB,uBAAuB,cAAc,gBAAgB,sBAAsB,CAAC;OAChI,IAAI,iBAAiB,KAAK,GAC/B,OAAO,KAAK,MAAM,eAAe,CAAC;CAEtC;CACA,OAAO,OAAO,KAAK,EAAE;AACvB;AACA,SAAS,iBAAiB,MAAM,aAAa,kBAE7C,cAAc,gBAAgB,yBAAyB,OAAO;CAO5D,IAAI,SAAS;CACb,IAAI,CAAC,KAAK,UAAU,MAAM,GAExB,SAAS,yBAAyB,OAAO,QAAQ,aAAa,MAAM,IAAI,OAAO,QAAQ,eAAe,MAAM;CAK9G,MAAM,QAAQ,OAAO,MAAM,oBAAoB,KAAK;EAAC;EAAI;EAAI;EAAQ;CAAE;CACvE,MAAM,eAAe,MAAM;CAC3B,MAAM,gBAAgB,MAAM;CAC5B,MAAM,gBAAgB,MAAM;CAC5B,MAAM,mBAAmB,kBAAkB;CAG3C,IAAI,cAAc;CAElB,IAAI,oBAAoB;CACxB,IAAI,mBAAmB;CACvB,MAAM,WAAW,eAAe,MAAM,IAAI;CAC1C,MAAM,WAAW,eAAe,MAAM,KAAK;CAC3C,MAAM,0BAAU,IAAI,IAAI;CACxB,KAAK,MAAM,eAAe,kBAAkB;EAC1C,MAAM,SAAS,YAAY,OAAO;EAClC,MAAM,MAAM,YAAY;EAGxB,IAAI,eAAe,MAAM,MAAM,KAAK,CAAC,QAAQ,IAAI,MAAM,GAAG;GACxD,QAAQ,IAAI,MAAM;GAIlB,IAAI,CAAC,eAAe,UAAU,MAAM,KAAK,CAAC,aAAa,MAAK,YAAW,QAAQ,QAAQ,GAAG,GAAG;IAC3F,aAAa,KAAK;KAChB;KACA;IACF,CAAC;IACD,eAAe;GACjB;EACF;CACF;CAGA,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,gBAAgB,UAAU,MAAM,aAAa,GAAG,MAAM;EAC5D,MAAM,oBAAoB,UAAU,UAAU,aAAa,GAAG,MAAM;EAGpE,IAAI,iBAAiB,mBACnB;EAEF,MAAM,wBAAwB,CAAC,GAAG,YAAY;EAE9C,OAAO,sBAAsB,SAAS,GAAG;GACvC,MAAM,cAAc,sBAAsB,IAAI;GAI9C,IAAI,kBAAkB,eAAe,eAAe,MAAK,YAAW,QAAQ,QAAQ,YAAY,GAAG,GACjG;GAEF,IAAI,eAAe,OAAO,YAAY,QAAQ;QACxC,CAAC,eAGH,qBAAqB,YAAY;SAC5B,IAAI,CAAC,mBACV,oBAAoB,YAAY;GAAA;GAIpC,aAAa,IAAI;EACnB;EACA;CACF;CAGA,IAAI,oBAAoB,CAAC,KAAK,UAAU,MAAM,GAC5C,OAAO,oBAAoB;CAI7B,OAAO,oBAAoB,eAAe,cAAc,gBAAgB,mBAAmB;AAC7F;AACA,SAAS,eAAe,MAAM,UAAU;CACtC,MAAM,UAAU,WAAW,KAAK,mBAAmB,IAAI,KAAK,eAAe;CAC3E,IAAI,YAAY,OAAO,GACrB,OAAO;CAET,OAAO;AACT;AACA,SAAS,UAAU,MAAM,QAAQ;CAC/B,OAAO,YAAY,IAAI,KAAK,KAAK,UAAU,MAAM;AACnD;AACA,SAAS,eAAe,GAAG,GAAG;CAC5B,IAAI,CAAC,UAAU,GAAG,CAAC,GACjB,OAAO;CAET,IAAI,MAAM,QACR,OAAO;CAET,IAAI,KAAK,QAAQ,KAAK,EAAE,eAAe,CAAC,GACtC,OAAO;CAET,OAAO;AACT;;;;;;;;AAUA,SAAS,mCAAmC,UAAU,6BAA6B;CACjF,MAAM,cAAc,SAAS,eAAe;CAK5C,MAAM,YAAY,4BAA4B,qBAAqB;CACnE,MAAM,kBAAkB,4BAA4B,kBAAkB;CACtE,MAAM,gBAAgB,CAAC;CACvB,IAAI,YAAY;CAChB,IAAI,aAAa,iBAAiB;EAChC,MAAM,cAAc,IAAI,OAAO,UAAU,QAAQ,GAAG;EACpD,MAAM,UAAU,MAAM,KAAK,YAAY,SAAS,WAAW,CAAC;EAC5D,KAAK,MAAM,SAAS,SAAS;GAI3B,MAAM,aAAa,MAAM,QAAQ,MAAM,GAAG;GAC1C,MAAM,WAAW,MAAM,QAAQ,MAAM,GAAG;GACxC,IAAI,CAAC,WACH,YAAY;IACV,SAAS,MAAM;IACf;IACA;IACA,KAAK;GACP;GAEF,cAAc,KAAK;IACjB,KAAK;IACL,OAAO;GACT,CAAC;EACH;CACF;CACA,MAAM,aAAa,eAAe,aAAa,6BAA6B,aAAa;CACzF,MAAM,gBAAgB,WAAW,SAAS,IAAI,gBAAgB,aAAa,YAAY,2BAA2B,IAAI;CACtH,IAAI,cAAc;CAClB,IAAI,oBAAoB;CACxB,IAAI,aAAa,eACf,IAAI,cAAc,cAAc,UAAU,cAAc,cAAc,YAAY,UAAU,UAAU;EACpG,cAAc;EACd,oBAAoB,4BAA4B,kBAAkB,cAAc;CAClF,OAAO;EACL,cAAc;EACd,oBAAoB;CACtB;MACK,IAAI,WAAW;EACpB,cAAc;EACd,oBAAoB;CACtB,OAAO,IAAI,eAAe;EACxB,cAAc;EACd,oBAAoB,4BAA4B,kBAAkB,cAAc;CAClF;CACA,IAAI,CAAC,eAAe,CAAC,mBACnB,OAAO;CAET,MAAM,aAAa;EAAC,YAAY,MAAM,YAAY,YAAY,YAAY,QAAQ;EAAG,YAAY;EAAK,YAAY;CAAO;CACzH,WAAW,QAAQ,YAAY;CAC/B,WAAW,QAAQ;CACnB,OAAO;EACL,UAAU,YAAY;EACtB,OAAO;EACP,YAAY,YAAY;EACxB,aAAa;CACf;AACF;AACA,SAAS,eAAe,MAAM,mBAAmB,gBAAgB,CAAC,GAAG;CACnE,MAAM,aAAa,CAAC;CACpB,MAAM,iBAAiB,IAAI,IAAI,OAAO,KAAK,kBAAkB,iBAAiB,EAAE,QAAO,QAAO,IAAI,OAAO,GAAG,EAAE,KAAI,QAAO,IAAI,EAAE,CAAC;CAChI,MAAM,aAAY,UAAS;EACzB,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,QAAQ,GAAG,KAAK,KAAK,KAAK,OAAO,MAAM,KAClD;EAEF,OAAO,QAAQ,MAAM;CACvB;CACA,MAAM,qBAAoB,UAAS;EACjC,OAAO,cAAc,MAAK,UAAS,SAAS,MAAM,SAAS,QAAQ,MAAM,GAAG;CAC9E;CACA,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QAAQ;EACtB,MAAM,OAAO,KAAK;EAClB,IAAI,CAAC,eAAe,IAAI,IAAI,KAAK,UAAU,CAAC,KAAK,kBAAkB,CAAC,GAAG;GACrE;GACA;EACF;EACA,IAAI,MAAM;EACV,OAAO,IAAI,MAAM,KAAK,UAAU,KAAK,IAAI,SAAS,MAChD;EAEF,MAAM,UAAU,YAAY,MAAM,MAAM,GAAG,KAAK,IAAI;EACpD,MAAM,WAAW,YAAY,MAAM,MAAM,GAAG,KAAK,KAAK;EACtD,IAAI,WAAW,UACb,WAAW,KAAK;GACd,QAAQ;GACR;GACA;GACA;GACA,OAAO;GACP,QAAQ;GACR,gBAAgB;EAClB,CAAC;EAEH,KAAK;CACP;CACA,OAAO;AACT;AACA,SAAS,gBAAgB,MAAM,YAAY,mBAAmB;CAC5D,MAAM,gBAAgB,CAAC;CACvB,IAAI,aAAa;CACjB,IAAI,SAAS;CACb,OAAO,aAAa,WAAW,QAAQ;EACrC,MAAM,SAAS,WAAW;EAC1B,IAAI,CAAC,OAAO,UAAU,CAAC,OAAO,YAAY,OAAO,WAAW,GAAG;GAC7D;GACA;EACF;EACA,MAAM,YAAY,GAAG,OAAO,OAAO,OAAO;EAC1C,MAAM,SAAS,cAAc,cAAc;EAC3C,IAAI,cAAc;EAClB,KAAK,IAAI,UAAU,aAAa,GAAG,UAAU,QAAQ,WAAW;GAC9D,MAAM,SAAS,WAAW;GAC1B,IAAI,CAAC,OAAO,UAAU,CAAC,OAAO,WAAW,OAAO,WAAW,KAAK,OAAO,SAAS,OAAO,MACrF;GAIF,IAAI,OAAO,YAAY,OAAO;SAChB,OAAO,iBAAiB,OAAO,kBACjC,MAAM,KAAK,OAAO,iBAAiB,MAAM,KAAK,OAAO,iBAAiB,MAAM,GACpF;GAAA;GAGJ,MAAM,SAAS,KAAK,IAAI,OAAO,QAAQ,OAAO,MAAM;GACpD,MAAM,aAAa,OAAO,KAAK,kBAAkB,iBAAiB,EAAE,QAAO,MAAK,EAAE,OAAO,OAAO,QAAQ,EAAE,UAAU,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE;GAChK,IAAI,CAAC,YACH;GAEF,cAAc;GACd,MAAM,WAAW,WAAW;GAC5B,MAAM,QAAQ;IACZ,SAAS,KAAK,MAAM,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;IAC9D,UAAU,OAAO,QAAQ;IACzB,YAAY,OAAO,SAAS,OAAO,SAAS;IAC5C,KAAK;GACP;GACA,IAAI,CAAC,UAAU,MAAM,aAAa,OAAO,cAAc,MAAM,eAAe,OAAO,cAAc,MAAM,WAAW,OAAO,UACvH,SAAS;GAEX,KAAK,IAAI,IAAI,UAAU,GAAG,IAAI,YAAY,KACxC,WAAW,GAAG,SAAS;GAEzB,OAAO,UAAU;GACjB,OAAO,UAAU;GACjB,OAAO,SAAS,OAAO,SAAS;GAChC,IAAI,OAAO,SAAS,GAClB,OAAO,SAAS;QACX;IACL,OAAO,SAAS;IAChB;GACF;GACA;EACF;EACA,IAAI,CAAC,aAAa;GAChB,cAAc,aAAa,aAAa;GACxC,IAAI,CAAC,OAAO,SACV,OAAO,SAAS;GAElB;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,YAAY,MAAM,MAAM,OAAO,QAAQ,QAAQ;CACtD,IAAI,CAAC,WAAW,MAAM,OAAO,QAAQ,MAAM,GACzC,OAAO;CAET,IAAI,SAAS,KACX,OAAO;CAET,IAAI,SAAS,KAAK;EAChB,IAAI,CAAC,WAAW,MAAM,OAAO,QAAQ,CAAC,MAAM,GAC1C,OAAO;EAET,MAAM,eAAe,SAAS,KAAK,QAAQ,KAAK,KAAK,QAAQ;EAC7D,OAAO,iBAAiB,KAAA,KAAa,YAAY,KAAK,YAAY;CACpE;CACA,OAAO;AACT;AACA,SAAS,WAAW,MAAM,OAAO,QAAQ,QAAQ;CAC/C,MAAM,aAAa,KAAK,QAAQ;CAChC,MAAM,YAAY,KAAK,QAAQ;CAC/B,MAAM,CAAC,SAAS,aAAa,SAAS,CAAC,WAAW,UAAU,IAAI,CAAC,YAAY,SAAS;CACtF,IAAI,YAAY,KAAA,KAAa,WAAW,KAAK,OAAO,GAClD,OAAO;CAET,IAAI,CAAC,YAAY,KAAK,OAAO,GAC3B,OAAO;CAET,OAAO,cAAc,KAAA,KAAa,WAAW,KAAK,SAAS,KAAK,YAAY,KAAK,SAAS;AAC5F;AACA,SAAS,4BAA4B,UAAU,YAAY,UAAU,aAAa,OAAO;CACvF,MAAM,cAAc,SAAS,eAAe;CAG5C,IAAI,iBAAiB,WAAW;CAKhC,IAAI,MAAM,OAAO,aACf,kBAAkB;MAElB,IAAI,eAAe,GACjB,CAAC,iBAAiB,aAAa,SAAS,UAAU,QAAQ;MAE1D,CAAC,YAAY,iBAAiB,aAAa,SAAS,UAAU,YAAY,QAAQ;CAGtF,gBAAgB,eAAe,MAAM,EAAE;CACvC,IAAI;OACG,MAAM,UAAU,YAAY,QAC/B,IAAI,CAAC,gBAAgB,UAAU,MAAM,GACnC,gBAAgB,aAAa,MAAM;CAAA;CAIzC,OAAO;EACM;EACC;EACK;CACnB;AACF;;;;;;;;AAUA,SAAS,kCAAkC,WAAW,uBAAuB;CAC3E,MAAM,WAAW;CACjB,IAAI,uBAAuB,KAAA;CAC3B,IAAI,qBAAqB,KAAA;CACzB,IAAI,wBAAwB,KAAA;CAC5B,IAAI,aAAa,KAAA;CACjB,KAAK,MAAM,eAAe,uBAAuB;EAC/C,IAAI,CAAC,YAAY,WAAW,CAAC,YAAY,cACvC;EAEF,MAAM,QAAQ,SAAS,eAAe,EAAE,MAAM,YAAY,YAAY;EACtE,IAAI,CAAC,OACH;EAEF,MAAM,aAAa,MAAM,SAAS;EAClC,MAAM,WAAW,YAAY,cAAc,YAAY,YAAY,UAAU,KAAK,IAAI,aAAa,MAAM,GAAG;EAC5G,IAAI,aAAa,OACf;EAEF,IAAI,yBAAyB,KAAA,KAAa,uBAAuB,KAAA,KAEjE,aAAa,yBAAyB,WAAW,sBAAsB,YAAY,uBAAuB;GACxG,uBAAuB;GACvB,qBAAqB;GACrB,wBAAwB;GACxB,aAAa;EACf;CACF;CACA,IAAI,yBAAyB,KAAA,KAAa,uBAAuB,KAAA,KAAa,0BAA0B,KAAA,KAAa,eAAe,KAAA,GAClI,OAAO;CAET,OAAO;EACL,UAAU;EACV,OAAO;EACP,YAAY;EACZ,aAAa;CACf;AACF;AACA,SAAS,gCAAgC,UAAU,YAAY,UAAU,aAAa,OAAO;CAC3F,IAAI,iBAAiB,WAAW;CAChC,IAAI,eAAe,GACjB,CAAC,iBAAiB,aAAa,SAAS,UAAU,QAAQ;MAE1D,CAAC,YAAY,iBAAiB,aAAa,SAAS,UAAU,YAAY,QAAQ;CAEpF,IAAI,CAAC,YAAY,SACf,OAAO;CAET,MAAM,2BAA2B,YAAY,QAAQ,iBAAiB,KAAK;CAC3E,OAAO;EACL;EACA;EACA,iBAAiB,4BAA4B,KAAA;CAC/C;AACF;;;;;;;;;;;;;;AAiBA,SAAS,gCAAgC,MAAM;CAC7C,OAAO,YAAY,IAAI,KAAK,CAAC,KAAK,UAAU,MAAM;AACpD;;;;;;;AAQA,SAAS,uBAAuB,UAAU,6BAA6B,uBAAuB;CAC5F,IAAI,kBAAkB,mCAAmC,UAAU,2BAA2B;CAC9F,IAAI,iBAAiB,kCAAkC,UAAU,qBAAqB;CACtF,IAAI,mBAAmB,gBAErB,IAAI,gBAAgB,cAAc,eAAe,cAAc,gBAAgB,YAAY,eAAe,YAE1G,eAAe,aAAa,gBAAgB,UAE1C,iBAAiB;MAGjB,kBAAkB;CAGtB,IAAI,iBAAiB;EACnB,MAAM,SAAS,4BAA4B,UAAU,gBAAgB,YAAY,gBAAgB,UAAU,gBAAgB,aAAa,gBAAgB,KAAK;EAC7J,IAAI,gCAAgC,OAAO,SAAS,GAClD,uBAAuB,OAAO,WAAW,6BAA6B,qBAAqB;EAE7F,IAAI,gCAAgC,OAAO,UAAU,GACnD,uBAAuB,OAAO,YAAY,6BAA6B,qBAAqB;EAE9F,IAAI,gCAAgC,OAAO,eAAe,GACxD,uBAAuB,OAAO,iBAAiB,6BAA6B,qBAAqB;CAErG,OAAO,IAAI,gBAAgB;EACzB,MAAM,SAAS,gCAAgC,UAAU,eAAe,YAAY,eAAe,UAAU,eAAe,aAAa,eAAe,KAAK;EAC7J,IAAI,CAAC,QACH;EAEF,IAAI,gCAAgC,OAAO,SAAS,GAClD,uBAAuB,OAAO,WAAW,6BAA6B,qBAAqB;EAE7F,IAAI,gCAAgC,OAAO,UAAU,GACnD,uBAAuB,OAAO,YAAY,6BAA6B,qBAAqB;EAE9F,IAAI,gCAAgC,OAAO,eAAe,GACxD,uBAAuB,OAAO,iBAAiB,6BAA6B,qBAAqB;CAErG;CAIA,MAAM,gBAAgB,aADF,SAAS,eACgB,CAAC;CAC9C,SAAS,eAAe,aAAa;AACvC;;;;;;;;;;;AAaA,SAAS,qBAAqB,cAAc,yBAAyB,OAAO;CAC1E,MAAM,SAAS,mBAAmB,YAAY;CAC9C,MAAM,8BAA8B,kCAAkC,OAAO,UAAU;CACvF,QAAQ,gBAAgB,SAAS;EAC/B,MAAM,QAAQ,eAAe,MAAM,IAAI;EACvC,MAAM,cAAc,MAAM;EAC1B,MAAM,OAAO,QAAQ,SAAS;EAC9B,KAAK,MAAM;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,KAAK;GACpC,MAAM,WAAW,MAAM;GACvB,MAAM,CAAC,UAAU,gBAAgB,iBAAiB,OAAO,GAAG,OAAO,kBAAkB,IAAI;GACzF,IAAI,UAAU;IAKZ,IAAI;IACJ;GACF;GACA,cAAc,UAAU,MAAM,OAAO,SAAS,6BAA6B,OAAO,WAAW,sBAAsB;EACrH;EACA,MAAM,WAAW,KAAK,YAAY;EAClC,KAAK,MAAM,SAAS,UAAU;GAI5B,IAAI,CAAC,0BAA0B,iBAAiB,KAAK,KAAK,KAAK,gBAAgB,IAAI,GAAG;IACpF,MAAM,OAAO;IACb;GACF;GAEA,IAAI,eAAe,KAAK,GACtB,KAAK,MAAM,YAAY,MAAM,gBAAgB,GAC3C,2BAA2B,QAAQ;EAGzC;EACA,IAAI,cAAc,MAAM,MACtB,KAAK,YAAY;CAErB;AACF;;;;;AAMA,SAAS,iBAAiB,OAAO,gBAAgB,8BAA8B,UAAU;CACvF,KAAK,MAAM,eAAe,8BAA8B;EACtD,MAAM,EACJ,6BACA,WACA,aACA,YACE;EACJ,MAAM,aAAa,MAAM,gBAAgB,MAAM,WAAW;EAC1D,IAAI,CAAC,YACH;EAEF,IAAI,6BAA6B;GAC/B,MAAM,SAAS,4BAA4B;IACzC;IACA;IACA;IACA;IACA;GACF,CAAC;GACD,IAAI,WAAW,MACb;QACK,IAAI,QACT,OAAO;EAEX;EACA,MAAM,iBAAiB,OAAO,cAAc,YAAY,YAAY,YAAY,UAAU,SAAS;EACnG,MAAM,gBAAgB,aAAa,OAAO,cAAc,YAAY,cAAc,YAAY,UAAU,WAAW,CAAC;EACpH,IAAI,eAAe;EACnB,MAAM,cAAc,MAAM;EAG1B,OAAO,eAAe,aAAa;GACjC,MAAM,WAAW,iBAAiB,MAAM,cAAc,MAAM,cAAc,IAAI;GAC9E,IAAI,CAAC;QACC,CAAC,iBAAiB,iBAAiB,eAAe,cAAc,GAClE;KACA;KACA;IACF;;GAKF,IAAI,YAAY,mBAAmB,gBAAgB,SAAS,UAAU,WAAW,OAAO;IACtF;IACA;GACF;GAIA,MAAM,iBAAiB,CAAC;GACxB,IAAI,YAAY,mBAAmB,cACjC,eAAe,KAAK,MAAM,gBAAgB,MAAM,WAAW,GAAG,QAAQ,CAAC,SAAS,GAAG,MAAM,CAAC;QAE1F,KAAK,IAAI,IAAI,gBAAgB,KAAK,cAAc,KAC9C,IAAI,MAAM,gBAAgB;IACxB,MAAM,OAAO,MAAM,GAAG,MAAM,WAAW,GAAG,MAAM;IAChD,eAAe,KAAK,IAAI;GAC1B,OAAO,IAAI,MAAM,gBAAgB,UAAU;IACzC,MAAM,OAAO,MAAM,GAAG,MAAM,GAAG,CAAC,SAAS,GAAG,MAAM;IAClD,eAAe,KAAK,IAAI;GAC1B,OACE,eAAe,KAAK,MAAM,EAAE;GAIlC,IAAI,QAAQ,UAAU,MAAM,YAAY,UAAU,gBAAgB,IAAI,MAAM,OAE1E,OAAO,CAAC,MAAM,YAAY;GAK5B;EACF;CACF;CAGA,OAAO,CAAC,OAAO,cAAc;AAC/B;AACA,SAAS,cAAc,UAAU,UAAU,qBAAqB,6BAA6B,uBAAuB,wBAAwB;CAC1I,MAAM,WAAW,gBAAgB,QAAQ;CACzC,MAAM,cAAc,qBAAqB;CACzC,YAAY,OAAO,QAAQ;CAC3B,SAAS,OAAO,WAAW;CAC3B,KAAK,MAAM,EACT,QACA,aACG,qBAAqB;EACxB,MAAM,QAAQ,SAAS,MAAM,MAAM;EACnC,IAAI,OAAO;GACT,SAAS,eAAe,SAAS,MAAM,MAAM,GAAG,MAAM,CAAC;GACvD,IAAI,QAAQ,aAAa,CAAC,QAAQ,GAAG,OAAO,IAAI,MAAM,OACpD;EAEJ;CACF;CACA,uBAAuB,UAAU,6BAA6B,qBAAqB;CAKnF,IAAI,YAAY,WAAW,KAAK,SAAS,SAAS,GAAG;EACnD,MAAM,eAAe,YAAY,mBAAmB;EACpD,IAAI,CAAC,2BAEL,iBAAiB,YAAY,KAAK,aAAa,YAAY,KAAK,YAAY,YAAY,IAAI;GAC1F,IAAI,aAAa;GACjB,IAAI,YAAY,YAAY,GAAG;IAC7B,MAAM,iBAAiB,aAAa,kBAAkB;IACtD,IAAI,kBAAkB,MACpB,aAAa;SAEb,aAAaA,sBAAoB,gBAAgB,eAAe;GAEpE;GACA,IAAI,cAAc,QAAQ,WAAW,mBAAmB,IAAI,GAAG;IAC7D,MAAM,YAAY,WAAW,aAAa;IAC1C,IAAI,YAAY,SAAS,GAAG;KAC1B,MAAM,WAAW,UAAU,eAAe;KAC1C,IAAI,SAAS,SAAS,IAAI,GACxB,UAAU,eAAe,SAAS,MAAM,GAAG,EAAE,CAAC;UACzC,IAAI,SAAS,KAAK,QAAQ,GAC/B,UAAU,eAAe,SAAS,QAAQ,UAAU,EAAE,CAAC;IAE3D;IACA,WAAW,OAAO,WAAW,gBAAgB,GAAG,GAAG,CAAC,qBAAqB,GAAG,GAAG,YAAY,YAAY,CAAC,CAAC;IACzG,YAAY,OAAO;GACrB;EACF;CACF;AACF;AAGA,SAAS,2BAA2B,UAAU;CAC5C,MAAM,6BAAa,IAAI,IAAI;CAC3B,MAAM,OAAO,SAAS,eAAe;CACrC,IAAI,QAAQ,KAAK,QAAQ,GAAI;CAG7B,OAAO,UAAU,IAAI;EACnB,WAAW,IAAI,KAAK;EACpB,WAAW,IAAI,QAAQ,CAAC;EACxB,QAAQ,KAAK,QAAQ,KAAM,QAAQ,CAAC;CACtC;CAIA,SAD4B,UAAU,GAAG,UAChC,EAAE,SAAQ,SAAQ;EACzB,IAAI,KAAK,eAAe,MAAM,KAC5B,KAAK,QAAQ,eAAe,CAAC;CAEjC,CAAC;AACH;AACA,SAAS,kCAAkC,kBAAkB;CAC3D,MAAM,oBAAoB,CAAC;CAC3B,MAAM,uBAAuB,CAAC;CAC9B,MAAM,iBAAiB,CAAC;CACxB,KAAK,MAAM,eAAe,kBAAkB;EAC1C,MAAM,EACJ,QACE;EACJ,kBAAkB,OAAO;EACzB,MAAM,YAAY,IAAI,QAAQ,eAAe,MAAM;EACnD,eAAe,KAAK,SAAS;EAG7B,IAAI,IAAI,WAAW,GACjB,IAAI,QAAQ,KAKV,qBAAqB,OAAO,IAAI,OAAO,iDAAiD;OAExF,qBAAqB,OAAO,IAAI,OAAO,YAAY,UAAU,KAAK,UAAU,SAAS,UAAU,SAAS,UAAU,WAAW,UAAU,MAAM,UAAU,WAAW,UAAU,GAAG;OAIjL,qBAAqB,OAAO,IAAI,OAAO,eAAe,UAAU,SAAS,UAAU,kBAAkB,UAAU,MAAM,UAAU,UAAU;CAE7I;CACA,OAAO;EAEL;EAIA,gBAAgB,IAAI,OAAO,IAAI,eAAe,KAAK,GAAG,EAAE,IAAI,GAAG;EAC/D;CACF;AACF;;;;;;;;AAYA,SAAS,sBAAsB,SAAS;CACtC,MAAM,IAAI,MAAM,OAAO;AACzB;;;;;;;;AAUA,MAAM,qBAAqB;AAC3B,MAAM,uBAAuB;AAC7B,MAAM,mBAAmB;AACzB,MAAM,gBAAgB;AACtB,MAAM,cAAc;AACpB,MAAM,mBAAmB;AACzB,MAAM,iBAAiB;AACvB,MAAM,yBAAyB;AAC/B,MAAM,oBAAoB;AAC1B,MAAM,4BAA4B;AAClC,MAAM,kBAAkB;AACxB,MAAM,gBAAgB;AACtB,MAAM,aAAY,UAAS,IAAI,OAAO,MAAM,MAAM,OAAO,KAAK,MAAM,KAAK;AACzE,MAAM,kBAAkB,YAAY,gBAAgB;CAClD,QAAO,MAAK,OAAO,MAAM,YAAY,UAAU,KAAK,CAAC,IAAI,IAAI;CAC7D,iBAAiB;AACnB,CAAC;AACD,MAAM,iBAAiB,YAAY,eAAe;CAChD,QAAO,QAAO;EACZ,IAAI,OAAO,QAAQ,YAAY,UAAU,KAAK,GAAG,GAC/C,OAAO;EAET,OAAO;CACT;CACA,iBAAiB;AACnB,CAAC;AACD,MAAM,mBAAkB,eAAc;CACpC,QAAQ,YAAY,UAAU,OAAO,aAAa;EAChD,MAAM,OAAO,WAAW,KAAK;EAC7B,KAAK,OAAO,GAAG,QAAQ;EACvB,WAAW,QAAQ,IAAI;EACvB,IAAI,CAAC,UACH,KAAK,OAAO,GAAG,CAAC;CAEpB;AACF;AAIA,MAAM,mBAAmB;AACzB,SAAS,UAAU,aAAa;CAC9B,MAAM,OAAO,YAAY,MAAM,KAAK;CACpC,MAAM,SAAS,YAAY,MAAM,IAAI;CACrC,IAAI,SAAS;CACb,IAAI,MACF,UAAU,KAAK;CAEjB,IAAI,QACF,UAAU,KAAK,MAAM,OAAO,SAAS,gBAAgB;CAEvD,OAAO;AACT;AACA,MAAM,eAAc,aAAY;CAC9B,QAAQ,YAAY,UAAU,OAAO,aAAa;EAChD,MAAM,eAAe,WAAW,mBAAmB;EACnD,MAAM,WAAW,WAAW,eAAe;EAC3C,MAAM,WAAW,oBAAoB,aAAa,UAAU,MAAM,OAAO,MAAM,KAAA,CAAS;EACxF,MAAM,iBAAiB,MAAM,GAAG,KAAK,EAAE;EACvC,MAAM,cAAc,aAAa,YAAY,aAAa,YAAY,mBAAmB,gBAAgB,MAAM,cAAc,IAAI,iBAAiB,KAAA;EAClJ,IAAI,YAAY,QAAQ,KAAK,SAAS,YAAY,MAAM,UAAU;GAChE,IAAI,YACF,UAAU,UAAU,iBAAiB,UAAU;GAEjD,MAAM,aAAa,SAAS,cAAc;GAC1C,IAAI,eAAe,MACjB,WAAW,aAAa,QAAQ;QAGhC,SAAS,OAAO,QAAQ;GAE1B,WAAW,OAAO;EACpB,OAAO,IAAI,YAAY,YAAY,KAAK,aAAa,YAAY,MAAM,UAAU;GAC/E,IAAI,YACF,UAAU,cAAc,iBAAiB,UAAU;GAErD,aAAa,OAAO,QAAQ;GAC5B,WAAW,OAAO;EACpB,OAAO;GACL,MAAM,OAAO,gBAAgB,UAAU,aAAa,WAAW,OAAO,MAAM,EAAE,IAAI,KAAA,CAAS;GAC3F,IAAI,YACF,UAAU,MAAM,iBAAiB,UAAU;GAE7C,KAAK,OAAO,QAAQ;GACpB,WAAW,QAAQ,IAAI;EACzB;EACA,SAAS,OAAO,GAAG,QAAQ;EAC3B,IAAI,CAAC,UACH,SAAS,OAAO,GAAG,CAAC;EAEtB,MAAM,SAAS,UAAU,MAAM,EAAE;EACjC,IAAI,QACF,SAAS,UAAU,MAAM;CAE7B;AACF;AACA,MAAM,eAAe,UAAU,gBAAgB,UAAU;CACvD,MAAM,SAAS,CAAC;CAChB,MAAM,WAAW,SAAS,YAAY;CACtC,IAAI,QAAQ;CACZ,KAAK,MAAM,gBAAgB,UACzB,IAAI,gBAAgB,YAAY,GAAG;EACjC,IAAI,aAAa,gBAAgB,MAAM,GAAG;GACxC,MAAM,aAAa,aAAa,cAAc;GAC9C,IAAI,YAAY,UAAU,GAAG;IAC3B,OAAO,KAAK,YAAY,YAAY,gBAAgB,QAAQ,CAAC,CAAC;IAC9D;GACF;EACF;EACA,MAAM,SAAS,IAAI,OAAO,QAAQ,gBAAgB;EAClD,MAAM,WAAW,SAAS,YAAY;EACtC,MAAM,aAAa,UAAU,UAAU,eAAe;EACtD,MAAM,SAAS,aAAa,WAAW,GAAG,SAAS,SAAS,IAAI,MAAM,MAAM,aAAa,UAAU,GAAG,WAAW,IAAI,aAAa,WAAW,IAAI,MAAM,IAAI,MAAM,aAAa;EAC9K,IAAI,eAAe,eAAe,YAAY;EAC9C,IAAI,aAAa,UACf,eAAe,aAAa,QAAQ,uBAAuB,QAAQ;EAErE,OAAO,KAAK,SAAS,SAAS,YAAY;EAC1C;CACF;CAEF,OAAO,OAAO,KAAK,IAAI;AACzB;AACA,MAAM,UAAU;CACd,cAAc,CAAC,WAAW;CAC1B,SAAS,MAAM,mBAAmB;EAChC,IAAI,CAAC,eAAe,IAAI,GACtB,OAAO;EAET,MAAM,QAAQ,OAAO,KAAK,OAAO,EAAE,MAAM,CAAC,CAAC;EAC3C,OAAO,IAAI,OAAO,KAAK,IAAI,MAAM,eAAe,IAAI;CACtD;CACA,QAAQ;CACR,SAAS,iBAAgB,UAAS;EAEhC,OAAO,mBADK,MAAM,MAAM,GAAG,MACE;CAC/B,CAAC;CACD,MAAM;AACR;AACA,MAAM,QAAQ;CACZ,cAAc,CAAC,SAAS;CACxB,SAAS,MAAM,mBAAmB;EAChC,IAAI,CAAC,aAAa,IAAI,GACpB,OAAO;EAET,MAAM,QAAQ,eAAe,IAAI,EAAE,MAAM,IAAI;EAC7C,MAAM,SAAS,CAAC;EAChB,KAAK,MAAM,QAAQ,OACjB,OAAO,KAAK,OAAO,IAAI;EAEzB,OAAO,OAAO,KAAK,IAAI;CACzB;CACA,QAAQ;CACR,UAAU,YAAY,UAAU,QAAQ,aAAa;EACnD,IAAI,UAAU;GACZ,MAAM,eAAe,WAAW,mBAAmB;GACnD,IAAI,aAAa,YAAY,GAAG;IAC9B,aAAa,OAAO,aAAa,gBAAgB,GAAG,GAAG,CAAC,qBAAqB,GAAG,GAAG,QAAQ,CAAC;IAC5F,WAAW,OAAO;IAClB;GACF;EACF;EACA,MAAM,OAAO,iBAAiB;EAC9B,KAAK,OAAO,GAAG,QAAQ;EACvB,WAAW,QAAQ,IAAI;EACvB,IAAI,CAAC,UACH,KAAK,OAAO,GAAG,CAAC;CAEpB;CACA,MAAM;AACR;AACA,MAAM,OAAO;CACX,cAAc,CAAC,QAAQ;CACvB,SAAQ,SAAQ;EACd,IAAI,CAAC,YAAY,IAAI,GACnB,OAAO;EAET,MAAM,cAAc,KAAK,eAAe;EACxC,IAAI,QAAQ,UAAU,MAAM,cAAc;EAC1C,IAAI,YAAY,QAAQ,KAAK,IAAI,IAAI;GACnC,MAAM,YAAY,YAAY,MAAM,QAAQ;GAC5C,IAAI,WAAW;IACb,MAAM,YAAY,KAAK,IAAI,GAAG,UAAU,KAAI,MAAK,EAAE,MAAM,CAAC;IAC1D,QAAQ,IAAI,OAAO,YAAY,CAAC;GAClC;EACF;EACA,OAAO,SAAS,KAAK,YAAY,KAAK,OAAO,cAAc,OAAO,cAAc,MAAM,OAAO;CAC/F;CACA,8BAA8B,EAC5B,OACA,UACA,gBACA,iBACI;EACJ,MAAM,QAAQ,WAAW;EACzB,MAAM,cAAc,MAAM,KAAK,EAAE;EACjC,MAAM,cAAc,MAAM;EAC1B,MAAM,kBAAkB,WAAW,QAAQ,MAAM;EACjD,MAAM,aAAa,YAAY,MAAM,eAAe;EACpD,MAAM,qBAAqB,IAAI,OAAO,MAAM,YAAY,IAAI;EAC5D,IAAI,mBAAmB,KAAK,UAAU,GAAG;GACvC,MAAM,WAAW,WAAW,MAAM,kBAAkB;GACpD,MAAM,UAAU,WAAW,MAAM,GAAG,WAAW,YAAY,SAAS,EAAE,CAAC;GACvE,MAAM,iBAAiB,CAAC,GAAG,UAAU;GACrC,eAAe,KAAK;GACpB,KAAK,QAAQ,UAAU,MAAM,gBAAgB,UAAU,CAAC,OAAO,GAAG,IAAI;GACtE,OAAO,CAAC,MAAM,cAAc;EAC9B;EACA,MAAM,oBAAoB,IAAI,OAAO,cAAc,YAAY,IAAI;EACnE,KAAK,IAAI,IAAI,iBAAiB,GAAG,IAAI,MAAM,QAAQ,KAAK;GACtD,MAAM,OAAO,MAAM;GACnB,IAAI,kBAAkB,KAAK,IAAI,GAAG;IAChC,MAAM,WAAW,KAAK,MAAM,iBAAiB;IAC7C,MAAM,iBAAiB,MAAM,MAAM,iBAAiB,GAAG,CAAC;IACxD,MAAM,iBAAiB,YAAY,MAAM,WAAW,GAAG,MAAM;IAC7D,IAAI,eAAe,SAAS,GAC1B,eAAe,QAAQ,cAAc;IAEvC,KAAK,QAAQ,UAAU,MAAM,YAAY,UAAU,gBAAgB,IAAI;IACvE,OAAO,CAAC,MAAM,CAAC;GACjB;EACF;EACA,MAAM,iBAAiB,MAAM,MAAM,iBAAiB,CAAC;EACrD,MAAM,iBAAiB,YAAY,MAAM,WAAW,GAAG,MAAM;EAC7D,IAAI,eAAe,SAAS,GAC1B,eAAe,QAAQ,cAAc;EAEvC,KAAK,QAAQ,UAAU,MAAM,YAAY,MAAM,gBAAgB,IAAI;EACnE,OAAO,CAAC,MAAM,MAAM,SAAS,CAAC;CAChC;CACA,WAAW;EACT,UAAU;EACV,QAAQ;CACV;CACA,aAAa;CACb,UAAU,UAAU,UAAU,YAAY,UAAU,gBAAgB,aAAa;EAC/E,IAAI;EACJ,IAAI;EACJ,MAAM,QAAQ,WAAW,KAAK,WAAW,GAAG,KAAK,IAAI;EACrD,MAAM,WAAW,WAAW,MAAM,KAAA;EAClC,IAAI,CAAC,YAAY,gBAAgB;GAC/B,IAAI,eAAe,WAAW,GAC5B,IAAI,UAAU;IACZ,gBAAgB,gBAAgB,QAAQ;IACxC,OAAO,eAAe;GACxB,OAAO;IACL,gBAAgB,gBAAgB,QAAQ;IACxC,OAAO,eAAe,GAAG,WAAW,GAAG,IAAI,eAAe,GAAG,MAAM,CAAC,IAAI,eAAe;GACzF;QACK;IACL,gBAAgB,gBAAgB,QAAQ;IACxC,IAAI,eAAe,SAAS;SACtB,eAAe,GAAG,KAAK,EAAE,WAAW,GACtC,eAAe,MAAM;UAChB,IAAI,eAAe,GAAG,WAAW,GAAG,GACzC,eAAe,KAAK,eAAe,GAAG,MAAM,CAAC;IAAA;IAGjD,OAAO,eAAe,SAAS,KAAK,CAAC,eAAe,eAAe,SAAS,GAAG,QAC7E,eAAe,IAAI;IAErB,OAAO,eAAe,KAAK,IAAI;GACjC;GACA,UAAU,eAAe,gBAAgB,KAAK;GAC9C,MAAM,WAAW,gBAAgB,IAAI;GACrC,cAAc,OAAO,QAAQ;GAC7B,SAAS,OAAO,aAAa;EAC/B,OAAO,IAAI,UACT,iBAAgB,UAAS;GACvB,OAAO,gBAAgB,QAAQ,MAAM,KAAK,KAAA,CAAS;EACrD,CAAC,EAAE,UAAU,UAAU,YAAY,QAAQ;CAE/C;CACA,MAAM;AACR;AACA,MAAM,iBAAiB;CACrB,cAAc,CAAC,UAAU,YAAY;CACrC,SAAS,MAAM,mBAAmB;EAChC,OAAO,YAAY,IAAI,IAAI,YAAY,MAAM,gBAAgB,CAAC,IAAI;CACpE;CACA,QAAQ;CACR,SAAS,YAAY,QAAQ;CAC7B,MAAM;AACR;AACA,MAAM,aAAa;CACjB,cAAc,CAAC,UAAU,YAAY;CACrC,SAAS,MAAM,mBAAmB;EAChC,OAAO,YAAY,IAAI,IAAI,YAAY,MAAM,gBAAgB,CAAC,IAAI;CACpE;CACA,QAAQ;CACR,SAAS,YAAY,OAAO;CAC5B,MAAM;AACR;AACA,MAAM,eAAe;CACnB,cAAc,CAAC,UAAU,YAAY;CACrC,SAAS,MAAM,mBAAmB;EAChC,OAAO,YAAY,IAAI,IAAI,YAAY,MAAM,gBAAgB,CAAC,IAAI;CACpE;CACA,QAAQ;CACR,SAAS,YAAY,QAAQ;CAC7B,MAAM;AACR;AACA,MAAM,cAAc;CAClB,QAAQ,CAAC,MAAM;CACf,KAAK;CACL,MAAM;AACR;AACA,MAAM,YAAY;CAChB,QAAQ,CAAC,WAAW;CACpB,KAAK;CACL,MAAM;AACR;AACA,MAAM,mBAAmB;CACvB,QAAQ,CAAC,QAAQ,QAAQ;CACzB,KAAK;CACL,MAAM;AACR;AACA,MAAM,yBAAyB;CAC7B,QAAQ,CAAC,QAAQ,QAAQ;CACzB,WAAW;CACX,KAAK;CACL,MAAM;AACR;AACA,MAAM,YAAY;CAChB,QAAQ,CAAC,MAAM;CACf,KAAK;CACL,MAAM;AACR;AACA,MAAM,kBAAkB;CACtB,QAAQ,CAAC,MAAM;CACf,WAAW;CACX,KAAK;CACL,MAAM;AACR;AACA,MAAM,gBAAgB;CACpB,QAAQ,CAAC,eAAe;CACxB,KAAK;CACL,MAAM;AACR;AACA,MAAM,cAAc;CAClB,QAAQ,CAAC,QAAQ;CACjB,KAAK;CACL,MAAM;AACR;AACA,MAAM,oBAAoB;CACxB,QAAQ,CAAC,QAAQ;CACjB,WAAW;CACX,KAAK;CACL,MAAM;AACR;AAMA,MAAM,OAAO;CACX,cAAc,CAAC,QAAQ;CACvB,SAAS,MAAM,gBAAgB,iBAAiB;EAC9C,IAAI,CAAC,YAAY,IAAI,KAAK,gBAAgB,IAAI,GAC5C,OAAO;EAET,MAAM,cAAc,eAAe,IAAI;EACvC,IAAI,QAAQ,KAAK,SAAS;EAC1B,IAAI,SAAS,MACX,QAAQ,MAAM,QAAQ,YAAY,MAAM;EAG1C,OADoB,QAAQ,IAAI,YAAY,IAAI,KAAK,OAAO,EAAE,IAAI,MAAM,MAAM,IAAI,YAAY,IAAI,KAAK,OAAO,EAAE;CAElH;CACA,cAAc;CACd,QAAQ;CACR,UAAU,UAAU,UAAU;EAE5B,IAAIC,oBAAsB,UAAU,WAAW,GAC7C;EAEF,MAAM,GAAG,UAAU,YAAY,gBAAgB;EAG/C,MAAM,WAAW,gBAFD,cAAc,OAAO,aAAa,UAAU,IAAI,KAAA,GAEtB,EACxC,OAFgB,gBAAgB,OAAO,aAAa,YAAY,IAAI,KAAA,EAGtE,CAAC;EACD,MAAM,oBAAoB,SAAS,MAAM,GAAG,EAAE,SAAS;EACvD,MAAM,qBAAqB,SAAS,MAAM,GAAG,EAAE,SAAS;EACxD,IAAI,iBAAiB;EACrB,IAAI,kBAAkB;EACtB,IAAI,oBAAoB,oBACtB;OACK,IAAI,oBAAoB,oBAAoB;GACjD,MAAM,gBAAgB,SAAS,MAAM,GAAG;GACxC,kBAAkB,MAAM,cAAc;GACtC,iBAAiB,cAAc,MAAM,CAAC,EAAE,KAAK,GAAG;EAClD;EACA,MAAM,eAAe,gBAAgB,cAAc;EACnD,aAAa,UAAU,SAAS,UAAU,CAAC;EAC3C,SAAS,OAAO,YAAY;EAC5B,SAAS,QAAQ,QAAQ;EACzB,IAAI,iBACF,SAAS,aAAa,gBAAgB,eAAe,CAAC;EAExD,OAAO;CACT;CACA,SAAS;CACT,MAAM;AACR;AACA,MAAM,uBAAuB;CAAC;CAAS;CAAO;CAAgB;AAAY;AAC1E,MAAM,iCAAiC,CAAC,IAAI;AAM5C,MAAM,2BAA2B;CAAC;CAAa;CAAkB;CAAwB;CAAW;CAAiB;CAAW;CAAa;CAAmB;AAAa;AAC7K,MAAM,0BAA0B,CAAC,IAAI;AACrC,MAAM,eAAe;CAAC,GAAG;CAAsB,GAAG;CAAgC,GAAG;CAA0B,GAAG;AAAuB;AACzI,SAAS,kBAAkB,OAAO,2BAA2B,OAAO;CAClE,MAAM,QAAQ,MAAM,MAAM,IAAI;CAC9B,IAAI,cAAc;CAClB,MAAM,iBAAiB,CAAC;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,UAAU,MAAM;EACtB,MAAM,OAAO,QAAQ,QAAQ;EAC7B,MAAM,WAAW,eAAe,eAAe,SAAS;EAGxD,IAAI,uBAAuB,KAAK,IAAI,GAAG;GACrC,eAAe,KAAK,IAAI;GACxB;EACF;EAGA,IAAI,iBAAiB,KAAK,IAAI,KAAK,eAAe,KAAK,IAAI,GAAG;GAC5D,cAAc,CAAC;GACf,eAAe,KAAK,IAAI;GACxB;EACF;EAGA,IAAI,aAAa;GACf,eAAe,KAAK,OAAO;GAC3B;EACF;EAIA,IAAI,SAAS,MAAM,aAAa,MAAM,CAAC,YAAY,cAAc,KAAK,QAAQ,KAAK,cAAc,KAAK,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,mBAAmB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,iBAAiB,KAAK,IAAI,KAAK,kBAAkB,KAAK,IAAI,KAAK,0BAA0B,KAAK,IAAI,KAAK,CAAC,4BAA4B,gBAAgB,KAAK,IAAI,KAAK,cAAc,KAAK,IAAI,KAAK,UAAU,aAAa,EAAE,KAAK,QAAQ,KAAK,UAAU,eAAe,EAAE,KAAK,QAAQ,KAAK,eAAe,KAAK,QAAQ,GAK7f,eAAe,KAAK,CAAC,4BAA4B,SAAS,KAAK,UAAU,IAAI;OAE7E,eAAe,eAAe,SAAS,KAAK,WAAW,MAAM,KAAK,UAAU;CAEhF;CACA,OAAO,eAAe,KAAK,IAAI;AACjC;AAEA,SAAS,uBAAuB,YAAY,YAAY,cAAc,qBAAqB;CAEzF,IAAI,CAAC,oBADmB,WAAW,UACI,CAAC,KAAK,WAAW,cAAc,MAAM,YAC1E,OAAO;CAET,MAAM,cAAc,WAAW,eAAe;CAQ9C,IAAI,YAAY,eAAe,OAAO,KACpC,OAAO;CAET,KAAK,MAAM,EACT,QACA,aACG,qBAAqB;EACxB,MAAM,QAAQ,YAAY,MAAM,MAAM;EACtC,IAAI,SAAS,MAAM,GAAG,YAAY,MAAM,GAAG,SAAS,GAAG,IAAI,eAAe,eAAe,IAAI;GAC3F,MAAM,eAAe,WAAW,gBAAgB;GAChD,MAAM,CAAC,aAAa,iBAAiB,WAAW,UAAU,YAAY;GAEtE,IAAI,QAAQ,YADK,gBAAgB,CAAC,eAAe,GAAG,YAAY,IAAI,cAClC,OAAO,KAAK,MAAM,OAAO;IACzD,YAAY,OAAO;IACnB,OAAO;GACT;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,gCAAgC,YAAY,YAAY,cAAc,qBAAqB,gBAAgB;CAElH,IAAI,CAAC,oBADmB,WAAW,UACI,CAAC,KAAK,WAAW,cAAc,MAAM,YAC1E,OAAO;CAET,MAAM,cAAc,WAAW,eAAe;CAC9C,IAAI,CAAC;MAOC,YAAY,eAAe,OAAO,KACpC,OAAO;CAAA;CAGX,KAAK,MAAM,EACT,aACA,SACA,eACG,qBAAqB;EACxB,IAAI,aAAa,EAAE,cAAc,cAAc,aAAa,cAAc,aAAa,CAAC,UAAU,UAChG;EAEF,MAAM,QAAQ,YAAY,MAAM,WAAW;EAC3C,IAAI,OAAO;GACT,MAAM,cAAc,kBAAkB,MAAM,GAAG,SAAS,GAAG,IAAI,eAAe,eAAe;GAC7F,IAAI,MAAM,GAAG,WAAW,aACtB;GAEF,MAAM,eAAe,WAAW,gBAAgB;GAChD,MAAM,CAAC,aAAa,iBAAiB,WAAW,UAAU,YAAY;GAEtE,IAAI,QAAQ,YADK,gBAAgB,CAAC,eAAe,GAAG,YAAY,IAAI,cAClC,OAAO,MAAM,MAAM,KAAK,MAAM,OAAO;IACrE,YAAY,OAAO;IACnB,OAAO;GACT;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,yBAAyB,YAAY,cAAc,uBAAuB;CACjF,IAAI,cAAc,WAAW,eAAe;CAE5C,MAAM,eAAe,sBADJ,YAAY,eAAe;CAE5C,IAAI,gBAAgB,MAClB,OAAO;CAKT,IAAI,eAAe,YAAY,QAC7B,cAAc,YAAY,MAAM,GAAG,YAAY;CAEjD,KAAK,MAAM,eAAe,cAAc;EACtC,IAAI,CAAC,YAAY,WAAW,CAAC,YAAY,QACvC;EAEF,MAAM,QAAQ,YAAY,MAAM,YAAY,MAAM;EAClD,IAAI,UAAU,MACZ;EAEF,MAAM,aAAa,MAAM,SAAS;EAClC,MAAM,WAAW,aAAa,MAAM,GAAG;EACvC,IAAI;EACJ,IAAI,eAAe,GACjB,CAAC,eAAe,WAAW,UAAU,QAAQ;OAE7C,GAAG,eAAe,WAAW,UAAU,YAAY,QAAQ;EAE7D,YAAY,WAAW,GAAG,CAAC;EAC3B,YAAY,QAAQ,aAAa,KAAK;EACtC,OAAO;CACT;CACA,OAAO;AACT;AACA,SAAS,2BAA2B,YAAY,cAAc,wBAAwB;CACpF,MAAM,cAAc,WAAW,eAAe;CAC9C,MAAM,mBAAmB,eAAe;CACxC,MAAM,YAAY,YAAY;CAE9B,MAAM,WAAW,uBAAuB;CACxC,IAAI,CAAC,UACH,OAAO;CAET,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,EACJ,QACE;EACJ,MAAM,YAAY,IAAI;EACtB,MAAM,qBAAqB,mBAAmB,YAAY;EAG1D,IAAI,YAAY;OACV,CAAC,iBAAiB,aAAa,oBAAoB,KAAK,GAAG,SAAS,GACtE;EAAA;EAKJ,IAAI,YAAY,qBAAqB,OAAO,KAC1C;EAIF,MAAM,oBAAoB,YAAY,mBAAmB;EACzD,IAAI,QAAQ,cAAc,SAAS,qBAAqB,CAAC,qBAAqB,KAAK,iBAAiB,GAClG;EAEF,MAAM,YAAY;EAClB,IAAI,WAAW;EACf,IAAI,oBAAoB,qBAAqB,aAAa,oBAAoB,GAAG;EAIjF,IAAI,UAAU;EACd,OAAO,oBAAoB,MAAM,UAAU,QAAQ,mBAAmB,IAAI;GACxE,IAAI,iBAAiB,OAAO,GAC1B;GAEF,IAAI,YAAY,OAAO,GAAG;IACxB,IAAI,QAAQ,UAAU,MAAM,GAC1B;IAEF,MAAM,qBAAqB,QAAQ,eAAe;IAClD,WAAW;IACX,oBAAoB,qBAAqB,oBAAoB,mBAAmB,QAAQ,GAAG;GAC7F;EACF;EAGA,IAAI,oBAAoB,GACtB;EAIF,IAAI,aAAa,aAAa,oBAAoB,cAAc,oBAC9D;EAIF,MAAM,mBAAmB,SAAS,eAAe;EACjD,IAAI,oBAAoB,KAAK,iBAAiB,oBAAoB,OAAO,WACvE;EAIF,MAAM,oBAAoB,iBAAiB,oBAAoB;EAC/D,IAAI,QAAQ,cAAc,SAAS,qBAAqB,CAAC,qBAAqB,KAAK,iBAAiB,GAClG;EAIF,IAAI,CAAC,QAAQ,OAAO,SAAS,MAAM,KAAK,0BAA0B,UAAU,iBAAiB,GAC3F;EAKF,MAAM,oBAAoB,UAAU,eAAe;EACnD,MAAM,gBAAgB,kBAAkB,MAAM,GAAG,kBAAkB,IAAI,kBAAkB,MAAM,mBAAmB,CAAC;EACnH,UAAU,eAAe,aAAa;EACtC,MAAM,eAAe,aAAa,YAAY,gBAAgB;EAC9D,SAAS,eAAe,aAAa,MAAM,GAAG,iBAAiB,IAAI,aAAa,MAAM,oBAAoB,SAAS,CAAC;EACpH,MAAM,YAAY,cAAc;EAChC,MAAM,gBAAgB,sBAAsB;EAC5C,cAAc,aAAa;EAE3B,MAAM,YAAY,mBAAmB,aAAa,aAAa,YAAY,IAAI,KAAK;EACpF,cAAc,OAAO,IAAI,SAAS,OAAO,mBAAmB,MAAM;EAClE,cAAc,MAAM,IAAI,UAAU,OAAO,WAAW,MAAM;EAG1D,KAAK,MAAM,UAAU,QAAQ,QAC3B,IAAI,CAAC,cAAc,UAAU,MAAM,GACjC,cAAc,WAAW,MAAM;EAKnC,cAAc,OAAO,IAAI,cAAc,MAAM,KAAK,cAAc,MAAM,QAAQ,cAAc,MAAM,IAAI;EAGtG,KAAK,MAAM,UAAU,QAAQ,QAC3B,IAAI,cAAc,UAAU,MAAM,GAChC,cAAc,aAAa,MAAM;EAGrC,IAAI,kBAAkB,SAAS,GAC7B,cAAc,SAAS,UAAU;EAEnC,OAAO;CACT;CACA,OAAO;AACT;AAMA,SAAS,0BAA0B,MAAM,QAAQ;CAC/C,IAAI,gBAAgB;CACpB,MAAM,OAAO,KAAK,eAAe;CACjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAC1B,IAAI,KAAK,OAAO,KACd;CAGJ,OAAO,gBAAgB,MAAM;AAC/B;AACA,SAAS,qBAAqB,QAAQ,UAAU,KAAK;CACnD,MAAM,YAAY,IAAI;CACtB,KAAK,IAAI,IAAI,UAAU,KAAK,WAAW,KAAK;EAC1C,MAAM,aAAa,IAAI;EACvB,IAAI,iBAAiB,QAAQ,YAAY,KAAK,GAAG,SAAS,KAE1D,OAAO,aAAa,eAAe,KACjC,OAAO;CAEX;CACA,OAAO;AACT;AACA,SAAS,iBAAiB,SAAS,QAAQ,SAAS,QAAQ,QAAQ;CAClE,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAC1B,IAAI,QAAQ,SAAS,OAAO,QAAQ,SAAS,IAC3C,OAAO;CAGX,OAAO;AACT;AACA,SAAS,0BAA0B,QAAQ,eAAe,cAAc;CACtE,MAAM,SAAS,mBAAmB,YAAY;CAC9C,MAAM,kCAAkC,QAAQ,OAAO,aAAa,EAClE,UACI,IAAI,IAAI,SAAS,EAAE;CACzB,MAAM,iCAAiC,QAAQ,OAAO,YAAY,EAChE,cACI,OAAO;CACb,KAAK,MAAM,eAAe,cAAc;EACtC,MAAM,OAAO,YAAY;EACzB,IAAI,SAAS,aAAa,SAAS,gBAAgB,SAAS,qBAAqB;GAC/E,MAAM,eAAe,YAAY;GACjC,KAAK,MAAM,QAAQ,cACjB,IAAI,CAAC,OAAO,QAAQ,IAAI,GAEpB,sBAAsB,yCAAyC,KAAK,QAAQ,EAAE,+EAA+E;EAIrK;CACF;CACA,MAAM,cAAc,YAAY,YAAY,iBAAiB;EAC3D,IAAI,uBAAuB,YAAY,YAAY,cAAc,OAAO,OAAO,GAC7E,OAAO;EAET,IAAI,gCAAgC,YAAY,YAAY,cAAc,OAAO,gBAAgB,GAC/F,OAAO;EAET,IAAI,yBAAyB,YAAY,cAAc,8BAA8B,GACnF,OAAO;EAET,IAAI,2BAA2B,YAAY,cAAc,+BAA+B,GACtF,OAAO;EAET,OAAO;CACT;CACA,OAAO,cAAc,OAAO,wBAAwB,EAClD,MACA,aACA,aACA,sBACI;EAEJ,IAAI,KAAK,IAAI,iBAAiB,KAAK,KAAK,IAAI,YAAY,GACtD;EAIF,IAAI,OAAO,YAAY,GACrB;EAEF,MAAM,YAAY,YAAY,KAAK,aAAa;EAChD,MAAM,gBAAgB,gBAAgB,KAAK,aAAa;EAIxD,IAAI,CAAC,kBAAkB,aAAa,KAAK,CAAC,kBAAkB,SAAS,KAAK,CAAC,UAAU,YAAY,KAAK,UAAU,GAAG,aAAa,GAC9H;EAEF,MAAM,YAAY,UAAU,OAAO;EACnC,MAAM,eAAe,UAAU,OAAO;EACtC,MAAM,aAAa,YAAY,SAAS,IAAI,SAAS;EACrD,IAAI,CAAC,YAAY,UAAU,KAAK,CAAC,YAAY,IAAI,SAAS,KAAK,iBAAiB,KAAK,eAAe,cAAc,OAAO,SAAS,GAChI;EAEF,OAAO,aAAa;GAClB,IAAI,CAAC,gCAAgC,UAAU,GAC7C;GAEF,MAAM,aAAa,WAAW,UAAU;GACxC,IAAI,eAAe,QAAQ,YAAY,UAAU,GAC/C;GAEF,IAAI,WAAW,YAAY,YAAY,UAAU,OAAO,MAAM,GAC5D,cAAc,gBAAgB;EAElC,CAAC;CACH,CAAC,GAAG,OAAO,gBAAgB,oBAAmB,UAAS;EACrD,IAAI,UAAU,QAAQ,MAAM,UAC1B,OAAO;EAET,MAAM,YAAY,cAAc;EAChC,IAAI,CAAC,kBAAkB,SAAS,KAAK,CAAC,UAAU,YAAY,GAC1D,OAAO;EAET,MAAM,eAAe,UAAU,OAAO;EACtC,MAAM,aAAa,UAAU,OAAO,QAAQ;EAC5C,IAAI,CAAC,YAAY,UAAU,KAAK,CAAC,gCAAgC,UAAU,GACzE,OAAO;EAET,MAAM,aAAa,WAAW,UAAU;EACxC,IAAI,eAAe,QAAQ,YAAY,UAAU,GAC/C,OAAO;EAGT,IAAI,iBADgB,WAAW,eACA,EAAE,QAC/B,OAAO;EAET,IAAI,gCAAgC,YAAY,YAAY,cAAc,OAAO,kBAAkB,IAAI,GAAG;GACxG,IAAI,UAAU,MACZ,MAAM,eAAe;GAEvB,OAAO;EACT;EACA,OAAO;CACT,GAAG,oBAAoB,CAAC;AAC1B;;;;;;;;;;;;;;AAiBA,SAAS,2BAA2B,UAAU,eAAe,cAAc,MAAM,yBAAyB,OAAO,2BAA2B,OAAO;CACjJ,MAAM,oBAAoB,yBAAyB,WAAW,kBAAkB,UAAU,wBAAwB;CAElH,OADuB,qBAAqB,cAAc,sBACtC,EAAE,mBAAmB,IAAI;AAC/C;;;;AAKA,SAAS,yBAAyB,eAAe,cAAc,MAAM,yBAAyB,OAAO;CAEnG,OADuB,qBAAqB,cAAc,sBACtC,EAAE,IAAI;AAC5B"}

package/dist/{LexicalMarkdown.prod-k73tZVb2.mjs → LexicalMarkdown.prod-tGG6js4r.mjs}

@@ -1,6 +1,6 @@
-import { _ as LinkNode, a as HeadingNode, c as $createListNode, d as ListItemNode, f as ListNode, h as $isLinkNode, i as $isQuoteNode, l as $isListItemNode, m as $isAutoLinkNode, n as $createQuoteNode, o as QuoteNode, p as $createLinkNode, r as $isHeadingNode, s as $createListItemNode, t as $createHeadingNode, u as $isListNode, v as $createCodeNode, x as CodeNode, y as $isCodeNode } from "./LexicalRichText.node-B7k7wlQz.mjs";
-import { An as createState, At as COMMAND_PRIORITY_LOW, Et as COLLABORATION_TAG, Jt as HISTORY_PUSH_TAG, Kt as HISTORIC_TAG, R as $getRoot, V as $getState, Xn as mergeRegister, Y as $isElementNode, _ as $createTextNode, at as $isRootOrShadowRoot, bt as $setState, ct as $isTextNode, et as $isLineBreakNode, f as $createParagraphNode, g as $createTabNode, m as $createRangeSelection, nt as $isParagraphNode, on as KEY_ENTER_COMMAND, q as $isDecoratorNode, rt as $isRangeSelection, t as $addUpdateTag, u as $createLineBreakNode, vt as $setSelection, y as $findMatchingParent, z as $getSelection } from "./Lexical.node-gYNDt_p9.mjs";
-import { r as $findMatchingParent$1 } from "./LexicalUtils.node-CmK462d1.mjs";
+import { _ as LinkNode, a as HeadingNode, c as $createListNode, d as ListItemNode, f as ListNode, h as $isLinkNode, i as $isQuoteNode, l as $isListItemNode, m as $isAutoLinkNode, n as $createQuoteNode, o as QuoteNode, p as $createLinkNode, r as $isHeadingNode, s as $createListItemNode, t as $createHeadingNode, u as $isListNode, v as $createCodeNode, x as CodeNode, y as $isCodeNode } from "./LexicalRichText.node-BEkm_YwY.mjs";
+import { An as createState, At as COMMAND_PRIORITY_LOW, Et as COLLABORATION_TAG, Jt as HISTORY_PUSH_TAG, Kt as HISTORIC_TAG, R as $getRoot, V as $getState, Xn as mergeRegister, Y as $isElementNode, _ as $createTextNode, at as $isRootOrShadowRoot, bt as $setState, ct as $isTextNode, et as $isLineBreakNode, f as $createParagraphNode, g as $createTabNode, m as $createRangeSelection, nt as $isParagraphNode, on as KEY_ENTER_COMMAND, q as $isDecoratorNode, rt as $isRangeSelection, t as $addUpdateTag, u as $createLineBreakNode, vt as $setSelection, y as $findMatchingParent, z as $getSelection } from "./Lexical.node-BR9e7Cyk.mjs";
+import { r as $findMatchingParent$1 } from "./LexicalUtils.node-Dz-HANi6.mjs";
 //#region ../../node_modules/.pnpm/@lexical+markdown@0.44.0/node_modules/@lexical/markdown/LexicalMarkdown.prod.mjs
 /**
 * Copyright (c) Meta Platforms, Inc. and affiliates.
@@ -753,4 +753,4 @@ function le(t = te, e, o = !1) {
 //#endregion
 export { ie as $convertFromMarkdownString, le as $convertToMarkdownString, Wt as BOLD_ITALIC_STAR, Dt as BOLD_ITALIC_UNDERSCORE, Kt as BOLD_STAR, qt as BOLD_UNDERSCORE, At as CHECK_LIST, Ot as CODE, Vt as ELEMENT_TRANSFORMERS, _t as HEADING, Ut as HIGHLIGHT, zt as INLINE_CODE, Ht as ITALIC_STAR, Jt as ITALIC_UNDERSCORE, Qt as LINK, Xt as MULTILINE_ELEMENT_TRANSFORMERS, Pt as ORDERED_LIST, Bt as QUOTE, Gt as STRIKETHROUGH, Yt as TEXT_FORMAT_TRANSFORMERS, Zt as TEXT_MATCH_TRANSFORMERS, te as TRANSFORMERS, jt as UNORDERED_LIST, se as registerMarkdownShortcuts };
 
-//# sourceMappingURL=LexicalMarkdown.prod-k73tZVb2.mjs.map
+//# sourceMappingURL=LexicalMarkdown.prod-tGG6js4r.mjs.map