@tiptap/core 2.1.4 → 2.2.0-rc.3

package/dist/index.umd.js

@@ -2009,261 +2009,6 @@
       return { ...mark.attrs };
   }
 
-  const findListItemPos = (typeOrName, state) => {
-      const { $from } = state.selection;
-      const nodeType = getNodeType(typeOrName, state.schema);
-      let currentNode = null;
-      let currentDepth = $from.depth;
-      let currentPos = $from.pos;
-      let targetDepth = null;
-      while (currentDepth > 0 && targetDepth === null) {
-          currentNode = $from.node(currentDepth);
-          if (currentNode.type === nodeType) {
-              targetDepth = currentDepth;
-          }
-          else {
-              currentDepth -= 1;
-              currentPos -= 1;
-          }
-      }
-      if (targetDepth === null) {
-          return null;
-      }
-      return { $pos: state.doc.resolve(currentPos), depth: targetDepth };
-  };
-
-  /**
-   * Finds the first node of a given type or name in the current selection.
-   * @param state The editor state.
-   * @param typeOrName The node type or name.
-   * @param pos The position to start searching from.
-   * @param maxDepth The maximum depth to search.
-   * @returns The node and the depth as an array.
-   */
-  const getNodeAtPosition = (state, typeOrName, pos, maxDepth = 20) => {
-      const $pos = state.doc.resolve(pos);
-      let currentDepth = maxDepth;
-      let node = null;
-      while (currentDepth > 0 && node === null) {
-          const currentNode = $pos.node(currentDepth);
-          if ((currentNode === null || currentNode === void 0 ? void 0 : currentNode.type.name) === typeOrName) {
-              node = currentNode;
-          }
-          else {
-              currentDepth -= 1;
-          }
-      }
-      return [node, currentDepth];
-  };
-
-  const getNextListDepth = (typeOrName, state) => {
-      const listItemPos = findListItemPos(typeOrName, state);
-      if (!listItemPos) {
-          return false;
-      }
-      const [, depth] = getNodeAtPosition(state, typeOrName, listItemPos.$pos.pos + 4);
-      return depth;
-  };
-
-  const isAtStartOfNode = (state) => {
-      const { $from, $to } = state.selection;
-      if ($from.parentOffset > 0 || $from.pos !== $to.pos) {
-          return false;
-      }
-      return true;
-  };
-
-  const hasListBefore = (editorState, name, parentListTypes) => {
-      const { $anchor } = editorState.selection;
-      const previousNodePos = Math.max(0, $anchor.pos - 2);
-      const previousNode = editorState.doc.resolve(previousNodePos).node();
-      if (!previousNode || !parentListTypes.includes(previousNode.type.name)) {
-          return false;
-      }
-      return true;
-  };
-
-  const hasListItemBefore = (typeOrName, state) => {
-      var _a;
-      const { $anchor } = state.selection;
-      const $targetPos = state.doc.resolve($anchor.pos - 2);
-      if ($targetPos.index() === 0) {
-          return false;
-      }
-      if (((_a = $targetPos.nodeBefore) === null || _a === void 0 ? void 0 : _a.type.name) !== typeOrName) {
-          return false;
-      }
-      return true;
-  };
-
-  const listItemHasSubList = (typeOrName, state, node) => {
-      if (!node) {
-          return false;
-      }
-      const nodeType = getNodeType(typeOrName, state.schema);
-      let hasSubList = false;
-      node.descendants(child => {
-          if (child.type === nodeType) {
-              hasSubList = true;
-          }
-      });
-      return hasSubList;
-  };
-
-  const handleBackspace = (editor, name, parentListTypes) => {
-      // this is required to still handle the undo handling
-      if (editor.commands.undoInputRule()) {
-          return true;
-      }
-      // if the current item is NOT inside a list item &
-      // the previous item is a list (orderedList or bulletList)
-      // move the cursor into the list and delete the current item
-      if (!isNodeActive(editor.state, name) && hasListBefore(editor.state, name, parentListTypes)) {
-          const { $anchor } = editor.state.selection;
-          const $listPos = editor.state.doc.resolve($anchor.before() - 1);
-          const listDescendants = [];
-          $listPos.node().descendants((node, pos) => {
-              if (node.type.name === name) {
-                  listDescendants.push({ node, pos });
-              }
-          });
-          const lastItem = listDescendants.at(-1);
-          if (!lastItem) {
-              return false;
-          }
-          const $lastItemPos = editor.state.doc.resolve($listPos.start() + lastItem.pos + 1);
-          return editor.chain().cut({ from: $anchor.start() - 1, to: $anchor.end() + 1 }, $lastItemPos.end()).joinForward().run();
-      }
-      // if the cursor is not inside the current node type
-      // do nothing and proceed
-      if (!isNodeActive(editor.state, name)) {
-          return false;
-      }
-      // if the cursor is not at the start of a node
-      // do nothing and proceed
-      if (!isAtStartOfNode(editor.state)) {
-          return false;
-      }
-      const listItemPos = findListItemPos(name, editor.state);
-      if (!listItemPos) {
-          return false;
-      }
-      const $prev = editor.state.doc.resolve(listItemPos.$pos.pos - 2);
-      const prevNode = $prev.node(listItemPos.depth);
-      const previousListItemHasSubList = listItemHasSubList(name, editor.state, prevNode);
-      // if the previous item is a list item and doesn't have a sublist, join the list items
-      if (hasListItemBefore(name, editor.state) && !previousListItemHasSubList) {
-          return editor.commands.joinItemBackward();
-      }
-      // otherwise in the end, a backspace should
-      // always just lift the list item if
-      // joining / merging is not possible
-      return editor.chain().liftListItem(name).run();
-  };
-
-  function findParentNodeClosestToPos($pos, predicate) {
-      for (let i = $pos.depth; i > 0; i -= 1) {
-          const node = $pos.node(i);
-          if (predicate(node)) {
-              return {
-                  pos: i > 0 ? $pos.before(i) : 0,
-                  start: $pos.start(i),
-                  depth: i,
-                  node,
-              };
-          }
-      }
-  }
-
-  function findParentNode(predicate) {
-      return (selection) => findParentNodeClosestToPos(selection.$from, predicate);
-  }
-
-  const isAtEndOfNode = (state, nodeType) => {
-      const { $from, $to, $anchor } = state.selection;
-      if (nodeType) {
-          const parentNode = findParentNode(node => node.type.name === nodeType)(state.selection);
-          if (!parentNode) {
-              return false;
-          }
-          const $parentPos = state.doc.resolve(parentNode.pos + 1);
-          if ($anchor.pos + 1 === $parentPos.end()) {
-              return true;
-          }
-          return false;
-      }
-      if ($to.parentOffset < $to.parent.nodeSize - 2 || $from.pos !== $to.pos) {
-          return false;
-      }
-      return true;
-  };
-
-  const nextListIsDeeper = (typeOrName, state) => {
-      const listDepth = getNextListDepth(typeOrName, state);
-      const listItemPos = findListItemPos(typeOrName, state);
-      if (!listItemPos || !listDepth) {
-          return false;
-      }
-      if (listDepth > listItemPos.depth) {
-          return true;
-      }
-      return false;
-  };
-
-  const nextListIsHigher = (typeOrName, state) => {
-      const listDepth = getNextListDepth(typeOrName, state);
-      const listItemPos = findListItemPos(typeOrName, state);
-      if (!listItemPos || !listDepth) {
-          return false;
-      }
-      if (listDepth < listItemPos.depth) {
-          return true;
-      }
-      return false;
-  };
-
-  const handleDelete = (editor, name) => {
-      // if the cursor is not inside the current node type
-      // do nothing and proceed
-      if (!isNodeActive(editor.state, name)) {
-          return false;
-      }
-      // if the cursor is not at the end of a node
-      // do nothing and proceed
-      if (!isAtEndOfNode(editor.state, name)) {
-          return false;
-      }
-      // check if the next node is a list with a deeper depth
-      if (nextListIsDeeper(name, editor.state)) {
-          return editor
-              .chain()
-              .focus(editor.state.selection.from + 4)
-              .lift(name)
-              .joinBackward()
-              .run();
-      }
-      if (nextListIsHigher(name, editor.state)) {
-          return editor.chain()
-              .joinForward()
-              .joinBackward()
-              .run();
-      }
-      return editor.commands.joinItemForward();
-  };
-
-  const hasListItemAfter = (typeOrName, state) => {
-      var _a;
-      const { $anchor } = state.selection;
-      const $targetPos = state.doc.resolve($anchor.pos - $anchor.parentOffset - 2);
-      if ($targetPos.index() === $targetPos.parent.childCount - 1) {
-          return false;
-      }
-      if (((_a = $targetPos.nodeAfter) === null || _a === void 0 ? void 0 : _a.type.name) !== typeOrName) {
-          return false;
-      }
-      return true;
-  };
-
   /**
    * Returns a new `Transform` based on all steps of the passed transactions.
    */
