@webiny/lexical-nodes 5.38.0-beta.0

package/utils/listNode.js

@@ -0,0 +1,109 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.$getAllListItems = $getAllListItems;
+exports.$getListDepth = $getListDepth;
+exports.$getTopListNode = $getTopListNode;
+exports.$removeHighestEmptyListParent = $removeHighestEmptyListParent;
+exports.findNearestListItemNode = findNearestListItemNode;
+exports.getUniqueListItemNodes = getUniqueListItemNodes;
+exports.isNestedListNode = isNestedListNode;
+exports.wrapInListItem = wrapInListItem;
+var _ListNode = require("../ListNode");
+var _ListItemNode = require("../ListItemNode");
+function $getListDepth(listNode) {
+  var depth = 1;
+  var parent = listNode.getParent();
+  while (parent !== null) {
+    if ((0, _ListItemNode.$isListItemNode)(parent)) {
+      var parentList = parent.getParent();
+      if ((0, _ListNode.$isListNode)(parentList)) {
+        depth++;
+        parent = (parentList === null || parentList === void 0 ? void 0 : parentList.getParent()) || null;
+        continue;
+      }
+      console.log("A WebinyListItemNode must have a WebinyListNode for a parent.");
+    }
+    return depth;
+  }
+  return depth;
+}
+function $getTopListNode(listItem) {
+  var list = listItem.getParent();
+  if (!(0, _ListNode.$isListNode)(list)) {
+    console.log("A WebinyListItemNode must have a ListNode for a parent.");
+    return listItem;
+  }
+  var parent = list;
+  while (parent !== null) {
+    parent = parent.getParent();
+    if ((0, _ListNode.$isListNode)(parent)) {
+      list = parent;
+    }
+  }
+  return list;
+}
+function $getAllListItems(node) {
+  var listItemNodes = [];
+  var listChildren = node.getChildren().filter(_ListItemNode.$isListItemNode);
+  for (var i = 0; i < listChildren.length; i++) {
+    var listItemNode = listChildren[i];
+    var firstChild = listItemNode === null || listItemNode === void 0 ? void 0 : listItemNode.getFirstChild();
+    if ((0, _ListNode.$isListNode)(firstChild)) {
+      listItemNodes = listItemNodes.concat($getAllListItems(firstChild));
+    } else {
+      listItemNodes.push(listItemNode);
+    }
+  }
+  return listItemNodes;
+}
+function isNestedListNode(node) {
+  return (0, _ListItemNode.$isListItemNode)(node) && (0, _ListNode.$isListNode)(node === null || node === void 0 ? void 0 : node.getFirstChild());
+}
+
+// TODO: rewrite with $findMatchingParent or *nodeOfType
+function findNearestListItemNode(node) {
+  var currentNode = node;
+  while (currentNode !== null) {
+    if ((0, _ListItemNode.$isListItemNode)(currentNode)) {
+      return currentNode;
+    }
+    currentNode = currentNode.getParent();
+  }
+  return null;
+}
+function getUniqueListItemNodes(nodeList) {
+  var keys = new Set();
+  for (var i = 0; i < nodeList.length; i++) {
+    var node = nodeList[i];
+    if ((0, _ListItemNode.$isListItemNode)(node)) {
+      keys.add(node);
+    }
+  }
+  return Array.from(keys);
+}
+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.)
+  var emptyListPtr = sublist;
+  while (emptyListPtr.getNextSibling() == null && emptyListPtr.getPreviousSibling() == null) {
+    var parent = emptyListPtr.getParent();
+    if (parent == null || !((0, _ListItemNode.$isListItemNode)(emptyListPtr) || (0, _ListNode.$isListNode)(emptyListPtr))) {
+      break;
+    }
+    emptyListPtr = parent;
+  }
+  emptyListPtr.remove();
+}
+function wrapInListItem(node) {
+  var listItemWrapper = (0, _ListItemNode.$createListItemNode)();
+  return listItemWrapper.append(node);
+}
+
+//# sourceMappingURL=listNode.js.map

