@payloadcms/richtext-lexical 4.0.0-internal.38b7f1d → 4.0.0-internal.4c792ad

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

@@ -6,7 +6,7 @@
                                                       *
                                                       */import { $createListItemNode, $createListNode, $isListItemNode, $isListNode, ListItemNode, ListNode } from '@lexical/list';
 import { $createHeadingNode, $createQuoteNode, $isHeadingNode, $isQuoteNode, HeadingNode, QuoteNode } from '@lexical/rich-text';
-import { $createLineBreakNode } from 'lexical';
+import { $createLineBreakNode, $isLineBreakNode, $isTextNode, $setState, createState } from 'lexical';
 const EMPTY_OR_WHITESPACE_ONLY = /^[\t ]*$/;
 const ORDERED_LIST_REGEX = /^(\s*)(\d+)\.\s/;
 const UNORDERED_LIST_REGEX = /^(\s*)[-*+]\s/;
@@ -20,6 +20,84 @@ const TABLE_ROW_REG_EXP = /^\|(.+)\|\s?$/;
 const TABLE_ROW_DIVIDER_REG_EXP = /^(\| ?:?-*:? ?)+\|\s?$/;
 const TAG_START_REGEX = /^[ \t]*<[a-z_][\w-]*(?:\s[^<>]*)?\/?>/i;
 const TAG_END_REGEX = /^[ \t]*<\/[a-z_][\w-]*\s*>/i;