@@ -2325,6 +2070,24 @@
       return nodesWithPos;
   }
 
+  function findParentNodeClosestToPos($pos, predicate) {
+      for (let i = $pos.depth; i > 0; i -= 1) {
+          const node = $pos.node(i);
+          if (predicate(node)) {
+              return {
+                  pos: i > 0 ? $pos.before(i) : 0,
+                  start: $pos.start(i),
+                  depth: i,
+                  node,
+              };
+          }
+      }
+  }
+
+  function findParentNode(predicate) {
+      return (selection) => findParentNodeClosestToPos(selection.$from, predicate);
+  }
+
   function getHTMLFromFragment(fragment, schema) {
       const documentFragment = model.DOMSerializer.fromSchema(schema).serializeFragment(fragment);
       const temporaryDocument = document.implementation.createHTMLDocument();
@@ -2542,6 +2305,30 @@
       return marks;
   }
 
+  /**
+   * Finds the first node of a given type or name in the current selection.
+   * @param state The editor state.
+   * @param typeOrName The node type or name.
+   * @param pos The position to start searching from.
+   * @param maxDepth The maximum depth to search.
+   * @returns The node and the depth as an array.
+   */
+  const getNodeAtPosition = (state, typeOrName, pos, maxDepth = 20) => {
+      const $pos = state.doc.resolve(pos);
+      let currentDepth = maxDepth;
+      let node = null;
+      while (currentDepth > 0 && node === null) {
+          const currentNode = $pos.node(currentDepth);
+          if ((currentNode === null || currentNode === void 0 ? void 0 : currentNode.type.name) === typeOrName) {
+              node = currentNode;
+          }
+          else {
+              currentDepth -= 1;
+          }
+      }
+      return [node, currentDepth];
+  };
+
   function getSplittedAttributes(extensionAttributes, typeName, attributes) {
       return Object.fromEntries(Object
           .entries(attributes)
@@ -2632,6 +2419,33 @@
       return false;
   }
 
+  const isAtEndOfNode = (state, nodeType) => {
+      const { $from, $to, $anchor } = state.selection;
+      if (nodeType) {
+          const parentNode = findParentNode(node => node.type.name === nodeType)(state.selection);
+          if (!parentNode) {
+              return false;
+          }
+          const $parentPos = state.doc.resolve(parentNode.pos + 1);
+          if ($anchor.pos + 1 === $parentPos.end()) {
+              return true;
+          }
+          return false;
+      }
+      if ($to.parentOffset < $to.parent.nodeSize - 2 || $from.pos !== $to.pos) {
+          return false;
+      }
+      return true;
+  };
+
+  const isAtStartOfNode = (state) => {
+      const { $from, $to } = state.selection;
+      if ($from.parentOffset > 0 || $from.pos !== $to.pos) {
+          return false;
+      }
+      return true;
+  };
+
   function isList(name, extensions) {
       const { nodeExtensions } = splitExtensions(extensions);
       const extension = nodeExtensions.find(item => item.name === name);
@@ -4593,7 +4407,6 @@ img.ProseMirror-separator {
   exports.findChildren = findChildren;
   exports.findChildrenInRange = findChildrenInRange;
   exports.findDuplicates = findDuplicates;
-  exports.findListItemPos = findListItemPos;
   exports.findParentNode = findParentNode;
   exports.findParentNodeClosestToPos = findParentNodeClosestToPos;
   exports.fromString = fromString;
@@ -4610,7 +4423,6 @@ img.ProseMirror-separator {
   exports.getMarkRange = getMarkRange;
   exports.getMarkType = getMarkType;
   exports.getMarksBetween = getMarksBetween;
-  exports.getNextListDepth = getNextListDepth;
   exports.getNodeAtPosition = getNodeAtPosition;
   exports.getNodeAttributes = getNodeAttributes;
   exports.getNodeType = getNodeType;
@@ -4624,11 +4436,6 @@ img.ProseMirror-separator {
   exports.getTextBetween = getTextBetween;
   exports.getTextContentFromNodes = getTextContentFromNodes;
   exports.getTextSerializersFromSchema = getTextSerializersFromSchema;
-  exports.handleBackspace = handleBackspace;
-  exports.handleDelete = handleDelete;
-  exports.hasListBefore = hasListBefore;
-  exports.hasListItemAfter = hasListItemAfter;
-  exports.hasListItemBefore = hasListItemBefore;
   exports.injectExtensionAttributesToParseRule = injectExtensionAttributesToParseRule;
   exports.inputRulesPlugin = inputRulesPlugin;
   exports.isActive = isActive;
@@ -4649,14 +4456,11 @@ img.ProseMirror-separator {
   exports.isString = isString;
   exports.isTextSelection = isTextSelection;
   exports.isiOS = isiOS;
-  exports.listItemHasSubList = listItemHasSubList;
   exports.markInputRule = markInputRule;
   exports.markPasteRule = markPasteRule;
   exports.mergeAttributes = mergeAttributes;
   exports.mergeDeep = mergeDeep;
   exports.minMax = minMax;
-  exports.nextListIsDeeper = nextListIsDeeper;
-  exports.nextListIsHigher = nextListIsHigher;
   exports.nodeInputRule = nodeInputRule;
   exports.nodePasteRule = nodePasteRule;
   exports.objectIncludes = objectIncludes;