@payloadcms/richtext-lexical 3.67.0 → 3.68.0-internal-debug.2eb12b9

package/dist/packages/@lexical/markdown/MarkdownTransformers.js.map

@@ -1 +1 @@
-{"version":3,"file":"MarkdownTransformers.js","names":["$createListItemNode","$createListNode","$isListItemNode","$isListNode","ListItemNode","ListNode","$createHeadingNode","$createQuoteNode","$isHeadingNode","$isQuoteNode","HeadingNode","QuoteNode","$createLineBreakNode","EMPTY_OR_WHITESPACE_ONLY","ORDERED_LIST_REGEX","UNORDERED_LIST_REGEX","CHECK_LIST_REGEX","HEADING_REGEX","QUOTE_REGEX","CODE_START_REGEX","CODE_END_REGEX","CODE_SINGLE_LINE_REGEX","TABLE_ROW_REG_EXP","TABLE_ROW_DIVIDER_REG_EXP","TAG_START_REGEX","TAG_END_REGEX","createBlockNode","createNode","parentNode","children","match","node","append","replace","select","LIST_INDENT_SIZE","getIndent","whitespaces","tabs","spaces","indent","length","Math","floor","listReplace","listType","previousNode","getPreviousSibling","nextNode","getNextSibling","listItem","undefined","getListType","firstChild","getFirstChild","insertBefore","remove","list","Number","setIndent","listExport","listNode","exportChildren","depth","output","getChildren","index","listItemNode","getChildrenSize","push","repeat","prefix","getStart","getChecked","join","HEADING","type","dependencies","export","level","getTag","slice","regExp","tag","QUOTE","lines","split","line","_match","isImport","splice","UNORDERED_LIST","CHECK_LIST","ORDERED_LIST","INLINE_CODE","format","HIGHLIGHT","BOLD_ITALIC_STAR","BOLD_ITALIC_UNDERSCORE","intraword","BOLD_STAR","BOLD_UNDERSCORE","STRIKETHROUGH","ITALIC_STAR","ITALIC_UNDERSCORE","normalizeMarkdown","input","shouldMergeAdjacentLines","inCodeBlock","sanitizedLines","nestedDeepCodeBlock","i","lastLine","test","trim"],"sources":["../../../../src/packages/@lexical/markdown/MarkdownTransformers.ts"],"sourcesContent":["/* eslint-disable regexp/no-unused-capturing-group */\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\nimport type { ListType } from '@lexical/list'\nimport type { HeadingTagType } from '@lexical/rich-text'\nimport type { ElementNode, Klass, LexicalNode, TextFormatType, TextNode } from 'lexical'\n\nimport {\n  $createListItemNode,\n  $createListNode,\n  $isListItemNode,\n  $isListNode,\n  ListItemNode,\n  ListNode,\n} from '@lexical/list'\nimport {\n  $createHeadingNode,\n  $createQuoteNode,\n  $isHeadingNode,\n  $isQuoteNode,\n  HeadingNode,\n  QuoteNode,\n} from '@lexical/rich-text'\nimport { $createLineBreakNode } from 'lexical'\n\nexport type Transformer =\n  | ElementTransformer\n  | MultilineElementTransformer\n  | TextFormatTransformer\n  | TextMatchTransformer\n\nexport type ElementTransformer = {\n  dependencies: Array<Klass<LexicalNode>>\n  /**\n   * `export` is called when the `$convertToMarkdownString` is called to convert the editor state into markdown.\n   *\n   * @return return null to cancel the export, even though the regex matched. Lexical will then search for the next transformer.\n   */\n  export: (\n    node: LexicalNode,\n\n    traverseChildren: (node: ElementNode) => string,\n  ) => null | string\n  regExp: RegExp\n  /**\n   * `replace` is called when markdown is imported or typed in the editor\n   *\n   * @return return false to cancel the transform, even though the regex matched. Lexical will then search for the next transformer.\n   */\n  replace: (\n    parentNode: ElementNode,\n    children: Array<LexicalNode>,\n    match: Array<string>,\n    /**\n     * Whether the match is from an import operation (e.g. through `$convertFromMarkdownString`) or not (e.g. through typing in the editor).\n     */\n    isImport: boolean,\n  ) => boolean | void\n  type: 'element'\n}\n\nexport type MultilineElementTransformer = {\n  dependencies: Array<Klass<LexicalNode>>\n  /**\n   * `export` is called when the `$convertToMarkdownString` is called to convert the editor state into markdown.\n   *\n   * @return return null to cancel the export, even though the regex matched. Lexical will then search for the next transformer.\n   */\n  export?: (\n    node: LexicalNode,\n\n    traverseChildren: (node: ElementNode) => string,\n  ) => null | string\n  /**\n   * Use this function to manually handle the import process, once the `regExpStart` has matched successfully.\n   * Without providing this function, the default behavior is to match until `regExpEnd` is found, or until the end of the document if `regExpEnd.optional` is true.\n   *\n   * @returns a tuple or null. The 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. If null is returned, the next multilineElementTransformer will be tried. If undefined is returned, the default behavior will be used.\n   */\n  handleImportAfterStartMatch?: (args: {\n    lines: Array<string>\n    rootNode: ElementNode\n    startLineIndex: number\n    startMatch: RegExpMatchArray\n    transformer: MultilineElementTransformer\n  }) => [boolean, number] | null | undefined\n  /**\n   * This regex determines when to stop matching. Anything in between regExpStart and regExpEnd will be matched\n   */\n  regExpEnd?:\n    | {\n        /**\n         * Whether the end match is optional. If true, the end match is not required to match for the transformer to be triggered.\n         * The entire text from regexpStart to the end of the document will then be matched.\n         */\n        optional?: true\n        regExp: RegExp\n      }\n    | RegExp\n  /**\n   * This regex determines when to start matching\n   */\n  regExpStart: RegExp\n  /**\n   * `replace` is called only when markdown is imported in the editor, not when it's typed\n   *\n   * @return return false to cancel the transform, even though the regex matched. Lexical will then search for the next transformer.\n   */\n  replace: (\n    rootNode: ElementNode,\n    /**\n     * During markdown shortcut transforms, children nodes may be provided to the transformer. If this is the case, no `linesInBetween` will be provided and\n     * the children nodes should be used instead of the `linesInBetween` to create the new node.\n     */\n    children: Array<LexicalNode> | null,\n    startMatch: Array<string>,\n    endMatch: Array<string> | null,\n    /**\n     * linesInBetween includes the text between the start & end matches, split up by lines, not including the matches themselves.\n     * This is null when the transformer is triggered through markdown shortcuts (by typing in the editor)\n     */\n    linesInBetween: Array<string> | null,\n    /**\n     * Whether the match is from an import operation (e.g. through `$convertFromMarkdownString`) or not (e.g. through typing in the editor).\n     */\n    isImport: boolean,\n  ) => boolean | void\n  type: 'multiline-element'\n}\n\nexport type TextFormatTransformer = Readonly<{\n  format: ReadonlyArray<TextFormatType>\n  intraword?: boolean\n  tag: string\n  type: 'text-format'\n}>\n\nexport type TextMatchTransformer = Readonly<{\n  dependencies: Array<Klass<LexicalNode>>\n  /**\n   * Determines how a node should be exported to markdown\n   */\n  export?: (\n    node: LexicalNode,\n\n    exportChildren: (node: ElementNode) => string,\n\n    exportFormat: (node: TextNode, textContent: string) => string,\n  ) => null | string\n  /**\n   * For import operations, this function can be used to determine the end index of the match, after `importRegExp` has matched.\n   * Without this function, the end index will be determined by the length of the match from `importRegExp`. Manually determining the end index can be useful if\n   * the match from `importRegExp` is not the entire text content of the node. That way, `importRegExp` can be used to match only the start of the node, and `getEndIndex`\n   * can be used to match the end of the node.\n   *\n   * @returns The end index of the match, or false if the match was unsuccessful and a different transformer should be tried.\n   */\n  getEndIndex?: (node: TextNode, match: RegExpMatchArray) => false | number\n  /**\n   * This regex determines what text is matched during markdown imports\n   */\n  importRegExp?: RegExp\n  /**\n   * This regex determines what text is matched for markdown shortcuts while typing in the editor\n   */\n  regExp: RegExp\n  /**\n   * Determines how the matched markdown text should be transformed into a node during the markdown import process\n   *\n   * @returns nothing, or a TextNode that may be a child of the new node that is created.\n   * If a TextNode is returned, text format matching will be applied to it (e.g. bold, italic, etc.)\n   */\n  replace?: (node: TextNode, match: RegExpMatchArray) => TextNode | void\n  /**\n   * Single character that allows the transformer to trigger when typed in the editor. This does not affect markdown imports outside of the markdown shortcut plugin.\n   * If the trigger is matched, the `regExp` will be used to match the text in the second step.\n   */\n  trigger?: string\n  type: 'text-match'\n}>\n\nconst EMPTY_OR_WHITESPACE_ONLY = /^[\\t ]*$/\nconst ORDERED_LIST_REGEX = /^(\\s*)(\\d+)\\.\\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]*(\\\\`\\\\`\\\\`|```)(\\w+)?/\nconst CODE_END_REGEX = /[ \\t]*(\\\\`\\\\`\\\\`|```)$/\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 = /^[ \\t]*<[a-z_][\\w-]*(?:\\s[^<>]*)?\\/?>/i\nconst TAG_END_REGEX = /^[ \\t]*<\\/[a-z_][\\w-]*\\s*>/i\n\nconst createBlockNode = (\n  createNode: (match: Array<string>) => ElementNode,\n): ElementTransformer['replace'] => {\n  return (parentNode, children, match) => {\n    const node = createNode(match)\n    node.append(...children)\n    parentNode.replace(node)\n    node.select(0, 0)\n  }\n}\n\n// Amount of spaces that define indentation level\n// TODO: should be an option\nconst LIST_INDENT_SIZE = 4\n\nfunction getIndent(whitespaces: string): number {\n  const tabs = whitespaces.match(/\\t/g)\n  const spaces = whitespaces.match(/ /g)\n\n  let indent = 0\n\n  if (tabs) {\n    indent += tabs.length\n  }\n\n  if (spaces) {\n    indent += Math.floor(spaces.length / LIST_INDENT_SIZE)\n  }\n\n  return indent\n}\n\nconst listReplace = (listType: ListType): ElementTransformer['replace'] => {\n  return (parentNode, children, match) => {\n    const previousNode = parentNode.getPreviousSibling()\n    const nextNode = parentNode.getNextSibling()\n    const listItem = $createListItemNode(listType === 'check' ? match[3] === 'x' : undefined)\n    if ($isListNode(nextNode) && nextNode.getListType() === listType) {\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      previousNode.append(listItem)\n      parentNode.remove()\n    } else {\n      const list = $createListNode(listType, listType === 'number' ? Number(match[2]) : undefined)\n      list.append(listItem)\n      parentNode.replace(list)\n    }\n    listItem.append(...children)\n    listItem.select(0, 0)\n    const indent = getIndent(match[1]!)\n    if (indent) {\n      listItem.setIndent(indent)\n    }\n  }\n}\n\nconst listExport = (\n  listNode: ListNode,\n  exportChildren: (node: ElementNode) => string,\n  depth: number,\n): string => {\n  const output: string[] = []\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 prefix =\n        listType === 'number'\n          ? `${listNode.getStart() + index}. `\n          : listType === 'check'\n            ? `- [${listItemNode.getChecked() ? 'x' : ' '}] `\n            : '- '\n      output.push(indent + prefix + exportChildren(listItemNode))\n      index++\n    }\n  }\n\n  return output.join('\\n')\n}\n\nexport const HEADING: ElementTransformer = {\n  type: 'element',\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) as HeadingTagType\n    return $createHeadingNode(tag)\n  }),\n}\n\nexport const QUOTE: ElementTransformer = {\n  type: 'element',\n  dependencies: [QuoteNode],\n  export: (node, exportChildren) => {\n    if (!$isQuoteNode(node)) {\n      return null\n    }\n\n    const lines = exportChildren(node).split('\\n')\n    const output: string[] = []\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, [\n          $createLineBreakNode(),\n          ...children,\n        ])\n        previousNode.select(0, 0)\n        parentNode.remove()\n        return\n      }\n    }\n\n    const node = $createQuoteNode()\n    node.append(...children)\n    parentNode.replace(node)\n    node.select(0, 0)\n  },\n}\n\nexport const UNORDERED_LIST: ElementTransformer = {\n  type: 'element',\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}\n\nexport const CHECK_LIST: ElementTransformer = {\n  type: 'element',\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}\n\nexport const ORDERED_LIST: ElementTransformer = {\n  type: 'element',\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}\n\nexport const INLINE_CODE: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['code'],\n  tag: '`',\n}\n\nexport const HIGHLIGHT: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['highlight'],\n  tag: '==',\n}\n\nexport const BOLD_ITALIC_STAR: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['bold', 'italic'],\n  tag: '***',\n}\n\nexport const BOLD_ITALIC_UNDERSCORE: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['bold', 'italic'],\n  intraword: false,\n  tag: '___',\n}\n\nexport const BOLD_STAR: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['bold'],\n  tag: '**',\n}\n\nexport const BOLD_UNDERSCORE: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['bold'],\n  intraword: false,\n  tag: '__',\n}\n\nexport const STRIKETHROUGH: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['strikethrough'],\n  tag: '~~',\n}\n\nexport const ITALIC_STAR: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['italic'],\n  tag: '*',\n}\n\nexport const ITALIC_UNDERSCORE: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['italic'],\n  intraword: false,\n  tag: '_',\n}\n\nexport function normalizeMarkdown(input: string, shouldMergeAdjacentLines: boolean): string {\n  const lines = input.split('\\n')\n  let inCodeBlock = false\n  const sanitizedLines: string[] = []\n  let nestedDeepCodeBlock = 0\n\n  for (let i = 0; i < lines.length; i++) {\n    const line = lines[i]!\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    if (CODE_END_REGEX.test(line)) {\n      if (nestedDeepCodeBlock === 0) {\n        inCodeBlock = true\n      }\n      if (nestedDeepCodeBlock === 1) {\n        inCodeBlock = false\n      }\n      if (nestedDeepCodeBlock > 0) {\n        nestedDeepCodeBlock--\n      }\n      sanitizedLines.push(line)\n      continue\n    }\n\n    // Toggle inCodeBlock state when encountering start or end of a code block\n    if (CODE_START_REGEX.test(line)) {\n      inCodeBlock = true\n      nestedDeepCodeBlock++\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(line)\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 (\n      EMPTY_OR_WHITESPACE_ONLY.test(line) ||\n      EMPTY_OR_WHITESPACE_ONLY.test(lastLine!) ||\n      !lastLine ||\n      HEADING_REGEX.test(lastLine) ||\n      HEADING_REGEX.test(line) ||\n      QUOTE_REGEX.test(line) ||\n      ORDERED_LIST_REGEX.test(line) ||\n      UNORDERED_LIST_REGEX.test(line) ||\n      CHECK_LIST_REGEX.test(line) ||\n      TABLE_ROW_REG_EXP.test(line) ||\n      TABLE_ROW_DIVIDER_REG_EXP.test(line) ||\n      !shouldMergeAdjacentLines ||\n      TAG_START_REGEX.test(line) ||\n      TAG_END_REGEX.test(line) ||\n      TAG_START_REGEX.test(lastLine) ||\n      TAG_END_REGEX.test(lastLine) ||\n      CODE_END_REGEX.test(lastLine)\n    ) {\n      sanitizedLines.push(line)\n    } else {\n      sanitizedLines[sanitizedLines.length - 1] = lastLine + ' ' + line.trim()\n    }\n  }\n\n  return sanitizedLines.join('\\n')\n}\n"],"mappings":"AAAA,sDACA;;;;;;wDAYA,SACEA,mBAAmB,EACnBC,eAAe,EACfC,eAAe,EACfC,WAAW,EACXC,YAAY,EACZC,QAAQ,QACH;AACP,SACEC,kBAAkB,EAClBC,gBAAgB,EAChBC,cAAc,EACdC,YAAY,EACZC,WAAW,EACXC,SAAS,QACJ;AACP,SAASC,oBAAoB,QAAQ;AA8JrC,MAAMC,wBAAA,GAA2B;AACjC,MAAMC,kBAAA,GAAqB;AAC3B,MAAMC,oBAAA,GAAuB;AAC7B,MAAMC,gBAAA,GAAmB;AACzB,MAAMC,aAAA,GAAgB;AACtB,MAAMC,WAAA,GAAc;AACpB,MAAMC,gBAAA,GAAmB;AACzB,MAAMC,cAAA,GAAiB;AACvB,MAAMC,sBAAA,GAAyB;AAC/B,MAAMC,iBAAA,GAAoB;AAC1B,MAAMC,yBAAA,GAA4B;AAClC,MAAMC,eAAA,GAAkB;AACxB,MAAMC,aAAA,GAAgB;AAEtB,MAAMC,eAAA,GACJC,UAAA;EAEA,OAAO,CAACC,UAAA,EAAYC,QAAA,EAAUC,KAAA;IAC5B,MAAMC,IAAA,GAAOJ,UAAA,CAAWG,KAAA;IACxBC,IAAA,CAAKC,MAAM,IAAIH,QAAA;IACfD,UAAA,CAAWK,OAAO,CAACF,IAAA;IACnBA,IAAA,CAAKG,MAAM,CAAC,GAAG;EACjB;AACF;AAEA;AACA;AACA,MAAMC,gBAAA,GAAmB;AAEzB,SAASC,UAAUC,WAAmB;EACpC,MAAMC,IAAA,GAAOD,WAAA,CAAYP,KAAK,CAAC;EAC/B,MAAMS,MAAA,GAASF,WAAA,CAAYP,KAAK,CAAC;EAEjC,IAAIU,MAAA,GAAS;EAEb,IAAIF,IAAA,EAAM;IACRE,MAAA,IAAUF,IAAA,CAAKG,MAAM;EACvB;EAEA,IAAIF,MAAA,EAAQ;IACVC,MAAA,IAAUE,IAAA,CAAKC,KAAK,CAACJ,MAAA,CAAOE,MAAM,GAAGN,gBAAA;EACvC;EAEA,OAAOK,MAAA;AACT;AAEA,MAAMI,WAAA,GAAeC,QAAA;EACnB,OAAO,CAACjB,UAAA,EAAYC,QAAA,EAAUC,KAAA;IAC5B,MAAMgB,YAAA,GAAelB,UAAA,CAAWmB,kBAAkB;IAClD,MAAMC,QAAA,GAAWpB,UAAA,CAAWqB,cAAc;IAC1C,MAAMC,QAAA,GAAWlD,mBAAA,CAAoB6C,QAAA,KAAa,UAAUf,KAAK,CAAC,EAAE,KAAK,MAAMqB,SAAA;IAC/E,IAAIhD,WAAA,CAAY6C,QAAA,KAAaA,QAAA,CAASI,WAAW,OAAOP,QAAA,EAAU;MAChE,MAAMQ,UAAA,GAAaL,QAAA,CAASM,aAAa;MACzC,IAAID,UAAA,KAAe,MAAM;QACvBA,UAAA,CAAWE,YAAY,CAACL,QAAA;MAC1B,OAAO;QACL;QACAF,QAAA,CAAShB,MAAM,CAACkB,QAAA;MAClB;MACAtB,UAAA,CAAW4B,MAAM;IACnB,OAAO,IAAIrD,WAAA,CAAY2C,YAAA,KAAiBA,YAAA,CAAaM,WAAW,OAAOP,QAAA,EAAU;MAC/EC,YAAA,CAAad,MAAM,CAACkB,QAAA;MACpBtB,UAAA,CAAW4B,MAAM;IACnB,OAAO;MACL,MAAMC,IAAA,GAAOxD,eAAA,CAAgB4C,QAAA,EAAUA,QAAA,KAAa,WAAWa,MAAA,CAAO5B,KAAK,CAAC,EAAE,IAAIqB,SAAA;MAClFM,IAAA,CAAKzB,MAAM,CAACkB,QAAA;MACZtB,UAAA,CAAWK,OAAO,CAACwB,IAAA;IACrB;IACAP,QAAA,CAASlB,MAAM,IAAIH,QAAA;IACnBqB,QAAA,CAAShB,MAAM,CAAC,GAAG;IACnB,MAAMM,MAAA,GAASJ,SAAA,CAAUN,KAAK,CAAC,EAAE;IACjC,IAAIU,MAAA,EAAQ;MACVU,QAAA,CAASS,SAAS,CAACnB,MAAA;IACrB;EACF;AACF;AAEA,MAAMoB,UAAA,GAAaA,CACjBC,QAAA,EACAC,cAAA,EACAC,KAAA;EAEA,MAAMC,MAAA,GAAmB,EAAE;EAC3B,MAAMnC,QAAA,GAAWgC,QAAA,CAASI,WAAW;EACrC,IAAIC,KAAA,GAAQ;EACZ,KAAK,MAAMC,YAAA,IAAgBtC,QAAA,EAAU;IACnC,IAAI3B,eAAA,CAAgBiE,YAAA,GAAe;MACjC,IAAIA,YAAA,CAAaC,eAAe,OAAO,GAAG;QACxC,MAAMf,UAAA,GAAac,YAAA,CAAab,aAAa;QAC7C,IAAInD,WAAA,CAAYkD,UAAA,GAAa;UAC3BW,MAAA,CAAOK,IAAI,CAACT,UAAA,CAAWP,UAAA,EAAYS,cAAA,EAAgBC,KAAA,GAAQ;UAC3D;QACF;MACF;MACA,MAAMvB,MAAA,GAAS,IAAI8B,MAAM,CAACP,KAAA,GAAQ5B,gBAAA;MAClC,MAAMU,QAAA,GAAWgB,QAAA,CAAST,WAAW;MACrC,MAAMmB,MAAA,GACJ1B,QAAA,KAAa,WACT,GAAGgB,QAAA,CAASW,QAAQ,KAAKN,KAAA,IAAS,GAClCrB,QAAA,KAAa,UACX,MAAMsB,YAAA,CAAaM,UAAU,KAAK,MAAM,OAAO,GAC/C;MACRT,MAAA,CAAOK,IAAI,CAAC7B,MAAA,GAAS+B,MAAA,GAAST,cAAA,CAAeK,YAAA;MAC7CD,KAAA;IACF;EACF;EAEA,OAAOF,MAAA,CAAOU,IAAI,CAAC;AACrB;AAEA,OAAO,MAAMC,OAAA,GAA8B;EACzCC,IAAA,EAAM;EACNC,YAAA,EAAc,CAACnE,WAAA,CAAY;EAC3BoE,MAAA,EAAQA,CAAC/C,IAAA,EAAM+B,cAAA;IACb,IAAI,CAACtD,cAAA,CAAeuB,IAAA,GAAO;MACzB,OAAO;IACT;IACA,MAAMgD,KAAA,GAAQrB,MAAA,CAAO3B,IAAA,CAAKiD,MAAM,GAAGC,KAAK,CAAC;IACzC,OAAO,IAAIX,MAAM,CAACS,KAAA,IAAS,MAAMjB,cAAA,CAAe/B,IAAA;EAClD;EACAmD,MAAA,EAAQjE,aAAA;EACRgB,OAAA,EAASP,eAAA,CAAiBI,KAAA;IACxB,MAAMqD,GAAA,GAAO,MAAMrD,KAAK,CAAC,EAAE,CAAEW,MAAM;IACnC,OAAOnC,kBAAA,CAAmB6E,GAAA;EAC5B;AACF;AAEA,OAAO,MAAMC,KAAA,GAA4B;EACvCR,IAAA,EAAM;EACNC,YAAA,EAAc,CAAClE,SAAA,CAAU;EACzBmE,MAAA,EAAQA,CAAC/C,IAAA,EAAM+B,cAAA;IACb,IAAI,CAACrD,YAAA,CAAasB,IAAA,GAAO;MACvB,OAAO;IACT;IAEA,MAAMsD,KAAA,GAAQvB,cAAA,CAAe/B,IAAA,EAAMuD,KAAK,CAAC;IACzC,MAAMtB,MAAA,GAAmB,EAAE;IAC3B,KAAK,MAAMuB,IAAA,IAAQF,KAAA,EAAO;MACxBrB,MAAA,CAAOK,IAAI,CAAC,OAAOkB,IAAA;IACrB;IACA,OAAOvB,MAAA,CAAOU,IAAI,CAAC;EACrB;EACAQ,MAAA,EAAQhE,WAAA;EACRe,OAAA,EAASA,CAACL,UAAA,EAAYC,QAAA,EAAU2D,MAAA,EAAQC,QAAA;IACtC,IAAIA,QAAA,EAAU;MACZ,MAAM3C,YAAA,GAAelB,UAAA,CAAWmB,kBAAkB;MAClD,IAAItC,YAAA,CAAaqC,YAAA,GAAe;QAC9BA,YAAA,CAAa4C,MAAM,CAAC5C,YAAA,CAAasB,eAAe,IAAI,GAAG,CACrDxD,oBAAA,I,GACGiB,QAAA,CACJ;QACDiB,YAAA,CAAaZ,MAAM,CAAC,GAAG;QACvBN,UAAA,CAAW4B,MAAM;QACjB;MACF;IACF;IAEA,MAAMzB,IAAA,GAAOxB,gBAAA;IACbwB,IAAA,CAAKC,MAAM,IAAIH,QAAA;IACfD,UAAA,CAAWK,OAAO,CAACF,IAAA;IACnBA,IAAA,CAAKG,MAAM,CAAC,GAAG;EACjB;AACF;AAEA,OAAO,MAAMyD,cAAA,GAAqC;EAChDf,IAAA,EAAM;EACNC,YAAA,EAAc,CAACxE,QAAA,EAAUD,YAAA,CAAa;EACtC0E,MAAA,EAAQA,CAAC/C,IAAA,EAAM+B,cAAA;IACb,OAAO3D,WAAA,CAAY4B,IAAA,IAAQ6B,UAAA,CAAW7B,IAAA,EAAM+B,cAAA,EAAgB,KAAK;EACnE;EACAoB,MAAA,EAAQnE,oBAAA;EACRkB,OAAA,EAASW,WAAA,CAAY;AACvB;AAEA,OAAO,MAAMgD,UAAA,GAAiC;EAC5ChB,IAAA,EAAM;EACNC,YAAA,EAAc,CAACxE,QAAA,EAAUD,YAAA,CAAa;EACtC0E,MAAA,EAAQA,CAAC/C,IAAA,EAAM+B,cAAA;IACb,OAAO3D,WAAA,CAAY4B,IAAA,IAAQ6B,UAAA,CAAW7B,IAAA,EAAM+B,cAAA,EAAgB,KAAK;EACnE;EACAoB,MAAA,EAAQlE,gBAAA;EACRiB,OAAA,EAASW,WAAA,CAAY;AACvB;AAEA,OAAO,MAAMiD,YAAA,GAAmC;EAC9CjB,IAAA,EAAM;EACNC,YAAA,EAAc,CAACxE,QAAA,EAAUD,YAAA,CAAa;EACtC0E,MAAA,EAAQA,CAAC/C,IAAA,EAAM+B,cAAA;IACb,OAAO3D,WAAA,CAAY4B,IAAA,IAAQ6B,UAAA,CAAW7B,IAAA,EAAM+B,cAAA,EAAgB,KAAK;EACnE;EACAoB,MAAA,EAAQpE,kBAAA;EACRmB,OAAA,EAASW,WAAA,CAAY;AACvB;AAEA,OAAO,MAAMkD,WAAA,GAAqC;EAChDlB,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,OAAO;EAChBZ,GAAA,EAAK;AACP;AAEA,OAAO,MAAMa,SAAA,GAAmC;EAC9CpB,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,YAAY;EACrBZ,GAAA,EAAK;AACP;AAEA,OAAO,MAAMc,gBAAA,GAA0C;EACrDrB,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,QAAQ,SAAS;EAC1BZ,GAAA,EAAK;AACP;AAEA,OAAO,MAAMe,sBAAA,GAAgD;EAC3DtB,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,QAAQ,SAAS;EAC1BI,SAAA,EAAW;EACXhB,GAAA,EAAK;AACP;AAEA,OAAO,MAAMiB,SAAA,GAAmC;EAC9CxB,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,OAAO;EAChBZ,GAAA,EAAK;AACP;AAEA,OAAO,MAAMkB,eAAA,GAAyC;EACpDzB,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,OAAO;EAChBI,SAAA,EAAW;EACXhB,GAAA,EAAK;AACP;AAEA,OAAO,MAAMmB,aAAA,GAAuC;EAClD1B,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,gBAAgB;EACzBZ,GAAA,EAAK;AACP;AAEA,OAAO,MAAMoB,WAAA,GAAqC;EAChD3B,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,SAAS;EAClBZ,GAAA,EAAK;AACP;AAEA,OAAO,MAAMqB,iBAAA,GAA2C;EACtD5B,IAAA,EAAM;EACNmB,MAAA,EAAQ,CAAC,SAAS;EAClBI,SAAA,EAAW;EACXhB,GAAA,EAAK;AACP;AAEA,OAAO,SAASsB,kBAAkBC,KAAa,EAAEC,wBAAiC;EAChF,MAAMtB,KAAA,GAAQqB,KAAA,CAAMpB,KAAK,CAAC;EAC1B,IAAIsB,WAAA,GAAc;EAClB,MAAMC,cAAA,GAA2B,EAAE;EACnC,IAAIC,mBAAA,GAAsB;EAE1B,KAAK,IAAIC,CAAA,GAAI,GAAGA,CAAA,GAAI1B,KAAA,CAAM5C,MAAM,EAAEsE,CAAA,IAAK;IACrC,MAAMxB,IAAA,GAAOF,KAAK,CAAC0B,CAAA,CAAE;IACrB,MAAMC,QAAA,GAAWH,cAAc,CAACA,cAAA,CAAepE,MAAM,GAAG,EAAE;IAE1D;IACA,IAAIpB,sBAAA,CAAuB4F,IAAI,CAAC1B,IAAA,GAAO;MACrCsB,cAAA,CAAexC,IAAI,CAACkB,IAAA;MACpB;IACF;IAEA,IAAInE,cAAA,CAAe6F,IAAI,CAAC1B,IAAA,GAAO;MAC7B,IAAIuB,mBAAA,KAAwB,GAAG;QAC7BF,WAAA,GAAc;MAChB;MACA,IAAIE,mBAAA,KAAwB,GAAG;QAC7BF,WAAA,GAAc;MAChB;MACA,IAAIE,mBAAA,GAAsB,GAAG;QAC3BA,mBAAA;MACF;MACAD,cAAA,CAAexC,IAAI,CAACkB,IAAA;MACpB;IACF;IAEA;IACA,IAAIpE,gBAAA,CAAiB8F,IAAI,CAAC1B,IAAA,GAAO;MAC/BqB,WAAA,GAAc;MACdE,mBAAA;MACAD,cAAA,CAAexC,IAAI,CAACkB,IAAA;MACpB;IACF;IAEA;IACA,IAAIqB,WAAA,EAAa;MACfC,cAAA,CAAexC,IAAI,CAACkB,IAAA;MACpB;IACF;IAEA;IACA;IACA,IACE1E,wBAAA,CAAyBoG,IAAI,CAAC1B,IAAA,KAC9B1E,wBAAA,CAAyBoG,IAAI,CAACD,QAAA,KAC9B,CAACA,QAAA,IACD/F,aAAA,CAAcgG,IAAI,CAACD,QAAA,KACnB/F,aAAA,CAAcgG,IAAI,CAAC1B,IAAA,KACnBrE,WAAA,CAAY+F,IAAI,CAAC1B,IAAA,KACjBzE,kBAAA,CAAmBmG,IAAI,CAAC1B,IAAA,KACxBxE,oBAAA,CAAqBkG,IAAI,CAAC1B,IAAA,KAC1BvE,gBAAA,CAAiBiG,IAAI,CAAC1B,IAAA,KACtBjE,iBAAA,CAAkB2F,IAAI,CAAC1B,IAAA,KACvBhE,yBAAA,CAA0B0F,IAAI,CAAC1B,IAAA,KAC/B,CAACoB,wBAAA,IACDnF,eAAA,CAAgByF,IAAI,CAAC1B,IAAA,KACrB9D,aAAA,CAAcwF,IAAI,CAAC1B,IAAA,KACnB/D,eAAA,CAAgByF,IAAI,CAACD,QAAA,KACrBvF,aAAA,CAAcwF,IAAI,CAACD,QAAA,KACnB5F,cAAA,CAAe6F,IAAI,CAACD,QAAA,GACpB;MACAH,cAAA,CAAexC,IAAI,CAACkB,IAAA;IACtB,OAAO;MACLsB,cAAc,CAACA,cAAA,CAAepE,MAAM,GAAG,EAAE,GAAGuE,QAAA,GAAW,MAAMzB,IAAA,CAAK2B,IAAI;IACxE;EACF;EAEA,OAAOL,cAAA,CAAenC,IAAI,CAAC;AAC7B","ignoreList":[]}
+{"version":3,"sources":["../../../../src/packages/@lexical/markdown/MarkdownTransformers.ts"],"sourcesContent":["/* eslint-disable regexp/no-unused-capturing-group */\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\nimport type { ListType } from '@lexical/list'\nimport type { HeadingTagType } from '@lexical/rich-text'\nimport type { ElementNode, Klass, LexicalNode, TextFormatType, TextNode } from 'lexical'\n\nimport {\n  $createListItemNode,\n  $createListNode,\n  $isListItemNode,\n  $isListNode,\n  ListItemNode,\n  ListNode,\n} from '@lexical/list'\nimport {\n  $createHeadingNode,\n  $createQuoteNode,\n  $isHeadingNode,\n  $isQuoteNode,\n  HeadingNode,\n  QuoteNode,\n} from '@lexical/rich-text'\nimport { $createLineBreakNode } from 'lexical'\n\nexport type Transformer =\n  | ElementTransformer\n  | MultilineElementTransformer\n  | TextFormatTransformer\n  | TextMatchTransformer\n\nexport type ElementTransformer = {\n  dependencies: Array<Klass<LexicalNode>>\n  /**\n   * `export` is called when the `$convertToMarkdownString` is called to convert the editor state into markdown.\n   *\n   * @return return null to cancel the export, even though the regex matched. Lexical will then search for the next transformer.\n   */\n  export: (\n    node: LexicalNode,\n\n    traverseChildren: (node: ElementNode) => string,\n  ) => null | string\n  regExp: RegExp\n  /**\n   * `replace` is called when markdown is imported or typed in the editor\n   *\n   * @return return false to cancel the transform, even though the regex matched. Lexical will then search for the next transformer.\n   */\n  replace: (\n    parentNode: ElementNode,\n    children: Array<LexicalNode>,\n    match: Array<string>,\n    /**\n     * Whether the match is from an import operation (e.g. through `$convertFromMarkdownString`) or not (e.g. through typing in the editor).\n     */\n    isImport: boolean,\n  ) => boolean | void\n  type: 'element'\n}\n\nexport type MultilineElementTransformer = {\n  dependencies: Array<Klass<LexicalNode>>\n  /**\n   * `export` is called when the `$convertToMarkdownString` is called to convert the editor state into markdown.\n   *\n   * @return return null to cancel the export, even though the regex matched. Lexical will then search for the next transformer.\n   */\n  export?: (\n    node: LexicalNode,\n\n    traverseChildren: (node: ElementNode) => string,\n  ) => null | string\n  /**\n   * Use this function to manually handle the import process, once the `regExpStart` has matched successfully.\n   * Without providing this function, the default behavior is to match until `regExpEnd` is found, or until the end of the document if `regExpEnd.optional` is true.\n   *\n   * @returns a tuple or null. The 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. If null is returned, the next multilineElementTransformer will be tried. If undefined is returned, the default behavior will be used.\n   */\n  handleImportAfterStartMatch?: (args: {\n    lines: Array<string>\n    rootNode: ElementNode\n    startLineIndex: number\n    startMatch: RegExpMatchArray\n    transformer: MultilineElementTransformer\n  }) => [boolean, number] | null | undefined\n  /**\n   * This regex determines when to stop matching. Anything in between regExpStart and regExpEnd will be matched\n   */\n  regExpEnd?:\n    | {\n        /**\n         * Whether the end match is optional. If true, the end match is not required to match for the transformer to be triggered.\n         * The entire text from regexpStart to the end of the document will then be matched.\n         */\n        optional?: true\n        regExp: RegExp\n      }\n    | RegExp\n  /**\n   * This regex determines when to start matching\n   */\n  regExpStart: RegExp\n  /**\n   * `replace` is called only when markdown is imported in the editor, not when it's typed\n   *\n   * @return return false to cancel the transform, even though the regex matched. Lexical will then search for the next transformer.\n   */\n  replace: (\n    rootNode: ElementNode,\n    /**\n     * During markdown shortcut transforms, children nodes may be provided to the transformer. If this is the case, no `linesInBetween` will be provided and\n     * the children nodes should be used instead of the `linesInBetween` to create the new node.\n     */\n    children: Array<LexicalNode> | null,\n    startMatch: Array<string>,\n    endMatch: Array<string> | null,\n    /**\n     * linesInBetween includes the text between the start & end matches, split up by lines, not including the matches themselves.\n     * This is null when the transformer is triggered through markdown shortcuts (by typing in the editor)\n     */\n    linesInBetween: Array<string> | null,\n    /**\n     * Whether the match is from an import operation (e.g. through `$convertFromMarkdownString`) or not (e.g. through typing in the editor).\n     */\n    isImport: boolean,\n  ) => boolean | void\n  type: 'multiline-element'\n}\n\nexport type TextFormatTransformer = Readonly<{\n  format: ReadonlyArray<TextFormatType>\n  intraword?: boolean\n  tag: string\n  type: 'text-format'\n}>\n\nexport type TextMatchTransformer = Readonly<{\n  dependencies: Array<Klass<LexicalNode>>\n  /**\n   * Determines how a node should be exported to markdown\n   */\n  export?: (\n    node: LexicalNode,\n\n    exportChildren: (node: ElementNode) => string,\n\n    exportFormat: (node: TextNode, textContent: string) => string,\n  ) => null | string\n  /**\n   * For import operations, this function can be used to determine the end index of the match, after `importRegExp` has matched.\n   * Without this function, the end index will be determined by the length of the match from `importRegExp`. Manually determining the end index can be useful if\n   * the match from `importRegExp` is not the entire text content of the node. That way, `importRegExp` can be used to match only the start of the node, and `getEndIndex`\n   * can be used to match the end of the node.\n   *\n   * @returns The end index of the match, or false if the match was unsuccessful and a different transformer should be tried.\n   */\n  getEndIndex?: (node: TextNode, match: RegExpMatchArray) => false | number\n  /**\n   * This regex determines what text is matched during markdown imports\n   */\n  importRegExp?: RegExp\n  /**\n   * This regex determines what text is matched for markdown shortcuts while typing in the editor\n   */\n  regExp: RegExp\n  /**\n   * Determines how the matched markdown text should be transformed into a node during the markdown import process\n   *\n   * @returns nothing, or a TextNode that may be a child of the new node that is created.\n   * If a TextNode is returned, text format matching will be applied to it (e.g. bold, italic, etc.)\n   */\n  replace?: (node: TextNode, match: RegExpMatchArray) => TextNode | void\n  /**\n   * Single character that allows the transformer to trigger when typed in the editor. This does not affect markdown imports outside of the markdown shortcut plugin.\n   * If the trigger is matched, the `regExp` will be used to match the text in the second step.\n   */\n  trigger?: string\n  type: 'text-match'\n}>\n\nconst EMPTY_OR_WHITESPACE_ONLY = /^[\\t ]*$/\nconst ORDERED_LIST_REGEX = /^(\\s*)(\\d+)\\.\\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]*(\\\\`\\\\`\\\\`|```)(\\w+)?/\nconst CODE_END_REGEX = /[ \\t]*(\\\\`\\\\`\\\\`|```)$/\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 = /^[ \\t]*<[a-z_][\\w-]*(?:\\s[^<>]*)?\\/?>/i\nconst TAG_END_REGEX = /^[ \\t]*<\\/[a-z_][\\w-]*\\s*>/i\n\nconst createBlockNode = (\n  createNode: (match: Array<string>) => ElementNode,\n): ElementTransformer['replace'] => {\n  return (parentNode, children, match) => {\n    const node = createNode(match)\n    node.append(...children)\n    parentNode.replace(node)\n    node.select(0, 0)\n  }\n}\n\n// Amount of spaces that define indentation level\n// TODO: should be an option\nconst LIST_INDENT_SIZE = 4\n\nfunction getIndent(whitespaces: string): number {\n  const tabs = whitespaces.match(/\\t/g)\n  const spaces = whitespaces.match(/ /g)\n\n  let indent = 0\n\n  if (tabs) {\n    indent += tabs.length\n  }\n\n  if (spaces) {\n    indent += Math.floor(spaces.length / LIST_INDENT_SIZE)\n  }\n\n  return indent\n}\n\nconst listReplace = (listType: ListType): ElementTransformer['replace'] => {\n  return (parentNode, children, match) => {\n    const previousNode = parentNode.getPreviousSibling()\n    const nextNode = parentNode.getNextSibling()\n    const listItem = $createListItemNode(listType === 'check' ? match[3] === 'x' : undefined)\n    if ($isListNode(nextNode) && nextNode.getListType() === listType) {\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      previousNode.append(listItem)\n      parentNode.remove()\n    } else {\n      const list = $createListNode(listType, listType === 'number' ? Number(match[2]) : undefined)\n      list.append(listItem)\n      parentNode.replace(list)\n    }\n    listItem.append(...children)\n    listItem.select(0, 0)\n    const indent = getIndent(match[1]!)\n    if (indent) {\n      listItem.setIndent(indent)\n    }\n  }\n}\n\nconst listExport = (\n  listNode: ListNode,\n  exportChildren: (node: ElementNode) => string,\n  depth: number,\n): string => {\n  const output: string[] = []\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 prefix =\n        listType === 'number'\n          ? `${listNode.getStart() + index}. `\n          : listType === 'check'\n            ? `- [${listItemNode.getChecked() ? 'x' : ' '}] `\n            : '- '\n      output.push(indent + prefix + exportChildren(listItemNode))\n      index++\n    }\n  }\n\n  return output.join('\\n')\n}\n\nexport const HEADING: ElementTransformer = {\n  type: 'element',\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) as HeadingTagType\n    return $createHeadingNode(tag)\n  }),\n}\n\nexport const QUOTE: ElementTransformer = {\n  type: 'element',\n  dependencies: [QuoteNode],\n  export: (node, exportChildren) => {\n    if (!$isQuoteNode(node)) {\n      return null\n    }\n\n    const lines = exportChildren(node).split('\\n')\n    const output: string[] = []\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, [\n          $createLineBreakNode(),\n          ...children,\n        ])\n        previousNode.select(0, 0)\n        parentNode.remove()\n        return\n      }\n    }\n\n    const node = $createQuoteNode()\n    node.append(...children)\n    parentNode.replace(node)\n    node.select(0, 0)\n  },\n}\n\nexport const UNORDERED_LIST: ElementTransformer = {\n  type: 'element',\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}\n\nexport const CHECK_LIST: ElementTransformer = {\n  type: 'element',\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}\n\nexport const ORDERED_LIST: ElementTransformer = {\n  type: 'element',\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}\n\nexport const INLINE_CODE: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['code'],\n  tag: '`',\n}\n\nexport const HIGHLIGHT: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['highlight'],\n  tag: '==',\n}\n\nexport const BOLD_ITALIC_STAR: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['bold', 'italic'],\n  tag: '***',\n}\n\nexport const BOLD_ITALIC_UNDERSCORE: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['bold', 'italic'],\n  intraword: false,\n  tag: '___',\n}\n\nexport const BOLD_STAR: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['bold'],\n  tag: '**',\n}\n\nexport const BOLD_UNDERSCORE: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['bold'],\n  intraword: false,\n  tag: '__',\n}\n\nexport const STRIKETHROUGH: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['strikethrough'],\n  tag: '~~',\n}\n\nexport const ITALIC_STAR: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['italic'],\n  tag: '*',\n}\n\nexport const ITALIC_UNDERSCORE: TextFormatTransformer = {\n  type: 'text-format',\n  format: ['italic'],\n  intraword: false,\n  tag: '_',\n}\n\nexport function normalizeMarkdown(input: string, shouldMergeAdjacentLines: boolean): string {\n  const lines = input.split('\\n')\n  let inCodeBlock = false\n  const sanitizedLines: string[] = []\n  let nestedDeepCodeBlock = 0\n\n  for (let i = 0; i < lines.length; i++) {\n    const line = lines[i]!\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    if (CODE_END_REGEX.test(line)) {\n      if (nestedDeepCodeBlock === 0) {\n        inCodeBlock = true\n      }\n      if (nestedDeepCodeBlock === 1) {\n        inCodeBlock = false\n      }\n      if (nestedDeepCodeBlock > 0) {\n        nestedDeepCodeBlock--\n      }\n      sanitizedLines.push(line)\n      continue\n    }\n\n    // Toggle inCodeBlock state when encountering start or end of a code block\n    if (CODE_START_REGEX.test(line)) {\n      inCodeBlock = true\n      nestedDeepCodeBlock++\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(line)\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 (\n      EMPTY_OR_WHITESPACE_ONLY.test(line) ||\n      EMPTY_OR_WHITESPACE_ONLY.test(lastLine!) ||\n      !lastLine ||\n      HEADING_REGEX.test(lastLine) ||\n      HEADING_REGEX.test(line) ||\n      QUOTE_REGEX.test(line) ||\n      ORDERED_LIST_REGEX.test(line) ||\n      UNORDERED_LIST_REGEX.test(line) ||\n      CHECK_LIST_REGEX.test(line) ||\n      TABLE_ROW_REG_EXP.test(line) ||\n      TABLE_ROW_DIVIDER_REG_EXP.test(line) ||\n      !shouldMergeAdjacentLines ||\n      TAG_START_REGEX.test(line) ||\n      TAG_END_REGEX.test(line) ||\n      TAG_START_REGEX.test(lastLine) ||\n      TAG_END_REGEX.test(lastLine) ||\n      CODE_END_REGEX.test(lastLine)\n    ) {\n      sanitizedLines.push(line)\n    } else {\n      sanitizedLines[sanitizedLines.length - 1] = lastLine + ' ' + line.trim()\n    }\n  }\n\n  return sanitizedLines.join('\\n')\n}\n"],"names":["$createListItemNode","$createListNode","$isListItemNode","$isListNode","ListItemNode","ListNode","$createHeadingNode","$createQuoteNode","$isHeadingNode","$isQuoteNode","HeadingNode","QuoteNode","$createLineBreakNode","EMPTY_OR_WHITESPACE_ONLY","ORDERED_LIST_REGEX","UNORDERED_LIST_REGEX","CHECK_LIST_REGEX","HEADING_REGEX","QUOTE_REGEX","CODE_START_REGEX","CODE_END_REGEX","CODE_SINGLE_LINE_REGEX","TABLE_ROW_REG_EXP","TABLE_ROW_DIVIDER_REG_EXP","TAG_START_REGEX","TAG_END_REGEX","createBlockNode","createNode","parentNode","children","match","node","append","replace","select","LIST_INDENT_SIZE","getIndent","whitespaces","tabs","spaces","indent","length","Math","floor","listReplace","listType","previousNode","getPreviousSibling","nextNode","getNextSibling","listItem","undefined","getListType","firstChild","getFirstChild","insertBefore","remove","list","Number","setIndent","listExport","listNode","exportChildren","depth","output","getChildren","index","listItemNode","getChildrenSize","push","repeat","prefix","getStart","getChecked","join","HEADING","type","dependencies","export","level","getTag","slice","regExp","tag","QUOTE","lines","split","line","_match","isImport","splice","UNORDERED_LIST","CHECK_LIST","ORDERED_LIST","INLINE_CODE","format","HIGHLIGHT","BOLD_ITALIC_STAR","BOLD_ITALIC_UNDERSCORE","intraword","BOLD_STAR","BOLD_UNDERSCORE","STRIKETHROUGH","ITALIC_STAR","ITALIC_UNDERSCORE","normalizeMarkdown","input","shouldMergeAdjacentLines","inCodeBlock","sanitizedLines","nestedDeepCodeBlock","i","lastLine","test","trim"],"mappings":"AAAA,mDAAmD,GACnD;;;;;;CAMC,GAMD,SACEA,mBAAmB,EACnBC,eAAe,EACfC,eAAe,EACfC,WAAW,EACXC,YAAY,EACZC,QAAQ,QACH,gBAAe;AACtB,SACEC,kBAAkB,EAClBC,gBAAgB,EAChBC,cAAc,EACdC,YAAY,EACZC,WAAW,EACXC,SAAS,QACJ,qBAAoB;AAC3B,SAASC,oBAAoB,QAAQ,UAAS;AAU5C;;;;GAIC,GAOD;;;;GAIC,GAKC;;KAEC,GAQH;;;;GAIC,GAMD;;;;;GAKC,GAQD;;GAEC,GAGK;;;SAGC,GAKP;;GAEC,GAED;;;;GAIC,GAGC;;;KAGC,GAID;;;KAGC,GAED;;KAEC,GAeH;;GAEC,GAQD;;;;;;;GAOC,GAED;;GAEC,GAED;;GAEC,GAED;;;;;GAKC,GAED;;;GAGC,GAKH,MAAMC,2BAA2B;AACjC,MAAMC,qBAAqB;AAC3B,MAAMC,uBAAuB;AAC7B,MAAMC,mBAAmB;AACzB,MAAMC,gBAAgB;AACtB,MAAMC,cAAc;AACpB,MAAMC,mBAAmB;AACzB,MAAMC,iBAAiB;AACvB,MAAMC,yBAAyB;AAC/B,MAAMC,oBAAoB;AAC1B,MAAMC,4BAA4B;AAClC,MAAMC,kBAAkB;AACxB,MAAMC,gBAAgB;AAEtB,MAAMC,kBAAkB,CACtBC;IAEA,OAAO,CAACC,YAAYC,UAAUC;QAC5B,MAAMC,OAAOJ,WAAWG;QACxBC,KAAKC,MAAM,IAAIH;QACfD,WAAWK,OAAO,CAACF;QACnBA,KAAKG,MAAM,CAAC,GAAG;IACjB;AACF;AAEA,iDAAiD;AACjD,4BAA4B;AAC5B,MAAMC,mBAAmB;AAEzB,SAASC,UAAUC,WAAmB;IACpC,MAAMC,OAAOD,YAAYP,KAAK,CAAC;IAC/B,MAAMS,SAASF,YAAYP,KAAK,CAAC;IAEjC,IAAIU,SAAS;IAEb,IAAIF,MAAM;QACRE,UAAUF,KAAKG,MAAM;IACvB;IAEA,IAAIF,QAAQ;QACVC,UAAUE,KAAKC,KAAK,CAACJ,OAAOE,MAAM,GAAGN;IACvC;IAEA,OAAOK;AACT;AAEA,MAAMI,cAAc,CAACC;IACnB,OAAO,CAACjB,YAAYC,UAAUC;QAC5B,MAAMgB,eAAelB,WAAWmB,kBAAkB;QAClD,MAAMC,WAAWpB,WAAWqB,cAAc;QAC1C,MAAMC,WAAWlD,oBAAoB6C,aAAa,UAAUf,KAAK,CAAC,EAAE,KAAK,MAAMqB;QAC/E,IAAIhD,YAAY6C,aAAaA,SAASI,WAAW,OAAOP,UAAU;YAChE,MAAMQ,aAAaL,SAASM,aAAa;YACzC,IAAID,eAAe,MAAM;gBACvBA,WAAWE,YAAY,CAACL;YAC1B,OAAO;gBACL,kEAAkE;gBAClEF,SAAShB,MAAM,CAACkB;YAClB;YACAtB,WAAW4B,MAAM;QACnB,OAAO,IAAIrD,YAAY2C,iBAAiBA,aAAaM,WAAW,OAAOP,UAAU;YAC/EC,aAAad,MAAM,CAACkB;YACpBtB,WAAW4B,MAAM;QACnB,OAAO;YACL,MAAMC,OAAOxD,gBAAgB4C,UAAUA,aAAa,WAAWa,OAAO5B,KAAK,CAAC,EAAE,IAAIqB;YAClFM,KAAKzB,MAAM,CAACkB;YACZtB,WAAWK,OAAO,CAACwB;QACrB;QACAP,SAASlB,MAAM,IAAIH;QACnBqB,SAAShB,MAAM,CAAC,GAAG;QACnB,MAAMM,SAASJ,UAAUN,KAAK,CAAC,EAAE;QACjC,IAAIU,QAAQ;YACVU,SAASS,SAAS,CAACnB;QACrB;IACF;AACF;AAEA,MAAMoB,aAAa,CACjBC,UACAC,gBACAC;IAEA,MAAMC,SAAmB,EAAE;IAC3B,MAAMnC,WAAWgC,SAASI,WAAW;IACrC,IAAIC,QAAQ;IACZ,KAAK,MAAMC,gBAAgBtC,SAAU;QACnC,IAAI3B,gBAAgBiE,eAAe;YACjC,IAAIA,aAAaC,eAAe,OAAO,GAAG;gBACxC,MAAMf,aAAac,aAAab,aAAa;gBAC7C,IAAInD,YAAYkD,aAAa;oBAC3BW,OAAOK,IAAI,CAACT,WAAWP,YAAYS,gBAAgBC,QAAQ;oBAC3D;gBACF;YACF;YACA,MAAMvB,SAAS,IAAI8B,MAAM,CAACP,QAAQ5B;YAClC,MAAMU,WAAWgB,SAAST,WAAW;YACrC,MAAMmB,SACJ1B,aAAa,WACT,GAAGgB,SAASW,QAAQ,KAAKN,MAAM,EAAE,CAAC,GAClCrB,aAAa,UACX,CAAC,GAAG,EAAEsB,aAAaM,UAAU,KAAK,MAAM,IAAI,EAAE,CAAC,GAC/C;YACRT,OAAOK,IAAI,CAAC7B,SAAS+B,SAAST,eAAeK;YAC7CD;QACF;IACF;IAEA,OAAOF,OAAOU,IAAI,CAAC;AACrB;AAEA,OAAO,MAAMC,UAA8B;IACzCC,MAAM;IACNC,cAAc;QAACnE;KAAY;IAC3BoE,QAAQ,CAAC/C,MAAM+B;QACb,IAAI,CAACtD,eAAeuB,OAAO;YACzB,OAAO;QACT;QACA,MAAMgD,QAAQrB,OAAO3B,KAAKiD,MAAM,GAAGC,KAAK,CAAC;QACzC,OAAO,IAAIX,MAAM,CAACS,SAAS,MAAMjB,eAAe/B;IAClD;IACAmD,QAAQjE;IACRgB,SAASP,gBAAgB,CAACI;QACxB,MAAMqD,MAAO,MAAMrD,KAAK,CAAC,EAAE,CAAEW,MAAM;QACnC,OAAOnC,mBAAmB6E;IAC5B;AACF,EAAC;AAED,OAAO,MAAMC,QAA4B;IACvCR,MAAM;IACNC,cAAc;QAAClE;KAAU;IACzBmE,QAAQ,CAAC/C,MAAM+B;QACb,IAAI,CAACrD,aAAasB,OAAO;YACvB,OAAO;QACT;QAEA,MAAMsD,QAAQvB,eAAe/B,MAAMuD,KAAK,CAAC;QACzC,MAAMtB,SAAmB,EAAE;QAC3B,KAAK,MAAMuB,QAAQF,MAAO;YACxBrB,OAAOK,IAAI,CAAC,OAAOkB;QACrB;QACA,OAAOvB,OAAOU,IAAI,CAAC;IACrB;IACAQ,QAAQhE;IACRe,SAAS,CAACL,YAAYC,UAAU2D,QAAQC;QACtC,IAAIA,UAAU;YACZ,MAAM3C,eAAelB,WAAWmB,kBAAkB;YAClD,IAAItC,aAAaqC,eAAe;gBAC9BA,aAAa4C,MAAM,CAAC5C,aAAasB,eAAe,IAAI,GAAG;oBACrDxD;uBACGiB;iBACJ;gBACDiB,aAAaZ,MAAM,CAAC,GAAG;gBACvBN,WAAW4B,MAAM;gBACjB;YACF;QACF;QAEA,MAAMzB,OAAOxB;QACbwB,KAAKC,MAAM,IAAIH;QACfD,WAAWK,OAAO,CAACF;QACnBA,KAAKG,MAAM,CAAC,GAAG;IACjB;AACF,EAAC;AAED,OAAO,MAAMyD,iBAAqC;IAChDf,MAAM;IACNC,cAAc;QAACxE;QAAUD;KAAa;IACtC0E,QAAQ,CAAC/C,MAAM+B;QACb,OAAO3D,YAAY4B,QAAQ6B,WAAW7B,MAAM+B,gBAAgB,KAAK;IACnE;IACAoB,QAAQnE;IACRkB,SAASW,YAAY;AACvB,EAAC;AAED,OAAO,MAAMgD,aAAiC;IAC5ChB,MAAM;IACNC,cAAc;QAACxE;QAAUD;KAAa;IACtC0E,QAAQ,CAAC/C,MAAM+B;QACb,OAAO3D,YAAY4B,QAAQ6B,WAAW7B,MAAM+B,gBAAgB,KAAK;IACnE;IACAoB,QAAQlE;IACRiB,SAASW,YAAY;AACvB,EAAC;AAED,OAAO,MAAMiD,eAAmC;IAC9CjB,MAAM;IACNC,cAAc;QAACxE;QAAUD;KAAa;IACtC0E,QAAQ,CAAC/C,MAAM+B;QACb,OAAO3D,YAAY4B,QAAQ6B,WAAW7B,MAAM+B,gBAAgB,KAAK;IACnE;IACAoB,QAAQpE;IACRmB,SAASW,YAAY;AACvB,EAAC;AAED,OAAO,MAAMkD,cAAqC;IAChDlB,MAAM;IACNmB,QAAQ;QAAC;KAAO;IAChBZ,KAAK;AACP,EAAC;AAED,OAAO,MAAMa,YAAmC;IAC9CpB,MAAM;IACNmB,QAAQ;QAAC;KAAY;IACrBZ,KAAK;AACP,EAAC;AAED,OAAO,MAAMc,mBAA0C;IACrDrB,MAAM;IACNmB,QAAQ;QAAC;QAAQ;KAAS;IAC1BZ,KAAK;AACP,EAAC;AAED,OAAO,MAAMe,yBAAgD;IAC3DtB,MAAM;IACNmB,QAAQ;QAAC;QAAQ;KAAS;IAC1BI,WAAW;IACXhB,KAAK;AACP,EAAC;AAED,OAAO,MAAMiB,YAAmC;IAC9CxB,MAAM;IACNmB,QAAQ;QAAC;KAAO;IAChBZ,KAAK;AACP,EAAC;AAED,OAAO,MAAMkB,kBAAyC;IACpDzB,MAAM;IACNmB,QAAQ;QAAC;KAAO;IAChBI,WAAW;IACXhB,KAAK;AACP,EAAC;AAED,OAAO,MAAMmB,gBAAuC;IAClD1B,MAAM;IACNmB,QAAQ;QAAC;KAAgB;IACzBZ,KAAK;AACP,EAAC;AAED,OAAO,MAAMoB,cAAqC;IAChD3B,MAAM;IACNmB,QAAQ;QAAC;KAAS;IAClBZ,KAAK;AACP,EAAC;AAED,OAAO,MAAMqB,oBAA2C;IACtD5B,MAAM;IACNmB,QAAQ;QAAC;KAAS;IAClBI,WAAW;IACXhB,KAAK;AACP,EAAC;AAED,OAAO,SAASsB,kBAAkBC,KAAa,EAAEC,wBAAiC;IAChF,MAAMtB,QAAQqB,MAAMpB,KAAK,CAAC;IAC1B,IAAIsB,cAAc;IAClB,MAAMC,iBAA2B,EAAE;IACnC,IAAIC,sBAAsB;IAE1B,IAAK,IAAIC,IAAI,GAAGA,IAAI1B,MAAM5C,MAAM,EAAEsE,IAAK;QACrC,MAAMxB,OAAOF,KAAK,CAAC0B,EAAE;QACrB,MAAMC,WAAWH,cAAc,CAACA,eAAepE,MAAM,GAAG,EAAE;QAE1D,qEAAqE;QACrE,IAAIpB,uBAAuB4F,IAAI,CAAC1B,OAAO;YACrCsB,eAAexC,IAAI,CAACkB;YACpB;QACF;QAEA,IAAInE,eAAe6F,IAAI,CAAC1B,OAAO;YAC7B,IAAIuB,wBAAwB,GAAG;gBAC7BF,cAAc;YAChB;YACA,IAAIE,wBAAwB,GAAG;gBAC7BF,cAAc;YAChB;YACA,IAAIE,sBAAsB,GAAG;gBAC3BA;YACF;YACAD,eAAexC,IAAI,CAACkB;YACpB;QACF;QAEA,0EAA0E;QAC1E,IAAIpE,iBAAiB8F,IAAI,CAAC1B,OAAO;YAC/BqB,cAAc;YACdE;YACAD,eAAexC,IAAI,CAACkB;YACpB;QACF;QAEA,yDAAyD;QACzD,IAAIqB,aAAa;YACfC,eAAexC,IAAI,CAACkB;YACpB;QACF;QAEA,gEAAgE;QAChE,sFAAsF;QACtF,IACE1E,yBAAyBoG,IAAI,CAAC1B,SAC9B1E,yBAAyBoG,IAAI,CAACD,aAC9B,CAACA,YACD/F,cAAcgG,IAAI,CAACD,aACnB/F,cAAcgG,IAAI,CAAC1B,SACnBrE,YAAY+F,IAAI,CAAC1B,SACjBzE,mBAAmBmG,IAAI,CAAC1B,SACxBxE,qBAAqBkG,IAAI,CAAC1B,SAC1BvE,iBAAiBiG,IAAI,CAAC1B,SACtBjE,kBAAkB2F,IAAI,CAAC1B,SACvBhE,0BAA0B0F,IAAI,CAAC1B,SAC/B,CAACoB,4BACDnF,gBAAgByF,IAAI,CAAC1B,SACrB9D,cAAcwF,IAAI,CAAC1B,SACnB/D,gBAAgByF,IAAI,CAACD,aACrBvF,cAAcwF,IAAI,CAACD,aACnB5F,eAAe6F,IAAI,CAACD,WACpB;YACAH,eAAexC,IAAI,CAACkB;QACtB,OAAO;YACLsB,cAAc,CAACA,eAAepE,MAAM,GAAG,EAAE,GAAGuE,WAAW,MAAMzB,KAAK2B,IAAI;QACxE;IACF;IAEA,OAAOL,eAAenC,IAAI,CAAC;AAC7B"}

