@webiny/lexical-nodes 0.0.0-unstable.06b2ede40f

package/utils/listNode.d.ts

@@ -0,0 +1,21 @@
+import type { LexicalNode, Spread } from "lexical";
+import type { ListNode } from "../ListNode";
+import type { ListItemNode } from "../ListItemNode";
+export declare function $getListDepth(listNode: ListNode): number;
+export declare function $getTopListNode(listItem: LexicalNode): ListNode;
+export declare function $getAllListItems(node: ListNode): Array<ListItemNode>;
+declare const NestedListNodeBrand: unique symbol;
+/**
+ * Checks to see if the passed node is a ListItemNode and has a ListNode as a child.
+ * @param node - The node to be checked.
+ * @returns true if the node is a ListItemNode and has a ListNode child, false otherwise.
+ */
+export declare function isNestedListNode(node: LexicalNode | null | undefined): node is Spread<{
+    getFirstChild(): ListNode;
+    [NestedListNodeBrand]: never;
+}, ListItemNode>;
+export declare function findNearestListItemNode(node: LexicalNode): ListItemNode | null;
+export declare function getUniqueListItemNodes(nodeList: Array<LexicalNode>): Array<ListItemNode>;
+export declare function $removeHighestEmptyListParent(sublist: ListItemNode | ListNode): void;
+export declare function wrapInListItem(node: LexicalNode): ListItemNode;
+export {};

package/utils/listNode.js

@@ -0,0 +1,103 @@
+import { $isListNode } from "../ListNode";
+import { $createListItemNode, $isListItemNode } from "../ListItemNode";
+export function $getListDepth(listNode) {
+  let depth = 1;
+  let parent = listNode.getParent();
+  while (parent !== null) {
+    if ($isListItemNode(parent)) {
+      const parentList = parent.getParent();
+      if ($isListNode(parentList)) {
+        depth++;
+        parent = parentList?.getParent() || null;
+        continue;
+      }
+      console.log("A WebinyListItemNode must have a WebinyListNode for a parent.");
+    }
+    return depth;
+  }
+  return depth;
+}
+export function $getTopListNode(listItem) {
+  let list = listItem.getParent();
+  if (!$isListNode(list)) {
+    console.log("A WebinyListItemNode must have a ListNode for a parent.");
+    return listItem;
+  }
+  let parent = list;
+  while (parent !== null) {
+    parent = parent.getParent();
+    if ($isListNode(parent)) {
+      list = parent;
+    }
+  }
+  return list;
+}
+export function $getAllListItems(node) {
+  let listItemNodes = [];
+  const listChildren = node.getChildren().filter($isListItemNode);
+  for (let i = 0; i < listChildren.length; i++) {
+    const listItemNode = listChildren[i];
+    const firstChild = listItemNode?.getFirstChild();
+    if ($isListNode(firstChild)) {
+      listItemNodes = listItemNodes.concat($getAllListItems(firstChild));
+    } else {
+      listItemNodes.push(listItemNode);
+    }
+  }
+  return listItemNodes;
+}
+const NestedListNodeBrand = Symbol.for("@lexical/NestedListNodeBrand");
+
+/**
+ * Checks to see if the passed node is a ListItemNode and has a ListNode as a child.
+ * @param node - The node to be checked.
+ * @returns true if the node is a ListItemNode and has a ListNode child, false otherwise.
+ */
+export function isNestedListNode(node) {
+  return $isListItemNode(node) && $isListNode(node.getFirstChild());
+}
+
+// TODO: rewrite with $findMatchingParent or *nodeOfType
+export function findNearestListItemNode(node) {
+  let currentNode = node;
+  while (currentNode !== null) {
+    if ($isListItemNode(currentNode)) {
+      return currentNode;
+    }
+    currentNode = currentNode.getParent();
+  }
+  return null;
+}
+export function getUniqueListItemNodes(nodeList) {
+  const keys = new Set();
+  for (let i = 0; i < nodeList.length; i++) {
+    const node = nodeList[i];
+    if ($isListItemNode(node)) {
+      keys.add(node);
+    }
+  }
+  return Array.from(keys);
+}
+export function $removeHighestEmptyListParent(sublist) {
+  // Nodes may be repeatedly indented, to create deeply nested lists that each
+  // contain just one bullet.
+  // Our goal is to remove these (empty) deeply nested lists. The easiest
+  // way to do that is crawl back up the tree until we find a node that has siblings
+  // (e.g. is actually part of the list contents) and delete that, or delete
+  // the root of the list (if no list nodes have siblings.)
+  let emptyListPtr = sublist;
+  while (emptyListPtr.getNextSibling() == null && emptyListPtr.getPreviousSibling() == null) {
+    const parent = emptyListPtr.getParent();
+    if (parent == null || !($isListItemNode(emptyListPtr) || $isListNode(emptyListPtr))) {
+      break;
+    }
+    emptyListPtr = parent;
+  }
+  emptyListPtr.remove();
+}
+export function wrapInListItem(node) {
+  const listItemWrapper = $createListItemNode();
+  return listItemWrapper.append(node);
+}
+
+//# sourceMappingURL=listNode.js.map