+/**
+ * Stores the original hard line break marker on a `LineBreakNode` so it can be
+ * preserved across a markdown import/export round trip instead of being
+ * collapsed into a soft line break.
+ *
+ * Note: unlike upstream Lexical (which sets `resetOnCopyNode: true`), that option
+ * does not exist in the `lexical` version pinned here (0.41.0), so it is omitted.
+ */
+export const hardLineBreakState = createState('mdHardLineBreak', {
+  parse: val => {
+    if (typeof val === 'string' && /^(\\| {2,})$/.test(val)) {
+      return val;
+    }
+    return '';
+  }
+});
+/**
+ * Detects a CommonMark hard line break marker at the end of a raw line.
+ *
+ * @returns a tuple of `[textWithoutMarker, marker]` when a marker is found, otherwise null.
+ */
+export function parseMarkdownHardLineBreak(line) {
+  if (line.endsWith('\\')) {
+    return [line.slice(0, -1), '\\'];
+  }
+  const spaces = line.match(/^(.*?\S)( {2,})$/);
+  return spaces ? [spaces[1], spaces[2]] : null;
+}
+function hasNonWhitespaceContentOnLine(children, endIndex) {
+  for (let i = endIndex - 1; i >= 0; i--) {
+    if ($isLineBreakNode(children[i])) {
+      return false;
+    }
+    if (/\S/.test(children[i].getTextContent())) {
+      return true;
+    }
+  }
+  return false;
+}
+/**
+ * Removes a trailing hard line break marker from the last text node of `previousNode`
+ * (if present) and returns the marker, so it can be carried onto a `LineBreakNode`.
+ */
+function $extractMarkdownHardLineBreakMarker(previousNode) {
+  const children = previousNode.getChildren();
+  const lastChildIndex = children.length - 1;
+  const lastChild = children[lastChildIndex];
+  if (!$isTextNode(lastChild)) {
+    return null;
+  }
+  const lastText = lastChild.getTextContent();
+  const hardLineBreak = parseMarkdownHardLineBreak(lastText);
+  if (hardLineBreak !== null) {
+    const [text, marker] = hardLineBreak;
+    lastChild.setTextContent(text);
+    return marker;
+  }
+  // Trailing whitespace may have been split into its own text node by inline
+  // transformers (e.g. after formatted or linked content). Only treat it as a
+  // hard break when there is preceding non-whitespace content on the same line.
+  if (/^ {2,}$/.test(lastText) && hasNonWhitespaceContentOnLine(children, lastChildIndex)) {
+    lastChild.setTextContent('');
+    return lastText;
+  }
+  return null;
+}
+/**
+ * Creates a `LineBreakNode` for a markdown line join, preserving any CommonMark
+ * hard line break marker found at the end of `previousNode` via node state.
+ */
+export function $createMarkdownLineBreakNode(previousNode) {
+  const lineBreakNode = $createLineBreakNode();
+  const hardLineBreak = $extractMarkdownHardLineBreakMarker(previousNode);
+  if (hardLineBreak !== null) {
+    $setState(lineBreakNode, hardLineBreakState, hardLineBreak);
+  }
+  return lineBreakNode;
+}
 const createBlockNode = createNode => {
   return (parentNode, children, match) => {
     const node = createNode(match);
@@ -130,7 +208,7 @@ export const QUOTE = {
     if (isImport) {
       const previousNode = parentNode.getPreviousSibling();
       if ($isQuoteNode(previousNode)) {
-        previousNode.splice(previousNode.getChildrenSize(), 0, [$createLineBreakNode(), ...children]);
+        previousNode.splice(previousNode.getChildrenSize(), 0, [$createMarkdownLineBreakNode(previousNode), ...children]);
         previousNode.select(0, 0);
         parentNode.remove();
         return;
@@ -225,6 +303,9 @@ export function normalizeMarkdown(input, shouldMergeAdjacentLines) {
   for (let i = 0; i < lines.length; i++) {
     const line = lines[i];
     const lastLine = sanitizedLines[sanitizedLines.length - 1];
+    // A hard line break marker on the current line only matters if another line follows it.
+    const hardLineBreak = i < lines.length - 1 ? parseMarkdownHardLineBreak(line) : null;
+    const lastLineHasHardLineBreak = lastLine !== undefined && parseMarkdownHardLineBreak(lastLine) !== null;
     // Code blocks of ```single line``` don't toggle the inCodeBlock flag
     if (CODE_SINGLE_LINE_REGEX.test(line)) {
       sanitizedLines.push(line);
@@ -257,10 +338,13 @@ export function normalizeMarkdown(input, shouldMergeAdjacentLines) {
     }
     // In markdown the concept of "empty paragraphs" does not exist.
     // Blocks must be separated by an empty line. Non-empty adjacent lines must be merged.
-    if (EMPTY_OR_WHITESPACE_ONLY.test(line) || EMPTY_OR_WHITESPACE_ONLY.test(lastLine) || !lastLine || HEADING_REGEX.test(lastLine) || HEADING_REGEX.test(line) || QUOTE_REGEX.test(line) || ORDERED_LIST_REGEX.test(line) || UNORDERED_LIST_REGEX.test(line) || CHECK_LIST_REGEX.test(line) || TABLE_ROW_REG_EXP.test(line) || TABLE_ROW_DIVIDER_REG_EXP.test(line) || !shouldMergeAdjacentLines || TAG_START_REGEX.test(line) || TAG_END_REGEX.test(line) || TAG_START_REGEX.test(lastLine) || TAG_END_REGEX.test(lastLine) || CODE_END_REGEX.test(lastLine)) {
+    if (EMPTY_OR_WHITESPACE_ONLY.test(line) || EMPTY_OR_WHITESPACE_ONLY.test(lastLine) || !lastLine || HEADING_REGEX.test(lastLine) || HEADING_REGEX.test(line) || QUOTE_REGEX.test(line) || ORDERED_LIST_REGEX.test(line) || UNORDERED_LIST_REGEX.test(line) || CHECK_LIST_REGEX.test(line) || TABLE_ROW_REG_EXP.test(line) || TABLE_ROW_DIVIDER_REG_EXP.test(line) ||
+    // Don't merge the next line into a line that ends with a hard line break marker.
+    lastLineHasHardLineBreak || !shouldMergeAdjacentLines || TAG_START_REGEX.test(line) || TAG_END_REGEX.test(line) || TAG_START_REGEX.test(lastLine) || TAG_END_REGEX.test(lastLine) || CODE_END_REGEX.test(lastLine)) {
       sanitizedLines.push(line);
     } else {
-      sanitizedLines[sanitizedLines.length - 1] = lastLine + ' ' + line.trim();
+      // Preserve a trailing hard line break marker on the merged line so it survives import.
+      sanitizedLines[sanitizedLines.length - 1] = lastLine + ' ' + (hardLineBreak === null ? line.trim() : line.trimStart());
     }
   }
   return sanitizedLines.join('\n');

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,"file":"MarkdownTransformers.js","names":["$createListItemNode","$createListNode","$isListItemNode","$isListNode","ListItemNode","ListNode","$createHeadingNode","$createQuoteNode","$isHeadingNode","$isQuoteNode","HeadingNode","QuoteNode","$createLineBreakNode","$isLineBreakNode","$isTextNode","$setState","createState","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","hardLineBreakState","parse","val","test","parseMarkdownHardLineBreak","line","endsWith","slice","spaces","match","hasNonWhitespaceContentOnLine","children","endIndex","i","getTextContent","$extractMarkdownHardLineBreakMarker","previousNode","getChildren","lastChildIndex","length","lastChild","lastText","hardLineBreak","text","marker","setTextContent","$createMarkdownLineBreakNode","lineBreakNode","createBlockNode","createNode","parentNode","node","append","replace","select","LIST_INDENT_SIZE","getIndent","whitespaces","tabs","indent","Math","floor","listReplace","listType","getPreviousSibling","nextNode","getNextSibling","listItem","undefined","getListType","firstChild","getFirstChild","insertBefore","remove","list","Number","setIndent","listExport","listNode","exportChildren","depth","output","index","listItemNode","getChildrenSize","push","repeat","prefix","getStart","getChecked","join","HEADING","type","dependencies","export","level","getTag","regExp","tag","QUOTE","lines","split","_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","lastLine","lastLineHasHardLineBreak","trim","trimStart"],"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 {\n  ElementNode,\n  Klass,\n  LexicalNode,\n  LineBreakNode,\n  TextFormatType,\n  TextNode,\n} 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 {\n  $createLineBreakNode,\n  $isLineBreakNode,\n  $isTextNode,\n  $setState,\n  createState,\n} 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\n/**\n * A CommonMark hard line break marker: either a single backslash (`\\`) or two or\n * more trailing spaces, both placed at the end of a line before the newline.\n * See https://spec.commonmark.org/0.31.2/#hard-line-breaks\n */\nexport type MarkdownHardLineBreak = string\n\n/**\n * Stores the original hard line break marker on a `LineBreakNode` so it can be\n * preserved across a markdown import/export round trip instead of being\n * collapsed into a soft line break.\n *\n * Note: unlike upstream Lexical (which sets `resetOnCopyNode: true`), that option\n * does not exist in the `lexical` version pinned here (0.41.0), so it is omitted.\n */\nexport const hardLineBreakState = createState('mdHardLineBreak', {\n  parse: (val): MarkdownHardLineBreak => {\n    if (typeof val === 'string' && /^(\\\\| {2,})$/.test(val)) {\n      return val\n    }\n    return ''\n  },\n})\n\n/**\n * Detects a CommonMark hard line break marker at the end of a raw line.\n *\n * @returns a tuple of `[textWithoutMarker, marker]` when a marker is found, otherwise null.\n */\nexport function parseMarkdownHardLineBreak(line: string): [string, MarkdownHardLineBreak] | null {\n  if (line.endsWith('\\\\')) {\n    return [line.slice(0, -1), '\\\\']\n  }\n\n  const spaces = line.match(/^(.*?\\S)( {2,})$/)\n  return spaces ? [spaces[1]!, spaces[2]!] : null\n}\n\nfunction hasNonWhitespaceContentOnLine(children: Array<LexicalNode>, endIndex: number): boolean {\n  for (let i = endIndex - 1; i >= 0; i--) {\n    if ($isLineBreakNode(children[i])) {\n      return false\n    }\n    if (/\\S/.test(children[i]!.getTextContent())) {\n      return true\n    }\n  }\n  return false\n}\n\n/**\n * Removes a trailing hard line break marker from the last text node of `previousNode`\n * (if present) and returns the marker, so it can be carried onto a `LineBreakNode`.\n */\nfunction $extractMarkdownHardLineBreakMarker(\n  previousNode: ElementNode,\n): MarkdownHardLineBreak | null {\n  const children = previousNode.getChildren()\n  const lastChildIndex = children.length - 1\n  const lastChild = children[lastChildIndex]\n\n  if (!$isTextNode(lastChild)) {\n    return null\n  }\n\n  const lastText = lastChild.getTextContent()\n  const hardLineBreak = parseMarkdownHardLineBreak(lastText)\n\n  if (hardLineBreak !== null) {\n    const [text, marker] = hardLineBreak\n    lastChild.setTextContent(text)\n    return marker\n  }\n\n  // Trailing whitespace may have been split into its own text node by inline\n  // transformers (e.g. after formatted or linked content). Only treat it as a\n  // hard break when there is preceding non-whitespace content on the same line.\n  if (/^ {2,}$/.test(lastText) && hasNonWhitespaceContentOnLine(children, lastChildIndex)) {\n    lastChild.setTextContent('')\n    return lastText\n  }\n\n  return null\n}\n\n/**\n * Creates a `LineBreakNode` for a markdown line join, preserving any CommonMark\n * hard line break marker found at the end of `previousNode` via node state.\n */\nexport function $createMarkdownLineBreakNode(previousNode: ElementNode): LineBreakNode {\n  const lineBreakNode = $createLineBreakNode()\n  const hardLineBreak = $extractMarkdownHardLineBreakMarker(previousNode)\n\n  if (hardLineBreak !== null) {\n    $setState(lineBreakNode, hardLineBreakState, hardLineBreak)\n  }\n\n  return lineBreakNode\n}\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          $createMarkdownLineBreakNode(previousNode),\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    // A hard line break marker on the current line only matters if another line follows it.\n    const hardLineBreak = i < lines.length - 1 ? parseMarkdownHardLineBreak(line) : null\n    const lastLineHasHardLineBreak =\n      lastLine !== undefined && parseMarkdownHardLineBreak(lastLine) !== null\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      // Don't merge the next line into a line that ends with a hard line break marker.\n      lastLineHasHardLineBreak ||\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      // Preserve a trailing hard line break marker on the merged line so it survives import.\n      sanitizedLines[sanitizedLines.length - 1] =\n        lastLine + ' ' + (hardLineBreak === null ? line.trim() : line.trimStart())\n    }\n  }\n\n  return sanitizedLines.join('\\n')\n}\n"],"mappings":"AAAA,sDACA;;;;;;wDAmBA,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,SACEC,oBAAoB,EACpBC,gBAAgB,EAChBC,WAAW,EACXC,SAAS,EACTC,WAAW,QACN;AA8JP,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;AAStB;;;;;;;;AAQA,OAAO,MAAMC,kBAAA,GAAqBd,WAAA,CAAY,mBAAmB;EAC/De,KAAA,EAAQC,GAAA;IACN,IAAI,OAAOA,GAAA,KAAQ,YAAY,eAAeC,IAAI,CAACD,GAAA,GAAM;MACvD,OAAOA,GAAA;IACT;IACA,OAAO;EACT;AACF;AAEA;;;;;AAKA,OAAO,SAASE,2BAA2BC,IAAY;EACrD,IAAIA,IAAA,CAAKC,QAAQ,CAAC,OAAO;IACvB,OAAO,CAACD,IAAA,CAAKE,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK;EAClC;EAEA,MAAMC,MAAA,GAASH,IAAA,CAAKI,KAAK,CAAC;EAC1B,OAAOD,MAAA,GAAS,CAACA,MAAM,CAAC,EAAE,EAAGA,MAAM,CAAC,EAAE,CAAE,GAAG;AAC7C;AAEA,SAASE,8BAA8BC,QAA4B,EAAEC,QAAgB;EACnF,KAAK,IAAIC,CAAA,GAAID,QAAA,GAAW,GAAGC,CAAA,IAAK,GAAGA,CAAA,IAAK;IACtC,IAAI9B,gBAAA,CAAiB4B,QAAQ,CAACE,CAAA,CAAE,GAAG;MACjC,OAAO;IACT;IACA,IAAI,KAAKV,IAAI,CAACQ,QAAQ,CAACE,CAAA,CAAE,CAAEC,cAAc,KAAK;MAC5C,OAAO;IACT;EACF;EACA,OAAO;AACT;AAEA;;;;AAIA,SAASC,oCACPC,YAAyB;EAEzB,MAAML,QAAA,GAAWK,YAAA,CAAaC,WAAW;EACzC,MAAMC,cAAA,GAAiBP,QAAA,CAASQ,MAAM,GAAG;EACzC,MAAMC,SAAA,GAAYT,QAAQ,CAACO,cAAA,CAAe;EAE1C,IAAI,CAAClC,WAAA,CAAYoC,SAAA,GAAY;IAC3B,OAAO;EACT;EAEA,MAAMC,QAAA,GAAWD,SAAA,CAAUN,cAAc;EACzC,MAAMQ,aAAA,GAAgBlB,0BAAA,CAA2BiB,QAAA;EAEjD,IAAIC,aAAA,KAAkB,MAAM;IAC1B,MAAM,CAACC,IAAA,EAAMC,MAAA,CAAO,GAAGF,aAAA;IACvBF,SAAA,CAAUK,cAAc,CAACF,IAAA;IACzB,OAAOC,MAAA;EACT;EAEA;EACA;EACA;EACA,IAAI,UAAUrB,IAAI,CAACkB,QAAA,KAAaX,6BAAA,CAA8BC,QAAA,EAAUO,cAAA,GAAiB;IACvFE,SAAA,CAAUK,cAAc,CAAC;IACzB,OAAOJ,QAAA;EACT;EAEA,OAAO;AACT;AAEA;;;;AAIA,OAAO,SAASK,6BAA6BV,YAAyB;EACpE,MAAMW,aAAA,GAAgB7C,oBAAA;EACtB,MAAMwC,aAAA,GAAgBP,mCAAA,CAAoCC,YAAA;EAE1D,IAAIM,aAAA,KAAkB,MAAM;IAC1BrC,SAAA,CAAU0C,aAAA,EAAe3B,kBAAA,EAAoBsB,aAAA;EAC/C;EAEA,OAAOK,aAAA;AACT;AAEA,MAAMC,eAAA,GACJC,UAAA;EAEA,OAAO,CAACC,UAAA,EAAYnB,QAAA,EAAUF,KAAA;IAC5B,MAAMsB,IAAA,GAAOF,UAAA,CAAWpB,KAAA;IACxBsB,IAAA,CAAKC,MAAM,IAAIrB,QAAA;IACfmB,UAAA,CAAWG,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,CAAY5B,KAAK,CAAC;EAC/B,MAAMD,MAAA,GAAS6B,WAAA,CAAY5B,KAAK,CAAC;EAEjC,IAAI8B,MAAA,GAAS;EAEb,IAAID,IAAA,EAAM;IACRC,MAAA,IAAUD,IAAA,CAAKnB,MAAM;EACvB;EAEA,IAAIX,MAAA,EAAQ;IACV+B,MAAA,IAAUC,IAAA,CAAKC,KAAK,CAACjC,MAAA,CAAOW,MAAM,GAAGgB,gBAAA;EACvC;EAEA,OAAOI,MAAA;AACT;AAEA,MAAMG,WAAA,GAAeC,QAAA;EACnB,OAAO,CAACb,UAAA,EAAYnB,QAAA,EAAUF,KAAA;IAC5B,MAAMO,YAAA,GAAec,UAAA,CAAWc,kBAAkB;IAClD,MAAMC,QAAA,GAAWf,UAAA,CAAWgB,cAAc;IAC1C,MAAMC,QAAA,GAAW7E,mBAAA,CAAoByE,QAAA,KAAa,UAAUlC,KAAK,CAAC,EAAE,KAAK,MAAMuC,SAAA;IAC/E,IAAI3E,WAAA,CAAYwE,QAAA,KAAaA,QAAA,CAASI,WAAW,OAAON,QAAA,EAAU;MAChE,MAAMO,UAAA,GAAaL,QAAA,CAASM,aAAa;MACzC,IAAID,UAAA,KAAe,MAAM;QACvBA,UAAA,CAAWE,YAAY,CAACL,QAAA;MAC1B,OAAO;QACL;QACAF,QAAA,CAASb,MAAM,CAACe,QAAA;MAClB;MACAjB,UAAA,CAAWuB,MAAM;IACnB,OAAO,IAAIhF,WAAA,CAAY2C,YAAA,KAAiBA,YAAA,CAAaiC,WAAW,OAAON,QAAA,EAAU;MAC/E3B,YAAA,CAAagB,MAAM,CAACe,QAAA;MACpBjB,UAAA,CAAWuB,MAAM;IACnB,OAAO;MACL,MAAMC,IAAA,GAAOnF,eAAA,CAAgBwE,QAAA,EAAUA,QAAA,KAAa,WAAWY,MAAA,CAAO9C,KAAK,CAAC,EAAE,IAAIuC,SAAA;MAClFM,IAAA,CAAKtB,MAAM,CAACe,QAAA;MACZjB,UAAA,CAAWG,OAAO,CAACqB,IAAA;IACrB;IACAP,QAAA,CAASf,MAAM,IAAIrB,QAAA;IACnBoC,QAAA,CAASb,MAAM,CAAC,GAAG;IACnB,MAAMK,MAAA,GAASH,SAAA,CAAU3B,KAAK,CAAC,EAAE;IACjC,IAAI8B,MAAA,EAAQ;MACVQ,QAAA,CAASS,SAAS,CAACjB,MAAA;IACrB;EACF;AACF;AAEA,MAAMkB,UAAA,GAAaA,CACjBC,QAAA,EACAC,cAAA,EACAC,KAAA;EAEA,MAAMC,MAAA,GAAmB,EAAE;EAC3B,MAAMlD,QAAA,GAAW+C,QAAA,CAASzC,WAAW;EACrC,IAAI6C,KAAA,GAAQ;EACZ,KAAK,MAAMC,YAAA,IAAgBpD,QAAA,EAAU;IACnC,IAAIvC,eAAA,CAAgB2F,YAAA,GAAe;MACjC,IAAIA,YAAA,CAAaC,eAAe,OAAO,GAAG;QACxC,MAAMd,UAAA,GAAaa,YAAA,CAAaZ,aAAa;QAC7C,IAAI9E,WAAA,CAAY6E,UAAA,GAAa;UAC3BW,MAAA,CAAOI,IAAI,CAACR,UAAA,CAAWP,UAAA,EAAYS,cAAA,EAAgBC,KAAA,GAAQ;UAC3D;QACF;MACF;MACA,MAAMrB,MAAA,GAAS,IAAI2B,MAAM,CAACN,KAAA,GAAQzB,gBAAA;MAClC,MAAMQ,QAAA,GAAWe,QAAA,CAAST,WAAW;MACrC,MAAMkB,MAAA,GACJxB,QAAA,KAAa,WACT,GAAGe,QAAA,CAASU,QAAQ,KAAKN,KAAA,IAAS,GAClCnB,QAAA,KAAa,UACX,MAAMoB,YAAA,CAAaM,UAAU,KAAK,MAAM,OAAO,GAC/C;MACRR,MAAA,CAAOI,IAAI,CAAC1B,MAAA,GAAS4B,MAAA,GAASR,cAAA,CAAeI,YAAA;MAC7CD,KAAA;IACF;EACF;EAEA,OAAOD,MAAA,CAAOS,IAAI,CAAC;AACrB;AAEA,OAAO,MAAMC,OAAA,GAA8B;EACzCC,IAAA,EAAM;EACNC,YAAA,EAAc,CAAC7F,WAAA,CAAY;EAC3B8F,MAAA,EAAQA,CAAC3C,IAAA,EAAM4B,cAAA;IACb,IAAI,CAACjF,cAAA,CAAeqD,IAAA,GAAO;MACzB,OAAO;IACT;IACA,MAAM4C,KAAA,GAAQpB,MAAA,CAAOxB,IAAA,CAAK6C,MAAM,GAAGrE,KAAK,CAAC;IACzC,OAAO,IAAI2D,MAAM,CAACS,KAAA,IAAS,MAAMhB,cAAA,CAAe5B,IAAA;EAClD;EACA8C,MAAA,EAAQtF,aAAA;EACR0C,OAAA,EAASL,eAAA,CAAiBnB,KAAA;IACxB,MAAMqE,GAAA,GAAO,MAAMrE,KAAK,CAAC,EAAE,CAAEU,MAAM;IACnC,OAAO3C,kBAAA,CAAmBsG,GAAA;EAC5B;AACF;AAEA,OAAO,MAAMC,KAAA,GAA4B;EACvCP,IAAA,EAAM;EACNC,YAAA,EAAc,CAAC5F,SAAA,CAAU;EACzB6F,MAAA,EAAQA,CAAC3C,IAAA,EAAM4B,cAAA;IACb,IAAI,CAAChF,YAAA,CAAaoD,IAAA,GAAO;MACvB,OAAO;IACT;IAEA,MAAMiD,KAAA,GAAQrB,cAAA,CAAe5B,IAAA,EAAMkD,KAAK,CAAC;IACzC,MAAMpB,MAAA,GAAmB,EAAE;IAC3B,KAAK,MAAMxD,IAAA,IAAQ2E,KAAA,EAAO;MACxBnB,MAAA,CAAOI,IAAI,CAAC,OAAO5D,IAAA;IACrB;IACA,OAAOwD,MAAA,CAAOS,IAAI,CAAC;EACrB;EACAO,MAAA,EAAQrF,WAAA;EACRyC,OAAA,EAASA,CAACH,UAAA,EAAYnB,QAAA,EAAUuE,MAAA,EAAQC,QAAA;IACtC,IAAIA,QAAA,EAAU;MACZ,MAAMnE,YAAA,GAAec,UAAA,CAAWc,kBAAkB;MAClD,IAAIjE,YAAA,CAAaqC,YAAA,GAAe;QAC9BA,YAAA,CAAaoE,MAAM,CAACpE,YAAA,CAAagD,eAAe,IAAI,GAAG,CACrDtC,4BAAA,CAA6BV,YAAA,G,GAC1BL,QAAA,CACJ;QACDK,YAAA,CAAakB,MAAM,CAAC,GAAG;QACvBJ,UAAA,CAAWuB,MAAM;QACjB;MACF;IACF;IAEA,MAAMtB,IAAA,GAAOtD,gBAAA;IACbsD,IAAA,CAAKC,MAAM,IAAIrB,QAAA;IACfmB,UAAA,CAAWG,OAAO,CAACF,IAAA;IACnBA,IAAA,CAAKG,MAAM,CAAC,GAAG;EACjB;AACF;AAEA,OAAO,MAAMmD,cAAA,GAAqC;EAChDb,IAAA,EAAM;EACNC,YAAA,EAAc,CAAClG,QAAA,EAAUD,YAAA,CAAa;EACtCoG,MAAA,EAAQA,CAAC3C,IAAA,EAAM4B,cAAA;IACb,OAAOtF,WAAA,CAAY0D,IAAA,IAAQ0B,UAAA,CAAW1B,IAAA,EAAM4B,cAAA,EAAgB,KAAK;EACnE;EACAkB,MAAA,EAAQxF,oBAAA;EACR4C,OAAA,EAASS,WAAA,CAAY;AACvB;AAEA,OAAO,MAAM4C,UAAA,GAAiC;EAC5Cd,IAAA,EAAM;EACNC,YAAA,EAAc,CAAClG,QAAA,EAAUD,YAAA,CAAa;EACtCoG,MAAA,EAAQA,CAAC3C,IAAA,EAAM4B,cAAA;IACb,OAAOtF,WAAA,CAAY0D,IAAA,IAAQ0B,UAAA,CAAW1B,IAAA,EAAM4B,cAAA,EAAgB,KAAK;EACnE;EACAkB,MAAA,EAAQvF,gBAAA;EACR2C,OAAA,EAASS,WAAA,CAAY;AACvB;AAEA,OAAO,MAAM6C,YAAA,GAAmC;EAC9Cf,IAAA,EAAM;EACNC,YAAA,EAAc,CAAClG,QAAA,EAAUD,YAAA,CAAa;EACtCoG,MAAA,EAAQA,CAAC3C,IAAA,EAAM4B,cAAA;IACb,OAAOtF,WAAA,CAAY0D,IAAA,IAAQ0B,UAAA,CAAW1B,IAAA,EAAM4B,cAAA,EAAgB,KAAK;EACnE;EACAkB,MAAA,EAAQzF,kBAAA;EACR6C,OAAA,EAASS,WAAA,CAAY;AACvB;AAEA,OAAO,MAAM8C,WAAA,GAAqC;EAChDhB,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,OAAO;EAChBX,GAAA,EAAK;AACP;AAEA,OAAO,MAAMY,SAAA,GAAmC;EAC9ClB,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,YAAY;EACrBX,GAAA,EAAK;AACP;AAEA,OAAO,MAAMa,gBAAA,GAA0C;EACrDnB,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,QAAQ,SAAS;EAC1BX,GAAA,EAAK;AACP;AAEA,OAAO,MAAMc,sBAAA,GAAgD;EAC3DpB,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,QAAQ,SAAS;EAC1BI,SAAA,EAAW;EACXf,GAAA,EAAK;AACP;AAEA,OAAO,MAAMgB,SAAA,GAAmC;EAC9CtB,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,OAAO;EAChBX,GAAA,EAAK;AACP;AAEA,OAAO,MAAMiB,eAAA,GAAyC;EACpDvB,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,OAAO;EAChBI,SAAA,EAAW;EACXf,GAAA,EAAK;AACP;AAEA,OAAO,MAAMkB,aAAA,GAAuC;EAClDxB,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,gBAAgB;EACzBX,GAAA,EAAK;AACP;AAEA,OAAO,MAAMmB,WAAA,GAAqC;EAChDzB,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,SAAS;EAClBX,GAAA,EAAK;AACP;AAEA,OAAO,MAAMoB,iBAAA,GAA2C;EACtD1B,IAAA,EAAM;EACNiB,MAAA,EAAQ,CAAC,SAAS;EAClBI,SAAA,EAAW;EACXf,GAAA,EAAK;AACP;AAEA,OAAO,SAASqB,kBAAkBC,KAAa,EAAEC,wBAAiC;EAChF,MAAMrB,KAAA,GAAQoB,KAAA,CAAMnB,KAAK,CAAC;EAC1B,IAAIqB,WAAA,GAAc;EAClB,MAAMC,cAAA,GAA2B,EAAE;EACnC,IAAIC,mBAAA,GAAsB;EAE1B,KAAK,IAAI3F,CAAA,GAAI,GAAGA,CAAA,GAAImE,KAAA,CAAM7D,MAAM,EAAEN,CAAA,IAAK;IACrC,MAAMR,IAAA,GAAO2E,KAAK,CAACnE,CAAA,CAAE;IACrB,MAAM4F,QAAA,GAAWF,cAAc,CAACA,cAAA,CAAepF,MAAM,GAAG,EAAE;IAC1D;IACA,MAAMG,aAAA,GAAgBT,CAAA,GAAImE,KAAA,CAAM7D,MAAM,GAAG,IAAIf,0BAAA,CAA2BC,IAAA,IAAQ;IAChF,MAAMqG,wBAAA,GACJD,QAAA,KAAazD,SAAA,IAAa5C,0BAAA,CAA2BqG,QAAA,MAAc;IAErE;IACA,IAAI9G,sBAAA,CAAuBQ,IAAI,CAACE,IAAA,GAAO;MACrCkG,cAAA,CAAetC,IAAI,CAAC5D,IAAA;MACpB;IACF;IAEA,IAAIX,cAAA,CAAeS,IAAI,CAACE,IAAA,GAAO;MAC7B,IAAImG,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,CAAetC,IAAI,CAAC5D,IAAA;MACpB;IACF;IAEA;IACA,IAAIZ,gBAAA,CAAiBU,IAAI,CAACE,IAAA,GAAO;MAC/BiG,WAAA,GAAc;MACdE,mBAAA;MACAD,cAAA,CAAetC,IAAI,CAAC5D,IAAA;MACpB;IACF;IAEA;IACA,IAAIiG,WAAA,EAAa;MACfC,cAAA,CAAetC,IAAI,CAAC5D,IAAA;MACpB;IACF;IAEA;IACA;IACA,IACElB,wBAAA,CAAyBgB,IAAI,CAACE,IAAA,KAC9BlB,wBAAA,CAAyBgB,IAAI,CAACsG,QAAA,KAC9B,CAACA,QAAA,IACDlH,aAAA,CAAcY,IAAI,CAACsG,QAAA,KACnBlH,aAAA,CAAcY,IAAI,CAACE,IAAA,KACnBb,WAAA,CAAYW,IAAI,CAACE,IAAA,KACjBjB,kBAAA,CAAmBe,IAAI,CAACE,IAAA,KACxBhB,oBAAA,CAAqBc,IAAI,CAACE,IAAA,KAC1Bf,gBAAA,CAAiBa,IAAI,CAACE,IAAA,KACtBT,iBAAA,CAAkBO,IAAI,CAACE,IAAA,KACvBR,yBAAA,CAA0BM,IAAI,CAACE,IAAA;IAC/B;IACAqG,wBAAA,IACA,CAACL,wBAAA,IACDvG,eAAA,CAAgBK,IAAI,CAACE,IAAA,KACrBN,aAAA,CAAcI,IAAI,CAACE,IAAA,KACnBP,eAAA,CAAgBK,IAAI,CAACsG,QAAA,KACrB1G,aAAA,CAAcI,IAAI,CAACsG,QAAA,KACnB/G,cAAA,CAAeS,IAAI,CAACsG,QAAA,GACpB;MACAF,cAAA,CAAetC,IAAI,CAAC5D,IAAA;IACtB,OAAO;MACL;MACAkG,cAAc,CAACA,cAAA,CAAepF,MAAM,GAAG,EAAE,GACvCsF,QAAA,GAAW,OAAOnF,aAAA,KAAkB,OAAOjB,IAAA,CAAKsG,IAAI,KAAKtG,IAAA,CAAKuG,SAAS,EAAC;IAC5E;EACF;EAEA,OAAOL,cAAA,CAAejC,IAAI,CAAC;AAC7B","ignoreList":[]}

package/dist/populateGraphQL/populateLexicalPopulationPromises.d.ts

@@ -1,7 +1,7 @@
 import type { SerializedEditorState } from 'lexical';
 import type { RichTextAdapter } from 'payload';
 import type { PopulationPromise } from '../features/typesServer.js';
-import type { AdapterProps } from '../types.js';
+import type { AdapterProps } from '../types/index.js';
 export type Args = {
     editorPopulationPromises: Map<string, Array<PopulationPromise>>;
     parentIsLocalized: boolean;

package/dist/populateGraphQL/populateLexicalPopulationPromises.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"populateLexicalPopulationPromises.d.ts","sourceRoot":"","sources":["../../src/populateGraphQL/populateLexicalPopulationPromises.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,SAAS,CAAA;AACpD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,SAAS,CAAA;AAE9C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAA;AACnE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AAI/C,MAAM,MAAM,IAAI,GAAG;IACjB,wBAAwB,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAA;IAC/D,iBAAiB,EAAE,OAAO,CAAA;CAC3B,GAAG,UAAU,CACZ,WAAW,CAAC,eAAe,CAAC,qBAAqB,EAAE,YAAY,CAAC,CAAC,2BAA2B,CAAC,CAAC,CAC/F,CAAC,CAAC,CAAC,CAAA;AAEJ;;GAEG;AACH,eAAO,MAAM,iCAAiC,iNAgB3C,IAAI,SAoCN,CAAA"}
+{"version":3,"file":"populateLexicalPopulationPromises.d.ts","sourceRoot":"","sources":["../../src/populateGraphQL/populateLexicalPopulationPromises.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,SAAS,CAAA;AACpD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,SAAS,CAAA;AAE9C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAA;AACnE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AAIrD,MAAM,MAAM,IAAI,GAAG;IACjB,wBAAwB,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAA;IAC/D,iBAAiB,EAAE,OAAO,CAAA;CAC3B,GAAG,UAAU,CACZ,WAAW,CAAC,eAAe,CAAC,qBAAqB,EAAE,YAAY,CAAC,CAAC,2BAA2B,CAAC,CAAC,CAC/F,CAAC,CAAC,CAAC,CAAA;AAEJ;;GAEG;AACH,eAAO,MAAM,iCAAiC,GAAI,8MAgB/C,IAAI,SAoCN,CAAA"}

package/dist/populateGraphQL/populateLexicalPopulationPromises.js.map

@@ -1 +1 @@
-{"version":3,"file":"populateLexicalPopulationPromises.js","names":["recurseNodes","populateLexicalPopulationPromises","context","currentDepth","depth","draft","editorPopulationPromises","field","fieldPromises","findMany","flattenLocales","overrideAccess","parentIsLocalized","populationPromises","req","showHiddenFields","siblingDoc","shouldPopulate","callback","node","editorPopulationPromisesOfNodeType","get","type","promise","nodes","name","root","children"],"sources":["../../src/populateGraphQL/populateLexicalPopulationPromises.ts"],"sourcesContent":["import type { SerializedEditorState } from 'lexical'\nimport type { RichTextAdapter } from 'payload'\n\nimport type { PopulationPromise } from '../features/typesServer.js'\nimport type { AdapterProps } from '../types.js'\n\nimport { recurseNodes } from '../utilities/forEachNodeRecursively.js'\n\nexport type Args = {\n  editorPopulationPromises: Map<string, Array<PopulationPromise>>\n  parentIsLocalized: boolean\n} & Parameters<\n  NonNullable<RichTextAdapter<SerializedEditorState, AdapterProps>['graphQLPopulationPromises']>\n>[0]\n\n/**\n * Appends all new populationPromises to the populationPromises prop\n */\nexport const populateLexicalPopulationPromises = ({\n  context,\n  currentDepth,\n  depth,\n  draft,\n  editorPopulationPromises,\n  field,\n  fieldPromises,\n  findMany,\n  flattenLocales,\n  overrideAccess,\n  parentIsLocalized,\n  populationPromises,\n  req,\n  showHiddenFields,\n  siblingDoc,\n}: Args) => {\n  const shouldPopulate = depth && currentDepth! <= depth\n\n  if (!shouldPopulate) {\n    return\n  }\n\n  recurseNodes({\n    callback: (node) => {\n      const editorPopulationPromisesOfNodeType = editorPopulationPromises?.get(node.type)\n      if (editorPopulationPromisesOfNodeType) {\n        for (const promise of editorPopulationPromisesOfNodeType) {\n          promise({\n            context,\n            currentDepth: currentDepth!,\n            depth,\n            draft,\n            editorPopulationPromises,\n            field,\n            fieldPromises,\n            findMany,\n            flattenLocales,\n            node,\n            overrideAccess: overrideAccess!,\n            parentIsLocalized,\n            populationPromises,\n            req,\n            showHiddenFields,\n            siblingDoc,\n          })\n        }\n      }\n    },\n\n    nodes: (siblingDoc[field?.name] as SerializedEditorState)?.root?.children ?? [],\n  })\n}\n"],"mappings":"AAMA,SAASA,YAAY,QAAQ;AAS7B;;;AAGA,OAAO,MAAMC,iCAAA,GAAoCA,CAAC;EAChDC,OAAO;EACPC,YAAY;EACZC,KAAK;EACLC,KAAK;EACLC,wBAAwB;EACxBC,KAAK;EACLC,aAAa;EACbC,QAAQ;EACRC,cAAc;EACdC,cAAc;EACdC,iBAAiB;EACjBC,kBAAkB;EAClBC,GAAG;EACHC,gBAAgB;EAChBC;AAAU,CACL;EACL,MAAMC,cAAA,GAAiBb,KAAA,IAASD,YAAA,IAAiBC,KAAA;EAEjD,IAAI,CAACa,cAAA,EAAgB;IACnB;EACF;EAEAjB,YAAA,CAAa;IACXkB,QAAA,EAAWC,IAAA;MACT,MAAMC,kCAAA,GAAqCd,wBAAA,EAA0Be,GAAA,CAAIF,IAAA,CAAKG,IAAI;MAClF,IAAIF,kCAAA,EAAoC;QACtC,KAAK,MAAMG,OAAA,IAAWH,kCAAA,EAAoC;UACxDG,OAAA,CAAQ;YACNrB,OAAA;YACAC,YAAA,EAAcA,YAAA;YACdC,KAAA;YACAC,KAAA;YACAC,wBAAA;YACAC,KAAA;YACAC,aAAA;YACAC,QAAA;YACAC,cAAA;YACAS,IAAA;YACAR,cAAA,EAAgBA,cAAA;YAChBC,iBAAA;YACAC,kBAAA;YACAC,GAAA;YACAC,gBAAA;YACAC;UACF;QACF;MACF;IACF;IAEAQ,KAAA,EAAOR,UAAW,CAACT,KAAA,EAAOkB,IAAA,CAAK,EAA4BC,IAAA,EAAMC,QAAA,IAAY;EAC/E;AACF","ignoreList":[]}
+{"version":3,"file":"populateLexicalPopulationPromises.js","names":["recurseNodes","populateLexicalPopulationPromises","context","currentDepth","depth","draft","editorPopulationPromises","field","fieldPromises","findMany","flattenLocales","overrideAccess","parentIsLocalized","populationPromises","req","showHiddenFields","siblingDoc","shouldPopulate","callback","node","editorPopulationPromisesOfNodeType","get","type","promise","nodes","name","root","children"],"sources":["../../src/populateGraphQL/populateLexicalPopulationPromises.ts"],"sourcesContent":["import type { SerializedEditorState } from 'lexical'\nimport type { RichTextAdapter } from 'payload'\n\nimport type { PopulationPromise } from '../features/typesServer.js'\nimport type { AdapterProps } from '../types/index.js'\n\nimport { recurseNodes } from '../utilities/forEachNodeRecursively.js'\n\nexport type Args = {\n  editorPopulationPromises: Map<string, Array<PopulationPromise>>\n  parentIsLocalized: boolean\n} & Parameters<\n  NonNullable<RichTextAdapter<SerializedEditorState, AdapterProps>['graphQLPopulationPromises']>\n>[0]\n\n/**\n * Appends all new populationPromises to the populationPromises prop\n */\nexport const populateLexicalPopulationPromises = ({\n  context,\n  currentDepth,\n  depth,\n  draft,\n  editorPopulationPromises,\n  field,\n  fieldPromises,\n  findMany,\n  flattenLocales,\n  overrideAccess,\n  parentIsLocalized,\n  populationPromises,\n  req,\n  showHiddenFields,\n  siblingDoc,\n}: Args) => {\n  const shouldPopulate = depth && currentDepth! <= depth\n\n  if (!shouldPopulate) {\n    return\n  }\n\n  recurseNodes({\n    callback: (node) => {\n      const editorPopulationPromisesOfNodeType = editorPopulationPromises?.get(node.type)\n      if (editorPopulationPromisesOfNodeType) {\n        for (const promise of editorPopulationPromisesOfNodeType) {\n          promise({\n            context,\n            currentDepth: currentDepth!,\n            depth,\n            draft,\n            editorPopulationPromises,\n            field,\n            fieldPromises,\n            findMany,\n            flattenLocales,\n            node,\n            overrideAccess: overrideAccess!,\n            parentIsLocalized,\n            populationPromises,\n            req,\n            showHiddenFields,\n            siblingDoc,\n          })\n        }\n      }\n    },\n\n    nodes: (siblingDoc[field?.name] as SerializedEditorState)?.root?.children ?? [],\n  })\n}\n"],"mappings":"AAMA,SAASA,YAAY,QAAQ;AAS7B;;;AAGA,OAAO,MAAMC,iCAAA,GAAoCA,CAAC;EAChDC,OAAO;EACPC,YAAY;EACZC,KAAK;EACLC,KAAK;EACLC,wBAAwB;EACxBC,KAAK;EACLC,aAAa;EACbC,QAAQ;EACRC,cAAc;EACdC,cAAc;EACdC,iBAAiB;EACjBC,kBAAkB;EAClBC,GAAG;EACHC,gBAAgB;EAChBC;AAAU,CACL;EACL,MAAMC,cAAA,GAAiBb,KAAA,IAASD,YAAA,IAAiBC,KAAA;EAEjD,IAAI,CAACa,cAAA,EAAgB;IACnB;EACF;EAEAjB,YAAA,CAAa;IACXkB,QAAA,EAAWC,IAAA;MACT,MAAMC,kCAAA,GAAqCd,wBAAA,EAA0Be,GAAA,CAAIF,IAAA,CAAKG,IAAI;MAClF,IAAIF,kCAAA,EAAoC;QACtC,KAAK,MAAMG,OAAA,IAAWH,kCAAA,EAAoC;UACxDG,OAAA,CAAQ;YACNrB,OAAA;YACAC,YAAA,EAAcA,YAAA;YACdC,KAAA;YACAC,KAAA;YACAC,wBAAA;YACAC,KAAA;YACAC,aAAA;YACAC,QAAA;YACAC,cAAA;YACAS,IAAA;YACAR,cAAA,EAAgBA,cAAA;YAChBC,iBAAA;YACAC,kBAAA;YACAC,GAAA;YACAC,gBAAA;YACAC;UACF;QACF;MACF;IACF;IAEAQ,KAAA,EAAOR,UAAW,CAACT,KAAA,EAAOkB,IAAA,CAAK,EAA4BC,IAAA,EAAMC,QAAA,IAAY;EAC/E;AACF","ignoreList":[]}

package/dist/populateGraphQL/recursivelyPopulateFieldsForGraphQL.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"recursivelyPopulateFieldsForGraphQL.d.ts","sourceRoot":"","sources":["../../src/populateGraphQL/recursivelyPopulateFieldsForGraphQL.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,SAAS,CAAA;AAIhF,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAA;AAEnE,KAAK,wBAAwB,GAAG;IAC9B,OAAO,EAAE,cAAc,CAAA;IACvB,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,IAAI,EAAE,OAAO,CAAA;IACb,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,EAAE,OAAO,CAAA;IACd;;OAEG;IACH,wBAAwB,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAA;IAC/D;;OAEG;IACH,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAA;IAC9B,MAAM,EAAE,KAAK,EAAE,CAAA;IACf,QAAQ,EAAE,OAAO,CAAA;IACjB,cAAc,EAAE,OAAO,CAAA;IACvB,cAAc,EAAE,OAAO,CAAA;IACvB,iBAAiB,EAAE,OAAO,CAAA;IAC1B,kBAAkB,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAA;IACnC,GAAG,EAAE,cAAc,CAAA;IACnB,gBAAgB,EAAE,OAAO,CAAA;IACzB,UAAU,EAAE,UAAU,CAAA;CACvB,CAAA;AAED,eAAO,MAAM,mCAAmC,8LAgB7C,wBAAwB,KAAG,IA0B7B,CAAA"}
+{"version":3,"file":"recursivelyPopulateFieldsForGraphQL.d.ts","sourceRoot":"","sources":["../../src/populateGraphQL/recursivelyPopulateFieldsForGraphQL.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,SAAS,CAAA;AAIhF,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAA;AAEnE,KAAK,wBAAwB,GAAG;IAC9B,OAAO,EAAE,cAAc,CAAA;IACvB,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,IAAI,EAAE,OAAO,CAAA;IACb,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,EAAE,OAAO,CAAA;IACd;;OAEG;IACH,wBAAwB,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAA;IAC/D;;OAEG;IACH,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAA;IAC9B,MAAM,EAAE,KAAK,EAAE,CAAA;IACf,QAAQ,EAAE,OAAO,CAAA;IACjB,cAAc,EAAE,OAAO,CAAA;IACvB,cAAc,EAAE,OAAO,CAAA;IACvB,iBAAiB,EAAE,OAAO,CAAA;IAC1B,kBAAkB,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAA;IACnC,GAAG,EAAE,cAAc,CAAA;IACnB,gBAAgB,EAAE,OAAO,CAAA;IACzB,UAAU,EAAE,UAAU,CAAA;CACvB,CAAA;AAED,eAAO,MAAM,mCAAmC,GAAI,2LAgBjD,wBAAwB,KAAG,IA0B7B,CAAA"}

package/dist/types/builtInNodes.d.ts

@@ -0,0 +1,14 @@
+import type { JSONSchemaFn } from '../features/typesServer.js';
+/**
+ * Cross-cutting Lexical types shared by every element node. Inlined into
+ * `payload-types.ts`. Must stay byte-for-byte in sync with the runtime twins
+ * in `types/nodeTypes.ts` (`LexicalElementFormat`, `LexicalElementDirection`,
+ * `SerializedLexicalElementBase`) — cross-module assignability depends on it.
+ */
+export declare const CORE_LEXICAL_TYPE_STRING = "/** @internal Core Lexical types \u2014 see @payloadcms/richtext-lexical. */\nexport type LexicalElementFormat = 'left' | 'start' | 'center' | 'right' | 'end' | 'justify' | '';\nexport type LexicalElementDirection = ('ltr' | 'rtl') | null;\n\nexport interface SerializedLexicalElementBase<TChildren> {\n  children: TChildren[];\n  direction: LexicalElementDirection;\n  format: LexicalElementFormat;\n  indent: number;\n  textFormat?: number;\n  textStyle?: string;\n  version: number;\n}";
+export declare const textNodeJSONSchema: JSONSchemaFn;
+export declare const tabNodeJSONSchema: JSONSchemaFn;
+export declare const lineBreakNodeJSONSchema: JSONSchemaFn;
+export declare const paragraphNodeJSONSchema: JSONSchemaFn;
+export declare const rootNodeJSONSchema: JSONSchemaFn;
+//# sourceMappingURL=builtInNodes.d.ts.map

package/dist/types/builtInNodes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"builtInNodes.d.ts","sourceRoot":"","sources":["../../src/types/builtInNodes.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAA;AAI9D;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,6eAYnC,CAAA;AA4DF,eAAO,MAAM,kBAAkB,EAAE,YAkBhC,CAAA;AAED,eAAO,MAAM,iBAAiB,EAAE,YAoB/B,CAAA;AAED,eAAO,MAAM,uBAAuB,EAAE,YAYrC,CAAA;AAED,eAAO,MAAM,uBAAuB,EAAE,YAerC,CAAA;AAeD,eAAO,MAAM,kBAAkB,EAAE,YAoBhC,CAAA"}

package/dist/types/builtInNodes.js

@@ -0,0 +1,203 @@
+import { withNullableJSONSchemaType } from 'payload';
+import { versionSchema } from './jsonSchemaHelpers.js';
+/**
+ * Cross-cutting Lexical types shared by every element node. Inlined into
+ * `payload-types.ts`. Must stay byte-for-byte in sync with the runtime twins
+ * in `types/nodeTypes.ts` (`LexicalElementFormat`, `LexicalElementDirection`,
+ * `SerializedLexicalElementBase`) — cross-module assignability depends on it.
+ */
+export const CORE_LEXICAL_TYPE_STRING = `/** @internal Core Lexical types — see @payloadcms/richtext-lexical. */
+export type LexicalElementFormat = 'left' | 'start' | 'center' | 'right' | 'end' | 'justify' | '';
+export type LexicalElementDirection = ('ltr' | 'rtl') | null;
+
+export interface SerializedLexicalElementBase<TChildren> {
+  children: TChildren[];
+  direction: LexicalElementDirection;
+  format: LexicalElementFormat;
+  indent: number;
+  textFormat?: number;
+  textStyle?: string;
+  version: number;
+}`;
+/**
+ * Built-in Lexical node schemas (always present regardless of feature config).
+ * Co-located with the TS source they reference — each `JSONSchemaFn` adds
+ * its helper interface(s) to `typeStringDefinitions` and returns the JSON
+ * schema for that node.
+ */ /** MUST stay byte-for-byte in sync with `LexicalTextMode` in `types/nodeTypes.ts`. */
+const LEXICAL_TEXT_MODE_TS = `export type LexicalTextMode = 'normal' | 'token' | 'segmented';`;
+/** MUST stay byte-for-byte in sync with `SerializedTextNode` in `types/nodeTypes.ts`. */
+const SERIALIZED_TEXT_NODE_TS = `export interface SerializedTextNode {
+  type: 'text';
+  detail: number;
+  format: number;
+  mode: LexicalTextMode;
+  style: string;
+  text: string;
+  version: number;
+}`;
+/** MUST stay byte-for-byte in sync with `SerializedTabNode` in `types/nodeTypes.ts`. */
+const SERIALIZED_TAB_NODE_TS = `export interface SerializedTabNode {
+  type: 'tab';
+  detail: number;
+  format: number;
+  mode: LexicalTextMode;
+  style: string;
+  text: string;
+  version: number;
+}`;
+/** MUST stay byte-for-byte in sync with `SerializedLineBreakNode` in `types/nodeTypes.ts`. */
+const SERIALIZED_LINE_BREAK_NODE_TS = `export interface SerializedLineBreakNode {
+  type: 'linebreak';
+  version: number;
+}`;
+/** MUST stay byte-for-byte in sync with `SerializedParagraphNode` in `types/nodeTypes.ts`. */
+const SERIALIZED_PARAGRAPH_NODE_TS = `export interface SerializedParagraphNode<TChildren> extends SerializedLexicalElementBase<TChildren> {
+  type: 'paragraph';
+  textFormat: number;
+  textStyle: string;
+}`;
+const textModeSchema = {
+  type: 'string',
+  enum: ['normal', 'token', 'segmented'],
+  tsType: 'LexicalTextMode'
+};
+/** Text-node `format` bitmask (Lexical text-format flags). */
+const textFormatSchema = {
+  type: 'integer',
+  description: 'Active text formats as a bitmask, OR-ed together (0 = none): bold=1, italic=2, strikethrough=4, underline=8, code=16, subscript=32, superscript=64, highlight=128, lowercase=256, uppercase=512. e.g. bold + italic = 3.'
+};
+export const textNodeJSONSchema = ({
+  typeStringDefinitions
+}) => {
+  typeStringDefinitions.add(LEXICAL_TEXT_MODE_TS);
+  typeStringDefinitions.add(SERIALIZED_TEXT_NODE_TS);
+  return {
+    type: 'object',
+    additionalProperties: false,
+    properties: {
+      type: {
+        type: 'string',
+        const: 'text'
+      },
+      detail: {
+        type: 'integer'
+      },
+      format: textFormatSchema,
+      mode: textModeSchema,
+      style: {
+        type: 'string'
+      },
+      text: {
+        type: 'string'
+      },
+      version: versionSchema
+    },
+    required: ['detail', 'format', 'mode', 'style', 'text', 'type', 'version'],
+    tsType: 'SerializedTextNode'
+  };
+};
+export const tabNodeJSONSchema = ({
+  typeStringDefinitions
+}) => {
+  typeStringDefinitions.add(LEXICAL_TEXT_MODE_TS);
+  typeStringDefinitions.add(SERIALIZED_TAB_NODE_TS);
+  return {
+    type: 'object',
+    additionalProperties: false,
+    properties: {
+      type: {
+        type: 'string',
+        const: 'tab'
+      },
+      // A tab node is fully fixed: Lexical marks it unmergeable (`detail` = IS_UNMERGEABLE = 2) and
+      // its text is a single tab. Any other `detail` makes `TabNode.setDetail` throw on load.
+      detail: {
+        const: 2,
+        description: 'Always 2 (Lexical IS_UNMERGEABLE); other values throw.'
+      },
+      format: textFormatSchema,
+      mode: textModeSchema,
+      style: {
+        type: 'string'
+      },
+      text: {
+        const: '\t',
+        description: 'Always a single tab character.'
+      },
+      version: versionSchema
+    },
+    required: ['detail', 'format', 'mode', 'style', 'text', 'type', 'version'],
+    tsType: 'SerializedTabNode'
+  };
+};
+export const lineBreakNodeJSONSchema = ({
+  typeStringDefinitions
+}) => {
+  typeStringDefinitions.add(SERIALIZED_LINE_BREAK_NODE_TS);
+  return {
+    type: 'object',
+    additionalProperties: false,
+    properties: {
+      type: {
+        type: 'string',
+        const: 'linebreak'
+      },
+      version: versionSchema
+    },
+    required: ['type', 'version'],
+    tsType: 'SerializedLineBreakNode'
+  };
+};
+export const paragraphNodeJSONSchema = ({
+  elementNodeSchema,
+  nodeUnionName,
+  typeStringDefinitions
+}) => {
+  typeStringDefinitions.add(SERIALIZED_PARAGRAPH_NODE_TS);
+  return elementNodeSchema({
+    nodeType: 'paragraph',
+    properties: {
+      textFormat: {
+        type: 'integer'
+      },
+      textStyle: {
+        type: 'string'
+      }
+    },
+    required: ['textFormat', 'textStyle'],
+    tsType: `SerializedParagraphNode<${nodeUnionName}>`
+  });
+};
+/** MUST stay byte-for-byte in sync with `LexicalRichText` in `types/nodeTypes.ts`. */
+const ROOT_NODE_TS = `/** Shape of a Lexical \`richText\` field. */
+export interface LexicalRichText<TNode> {
+  root: {
+    children: TNode[];
+    direction: LexicalElementDirection;
+    format: LexicalElementFormat;
+    indent: number;
+    type: 'root';
+    version: number;
+  };
+}`;
+export const rootNodeJSONSchema = ({
+  elementNodeSchema,
+  field,
+  nodeUnionName,
+  typeStringDefinitions
+}) => {
+  typeStringDefinitions.add(ROOT_NODE_TS);
+  return {
+    type: withNullableJSONSchemaType('object', !!field.required),
+    additionalProperties: false,
+    properties: {
+      root: elementNodeSchema({
+        nodeType: 'root'
+      })
+    },
+    required: ['root'],
+    tsType: field.required ? `LexicalRichText<${nodeUnionName}>` : `LexicalRichText<${nodeUnionName}> | null`
+  };
+};
+//# sourceMappingURL=builtInNodes.js.map

package/dist/types/builtInNodes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"builtInNodes.js","names":["withNullableJSONSchemaType","versionSchema","CORE_LEXICAL_TYPE_STRING","LEXICAL_TEXT_MODE_TS","SERIALIZED_TEXT_NODE_TS","SERIALIZED_TAB_NODE_TS","SERIALIZED_LINE_BREAK_NODE_TS","SERIALIZED_PARAGRAPH_NODE_TS","textModeSchema","type","enum","tsType","textFormatSchema","description","textNodeJSONSchema","typeStringDefinitions","add","additionalProperties","properties","const","detail","format","mode","style","text","version","required","tabNodeJSONSchema","lineBreakNodeJSONSchema","paragraphNodeJSONSchema","elementNodeSchema","nodeUnionName","nodeType","textFormat","textStyle","ROOT_NODE_TS","rootNodeJSONSchema","field","root"],"sources":["../../src/types/builtInNodes.ts"],"sourcesContent":["import type { JSONSchema4 } from 'json-schema'\n\nimport { withNullableJSONSchemaType } from 'payload'\n\nimport type { JSONSchemaFn } from '../features/typesServer.js'\n\nimport { versionSchema } from './jsonSchemaHelpers.js'\n\n/**\n * Cross-cutting Lexical types shared by every element node. Inlined into\n * `payload-types.ts`. Must stay byte-for-byte in sync with the runtime twins\n * in `types/nodeTypes.ts` (`LexicalElementFormat`, `LexicalElementDirection`,\n * `SerializedLexicalElementBase`) — cross-module assignability depends on it.\n */\nexport const CORE_LEXICAL_TYPE_STRING = `/** @internal Core Lexical types — see @payloadcms/richtext-lexical. */\nexport type LexicalElementFormat = 'left' | 'start' | 'center' | 'right' | 'end' | 'justify' | '';\nexport type LexicalElementDirection = ('ltr' | 'rtl') | null;\n\nexport interface SerializedLexicalElementBase<TChildren> {\n  children: TChildren[];\n  direction: LexicalElementDirection;\n  format: LexicalElementFormat;\n  indent: number;\n  textFormat?: number;\n  textStyle?: string;\n  version: number;\n}`\n\n/**\n * Built-in Lexical node schemas (always present regardless of feature config).\n * Co-located with the TS source they reference — each `JSONSchemaFn` adds\n * its helper interface(s) to `typeStringDefinitions` and returns the JSON\n * schema for that node.\n */\n\n/** MUST stay byte-for-byte in sync with `LexicalTextMode` in `types/nodeTypes.ts`. */\nconst LEXICAL_TEXT_MODE_TS = `export type LexicalTextMode = 'normal' | 'token' | 'segmented';`\n\n/** MUST stay byte-for-byte in sync with `SerializedTextNode` in `types/nodeTypes.ts`. */\nconst SERIALIZED_TEXT_NODE_TS = `export interface SerializedTextNode {\n  type: 'text';\n  detail: number;\n  format: number;\n  mode: LexicalTextMode;\n  style: string;\n  text: string;\n  version: number;\n}`\n\n/** MUST stay byte-for-byte in sync with `SerializedTabNode` in `types/nodeTypes.ts`. */\nconst SERIALIZED_TAB_NODE_TS = `export interface SerializedTabNode {\n  type: 'tab';\n  detail: number;\n  format: number;\n  mode: LexicalTextMode;\n  style: string;\n  text: string;\n  version: number;\n}`\n\n/** MUST stay byte-for-byte in sync with `SerializedLineBreakNode` in `types/nodeTypes.ts`. */\nconst SERIALIZED_LINE_BREAK_NODE_TS = `export interface SerializedLineBreakNode {\n  type: 'linebreak';\n  version: number;\n}`\n\n/** MUST stay byte-for-byte in sync with `SerializedParagraphNode` in `types/nodeTypes.ts`. */\nconst SERIALIZED_PARAGRAPH_NODE_TS = `export interface SerializedParagraphNode<TChildren> extends SerializedLexicalElementBase<TChildren> {\n  type: 'paragraph';\n  textFormat: number;\n  textStyle: string;\n}`\n\nconst textModeSchema: JSONSchema4 = {\n  type: 'string',\n  enum: ['normal', 'token', 'segmented'],\n  tsType: 'LexicalTextMode',\n}\n\n/** Text-node `format` bitmask (Lexical text-format flags). */\nconst textFormatSchema: JSONSchema4 = {\n  type: 'integer',\n  description:\n    'Active text formats as a bitmask, OR-ed together (0 = none): bold=1, italic=2, strikethrough=4, underline=8, code=16, subscript=32, superscript=64, highlight=128, lowercase=256, uppercase=512. e.g. bold + italic = 3.',\n}\n\nexport const textNodeJSONSchema: JSONSchemaFn = ({ typeStringDefinitions }) => {\n  typeStringDefinitions.add(LEXICAL_TEXT_MODE_TS)\n  typeStringDefinitions.add(SERIALIZED_TEXT_NODE_TS)\n  return {\n    type: 'object',\n    additionalProperties: false,\n    properties: {\n      type: { type: 'string', const: 'text' },\n      detail: { type: 'integer' },\n      format: textFormatSchema,\n      mode: textModeSchema,\n      style: { type: 'string' },\n      text: { type: 'string' },\n      version: versionSchema,\n    },\n    required: ['detail', 'format', 'mode', 'style', 'text', 'type', 'version'],\n    tsType: 'SerializedTextNode',\n  }\n}\n\nexport const tabNodeJSONSchema: JSONSchemaFn = ({ typeStringDefinitions }) => {\n  typeStringDefinitions.add(LEXICAL_TEXT_MODE_TS)\n  typeStringDefinitions.add(SERIALIZED_TAB_NODE_TS)\n  return {\n    type: 'object',\n    additionalProperties: false,\n    properties: {\n      type: { type: 'string', const: 'tab' },\n      // A tab node is fully fixed: Lexical marks it unmergeable (`detail` = IS_UNMERGEABLE = 2) and\n      // its text is a single tab. Any other `detail` makes `TabNode.setDetail` throw on load.\n      detail: { const: 2, description: 'Always 2 (Lexical IS_UNMERGEABLE); other values throw.' },\n      format: textFormatSchema,\n      mode: textModeSchema,\n      style: { type: 'string' },\n      text: { const: '\\t', description: 'Always a single tab character.' },\n      version: versionSchema,\n    },\n    required: ['detail', 'format', 'mode', 'style', 'text', 'type', 'version'],\n    tsType: 'SerializedTabNode',\n  }\n}\n\nexport const lineBreakNodeJSONSchema: JSONSchemaFn = ({ typeStringDefinitions }) => {\n  typeStringDefinitions.add(SERIALIZED_LINE_BREAK_NODE_TS)\n  return {\n    type: 'object',\n    additionalProperties: false,\n    properties: {\n      type: { type: 'string', const: 'linebreak' },\n      version: versionSchema,\n    },\n    required: ['type', 'version'],\n    tsType: 'SerializedLineBreakNode',\n  }\n}\n\nexport const paragraphNodeJSONSchema: JSONSchemaFn = ({\n  elementNodeSchema,\n  nodeUnionName,\n  typeStringDefinitions,\n}) => {\n  typeStringDefinitions.add(SERIALIZED_PARAGRAPH_NODE_TS)\n  return elementNodeSchema({\n    nodeType: 'paragraph',\n    properties: {\n      textFormat: { type: 'integer' },\n      textStyle: { type: 'string' },\n    },\n    required: ['textFormat', 'textStyle'],\n    tsType: `SerializedParagraphNode<${nodeUnionName}>`,\n  })\n}\n\n/** MUST stay byte-for-byte in sync with `LexicalRichText` in `types/nodeTypes.ts`. */\nconst ROOT_NODE_TS = `/** Shape of a Lexical \\`richText\\` field. */\nexport interface LexicalRichText<TNode> {\n  root: {\n    children: TNode[];\n    direction: LexicalElementDirection;\n    format: LexicalElementFormat;\n    indent: number;\n    type: 'root';\n    version: number;\n  };\n}`\n\nexport const rootNodeJSONSchema: JSONSchemaFn = ({\n  elementNodeSchema,\n  field,\n  nodeUnionName,\n  typeStringDefinitions,\n}) => {\n  typeStringDefinitions.add(ROOT_NODE_TS)\n  return {\n    type: withNullableJSONSchemaType('object', !!field.required),\n    additionalProperties: false,\n    properties: {\n      root: elementNodeSchema({\n        nodeType: 'root',\n      }),\n    },\n    required: ['root'],\n    tsType: field.required\n      ? `LexicalRichText<${nodeUnionName}>`\n      : `LexicalRichText<${nodeUnionName}> | null`,\n  }\n}\n"],"mappings":"AAEA,SAASA,0BAA0B,QAAQ;AAI3C,SAASC,aAAa,QAAQ;AAE9B;;;;;;AAMA,OAAO,MAAMC,wBAAA,GAA2B;;;;;;;;;;;;EAYtC;AAEF;;;;;GAAA,CAOA;AACA,MAAMC,oBAAA,GAAuB,iEAAiE;AAE9F;AACA,MAAMC,uBAAA,GAA0B;;;;;;;;EAQ9B;AAEF;AACA,MAAMC,sBAAA,GAAyB;;;;;;;;EAQ7B;AAEF;AACA,MAAMC,6BAAA,GAAgC;;;EAGpC;AAEF;AACA,MAAMC,4BAAA,GAA+B;;;;EAInC;AAEF,MAAMC,cAAA,GAA8B;EAClCC,IAAA,EAAM;EACNC,IAAA,EAAM,CAAC,UAAU,SAAS,YAAY;EACtCC,MAAA,EAAQ;AACV;AAEA;AACA,MAAMC,gBAAA,GAAgC;EACpCH,IAAA,EAAM;EACNI,WAAA,EACE;AACJ;AAEA,OAAO,MAAMC,kBAAA,GAAmCA,CAAC;EAAEC;AAAqB,CAAE;EACxEA,qBAAA,CAAsBC,GAAG,CAACb,oBAAA;EAC1BY,qBAAA,CAAsBC,GAAG,CAACZ,uBAAA;EAC1B,OAAO;IACLK,IAAA,EAAM;IACNQ,oBAAA,EAAsB;IACtBC,UAAA,EAAY;MACVT,IAAA,EAAM;QAAEA,IAAA,EAAM;QAAUU,KAAA,EAAO;MAAO;MACtCC,MAAA,EAAQ;QAAEX,IAAA,EAAM;MAAU;MAC1BY,MAAA,EAAQT,gBAAA;MACRU,IAAA,EAAMd,cAAA;MACNe,KAAA,EAAO;QAAEd,IAAA,EAAM;MAAS;MACxBe,IAAA,EAAM;QAAEf,IAAA,EAAM;MAAS;MACvBgB,OAAA,EAASxB;IACX;IACAyB,QAAA,EAAU,CAAC,UAAU,UAAU,QAAQ,SAAS,QAAQ,QAAQ,UAAU;IAC1Ef,MAAA,EAAQ;EACV;AACF;AAEA,OAAO,MAAMgB,iBAAA,GAAkCA,CAAC;EAAEZ;AAAqB,CAAE;EACvEA,qBAAA,CAAsBC,GAAG,CAACb,oBAAA;EAC1BY,qBAAA,CAAsBC,GAAG,CAACX,sBAAA;EAC1B,OAAO;IACLI,IAAA,EAAM;IACNQ,oBAAA,EAAsB;IACtBC,UAAA,EAAY;MACVT,IAAA,EAAM;QAAEA,IAAA,EAAM;QAAUU,KAAA,EAAO;MAAM;MACrC;MACA;MACAC,MAAA,EAAQ;QAAED,KAAA,EAAO;QAAGN,WAAA,EAAa;MAAyD;MAC1FQ,MAAA,EAAQT,gBAAA;MACRU,IAAA,EAAMd,cAAA;MACNe,KAAA,EAAO;QAAEd,IAAA,EAAM;MAAS;MACxBe,IAAA,EAAM;QAAEL,KAAA,EAAO;QAAMN,WAAA,EAAa;MAAiC;MACnEY,OAAA,EAASxB;IACX;IACAyB,QAAA,EAAU,CAAC,UAAU,UAAU,QAAQ,SAAS,QAAQ,QAAQ,UAAU;IAC1Ef,MAAA,EAAQ;EACV;AACF;AAEA,OAAO,MAAMiB,uBAAA,GAAwCA,CAAC;EAAEb;AAAqB,CAAE;EAC7EA,qBAAA,CAAsBC,GAAG,CAACV,6BAAA;EAC1B,OAAO;IACLG,IAAA,EAAM;IACNQ,oBAAA,EAAsB;IACtBC,UAAA,EAAY;MACVT,IAAA,EAAM;QAAEA,IAAA,EAAM;QAAUU,KAAA,EAAO;MAAY;MAC3CM,OAAA,EAASxB;IACX;IACAyB,QAAA,EAAU,CAAC,QAAQ,UAAU;IAC7Bf,MAAA,EAAQ;EACV;AACF;AAEA,OAAO,MAAMkB,uBAAA,GAAwCA,CAAC;EACpDC,iBAAiB;EACjBC,aAAa;EACbhB;AAAqB,CACtB;EACCA,qBAAA,CAAsBC,GAAG,CAACT,4BAAA;EAC1B,OAAOuB,iBAAA,CAAkB;IACvBE,QAAA,EAAU;IACVd,UAAA,EAAY;MACVe,UAAA,EAAY;QAAExB,IAAA,EAAM;MAAU;MAC9ByB,SAAA,EAAW;QAAEzB,IAAA,EAAM;MAAS;IAC9B;IACAiB,QAAA,EAAU,CAAC,cAAc,YAAY;IACrCf,MAAA,EAAQ,2BAA2BoB,aAAA;EACrC;AACF;AAEA;AACA,MAAMI,YAAA,GAAe;;;;;;;;;;EAUnB;AAEF,OAAO,MAAMC,kBAAA,GAAmCA,CAAC;EAC/CN,iBAAiB;EACjBO,KAAK;EACLN,aAAa;EACbhB;AAAqB,CACtB;EACCA,qBAAA,CAAsBC,GAAG,CAACmB,YAAA;EAC1B,OAAO;IACL1B,IAAA,EAAMT,0BAAA,CAA2B,UAAU,CAAC,CAACqC,KAAA,CAAMX,QAAQ;IAC3DT,oBAAA,EAAsB;IACtBC,UAAA,EAAY;MACVoB,IAAA,EAAMR,iBAAA,CAAkB;QACtBE,QAAA,EAAU;MACZ;IACF;IACAN,QAAA,EAAU,CAAC,OAAO;IAClBf,MAAA,EAAQ0B,KAAA,CAAMX,QAAQ,GAClB,mBAAmBK,aAAA,GAAgB,GACnC,mBAAmBA,aAAA;EACzB;AACF","ignoreList":[]}