package/dist/packages/@lexical/markdown/importTextFormatTransformer.js

@@ -4,88 +4,89 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- */import { PUNCTUATION_OR_SPACE } from './utils.js';
+ */ import { PUNCTUATION_OR_SPACE } from './utils.js';
 export function findOutermostTextFormatTransformer(textNode, textFormatTransformersIndex) {
-  const textContent = textNode.getTextContent();
-  const match = findOutermostMatch(textContent, textFormatTransformersIndex);
-  if (!match) {
-    return null;
-  }
-  const textFormatMatchStart = match.index || 0;
-  const textFormatMatchEnd = textFormatMatchStart + match[0].length;
-  // @ts-expect-error - vestiges of when tsconfig was not strict. Feel free to improve
-  const transformer = textFormatTransformersIndex.transformersByTag[match[1]];
-  return {
-    endIndex: textFormatMatchEnd,
-    match,
-    startIndex: textFormatMatchStart,
-    transformer
-  };
+    const textContent = textNode.getTextContent();
+    const match = findOutermostMatch(textContent, textFormatTransformersIndex);
+    if (!match) {
+        return null;
+    }
+    const textFormatMatchStart = match.index || 0;
+    const textFormatMatchEnd = textFormatMatchStart + match[0].length;
+    // @ts-expect-error - vestiges of when tsconfig was not strict. Feel free to improve
+    const transformer = textFormatTransformersIndex.transformersByTag[match[1]];
+    return {
+        endIndex: textFormatMatchEnd,
+        match,
+        startIndex: textFormatMatchStart,
+        transformer
+    };
 }
 // Finds first "<tag>content<tag>" match that is not nested into another tag
 function findOutermostMatch(textContent, textTransformersIndex) {
-  const openTagsMatch = textContent.match(textTransformersIndex.openTagsRegExp);
-  if (openTagsMatch == null) {
-    return null;
-  }
-  for (const match of openTagsMatch) {
-    // Open tags reg exp might capture leading space so removing it
-    // before using match to find transformer
-    const tag = match.replace(/^\s/, '');
-    const fullMatchRegExp = textTransformersIndex.fullMatchRegExpByTag[tag];
-    if (fullMatchRegExp == null) {
-      continue;
+    const openTagsMatch = textContent.match(textTransformersIndex.openTagsRegExp);
+    if (openTagsMatch == null) {
+        return null;
     }
-    const fullMatch = textContent.match(fullMatchRegExp);
-    const transformer = textTransformersIndex.transformersByTag[tag];
-    if (fullMatch != null && transformer != null) {
-      if (transformer.intraword !== false) {
-        return fullMatch;
-      }
-      // For non-intraword transformers checking if it's within a word
-      // or surrounded with space/punctuation/newline
-      const {
-        index = 0
-      } = fullMatch;
-      const beforeChar = textContent[index - 1];
-      const afterChar = textContent[index + fullMatch[0].length];
-      if ((!beforeChar || PUNCTUATION_OR_SPACE.test(beforeChar)) && (!afterChar || PUNCTUATION_OR_SPACE.test(afterChar))) {
-        return fullMatch;
-      }
+    for (const match of openTagsMatch){
+        // Open tags reg exp might capture leading space so removing it
+        // before using match to find transformer
+        const tag = match.replace(/^\s/, '');
+        const fullMatchRegExp = textTransformersIndex.fullMatchRegExpByTag[tag];
+        if (fullMatchRegExp == null) {
+            continue;
+        }
+        const fullMatch = textContent.match(fullMatchRegExp);
+        const transformer = textTransformersIndex.transformersByTag[tag];
+        if (fullMatch != null && transformer != null) {
+            if (transformer.intraword !== false) {
+                return fullMatch;
+            }
+            // For non-intraword transformers checking if it's within a word
+            // or surrounded with space/punctuation/newline
+            const { index = 0 } = fullMatch;
+            const beforeChar = textContent[index - 1];
+            const afterChar = textContent[index + fullMatch[0].length];
+            if ((!beforeChar || PUNCTUATION_OR_SPACE.test(beforeChar)) && (!afterChar || PUNCTUATION_OR_SPACE.test(afterChar))) {
+                return fullMatch;
+            }
+        }
     }
-  }
-  return null;
+    return null;
 }
-export function importTextFormatTransformer(textNode, startIndex, endIndex, transformer, match) {
-  const textContent = textNode.getTextContent();
-  // No text matches - we can safely process the text format match
-  let nodeAfter;
-  let nodeBefore;
-  let transformedNode;
-  // If matching full content there's no need to run splitText and can reuse existing textNode
-  // to update its content and apply format. E.g. for **_Hello_** string after applying bold
-  // format (**) it will reuse the same text node to apply italic (_)
-  if (match[0] === textContent) {
-    transformedNode = textNode;
-  } else {
-    if (startIndex === 0) {
-      [transformedNode, nodeAfter] = textNode.splitText(endIndex);
+export function importTextFormatTransformer(textNode, startIndex, endIndex, transformer, match) // If split
+// If split
+{
+    const textContent = textNode.getTextContent();
+    // No text matches - we can safely process the text format match
+    let nodeAfter;
+    let nodeBefore;
+    let transformedNode;
+    // If matching full content there's no need to run splitText and can reuse existing textNode
+    // to update its content and apply format. E.g. for **_Hello_** string after applying bold
+    // format (**) it will reuse the same text node to apply italic (_)
+    if (match[0] === textContent) {
+        transformedNode = textNode;
     } else {
-      [nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex);
+        if (startIndex === 0) {
+            [transformedNode, nodeAfter] = textNode.splitText(endIndex);
+        } else {
+            [nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex);
+        }
     }
-  }
-  transformedNode.setTextContent(match[2]);
-  if (transformer) {
-    for (const format of transformer.format) {
-      if (!transformedNode.hasFormat(format)) {
-        transformedNode.toggleFormat(format);
-      }
+    transformedNode.setTextContent(match[2]);
+    if (transformer) {
+        for (const format of transformer.format){
+            if (!transformedNode.hasFormat(format)) {
+                transformedNode.toggleFormat(format);
+            }
+        }
     }
-  }
-  return {
-    nodeAfter,
-    nodeBefore,
-    transformedNode
-  };
+    return {
+        nodeAfter,
+        nodeBefore,
+        transformedNode
+    };
 }
+
 //# sourceMappingURL=importTextFormatTransformer.js.map

package/dist/packages/@lexical/markdown/importTextFormatTransformer.js.map

@@ -1 +1 @@
-{"version":3,"file":"importTextFormatTransformer.js","names":["PUNCTUATION_OR_SPACE","findOutermostTextFormatTransformer","textNode","textFormatTransformersIndex","textContent","getTextContent","match","findOutermostMatch","textFormatMatchStart","index","textFormatMatchEnd","length","transformer","transformersByTag","endIndex","startIndex","textTransformersIndex","openTagsMatch","openTagsRegExp","tag","replace","fullMatchRegExp","fullMatchRegExpByTag","fullMatch","intraword","beforeChar","afterChar","test","importTextFormatTransformer","nodeAfter","nodeBefore","transformedNode","splitText","setTextContent","format","hasFormat","toggleFormat"],"sources":["../../../../src/packages/@lexical/markdown/importTextFormatTransformer.ts"],"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 type { TextNode } from 'lexical'\n\nimport type { TextFormatTransformersIndex } from './MarkdownImport.js'\nimport type { TextFormatTransformer } from './MarkdownTransformers.js'\n\nimport { PUNCTUATION_OR_SPACE } from './utils.js'\n\nexport function findOutermostTextFormatTransformer(\n  textNode: TextNode,\n  textFormatTransformersIndex: TextFormatTransformersIndex,\n): {\n  endIndex: number\n  match: RegExpMatchArray\n  startIndex: number\n  transformer: TextFormatTransformer\n} | null {\n  const textContent = textNode.getTextContent()\n  const match = findOutermostMatch(textContent, textFormatTransformersIndex)\n\n  if (!match) {\n    return null\n  }\n\n  const textFormatMatchStart: number = match.index || 0\n  const textFormatMatchEnd = textFormatMatchStart + match[0].length\n\n  // @ts-expect-error - vestiges of when tsconfig was not strict. Feel free to improve\n  const transformer: TextFormatTransformer = textFormatTransformersIndex.transformersByTag[match[1]]\n\n  return {\n    endIndex: textFormatMatchEnd,\n    match,\n    startIndex: textFormatMatchStart,\n    transformer,\n  }\n}\n\n// Finds first \"<tag>content<tag>\" match that is not nested into another tag\nfunction findOutermostMatch(\n  textContent: string,\n  textTransformersIndex: TextFormatTransformersIndex,\n): null | RegExpMatchArray {\n  const openTagsMatch = textContent.match(textTransformersIndex.openTagsRegExp)\n\n  if (openTagsMatch == null) {\n    return null\n  }\n\n  for (const match of openTagsMatch) {\n    // Open tags reg exp might capture leading space so removing it\n    // before using match to find transformer\n    const tag = match.replace(/^\\s/, '')\n    const fullMatchRegExp = textTransformersIndex.fullMatchRegExpByTag[tag]\n    if (fullMatchRegExp == null) {\n      continue\n    }\n\n    const fullMatch = textContent.match(fullMatchRegExp)\n    const transformer = textTransformersIndex.transformersByTag[tag]\n    if (fullMatch != null && transformer != null) {\n      if (transformer.intraword !== false) {\n        return fullMatch\n      }\n\n      // For non-intraword transformers checking if it's within a word\n      // or surrounded with space/punctuation/newline\n      const { index = 0 } = fullMatch\n      const beforeChar = textContent[index - 1]\n      const afterChar = textContent[index + fullMatch[0].length]\n\n      if (\n        (!beforeChar || PUNCTUATION_OR_SPACE.test(beforeChar)) &&\n        (!afterChar || PUNCTUATION_OR_SPACE.test(afterChar))\n      ) {\n        return fullMatch\n      }\n    }\n  }\n\n  return null\n}\n\nexport function importTextFormatTransformer(\n  textNode: TextNode,\n  startIndex: number,\n  endIndex: number,\n  transformer: TextFormatTransformer,\n  match: RegExpMatchArray,\n): {\n  nodeAfter: TextNode | undefined // If split\n  nodeBefore: TextNode | undefined // If split\n  transformedNode: TextNode\n} {\n  const textContent = textNode.getTextContent()\n\n  // No text matches - we can safely process the text format match\n  let nodeAfter: TextNode | undefined\n  let nodeBefore: TextNode | undefined\n  let transformedNode: TextNode\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) as [\n        TextNode,\n        TextNode | undefined,\n      ]\n    } else {\n      ;[nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex) as [\n        TextNode,\n        TextNode,\n        TextNode | undefined,\n      ]\n    }\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\n  return {\n    nodeAfter,\n    nodeBefore,\n    transformedNode,\n  }\n}\n"],"mappings":"AAAA;;;;;;GAaA,SAASA,oBAAoB,QAAQ;AAErC,OAAO,SAASC,mCACdC,QAAkB,EAClBC,2BAAwD;EAOxD,MAAMC,WAAA,GAAcF,QAAA,CAASG,cAAc;EAC3C,MAAMC,KAAA,GAAQC,kBAAA,CAAmBH,WAAA,EAAaD,2BAAA;EAE9C,IAAI,CAACG,KAAA,EAAO;IACV,OAAO;EACT;EAEA,MAAME,oBAAA,GAA+BF,KAAA,CAAMG,KAAK,IAAI;EACpD,MAAMC,kBAAA,GAAqBF,oBAAA,GAAuBF,KAAK,CAAC,EAAE,CAACK,MAAM;EAEjE;EACA,MAAMC,WAAA,GAAqCT,2BAAA,CAA4BU,iBAAiB,CAACP,KAAK,CAAC,EAAE,CAAC;EAElG,OAAO;IACLQ,QAAA,EAAUJ,kBAAA;IACVJ,KAAA;IACAS,UAAA,EAAYP,oBAAA;IACZI;EACF;AACF;AAEA;AACA,SAASL,mBACPH,WAAmB,EACnBY,qBAAkD;EAElD,MAAMC,aAAA,GAAgBb,WAAA,CAAYE,KAAK,CAACU,qBAAA,CAAsBE,cAAc;EAE5E,IAAID,aAAA,IAAiB,MAAM;IACzB,OAAO;EACT;EAEA,KAAK,MAAMX,KAAA,IAASW,aAAA,EAAe;IACjC;IACA;IACA,MAAME,GAAA,GAAMb,KAAA,CAAMc,OAAO,CAAC,OAAO;IACjC,MAAMC,eAAA,GAAkBL,qBAAA,CAAsBM,oBAAoB,CAACH,GAAA,CAAI;IACvE,IAAIE,eAAA,IAAmB,MAAM;MAC3B;IACF;IAEA,MAAME,SAAA,GAAYnB,WAAA,CAAYE,KAAK,CAACe,eAAA;IACpC,MAAMT,WAAA,GAAcI,qBAAA,CAAsBH,iBAAiB,CAACM,GAAA,CAAI;IAChE,IAAII,SAAA,IAAa,QAAQX,WAAA,IAAe,MAAM;MAC5C,IAAIA,WAAA,CAAYY,SAAS,KAAK,OAAO;QACnC,OAAOD,SAAA;MACT;MAEA;MACA;MACA,MAAM;QAAEd,KAAA,GAAQ;MAAC,CAAE,GAAGc,SAAA;MACtB,MAAME,UAAA,GAAarB,WAAW,CAACK,KAAA,GAAQ,EAAE;MACzC,MAAMiB,SAAA,GAAYtB,WAAW,CAACK,KAAA,GAAQc,SAAS,CAAC,EAAE,CAACZ,MAAM,CAAC;MAE1D,IACE,CAAC,CAACc,UAAA,IAAczB,oBAAA,CAAqB2B,IAAI,CAACF,UAAA,CAAU,MACnD,CAACC,SAAA,IAAa1B,oBAAA,CAAqB2B,IAAI,CAACD,SAAA,CAAS,GAClD;QACA,OAAOH,SAAA;MACT;IACF;EACF;EAEA,OAAO;AACT;AAEA,OAAO,SAASK,4BACd1B,QAAkB,EAClBa,UAAkB,EAClBD,QAAgB,EAChBF,WAAkC,EAClCN,KAAuB;EAMvB,MAAMF,WAAA,GAAcF,QAAA,CAASG,cAAc;EAE3C;EACA,IAAIwB,SAAA;EACJ,IAAIC,UAAA;EACJ,IAAIC,eAAA;EAEJ;EACA;EACA;EACA,IAAIzB,KAAK,CAAC,EAAE,KAAKF,WAAA,EAAa;IAC5B2B,eAAA,GAAkB7B,QAAA;EACpB,OAAO;IACL,IAAIa,UAAA,KAAe,GAAG;MACnB,CAACgB,eAAA,EAAiBF,SAAA,CAAU,GAAG3B,QAAA,CAAS8B,SAAS,CAAClB,QAAA;IAIrD,OAAO;MACJ,CAACgB,UAAA,EAAYC,eAAA,EAAiBF,SAAA,CAAU,GAAG3B,QAAA,CAAS8B,SAAS,CAACjB,UAAA,EAAYD,QAAA;IAK7E;EACF;EAEAiB,eAAA,CAAgBE,cAAc,CAAC3B,KAAK,CAAC,EAAE;EACvC,IAAIM,WAAA,EAAa;IACf,KAAK,MAAMsB,MAAA,IAAUtB,WAAA,CAAYsB,MAAM,EAAE;MACvC,IAAI,CAACH,eAAA,CAAgBI,SAAS,CAACD,MAAA,GAAS;QACtCH,eAAA,CAAgBK,YAAY,CAACF,MAAA;MAC/B;IACF;EACF;EAEA,OAAO;IACLL,SAAA;IACAC,UAAA;IACAC;EACF;AACF","ignoreList":[]}
+{"version":3,"sources":["../../../../src/packages/@lexical/markdown/importTextFormatTransformer.ts"],"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 type { TextNode } from 'lexical'\n\nimport type { TextFormatTransformersIndex } from './MarkdownImport.js'\nimport type { TextFormatTransformer } from './MarkdownTransformers.js'\n\nimport { PUNCTUATION_OR_SPACE } from './utils.js'\n\nexport function findOutermostTextFormatTransformer(\n  textNode: TextNode,\n  textFormatTransformersIndex: TextFormatTransformersIndex,\n): {\n  endIndex: number\n  match: RegExpMatchArray\n  startIndex: number\n  transformer: TextFormatTransformer\n} | null {\n  const textContent = textNode.getTextContent()\n  const match = findOutermostMatch(textContent, textFormatTransformersIndex)\n\n  if (!match) {\n    return null\n  }\n\n  const textFormatMatchStart: number = match.index || 0\n  const textFormatMatchEnd = textFormatMatchStart + match[0].length\n\n  // @ts-expect-error - vestiges of when tsconfig was not strict. Feel free to improve\n  const transformer: TextFormatTransformer = textFormatTransformersIndex.transformersByTag[match[1]]\n\n  return {\n    endIndex: textFormatMatchEnd,\n    match,\n    startIndex: textFormatMatchStart,\n    transformer,\n  }\n}\n\n// Finds first \"<tag>content<tag>\" match that is not nested into another tag\nfunction findOutermostMatch(\n  textContent: string,\n  textTransformersIndex: TextFormatTransformersIndex,\n): null | RegExpMatchArray {\n  const openTagsMatch = textContent.match(textTransformersIndex.openTagsRegExp)\n\n  if (openTagsMatch == null) {\n    return null\n  }\n\n  for (const match of openTagsMatch) {\n    // Open tags reg exp might capture leading space so removing it\n    // before using match to find transformer\n    const tag = match.replace(/^\\s/, '')\n    const fullMatchRegExp = textTransformersIndex.fullMatchRegExpByTag[tag]\n    if (fullMatchRegExp == null) {\n      continue\n    }\n\n    const fullMatch = textContent.match(fullMatchRegExp)\n    const transformer = textTransformersIndex.transformersByTag[tag]\n    if (fullMatch != null && transformer != null) {\n      if (transformer.intraword !== false) {\n        return fullMatch\n      }\n\n      // For non-intraword transformers checking if it's within a word\n      // or surrounded with space/punctuation/newline\n      const { index = 0 } = fullMatch\n      const beforeChar = textContent[index - 1]\n      const afterChar = textContent[index + fullMatch[0].length]\n\n      if (\n        (!beforeChar || PUNCTUATION_OR_SPACE.test(beforeChar)) &&\n        (!afterChar || PUNCTUATION_OR_SPACE.test(afterChar))\n      ) {\n        return fullMatch\n      }\n    }\n  }\n\n  return null\n}\n\nexport function importTextFormatTransformer(\n  textNode: TextNode,\n  startIndex: number,\n  endIndex: number,\n  transformer: TextFormatTransformer,\n  match: RegExpMatchArray,\n): {\n  nodeAfter: TextNode | undefined // If split\n  nodeBefore: TextNode | undefined // If split\n  transformedNode: TextNode\n} {\n  const textContent = textNode.getTextContent()\n\n  // No text matches - we can safely process the text format match\n  let nodeAfter: TextNode | undefined\n  let nodeBefore: TextNode | undefined\n  let transformedNode: TextNode\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) as [\n        TextNode,\n        TextNode | undefined,\n      ]\n    } else {\n      ;[nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex) as [\n        TextNode,\n        TextNode,\n        TextNode | undefined,\n      ]\n    }\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\n  return {\n    nodeAfter,\n    nodeBefore,\n    transformedNode,\n  }\n}\n"],"names":["PUNCTUATION_OR_SPACE","findOutermostTextFormatTransformer","textNode","textFormatTransformersIndex","textContent","getTextContent","match","findOutermostMatch","textFormatMatchStart","index","textFormatMatchEnd","length","transformer","transformersByTag","endIndex","startIndex","textTransformersIndex","openTagsMatch","openTagsRegExp","tag","replace","fullMatchRegExp","fullMatchRegExpByTag","fullMatch","intraword","beforeChar","afterChar","test","importTextFormatTransformer","nodeAfter","nodeBefore","transformedNode","splitText","setTextContent","format","hasFormat","toggleFormat"],"mappings":"AAAA;;;;;;CAMC,GAOD,SAASA,oBAAoB,QAAQ,aAAY;AAEjD,OAAO,SAASC,mCACdC,QAAkB,EAClBC,2BAAwD;IAOxD,MAAMC,cAAcF,SAASG,cAAc;IAC3C,MAAMC,QAAQC,mBAAmBH,aAAaD;IAE9C,IAAI,CAACG,OAAO;QACV,OAAO;IACT;IAEA,MAAME,uBAA+BF,MAAMG,KAAK,IAAI;IACpD,MAAMC,qBAAqBF,uBAAuBF,KAAK,CAAC,EAAE,CAACK,MAAM;IAEjE,oFAAoF;IACpF,MAAMC,cAAqCT,4BAA4BU,iBAAiB,CAACP,KAAK,CAAC,EAAE,CAAC;IAElG,OAAO;QACLQ,UAAUJ;QACVJ;QACAS,YAAYP;QACZI;IACF;AACF;AAEA,4EAA4E;AAC5E,SAASL,mBACPH,WAAmB,EACnBY,qBAAkD;IAElD,MAAMC,gBAAgBb,YAAYE,KAAK,CAACU,sBAAsBE,cAAc;IAE5E,IAAID,iBAAiB,MAAM;QACzB,OAAO;IACT;IAEA,KAAK,MAAMX,SAASW,cAAe;QACjC,+DAA+D;QAC/D,yCAAyC;QACzC,MAAME,MAAMb,MAAMc,OAAO,CAAC,OAAO;QACjC,MAAMC,kBAAkBL,sBAAsBM,oBAAoB,CAACH,IAAI;QACvE,IAAIE,mBAAmB,MAAM;YAC3B;QACF;QAEA,MAAME,YAAYnB,YAAYE,KAAK,CAACe;QACpC,MAAMT,cAAcI,sBAAsBH,iBAAiB,CAACM,IAAI;QAChE,IAAII,aAAa,QAAQX,eAAe,MAAM;YAC5C,IAAIA,YAAYY,SAAS,KAAK,OAAO;gBACnC,OAAOD;YACT;YAEA,gEAAgE;YAChE,+CAA+C;YAC/C,MAAM,EAAEd,QAAQ,CAAC,EAAE,GAAGc;YACtB,MAAME,aAAarB,WAAW,CAACK,QAAQ,EAAE;YACzC,MAAMiB,YAAYtB,WAAW,CAACK,QAAQc,SAAS,CAAC,EAAE,CAACZ,MAAM,CAAC;YAE1D,IACE,AAAC,CAAA,CAACc,cAAczB,qBAAqB2B,IAAI,CAACF,WAAU,KACnD,CAAA,CAACC,aAAa1B,qBAAqB2B,IAAI,CAACD,UAAS,GAClD;gBACA,OAAOH;YACT;QACF;IACF;IAEA,OAAO;AACT;AAEA,OAAO,SAASK,4BACd1B,QAAkB,EAClBa,UAAkB,EAClBD,QAAgB,EAChBF,WAAkC,EAClCN,KAAuB,EAES,WAAW;AACV,WAAW;;IAG5C,MAAMF,cAAcF,SAASG,cAAc;IAE3C,gEAAgE;IAChE,IAAIwB;IACJ,IAAIC;IACJ,IAAIC;IAEJ,4FAA4F;IAC5F,0FAA0F;IAC1F,mEAAmE;IACnE,IAAIzB,KAAK,CAAC,EAAE,KAAKF,aAAa;QAC5B2B,kBAAkB7B;IACpB,OAAO;QACL,IAAIa,eAAe,GAAG;YACnB,CAACgB,iBAAiBF,UAAU,GAAG3B,SAAS8B,SAAS,CAAClB;QAIrD,OAAO;YACJ,CAACgB,YAAYC,iBAAiBF,UAAU,GAAG3B,SAAS8B,SAAS,CAACjB,YAAYD;QAK7E;IACF;IAEAiB,gBAAgBE,cAAc,CAAC3B,KAAK,CAAC,EAAE;IACvC,IAAIM,aAAa;QACf,KAAK,MAAMsB,UAAUtB,YAAYsB,MAAM,CAAE;YACvC,IAAI,CAACH,gBAAgBI,SAAS,CAACD,SAAS;gBACtCH,gBAAgBK,YAAY,CAACF;YAC/B;QACF;IACF;IAEA,OAAO;QACLL;QACAC;QACAC;IACF;AACF"}

package/dist/packages/@lexical/markdown/importTextMatchTransformer.js

@@ -1,54 +1,63 @@
-export function findOutermostTextMatchTransformer(textNode_, textMatchTransformers) {
-  const textNode = textNode_;
-  let foundMatchStartIndex = undefined;
-  let foundMatchEndIndex = undefined;
-  let foundMatchTransformer = undefined;
-  let foundMatch = undefined;
-  for (const transformer of textMatchTransformers) {
-    if (!transformer.replace || !transformer.importRegExp) {
-      continue;
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */ export function findOutermostTextMatchTransformer(textNode_, textMatchTransformers) {
+    const textNode = textNode_;
+    let foundMatchStartIndex = undefined;
+    let foundMatchEndIndex = undefined;
+    let foundMatchTransformer = undefined;
+    let foundMatch = undefined;
+    for (const transformer of textMatchTransformers){
+        if (!transformer.replace || !transformer.importRegExp) {
+            continue;
+        }
+        const match = textNode.getTextContent().match(transformer.importRegExp);
+        if (!match) {
+            continue;
+        }
+        const startIndex = match.index || 0;
+        const endIndex = transformer.getEndIndex ? transformer.getEndIndex(textNode, match) : startIndex + match[0].length;
+        if (endIndex === false) {
+            continue;
+        }
+        if (foundMatchStartIndex === undefined || foundMatchEndIndex === undefined || startIndex < foundMatchStartIndex && endIndex > foundMatchEndIndex) {
+            foundMatchStartIndex = startIndex;
+            foundMatchEndIndex = endIndex;
+            foundMatchTransformer = transformer;
+            foundMatch = match;
+        }
     }
-    const match = textNode.getTextContent().match(transformer.importRegExp);
-    if (!match) {
-      continue;
+    if (foundMatchStartIndex === undefined || foundMatchEndIndex === undefined || foundMatchTransformer === undefined || foundMatch === undefined) {
+        return null;
     }
-    const startIndex = match.index || 0;
-    const endIndex = transformer.getEndIndex ? transformer.getEndIndex(textNode, match) : startIndex + match[0].length;
-    if (endIndex === false) {
-      continue;
+    return {
+        endIndex: foundMatchEndIndex,
+        match: foundMatch,
+        startIndex: foundMatchStartIndex,
+        transformer: foundMatchTransformer
+    };
+}
+export function importFoundTextMatchTransformer(textNode, startIndex, endIndex, transformer, match) // If split
+// If split
+{
+    let nodeAfter, nodeBefore, transformedNode;
+    if (startIndex === 0) {
+        [transformedNode, nodeAfter] = textNode.splitText(endIndex);
+    } else {
+        [nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex);
     }
-    if (foundMatchStartIndex === undefined || foundMatchEndIndex === undefined || startIndex < foundMatchStartIndex && endIndex > foundMatchEndIndex) {
-      foundMatchStartIndex = startIndex;
-      foundMatchEndIndex = endIndex;
-      foundMatchTransformer = transformer;
-      foundMatch = match;
+    if (!transformer.replace) {
+        return null;
     }
-  }
-  if (foundMatchStartIndex === undefined || foundMatchEndIndex === undefined || foundMatchTransformer === undefined || foundMatch === undefined) {
-    return null;
-  }
-  return {
-    endIndex: foundMatchEndIndex,
-    match: foundMatch,
-    startIndex: foundMatchStartIndex,
-    transformer: foundMatchTransformer
-  };
-}
-export function importFoundTextMatchTransformer(textNode, startIndex, endIndex, transformer, match) {
-  let nodeAfter, nodeBefore, transformedNode;
-  if (startIndex === 0) {
-    [transformedNode, nodeAfter] = textNode.splitText(endIndex);
-  } else {
-    [nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex);
-  }
-  if (!transformer.replace) {
-    return null;
-  }
-  const potentialTransformedNode = transformedNode ? transformer.replace(transformedNode, match) : undefined;
-  return {
-    nodeAfter,
-    nodeBefore,
-    transformedNode: potentialTransformedNode || undefined
-  };
+    const potentialTransformedNode = transformedNode ? transformer.replace(transformedNode, match) : undefined;
+    return {
+        nodeAfter,
+        nodeBefore,
+        transformedNode: potentialTransformedNode || undefined
+    };
 }
+
 //# sourceMappingURL=importTextMatchTransformer.js.map

package/dist/packages/@lexical/markdown/importTextMatchTransformer.js.map

@@ -1 +1 @@
-{"version":3,"file":"importTextMatchTransformer.js","names":["findOutermostTextMatchTransformer","textNode_","textMatchTransformers","textNode","foundMatchStartIndex","undefined","foundMatchEndIndex","foundMatchTransformer","foundMatch","transformer","replace","importRegExp","match","getTextContent","startIndex","index","endIndex","getEndIndex","length","importFoundTextMatchTransformer","nodeAfter","nodeBefore","transformedNode","splitText","potentialTransformedNode"],"sources":["../../../../src/packages/@lexical/markdown/importTextMatchTransformer.ts"],"sourcesContent":["import { type TextNode } from 'lexical'\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 */\nimport type { TextMatchTransformer } from './MarkdownTransformers.js'\n\nexport function findOutermostTextMatchTransformer(\n  textNode_: TextNode,\n  textMatchTransformers: Array<TextMatchTransformer>,\n): {\n  endIndex: number\n  match: RegExpMatchArray\n  startIndex: number\n  transformer: TextMatchTransformer\n} | null {\n  const textNode = textNode_\n\n  let foundMatchStartIndex: number | undefined = undefined\n  let foundMatchEndIndex: number | undefined = undefined\n  let foundMatchTransformer: TextMatchTransformer | undefined = undefined\n  let foundMatch: RegExpMatchArray | undefined = undefined\n\n  for (const transformer of textMatchTransformers) {\n    if (!transformer.replace || !transformer.importRegExp) {\n      continue\n    }\n    const match = textNode.getTextContent().match(transformer.importRegExp)\n\n    if (!match) {\n      continue\n    }\n\n    const startIndex = match.index || 0\n    const endIndex = transformer.getEndIndex\n      ? transformer.getEndIndex(textNode, match)\n      : startIndex + match[0].length\n\n    if (endIndex === false) {\n      continue\n    }\n\n    if (\n      foundMatchStartIndex === undefined ||\n      foundMatchEndIndex === undefined ||\n      (startIndex < foundMatchStartIndex && endIndex > foundMatchEndIndex)\n    ) {\n      foundMatchStartIndex = startIndex\n      foundMatchEndIndex = endIndex\n      foundMatchTransformer = transformer\n      foundMatch = match\n    }\n  }\n\n  if (\n    foundMatchStartIndex === undefined ||\n    foundMatchEndIndex === undefined ||\n    foundMatchTransformer === undefined ||\n    foundMatch === undefined\n  ) {\n    return null\n  }\n\n  return {\n    endIndex: foundMatchEndIndex,\n    match: foundMatch,\n    startIndex: foundMatchStartIndex,\n    transformer: foundMatchTransformer,\n  }\n}\n\nexport function importFoundTextMatchTransformer(\n  textNode: TextNode,\n  startIndex: number,\n  endIndex: number,\n  transformer: TextMatchTransformer,\n  match: RegExpMatchArray,\n): {\n  nodeAfter: TextNode | undefined // If split\n  nodeBefore: TextNode | undefined // If split\n  transformedNode?: TextNode\n} | null {\n  let nodeAfter, nodeBefore, transformedNode\n\n  if (startIndex === 0) {\n    ;[transformedNode, nodeAfter] = textNode.splitText(endIndex)\n  } else {\n    ;[nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex)\n  }\n\n  if (!transformer.replace) {\n    return null\n  }\n  const potentialTransformedNode = transformedNode\n    ? transformer.replace(transformedNode, match)\n    : undefined\n\n  return {\n    nodeAfter,\n    nodeBefore,\n    transformedNode: potentialTransformedNode || undefined,\n  }\n}\n"],"mappings":"AAWA,OAAO,SAASA,kCACdC,SAAmB,EACnBC,qBAAkD;EAOlD,MAAMC,QAAA,GAAWF,SAAA;EAEjB,IAAIG,oBAAA,GAA2CC,SAAA;EAC/C,IAAIC,kBAAA,GAAyCD,SAAA;EAC7C,IAAIE,qBAAA,GAA0DF,SAAA;EAC9D,IAAIG,UAAA,GAA2CH,SAAA;EAE/C,KAAK,MAAMI,WAAA,IAAeP,qBAAA,EAAuB;IAC/C,IAAI,CAACO,WAAA,CAAYC,OAAO,IAAI,CAACD,WAAA,CAAYE,YAAY,EAAE;MACrD;IACF;IACA,MAAMC,KAAA,GAAQT,QAAA,CAASU,cAAc,GAAGD,KAAK,CAACH,WAAA,CAAYE,YAAY;IAEtE,IAAI,CAACC,KAAA,EAAO;MACV;IACF;IAEA,MAAME,UAAA,GAAaF,KAAA,CAAMG,KAAK,IAAI;IAClC,MAAMC,QAAA,GAAWP,WAAA,CAAYQ,WAAW,GACpCR,WAAA,CAAYQ,WAAW,CAACd,QAAA,EAAUS,KAAA,IAClCE,UAAA,GAAaF,KAAK,CAAC,EAAE,CAACM,MAAM;IAEhC,IAAIF,QAAA,KAAa,OAAO;MACtB;IACF;IAEA,IACEZ,oBAAA,KAAyBC,SAAA,IACzBC,kBAAA,KAAuBD,SAAA,IACtBS,UAAA,GAAaV,oBAAA,IAAwBY,QAAA,GAAWV,kBAAA,EACjD;MACAF,oBAAA,GAAuBU,UAAA;MACvBR,kBAAA,GAAqBU,QAAA;MACrBT,qBAAA,GAAwBE,WAAA;MACxBD,UAAA,GAAaI,KAAA;IACf;EACF;EAEA,IACER,oBAAA,KAAyBC,SAAA,IACzBC,kBAAA,KAAuBD,SAAA,IACvBE,qBAAA,KAA0BF,SAAA,IAC1BG,UAAA,KAAeH,SAAA,EACf;IACA,OAAO;EACT;EAEA,OAAO;IACLW,QAAA,EAAUV,kBAAA;IACVM,KAAA,EAAOJ,UAAA;IACPM,UAAA,EAAYV,oBAAA;IACZK,WAAA,EAAaF;EACf;AACF;AAEA,OAAO,SAASY,gCACdhB,QAAkB,EAClBW,UAAkB,EAClBE,QAAgB,EAChBP,WAAiC,EACjCG,KAAuB;EAMvB,IAAIQ,SAAA,EAAWC,UAAA,EAAYC,eAAA;EAE3B,IAAIR,UAAA,KAAe,GAAG;IACnB,CAACQ,eAAA,EAAiBF,SAAA,CAAU,GAAGjB,QAAA,CAASoB,SAAS,CAACP,QAAA;EACrD,OAAO;IACJ,CAACK,UAAA,EAAYC,eAAA,EAAiBF,SAAA,CAAU,GAAGjB,QAAA,CAASoB,SAAS,CAACT,UAAA,EAAYE,QAAA;EAC7E;EAEA,IAAI,CAACP,WAAA,CAAYC,OAAO,EAAE;IACxB,OAAO;EACT;EACA,MAAMc,wBAAA,GAA2BF,eAAA,GAC7Bb,WAAA,CAAYC,OAAO,CAACY,eAAA,EAAiBV,KAAA,IACrCP,SAAA;EAEJ,OAAO;IACLe,SAAA;IACAC,UAAA;IACAC,eAAA,EAAiBE,wBAAA,IAA4BnB;EAC/C;AACF","ignoreList":[]}
+{"version":3,"sources":["../../../../src/packages/@lexical/markdown/importTextMatchTransformer.ts"],"sourcesContent":["import { type TextNode } from 'lexical'\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 */\nimport type { TextMatchTransformer } from './MarkdownTransformers.js'\n\nexport function findOutermostTextMatchTransformer(\n  textNode_: TextNode,\n  textMatchTransformers: Array<TextMatchTransformer>,\n): {\n  endIndex: number\n  match: RegExpMatchArray\n  startIndex: number\n  transformer: TextMatchTransformer\n} | null {\n  const textNode = textNode_\n\n  let foundMatchStartIndex: number | undefined = undefined\n  let foundMatchEndIndex: number | undefined = undefined\n  let foundMatchTransformer: TextMatchTransformer | undefined = undefined\n  let foundMatch: RegExpMatchArray | undefined = undefined\n\n  for (const transformer of textMatchTransformers) {\n    if (!transformer.replace || !transformer.importRegExp) {\n      continue\n    }\n    const match = textNode.getTextContent().match(transformer.importRegExp)\n\n    if (!match) {\n      continue\n    }\n\n    const startIndex = match.index || 0\n    const endIndex = transformer.getEndIndex\n      ? transformer.getEndIndex(textNode, match)\n      : startIndex + match[0].length\n\n    if (endIndex === false) {\n      continue\n    }\n\n    if (\n      foundMatchStartIndex === undefined ||\n      foundMatchEndIndex === undefined ||\n      (startIndex < foundMatchStartIndex && endIndex > foundMatchEndIndex)\n    ) {\n      foundMatchStartIndex = startIndex\n      foundMatchEndIndex = endIndex\n      foundMatchTransformer = transformer\n      foundMatch = match\n    }\n  }\n\n  if (\n    foundMatchStartIndex === undefined ||\n    foundMatchEndIndex === undefined ||\n    foundMatchTransformer === undefined ||\n    foundMatch === undefined\n  ) {\n    return null\n  }\n\n  return {\n    endIndex: foundMatchEndIndex,\n    match: foundMatch,\n    startIndex: foundMatchStartIndex,\n    transformer: foundMatchTransformer,\n  }\n}\n\nexport function importFoundTextMatchTransformer(\n  textNode: TextNode,\n  startIndex: number,\n  endIndex: number,\n  transformer: TextMatchTransformer,\n  match: RegExpMatchArray,\n): {\n  nodeAfter: TextNode | undefined // If split\n  nodeBefore: TextNode | undefined // If split\n  transformedNode?: TextNode\n} | null {\n  let nodeAfter, nodeBefore, transformedNode\n\n  if (startIndex === 0) {\n    ;[transformedNode, nodeAfter] = textNode.splitText(endIndex)\n  } else {\n    ;[nodeBefore, transformedNode, nodeAfter] = textNode.splitText(startIndex, endIndex)\n  }\n\n  if (!transformer.replace) {\n    return null\n  }\n  const potentialTransformedNode = transformedNode\n    ? transformer.replace(transformedNode, match)\n    : undefined\n\n  return {\n    nodeAfter,\n    nodeBefore,\n    transformedNode: potentialTransformedNode || undefined,\n  }\n}\n"],"names":["findOutermostTextMatchTransformer","textNode_","textMatchTransformers","textNode","foundMatchStartIndex","undefined","foundMatchEndIndex","foundMatchTransformer","foundMatch","transformer","replace","importRegExp","match","getTextContent","startIndex","index","endIndex","getEndIndex","length","importFoundTextMatchTransformer","nodeAfter","nodeBefore","transformedNode","splitText","potentialTransformedNode"],"mappings":"AAEA;;;;;;CAMC,GAGD,OAAO,SAASA,kCACdC,SAAmB,EACnBC,qBAAkD;IAOlD,MAAMC,WAAWF;IAEjB,IAAIG,uBAA2CC;IAC/C,IAAIC,qBAAyCD;IAC7C,IAAIE,wBAA0DF;IAC9D,IAAIG,aAA2CH;IAE/C,KAAK,MAAMI,eAAeP,sBAAuB;QAC/C,IAAI,CAACO,YAAYC,OAAO,IAAI,CAACD,YAAYE,YAAY,EAAE;YACrD;QACF;QACA,MAAMC,QAAQT,SAASU,cAAc,GAAGD,KAAK,CAACH,YAAYE,YAAY;QAEtE,IAAI,CAACC,OAAO;YACV;QACF;QAEA,MAAME,aAAaF,MAAMG,KAAK,IAAI;QAClC,MAAMC,WAAWP,YAAYQ,WAAW,GACpCR,YAAYQ,WAAW,CAACd,UAAUS,SAClCE,aAAaF,KAAK,CAAC,EAAE,CAACM,MAAM;QAEhC,IAAIF,aAAa,OAAO;YACtB;QACF;QAEA,IACEZ,yBAAyBC,aACzBC,uBAAuBD,aACtBS,aAAaV,wBAAwBY,WAAWV,oBACjD;YACAF,uBAAuBU;YACvBR,qBAAqBU;YACrBT,wBAAwBE;YACxBD,aAAaI;QACf;IACF;IAEA,IACER,yBAAyBC,aACzBC,uBAAuBD,aACvBE,0BAA0BF,aAC1BG,eAAeH,WACf;QACA,OAAO;IACT;IAEA,OAAO;QACLW,UAAUV;QACVM,OAAOJ;QACPM,YAAYV;QACZK,aAAaF;IACf;AACF;AAEA,OAAO,SAASY,gCACdhB,QAAkB,EAClBW,UAAkB,EAClBE,QAAgB,EAChBP,WAAiC,EACjCG,KAAuB,EAES,WAAW;AACV,WAAW;;IAG5C,IAAIQ,WAAWC,YAAYC;IAE3B,IAAIR,eAAe,GAAG;QACnB,CAACQ,iBAAiBF,UAAU,GAAGjB,SAASoB,SAAS,CAACP;IACrD,OAAO;QACJ,CAACK,YAAYC,iBAAiBF,UAAU,GAAGjB,SAASoB,SAAS,CAACT,YAAYE;IAC7E;IAEA,IAAI,CAACP,YAAYC,OAAO,EAAE;QACxB,OAAO;IACT;IACA,MAAMc,2BAA2BF,kBAC7Bb,YAAYC,OAAO,CAACY,iBAAiBV,SACrCP;IAEJ,OAAO;QACLe;QACAC;QACAC,iBAAiBE,4BAA4BnB;IAC/C;AACF"}

package/dist/packages/@lexical/markdown/importTextTransformers.js

@@ -1,54 +1,60 @@
 import { $isTextNode } from 'lexical';
-import { findOutermostTextFormatTransformer, importTextFormatTransformer } from './importTextFormatTransformer.js';
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */ import { findOutermostTextFormatTransformer, importTextFormatTransformer } from './importTextFormatTransformer.js';
 import { findOutermostTextMatchTransformer, importFoundTextMatchTransformer } from './importTextMatchTransformer.js';
 /**
  * Handles applying both text format and text match transformers.
  * It finds the outermost text format or text match and applies it,
  * then recursively calls itself to apply the next outermost transformer,
  * until there are no more transformers to apply.
- */
-export function importTextTransformers(textNode, textFormatTransformersIndex, textMatchTransformers) {
-  let foundTextFormat = findOutermostTextFormatTransformer(textNode, textFormatTransformersIndex);
-  let foundTextMatch = findOutermostTextMatchTransformer(textNode, textMatchTransformers);
-  if (foundTextFormat && foundTextMatch) {
-    // Find the outermost transformer
-    if (foundTextFormat.startIndex <= foundTextMatch.startIndex && foundTextFormat.endIndex >= foundTextMatch.endIndex) {
-      // foundTextFormat wraps foundTextMatch - apply foundTextFormat by setting foundTextMatch to null
-      foundTextMatch = null;
-    } else {
-      // foundTextMatch wraps foundTextFormat - apply foundTextMatch by setting foundTextFormat to null
-      foundTextFormat = null;
-    }
-  }
-  if (foundTextFormat) {
-    const result = importTextFormatTransformer(textNode, foundTextFormat.startIndex, foundTextFormat.endIndex, foundTextFormat.transformer, foundTextFormat.match);
-    if (result.nodeAfter && $isTextNode(result.nodeAfter) && !result.nodeAfter.hasFormat('code')) {
-      importTextTransformers(result.nodeAfter, textFormatTransformersIndex, textMatchTransformers);
-    }
-    if (result.nodeBefore && $isTextNode(result.nodeBefore) && !result.nodeBefore.hasFormat('code')) {
-      importTextTransformers(result.nodeBefore, textFormatTransformersIndex, textMatchTransformers);
-    }
-    if (result.transformedNode && $isTextNode(result.transformedNode) && !result.transformedNode.hasFormat('code')) {
-      importTextTransformers(result.transformedNode, textFormatTransformersIndex, textMatchTransformers);
-    }
-  } else if (foundTextMatch) {
-    const result = importFoundTextMatchTransformer(textNode, foundTextMatch.startIndex, foundTextMatch.endIndex, foundTextMatch.transformer, foundTextMatch.match);
-    if (!result) {
-      return;
-    }
-    if (result.nodeAfter && $isTextNode(result.nodeAfter) && !result.nodeAfter.hasFormat('code')) {
-      importTextTransformers(result.nodeAfter, textFormatTransformersIndex, textMatchTransformers);
-    }
-    if (result.nodeBefore && $isTextNode(result.nodeBefore) && !result.nodeBefore.hasFormat('code')) {
-      importTextTransformers(result.nodeBefore, textFormatTransformersIndex, textMatchTransformers);
-    }
-    if (result.transformedNode && $isTextNode(result.transformedNode) && !result.transformedNode.hasFormat('code')) {
-      importTextTransformers(result.transformedNode, textFormatTransformersIndex, textMatchTransformers);
-    }
-  }
-  // Handle escape characters
-  const textContent = textNode.getTextContent();
-  const escapedText = textContent.replace(/\\([*_`~])/g, '$1');
-  textNode.setTextContent(escapedText);
+ */ export function importTextTransformers(textNode, textFormatTransformersIndex, textMatchTransformers) {
+    let foundTextFormat = findOutermostTextFormatTransformer(textNode, textFormatTransformersIndex);
+    let foundTextMatch = findOutermostTextMatchTransformer(textNode, textMatchTransformers);
+    if (foundTextFormat && foundTextMatch) {
+        // Find the outermost transformer
+        if (foundTextFormat.startIndex <= foundTextMatch.startIndex && foundTextFormat.endIndex >= foundTextMatch.endIndex) {
+            // foundTextFormat wraps foundTextMatch - apply foundTextFormat by setting foundTextMatch to null
+            foundTextMatch = null;
+        } else {
+            // foundTextMatch wraps foundTextFormat - apply foundTextMatch by setting foundTextFormat to null
+            foundTextFormat = null;
+        }
+    }
+    if (foundTextFormat) {
+        const result = importTextFormatTransformer(textNode, foundTextFormat.startIndex, foundTextFormat.endIndex, foundTextFormat.transformer, foundTextFormat.match);
+        if (result.nodeAfter && $isTextNode(result.nodeAfter) && !result.nodeAfter.hasFormat('code')) {
+            importTextTransformers(result.nodeAfter, textFormatTransformersIndex, textMatchTransformers);
+        }
+        if (result.nodeBefore && $isTextNode(result.nodeBefore) && !result.nodeBefore.hasFormat('code')) {
+            importTextTransformers(result.nodeBefore, textFormatTransformersIndex, textMatchTransformers);
+        }
+        if (result.transformedNode && $isTextNode(result.transformedNode) && !result.transformedNode.hasFormat('code')) {
+            importTextTransformers(result.transformedNode, textFormatTransformersIndex, textMatchTransformers);
+        }
+    } else if (foundTextMatch) {
+        const result = importFoundTextMatchTransformer(textNode, foundTextMatch.startIndex, foundTextMatch.endIndex, foundTextMatch.transformer, foundTextMatch.match);
+        if (!result) {
+            return;
+        }
+        if (result.nodeAfter && $isTextNode(result.nodeAfter) && !result.nodeAfter.hasFormat('code')) {
+            importTextTransformers(result.nodeAfter, textFormatTransformersIndex, textMatchTransformers);
+        }
+        if (result.nodeBefore && $isTextNode(result.nodeBefore) && !result.nodeBefore.hasFormat('code')) {
+            importTextTransformers(result.nodeBefore, textFormatTransformersIndex, textMatchTransformers);
+        }
+        if (result.transformedNode && $isTextNode(result.transformedNode) && !result.transformedNode.hasFormat('code')) {
+            importTextTransformers(result.transformedNode, textFormatTransformersIndex, textMatchTransformers);
+        }
+    }
+    // Handle escape characters
+    const textContent = textNode.getTextContent();
+    const escapedText = textContent.replace(/\\([*_`~])/g, '$1');
+    textNode.setTextContent(escapedText);
 }
+
 //# sourceMappingURL=importTextTransformers.js.map