package/utils/listNode.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["$isListNode","$createListItemNode","$isListItemNode","$getListDepth","listNode","depth","parent","getParent","parentList","console","log","$getTopListNode","listItem","list","$getAllListItems","node","listItemNodes","listChildren","getChildren","filter","i","length","listItemNode","firstChild","getFirstChild","concat","push","NestedListNodeBrand","Symbol","for","isNestedListNode","findNearestListItemNode","currentNode","getUniqueListItemNodes","nodeList","keys","Set","add","Array","from","$removeHighestEmptyListParent","sublist","emptyListPtr","getNextSibling","getPreviousSibling","remove","wrapInListItem","listItemWrapper","append"],"sources":["listNode.ts"],"sourcesContent":["import type { LexicalNode, Spread } from \"lexical\";\n\nimport type { ListNode } from \"~/ListNode\";\nimport { $isListNode } from \"~/ListNode\";\nimport type { ListItemNode } from \"~/ListItemNode\";\nimport { $createListItemNode, $isListItemNode } from \"~/ListItemNode\";\n\nexport function $getListDepth(listNode: ListNode): number {\n    let depth = 1;\n    let parent = listNode.getParent();\n\n    while (parent !== null) {\n        if ($isListItemNode(parent)) {\n            const parentList = parent.getParent();\n\n            if ($isListNode(parentList)) {\n                depth++;\n                parent = parentList?.getParent() || null;\n                continue;\n            }\n            console.log(\"A WebinyListItemNode must have a WebinyListNode for a parent.\");\n        }\n\n        return depth;\n    }\n\n    return depth;\n}\n\nexport function $getTopListNode(listItem: LexicalNode): ListNode {\n    let list = listItem.getParent<ListNode>();\n\n    if (!$isListNode(list)) {\n        console.log(\"A WebinyListItemNode must have a ListNode for a parent.\");\n        return listItem as ListNode;\n    }\n\n    let parent: ListNode | null = list;\n\n    while (parent !== null) {\n        parent = parent.getParent();\n\n        if ($isListNode(parent)) {\n            list = parent;\n        }\n    }\n\n    return list;\n}\n\nexport function $getAllListItems(node: ListNode): Array<ListItemNode> {\n    let listItemNodes: Array<ListItemNode> = [];\n    const listChildren: Array<ListItemNode> = node.getChildren().filter($isListItemNode);\n\n    for (let i = 0; i < listChildren.length; i++) {\n        const listItemNode = listChildren[i];\n        const firstChild = listItemNode?.getFirstChild();\n\n        if ($isListNode(firstChild)) {\n            listItemNodes = listItemNodes.concat($getAllListItems(firstChild));\n        } else {\n            listItemNodes.push(listItemNode);\n        }\n    }\n\n    return listItemNodes;\n}\n\nconst NestedListNodeBrand: unique symbol = Symbol.for(\"@lexical/NestedListNodeBrand\");\n\n/**\n * Checks to see if the passed node is a ListItemNode and has a ListNode as a child.\n * @param node - The node to be checked.\n * @returns true if the node is a ListItemNode and has a ListNode child, false otherwise.\n */\nexport function isNestedListNode(\n    node: LexicalNode | null | undefined\n): node is Spread<{ getFirstChild(): ListNode; [NestedListNodeBrand]: never }, ListItemNode> {\n    return $isListItemNode(node) && $isListNode(node.getFirstChild());\n}\n\n// TODO: rewrite with $findMatchingParent or *nodeOfType\nexport function findNearestListItemNode(node: LexicalNode): ListItemNode | null {\n    let currentNode: LexicalNode | null = node;\n\n    while (currentNode !== null) {\n        if ($isListItemNode(currentNode)) {\n            return currentNode;\n        }\n        currentNode = currentNode.getParent();\n    }\n\n    return null;\n}\n\nexport function getUniqueListItemNodes(nodeList: Array<LexicalNode>): Array<ListItemNode> {\n    const keys = new Set<ListItemNode>();\n\n    for (let i = 0; i < nodeList.length; i++) {\n        const node = nodeList[i];\n\n        if ($isListItemNode(node)) {\n            keys.add(node);\n        }\n    }\n\n    return Array.from(keys);\n}\n\nexport function $removeHighestEmptyListParent(sublist: ListItemNode | ListNode) {\n    // Nodes may be repeatedly indented, to create deeply nested lists that each\n    // contain just one bullet.\n    // Our goal is to remove these (empty) deeply nested lists. The easiest\n    // way to do that is crawl back up the tree until we find a node that has siblings\n    // (e.g. is actually part of the list contents) and delete that, or delete\n    // the root of the list (if no list nodes have siblings.)\n    let emptyListPtr = sublist;\n\n    while (emptyListPtr.getNextSibling() == null && emptyListPtr.getPreviousSibling() == null) {\n        const parent = emptyListPtr.getParent<ListItemNode | ListNode>();\n\n        if (parent == null || !($isListItemNode(emptyListPtr) || $isListNode(emptyListPtr))) {\n            break;\n        }\n\n        emptyListPtr = parent;\n    }\n\n    emptyListPtr.remove();\n}\n\nexport function wrapInListItem(node: LexicalNode): ListItemNode {\n    const listItemWrapper = $createListItemNode();\n    return listItemWrapper.append(node);\n}\n"],"mappings":"AAGA,SAASA,WAAW;AAEpB,SAASC,mBAAmB,EAAEC,eAAe;AAE7C,OAAO,SAASC,aAAaA,CAACC,QAAkB,EAAU;EACtD,IAAIC,KAAK,GAAG,CAAC;EACb,IAAIC,MAAM,GAAGF,QAAQ,CAACG,SAAS,CAAC,CAAC;EAEjC,OAAOD,MAAM,KAAK,IAAI,EAAE;IACpB,IAAIJ,eAAe,CAACI,MAAM,CAAC,EAAE;MACzB,MAAME,UAAU,GAAGF,MAAM,CAACC,SAAS,CAAC,CAAC;MAErC,IAAIP,WAAW,CAACQ,UAAU,CAAC,EAAE;QACzBH,KAAK,EAAE;QACPC,MAAM,GAAGE,UAAU,EAAED,SAAS,CAAC,CAAC,IAAI,IAAI;QACxC;MACJ;MACAE,OAAO,CAACC,GAAG,CAAC,+DAA+D,CAAC;IAChF;IAEA,OAAOL,KAAK;EAChB;EAEA,OAAOA,KAAK;AAChB;AAEA,OAAO,SAASM,eAAeA,CAACC,QAAqB,EAAY;EAC7D,IAAIC,IAAI,GAAGD,QAAQ,CAACL,SAAS,CAAW,CAAC;EAEzC,IAAI,CAACP,WAAW,CAACa,IAAI,CAAC,EAAE;IACpBJ,OAAO,CAACC,GAAG,CAAC,yDAAyD,CAAC;IACtE,OAAOE,QAAQ;EACnB;EAEA,IAAIN,MAAuB,GAAGO,IAAI;EAElC,OAAOP,MAAM,KAAK,IAAI,EAAE;IACpBA,MAAM,GAAGA,MAAM,CAACC,SAAS,CAAC,CAAC;IAE3B,IAAIP,WAAW,CAACM,MAAM,CAAC,EAAE;MACrBO,IAAI,GAAGP,MAAM;IACjB;EACJ;EAEA,OAAOO,IAAI;AACf;AAEA,OAAO,SAASC,gBAAgBA,CAACC,IAAc,EAAuB;EAClE,IAAIC,aAAkC,GAAG,EAAE;EAC3C,MAAMC,YAAiC,GAAGF,IAAI,CAACG,WAAW,CAAC,CAAC,CAACC,MAAM,CAACjB,eAAe,CAAC;EAEpF,KAAK,IAAIkB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGH,YAAY,CAACI,MAAM,EAAED,CAAC,EAAE,EAAE;IAC1C,MAAME,YAAY,GAAGL,YAAY,CAACG,CAAC,CAAC;IACpC,MAAMG,UAAU,GAAGD,YAAY,EAAEE,aAAa,CAAC,CAAC;IAEhD,IAAIxB,WAAW,CAACuB,UAAU,CAAC,EAAE;MACzBP,aAAa,GAAGA,aAAa,CAACS,MAAM,CAACX,gBAAgB,CAACS,UAAU,CAAC,CAAC;IACtE,CAAC,MAAM;MACHP,aAAa,CAACU,IAAI,CAACJ,YAAY,CAAC;IACpC;EACJ;EAEA,OAAON,aAAa;AACxB;AAEA,MAAMW,mBAAkC,GAAGC,MAAM,CAACC,GAAG,CAAC,8BAA8B,CAAC;;AAErF;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,gBAAgBA,CAC5Bf,IAAoC,EACqD;EACzF,OAAOb,eAAe,CAACa,IAAI,CAAC,IAAIf,WAAW,CAACe,IAAI,CAACS,aAAa,CAAC,CAAC,CAAC;AACrE;;AAEA;AACA,OAAO,SAASO,uBAAuBA,CAAChB,IAAiB,EAAuB;EAC5E,IAAIiB,WAA+B,GAAGjB,IAAI;EAE1C,OAAOiB,WAAW,KAAK,IAAI,EAAE;IACzB,IAAI9B,eAAe,CAAC8B,WAAW,CAAC,EAAE;MAC9B,OAAOA,WAAW;IACtB;IACAA,WAAW,GAAGA,WAAW,CAACzB,SAAS,CAAC,CAAC;EACzC;EAEA,OAAO,IAAI;AACf;AAEA,OAAO,SAAS0B,sBAAsBA,CAACC,QAA4B,EAAuB;EACtF,MAAMC,IAAI,GAAG,IAAIC,GAAG,CAAe,CAAC;EAEpC,KAAK,IAAIhB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGc,QAAQ,CAACb,MAAM,EAAED,CAAC,EAAE,EAAE;IACtC,MAAML,IAAI,GAAGmB,QAAQ,CAACd,CAAC,CAAC;IAExB,IAAIlB,eAAe,CAACa,IAAI,CAAC,EAAE;MACvBoB,IAAI,CAACE,GAAG,CAACtB,IAAI,CAAC;IAClB;EACJ;EAEA,OAAOuB,KAAK,CAACC,IAAI,CAACJ,IAAI,CAAC;AAC3B;AAEA,OAAO,SAASK,6BAA6BA,CAACC,OAAgC,EAAE;EAC5E;EACA;EACA;EACA;EACA;EACA;EACA,IAAIC,YAAY,GAAGD,OAAO;EAE1B,OAAOC,YAAY,CAACC,cAAc,CAAC,CAAC,IAAI,IAAI,IAAID,YAAY,CAACE,kBAAkB,CAAC,CAAC,IAAI,IAAI,EAAE;IACvF,MAAMtC,MAAM,GAAGoC,YAAY,CAACnC,SAAS,CAA0B,CAAC;IAEhE,IAAID,MAAM,IAAI,IAAI,IAAI,EAAEJ,eAAe,CAACwC,YAAY,CAAC,IAAI1C,WAAW,CAAC0C,YAAY,CAAC,CAAC,EAAE;MACjF;IACJ;IAEAA,YAAY,GAAGpC,MAAM;EACzB;EAEAoC,YAAY,CAACG,MAAM,CAAC,CAAC;AACzB;AAEA,OAAO,SAASC,cAAcA,CAAC/B,IAAiB,EAAgB;EAC5D,MAAMgC,eAAe,GAAG9C,mBAAmB,CAAC,CAAC;EAC7C,OAAO8C,eAAe,CAACC,MAAM,CAACjC,IAAI,CAAC;AACvC","ignoreList":[]}