package/utils/listNode.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["_ListNode","require","_ListItemNode","$getListDepth","listNode","depth","parent","getParent","$isListItemNode","parentList","$isListNode","console","log","$getTopListNode","listItem","list","$getAllListItems","node","listItemNodes","listChildren","getChildren","filter","i","length","listItemNode","firstChild","getFirstChild","concat","push","isNestedListNode","findNearestListItemNode","currentNode","getUniqueListItemNodes","nodeList","keys","Set","add","Array","from","$removeHighestEmptyListParent","sublist","emptyListPtr","getNextSibling","getPreviousSibling","remove","wrapInListItem","listItemWrapper","$createListItemNode","append"],"sources":["listNode.ts"],"sourcesContent":["import type { LexicalNode } from \"lexical\";\n\nimport { $isListNode, ListNode } from \"~/ListNode\";\nimport { $createListItemNode, $isListItemNode, ListItemNode } 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\nexport function isNestedListNode(node: LexicalNode | null | undefined): boolean {\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":";;;;;;;;;;;;;AAEA,IAAAA,SAAA,GAAAC,OAAA;AACA,IAAAC,aAAA,GAAAD,OAAA;AAEO,SAASE,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,IAAI,IAAAE,6BAAe,EAACF,MAAM,CAAC,EAAE;MACzB,IAAMG,UAAU,GAAGH,MAAM,CAACC,SAAS,CAAC,CAAC;MAErC,IAAI,IAAAG,qBAAW,EAACD,UAAU,CAAC,EAAE;QACzBJ,KAAK,EAAE;QACPC,MAAM,GAAG,CAAAG,UAAU,aAAVA,UAAU,uBAAVA,UAAU,CAAEF,SAAS,CAAC,CAAC,KAAI,IAAI;QACxC;MACJ;MACAI,OAAO,CAACC,GAAG,CAAC,+DAA+D,CAAC;IAChF;IAEA,OAAOP,KAAK;EAChB;EAEA,OAAOA,KAAK;AAChB;AAEO,SAASQ,eAAeA,CAACC,QAAqB,EAAY;EAC7D,IAAIC,IAAI,GAAGD,QAAQ,CAACP,SAAS,CAAW,CAAC;EAEzC,IAAI,CAAC,IAAAG,qBAAW,EAACK,IAAI,CAAC,EAAE;IACpBJ,OAAO,CAACC,GAAG,CAAC,yDAAyD,CAAC;IACtE,OAAOE,QAAQ;EACnB;EAEA,IAAIR,MAAuB,GAAGS,IAAI;EAElC,OAAOT,MAAM,KAAK,IAAI,EAAE;IACpBA,MAAM,GAAGA,MAAM,CAACC,SAAS,CAAC,CAAC;IAE3B,IAAI,IAAAG,qBAAW,EAACJ,MAAM,CAAC,EAAE;MACrBS,IAAI,GAAGT,MAAM;IACjB;EACJ;EAEA,OAAOS,IAAI;AACf;AAEO,SAASC,gBAAgBA,CAACC,IAAc,EAAuB;EAClE,IAAIC,aAAkC,GAAG,EAAE;EAC3C,IAAMC,YAAiC,GAAGF,IAAI,CAACG,WAAW,CAAC,CAAC,CAACC,MAAM,CAACb,6BAAe,CAAC;EAEpF,KAAK,IAAIc,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGH,YAAY,CAACI,MAAM,EAAED,CAAC,EAAE,EAAE;IAC1C,IAAME,YAAY,GAAGL,YAAY,CAACG,CAAC,CAAC;IACpC,IAAMG,UAAU,GAAGD,YAAY,aAAZA,YAAY,uBAAZA,YAAY,CAAEE,aAAa,CAAC,CAAC;IAEhD,IAAI,IAAAhB,qBAAW,EAACe,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;AAEO,SAASW,gBAAgBA,CAACZ,IAAoC,EAAW;EAC5E,OAAO,IAAAT,6BAAe,EAACS,IAAI,CAAC,IAAI,IAAAP,qBAAW,EAACO,IAAI,aAAJA,IAAI,uBAAJA,IAAI,CAAES,aAAa,CAAC,CAAC,CAAC;AACtE;;AAEA;AACO,SAASI,uBAAuBA,CAACb,IAAiB,EAAuB;EAC5E,IAAIc,WAA+B,GAAGd,IAAI;EAE1C,OAAOc,WAAW,KAAK,IAAI,EAAE;IACzB,IAAI,IAAAvB,6BAAe,EAACuB,WAAW,CAAC,EAAE;MAC9B,OAAOA,WAAW;IACtB;IACAA,WAAW,GAAGA,WAAW,CAACxB,SAAS,CAAC,CAAC;EACzC;EAEA,OAAO,IAAI;AACf;AAEO,SAASyB,sBAAsBA,CAACC,QAA4B,EAAuB;EACtF,IAAMC,IAAI,GAAG,IAAIC,GAAG,CAAe,CAAC;EAEpC,KAAK,IAAIb,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGW,QAAQ,CAACV,MAAM,EAAED,CAAC,EAAE,EAAE;IACtC,IAAML,IAAI,GAAGgB,QAAQ,CAACX,CAAC,CAAC;IAExB,IAAI,IAAAd,6BAAe,EAACS,IAAI,CAAC,EAAE;MACvBiB,IAAI,CAACE,GAAG,CAACnB,IAAI,CAAC;IAClB;EACJ;EAEA,OAAOoB,KAAK,CAACC,IAAI,CAACJ,IAAI,CAAC;AAC3B;AAEO,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,IAAMrC,MAAM,GAAGmC,YAAY,CAAClC,SAAS,CAA0B,CAAC;IAEhE,IAAID,MAAM,IAAI,IAAI,IAAI,EAAE,IAAAE,6BAAe,EAACiC,YAAY,CAAC,IAAI,IAAA/B,qBAAW,EAAC+B,YAAY,CAAC,CAAC,EAAE;MACjF;IACJ;IAEAA,YAAY,GAAGnC,MAAM;EACzB;EAEAmC,YAAY,CAACG,MAAM,CAAC,CAAC;AACzB;AAEO,SAASC,cAAcA,CAAC5B,IAAiB,EAAgB;EAC5D,IAAM6B,eAAe,GAAG,IAAAC,iCAAmB,EAAC,CAAC;EAC7C,OAAOD,eAAe,CAACE,MAAM,CAAC/B,IAAI,CAAC;AACvC"}