@tiptap/core 3.0.0-beta.24 → 3.0.0-beta.25

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tiptap/core",
   "description": "headless rich text editor",
-  "version": "3.0.0-beta.24",
+  "version": "3.0.0-beta.25",
   "homepage": "https://tiptap.dev",
   "keywords": [
     "tiptap",
@@ -52,12 +52,11 @@
     "jsx-dev-runtime"
   ],
   "devDependencies": {
-    "@types/prosemirror-dev-tools": "^3.0.6",
-    "prosemirror-dev-tools": "^4.2.0",
-    "@tiptap/pm": "3.0.0-beta.24"
+    "prosemirror-dev-toolkit": "^1.1.8",
+    "@tiptap/pm": "3.0.0-beta.25"
   },
   "peerDependencies": {
-    "@tiptap/pm": "3.0.0-beta.24"
+    "@tiptap/pm": "3.0.0-beta.25"
   },
   "repository": {
     "type": "git",

package/src/Editor.ts

@@ -194,14 +194,14 @@ export class Editor extends EventEmitter<EditorEvents> {
   /**
    * Applies ProseMirror dev tools to the editor instance if enabled and running in a browser environment.
    *
-   * This method dynamically imports the `prosemirror-dev-tools` package and applies it to the current
+   * This method dynamically imports the `prosemirror-dev-toolkit` package and applies it to the current
    * editor view. If the dev tools are not installed, a warning is logged to the console.
    *
    * @private
    * @remarks
    * - Dev tools are only applied if `this.options.enableDevTools` is `true` and the code is running in a browser.
    * - If the editor view is not available, the dev tools are not applied.
-   * - If the `prosemirror-dev-tools` package is missing, a warning is shown in the console.
+   * - If the `prosemirror-dev-toolkit` package is missing, a warning is shown in the console.
    *
    * @returns {void}
    */
@@ -210,17 +210,17 @@ export class Editor extends EventEmitter<EditorEvents> {
       return
     }
 
-    import('prosemirror-dev-tools')
-      .then(({ default: apply }) => {
+    import('prosemirror-dev-toolkit')
+      .then(({ applyDevTools }) => {
         if (!this.editorView) {
           return
         }
 
-        apply(this.editorView)
+        applyDevTools(this.editorView)
       })
       .catch(() => {
-        console.warn('[Tiptap warning]: Devtools are enabled but `prosemirror-dev-tools` is not installed.')
-        console.warn("Install 'prosemirror-dev-tools' as a dev dependency to use the dev tools.")
+        console.warn('[Tiptap warning]: Devtools are enabled but `prosemirror-dev-toolkit` is not installed.')
+        console.warn("Install 'prosemirror-dev-toolkit' as a dev dependency to use the dev tools.")
       })
   }
 

package/src/types.ts

@@ -366,7 +366,7 @@ export interface EditorOptions {
   /**
    * Enable a lazy-loaded Prosemirror DevTools integration.
    *
-   * Requires having the `prosemirror-dev-tools` npm package installed.
+   * Requires having the `prosemirror-dev-toolkit` npm package installed.
    * @type boolean
    * @default false
    * @example

package/dist/chunk-GRT2MR5L.js

@@ -1,59 +0,0 @@
-// ../../node_modules/.pnpm/prosemirror-dev-tools@4.2.0_@babel+core@7.26.0_@babel+template@7.25.9_@types+react@19.1.6_rea_wz3aei26oeuigobt6rwizjq3ci/node_modules/prosemirror-dev-tools/dist/esm/state/idle-scheduler.js
-function _classCallCheck(instance, Constructor) {
-  if (!(instance instanceof Constructor)) {
-    throw new TypeError("Cannot call a class as a function");
-  }
-}
-function _defineProperties(target, props) {
-  for (var i = 0; i < props.length; i++) {
-    var descriptor = props[i];
-    descriptor.enumerable = descriptor.enumerable || false;
-    descriptor.configurable = true;
-    if ("value" in descriptor) descriptor.writable = true;
-    Object.defineProperty(target, descriptor.key, descriptor);
-  }
-}
-function _createClass(Constructor, protoProps, staticProps) {
-  if (protoProps) _defineProperties(Constructor.prototype, protoProps);
-  if (staticProps) _defineProperties(Constructor, staticProps);
-  Object.defineProperty(Constructor, "prototype", { writable: false });
-  return Constructor;
-}
-function _defineProperty(obj, key, value) {
-  if (key in obj) {
-    Object.defineProperty(obj, key, { value, enumerable: true, configurable: true, writable: true });
-  } else {
-    obj[key] = value;
-  }
-  return obj;
-}
-var IdleScheduler = /* @__PURE__ */ function() {
-  function IdleScheduler2() {
-    _classCallCheck(this, IdleScheduler2);
-    _defineProperty(this, "task", void 0);
-  }
-  _createClass(IdleScheduler2, [{
-    key: "request",
-    value: function request() {
-      this.cancel();
-      var request2 = window.requestIdleCallback || window.requestAnimationFrame;
-      return new Promise(function(resolve) {
-        return request2(resolve);
-      });
-    }
-  }, {
-    key: "cancel",
-    value: function cancel() {
-      var cancel2 = window.cancelIdleCallack || window.cancelAnimationFrame;
-      if (this.task) {
-        cancel2(this.task);
-      }
-    }
-  }]);
-  return IdleScheduler2;
-}();
-
-export {
-  IdleScheduler
-};
-//# sourceMappingURL=chunk-GRT2MR5L.js.map

package/dist/chunk-GRT2MR5L.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../node_modules/.pnpm/prosemirror-dev-tools@4.2.0_@babel+core@7.26.0_@babel+template@7.25.9_@types+react@19.1.6_rea_wz3aei26oeuigobt6rwizjq3ci/node_modules/prosemirror-dev-tools/dist/esm/state/idle-scheduler.js"],"sourcesContent":["function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nexport var IdleScheduler = /*#__PURE__*/function () {\n  function IdleScheduler() {\n    _classCallCheck(this, IdleScheduler);\n    _defineProperty(this, \"task\", undefined);\n  }\n  _createClass(IdleScheduler, [{\n    key: \"request\",\n    value: function request() {\n      this.cancel();\n      var request = window.requestIdleCallback || window.requestAnimationFrame;\n      return new Promise(function (resolve) {\n        return request(resolve);\n      });\n    }\n  }, {\n    key: \"cancel\",\n    value: function cancel() {\n      var cancel = window.cancelIdleCallack || window.cancelAnimationFrame;\n      if (this.task) {\n        cancel(this.task);\n      }\n    }\n  }]);\n  return IdleScheduler;\n}();"],"mappings":";AAAA,SAAS,gBAAgB,UAAU,aAAa;AAAE,MAAI,EAAE,oBAAoB,cAAc;AAAE,UAAM,IAAI,UAAU,mCAAmC;AAAA,EAAG;AAAE;AACxJ,SAAS,kBAAkB,QAAQ,OAAO;AAAE,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,QAAI,aAAa,MAAM,CAAC;AAAG,eAAW,aAAa,WAAW,cAAc;AAAO,eAAW,eAAe;AAAM,QAAI,WAAW,WAAY,YAAW,WAAW;AAAM,WAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,EAAG;AAAE;AAC5T,SAAS,aAAa,aAAa,YAAY,aAAa;AAAE,MAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,MAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,SAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAM,CAAC;AAAG,SAAO;AAAa;AAC5R,SAAS,gBAAgB,KAAK,KAAK,OAAO;AAAE,MAAI,OAAO,KAAK;AAAE,WAAO,eAAe,KAAK,KAAK,EAAE,OAAc,YAAY,MAAM,cAAc,MAAM,UAAU,KAAK,CAAC;AAAA,EAAG,OAAO;AAAE,QAAI,GAAG,IAAI;AAAA,EAAO;AAAE,SAAO;AAAK;AACzM,IAAI,gBAA6B,2BAAY;AAClD,WAASA,iBAAgB;AACvB,oBAAgB,MAAMA,cAAa;AACnC,oBAAgB,MAAM,QAAQ,MAAS;AAAA,EACzC;AACA,eAAaA,gBAAe,CAAC;AAAA,IAC3B,KAAK;AAAA,IACL,OAAO,SAAS,UAAU;AACxB,WAAK,OAAO;AACZ,UAAIC,WAAU,OAAO,uBAAuB,OAAO;AACnD,aAAO,IAAI,QAAQ,SAAU,SAAS;AACpC,eAAOA,SAAQ,OAAO;AAAA,MACxB,CAAC;AAAA,IACH;AAAA,EACF,GAAG;AAAA,IACD,KAAK;AAAA,IACL,OAAO,SAAS,SAAS;AACvB,UAAIC,UAAS,OAAO,qBAAqB,OAAO;AAChD,UAAI,KAAK,MAAM;AACb,QAAAA,QAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACF;AAAA,EACF,CAAC,CAAC;AACF,SAAOF;AACT,EAAE;","names":["IdleScheduler","request","cancel"]}

package/dist/chunk-TH7LERQR.js

@@ -1,34 +0,0 @@
-// ../../node_modules/.pnpm/nanoid@3.3.8/node_modules/nanoid/index.js
-import crypto from "crypto";
-
-// ../../node_modules/.pnpm/nanoid@3.3.8/node_modules/nanoid/url-alphabet/index.js
-var urlAlphabet = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict";
-
-// ../../node_modules/.pnpm/nanoid@3.3.8/node_modules/nanoid/index.js
-var POOL_SIZE_MULTIPLIER = 128;
-var pool;
-var poolOffset;
-var fillPool = (bytes) => {
-  if (!pool || pool.length < bytes) {
-    pool = Buffer.allocUnsafe(bytes * POOL_SIZE_MULTIPLIER);
-    crypto.randomFillSync(pool);
-    poolOffset = 0;
-  } else if (poolOffset + bytes > pool.length) {
-    crypto.randomFillSync(pool);
-    poolOffset = 0;
-  }
-  poolOffset += bytes;
-};
-var nanoid = (size = 21) => {
-  fillPool(size |= 0);
-  let id = "";
-  for (let i = poolOffset - size; i < poolOffset; i++) {
-    id += urlAlphabet[pool[i] & 63];
-  }
-  return id;
-};
-
-export {
-  nanoid
-};
-//# sourceMappingURL=chunk-TH7LERQR.js.map

package/dist/chunk-TH7LERQR.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../node_modules/.pnpm/nanoid@3.3.8/node_modules/nanoid/index.js","../../../node_modules/.pnpm/nanoid@3.3.8/node_modules/nanoid/url-alphabet/index.js"],"sourcesContent":["import crypto from 'crypto'\n\nimport { urlAlphabet } from './url-alphabet/index.js'\n\n// It is best to make fewer, larger requests to the crypto module to\n// avoid system call overhead. So, random numbers are generated in a\n// pool. The pool is a Buffer that is larger than the initial random\n// request size by this multiplier. The pool is enlarged if subsequent\n// requests exceed the maximum buffer size.\nconst POOL_SIZE_MULTIPLIER = 128\nlet pool, poolOffset\n\nlet fillPool = bytes => {\n  if (!pool || pool.length < bytes) {\n    pool = Buffer.allocUnsafe(bytes * POOL_SIZE_MULTIPLIER)\n    crypto.randomFillSync(pool)\n    poolOffset = 0\n  } else if (poolOffset + bytes > pool.length) {\n    crypto.randomFillSync(pool)\n    poolOffset = 0\n  }\n  poolOffset += bytes\n}\n\nlet random = bytes => {\n  // `|=` convert `bytes` to number to prevent `valueOf` abusing and pool pollution\n  fillPool((bytes |= 0))\n  return pool.subarray(poolOffset - bytes, poolOffset)\n}\n\nlet customRandom = (alphabet, defaultSize, getRandom) => {\n  // First, a bitmask is necessary to generate the ID. The bitmask makes bytes\n  // values closer to the alphabet size. The bitmask calculates the closest\n  // `2^31 - 1` number, which exceeds the alphabet size.\n  // For example, the bitmask for the alphabet size 30 is 31 (00011111).\n  let mask = (2 << (31 - Math.clz32((alphabet.length - 1) | 1))) - 1\n  // Though, the bitmask solution is not perfect since the bytes exceeding\n  // the alphabet size are refused. Therefore, to reliably generate the ID,\n  // the random bytes redundancy has to be satisfied.\n\n  // Note: every hardware random generator call is performance expensive,\n  // because the system call for entropy collection takes a lot of time.\n  // So, to avoid additional system calls, extra bytes are requested in advance.\n\n  // Next, a step determines how many random bytes to generate.\n  // The number of random bytes gets decided upon the ID size, mask,\n  // alphabet size, and magic number 1.6 (using 1.6 peaks at performance\n  // according to benchmarks).\n  let step = Math.ceil((1.6 * mask * defaultSize) / alphabet.length)\n\n  return (size = defaultSize) => {\n    let id = ''\n    while (true) {\n      let bytes = getRandom(step)\n      // A compact alternative for `for (let i = 0; i < step; i++)`.\n      let i = step\n      while (i--) {\n        // Adding `|| ''` refuses a random byte that exceeds the alphabet size.\n        id += alphabet[bytes[i] & mask] || ''\n        if (id.length === size) return id\n      }\n    }\n  }\n}\n\nlet customAlphabet = (alphabet, size = 21) =>\n  customRandom(alphabet, size, random)\n\nlet nanoid = (size = 21) => {\n  // `|=` convert `size` to number to prevent `valueOf` abusing and pool pollution\n  fillPool((size |= 0))\n  let id = ''\n  // We are reading directly from the random pool to avoid creating new array\n  for (let i = poolOffset - size; i < poolOffset; i++) {\n    // It is incorrect to use bytes exceeding the alphabet size.\n    // The following mask reduces the random byte in the 0-255 value\n    // range to the 0-63 value range. Therefore, adding hacks, such\n    // as empty string fallback or magic numbers, is unneccessary because\n    // the bitmask trims bytes down to the alphabet size.\n    id += urlAlphabet[pool[i] & 63]\n  }\n  return id\n}\n\nexport { nanoid, customAlphabet, customRandom, urlAlphabet, random }\n","// This alphabet uses `A-Za-z0-9_-` symbols.\n// The order of characters is optimized for better gzip and brotli compression.\n// Same as in non-secure/index.js\nlet urlAlphabet =\n  'useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict'\n\nexport { urlAlphabet }\n"],"mappings":";AAAA,OAAO,YAAY;;;ACGnB,IAAI,cACF;;;ADKF,IAAM,uBAAuB;AAC7B,IAAI;AAAJ,IAAU;AAEV,IAAI,WAAW,WAAS;AACtB,MAAI,CAAC,QAAQ,KAAK,SAAS,OAAO;AAChC,WAAO,OAAO,YAAY,QAAQ,oBAAoB;AACtD,WAAO,eAAe,IAAI;AAC1B,iBAAa;AAAA,EACf,WAAW,aAAa,QAAQ,KAAK,QAAQ;AAC3C,WAAO,eAAe,IAAI;AAC1B,iBAAa;AAAA,EACf;AACA,gBAAc;AAChB;AA8CA,IAAI,SAAS,CAAC,OAAO,OAAO;AAE1B,WAAU,QAAQ,CAAE;AACpB,MAAI,KAAK;AAET,WAAS,IAAI,aAAa,MAAM,IAAI,YAAY,KAAK;AAMnD,UAAM,YAAY,KAAK,CAAC,IAAI,EAAE;AAAA,EAChC;AACA,SAAO;AACT;","names":[]}