package/utils/toggleLink.d.ts

@@ -0,0 +1,8 @@
+import type { LinkAttributes } from "../LinkNode";
+/**
+ * Generates or updates a LinkNode. It can also delete a LinkNode if the URL is null,
+ * but saves any children and brings them up to the parent node.
+ * @param url - The URL the link directs to.
+ * @param attributes - Optional HTML a tag attributes. { target, rel, title }
+ */
+export declare function toggleLink(url: null | string, attributes?: LinkAttributes): void;

package/utils/toggleLink.js

@@ -0,0 +1,131 @@
+import { $getSelection, $isElementNode, $isRangeSelection } from "lexical";
+import { $createLinkNode, $isLinkNode } from "../LinkNode";
+
+/**
+ * Generates or updates a LinkNode. It can also delete a LinkNode if the URL is null,
+ * but saves any children and brings them up to the parent node.
+ * @param url - The URL the link directs to.
+ * @param attributes - Optional HTML a tag attributes. { target, rel, title }
+ */
+export function toggleLink(url, attributes = {}) {
+  const {
+    target,
+    title,
+    alt
+  } = attributes;
+  const rel = attributes.rel === undefined ? "noreferrer" : attributes.rel;
+  const selection = $getSelection();
+  if (!$isRangeSelection(selection)) {
+    return;
+  }
+  const nodes = selection.extract();
+  if (url === null) {
+    // Remove LinkNodes
+    nodes.forEach(node => {
+      const parent = node.getParent();
+      if ($isLinkNode(parent)) {
+        const children = parent.getChildren();
+        for (let i = 0; i < children.length; i++) {
+          parent.insertBefore(children[i]);
+        }
+        parent.remove();
+      }
+    });
+  } else {
+    // Add or merge LinkNodes
+    if (nodes.length === 1) {
+      const firstNode = nodes[0];
+      // if the first node is a LinkNode or if its
+      // parent is a LinkNode, we update the URL, target and rel.
+      const linkNode = $isLinkNode(firstNode) ? firstNode : $getLinkAncestor(firstNode);
+      if (linkNode !== null) {
+        linkNode.setURL(url);
+        if (target !== undefined) {
+          linkNode.setTarget(target);
+        }
+        if (rel !== null) {
+          linkNode.setRel(rel);
+        }
+        if (title !== undefined) {
+          linkNode.setTitle(title);
+        }
+        if (alt !== undefined) {
+          linkNode.setAlt(alt);
+        }
+        return;
+      }
+    }
+    let prevParent = null;
+    let linkNode = null;
+    nodes.forEach(node => {
+      const parent = node.getParent();
+      if (parent === linkNode || parent === null || $isElementNode(node) && !node.isInline()) {
+        return;
+      }
+      if ($isLinkNode(parent)) {
+        linkNode = parent;
+        parent.setURL(url);
+        if (target !== undefined) {
+          parent.setTarget(target);
+        }
+        if (rel !== null) {
+          linkNode.setRel(rel);
+        }
+        if (title !== undefined) {
+          linkNode.setTitle(title);
+        }
+        if (alt !== undefined) {
+          linkNode.setAlt(alt);
+        }
+        return;
+      }
+      if (!parent.is(prevParent)) {
+        prevParent = parent;
+        linkNode = $createLinkNode(url, {
+          rel,
+          target,
+          alt
+        });
+        if ($isLinkNode(parent)) {
+          if (node.getPreviousSibling() === null) {
+            parent.insertBefore(linkNode);
+          } else {
+            parent.insertAfter(linkNode);
+          }
+        } else {
+          node.insertBefore(linkNode);
+        }
+      }
+      if ($isLinkNode(node)) {
+        if (node.is(linkNode)) {
+          return;
+        }
+        if (linkNode !== null) {
+          const children = node.getChildren();
+          for (let i = 0; i < children.length; i++) {
+            linkNode.append(children[i]);
+          }
+        }
+        node.remove();
+        return;
+      }
+      if (linkNode !== null) {
+        linkNode.append(node);
+      }
+    });
+  }
+}
+function $getLinkAncestor(node) {
+  const ancestor = $getAncestor(node, $isLinkNode);
+  if (!ancestor) {
+    return null;
+  }
+  return ancestor;
+}
+function $getAncestor(node, predicate) {
+  let parent = node;
+  while (parent !== null && (parent = parent.getParent()) !== null && !predicate(parent)) {}
+  return parent;
+}
+
+//# sourceMappingURL=toggleLink.js.map

