@alxgrn/prose-editor 0.0.13 → 0.0.14

package/dist/prose-editor.es.js

@@ -1,7 +1,7 @@
 import './index.css';var Rf = Object.defineProperty;
 var If = (n, e, t) => e in n ? Rf(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
 var F = (n, e, t) => If(n, typeof e != "symbol" ? e + "" : e, t);
-import A, { createContext as ct, useLayoutEffect as Pf, useContext as oe, forwardRef as Ge, useState as N, useRef as I, useImperativeHandle as ns, useCallback as He, useMemo as Me, useReducer as vf, memo as Fe, createElement as Hn, useSyncExternalStore as Vf, cloneElement as rs, Component as $f, useEffect as q } from "react";
+import A, { createContext as ct, useLayoutEffect as Pf, useContext as ie, forwardRef as Ge, useState as N, useRef as I, useImperativeHandle as ns, useCallback as He, useMemo as Me, useReducer as vf, memo as Fe, createElement as Hn, useSyncExternalStore as Vf, cloneElement as rs, Component as $f, useEffect as q } from "react";
 import { unstable_batchedUpdates as zf, flushSync as Ri, createPortal as jf } from "react-dom";
 import { Icons as O, Prompt as Ff, Modal as Pa, Form as va, Image as Bf, Input as Pr, Editable as Va, Button as Lf, Menu as Fn } from "@alxgrn/telefrag-ui";
 function Wf(n) {
@@ -58,11 +58,11 @@ function qf() {
         return b.$$typeof === mr ? null : b.displayName || b.name || null;
       if (typeof b == "string") return b;
       switch (b) {
-        case D:
+        case R:
           return "Fragment";
-        case P:
-          return "Portal";
         case z:
+          return "Portal";
+        case v:
           return "Profiler";
         case B:
           return "StrictMode";
@@ -75,11 +75,11 @@ function qf() {
         switch (typeof b.tag == "number" && console.error(
           "Received an unexpected object in getComponentNameFromType(). This is likely a bug in React. Please file an issue."
         ), b.$$typeof) {
-          case _:
+          case L:
             return (b.displayName || "Context") + ".Provider";
-          case R:
+          case D:
             return (b._context.displayName || "Context") + ".Consumer";
-          case ke:
+          case ee:
             var E = b.render;
             return b = b.displayName, b || (b = E.displayName || E.name || "", b = b !== "" ? "ForwardRef(" + b + ")" : "ForwardRef"), b;
           case $e:
@@ -105,11 +105,11 @@ function qf() {
       }
       if (E) {
         E = console;
-        var T = E.error, L = typeof Symbol == "function" && Symbol.toStringTag && b[Symbol.toStringTag] || b.constructor.name || "Object";
+        var T = E.error, W = typeof Symbol == "function" && Symbol.toStringTag && b[Symbol.toStringTag] || b.constructor.name || "Object";
         return T.call(
           E,
           "The provided key is an unsupported type %s. This value must be coerced to a string before using it here.",
-          L
+          W
         ), e(b);
       }
     }
@@ -170,10 +170,10 @@ function qf() {
       var T = ws.get(b);
       if (T !== void 0) return T;
       Cs = !0, T = Error.prepareStackTrace, Error.prepareStackTrace = void 0;
-      var L = null;
-      L = zt.H, zt.H = null, s();
+      var W = null;
+      W = zt.H, zt.H = null, s();
       try {
-        var ie = {
+        var le = {
           DetermineComponentFrameRoot: function() {
             try {
               if (E) {
@@ -215,22 +215,22 @@ function qf() {
             return [null, null];
           }
         };
-        ie.DetermineComponentFrameRoot.displayName = "DetermineComponentFrameRoot";
+        le.DetermineComponentFrameRoot.displayName = "DetermineComponentFrameRoot";
         var J = Object.getOwnPropertyDescriptor(
-          ie.DetermineComponentFrameRoot,
+          le.DetermineComponentFrameRoot,
           "name"
         );
         J && J.configurable && Object.defineProperty(
-          ie.DetermineComponentFrameRoot,
+          le.DetermineComponentFrameRoot,
           "name",
           { value: "DetermineComponentFrameRoot" }
         );
-        var j = ie.DetermineComponentFrameRoot(), Ze = j[0], ln = j[1];
+        var j = le.DetermineComponentFrameRoot(), Ze = j[0], ln = j[1];
         if (Ze && ln) {
-          var de = Ze.split(`
+          var he = Ze.split(`
 `), Ft = ln.split(`
 `);
-          for (j = J = 0; J < de.length && !de[J].includes(
+          for (j = J = 0; J < he.length && !he[J].includes(
             "DetermineComponentFrameRoot"
           ); )
             J++;
@@ -238,16 +238,16 @@ function qf() {
             "DetermineComponentFrameRoot"
           ); )
             j++;
-          if (J === de.length || j === Ft.length)
-            for (J = de.length - 1, j = Ft.length - 1; 1 <= J && 0 <= j && de[J] !== Ft[j]; )
+          if (J === he.length || j === Ft.length)
+            for (J = he.length - 1, j = Ft.length - 1; 1 <= J && 0 <= j && he[J] !== Ft[j]; )
               j--;
           for (; 1 <= J && 0 <= j; J--, j--)
-            if (de[J] !== Ft[j]) {
+            if (he[J] !== Ft[j]) {
               if (J !== 1 || j !== 1)
                 do
-                  if (J--, j--, 0 > j || de[J] !== Ft[j]) {
+                  if (J--, j--, 0 > j || he[J] !== Ft[j]) {
                     var Rn = `
-` + de[J].replace(
+` + he[J].replace(
                       " at new ",
                       " at "
                     );
@@ -258,9 +258,9 @@ function qf() {
             }
         }
       } finally {
-        Cs = !1, zt.H = L, o(), Error.prepareStackTrace = T;
+        Cs = !1, zt.H = W, o(), Error.prepareStackTrace = T;
       }
-      return de = (de = b ? b.displayName || b.name : "") ? i(de) : "", typeof b == "function" && ws.set(b, de), de;
+      return he = (he = b ? b.displayName || b.name : "") ? i(he) : "", typeof b == "function" && ws.set(b, he), he;
     }
     function a(b) {
       if (b == null) return "";
@@ -280,7 +280,7 @@ function qf() {
       }
       if (typeof b == "object")
         switch (b.$$typeof) {
-          case ke:
+          case ee:
             return b = l(b.render, !1), b;
           case $e:
             return a(b.type);
@@ -322,13 +322,13 @@ function qf() {
         "Accessing element.ref was removed in React 19. ref is now a regular prop. It will be removed from the JSX Element type in a future release."
       )), b = this.props.ref, b !== void 0 ? b : null;
     }
-    function h(b, E, T, L, ie, J) {
+    function h(b, E, T, W, le, J) {
       return T = J.ref, b = {
-        $$typeof: v,
+        $$typeof: P,
         type: b,
         key: E,
         props: J,
-        _owner: ie
+        _owner: le
       }, (T !== void 0 ? T : null) !== null ? Object.defineProperty(b, "ref", {
         enumerable: !1,
         get: d
@@ -344,14 +344,14 @@ function qf() {
         value: null
       }), Object.freeze && (Object.freeze(b.props), Object.freeze(b)), b;
     }
-    function p(b, E, T, L, ie, J) {
-      if (typeof b == "string" || typeof b == "function" || b === D || b === z || b === B || b === dt || b === Ee || b === on || typeof b == "object" && b !== null && (b.$$typeof === $t || b.$$typeof === $e || b.$$typeof === _ || b.$$typeof === R || b.$$typeof === ke || b.$$typeof === Tf || b.getModuleId !== void 0)) {
+    function p(b, E, T, W, le, J) {
+      if (typeof b == "string" || typeof b == "function" || b === R || b === v || b === B || b === dt || b === Ee || b === on || typeof b == "object" && b !== null && (b.$$typeof === $t || b.$$typeof === $e || b.$$typeof === L || b.$$typeof === D || b.$$typeof === ee || b.$$typeof === Tf || b.getModuleId !== void 0)) {
         var j = E.children;
         if (j !== void 0)
-          if (L)
+          if (W)
             if (Ss(j)) {
-              for (L = 0; L < j.length; L++)
-                y(j[L], b);
+              for (W = 0; W < j.length; W++)
+                y(j[W], b);
               Object.freeze && Object.freeze(j);
             } else
               console.error(
@@ -359,28 +359,28 @@ function qf() {
               );
           else y(j, b);
       } else
-        j = "", (b === void 0 || typeof b == "object" && b !== null && Object.keys(b).length === 0) && (j += " You likely forgot to export your component from the file it's defined in, or you might have mixed up default and named imports."), b === null ? L = "null" : Ss(b) ? L = "array" : b !== void 0 && b.$$typeof === v ? (L = "<" + (n(b.type) || "Unknown") + " />", j = " Did you accidentally export a JSX literal instead of a component?") : L = typeof b, console.error(
+        j = "", (b === void 0 || typeof b == "object" && b !== null && Object.keys(b).length === 0) && (j += " You likely forgot to export your component from the file it's defined in, or you might have mixed up default and named imports."), b === null ? W = "null" : Ss(b) ? W = "array" : b !== void 0 && b.$$typeof === P ? (W = "<" + (n(b.type) || "Unknown") + " />", j = " Did you accidentally export a JSX literal instead of a component?") : W = typeof b, console.error(
           "React.jsx: type is invalid -- expected a string (for built-in components) or a class/function (for composite components) but got: %s.%s",
-          L,
+          W,
           j
         );
       if (bi.call(E, "key")) {
         j = n(b);
-        var Ze = Object.keys(E).filter(function(de) {
-          return de !== "key";
+        var Ze = Object.keys(E).filter(function(he) {
+          return he !== "key";
         });
-        L = 0 < Ze.length ? "{key: someKey, " + Ze.join(": ..., ") + ": ...}" : "{key: someKey}", Ti[j + L] || (Ze = 0 < Ze.length ? "{" + Ze.join(": ..., ") + ": ...}" : "{}", console.error(
+        W = 0 < Ze.length ? "{key: someKey, " + Ze.join(": ..., ") + ": ...}" : "{key: someKey}", Ti[j + W] || (Ze = 0 < Ze.length ? "{" + Ze.join(": ..., ") + ": ...}" : "{}", console.error(
           `A props object containing a "key" prop is being spread into JSX:
   let props = %s;
   <%s {...props} />
 React keys must be passed directly to JSX without using spread:
   let props = %s;
   <%s key={someKey} {...props} />`,
-          L,
+          W,
           j,
           Ze,
           j
-        ), Ti[j + L] = !0);
+        ), Ti[j + W] = !0);
       }
       if (j = null, T !== void 0 && (t(T), j = "" + T), u(E) && (t(E.key), j = "" + E.key), "key" in E) {
         T = {};
@@ -390,14 +390,14 @@ React keys must be passed directly to JSX without using spread:
       return j && f(
         T,
         typeof b == "function" ? b.displayName || b.name || "Unknown" : b
-      ), h(b, j, J, ie, c(), T);
+      ), h(b, j, J, le, c(), T);
     }
     function y(b, E) {
       if (typeof b == "object" && b && b.$$typeof !== Af) {
         if (Ss(b))
           for (var T = 0; T < b.length; T++) {
-            var L = b[T];
-            m(L) && x(L, E);
+            var W = b[T];
+            m(W) && x(W, E);
           }
         else if (m(b))
           b._store && (b._store.validated = 1);
@@ -407,22 +407,22 @@ React keys must be passed directly to JSX without using spread:
       }
     }
     function m(b) {
-      return typeof b == "object" && b !== null && b.$$typeof === v;
+      return typeof b == "object" && b !== null && b.$$typeof === P;
     }
     function x(b, E) {
       if (b._store && !b._store.validated && b.key == null && (b._store.validated = 1, E = k(E), !Ai[E])) {
         Ai[E] = !0;
         var T = "";
         b && b._owner != null && b._owner !== c() && (T = null, typeof b._owner.tag == "number" ? T = n(b._owner.type) : typeof b._owner.name == "string" && (T = b._owner.name), T = " It was passed a child from " + T + ".");
-        var L = zt.getCurrentStack;
+        var W = zt.getCurrentStack;
         zt.getCurrentStack = function() {
-          var ie = a(b.type);
-          return L && (ie += L() || ""), ie;
+          var le = a(b.type);
+          return W && (le += W() || ""), le;
         }, console.error(
           'Each child in a list should have a unique "key" prop.%s%s See https://react.dev/link/warning-keys for more information.',
           E,
           T
-        ), zt.getCurrentStack = L;
+        ), zt.getCurrentStack = W;
       }
     }
     function k(b) {
@@ -433,23 +433,23 @@ Check the render method of \`` + T + "`."), E || (b = n(b)) && (E = `
 
 Check the top-level render call using <` + b + ">."), E;
     }
-    var M = A, v = Symbol.for("react.transitional.element"), P = Symbol.for("react.portal"), D = Symbol.for("react.fragment"), B = Symbol.for("react.strict_mode"), z = Symbol.for("react.profiler"), R = Symbol.for("react.consumer"), _ = Symbol.for("react.context"), ke = Symbol.for("react.forward_ref"), dt = Symbol.for("react.suspense"), Ee = Symbol.for("react.suspense_list"), $e = Symbol.for("react.memo"), $t = Symbol.for("react.lazy"), on = Symbol.for("react.offscreen"), Tn = Symbol.iterator, mr = Symbol.for("react.client.reference"), zt = M.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE, bi = Object.prototype.hasOwnProperty, jt = Object.assign, Tf = Symbol.for("react.client.reference"), Ss = Array.isArray, An = 0, xi, Si, ki, Ci, wi, Mi, Ni;
+    var M = A, P = Symbol.for("react.transitional.element"), z = Symbol.for("react.portal"), R = Symbol.for("react.fragment"), B = Symbol.for("react.strict_mode"), v = Symbol.for("react.profiler"), D = Symbol.for("react.consumer"), L = Symbol.for("react.context"), ee = Symbol.for("react.forward_ref"), dt = Symbol.for("react.suspense"), Ee = Symbol.for("react.suspense_list"), $e = Symbol.for("react.memo"), $t = Symbol.for("react.lazy"), on = Symbol.for("react.offscreen"), Tn = Symbol.iterator, mr = Symbol.for("react.client.reference"), zt = M.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE, bi = Object.prototype.hasOwnProperty, jt = Object.assign, Tf = Symbol.for("react.client.reference"), Ss = Array.isArray, An = 0, xi, Si, ki, Ci, wi, Mi, Ni;
     r.__reactDisabledLog = !0;
     var ks, Di, Cs = !1, ws = new (typeof WeakMap == "function" ? WeakMap : Map)(), Af = Symbol.for("react.client.reference"), Oi, Ei = {}, Ti = {}, Ai = {};
-    Pn.Fragment = D, Pn.jsx = function(b, E, T, L, ie) {
-      return p(b, E, T, !1, L, ie);
-    }, Pn.jsxs = function(b, E, T, L, ie) {
-      return p(b, E, T, !0, L, ie);
+    Pn.Fragment = R, Pn.jsx = function(b, E, T, W, le) {
+      return p(b, E, T, !1, W, le);
+    }, Pn.jsxs = function(b, E, T, W, le) {
+      return p(b, E, T, !0, W, le);
     };
   }()), Pn;
 }
 process.env.NODE_ENV === "production" ? eo.exports = _f() : eo.exports = qf();
 var g = eo.exports;
-function ee(n) {
+function te(n) {
   this.content = n;
 }
-ee.prototype = {
-  constructor: ee,
+te.prototype = {
+  constructor: te,
   find: function(n) {
     for (var e = 0; e < this.content.length; e += 2)
       if (this.content[e] === n) return e;
@@ -468,7 +468,7 @@ ee.prototype = {
   // given, the key of the binding will be replaced with that key.
   update: function(n, e, t) {
     var r = t && t != n ? this.remove(t) : this, s = r.find(n), o = r.content.slice();
-    return s == -1 ? o.push(t || n, e) : (o[s + 1] = e, t && (o[s] = t)), new ee(o);
+    return s == -1 ? o.push(t || n, e) : (o[s + 1] = e, t && (o[s] = t)), new te(o);
   },
   // :: (string) → OrderedMap
   // Return a map with the given key removed, if it existed.
@@ -476,25 +476,25 @@ ee.prototype = {
     var e = this.find(n);
     if (e == -1) return this;
     var t = this.content.slice();
-    return t.splice(e, 2), new ee(t);
+    return t.splice(e, 2), new te(t);
   },
   // :: (string, any) → OrderedMap
   // Add a new key to the start of the map.
   addToStart: function(n, e) {
-    return new ee([n, e].concat(this.remove(n).content));
+    return new te([n, e].concat(this.remove(n).content));
   },
   // :: (string, any) → OrderedMap
   // Add a new key to the end of the map.
   addToEnd: function(n, e) {
     var t = this.remove(n).content.slice();
-    return t.push(n, e), new ee(t);
+    return t.push(n, e), new te(t);
   },
   // :: (string, string, any) → OrderedMap
   // Add a key after the given key. If `place` is not found, the new
   // key is added to the end.
   addBefore: function(n, e, t) {
     var r = this.remove(e), s = r.content.slice(), o = r.find(n);
-    return s.splice(o == -1 ? s.length : o, 0, e, t), new ee(s);
+    return s.splice(o == -1 ? s.length : o, 0, e, t), new te(s);
   },
   // :: ((key: string, value: any))
   // Call the given function for each key/value pair in the map, in
@@ -507,20 +507,20 @@ ee.prototype = {
   // Create a new map by prepending the keys in this map that don't
   // appear in `map` before the keys in `map`.
   prepend: function(n) {
-    return n = ee.from(n), n.size ? new ee(n.content.concat(this.subtract(n).content)) : this;
+    return n = te.from(n), n.size ? new te(n.content.concat(this.subtract(n).content)) : this;
   },
   // :: (union<Object, OrderedMap>) → OrderedMap
   // Create a new map by appending the keys in this map that don't
   // appear in `map` after the keys in `map`.
   append: function(n) {
-    return n = ee.from(n), n.size ? new ee(this.subtract(n).content.concat(n.content)) : this;
+    return n = te.from(n), n.size ? new te(this.subtract(n).content.concat(n.content)) : this;
   },
   // :: (union<Object, OrderedMap>) → OrderedMap
   // Create a map containing all the keys in this map that don't
   // appear in `map`.
   subtract: function(n) {
     var e = this;
-    n = ee.from(n);
+    n = te.from(n);
     for (var t = 0; t < n.content.length; t += 2)
       e = e.remove(n.content[t]);
     return e;
@@ -539,11 +539,11 @@ ee.prototype = {
     return this.content.length >> 1;
   }
 };
-ee.from = function(n) {
-  if (n instanceof ee) return n;
+te.from = function(n) {
+  if (n instanceof te) return n;
   var e = [];
   if (n) for (var t in n) e.push(t, n[t]);
-  return new ee(e);
+  return new te(e);
 };
 function $a(n, e, t) {
   for (let r = 0; ; r++) {
@@ -875,7 +875,7 @@ function vr(n, e) {
   }
   return !0;
 }
-class W {
+class _ {
   /**
   @internal
   */
@@ -973,14 +973,14 @@ class W {
   */
   static setFrom(e) {
     if (!e || Array.isArray(e) && e.length == 0)
-      return W.none;
-    if (e instanceof W)
+      return _.none;
+    if (e instanceof _)
       return [e];
     let t = e.slice();
     return t.sort((r, s) => r.type.rank - s.type.rank), t;
   }
 }
-W.none = [];
+_.none = [];
 class Vr extends Error {
 }
 class C {
@@ -1278,7 +1278,7 @@ class Jn {
   marks() {
     let e = this.parent, t = this.index();
     if (e.content.size == 0)
-      return W.none;
+      return _.none;
     if (this.textOffset)
       return e.child(t).marks;
     let r = e.maybeChild(t - 1), s = e.maybeChild(t);
@@ -1445,7 +1445,7 @@ class Ne {
   /**
   @internal
   */
-  constructor(e, t, r, s = W.none) {
+  constructor(e, t, r, s = _.none) {
     this.type = e, this.attrs = t, this.marks = s, this.content = r || S.empty;
   }
   /**
@@ -1559,7 +1559,7 @@ class Ne {
   attributes, and marks.
   */
   hasMarkup(e, t, r) {
-    return this.type == e && vr(this.attrs, t || e.defaultAttrs || Yf) && W.sameSet(this.marks, r || W.none);
+    return this.type == e && vr(this.attrs, t || e.defaultAttrs || Yf) && _.sameSet(this.marks, r || _.none);
   }
   /**
   Create a new node with the same markup as this node, containing
@@ -1769,12 +1769,12 @@ class Ne {
   */
   check() {
     this.type.checkContent(this.content), this.type.checkAttrs(this.attrs);
-    let e = W.none;
+    let e = _.none;
     for (let t = 0; t < this.marks.length; t++) {
       let r = this.marks[t];
       r.type.checkAttrs(r.attrs), e = r.addToSet(e);
     }
-    if (!W.sameSet(e, this.marks))
+    if (!_.sameSet(e, this.marks))
       throw new RangeError(`Invalid collection of marks for node ${this.type.name}: ${this.marks.map((t) => t.type.name)}`);
     this.content.forEach((t) => t.check());
   }
@@ -2317,7 +2317,7 @@ let zi = class Ga {
   create(e = null, t, r) {
     if (this.isText)
       throw new Error("NodeType.create can't construct text nodes");
-    return new Ne(this, this.computeAttrs(e), S.from(t), W.setFrom(r));
+    return new Ne(this, this.computeAttrs(e), S.from(t), _.setFrom(r));
   }
   /**
   Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but check the given content
@@ -2325,7 +2325,7 @@ let zi = class Ga {
   if it doesn't match.
   */
   createChecked(e = null, t, r) {
-    return t = S.from(t), this.checkContent(t), new Ne(this, this.computeAttrs(e), t, W.setFrom(r));
+    return t = S.from(t), this.checkContent(t), new Ne(this, this.computeAttrs(e), t, _.setFrom(r));
   }
   /**
   Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but see if it is
@@ -2343,7 +2343,7 @@ let zi = class Ga {
       t = i.append(t);
     }
     let s = this.contentMatch.matchFragment(t), o = s && s.fillBefore(S.empty, !0);
-    return o ? new Ne(this, e, t.append(o), W.setFrom(r)) : null;
+    return o ? new Ne(this, e, t.append(o), _.setFrom(r)) : null;
   }
   /**
   Returns true if the given fragment is valid content for this node
@@ -2399,7 +2399,7 @@ let zi = class Ga {
     let t;
     for (let r = 0; r < e.length; r++)
       this.allowsMarkType(e[r].type) ? t && t.push(e[r]) : t || (t = e.slice(0, r));
-    return t ? t.length ? t : W.none : e;
+    return t ? t.length ? t : _.none : e;
   }
   /**
   @internal
@@ -2440,7 +2440,7 @@ class ss {
   constructor(e, t, r, s) {
     this.name = e, this.rank = t, this.schema = r, this.spec = s, this.attrs = Ya(e, s.attrs), this.excluded = null;
     let o = Ja(this.attrs);
-    this.instance = o ? new W(this, o) : null;
+    this.instance = o ? new _(this, o) : null;
   }
   /**
   Create a mark of this type. `attrs` may be `null` or an object
@@ -2448,7 +2448,7 @@ class ss {
   they have defaults, will be added.
   */
   create(e = null) {
-    return !e && this.instance ? this.instance : new W(this, Ka(this.attrs, e));
+    return !e && this.instance ? this.instance : new _(this, Ka(this.attrs, e));
   }
   /**
   @internal
@@ -2497,7 +2497,7 @@ class is {
     let t = this.spec = {};
     for (let s in e)
       t[s] = e[s];
-    t.nodes = ee.from(e.nodes), t.marks = ee.from(e.marks || {}), this.nodes = zi.compile(this.spec.nodes, this), this.marks = ss.compile(this.spec.marks, this);
+    t.nodes = te.from(e.nodes), t.marks = te.from(e.marks || {}), this.nodes = zi.compile(this.spec.nodes, this), this.marks = ss.compile(this.spec.marks, this);
     let r = /* @__PURE__ */ Object.create(null);
     for (let s in this.nodes) {
       if (s in this.marks)
@@ -2539,7 +2539,7 @@ class is {
   */
   text(e, t) {
     let r = this.nodes.text;
-    return new jr(r, r.defaultAttrs, e, W.setFrom(t));
+    return new jr(r, r.defaultAttrs, e, _.setFrom(t));
   }
   /**
   Create a mark with the given type and attributes.
@@ -2559,7 +2559,7 @@ class is {
   bound.
   */
   markFromJSON(e) {
-    return W.fromJSON(this, e);
+    return _.fromJSON(this, e);
   }
   /**
   @internal
@@ -2620,7 +2620,7 @@ class Xt {
   */
   parse(e, t = {}) {
     let r = new Bi(this, t, !1);
-    return r.addAll(e, W.none, t.from, t.to), r.finish();
+    return r.addAll(e, _.none, t.from, t.to), r.finish();
   }
   /**
   Parses the content of the given DOM node, like
@@ -2632,7 +2632,7 @@ class Xt {
   */
   parseSlice(e, t = {}) {
     let r = new Bi(this, t, !0);
-    return r.addAll(e, W.none, t.from, t.to), C.maxOpen(r.finish());
+    return r.addAll(e, _.none, t.from, t.to), C.maxOpen(r.finish());
   }
   /**
   @internal
@@ -2754,7 +2754,7 @@ function Fi(n, e, t) {
 }
 class br {
   constructor(e, t, r, s, o, i) {
-    this.type = e, this.attrs = t, this.marks = r, this.solid = s, this.options = i, this.content = [], this.activeMarks = W.none, this.match = o || (i & Dr ? null : e.contentMatch);
+    this.type = e, this.attrs = t, this.marks = r, this.solid = s, this.options = i, this.content = [], this.activeMarks = _.none, this.match = o || (i & Dr ? null : e.contentMatch);
   }
   findWrapping(e) {
     if (!this.match) {
@@ -2789,7 +2789,7 @@ class Bi {
   constructor(e, t, r) {
     this.parser = e, this.options = t, this.isOpen = r, this.open = 0, this.localPreserveWS = !1;
     let s = t.topNode, o, i = Fi(null, t.preserveWhitespace, 0) | (r ? Dr : 0);
-    s ? o = new br(s.type, s.attrs, W.none, !0, t.topMatch || s.type.contentMatch, i) : r ? o = new br(null, null, W.none, !0, null, i) : o = new br(e.schema.topNodeType, null, W.none, !0, null, i), this.nodes = [o], this.find = t.findPositions, this.needsBlock = !1;
+    s ? o = new br(s.type, s.attrs, _.none, !0, t.topMatch || s.type.contentMatch, i) : r ? o = new br(null, null, _.none, !0, null, i) : o = new br(e.schema.topNodeType, null, _.none, !0, null, i), this.nodes = [o], this.find = t.findPositions, this.needsBlock = !1;
   }
   get top() {
     return this.nodes[this.open];
@@ -2944,7 +2944,7 @@ class Bi {
       this.closeExtra();
       let o = this.top;
       o.match && (o.match = o.match.matchType(e.type));
-      let i = W.none;
+      let i = _.none;
       for (let l of s.concat(e.marks))
         (o.type ? o.type.allowsMarkType(l.type) : Wi(l.type, e.type)) && (i = l.addToSet(i));
       return o.content.push(e.mark(i)), !0;
@@ -2964,7 +2964,7 @@ class Bi {
     i.match = i.match && i.match.matchType(e);
     let l = Fi(e, o, i.options);
     i.options & Dr && i.content.length == 0 && (l |= Dr);
-    let a = W.none;
+    let a = _.none;
     return r = r.filter((c) => (i.type ? i.type.allowsMarkType(c.type) : Wi(c.type, e)) ? (a = c.addToSet(a), !1) : !0), this.nodes.push(new br(e, t, a, s, null, l)), this.open++, r;
   }
   // Make sure all nodes above this.open are finished and added to
@@ -3520,7 +3520,7 @@ class Un {
   }
 }
 const Ds = /* @__PURE__ */ Object.create(null);
-class fe {
+class de {
   /**
   Get the step map that represents the changes made by this step,
   and which can be used to transform between positions in the old
@@ -3603,7 +3603,7 @@ function vo(n, e, t) {
   }
   return S.fromArray(r);
 }
-class kt extends fe {
+class kt extends de {
   /**
   Create a mark step.
   */
@@ -3641,8 +3641,8 @@ class kt extends fe {
     return new kt(t.from, t.to, e.markFromJSON(t.mark));
   }
 }
-fe.jsonID("addMark", kt);
-class _e extends fe {
+de.jsonID("addMark", kt);
+class _e extends de {
   /**
   Create a mark-removing step.
   */
@@ -3680,8 +3680,8 @@ class _e extends fe {
     return new _e(t.from, t.to, e.markFromJSON(t.mark));
   }
 }
-fe.jsonID("removeMark", _e);
-class Ct extends fe {
+de.jsonID("removeMark", _e);
+class Ct extends de {
   /**
   Create a node mark step.
   */
@@ -3724,8 +3724,8 @@ class Ct extends fe {
     return new Ct(t.pos, e.markFromJSON(t.mark));
   }
 }
-fe.jsonID("addNodeMark", Ct);
-class Qt extends fe {
+de.jsonID("addNodeMark", Ct);
+class Qt extends de {
   /**
   Create a mark-removing step.
   */
@@ -3759,8 +3759,8 @@ class Qt extends fe {
     return new Qt(t.pos, e.markFromJSON(t.mark));
   }
 }
-fe.jsonID("removeNodeMark", Qt);
-class ae extends fe {
+de.jsonID("removeNodeMark", Qt);
+class ce extends de {
   /**
   The given `slice` should fit the 'gap' between `from` and
   `to`—the depths must line up, and the surrounding nodes must be
@@ -3780,21 +3780,21 @@ class ae extends fe {
     return new we([this.from, this.to - this.from, this.slice.size]);
   }
   invert(e) {
-    return new ae(this.from, this.from + this.slice.size, e.slice(this.from, this.to));
+    return new ce(this.from, this.from + this.slice.size, e.slice(this.from, this.to));
   }
   map(e) {
     let t = e.mapResult(this.from, 1), r = e.mapResult(this.to, -1);
-    return t.deletedAcross && r.deletedAcross ? null : new ae(t.pos, Math.max(t.pos, r.pos), this.slice, this.structure);
+    return t.deletedAcross && r.deletedAcross ? null : new ce(t.pos, Math.max(t.pos, r.pos), this.slice, this.structure);
   }
   merge(e) {
-    if (!(e instanceof ae) || e.structure || this.structure)
+    if (!(e instanceof ce) || e.structure || this.structure)
       return null;
     if (this.from + this.slice.size == e.from && !this.slice.openEnd && !e.slice.openStart) {
       let t = this.slice.size + e.slice.size == 0 ? C.empty : new C(this.slice.content.append(e.slice.content), this.slice.openStart, e.slice.openEnd);
-      return new ae(this.from, this.to + (e.to - e.from), t, this.structure);
+      return new ce(this.from, this.to + (e.to - e.from), t, this.structure);
     } else if (e.to == this.from && !this.slice.openStart && !e.slice.openEnd) {
       let t = this.slice.size + e.slice.size == 0 ? C.empty : new C(e.slice.content.append(this.slice.content), e.slice.openStart, this.slice.openEnd);
-      return new ae(e.from, this.to, t, this.structure);
+      return new ce(e.from, this.to, t, this.structure);
     } else
       return null;
   }
@@ -3808,11 +3808,11 @@ class ae extends fe {
   static fromJSON(e, t) {
     if (typeof t.from != "number" || typeof t.to != "number")
       throw new RangeError("Invalid input for ReplaceStep.fromJSON");
-    return new ae(t.from, t.to, C.fromJSON(e, t.slice), !!t.structure);
+    return new ce(t.from, t.to, C.fromJSON(e, t.slice), !!t.structure);
   }
 }
-fe.jsonID("replace", ae);
-class se extends fe {
+de.jsonID("replace", ce);
+class oe extends de {
   /**
   Create a replace-around step with the given range and gap.
   `insert` should be the point in the slice into which the content
@@ -3843,11 +3843,11 @@ class se extends fe {
   }
   invert(e) {
     let t = this.gapTo - this.gapFrom;
-    return new se(this.from, this.from + this.slice.size + t, this.from + this.insert, this.from + this.insert + t, e.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);
+    return new oe(this.from, this.from + this.slice.size + t, this.from + this.insert, this.from + this.insert + t, e.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);
   }
   map(e) {
     let t = e.mapResult(this.from, 1), r = e.mapResult(this.to, -1), s = this.from == this.gapFrom ? t.pos : e.map(this.gapFrom, -1), o = this.to == this.gapTo ? r.pos : e.map(this.gapTo, 1);
-    return t.deletedAcross && r.deletedAcross || s < t.pos || o > r.pos ? null : new se(t.pos, r.pos, s, o, this.slice, this.insert, this.structure);
+    return t.deletedAcross && r.deletedAcross || s < t.pos || o > r.pos ? null : new oe(t.pos, r.pos, s, o, this.slice, this.insert, this.structure);
   }
   toJSON() {
     let e = {
@@ -3866,10 +3866,10 @@ class se extends fe {
   static fromJSON(e, t) {
     if (typeof t.from != "number" || typeof t.to != "number" || typeof t.gapFrom != "number" || typeof t.gapTo != "number" || typeof t.insert != "number")
       throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON");
-    return new se(t.from, t.to, t.gapFrom, t.gapTo, C.fromJSON(e, t.slice), t.insert, !!t.structure);
+    return new oe(t.from, t.to, t.gapFrom, t.gapTo, C.fromJSON(e, t.slice), t.insert, !!t.structure);
   }
 }
-fe.jsonID("replaceAround", se);
+de.jsonID("replaceAround", oe);
 function so(n, e, t) {
   let r = n.resolve(e), s = t - e, o = r.depth;
   for (; s > 0 && o > 0 && r.indexAfter(o) == r.node(o).childCount; )
@@ -3928,7 +3928,7 @@ function Vo(n, e, t, r = t.contentMatch, s = !0) {
   for (let a = 0; a < o.childCount; a++) {
     let c = o.child(a), u = l + c.nodeSize, f = r.matchType(c.type);
     if (!f)
-      i.push(new ae(l, u, C.empty));
+      i.push(new ce(l, u, C.empty));
     else {
       r = f;
       for (let d = 0; d < c.marks.length; d++)
@@ -3936,7 +3936,7 @@ function Vo(n, e, t, r = t.contentMatch, s = !0) {
       if (s && c.isText && t.whitespace != "pre") {
         let d, h = /\r?\n|\r/g, p;
         for (; d = h.exec(c.text); )
-          p || (p = new C(S.from(t.schema.text(" ", t.allowedMarks(c.marks))), 0, 0)), i.push(new ae(l + d.index, l + d.index + d[0].length, p));
+          p || (p = new C(S.from(t.schema.text(" ", t.allowedMarks(c.marks))), 0, 0)), i.push(new ce(l + d.index, l + d.index + d[0].length, p));
       }
     }
     l = u;
@@ -3969,7 +3969,7 @@ function xd(n, e, t) {
   let d = S.empty, h = 0;
   for (let p = o, y = !1; p > t; p--)
     y || s.after(p + 1) < s.end(p) ? (y = !0, d = S.from(s.node(p).copy(d)), h++) : c++;
-  n.step(new se(a, c, i, l, new C(u.append(d), f, h), u.size - f, !0));
+  n.step(new oe(a, c, i, l, new C(u.append(d), f, h), u.size - f, !0));
 }
 function $o(n, e, t = null, r = n) {
   let s = Sd(n, e), o = s && kd(r, e);
@@ -4005,7 +4005,7 @@ function Cd(n, e, t) {
     r = S.from(t[i].type.create(t[i].attrs, r));
   }
   let s = e.start, o = e.end;
-  n.step(new se(s, o, s, o, new C(r, 0, 0), t.length, !0));
+  n.step(new oe(s, o, s, o, new C(r, 0, 0), t.length, !0));
 }
 function wd(n, e, t, r, s) {
   if (!r.isTextblock)
@@ -4021,7 +4021,7 @@ function wd(n, e, t, r, s) {
       }
       c === !1 && oc(n, i, l, o), Vo(n, n.mapping.slice(o).map(l, 1), r, void 0, c === null);
       let u = n.mapping.slice(o), f = u.map(l, 1), d = u.map(l + i.nodeSize, 1);
-      return n.step(new se(f, d, f + 1, d - 1, new C(S.from(r.create(a, null, i.marks)), 0, 0), 1, !0)), c === !0 && sc(n, i, l, o), !1;
+      return n.step(new oe(f, d, f + 1, d - 1, new C(S.from(r.create(a, null, i.marks)), 0, 0), 1, !0)), c === !0 && sc(n, i, l, o), !1;
     }
   });
 }
@@ -4059,7 +4059,7 @@ function Nd(n, e, t, r, s) {
     return n.replaceWith(e, e + o.nodeSize, i);
   if (!t.validContent(o.content))
     throw new RangeError("Invalid content for node type " + t.name);
-  n.step(new se(e, e + o.nodeSize, e + 1, e + o.nodeSize - 1, new C(S.from(i), 0, 0), 1, !0));
+  n.step(new oe(e, e + o.nodeSize, e + 1, e + o.nodeSize - 1, new C(S.from(i), 0, 0), 1, !0));
 }
 function bn(n, e, t = 1, r) {
   let s = n.resolve(e), o = s.depth - t, i = r && r[r.length - 1] || s.parent;
@@ -4085,7 +4085,7 @@ function Dd(n, e, t = 1, r) {
     let u = r && r[c];
     i = S.from(u ? u.type.create(u.attrs, i) : s.node(l).copy(i));
   }
-  n.step(new ae(e, e, new C(o.append(i), t, t), !0));
+  n.step(new ce(e, e, new C(o.append(i), t, t), !0));
 }
 function En(n, e) {
   let t = n.resolve(e), r = t.index();
@@ -4128,7 +4128,7 @@ function Ed(n, e, t) {
   }
   i.inlineContent && Vo(n, e + t - 1, i, o.node().contentMatchAt(o.index()), r == null);
   let a = n.mapping.slice(l), c = a.map(e - t);
-  if (n.step(new ae(c, a.map(e + t, -1), C.empty, !0)), r === !0) {
+  if (n.step(new ce(c, a.map(e + t, -1), C.empty, !0)), r === !0) {
     let u = n.doc.resolve(c);
     sc(n, u.node(), u.before(), n.steps.length);
   }
@@ -4181,7 +4181,7 @@ function jo(n, e, t = e, r = C.empty) {
   if (e == t && !r.size)
     return null;
   let s = n.resolve(e), o = n.resolve(t);
-  return ac(s, o, r) ? new ae(e, t, r) : new Ad(s, o, r).fit();
+  return ac(s, o, r) ? new ce(e, t, r) : new Ad(s, o, r).fit();
 }
 function ac(n, e, t) {
   return !t.openStart && !t.openEnd && n.start() == e.start() && n.parent.canReplace(n.index(), e.index(), t.content);
@@ -4214,7 +4214,7 @@ class Ad {
     for (; i && l && o.childCount == 1; )
       o = o.firstChild.content, i--, l--;
     let a = new C(o, i, l);
-    return e > -1 ? new se(r.pos, e, this.$to.pos, this.$to.end(), a, t) : a.size || r.pos != this.$to.pos ? new ae(r.pos, s.pos, a) : null;
+    return e > -1 ? new oe(r.pos, e, this.$to.pos, this.$to.end(), a, t) : a.size || r.pos != this.$to.pos ? new ce(r.pos, s.pos, a) : null;
   }
   // Find a position on the start spine of `this.unplaced` that has
   // content that can be moved somewhere on the frontier. Returns two
@@ -4371,7 +4371,7 @@ function Pd(n, e, t, r) {
     return n.deleteRange(e, t);
   let s = n.doc.resolve(e), o = n.doc.resolve(t);
   if (ac(s, o, r))
-    return n.step(new ae(e, t, r));
+    return n.step(new ce(e, t, r));
   let i = fc(s, n.doc.resolve(t));
   i[i.length - 1] == 0 && i.pop();
   let l = -(s.depth + 1);
@@ -4455,7 +4455,7 @@ function fc(n, e) {
   }
   return t;
 }
-class xn extends fe {
+class xn extends de {
   /**
   Construct an attribute step.
   */
@@ -4492,8 +4492,8 @@ class xn extends fe {
     return new xn(t.pos, t.attr, t.value);
   }
 }
-fe.jsonID("attr", xn);
-class Yn extends fe {
+de.jsonID("attr", xn);
+class Yn extends de {
   /**
   Construct an attribute step.
   */
@@ -4526,7 +4526,7 @@ class Yn extends fe {
     return new Yn(t.attr, t.value);
   }
 }
-fe.jsonID("docAttr", Yn);
+de.jsonID("docAttr", Yn);
 let Mn = class extends Error {
 };
 Mn = function n(e) {
@@ -4715,7 +4715,7 @@ class dc {
     let r = this.doc.nodeAt(e);
     if (!r)
       throw new RangeError("No node at position " + e);
-    if (t instanceof W)
+    if (t instanceof _)
       t.isInSet(r.marks) && this.step(new Qt(e, t));
     else {
       let s = r.marks, o, i = [];
@@ -4872,7 +4872,7 @@ class $ {
   negative, it will search backwards first.
   */
   static near(e, t = 1) {
-    return this.findFrom(e, t) || this.findFrom(e, -t) || new xe(e.node(0));
+    return this.findFrom(e, t) || this.findFrom(e, -t) || new Se(e.node(0));
   }
   /**
   Find the cursor or leaf node selection closest to the start of
@@ -4881,14 +4881,14 @@ class $ {
   exists.
   */
   static atStart(e) {
-    return dn(e, e, 0, 0, 1) || new xe(e);
+    return dn(e, e, 0, 0, 1) || new Se(e);
   }
   /**
   Find the cursor or leaf node selection closest to the end of the
   given document.
   */
   static atEnd(e) {
-    return dn(e, e, e.content.size, e.childCount, -1) || new xe(e);
+    return dn(e, e, e.content.size, e.childCount, -1) || new Se(e);
   }
   /**
   Deserialize the JSON representation of a selection. Must be
@@ -5084,7 +5084,7 @@ class Fo {
     return r && w.isSelectable(r) ? new w(t) : $.near(t);
   }
 }
-class xe extends $ {
+class Se extends $ {
   /**
   Create an all-selection over the given document.
   */
@@ -5106,25 +5106,25 @@ class xe extends $ {
   @internal
   */
   static fromJSON(e) {
-    return new xe(e);
+    return new Se(e);
   }
   map(e) {
-    return new xe(e);
+    return new Se(e);
   }
   eq(e) {
-    return e instanceof xe;
+    return e instanceof Se;
   }
   getBookmark() {
     return $d;
   }
 }
-$.jsonID("all", xe);
+$.jsonID("all", Se);
 const $d = {
   map() {
     return this;
   },
   resolve(n) {
-    return new xe(n);
+    return new Se(n);
   }
 };
 function dn(n, e, t, r, s, o = !1) {
@@ -5149,7 +5149,7 @@ function Yi(n, e, t) {
   if (r < e)
     return;
   let s = n.steps[r];
-  if (!(s instanceof ae || s instanceof se))
+  if (!(s instanceof ce || s instanceof oe))
     return;
   let o = n.mapping.maps[r], i;
   o.forEach((l, a, c, u) => {
@@ -5200,7 +5200,7 @@ class zd extends dc {
   this is already the case.
   */
   ensureMarks(e) {
-    return W.sameSet(this.storedMarks || this.selection.$from.marks(), e) || this.setStoredMarks(e), this;
+    return _.sameSet(this.storedMarks || this.selection.$from.marks(), e) || this.setStoredMarks(e), this;
   }
   /**
   Add a mark to the set of stored marks.
@@ -5245,7 +5245,7 @@ class zd extends dc {
   */
   replaceSelectionWith(e, t = !0) {
     let r = this.selection;
-    return t && (e = e.mark(this.storedMarks || (r.empty ? r.$from.marks() : r.$from.marksAcross(r.$to) || W.none))), r.replaceWith(this, e), this;
+    return t && (e = e.mark(this.storedMarks || (r.empty ? r.$from.marks() : r.$from.marksAcross(r.$to) || _.none))), r.replaceWith(this, e), this;
   }
   /**
   Delete the selection.
@@ -5990,10 +5990,10 @@ var Tt = {
   221: "}",
   222: '"'
 }, Ud = typeof navigator < "u" && /Mac/.test(navigator.platform), Yd = typeof navigator < "u" && /MSIE \d|Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(navigator.userAgent);
-for (var te = 0; te < 10; te++) Tt[48 + te] = Tt[96 + te] = String(te);
-for (var te = 1; te <= 24; te++) Tt[te + 111] = "F" + te;
-for (var te = 65; te <= 90; te++)
-  Tt[te] = String.fromCharCode(te + 32), Lr[te] = String.fromCharCode(te);
+for (var ne = 0; ne < 10; ne++) Tt[48 + ne] = Tt[96 + ne] = String(ne);
+for (var ne = 1; ne <= 24; ne++) Tt[ne + 111] = "F" + ne;
+for (var ne = 65; ne <= 90; ne++)
+  Tt[ne] = String.fromCharCode(ne + 32), Lr[ne] = String.fromCharCode(ne);
 for (var vs in Tt) Lr.hasOwnProperty(vs) || (Lr[vs] = Tt[vs]);
 function Gd(n) {
   var e = Ud && n.metaKey && n.shiftKey && !n.ctrlKey && !n.altKey || Yd && n.shiftKey && n.key && n.key.length == 1 || n.key == "Unidentified", t = !e && n.key || (n.shiftKey ? Lr : Tt)[n.keyCode] || n.key || "Unidentified";
@@ -6217,7 +6217,7 @@ const wc = (n, e) => {
   return !0;
 }, ah = (n, e) => {
   let t = n.selection, { $from: r, $to: s } = t;
-  if (t instanceof xe || r.parent.inlineContent || s.parent.inlineContent)
+  if (t instanceof Se || r.parent.inlineContent || s.parent.inlineContent)
     return !1;
   let o = _o(s.parent.contentMatchAt(s.indexAfter()));
   if (!o || !o.isTextblock)
@@ -6257,7 +6257,7 @@ function uh(n) {
         o.unshift(null);
       }
     let u = e.tr;
-    (e.selection instanceof V || e.selection instanceof xe) && u.deleteSelection();
+    (e.selection instanceof V || e.selection instanceof Se) && u.deleteSelection();
     let f = u.mapping.map(r.pos), d = bn(u.doc, f, o.length, o);
     if (d || (o[0] = l ? { type: l } : null, d = bn(u.doc, f, o.length, o)), !d)
       return !1;
@@ -6271,7 +6271,7 @@ function uh(n) {
 const fh = uh(), Mc = (n, e) => {
   let { $from: t, to: r } = n.selection, s, o = t.sharedDepth(r);
   return o == 0 ? !1 : (s = t.before(o), e && e(n.tr.setSelection(w.create(n.doc, s))), !0);
-}, dh = (n, e) => (e && e(n.tr.setSelection(new xe(n.doc))), !0);
+}, dh = (n, e) => (e && e(n.tr.setSelection(new Se(n.doc))), !0);
 function hh(n, e, t) {
   let r = e.nodeBefore, s = e.nodeAfter, o = e.index();
   return !r || !s || !r.type.compatibleContent(s.type) ? !1 : !r.content.size && e.parent.canReplace(o - 1, o) ? (t && t(n.tr.delete(e.pos - r.nodeSize, e.pos).scrollIntoView()), !0) : !e.parent.canReplace(o, o + 1) || !(s.isTextblock || En(n.doc, e.pos)) ? !1 : (t && t(n.tr.join(e.pos).scrollIntoView()), !0);
@@ -6287,7 +6287,7 @@ function Nc(n, e, t, r) {
       for (let x = i.length - 1; x >= 0; x--)
         p = S.from(i[x].create(null, p));
       p = S.from(s.copy(p));
-      let y = n.tr.step(new se(e.pos - 1, h, e.pos, h, new C(p, 1, 0), i.length, !0)), m = y.doc.resolve(h + 2 * i.length);
+      let y = n.tr.step(new oe(e.pos - 1, h, e.pos, h, new C(p, 1, 0), i.length, !0)), m = y.doc.resolve(h + 2 * i.length);
       m.nodeAfter && m.nodeAfter.type == s.type && En(y.doc, m.pos) && y.join(m.pos), t(y.scrollIntoView());
     }
     return !0;
@@ -6307,7 +6307,7 @@ function Nc(n, e, t, r) {
         let x = S.empty;
         for (let M = p.length - 1; M >= 0; M--)
           x = S.from(p[M].copy(x));
-        let k = n.tr.step(new se(e.pos - p.length, e.pos + o.nodeSize, e.pos + m, e.pos + o.nodeSize - m, new C(x, p.length, 0), 0, !0));
+        let k = n.tr.step(new oe(e.pos - p.length, e.pos + o.nodeSize, e.pos + m, e.pos + o.nodeSize - m, new C(x, p.length, 0), 0, !0));
         t(k.scrollIntoView());
       }
       return !0;
@@ -6512,7 +6512,7 @@ class Sh {
     this.editorView.dom.contains(e.relatedTarget) || this.setCursor(null);
   }
 }
-const ne = function(n) {
+const re = function(n) {
   for (var e = 0; ; e++)
     if (n = n.previousSibling, !n)
       return e;
@@ -6537,7 +6537,7 @@ function rl(n, e, t, r, s) {
       let o = n.parentNode;
       if (!o || o.nodeType != 1 || ar(n) || Ch.test(n.nodeName) || n.contentEditable == "false")
         return !1;
-      e = ne(n) + (s < 0 ? 0 : 1), n = o;
+      e = re(n) + (s < 0 ? 0 : 1), n = o;
     } else if (n.nodeType == 1) {
       if (n = n.childNodes[e + (s < 0 ? -1 : 0)], n.contentEditable == "false")
         return !1;
@@ -6558,7 +6558,7 @@ function wh(n, e) {
         return null;
       n = n.childNodes[e - 1], e = Pe(n);
     } else if (n.parentNode && !ar(n))
-      e = ne(n), n = n.parentNode;
+      e = re(n), n = n.parentNode;
     else
       return null;
   }
@@ -6572,7 +6572,7 @@ function Mh(n, e) {
         return null;
       n = n.childNodes[e], e = 0;
     } else if (n.parentNode && !ar(n))
-      e = ne(n) + 1, n = n.parentNode;
+      e = re(n) + 1, n = n.parentNode;
     else
       return null;
   }
@@ -6581,7 +6581,7 @@ function Nh(n, e, t) {
   for (let r = e == 0, s = e == Pe(n); r || s; ) {
     if (n == t)
       return !0;
-    let o = ne(n);
+    let o = re(n);
     if (n = n.parentNode, !n)
       return !1;
     r = r && o == 0, s = s && o == Pe(n);
@@ -6620,9 +6620,9 @@ function Oh(n, e, t) {
       return { node: r.startContainer, offset: Math.min(Pe(r.startContainer), r.startOffset) };
   }
 }
-const Je = typeof navigator < "u" ? navigator : null, sl = typeof document < "u" ? document : null, Rt = Je && Je.userAgent || "", io = /Edge\/(\d+)/.exec(Rt), Tc = /MSIE \d/.exec(Rt), lo = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(Rt), Se = !!(Tc || lo || io), Ot = Tc ? document.documentMode : lo ? +lo[1] : io ? +io[1] : 0, je = !Se && /gecko\/(\d+)/i.test(Rt);
+const Je = typeof navigator < "u" ? navigator : null, sl = typeof document < "u" ? document : null, Rt = Je && Je.userAgent || "", io = /Edge\/(\d+)/.exec(Rt), Tc = /MSIE \d/.exec(Rt), lo = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(Rt), ke = !!(Tc || lo || io), Ot = Tc ? document.documentMode : lo ? +lo[1] : io ? +io[1] : 0, je = !ke && /gecko\/(\d+)/i.test(Rt);
 je && +(/Firefox\/(\d+)/.exec(Rt) || [0, 0])[1];
-const ao = !Se && /Chrome\/(\d+)/.exec(Rt), ce = !!ao, Ac = ao ? +ao[1] : 0, me = !Se && !!Je && /Apple Computer/.test(Je.vendor), Dn = me && (/Mobile\/\w+/.test(Rt) || !!Je && Je.maxTouchPoints > 2), Re = Dn || (Je ? /Mac/.test(Je.platform) : !1), Eh = Je ? /Win/.test(Je.platform) : !1, it = /Android \d/.test(Rt), cr = !!sl && "webkitFontSmoothing" in sl.documentElement.style, Th = cr ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
+const ao = !ke && /Chrome\/(\d+)/.exec(Rt), ue = !!ao, Ac = ao ? +ao[1] : 0, ge = !ke && !!Je && /Apple Computer/.test(Je.vendor), Dn = ge && (/Mobile\/\w+/.test(Rt) || !!Je && Je.maxTouchPoints > 2), Re = Dn || (Je ? /Mac/.test(Je.platform) : !1), Eh = Je ? /Win/.test(Je.platform) : !1, it = /Android \d/.test(Rt), cr = !!sl && "webkitFontSmoothing" in sl.documentElement.style, Th = cr ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
 function Ah(n) {
   let e = n.defaultView && n.defaultView.visualViewport;
   return e ? {
@@ -6804,7 +6804,7 @@ function Fh(n, e) {
     if (!qo(e, c) || (i = vc(n.dom, e, c), !i))
       return null;
   }
-  if (me)
+  if (ge)
     for (let c = i; r && c; c = Gn(c))
       c.draggable && (r = void 0);
   if (i = $h(i, e), r) {
@@ -7048,7 +7048,7 @@ let ur = class {
       }
     let s;
     if (e == this.dom && this.contentDOM)
-      s = t > ne(this.contentDOM);
+      s = t > re(this.contentDOM);
     else if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM))
       s = e.compareDocumentPosition(this.contentDOM) & 2;
     else if (this.dom.firstChild) {
@@ -7132,12 +7132,12 @@ let ur = class {
       let o, i = !0;
       for (; o = r ? this.children[r - 1] : null, !(!o || o.dom.parentNode == this.contentDOM); r--, i = !1)
         ;
-      return o && t && i && !o.border && !o.domAtom ? o.domFromPos(o.size, t) : { node: this.contentDOM, offset: o ? ne(o.dom) + 1 : 0 };
+      return o && t && i && !o.border && !o.domAtom ? o.domFromPos(o.size, t) : { node: this.contentDOM, offset: o ? re(o.dom) + 1 : 0 };
     } else {
       let o, i = !0;
       for (; o = r < this.children.length ? this.children[r] : null, !(!o || o.dom.parentNode == this.contentDOM); r++, i = !1)
         ;
-      return o && i && !o.border && !o.domAtom ? o.domFromPos(0, t) : { node: this.contentDOM, offset: o ? ne(o.dom) : this.contentDOM.childNodes.length };
+      return o && i && !o.border && !o.domAtom ? o.domFromPos(0, t) : { node: this.contentDOM, offset: o ? re(o.dom) : this.contentDOM.childNodes.length };
     }
   }
   // Used to find a DOM range in a single parent for a given changed
@@ -7156,7 +7156,7 @@ let ur = class {
         for (let f = l; f > 0; f--) {
           let d = this.children[f - 1];
           if (d.size && d.dom.parentNode == this.contentDOM && !d.emptyChildAt(1)) {
-            s = ne(d.dom) + 1;
+            s = re(d.dom) + 1;
             break;
           }
           e -= d.size;
@@ -7168,7 +7168,7 @@ let ur = class {
         for (let u = l + 1; u < this.children.length; u++) {
           let f = this.children[u];
           if (f.size && f.dom.parentNode == this.contentDOM && !f.emptyChildAt(-1)) {
-            o = ne(f.dom);
+            o = re(f.dom);
             break;
           }
           t += f.size;
@@ -7206,14 +7206,14 @@ let ur = class {
       p = m;
     }
     let l = this.domFromPos(e, e ? -1 : 1), a = t == e ? l : this.domFromPos(t, t ? -1 : 1), c = r.root.getSelection(), u = r.domSelectionRange(), f = !1;
-    if ((je || me) && e == t) {
+    if ((je || ge) && e == t) {
       let { node: h, offset: p } = l;
       if (h.nodeType == 3) {
         if (f = !!(p && h.nodeValue[p - 1] == `
 `), f && p == h.nodeValue.length)
           for (let y = h, m; y; y = y.parentNode) {
             if (m = y.nextSibling) {
-              m.nodeName == "BR" && (l = a = { node: m.parentNode, offset: ne(m) + 1 });
+              m.nodeName == "BR" && (l = a = { node: m.parentNode, offset: re(m) + 1 });
               break;
             }
             let x = y.pmViewDesc;
@@ -7229,7 +7229,7 @@ let ur = class {
       let h = u.focusNode.childNodes[u.focusOffset];
       h && h.contentEditable == "false" && (s = !0);
     }
-    if (!(s || f && me) && Zt(l.node, l.offset, u.anchorNode, u.anchorOffset) && Zt(a.node, a.offset, u.focusNode, u.focusOffset))
+    if (!(s || f && ge) && Zt(l.node, l.offset, u.anchorNode, u.anchorOffset) && Zt(a.node, a.offset, u.focusNode, u.focusOffset))
       return;
     let d = !1;
     if ((c.extend || e == t) && !f) {
@@ -7443,7 +7443,7 @@ let ur = class {
   updateChildren(e, t) {
     let r = this.node.inlineContent, s = t, o = e.composing ? this.localCompositionInfo(e, t) : null, i = o && o.pos > -1 ? o : null, l = o && o.pos < 0, a = new Uh(this, i && i.node, e);
     Xh(this.node, this.innerDeco, (c, u, f) => {
-      c.spec.marks ? a.syncToMarks(c.spec.marks, r, e) : c.type.side >= 0 && !f && a.syncToMarks(u == this.node.childCount ? W.none : this.node.child(u).marks, r, e), a.placeWidget(c, e, s);
+      c.spec.marks ? a.syncToMarks(c.spec.marks, r, e) : c.type.side >= 0 && !f && a.syncToMarks(u == this.node.childCount ? _.none : this.node.child(u).marks, r, e), a.placeWidget(c, e, s);
     }, (c, u, f, d) => {
       a.syncToMarks(c.marks, r, e);
       let h;
@@ -7823,7 +7823,7 @@ class Uh {
     for (; e instanceof Wr; )
       t = e, e = t.children[t.children.length - 1];
     (!e || // Empty textblock
-    !(e instanceof Fc) || /\n$/.test(e.node.text) || this.view.requiresGeckoHackNode && /\s$/.test(e.node.text)) && ((me || ce) && e && e.dom.contentEditable == "false" && this.addHackNode("IMG", t), this.addHackNode("BR", this.top));
+    !(e instanceof Fc) || /\n$/.test(e.node.text) || this.view.requiresGeckoHackNode && /\s$/.test(e.node.text)) && ((ge || ue) && e && e.dom.contentEditable == "false" && this.addHackNode("IMG", t), this.addHackNode("BR", this.top));
   }
   addHackNode(e, t) {
     if (t == this.top && this.index < t.children.length && t.children[this.index].matchesHack(e))
@@ -7999,7 +7999,7 @@ function Hc(n) {
 function at(n, e = !1) {
   let t = n.state.selection;
   if (Jc(n, t), !!Hc(n)) {
-    if (!e && n.input.mouseDown && n.input.mouseDown.allowDefault && ce) {
+    if (!e && n.input.mouseDown && n.input.mouseDown.allowDefault && ue) {
       let r = n.domSelectionRange(), s = n.domObserver.currentSelection;
       if (r.anchorNode && s.anchorNode && Zt(r.anchorNode, r.anchorOffset, s.anchorNode, s.anchorOffset)) {
         n.input.mouseDown.delayedSelectionSync = !0, n.domObserver.setCurSelection();
@@ -8015,10 +8015,10 @@ function at(n, e = !1) {
     n.domObserver.setCurSelection(), n.domObserver.connectSelection();
   }
 }
-const hl = me || ce && Ac < 63;
+const hl = ge || ue && Ac < 63;
 function pl(n, e) {
   let { node: t, offset: r } = n.docView.domFromPos(e, 0), s = r < t.childNodes.length ? t.childNodes[r] : null, o = r ? t.childNodes[r - 1] : null;
-  if (me && s && s.contentEditable == "false")
+  if (ge && s && s.contentEditable == "false")
     return Fs(s);
   if ((!s || s.contentEditable == "false") && (!o || o.contentEditable == "false")) {
     if (s)
@@ -8028,7 +8028,7 @@ function pl(n, e) {
   }
 }
 function Fs(n) {
-  return n.contentEditable = "true", me && n.draggable && (n.draggable = !1, n.wasDraggable = !0), n;
+  return n.contentEditable = "true", ge && n.draggable && (n.draggable = !1, n.wasDraggable = !0), n;
 }
 function ml(n) {
   n.contentEditable = "false", n.wasDraggable && (n.draggable = !0, n.wasDraggable = null);
@@ -8048,7 +8048,7 @@ function tp(n) {
   if (!e)
     return;
   let r = n.cursorWrapper.dom, s = r.nodeName == "IMG";
-  s ? t.setStart(r.parentNode, ne(r) + 1) : t.setStart(r, 0), t.collapse(!0), e.removeAllRanges(), e.addRange(t), !s && !n.state.selection.visible && Se && Ot <= 11 && (r.disabled = !0, r.disabled = !1);
+  s ? t.setStart(r.parentNode, re(r) + 1) : t.setStart(r, 0), t.collapse(!0), e.removeAllRanges(), e.addRange(t), !s && !n.state.selection.visible && ke && Ot <= 11 && (r.disabled = !0, r.disabled = !1);
 }
 function Jc(n, e) {
   if (e instanceof w) {
@@ -8151,7 +8151,7 @@ function rp(n) {
       {
         let l = t.previousSibling;
         for (; l && Wn(l, -1); )
-          s = t.parentNode, o = ne(l), l = l.previousSibling;
+          s = t.parentNode, o = re(l), l = l.previousSibling;
         if (l)
           t = l, r = qr(t);
         else {
@@ -8183,7 +8183,7 @@ function sp(n) {
       {
         let l = t.nextSibling;
         for (; l && Wn(l, 1); )
-          o = l.parentNode, i = ne(l) + 1, l = l.nextSibling;
+          o = l.parentNode, i = re(l) + 1, l = l.nextSibling;
         if (l)
           t = l, r = 0, s = qr(t);
         else {
@@ -8201,7 +8201,7 @@ function Uc(n) {
 }
 function op(n, e) {
   for (; n && e == n.childNodes.length && !ar(n); )
-    e = ne(n) + 1, n = n.parentNode;
+    e = re(n) + 1, n = n.parentNode;
   for (; n && e < n.childNodes.length; ) {
     let t = n.childNodes[e];
     if (t.nodeType == 3)
@@ -8213,7 +8213,7 @@ function op(n, e) {
 }
 function ip(n, e) {
   for (; n && !e && !ar(n); )
-    e = ne(n), n = n.parentNode;
+    e = re(n), n = n.parentNode;
   for (; n && e; ) {
     let t = n.childNodes[e - 1];
     if (t.nodeType == 3)
@@ -8243,7 +8243,7 @@ function po(n, e, t) {
 }
 function xl(n, e) {
   let t = n.state.doc.resolve(e);
-  if (!(ce || Eh) && t.parent.inlineContent) {
+  if (!(ue || Eh) && t.parent.inlineContent) {
     let s = n.coordsAtPos(e);
     if (e > t.start()) {
       let o = n.coordsAtPos(e - 1), i = (o.top + o.bottom) / 2;
@@ -8269,7 +8269,7 @@ function Sl(n, e, t) {
       return yt(n, i);
   }
   if (!s.parent.inlineContent) {
-    let i = e < 0 ? s : o, l = r instanceof xe ? $.near(i, e) : $.findFrom(i, e);
+    let i = e < 0 ? s : o, l = r instanceof Se ? $.near(i, e) : $.findFrom(i, e);
     return l ? yt(n, l) : !1;
   }
   return !1;
@@ -8295,7 +8295,7 @@ function Cl(n, e, t) {
   n.domObserver.stop(), e.contentEditable = t, n.domObserver.start();
 }
 function lp(n) {
-  if (!me || n.state.selection.$head.parentOffset > 0)
+  if (!ge || n.state.selection.$head.parentOffset > 0)
     return !1;
   let { focusNode: e, focusOffset: t } = n.domSelectionRange();
   if (e && e.nodeType == 1 && t == 0 && e.firstChild && e.firstChild.contentEditable == "false") {
@@ -8496,7 +8496,7 @@ function hp(n) {
   return t;
 }
 function pp(n) {
-  let e = n.querySelectorAll(ce ? "span:not([class]):not([style])" : "span.Apple-converted-space");
+  let e = n.querySelectorAll(ue ? "span:not([class]):not([style])" : "span.Apple-converted-space");
   for (let t = 0; t < e.length; t++) {
     let r = e[t];
     r.childNodes.length == 1 && r.textContent == " " && r.parentNode && r.parentNode.replaceChild(n.ownerDocument.createTextNode(" "), r);
@@ -8520,20 +8520,20 @@ function mp(n, e) {
   }
   return new C(s, o, i);
 }
-const ge = {}, ye = {}, gp = { touchstart: !0, touchmove: !0 };
+const ye = {}, be = {}, gp = { touchstart: !0, touchmove: !0 };
 class yp {
   constructor() {
     this.shiftKey = !1, this.mouseDown = null, this.lastKeyCode = null, this.lastKeyCodeTime = 0, this.lastClick = { time: 0, x: 0, y: 0, type: "" }, this.lastSelectionOrigin = null, this.lastSelectionTime = 0, this.lastIOSEnter = 0, this.lastIOSEnterFallbackTimeout = -1, this.lastFocus = 0, this.lastTouch = 0, this.lastChromeDelete = 0, this.composing = !1, this.compositionNode = null, this.composingTimeout = -1, this.compositionNodes = [], this.compositionEndedAt = -2e8, this.compositionID = 1, this.compositionPendingChanges = 0, this.domChangeCount = 0, this.eventHandlers = /* @__PURE__ */ Object.create(null), this.hideSelectionGuard = null;
   }
 }
 function bp(n) {
-  for (let e in ge) {
-    let t = ge[e];
+  for (let e in ye) {
+    let t = ye[e];
     n.dom.addEventListener(e, n.input.eventHandlers[e] = (r) => {
-      Sp(n, r) && !Ko(n, r) && (n.editable || !(r.type in ye)) && t(n, r);
+      Sp(n, r) && !Ko(n, r) && (n.editable || !(r.type in be)) && t(n, r);
     }, gp[e] ? { passive: !0 } : void 0);
   }
-  me && n.dom.addEventListener("input", () => null), go(n);
+  ge && n.dom.addEventListener("input", () => null), go(n);
 }
 function wt(n, e) {
   n.input.lastSelectionOrigin = e, n.input.lastSelectionTime = Date.now();
@@ -8567,11 +8567,11 @@ function Sp(n, e) {
   return !0;
 }
 function kp(n, e) {
-  !Ko(n, e) && ge[e.type] && (n.editable || !(e.type in ye)) && ge[e.type](n, e);
+  !Ko(n, e) && ye[e.type] && (n.editable || !(e.type in be)) && ye[e.type](n, e);
 }
-ye.keydown = (n, e) => {
+be.keydown = (n, e) => {
   let t = e;
-  if (n.input.shiftKey = t.keyCode == 16 || t.shiftKey, !ru(n, t) && (n.input.lastKeyCode = t.keyCode, n.input.lastKeyCodeTime = Date.now(), !(it && ce && t.keyCode == 13)))
+  if (n.input.shiftKey = t.keyCode == 16 || t.shiftKey, !ru(n, t) && (n.input.lastKeyCode = t.keyCode, n.input.lastKeyCodeTime = Date.now(), !(it && ue && t.keyCode == 13)))
     if (t.keyCode != 229 && n.domObserver.forceFlush(), Dn && t.keyCode == 13 && !t.ctrlKey && !t.altKey && !t.metaKey) {
       let r = Date.now();
       n.input.lastIOSEnter = r, n.input.lastIOSEnterFallbackTimeout = setTimeout(() => {
@@ -8579,10 +8579,10 @@ ye.keydown = (n, e) => {
       }, 200);
     } else n.someProp("handleKeyDown", (r) => r(n, t)) || cp(n, t) ? t.preventDefault() : wt(n, "key");
 };
-ye.keyup = (n, e) => {
+be.keyup = (n, e) => {
   e.keyCode == 16 && (n.input.shiftKey = !1);
 };
-ye.keypress = (n, e) => {
+be.keypress = (n, e) => {
   let t = e;
   if (ru(n, t) || !t.charCode || t.ctrlKey && !t.altKey || Re && t.metaKey)
     return;
@@ -8670,7 +8670,7 @@ function Yo(n) {
   return Hr(n);
 }
 const nu = Re ? "metaKey" : "ctrlKey";
-ge.mousedown = (n, e) => {
+ye.mousedown = (n, e) => {
   let t = e;
   n.input.shiftKey = t.shiftKey;
   let r = Yo(n), s = Date.now(), o = "singleClick";
@@ -8708,14 +8708,14 @@ let Tp = class {
       return;
     let t = this.pos;
     this.view.state.doc != this.startDoc && (t = this.view.posAtCoords(us(e))), this.updateAllowDefault(e), this.allowDefault || !t ? wt(this.view, "pointer") : Np(this.view, t.pos, t.inside, e, this.selectNode) ? e.preventDefault() : e.button == 0 && (this.flushed || // Safari ignores clicks on draggable elements
-    me && this.mightDrag && !this.mightDrag.node.isAtom || // Chrome will sometimes treat a node selection as a
+    ge && this.mightDrag && !this.mightDrag.node.isAtom || // Chrome will sometimes treat a node selection as a
     // cursor, but still report that the node is selected
     // when asked through getSelection. You'll then get a
     // situation where clicking at the point where that
     // (hidden) cursor is doesn't change the selection, and
     // thus doesn't get a reaction from ProseMirror. This
     // works around that.
-    ce && !this.view.state.selection.visible && Math.min(Math.abs(t.pos - this.view.state.selection.from), Math.abs(t.pos - this.view.state.selection.to)) <= 2) ? (Cn(this.view, $.near(this.view.state.doc.resolve(t.pos))), e.preventDefault()) : wt(this.view, "pointer");
+    ue && !this.view.state.selection.visible && Math.min(Math.abs(t.pos - this.view.state.selection.from), Math.abs(t.pos - this.view.state.selection.to)) <= 2) ? (Cn(this.view, $.near(this.view.state.doc.resolve(t.pos))), e.preventDefault()) : wt(this.view, "pointer");
   }
   move(e) {
     this.updateAllowDefault(e), wt(this.view, "pointer"), e.buttons == 0 && this.done();
@@ -8724,18 +8724,18 @@ let Tp = class {
     !this.allowDefault && (Math.abs(this.event.x - e.clientX) > 4 || Math.abs(this.event.y - e.clientY) > 4) && (this.allowDefault = !0);
   }
 };
-ge.touchstart = (n) => {
+ye.touchstart = (n) => {
   n.input.lastTouch = Date.now(), Yo(n), wt(n, "pointer");
 };
-ge.touchmove = (n) => {
+ye.touchmove = (n) => {
   n.input.lastTouch = Date.now(), wt(n, "pointer");
 };
-ge.contextmenu = (n) => Yo(n);
+ye.contextmenu = (n) => Yo(n);
 function ru(n, e) {
-  return n.composing ? !0 : me && Math.abs(e.timeStamp - n.input.compositionEndedAt) < 500 ? (n.input.compositionEndedAt = -2e8, !0) : !1;
+  return n.composing ? !0 : ge && Math.abs(e.timeStamp - n.input.compositionEndedAt) < 500 ? (n.input.compositionEndedAt = -2e8, !0) : !1;
 }
 const Ap = it ? 5e3 : -1;
-ye.compositionstart = ye.compositionupdate = (n) => {
+be.compositionstart = be.compositionupdate = (n) => {
   if (!n.composing) {
     n.domObserver.flush();
     let { state: e } = n, t = e.selection.$to;
@@ -8759,7 +8759,7 @@ ye.compositionstart = ye.compositionupdate = (n) => {
   }
   su(n, Ap);
 };
-ye.compositionend = (n, e) => {
+be.compositionend = (n, e) => {
   n.composing && (n.input.composing = !1, n.input.compositionEndedAt = e.timeStamp, n.input.compositionPendingChanges = n.domObserver.pendingRecords().length ? n.input.compositionID : 0, n.input.compositionNode = null, n.input.compositionPendingChanges && Promise.resolve().then(() => n.domObserver.flush()), n.input.compositionID++, su(n, 20));
 };
 function su(n, e) {
@@ -8811,8 +8811,8 @@ function Pp(n, e) {
     t.parentNode && t.parentNode.removeChild(t), n.focus();
   }, 50);
 }
-const Xn = Se && Ot < 15 || Dn && Th < 604;
-ge.copy = ye.cut = (n, e) => {
+const Xn = ke && Ot < 15 || Dn && Th < 604;
+ye.copy = be.cut = (n, e) => {
   let t = e, r = n.state.selection, s = t.type == "cut";
   if (r.empty)
     return;
@@ -8848,7 +8848,7 @@ function iu(n) {
   let t = n.getData("text/uri-list");
   return t ? t.replace(/\r?\n/g, " ") : "";
 }
-ye.paste = (n, e) => {
+be.paste = (n, e) => {
   let t = e;
   if (n.composing && !it)
     return;
@@ -8861,7 +8861,7 @@ let lu = class {
   }
 };
 const au = Re ? "altKey" : "ctrlKey";
-ge.dragstart = (n, e) => {
+ye.dragstart = (n, e) => {
   let t = e, r = n.input.mouseDown;
   if (r && r.done(), !t.dataTransfer)
     return;
@@ -8875,16 +8875,16 @@ ge.dragstart = (n, e) => {
     }
   }
   let l = (i || n.state.selection).content(), { dom: a, text: c, slice: u } = Yc(n, l);
-  (!t.dataTransfer.files.length || !ce || Ac > 120) && t.dataTransfer.clearData(), t.dataTransfer.setData(Xn ? "Text" : "text/html", a.innerHTML), t.dataTransfer.effectAllowed = "copyMove", Xn || t.dataTransfer.setData("text/plain", c), n.dragging = new lu(u, !t[au], i);
+  (!t.dataTransfer.files.length || !ue || Ac > 120) && t.dataTransfer.clearData(), t.dataTransfer.setData(Xn ? "Text" : "text/html", a.innerHTML), t.dataTransfer.effectAllowed = "copyMove", Xn || t.dataTransfer.setData("text/plain", c), n.dragging = new lu(u, !t[au], i);
 };
-ge.dragend = (n) => {
+ye.dragend = (n) => {
   let e = n.dragging;
   window.setTimeout(() => {
     n.dragging == e && (n.dragging = null);
   }, 50);
 };
-ye.dragover = ye.dragenter = (n, e) => e.preventDefault();
-ye.drop = (n, e) => {
+be.dragover = be.dragenter = (n, e) => e.preventDefault();
+be.drop = (n, e) => {
   let t = e, r = n.dragging;
   if (n.dragging = null, !t.dataTransfer)
     return;
@@ -8922,17 +8922,17 @@ ye.drop = (n, e) => {
   }
   n.focus(), n.dispatch(c.setMeta("uiEvent", "drop"));
 };
-ge.focus = (n) => {
+ye.focus = (n) => {
   n.input.lastFocus = Date.now(), n.focused || (n.domObserver.stop(), n.dom.classList.add("ProseMirror-focused"), n.domObserver.start(), n.focused = !0, setTimeout(() => {
     n.docView && n.hasFocus() && !n.domObserver.currentSelection.eq(n.domSelectionRange()) && at(n);
   }, 20));
 };
-ge.blur = (n, e) => {
+ye.blur = (n, e) => {
   let t = e;
   n.focused && (n.domObserver.stop(), n.dom.classList.remove("ProseMirror-focused"), n.domObserver.start(), t.relatedTarget && n.dom.contains(t.relatedTarget) && n.domObserver.currentSelection.clear(), n.focused = !1);
 };
-ge.beforeinput = (n, e) => {
-  if (ce && it && e.inputType == "deleteContentBackward") {
+ye.beforeinput = (n, e) => {
+  if (ue && it && e.inputType == "deleteContentBackward") {
     n.domObserver.flushSoon();
     let { domChangeCount: r } = n.input;
     setTimeout(() => {
@@ -8943,8 +8943,8 @@ ge.beforeinput = (n, e) => {
     }, 50);
   }
 };
-for (let n in ye)
-  ge[n] = ye[n];
+for (let n in be)
+  ye[n] = be[n];
 function Zn(n, e) {
   if (n == e)
     return !0;
@@ -9097,7 +9097,7 @@ let U = class mt {
   you must make a copy if you want need to preserve that.
   */
   static create(e, t) {
-    return t.length ? Jr(t, e, 0, Jt) : le;
+    return t.length ? Jr(t, e, 0, Jt) : ae;
   }
   /**
   Find all decorations in this set which touch the given range
@@ -9127,7 +9127,7 @@ let U = class mt {
   document.
   */
   map(e, t, r) {
-    return this == le || e.maps.length == 0 ? this : this.mapInner(e, t, 0, 0, r || Jt);
+    return this == ae || e.maps.length == 0 ? this : this.mapInner(e, t, 0, 0, r || Jt);
   }
   /**
   @internal
@@ -9138,7 +9138,7 @@ let U = class mt {
       let a = this.local[l].map(e, r, s);
       a && a.type.valid(t, a) ? (i || (i = [])).push(a) : o.onRemove && o.onRemove(this.local[l].spec);
     }
-    return this.children.length ? zp(this.children, i || [], e, t, r, s, o) : i ? new mt(i.sort(Kt), hn) : le;
+    return this.children.length ? zp(this.children, i || [], e, t, r, s, o) : i ? new mt(i.sort(Kt), hn) : ae;
   }
   /**
   Add the given array of decorations to the ones in the set,
@@ -9147,7 +9147,7 @@ let U = class mt {
   structure.
   */
   add(e, t) {
-    return t.length ? this == le ? mt.create(e, t) : this.addInner(e, t, 0) : this;
+    return t.length ? this == ae ? mt.create(e, t) : this.addInner(e, t, 0) : this;
   }
   addInner(e, t, r) {
     let s, o = 0;
@@ -9169,7 +9169,7 @@ let U = class mt {
   the ones in the given array.
   */
   remove(e) {
-    return e.length == 0 || this == le ? this : this.removeInner(e, 0);
+    return e.length == 0 || this == ae ? this : this.removeInner(e, 0);
   }
   removeInner(e, t) {
     let r = this.children, s = this.local;
@@ -9181,7 +9181,7 @@ let U = class mt {
         continue;
       r == this.children && (r = this.children.slice());
       let c = r[o + 2].removeInner(i, l + 1);
-      c != le ? r[o + 2] = c : (r.splice(o, 3), o -= 3);
+      c != ae ? r[o + 2] = c : (r.splice(o, 3), o -= 3);
     }
     if (s.length) {
       for (let o = 0, i; o < e.length; o++)
@@ -9189,10 +9189,10 @@ let U = class mt {
           for (let l = 0; l < s.length; l++)
             s[l].eq(i, t) && (s == this.local && (s = this.local.slice()), s.splice(l--, 1));
     }
-    return r == this.children && s == this.local ? this : s.length || r.length ? new mt(s, r) : le;
+    return r == this.children && s == this.local ? this : s.length || r.length ? new mt(s, r) : ae;
   }
   forChild(e, t) {
-    if (this == le)
+    if (this == ae)
       return this;
     if (t.isLeaf)
       return mt.empty;
@@ -9214,7 +9214,7 @@ let U = class mt {
       let l = new mt(s.sort(Kt), hn);
       return r ? new fu([l, r]) : l;
     }
-    return r || le;
+    return r || ae;
   }
   /**
   @internal
@@ -9242,7 +9242,7 @@ let U = class mt {
   @internal
   */
   localsInner(e) {
-    if (this == le)
+    if (this == ae)
       return hn;
     if (e.inlineContent || !this.local.some(_n.is))
       return this.local;
@@ -9257,7 +9257,7 @@ let U = class mt {
 };
 U.empty = new U([], []);
 U.removeOverlap = Go;
-const le = U.empty;
+const ae = U.empty;
 let fu = class pn {
   constructor(e) {
     this.members = e;
@@ -9272,7 +9272,7 @@ let fu = class pn {
     let r = [];
     for (let s = 0; s < this.members.length; s++) {
       let o = this.members[s].forChild(e, t);
-      o != le && (o instanceof pn ? r = r.concat(o.members) : r.push(o));
+      o != ae && (o instanceof pn ? r = r.concat(o.members) : r.push(o));
     }
     return pn.from(r);
   }
@@ -9304,7 +9304,7 @@ let fu = class pn {
   static from(e) {
     switch (e.length) {
       case 0:
-        return le;
+        return ae;
       case 1:
         return e[0];
       default:
@@ -9347,7 +9347,7 @@ function zp(n, e, t, r, s, o, i) {
       let d = t.map(n[c + 1] + o, -1), h = d - s, { index: p, offset: y } = r.content.findIndex(f), m = r.maybeChild(p);
       if (m && y == f && y + m.nodeSize == h) {
         let x = l[c + 2].mapInner(t, m, u + 1, n[c] + o + 1, i);
-        x != le ? (l[c] = f, l[c + 1] = h, l[c + 2] = x) : (l[c + 1] = -2, a = !0);
+        x != ae ? (l[c] = f, l[c + 1] = h, l[c + 2] = x) : (l[c + 1] = -2, a = !0);
       } else
         a = !0;
     }
@@ -9409,13 +9409,13 @@ function Jr(n, e, t, r) {
     if (c) {
       o = !0;
       let u = Jr(c, l, t + a + 1, r);
-      u != le && s.push(a, a + l.nodeSize, u);
+      u != ae && s.push(a, a + l.nodeSize, u);
     }
   });
   let i = du(o ? pu(n) : n, -t).sort(Kt);
   for (let l = 0; l < i.length; l++)
     i[l].type.valid(e, i[l]) || (r.onRemove && r.onRemove(i[l].spec), i.splice(l--, 1));
-  return i.length || s.length ? new U(i, s) : le;
+  return i.length || s.length ? new U(i, s) : ae;
 }
 function Kt(n, e) {
   return n.from - e.from || n.to - e.to;
@@ -9447,7 +9447,7 @@ function Ls(n) {
   let e = [];
   return n.someProp("decorations", (t) => {
     let r = t(n.state);
-    r && r != le && e.push(r);
+    r && r != ae && e.push(r);
   }), n.cursorWrapper && e.push(U.create(n.state.doc, [n.cursorWrapper.deco])), fu.from(e);
 }
 const Fp = {
@@ -9457,7 +9457,7 @@ const Fp = {
   attributes: !0,
   attributeOldValue: !0,
   subtree: !0
-}, Bp = Se && Ot <= 11;
+}, Bp = ke && Ot <= 11;
 let Lp = class {
   constructor() {
     this.anchorNode = null, this.anchorOffset = 0, this.focusNode = null, this.focusOffset = 0;
@@ -9477,7 +9477,7 @@ class Wp {
     this.view = e, this.handleDOMChange = t, this.queue = [], this.flushingSoon = -1, this.observer = null, this.currentSelection = new Lp(), this.onCharData = null, this.suppressingSelectionUpdates = !1, this.lastChangedTextNode = null, this.observer = window.MutationObserver && new window.MutationObserver((r) => {
       for (let s = 0; s < r.length; s++)
         this.queue.push(r[s]);
-      Se && Ot <= 11 && r.some((s) => s.type == "childList" && s.removedNodes.length || s.type == "characterData" && s.oldValue.length > s.target.nodeValue.length) ? this.flushSoon() : this.flush();
+      ke && Ot <= 11 && r.some((s) => s.type == "childList" && s.removedNodes.length || s.type == "characterData" && s.oldValue.length > s.target.nodeValue.length) ? this.flushSoon() : this.flush();
     }), Bp && (this.onCharData = (r) => {
       this.queue.push({ target: r.target, type: "characterData", oldValue: r.prevValue }), this.flushSoon();
     }), this.onSelectionChange = this.onSelectionChange.bind(this);
@@ -9518,7 +9518,7 @@ class Wp {
     if (yl(this.view)) {
       if (this.suppressingSelectionUpdates)
         return at(this.view);
-      if (Se && Ot <= 11 && !this.view.state.selection.empty) {
+      if (ke && Ot <= 11 && !this.view.state.selection.empty) {
         let e = this.view.domSelectionRange();
         if (e.focusNode && Zt(e.focusNode, e.focusOffset, e.anchorNode, e.anchorOffset))
           return this.flushSoon();
@@ -9596,12 +9596,12 @@ class Wp {
       if (r.contentDOM && r.contentDOM != r.dom && !r.contentDOM.contains(e.target))
         return { from: r.posBefore, to: r.posAfter };
       let s = e.previousSibling, o = e.nextSibling;
-      if (Se && Ot <= 11 && e.addedNodes.length)
+      if (ke && Ot <= 11 && e.addedNodes.length)
         for (let u = 0; u < e.addedNodes.length; u++) {
           let { previousSibling: f, nextSibling: d } = e.addedNodes[u];
           (!f || Array.prototype.indexOf.call(e.addedNodes, f) < 0) && (s = f), (!d || Array.prototype.indexOf.call(e.addedNodes, d) < 0) && (o = d);
         }
-      let i = s && s.parentNode == e.target ? ne(s) + 1 : 0, l = r.localPosFromDOM(e.target, i, -1), a = o && o.parentNode == e.target ? ne(o) : e.target.childNodes.length, c = r.localPosFromDOM(e.target, a, 1);
+      let i = s && s.parentNode == e.target ? re(s) + 1 : 0, l = r.localPosFromDOM(e.target, i, -1), a = o && o.parentNode == e.target ? re(o) : e.target.childNodes.length, c = r.localPosFromDOM(e.target, a, 1);
       return { from: l, to: c };
     } else return e.type == "attributes" ? { from: r.posAtStart - r.border, to: r.posAtEnd + r.border } : (this.lastChangedTextNode = e.target, {
       from: r.posAtStart,
@@ -9648,7 +9648,7 @@ function Hp(n, e) {
 }
 function Jp(n, e, t) {
   let { node: r, fromOffset: s, toOffset: o, from: i, to: l } = n.docView.parseRange(e, t), a = n.domSelectionRange(), c, u = a.anchorNode;
-  if (u && n.dom.contains(u.nodeType == 1 ? u : u.parentNode) && (c = [{ node: u, offset: a.anchorOffset }], cs(a) || c.push({ node: a.focusNode, offset: a.focusOffset })), ce && n.input.lastKeyCode === 8)
+  if (u && n.dom.contains(u.nodeType == 1 ? u : u.parentNode) && (c = [{ node: u, offset: a.anchorOffset }], cs(a) || c.push({ node: a.focusNode, offset: a.focusOffset })), ue && n.input.lastKeyCode === 8)
     for (let m = o; m > s; m--) {
       let x = r.childNodes[m - 1], k = x.pmViewDesc;
       if (x.nodeName == "BR" && !k) {
@@ -9680,10 +9680,10 @@ function Kp(n) {
   if (e)
     return e.parseRule();
   if (n.nodeName == "BR" && n.parentNode) {
-    if (me && /^(ul|ol)$/i.test(n.parentNode.nodeName)) {
+    if (ge && /^(ul|ol)$/i.test(n.parentNode.nodeName)) {
       let t = document.createElement("div");
       return t.appendChild(document.createElement("li")), { skip: t };
-    } else if (n.parentNode.lastChild == n || me && /^(tr|table)$/i.test(n.parentNode.nodeName))
+    } else if (n.parentNode.lastChild == n || ge && /^(tr|table)$/i.test(n.parentNode.nodeName))
       return { ignore: !0 };
   } else if (n.nodeName == "IMG" && n.getAttribute("mark-placeholder"))
     return { ignore: !0 };
@@ -9693,12 +9693,12 @@ const Up = /^(a|abbr|acronym|b|bd[io]|big|br|button|cite|code|data(list)?|del|df
 function Yp(n, e, t, r, s) {
   let o = n.input.compositionPendingChanges || (n.composing ? n.input.compositionID : 0);
   if (n.input.compositionPendingChanges = 0, e < 0) {
-    let R = n.input.lastSelectionTime > Date.now() - 50 ? n.input.lastSelectionOrigin : null, _ = Ho(n, R);
-    if (_ && !n.state.selection.eq(_)) {
-      if (ce && it && n.input.lastKeyCode === 13 && Date.now() - 100 < n.input.lastKeyCodeTime && n.someProp("handleKeyDown", (dt) => dt(n, Lt(13, "Enter"))))
+    let D = n.input.lastSelectionTime > Date.now() - 50 ? n.input.lastSelectionOrigin : null, L = Ho(n, D);
+    if (L && !n.state.selection.eq(L)) {
+      if (ue && it && n.input.lastKeyCode === 13 && Date.now() - 100 < n.input.lastKeyCodeTime && n.someProp("handleKeyDown", (dt) => dt(n, Lt(13, "Enter"))))
         return;
-      let ke = n.state.tr.setSelection(_);
-      R == "pointer" ? ke.setMeta("pointer", !0) : R == "key" && ke.scrollIntoView(), o && ke.setMeta("composition", o), n.dispatch(ke);
+      let ee = n.state.tr.setSelection(L);
+      D == "pointer" ? ee.setMeta("pointer", !0) : D == "key" && ee.scrollIntoView(), o && ee.setMeta("composition", o), n.dispatch(ee);
     }
     return;
   }
@@ -9707,7 +9707,7 @@ function Yp(n, e, t, r, s) {
   let a = n.state.selection, c = Jp(n, e, t), u = n.state.doc, f = u.slice(c.from, c.to), d, h;
   n.input.lastKeyCode === 8 && Date.now() - 100 < n.input.lastKeyCodeTime ? (d = n.state.selection.to, h = "end") : (d = n.state.selection.from, h = "start"), n.input.lastKeyCode = null;
   let p = Qp(f.content, c.doc.content, c.from, d, h);
-  if (p && n.input.domChangeCount++, (Dn && n.input.lastIOSEnter > Date.now() - 225 || it) && s.some((R) => R.nodeType == 1 && !Up.test(R.nodeName)) && (!p || p.endA >= p.endB) && n.someProp("handleKeyDown", (R) => R(n, Lt(13, "Enter")))) {
+  if (p && n.input.domChangeCount++, (Dn && n.input.lastIOSEnter > Date.now() - 225 || it) && s.some((D) => D.nodeType == 1 && !Up.test(D.nodeName)) && (!p || p.endA >= p.endB) && n.someProp("handleKeyDown", (D) => D(n, Lt(13, "Enter")))) {
     n.input.lastIOSEnter = 0;
     return;
   }
@@ -9716,50 +9716,50 @@ function Yp(n, e, t, r, s) {
       p = { start: a.from, endA: a.to, endB: a.to };
     else {
       if (c.sel) {
-        let R = Al(n, n.state.doc, c.sel);
-        if (R && !R.eq(n.state.selection)) {
-          let _ = n.state.tr.setSelection(R);
-          o && _.setMeta("composition", o), n.dispatch(_);
+        let D = Al(n, n.state.doc, c.sel);
+        if (D && !D.eq(n.state.selection)) {
+          let L = n.state.tr.setSelection(D);
+          o && L.setMeta("composition", o), n.dispatch(L);
         }
       }
       return;
     }
-  n.state.selection.from < n.state.selection.to && p.start == p.endB && n.state.selection instanceof V && (p.start > n.state.selection.from && p.start <= n.state.selection.from + 2 && n.state.selection.from >= c.from ? p.start = n.state.selection.from : p.endA < n.state.selection.to && p.endA >= n.state.selection.to - 2 && n.state.selection.to <= c.to && (p.endB += n.state.selection.to - p.endA, p.endA = n.state.selection.to)), Se && Ot <= 11 && p.endB == p.start + 1 && p.endA == p.start && p.start > c.from && c.doc.textBetween(p.start - c.from - 1, p.start - c.from + 1) == "  " && (p.start--, p.endA--, p.endB--);
+  n.state.selection.from < n.state.selection.to && p.start == p.endB && n.state.selection instanceof V && (p.start > n.state.selection.from && p.start <= n.state.selection.from + 2 && n.state.selection.from >= c.from ? p.start = n.state.selection.from : p.endA < n.state.selection.to && p.endA >= n.state.selection.to - 2 && n.state.selection.to <= c.to && (p.endB += n.state.selection.to - p.endA, p.endA = n.state.selection.to)), ke && Ot <= 11 && p.endB == p.start + 1 && p.endA == p.start && p.start > c.from && c.doc.textBetween(p.start - c.from - 1, p.start - c.from + 1) == "  " && (p.start--, p.endA--, p.endB--);
   let y = c.doc.resolveNoCache(p.start - c.from), m = c.doc.resolveNoCache(p.endB - c.from), x = u.resolve(p.start), k = y.sameParent(m) && y.parent.inlineContent && x.end() >= p.endA, M;
-  if ((Dn && n.input.lastIOSEnter > Date.now() - 225 && (!k || s.some((R) => R.nodeName == "DIV" || R.nodeName == "P")) || !k && y.pos < c.doc.content.size && !y.sameParent(m) && (M = $.findFrom(c.doc.resolve(y.pos + 1), 1, !0)) && M.head == m.pos) && n.someProp("handleKeyDown", (R) => R(n, Lt(13, "Enter")))) {
+  if ((Dn && n.input.lastIOSEnter > Date.now() - 225 && (!k || s.some((D) => D.nodeName == "DIV" || D.nodeName == "P")) || !k && y.pos < c.doc.content.size && !y.sameParent(m) && (M = $.findFrom(c.doc.resolve(y.pos + 1), 1, !0)) && M.head == m.pos) && n.someProp("handleKeyDown", (D) => D(n, Lt(13, "Enter")))) {
     n.input.lastIOSEnter = 0;
     return;
   }
-  if (n.state.selection.anchor > p.start && Xp(u, p.start, p.endA, y, m) && n.someProp("handleKeyDown", (R) => R(n, Lt(8, "Backspace")))) {
-    it && ce && n.domObserver.suppressSelectionUpdates();
+  if (n.state.selection.anchor > p.start && Xp(u, p.start, p.endA, y, m) && n.someProp("handleKeyDown", (D) => D(n, Lt(8, "Backspace")))) {
+    it && ue && n.domObserver.suppressSelectionUpdates();
     return;
   }
-  ce && p.endB == p.start && (n.input.lastChromeDelete = Date.now()), it && !k && y.start() != m.start() && m.parentOffset == 0 && y.depth == m.depth && c.sel && c.sel.anchor == c.sel.head && c.sel.head == p.endA && (p.endB -= 2, m = c.doc.resolveNoCache(p.endB - c.from), setTimeout(() => {
-    n.someProp("handleKeyDown", function(R) {
-      return R(n, Lt(13, "Enter"));
+  ue && p.endB == p.start && (n.input.lastChromeDelete = Date.now()), it && !k && y.start() != m.start() && m.parentOffset == 0 && y.depth == m.depth && c.sel && c.sel.anchor == c.sel.head && c.sel.head == p.endA && (p.endB -= 2, m = c.doc.resolveNoCache(p.endB - c.from), setTimeout(() => {
+    n.someProp("handleKeyDown", function(D) {
+      return D(n, Lt(13, "Enter"));
     });
   }, 20));
-  let v = p.start, P = p.endA, D, B, z;
+  let P = p.start, z = p.endA, R, B, v;
   if (k) {
     if (y.pos == m.pos)
-      Se && Ot <= 11 && y.parentOffset == 0 && (n.domObserver.suppressSelectionUpdates(), setTimeout(() => at(n), 20)), D = n.state.tr.delete(v, P), B = u.resolve(p.start).marksAcross(u.resolve(p.endA));
+      ke && Ot <= 11 && y.parentOffset == 0 && (n.domObserver.suppressSelectionUpdates(), setTimeout(() => at(n), 20)), R = n.state.tr.delete(P, z), B = u.resolve(p.start).marksAcross(u.resolve(p.endA));
     else if (
       // Adding or removing a mark
-      p.endA == p.endB && (z = Gp(y.parent.content.cut(y.parentOffset, m.parentOffset), x.parent.content.cut(x.parentOffset, p.endA - x.start())))
+      p.endA == p.endB && (v = Gp(y.parent.content.cut(y.parentOffset, m.parentOffset), x.parent.content.cut(x.parentOffset, p.endA - x.start())))
     )
-      D = n.state.tr, z.type == "add" ? D.addMark(v, P, z.mark) : D.removeMark(v, P, z.mark);
+      R = n.state.tr, v.type == "add" ? R.addMark(P, z, v.mark) : R.removeMark(P, z, v.mark);
     else if (y.parent.child(y.index()).isText && y.index() == m.index() - (m.textOffset ? 0 : 1)) {
-      let R = y.parent.textBetween(y.parentOffset, m.parentOffset);
-      if (n.someProp("handleTextInput", (_) => _(n, v, P, R)))
+      let D = y.parent.textBetween(y.parentOffset, m.parentOffset);
+      if (n.someProp("handleTextInput", (L) => L(n, P, z, D)))
         return;
-      D = n.state.tr.insertText(R, v, P);
+      R = n.state.tr.insertText(D, P, z);
     }
   }
-  if (D || (D = n.state.tr.replace(v, P, c.doc.slice(p.start - c.from, p.endB - c.from))), c.sel) {
-    let R = Al(n, D.doc, c.sel);
-    R && !(ce && n.composing && R.empty && (p.start != p.endB || n.input.lastChromeDelete < Date.now() - 100) && (R.head == v || R.head == D.mapping.map(P) - 1) || Se && R.empty && R.head == v) && D.setSelection(R);
+  if (R || (R = n.state.tr.replace(P, z, c.doc.slice(p.start - c.from, p.endB - c.from))), c.sel) {
+    let D = Al(n, R.doc, c.sel);
+    D && !(ue && n.composing && D.empty && (p.start != p.endB || n.input.lastChromeDelete < Date.now() - 100) && (D.head == P || D.head == R.mapping.map(z) - 1) || ke && D.empty && D.head == P) && R.setSelection(D);
   }
-  B && D.ensureMarks(B), o && D.setMeta("composition", o), n.dispatch(D.scrollIntoView());
+  B && R.ensureMarks(B), o && R.setMeta("composition", o), n.dispatch(R.scrollIntoView());
 }
 function Al(n, e, t) {
   return Math.max(t.anchor, t.head) > e.content.size ? null : Jo(n, e.resolve(t.anchor), e.resolve(t.head));
@@ -9911,9 +9911,9 @@ class Zp {
     let d = u == "preserve" && i && this.dom.style.overflowAnchor == null && Ih(this);
     if (i) {
       this.domObserver.stop();
-      let h = f && (Se || ce) && !this.composing && !s.selection.empty && !e.selection.empty && em(s.selection, e.selection);
+      let h = f && (ke || ue) && !this.composing && !s.selection.empty && !e.selection.empty && em(s.selection, e.selection);
       if (f) {
-        let p = ce ? this.trackWrites = this.domSelectionRange().focusNode : null;
+        let p = ue ? this.trackWrites = this.domSelectionRange().focusNode : null;
         this.composing && (this.input.compositionNode = Rp(this)), (o || !this.docView.update(e.doc, c, a, this)) && (this.docView.updateOuterDeco(c), this.docView.destroy(), this.docView = fl(e.doc, c, a, this.dom, this)), p && !this.trackWrites && (h = !0);
       }
       h || !(this.input.mouseDown && this.domObserver.currentSelection.eq(this.domSelectionRange()) && np(this)) ? at(this, h) : (Jc(this, e.selection), this.domObserver.setCurSelection()), this.domObserver.start();
@@ -9984,7 +9984,7 @@ class Zp {
   Query whether the view has focus.
   */
   hasFocus() {
-    if (Se) {
+    if (ke) {
       let e = this.root.activeElement;
       if (e == this.dom)
         return !0;
@@ -10157,7 +10157,7 @@ class Zp {
   */
   domSelectionRange() {
     let e = this.domSelection();
-    return e ? me && this.root.nodeType === 11 && Dh(this.dom.ownerDocument) == this.dom && qp(this, e) || e : { focusNode: null, focusOffset: 0, anchorNode: null, anchorOffset: 0 };
+    return e ? ge && this.root.nodeType === 11 && Dh(this.dom.ownerDocument) == this.dom && qp(this, e) || e : { focusNode: null, focusOffset: 0, anchorNode: null, anchorOffset: 0 };
   }
   /**
   @internal
@@ -10463,7 +10463,7 @@ function ym(n, e, t, r, s) {
   let o = S.empty;
   for (let u = t.length - 1; u >= 0; u--)
     o = S.from(t[u].type.create(t[u].attrs, o));
-  n.step(new se(e.start - (r ? 2 : 0), e.end, e.start, e.end, new C(o, 0, 0), t.length, !0));
+  n.step(new oe(e.start - (r ? 2 : 0), e.end, e.start, e.end, new C(o, 0, 0), t.length, !0));
   let i = 0;
   for (let u = 0; u < t.length; u++)
     t[u].type == s && (i = u + 1);
@@ -10510,7 +10510,7 @@ function xm(n) {
 }
 function Sm(n, e, t, r) {
   let s = n.tr, o = r.end, i = r.$to.end(r.depth);
-  o < i && (s.step(new se(o - 1, i, o, i, new C(S.from(t.create(null, r.parent.copy())), 1, 0), 1, !0)), r = new zr(s.doc.resolve(r.$from.pos), s.doc.resolve(i), r.depth));
+  o < i && (s.step(new oe(o - 1, i, o, i, new C(S.from(t.create(null, r.parent.copy())), 1, 0), 1, !0)), r = new zr(s.doc.resolve(r.$from.pos), s.doc.resolve(i), r.depth));
   const l = lr(r);
   if (l == null)
     return !1;
@@ -10529,7 +10529,7 @@ function km(n, e, t) {
   if (!c.canReplace(u + (l ? 0 : 1), u + 1, i.content.append(a ? S.empty : S.from(s))))
     return !1;
   let f = o.pos, d = f + i.nodeSize;
-  return r.step(new se(f - (l ? 1 : 0), d + (a ? 1 : 0), f + 1, d - 1, new C((l ? S.empty : S.from(s.copy(S.empty))).append(a ? S.empty : S.from(s.copy(S.empty))), l ? 0 : 1, a ? 0 : 1), l ? 0 : 1)), e(r.scrollIntoView()), !0;
+  return r.step(new oe(f - (l ? 1 : 0), d + (a ? 1 : 0), f + 1, d - 1, new C((l ? S.empty : S.from(s.copy(S.empty))).append(a ? S.empty : S.from(s.copy(S.empty))), l ? 0 : 1, a ? 0 : 1), l ? 0 : 1)), e(r.scrollIntoView()), !0;
 }
 function Cm(n) {
   return function(e, t) {
@@ -10544,7 +10544,7 @@ function Cm(n) {
       return !1;
     if (t) {
       let c = a.lastChild && a.lastChild.type == l.type, u = S.from(c ? n.create() : null), f = new C(S.from(n.create(null, S.from(l.type.create(null, u)))), c ? 3 : 1, 0), d = o.start, h = o.end;
-      t(e.tr.step(new se(d - (c ? 3 : 1), h, d, h, f, 1, !0)).scrollIntoView());
+      t(e.tr.step(new oe(d - (c ? 3 : 1), h, d, h, f, 1, !0)).scrollIntoView());
     }
     return !0;
   };
@@ -11118,7 +11118,7 @@ function Kl(n, e, t) {
       return bt(n, i);
   }
   if (!s.parent.inlineContent) {
-    let i = e < 0 ? s : o, l = r instanceof xe ? $.near(i, e) : $.findFrom(i, e);
+    let i = e < 0 ? s : o, l = r instanceof Se ? $.near(i, e) : $.findFrom(i, e);
     return l ? bt(n, l) : !1;
   }
   return !1;
@@ -11889,7 +11889,7 @@ class Q {
   you must make a copy if you want need to preserve that.
   */
   static create(e, t) {
-    return t.length ? Qr(t, e, 0, Ut) : he;
+    return t.length ? Qr(t, e, 0, Ut) : pe;
   }
   /**
   Find all decorations in this set which touch the given range
@@ -11919,7 +11919,7 @@ class Q {
   document.
   */
   map(e, t, r) {
-    return this == he || e.maps.length == 0 ? this : this.mapInner(e, t, 0, 0, r || Ut);
+    return this == pe || e.maps.length == 0 ? this : this.mapInner(e, t, 0, 0, r || Ut);
   }
   /**
   @internal
@@ -11930,7 +11930,7 @@ class Q {
       let a = this.local[l].map(e, r, s);
       a && a.type.valid(t, a) ? (i || (i = [])).push(a) : o.onRemove && o.onRemove(this.local[l].spec);
     }
-    return this.children.length ? Ag(this.children, i || [], e, t, r, s, o) : i ? new Q(i.sort(Yt), mn) : he;
+    return this.children.length ? Ag(this.children, i || [], e, t, r, s, o) : i ? new Q(i.sort(Yt), mn) : pe;
   }
   /**
   Add the given array of decorations to the ones in the set,
@@ -11939,7 +11939,7 @@ class Q {
   structure.
   */
   add(e, t) {
-    return t.length ? this == he ? Q.create(e, t) : this.addInner(e, t, 0) : this;
+    return t.length ? this == pe ? Q.create(e, t) : this.addInner(e, t, 0) : this;
   }
   addInner(e, t, r) {
     let s, o = 0;
@@ -11961,7 +11961,7 @@ class Q {
   the ones in the given array.
   */
   remove(e) {
-    return e.length == 0 || this == he ? this : this.removeInner(e, 0);
+    return e.length == 0 || this == pe ? this : this.removeInner(e, 0);
   }
   removeInner(e, t) {
     let r = this.children, s = this.local;
@@ -11973,7 +11973,7 @@ class Q {
         continue;
       r == this.children && (r = this.children.slice());
       let c = r[o + 2].removeInner(i, l + 1);
-      c != he ? r[o + 2] = c : (r.splice(o, 3), o -= 3);
+      c != pe ? r[o + 2] = c : (r.splice(o, 3), o -= 3);
     }
     if (s.length) {
       for (let o = 0, i; o < e.length; o++)
@@ -11981,10 +11981,10 @@ class Q {
           for (let l = 0; l < s.length; l++)
             s[l].eq(i, t) && (s == this.local && (s = this.local.slice()), s.splice(l--, 1));
     }
-    return r == this.children && s == this.local ? this : s.length || r.length ? new Q(s, r) : he;
+    return r == this.children && s == this.local ? this : s.length || r.length ? new Q(s, r) : pe;
   }
   forChild(e, t) {
-    if (this == he)
+    if (this == pe)
       return this;
     if (t.isLeaf)
       return Q.empty;
@@ -12006,7 +12006,7 @@ class Q {
       let l = new Q(s.sort(Yt), mn);
       return r ? new Tg([l, r]) : l;
     }
-    return r || he;
+    return r || pe;
   }
   /**
   @internal
@@ -12034,7 +12034,7 @@ class Q {
   @internal
   */
   localsInner(e) {
-    if (this == he)
+    if (this == pe)
       return mn;
     if (e.inlineContent || !this.local.some(Et.is))
       return this.local;
@@ -12049,7 +12049,7 @@ class Q {
 }
 Q.empty = new Q([], []);
 Q.removeOverlap = ii;
-const he = Q.empty;
+const pe = Q.empty;
 let Tg = class gn {
   constructor(e) {
     this.members = e;
@@ -12064,7 +12064,7 @@ let Tg = class gn {
     let r = [];
     for (let s = 0; s < this.members.length; s++) {
       let o = this.members[s].forChild(e, t);
-      o != he && (o instanceof gn ? r = r.concat(o.members) : r.push(o));
+      o != pe && (o instanceof gn ? r = r.concat(o.members) : r.push(o));
     }
     return gn.from(r);
   }
@@ -12096,7 +12096,7 @@ let Tg = class gn {
   static from(e) {
     switch (e.length) {
       case 0:
-        return he;
+        return pe;
       case 1:
         return e[0];
       default:
@@ -12139,7 +12139,7 @@ function Ag(n, e, t, r, s, o, i) {
       let d = t.map(n[c + 1] + o, -1), h = d - s, { index: p, offset: y } = r.content.findIndex(f), m = r.maybeChild(p);
       if (m && y == f && y + m.nodeSize == h) {
         let x = l[c + 2].mapInner(t, m, u + 1, n[c] + o + 1, i);
-        x != he ? (l[c] = f, l[c + 1] = h, l[c + 2] = x) : (l[c + 1] = -2, a = !0);
+        x != pe ? (l[c] = f, l[c + 1] = h, l[c + 2] = x) : (l[c + 1] = -2, a = !0);
       } else
         a = !0;
     }
@@ -12201,13 +12201,13 @@ function Qr(n, e, t, r) {
     if (c) {
       o = !0;
       let u = Qr(c, l, t + a + 1, r);
-      u != he && s.push(a, a + l.nodeSize, u);
+      u != pe && s.push(a, a + l.nodeSize, u);
     }
   });
   let i = zu(o ? Fu(n) : n, -t).sort(Yt);
   for (let l = 0; l < i.length; l++)
     i[l].type.valid(e, i[l]) || (r.onRemove && r.onRemove(i[l].spec), i.splice(l--, 1));
-  return i.length || s.length ? new Q(i, s) : he;
+  return i.length || s.length ? new Q(i, s) : pe;
 }
 function Yt(n, e) {
   return n.from - e.from || n.to - e.to;
@@ -12247,7 +12247,7 @@ if (typeof WeakMap < "u") {
       if (n[s] == r) return n[s + 1];
   }, Do = (r, s) => (t == 10 && (t = 0), n[t++] = r, n[t++] = s);
 }
-var re = class {
+var se = class {
   constructor(n, e, t, r) {
     this.width = n, this.height = e, this.map = t, this.problems = r;
   }
@@ -12352,18 +12352,18 @@ function Ig(n) {
           });
           break;
         }
-        const v = s + M * e;
-        for (let P = 0; P < m; P++) {
-          r[v + P] == 0 ? r[v + P] = u : (o || (o = [])).push({
+        const P = s + M * e;
+        for (let z = 0; z < m; z++) {
+          r[P + z] == 0 ? r[P + z] = u : (o || (o = [])).push({
             type: "collision",
             row: c,
             pos: u,
-            n: m - P
+            n: m - z
           });
-          const D = k && k[P];
-          if (D) {
-            const B = (v + P) % e * 2, z = i[B];
-            z == null || z != D && i[B + 1] == 1 ? (i[B] = D, i[B + 1] = 1) : z == D && i[B + 1]++;
+          const R = k && k[z];
+          if (R) {
+            const B = (P + z) % e * 2, v = i[B];
+            v == null || v != R && i[B + 1] == 1 ? (i[B] = R, i[B + 1] = 1) : v == R && i[B + 1]++;
           }
         }
       }
@@ -12375,7 +12375,7 @@ function Ig(n) {
     h && (o || (o = [])).push({ type: "missing", row: c, n: h }), u++;
   }
   (e === 0 || t === 0) && (o || (o = [])).push({ type: "zero_sized" });
-  const l = new re(e, t, r, o);
+  const l = new se(e, t, r, o);
   let a = !1;
   for (let c = 0; !a && c < i.length; c += 2)
     i[c] != null && i[c + 1] < t && (a = !0);
@@ -12519,7 +12519,7 @@ function zg(n) {
     }
   };
 }
-function be(n) {
+function xe(n) {
   let e = n.cached.tableNodeTypes;
   if (!e) {
     e = n.cached.tableNodeTypes = {};
@@ -12582,7 +12582,7 @@ function li(n, e) {
   return n.depth == e.depth && n.pos >= e.start(-1) && n.pos <= e.end(-1);
 }
 function Bu(n, e, t) {
-  const r = n.node(-1), s = re.get(r), o = n.start(-1), i = s.nextCell(n.pos - o, e, t);
+  const r = n.node(-1), s = se.get(r), o = n.start(-1), i = s.nextCell(n.pos - o, e, t);
   return i == null ? null : n.node(0).resolve(o + i);
 }
 function en(n, e, t = 1) {
@@ -12598,7 +12598,7 @@ function Lu(n, e, t = 1) {
   return r;
 }
 function Lg(n, e, t) {
-  const r = be(e.type.schema).header_cell;
+  const r = xe(e.type.schema).header_cell;
   for (let s = 0; s < n.height; s++)
     if (e.nodeAt(n.map[t + s * n.width]).type != r)
       return !1;
@@ -12610,7 +12610,7 @@ var H = class nt extends $ {
   // cells in the same table. They may be the same, to select a single
   // cell.
   constructor(e, t = e) {
-    const r = e.node(-1), s = re.get(r), o = e.start(-1), i = s.rectBetween(
+    const r = e.node(-1), s = se.get(r), o = e.start(-1), i = s.rectBetween(
       e.pos - o,
       t.pos - o
     ), l = e.node(0), a = s.cellsInRect(i).filter((u) => u != t.pos - o);
@@ -12638,7 +12638,7 @@ var H = class nt extends $ {
   // Returns a rectangular slice of table rows containing the selected
   // cells.
   content() {
-    const e = this.$anchorCell.node(-1), t = re.get(e), r = this.$anchorCell.start(-1), s = t.rectBetween(
+    const e = this.$anchorCell.node(-1), t = se.get(e), r = this.$anchorCell.start(-1), s = t.rectBetween(
       this.$anchorCell.pos - r,
       this.$headCell.pos - r
     ), o = {}, i = [];
@@ -12701,7 +12701,7 @@ var H = class nt extends $ {
     this.replace(e, new C(S.from(t), 0, 0));
   }
   forEachCell(e) {
-    const t = this.$anchorCell.node(-1), r = re.get(t), s = this.$anchorCell.start(-1), o = r.cellsInRect(
+    const t = this.$anchorCell.node(-1), r = se.get(t), s = this.$anchorCell.start(-1), o = r.cellsInRect(
       r.rectBetween(
         this.$anchorCell.pos - s,
         this.$headCell.pos - s
@@ -12721,7 +12721,7 @@ var H = class nt extends $ {
   // Returns the smallest column selection that covers the given anchor
   // and head cell.
   static colSelection(e, t = e) {
-    const r = e.node(-1), s = re.get(r), o = e.start(-1), i = s.findCell(e.pos - o), l = s.findCell(t.pos - o), a = e.node(0);
+    const r = e.node(-1), s = se.get(r), o = e.start(-1), i = s.findCell(e.pos - o), l = s.findCell(t.pos - o), a = e.node(0);
     return i.top <= l.top ? (i.top > 0 && (e = a.resolve(o + s.map[i.left])), l.bottom < s.height && (t = a.resolve(
       o + s.map[s.width * (s.height - 1) + l.right - 1]
     ))) : (l.top > 0 && (t = a.resolve(o + s.map[l.left])), i.bottom < s.height && (e = a.resolve(
@@ -12731,7 +12731,7 @@ var H = class nt extends $ {
   // True if this selection goes all the way from the left to the
   // right of the table.
   isRowSelection() {
-    const e = this.$anchorCell.node(-1), t = re.get(e), r = this.$anchorCell.start(-1), s = t.colCount(this.$anchorCell.pos - r), o = t.colCount(this.$headCell.pos - r);
+    const e = this.$anchorCell.node(-1), t = se.get(e), r = this.$anchorCell.start(-1), s = t.colCount(this.$anchorCell.pos - r), o = t.colCount(this.$headCell.pos - r);
     if (Math.min(s, o) > 0) return !1;
     const i = s + this.$anchorCell.nodeAfter.attrs.colspan, l = o + this.$headCell.nodeAfter.attrs.colspan;
     return Math.max(i, l) == t.width;
@@ -12742,7 +12742,7 @@ var H = class nt extends $ {
   // Returns the smallest row selection that covers the given anchor
   // and head cell.
   static rowSelection(e, t = e) {
-    const r = e.node(-1), s = re.get(r), o = e.start(-1), i = s.findCell(e.pos - o), l = s.findCell(t.pos - o), a = e.node(0);
+    const r = e.node(-1), s = se.get(r), o = e.start(-1), i = s.findCell(e.pos - o), l = s.findCell(t.pos - o), a = e.node(0);
     return i.left <= l.left ? (i.left > 0 && (e = a.resolve(
       o + s.map[i.top * s.width]
     )), l.right < s.width && (t = a.resolve(
@@ -12828,7 +12828,7 @@ function Jg(n, e, t) {
       const l = s.resolve(r.from + 1);
       o = H.rowSelection(l, l);
     } else if (!t) {
-      const l = re.get(r.node), a = r.from + 1, c = a + l.map[l.width * l.height - 1];
+      const l = se.get(r.node), a = r.from + 1, c = a + l.map[l.width * l.height - 1];
       o = H.create(s, a + 1, c);
     }
   } else r instanceof V && qg(r) ? o = V.create(s, r.from) : r instanceof V && Hg(r) && (o = V.create(s, r.$from.start(), r.$from.end()));
@@ -12855,7 +12855,7 @@ function ai(n, e) {
   return e ? e.doc != n.doc && _u(e.doc, n.doc, 0, r) : n.doc.descendants(r), t;
 }
 function Ug(n, e, t, r) {
-  const s = re.get(e);
+  const s = se.get(e);
   if (!s.problems) return r;
   r || (r = n.tr);
   const o = [];
@@ -12903,7 +12903,7 @@ function Ug(n, e, t, r) {
       u.firstChild && (h = u.firstChild.type.spec.tableRole);
       const p = [];
       for (let m = 0; m < d; m++) {
-        const x = be(n.schema)[h].createAndFill();
+        const x = xe(n.schema)[h].createAndFill();
         x && p.push(x);
       }
       const y = (a == 0 || i == a - 1) && l == a ? c + 1 : f - 1;
@@ -12914,7 +12914,7 @@ function Ug(n, e, t, r) {
   return r.setMeta(Kg, { fixTables: !0 });
 }
 function Qe(n) {
-  const e = n.selection, t = hs(n), r = t.node(-1), s = t.start(-1), o = re.get(r);
+  const e = n.selection, t = hs(n), r = t.node(-1), s = t.start(-1), o = se.get(r);
   return { ...e instanceof H ? o.rectBetween(
     e.$anchorCell.pos - s,
     e.$headCell.pos - s
@@ -12933,7 +12933,7 @@ function qu(n, { map: e, tableStart: t, table: r }, s) {
         Lu(c.attrs, s - e.colCount(a))
       ), i += c.attrs.rowspan - 1;
     } else {
-      const a = o == null ? be(r.type.schema).cell : r.nodeAt(e.map[l + o]).type, c = e.positionAt(i, s, r);
+      const a = o == null ? xe(r.type.schema).cell : r.nodeAt(e.map[l + o]).type, c = e.positionAt(i, s, r);
       n.insert(n.mapping.map(t + c), a.createAndFill());
     }
   }
@@ -12981,7 +12981,7 @@ function Qg(n, e) {
       const o = t.tableStart ? r.doc.nodeAt(t.tableStart - 1) : r.doc;
       if (!o)
         throw RangeError("No table found");
-      t.table = o, t.map = re.get(o);
+      t.table = o, t.map = se.get(o);
     }
     e(r);
   }
@@ -12989,7 +12989,7 @@ function Qg(n, e) {
 }
 function Zg(n, e, t) {
   var r;
-  const s = be(e.type.schema).header_cell;
+  const s = xe(e.type.schema).header_cell;
   for (let o = 0; o < n.width; o++)
     if (((r = e.nodeAt(n.map[o + t * n.width])) == null ? void 0 : r.type) != s)
       return !1;
@@ -13010,10 +13010,10 @@ function Hu(n, { map: e, tableStart: t, table: r }, s) {
         rowspan: d.rowspan + 1
       }), c += d.colspan - 1;
     } else {
-      const f = a == null ? be(r.type.schema).cell : (o = r.nodeAt(e.map[u + a * e.width])) == null ? void 0 : o.type, d = f == null ? void 0 : f.createAndFill();
+      const f = a == null ? xe(r.type.schema).cell : (o = r.nodeAt(e.map[u + a * e.width])) == null ? void 0 : o.type, d = f == null ? void 0 : f.createAndFill();
       d && l.push(d);
     }
-  return n.insert(i, be(r.type.schema).row.create(null, l)), n;
+  return n.insert(i, xe(r.type.schema).row.create(null, l)), n;
 }
 function ey(n, e) {
   if (!Ve(n)) return !1;
@@ -13065,7 +13065,7 @@ function ry(n, e) {
       const o = t.tableStart ? r.doc.nodeAt(t.tableStart - 1) : r.doc;
       if (!o)
         throw RangeError("No table found");
-      t.table = o, t.map = re.get(t.table);
+      t.table = o, t.map = se.get(t.table);
     }
     e(r);
   }
@@ -13130,7 +13130,7 @@ function oy(n, e) {
   return !0;
 }
 function iy(n, e) {
-  const t = be(n.schema);
+  const t = xe(n.schema);
   return ly(({ node: r }) => t[r.type.spec.tableRole])(n, e);
 }
 function ly(n) {
@@ -13207,7 +13207,7 @@ function ay(n) {
   return function(e, t) {
     if (!Ve(e)) return !1;
     if (t) {
-      const r = be(e.schema), s = Qe(e), o = e.tr, i = s.map.cellsInRect(
+      const r = xe(e.schema), s = Qe(e), o = e.tr, i = s.map.cellsInRect(
         n == "column" ? {
           left: s.left,
           top: 0,
@@ -13256,7 +13256,7 @@ function ci(n, e) {
   return e = e || { useDeprecatedLogic: !1 }, e.useDeprecatedLogic ? ay(n) : function(t, r) {
     if (!Ve(t)) return !1;
     if (r) {
-      const s = be(t.schema), o = Qe(t), i = t.tr, l = ra("row", o, s), a = ra(
+      const s = xe(t.schema), o = Qe(t), i = t.tr, l = ra("row", o, s), a = ra(
         "column",
         o,
         s
@@ -13335,7 +13335,7 @@ function Sr(n, e) {
   const t = n.selection;
   if (!(t instanceof H)) return !1;
   if (e) {
-    const r = n.tr, s = be(n.schema).cell.createAndFill().content;
+    const r = n.tr, s = xe(n.schema).cell.createAndFill().content;
     t.forEachCell((o, i) => {
       o.content.eq(s) || r.replace(
         r.mapping.map(i + 1),
@@ -13357,14 +13357,14 @@ function py(n) {
       let c = e.child(a).content;
       const u = a ? 0 : Math.max(0, t - 1), f = a < e.childCount - 1 ? 0 : Math.max(0, r - 1);
       (u || f) && (c = Oo(
-        be(i).row,
+        xe(i).row,
         new C(c, u, f)
       ).content), l.push(c);
     }
   else if (o == "cell" || o == "header_cell")
     l.push(
       t || r ? Oo(
-        be(i).row,
+        xe(i).row,
         new C(e, t, r)
       ).content : e
     );
@@ -13386,7 +13386,7 @@ function my(n, e) {
   for (let s = 0; s < t.length; s++) r = Math.max(r, t[s]);
   for (let s = 0; s < t.length; s++)
     if (s >= e.length && e.push(S.empty), t[s] < r) {
-      const o = be(n).cell.createAndFill(), i = [];
+      const o = xe(n).cell.createAndFill(), i = [];
       for (let l = t[s]; l < r; l++)
         i.push(o);
       e[s] = e[s].append(S.from(i));
@@ -13440,7 +13440,7 @@ function gy({ width: n, height: e, rows: t }, r, s) {
   return { width: n, height: e, rows: t };
 }
 function yy(n, e, t, r, s, o, i) {
-  const l = n.doc.type.schema, a = be(l);
+  const l = n.doc.type.schema, a = xe(l);
   let c, u;
   if (s > e.width)
     for (let f = 0, d = 0; f < e.height; f++) {
@@ -13518,13 +13518,13 @@ function la(n, e, t, r, s) {
   let o = t ? n.doc.nodeAt(t - 1) : n.doc;
   if (!o)
     throw new Error("No table found");
-  let i = re.get(o);
+  let i = se.get(o);
   const { top: l, left: a } = r, c = a + s.width, u = l + s.height, f = n.tr;
   let d = 0;
   function h() {
     if (o = t ? f.doc.nodeAt(t - 1) : f.doc, !o)
       throw new Error("No table found");
-    i = re.get(o), d = f.mapping.maps.length;
+    i = se.get(o), d = f.mapping.maps.length;
   }
   yy(f, i, o, t, c, u, d) && h(), oa(f, i, o, t, a, c, l, d) && h(), oa(f, i, o, t, a, c, u, d) && h(), ia(f, i, o, t, l, u, a, d) && h(), ia(f, i, o, t, l, u, c, d) && h();
   for (let p = l; p < u; p++) {
@@ -13619,11 +13619,11 @@ function Sy(n, e, t) {
       height: 1,
       rows: [
         S.from(
-          Oo(be(n.state.schema).cell, t)
+          Oo(xe(n.state.schema).cell, t)
         )
       ]
     });
-    const o = s.$anchorCell.node(-1), i = s.$anchorCell.start(-1), l = re.get(o).rectBetween(
+    const o = s.$anchorCell.node(-1), i = s.$anchorCell.start(-1), l = se.get(o).rectBetween(
       s.$anchorCell.pos - i,
       s.$headCell.pos - i
     );
@@ -13634,7 +13634,7 @@ function Sy(n, e, t) {
       n.state,
       n.dispatch,
       i,
-      re.get(o.node(-1)).findCell(o.pos - i),
+      se.get(o.node(-1)).findCell(o.pos - i),
       r
     ), !0;
   } else
@@ -13928,11 +13928,11 @@ function X() {
   typeof document > "u" || Pf(...e);
 }
 function Py(n, e) {
-  const t = oe(Xu);
+  const t = ie(Xu);
   X(() => t(n), e);
 }
 function ft(n, e) {
-  const { view: t, flushSyncRef: r } = oe(Vt);
+  const { view: t, flushSyncRef: r } = ie(Vt);
   Py(
     () => {
       if (t != null && t.docView) {
@@ -14111,7 +14111,7 @@ _y && +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [
   0,
   0
 ])[1];
-const ue = {
+const fe = {
   ie: ps,
   ie_version: Fy,
   gecko: Zu,
@@ -14255,18 +14255,18 @@ function Gy(n) {
   const e = n, t = e.domSelection(), r = document.createRange();
   if (!t) return;
   const s = e.cursorWrapper.dom, o = s.nodeName == "IMG";
-  o ? r.setStart(s.parentNode, xt(s) + 1) : r.setStart(s, 0), r.collapse(!0), t.removeAllRanges(), t.addRange(r), !o && !e.state.selection.visible && ue.ie && ue.ie_version <= 11 && (s.disabled = !0, s.disabled = !1);
+  o ? r.setStart(s.parentNode, xt(s) + 1) : r.setStart(s, 0), r.collapse(!0), t.removeAllRanges(), t.addRange(r), !o && !e.state.selection.visible && fe.ie && fe.ie_version <= 11 && (s.disabled = !0, s.disabled = !1);
 }
 function xa(n, e) {
   const t = n, { node: r, offset: s } = t.docView.domFromPos(e, 0), o = s < r.childNodes.length ? r.childNodes[s] : null, i = s ? r.childNodes[s - 1] : null;
-  if (ue.safari && o && o.contentEditable == "false") return Ys(o);
+  if (fe.safari && o && o.contentEditable == "false") return Ys(o);
   if ((!o || o.contentEditable == "false") && (!i || i.contentEditable == "false")) {
     if (o) return Ys(o);
     if (i) return Ys(i);
   }
 }
 function Ys(n) {
-  return n.contentEditable = "true", ue.safari && n.draggable && (n.draggable = !1, n.wasDraggable = !0), n;
+  return n.contentEditable = "true", fe.safari && n.draggable && (n.draggable = !1, n.wasDraggable = !0), n;
 }
 function Sa(n) {
   n.contentEditable = "false", n.wasDraggable && (n.draggable = !0, n.wasDraggable = null);
@@ -14281,12 +14281,12 @@ function Xy(n) {
     }, 20));
   });
 }
-const ka = ue.safari || ue.chrome && ue.chrome_version < 63;
+const ka = fe.safari || fe.chrome && fe.chrome_version < 63;
 function Mr(n) {
   let e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1;
   const t = n, r = t.state.selection;
   if (Uy(t, r), !!tf(t)) {
-    if (!e && t.input.mouseDown && t.input.mouseDown.allowDefault && ue.chrome) {
+    if (!e && t.input.mouseDown && t.input.mouseDown.allowDefault && fe.chrome) {
       const s = t.domSelectionRange(), o = t.domObserver.currentSelection;
       if (s.anchorNode && o.anchorNode && es(s.anchorNode, s.anchorOffset, o.anchorNode, o.anchorOffset)) {
         t.input.mouseDown.delayedSelectionSync = !0, t.domObserver.setCurSelection();
@@ -14406,7 +14406,7 @@ class Zy {
   onSelectionChange() {
     if (pa(this.view) && !this.view.composing) {
       if (this.suppressingSelectionUpdates) return Mr(this.view);
-      if (ue.ie && ue.ie_version <= 11 && !this.view.state.selection.empty) {
+      if (fe.ie && fe.ie_version <= 11 && !this.view.state.selection.empty) {
         const e = this.view.domSelectionRange();
         if (e.focusNode && es(
           e.focusNode,
@@ -14750,7 +14750,7 @@ class pr {
     let l = this.domFromPos(e, e ? -1 : 1), a = t == e ? l : this.domFromPos(t, t ? -1 : 1);
     const c = r.root.getSelection(), u = r.domSelectionRange();
     let f = !1;
-    if ((ue.gecko || ue.safari) && e == t) {
+    if ((fe.gecko || fe.safari) && e == t) {
       const { node: p, offset: y } = l;
       if (p.nodeType == 3) {
         if (f = !!(y && ((h = p.nodeValue) == null ? void 0 : h[y - 1]) == `
@@ -14771,11 +14771,11 @@ class pr {
         f = m && (m.nodeName == "BR" || m.contentEditable == "false");
       }
     }
-    if (ue.gecko && u.focusNode && u.focusNode != a.node && u.focusNode.nodeType == 1) {
+    if (fe.gecko && u.focusNode && u.focusNode != a.node && u.focusNode.nodeType == 1) {
       const p = u.focusNode.childNodes[u.focusOffset];
       p && p.contentEditable == "false" && (s = !0);
     }
-    if (!(s || f && ue.safari) && es(l.node, l.offset, u.anchorNode, u.anchorOffset) && es(a.node, a.offset, u.focusNode, u.focusOffset)) return;
+    if (!(s || f && fe.safari) && es(l.node, l.offset, u.anchorNode, u.anchorOffset) && es(a.node, a.offset, u.focusNode, u.focusOffset)) return;
     let d = !1;
     if ((c.extend || e == t) && !f) {
       c.collapse(l.node, l.offset);
@@ -15191,10 +15191,10 @@ function fb(n, e) {
     e.plugins,
     u,
     h
-  ]), y = He(function(z) {
+  ]), y = He(function(v) {
     t.current ? Ri(() => {
-      e.state || a((R) => R.apply(z)), e.dispatchTransaction && e.dispatchTransaction.call(this, z);
-    }) : (e.state || a((R) => R.apply(z)), e.dispatchTransaction && e.dispatchTransaction.call(this, z));
+      e.state || a((D) => D.apply(v)), e.dispatchTransaction && e.dispatchTransaction.call(this, v);
+    }) : (e.state || a((D) => D.apply(v)), e.dispatchTransaction && e.dispatchTransaction.call(this, v));
   }, [
     e.dispatchTransaction,
     e.state
@@ -15208,43 +15208,43 @@ function fb(n, e) {
     plugins: p,
     dispatchTransaction: y,
     docView: k.current
-  }, [v, P] = N(
+  }, [P, z] = N(
     // During the initial render, we create something of a dummy
     // EditorView. This allows us to ensure that the first render actually
     // renders the document, which is necessary for SSR.
     () => new Na(null, M)
   );
   return X(() => () => {
-    v == null || v.destroy();
+    P == null || P.destroy();
   }, [
-    v
+    P
   ]), X(() => {
     if (!n) {
-      P(null);
+      z(null);
       return;
     }
-    if (!v || v.dom !== n) {
+    if (!P || P.dom !== n) {
       const B = new Na({
         mount: n
       }, M);
-      P(B), B.dom.addEventListener("compositionend", o);
+      z(B), B.dom.addEventListener("compositionend", o);
       return;
     }
-    if (v.needsRedraw) {
-      P(null);
+    if (P.needsRedraw) {
+      z(null);
       return;
     }
-    v == null || v.domObserver.selectionToDOM(), v == null || v.runPendingEffects();
-  }), v == null || v.pureSetProps(M), {
+    P == null || P.domObserver.selectionToDOM(), P == null || P.runPendingEffects();
+  }), P == null || P.pureSetProps(M), {
     editor: Me(() => ({
-      view: v,
+      view: P,
       registerEventListener: f,
       unregisterEventListener: d,
       cursorWrapper: r,
       docViewDescRef: k,
       flushSyncRef: t
     }), [
-      v,
+      P,
       f,
       d,
       r
@@ -15288,23 +15288,23 @@ const Oe = ct({
   }
 });
 function pi(n, e, t, r, s, o, i, l) {
-  const { view: a } = oe(Vt), [c, u] = N(!0), f = I(i), d = I(() => !1), h = He((D) => {
-    d.current = D;
-  }, []), p = I(() => !1), y = He((D) => {
-    p.current = D;
+  const { view: a } = ie(Vt), [c, u] = N(!0), f = I(i), d = I(() => !1), h = He((R) => {
+    d.current = R;
+  }, []), p = I(() => !1), y = He((R) => {
+    p.current = R;
   }, []), m = I(() => {
     !r.current || !n || (r.current.nodeType == 1 && r.current.classList.add("ProseMirror-selectednode"), (l != null && l.current || !n.type.spec.draggable) && (((t == null ? void 0 : t.current) ?? r.current).draggable = !0));
   }), x = I(() => {
     !r.current || !n || r.current.nodeType == 1 && (r.current.classList.remove("ProseMirror-selectednode"), (l != null && l.current || !n.type.spec.draggable) && ((t == null ? void 0 : t.current) ?? r.current).removeAttribute("draggable"));
-  }), k = He((D, B) => {
-    m.current = D, x.current = B;
-  }, []), { siblingsRef: M, parentRef: v } = oe(Oe), P = I([]);
+  }), k = He((R, B) => {
+    m.current = R, x.current = B;
+  }, []), { siblingsRef: M, parentRef: P } = ie(Oe), z = I([]);
   return X(() => {
-    const D = M.current;
+    const R = M.current;
     return () => {
-      if (f.current && D.includes(f.current)) {
-        const B = D.indexOf(f.current);
-        D.splice(B, 1);
+      if (f.current && R.includes(f.current)) {
+        const B = R.indexOf(f.current);
+        R.splice(B, 1);
       }
     };
   }, [
@@ -15312,29 +15312,29 @@ function pi(n, e, t, r, s, o, i, l) {
   ]), X(() => {
     var B;
     if (!n || !r.current) return;
-    const D = P.current[0];
-    f.current ? (f.current.parent = v.current, f.current.children = P.current, f.current.node = n, f.current.getPos = e, f.current.outerDeco = o, f.current.innerDeco = s, f.current.dom = (t == null ? void 0 : t.current) ?? r.current, f.current.dom.pmViewDesc = f.current, f.current.contentDOM = // If there's already a contentDOM, we can just
+    const R = z.current[0];
+    f.current ? (f.current.parent = P.current, f.current.children = z.current, f.current.node = n, f.current.getPos = e, f.current.outerDeco = o, f.current.innerDeco = s, f.current.dom = (t == null ? void 0 : t.current) ?? r.current, f.current.dom.pmViewDesc = f.current, f.current.contentDOM = // If there's already a contentDOM, we can just
     // keep it; it won't have changed. This is especially
     // important during compositions, where the
     // firstChildDesc might not have a correct dom node set yet.
-    (l == null ? void 0 : l.current) ?? f.current.contentDOM ?? (D == null ? void 0 : D.dom.parentElement) ?? null, f.current.nodeDOM = r.current) : f.current = new di(v.current, P.current, e, n, o, s, (t == null ? void 0 : t.current) ?? r.current, (D == null ? void 0 : D.dom.parentElement) ?? null, r.current, (z) => !!d.current(z), () => m.current(), () => x.current(), (z) => p.current(z)), u(f.current.contentDOM !== null), M.current.includes(f.current) || M.current.push(f.current), M.current.sort(sn);
-    for (const z of P.current)
-      if (z.parent = f.current, z instanceof ts) {
-        const R = (B = f.current.contentDOM) == null ? void 0 : B.firstChild;
-        if (!R) throw new Error("Started a composition but couldn't find the text node it belongs to.");
-        let _ = R;
-        for (; _.firstChild; )
-          _ = _.firstChild;
-        if (!_ || !(_ instanceof Text)) throw new Error("Started a composition but couldn't find the text node it belongs to.");
-        z.dom = R, z.textDOM = _, z.text = _.data, z.textDOM.pmViewDesc = z, a == null || a.input.compositionNodes.push(z);
+    (l == null ? void 0 : l.current) ?? f.current.contentDOM ?? (R == null ? void 0 : R.dom.parentElement) ?? null, f.current.nodeDOM = r.current) : f.current = new di(P.current, z.current, e, n, o, s, (t == null ? void 0 : t.current) ?? r.current, (R == null ? void 0 : R.dom.parentElement) ?? null, r.current, (v) => !!d.current(v), () => m.current(), () => x.current(), (v) => p.current(v)), u(f.current.contentDOM !== null), M.current.includes(f.current) || M.current.push(f.current), M.current.sort(sn);
+    for (const v of z.current)
+      if (v.parent = f.current, v instanceof ts) {
+        const D = (B = f.current.contentDOM) == null ? void 0 : B.firstChild;
+        if (!D) throw new Error("Started a composition but couldn't find the text node it belongs to.");
+        let L = D;
+        for (; L.firstChild; )
+          L = L.firstChild;
+        if (!L || !(L instanceof Text)) throw new Error("Started a composition but couldn't find the text node it belongs to.");
+        v.dom = D, v.textDOM = L, v.text = L.data, v.textDOM.pmViewDesc = v, a == null || a.input.compositionNodes.push(v);
       }
     return () => {
-      var z, R, _, ke;
-      ((z = f.current) == null ? void 0 : z.children[0]) instanceof ts && !(a != null && a.composing) && ((ke = (R = f.current) == null ? void 0 : R.children[0].dom.parentNode) == null || ke.removeChild((_ = f.current) == null ? void 0 : _.children[0].dom));
+      var v, D, L, ee;
+      ((v = f.current) == null ? void 0 : v.children[0]) instanceof ts && !(a != null && a.composing) && ((ee = (D = f.current) == null ? void 0 : D.children[0].dom.parentNode) == null || ee.removeChild((L = f.current) == null ? void 0 : L.children[0].dom));
     };
   }), {
     hasContentDOM: c,
-    childDescriptors: P,
+    childDescriptors: z,
     nodeViewDescRef: f,
     setStopEvent: h,
     setSelectNode: k,
@@ -15405,7 +15405,7 @@ function pb(n, e, t, r) {
   }
 }
 function mb() {
-  const { view: n } = oe(Vt);
+  const { view: n } = ie(Vt);
   return n && To.getState(n.state);
 }
 var sf = { exports: {} };
@@ -15675,7 +15675,7 @@ const mi = /* @__PURE__ */ Fe(/* @__PURE__ */ Ge(function(e, t) {
   return s && !af(r) && d.push(o), /* @__PURE__ */ Hn(a, u, ...d);
 })), cf = /* @__PURE__ */ Fe(/* @__PURE__ */ Ge(function(e, t) {
   let { mark: r, getPos: s, children: o } = e;
-  const { siblingsRef: i, parentRef: l } = oe(Oe), a = I(void 0), c = I([]), u = I(null);
+  const { siblingsRef: i, parentRef: l } = ie(Oe), a = I(void 0), c = I([]), u = I(null);
   ns(t, () => u.current, []);
   const f = Me(() => {
     var h, p;
@@ -15721,7 +15721,7 @@ const mi = /* @__PURE__ */ Fe(/* @__PURE__ */ Ge(function(e, t) {
 }));
 function Sb(n) {
   let { widget: e, getPos: t } = n;
-  const { siblingsRef: r, parentRef: s } = oe(Oe), o = I(null), i = I(null);
+  const { siblingsRef: r, parentRef: s } = ie(Oe), o = I(null), i = I(null);
   return X(() => {
     const l = r.current;
     return () => {
@@ -15761,7 +15761,7 @@ function wb() {
 const Mb = /* @__PURE__ */ Fe(function(e) {
   var dt;
   let { customNodeView: t, node: r, getPos: s, innerDeco: o, outerDeco: i } = e;
-  const { view: l } = oe(Vt), a = I(null), c = I(null), u = I(null), f = I(() => s.current()).current, d = I(r);
+  const { view: l } = ie(Vt), a = I(null), c = I(null), u = I(null), f = I(() => s.current()).current, d = I(r);
   d.current = r;
   const h = I(i);
   h.current = i;
@@ -15779,7 +15779,7 @@ const Mb = /* @__PURE__ */ Fe(function(e) {
       f,
       h.current,
       p.current
-    ), m.current.stopEvent && P(m.current.stopEvent.bind(m.current)), m.current.selectNode && D(m.current.selectNode.bind(m.current), (($t = m.current.deselectNode) == null ? void 0 : $t.bind(m.current)) ?? (() => {
+    ), m.current.stopEvent && z(m.current.stopEvent.bind(m.current)), m.current.selectNode && R(m.current.selectNode.bind(m.current), (($t = m.current.deselectNode) == null ? void 0 : $t.bind(m.current)) ?? (() => {
     })), m.current.ignoreMutation && B(m.current.ignoreMutation.bind(m.current)), x()), !y.current) return;
     const { dom: Ee } = m.current;
     if (y.current.firstChild === Ee)
@@ -15819,12 +15819,12 @@ const Mb = /* @__PURE__ */ Fe(function(e) {
     s,
     f
   ]);
-  const { childDescriptors: M, nodeViewDescRef: v, setStopEvent: P, setSelectNode: D, setIgnoreMutation: B } = pi(r, f, a, c, o, i, void 0, u), z = Me(() => ({
-    parentRef: v,
+  const { childDescriptors: M, nodeViewDescRef: P, setStopEvent: z, setSelectNode: R, setIgnoreMutation: B } = pi(r, f, a, c, o, i, void 0, u), v = Me(() => ({
+    parentRef: P,
     siblingsRef: M
   }), [
     M,
-    v
+    P
   ]);
   if (!k) return null;
   m.current || (m.current = t(
@@ -15836,20 +15836,20 @@ const Mb = /* @__PURE__ */ Fe(function(e) {
     () => s.current(),
     h.current,
     p.current
-  ), m.current.stopEvent && P(m.current.stopEvent.bind(m.current)), m.current.selectNode && D(m.current.selectNode.bind(m.current), ((dt = m.current.deselectNode) == null ? void 0 : dt.bind(m.current)) ?? (() => {
+  ), m.current.stopEvent && z(m.current.stopEvent.bind(m.current)), m.current.selectNode && R(m.current.selectNode.bind(m.current), ((dt = m.current.deselectNode) == null ? void 0 : dt.bind(m.current)) ?? (() => {
   })), m.current.ignoreMutation && B(m.current.ignoreMutation.bind(m.current)));
-  const { contentDOM: R } = m.current;
-  u.current = R ?? null;
-  const _ = /* @__PURE__ */ Hn(r.isInline ? "span" : "div", {
+  const { contentDOM: D } = m.current;
+  u.current = D ?? null;
+  const L = /* @__PURE__ */ Hn(r.isInline ? "span" : "div", {
     ref: y,
-    contentEditable: !!R,
+    contentEditable: !!D,
     suppressContentEditableWarning: !0
-  }, R && /* @__PURE__ */ jf(/* @__PURE__ */ A.createElement(or, {
+  }, D && /* @__PURE__ */ jf(/* @__PURE__ */ A.createElement(or, {
     getPos: s,
     node: r,
     innerDecorations: o
-  }), R)), ke = /* @__PURE__ */ rs(
-    i.reduce(ms, _),
+  }), D)), ee = /* @__PURE__ */ rs(
+    i.reduce(ms, L),
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     i.some((Ee) => Ee.type.attrs.nodeName) ? {
       ref: a
@@ -15860,23 +15860,23 @@ const Mb = /* @__PURE__ */ Fe(function(e) {
     )
   );
   return /* @__PURE__ */ A.createElement(Oe.Provider, {
-    value: z
-  }, ke);
+    value: v
+  }, ee);
 }), Nb = ct(null), Db = ct(null), uf = ct(null), Ob = /* @__PURE__ */ Fe(function(e) {
   let { outerDeco: t, getPos: r, node: s, innerDeco: o, ...i } = e;
-  const l = I(null), a = I(null), c = I(null), u = I(() => r.current()).current, { nodeViews: f } = oe(Uu);
+  const l = I(null), a = I(null), c = I(null), u = I(() => r.current()).current, { nodeViews: f } = ie(Uu);
   let d = null;
   const h = f[s.type.name], p = Me(() => {
-    var R, _;
-    return (_ = (R = s.type.spec).toDOM) == null ? void 0 : _.call(R, s);
+    var D, L;
+    return (L = (D = s.type.spec).toDOM) == null ? void 0 : L.call(D, s);
   }, [
     s
-  ]), { hasContentDOM: y, childDescriptors: m, setStopEvent: x, setSelectNode: k, setIgnoreMutation: M, nodeViewDescRef: v } = pi(s, () => r.current(), l, a, o, t, void 0, c), P = {
+  ]), { hasContentDOM: y, childDescriptors: m, setStopEvent: x, setSelectNode: k, setIgnoreMutation: M, nodeViewDescRef: P } = pi(s, () => r.current(), l, a, o, t, void 0, c), z = {
     ...i,
     ...!y && {
       contentEditable: !1
     }
-  }, D = Me(() => ({
+  }, R = Me(() => ({
     node: s,
     getPos: u,
     decorations: t,
@@ -15888,15 +15888,15 @@ const Mb = /* @__PURE__ */ Fe(function(e) {
     t
   ]);
   if (h ? d = /* @__PURE__ */ A.createElement(h, {
-    ...P,
+    ...z,
     ref: a,
-    nodeProps: D
+    nodeProps: R
   }, /* @__PURE__ */ A.createElement(or, {
     getPos: r,
     node: s,
     innerDecorations: o
   })) : p && (d = /* @__PURE__ */ A.createElement(mi, {
-    ...P,
+    ...z,
     ref: a,
     outputSpec: p
   }, /* @__PURE__ */ A.createElement(or, {
@@ -15908,19 +15908,19 @@ const Mb = /* @__PURE__ */ Fe(function(e) {
   const B = /* @__PURE__ */ rs(
     t.reduce(ms, d),
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
-    t.some((R) => R.type.attrs.nodeName) ? {
+    t.some((D) => D.type.attrs.nodeName) ? {
       ref: l
     } : (
       // we've already passed the domRef to the NodeView component
       // as a prop
       void 0
     )
-  ), z = Me(() => ({
-    parentRef: v,
+  ), v = Me(() => ({
+    parentRef: P,
     siblingsRef: m
   }), [
     m,
-    v
+    P
   ]);
   return /* @__PURE__ */ A.createElement(Db.Provider, {
     value: k
@@ -15929,11 +15929,11 @@ const Mb = /* @__PURE__ */ Fe(function(e) {
   }, /* @__PURE__ */ A.createElement(Nb.Provider, {
     value: M
   }, /* @__PURE__ */ A.createElement(Oe.Provider, {
-    value: z
+    value: v
   }, B))));
 }), ff = /* @__PURE__ */ Fe(function(e) {
   let { outerDeco: t, getPos: r, node: s, innerDeco: o, ...i } = e;
-  const { view: l } = oe(Vt), a = l == null ? void 0 : l.someProp("nodeViews", (c) => c == null ? void 0 : c[s.type.name]);
+  const { view: l } = ie(Vt), a = l == null ? void 0 : l.someProp("nodeViews", (c) => c == null ? void 0 : c[s.type.name]);
   return a ? /* @__PURE__ */ A.createElement(Mb, {
     customNodeView: a,
     node: s,
@@ -15950,7 +15950,7 @@ const Mb = /* @__PURE__ */ Fe(function(e) {
 });
 function Eb(n) {
   let { getPos: e } = n;
-  const { siblingsRef: t, parentRef: r } = oe(Oe), s = I(null), o = I(null), [i, l] = N(!1);
+  const { siblingsRef: t, parentRef: r } = ie(Oe), s = I(null), o = I(null), [i, l] = N(!1);
   return X(() => {
     const a = t.current;
     return () => {
@@ -15964,7 +15964,7 @@ function Eb(n) {
   ]), X(() => {
     var c;
     const a = t.current[t.current.length - 1];
-    if ((ue.safari || ue.chrome) && ((c = a == null ? void 0 : a.dom) == null ? void 0 : c.contentEditable) == "false") {
+    if ((fe.safari || fe.chrome) && ((c = a == null ? void 0 : a.dom) == null ? void 0 : c.contentEditable) == "false") {
       l(!0);
       return;
     }
@@ -16347,7 +16347,7 @@ class $b extends $f {
 }
 function zb(n) {
   let { getPos: e } = n;
-  const { siblingsRef: t, parentRef: r } = oe(Oe), s = I(null), o = I(null);
+  const { siblingsRef: t, parentRef: r } = ie(Oe), s = I(null), o = I(null);
   return X(() => {
     const i = t.current;
     return () => {
@@ -16367,7 +16367,7 @@ function zb(n) {
 }
 function jb(n) {
   let { widget: e, getPos: t } = n;
-  const { siblingsRef: r, parentRef: s } = oe(Oe), o = I(null), i = I(() => t.current()).current, l = I(null);
+  const { siblingsRef: r, parentRef: s } = ie(Oe), o = I(null), i = I(() => t.current()).current, l = I(null);
   X(() => {
     const c = r.current;
     return () => {
@@ -16402,7 +16402,7 @@ function Gs(n, e) {
 }
 const Fb = /* @__PURE__ */ Fe(function(e) {
   let { child: t, getInnerPos: r } = e;
-  const { view: s } = oe(Vt), o = I(() => r.current() + t.offset);
+  const { view: s } = ie(Vt), o = I(() => r.current() + t.offset);
   return o.current = () => r.current() + t.offset, t.type === "widget" ? /* @__PURE__ */ A.createElement(jb, {
     key: t.key,
     widget: t.widget,
@@ -16561,29 +16561,29 @@ const or = /* @__PURE__ */ Fe(function(e) {
     let M;
     if (y) {
       M = Xs(i.current(), m, "native-widget", o == null ? void 0 : o.posToKey, p, x);
-      const P = {
+      const z = {
         type: "native-widget",
         widget: p,
         marks: k,
         offset: m,
         index: x,
         key: M
-      }, D = l.get(M);
-      D && Gs(D, P) ? D.offset = m : l.set(M, P), a.add(M);
+      }, R = l.get(M);
+      R && Gs(R, z) ? R.offset = m : l.set(M, z), a.add(M);
     } else {
       M = Xs(i.current(), m, "widget", o == null ? void 0 : o.posToKey, p, x);
-      const P = {
+      const z = {
         type: "widget",
         widget: p,
         marks: k,
         offset: m,
         index: x,
         key: M
-      }, D = l.get(M);
-      D && Gs(D, P) ? D.offset = m : l.set(M, P), a.add(M);
+      }, R = l.get(M);
+      R && Gs(R, z) ? R.offset = m : l.set(M, z), a.add(M);
     }
-    const v = l.get(M);
-    c.push(v), Lb(u, l.get(M));
+    const P = l.get(M);
+    c.push(P), Lb(u, l.get(M));
   }, (p, y, m, x) => {
     const k = Xs(i.current(), x, "node", o == null ? void 0 : o.posToKey), M = {
       type: "node",
@@ -16593,8 +16593,8 @@ const or = /* @__PURE__ */ Fe(function(e) {
       outerDeco: y,
       offset: x,
       key: k
-    }, v = l.get(k);
-    v && Gs(v, M) ? (v.offset = x, u = v) : (l.set(k, M), u = M), a.add(k), Wb(c, u), c = [];
+    }, P = l.get(k);
+    P && Gs(P, M) ? (P.offset = x, u = P) : (l.set(k, M), u = M), a.add(k), Wb(c, u), c = [];
   });
   for (const p of l.keys())
     a.has(p) || l.delete(p);
@@ -16646,7 +16646,7 @@ const or = /* @__PURE__ */ Fe(function(e) {
 })), df = /* @__PURE__ */ ct(null);
 function Jb(n, e) {
   let { as: t, ...r } = n;
-  const s = I([]), o = I(null), { setMount: i, ...l } = oe(df), a = I(void 0);
+  const s = I([]), o = I(null), { setMount: i, ...l } = ie(df), a = I(void 0);
   ns(e, () => o.current, []);
   const c = Me(() => ({
     parentRef: a,
@@ -16707,8 +16707,8 @@ function Ub(n) {
 function pf(n) {
   return /* @__PURE__ */ A.createElement(db, null, /* @__PURE__ */ A.createElement(Ub, n));
 }
-function pe(n) {
-  const e = I(n), { view: t } = oe(Vt);
+function me(n) {
+  const e = I(n), { view: t } = ie(Vt);
   return ft(() => {
     e.current = n;
   }, [
@@ -16722,7 +16722,7 @@ function pe(n) {
   ]);
 }
 function yi(n) {
-  const e = oe(uf), t = pe(n);
+  const e = ie(uf), t = me(n);
   ft(() => {
     e(t);
   }, [
@@ -17131,7 +17131,7 @@ const Yb = ["p", 0], Gb = ["blockquote", 0], Xb = ["hr"], Qb = ["pre", ["code",
   ft((c) => {
     c && (r(e.isActive && e.isActive(c.state)), l(e.isSelected && !e.isSelected(c.state)), e.isDisabled ? o(e.isDisabled(c.state)) : o(!e.command(c.state)));
   });
-  const a = pe((c) => {
+  const a = me((c) => {
     c && (s || e.command(c.state, c.dispatch, c), c.focus());
   });
   return i ? null : /* @__PURE__ */ g.jsx(
@@ -17167,7 +17167,7 @@ const Yb = ["p", 0], Gb = ["blockquote", 0], Xb = ["hr"], Qb = ["pre", ["code",
     r && /* @__PURE__ */ g.jsx(ir, { item: r })
   ] });
 }, xs = ({ items: n }) => /* @__PURE__ */ g.jsx("div", { className: "MenuBlock", children: n.map((e, t) => /* @__PURE__ */ g.jsx(ir, { item: e }, t)) }), m0 = ({ schema: n, isOpen: e, onClose: t }) => {
-  const r = pe((s, o) => {
+  const r = me((s, o) => {
     s && (Ce(n.marks.link, { href: o })(s.state, s.dispatch), t(), s.focus());
   });
   return /* @__PURE__ */ g.jsx(
@@ -17290,7 +17290,7 @@ const kf = () => /* @__PURE__ */ g.jsxs("div", { className: "MenuBlock", childre
     const h = lt.getState(d.state);
     u(h.upload !== void 0);
   }, [e]);
-  const f = pe((d) => {
+  const f = me((d) => {
     d && (c ? _m(d, o, l, n) : qm(d, r, l, n), d.focus(), t());
   });
   return /* @__PURE__ */ g.jsxs(Pa, { isOpen: e, onClose: t, children: [
@@ -17345,7 +17345,7 @@ const kf = () => /* @__PURE__ */ g.jsxs("div", { className: "MenuBlock", childre
   q(() => {
     s(""), i("");
   }, [e]);
-  const l = pe((a) => {
+  const l = me((a) => {
     const c = n.nodes.video;
     if (!a || !r || !c) return;
     const u = bs(r);
@@ -17484,16 +17484,16 @@ const Nf = () => /* @__PURE__ */ g.jsx(xs, { items: [{
         }), u(x ? `${x} / ${m.childCount}` : "");
       }
     });
-    const f = pe((p, y) => {
+    const f = me((p, y) => {
       if (!p) return;
       i(y);
       const m = p.state.tr, x = t.getPos();
       p.dispatch(m.setNodeMarkup(x, null, { ...t.node.attrs, title: y })), p.focus();
-    }), d = pe((p) => {
+    }), d = me((p) => {
       if (!p) return;
       const y = t.getPos(), m = t.node.nodeSize, x = t.node.attrs, k = p.state.schema, M = k.nodes.carousel.create(null, k.nodes.image.create(x));
       p.dispatch(p.state.tr.replaceWith(y, y + m, M));
-    }), h = pe((p) => {
+    }), h = me((p) => {
       if (!p) return;
       const y = p.state.tr, m = t.getPos(), x = t.node.nodeSize, k = p.state.doc.resolve(m).parent;
       k.type.name === "carousel" && k.childCount === 1 ? p.dispatch(y.delete(m - 1, m - 1 + k.nodeSize)) : p.dispatch(y.delete(m, m + x));
@@ -17542,7 +17542,7 @@ const Nf = () => /* @__PURE__ */ g.jsx(xs, { items: [{
     yi(() => !0), q(() => {
       i(bs(t.node.attrs.src));
     }, [t]);
-    const u = pe((f, d) => {
+    const u = me((f, d) => {
       if (!f) return;
       a(d);
       const { $from: h, $to: p } = f.state.selection, y = h.blockRange(p);
@@ -17588,7 +17588,7 @@ const Nf = () => /* @__PURE__ */ g.jsx(xs, { items: [{
     const c = l.state.doc, u = !!c.textBetween(0, c.content.size, void 0, " ").length, f = !!Lo(l.state);
     r && t ? a = u && f : r ? a = f : t && (a = u), o(a);
   });
-  const i = pe((l) => {
+  const i = me((l) => {
     try {
       let a;
       const c = ai(l.state);
@@ -17679,7 +17679,7 @@ const Nf = () => /* @__PURE__ */ g.jsx(xs, { items: [{
     }
     r(f), o(d);
   }, [i]);
-  const a = pe((c, u) => {
+  const a = me((c, u) => {
     !c || !u.id || (s[u.id](c.state, c.dispatch, c), l(!1), c.focus());
   });
   return n.nodes.heading ? /* @__PURE__ */ g.jsxs(g.Fragment, { children: [
@@ -17736,7 +17736,7 @@ const Nf = () => /* @__PURE__ */ g.jsx(xs, { items: [{
   icon: /* @__PURE__ */ g.jsx(O.AlignJustify, {}),
   text: "Выровнять по краям"
 }], C0 = ({ schema: n }) => {
-  const e = I(null), [t, r] = N(!1), s = pe((o, i) => {
+  const e = I(null), [t, r] = N(!1), s = me((o, i) => {
     if (!o || !i.id) return;
     const l = i.id === "left" ? null : i.id, { $from: a, $to: c } = o.state.selection, u = a.blockRange(c);
     if (u) {
@@ -17826,7 +17826,7 @@ const Nf = () => /* @__PURE__ */ g.jsx(xs, { items: [{
     q(() => {
       i(M0(t.node));
     }, [t]);
-    const l = pe((a) => {
+    const l = me((a) => {
       hy(a.state, a.dispatch);
     });
     return /* @__PURE__ */ g.jsxs("table", { ref: s, ...r, children: [
@@ -17912,7 +17912,7 @@ const Nf = () => /* @__PURE__ */ g.jsx(xs, { items: [{
   onCellMenuClose: o,
   onColumnMenuClose: i
 }) => {
-  const l = pe((a, c) => {
+  const l = me((a, c) => {
     if (a) {
       switch (c.id) {
         case "toggleHeaderRow":
@@ -18136,36 +18136,39 @@ const Nf = () => /* @__PURE__ */ g.jsx(xs, { items: [{
   }
 ), A0 = Ge(
   function({ children: e, nodeProps: t, ...r }, s) {
-    const o = I(null), [i, l] = N(!1), [a, c] = N(!1), [u, f] = N(!1), [d, h] = N(!1), [p, y] = N(), m = (P) => {
-      const D = P.scrollLeft, B = P.clientWidth, z = P.scrollWidth;
-      f(D > 0), h(D < z - B * 1.5);
+    var B;
+    const o = I(null), [i, l] = N(!1), [a, c] = N(!1), [u, f] = N(!1), [d, h] = N(!1), [p, y] = N(), [m, x] = N(), k = (v) => {
+      const D = v.scrollLeft, L = v.clientWidth, ee = v.scrollWidth;
+      f(D > 0), h(D < ee - L * 1.5);
     };
     yi(() => !0), q(() => {
-      y(t.getPos() + t.node.nodeSize - 1), c(t.node.childCount > 1), o.current && t.node.childCount > 1 && m(o.current);
+      o.current && (m && o.current.scrollWidth > m && (o.current.scrollLeft = o.current.scrollWidth - o.current.clientWidth), x(o.current.scrollWidth));
+    }, [(B = o.current) == null ? void 0 : B.scrollWidth]), q(() => {
+      y(t.getPos() + t.node.nodeSize - 1), c(t.node.childCount > 1), o.current && t.node.childCount > 1 && k(o.current);
     }, [t, o]);
-    const x = pe((P) => {
-      if (!P) return;
-      const D = t.getPos(), B = t.node.nodeSize;
-      P.dispatch(P.state.tr.delete(D, D + B));
-    }), k = () => {
+    const M = me((v) => {
+      if (!v) return;
+      const D = t.getPos(), L = t.node.nodeSize;
+      v.dispatch(v.state.tr.delete(D, D + L));
+    }), P = () => {
       l(!0);
-    }, M = (P) => {
-      m(P.currentTarget);
-    }, v = (P, D) => {
-      if (P.stopPropagation(), !o.current) return;
-      const B = o.current.clientWidth;
-      let z = o.current.scrollLeft + D * B;
-      o.current.scrollLeft = z;
+    }, z = (v) => {
+      k(v.currentTarget);
+    }, R = (v, D) => {
+      if (v.stopPropagation(), !o.current) return;
+      const L = o.current.clientWidth;
+      let ee = o.current.scrollLeft + D * L;
+      o.current.scrollLeft = ee;
     };
     return /* @__PURE__ */ g.jsxs("div", { ref: s, ...r, className: "carousel", children: [
-      /* @__PURE__ */ g.jsx("div", { className: "carousel-list", ref: o, onScroll: M, children: e }),
+      /* @__PURE__ */ g.jsx("div", { className: "carousel-list", ref: o, onScroll: z, children: e }),
       /* @__PURE__ */ g.jsxs("div", { className: "carousel-buttons", children: [
-        /* @__PURE__ */ g.jsx("div", { onClick: x, className: "text-button", children: "Удалить карусель" }),
-        /* @__PURE__ */ g.jsx("div", { onClick: k, children: /* @__PURE__ */ g.jsx(O.Plus, {}) })
+        /* @__PURE__ */ g.jsx("div", { onClick: M, className: "text-button", children: "Удалить карусель" }),
+        /* @__PURE__ */ g.jsx("div", { onClick: P, children: /* @__PURE__ */ g.jsx(O.Plus, {}) })
       ] }),
       a && /* @__PURE__ */ g.jsxs(g.Fragment, { children: [
-        u && /* @__PURE__ */ g.jsx("div", { className: "carousel-prev", onClick: (P) => v(P, -1), children: /* @__PURE__ */ g.jsx(O.ChevronLeft, {}) }),
-        d && /* @__PURE__ */ g.jsx("div", { className: "carousel-next", onClick: (P) => v(P, 1), children: /* @__PURE__ */ g.jsx(O.ChevronRight, {}) })
+        u && /* @__PURE__ */ g.jsx("div", { className: "carousel-prev", onClick: (v) => R(v, -1), children: /* @__PURE__ */ g.jsx(O.ChevronLeft, {}) }),
+        d && /* @__PURE__ */ g.jsx("div", { className: "carousel-next", onClick: (v) => R(v, 1), children: /* @__PURE__ */ g.jsx(O.ChevronRight, {}) })
       ] }),
       /* @__PURE__ */ g.jsx(wf, { pos: p, isOpen: i, onClose: () => l(!1) })
     ] });