reactjs-tiptap-editor 0.3.19 → 0.3.21

package/lib/{index-BWx1Mchx.js → index-DI9T3iLd.js}

@@ -327,15 +327,15 @@ class b {
   */
   findIndex(e, t = -1) {
     if (e == 0)
-      return Mt(0, e);
+      return Ct(0, e);
     if (e == this.size)
-      return Mt(this.content.length, e);
+      return Ct(this.content.length, e);
     if (e > this.size || e < 0)
       throw new RangeError(`Position ${e} outside of fragment (${this})`);
     for (let n = 0, i = 0; ; n++) {
       let s = this.child(n), o = i + s.nodeSize;
       if (o >= e)
-        return o == e || t > 0 ? Mt(n + 1, o) : Mt(n, i);
+        return o == e || t > 0 ? Ct(n + 1, o) : Ct(n, i);
       i = o;
     }
   }
@@ -401,10 +401,10 @@ class b {
 }
 b.empty = new b([], 0);
 const ln = { index: 0, offset: 0 };
-function Mt(r, e) {
+function Ct(r, e) {
   return ln.index = r, ln.offset = e, ln;
 }
-function vt(r, e) {
+function Rt(r, e) {
   if (r === e)
     return !0;
   if (!(r && typeof r == "object") || !(e && typeof e == "object"))
@@ -416,11 +416,11 @@ function vt(r, e) {
     if (r.length != e.length)
       return !1;
     for (let n = 0; n < r.length; n++)
-      if (!vt(r[n], e[n]))
+      if (!Rt(r[n], e[n]))
         return !1;
   } else {
     for (let n in r)
-      if (!(n in e) || !vt(r[n], e[n]))
+      if (!(n in e) || !Rt(r[n], e[n]))
         return !1;
     for (let n in e)
       if (!(n in r))
@@ -482,7 +482,7 @@ let I = class On {
   another mark.
   */
   eq(e) {
-    return this == e || this.type == e.type && vt(this.attrs, e.attrs);
+    return this == e || this.type == e.type && Rt(this.attrs, e.attrs);
   }
   /**
   Convert this mark to a JSON-serializeable representation.
@@ -562,14 +562,14 @@ class k {
   @internal
   */
   insertAt(e, t) {
-    let n = Mi(this.content, e + this.openStart, t);
+    let n = Ci(this.content, e + this.openStart, t);
     return n && new k(n, this.openStart, this.openEnd);
   }
   /**
   @internal
   */
   removeBetween(e, t) {
-    return new k(Ci(this.content, e + this.openStart, t + this.openStart), this.openStart, this.openEnd);
+    return new k(Mi(this.content, e + this.openStart, t + this.openStart), this.openStart, this.openEnd);
   }
   /**
   Tests whether this slice is equal to another slice.
@@ -617,7 +617,7 @@ class k {
   }
 }
 k.empty = new k(b.empty, 0, 0);
-function Ci(r, e, t) {
+function Mi(r, e, t) {
   let { index: n, offset: i } = r.findIndex(e), s = r.maybeChild(n), { index: o, offset: l } = r.findIndex(t);
   if (i == e || s.isText) {
     if (l != t && !r.child(o).isText)
@@ -626,13 +626,13 @@ function Ci(r, e, t) {
   }
   if (n != o)
     throw new RangeError("Removing non-flat range");
-  return r.replaceChild(n, s.copy(Ci(s.content, e - i - 1, t - i - 1)));
+  return r.replaceChild(n, s.copy(Mi(s.content, e - i - 1, t - i - 1)));
 }
-function Mi(r, e, t, n) {
+function Ci(r, e, t, n) {
   let { index: i, offset: s } = r.findIndex(e), o = r.maybeChild(i);
   if (s == e || o.isText)
     return r.cut(0, e).append(t).append(r.cut(e));
-  let l = Mi(o.content, e - s - 1, t);
+  let l = Ci(o.content, e - s - 1, t);
   return l && r.replaceChild(i, o.copy(l));
 }
 function so(r, e, t) {
@@ -665,29 +665,29 @@ function Nn(r, e, t) {
   let n = r.node(t);
   return Oi(n, e.node(t)), n;
 }
-function ve(r, e) {
+function Re(r, e) {
   let t = e.length - 1;
   t >= 0 && r.isText && r.sameMarkup(e[t]) ? e[t] = r.withText(e[t].text + r.text) : e.push(r);
 }
 function st(r, e, t, n) {
   let i = (e || r).node(t), s = 0, o = e ? e.index(t) : i.childCount;
-  r && (s = r.index(t), r.depth > t ? s++ : r.textOffset && (ve(r.nodeAfter, n), s++));
+  r && (s = r.index(t), r.depth > t ? s++ : r.textOffset && (Re(r.nodeAfter, n), s++));
   for (let l = s; l < o; l++)
-    ve(i.child(l), n);
-  e && e.depth == t && e.textOffset && ve(e.nodeBefore, n);
+    Re(i.child(l), n);
+  e && e.depth == t && e.textOffset && Re(e.nodeBefore, n);
 }
 function Pe(r, e) {
   return r.type.checkContent(e), r.copy(e);
 }
 function Ni(r, e, t, n, i) {
   let s = r.depth > i && Nn(r, e, i + 1), o = n.depth > i && Nn(t, n, i + 1), l = [];
-  return st(null, r, i, l), s && o && e.index(i) == t.index(i) ? (Oi(s, o), ve(Pe(s, Ni(r, e, t, n, i + 1)), l)) : (s && ve(Pe(s, Bt(r, e, i + 1)), l), st(e, t, i, l), o && ve(Pe(o, Bt(t, n, i + 1)), l)), st(n, null, i, l), new b(l);
+  return st(null, r, i, l), s && o && e.index(i) == t.index(i) ? (Oi(s, o), Re(Pe(s, Ni(r, e, t, n, i + 1)), l)) : (s && Re(Pe(s, Bt(r, e, i + 1)), l), st(e, t, i, l), o && Re(Pe(o, Bt(t, n, i + 1)), l)), st(n, null, i, l), new b(l);
 }
 function Bt(r, e, t) {
   let n = [];
   if (st(null, r, t, n), r.depth > t) {
     let i = Nn(r, e, t + 1);
-    ve(Pe(i, Bt(r, e, t + 1)), n);
+    Re(Pe(i, Bt(r, e, t + 1)), n);
   }
   return st(e, null, t, n), new b(n);
 }
@@ -1112,7 +1112,7 @@ let xe = class Tn {
   attributes, and marks.
   */
   hasMarkup(e, t, n) {
-    return this.type == e && vt(this.attrs, t || e.defaultAttrs || co) && I.sameSet(this.marks, n || I.none);
+    return this.type == e && Rt(this.attrs, t || e.defaultAttrs || co) && I.sameSet(this.marks, n || I.none);
   }
   /**
   Create a new node with the same markup as this node, containing
@@ -1775,7 +1775,7 @@ function Ii(r, e) {
   }
   return t;
 }
-function Ri(r, e, t, n) {
+function vi(r, e, t, n) {
   for (let i in e)
     if (!(i in r))
       throw new RangeError(`Unsupported attribute ${i} for ${t} of type ${i}`);
@@ -1784,7 +1784,7 @@ function Ri(r, e, t, n) {
     s.validate && s.validate(e[i]);
   }
 }
-function vi(r, e) {
+function Ri(r, e) {
   let t = /* @__PURE__ */ Object.create(null);
   if (e)
     for (let n in e)
@@ -1796,7 +1796,7 @@ let yr = class Pi {
   @internal
   */
   constructor(e, t, n) {
-    this.name = e, this.schema = t, this.spec = n, this.markSet = null, this.groups = n.group ? n.group.split(" ") : [], this.attrs = vi(e, n.attrs), this.defaultAttrs = Ai(this.attrs), this.contentMatch = null, this.inlineContent = null, this.isBlock = !(n.inline || e == "text"), this.isText = e == "text";
+    this.name = e, this.schema = t, this.spec = n, this.markSet = null, this.groups = n.group ? n.group.split(" ") : [], this.attrs = Ri(e, n.attrs), this.defaultAttrs = Ai(this.attrs), this.contentMatch = null, this.inlineContent = null, this.isBlock = !(n.inline || e == "text"), this.isText = e == "text";
   }
   /**
   True if this is an inline type.
@@ -1924,7 +1924,7 @@ let yr = class Pi {
   @internal
   */
   checkAttrs(e) {
-    Ri(this.attrs, e, "node", this.name);
+    vi(this.attrs, e, "node", this.name);
   }
   /**
   Check whether the given mark type is allowed in this node.
@@ -1991,7 +1991,7 @@ class Ht {
   @internal
   */
   constructor(e, t, n, i) {
-    this.name = e, this.rank = t, this.schema = n, this.spec = i, this.attrs = vi(e, i.attrs), this.excluded = null;
+    this.name = e, this.rank = t, this.schema = n, this.spec = i, this.attrs = Ri(e, i.attrs), this.excluded = null;
     let s = Ai(this.attrs);
     this.instance = s ? new I(this, s) : null;
   }
@@ -2031,7 +2031,7 @@ class Ht {
   @internal
   */
   checkAttrs(e) {
-    Ri(this.attrs, e, "mark", this.name);
+    vi(this.attrs, e, "mark", this.name);
   }
   /**
   Queries whether a given mark type is
@@ -2140,10 +2140,10 @@ function br(r, e) {
   }
   return t;
 }
-function Co(r) {
+function Mo(r) {
   return r.tag != null;
 }
-function Mo(r) {
+function Co(r) {
   return r.style != null;
 }
 class Se {
@@ -2155,9 +2155,9 @@ class Se {
     this.schema = e, this.rules = t, this.tags = [], this.styles = [];
     let n = this.matchedStyles = [];
     t.forEach((i) => {
-      if (Co(i))
+      if (Mo(i))
         this.tags.push(i);
-      else if (Mo(i)) {
+      else if (Co(i)) {
         let s = /[^=]*/.exec(i.style)[0];
         n.indexOf(s) < 0 && n.push(s), this.styles.push(i);
       }
@@ -2494,7 +2494,7 @@ class xr {
       i.match && (i.match = i.match.matchType(e.type));
       let s = I.none;
       for (let o of n.concat(e.marks))
-        (i.type ? i.type.allowsMarkType(o.type) : Cr(o.type, e.type)) && (s = o.addToSet(s));
+        (i.type ? i.type.allowsMarkType(o.type) : Mr(o.type, e.type)) && (s = o.addToSet(s));
       return i.content.push(e.mark(s)), !0;
     }
     return !1;
@@ -2513,7 +2513,7 @@ class xr {
     let l = kr(e, s, o.options);
     o.options & ot && o.content.length == 0 && (l |= ot);
     let a = I.none;
-    return n = n.filter((c) => (o.type ? o.type.allowsMarkType(c.type) : Cr(c.type, e)) ? (a = c.addToSet(a), !1) : !0), this.nodes.push(new wt(e, t, a, i, null, l)), this.open++, n;
+    return n = n.filter((c) => (o.type ? o.type.allowsMarkType(c.type) : Mr(c.type, e)) ? (a = c.addToSet(a), !1) : !0), this.nodes.push(new wt(e, t, a, i, null, l)), this.open++, n;
   }
   // Make sure all nodes above this.open are finished and added to
   // their parents
@@ -2622,7 +2622,7 @@ function Sr(r) {
     e[t] = r[t];
   return e;
 }
-function Cr(r, e) {
+function Mr(r, e) {
   let t = e.schema.nodes;
   for (let n in t) {
     let i = t[n];
@@ -2734,17 +2734,17 @@ class $e {
   This can be useful as a base to build a custom serializer from.
   */
   static nodesFromSchema(e) {
-    let t = Mr(e.nodes);
+    let t = Cr(e.nodes);
     return t.text || (t.text = (n) => n.text), t;
   }
   /**
   Gather the serializers in a schema's mark specs into an object.
   */
   static marksFromSchema(e) {
-    return Mr(e.marks);
+    return Cr(e.marks);
   }
 }
-function Mr(r) {
+function Cr(r) {
   let e = {};
   for (let t in r) {
     let n = r[t].spec.toDOM;
@@ -3109,7 +3109,7 @@ class J {
     return cn[e] = t, t.prototype.jsonID = e, t;
   }
 }
-class R {
+class v {
   /**
   @internal
   */
@@ -3120,13 +3120,13 @@ class R {
   Create a successful step result.
   */
   static ok(e) {
-    return new R(e, null);
+    return new v(e, null);
   }
   /**
   Create a failed step result.
   */
   static fail(e) {
-    return new R(null, e);
+    return new v(null, e);
   }
   /**
   Call [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) with the given
@@ -3135,10 +3135,10 @@ class R {
   */
   static fromReplace(e, t, n, i) {
     try {
-      return R.ok(e.replace(t, n, i));
+      return v.ok(e.replace(t, n, i));
     } catch (s) {
       if (s instanceof Pt)
-        return R.fail(s.message);
+        return v.fail(s.message);
       throw s;
     }
   }
@@ -3160,7 +3160,7 @@ class ye extends J {
   }
   apply(e) {
     let t = e.slice(this.from, this.to), n = e.resolve(this.from), i = n.node(n.sharedDepth(this.to)), s = new k(Kn(t.content, (o, l) => !o.isAtom || !l.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), i), t.openStart, t.openEnd);
-    return R.fromReplace(e, this.from, this.to, s);
+    return v.fromReplace(e, this.from, this.to, s);
   }
   invert() {
     return new re(this.from, this.to, this.mark);
@@ -3199,7 +3199,7 @@ class re extends J {
   }
   apply(e) {
     let t = e.slice(this.from, this.to), n = new k(Kn(t.content, (i) => i.mark(this.mark.removeFromSet(i.marks)), e), t.openStart, t.openEnd);
-    return R.fromReplace(e, this.from, this.to, n);
+    return v.fromReplace(e, this.from, this.to, n);
   }
   invert() {
     return new ye(this.from, this.to, this.mark);
@@ -3239,9 +3239,9 @@ class be extends J {
   apply(e) {
     let t = e.nodeAt(this.pos);
     if (!t)
-      return R.fail("No node at mark step's position");
+      return v.fail("No node at mark step's position");
     let n = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
-    return R.fromReplace(e, this.pos, this.pos + 1, new k(b.from(n), 0, t.isLeaf ? 0 : 1));
+    return v.fromReplace(e, this.pos, this.pos + 1, new k(b.from(n), 0, t.isLeaf ? 0 : 1));
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
@@ -3283,9 +3283,9 @@ class _e extends J {
   apply(e) {
     let t = e.nodeAt(this.pos);
     if (!t)
-      return R.fail("No node at mark step's position");
+      return v.fail("No node at mark step's position");
     let n = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
-    return R.fromReplace(e, this.pos, this.pos + 1, new k(b.from(n), 0, t.isLeaf ? 0 : 1));
+    return v.fromReplace(e, this.pos, this.pos + 1, new k(b.from(n), 0, t.isLeaf ? 0 : 1));
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
@@ -3322,7 +3322,7 @@ class P extends J {
     super(), this.from = e, this.to = t, this.slice = n, this.structure = i;
   }
   apply(e) {
-    return this.structure && An(e, this.from, this.to) ? R.fail("Structure replace would overwrite content") : R.fromReplace(e, this.from, this.to, this.slice);
+    return this.structure && An(e, this.from, this.to) ? v.fail("Structure replace would overwrite content") : v.fromReplace(e, this.from, this.to, this.slice);
   }
   getMap() {
     return new Y([this.from, this.to - this.from, this.slice.size]);
@@ -3372,12 +3372,12 @@ class B extends J {
   }
   apply(e) {
     if (this.structure && (An(e, this.from, this.gapFrom) || An(e, this.gapTo, this.to)))
-      return R.fail("Structure gap-replace would overwrite content");
+      return v.fail("Structure gap-replace would overwrite content");
     let t = e.slice(this.gapFrom, this.gapTo);
     if (t.openStart || t.openEnd)
-      return R.fail("Gap is not a flat range");
+      return v.fail("Gap is not a flat range");
     let n = this.slice.insertAt(this.insert, t.content);
-    return n ? R.fromReplace(e, this.from, this.to, n) : R.fail("Content does not fit in gap");
+    return n ? v.fromReplace(e, this.from, this.to, n) : v.fail("Content does not fit in gap");
   }
   getMap() {
     return new Y([
@@ -3446,7 +3446,7 @@ function Io(r, e, t, n) {
     }
   }), i.forEach((a) => r.step(a)), s.forEach((a) => r.step(a));
 }
-function Ro(r, e, t, n) {
+function vo(r, e, t, n) {
   let i = [], s = 0;
   r.doc.nodesBetween(e, t, (o, l) => {
     if (!o.isInline)
@@ -3496,7 +3496,7 @@ function Hn(r, e, t, n = t.contentMatch, i = !0) {
   for (let a = o.length - 1; a >= 0; a--)
     r.step(o[a]);
 }
-function vo(r, e, t) {
+function Ro(r, e, t) {
   return (e == 0 || r.canReplace(e, r.childCount)) && (t == r.childCount || r.canReplace(0, t));
 }
 function et(r) {
@@ -3505,7 +3505,7 @@ function et(r) {
     let i = r.$from.node(n), s = r.$from.index(n), o = r.$to.indexAfter(n);
     if (n < r.depth && i.canReplace(s, o, t))
       return n;
-    if (n == 0 || i.type.spec.isolating || !vo(i, s, o))
+    if (n == 0 || i.type.spec.isolating || !Ro(i, s, o))
       break;
   }
   return null;
@@ -3950,8 +3950,8 @@ function Yo(r, e, t, n) {
       for (let m = 0; m < o.length; m++) {
         let g = o[(m + a) % o.length], y = !0;
         g < 0 && (y = !1, g = -g);
-        let C = i.node(g - 1), M = i.index(g - 1);
-        if (C.canReplaceWith(M, M, p.type, p.marks))
+        let M = i.node(g - 1), C = i.index(g - 1);
+        if (M.canReplaceWith(C, C, p.type, p.marks))
           return r.replace(i.before(g), y ? s.after(g) : t, new k(Gi(n.content, 0, n.openStart, h), h, n.openEnd));
       }
   }
@@ -4013,13 +4013,13 @@ class Ge extends J {
   apply(e) {
     let t = e.nodeAt(this.pos);
     if (!t)
-      return R.fail("No node at attribute step's position");
+      return v.fail("No node at attribute step's position");
     let n = /* @__PURE__ */ Object.create(null);
     for (let s in t.attrs)
       n[s] = t.attrs[s];
     n[this.attr] = this.value;
     let i = t.type.create(n, null, t.marks);
-    return R.fromReplace(e, this.pos, this.pos + 1, new k(b.from(i), 0, t.isLeaf ? 0 : 1));
+    return v.fromReplace(e, this.pos, this.pos + 1, new k(b.from(i), 0, t.isLeaf ? 0 : 1));
   }
   getMap() {
     return Y.empty;
@@ -4054,7 +4054,7 @@ class ut extends J {
       t[i] = e.attrs[i];
     t[this.attr] = this.value;
     let n = e.type.create(t, e.content, e.marks);
-    return R.ok(n);
+    return v.ok(n);
   }
   getMap() {
     return Y.empty;
@@ -4292,7 +4292,7 @@ class _i {
   remove all marks of any type.
   */
   removeMark(e, t, n) {
-    return Ro(this, e, t, n), this;
+    return vo(this, e, t, n), this;
   }
   /**
   Removes all marks and nodes from the content of the node at
@@ -4851,12 +4851,12 @@ class el extends _i {
     return (this.updated & Ir) > 0;
   }
 }
-function Rr(r, e) {
+function vr(r, e) {
   return !e || !r ? r : r.bind(e);
 }
 class it {
   constructor(e, t, n) {
-    this.name = e, this.init = Rr(t.init, n), this.apply = Rr(t.apply, n);
+    this.name = e, this.init = vr(t.init, n), this.apply = vr(t.apply, n);
   }
 }
 const tl = [
@@ -5128,9 +5128,9 @@ const ae = function(r, e, t) {
 }, nl = function() {
   In = null;
 }, Ve = function(r, e, t, n) {
-  return t && (vr(r, e, t, n, -1) || vr(r, e, t, n, 1));
+  return t && (Rr(r, e, t, n, -1) || Rr(r, e, t, n, 1));
 }, rl = /^(img|br|input|textarea|hr)$/i;
-function vr(r, e, t, n, i) {
+function Rr(r, e, t, n, i) {
   for (; ; ) {
     if (r == t && e == n)
       return !0;
@@ -5221,7 +5221,7 @@ function al(r, e, t) {
       return { node: n.startContainer, offset: Math.min(Q(n.startContainer), n.startOffset) };
   }
 }
-const ie = typeof navigator < "u" ? navigator : null, Pr = typeof document < "u" ? document : null, Te = ie && ie.userAgent || "", Rn = /Edge\/(\d+)/.exec(Te), Zi = /MSIE \d/.exec(Te), vn = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(Te), G = !!(Zi || vn || Rn), Ce = Zi ? document.documentMode : vn ? +vn[1] : Rn ? +Rn[1] : 0, te = !G && /gecko\/(\d+)/i.test(Te);
+const ie = typeof navigator < "u" ? navigator : null, Pr = typeof document < "u" ? document : null, Te = ie && ie.userAgent || "", vn = /Edge\/(\d+)/.exec(Te), Zi = /MSIE \d/.exec(Te), Rn = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(Te), G = !!(Zi || Rn || vn), Me = Zi ? document.documentMode : Rn ? +Rn[1] : vn ? +vn[1] : 0, te = !G && /gecko\/(\d+)/i.test(Te);
 te && +(/Firefox\/(\d+)/.exec(Te) || [0, 0])[1];
 const Pn = !G && /Chrome\/(\d+)/.exec(Te), W = !!Pn, es = Pn ? +Pn[1] : 0, q = !G && !!ie && /Apple Computer/.test(ie.vendor), Qe = q && (/Mobile\/\w+/.test(Te) || !!ie && ie.maxTouchPoints > 2), X = Qe || (ie ? /Mac/.test(ie.platform) : !1), cl = ie ? /Win/.test(ie.platform) : !1, ce = /Android \d/.test(Te), xt = !!Pr && "webkitFontSmoothing" in Pr.documentElement.style, fl = xt ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
 function dl(r) {
@@ -5500,7 +5500,7 @@ function ls(r, e, t) {
     n != e && r.updateState(n), i != r.dom && i && i.focus();
   }
 }
-function Cl(r, e, t) {
+function Ml(r, e, t) {
   let n = e.selection, i = t == "up" ? n.$from : n.$to;
   return ls(r, e, () => {
     let { node: s } = r.docView.domFromPos(i.pos, t == "up" ? -1 : 1);
@@ -5532,13 +5532,13 @@ function Cl(r, e, t) {
     return !0;
   });
 }
-const Ml = /[\u0590-\u08ac]/;
+const Cl = /[\u0590-\u08ac]/;
 function wl(r, e, t) {
   let { $head: n } = e.selection;
   if (!n.parent.isTextblock)
     return !1;
   let i = n.parentOffset, s = !i, o = i == n.parent.content.size, l = r.domSelection();
-  return l ? !Ml.test(n.parent.textContent) || !l.modify ? t == "left" || t == "backward" ? s : o : ls(r, e, () => {
+  return l ? !Cl.test(n.parent.textContent) || !l.modify ? t == "left" || t == "backward" ? s : o : ls(r, e, () => {
     let { focusNode: a, focusOffset: c, anchorNode: f, anchorOffset: d } = r.domSelectionRange(), u = l.caretBidiLevel;
     l.modify("move", t, "character");
     let h = n.depth ? r.docView.domAfterPos(n.before()) : r.dom, { focusNode: p, focusOffset: m } = r.domSelectionRange(), g = p && !h.contains(p.nodeType == 1 ? p : p.parentNode) || a == p && c == m;
@@ -5551,7 +5551,7 @@ function wl(r, e, t) {
 }
 let Fr = null, Vr = null, Lr = !1;
 function Ol(r, e, t) {
-  return Fr == e && Vr == t ? Lr : (Fr = e, Vr = t, Lr = t == "up" || t == "down" ? Cl(r, e, t) : wl(r, e, t));
+  return Fr == e && Vr == t ? Lr : (Fr = e, Vr = t, Lr = t == "up" || t == "down" ? Ml(r, e, t) : wl(r, e, t));
 }
 const Z = 0, $r = 1, Ie = 2, se = 3;
 class St {
@@ -5988,7 +5988,7 @@ class Le extends St {
     this.spec.destroy && this.spec.destroy(), super.destroy();
   }
 }
-class Me extends St {
+class Ce extends St {
   constructor(e, t, n, i, s, o, l, a, c) {
     super(e, [], s, o), this.node = t, this.outerDeco = n, this.innerDeco = i, this.nodeDOM = l;
   }
@@ -6016,7 +6016,7 @@ class Me extends St {
     } else f || ({ dom: f, contentDOM: d } = $e.renderSpec(document, t.type.spec.toDOM(t), null, t.attrs));
     !d && !t.isText && f.nodeName != "BR" && (f.hasAttribute("contenteditable") || (f.contentEditable = "false"), t.type.spec.draggable && (f.draggable = !0));
     let u = f;
-    return f = us(f, n, t), c ? a = new Tl(e, t, n, i, f, d || null, u, c, s, o + 1) : t.isText ? new Xt(e, t, n, i, f, u, s) : new Me(e, t, n, i, f, d || null, u, s, o + 1);
+    return f = us(f, n, t), c ? a = new Tl(e, t, n, i, f, d || null, u, c, s, o + 1) : t.isText ? new Xt(e, t, n, i, f, u, s) : new Ce(e, t, n, i, f, d || null, u, s, o + 1);
   }
   parseRule() {
     if (this.node.type.spec.reparseInView)
@@ -6053,13 +6053,13 @@ class Me extends St {
   // `this.children`.
   updateChildren(e, t) {
     let n = this.node.inlineContent, i = t, s = e.composing ? this.localCompositionInfo(e, t) : null, o = s && s.pos > -1 ? s : null, l = s && s.pos < 0, a = new Dl(this, o && o.node, e);
-    Rl(this.node, this.innerDeco, (c, f, d) => {
+    vl(this.node, this.innerDeco, (c, f, d) => {
       c.spec.marks ? a.syncToMarks(c.spec.marks, n, e) : c.type.side >= 0 && !d && a.syncToMarks(f == this.node.childCount ? I.none : this.node.child(f).marks, n, e), a.placeWidget(c, e, i);
     }, (c, f, d, u) => {
       a.syncToMarks(c.marks, n, e);
       let h;
       a.findNodeMatch(c, f, d, u) || l && e.state.selection.from > i && e.state.selection.to < i + c.nodeSize && (h = a.findIndexWithChild(s.node)) > -1 && a.updateNodeAt(c, f, d, h, e) || a.updateNextNode(c, f, d, e, u, i) || a.addNode(c, f, d, e, i), i += c.nodeSize;
-    }), a.syncToMarks([], n, e), this.node.isTextblock && a.addTextblockHacks(), a.destroyRest(), (a.changed || this.dirty == Ie) && (o && this.protectLocalComposition(e, o), fs(this.contentDOM, this.children, e), Qe && vl(this.dom));
+    }), a.syncToMarks([], n, e), this.node.isTextblock && a.addTextblockHacks(), a.destroyRest(), (a.changed || this.dirty == Ie) && (o && this.protectLocalComposition(e, o), fs(this.contentDOM, this.children, e), Qe && Rl(this.dom));
   }
   localCompositionInfo(e, t) {
     let { from: n, to: i } = e.state.selection;
@@ -6116,10 +6116,10 @@ class Me extends St {
 }
 function Wr(r, e, t, n, i) {
   us(n, e, r);
-  let s = new Me(void 0, r, e, t, n, n, n, i, 0);
+  let s = new Ce(void 0, r, e, t, n, n, n, i, 0);
   return s.contentDOM && s.updateChildren(i, 0), s;
 }
-class Xt extends Me {
+class Xt extends Ce {
   constructor(e, t, n, i, s, o, l) {
     super(e, t, n, i, s, null, o, l, 0);
   }
@@ -6176,7 +6176,7 @@ class cs extends St {
     return this.dom.nodeName == "IMG";
   }
 }
-class Tl extends Me {
+class Tl extends Ce {
   constructor(e, t, n, i, s, o, l, a, c, f) {
     super(e, t, n, i, s, o, l, c, f), this.spec = a;
   }
@@ -6233,11 +6233,11 @@ const at = function(r) {
   r && (this.nodeName = r);
 };
 at.prototype = /* @__PURE__ */ Object.create(null);
-const Re = [new at()];
+const ve = [new at()];
 function Bn(r, e, t) {
   if (r.length == 0)
-    return Re;
-  let n = t ? Re[0] : new at(), i = [n];
+    return ve;
+  let n = t ? ve[0] : new at(), i = [n];
   for (let s = 0; s < r.length; s++) {
     let o = r[s].type.attrs;
     if (o) {
@@ -6251,16 +6251,16 @@ function Bn(r, e, t) {
   return i;
 }
 function ds(r, e, t, n) {
-  if (t == Re && n == Re)
+  if (t == ve && n == ve)
     return e;
   let i = e;
   for (let s = 0; s < n.length; s++) {
     let o = n[s], l = t[s];
     if (s) {
       let a;
-      l && l.nodeName == o.nodeName && i != r && (a = i.parentNode) && a.nodeName.toLowerCase() == o.nodeName || (a = document.createElement(o.nodeName), a.pmIsDeco = !0, a.appendChild(i), l = Re[0]), i = a;
+      l && l.nodeName == o.nodeName && i != r && (a = i.parentNode) && a.nodeName.toLowerCase() == o.nodeName || (a = document.createElement(o.nodeName), a.pmIsDeco = !0, a.appendChild(i), l = ve[0]), i = a;
     }
-    El(i, l || Re[0], o);
+    El(i, l || ve[0], o);
   }
   return i;
 }
@@ -6287,7 +6287,7 @@ function El(r, e, t) {
   }
 }
 function us(r, e, t) {
-  return ds(r, r, Re, Bn(e, t, r.nodeType != 1));
+  return ds(r, r, ve, Bn(e, t, r.nodeType != 1));
 }
 function Vt(r, e) {
   if (r.length != e.length)
@@ -6387,7 +6387,7 @@ class Dl {
   updateNextNode(e, t, n, i, s, o) {
     for (let l = this.index; l < this.top.children.length; l++) {
       let a = this.top.children[l];
-      if (a instanceof Me) {
+      if (a instanceof Ce) {
         let c = this.preMatch.matched.get(a);
         if (c != null && c != s)
           return !1;
@@ -6406,7 +6406,7 @@ class Dl {
   recreateWrapper(e, t, n, i, s, o) {
     if (e.dirty || t.isAtom || !e.children.length || !e.node.content.eq(t.content) || !Vt(n, e.outerDeco) || !i.eq(e.innerDeco))
       return null;
-    let l = Me.create(this.top, t, n, i, s, o);
+    let l = Ce.create(this.top, t, n, i, s, o);
     if (l.contentDOM) {
       l.children = e.children, e.children = [];
       for (let a of l.children)
@@ -6416,7 +6416,7 @@ class Dl {
   }
   // Insert the node as a newly created node desc.
   addNode(e, t, n, i, s) {
-    let o = Me.create(this.top, e, t, n, i, s);
+    let o = Ce.create(this.top, e, t, n, i, s);
     o.contentDOM && o.updateChildren(i, s + 1), this.top.children.splice(this.index++, 0, o), this.changed = !0;
   }
   placeWidget(e, t, n) {
@@ -6481,7 +6481,7 @@ function Al(r, e) {
 function Il(r, e) {
   return r.type.side - e.type.side;
 }
-function Rl(r, e, t, n) {
+function vl(r, e, t, n) {
   let i = e.locals(r), s = 0;
   if (i.length == 0) {
     for (let c = 0; c < r.childCount; c++) {
@@ -6529,7 +6529,7 @@ function Rl(r, e, t, n) {
     n(u, m, e.forChild(s, u), h), s = p;
   }
 }
-function vl(r) {
+function Rl(r) {
   if (r.nodeName == "UL" || r.nodeName == "OL") {
     let e = r.style.cssText;
     r.style.cssText = e + "; list-style: square !important", window.getComputedStyle(r).listStyle, r.style.cssText = e;
@@ -6660,7 +6660,7 @@ function zl(r) {
   if (!e)
     return;
   let n = r.cursorWrapper.dom, i = n.nodeName == "IMG";
-  i ? t.setStart(n.parentNode, V(n) + 1) : t.setStart(n, 0), t.collapse(!0), e.removeAllRanges(), e.addRange(t), !i && !r.state.selection.visible && G && Ce <= 11 && (n.disabled = !0, n.disabled = !1);
+  i ? t.setStart(n.parentNode, V(n) + 1) : t.setStart(n, 0), t.collapse(!0), e.removeAllRanges(), e.addRange(t), !i && !r.state.selection.visible && G && Me <= 11 && (n.disabled = !0, n.disabled = !1);
 }
 function ps(r, e) {
   if (e instanceof S) {
@@ -6954,7 +6954,7 @@ function Qn(r, e) {
     let h = n.firstChild;
     t.push(h.type.name, h.attrs != h.type.defaultAttrs ? h.attrs : null), n = h.content;
   }
-  let o = r.someProp("clipboardSerializer") || $e.fromSchema(r.state.schema), l = Cs(), a = l.createElement("div");
+  let o = r.someProp("clipboardSerializer") || $e.fromSchema(r.state.schema), l = Ms(), a = l.createElement("div");
   a.appendChild(o.serializeFragment(n, { document: l }));
   let c = a.firstChild, f, d = 0;
   for (; c && c.nodeType == 1 && (f = Ss[c.nodeName.toLowerCase()]); ) {
@@ -7090,7 +7090,7 @@ const Ss = {
   th: ["table", "tbody", "tr"]
 };
 let ei = null;
-function Cs() {
+function Ms() {
   return ei || (ei = document.implementation.createHTMLDocument("title"));
 }
 let yn = null;
@@ -7101,7 +7101,7 @@ function Ul(r) {
 function Gl(r) {
   let e = /^(\s*<meta [^>]*>)*/.exec(r);
   e && (r = r.slice(e[0].length));
-  let t = Cs().createElement("div"), n = /<([a-z][^>\s]+)/i.exec(r), i;
+  let t = Ms().createElement("div"), n = /<([a-z][^>\s]+)/i.exec(r), i;
   if ((i = n && Ss[n[1].toLowerCase()]) && (r = i.map((s) => "<" + s + ">").join("") + r + i.map((s) => "</" + s + ">").reverse().join("")), t.innerHTML = Ul(r), i)
     for (let s = 0; s < i.length; s++)
       t = t.querySelector(i[s]) || t;
@@ -7281,18 +7281,18 @@ function ca(r, e, t) {
 function tr(r) {
   return $t(r);
 }
-const Ms = X ? "metaKey" : "ctrlKey";
+const Cs = X ? "metaKey" : "ctrlKey";
 K.mousedown = (r, e) => {
   let t = e;
   r.input.shiftKey = t.shiftKey;
   let n = tr(r), i = Date.now(), s = "singleClick";
-  i - r.input.lastClick.time < 500 && ra(t, r.input.lastClick) && !t[Ms] && (r.input.lastClick.type == "singleClick" ? s = "doubleClick" : r.input.lastClick.type == "doubleClick" && (s = "tripleClick")), r.input.lastClick = { time: i, x: t.clientX, y: t.clientY, type: s };
+  i - r.input.lastClick.time < 500 && ra(t, r.input.lastClick) && !t[Cs] && (r.input.lastClick.type == "singleClick" ? s = "doubleClick" : r.input.lastClick.type == "doubleClick" && (s = "tripleClick")), r.input.lastClick = { time: i, x: t.clientX, y: t.clientY, type: s };
   let o = r.posAtCoords(Qt(t));
   o && (s == "singleClick" ? (r.input.mouseDown && r.input.mouseDown.done(), r.input.mouseDown = new fa(r, o, t, !!n)) : (s == "doubleClick" ? la : aa)(r, o.pos, o.inside, t) ? t.preventDefault() : ke(r, "pointer"));
 };
 class fa {
   constructor(e, t, n, i) {
-    this.view = e, this.pos = t, this.event = n, this.flushed = i, this.delayedSelectionSync = !1, this.mightDrag = null, this.startDoc = e.state.doc, this.selectNode = !!n[Ms], this.allowDefault = n.shiftKey;
+    this.view = e, this.pos = t, this.event = n, this.flushed = i, this.delayedSelectionSync = !1, this.mightDrag = null, this.startDoc = e.state.doc, this.selectNode = !!n[Cs], this.allowDefault = n.shiftKey;
     let s, o;
     if (t.inside > -1)
       s = e.state.doc.nodeAt(t.inside), o = t.inside;
@@ -7423,7 +7423,7 @@ function pa(r, e) {
     t.parentNode && t.parentNode.removeChild(t), r.focus();
   }, 50);
 }
-const pt = G && Ce < 15 || Qe && fl < 604;
+const pt = G && Me < 15 || Qe && fl < 604;
 K.copy = H.cut = (r, e) => {
   let t = e, n = r.state.selection, i = t.type == "cut";
   if (n.empty)
@@ -7530,7 +7530,7 @@ H.drop = (r, e) => {
     c.setSelection(new S(h));
   else {
     let p = c.mapping.map(a);
-    c.mapping.maps[c.mapping.maps.length - 1].forEach((m, g, y, C) => p = C), c.setSelection(Xn(r, h, c.doc.resolve(p)));
+    c.mapping.maps[c.mapping.maps.length - 1].forEach((m, g, y, M) => p = M), c.setSelection(Xn(r, h, c.doc.resolve(p)));
   }
   r.focus(), r.dispatch(c.setMeta("uiEvent", "drop"));
 };
@@ -7699,7 +7699,7 @@ class ee {
   }
 }
 const Ke = [], Be = {};
-class v {
+class R {
   /**
   @internal
   */
@@ -7753,7 +7753,7 @@ class v {
       let a = this.local[l].map(e, n, i);
       a && a.type.valid(t, a) ? (o || (o = [])).push(a) : s.onRemove && s.onRemove(this.local[l].spec);
     }
-    return this.children.length ? ya(this.children, o || [], e, t, n, i, s) : o ? new v(o.sort(ze), Ke) : $;
+    return this.children.length ? ya(this.children, o || [], e, t, n, i, s) : o ? new R(o.sort(ze), Ke) : $;
   }
   /**
   Add the given array of decorations to the ones in the set,
@@ -7762,7 +7762,7 @@ class v {
   structure.
   */
   add(e, t) {
-    return t.length ? this == $ ? v.create(e, t) : this.addInner(e, t, 0) : this;
+    return t.length ? this == $ ? R.create(e, t) : this.addInner(e, t, 0) : this;
   }
   addInner(e, t, n) {
     let i, s = 0;
@@ -7774,10 +7774,10 @@ class v {
         i[s] == a ? i[s + 2] = i[s + 2].addInner(l, f, c + 1) : i.splice(s, 0, a, a + l.nodeSize, Jt(f, l, c + 1, Be)), s += 3;
       }
     });
-    let o = As(s ? Rs(t) : t, -n);
+    let o = As(s ? vs(t) : t, -n);
     for (let l = 0; l < o.length; l++)
       o[l].type.valid(e, o[l]) || o.splice(l--, 1);
-    return new v(o.length ? this.local.concat(o).sort(ze) : this.local, i || this.children);
+    return new R(o.length ? this.local.concat(o).sort(ze) : this.local, i || this.children);
   }
   /**
   Create a new set that contains the decorations in this set, minus
@@ -7804,13 +7804,13 @@ class v {
           for (let l = 0; l < i.length; l++)
             i[l].eq(o, t) && (i == this.local && (i = this.local.slice()), i.splice(l--, 1));
     }
-    return n == this.children && i == this.local ? this : i.length || n.length ? new v(i, n) : $;
+    return n == this.children && i == this.local ? this : i.length || n.length ? new R(i, n) : $;
   }
   forChild(e, t) {
     if (this == $)
       return this;
     if (t.isLeaf)
-      return v.empty;
+      return R.empty;
     let n, i;
     for (let l = 0; l < this.children.length; l += 3)
       if (this.children[l] >= e) {
@@ -7826,7 +7826,7 @@ class v {
       }
     }
     if (i) {
-      let l = new v(i.sort(ze), Ke);
+      let l = new R(i.sort(ze), Ke);
       return n ? new ge([l, n]) : l;
     }
     return n || $;
@@ -7837,7 +7837,7 @@ class v {
   eq(e) {
     if (this == e)
       return !0;
-    if (!(e instanceof v) || this.local.length != e.local.length || this.children.length != e.children.length)
+    if (!(e instanceof R) || this.local.length != e.local.length || this.children.length != e.children.length)
       return !1;
     for (let t = 0; t < this.local.length; t++)
       if (!this.local[t].eq(e.local[t]))
@@ -7870,9 +7870,9 @@ class v {
     e(this);
   }
 }
-v.empty = new v([], []);
-v.removeOverlap = rr;
-const $ = v.empty;
+R.empty = new R([], []);
+R.removeOverlap = rr;
+const $ = R.empty;
 class ge {
   constructor(e) {
     this.members = e;
@@ -7883,7 +7883,7 @@ class ge {
   }
   forChild(e, t) {
     if (t.isLeaf)
-      return v.empty;
+      return R.empty;
     let n = [];
     for (let i = 0; i < this.members.length; i++) {
       let s = this.members[i].forChild(e, t);
@@ -7923,7 +7923,7 @@ class ge {
       case 1:
         return e[0];
       default:
-        return new ge(e.every((t) => t instanceof v) ? e : e.reduce((t, n) => t.concat(n instanceof v ? n : n.members), []));
+        return new ge(e.every((t) => t instanceof R) ? e : e.reduce((t, n) => t.concat(n instanceof R ? n : n.members), []));
     }
   }
   forEachSet(e) {
@@ -7938,11 +7938,11 @@ function ya(r, e, t, n, i, s, o) {
     t.maps[c].forEach((u, h, p, m) => {
       let g = m - p - (h - u);
       for (let y = 0; y < l.length; y += 3) {
-        let C = l[y + 1];
-        if (C < 0 || u > C + f - d)
+        let M = l[y + 1];
+        if (M < 0 || u > M + f - d)
           continue;
-        let M = l[y] + f - d;
-        h >= M ? l[y + 1] = u <= M ? -2 : -1 : u >= f && g && (l[y] += g, l[y + 1] += g);
+        let C = l[y] + f - d;
+        h >= C ? l[y + 1] = u <= C ? -2 : -1 : u >= f && g && (l[y] += g, l[y + 1] += g);
       }
       d += g;
     }), f = t.maps[c].map(f, -1);
@@ -7978,7 +7978,7 @@ function ya(r, e, t, n, i, s, o) {
       l.splice(u, 0, f.children[d], f.children[d + 1], f.children[d + 2]);
     }
   }
-  return new v(e.sort(ze), l);
+  return new R(e.sort(ze), l);
 }
 function As(r, e) {
   if (!e || !r.length)
@@ -8011,7 +8011,7 @@ function Is(r, e, t) {
     (o = r[s]) && o.from > t && o.to < n && ((i || (i = [])).push(o), r[s] = null);
   return i;
 }
-function Rs(r) {
+function vs(r) {
   let e = [];
   for (let t = 0; t < r.length; t++)
     r[t] != null && e.push(r[t]);
@@ -8027,10 +8027,10 @@ function Jt(r, e, t, n) {
       f != $ && i.push(a, a + l.nodeSize, f);
     }
   });
-  let o = As(s ? Rs(r) : r, -t).sort(ze);
+  let o = As(s ? vs(r) : r, -t).sort(ze);
   for (let l = 0; l < o.length; l++)
     o[l].type.valid(e, o[l]) || (n.onRemove && n.onRemove(o[l].spec), o.splice(l--, 1));
-  return o.length || i.length ? new v(o, i) : $;
+  return o.length || i.length ? new R(o, i) : $;
 }
 function ze(r, e) {
   return r.from - e.from || r.to - e.to;
@@ -8063,7 +8063,7 @@ function bn(r) {
   return r.someProp("decorations", (t) => {
     let n = t(r.state);
     n && n != $ && e.push(n);
-  }), r.cursorWrapper && e.push(v.create(r.state.doc, [r.cursorWrapper.deco])), ge.from(e);
+  }), r.cursorWrapper && e.push(R.create(r.state.doc, [r.cursorWrapper.deco])), ge.from(e);
 }
 const ka = {
   childList: !0,
@@ -8072,7 +8072,7 @@ const ka = {
   attributes: !0,
   attributeOldValue: !0,
   subtree: !0
-}, xa = G && Ce <= 11;
+}, xa = G && Me <= 11;
 class Sa {
   constructor() {
     this.anchorNode = null, this.anchorOffset = 0, this.focusNode = null, this.focusOffset = 0;
@@ -8087,12 +8087,12 @@ class Sa {
     return e.anchorNode == this.anchorNode && e.anchorOffset == this.anchorOffset && e.focusNode == this.focusNode && e.focusOffset == this.focusOffset;
   }
 }
-class Ca {
+class Ma {
   constructor(e, t) {
     this.view = e, this.handleDOMChange = t, this.queue = [], this.flushingSoon = -1, this.observer = null, this.currentSelection = new Sa(), this.onCharData = null, this.suppressingSelectionUpdates = !1, this.lastChangedTextNode = null, this.observer = window.MutationObserver && new window.MutationObserver((n) => {
       for (let i = 0; i < n.length; i++)
         this.queue.push(n[i]);
-      G && Ce <= 11 && n.some((i) => i.type == "childList" && i.removedNodes.length || i.type == "characterData" && i.oldValue.length > i.target.nodeValue.length) ? this.flushSoon() : this.flush();
+      G && Me <= 11 && n.some((i) => i.type == "childList" && i.removedNodes.length || i.type == "characterData" && i.oldValue.length > i.target.nodeValue.length) ? this.flushSoon() : this.flush();
     }), xa && (this.onCharData = (n) => {
       this.queue.push({ target: n.target, type: "characterData", oldValue: n.prevValue }), this.flushSoon();
     }), this.onSelectionChange = this.onSelectionChange.bind(this);
@@ -8133,7 +8133,7 @@ class Ca {
     if (Ur(this.view)) {
       if (this.suppressingSelectionUpdates)
         return ue(this.view);
-      if (G && Ce <= 11 && !this.view.state.selection.empty) {
+      if (G && Me <= 11 && !this.view.state.selection.empty) {
         let e = this.view.domSelectionRange();
         if (e.focusNode && Ve(e.focusNode, e.focusOffset, e.anchorNode, e.anchorOffset))
           return this.flushSoon();
@@ -8194,7 +8194,7 @@ class Ca {
       }
     }
     let c = null;
-    s < 0 && i && e.input.lastFocus > Date.now() - 200 && Math.max(e.input.lastTouch, e.input.lastClick.time) < Date.now() - 300 && _t(n) && (c = _n(e)) && c.eq(N.near(e.state.doc.resolve(0), 1)) ? (e.input.lastFocus = 0, ue(e), this.currentSelection.set(n)) : (s > -1 || i) && (s > -1 && (e.docView.markDirty(s, o), Ma(e)), this.handleDOMChange(s, o, l, a), e.docView && e.docView.dirty ? e.updateState(e.state) : this.currentSelection.eq(n) || ue(e), this.currentSelection.set(n));
+    s < 0 && i && e.input.lastFocus > Date.now() - 200 && Math.max(e.input.lastTouch, e.input.lastClick.time) < Date.now() - 300 && _t(n) && (c = _n(e)) && c.eq(N.near(e.state.doc.resolve(0), 1)) ? (e.input.lastFocus = 0, ue(e), this.currentSelection.set(n)) : (s > -1 || i) && (s > -1 && (e.docView.markDirty(s, o), Ca(e)), this.handleDOMChange(s, o, l, a), e.docView && e.docView.dirty ? e.updateState(e.state) : this.currentSelection.eq(n) || ue(e), this.currentSelection.set(n));
   }
   registerMutation(e, t) {
     if (t.indexOf(e.target) > -1)
@@ -8211,7 +8211,7 @@ class Ca {
       if (n.contentDOM && n.contentDOM != n.dom && !n.contentDOM.contains(e.target))
         return { from: n.posBefore, to: n.posAfter };
       let i = e.previousSibling, s = e.nextSibling;
-      if (G && Ce <= 11 && e.addedNodes.length)
+      if (G && Me <= 11 && e.addedNodes.length)
         for (let f = 0; f < e.addedNodes.length; f++) {
           let { previousSibling: d, nextSibling: u } = e.addedNodes[f];
           (!d || Array.prototype.indexOf.call(e.addedNodes, d) < 0) && (i = d), (!u || Array.prototype.indexOf.call(e.addedNodes, u) < 0) && (s = u);
@@ -8230,7 +8230,7 @@ class Ca {
   }
 }
 let ni = /* @__PURE__ */ new WeakMap(), ri = !1;
-function Ma(r) {
+function Ca(r) {
   if (!ni.has(r) && (ni.set(r, null), ["normal", "nowrap", "pre-line"].indexOf(getComputedStyle(r.dom).whiteSpace) !== -1)) {
     if (r.requiresGeckoHackNode = te, ri)
       return;
@@ -8265,12 +8265,12 @@ function Na(r, e, t) {
   let { node: n, fromOffset: i, toOffset: s, from: o, to: l } = r.docView.parseRange(e, t), a = r.domSelectionRange(), c, f = a.anchorNode;
   if (f && r.dom.contains(f.nodeType == 1 ? f : f.parentNode) && (c = [{ node: f, offset: a.anchorOffset }], _t(a) || c.push({ node: a.focusNode, offset: a.focusOffset })), W && r.input.lastKeyCode === 8)
     for (let g = s; g > i; g--) {
-      let y = n.childNodes[g - 1], C = y.pmViewDesc;
-      if (y.nodeName == "BR" && !C) {
+      let y = n.childNodes[g - 1], M = y.pmViewDesc;
+      if (y.nodeName == "BR" && !M) {
         s = g;
         break;
       }
-      if (!C || C.size)
+      if (!M || M.size)
         break;
     }
   let d = r.state.doc, u = r.someProp("domParser") || Se.fromSchema(r.state.schema), h = d.resolve(o), p = null, m = u.parse(n, {
@@ -8312,8 +8312,8 @@ function Da(r, e, t, n, i) {
     if (he && !r.state.selection.eq(he)) {
       if (W && ce && r.input.lastKeyCode === 13 && Date.now() - 100 < r.input.lastKeyCodeTime && r.someProp("handleKeyDown", (io) => io(r, De(13, "Enter"))))
         return;
-      let Ct = r.state.tr.setSelection(he);
-      T == "pointer" ? Ct.setMeta("pointer", !0) : T == "key" && Ct.scrollIntoView(), s && Ct.setMeta("composition", s), r.dispatch(Ct);
+      let Mt = r.state.tr.setSelection(he);
+      T == "pointer" ? Mt.setMeta("pointer", !0) : T == "key" && Mt.scrollIntoView(), s && Mt.setMeta("composition", s), r.dispatch(Mt);
     }
     return;
   }
@@ -8321,7 +8321,7 @@ function Da(r, e, t, n, i) {
   e = o.before(l + 1), t = r.state.doc.resolve(t).after(l + 1);
   let a = r.state.selection, c = Na(r, e, t), f = r.state.doc, d = f.slice(c.from, c.to), u, h;
   r.input.lastKeyCode === 8 && Date.now() - 100 < r.input.lastKeyCodeTime ? (u = r.state.selection.to, h = "end") : (u = r.state.selection.from, h = "start"), r.input.lastKeyCode = null;
-  let p = Ra(d.content, c.doc.content, c.from, u, h);
+  let p = va(d.content, c.doc.content, c.from, u, h);
   if (p && r.input.domChangeCount++, (Qe && r.input.lastIOSEnter > Date.now() - 225 || ce) && i.some((T) => T.nodeType == 1 && !Ea.test(T.nodeName)) && (!p || p.endA >= p.endB) && r.someProp("handleKeyDown", (T) => T(r, De(13, "Enter")))) {
     r.input.lastIOSEnter = 0;
     return;
@@ -8339,9 +8339,9 @@ function Da(r, e, t, n, i) {
       }
       return;
     }
-  r.state.selection.from < r.state.selection.to && p.start == p.endB && r.state.selection instanceof O && (p.start > r.state.selection.from && p.start <= r.state.selection.from + 2 && r.state.selection.from >= c.from ? p.start = r.state.selection.from : p.endA < r.state.selection.to && p.endA >= r.state.selection.to - 2 && r.state.selection.to <= c.to && (p.endB += r.state.selection.to - p.endA, p.endA = r.state.selection.to)), G && Ce <= 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 m = c.doc.resolveNoCache(p.start - c.from), g = c.doc.resolveNoCache(p.endB - c.from), y = f.resolve(p.start), C = m.sameParent(g) && m.parent.inlineContent && y.end() >= p.endA, M;
-  if ((Qe && r.input.lastIOSEnter > Date.now() - 225 && (!C || i.some((T) => T.nodeName == "DIV" || T.nodeName == "P")) || !C && m.pos < c.doc.content.size && !m.sameParent(g) && (M = N.findFrom(c.doc.resolve(m.pos + 1), 1, !0)) && M.head == g.pos) && r.someProp("handleKeyDown", (T) => T(r, De(13, "Enter")))) {
+  r.state.selection.from < r.state.selection.to && p.start == p.endB && r.state.selection instanceof O && (p.start > r.state.selection.from && p.start <= r.state.selection.from + 2 && r.state.selection.from >= c.from ? p.start = r.state.selection.from : p.endA < r.state.selection.to && p.endA >= r.state.selection.to - 2 && r.state.selection.to <= c.to && (p.endB += r.state.selection.to - p.endA, p.endA = r.state.selection.to)), G && Me <= 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 m = c.doc.resolveNoCache(p.start - c.from), g = c.doc.resolveNoCache(p.endB - c.from), y = f.resolve(p.start), M = m.sameParent(g) && m.parent.inlineContent && y.end() >= p.endA, C;
+  if ((Qe && r.input.lastIOSEnter > Date.now() - 225 && (!M || i.some((T) => T.nodeName == "DIV" || T.nodeName == "P")) || !M && m.pos < c.doc.content.size && !m.sameParent(g) && (C = N.findFrom(c.doc.resolve(m.pos + 1), 1, !0)) && C.head == g.pos) && r.someProp("handleKeyDown", (T) => T(r, De(13, "Enter")))) {
     r.input.lastIOSEnter = 0;
     return;
   }
@@ -8349,15 +8349,15 @@ function Da(r, e, t, n, i) {
     ce && W && r.domObserver.suppressSelectionUpdates();
     return;
   }
-  W && p.endB == p.start && (r.input.lastChromeDelete = Date.now()), ce && !C && m.start() != g.start() && g.parentOffset == 0 && m.depth == g.depth && c.sel && c.sel.anchor == c.sel.head && c.sel.head == p.endA && (p.endB -= 2, g = c.doc.resolveNoCache(p.endB - c.from), setTimeout(() => {
+  W && p.endB == p.start && (r.input.lastChromeDelete = Date.now()), ce && !M && m.start() != g.start() && g.parentOffset == 0 && m.depth == g.depth && c.sel && c.sel.anchor == c.sel.head && c.sel.head == p.endA && (p.endB -= 2, g = c.doc.resolveNoCache(p.endB - c.from), setTimeout(() => {
     r.someProp("handleKeyDown", function(T) {
       return T(r, De(13, "Enter"));
     });
   }, 20));
   let D = p.start, E = p.endA, A, U, j;
-  if (C) {
+  if (M) {
     if (m.pos == g.pos)
-      G && Ce <= 11 && m.parentOffset == 0 && (r.domObserver.suppressSelectionUpdates(), setTimeout(() => ue(r), 20)), A = r.state.tr.delete(D, E), U = f.resolve(p.start).marksAcross(f.resolve(p.endA));
+      G && Me <= 11 && m.parentOffset == 0 && (r.domObserver.suppressSelectionUpdates(), setTimeout(() => ue(r), 20)), A = r.state.tr.delete(D, E), U = f.resolve(p.start).marksAcross(f.resolve(p.endA));
     else if (
       // Adding or removing a mark
       p.endA == p.endB && (j = Aa(m.parent.content.cut(m.parentOffset, g.parentOffset), y.parent.content.cut(y.parentOffset, p.endA - y.start())))
@@ -8425,7 +8425,7 @@ function kn(r, e, t) {
   }
   return i;
 }
-function Ra(r, e, t, n, i) {
+function va(r, e, t, n, i) {
   let s = r.findDiffStart(e, t);
   if (s == null)
     return null;
@@ -8449,7 +8449,7 @@ function oi(r) {
   let e = r.charCodeAt(0), t = r.charCodeAt(1);
   return e >= 56320 && e <= 57343 && t >= 55296 && t <= 56319;
 }
-class va {
+class Ra {
   /**
   Create a view. `place` may be a DOM node that the editor should
   be appended to, a function that will place it into the document,
@@ -8458,7 +8458,7 @@ class va {
   added to the document.
   */
   constructor(e, t) {
-    this._root = null, this.focused = !1, this.trackWrites = null, this.mounted = !1, this.markCursor = null, this.cursorWrapper = null, this.lastSelectedViewDesc = void 0, this.input = new Ql(), this.prevDirectPlugins = [], this.pluginViews = [], this.requiresGeckoHackNode = !1, this.dragging = null, this._props = t, this.state = t.state, this.directPlugins = t.plugins || [], this.directPlugins.forEach(di), this.dispatch = this.dispatch.bind(this), this.dom = e && e.mount || document.createElement("div"), e && (e.appendChild ? e.appendChild(this.dom) : typeof e == "function" ? e(this.dom) : e.mount && (this.mounted = !0)), this.editable = ci(this), ai(this), this.nodeViews = fi(this), this.docView = Wr(this.state.doc, li(this), bn(this), this.dom, this), this.domObserver = new Ca(this, (n, i, s, o) => Da(this, n, i, s, o)), this.domObserver.start(), Zl(this), this.updatePluginViews();
+    this._root = null, this.focused = !1, this.trackWrites = null, this.mounted = !1, this.markCursor = null, this.cursorWrapper = null, this.lastSelectedViewDesc = void 0, this.input = new Ql(), this.prevDirectPlugins = [], this.pluginViews = [], this.requiresGeckoHackNode = !1, this.dragging = null, this._props = t, this.state = t.state, this.directPlugins = t.plugins || [], this.directPlugins.forEach(di), this.dispatch = this.dispatch.bind(this), this.dom = e && e.mount || document.createElement("div"), e && (e.appendChild ? e.appendChild(this.dom) : typeof e == "function" ? e(this.dom) : e.mount && (this.mounted = !0)), this.editable = ci(this), ai(this), this.nodeViews = fi(this), this.docView = Wr(this.state.doc, li(this), bn(this), this.dom, this), this.domObserver = new Ma(this, (n, i, s, o) => Da(this, n, i, s, o)), this.domObserver.start(), Zl(this), this.updatePluginViews();
   }
   /**
   Holds `true` when a
@@ -8983,12 +8983,12 @@ function ja(r) {
   };
 }
 const ir = (r, e) => r.selection.empty ? !1 : (e && e(r.tr.deleteSelection().scrollIntoView()), !0);
-function vs(r, e) {
+function Rs(r, e) {
   let { $cursor: t } = r.selection;
   return !t || (e ? !e.endOfTextblock("backward", r) : t.parentOffset > 0) ? null : t;
 }
 const Ps = (r, e, t) => {
-  let n = vs(r, t);
+  let n = Rs(r, t);
   if (!n)
     return !1;
   let i = sr(n);
@@ -9014,7 +9014,7 @@ const Ps = (r, e, t) => {
     }
   return s.isAtom && i.depth == n.depth - 1 ? (e && e(r.tr.delete(i.pos - s.nodeSize, i.pos).scrollIntoView()), !0) : !1;
 }, qa = (r, e, t) => {
-  let n = vs(r, t);
+  let n = Rs(r, t);
   if (!n)
     return !1;
   let i = sr(n);
@@ -9271,10 +9271,10 @@ function js(r, e, t, n) {
     if (h.canReplace(h.childCount, h.childCount, m.content)) {
       if (t) {
         let y = b.empty;
-        for (let M = p.length - 1; M >= 0; M--)
-          y = b.from(p[M].copy(y));
-        let C = r.tr.step(new B(e.pos - p.length, e.pos + s.nodeSize, e.pos + g, e.pos + s.nodeSize - g, new k(y, p.length, 0), 0, !0));
-        t(C.scrollIntoView());
+        for (let C = p.length - 1; C >= 0; C--)
+          y = b.from(p[C].copy(y));
+        let M = r.tr.step(new B(e.pos - p.length, e.pos + s.nodeSize, e.pos + g, e.pos + s.nodeSize - g, new k(y, p.length, 0), 0, !0));
+        t(M.scrollIntoView());
       }
       return !0;
     }
@@ -9681,11 +9681,11 @@ function pc(r, e) {
       options: c.options,
       storage: c.storage,
       editor: e
-    }, u = r.reduce((y, C) => {
-      const M = x(C, "extendNodeSchema", d);
+    }, u = r.reduce((y, M) => {
+      const C = x(M, "extendNodeSchema", d);
       return {
         ...y,
-        ...M ? M(c) : {}
+        ...C ? C(c) : {}
       };
     }, {}), h = pi({
       ...u,
@@ -9702,8 +9702,8 @@ function pc(r, e) {
       defining: w(x(c, "defining", d)),
       isolating: w(x(c, "isolating", d)),
       attrs: Object.fromEntries(f.map((y) => {
-        var C;
-        return [y.name, { default: (C = y == null ? void 0 : y.attribute) === null || C === void 0 ? void 0 : C.default }];
+        var M;
+        return [y.name, { default: (M = y == null ? void 0 : y.attribute) === null || M === void 0 ? void 0 : M.default }];
       }))
     }), p = w(x(c, "parseHTML", d));
     p && (h.parseDOM = p.map((y) => hi(y, f)));
@@ -9721,10 +9721,10 @@ function pc(r, e) {
       storage: c.storage,
       editor: e
     }, u = r.reduce((g, y) => {
-      const C = x(y, "extendMarkSchema", d);
+      const M = x(y, "extendMarkSchema", d);
       return {
         ...g,
-        ...C ? C(c) : {}
+        ...M ? M(c) : {}
       };
     }, {}), h = pi({
       ...u,
@@ -9751,7 +9751,7 @@ function pc(r, e) {
     marks: a
   });
 }
-function Cn(r, e) {
+function Mn(r, e) {
   return e.nodes[r] || e.marks[r] || null;
 }
 function mi(r, e) {
@@ -9817,7 +9817,7 @@ function Nt(r) {
     }), g = {
       from: n - (h[0].length - s.length),
       to: i
-    }, { commands: y, chain: C, can: M } = new en({
+    }, { commands: y, chain: M, can: C } = new en({
       editor: t,
       state: m
     });
@@ -9826,8 +9826,8 @@ function Nt(r) {
       range: g,
       match: h,
       commands: y,
-      chain: C,
-      can: M
+      chain: M,
+      can: C
     }) === null || !p.steps.length || (p.setMeta(l, {
       transform: p,
       from: n,
@@ -9992,16 +9992,16 @@ function Sc(r) {
     if (!h.isTextblock || h.type.spec.code)
       return;
     const m = Math.max(n, p), g = Math.min(i, p + h.content.size), y = h.textBetween(m - p, g - p, void 0, "");
-    xc(y, s.find, o).forEach((M) => {
-      if (M.index === void 0)
+    xc(y, s.find, o).forEach((C) => {
+      if (C.index === void 0)
         return;
-      const D = m + M.index + 1, E = D + M[0].length, A = {
+      const D = m + C.index + 1, E = D + C[0].length, A = {
         from: t.tr.mapping.map(D),
         to: t.tr.mapping.map(E)
       }, U = s.handler({
         state: t,
         range: A,
-        match: M,
+        match: C,
         commands: a,
         chain: c,
         can: f,
@@ -10013,14 +10013,14 @@ function Sc(r) {
   }), d.every((h) => h !== null);
 }
 let Et = null;
-const Cc = (r) => {
+const Mc = (r) => {
   var e;
   const t = new ClipboardEvent("paste", {
     clipboardData: new DataTransfer()
   });
   return (e = t.clipboardData) === null || e === void 0 || e.setData("text/html", r), t;
 };
-function Mc(r) {
+function Cc(r) {
   const { editor: e, rules: t } = r;
   let n = null, i = !1, s = !1, o = typeof ClipboardEvent < "u" ? new ClipboardEvent("paste") : null, l;
   try {
@@ -10070,7 +10070,7 @@ function Mc(r) {
         drop: (d, u) => {
           if (s = n === d.dom.parentElement, l = u, !s) {
             const h = Et;
-            h && setTimeout(() => {
+            h != null && h.isEditable && setTimeout(() => {
               const p = h.state.selection;
               p && h.commands.deleteRange({ from: p.from, to: p.to });
             }, 10);
@@ -10085,13 +10085,13 @@ function Mc(r) {
       }
     },
     appendTransaction: (d, u, h) => {
-      const p = d[0], m = p.getMeta("uiEvent") === "paste" && !i, g = p.getMeta("uiEvent") === "drop" && !s, y = p.getMeta("applyPasteRules"), C = !!y;
-      if (!m && !g && !C)
+      const p = d[0], m = p.getMeta("uiEvent") === "paste" && !i, g = p.getMeta("uiEvent") === "drop" && !s, y = p.getMeta("applyPasteRules"), M = !!y;
+      if (!m && !g && !M)
         return;
-      if (C) {
+      if (M) {
         let { text: E } = y;
         typeof E == "string" ? E = E : E = cr(b.from(E), h.schema);
-        const { from: A } = y, U = A + E.length, j = Cc(E);
+        const { from: A } = y, U = A + E.length, j = Mc(E);
         return a({
           rule: f,
           state: h,
@@ -10100,12 +10100,12 @@ function Mc(r) {
           pasteEvt: j
         });
       }
-      const M = u.doc.content.findDiffStart(h.doc.content), D = u.doc.content.findDiffEnd(h.doc.content);
-      if (!(!kc(M) || !D || M === D.b))
+      const C = u.doc.content.findDiffStart(h.doc.content), D = u.doc.content.findDiffEnd(h.doc.content);
+      if (!(!kc(C) || !D || C === D.b))
         return a({
           rule: f,
           state: h,
-          from: M,
+          from: C,
           to: D,
           pasteEvt: o
         });
@@ -10167,7 +10167,7 @@ class Ue {
         options: t.options,
         storage: t.storage,
         editor: this.editor,
-        type: Cn(t.name, this.schema)
+        type: Mn(t.name, this.schema)
       }, i = x(t, "addCommands", n);
       return i ? {
         ...e,
@@ -10186,7 +10186,7 @@ class Ue {
         options: o.options,
         storage: o.storage,
         editor: e,
-        type: Cn(o.name, this.schema)
+        type: Mn(o.name, this.schema)
       }, a = [], c = x(o, "addKeyboardShortcuts", l);
       let f = {};
       if (o.type === "mark" && x(o, "exitable", l) && (f.ArrowRight = () => qt.handleExit({ editor: e, mark: o })), c) {
@@ -10211,7 +10211,7 @@ class Ue {
         editor: e,
         rules: n
       }),
-      ...Mc({
+      ...Cc({
         editor: e,
         rules: i
       }),
@@ -10272,7 +10272,7 @@ class Ue {
         options: e.options,
         storage: e.storage,
         editor: this.editor,
-        type: Cn(e.name, this.schema)
+        type: Mn(e.name, this.schema)
       };
       e.type === "mark" && (!((t = w(x(e, "keepOnSplit", n))) !== null && t !== void 0) || t) && this.splittableMarks.push(e.name);
       const i = x(e, "onBeforeCreate", n), s = x(e, "onCreate", n), o = x(e, "onUpdate", n), l = x(e, "onSelectionUpdate", n), a = x(e, "onTransaction", n), c = x(e, "onFocus", n), f = x(e, "onBlur", n), d = x(e, "onDestroy", n);
@@ -10385,8 +10385,8 @@ const Oc = ne.create({
   const { state: i } = t, s = i.doc.slice(r.from, r.to);
   n.deleteRange(r.from, r.to);
   const o = n.mapping.map(e);
-  return n.insert(o, s.content), n.setSelection(new O(n.doc.resolve(o - 1))), !0;
-}, Rc = () => ({ tr: r, dispatch: e }) => {
+  return n.insert(o, s.content), n.setSelection(new O(n.doc.resolve(Math.max(o - 1, 0)))), !0;
+}, vc = () => ({ tr: r, dispatch: e }) => {
   const { selection: t } = r, n = t.$anchor.node();
   if (n.content.size > 0)
     return !1;
@@ -10400,7 +10400,7 @@ const Oc = ne.create({
       return !0;
     }
   return !1;
-}, vc = (r) => ({ tr: e, state: t, dispatch: n }) => {
+}, Rc = (r) => ({ tr: e, state: t, dispatch: n }) => {
   const i = z(r, t.schema), s = e.selection.$anchor;
   for (let o = s.depth; o > 0; o -= 1)
     if (s.node(o).type === i) {
@@ -10852,7 +10852,7 @@ function Sf(r, e = JSON.stringify) {
     return Object.prototype.hasOwnProperty.call(t, i) ? !1 : t[i] = !0;
   });
 }
-function Cf(r) {
+function Mf(r) {
   const e = Sf(r);
   return e.length === 1 ? e : e.filter((t, n) => !e.filter((s, o) => o !== n).some((s) => t.oldRange.from >= s.oldRange.from && t.oldRange.to <= s.oldRange.to && t.newRange.from >= s.newRange.from && t.newRange.to <= s.newRange.to));
 }
@@ -10883,7 +10883,7 @@ function nd(r) {
         }
       });
     });
-  }), Cf(n);
+  }), Mf(n);
 }
 function ro(r, e, t) {
   const n = [];
@@ -10901,7 +10901,7 @@ function ro(r, e, t) {
     })));
   }), n;
 }
-function Rt(r, e, t) {
+function vt(r, e, t) {
   return Object.fromEntries(Object.entries(t).filter(([n]) => {
     const i = r.find((s) => s.type === e && s.name === n);
     return i ? i.attribute.keepOnSplit : !1;
@@ -10918,11 +10918,11 @@ function jn(r, e, t = {}) {
     r.doc.nodesBetween(h, p, (m, g) => {
       if (!m.isText && !m.marks.length)
         return;
-      const y = Math.max(h, g), C = Math.min(p, g + m.nodeSize), M = C - y;
-      o += M, l.push(...m.marks.map((D) => ({
+      const y = Math.max(h, g), M = Math.min(p, g + m.nodeSize), C = M - y;
+      o += C, l.push(...m.marks.map((D) => ({
         mark: D,
         from: y,
-        to: C
+        to: M
       })));
     });
   }), o === 0)
@@ -10930,7 +10930,7 @@ function jn(r, e, t = {}) {
   const a = l.filter((d) => s ? s.name === d.mark.type.name : !0).filter((d) => Kt(d.mark.attrs, t, { strict: !1 })).reduce((d, u) => d + u.to - u.from, 0), c = l.filter((d) => s ? d.mark.type !== s && d.mark.type.excludes(s) : !0).reduce((d, u) => d + u.to - u.from, 0);
   return (a > 0 ? a + c : a) >= o;
 }
-function Mf(r, e, t = {}) {
+function Cf(r, e, t = {}) {
   if (!e)
     return bt(r, null, t) || jn(r, null, t);
   const n = on(e, r.schema);
@@ -11061,7 +11061,7 @@ function ki(r, e) {
   }
 }
 const If = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, editor: i }) => {
-  const { selection: s, doc: o } = e, { $from: l, $to: a } = s, c = i.extensionManager.attributes, f = Rt(c, l.node().type.name, l.node().attrs);
+  const { selection: s, doc: o } = e, { $from: l, $to: a } = s, c = i.extensionManager.attributes, f = vt(c, l.node().type.name, l.node().attrs);
   if (s instanceof S && s.node.isBlock)
     return !l.parentOffset || !de(o, l.pos) ? !1 : (n && (r && ki(t, i.extensionManager.splittableMarks), e.split(l.pos).scrollIntoView()), !0);
   if (!l.parent.isBlock)
@@ -11086,7 +11086,7 @@ const If = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
     r && ki(t, i.extensionManager.splittableMarks), e.scrollIntoView();
   }
   return p;
-}, Rf = (r, e = {}) => ({ tr: t, state: n, dispatch: i, editor: s }) => {
+}, vf = (r, e = {}) => ({ tr: t, state: n, dispatch: i, editor: s }) => {
   var o;
   const l = z(r, n.schema), { $from: a, $to: c } = n.selection, f = n.selection.node;
   if (f && f.isBlock || a.depth < 2 || !a.sameParent(c))
@@ -11100,16 +11100,16 @@ const If = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
       return !1;
     if (i) {
       let y = b.empty;
-      const C = a.index(-1) ? 1 : a.index(-2) ? 2 : 3;
-      for (let j = a.depth - C; j >= a.depth - 3; j -= 1)
+      const M = a.index(-1) ? 1 : a.index(-2) ? 2 : 3;
+      for (let j = a.depth - M; j >= a.depth - 3; j -= 1)
         y = b.from(a.node(j).copy(y));
-      const M = a.indexAfter(-1) < a.node(-2).childCount ? 1 : a.indexAfter(-2) < a.node(-3).childCount ? 2 : 3, D = {
-        ...Rt(u, a.node().type.name, a.node().attrs),
+      const C = a.indexAfter(-1) < a.node(-2).childCount ? 1 : a.indexAfter(-2) < a.node(-3).childCount ? 2 : 3, D = {
+        ...vt(u, a.node().type.name, a.node().attrs),
         ...e
       }, E = ((o = l.contentMatch.defaultType) === null || o === void 0 ? void 0 : o.createAndFill(D)) || void 0;
       y = y.append(b.from(l.createAndFill(null, E) || void 0));
-      const A = a.before(a.depth - (C - 1));
-      t.replace(A, a.after(-M), new k(y, 4 - C, 0));
+      const A = a.before(a.depth - (M - 1));
+      t.replace(A, a.after(-C), new k(y, 4 - M, 0));
       let U = -1;
       t.doc.nodesBetween(A, t.doc.content.size, (j, T) => {
         if (U > -1)
@@ -11120,10 +11120,10 @@ const If = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
     return !0;
   }
   const h = c.pos === a.end() ? d.contentMatchAt(0).defaultType : null, p = {
-    ...Rt(u, d.type.name, d.attrs),
+    ...vt(u, d.type.name, d.attrs),
     ...e
   }, m = {
-    ...Rt(u, a.node().type.name, a.node().attrs),
+    ...vt(u, a.node().type.name, a.node().attrs),
     ...e
   };
   t.delete(a.pos, c.pos);
@@ -11134,14 +11134,14 @@ const If = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
   if (!de(t.doc, a.pos, 2))
     return !1;
   if (i) {
-    const { selection: y, storedMarks: C } = n, { splittableMarks: M } = s.extensionManager, D = C || y.$to.parentOffset && y.$from.marks();
+    const { selection: y, storedMarks: M } = n, { splittableMarks: C } = s.extensionManager, D = M || y.$to.parentOffset && y.$from.marks();
     if (t.split(a.pos, 2, g).scrollIntoView(), !D || !i)
       return !0;
-    const E = D.filter((A) => M.includes(A.type.name));
+    const E = D.filter((A) => C.includes(A.type.name));
     t.ensureMarks(E);
   }
   return !0;
-}, Mn = (r, e) => {
+}, Cn = (r, e) => {
   const t = ur((o) => o.type === e)(r.selection);
   if (!t)
     return !0;
@@ -11159,21 +11159,21 @@ const If = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
     return !0;
   const i = r.doc.nodeAt(n);
   return t.node.type === (i == null ? void 0 : i.type) && Ne(r.doc, n) && r.join(n), !0;
-}, vf = (r, e, t, n = {}) => ({ editor: i, tr: s, state: o, dispatch: l, chain: a, commands: c, can: f }) => {
-  const { extensions: d, splittableMarks: u } = i.extensionManager, h = z(r, o.schema), p = z(e, o.schema), { selection: m, storedMarks: g } = o, { $from: y, $to: C } = m, M = y.blockRange(C), D = g || m.$to.parentOffset && m.$from.marks();
-  if (!M)
+}, Rf = (r, e, t, n = {}) => ({ editor: i, tr: s, state: o, dispatch: l, chain: a, commands: c, can: f }) => {
+  const { extensions: d, splittableMarks: u } = i.extensionManager, h = z(r, o.schema), p = z(e, o.schema), { selection: m, storedMarks: g } = o, { $from: y, $to: M } = m, C = y.blockRange(M), D = g || m.$to.parentOffset && m.$from.marks();
+  if (!C)
     return !1;
   const E = ur((A) => bi(A.type.name, d))(m);
-  if (M.depth >= 1 && E && M.depth - E.depth <= 1) {
+  if (C.depth >= 1 && E && C.depth - E.depth <= 1) {
     if (E.node.type === h)
       return c.liftListItem(p);
     if (bi(E.node.type.name, d) && h.validContent(E.node.content) && l)
-      return a().command(() => (s.setNodeMarkup(E.pos, h), !0)).command(() => Mn(s, h)).command(() => wn(s, h)).run();
+      return a().command(() => (s.setNodeMarkup(E.pos, h), !0)).command(() => Cn(s, h)).command(() => wn(s, h)).run();
   }
-  return !t || !D || !l ? a().command(() => f().wrapInList(h, n) ? !0 : c.clearNodes()).wrapInList(h, n).command(() => Mn(s, h)).command(() => wn(s, h)).run() : a().command(() => {
+  return !t || !D || !l ? a().command(() => f().wrapInList(h, n) ? !0 : c.clearNodes()).wrapInList(h, n).command(() => Cn(s, h)).command(() => wn(s, h)).run() : a().command(() => {
     const A = f().wrapInList(h, n), U = D.filter((j) => u.includes(j.type.name));
     return s.ensureMarks(U), A ? !0 : c.clearNodes();
-  }).wrapInList(h, n).command(() => Mn(s, h)).command(() => wn(s, h)).run();
+  }).wrapInList(h, n).command(() => Cn(s, h)).command(() => wn(s, h)).run();
 }, Pf = (r, e = {}, t = {}) => ({ state: n, commands: i }) => {
   const { extendEmptyMarkRange: s = !1 } = t, o = Ee(r, n.schema);
   return jn(n, o, e) ? i.unsetMark(o, { extendEmptyMarkRange: s }) : i.setMark(o, e);
@@ -11237,8 +11237,8 @@ const If = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
         ...e
       }), o && m.marks.length && m.marks.forEach((y) => {
         if (o === y.type) {
-          const C = Math.max(g, c), M = Math.min(g + m.nodeSize, f);
-          t.addMark(C, M, o.create({
+          const M = Math.max(g, c), C = Math.min(g + m.nodeSize, f);
+          t.addMark(M, C, o.create({
             ...y.attrs,
             ...e
           }));
@@ -11269,8 +11269,8 @@ var jf = /* @__PURE__ */ Object.freeze({
   command: Dc,
   createParagraphNear: Ac,
   cut: Ic,
-  deleteCurrentNode: Rc,
-  deleteNode: vc,
+  deleteCurrentNode: vc,
+  deleteNode: Rc,
   deleteRange: Pc,
   deleteSelection: Bc,
   enter: zc,
@@ -11310,8 +11310,8 @@ var jf = /* @__PURE__ */ Object.freeze({
   setTextSelection: Df,
   sinkListItem: Af,
   splitBlock: If,
-  splitListItem: Rf,
-  toggleList: vf,
+  splitListItem: vf,
+  toggleList: Rf,
   toggleMark: Pf,
   toggleNode: Bf,
   toggleWrap: zf,
@@ -11880,7 +11880,7 @@ class sd extends fc {
       }), t = Jn(this.options.content, this.schema, this.options.parseOptions, { errorOnInvalidContent: !1 });
     }
     const n = Qs(t, this.options.autofocus);
-    this.view = new va(this.options.element, {
+    this.view = new Ra(this.options.element, {
       ...this.options.editorProps,
       attributes: {
         // add `role="textbox"` to the editor element
@@ -11972,7 +11972,7 @@ class sd extends fc {
   }
   isActive(e, t) {
     const n = typeof e == "string" ? e : null, i = typeof e == "string" ? t : e;
-    return Mf(this.state, n, i);
+    return Cf(this.state, n, i);
   }
   /**
    * Get the document as JSON.
@@ -12180,8 +12180,8 @@ class fd {
       return;
     let u = 0, h = 0;
     if (this.dom !== d) {
-      const C = this.dom.getBoundingClientRect(), M = d.getBoundingClientRect(), D = (i = e.offsetX) !== null && i !== void 0 ? i : (s = e.nativeEvent) === null || s === void 0 ? void 0 : s.offsetX, E = (o = e.offsetY) !== null && o !== void 0 ? o : (l = e.nativeEvent) === null || l === void 0 ? void 0 : l.offsetY;
-      u = M.x - C.x + D, h = M.y - C.y + E;
+      const M = this.dom.getBoundingClientRect(), C = d.getBoundingClientRect(), D = (i = e.offsetX) !== null && i !== void 0 ? i : (s = e.nativeEvent) === null || s === void 0 ? void 0 : s.offsetX, E = (o = e.offsetY) !== null && o !== void 0 ? o : (l = e.nativeEvent) === null || l === void 0 ? void 0 : l.offsetY;
+      u = C.x - M.x + D, h = C.y - M.y + E;
     }
     const p = this.dom.cloneNode(!0);
     (a = e.dataTransfer) === null || a === void 0 || a.setDragImage(p, u, h);
@@ -12302,29 +12302,29 @@ function pd(r) {
 }
 export {
   _ as A,
-  _i as B,
-  yf as C,
-  v as D,
+  Qo as B,
+  _i as C,
+  R as D,
   ne as E,
   b as F,
-  pd as G,
-  ir as H,
-  zt as I,
-  bi as J,
-  Mf as K,
-  ed as L,
+  yf as G,
+  pd as H,
+  ir as I,
+  zt as J,
+  bi as K,
+  Cf as L,
   qt as M,
   qn as N,
-  nd as O,
+  ed as O,
   oe as P,
-  td as Q,
-  ro as R,
+  nd as Q,
+  td as R,
   k as S,
   O as T,
-  xf as U,
-  dr as V,
-  ur as W,
-  xe as X,
+  ro as U,
+  xf as V,
+  dr as W,
+  ur as X,
   We as a,
   ee as b,
   dd as c,
@@ -12341,14 +12341,14 @@ export {
   ld as n,
   Wn as o,
   id as p,
-  lt as q,
-  Ko as r,
-  ja as s,
+  xe as q,
+  lt as r,
+  Ko as s,
   ad as t,
-  N as u,
-  w as v,
+  ja as u,
+  N as v,
   cd as w,
-  x,
-  hr as y,
-  Qo as z
+  w as x,
+  x as y,
+  hr as z
 };