reactjs-tiptap-editor 1.0.26 → 1.0.29

package/lib/Blockquote.js

@@ -1,7 +1,7 @@
-import { N as xt, w as Nt, m as Rt } from "./index-Dx-Dh7KS.js";
+import { N as Rt, w as At, m as Ot } from "./index-n4kM0Ll-.js";
 import { h as Z } from "./jsx-runtime-DE8oVoME.js";
-import { jsx as j, Fragment as Ot } from "react/jsx-runtime";
-import { u as Et, d as Tt, A as At } from "./index-C52cuQ_Y.js";
+import { jsx as j, Fragment as Et } from "react/jsx-runtime";
+import { u as Tt, d as It, A as zt } from "./index-DRcwHivm.js";
 import "react";
 import "./theme.js";
 function st(n, t, e) {
@@ -16,9 +16,10 @@ function st(n, t, e) {
     if (!i.sameMarkup(s))
       return e;
     if (i.isText && i.text != s.text) {
-      for (let o = 0; i.text[o] == s.text[o]; o++)
+      let o = i.text, a = s.text, l = 0;
+      for (; o[l] == a[l]; l++)
         e++;
-      return e;
+      return l && l < o.length && l < a.length && lt(o.charCodeAt(l - 1)) && at(o.charCodeAt(l)) && e--, e;
     }
     if (i.content.size || s.content.size) {
       let o = st(i.content, s.content, e + 1);
@@ -40,20 +41,26 @@ function ot(n, t, e, r) {
     if (!o.sameMarkup(a))
       return { a: e, b: r };
     if (o.isText && o.text != a.text) {
-      let h = 0, u = Math.min(o.text.length, a.text.length);
-      for (; h < u && o.text[o.text.length - h - 1] == a.text[a.text.length - h - 1]; )
-        h++, e--, r--;
-      return { a: e, b: r };
+      let u = o.text, h = a.text, f = u.length, k = h.length;
+      for (; f > 0 && k > 0 && u[f - 1] == h[k - 1]; )
+        f--, k--, e--, r--;
+      return f && k && f < u.length && lt(u.charCodeAt(f - 1)) && at(u.charCodeAt(f)) && (e++, r++), { a: e, b: r };
     }
     if (o.content.size || a.content.size) {
-      let h = ot(o.content, a.content, e - 1, r - 1);
-      if (h)
-        return h;
+      let u = ot(o.content, a.content, e - 1, r - 1);
+      if (u)
+        return u;
     }
     e -= l, r -= l;
   }
 }
-var g = class m {
+function at(n) {
+  return n >= 56320 && n < 57344;
+}
+function lt(n) {
+  return n >= 55296 && n < 56320;
+}
+var g = class d {
   /**
   @internal
   */
@@ -69,12 +76,12 @@ var g = class m {
   */
   nodesBetween(t, e, r, i = 0, s) {
     for (let o = 0, a = 0; a < e; o++) {
-      let l = this.content[o], h = a + l.nodeSize;
-      if (h > t && r(l, i + a, s || null, o) !== !1 && l.content.size) {
-        let u = a + 1;
-        l.nodesBetween(Math.max(0, t - u), Math.min(l.content.size, e - u), r, i + u);
+      let l = this.content[o], u = a + l.nodeSize;
+      if (u > t && r(l, i + a, s || null, o) !== !1 && l.content.size) {
+        let h = a + 1;
+        l.nodesBetween(Math.max(0, t - h), Math.min(l.content.size, e - h), r, i + h);
       }
-      a = h;
+      a = u;
     }
   }
   /**
@@ -92,8 +99,8 @@ var g = class m {
   textBetween(t, e, r, i) {
     let s = "", o = !0;
     return this.nodesBetween(t, e, (a, l) => {
-      let h = a.isText ? a.text.slice(Math.max(t, l) - l, e - l) : a.isLeaf ? i ? typeof i == "function" ? i(a) : i : a.type.spec.leafText ? a.type.spec.leafText(a) : "" : "";
-      a.isBlock && (a.isLeaf && h || a.isTextblock) && r && (o ? o = !1 : s += r), s += h;
+      let u = a.isText ? a.text.slice(Math.max(t, l) - l, e - l) : a.isLeaf ? i ? typeof i == "function" ? i(a) : i : a.type.spec.leafText ? a.type.spec.leafText(a) : "" : "";
+      a.isBlock && (a.isLeaf && u || a.isTextblock) && r && (o ? o = !1 : s += r), s += u;
     }, 0), s;
   }
   /**
@@ -108,7 +115,7 @@ var g = class m {
     let e = this.lastChild, r = t.firstChild, i = this.content.slice(), s = 0;
     for (e.isText && e.sameMarkup(r) && (i[i.length - 1] = e.withText(e.text + r.text), s = 1); s < t.content.length; s++)
       i.push(t.content[s]);
-    return new m(i, this.size + t.size);
+    return new d(i, this.size + t.size);
   }
   /**
   Cut out the sub-fragment between the two given positions.
@@ -122,13 +129,13 @@ var g = class m {
         let a = this.content[s], l = o + a.nodeSize;
         l > t && ((o < t || l > e) && (a.isText ? a = a.cut(Math.max(0, t - o), Math.min(a.text.length, e - o)) : a = a.cut(Math.max(0, t - o - 1), Math.min(a.content.size, e - o - 1))), r.push(a), i += a.nodeSize), o = l;
       }
-    return new m(r, i);
+    return new d(r, i);
   }
   /**
   @internal
   */
   cutByIndex(t, e) {
-    return t == e ? m.empty : t == 0 && e == this.content.length ? this : new m(this.content.slice(t, e));
+    return t == e ? d.empty : t == 0 && e == this.content.length ? this : new d(this.content.slice(t, e));
   }
   /**
   Create a new fragment in which the node at the given index is
@@ -139,21 +146,21 @@ var g = class m {
     if (r == e)
       return this;
     let i = this.content.slice(), s = this.size + e.nodeSize - r.nodeSize;
-    return i[t] = e, new m(i, s);
+    return i[t] = e, new d(i, s);
   }
   /**
   Create a new fragment by prepending the given node to this
   fragment.
   */
   addToStart(t) {
-    return new m([t].concat(this.content), this.size + t.nodeSize);
+    return new d([t].concat(this.content), this.size + t.nodeSize);
   }
   /**
   Create a new fragment by appending the given node to this
   fragment.
   */
   addToEnd(t) {
-    return new m(this.content.concat(t), this.size + t.nodeSize);
+    return new d(this.content.concat(t), this.size + t.nodeSize);
   }
   /**
   Compare this fragment to another one.
@@ -233,15 +240,15 @@ var g = class m {
   */
   findIndex(t) {
     if (t == 0)
-      return B(0, t);
+      return F(0, t);
     if (t == this.size)
-      return B(this.content.length, t);
+      return F(this.content.length, t);
     if (t > this.size || t < 0)
       throw new RangeError(`Position ${t} outside of fragment (${this})`);
     for (let e = 0, r = 0; ; e++) {
       let i = this.child(e), s = r + i.nodeSize;
       if (s >= t)
-        return s == t ? B(e + 1, s) : B(e, r);
+        return s == t ? F(e + 1, s) : F(e, r);
       r = s;
     }
   }
@@ -268,10 +275,10 @@ var g = class m {
   */
   static fromJSON(t, e) {
     if (!e)
-      return m.empty;
+      return d.empty;
     if (!Array.isArray(e))
       throw new RangeError("Invalid input for Fragment.fromJSON");
-    return m.fromArray(e.map(t.nodeFromJSON));
+    return d.fromArray(e.map(t.nodeFromJSON));
   }
   /**
   Build a fragment from an array of nodes. Ensures that adjacent
@@ -279,13 +286,13 @@ var g = class m {
   */
   static fromArray(t) {
     if (!t.length)
-      return m.empty;
+      return d.empty;
     let e, r = 0;
     for (let i = 0; i < t.length; i++) {
       let s = t[i];
       r += s.nodeSize, i && s.isText && t[i - 1].sameMarkup(s) ? (e || (e = t.slice(0, i)), e[e.length - 1] = s.withText(e[e.length - 1].text + s.text)) : e && e.push(s);
     }
-    return new m(e || t, r);
+    return new d(e || t, r);
   }
   /**
   Create a fragment from something that can be interpreted as a
@@ -295,23 +302,23 @@ var g = class m {
   */
   static from(t) {
     if (!t)
-      return m.empty;
-    if (t instanceof m)
+      return d.empty;
+    if (t instanceof d)
       return t;
     if (Array.isArray(t))
       return this.fromArray(t);
     if (t.attrs)
-      return new m([t], t.nodeSize);
+      return new d([t], t.nodeSize);
     throw new RangeError("Can not convert " + t + " to a Fragment" + (t.nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""));
   }
 };
 g.empty = new g([], 0);
-var H = { index: 0, offset: 0 };
-function B(n, t) {
-  return H.index = n, H.offset = t, H;
+var $ = { index: 0, offset: 0 };
+function F(n, t) {
+  return $.index = n, $.offset = t, $;
 }
-var It = class extends Error {
-}, c = class y {
+var Jt = class extends Error {
+}, c = class x {
   /**
   Create a slice. When specifying a non-zero open depth, you must
   make sure that there are nodes of at least that depth at the
@@ -337,14 +344,14 @@ var It = class extends Error {
   @internal
   */
   insertAt(t, e) {
-    let r = lt(this.content, t + this.openStart, e, this.openStart + 1, this.openEnd + 1);
-    return r && new y(r, this.openStart, this.openEnd);
+    let r = ht(this.content, t + this.openStart, e, this.openStart + 1, this.openEnd + 1);
+    return r && new x(r, this.openStart, this.openEnd);
   }
   /**
   @internal
   */
   removeBetween(t, e) {
-    return new y(at(this.content, t + this.openStart, e + this.openStart), this.openStart, this.openEnd);
+    return new x(ut(this.content, t + this.openStart, e + this.openStart), this.openStart, this.openEnd);
   }
   /**
   Tests whether this slice is equal to another slice.
@@ -372,11 +379,11 @@ var It = class extends Error {
   */
   static fromJSON(t, e) {
     if (!e)
-      return y.empty;
+      return x.empty;
     let r = e.openStart || 0, i = e.openEnd || 0;
     if (typeof r != "number" || typeof i != "number")
       throw new RangeError("Invalid input for Slice.fromJSON");
-    return new y(g.fromJSON(t, e.content), r, i);
+    return new x(g.fromJSON(t, e.content), r, i);
   }
   /**
   Create a slice from a fragment by taking the maximum possible
@@ -388,11 +395,11 @@ var It = class extends Error {
       r++;
     for (let s = t.lastChild; s && !s.isLeaf && (e || !s.type.spec.isolating); s = s.lastChild)
       i++;
-    return new y(t, r, i);
+    return new x(t, r, i);
   }
 };
 c.empty = new c(g.empty, 0, 0);
-function at(n, t, e) {
+function ut(n, t, e) {
   let { index: r, offset: i } = n.findIndex(t), s = n.maybeChild(r), { index: o, offset: a } = n.findIndex(e);
   if (i == t || s.isText) {
     if (a != e && !n.child(o).isText)
@@ -401,26 +408,26 @@ function at(n, t, e) {
   }
   if (r != o)
     throw new RangeError("Removing non-flat range");
-  return n.replaceChild(r, s.copy(at(s.content, t - i - 1, e - i - 1)));
+  return n.replaceChild(r, s.copy(ut(s.content, t - i - 1, e - i - 1)));
 }
-function lt(n, t, e, r, i, s) {
+function ht(n, t, e, r, i, s) {
   let { index: o, offset: a } = n.findIndex(t), l = n.maybeChild(o);
   if (a == t || l.isText)
     return s && r <= 0 && i <= 0 && !s.canReplace(o, o, e) ? null : n.cut(0, t).append(e).append(n.cut(t));
-  let h = lt(l.content, t - a - 1, e, o == 0 ? r - 1 : 0, o == n.childCount - 1 ? i - 1 : 0, l);
-  return h && n.replaceChild(o, l.copy(h));
+  let u = ht(l.content, t - a - 1, e, o == 0 ? r - 1 : 0, o == n.childCount - 1 ? i - 1 : 0, l);
+  return u && n.replaceChild(o, l.copy(u));
 }
-var ht = 65535, ut = Math.pow(2, 16);
-function zt(n, t) {
-  return n + t * ut;
+var ct = 65535, ft = Math.pow(2, 16);
+function Mt(n, t) {
+  return n + t * ft;
 }
 function _(n) {
-  return n & ht;
+  return n & ct;
 }
-function Jt(n) {
-  return (n - (n & ht)) / ut;
+function bt(n) {
+  return (n - (n & ct)) / ft;
 }
-var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
+var pt = 1, mt = 2, q = 4, dt = 8, tt = class {
   /**
   @internal
   */
@@ -433,19 +440,19 @@ var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
   argument from the document.
   */
   get deleted() {
-    return (this.delInfo & pt) > 0;
+    return (this.delInfo & dt) > 0;
   }
   /**
   Tells you whether the token before the mapped position was deleted.
   */
   get deletedBefore() {
-    return (this.delInfo & (ct | D)) > 0;
+    return (this.delInfo & (pt | q)) > 0;
   }
   /**
   True when the token after the mapped position was deleted.
   */
   get deletedAfter() {
-    return (this.delInfo & (ft | D)) > 0;
+    return (this.delInfo & (mt | q)) > 0;
   }
   /**
   Tells whether any of the steps mapped through deletes across the
@@ -453,17 +460,17 @@ var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
   position).
   */
   get deletedAcross() {
-    return (this.delInfo & D) > 0;
+    return (this.delInfo & q) > 0;
   }
-}, k = class x {
+}, v = class N {
   /**
   Create a position map. The modifications to the document are
   represented as an array of numbers, in which each group of three
   represents a modified chunk as `[start, oldSize, newSize]`.
   */
   constructor(t, e = !1) {
-    if (this.ranges = t, this.inverted = e, !t.length && x.empty)
-      return x.empty;
+    if (this.ranges = t, this.inverted = e, !t.length && N.empty)
+      return N.empty;
   }
   /**
   @internal
@@ -473,7 +480,7 @@ var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
     if (!this.inverted)
       for (let i = 0; i < r; i++)
         e += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1];
-    return this.ranges[r * 3] + e + Jt(t);
+    return this.ranges[r * 3] + e + bt(t);
   }
   mapResult(t, e = 1) {
     return this._map(t, e, !1);
@@ -490,15 +497,15 @@ var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
       let l = this.ranges[a] - (this.inverted ? i : 0);
       if (l > t)
         break;
-      let h = this.ranges[a + s], u = this.ranges[a + o], S = l + h;
-      if (t <= S) {
-        let X = h ? t == l ? -1 : t == S ? 1 : e : e, E = l + i + (X < 0 ? 0 : u);
+      let u = this.ranges[a + s], h = this.ranges[a + o], f = l + u;
+      if (t <= f) {
+        let k = u ? t == l ? -1 : t == f ? 1 : e : e, E = l + i + (k < 0 ? 0 : h);
         if (r)
           return E;
-        let v = t == (e < 0 ? l : S) ? null : zt(a / 3, t - l), Y = t == l ? ft : t == S ? ct : D;
-        return (e < 0 ? t != l : t != S) && (Y |= pt), new tt(E, Y, v);
+        let y = t == (e < 0 ? l : f) ? null : Mt(a / 3, t - l), Y = t == l ? mt : t == f ? pt : q;
+        return (e < 0 ? t != l : t != f) && (Y |= dt), new tt(E, Y, y);
       }
-      i += u - h;
+      i += h - u;
     }
     return r ? t + i : new tt(t + i, 0, null);
   }
@@ -511,10 +518,10 @@ var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
       let l = this.ranges[a] - (this.inverted ? r : 0);
       if (l > t)
         break;
-      let h = this.ranges[a + s], u = l + h;
-      if (t <= u && a == i * 3)
+      let u = this.ranges[a + s], h = l + u;
+      if (t <= h && a == i * 3)
         return !0;
-      r += this.ranges[a + o] - h;
+      r += this.ranges[a + o] - u;
     }
     return !1;
   }
@@ -525,8 +532,8 @@ var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
   forEach(t) {
     let e = this.inverted ? 2 : 1, r = this.inverted ? 1 : 2;
     for (let i = 0, s = 0; i < this.ranges.length; i += 3) {
-      let o = this.ranges[i], a = o - (this.inverted ? s : 0), l = o + (this.inverted ? 0 : s), h = this.ranges[i + e], u = this.ranges[i + r];
-      t(a, a + h, l, l + u), s += u - h;
+      let o = this.ranges[i], a = o - (this.inverted ? s : 0), l = o + (this.inverted ? 0 : s), u = this.ranges[i + e], h = this.ranges[i + r];
+      t(a, a + u, l, l + h), s += h - u;
     }
   }
   /**
@@ -534,7 +541,7 @@ var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
   map positions in the post-step document to the pre-step document.
   */
   invert() {
-    return new x(this.ranges, !this.inverted);
+    return new N(this.ranges, !this.inverted);
   }
   /**
   @internal
@@ -548,18 +555,18 @@ var ct = 1, ft = 2, D = 4, pt = 8, tt = class {
   sub-document to a larger document, or vice-versa.
   */
   static offset(t) {
-    return t == 0 ? x.empty : new x(t < 0 ? [0, -t, 0] : [0, 0, t]);
+    return t == 0 ? N.empty : new N(t < 0 ? [0, -t, 0] : [0, 0, t]);
   }
 };
-k.empty = new k([]);
-var $ = /* @__PURE__ */ Object.create(null), p = class {
+v.empty = new v([]);
+var K = /* @__PURE__ */ Object.create(null), m = class {
   /**
   Get the step map that represents the changes made by this step,
   and which can be used to transform between positions in the old
   and the new document.
   */
   getMap() {
-    return k.empty;
+    return v.empty;
   }
   /**
   Try to merge this step with another one, to be applied directly
@@ -576,7 +583,7 @@ var $ = /* @__PURE__ */ Object.create(null), p = class {
   static fromJSON(n, t) {
     if (!t || !t.stepType)
       throw new RangeError("Invalid input for Step.fromJSON");
-    let e = $[t.stepType];
+    let e = K[t.stepType];
     if (!e)
       throw new RangeError(`No step type ${t.stepType} defined`);
     return e.fromJSON(n, t);
@@ -588,11 +595,11 @@ var $ = /* @__PURE__ */ Object.create(null), p = class {
   that's unlikely to clash with steps from other modules.
   */
   static jsonID(n, t) {
-    if (n in $)
+    if (n in K)
       throw new RangeError("Duplicate use of step JSON ID " + n);
-    return $[n] = t, t.prototype.jsonID = n, t;
+    return K[n] = t, t.prototype.jsonID = n, t;
   }
-}, d = class T {
+}, S = class T {
   /**
   @internal
   */
@@ -620,21 +627,21 @@ var $ = /* @__PURE__ */ Object.create(null), p = class {
     try {
       return T.ok(t.replace(e, r, i));
     } catch (s) {
-      if (s instanceof It)
+      if (s instanceof Jt)
         return T.fail(s.message);
       throw s;
     }
   }
 };
-function Q(n, t, e) {
+function U(n, t, e) {
   let r = [];
   for (let i = 0; i < n.childCount; i++) {
     let s = n.child(i);
-    s.content.size && (s = s.copy(Q(s.content, t, s))), s.isInline && (s = t(s, e, i)), r.push(s);
+    s.content.size && (s = s.copy(U(s.content, t, s))), s.isInline && (s = t(s, e, i)), r.push(s);
   }
   return g.fromArray(r);
 }
-var mt = class A extends p {
+var St = class I extends m {
   /**
   Create a mark step.
   */
@@ -642,18 +649,18 @@ var mt = class A extends p {
     super(), this.from = t, this.to = e, this.mark = r;
   }
   apply(t) {
-    let e = t.slice(this.from, this.to), r = t.resolve(this.from), i = r.node(r.sharedDepth(this.to)), s = new c(Q(e.content, (o, a) => !o.isAtom || !a.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), i), e.openStart, e.openEnd);
-    return d.fromReplace(t, this.from, this.to, s);
+    let e = t.slice(this.from, this.to), r = t.resolve(this.from), i = r.node(r.sharedDepth(this.to)), s = new c(U(e.content, (o, a) => !o.isAtom || !a.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), i), e.openStart, e.openEnd);
+    return S.fromReplace(t, this.from, this.to, s);
   }
   invert() {
-    return new dt(this.from, this.to, this.mark);
+    return new gt(this.from, this.to, this.mark);
   }
   map(t) {
     let e = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1);
-    return e.deleted && r.deleted || e.pos >= r.pos ? null : new A(e.pos, r.pos, this.mark);
+    return e.deleted && r.deleted || e.pos >= r.pos ? null : new I(e.pos, r.pos, this.mark);
   }
   merge(t) {
-    return t instanceof A && t.mark.eq(this.mark) && this.from <= t.to && this.to >= t.from ? new A(Math.min(this.from, t.from), Math.max(this.to, t.to), this.mark) : null;
+    return t instanceof I && t.mark.eq(this.mark) && this.from <= t.to && this.to >= t.from ? new I(Math.min(this.from, t.from), Math.max(this.to, t.to), this.mark) : null;
   }
   toJSON() {
     return {
@@ -669,11 +676,11 @@ var mt = class A extends p {
   static fromJSON(t, e) {
     if (typeof e.from != "number" || typeof e.to != "number")
       throw new RangeError("Invalid input for AddMarkStep.fromJSON");
-    return new A(e.from, e.to, t.markFromJSON(e.mark));
+    return new I(e.from, e.to, t.markFromJSON(e.mark));
   }
 };
-p.jsonID("addMark", mt);
-var dt = class I extends p {
+m.jsonID("addMark", St);
+var gt = class z extends m {
   /**
   Create a mark-removing step.
   */
@@ -681,18 +688,18 @@ var dt = class I extends p {
     super(), this.from = t, this.to = e, this.mark = r;
   }
   apply(t) {
-    let e = t.slice(this.from, this.to), r = new c(Q(e.content, (i) => i.mark(this.mark.removeFromSet(i.marks)), t), e.openStart, e.openEnd);
-    return d.fromReplace(t, this.from, this.to, r);
+    let e = t.slice(this.from, this.to), r = new c(U(e.content, (i) => i.mark(this.mark.removeFromSet(i.marks)), t), e.openStart, e.openEnd);
+    return S.fromReplace(t, this.from, this.to, r);
   }
   invert() {
-    return new mt(this.from, this.to, this.mark);
+    return new St(this.from, this.to, this.mark);
   }
   map(t) {
     let e = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1);
-    return e.deleted && r.deleted || e.pos >= r.pos ? null : new I(e.pos, r.pos, this.mark);
+    return e.deleted && r.deleted || e.pos >= r.pos ? null : new z(e.pos, r.pos, this.mark);
   }
   merge(t) {
-    return t instanceof I && t.mark.eq(this.mark) && this.from <= t.to && this.to >= t.from ? new I(Math.min(this.from, t.from), Math.max(this.to, t.to), this.mark) : null;
+    return t instanceof z && t.mark.eq(this.mark) && this.from <= t.to && this.to >= t.from ? new z(Math.min(this.from, t.from), Math.max(this.to, t.to), this.mark) : null;
   }
   toJSON() {
     return {
@@ -708,11 +715,11 @@ var dt = class I extends p {
   static fromJSON(t, e) {
     if (typeof e.from != "number" || typeof e.to != "number")
       throw new RangeError("Invalid input for RemoveMarkStep.fromJSON");
-    return new I(e.from, e.to, t.markFromJSON(e.mark));
+    return new z(e.from, e.to, t.markFromJSON(e.mark));
   }
 };
-p.jsonID("removeMark", dt);
-var St = class z extends p {
+m.jsonID("removeMark", gt);
+var wt = class J extends m {
   /**
   Create a node mark step.
   */
@@ -722,9 +729,9 @@ var St = class z extends p {
   apply(t) {
     let e = t.nodeAt(this.pos);
     if (!e)
-      return d.fail("No node at mark step's position");
+      return S.fail("No node at mark step's position");
     let r = e.type.create(e.attrs, null, this.mark.addToSet(e.marks));
-    return d.fromReplace(t, this.pos, this.pos + 1, new c(g.from(r), 0, e.isLeaf ? 0 : 1));
+    return S.fromReplace(t, this.pos, this.pos + 1, new c(g.from(r), 0, e.isLeaf ? 0 : 1));
   }
   invert(t) {
     let e = t.nodeAt(this.pos);
@@ -733,15 +740,15 @@ var St = class z extends p {
       if (r.length == e.marks.length) {
         for (let i = 0; i < e.marks.length; i++)
           if (!e.marks[i].isInSet(r))
-            return new z(this.pos, e.marks[i]);
-        return new z(this.pos, this.mark);
+            return new J(this.pos, e.marks[i]);
+        return new J(this.pos, this.mark);
       }
     }
-    return new gt(this.pos, this.mark);
+    return new kt(this.pos, this.mark);
   }
   map(t) {
     let e = t.mapResult(this.pos, 1);
-    return e.deletedAfter ? null : new z(e.pos, this.mark);
+    return e.deletedAfter ? null : new J(e.pos, this.mark);
   }
   toJSON() {
     return { stepType: "addNodeMark", pos: this.pos, mark: this.mark.toJSON() };
@@ -752,11 +759,11 @@ var St = class z extends p {
   static fromJSON(t, e) {
     if (typeof e.pos != "number")
       throw new RangeError("Invalid input for AddNodeMarkStep.fromJSON");
-    return new z(e.pos, t.markFromJSON(e.mark));
+    return new J(e.pos, t.markFromJSON(e.mark));
   }
 };
-p.jsonID("addNodeMark", St);
-var gt = class W extends p {
+m.jsonID("addNodeMark", wt);
+var kt = class V extends m {
   /**
   Create a mark-removing step.
   */
@@ -766,17 +773,17 @@ var gt = class W extends p {
   apply(t) {
     let e = t.nodeAt(this.pos);
     if (!e)
-      return d.fail("No node at mark step's position");
+      return S.fail("No node at mark step's position");
     let r = e.type.create(e.attrs, null, this.mark.removeFromSet(e.marks));
-    return d.fromReplace(t, this.pos, this.pos + 1, new c(g.from(r), 0, e.isLeaf ? 0 : 1));
+    return S.fromReplace(t, this.pos, this.pos + 1, new c(g.from(r), 0, e.isLeaf ? 0 : 1));
   }
   invert(t) {
     let e = t.nodeAt(this.pos);
-    return !e || !this.mark.isInSet(e.marks) ? this : new St(this.pos, this.mark);
+    return !e || !this.mark.isInSet(e.marks) ? this : new wt(this.pos, this.mark);
   }
   map(t) {
     let e = t.mapResult(this.pos, 1);
-    return e.deletedAfter ? null : new W(e.pos, this.mark);
+    return e.deletedAfter ? null : new V(e.pos, this.mark);
   }
   toJSON() {
     return { stepType: "removeNodeMark", pos: this.pos, mark: this.mark.toJSON() };
@@ -787,11 +794,11 @@ var gt = class W extends p {
   static fromJSON(t, e) {
     if (typeof e.pos != "number")
       throw new RangeError("Invalid input for RemoveNodeMarkStep.fromJSON");
-    return new W(e.pos, t.markFromJSON(e.mark));
+    return new V(e.pos, t.markFromJSON(e.mark));
   }
 };
-p.jsonID("removeNodeMark", gt);
-var U = class w extends p {
+m.jsonID("removeNodeMark", kt);
+var X = class w extends m {
   /**
   The given `slice` should fit the 'gap' between `from` and
   `to`—the depths must line up, and the surrounding nodes must be
@@ -805,10 +812,10 @@ var U = class w extends p {
     super(), this.from = t, this.to = e, this.slice = r, this.structure = i;
   }
   apply(t) {
-    return this.structure && V(t, this.from, this.to) ? d.fail("Structure replace would overwrite content") : d.fromReplace(t, this.from, this.to, this.slice);
+    return this.structure && G(t, this.from, this.to) ? S.fail("Structure replace would overwrite content") : S.fromReplace(t, this.from, this.to, this.slice);
   }
   getMap() {
-    return new k([this.from, this.to - this.from, this.slice.size]);
+    return new v([this.from, this.to - this.from, this.slice.size]);
   }
   invert(t) {
     return new w(this.from, this.from + this.slice.size, t.slice(this.from, this.to));
@@ -842,9 +849,9 @@ var U = class w extends p {
     return new w(e.from, e.to, c.fromJSON(t, e.slice), !!e.structure);
   }
 };
-U.MAP_BIAS = 1;
-p.jsonID("replace", U);
-var wt = class q extends p {
+X.MAP_BIAS = 1;
+m.jsonID("replace", X);
+var vt = class L extends m {
   /**
   Create a replace-around step with the given range and gap.
   `insert` should be the point in the slice into which the content
@@ -855,16 +862,16 @@ var wt = class q extends p {
     super(), this.from = t, this.to = e, this.gapFrom = r, this.gapTo = i, this.slice = s, this.insert = o, this.structure = a;
   }
   apply(t) {
-    if (this.structure && (V(t, this.from, this.gapFrom) || V(t, this.gapTo, this.to)))
-      return d.fail("Structure gap-replace would overwrite content");
+    if (this.structure && (G(t, this.from, this.gapFrom) || G(t, this.gapTo, this.to)))
+      return S.fail("Structure gap-replace would overwrite content");
     let e = t.slice(this.gapFrom, this.gapTo);
     if (e.openStart || e.openEnd)
-      return d.fail("Gap is not a flat range");
+      return S.fail("Gap is not a flat range");
     let r = this.slice.insertAt(this.insert, e.content);
-    return r ? d.fromReplace(t, this.from, this.to, r) : d.fail("Content does not fit in gap");
+    return r ? S.fromReplace(t, this.from, this.to, r) : S.fail("Content does not fit in gap");
   }
   getMap() {
-    return new k([
+    return new v([
       this.from,
       this.gapFrom - this.from,
       this.insert,
@@ -875,11 +882,11 @@ var wt = class q extends p {
   }
   invert(t) {
     let e = this.gapTo - this.gapFrom;
-    return new q(this.from, this.from + this.slice.size + e, this.from + this.insert, this.from + this.insert + e, t.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);
+    return new L(this.from, this.from + this.slice.size + e, this.from + this.insert, this.from + this.insert + e, t.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);
   }
   map(t) {
     let e = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1), i = this.from == this.gapFrom ? e.pos : t.map(this.gapFrom, -1), s = this.to == this.gapTo ? r.pos : t.map(this.gapTo, 1);
-    return e.deletedAcross && r.deletedAcross || i < e.pos || s > r.pos ? null : new q(e.pos, r.pos, i, s, this.slice, this.insert, this.structure);
+    return e.deletedAcross && r.deletedAcross || i < e.pos || s > r.pos ? null : new L(e.pos, r.pos, i, s, this.slice, this.insert, this.structure);
   }
   toJSON() {
     let t = {
@@ -898,11 +905,11 @@ var wt = class q extends p {
   static fromJSON(t, e) {
     if (typeof e.from != "number" || typeof e.to != "number" || typeof e.gapFrom != "number" || typeof e.gapTo != "number" || typeof e.insert != "number")
       throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON");
-    return new q(e.from, e.to, e.gapFrom, e.gapTo, c.fromJSON(t, e.slice), e.insert, !!e.structure);
+    return new L(e.from, e.to, e.gapFrom, e.gapTo, c.fromJSON(t, e.slice), e.insert, !!e.structure);
   }
 };
-p.jsonID("replaceAround", wt);
-function V(n, t, e) {
+m.jsonID("replaceAround", vt);
+function G(n, t, e) {
   let r = n.resolve(t), i = e - t, s = r.depth;
   for (; i > 0 && s > 0 && r.indexAfter(s) == r.node(s).childCount; )
     s--, i--;
@@ -916,7 +923,7 @@ function V(n, t, e) {
   }
   return !1;
 }
-var Mt = class L extends p {
+var Ct = class P extends m {
   /**
   Construct an attribute step.
   */
@@ -926,23 +933,23 @@ var Mt = class L extends p {
   apply(t) {
     let e = t.nodeAt(this.pos);
     if (!e)
-      return d.fail("No node at attribute step's position");
+      return S.fail("No node at attribute step's position");
     let r = /* @__PURE__ */ Object.create(null);
     for (let s in e.attrs)
       r[s] = e.attrs[s];
     r[this.attr] = this.value;
     let i = e.type.create(r, null, e.marks);
-    return d.fromReplace(t, this.pos, this.pos + 1, new c(g.from(i), 0, e.isLeaf ? 0 : 1));
+    return S.fromReplace(t, this.pos, this.pos + 1, new c(g.from(i), 0, e.isLeaf ? 0 : 1));
   }
   getMap() {
-    return k.empty;
+    return v.empty;
   }
   invert(t) {
-    return new L(this.pos, this.attr, t.nodeAt(this.pos).attrs[this.attr]);
+    return new P(this.pos, this.attr, t.nodeAt(this.pos).attrs[this.attr]);
   }
   map(t) {
     let e = t.mapResult(this.pos, 1);
-    return e.deletedAfter ? null : new L(e.pos, this.attr, this.value);
+    return e.deletedAfter ? null : new P(e.pos, this.attr, this.value);
   }
   toJSON() {
     return { stepType: "attr", pos: this.pos, attr: this.attr, value: this.value };
@@ -950,11 +957,11 @@ var Mt = class L extends p {
   static fromJSON(t, e) {
     if (typeof e.pos != "number" || typeof e.attr != "string")
       throw new RangeError("Invalid input for AttrStep.fromJSON");
-    return new L(e.pos, e.attr, e.value);
+    return new P(e.pos, e.attr, e.value);
   }
 };
-p.jsonID("attr", Mt);
-var bt = class G extends p {
+m.jsonID("attr", Ct);
+var Bt = class Q extends m {
   /**
   Construct an attribute step.
   */
@@ -967,13 +974,13 @@ var bt = class G extends p {
       e[i] = t.attrs[i];
     e[this.attr] = this.value;
     let r = t.type.create(e, t.content, t.marks);
-    return d.ok(r);
+    return S.ok(r);
   }
   getMap() {
-    return k.empty;
+    return v.empty;
   }
   invert(t) {
-    return new G(this.attr, t.attrs[this.attr]);
+    return new Q(this.attr, t.attrs[this.attr]);
   }
   map(t) {
     return this;
@@ -984,27 +991,27 @@ var bt = class G extends p {
   static fromJSON(t, e) {
     if (typeof e.attr != "string")
       throw new RangeError("Invalid input for DocAttrStep.fromJSON");
-    return new G(e.attr, e.value);
+    return new Q(e.attr, e.value);
   }
 };
-p.jsonID("docAttr", bt);
-var C = class extends Error {
+m.jsonID("docAttr", Bt);
+var B = class extends Error {
 };
-C = function n(t) {
+B = function n(t) {
   let e = Error.call(this, t);
   return e.__proto__ = n.prototype, e;
 };
-C.prototype = Object.create(Error.prototype);
-C.prototype.constructor = C;
-C.prototype.name = "TransformError";
-var K = /* @__PURE__ */ Object.create(null), f = class {
+B.prototype = Object.create(Error.prototype);
+B.prototype.constructor = B;
+B.prototype.name = "TransformError";
+var W = /* @__PURE__ */ Object.create(null), p = class {
   /**
   Initialize a selection with the head and anchor and ranges. If no
   ranges are given, constructs a single range across `$anchor` and
   `$head`.
   */
   constructor(n, t, e) {
-    this.$anchor = n, this.$head = t, this.ranges = e || [new Ct(n.min(t), n.max(t))];
+    this.$anchor = n, this.$head = t, this.ranges = e || [new Ft(n.min(t), n.max(t))];
   }
   /**
   The selection's anchor, as an unresolved position.
@@ -1068,8 +1075,8 @@ var K = /* @__PURE__ */ Object.create(null), f = class {
       r = e, e = e.lastChild;
     let i = n.steps.length, s = this.ranges;
     for (let o = 0; o < s.length; o++) {
-      let { $from: a, $to: l } = s[o], h = n.mapping.slice(i);
-      n.replaceRange(h.map(a.pos), h.map(l.pos), o ? c.empty : t), o == 0 && nt(n, i, (e ? e.isInline : r && r.isTextblock) ? -1 : 1);
+      let { $from: a, $to: l } = s[o], u = n.mapping.slice(i);
+      n.replaceRange(u.map(a.pos), u.map(l.pos), o ? c.empty : t), o == 0 && nt(n, i, (e ? e.isInline : r && r.isTextblock) ? -1 : 1);
     }
   }
   /**
@@ -1079,8 +1086,8 @@ var K = /* @__PURE__ */ Object.create(null), f = class {
   replaceWith(n, t) {
     let e = n.steps.length, r = this.ranges;
     for (let i = 0; i < r.length; i++) {
-      let { $from: s, $to: o } = r[i], a = n.mapping.slice(e), l = a.map(s.pos), h = a.map(o.pos);
-      i ? n.deleteRange(l, h) : (n.replaceRangeWith(l, h, t), nt(n, e, t.isInline ? -1 : 1));
+      let { $from: s, $to: o } = r[i], a = n.mapping.slice(e), l = a.map(s.pos), u = a.map(o.pos);
+      i ? n.deleteRange(l, u) : (n.replaceRangeWith(l, u, t), nt(n, e, t.isInline ? -1 : 1));
     }
   }
   /**
@@ -1091,11 +1098,11 @@ var K = /* @__PURE__ */ Object.create(null), f = class {
   found.
   */
   static findFrom(n, t, e = !1) {
-    let r = n.parent.inlineContent ? new R(n) : N(n.node(0), n.parent, n.pos, n.index(), t, e);
+    let r = n.parent.inlineContent ? new A(n) : R(n.node(0), n.parent, n.pos, n.index(), t, e);
     if (r)
       return r;
     for (let i = n.depth - 1; i >= 0; i--) {
-      let s = t < 0 ? N(n.node(0), n.node(i), n.before(i + 1), n.index(i), t, e) : N(n.node(0), n.node(i), n.after(i + 1), n.index(i) + 1, t, e);
+      let s = t < 0 ? R(n.node(0), n.node(i), n.before(i + 1), n.index(i), t, e) : R(n.node(0), n.node(i), n.after(i + 1), n.index(i) + 1, t, e);
       if (s)
         return s;
     }
@@ -1107,7 +1114,7 @@ var K = /* @__PURE__ */ Object.create(null), f = class {
   negative, it will search backwards first.
   */
   static near(n, t = 1) {
-    return this.findFrom(n, t) || this.findFrom(n, -t) || new b(n.node(0));
+    return this.findFrom(n, t) || this.findFrom(n, -t) || new C(n.node(0));
   }
   /**
   Find the cursor or leaf node selection closest to the start of
@@ -1116,14 +1123,14 @@ var K = /* @__PURE__ */ Object.create(null), f = class {
   exists.
   */
   static atStart(n) {
-    return N(n, n, 0, 0, 1) || new b(n);
+    return R(n, n, 0, 0, 1) || new C(n);
   }
   /**
   Find the cursor or leaf node selection closest to the end of the
   given document.
   */
   static atEnd(n) {
-    return N(n, n, n.content.size, n.childCount, -1) || new b(n);
+    return R(n, n, n.content.size, n.childCount, -1) || new C(n);
   }
   /**
   Deserialize the JSON representation of a selection. Must be
@@ -1132,7 +1139,7 @@ var K = /* @__PURE__ */ Object.create(null), f = class {
   static fromJSON(n, t) {
     if (!t || !t.type)
       throw new RangeError("Invalid input for Selection.fromJSON");
-    let e = K[t.type];
+    let e = W[t.type];
     if (!e)
       throw new RangeError(`No selection type ${t.type} defined`);
     return e.fromJSON(n, t);
@@ -1144,9 +1151,9 @@ var K = /* @__PURE__ */ Object.create(null), f = class {
   clash with classes from other modules.
   */
   static jsonID(n, t) {
-    if (n in K)
+    if (n in W)
       throw new RangeError("Duplicate use of selection JSON ID " + n);
-    return K[n] = t, t.prototype.jsonID = n, t;
+    return W[n] = t, t.prototype.jsonID = n, t;
   }
   /**
   Get a [bookmark](https://prosemirror.net/docs/ref/#state.SelectionBookmark) for this selection,
@@ -1158,11 +1165,11 @@ var K = /* @__PURE__ */ Object.create(null), f = class {
   returns the bookmark for that.
   */
   getBookmark() {
-    return R.between(this.$anchor, this.$head).getBookmark();
+    return A.between(this.$anchor, this.$head).getBookmark();
   }
 };
-f.prototype.visible = !0;
-var Ct = class {
+p.prototype.visible = !0;
+var Ft = class {
   /**
   Create a range.
   */
@@ -1173,7 +1180,7 @@ var Ct = class {
 function rt(n) {
   !et && !n.parent.inlineContent && (et = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + n.parent.type.name + ")"));
 }
-var R = class J extends f {
+var A = class M extends p {
   /**
   Construct a text selection between the given points.
   */
@@ -1190,9 +1197,9 @@ var R = class J extends f {
   map(t, e) {
     let r = t.resolve(e.map(this.head));
     if (!r.parent.inlineContent)
-      return f.near(r);
+      return p.near(r);
     let i = t.resolve(e.map(this.anchor));
-    return new J(i.parent.inlineContent ? i : r, r);
+    return new M(i.parent.inlineContent ? i : r, r);
   }
   replace(t, e = c.empty) {
     if (super.replace(t, e), e == c.empty) {
@@ -1201,10 +1208,10 @@ var R = class J extends f {
     }
   }
   eq(t) {
-    return t instanceof J && t.anchor == this.anchor && t.head == this.head;
+    return t instanceof M && t.anchor == this.anchor && t.head == this.head;
   }
   getBookmark() {
-    return new kt(this.anchor, this.head);
+    return new yt(this.anchor, this.head);
   }
   toJSON() {
     return { type: "text", anchor: this.anchor, head: this.head };
@@ -1215,7 +1222,7 @@ var R = class J extends f {
   static fromJSON(t, e) {
     if (typeof e.anchor != "number" || typeof e.head != "number")
       throw new RangeError("Invalid input for TextSelection.fromJSON");
-    return new J(t.resolve(e.anchor), t.resolve(e.head));
+    return new M(t.resolve(e.anchor), t.resolve(e.head));
   }
   /**
   Create a text selection from non-resolved positions.
@@ -1235,27 +1242,27 @@ var R = class J extends f {
   static between(t, e, r) {
     let i = t.pos - e.pos;
     if ((!r || i) && (r = i >= 0 ? 1 : -1), !e.parent.inlineContent) {
-      let s = f.findFrom(e, r, !0) || f.findFrom(e, -r, !0);
+      let s = p.findFrom(e, r, !0) || p.findFrom(e, -r, !0);
       if (s)
         e = s.$head;
       else
-        return f.near(e, r);
+        return p.near(e, r);
     }
-    return t.parent.inlineContent || (i == 0 ? t = e : (t = (f.findFrom(t, -r, !0) || f.findFrom(t, r, !0)).$anchor, t.pos < e.pos != i < 0 && (t = e))), new J(t, e);
+    return t.parent.inlineContent || (i == 0 ? t = e : (t = (p.findFrom(t, -r, !0) || p.findFrom(t, r, !0)).$anchor, t.pos < e.pos != i < 0 && (t = e))), new M(t, e);
   }
 };
-f.jsonID("text", R);
-var kt = class vt {
+p.jsonID("text", A);
+var yt = class xt {
   constructor(t, e) {
     this.anchor = t, this.head = e;
   }
   map(t) {
-    return new vt(t.map(this.anchor), t.map(this.head));
+    return new xt(t.map(this.anchor), t.map(this.head));
   }
   resolve(t) {
-    return R.between(t.resolve(this.anchor), t.resolve(this.head));
+    return A.between(t.resolve(this.anchor), t.resolve(this.head));
   }
-}, O = class M extends f {
+}, O = class b extends p {
   /**
   Create a node selection. Does not verify the validity of its
   argument.
@@ -1266,19 +1273,19 @@ var kt = class vt {
   }
   map(t, e) {
     let { deleted: r, pos: i } = e.mapResult(this.anchor), s = t.resolve(i);
-    return r ? f.near(s) : new M(s);
+    return r ? p.near(s) : new b(s);
   }
   content() {
     return new c(g.from(this.node), 0, 0);
   }
   eq(t) {
-    return t instanceof M && t.anchor == this.anchor;
+    return t instanceof b && t.anchor == this.anchor;
   }
   toJSON() {
     return { type: "node", anchor: this.anchor };
   }
   getBookmark() {
-    return new Bt(this.anchor);
+    return new Dt(this.anchor);
   }
   /**
   @internal
@@ -1286,13 +1293,13 @@ var kt = class vt {
   static fromJSON(t, e) {
     if (typeof e.anchor != "number")
       throw new RangeError("Invalid input for NodeSelection.fromJSON");
-    return new M(t.resolve(e.anchor));
+    return new b(t.resolve(e.anchor));
   }
   /**
   Create a node selection from non-resolved positions.
   */
   static create(t, e) {
-    return new M(t.resolve(e));
+    return new b(t.resolve(e));
   }
   /**
   Determines whether the given node may be selected as a node
@@ -1303,20 +1310,20 @@ var kt = class vt {
   }
 };
 O.prototype.visible = !1;
-f.jsonID("node", O);
-var Bt = class yt {
+p.jsonID("node", O);
+var Dt = class Nt {
   constructor(t) {
     this.anchor = t;
   }
   map(t) {
     let { deleted: e, pos: r } = t.mapResult(this.anchor);
-    return e ? new kt(r, r) : new yt(r);
+    return e ? new yt(r, r) : new Nt(r);
   }
   resolve(t) {
     let e = t.resolve(this.anchor), r = e.nodeAfter;
-    return r && O.isSelectable(r) ? new O(e) : f.near(e);
+    return r && O.isSelectable(r) ? new O(e) : p.near(e);
   }
-}, b = class P extends f {
+}, C = class H extends p {
   /**
   Create an all-selection over the given document.
   */
@@ -1326,7 +1333,7 @@ var Bt = class yt {
   replace(t, e = c.empty) {
     if (e == c.empty) {
       t.delete(0, t.doc.content.size);
-      let r = f.atStart(t.doc);
+      let r = p.atStart(t.doc);
       r.eq(t.selection) || t.setSelection(r);
     } else
       super.replace(t, e);
@@ -1338,37 +1345,37 @@ var Bt = class yt {
   @internal
   */
   static fromJSON(t) {
-    return new P(t);
+    return new H(t);
   }
   map(t) {
-    return new P(t);
+    return new H(t);
   }
   eq(t) {
-    return t instanceof P;
+    return t instanceof H;
   }
   getBookmark() {
-    return Ft;
+    return qt;
   }
 };
-f.jsonID("all", b);
-var Ft = {
+p.jsonID("all", C);
+var qt = {
   map() {
     return this;
   },
   resolve(n) {
-    return new b(n);
+    return new C(n);
   }
 };
-function N(n, t, e, r, i, s = !1) {
+function R(n, t, e, r, i, s = !1) {
   if (t.inlineContent)
-    return R.create(n, e);
+    return A.create(n, e);
   for (let o = r - (i > 0 ? 0 : 1); i > 0 ? o < t.childCount : o >= 0; o += i) {
     let a = t.child(o);
     if (a.isAtom) {
       if (!s && O.isSelectable(a))
         return O.create(n, e - (i < 0 ? a.nodeSize : 0));
     } else {
-      let l = N(n, a, e + i, i < 0 ? a.childCount : 0, i, s);
+      let l = R(n, a, e + i, i < 0 ? a.childCount : 0, i, s);
       if (l)
         return l;
     }
@@ -1381,43 +1388,43 @@ function nt(n, t, e) {
   if (r < t)
     return;
   let i = n.steps[r];
-  if (!(i instanceof U || i instanceof wt))
+  if (!(i instanceof X || i instanceof vt))
     return;
   let s = n.mapping.maps[r], o;
-  s.forEach((a, l, h, u) => {
-    o == null && (o = u);
-  }), n.setSelection(f.near(n.doc.resolve(o), e));
+  s.forEach((a, l, u, h) => {
+    o == null && (o = h);
+  }), n.setSelection(p.near(n.doc.resolve(o), e));
 }
 function it(n, t) {
   return !t || !n ? n : n.bind(t);
 }
-var F = class {
+var D = class {
   constructor(n, t, e) {
     this.name = n, this.init = it(t.init, e), this.apply = it(t.apply, e);
   }
 };
-new F("doc", {
+new D("doc", {
   init(n) {
     return n.doc || n.schema.topNodeType.createAndFill();
   },
   apply(n) {
     return n.doc;
   }
-}), new F("selection", {
+}), new D("selection", {
   init(n, t) {
-    return n.selection || f.atStart(t.doc);
+    return n.selection || p.atStart(t.doc);
   },
   apply(n) {
     return n.selection;
   }
-}), new F("storedMarks", {
+}), new D("storedMarks", {
   init(n) {
     return n.storedMarks || null;
   },
   apply(n, t, e, r) {
     return r.selection.$cursor ? n.storedMarks : null;
   }
-}), new F("scrollToSelection", {
+}), new D("scrollToSelection", {
   init() {
     return 0;
   },
@@ -1425,22 +1432,22 @@ new F("doc", {
     return n.scrolledIntoView ? t + 1 : t;
   }
 });
-var Dt = (n, t) => {
+var Lt = (n, t) => {
   var e;
   const { state: r, view: i } = n, { selection: s } = r;
   if (!s.empty) return !1;
   const { $from: o } = s;
   if (o.parentOffset !== 0) return !1;
-  const a = o.depth - 1, l = o.node(a), h = o.index(a);
-  if (h === 0) return !1;
+  const a = o.depth - 1, l = o.node(a), u = o.index(a);
+  if (u === 0) return !1;
   if (l.type === t)
     return n.commands.lift(t.name);
-  const u = l.child(h - 1);
-  if (u.type !== t || !((e = u.lastChild) != null && e.isTextblock))
+  const h = l.child(u - 1);
+  if (h.type !== t || !((e = h.lastChild) != null && e.isTextblock))
     return !1;
-  const S = o.before(), E = S - 1 - 1, { tr: v } = r;
-  return v.delete(S, o.after()).insert(E, o.parent.content), v.setSelection(R.create(v.doc, E)), i.dispatch(v.scrollIntoView()), !0;
-}, qt = /^\s*>\s$/, Lt = xt.create({
+  const f = o.before(), E = f - 1 - 1, { tr: y } = r;
+  return y.delete(f, o.after()).insert(E, o.parent.content), y.setSelection(A.create(y.doc, E)), i.dispatch(y.scrollIntoView()), !0;
+}, Pt = /^\s*>\s$/, Ht = Rt.create({
   name: "blockquote",
   addOptions() {
     return {
@@ -1454,7 +1461,7 @@ var Dt = (n, t) => {
     return [{ tag: "blockquote" }];
   },
   renderHTML({ HTMLAttributes: n }) {
-    return /* @__PURE__ */ Z("blockquote", { ...Rt(this.options.HTMLAttributes, n), children: /* @__PURE__ */ Z("slot", {}) });
+    return /* @__PURE__ */ Z("blockquote", { ...Ot(this.options.HTMLAttributes, n), children: /* @__PURE__ */ Z("slot", {}) });
   },
   parseMarkdown: (n, t) => {
     var e;
@@ -1467,9 +1474,9 @@ var Dt = (n, t) => {
     const e = ">", r = [];
     return n.content.forEach((i, s) => {
       var o, a;
-      const u = ((a = (o = t.renderChild) == null ? void 0 : o.call(t, i, s)) != null ? a : t.renderChildren([i])).split(`
-`).map((S) => S.trim() === "" ? e : `${e} ${S}`);
-      r.push(u.join(`
+      const h = ((a = (o = t.renderChild) == null ? void 0 : o.call(t, i, s)) != null ? a : t.renderChildren([i])).split(`
+`).map((f) => f.trim() === "" ? e : `${e} ${f}`);
+      r.push(h.join(`
 `));
     }), r.join(`
 ${e}
@@ -1485,33 +1492,33 @@ ${e}
   addKeyboardShortcuts() {
     return {
       "Mod-Shift-b": () => this.editor.commands.toggleBlockquote(),
-      Backspace: () => Dt(this.editor, this.type)
+      Backspace: () => Lt(this.editor, this.type)
     };
   },
   addInputRules() {
     return [
-      Nt({
-        find: qt,
+      At({
+        find: Pt,
         type: this.type
       })
     ];
   }
 });
-function Qt() {
-  const n = Et(Pt.name), {
+function Xt() {
+  const n = Tt($t.name), {
     icon: t = void 0,
     tooltip: e = void 0,
     shortcutKeys: r = void 0,
     tooltipOptions: i = {},
     action: s = void 0,
     isActive: o = void 0
-  } = (n == null ? void 0 : n.componentProps) ?? {}, { dataState: a, disabled: l, update: h } = Tt(o), u = () => {
-    l || s && (s(), h());
+  } = (n == null ? void 0 : n.componentProps) ?? {}, { dataState: a, disabled: l, update: u } = It(o), h = () => {
+    l || s && (s(), u());
   };
   return n ? /* @__PURE__ */ j(
-    At,
+    zt,
     {
-      action: u,
+      action: h,
       dataState: a,
       disabled: l,
       icon: t,
@@ -1519,9 +1526,9 @@ function Qt() {
       tooltip: e,
       tooltipOptions: i
     }
-  ) : /* @__PURE__ */ j(Ot, {});
+  ) : /* @__PURE__ */ j(Et, {});
 }
-const Pt = /* @__PURE__ */ Lt.extend({
+const $t = /* @__PURE__ */ Ht.extend({
   //@ts-expect-error
   addOptions() {
     var n;
@@ -1544,6 +1551,6 @@ const Pt = /* @__PURE__ */ Lt.extend({
   }
 });
 export {
-  Pt as Blockquote,
-  Qt as RichTextBlockquote
+  $t as Blockquote,
+  Xt as RichTextBlockquote
 };