@tiptap/core 2.5.7 → 2.5.9

package/dist/index.umd.js

@@ -575,7 +575,7 @@
           }))
               || node.textContent
               || '%leaf%';
-          textBefore += node.isAtom ? chunk : chunk.slice(0, Math.max(0, sliceEndPos - pos));
+          textBefore += node.isAtom && !node.isText ? chunk : chunk.slice(0, Math.max(0, sliceEndPos - pos));
       });
       return textBefore;
   };
@@ -962,7 +962,7 @@
 
   function findDuplicates(items) {
       const filtered = items.filter((el, index) => items.indexOf(el) !== index);
-      return [...new Set(filtered)];
+      return Array.from(new Set(filtered));
   }
 
   class ExtensionManager {
@@ -2632,7 +2632,7 @@
               .resolve(from)
               .marks()
               .forEach(mark => {
-              const $pos = doc.resolve(from - 1);
+              const $pos = doc.resolve(from);
               const range = getMarkRange($pos, mark.type);
               if (!range) {
                   return;
@@ -2825,31 +2825,40 @@
   }
 
   /**
-   * Returns true if the given node is empty.
-   * When `checkChildren` is true (default), it will also check if all children are empty.
+   * Returns true if the given prosemirror node is empty.
    */
-  function isNodeEmpty(node, { checkChildren } = { checkChildren: true }) {
+  function isNodeEmpty(node, { checkChildren = true, ignoreWhitespace = false, } = {}) {
+      var _a;
+      if (ignoreWhitespace) {
+          if (node.type.name === 'hardBreak') {
+              // Hard breaks are considered empty
+              return true;
+          }
+          if (node.isText) {
+              return /^\s*$/m.test((_a = node.text) !== null && _a !== void 0 ? _a : '');
+          }
+      }
       if (node.isText) {
           return !node.text;
       }
+      if (node.isAtom || node.isLeaf) {
+          return false;
+      }
       if (node.content.childCount === 0) {
           return true;
       }
-      if (node.isLeaf) {
-          return false;
-      }
       if (checkChildren) {
-          let hasSameContent = true;
+          let isContentEmpty = true;
           node.content.forEach(childNode => {
-              if (hasSameContent === false) {
+              if (isContentEmpty === false) {
                   // Exit early for perf
                   return;
               }
-              if (!isNodeEmpty(childNode)) {
-                  hasSameContent = false;
+              if (!isNodeEmpty(childNode, { ignoreWhitespace, checkChildren })) {
+                  isContentEmpty = false;
               }
           });
-          return hasSameContent;
+          return isContentEmpty;
       }
       return false;
   }