package/utils/toggleLink.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["$getSelection","$isElementNode","$isRangeSelection","$createLinkNode","$isLinkNode","toggleLink","url","attributes","target","title","alt","rel","undefined","selection","nodes","extract","forEach","node","parent","getParent","children","getChildren","i","length","insertBefore","remove","firstNode","linkNode","$getLinkAncestor","setURL","setTarget","setRel","setTitle","setAlt","prevParent","isInline","is","getPreviousSibling","insertAfter","append","ancestor","$getAncestor","predicate"],"sources":["toggleLink.ts"],"sourcesContent":["import type { ElementNode, LexicalNode } from \"lexical\";\nimport { $getSelection, $isElementNode, $isRangeSelection } from \"lexical\";\nimport type { LinkAttributes, LinkNode } from \"~/LinkNode\";\nimport { $createLinkNode, $isLinkNode } from \"~/LinkNode\";\n\n/**\n * Generates or updates a LinkNode. It can also delete a LinkNode if the URL is null,\n * but saves any children and brings them up to the parent node.\n * @param url - The URL the link directs to.\n * @param attributes - Optional HTML a tag attributes. { target, rel, title }\n */\nexport function toggleLink(url: null | string, attributes: LinkAttributes = {}): void {\n    const { target, title, alt } = attributes;\n    const rel = attributes.rel === undefined ? \"noreferrer\" : attributes.rel;\n    const selection = $getSelection();\n\n    if (!$isRangeSelection(selection)) {\n        return;\n    }\n    const nodes = selection.extract();\n\n    if (url === null) {\n        // Remove LinkNodes\n        nodes.forEach(node => {\n            const parent = node.getParent();\n\n            if ($isLinkNode(parent)) {\n                const children = parent.getChildren();\n\n                for (let i = 0; i < children.length; i++) {\n                    parent.insertBefore(children[i]);\n                }\n\n                parent.remove();\n            }\n        });\n    } else {\n        // Add or merge LinkNodes\n        if (nodes.length === 1) {\n            const firstNode = nodes[0];\n            // if the first node is a LinkNode or if its\n            // parent is a LinkNode, we update the URL, target and rel.\n            const linkNode = $isLinkNode(firstNode) ? firstNode : $getLinkAncestor(firstNode);\n            if (linkNode !== null) {\n                linkNode.setURL(url);\n                if (target !== undefined) {\n                    linkNode.setTarget(target);\n                }\n                if (rel !== null) {\n                    linkNode.setRel(rel);\n                }\n                if (title !== undefined) {\n                    linkNode.setTitle(title);\n                }\n\n                if (alt !== undefined) {\n                    linkNode.setAlt(alt);\n                }\n                return;\n            }\n        }\n\n        let prevParent: ElementNode | LinkNode | null = null;\n        let linkNode: LinkNode | null = null;\n\n        nodes.forEach(node => {\n            const parent = node.getParent();\n\n            if (\n                parent === linkNode ||\n                parent === null ||\n                ($isElementNode(node) && !node.isInline())\n            ) {\n                return;\n            }\n\n            if ($isLinkNode(parent)) {\n                linkNode = parent;\n                parent.setURL(url);\n                if (target !== undefined) {\n                    parent.setTarget(target);\n                }\n                if (rel !== null) {\n                    linkNode.setRel(rel);\n                }\n                if (title !== undefined) {\n                    linkNode.setTitle(title);\n                }\n                if (alt !== undefined) {\n                    linkNode.setAlt(alt);\n                }\n                return;\n            }\n\n            if (!parent.is(prevParent)) {\n                prevParent = parent;\n                linkNode = $createLinkNode(url, { rel, target, alt });\n\n                if ($isLinkNode(parent)) {\n                    if (node.getPreviousSibling() === null) {\n                        parent.insertBefore(linkNode);\n                    } else {\n                        parent.insertAfter(linkNode);\n                    }\n                } else {\n                    node.insertBefore(linkNode);\n                }\n            }\n\n            if ($isLinkNode(node)) {\n                if (node.is(linkNode)) {\n                    return;\n                }\n                if (linkNode !== null) {\n                    const children = node.getChildren();\n\n                    for (let i = 0; i < children.length; i++) {\n                        linkNode.append(children[i]);\n                    }\n                }\n\n                node.remove();\n                return;\n            }\n\n            if (linkNode !== null) {\n                linkNode.append(node);\n            }\n        });\n    }\n}\n\nfunction $getLinkAncestor(node: LexicalNode): LinkNode | null {\n    const ancestor = $getAncestor(node, $isLinkNode);\n    if (!ancestor) {\n        return null;\n    }\n\n    return ancestor as LinkNode;\n}\n\nfunction $getAncestor<NodeType extends LexicalNode = LexicalNode>(\n    node: LexicalNode,\n    predicate: (ancestor: LexicalNode) => ancestor is NodeType\n): null | LexicalNode {\n    let parent: null | LexicalNode = node;\n    while (parent !== null && (parent = parent.getParent()) !== null && !predicate(parent)) {}\n    return parent;\n}\n"],"mappings":"AACA,SAASA,aAAa,EAAEC,cAAc,EAAEC,iBAAiB,QAAQ,SAAS;AAE1E,SAASC,eAAe,EAAEC,WAAW;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,UAAUA,CAACC,GAAkB,EAAEC,UAA0B,GAAG,CAAC,CAAC,EAAQ;EAClF,MAAM;IAAEC,MAAM;IAAEC,KAAK;IAAEC;EAAI,CAAC,GAAGH,UAAU;EACzC,MAAMI,GAAG,GAAGJ,UAAU,CAACI,GAAG,KAAKC,SAAS,GAAG,YAAY,GAAGL,UAAU,CAACI,GAAG;EACxE,MAAME,SAAS,GAAGb,aAAa,CAAC,CAAC;EAEjC,IAAI,CAACE,iBAAiB,CAACW,SAAS,CAAC,EAAE;IAC/B;EACJ;EACA,MAAMC,KAAK,GAAGD,SAAS,CAACE,OAAO,CAAC,CAAC;EAEjC,IAAIT,GAAG,KAAK,IAAI,EAAE;IACd;IACAQ,KAAK,CAACE,OAAO,CAACC,IAAI,IAAI;MAClB,MAAMC,MAAM,GAAGD,IAAI,CAACE,SAAS,CAAC,CAAC;MAE/B,IAAIf,WAAW,CAACc,MAAM,CAAC,EAAE;QACrB,MAAME,QAAQ,GAAGF,MAAM,CAACG,WAAW,CAAC,CAAC;QAErC,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,QAAQ,CAACG,MAAM,EAAED,CAAC,EAAE,EAAE;UACtCJ,MAAM,CAACM,YAAY,CAACJ,QAAQ,CAACE,CAAC,CAAC,CAAC;QACpC;QAEAJ,MAAM,CAACO,MAAM,CAAC,CAAC;MACnB;IACJ,CAAC,CAAC;EACN,CAAC,MAAM;IACH;IACA,IAAIX,KAAK,CAACS,MAAM,KAAK,CAAC,EAAE;MACpB,MAAMG,SAAS,GAAGZ,KAAK,CAAC,CAAC,CAAC;MAC1B;MACA;MACA,MAAMa,QAAQ,GAAGvB,WAAW,CAACsB,SAAS,CAAC,GAAGA,SAAS,GAAGE,gBAAgB,CAACF,SAAS,CAAC;MACjF,IAAIC,QAAQ,KAAK,IAAI,EAAE;QACnBA,QAAQ,CAACE,MAAM,CAACvB,GAAG,CAAC;QACpB,IAAIE,MAAM,KAAKI,SAAS,EAAE;UACtBe,QAAQ,CAACG,SAAS,CAACtB,MAAM,CAAC;QAC9B;QACA,IAAIG,GAAG,KAAK,IAAI,EAAE;UACdgB,QAAQ,CAACI,MAAM,CAACpB,GAAG,CAAC;QACxB;QACA,IAAIF,KAAK,KAAKG,SAAS,EAAE;UACrBe,QAAQ,CAACK,QAAQ,CAACvB,KAAK,CAAC;QAC5B;QAEA,IAAIC,GAAG,KAAKE,SAAS,EAAE;UACnBe,QAAQ,CAACM,MAAM,CAACvB,GAAG,CAAC;QACxB;QACA;MACJ;IACJ;IAEA,IAAIwB,UAAyC,GAAG,IAAI;IACpD,IAAIP,QAAyB,GAAG,IAAI;IAEpCb,KAAK,CAACE,OAAO,CAACC,IAAI,IAAI;MAClB,MAAMC,MAAM,GAAGD,IAAI,CAACE,SAAS,CAAC,CAAC;MAE/B,IACID,MAAM,KAAKS,QAAQ,IACnBT,MAAM,KAAK,IAAI,IACdjB,cAAc,CAACgB,IAAI,CAAC,IAAI,CAACA,IAAI,CAACkB,QAAQ,CAAC,CAAE,EAC5C;QACE;MACJ;MAEA,IAAI/B,WAAW,CAACc,MAAM,CAAC,EAAE;QACrBS,QAAQ,GAAGT,MAAM;QACjBA,MAAM,CAACW,MAAM,CAACvB,GAAG,CAAC;QAClB,IAAIE,MAAM,KAAKI,SAAS,EAAE;UACtBM,MAAM,CAACY,SAAS,CAACtB,MAAM,CAAC;QAC5B;QACA,IAAIG,GAAG,KAAK,IAAI,EAAE;UACdgB,QAAQ,CAACI,MAAM,CAACpB,GAAG,CAAC;QACxB;QACA,IAAIF,KAAK,KAAKG,SAAS,EAAE;UACrBe,QAAQ,CAACK,QAAQ,CAACvB,KAAK,CAAC;QAC5B;QACA,IAAIC,GAAG,KAAKE,SAAS,EAAE;UACnBe,QAAQ,CAACM,MAAM,CAACvB,GAAG,CAAC;QACxB;QACA;MACJ;MAEA,IAAI,CAACQ,MAAM,CAACkB,EAAE,CAACF,UAAU,CAAC,EAAE;QACxBA,UAAU,GAAGhB,MAAM;QACnBS,QAAQ,GAAGxB,eAAe,CAACG,GAAG,EAAE;UAAEK,GAAG;UAAEH,MAAM;UAAEE;QAAI,CAAC,CAAC;QAErD,IAAIN,WAAW,CAACc,MAAM,CAAC,EAAE;UACrB,IAAID,IAAI,CAACoB,kBAAkB,CAAC,CAAC,KAAK,IAAI,EAAE;YACpCnB,MAAM,CAACM,YAAY,CAACG,QAAQ,CAAC;UACjC,CAAC,MAAM;YACHT,MAAM,CAACoB,WAAW,CAACX,QAAQ,CAAC;UAChC;QACJ,CAAC,MAAM;UACHV,IAAI,CAACO,YAAY,CAACG,QAAQ,CAAC;QAC/B;MACJ;MAEA,IAAIvB,WAAW,CAACa,IAAI,CAAC,EAAE;QACnB,IAAIA,IAAI,CAACmB,EAAE,CAACT,QAAQ,CAAC,EAAE;UACnB;QACJ;QACA,IAAIA,QAAQ,KAAK,IAAI,EAAE;UACnB,MAAMP,QAAQ,GAAGH,IAAI,CAACI,WAAW,CAAC,CAAC;UAEnC,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,QAAQ,CAACG,MAAM,EAAED,CAAC,EAAE,EAAE;YACtCK,QAAQ,CAACY,MAAM,CAACnB,QAAQ,CAACE,CAAC,CAAC,CAAC;UAChC;QACJ;QAEAL,IAAI,CAACQ,MAAM,CAAC,CAAC;QACb;MACJ;MAEA,IAAIE,QAAQ,KAAK,IAAI,EAAE;QACnBA,QAAQ,CAACY,MAAM,CAACtB,IAAI,CAAC;MACzB;IACJ,CAAC,CAAC;EACN;AACJ;AAEA,SAASW,gBAAgBA,CAACX,IAAiB,EAAmB;EAC1D,MAAMuB,QAAQ,GAAGC,YAAY,CAACxB,IAAI,EAAEb,WAAW,CAAC;EAChD,IAAI,CAACoC,QAAQ,EAAE;IACX,OAAO,IAAI;EACf;EAEA,OAAOA,QAAQ;AACnB;AAEA,SAASC,YAAYA,CACjBxB,IAAiB,EACjByB,SAA0D,EACxC;EAClB,IAAIxB,MAA0B,GAAGD,IAAI;EACrC,OAAOC,MAAM,KAAK,IAAI,IAAI,CAACA,MAAM,GAAGA,MAAM,CAACC,SAAS,CAAC,CAAC,MAAM,IAAI,IAAI,CAACuB,SAAS,CAACxB,MAAM,CAAC,EAAE,CAAC;EACzF,OAAOA,MAAM;AACjB","ignoreList":[]}