@clevertask/scribe 0.0.4 → 0.0.6

package/dist/{index-pCZujIH1.js → index-DzExyr-e.js}

@@ -327,15 +327,15 @@ class b {
   */
   findIndex(e, t = -1) {
     if (e == 0)
-      return xt(0, e);
+      return St(0, e);
     if (e == this.size)
-      return xt(this.content.length, e);
+      return St(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 ? xt(n + 1, o) : xt(n, i);
+        return o == e || t > 0 ? St(n + 1, o) : St(n, i);
       i = o;
     }
   }
@@ -401,10 +401,10 @@ class b {
 }
 b.empty = new b([], 0);
 const sn = { index: 0, offset: 0 };
-function xt(r, e) {
+function St(r, e) {
   return sn.index = r, sn.offset = e, sn;
 }
-function At(r, e) {
+function It(r, e) {
   if (r === e)
     return !0;
   if (!(r && typeof r == "object") || !(e && typeof e == "object"))
@@ -416,11 +416,11 @@ function At(r, e) {
     if (r.length != e.length)
       return !1;
     for (let n = 0; n < r.length; n++)
-      if (!At(r[n], e[n]))
+      if (!It(r[n], e[n]))
         return !1;
   } else {
     for (let n in r)
-      if (!(n in e) || !At(r[n], e[n]))
+      if (!(n in e) || !It(r[n], e[n]))
         return !1;
     for (let n in e)
       if (!(n in r))
@@ -482,7 +482,7 @@ let A = class Cn {
   another mark.
   */
   eq(e) {
-    return this == e || this.type == e.type && At(this.attrs, e.attrs);
+    return this == e || this.type == e.type && It(this.attrs, e.attrs);
   }
   /**
   Convert this mark to a JSON-serializeable representation.
@@ -534,7 +534,7 @@ let A = class Cn {
   }
 };
 A.none = [];
-class It extends Error {
+class Rt extends Error {
 }
 class k {
   /**
@@ -637,9 +637,9 @@ function Ci(r, e, t, n) {
 }
 function ro(r, e, t) {
   if (t.openStart > r.depth)
-    throw new It("Inserted content deeper than insertion position");
+    throw new Rt("Inserted content deeper than insertion position");
   if (r.depth - t.openStart != e.depth - t.openEnd)
-    throw new It("Inconsistent open depths");
+    throw new Rt("Inconsistent open depths");
   return wi(r, e, t, 0);
 }
 function wi(r, e, t, n) {
@@ -655,11 +655,11 @@ function wi(r, e, t, n) {
       let { start: o, end: l } = io(t, r);
       return Pe(s, Ni(r, o, l, e, n));
     }
-  else return Pe(s, Rt(r, e, n));
+  else return Pe(s, vt(r, e, n));
 }
 function Oi(r, e) {
   if (!e.type.compatibleContent(r.type))
-    throw new It("Cannot join " + e.type.name + " onto " + r.type.name);
+    throw new Rt("Cannot join " + e.type.name + " onto " + r.type.name);
 }
 function wn(r, e, t) {
   let n = r.node(t);
@@ -681,13 +681,13 @@ function Pe(r, e) {
 }
 function Ni(r, e, t, n, i) {
   let s = r.depth > i && wn(r, e, i + 1), o = n.depth > i && wn(t, n, i + 1), l = [];
-  return ot(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, Rt(r, e, i + 1)), l), ot(e, t, i, l), o && ve(Pe(o, Rt(t, n, i + 1)), l)), ot(n, null, i, l), new b(l);
+  return ot(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, vt(r, e, i + 1)), l), ot(e, t, i, l), o && ve(Pe(o, vt(t, n, i + 1)), l)), ot(n, null, i, l), new b(l);
 }
-function Rt(r, e, t) {
+function vt(r, e, t) {
   let n = [];
   if (ot(null, r, t, n), r.depth > t) {
     let i = wn(r, e, t + 1);
-    ve(Pe(i, Rt(r, e, t + 1)), n);
+    ve(Pe(i, vt(r, e, t + 1)), n);
   }
   return ot(e, null, t, n), new b(n);
 }
@@ -885,7 +885,7 @@ class ct {
       return e.blockRange(this);
     for (let n = this.depth - (this.parent.inlineContent || this.pos == e.pos ? 1 : 0); n >= 0; n--)
       if (e.pos <= this.end(n) && (!t || t(this.node(n))))
-        return new vt(this, e, n);
+        return new Pt(this, e, n);
     return null;
   }
   /**
@@ -953,7 +953,7 @@ class so {
   }
 }
 const oo = 12, hr = /* @__PURE__ */ new WeakMap();
-class vt {
+class Pt {
   /**
   Construct a node range. `$from` and `$to` should point into the
   same node until at least the given `depth`, since a node range
@@ -1112,7 +1112,7 @@ let xe = class On {
   attributes, and marks.
   */
   hasMarkup(e, t, n) {
-    return this.type == e && At(this.attrs, t || e.defaultAttrs || lo) && A.sameSet(this.marks, n || A.none);
+    return this.type == e && It(this.attrs, t || e.defaultAttrs || lo) && A.sameSet(this.marks, n || A.none);
   }
   /**
   Create a new node with the same markup as this node, containing
@@ -1364,7 +1364,7 @@ let xe = class On {
   }
 };
 xe.prototype.text = void 0;
-class Pt extends xe {
+class Bt extends xe {
   /**
   @internal
   */
@@ -1386,10 +1386,10 @@ class Pt extends xe {
     return this.text.length;
   }
   mark(e) {
-    return e == this.marks ? this : new Pt(this.type, this.attrs, this.text, e);
+    return e == this.marks ? this : new Bt(this.type, this.attrs, this.text, e);
   }
   withText(e) {
-    return e == this.text ? this : new Pt(this.type, this.attrs, e, this.marks);
+    return e == this.text ? this : new Bt(this.type, this.attrs, e, this.marks);
   }
   cut(e = 0, t = this.text.length) {
     return e == 0 && t == this.text.length ? this : this.withText(this.text.slice(e, t));
@@ -1986,7 +1986,7 @@ class ko {
     return !this.hasDefault;
   }
 }
-class Kt {
+class Ht {
   /**
   @internal
   */
@@ -2008,7 +2008,7 @@ class Kt {
   */
   static compile(e, t) {
     let n = /* @__PURE__ */ Object.create(null), i = 0;
-    return e.forEach((s, o) => n[s] = new Kt(s, i++, t, o)), n;
+    return e.forEach((s, o) => n[s] = new Ht(s, i++, t, o)), n;
   }
   /**
   When there is a mark of this type in the given set, a new set
@@ -2050,7 +2050,7 @@ class Bi {
     let t = this.spec = {};
     for (let i in e)
       t[i] = e[i];
-    t.nodes = F.from(e.nodes), t.marks = F.from(e.marks || {}), this.nodes = gr.compile(this.spec.nodes, this), this.marks = Kt.compile(this.spec.marks, this);
+    t.nodes = F.from(e.nodes), t.marks = F.from(e.marks || {}), this.nodes = gr.compile(this.spec.nodes, this), this.marks = Ht.compile(this.spec.marks, this);
     let n = /* @__PURE__ */ Object.create(null);
     for (let i in this.nodes) {
       if (i in this.marks)
@@ -2092,7 +2092,7 @@ class Bi {
   */
   text(e, t) {
     let n = this.nodes.text;
-    return new Pt(n, n.defaultAttrs, e, A.setFrom(t));
+    return new Bt(n, n.defaultAttrs, e, A.setFrom(t));
   }
   /**
   Create a mark with the given type and attributes.
@@ -2301,13 +2301,13 @@ const zi = {
   script: !0,
   style: !0,
   title: !0
-}, Fi = { ol: !0, ul: !0 }, ft = 1, Nn = 2, Nt = 4;
+}, Fi = { ol: !0, ul: !0 }, ft = 1, Nn = 2, Tt = 4;
 function br(r, e, t) {
   return e != null ? (e ? ft : 0) | (e === "full" ? Nn : 0) : r && r.whitespace == "pre" ? ft | Nn : t & -5;
 }
-class St {
+class Mt {
   constructor(e, t, n, i, s, o) {
-    this.type = e, this.attrs = t, this.marks = n, this.solid = i, this.options = o, this.content = [], this.activeMarks = A.none, this.match = s || (o & Nt ? null : e.contentMatch);
+    this.type = e, this.attrs = t, this.marks = n, this.solid = i, this.options = o, this.content = [], this.activeMarks = A.none, this.match = s || (o & Tt ? null : e.contentMatch);
   }
   findWrapping(e) {
     if (!this.match) {
@@ -2341,8 +2341,8 @@ class St {
 class kr {
   constructor(e, t, n) {
     this.parser = e, this.options = t, this.isOpen = n, this.open = 0, this.localPreserveWS = !1;
-    let i = t.topNode, s, o = br(null, t.preserveWhitespace, 0) | (n ? Nt : 0);
-    i ? s = new St(i.type, i.attrs, A.none, !0, t.topMatch || i.type.contentMatch, o) : n ? s = new St(null, null, A.none, !0, null, o) : s = new St(e.schema.topNodeType, null, A.none, !0, null, o), this.nodes = [s], this.find = t.findPositions, this.needsBlock = !1;
+    let i = t.topNode, s, o = br(null, t.preserveWhitespace, 0) | (n ? Tt : 0);
+    i ? s = new Mt(i.type, i.attrs, A.none, !0, t.topMatch || i.type.contentMatch, o) : n ? s = new Mt(null, null, A.none, !0, null, o) : s = new Mt(e.schema.topNodeType, null, A.none, !0, null, o), this.nodes = [s], this.find = t.findPositions, this.needsBlock = !1;
   }
   get top() {
     return this.nodes[this.open];
@@ -2516,9 +2516,9 @@ class kr {
     let o = this.top;
     o.match = o.match && o.match.matchType(e);
     let l = br(e, s, o.options);
-    o.options & Nt && o.content.length == 0 && (l |= Nt);
+    o.options & Tt && o.content.length == 0 && (l |= Tt);
     let a = A.none;
-    return n = n.filter((c) => (o.type ? o.type.allowsMarkType(c.type) : Sr(c.type, e)) ? (a = c.addToSet(a), !1) : !0), this.nodes.push(new St(e, t, a, i, null, l)), this.open++, n;
+    return n = n.filter((c) => (o.type ? o.type.allowsMarkType(c.type) : Sr(c.type, e)) ? (a = c.addToSet(a), !1) : !0), this.nodes.push(new Mt(e, t, a, i, null, l)), this.open++, n;
   }
   // Make sure all nodes above this.open are finished and added to
   // their parents
@@ -2694,7 +2694,7 @@ class We {
   @internal
   */
   serializeNodeInner(e, t) {
-    let { dom: n, contentDOM: i } = Tt(on(t), this.nodes[e.type.name](e), null, e.attrs);
+    let { dom: n, contentDOM: i } = Et(on(t), this.nodes[e.type.name](e), null, e.attrs);
     if (i) {
       if (e.isLeaf)
         throw new RangeError("Content hole not allowed in a leaf node spec");
@@ -2722,10 +2722,10 @@ class We {
   */
   serializeMark(e, t, n = {}) {
     let i = this.marks[e.type.name];
-    return i && Tt(on(n), i(e, t), null, e.attrs);
+    return i && Et(on(n), i(e, t), null, e.attrs);
   }
   static renderSpec(e, t, n = null, i) {
-    return Tt(e, t, n, i);
+    return Et(e, t, n, i);
   }
   /**
   Build a serializer using the [`toDOM`](https://prosemirror.net/docs/ref/#model.NodeSpec.toDOM)
@@ -2781,7 +2781,7 @@ function No(r) {
   }
   return t(r), e;
 }
-function Tt(r, e, t, n) {
+function Et(r, e, t, n) {
   if (typeof e == "string")
     return { dom: r.createTextNode(e) };
   if (e.nodeType != null)
@@ -2811,7 +2811,7 @@ function Tt(r, e, t, n) {
         throw new RangeError("Content hole must be the only child of its parent node");
       return { dom: a, contentDOM: a };
     } else {
-      let { dom: h, contentDOM: p } = Tt(r, u, t, n);
+      let { dom: h, contentDOM: p } = Et(r, u, t, n);
       if (a.appendChild(h), p) {
         if (l)
           throw new RangeError("Multiple content holes");
@@ -2831,7 +2831,7 @@ function wr(r) {
 function Eo(r) {
   return (r - (r & Vi)) / $i;
 }
-const Li = 1, Wi = 2, Et = 4, Ji = 8;
+const Li = 1, Wi = 2, Dt = 4, Ji = 8;
 class Tn {
   /**
   @internal
@@ -2851,13 +2851,13 @@ class Tn {
   Tells you whether the token before the mapped position was deleted.
   */
   get deletedBefore() {
-    return (this.delInfo & (Li | Et)) > 0;
+    return (this.delInfo & (Li | Dt)) > 0;
   }
   /**
   True when the token after the mapped position was deleted.
   */
   get deletedAfter() {
-    return (this.delInfo & (Wi | Et)) > 0;
+    return (this.delInfo & (Wi | Dt)) > 0;
   }
   /**
   Tells whether any of the steps mapped through deletes across the
@@ -2865,7 +2865,7 @@ class Tn {
   position).
   */
   get deletedAcross() {
-    return (this.delInfo & Et) > 0;
+    return (this.delInfo & Dt) > 0;
   }
 }
 class _ {
@@ -2908,7 +2908,7 @@ class _ {
         let u = c ? e == a ? -1 : e == d ? 1 : t : t, h = a + i + (u < 0 ? 0 : f);
         if (n)
           return h;
-        let p = e == (t < 0 ? a : d) ? null : To(l / 3, e - a), m = e == a ? Wi : e == d ? Li : Et;
+        let p = e == (t < 0 ? a : d) ? null : To(l / 3, e - a), m = e == a ? Wi : e == d ? Li : Dt;
         return (t < 0 ? e != a : e != d) && (m |= Ji), new Tn(h, m, p);
       }
       i += f - c;
@@ -2965,7 +2965,7 @@ class _ {
   }
 }
 _.empty = new _([]);
-class Bt {
+class zt {
   /**
   Create a new mapping with the given position maps.
   */
@@ -2982,7 +2982,7 @@ class Bt {
   Create a mapping that maps only through a part of this one.
   */
   slice(e = 0, t = this.maps.length) {
-    return new Bt(this._maps, this.mirror, e, t);
+    return new zt(this._maps, this.mirror, e, t);
   }
   /**
   Add a step map to the end of this mapping. If `mirrors` is
@@ -3033,7 +3033,7 @@ class Bt {
   Create an inverted version of this mapping.
   */
   invert() {
-    let e = new Bt();
+    let e = new zt();
     return e.appendMappingInverted(this), e;
   }
   /**
@@ -3142,7 +3142,7 @@ class R {
     try {
       return R.ok(e.replace(t, n, i));
     } catch (s) {
-      if (s instanceof It)
+      if (s instanceof Rt)
         return R.fail(s.message);
       throw s;
     }
@@ -3458,7 +3458,7 @@ function Ao(r, e, t, n) {
       return;
     s++;
     let a = null;
-    if (n instanceof Kt) {
+    if (n instanceof Ht) {
       let c = o.marks, f;
       for (; f = n.isInSet(c); )
         (a || (a = [])).push(f), c = f.removeFromSet(c);
@@ -3657,7 +3657,7 @@ function Lo(r, e) {
 function Ki(r, e) {
   return !!(r && e && !r.isLeaf && Lo(r, e));
 }
-function Ht(r, e, t = -1) {
+function Ut(r, e, t = -1) {
   let n = r.resolve(e);
   for (let i = n.depth; ; i--) {
     let s, o, l = n.index(i);
@@ -3730,7 +3730,7 @@ function jo(r, e, t) {
     }
   return null;
 }
-function Ut(r, e, t = e, n = k.empty) {
+function Gt(r, e, t = e, n = k.empty) {
   if (e == t && !n.size)
     return null;
   let i = r.resolve(e), s = r.resolve(t);
@@ -4094,7 +4094,7 @@ class Yi {
   Create a transform that starts with the given document.
   */
   constructor(e) {
-    this.doc = e, this.steps = [], this.docs = [], this.mapping = new Bt();
+    this.doc = e, this.steps = [], this.docs = [], this.mapping = new zt();
   }
   /**
   The starting document.
@@ -4138,7 +4138,7 @@ class Yi {
   given `slice`.
   */
   replace(e, t = e, n = k.empty) {
-    let i = Ut(this.doc, e, t, n);
+    let i = Gt(this.doc, e, t, n);
     return i && this.step(i), this;
   }
   /**
@@ -4523,7 +4523,7 @@ class C extends N {
     return e instanceof C && e.anchor == this.anchor && e.head == this.head;
   }
   getBookmark() {
-    return new Gt(this.anchor, this.head);
+    return new _t(this.anchor, this.head);
   }
   toJSON() {
     return { type: "text", anchor: this.anchor, head: this.head };
@@ -4564,12 +4564,12 @@ class C extends N {
   }
 }
 N.jsonID("text", C);
-class Gt {
+class _t {
   constructor(e, t) {
     this.anchor = e, this.head = t;
   }
   map(e) {
-    return new Gt(e.map(this.anchor), e.map(this.head));
+    return new _t(e.map(this.anchor), e.map(this.head));
   }
   resolve(e) {
     return C.between(e.resolve(this.anchor), e.resolve(this.head));
@@ -4630,7 +4630,7 @@ class Hn {
   }
   map(e) {
     let { deleted: t, pos: n } = e.mapResult(this.anchor);
-    return t ? new Gt(n, n) : new Hn(n);
+    return t ? new _t(n, n) : new Hn(n);
   }
   resolve(e) {
     let t = e.resolve(this.anchor), n = t.nodeAfter;
@@ -5204,7 +5204,7 @@ function gt(r) {
     ;
   return e && e.node && e.node.isBlock && (e.dom == r || e.contentDOM == r);
 }
-const _t = function(r) {
+const Yt = function(r) {
   return r.focusNode && $e(r.focusNode, r.focusOffset, r.anchorNode, r.anchorOffset);
 };
 function De(r, e) {
@@ -6030,7 +6030,7 @@ class Ce extends bt {
     } else f || ({ dom: f, contentDOM: d } = We.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 Ol(e, t, n, i, f, d || null, u, c, s, o + 1) : t.isText ? new Yt(e, t, n, i, f, u, s) : new Ce(e, t, n, i, f, d || null, u, s, o + 1);
+    return f = us(f, n, t), c ? a = new Ol(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,7 +6053,7 @@ class Ce extends bt {
     return e;
   }
   matchesNode(e, t, n) {
-    return this.dirty == Q && e.eq(this.node) && zt(t, this.outerDeco) && n.eq(this.innerDeco);
+    return this.dirty == Q && e.eq(this.node) && Ft(t, this.outerDeco) && n.eq(this.innerDeco);
   }
   get size() {
     return this.node.nodeSize;
@@ -6111,7 +6111,7 @@ class Ce extends bt {
     this.updateOuterDeco(t), this.node = e, this.innerDeco = n, this.contentDOM && this.updateChildren(i, this.posAtStart), this.dirty = Q;
   }
   updateOuterDeco(e) {
-    if (zt(e, this.outerDeco))
+    if (Ft(e, this.outerDeco))
       return;
     let t = this.nodeDOM.nodeType != 1, n = this.dom;
     this.dom = ds(this.dom, this.nodeDOM, vn(this.outerDeco, this.node, t), vn(e, this.node, t)), this.dom != n && (n.pmViewDesc = void 0, this.dom.pmViewDesc = this), this.outerDeco = e;
@@ -6133,7 +6133,7 @@ function Wr(r, e, t, n, i) {
   let s = new Ce(void 0, r, e, t, n, n, n, i, 0);
   return s.contentDOM && s.updateChildren(i, 0), s;
 }
-class Yt extends Ce {
+class Xt extends Ce {
   constructor(e, t, n, i, s, o, l) {
     super(e, t, n, i, s, null, o, l, 0);
   }
@@ -6164,7 +6164,7 @@ class Yt extends Ce {
   }
   slice(e, t, n) {
     let i = this.node.cut(e, t), s = document.createTextNode(i.text);
-    return new Yt(this.parent, i, this.outerDeco, this.innerDeco, s, s, n);
+    return new Xt(this.parent, i, this.outerDeco, this.innerDeco, s, s, n);
   }
   markDirty(e, t) {
     super.markDirty(e, t), this.dom != this.nodeDOM && (e == 0 || t == this.nodeDOM.nodeValue.length) && (this.dirty = se);
@@ -6303,7 +6303,7 @@ function Nl(r, e, t) {
 function us(r, e, t) {
   return ds(r, r, Re, vn(e, t, r.nodeType != 1));
 }
-function zt(r, e) {
+function Ft(r, e) {
   if (r.length != e.length)
     return !1;
   for (let t = 0; t < r.length; t++)
@@ -6405,7 +6405,7 @@ class Tl {
         let c = this.preMatch.matched.get(a);
         if (c != null && c != s)
           return !1;
-        let f = a.dom, d, u = this.isLocked(f) && !(e.isText && a.node && a.node.isText && a.nodeDOM.nodeValue == e.text && a.dirty != se && zt(t, a.outerDeco));
+        let f = a.dom, d, u = this.isLocked(f) && !(e.isText && a.node && a.node.isText && a.nodeDOM.nodeValue == e.text && a.dirty != se && Ft(t, a.outerDeco));
         if (!u && a.update(e, t, n, i))
           return this.destroyBetween(this.index, l), a.dom != f && (this.changed = !0), this.index++, !0;
         if (!u && (d = this.recreateWrapper(a, e, t, n, i, o)))
@@ -6418,7 +6418,7 @@ class Tl {
   // When a node with content is replaced by a different node with
   // identical content, move over its children.
   recreateWrapper(e, t, n, i, s, o) {
-    if (e.dirty || t.isAtom || !e.children.length || !e.node.content.eq(t.content) || !zt(n, e.outerDeco) || !i.eq(e.innerDeco))
+    if (e.dirty || t.isAtom || !e.children.length || !e.node.content.eq(t.content) || !Ft(n, e.outerDeco) || !i.eq(e.innerDeco))
       return null;
     let l = Ce.create(this.top, t, n, i, s, o);
     if (l.contentDOM) {
@@ -6449,7 +6449,7 @@ class Tl {
     for (; e instanceof Le; )
       t = e, e = t.children[t.children.length - 1];
     (!e || // Empty textblock
-    !(e instanceof Yt) || /\n$/.test(e.node.text) || this.view.requiresGeckoHackNode && /\s$/.test(e.node.text)) && ((q || W) && e && e.dom.contentEditable == "false" && this.addHackNode("IMG", t), this.addHackNode("BR", this.top));
+    !(e instanceof Xt) || /\n$/.test(e.node.text) || this.view.requiresGeckoHackNode && /\s$/.test(e.node.text)) && ((q || W) && e && e.dom.contentEditable == "false" && this.addHackNode("IMG", t), this.addHackNode("BR", this.top));
   }
   addHackNode(e, t) {
     if (t == this.top && this.index < t.children.length && t.children[this.index].matchesHack(e))
@@ -6589,7 +6589,7 @@ function Gn(r, e = null) {
   if (o < 0)
     return null;
   let l = n.resolve(o), a, c;
-  if (_t(t)) {
+  if (Yt(t)) {
     for (a = o; i && !i.node; )
       i = i.parent;
     let d = i.node;
@@ -6743,7 +6743,7 @@ function Gr(r, e, t) {
     }
   }
 }
-function Ft(r) {
+function Vt(r) {
   return r.nodeType == 3 ? r.nodeValue.length : r.childNodes.length;
 }
 function at(r, e) {
@@ -6758,7 +6758,7 @@ function zl(r) {
   if (!t)
     return;
   let i, s, o = !1;
-  for (te && t.nodeType == 1 && n < Ft(t) && at(t.childNodes[n], -1) && (o = !0); ; )
+  for (te && t.nodeType == 1 && n < Vt(t) && at(t.childNodes[n], -1) && (o = !0); ; )
     if (n > 0) {
       if (t.nodeType != 1)
         break;
@@ -6779,7 +6779,7 @@ function zl(r) {
         for (; l && at(l, -1); )
           i = t.parentNode, s = V(l), l = l.previousSibling;
         if (l)
-          t = l, n = Ft(t);
+          t = l, n = Vt(t);
         else {
           if (t = t.parentNode, t == r.dom)
             break;
@@ -6793,7 +6793,7 @@ function Fl(r) {
   let e = r.domSelectionRange(), t = e.focusNode, n = e.focusOffset;
   if (!t)
     return;
-  let i = Ft(t), s, o;
+  let i = Vt(t), s, o;
   for (; ; )
     if (n < i) {
       if (t.nodeType != 1)
@@ -6811,7 +6811,7 @@ function Fl(r) {
         for (; l && at(l, 1); )
           s = l.parentNode, o = V(l) + 1, l = l.nextSibling;
         if (l)
-          t = l, n = 0, i = Ft(t);
+          t = l, n = 0, i = Vt(t);
         else {
           if (t = t.parentNode, t == r.dom)
             break;
@@ -6857,7 +6857,7 @@ function zn(r, e, t) {
   let n = r.domSelection();
   if (!n)
     return;
-  if (_t(n)) {
+  if (Yt(n)) {
     let s = document.createRange();
     s.setEnd(e, t), s.setStart(e, t), n.removeAllRanges(), n.addRange(s);
   } else n.extend && n.extend(e, t);
@@ -7222,7 +7222,7 @@ H.keypress = (r, e) => {
     !/[\r\n]/.test(i) && !r.someProp("handleTextInput", (s) => s(r, n.$from.pos, n.$to.pos, i)) && r.dispatch(r.state.tr.insertText(i).scrollIntoView()), t.preventDefault();
   }
 };
-function Xt(r) {
+function Zt(r) {
   return { left: r.clientX, top: r.clientY };
 }
 function ta(r, e) {
@@ -7293,7 +7293,7 @@ function la(r, e, t) {
   }
 }
 function Qn(r) {
-  return Vt(r);
+  return $t(r);
 }
 const Cs = X ? "metaKey" : "ctrlKey";
 K.mousedown = (r, e) => {
@@ -7301,7 +7301,7 @@ K.mousedown = (r, e) => {
   r.input.shiftKey = t.shiftKey;
   let n = Qn(r), i = Date.now(), s = "singleClick";
   i - r.input.lastClick.time < 500 && ta(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(Xt(t));
+  let o = r.posAtCoords(Zt(t));
   o && (s == "singleClick" ? (r.input.mouseDown && r.input.mouseDown.done(), r.input.mouseDown = new aa(r, o, t, !!n)) : (s == "doubleClick" ? sa : oa)(r, o.pos, o.inside, t) ? t.preventDefault() : ke(r, "pointer"));
 };
 class aa {
@@ -7333,7 +7333,7 @@ class aa {
     if (this.done(), !this.view.dom.contains(e.target))
       return;
     let t = this.pos;
-    this.view.state.doc != this.startDoc && (t = this.view.posAtCoords(Xt(e))), this.updateAllowDefault(e), this.allowDefault || !t ? ke(this.view, "pointer") : ia(this.view, t.pos, t.inside, e, this.selectNode) ? e.preventDefault() : e.button == 0 && (this.flushed || // Safari ignores clicks on draggable elements
+    this.view.state.doc != this.startDoc && (t = this.view.posAtCoords(Zt(e))), this.updateAllowDefault(e), this.allowDefault || !t ? ke(this.view, "pointer") : ia(this.view, t.pos, t.inside, e, this.selectNode) ? e.preventDefault() : e.button == 0 && (this.flushed || // Safari ignores clicks on draggable elements
     q && this.mightDrag && !this.mightDrag.node.isAtom || // Chrome will sometimes treat a node selection as a
     // cursor, but still report that the node is selected
     // when asked through getSelection. You'll then get a
@@ -7366,8 +7366,8 @@ H.compositionstart = H.compositionupdate = (r) => {
     r.domObserver.flush();
     let { state: e } = r, t = e.selection.$to;
     if (e.selection instanceof C && (e.storedMarks || !t.textOffset && t.parentOffset && t.nodeBefore.marks.some((n) => n.type.spec.inclusive === !1)))
-      r.markCursor = r.state.storedMarks || t.marks(), Vt(r, !0), r.markCursor = null;
-    else if (Vt(r, !e.selection.empty), te && e.selection.empty && t.parentOffset && !t.textOffset && t.nodeBefore.marks.length) {
+      r.markCursor = r.state.storedMarks || t.marks(), $t(r, !0), r.markCursor = null;
+    else if ($t(r, !e.selection.empty), te && e.selection.empty && t.parentOffset && !t.textOffset && t.nodeBefore.marks.length) {
       let n = r.domSelectionRange();
       for (let i = n.focusNode, s = n.focusOffset; i && i.nodeType == 1 && s != 0; ) {
         let o = s < 0 ? i.lastChild : i.childNodes[s - 1];
@@ -7389,7 +7389,7 @@ H.compositionend = (r, e) => {
   r.composing && (r.input.composing = !1, r.input.compositionEndedAt = e.timeStamp, r.input.compositionPendingChanges = r.domObserver.pendingRecords().length ? r.input.compositionID : 0, r.input.compositionNode = null, r.input.compositionPendingChanges && Promise.resolve().then(() => r.domObserver.flush()), r.input.compositionID++, Os(r, 20));
 };
 function Os(r, e) {
-  clearTimeout(r.input.composingTimeout), e > -1 && (r.input.composingTimeout = setTimeout(() => Vt(r), e));
+  clearTimeout(r.input.composingTimeout), e > -1 && (r.input.composingTimeout = setTimeout(() => $t(r), e));
 }
 function Ns(r) {
   for (r.composing && (r.input.composing = !1, r.input.compositionEndedAt = da()); r.input.compositionNodes.length > 0; )
@@ -7418,7 +7418,7 @@ function da() {
   let r = document.createEvent("Event");
   return r.initEvent("event", !0, !0), r.timeStamp;
 }
-function Vt(r, e = !1) {
+function $t(r, e = !1) {
   if (!(ce && r.domObserver.flushingSoon >= 0)) {
     if (r.domObserver.forceFlush(), Ns(r), e || r.docView && r.docView.dirty) {
       let t = Gn(r);
@@ -7495,7 +7495,7 @@ K.dragstart = (r, e) => {
   let t = e, n = r.input.mouseDown;
   if (n && n.done(), !t.dataTransfer)
     return;
-  let i = r.state.selection, s = i.empty ? null : r.posAtCoords(Xt(t)), o;
+  let i = r.state.selection, s = i.empty ? null : r.posAtCoords(Zt(t)), o;
   if (!(s && s.pos >= i.from && s.pos <= (i instanceof S ? i.to - 1 : i.to))) {
     if (n && n.mightDrag)
       o = S.create(r.state.doc, n.mightDrag.pos);
@@ -7518,7 +7518,7 @@ H.drop = (r, e) => {
   let t = e, n = r.dragging;
   if (r.dragging = null, !t.dataTransfer)
     return;
-  let i = r.posAtCoords(Xt(t));
+  let i = r.posAtCoords(Zt(t));
   if (!i)
     return;
   let s = r.state.doc.resolve(i.pos), o = n && n.slice;
@@ -7586,7 +7586,7 @@ function pt(r, e) {
       return !1;
   return !0;
 }
-class $t {
+class Lt {
   constructor(e, t) {
     this.toDOM = e, this.spec = t || Be, this.side = this.spec.side || 0;
   }
@@ -7598,7 +7598,7 @@ class $t {
     return !0;
   }
   eq(e) {
-    return this == e || e instanceof $t && (this.spec.key && this.spec.key == e.spec.key || this.toDOM == e.toDOM && pt(this.spec, e.spec));
+    return this == e || e instanceof Lt && (this.spec.key && this.spec.key == e.spec.key || this.toDOM == e.toDOM && pt(this.spec, e.spec));
   }
   destroy(e) {
     this.spec.destroy && this.spec.destroy(e);
@@ -7679,7 +7679,7 @@ class ee {
   widget's current document position.
   */
   static widget(e, t, n) {
-    return new ee(e, e, new $t(t, n));
+    return new ee(e, e, new Lt(t, n));
   }
   /**
   Creates an inline decoration, which adds the given attributes to
@@ -7713,7 +7713,7 @@ class ee {
   @internal
   */
   get widget() {
-    return this.type instanceof $t;
+    return this.type instanceof Lt;
   }
 }
 const He = [], Be = {};
@@ -7730,7 +7730,7 @@ class v {
   you must make a copy if you want need to preserve that.
   */
   static create(e, t) {
-    return t.length ? Lt(t, e, 0, Be) : L;
+    return t.length ? Wt(t, e, 0, Be) : L;
   }
   /**
   Find all decorations in this set which touch the given range
@@ -7789,7 +7789,7 @@ class v {
       if (f = Is(t, l, c)) {
         for (i || (i = this.children.slice()); s < i.length && i[s] < a; )
           s += 3;
-        i[s] == a ? i[s + 2] = i[s + 2].addInner(l, f, c + 1) : i.splice(s, 0, a, a + l.nodeSize, Lt(f, l, c + 1, Be)), s += 3;
+        i[s] == a ? i[s + 2] = i[s + 2].addInner(l, f, c + 1) : i.splice(s, 0, a, a + l.nodeSize, Wt(f, l, c + 1, Be)), s += 3;
       }
     });
     let o = As(s ? Rs(t) : t, -n);
@@ -7985,7 +7985,7 @@ function ga(r, e, t, n, i, s, o) {
         a = !0;
     }
   if (a) {
-    let c = ya(l, r, e, t, i, s, o), f = Lt(c, n, 0, o);
+    let c = ya(l, r, e, t, i, s, o), f = Wt(c, n, 0, o);
     e = f.local;
     for (let d = 0; d < l.length; d += 3)
       l[d + 1] < 0 && (l.splice(d, 3), d -= 3);
@@ -8035,13 +8035,13 @@ function Rs(r) {
     r[t] != null && e.push(r[t]);
   return e;
 }
-function Lt(r, e, t, n) {
+function Wt(r, e, t, n) {
   let i = [], s = !1;
   e.forEach((l, a) => {
     let c = Is(r, l, a + t);
     if (c) {
       s = !0;
-      let f = Lt(c, l, t + a + 1, n);
+      let f = Wt(c, l, t + a + 1, n);
       f != L && i.push(a, a + l.nodeSize, f);
     }
   });
@@ -8212,7 +8212,7 @@ class Sa {
       }
     }
     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 = Gn(e)) && c.eq(N.near(e.state.doc.resolve(0), 1)) ? (e.input.lastFocus = 0, ue(e), this.currentSelection.set(n), e.scrollToSelection()) : (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 && Yt(n) && (c = Gn(e)) && c.eq(N.near(e.state.doc.resolve(0), 1)) ? (e.input.lastFocus = 0, ue(e), this.currentSelection.set(n), e.scrollToSelection()) : (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));
   }
   registerMutation(e, t) {
     if (t.indexOf(e.target) > -1)
@@ -8281,7 +8281,7 @@ function wa(r, e) {
 }
 function Oa(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)
+  if (f && r.dom.contains(f.nodeType == 1 ? f : f.parentNode) && (c = [{ node: f, offset: a.anchorOffset }], Yt(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], M = y.pmViewDesc;
       if (y.nodeName == "BR" && !M) {
@@ -8330,8 +8330,8 @@ function Ea(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", (no) => no(r, De(13, "Enter"))))
         return;
-      let kt = r.state.tr.setSelection(he);
-      T == "pointer" ? kt.setMeta("pointer", !0) : T == "key" && kt.scrollIntoView(), s && kt.setMeta("composition", s), r.dispatch(kt);
+      let xt = r.state.tr.setSelection(he);
+      T == "pointer" ? xt.setMeta("pointer", !0) : T == "key" && xt.scrollIntoView(), s && xt.setMeta("composition", s), r.dispatch(xt);
     }
     return;
   }
@@ -8910,7 +8910,7 @@ var Oe = {
   220: "\\",
   221: "]",
   222: "'"
-}, Wt = {
+}, Jt = {
   48: ")",
   49: "!",
   50: "@",
@@ -8939,10 +8939,10 @@ var Oe = {
 for (var $ = 0; $ < 10; $++) Oe[48 + $] = Oe[96 + $] = String($);
 for (var $ = 1; $ <= 24; $++) Oe[$ + 111] = "F" + $;
 for (var $ = 65; $ <= 90; $++)
-  Oe[$] = String.fromCharCode($ + 32), Wt[$] = String.fromCharCode($);
-for (var bn in Oe) Wt.hasOwnProperty(bn) || (Wt[bn] = Oe[bn]);
+  Oe[$] = String.fromCharCode($ + 32), Jt[$] = String.fromCharCode($);
+for (var bn in Oe) Jt.hasOwnProperty(bn) || (Jt[bn] = Oe[bn]);
 function Fa(r) {
-  var e = Ba && r.metaKey && r.shiftKey && !r.ctrlKey && !r.altKey || za && r.shiftKey && r.key && r.key.length == 1 || r.key == "Unidentified", t = !e && r.key || (r.shiftKey ? Wt : Oe)[r.keyCode] || r.key || "Unidentified";
+  var e = Ba && r.metaKey && r.shiftKey && !r.ctrlKey && !r.altKey || za && r.shiftKey && r.key && r.key.length == 1 || r.key == "Unidentified", t = !e && r.key || (r.shiftKey ? Jt : Oe)[r.keyCode] || r.key || "Unidentified";
   return t == "Esc" && (t = "Escape"), t == "Del" && (t = "Delete"), t == "Left" && (t = "ArrowLeft"), t == "Up" && (t = "ArrowUp"), t == "Right" && (t = "ArrowRight"), t == "Down" && (t = "ArrowDown"), t;
 }
 const Va = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : !1;
@@ -9019,7 +9019,7 @@ const Ps = (r, e, t) => {
     return !0;
   if (n.parent.content.size == 0 && (et(s, "end") || S.isSelectable(s)))
     for (let o = n.depth; ; o--) {
-      let l = Ut(r.doc, n.before(o), n.after(o), k.empty);
+      let l = Gt(r.doc, n.before(o), n.after(o), k.empty);
       if (l && l.slice.size < l.to - l.from) {
         if (e) {
           let a = r.tr.step(l);
@@ -9063,7 +9063,7 @@ function Bs(r, e, t) {
       return !1;
     l = f;
   }
-  let c = Ut(r.doc, s, a, k.empty);
+  let c = Gt(r.doc, s, a, k.empty);
   if (!c || c.from != s || c instanceof P && c.slice.size >= a - s)
     return !1;
   if (t) {
@@ -9118,7 +9118,7 @@ const Vs = (r, e, t) => {
   if (js(r, i, e, 1))
     return !0;
   if (n.parent.content.size == 0 && (et(s, "start") || S.isSelectable(s))) {
-    let o = Ut(r.doc, n.before(), n.after(), k.empty);
+    let o = Gt(r.doc, n.before(), n.after(), k.empty);
     if (o && o.slice.size < o.to - o.from) {
       if (e) {
         let l = r.tr.step(o);
@@ -9157,7 +9157,7 @@ const Ka = (r, e) => {
     if (t.node.isTextblock || !Ne(r.doc, t.from))
       return !1;
     i = t.from;
-  } else if (i = Ht(r.doc, t.from, -1), i == null)
+  } else if (i = Ut(r.doc, t.from, -1), i == null)
     return !1;
   if (e) {
     let s = r.tr.join(i);
@@ -9170,7 +9170,7 @@ const Ka = (r, e) => {
     if (t.node.isTextblock || !Ne(r.doc, t.to))
       return !1;
     n = t.to;
-  } else if (n = Ht(r.doc, t.to, 1), n == null)
+  } else if (n = Ut(r.doc, t.to, 1), n == null)
     return !1;
   return e && e(r.tr.join(n).scrollIntoView()), !0;
 }, Ua = (r, e) => {
@@ -9376,7 +9376,7 @@ function rc(r, e, t, n = null) {
     if (e.$from.index(e.depth - 1) == 0)
       return !1;
     let a = o.resolve(e.start - 2);
-    s = new vt(a, a, e.depth), e.endIndex < e.parent.childCount && (e = new vt(e.$from, o.resolve(e.$to.end(e.depth)), e.depth)), i = !0;
+    s = new Pt(a, a, e.depth), e.endIndex < e.parent.childCount && (e = new Pt(e.$from, o.resolve(e.$to.end(e.depth)), e.depth)), i = !0;
   }
   let l = Kn(s, t, n, e);
   return l ? (r && ic(r, e, l, i, t), !0) : !1;
@@ -9402,7 +9402,7 @@ function sc(r) {
 }
 function oc(r, e, t, n) {
   let i = r.tr, s = n.end, o = n.$to.end(n.depth);
-  s < o && (i.step(new B(s - 1, o, s, o, new k(b.from(t.create(null, n.parent.copy())), 1, 0), 1, !0)), n = new vt(i.doc.resolve(n.$from.pos), i.doc.resolve(o), n.depth));
+  s < o && (i.step(new B(s - 1, o, s, o, new k(b.from(t.create(null, n.parent.copy())), 1, 0), 1, !0)), n = new Pt(i.doc.resolve(n.$from.pos), i.doc.resolve(o), n.depth));
   const l = tt(n);
   if (l == null)
     return !1;
@@ -9441,7 +9441,7 @@ function ac(r) {
     return !0;
   };
 }
-function Zt(r) {
+function Qt(r) {
   const { state: e, transaction: t } = r;
   let { selection: n } = t, { doc: i } = t, { storedMarks: s } = t;
   return {
@@ -9466,7 +9466,7 @@ function Zt(r) {
     }
   };
 }
-class Qt {
+class en {
   constructor(e) {
     this.editor = e.editor, this.rawCommands = this.editor.extensionManager.commands, this.customState = e.state;
   }
@@ -9511,7 +9511,7 @@ class Qt {
       tr: e,
       editor: i,
       view: o,
-      state: Zt({
+      state: Qt({
         state: s,
         transaction: e
       }),
@@ -9557,7 +9557,7 @@ function x(r, e, t) {
     parent: r.parent ? x(r.parent, e, t) : null
   }) : r.config[e];
 }
-function en(r) {
+function tn(r) {
   const e = r.filter((i) => i.type === "extension"), t = r.filter((i) => i.type === "node"), n = r.filter((i) => i.type === "mark");
   return {
     baseExtensions: e,
@@ -9566,7 +9566,7 @@ function en(r) {
   };
 }
 function Ks(r) {
-  const e = [], { nodeExtensions: t, markExtensions: n } = en(r), i = [...t, ...n], s = {
+  const e = [], { nodeExtensions: t, markExtensions: n } = tn(r), i = [...t, ...n], s = {
     default: null,
     rendered: !0,
     renderHTML: null,
@@ -9695,7 +9695,7 @@ function pi(r) {
 }
 function hc(r, e) {
   var t;
-  const n = Ks(r), { nodeExtensions: i, markExtensions: s } = en(r), o = (t = i.find((c) => x(c, "topNode"))) === null || t === void 0 ? void 0 : t.name, l = Object.fromEntries(i.map((c) => {
+  const n = Ks(r), { nodeExtensions: i, markExtensions: s } = tn(r), o = (t = i.find((c) => x(c, "topNode"))) === null || t === void 0 ? void 0 : t.name, l = Object.fromEntries(i.map((c) => {
     const f = n.filter((y) => y.type === c.name), d = {
       name: c.name,
       options: c.options,
@@ -9798,7 +9798,7 @@ const pc = (r, e = 500) => {
 function ar(r) {
   return Object.prototype.toString.call(r) === "[object RegExp]";
 }
-class tn {
+class kt {
   constructor(e) {
     this.find = e.find, this.handler = e.handler;
   }
@@ -9812,7 +9812,7 @@ const mc = (r, e) => {
   const n = [t.text];
   return n.index = t.index, n.input = r, n.data = t.data, t.replaceWith && (t.text.includes(t.replaceWith) || console.warn('[tiptap warn]: "inputRuleMatch.replaceWith" must be part of "inputRuleMatch.text".'), n.push(t.replaceWith)), n;
 };
-function Mt(r) {
+function Ct(r) {
   var e;
   const { editor: t, from: n, to: i, text: s, rules: o, plugin: l } = r, { view: a } = t;
   if (a.composing)
@@ -9831,13 +9831,13 @@ function Mt(r) {
     const h = mc(d, u.find);
     if (!h)
       return;
-    const p = a.state.tr, m = Zt({
+    const p = a.state.tr, m = Qt({
       state: a.state,
       transaction: p
     }), g = {
       from: n - (h[0].length - s.length),
       to: i
-    }, { commands: y, chain: M, can: w } = new Qt({
+    }, { commands: y, chain: M, can: w } = new en({
       editor: t,
       state: m
     });
@@ -9871,7 +9871,7 @@ function gc(r) {
           let { text: f } = a;
           typeof f == "string" ? f = f : f = lr(b.from(f), o.schema);
           const { from: d } = a, u = d + f.length;
-          Mt({
+          Ct({
             editor: e,
             from: d,
             to: u,
@@ -9884,7 +9884,7 @@ function gc(r) {
     },
     props: {
       handleTextInput(i, s, o, l) {
-        return Mt({
+        return Ct({
           editor: e,
           from: s,
           to: o,
@@ -9896,7 +9896,7 @@ function gc(r) {
       handleDOMEvents: {
         compositionend: (i) => (setTimeout(() => {
           const { $cursor: s } = i.state.selection;
-          s && Mt({
+          s && Ct({
             editor: e,
             from: s.pos,
             to: s.pos,
@@ -9912,7 +9912,7 @@ function gc(r) {
         if (s.key !== "Enter")
           return !1;
         const { $cursor: o } = i.state.selection;
-        return o ? Mt({
+        return o ? Ct({
           editor: e,
           from: o.pos,
           to: o.pos,
@@ -9931,16 +9931,16 @@ function gc(r) {
 function yc(r) {
   return Object.prototype.toString.call(r).slice(8, -1);
 }
-function Ct(r) {
+function wt(r) {
   return yc(r) !== "Object" ? !1 : r.constructor === Object && Object.getPrototypeOf(r) === Object.prototype;
 }
 function nn(r, e) {
   const t = { ...r };
-  return Ct(r) && Ct(e) && Object.keys(e).forEach((n) => {
-    Ct(e[n]) && Ct(r[n]) ? t[n] = nn(r[n], e[n]) : t[n] = e[n];
+  return wt(r) && wt(e) && Object.keys(e).forEach((n) => {
+    wt(e[n]) && wt(r[n]) ? t[n] = nn(r[n], e[n]) : t[n] = e[n];
   }), t;
 }
-class Jt {
+class jt {
   constructor(e = {}) {
     this.type = "mark", this.name = "mark", this.parent = null, this.child = null, this.config = {
       name: this.name,
@@ -9956,7 +9956,7 @@ class Jt {
     })) || {};
   }
   static create(e = {}) {
-    return new Jt(e);
+    return new jt(e);
   }
   configure(e = {}) {
     const t = this.extend({
@@ -9966,7 +9966,7 @@ class Jt {
     return t.name = this.name, t.parent = this.parent, t;
   }
   extend(e = {}) {
-    const t = new Jt(e);
+    const t = new jt(e);
     return t.parent = this, this.child = t, t.name = e.name ? e.name : t.parent.name, e.defaultOptions && Object.keys(e.defaultOptions).length > 0 && console.warn(`[tiptap warn]: BREAKING CHANGE: "defaultOptions" is deprecated. Please use "addOptions" instead. Found in extension: "${t.name}".`), t.options = O(x(t, "addOptions", {
       name: t.name
     })), t.storage = O(x(t, "addStorage", {
@@ -10004,7 +10004,7 @@ const xc = (r, e, t) => {
   }) : [];
 };
 function Sc(r) {
-  const { editor: e, state: t, from: n, to: i, rule: s, pasteEvent: o, dropEvent: l } = r, { commands: a, chain: c, can: f } = new Qt({
+  const { editor: e, state: t, from: n, to: i, rule: s, pasteEvent: o, dropEvent: l } = r, { commands: a, chain: c, can: f } = new en({
     editor: e,
     state: t
   }), d = [];
@@ -10032,7 +10032,7 @@ function Sc(r) {
     });
   }), d.every((h) => h !== null);
 }
-let wt = null;
+let Ot = null;
 const Mc = (r) => {
   var e;
   const t = new ClipboardEvent("paste", {
@@ -10049,7 +10049,7 @@ function Cc(r) {
     l = null;
   }
   const a = ({ state: f, from: d, to: u, rule: h, pasteEvt: p }) => {
-    const m = f.tr, g = Zt({
+    const m = f.tr, g = Qt({
       state: f,
       transaction: m
     });
@@ -10075,9 +10075,9 @@ function Cc(r) {
     view(d) {
       const u = (p) => {
         var m;
-        n = !((m = d.dom.parentElement) === null || m === void 0) && m.contains(p.target) ? d.dom.parentElement : null, n && (wt = e);
+        n = !((m = d.dom.parentElement) === null || m === void 0) && m.contains(p.target) ? d.dom.parentElement : null, n && (Ot = e);
       }, h = () => {
-        wt && (wt = null);
+        Ot && (Ot = null);
       };
       return window.addEventListener("dragstart", u), window.addEventListener("dragend", h), {
         destroy() {
@@ -10089,7 +10089,7 @@ function Cc(r) {
       handleDOMEvents: {
         drop: (d, u) => {
           if (s = n === d.dom.parentElement, l = u, !s) {
-            const h = wt;
+            const h = Ot;
             h && setTimeout(() => {
               const p = h.state.selection;
               p && h.commands.deleteRange({ from: p.from, to: p.to });
@@ -10209,7 +10209,7 @@ class Ge {
         type: xn(o.name, this.schema)
       }, a = [], c = x(o, "addKeyboardShortcuts", l);
       let f = {};
-      if (o.type === "mark" && x(o, "exitable", l) && (f.ArrowRight = () => Jt.handleExit({ editor: e, mark: o })), c) {
+      if (o.type === "mark" && x(o, "exitable", l) && (f.ArrowRight = () => jt.handleExit({ editor: e, mark: o })), c) {
         const m = Object.fromEntries(Object.entries(c()).map(([g, y]) => [g, () => y({ editor: e })]));
         f = { ...f, ...m };
       }
@@ -10250,7 +10250,7 @@ class Ge {
    * @returns An object with all node views where the key is the node name and the value is the node view function
    */
   get nodeViews() {
-    const { editor: e } = this, { nodeExtensions: t } = en(this.extensions);
+    const { editor: e } = this, { nodeExtensions: t } = tn(this.extensions);
     return Object.fromEntries(t.filter((n) => !!x(n, "addNodeView")).map((n) => {
       const i = this.attributes.filter((a) => a.type === n.name), s = {
         name: n.name,
@@ -10435,12 +10435,12 @@ const Oc = ne.create({
   const { from: n, to: i } = r;
   return t && e.delete(n, i), !0;
 }, Bc = () => ({ state: r, dispatch: e }) => nr(r, e), zc = () => ({ commands: r }) => r.keyboardShortcut("Enter"), Fc = () => ({ state: r, dispatch: e }) => Ga(r, e);
-function jt(r, e, t = { strict: !0 }) {
+function qt(r, e, t = { strict: !0 }) {
   const n = Object.keys(e);
   return n.length ? n.every((i) => t.strict ? e[i] === r[i] : ar(e[i]) ? e[i].test(r[i]) : e[i] === r[i]) : !0;
 }
 function _s(r, e, t = {}) {
-  return r.find((n) => n.type === e && jt(
+  return r.find((n) => n.type === e && qt(
     // Only check equality for the attributes that are provided
     Object.fromEntries(Object.keys(t).map((i) => [i, n.attrs[i]])),
     t
@@ -10545,11 +10545,11 @@ const Wc = (r = null, e = {}) => ({ editor: t, view: n, tr: i, dispatch: s }) =>
   }
   return r;
 };
-function Ot(r) {
+function Nt(r) {
   const e = `<body>${r}</body>`, t = new window.DOMParser().parseFromString(e, "text/html").body;
   return Zs(t);
 }
-function qt(r, e, t) {
+function Kt(r, e, t) {
   if (r instanceof xe || r instanceof b)
     return r;
   t = {
@@ -10567,7 +10567,7 @@ function qt(r, e, t) {
     } catch (s) {
       if (t.errorOnInvalidContent)
         throw new Error("[tiptap error]: Invalid JSON content", { cause: s });
-      return console.warn("[tiptap warn]: Invalid content.", "Passed value:", r, "Error:", s), qt("", e, t);
+      return console.warn("[tiptap warn]: Invalid content.", "Passed value:", r, "Error:", s), Kt("", e, t);
     }
   if (i) {
     if (t.errorOnInvalidContent) {
@@ -10590,13 +10590,13 @@ function qt(r, e, t) {
           }
         })
       });
-      if (t.slice ? Se.fromSchema(a).parseSlice(Ot(r), t.parseOptions) : Se.fromSchema(a).parse(Ot(r), t.parseOptions), t.errorOnInvalidContent && o)
+      if (t.slice ? Se.fromSchema(a).parseSlice(Nt(r), t.parseOptions) : Se.fromSchema(a).parse(Nt(r), t.parseOptions), t.errorOnInvalidContent && o)
         throw new Error("[tiptap error]: Invalid HTML content", { cause: new Error(`Invalid element found: ${l}`) });
     }
     const s = Se.fromSchema(e);
-    return t.slice ? s.parseSlice(Ot(r), t.parseOptions).content : s.parse(Ot(r), t.parseOptions);
+    return t.slice ? s.parseSlice(Nt(r), t.parseOptions).content : s.parse(Nt(r), t.parseOptions);
   }
-  return qt("", e, t);
+  return Kt("", e, t);
 }
 function qc(r, e, t) {
   const n = r.steps.length - 1;
@@ -10623,7 +10623,7 @@ const Kc = (r) => !("type" in r), Hc = (r, e, t) => ({ tr: n, dispatch: i, edito
     };
     let l;
     try {
-      l = qt(e, s.schema, {
+      l = Kt(e, s.schema, {
         parseOptions: {
           preserveWhitespace: "full",
           ...t.parseOptions
@@ -10664,14 +10664,14 @@ const Kc = (r) => !("type" in r), Hc = (r, e, t) => ({ tr: n, dispatch: i, edito
   return !0;
 }, Uc = () => ({ state: r, dispatch: e }) => Ka(r, e), Gc = () => ({ state: r, dispatch: e }) => Ha(r, e), _c = () => ({ state: r, dispatch: e }) => Ps(r, e), Yc = () => ({ state: r, dispatch: e }) => Vs(r, e), Xc = () => ({ state: r, dispatch: e, tr: t }) => {
   try {
-    const n = Ht(r.doc, r.selection.$from.pos, -1);
+    const n = Ut(r.doc, r.selection.$from.pos, -1);
     return n == null ? !1 : (t.join(n, 2), e && e(t), !0);
   } catch {
     return !1;
   }
 }, Zc = () => ({ state: r, dispatch: e, tr: t }) => {
   try {
-    const n = Ht(r.doc, r.selection.$from.pos, 1);
+    const n = Ut(r.doc, r.selection.$from.pos, 1);
     return n == null ? !1 : (t.join(n, 2), e && e(t), !0);
   } catch {
     return !1;
@@ -10731,7 +10731,7 @@ function mt(r, e, t = {}) {
       to: p
     });
   });
-  const a = i - n, c = l.filter((d) => o ? o.name === d.node.type.name : !0).filter((d) => jt(d.node.attrs, t, { strict: !1 }));
+  const a = i - n, c = l.filter((d) => o ? o.name === d.node.type.name : !0).filter((d) => qt(d.node.attrs, t, { strict: !1 }));
   return s ? !!c.length : c.reduce((d, u) => d + u.to - u.from, 0) >= a;
 }
 const rf = (r, e = {}) => ({ state: t, dispatch: n }) => {
@@ -10766,7 +10766,7 @@ const af = (r, e) => ({ tr: t, state: n, dispatch: i }) => {
   return !0;
 }, df = () => ({ state: r, dispatch: e }) => zs(r, e), uf = () => ({ state: r, dispatch: e }) => $s(r, e), hf = () => ({ state: r, dispatch: e }) => Xa(r, e), pf = () => ({ state: r, dispatch: e }) => ec(r, e), mf = () => ({ state: r, dispatch: e }) => Qa(r, e);
 function Ln(r, e, t = {}, n = {}) {
-  return qt(r, e, {
+  return Kt(r, e, {
     slice: !1,
     parseOptions: t,
     errorOnInvalidContent: n.errorOnInvalidContent
@@ -10909,7 +10909,7 @@ function to(r, e, t) {
     })));
   }), n;
 }
-function Dt(r, e, t) {
+function At(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,7 +10918,7 @@ function Dt(r, e, t) {
 function Wn(r, e, t = {}) {
   const { empty: n, ranges: i } = r.selection, s = e ? Ee(e, r.schema) : null;
   if (n)
-    return !!(r.storedMarks || r.selection.$from.marks()).filter((d) => s ? s.name === d.type.name : !0).find((d) => jt(d.attrs, t, { strict: !1 }));
+    return !!(r.storedMarks || r.selection.$from.marks()).filter((d) => s ? s.name === d.type.name : !0).find((d) => qt(d.attrs, t, { strict: !1 }));
   let o = 0;
   const l = [];
   if (i.forEach(({ $from: d, $to: u }) => {
@@ -10935,7 +10935,7 @@ function Wn(r, e, t = {}) {
     });
   }), o === 0)
     return !1;
-  const a = l.filter((d) => s ? s.name === d.mark.type.name : !0).filter((d) => jt(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);
+  const a = l.filter((d) => s ? s.name === d.mark.type.name : !0).filter((d) => qt(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 wf(r, e, t = {}) {
@@ -10945,7 +10945,7 @@ function wf(r, e, t = {}) {
   return n === "node" ? mt(r, e, t) : n === "mark" ? Wn(r, e, t) : !1;
 }
 function bi(r, e) {
-  const { nodeExtensions: t } = en(e), n = t.find((o) => o.name === r);
+  const { nodeExtensions: t } = tn(e), n = t.find((o) => o.name === r);
   if (!n)
     return !1;
   const i = {
@@ -11069,7 +11069,7 @@ function ki(r, e) {
   }
 }
 const Rf = ({ 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 = Dt(c, l.node().type.name, l.node().attrs);
+  const { selection: s, doc: o } = e, { $from: l, $to: a } = s, c = i.extensionManager.attributes, f = At(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)
@@ -11112,7 +11112,7 @@ const Rf = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
       for (let j = a.depth - M; j >= a.depth - 3; j -= 1)
         y = b.from(a.node(j).copy(y));
       const w = a.indexAfter(-1) < a.node(-2).childCount ? 1 : a.indexAfter(-2) < a.node(-3).childCount ? 2 : 3, I = {
-        ...Dt(u, a.node().type.name, a.node().attrs),
+        ...At(u, a.node().type.name, a.node().attrs),
         ...e
       }, E = ((o = l.contentMatch.defaultType) === null || o === void 0 ? void 0 : o.createAndFill(I)) || void 0;
       y = y.append(b.from(l.createAndFill(null, E) || void 0));
@@ -11128,10 +11128,10 @@ const Rf = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
     return !0;
   }
   const h = c.pos === a.end() ? d.contentMatchAt(0).defaultType : null, p = {
-    ...Dt(u, d.type.name, d.attrs),
+    ...At(u, d.type.name, d.attrs),
     ...e
   }, m = {
-    ...Dt(u, a.node().type.name, a.node().attrs),
+    ...At(u, a.node().type.name, a.node().attrs),
     ...e
   };
   t.delete(a.pos, c.pos);
@@ -11457,10 +11457,10 @@ const Kf = ne.create({
           const { empty: s, from: o, to: l } = e.selection, a = N.atStart(e.doc).from, c = N.atEnd(e.doc).to;
           if (s || !(o === a && l === c) || !ur(t.doc))
             return;
-          const u = t.tr, h = Zt({
+          const u = t.tr, h = Qt({
             state: t,
             transaction: u
-          }), { commands: p } = new Qt({
+          }), { commands: p } = new en({
             editor: this.editor,
             state: h
           });
@@ -11854,7 +11854,7 @@ class od extends cc {
    * Creates an command manager.
    */
   createCommandManager() {
-    this.commandManager = new Qt({
+    this.commandManager = new en({
       editor: this
     });
   }
@@ -12053,7 +12053,7 @@ class od extends cc {
   }
 }
 function ld(r) {
-  return new tn({
+  return new kt({
     find: r.find,
     handler: ({ state: e, range: t, match: n }) => {
       const i = O(r.getAttributes, void 0, n);
@@ -12072,7 +12072,7 @@ function ld(r) {
   });
 }
 function ad(r) {
-  return new tn({
+  return new kt({
     find: r.find,
     handler: ({ state: e, range: t, match: n }) => {
       const i = O(r.getAttributes, void 0, n) || {}, { tr: s } = e, o = t.from;
@@ -12093,7 +12093,7 @@ function ad(r) {
   });
 }
 function cd(r) {
-  return new tn({
+  return new kt({
     find: r.find,
     handler: ({ state: e, range: t, match: n }) => {
       const i = e.doc.resolve(t.from), s = O(r.getAttributes, void 0, n) || {};
@@ -12104,7 +12104,23 @@ function cd(r) {
   });
 }
 function fd(r) {
-  return new tn({
+  return new kt({
+    find: r.find,
+    handler: ({ state: e, range: t, match: n }) => {
+      let i = r.replace, s = t.from;
+      const o = t.to;
+      if (n[1]) {
+        const l = n[0].lastIndexOf(n[1]);
+        i += n[0].slice(l + n[1].length), s += l;
+        const a = s - o;
+        a > 0 && (i = n[0].slice(l - a, l) + i, s = o);
+      }
+      e.tr.insertText(i, s, o);
+    }
+  });
+}
+function dd(r) {
+  return new kt({
     find: r.find,
     handler: ({ state: e, range: t, match: n, chain: i }) => {
       const s = O(r.getAttributes, void 0, n) || {}, o = e.tr.delete(t.from, t.to), a = o.doc.resolve(t.from).blockRange(), c = a && Kn(a, r.type, s);
@@ -12161,7 +12177,7 @@ class Jn {
     })), t;
   }
 }
-function dd(r) {
+function ud(r) {
   return new kc({
     find: r.find,
     handler: ({ state: e, range: t, match: n, pasteEvent: i }) => {
@@ -12179,26 +12195,27 @@ function dd(r) {
     }
   });
 }
-function ud(r) {
+function hd(r) {
   return r.replace(/[-/\\^$*+?.()|[\]{}]/g, "\\$&");
 }
 export {
-  Ys as A,
-  sd as B,
-  od as C,
+  fd as A,
+  Ys as B,
+  sd as C,
   v as D,
   ne as E,
   b as F,
-  Jt as M,
+  od as G,
+  jt as M,
   Jn as N,
   oe as P,
   N as S,
   C as T,
   Je as a,
   ee as b,
-  dd as c,
+  ud as c,
   td as d,
-  ud as e,
+  hd as e,
   nd as f,
   rd as g,
   to as h,
@@ -12216,8 +12233,8 @@ export {
   ld as t,
   cd as u,
   jo as v,
-  fd as w,
-  Bt as x,
+  dd as w,
+  zt as x,
   id as y,
   ur as z
 };