@jinntec/jinntap 1.13.5 → 1.13.6

package/dist/jinn-tap.es.js

@@ -653,7 +653,7 @@ function Ec(n, e, t, i) {
       return Pt(o, a.cut(0, n.parentOffset).append(t.content).append(a.cut(e.parentOffset)));
     } else {
       let { start: o, end: a } = Bh(t, n);
-      return Pt(s, Tc(n, o, a, e, i));
+      return Pt(s, Ac(n, o, a, e, i));
     }
   else return Pt(s, ir(n, e, i));
 }
@@ -679,9 +679,9 @@ function Ln(n, e, t, i) {
 function Pt(n, e) {
   return n.type.checkContent(e), n.copy(e);
 }
-function Tc(n, e, t, i, r) {
+function Ac(n, e, t, i, r) {
   let s = n.depth > r && Is(n, e, r + 1), o = i.depth > r && Is(t, i, r + 1), a = [];
-  return Ln(null, n, r, a), s && o && e.index(r) == t.index(r) ? (Mc(s, o), zt(Pt(s, Tc(n, e, t, i, r + 1)), a)) : (s && zt(Pt(s, ir(n, e, r + 1)), a), Ln(e, t, r, a), o && zt(Pt(o, ir(t, i, r + 1)), a)), Ln(i, null, r, a), new y(a);
+  return Ln(null, n, r, a), s && o && e.index(r) == t.index(r) ? (Mc(s, o), zt(Pt(s, Ac(n, e, t, i, r + 1)), a)) : (s && zt(Pt(s, ir(n, e, r + 1)), a), Ln(e, t, r, a), o && zt(Pt(o, ir(t, i, r + 1)), a)), Ln(i, null, r, a), new y(a);
 }
 function ir(n, e, t) {
   let i = [];
@@ -1270,7 +1270,7 @@ let mt = class zs {
     if (this.type.spec.toDebugString)
       return this.type.spec.toDebugString(this);
     let e = this.type.name;
-    return this.content.size && (e += "(" + this.content.toStringInner() + ")"), Ac(this.marks, e);
+    return this.content.size && (e += "(" + this.content.toStringInner() + ")"), Tc(this.marks, e);
   }
   /**
   Get the content match in this node at the given index.
@@ -1374,7 +1374,7 @@ class sr extends mt {
     this.text = i;
   }
   toString() {
-    return this.type.spec.toDebugString ? this.type.spec.toDebugString(this) : Ac(this.marks, JSON.stringify(this.text));
+    return this.type.spec.toDebugString ? this.type.spec.toDebugString(this) : Tc(this.marks, JSON.stringify(this.text));
   }
   get textContent() {
     return this.text;
@@ -1402,7 +1402,7 @@ class sr extends mt {
     return e.text = this.text, e;
   }
 }
-function Ac(n, e) {
+function Tc(n, e) {
   for (let t = n.length - 1; t >= 0; t--)
     e = n[t].type.name + "(" + e + ")";
   return e;
@@ -1986,7 +1986,7 @@ class Qh {
     return !this.hasDefault;
   }
 }
-class Ar {
+class Tr {
   /**
   @internal
   */
@@ -2008,7 +2008,7 @@ class Ar {
   */
   static compile(e, t) {
     let i = /* @__PURE__ */ Object.create(null), r = 0;
-    return e.forEach((s, o) => i[s] = new Ar(s, r++, t, o)), i;
+    return e.forEach((s, o) => i[s] = new Tr(s, r++, t, o)), i;
   }
   /**
   When there is a mark of this type in the given set, a new set
@@ -2050,7 +2050,7 @@ class _c {
     let t = this.spec = {};
     for (let r in e)
       t[r] = e[r];
-    t.nodes = Z.from(e.nodes), t.marks = Z.from(e.marks || {}), this.nodes = Ea.compile(this.spec.nodes, this), this.marks = Ar.compile(this.spec.marks, this);
+    t.nodes = Z.from(e.nodes), t.marks = Z.from(e.marks || {}), this.nodes = Ea.compile(this.spec.nodes, this), this.marks = Tr.compile(this.spec.marks, this);
     let i = /* @__PURE__ */ Object.create(null);
     for (let r in this.nodes) {
       if (r in this.marks)
@@ -2172,7 +2172,7 @@ let Bn = class Ps {
   Parse a document from the content of a DOM node.
   */
   parse(e, t = {}) {
-    let i = new Aa(this, t, !1);
+    let i = new Ta(this, t, !1);
     return i.addAll(e, P.none, t.from, t.to), i.finish();
   }
   /**
@@ -2184,7 +2184,7 @@ let Bn = class Ps {
   the left of the input and the end of nodes at the end.
   */
   parseSlice(e, t = {}) {
-    let i = new Aa(this, t, !0);
+    let i = new Ta(this, t, !0);
     return i.addAll(e, P.none, t.from, t.to), w.maxOpen(i.finish());
   }
   /**
@@ -2302,7 +2302,7 @@ const Lc = {
   style: !0,
   title: !0
 }, Bc = { ol: !0, ul: !0 }, Yn = 1, Rs = 2, Fi = 4;
-function Ta(n, e, t) {
+function Aa(n, e, t) {
   return e != null ? (e ? Yn : 0) | (e === "full" ? Rs : 0) : n && n.whitespace == "pre" ? Yn | Rs : t & -5;
 }
 class Ii {
@@ -2338,10 +2338,10 @@ class Ii {
     return this.type ? this.type.inlineContent : this.content.length ? this.content[0].isInline : e.parentNode && !Lc.hasOwnProperty(e.parentNode.nodeName.toLowerCase());
   }
 }
-class Aa {
+class Ta {
   constructor(e, t, i) {
     this.parser = e, this.options = t, this.isOpen = i, this.open = 0, this.localPreserveWS = !1;
-    let r = t.topNode, s, o = Ta(null, t.preserveWhitespace, 0) | (i ? Fi : 0);
+    let r = t.topNode, s, o = Aa(null, t.preserveWhitespace, 0) | (i ? Fi : 0);
     r ? s = new Ii(r.type, r.attrs, P.none, !0, t.topMatch || r.type.contentMatch, o) : i ? s = new Ii(null, null, P.none, !0, null, o) : s = new Ii(e.schema.topNodeType, null, P.none, !0, null, o), this.nodes = [s], this.find = t.findPositions, this.needsBlock = !1;
   }
   get top() {
@@ -2515,7 +2515,7 @@ class Aa {
     this.closeExtra();
     let o = this.top;
     o.match = o.match && o.match.matchType(e);
-    let a = Ta(e, s, o.options);
+    let a = Aa(e, s, o.options);
     o.options & Fi && o.content.length == 0 && (a |= Fi);
     let l = P.none;
     return i = i.filter((c) => (o.type ? o.type.allowsMarkType(c.type) : Da(c.type, e)) ? (l = c.addToSet(l), !1) : !0), this.nodes.push(new Ii(e, t, l, r, null, a)), this.open++, i;
@@ -3458,7 +3458,7 @@ function cp(n, e, t, i) {
       return;
     s++;
     let l = null;
-    if (i instanceof Ar) {
+    if (i instanceof Tr) {
       let c = o.marks, u;
       for (; u = i.isInSet(c); )
         (l || (l = [])).push(u), c = u.removeFromSet(c);
@@ -3955,8 +3955,8 @@ function Mp(n, e, t, i) {
       for (let m = 0; m < o.length; m++) {
         let g = o[(m + l) % o.length], b = !0;
         g < 0 && (b = !1, g = -g);
-        let k = r.node(g - 1), S = r.index(g - 1);
-        if (k.canReplaceWith(S, S, f.type, f.marks))
+        let k = r.node(g - 1), x = r.index(g - 1);
+        if (k.canReplaceWith(x, x, f.type, f.marks))
           return n.replace(r.before(g), b ? s.after(g) : t, new w(Gc(i.content, 0, i.openStart, p), p, i.openEnd));
       }
   }
@@ -3977,14 +3977,14 @@ function Gc(n, e, t, i, r) {
   }
   return n;
 }
-function Tp(n, e, t, i) {
+function Ap(n, e, t, i) {
   if (!i.isInline && e == t && n.doc.resolve(e).parent.content.size) {
     let r = vp(n.doc, e, i.type);
     r != null && (e = t = r);
   }
   n.replaceRange(e, t, new w(y.from(i), 0, 0));
 }
-function Ap(n, e, t) {
+function Tp(n, e, t) {
   let i = n.doc.resolve(e), r = n.doc.resolve(t), s = Yc(i, r);
   for (let o = 0; o < s.length; o++) {
     let a = s[o], l = o == s.length - 1;
@@ -4192,14 +4192,14 @@ class Op {
   that parent node.
   */
   replaceRangeWith(e, t, i) {
-    return Tp(this, e, t, i), this;
+    return Ap(this, e, t, i), this;
   }
   /**
   Delete the given range, expanding it to cover fully covered
   parent nodes until a valid replace is found.
   */
   deleteRange(e, t) {
-    return Ap(this, e, t), this;
+    return Tp(this, e, t), this;
   }
   /**
   Split the content in the given range off from its parent, if there
@@ -4409,7 +4409,7 @@ class D {
   found.
   */
   static findFrom(e, t, i = !1) {
-    let r = e.parent.inlineContent ? new C(e) : Zt(e.node(0), e.parent, e.pos, e.index(), t, i);
+    let r = e.parent.inlineContent ? new E(e) : Zt(e.node(0), e.parent, e.pos, e.index(), t, i);
     if (r)
       return r;
     for (let s = e.depth - 1; s >= 0; s--) {
@@ -4476,7 +4476,7 @@ class D {
   returns the bookmark for that.
   */
   getBookmark() {
-    return C.between(this.$anchor, this.$head).getBookmark();
+    return E.between(this.$anchor, this.$head).getBookmark();
   }
 }
 D.prototype.visible = !0;
@@ -4492,7 +4492,7 @@ let Ra = !1;
 function _a(n) {
   !Ra && !n.parent.inlineContent && (Ra = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + n.parent.type.name + ")"));
 }
-class C extends D {
+class E extends D {
   /**
   Construct a text selection between the given points.
   */
@@ -4511,7 +4511,7 @@ class C extends D {
     if (!i.parent.inlineContent)
       return D.near(i);
     let r = e.resolve(t.map(this.anchor));
-    return new C(r.parent.inlineContent ? r : i, i);
+    return new E(r.parent.inlineContent ? r : i, i);
   }
   replace(e, t = w.empty) {
     if (super.replace(e, t), t == w.empty) {
@@ -4520,7 +4520,7 @@ class C extends D {
     }
   }
   eq(e) {
-    return e instanceof C && e.anchor == this.anchor && e.head == this.head;
+    return e instanceof E && e.anchor == this.anchor && e.head == this.head;
   }
   getBookmark() {
     return new Nr(this.anchor, this.head);
@@ -4534,7 +4534,7 @@ class C extends D {
   static fromJSON(e, t) {
     if (typeof t.anchor != "number" || typeof t.head != "number")
       throw new RangeError("Invalid input for TextSelection.fromJSON");
-    return new C(e.resolve(t.anchor), e.resolve(t.head));
+    return new E(e.resolve(t.anchor), e.resolve(t.head));
   }
   /**
   Create a text selection from non-resolved positions.
@@ -4560,10 +4560,10 @@ class C extends D {
       else
         return D.near(t, i);
     }
-    return e.parent.inlineContent || (r == 0 ? e = t : (e = (D.findFrom(e, -i, !0) || D.findFrom(e, i, !0)).$anchor, e.pos < t.pos != r < 0 && (e = t))), new C(e, t);
+    return e.parent.inlineContent || (r == 0 ? e = t : (e = (D.findFrom(e, -i, !0) || D.findFrom(e, i, !0)).$anchor, e.pos < t.pos != r < 0 && (e = t))), new E(e, t);
   }
 }
-D.jsonID("text", C);
+D.jsonID("text", E);
 class Nr {
   constructor(e, t) {
     this.anchor = e, this.head = t;
@@ -4572,10 +4572,10 @@ class Nr {
     return new Nr(e.map(this.anchor), e.map(this.head));
   }
   resolve(e) {
-    return C.between(e.resolve(this.anchor), e.resolve(this.head));
+    return E.between(e.resolve(this.anchor), e.resolve(this.head));
   }
 }
-class x extends D {
+class S extends D {
   /**
   Create a node selection. Does not verify the validity of its
   argument.
@@ -4586,13 +4586,13 @@ class x extends D {
   }
   map(e, t) {
     let { deleted: i, pos: r } = t.mapResult(this.anchor), s = e.resolve(r);
-    return i ? D.near(s) : new x(s);
+    return i ? D.near(s) : new S(s);
   }
   content() {
     return new w(y.from(this.node), 0, 0);
   }
   eq(e) {
-    return e instanceof x && e.anchor == this.anchor;
+    return e instanceof S && e.anchor == this.anchor;
   }
   toJSON() {
     return { type: "node", anchor: this.anchor };
@@ -4606,13 +4606,13 @@ class x extends D {
   static fromJSON(e, t) {
     if (typeof t.anchor != "number")
       throw new RangeError("Invalid input for NodeSelection.fromJSON");
-    return new x(e.resolve(t.anchor));
+    return new S(e.resolve(t.anchor));
   }
   /**
   Create a node selection from non-resolved positions.
   */
   static create(e, t) {
-    return new x(e.resolve(t));
+    return new S(e.resolve(t));
   }
   /**
   Determines whether the given node may be selected as a node
@@ -4622,8 +4622,8 @@ class x extends D {
     return !e.isText && e.type.spec.selectable !== !1;
   }
 }
-x.prototype.visible = !1;
-D.jsonID("node", x);
+S.prototype.visible = !1;
+D.jsonID("node", S);
 class Co {
   constructor(e) {
     this.anchor = e;
@@ -4634,7 +4634,7 @@ class Co {
   }
   resolve(e) {
     let t = e.resolve(this.anchor), i = t.nodeAfter;
-    return i && x.isSelectable(i) ? new x(t) : D.near(t);
+    return i && S.isSelectable(i) ? new S(t) : D.near(t);
   }
 }
 class ge extends D {
@@ -4682,12 +4682,12 @@ const Np = {
 };
 function Zt(n, e, t, i, r, s = !1) {
   if (e.inlineContent)
-    return C.create(n, t);
+    return E.create(n, t);
   for (let o = i - (r > 0 ? 0 : 1); r > 0 ? o < e.childCount : o >= 0; o += r) {
     let a = e.child(o);
     if (a.isAtom) {
-      if (!s && x.isSelectable(a))
-        return x.create(n, t - (r < 0 ? a.nodeSize : 0));
+      if (!s && S.isSelectable(a))
+        return S.create(n, t - (r < 0 ? a.nodeSize : 0));
     } else {
       let l = Zt(n, a, t + r, r < 0 ? a.childCount : 0, r, s);
       if (l)
@@ -5207,7 +5207,7 @@ function ki(n) {
 const Ir = function(n) {
   return n.focusNode && Ft(n.focusNode, n.focusOffset, n.anchorNode, n.anchorOffset);
 };
-function Tt(n, e) {
+function At(n, e) {
   let t = document.createEvent("Event");
   return t.initEvent("keydown", !0, !0), t.keyCode = n, t.key = t.code = e, t;
 }
@@ -5567,10 +5567,10 @@ let Wa = null, Ja = null, Ka = !1;
 function rf(n, e, t) {
   return Wa == e && Ja == t ? Ka : (Wa = e, Ja = t, Ka = t == "up" || t == "down" ? ef(n, e, t) : nf(n, e, t));
 }
-const Ae = 0, Ga = 1, Dt = 2, Ue = 3;
+const Te = 0, Ga = 1, Dt = 2, Ue = 3;
 class xi {
   constructor(e, t, i, r) {
-    this.parent = e, this.children = t, this.dom = i, this.contentDOM = r, this.dirty = Ae, i.pmViewDesc = this;
+    this.parent = e, this.children = t, this.dom = i, this.contentDOM = r, this.dirty = Te, i.pmViewDesc = this;
   }
   // Used to check whether a given description corresponds to a
   // widget/mark/node.
@@ -5927,7 +5927,7 @@ class au extends xi {
     super(e, [], o, null), this.widget = t, this.widget = t, s = this;
   }
   matchesWidget(e) {
-    return this.dirty == Ae && e.type.eq(this.widget.type);
+    return this.dirty == Te && e.type.eq(this.widget.type);
   }
   parseRule() {
     return { ignore: !0 };
@@ -5981,11 +5981,11 @@ class qt extends xi {
     return this.dirty != Ue && this.mark.eq(e);
   }
   markDirty(e, t) {
-    if (super.markDirty(e, t), this.dirty != Ae) {
+    if (super.markDirty(e, t), this.dirty != Te) {
       let i = this.parent;
       for (; !i.node; )
         i = i.parent;
-      i.dirty < this.dirty && (i.dirty = this.dirty), this.dirty = Ae;
+      i.dirty < this.dirty && (i.dirty = this.dirty), this.dirty = Te;
     }
   }
   slice(e, t, i) {
@@ -6053,7 +6053,7 @@ class bt extends xi {
     return e;
   }
   matchesNode(e, t, i) {
-    return this.dirty == Ae && e.eq(this.node) && or(t, this.outerDeco) && i.eq(this.innerDeco);
+    return this.dirty == Te && e.eq(this.node) && or(t, this.outerDeco) && i.eq(this.innerDeco);
   }
   get size() {
     return this.node.nodeSize;
@@ -6077,7 +6077,7 @@ class bt extends xi {
   }
   localCompositionInfo(e, t) {
     let { from: i, to: r } = e.state.selection;
-    if (!(e.state.selection instanceof C) || i < t || r > t + this.node.content.size)
+    if (!(e.state.selection instanceof E) || i < t || r > t + this.node.content.size)
       return null;
     let s = e.input.compositionNode;
     if (!s || !this.dom.contains(s.parentNode))
@@ -6108,7 +6108,7 @@ class bt extends xi {
     return this.dirty == Ue || !e.sameMarkup(this.node) ? !1 : (this.updateInner(e, t, i, r), !0);
   }
   updateInner(e, t, i, r) {
-    this.updateOuterDeco(t), this.node = e, this.innerDeco = i, this.contentDOM && this.updateChildren(r, this.posAtStart), this.dirty = Ae;
+    this.updateOuterDeco(t), this.node = e, this.innerDeco = i, this.contentDOM && this.updateChildren(r, this.posAtStart), this.dirty = Te;
   }
   updateOuterDeco(e) {
     if (or(e, this.outerDeco))
@@ -6144,7 +6144,7 @@ class zr extends bt {
     return { skip: e || !0 };
   }
   update(e, t, i, r) {
-    return this.dirty == Ue || this.dirty != Ae && !this.inParent() || !e.sameMarkup(this.node) ? !1 : (this.updateOuterDeco(t), (this.dirty != Ae || e.text != this.node.text) && e.text != this.nodeDOM.nodeValue && (this.nodeDOM.nodeValue = e.text, r.trackWrites == this.nodeDOM && (r.trackWrites = null)), this.node = e, this.dirty = Ae, !0);
+    return this.dirty == Ue || this.dirty != Te && !this.inParent() || !e.sameMarkup(this.node) ? !1 : (this.updateOuterDeco(t), (this.dirty != Te || e.text != this.node.text) && e.text != this.nodeDOM.nodeValue && (this.nodeDOM.nodeValue = e.text, r.trackWrites == this.nodeDOM && (r.trackWrites = null)), this.node = e, this.dirty = Te, !0);
   }
   inParent() {
     let e = this.parent.contentDOM;
@@ -6181,7 +6181,7 @@ class lu extends xi {
     return { ignore: !0 };
   }
   matchesHack(e) {
-    return this.dirty == Ae && this.dom.nodeName == e;
+    return this.dirty == Te && this.dom.nodeName == e;
   }
   get domAtom() {
     return !0;
@@ -6339,7 +6339,7 @@ class lf {
     for (; r < o && (r == s - 1 ? this.top : this.stack[r + 1 << 1]).matchesMark(e[r]) && e[r].type.spec.spanning !== !1; )
       r++;
     for (; r < s; )
-      this.destroyRest(), this.top.dirty = Ae, this.index = this.stack.pop(), this.top = this.stack.pop(), s--;
+      this.destroyRest(), this.top.dirty = Te, this.index = this.stack.pop(), this.top = this.stack.pop(), s--;
     for (; s < e.length; ) {
       this.stack.push(this.top, this.index + 1);
       let a = -1;
@@ -6409,7 +6409,7 @@ class lf {
         if (!h && l.update(e, t, i, r))
           return this.destroyBetween(this.index, a), l.dom != u && (this.changed = !0), this.index++, !0;
         if (!h && (d = this.recreateWrapper(l, e, t, i, r, o)))
-          return this.destroyBetween(this.index, a), this.top.children[this.index] = d, d.contentDOM && (d.dirty = Dt, d.updateChildren(r, o + 1), d.dirty = Ae), this.changed = !0, this.index++, !0;
+          return this.destroyBetween(this.index, a), this.top.children[this.index] = d, d.contentDOM && (d.dirty = Dt, d.updateChildren(r, o + 1), d.dirty = Te), this.changed = !0, this.index++, !0;
         break;
       }
     }
@@ -6593,9 +6593,9 @@ function Mo(n, e = null) {
     for (l = o; r && !r.node; )
       r = r.parent;
     let d = r.node;
-    if (r && d.isAtom && x.isSelectable(d) && r.parent && !(d.isInline && Bp(t.focusNode, t.focusOffset, r.dom))) {
+    if (r && d.isAtom && S.isSelectable(d) && r.parent && !(d.isInline && Bp(t.focusNode, t.focusOffset, r.dom))) {
       let h = r.posBefore;
-      c = new x(o == h ? a : i.resolve(h));
+      c = new S(o == h ? a : i.resolve(h));
     }
   } else {
     if (t instanceof n.dom.ownerDocument.defaultView.Selection && t.rangeCount > 1) {
@@ -6615,7 +6615,7 @@ function Mo(n, e = null) {
   let u = i.resolve(l);
   if (!c) {
     let d = e == "pointer" || n.state.selection.head < a.pos && !s ? 1 : -1;
-    c = To(n, u, a, d);
+    c = Ao(n, u, a, d);
   }
   return c;
 }
@@ -6636,7 +6636,7 @@ function Qe(n, e = !1) {
       mf(n);
     else {
       let { anchor: i, head: r } = t, s, o;
-      Qa && !(t instanceof C) && (t.$from.parent.inlineContent || (s = Za(n, t.from)), !t.empty && !t.$from.parent.inlineContent && (o = Za(n, t.to))), n.docView.setSelection(i, r, n, e), Qa && (s && el(s), o && el(o)), t.visible ? n.dom.classList.remove("ProseMirror-hideselection") : (n.dom.classList.add("ProseMirror-hideselection"), "onselectionchange" in document && ff(n));
+      Qa && !(t instanceof E) && (t.$from.parent.inlineContent || (s = Za(n, t.from)), !t.empty && !t.$from.parent.inlineContent && (o = Za(n, t.to))), n.docView.setSelection(i, r, n, e), Qa && (s && el(s), o && el(o)), t.visible ? n.dom.classList.remove("ProseMirror-hideselection") : (n.dom.classList.add("ProseMirror-hideselection"), "onselectionchange" in document && ff(n));
     }
     n.domObserver.setCurSelection(), n.domObserver.connectSelection();
   }
@@ -6677,7 +6677,7 @@ function mf(n) {
   r ? t.setStart(i.parentNode, ee(i) + 1) : t.setStart(i, 0), t.collapse(!0), e.removeAllRanges(), e.addRange(t), !r && !n.state.selection.visible && be && gt <= 11 && (i.disabled = !0, i.disabled = !1);
 }
 function pu(n, e) {
-  if (e instanceof x) {
+  if (e instanceof S) {
     let t = n.docView.descAt(e.from);
     t != n.lastSelectedViewDesc && (tl(n), t && t.selectNode(), n.lastSelectedViewDesc = t);
   } else
@@ -6686,8 +6686,8 @@ function pu(n, e) {
 function tl(n) {
   n.lastSelectedViewDesc && (n.lastSelectedViewDesc.parent && n.lastSelectedViewDesc.deselectNode(), n.lastSelectedViewDesc = void 0);
 }
-function To(n, e, t, i) {
-  return n.someProp("createSelectionBetween", (r) => r(n, e, t)) || C.between(e, t, i);
+function Ao(n, e, t, i) {
+  return n.someProp("createSelectionBetween", (r) => r(n, e, t)) || E.between(e, t, i);
 }
 function nl(n) {
   return n.editable && !n.hasFocus() ? !1 : fu(n);
@@ -6715,28 +6715,28 @@ function at(n, e) {
 }
 function il(n, e, t) {
   let i = n.state.selection;
-  if (i instanceof C)
+  if (i instanceof E)
     if (t.indexOf("s") > -1) {
       let { $head: r } = i, s = r.textOffset ? null : e < 0 ? r.nodeBefore : r.nodeAfter;
       if (!s || s.isText || !s.isLeaf)
         return !1;
       let o = n.state.doc.resolve(r.pos + s.nodeSize * (e < 0 ? -1 : 1));
-      return at(n, new C(i.$anchor, o));
+      return at(n, new E(i.$anchor, o));
     } else if (i.empty) {
       if (n.endOfTextblock(e > 0 ? "forward" : "backward")) {
         let r = Us(n.state, e);
-        return r && r instanceof x ? at(n, r) : !1;
+        return r && r instanceof S ? at(n, r) : !1;
       } else if (!(Ce && t.indexOf("m") > -1)) {
         let r = i.$head, s = r.textOffset ? null : e < 0 ? r.nodeBefore : r.nodeAfter, o;
         if (!s || s.isText)
           return !1;
         let a = e < 0 ? r.pos - s.nodeSize : r.pos;
-        return s.isAtom || (o = n.docView.descAt(a)) && !o.contentDOM ? x.isSelectable(s) ? at(n, new x(e < 0 ? n.state.doc.resolve(r.pos - s.nodeSize) : r)) : vi ? at(n, new C(n.state.doc.resolve(e < 0 ? a : a + s.nodeSize))) : !1 : !1;
+        return s.isAtom || (o = n.docView.descAt(a)) && !o.contentDOM ? S.isSelectable(s) ? at(n, new S(e < 0 ? n.state.doc.resolve(r.pos - s.nodeSize) : r)) : vi ? at(n, new E(n.state.doc.resolve(e < 0 ? a : a + s.nodeSize))) : !1 : !1;
       }
     } else return !1;
   else {
-    if (i instanceof x && i.node.isInline)
-      return at(n, new C(e > 0 ? i.$to : i.$from));
+    if (i instanceof S && i.node.isInline)
+      return at(n, new E(e > 0 ? i.$to : i.$from));
     {
       let r = Us(n.state, e);
       return r ? at(n, r) : !1;
@@ -6886,12 +6886,12 @@ function rl(n, e) {
 }
 function sl(n, e, t) {
   let i = n.state.selection;
-  if (i instanceof C && !i.empty || t.indexOf("s") > -1 || Ce && t.indexOf("m") > -1)
+  if (i instanceof E && !i.empty || t.indexOf("s") > -1 || Ce && t.indexOf("m") > -1)
     return !1;
   let { $from: r, $to: s } = i;
   if (!r.parent.inlineContent || n.endOfTextblock(e < 0 ? "up" : "down")) {
     let o = Us(n.state, e);
-    if (o && o instanceof x)
+    if (o && o instanceof S)
       return at(n, o);
   }
   if (!r.parent.inlineContent) {
@@ -6901,7 +6901,7 @@ function sl(n, e, t) {
   return !1;
 }
 function ol(n, e) {
-  if (!(n.state.selection instanceof C))
+  if (!(n.state.selection instanceof E))
     return !0;
   let { $head: t, $anchor: i, empty: r } = n.state.selection;
   if (!t.sameParent(i))
@@ -6958,7 +6958,7 @@ function Sf(n, e) {
   }
   return !1;
 }
-function Ao(n, e) {
+function To(n, e) {
   n.someProp("transformCopied", (p) => {
     e = p(e, n);
   });
@@ -7010,7 +7010,7 @@ function gu(n, e, t, i, r) {
   } else
     n.someProp("transformPastedHTML", (d) => {
       t = d(t, n);
-    }), o = Tf(t), vi && Af(o);
+    }), o = Af(t), vi && Tf(o);
   let c = o && o.querySelector("[data-pm-slice]"), u = c && /^(\d+) (\d+)(?: -(\d+))? (.*)/.exec(c.getAttribute("data-pm-slice") || "");
   if (u && u[3])
     for (let d = +u[3]; d > 0; d--) {
@@ -7112,7 +7112,7 @@ function Mf(n) {
   let e = window.trustedTypes;
   return e ? (ls || (ls = e.defaultPolicy || e.createPolicy("ProseMirrorClipboard", { createHTML: (t) => t })), ls.createHTML(n)) : n;
 }
-function Tf(n) {
+function Af(n) {
   let e = /^(\s*<meta [^>]*>)*/.exec(n);
   e && (n = n.slice(e[0].length));
   let t = vu().createElement("div"), i = /<([a-z][^>\s]+)/i.exec(n), r;
@@ -7121,7 +7121,7 @@ function Tf(n) {
       t = t.querySelector(r[s]) || t;
   return t;
 }
-function Af(n) {
+function Tf(n) {
   let e = n.querySelectorAll(se ? "span:not([class]):not([style])" : "span.Apple-converted-space");
   for (let t = 0; t < e.length; t++) {
     let i = e[t];
@@ -7201,7 +7201,7 @@ he.keydown = (n, e) => {
     if (t.keyCode != 229 && n.domObserver.forceFlush(), gn && t.keyCode == 13 && !t.ctrlKey && !t.altKey && !t.metaKey) {
       let i = Date.now();
       n.input.lastIOSEnter = i, n.input.lastIOSEnterFallbackTimeout = setTimeout(() => {
-        n.input.lastIOSEnter == i && (n.someProp("handleKeyDown", (r) => r(n, Tt(13, "Enter"))), n.input.lastIOSEnter = 0);
+        n.input.lastIOSEnter == i && (n.someProp("handleKeyDown", (r) => r(n, At(13, "Enter"))), n.input.lastIOSEnter = 0);
       }, 200);
     } else n.someProp("handleKeyDown", (i) => i(n, t)) || Sf(n, t) ? t.preventDefault() : pt(n, "key");
 };
@@ -7217,7 +7217,7 @@ he.keypress = (n, e) => {
     return;
   }
   let i = n.state.selection;
-  if (!(i instanceof C) || !i.$from.sameParent(i.$to)) {
+  if (!(i instanceof E) || !i.$from.sameParent(i.$to)) {
     let r = String.fromCharCode(t.charCode);
     !/[\r\n]/.test(r) && !n.someProp("handleTextInput", (s) => s(n, i.$from.pos, i.$to.pos, r)) && n.dispatch(n.state.tr.insertText(r).scrollIntoView()), t.preventDefault();
   }
@@ -7248,22 +7248,22 @@ function Lf(n, e) {
   if (e == -1)
     return !1;
   let t = n.state.doc.resolve(e), i = t.nodeAfter;
-  return i && i.isAtom && x.isSelectable(i) ? (on(n, new x(t)), !0) : !1;
+  return i && i.isAtom && S.isSelectable(i) ? (on(n, new S(t)), !0) : !1;
 }
 function Bf(n, e) {
   if (e == -1)
     return !1;
   let t = n.state.selection, i, r;
-  t instanceof x && (i = t.node);
+  t instanceof S && (i = t.node);
   let s = n.state.doc.resolve(e);
   for (let o = s.depth + 1; o > 0; o--) {
     let a = o > s.depth ? s.nodeAfter : s.node(o);
-    if (x.isSelectable(a)) {
+    if (S.isSelectable(a)) {
       i && t.$from.depth > 0 && o >= t.$from.depth && s.before(t.$from.depth + 1) == t.$from.pos ? r = s.before(t.$from.depth) : r = s.before(o);
       break;
     }
   }
-  return r != null ? (on(n, x.create(n.state.doc, r)), !0) : !1;
+  return r != null ? (on(n, S.create(n.state.doc, r)), !0) : !1;
 }
 function jf(n, e, t, i, r) {
   return Do(n, "handleClickOn", e, t, i) || n.someProp("handleClick", (s) => s(n, e, i)) || (r ? Bf(n, t) : Lf(n, t));
@@ -7279,14 +7279,14 @@ function Ff(n, e, t) {
     return !1;
   let i = n.state.doc;
   if (e == -1)
-    return i.inlineContent ? (on(n, C.create(i, 0, i.content.size)), !0) : !1;
+    return i.inlineContent ? (on(n, E.create(i, 0, i.content.size)), !0) : !1;
   let r = i.resolve(e);
   for (let s = r.depth + 1; s > 0; s--) {
     let o = s > r.depth ? r.nodeAfter : r.node(s), a = r.before(s);
     if (o.inlineContent)
-      on(n, C.create(i, a + 1, a + 1 + o.content.size));
-    else if (x.isSelectable(o))
-      on(n, x.create(i, a));
+      on(n, E.create(i, a + 1, a + 1 + o.content.size));
+    else if (S.isSelectable(o))
+      on(n, S.create(i, a));
     else
       continue;
     return !0;
@@ -7317,7 +7317,7 @@ class qf {
     const a = r ? null : i.target, l = a ? e.docView.nearestDesc(a, !0) : null;
     this.target = l && l.dom.nodeType == 1 ? l.dom : null;
     let { selection: c } = e.state;
-    (i.button == 0 && s.type.spec.draggable && s.type.spec.selectable !== !1 || c instanceof x && c.from <= o && c.to > o) && (this.mightDrag = {
+    (i.button == 0 && s.type.spec.draggable && s.type.spec.selectable !== !1 || c instanceof S && c.from <= o && c.to > o) && (this.mightDrag = {
       node: s,
       pos: o,
       addAttr: !!(this.target && !this.target.draggable),
@@ -7365,7 +7365,7 @@ he.compositionstart = he.compositionupdate = (n) => {
   if (!n.composing) {
     n.domObserver.flush();
     let { state: e } = n, t = e.selection.$to;
-    if (e.selection instanceof C && (e.storedMarks || !t.textOffset && t.parentOffset && t.nodeBefore.marks.some((i) => i.type.spec.inclusive === !1)))
+    if (e.selection instanceof E && (e.storedMarks || !t.textOffset && t.parentOffset && t.nodeBefore.marks.some((i) => i.type.spec.inclusive === !1)))
       n.markCursor = n.state.storedMarks || t.marks(), lr(n, !0), n.markCursor = null;
     else if (lr(n, !e.selection.empty), ze && e.selection.empty && t.parentOffset && !t.textOffset && t.nodeBefore.marks.length) {
       let i = n.domSelectionRange();
@@ -7442,7 +7442,7 @@ de.copy = he.cut = (n, e) => {
   let t = e, i = n.state.selection, r = t.type == "cut";
   if (i.empty)
     return;
-  let s = Zn ? null : t.clipboardData, o = i.content(), { dom: a, text: l } = Ao(n, o);
+  let s = Zn ? null : t.clipboardData, o = i.content(), { dom: a, text: l } = To(n, o);
   s ? (t.preventDefault(), s.clearData(), s.setData("text/html", a.innerHTML), s.setData("text/plain", l)) : Jf(n, a), r && n.dispatch(n.state.tr.deleteSelection().scrollIntoView().setMeta("uiEvent", "cut"));
 };
 function Kf(n) {
@@ -7481,13 +7481,13 @@ he.paste = (n, e) => {
   let i = Zn ? null : t.clipboardData, r = n.input.shiftKey && n.input.lastKeyCode != 45;
   i && ei(n, Mu(i), i.getData("text/html"), r, t) ? t.preventDefault() : Gf(n, t);
 };
-class Tu {
+class Au {
   constructor(e, t, i) {
     this.slice = e, this.move = t, this.node = i;
   }
 }
 const Yf = Ce ? "altKey" : "ctrlKey";
-function Au(n, e) {
+function Tu(n, e) {
   let t = n.someProp("dragCopies", (i) => !i(e));
   return t ?? !e[Yf];
 }
@@ -7496,16 +7496,16 @@ de.dragstart = (n, e) => {
   if (i && i.done(), !t.dataTransfer)
     return;
   let r = n.state.selection, s = r.empty ? null : n.posAtCoords(Pr(t)), o;
-  if (!(s && s.pos >= r.from && s.pos <= (r instanceof x ? r.to - 1 : r.to))) {
+  if (!(s && s.pos >= r.from && s.pos <= (r instanceof S ? r.to - 1 : r.to))) {
     if (i && i.mightDrag)
-      o = x.create(n.state.doc, i.mightDrag.pos);
+      o = S.create(n.state.doc, i.mightDrag.pos);
     else if (t.target && t.target.nodeType == 1) {
       let d = n.docView.nearestDesc(t.target, !0);
-      d && d.node.type.spec.draggable && d != n.docView && (o = x.create(n.state.doc, d.posBefore));
+      d && d.node.type.spec.draggable && d != n.docView && (o = S.create(n.state.doc, d.posBefore));
     }
   }
-  let a = (o || n.state.selection).content(), { dom: l, text: c, slice: u } = Ao(n, a);
-  (!t.dataTransfer.files.length || !se || eu > 120) && t.dataTransfer.clearData(), t.dataTransfer.setData(Zn ? "Text" : "text/html", l.innerHTML), t.dataTransfer.effectAllowed = "copyMove", Zn || t.dataTransfer.setData("text/plain", c), n.dragging = new Tu(u, Au(n, t), o);
+  let a = (o || n.state.selection).content(), { dom: l, text: c, slice: u } = To(n, a);
+  (!t.dataTransfer.files.length || !se || eu > 120) && t.dataTransfer.clearData(), t.dataTransfer.setData(Zn ? "Text" : "text/html", l.innerHTML), t.dataTransfer.effectAllowed = "copyMove", Zn || t.dataTransfer.setData("text/plain", c), n.dragging = new Au(u, Tu(n, t), o);
 };
 de.dragend = (n) => {
   let e = n.dragging;
@@ -7525,7 +7525,7 @@ he.drop = (n, e) => {
   o ? n.someProp("transformPasted", (f) => {
     o = f(o, n);
   }) : o = gu(n, Mu(t.dataTransfer), Zn ? null : t.dataTransfer.getData("text/html"), !1, s);
-  let a = !!(i && Au(n, t));
+  let a = !!(i && Tu(n, t));
   if (n.someProp("handleDrop", (f) => f(n, t, o || w.empty, a))) {
     t.preventDefault();
     return;
@@ -7544,11 +7544,11 @@ he.drop = (n, e) => {
   if (d ? c.replaceRangeWith(u, u, o.content.firstChild) : c.replaceRange(u, u, o), c.doc.eq(h))
     return;
   let p = c.doc.resolve(u);
-  if (d && x.isSelectable(o.content.firstChild) && p.nodeAfter && p.nodeAfter.sameMarkup(o.content.firstChild))
-    c.setSelection(new x(p));
+  if (d && S.isSelectable(o.content.firstChild) && p.nodeAfter && p.nodeAfter.sameMarkup(o.content.firstChild))
+    c.setSelection(new S(p));
   else {
     let f = c.mapping.map(l);
-    c.mapping.maps[c.mapping.maps.length - 1].forEach((m, g, b, k) => f = k), c.setSelection(To(n, p, c.doc.resolve(f)));
+    c.mapping.maps[c.mapping.maps.length - 1].forEach((m, g, b, k) => f = k), c.setSelection(Ao(n, p, c.doc.resolve(f)));
   }
   n.focus(), n.dispatch(c.setMeta("uiEvent", "drop"));
 };
@@ -7566,7 +7566,7 @@ de.beforeinput = (n, e) => {
     n.domObserver.flushSoon();
     let { domChangeCount: i } = n.input;
     setTimeout(() => {
-      if (n.input.domChangeCount != i || (n.dom.blur(), n.focus(), n.someProp("handleKeyDown", (s) => s(n, Tt(8, "Backspace")))))
+      if (n.input.domChangeCount != i || (n.dom.blur(), n.focus(), n.someProp("handleKeyDown", (s) => s(n, At(8, "Backspace")))))
         return;
       let { $cursor: r } = n.state.selection;
       r && r.pos > 0 && n.dispatch(n.state.tr.delete(r.pos - 1, r.pos).scrollIntoView());
@@ -7959,8 +7959,8 @@ function Xf(n, e, t, i, r, s, o) {
         let k = a[b + 1];
         if (k < 0 || h > k + u - d)
           continue;
-        let S = a[b] + u - d;
-        p >= S ? a[b + 1] = h <= S ? -2 : -1 : h >= u && g && (a[b] += g, a[b + 1] += g);
+        let x = a[b] + u - d;
+        p >= x ? a[b + 1] = h <= x ? -2 : -1 : h >= u && g && (a[b] += g, a[b + 1] += g);
       }
       d += g;
     }), u = t.maps[c].map(u, -1);
@@ -8326,12 +8326,12 @@ const lm = /^(a|abbr|acronym|b|bd[io]|big|br|button|cite|code|data(list)?|del|df
 function cm(n, e, t, i, r) {
   let s = n.input.compositionPendingChanges || (n.composing ? n.input.compositionID : 0);
   if (n.input.compositionPendingChanges = 0, e < 0) {
-    let T = n.input.lastSelectionTime > Date.now() - 50 ? n.input.lastSelectionOrigin : null, Se = Mo(n, T);
+    let A = n.input.lastSelectionTime > Date.now() - 50 ? n.input.lastSelectionOrigin : null, Se = Mo(n, A);
     if (Se && !n.state.selection.eq(Se)) {
-      if (se && Ye && n.input.lastKeyCode === 13 && Date.now() - 100 < n.input.lastKeyCodeTime && n.someProp("handleKeyDown", (_h) => _h(n, Tt(13, "Enter"))))
+      if (se && Ye && n.input.lastKeyCode === 13 && Date.now() - 100 < n.input.lastKeyCodeTime && n.someProp("handleKeyDown", (_h) => _h(n, At(13, "Enter"))))
         return;
       let Di = n.state.tr.setSelection(Se);
-      T == "pointer" ? Di.setMeta("pointer", !0) : T == "key" && Di.scrollIntoView(), s && Di.setMeta("composition", s), n.dispatch(Di);
+      A == "pointer" ? Di.setMeta("pointer", !0) : A == "key" && Di.scrollIntoView(), s && Di.setMeta("composition", s), n.dispatch(Di);
     }
     return;
   }
@@ -8340,62 +8340,62 @@ function cm(n, e, t, i, r) {
   let l = n.state.selection, c = om(n, e, t), u = n.state.doc, d = u.slice(c.from, c.to), h, p;
   n.input.lastKeyCode === 8 && Date.now() - 100 < n.input.lastKeyCodeTime ? (h = n.state.selection.to, p = "end") : (h = n.state.selection.from, p = "start"), n.input.lastKeyCode = null;
   let f = hm(d.content, c.doc.content, c.from, h, p);
-  if (f && n.input.domChangeCount++, (gn && n.input.lastIOSEnter > Date.now() - 225 || Ye) && r.some((T) => T.nodeType == 1 && !lm.test(T.nodeName)) && (!f || f.endA >= f.endB) && n.someProp("handleKeyDown", (T) => T(n, Tt(13, "Enter")))) {
+  if (f && n.input.domChangeCount++, (gn && n.input.lastIOSEnter > Date.now() - 225 || Ye) && r.some((A) => A.nodeType == 1 && !lm.test(A.nodeName)) && (!f || f.endA >= f.endB) && n.someProp("handleKeyDown", (A) => A(n, At(13, "Enter")))) {
     n.input.lastIOSEnter = 0;
     return;
   }
   if (!f)
-    if (i && l instanceof C && !l.empty && l.$head.sameParent(l.$anchor) && !n.composing && !(c.sel && c.sel.anchor != c.sel.head))
+    if (i && l instanceof E && !l.empty && l.$head.sameParent(l.$anchor) && !n.composing && !(c.sel && c.sel.anchor != c.sel.head))
       f = { start: l.from, endA: l.to, endB: l.to };
     else {
       if (c.sel) {
-        let T = fl(n, n.state.doc, c.sel);
-        if (T && !T.eq(n.state.selection)) {
-          let Se = n.state.tr.setSelection(T);
+        let A = fl(n, n.state.doc, c.sel);
+        if (A && !A.eq(n.state.selection)) {
+          let Se = n.state.tr.setSelection(A);
           s && Se.setMeta("composition", s), n.dispatch(Se);
         }
       }
       return;
     }
-  n.state.selection.from < n.state.selection.to && f.start == f.endB && n.state.selection instanceof C && (f.start > n.state.selection.from && f.start <= n.state.selection.from + 2 && n.state.selection.from >= c.from ? f.start = n.state.selection.from : f.endA < n.state.selection.to && f.endA >= n.state.selection.to - 2 && n.state.selection.to <= c.to && (f.endB += n.state.selection.to - f.endA, f.endA = n.state.selection.to)), be && gt <= 11 && f.endB == f.start + 1 && f.endA == f.start && f.start > c.from && c.doc.textBetween(f.start - c.from - 1, f.start - c.from + 1) == "  " && (f.start--, f.endA--, f.endB--);
-  let m = c.doc.resolveNoCache(f.start - c.from), g = c.doc.resolveNoCache(f.endB - c.from), b = u.resolve(f.start), k = m.sameParent(g) && m.parent.inlineContent && b.end() >= f.endA, S;
-  if ((gn && n.input.lastIOSEnter > Date.now() - 225 && (!k || r.some((T) => T.nodeName == "DIV" || T.nodeName == "P")) || !k && m.pos < c.doc.content.size && (!m.sameParent(g) || !m.parent.inlineContent) && !/\S/.test(c.doc.textBetween(m.pos, g.pos, "", "")) && (S = D.findFrom(c.doc.resolve(m.pos + 1), 1, !0)) && S.head > m.pos) && n.someProp("handleKeyDown", (T) => T(n, Tt(13, "Enter")))) {
+  n.state.selection.from < n.state.selection.to && f.start == f.endB && n.state.selection instanceof E && (f.start > n.state.selection.from && f.start <= n.state.selection.from + 2 && n.state.selection.from >= c.from ? f.start = n.state.selection.from : f.endA < n.state.selection.to && f.endA >= n.state.selection.to - 2 && n.state.selection.to <= c.to && (f.endB += n.state.selection.to - f.endA, f.endA = n.state.selection.to)), be && gt <= 11 && f.endB == f.start + 1 && f.endA == f.start && f.start > c.from && c.doc.textBetween(f.start - c.from - 1, f.start - c.from + 1) == "  " && (f.start--, f.endA--, f.endB--);
+  let m = c.doc.resolveNoCache(f.start - c.from), g = c.doc.resolveNoCache(f.endB - c.from), b = u.resolve(f.start), k = m.sameParent(g) && m.parent.inlineContent && b.end() >= f.endA, x;
+  if ((gn && n.input.lastIOSEnter > Date.now() - 225 && (!k || r.some((A) => A.nodeName == "DIV" || A.nodeName == "P")) || !k && m.pos < c.doc.content.size && (!m.sameParent(g) || !m.parent.inlineContent) && !/\S/.test(c.doc.textBetween(m.pos, g.pos, "", "")) && (x = D.findFrom(c.doc.resolve(m.pos + 1), 1, !0)) && x.head > m.pos) && n.someProp("handleKeyDown", (A) => A(n, At(13, "Enter")))) {
     n.input.lastIOSEnter = 0;
     return;
   }
-  if (n.state.selection.anchor > f.start && dm(u, f.start, f.endA, m, g) && n.someProp("handleKeyDown", (T) => T(n, Tt(8, "Backspace")))) {
+  if (n.state.selection.anchor > f.start && dm(u, f.start, f.endA, m, g) && n.someProp("handleKeyDown", (A) => A(n, At(8, "Backspace")))) {
     Ye && se && n.domObserver.suppressSelectionUpdates();
     return;
   }
   se && f.endB == f.start && (n.input.lastChromeDelete = Date.now()), Ye && !k && m.start() != g.start() && g.parentOffset == 0 && m.depth == g.depth && c.sel && c.sel.anchor == c.sel.head && c.sel.head == f.endA && (f.endB -= 2, g = c.doc.resolveNoCache(f.endB - c.from), setTimeout(() => {
-    n.someProp("handleKeyDown", function(T) {
-      return T(n, Tt(13, "Enter"));
+    n.someProp("handleKeyDown", function(A) {
+      return A(n, At(13, "Enter"));
     });
   }, 20));
-  let z = f.start, I = f.endA, M, L, ie;
+  let z = f.start, I = f.endA, C, L, ie;
   if (k) {
     if (m.pos == g.pos)
-      be && gt <= 11 && m.parentOffset == 0 && (n.domObserver.suppressSelectionUpdates(), setTimeout(() => Qe(n), 20)), M = n.state.tr.delete(z, I), L = u.resolve(f.start).marksAcross(u.resolve(f.endA));
+      be && gt <= 11 && m.parentOffset == 0 && (n.domObserver.suppressSelectionUpdates(), setTimeout(() => Qe(n), 20)), C = n.state.tr.delete(z, I), L = u.resolve(f.start).marksAcross(u.resolve(f.endA));
     else if (
       // Adding or removing a mark
       f.endA == f.endB && (ie = um(m.parent.content.cut(m.parentOffset, g.parentOffset), b.parent.content.cut(b.parentOffset, f.endA - b.start())))
     )
-      M = n.state.tr, ie.type == "add" ? M.addMark(z, I, ie.mark) : M.removeMark(z, I, ie.mark);
+      C = n.state.tr, ie.type == "add" ? C.addMark(z, I, ie.mark) : C.removeMark(z, I, ie.mark);
     else if (m.parent.child(m.index()).isText && m.index() == g.index() - (g.textOffset ? 0 : 1)) {
-      let T = m.parent.textBetween(m.parentOffset, g.parentOffset);
-      if (n.someProp("handleTextInput", (Se) => Se(n, z, I, T)))
+      let A = m.parent.textBetween(m.parentOffset, g.parentOffset);
+      if (n.someProp("handleTextInput", (Se) => Se(n, z, I, A)))
         return;
-      M = n.state.tr.insertText(T, z, I);
+      C = n.state.tr.insertText(A, z, I);
     }
   }
-  if (M || (M = n.state.tr.replace(z, I, c.doc.slice(f.start - c.from, f.endB - c.from))), c.sel) {
-    let T = fl(n, M.doc, c.sel);
-    T && !(se && n.composing && T.empty && (f.start != f.endB || n.input.lastChromeDelete < Date.now() - 100) && (T.head == z || T.head == M.mapping.map(I) - 1) || be && T.empty && T.head == z) && M.setSelection(T);
+  if (C || (C = n.state.tr.replace(z, I, c.doc.slice(f.start - c.from, f.endB - c.from))), c.sel) {
+    let A = fl(n, C.doc, c.sel);
+    A && !(se && n.composing && A.empty && (f.start != f.endB || n.input.lastChromeDelete < Date.now() - 100) && (A.head == z || A.head == C.mapping.map(I) - 1) || be && A.empty && A.head == z) && C.setSelection(A);
   }
-  L && M.ensureMarks(L), s && M.setMeta("composition", s), n.dispatch(M.scrollIntoView());
+  L && C.ensureMarks(L), s && C.setMeta("composition", s), n.dispatch(C.scrollIntoView());
 }
 function fl(n, e, t) {
-  return Math.max(t.anchor, t.head) > e.content.size ? null : To(n, e.resolve(t.anchor), e.resolve(t.head));
+  return Math.max(t.anchor, t.head) > e.content.size ? null : Ao(n, e.resolve(t.anchor), e.resolve(t.head));
 }
 function um(n, e) {
   let t = n.firstChild.marks, i = e.firstChild.marks, r = t, s = i, o, a, l;
@@ -8559,7 +8559,7 @@ class pm {
   scrollToSelection() {
     let e = this.domSelectionRange().focusNode;
     if (!(!e || !this.dom.contains(e.nodeType == 1 ? e : e.parentNode))) {
-      if (!this.someProp("handleScrollToSelection", (t) => t(this))) if (this.state.selection instanceof x) {
+      if (!this.someProp("handleScrollToSelection", (t) => t(this))) if (this.state.selection instanceof S) {
         let t = this.docView.domAfterPos(this.state.selection.from);
         t.nodeType == 1 && Ua(this, t.getBoundingClientRect(), e);
       } else
@@ -8596,7 +8596,7 @@ class pm {
       let s = i.from + (this.state.doc.content.size - t.doc.content.size);
       (s > 0 && this.state.doc.nodeAt(s)) == i.node && (r = s);
     }
-    this.dragging = new Tu(e.slice, e.move, r < 0 ? void 0 : x.create(this.state.doc, r));
+    this.dragging = new Au(e.slice, e.move, r < 0 ? void 0 : S.create(this.state.doc, r));
   }
   someProp(e, t) {
     let i = this._props && this._props[e], r;
@@ -8762,7 +8762,7 @@ class pm {
   [`transformCopied`](https://prosemirror.net/docs/ref/#view.EditorProps.transformCopied)).
   */
   serializeForClipboard(e) {
-    return Ao(this, e);
+    return To(this, e);
   }
   /**
   Removes the editor from the DOM and destroys all [node
@@ -9017,13 +9017,13 @@ const zu = (n, e, t) => {
   let s = r.nodeBefore;
   if (Fu(n, r, e, -1))
     return !0;
-  if (i.parent.content.size == 0 && (bn(s, "end") || x.isSelectable(s)))
+  if (i.parent.content.size == 0 && (bn(s, "end") || S.isSelectable(s)))
     for (let o = i.depth; ; o--) {
       let a = Dr(n.doc, i.before(o), i.after(o), w.empty);
       if (a && a.slice.size < a.to - a.from) {
         if (e) {
           let l = n.tr.step(a);
-          l.setSelection(bn(s, "end") ? D.findFrom(l.doc.resolve(l.mapping.map(r.pos, -1)), -1) : x.create(l.doc, r.pos - s.nodeSize)), e(l.scrollIntoView());
+          l.setSelection(bn(s, "end") ? D.findFrom(l.doc.resolve(l.mapping.map(r.pos, -1)), -1) : S.create(l.doc, r.pos - s.nodeSize)), e(l.scrollIntoView());
         }
         return !0;
       }
@@ -9068,7 +9068,7 @@ function Pu(n, e, t) {
     return !1;
   if (t) {
     let u = n.tr.step(c);
-    u.setSelection(C.create(u.doc, s)), t(u.scrollIntoView());
+    u.setSelection(E.create(u.doc, s)), t(u.scrollIntoView());
   }
   return !0;
 }
@@ -9091,7 +9091,7 @@ const Ru = (n, e, t) => {
     s = Ro(i);
   }
   let o = s && s.nodeBefore;
-  return !o || !x.isSelectable(o) ? !1 : (e && e(n.tr.setSelection(x.create(n.doc, s.pos - o.nodeSize)).scrollIntoView()), !0);
+  return !o || !S.isSelectable(o) ? !1 : (e && e(n.tr.setSelection(S.create(n.doc, s.pos - o.nodeSize)).scrollIntoView()), !0);
 };
 function Ro(n) {
   if (!n.parent.type.spec.isolating)
@@ -9117,12 +9117,12 @@ const Lu = (n, e, t) => {
   let s = r.nodeAfter;
   if (Fu(n, r, e, 1))
     return !0;
-  if (i.parent.content.size == 0 && (bn(s, "start") || x.isSelectable(s))) {
+  if (i.parent.content.size == 0 && (bn(s, "start") || S.isSelectable(s))) {
     let o = Dr(n.doc, i.before(), i.after(), w.empty);
     if (o && o.slice.size < o.to - o.from) {
       if (e) {
         let a = n.tr.step(o);
-        a.setSelection(bn(s, "start") ? D.findFrom(a.doc.resolve(a.mapping.map(r.pos)), 1) : x.create(a.doc, a.mapping.map(r.pos))), e(a.scrollIntoView());
+        a.setSelection(bn(s, "start") ? D.findFrom(a.doc.resolve(a.mapping.map(r.pos)), 1) : S.create(a.doc, a.mapping.map(r.pos))), e(a.scrollIntoView());
       }
       return !0;
     }
@@ -9138,7 +9138,7 @@ const Lu = (n, e, t) => {
     s = _o(i);
   }
   let o = s && s.nodeAfter;
-  return !o || !x.isSelectable(o) ? !1 : (e && e(n.tr.setSelection(x.create(n.doc, s.pos)).scrollIntoView()), !0);
+  return !o || !S.isSelectable(o) ? !1 : (e && e(n.tr.setSelection(S.create(n.doc, s.pos)).scrollIntoView()), !0);
 };
 function _o(n) {
   if (!n.parent.type.spec.isolating)
@@ -9152,7 +9152,7 @@ function _o(n) {
   return null;
 }
 const Mm = (n, e) => {
-  let t = n.selection, i = t instanceof x, r;
+  let t = n.selection, i = t instanceof S, r;
   if (i) {
     if (t.node.isTextblock || !Ct(n.doc, t.from))
       return !1;
@@ -9161,19 +9161,19 @@ const Mm = (n, e) => {
     return !1;
   if (e) {
     let s = n.tr.join(r);
-    i && s.setSelection(x.create(s.doc, r - n.doc.resolve(r).nodeBefore.nodeSize)), e(s.scrollIntoView());
+    i && s.setSelection(S.create(s.doc, r - n.doc.resolve(r).nodeBefore.nodeSize)), e(s.scrollIntoView());
   }
   return !0;
-}, Tm = (n, e) => {
+}, Am = (n, e) => {
   let t = n.selection, i;
-  if (t instanceof x) {
+  if (t instanceof S) {
     if (t.node.isTextblock || !Ct(n.doc, t.to))
       return !1;
     i = t.to;
   } else if (i = Or(n.doc, t.to, 1), i == null)
     return !1;
   return e && e(n.tr.join(i).scrollIntoView()), !0;
-}, Am = (n, e) => {
+}, Tm = (n, e) => {
   let { $from: t, $to: i } = n.selection, r = t.blockRange(i), s = r && En(r);
   return s == null ? !1 : (e && e(n.tr.lift(r, s).scrollIntoView()), !0);
 }, ju = (n, e) => {
@@ -9210,7 +9210,7 @@ const Om = (n, e) => {
     return !1;
   if (e) {
     let o = (!i.parentOffset && r.index() < r.parent.childCount ? i : r).pos, a = n.tr.insert(o, s.createAndFill());
-    a.setSelection(C.create(a.doc, o + 1)), e(a.scrollIntoView());
+    a.setSelection(E.create(a.doc, o + 1)), e(a.scrollIntoView());
   }
   return !0;
 }, Vu = (n, e) => {
@@ -9228,7 +9228,7 @@ const Om = (n, e) => {
 function Dm(n) {
   return (e, t) => {
     let { $from: i, $to: r } = e.selection;
-    if (e.selection instanceof x && e.selection.node.isBlock)
+    if (e.selection instanceof S && e.selection.node.isBlock)
       return !i.parentOffset || !Xe(e.doc, i.pos) ? !1 : (t && t(e.tr.split(i.pos).scrollIntoView()), !0);
     if (!i.depth)
       return !1;
@@ -9243,7 +9243,7 @@ function Dm(n) {
         s.unshift(null);
       }
     let u = e.tr;
-    (e.selection instanceof C || e.selection instanceof ge) && u.deleteSelection();
+    (e.selection instanceof E || e.selection instanceof ge) && u.deleteSelection();
     let d = u.mapping.map(i.pos), h = Xe(u.doc, d, s.length, s);
     if (h || (s[0] = a ? { type: a } : null, h = Xe(u.doc, d, s.length, s)), !h)
       return !1;
@@ -9256,7 +9256,7 @@ function Dm(n) {
 }
 const Nm = Dm(), Im = (n, e) => {
   let { $from: t, to: i } = n.selection, r, s = t.sharedDepth(i);
-  return s == 0 ? !1 : (r = t.before(s), e && e(n.tr.setSelection(x.create(n.doc, r))), !0);
+  return s == 0 ? !1 : (r = t.before(s), e && e(n.tr.setSelection(S.create(n.doc, r))), !0);
 };
 function zm(n, e, t) {
   let i = e.nodeBefore, r = e.nodeAfter, s = e.index();
@@ -9291,8 +9291,8 @@ function Fu(n, e, t, i) {
     if (p.canReplace(p.childCount, p.childCount, m.content)) {
       if (t) {
         let b = y.empty;
-        for (let S = f.length - 1; S >= 0; S--)
-          b = y.from(f[S].copy(b));
+        for (let x = f.length - 1; x >= 0; x--)
+          b = y.from(f[x].copy(b));
         let k = n.tr.step(new J(e.pos - f.length, e.pos + s.nodeSize, e.pos + g, e.pos + s.nodeSize - g, new w(b, f.length, 0), 0, !0));
         t(k.scrollIntoView());
       }
@@ -9309,7 +9309,7 @@ function qu(n) {
         return !1;
       s--;
     }
-    return r.node(s).isTextblock ? (t && t(e.tr.setSelection(C.create(e.doc, n < 0 ? r.start(s) : r.end(s)))), !0) : !1;
+    return r.node(s).isTextblock ? (t && t(e.tr.setSelection(E.create(e.doc, n < 0 ? r.start(s) : r.end(s)))), !0) : !1;
   };
 }
 const Pm = qu(-1), Rm = qu(1);
@@ -9702,10 +9702,10 @@ function Km(n, e) {
       storage: c.storage,
       editor: e
     }, h = n.reduce((b, k) => {
-      const S = v(k, "extendNodeSchema", d);
+      const x = v(k, "extendNodeSchema", d);
       return {
         ...b,
-        ...S ? S(c) : {}
+        ...x ? x(c) : {}
       };
     }, {}), p = Sl({
       ...h,
@@ -9837,7 +9837,7 @@ function zi(n) {
     }), g = {
       from: i - (p[0].length - s.length),
       to: r
-    }, { commands: b, chain: k, can: S } = new _r({
+    }, { commands: b, chain: k, can: x } = new _r({
       editor: t,
       state: m
     });
@@ -9847,7 +9847,7 @@ function zi(n) {
       match: p,
       commands: b,
       chain: k,
-      can: S
+      can: x
     }) === null || !f.steps.length || (f.setMeta(a, {
       transform: f,
       from: i,
@@ -10007,16 +10007,16 @@ function tg(n) {
     if (!p.isTextblock || p.type.spec.code)
       return;
     const m = Math.max(i, f), g = Math.min(r, f + p.content.size), b = p.textBetween(m - f, g - f, void 0, "");
-    eg(b, s.find, o).forEach((S) => {
-      if (S.index === void 0)
+    eg(b, s.find, o).forEach((x) => {
+      if (x.index === void 0)
         return;
-      const z = m + S.index + 1, I = z + S[0].length, M = {
+      const z = m + x.index + 1, I = z + x[0].length, C = {
         from: t.tr.mapping.map(z),
         to: t.tr.mapping.map(I)
       }, L = s.handler({
         state: t,
-        range: M,
-        match: S,
+        range: C,
+        match: x,
         commands: l,
         chain: c,
         can: u,
@@ -10106,21 +10106,21 @@ function ig(n) {
       if (k) {
         let { text: I } = b;
         typeof I == "string" ? I = I : I = jo(y.from(I), p.schema);
-        const { from: M } = b, L = M + I.length, ie = ng(I);
+        const { from: C } = b, L = C + I.length, ie = ng(I);
         return l({
           rule: u,
           state: p,
-          from: M,
+          from: C,
           to: { b: L },
           pasteEvt: ie
         });
       }
-      const S = h.doc.content.findDiffStart(p.doc.content), z = h.doc.content.findDiffEnd(p.doc.content);
-      if (!(!Zm(S) || !z || S === z.b))
+      const x = h.doc.content.findDiffStart(p.doc.content), z = h.doc.content.findDiffEnd(p.doc.content);
+      if (!(!Zm(x) || !z || x === z.b))
         return l({
           rule: u,
           state: p,
-          from: S,
+          from: x,
           to: z,
           pasteEvt: o
         });
@@ -10400,7 +10400,7 @@ const sg = Q.create({
   const { state: r } = t, s = r.doc.slice(n.from, n.to);
   i.deleteRange(n.from, n.to);
   const o = i.mapping.map(e);
-  return i.insert(o, s.content), i.setSelection(new C(i.doc.resolve(o - 1))), !0;
+  return i.insert(o, s.content), i.setSelection(new E(i.doc.resolve(o - 1))), !0;
 }, hg = () => ({ tr: n, dispatch: e }) => {
   const { selection: t } = n, i = t.$anchor.node();
   if (i.content.size > 0)
@@ -10474,7 +10474,7 @@ const yg = (n, e = {}) => ({ tr: t, state: i, dispatch: r }) => {
   if (r) {
     const d = Fo(l, s, e);
     if (d && d.from <= c && d.to >= u) {
-      const h = C.create(o, d.from, d.to);
+      const h = E.create(o, d.from, d.to);
       t.setSelection(h);
     }
   }
@@ -10487,7 +10487,7 @@ const yg = (n, e = {}) => ({ tr: t, state: i, dispatch: r }) => {
   return !1;
 };
 function Gu(n) {
-  return n instanceof C;
+  return n instanceof E;
 }
 function It(n = 0, e = 0, t = 0) {
   return Math.min(Math.max(n, e), t);
@@ -10501,7 +10501,7 @@ function Yu(n, e = null) {
   if (e === "end")
     return i;
   const r = t.from, s = i.to;
-  return e === "all" ? C.create(n, It(0, r, s), It(n.content.size, r, s)) : C.create(n, It(e, r, s), It(e, r, s));
+  return e === "all" ? E.create(n, It(0, r, s), It(n.content.size, r, s)) : E.create(n, It(e, r, s), It(e, r, s));
 }
 function kg() {
   return navigator.platform === "Android" || /android/i.test(navigator.userAgent);
@@ -10657,7 +10657,7 @@ const Eg = (n) => !("type" in n), Mg = (n, e, t) => ({ tr: i, dispatch: r, edito
     t.updateSelection && Cg(i, i.steps.length - 1, -1), t.applyInputRules && i.setMeta("applyInputRules", { from: l, text: p }), t.applyPasteRules && i.setMeta("applyPasteRules", { from: l, text: p });
   }
   return !0;
-}, Tg = () => ({ state: n, dispatch: e }) => Mm(n, e), Ag = () => ({ state: n, dispatch: e }) => Tm(n, e), Og = () => ({ state: n, dispatch: e }) => zu(n, e), Dg = () => ({ state: n, dispatch: e }) => Lu(n, e), Ng = () => ({ state: n, dispatch: e, tr: t }) => {
+}, Ag = () => ({ state: n, dispatch: e }) => Mm(n, e), Tg = () => ({ state: n, dispatch: e }) => Am(n, e), Og = () => ({ state: n, dispatch: e }) => zu(n, e), Dg = () => ({ state: n, dispatch: e }) => Lu(n, e), Ng = () => ({ state: n, dispatch: e, tr: t }) => {
   try {
     const i = Or(n.doc, n.selection.$from.pos, -1);
     return i == null ? !1 : (t.join(i, 2), e && e(t), !0);
@@ -10731,7 +10731,7 @@ function ri(n, e, t = {}) {
 }
 const Lg = (n, e = {}) => ({ state: t, dispatch: i }) => {
   const r = X(n, t.schema);
-  return ri(t, r, e) ? Am(t, i) : !1;
+  return ri(t, r, e) ? Tm(t, i) : !1;
 }, Bg = () => ({ state: n, dispatch: e }) => Vu(n, e), jg = (n) => ({ state: e, dispatch: t }) => {
   const i = X(n, e.schema);
   return $m(i)(e, t);
@@ -10848,8 +10848,8 @@ function Ys(n, e, t = {}) {
     n.doc.nodesBetween(p, f, (m, g) => {
       if (!m.isText && !m.marks.length)
         return;
-      const b = Math.max(p, g), k = Math.min(f, g + m.nodeSize), S = k - b;
-      o += S, a.push(...m.marks.map((z) => ({
+      const b = Math.max(p, g), k = Math.min(f, g + m.nodeSize), x = k - b;
+      o += x, a.push(...m.marks.map((z) => ({
         mark: z,
         from: b,
         to: k
@@ -10866,7 +10866,7 @@ function eb(n, e, t = {}) {
   const i = jr(e, n.schema);
   return i === "node" ? ri(n, e, t) : i === "mark" ? Ys(n, e, t) : !1;
 }
-function Tl(n, e) {
+function Al(n, e) {
   const { nodeExtensions: t } = Lr(e), i = t.find((o) => o.name === n);
   if (!i)
     return !1;
@@ -10950,13 +10950,13 @@ const nb = (n, e = {}) => ({ tr: t, state: i, dispatch: r }) => {
   return t.selection.$anchor.sameParent(t.selection.$head) && (o = t.selection.$anchor.parent.attrs), s.isTextblock ? r().command(({ commands: a }) => vl(s, { ...o, ...e })(t) ? !0 : a.clearNodes()).command(({ state: a }) => vl(s, { ...o, ...e })(a, i)).run() : (console.warn('[tiptap warn]: Currently "setNode()" only supports text block nodes.'), !1);
 }, sb = (n) => ({ tr: e, dispatch: t }) => {
   if (t) {
-    const { doc: i } = e, r = It(n, 0, i.content.size), s = x.create(i, r);
+    const { doc: i } = e, r = It(n, 0, i.content.size), s = S.create(i, r);
     e.setSelection(s);
   }
   return !0;
 }, ob = (n) => ({ tr: e, dispatch: t }) => {
   if (t) {
-    const { doc: i } = e, { from: r, to: s } = typeof n == "number" ? { from: n, to: n } : n, o = C.atStart(i).from, a = C.atEnd(i).to, l = It(r, o, a), c = It(s, o, a), u = C.create(i, l, c);
+    const { doc: i } = e, { from: r, to: s } = typeof n == "number" ? { from: n, to: n } : n, o = E.atStart(i).from, a = E.atEnd(i).to, l = It(r, o, a), c = It(s, o, a), u = E.create(i, l, c);
     e.setSelection(u);
   }
   return !0;
@@ -10964,7 +10964,7 @@ const nb = (n, e = {}) => ({ tr: t, state: i, dispatch: r }) => {
   const i = X(n, e.schema);
   return qm(i)(e, t);
 };
-function Al(n, e) {
+function Tl(n, e) {
   const t = n.storedMarks || n.selection.$to.parentOffset && n.selection.$from.marks();
   if (t) {
     const i = t.filter((r) => e == null ? void 0 : e.includes(r.type.name));
@@ -10973,8 +10973,8 @@ function Al(n, e) {
 }
 const lb = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: i, editor: r }) => {
   const { selection: s, doc: o } = e, { $from: a, $to: l } = s, c = r.extensionManager.attributes, u = Hi(c, a.node().type.name, a.node().attrs);
-  if (s instanceof x && s.node.isBlock)
-    return !a.parentOffset || !Xe(o, a.pos) ? !1 : (i && (n && Al(t, r.extensionManager.splittableMarks), e.split(a.pos).scrollIntoView()), !0);
+  if (s instanceof S && s.node.isBlock)
+    return !a.parentOffset || !Xe(o, a.pos) ? !1 : (i && (n && Tl(t, r.extensionManager.splittableMarks), e.split(a.pos).scrollIntoView()), !0);
   if (!a.parent.isBlock)
     return !1;
   const d = l.parentOffset === l.parent.content.size, h = a.depth === 0 ? void 0 : Yg(a.node(-1).contentMatchAt(a.indexAfter(-1)));
@@ -10990,11 +10990,11 @@ const lb = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: i, edit
       attrs: u
     }
   ] : void 0), i) {
-    if (f && (s instanceof C && e.deleteSelection(), e.split(e.mapping.map(a.pos), 1, p), h && !d && !a.parentOffset && a.parent.type !== h)) {
+    if (f && (s instanceof E && e.deleteSelection(), e.split(e.mapping.map(a.pos), 1, p), h && !d && !a.parentOffset && a.parent.type !== h)) {
       const m = e.mapping.map(a.before()), g = e.doc.resolve(m);
       a.node(-1).canReplaceWith(g.index(), g.index() + 1, h) && e.setNodeMarkup(e.mapping.map(a.before()), h);
     }
-    n && Al(t, r.extensionManager.splittableMarks), e.scrollIntoView();
+    n && Tl(t, r.extensionManager.splittableMarks), e.scrollIntoView();
   }
   return f;
 }, cb = (n, e = {}) => ({ tr: t, state: i, dispatch: r, editor: s }) => {
@@ -11014,19 +11014,19 @@ const lb = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: i, edit
       const k = l.index(-1) ? 1 : l.index(-2) ? 2 : 3;
       for (let ie = l.depth - k; ie >= l.depth - 3; ie -= 1)
         b = y.from(l.node(ie).copy(b));
-      const S = l.indexAfter(-1) < l.node(-2).childCount ? 1 : l.indexAfter(-2) < l.node(-3).childCount ? 2 : 3, z = {
+      const x = l.indexAfter(-1) < l.node(-2).childCount ? 1 : l.indexAfter(-2) < l.node(-3).childCount ? 2 : 3, z = {
         ...Hi(h, l.node().type.name, l.node().attrs),
         ...e
       }, I = ((o = a.contentMatch.defaultType) === null || o === void 0 ? void 0 : o.createAndFill(z)) || void 0;
       b = b.append(y.from(a.createAndFill(null, I) || void 0));
-      const M = l.before(l.depth - (k - 1));
-      t.replace(M, l.after(-S), new w(b, 4 - k, 0));
+      const C = l.before(l.depth - (k - 1));
+      t.replace(C, l.after(-x), new w(b, 4 - k, 0));
       let L = -1;
-      t.doc.nodesBetween(M, t.doc.content.size, (ie, T) => {
+      t.doc.nodesBetween(C, t.doc.content.size, (ie, A) => {
         if (L > -1)
           return !1;
-        ie.isTextblock && ie.content.size === 0 && (L = T + 1);
-      }), L > -1 && t.setSelection(C.near(t.doc.resolve(L))), t.scrollIntoView();
+        ie.isTextblock && ie.content.size === 0 && (L = A + 1);
+      }), L > -1 && t.setSelection(E.near(t.doc.resolve(L))), t.scrollIntoView();
     }
     return !0;
   }
@@ -11045,10 +11045,10 @@ const lb = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: i, edit
   if (!Xe(t.doc, l.pos, 2))
     return !1;
   if (r) {
-    const { selection: b, storedMarks: k } = i, { splittableMarks: S } = s.extensionManager, z = k || b.$to.parentOffset && b.$from.marks();
+    const { selection: b, storedMarks: k } = i, { splittableMarks: x } = s.extensionManager, z = k || b.$to.parentOffset && b.$from.marks();
     if (t.split(l.pos, 2, g).scrollIntoView(), !z || !r)
       return !0;
-    const I = z.filter((M) => S.includes(M.type.name));
+    const I = z.filter((C) => x.includes(C.type.name));
     t.ensureMarks(I);
   }
   return !0;
@@ -11071,19 +11071,19 @@ const lb = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: i, edit
   const r = n.doc.nodeAt(i);
   return t.node.type === (r == null ? void 0 : r.type) && Ct(n.doc, i) && n.join(i), !0;
 }, ub = (n, e, t, i = {}) => ({ editor: r, tr: s, state: o, dispatch: a, chain: l, commands: c, can: u }) => {
-  const { extensions: d, splittableMarks: h } = r.extensionManager, p = X(n, o.schema), f = X(e, o.schema), { selection: m, storedMarks: g } = o, { $from: b, $to: k } = m, S = b.blockRange(k), z = g || m.$to.parentOffset && m.$from.marks();
-  if (!S)
+  const { extensions: d, splittableMarks: h } = r.extensionManager, p = X(n, o.schema), f = X(e, o.schema), { selection: m, storedMarks: g } = o, { $from: b, $to: k } = m, x = b.blockRange(k), z = g || m.$to.parentOffset && m.$from.marks();
+  if (!x)
     return !1;
-  const I = Uo((M) => Tl(M.type.name, d))(m);
-  if (S.depth >= 1 && I && S.depth - I.depth <= 1) {
+  const I = Uo((C) => Al(C.type.name, d))(m);
+  if (x.depth >= 1 && I && x.depth - I.depth <= 1) {
     if (I.node.type === p)
       return c.liftListItem(f);
-    if (Tl(I.node.type.name, d) && p.validContent(I.node.content) && a)
+    if (Al(I.node.type.name, d) && p.validContent(I.node.content) && a)
       return l().command(() => (s.setNodeMarkup(I.pos, p), !0)).command(() => fs(s, p)).command(() => ms(s, p)).run();
   }
   return !t || !z || !a ? l().command(() => u().wrapInList(p, i) ? !0 : c.clearNodes()).wrapInList(p, i).command(() => fs(s, p)).command(() => ms(s, p)).run() : l().command(() => {
-    const M = u().wrapInList(p, i), L = z.filter((ie) => h.includes(ie.type.name));
-    return s.ensureMarks(L), M ? !0 : c.clearNodes();
+    const C = u().wrapInList(p, i), L = z.filter((ie) => h.includes(ie.type.name));
+    return s.ensureMarks(L), C ? !0 : c.clearNodes();
   }).wrapInList(p, i).command(() => fs(s, p)).command(() => ms(s, p)).run();
 }, db = (n, e = {}, t = {}) => ({ state: i, commands: r }) => {
   const { extendEmptyMarkRange: s = !1 } = t, o = Mt(n, i.schema);
@@ -11148,8 +11148,8 @@ const lb = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: i, edit
         ...e
       }), o && m.marks.length && m.marks.forEach((b) => {
         if (o === b.type) {
-          const k = Math.max(g, c), S = Math.min(g + m.nodeSize, u);
-          t.addMark(k, S, o.create({
+          const k = Math.max(g, c), x = Math.min(g + m.nodeSize, u);
+          t.addMark(k, x, o.create({
             ...b.attrs,
             ...e
           }));
@@ -11193,13 +11193,13 @@ var kb = /* @__PURE__ */ Object.freeze({
   insertContent: Sg,
   insertContentAt: Mg,
   joinBackward: Og,
-  joinDown: Ag,
+  joinDown: Tg,
   joinForward: Dg,
   joinItemBackward: Ng,
   joinItemForward: Ig,
   joinTextblockBackward: zg,
   joinTextblockForward: Pg,
-  joinUp: Tg,
+  joinUp: Ag,
   keyboardShortcut: _g,
   lift: Lg,
   liftEmptyBlock: Bg,
@@ -11373,7 +11373,7 @@ const vb = Q.create({
       })
     ];
   }
-}), Tb = Q.create({
+}), Ab = Q.create({
   name: "paste",
   addProseMirrorPlugins() {
     return [
@@ -11391,7 +11391,7 @@ const vb = Q.create({
       })
     ];
   }
-}), Ab = Q.create({
+}), Tb = Q.create({
   name: "tabindex",
   addProseMirrorPlugins() {
     return [
@@ -11404,7 +11404,7 @@ const vb = Q.create({
     ];
   }
 });
-class At {
+class Tt {
   get name() {
     return this.node.type.name;
   }
@@ -11463,15 +11463,15 @@ class At {
     if (this.depth === 0)
       return null;
     const e = this.resolvedPos.start(this.resolvedPos.depth - 1), t = this.resolvedPos.doc.resolve(e);
-    return new At(t, this.editor);
+    return new Tt(t, this.editor);
   }
   get before() {
     let e = this.resolvedPos.doc.resolve(this.from - (this.isBlock ? 1 : 2));
-    return e.depth !== this.depth && (e = this.resolvedPos.doc.resolve(this.from - 3)), new At(e, this.editor);
+    return e.depth !== this.depth && (e = this.resolvedPos.doc.resolve(this.from - 3)), new Tt(e, this.editor);
   }
   get after() {
     let e = this.resolvedPos.doc.resolve(this.to + (this.isBlock ? 2 : 1));
-    return e.depth !== this.depth && (e = this.resolvedPos.doc.resolve(this.to + 3)), new At(e, this.editor);
+    return e.depth !== this.depth && (e = this.resolvedPos.doc.resolve(this.to + 3)), new Tt(e, this.editor);
   }
   get children() {
     const e = [];
@@ -11479,8 +11479,8 @@ class At {
       const r = t.isBlock && !t.isTextblock, s = t.isAtom && !t.isText, o = this.pos + i + (s ? 0 : 1), a = this.resolvedPos.doc.resolve(o);
       if (!r && a.depth <= this.depth)
         return;
-      const l = new At(a, this.editor, r, r ? t : null);
-      r && (l.actualDepth = this.depth + 1), e.push(new At(a, this.editor, r, r ? t : null));
+      const l = new Tt(a, this.editor, r, r ? t : null);
+      r && (l.actualDepth = this.depth + 1), e.push(new Tt(a, this.editor, r, r ? t : null));
     }), e;
   }
   get firstChild() {
@@ -11747,9 +11747,9 @@ class Nb extends Um {
       vb,
       Eb,
       Mb,
-      Ab,
+      Tb,
       xb,
-      Tb
+      Ab
     ].filter((s) => typeof this.options.enableCoreExtensions == "object" ? this.options.enableCoreExtensions[s.name] !== !1 : !0) : [], ...this.options.extensions].filter((s) => ["extension", "node", "mark"].includes(s == null ? void 0 : s.type));
     this.extensionManager = new nn(r, this);
   }
@@ -11949,7 +11949,7 @@ class Nb extends Um {
   }
   $pos(e) {
     const t = this.state.doc.resolve(e);
-    return new At(t, this);
+    return new Tt(t, this);
   }
   get $doc() {
     return this.$pos(0);
@@ -12745,7 +12745,7 @@ let qr = class {
 const Mn = (n) => new qr(n), by = (n) => n.pos !== n.arr.length, yy = (n, e) => {
   const t = new Uint8Array(n.arr.buffer, n.pos + n.arr.byteOffset, e);
   return n.pos += e, t;
-}, ve = (n) => yy(n, A(n)), wn = (n) => n.arr[n.pos++], A = (n) => {
+}, ve = (n) => yy(n, T(n)), wn = (n) => n.arr[n.pos++], T = (n) => {
   let e = 0, t = 1;
   const i = n.arr.length;
   for (; n.pos < i; ) {
@@ -12770,7 +12770,7 @@ const Mn = (n) => new qr(n), by = (n) => n.pos !== n.arr.length, yy = (n, e) =>
   }
   throw cd;
 }, wy = (n) => {
-  let e = A(n);
+  let e = T(n);
   if (e === 0)
     return "";
   {
@@ -12819,7 +12819,7 @@ const Mn = (n) => new qr(n), by = (n) => n.pos !== n.arr.length, yy = (n, e) =>
   ln,
   // CASE 119: string
   (n) => {
-    const e = A(n), t = {};
+    const e = T(n), t = {};
     for (let i = 0; i < e; i++) {
       const r = ln(n);
       t[r] = ai(n);
@@ -12827,7 +12827,7 @@ const Mn = (n) => new qr(n), by = (n) => n.pos !== n.arr.length, yy = (n, e) =>
     return t;
   },
   (n) => {
-    const e = A(n), t = [];
+    const e = T(n), t = [];
     for (let i = 0; i < e; i++)
       t.push(ai(n));
     return t;
@@ -12844,7 +12844,7 @@ class Bl extends qr {
     super(e), this.reader = t, this.s = null, this.count = 0;
   }
   read() {
-    return this.count === 0 && (this.s = this.reader(this), by(this) ? this.count = A(this) + 1 : this.count = -1), this.count--, /** @type {T} */
+    return this.count === 0 && (this.s = this.reader(this), by(this) ? this.count = T(this) + 1 : this.count = -1), this.count--, /** @type {T} */
     this.s;
   }
 }
@@ -12859,7 +12859,7 @@ class Gi extends qr {
     if (this.count === 0) {
       this.s = Ko(this);
       const e = ad(this.s);
-      this.count = 1, e && (this.s = -this.s, this.count = A(this) + 2);
+      this.count = 1, e && (this.s = -this.s, this.count = T(this) + 2);
     }
     return this.count--, /** @type {number} */
     this.s;
@@ -12878,7 +12878,7 @@ class xs extends qr {
   read() {
     if (this.count === 0) {
       const e = Ko(this), t = e & 1;
-      this.diff = nt(e / 2), this.count = 1, t && (this.count = A(this) + 2);
+      this.diff = nt(e / 2), this.count = 1, t && (this.count = T(this) + 2);
     }
     return this.s += this.diff, this.count--, this.s;
   }
@@ -12898,7 +12898,7 @@ class Ey {
     return this.spos = e, t;
   }
 }
-const My = crypto.getRandomValues.bind(crypto), Ty = Math.random, dd = () => My(new Uint32Array(1))[0], Ay = (n) => n[nt(Ty() * n.length)], Oy = "10000000-1000-4000-8000" + -1e11, Dy = () => Oy.replace(
+const My = crypto.getRandomValues.bind(crypto), Ay = Math.random, dd = () => My(new Uint32Array(1))[0], Ty = (n) => n[nt(Ay() * n.length)], Oy = "10000000-1000-4000-8000" + -1e11, Dy = () => Oy.replace(
   /[018]/g,
   /** @param {number} c */
   (n) => (n ^ dd() & 15 >> n / 4).toString(16)
@@ -13101,7 +13101,7 @@ class Zo {
     this.clock = e, this.len = t;
   }
 }
-class Tn {
+class An {
   constructor() {
     this.clients = /* @__PURE__ */ new Map();
   }
@@ -13128,7 +13128,7 @@ const xt = (n, e, t) => e.clients.forEach((i, r) => {
       i = r - 1;
   }
   return null;
-}, An = (n, e) => {
+}, Tn = (n, e) => {
   const t = n.clients.get(e.client);
   return t !== void 0 && pw(t, e.clock) !== null;
 }, ea = (n) => {
@@ -13142,7 +13142,7 @@ const xt = (n, e, t) => e.clients.forEach((i, r) => {
     e.length = i;
   });
 }, ro = (n) => {
-  const e = new Tn();
+  const e = new An();
   for (let t = 0; t < n.length; t++)
     n[t].clients.forEach((i, r) => {
       if (!e.clients.has(r)) {
@@ -13158,7 +13158,7 @@ const xt = (n, e, t) => e.clients.forEach((i, r) => {
     /** @type {Array<DeleteItem>} */
     []
   )).push(new Zo(t, i));
-}, Ed = () => new Tn(), Md = (n) => {
+}, Ed = () => new An(), Md = (n) => {
   const e = Ed();
   return n.clients.forEach((t, i) => {
     const r = [];
@@ -13186,10 +13186,10 @@ const xt = (n, e, t) => e.clients.forEach((i, r) => {
     }
   });
 }, ta = (n) => {
-  const e = new Tn(), t = A(n.restDecoder);
+  const e = new An(), t = T(n.restDecoder);
   for (let i = 0; i < t; i++) {
     n.resetDsCurVal();
-    const r = A(n.restDecoder), s = A(n.restDecoder);
+    const r = T(n.restDecoder), s = T(n.restDecoder);
     if (s > 0) {
       const o = We(e.clients, r, () => (
         /** @type {Array<DeleteItem>} */
@@ -13201,10 +13201,10 @@ const xt = (n, e, t) => e.clients.forEach((i, r) => {
   }
   return e;
 }, Fl = (n, e, t) => {
-  const i = new Tn(), r = A(n.restDecoder);
+  const i = new An(), r = T(n.restDecoder);
   for (let s = 0; s < r; s++) {
     n.resetDsCurVal();
-    const o = A(n.restDecoder), a = A(n.restDecoder), l = t.clients.get(o) || [], c = $(t, o);
+    const o = T(n.restDecoder), a = T(n.restDecoder), l = t.clients.get(o) || [], c = $(t, o);
     for (let u = 0; u < a; u++) {
       const d = n.readDsClock(), h = d + n.readDsLen();
       if (d < c) {
@@ -13221,13 +13221,13 @@ const xt = (n, e, t) => e.clients.forEach((i, r) => {
     return O(s.restEncoder, 0), On(s, i), s.toUint8Array();
   }
   return null;
-}, Td = dd;
+}, Ad = dd;
 class rt extends od {
   /**
    * @param {DocOpts} opts configuration
    */
   constructor({ guid: e = Dy(), collectionid: t = null, gc: i = !0, gcFilter: r = () => !0, meta: s = null, autoLoad: o = !1, shouldLoad: a = !0 } = {}) {
-    super(), this.gc = i, this.gcFilter = r, this.clientID = Td(), this.guid = e, this.collectionid = t, this.share = /* @__PURE__ */ new Map(), this.store = new _d(), this._transaction = null, this._transactionCleanups = [], this.subdocs = /* @__PURE__ */ new Set(), this._item = null, this.shouldLoad = a, this.autoLoad = o, this.meta = s, this.isLoaded = !1, this.isSynced = !1, this.isDestroyed = !1, this.whenLoaded = jl((c) => {
+    super(), this.gc = i, this.gcFilter = r, this.clientID = Ad(), this.guid = e, this.collectionid = t, this.share = /* @__PURE__ */ new Map(), this.store = new _d(), this._transaction = null, this._transactionCleanups = [], this.subdocs = /* @__PURE__ */ new Set(), this._item = null, this.shouldLoad = a, this.autoLoad = o, this.meta = s, this.isLoaded = !1, this.isSynced = !1, this.isDestroyed = !1, this.whenLoaded = jl((c) => {
       this.on("load", () => {
         this.isLoaded = !0, c(this);
       });
@@ -13435,7 +13435,7 @@ class rt extends od {
     this.emit("destroyed", [!0]), this.emit("destroy", [this]), super.destroy();
   }
 }
-class Ad {
+class Td {
   /**
    * @param {decoding.Decoder} decoder
    */
@@ -13448,34 +13448,34 @@ class Ad {
    * @return {number}
    */
   readDsClock() {
-    return A(this.restDecoder);
+    return T(this.restDecoder);
   }
   /**
    * @return {number}
    */
   readDsLen() {
-    return A(this.restDecoder);
+    return T(this.restDecoder);
   }
 }
-class Od extends Ad {
+class Od extends Td {
   /**
    * @return {ID}
    */
   readLeftID() {
-    return E(A(this.restDecoder), A(this.restDecoder));
+    return M(T(this.restDecoder), T(this.restDecoder));
   }
   /**
    * @return {ID}
    */
   readRightID() {
-    return E(A(this.restDecoder), A(this.restDecoder));
+    return M(T(this.restDecoder), T(this.restDecoder));
   }
   /**
    * Read the next client id.
    * Use this in favor of readID whenever possible to reduce the number of objects created.
    */
   readClient() {
-    return A(this.restDecoder);
+    return T(this.restDecoder);
   }
   /**
    * @return {number} info An unsigned 8-bit integer
@@ -13493,13 +13493,13 @@ class Od extends Ad {
    * @return {boolean} isKey
    */
   readParentInfo() {
-    return A(this.restDecoder) === 1;
+    return T(this.restDecoder) === 1;
   }
   /**
    * @return {number} info An unsigned 8-bit integer
    */
   readTypeRef() {
-    return A(this.restDecoder);
+    return T(this.restDecoder);
   }
   /**
    * Write len of a struct - well suited for Opt RLE encoder.
@@ -13507,7 +13507,7 @@ class Od extends Ad {
    * @return {number} len
    */
   readLen() {
-    return A(this.restDecoder);
+    return T(this.restDecoder);
   }
   /**
    * @return {any}
@@ -13550,13 +13550,13 @@ class fw {
    * @return {number}
    */
   readDsClock() {
-    return this.dsCurrVal += A(this.restDecoder), this.dsCurrVal;
+    return this.dsCurrVal += T(this.restDecoder), this.dsCurrVal;
   }
   /**
    * @return {number}
    */
   readDsLen() {
-    const e = A(this.restDecoder) + 1;
+    const e = T(this.restDecoder) + 1;
     return this.dsCurrVal += e, e;
   }
 }
@@ -13565,7 +13565,7 @@ class vn extends fw {
    * @param {decoding.Decoder} decoder
    */
   constructor(e) {
-    super(e), this.keys = [], A(e), this.keyClockDecoder = new xs(ve(e)), this.clientDecoder = new Gi(ve(e)), this.leftClockDecoder = new xs(ve(e)), this.rightClockDecoder = new xs(ve(e)), this.infoDecoder = new Bl(ve(e), wn), this.stringDecoder = new Ey(ve(e)), this.parentInfoDecoder = new Bl(ve(e), wn), this.typeRefDecoder = new Gi(ve(e)), this.lenDecoder = new Gi(ve(e));
+    super(e), this.keys = [], T(e), this.keyClockDecoder = new xs(ve(e)), this.clientDecoder = new Gi(ve(e)), this.leftClockDecoder = new xs(ve(e)), this.rightClockDecoder = new xs(ve(e)), this.infoDecoder = new Bl(ve(e), wn), this.stringDecoder = new Ey(ve(e)), this.parentInfoDecoder = new Bl(ve(e), wn), this.typeRefDecoder = new Gi(ve(e)), this.lenDecoder = new Gi(ve(e));
   }
   /**
    * @return {ID}
@@ -13896,27 +13896,27 @@ const mw = (n, e, t, i) => {
     );
   });
 }, gw = (n, e) => {
-  const t = Oe(), i = A(n.restDecoder);
+  const t = Oe(), i = T(n.restDecoder);
   for (let r = 0; r < i; r++) {
-    const s = A(n.restDecoder), o = new Array(s), a = n.readClient();
-    let l = A(n.restDecoder);
+    const s = T(n.restDecoder), o = new Array(s), a = n.readClient();
+    let l = T(n.restDecoder);
     t.set(a, { i: 0, refs: o });
     for (let c = 0; c < s; c++) {
       const u = n.readInfo();
       switch (Vr & u) {
         case 0: {
           const d = n.readLen();
-          o[c] = new Me(E(a, l), d), l += d;
+          o[c] = new Me(M(a, l), d), l += d;
           break;
         }
         case 10: {
-          const d = A(n.restDecoder);
-          o[c] = new Te(E(a, l), d), l += d;
+          const d = T(n.restDecoder);
+          o[c] = new Ae(M(a, l), d), l += d;
           break;
         }
         default: {
           const d = (u & (et | ce)) === 0, h = new R(
-            E(a, l),
+            M(a, l),
             null,
             // left
             (u & ce) === ce ? n.readLeftID() : null,
@@ -13980,7 +13980,7 @@ const mw = (n, e, t, i) => {
     i.length = 0;
   };
   for (; ; ) {
-    if (u.constructor !== Te) {
+    if (u.constructor !== Ae) {
       const f = We(d, u.id.client, () => $(e, u.id.client)) - u.id.clock;
       if (f < 0)
         i.push(u), c(u.id.client, u.id.clock - 1), h();
@@ -14045,7 +14045,7 @@ const mw = (n, e, t, i) => {
   const d = Fl(i, r, a);
   if (a.pendingDs) {
     const h = new vn(Mn(a.pendingDs));
-    A(h.restDecoder);
+    T(h.restDecoder);
     const p = Fl(h, r, a);
     d && p ? a.pendingDs = gr([d, p]) : a.pendingDs = d || p;
   } else
@@ -14074,21 +14074,21 @@ const mw = (n, e, t, i) => {
   }
   return r[0];
 }, Sw = (n, e) => xw(n, e, new Ei()), Cw = (n) => {
-  const e = /* @__PURE__ */ new Map(), t = A(n.restDecoder);
+  const e = /* @__PURE__ */ new Map(), t = T(n.restDecoder);
   for (let i = 0; i < t; i++) {
-    const r = A(n.restDecoder), s = A(n.restDecoder);
+    const r = T(n.restDecoder), s = T(n.restDecoder);
     e.set(r, s);
   }
   return e;
-}, Id = (n) => Cw(new Ad(Mn(n))), zd = (n, e) => (O(n.restEncoder, e.size), kt(e.entries()).sort((t, i) => i[0] - t[0]).forEach(([t, i]) => {
+}, Id = (n) => Cw(new Td(Mn(n))), zd = (n, e) => (O(n.restEncoder, e.size), kt(e.entries()).sort((t, i) => i[0] - t[0]).forEach(([t, i]) => {
   O(n.restEncoder, t), O(n.restEncoder, i);
-}), n), Ew = (n, e) => zd(n, Mi(e.store)), Mw = (n, e = new Nd()) => (n instanceof Map ? zd(e, n) : Ew(e, n), e.toUint8Array()), Tw = (n) => Mw(n, new Dd());
-class Aw {
+}), n), Ew = (n, e) => zd(n, Mi(e.store)), Mw = (n, e = new Nd()) => (n instanceof Map ? zd(e, n) : Ew(e, n), e.toUint8Array()), Aw = (n) => Mw(n, new Dd());
+class Tw {
   constructor() {
     this.l = [];
   }
 }
-const ql = () => new Aw(), Ul = (n, e) => n.l.push(e), Hl = (n, e) => {
+const ql = () => new Tw(), Ul = (n, e) => n.l.push(e), Hl = (n, e) => {
   const t = n.l, i = t.length;
   n.l = t.filter((r) => e !== r), i === n.l.length && console.error("[yjs] Tried to remove event handler that doesn't exist.");
 }, Pd = (n, e, t) => Yo(n.l, [e, t]);
@@ -14101,7 +14101,7 @@ class cn {
     this.client = e, this.clock = t;
   }
 }
-const rn = (n, e) => n === e || n !== null && e !== null && n.client === e.client && n.clock === e.clock, E = (n, e) => new cn(n, e), ci = (n) => {
+const rn = (n, e) => n === e || n !== null && e !== null && n.client === e.client && n.clock === e.clock, M = (n, e) => new cn(n, e), ci = (n) => {
   for (const [e, t] of n.doc.share.entries())
     if (t === n)
       return e;
@@ -14126,7 +14126,7 @@ class di {
     this.type = e, this.tname = t, this.item = i, this.assoc = r;
   }
 }
-const qn = (n) => new di(n.type == null ? null : E(n.type.client, n.type.clock), n.tname ?? null, n.item == null ? null : E(n.item.client, n.item.clock), n.assoc == null ? 0 : n.assoc);
+const qn = (n) => new di(n.type == null ? null : M(n.type.client, n.type.clock), n.tname ?? null, n.item == null ? null : M(n.item.client, n.item.clock), n.assoc == null ? 0 : n.assoc);
 class Ow {
   /**
    * @param {AbstractType<any>} type
@@ -14139,7 +14139,7 @@ class Ow {
 }
 const Dw = (n, e, t = 0) => new Ow(n, e, t), Li = (n, e, t) => {
   let i = null, r = null;
-  return n._item === null ? r = ci(n) : i = E(n._item.id.client, n._item.id.clock), new di(i, r, e, t);
+  return n._item === null ? r = ci(n) : i = M(n._item.id.client, n._item.id.clock), new di(i, r, e, t);
 }, Cs = (n, e, t = 0) => {
   let i = n._start;
   if (t < 0) {
@@ -14150,7 +14150,7 @@ const Dw = (n, e, t = 0) => new Ow(n, e, t), Li = (n, e, t) => {
   for (; i !== null; ) {
     if (!i.deleted && i.countable) {
       if (i.length > e)
-        return Li(n, E(i.id.client, i.id.clock + e), t);
+        return Li(n, M(i.id.client, i.id.clock + e), t);
       e -= i.length;
     }
     if (i.right === null && t < 0)
@@ -14206,10 +14206,10 @@ class ia {
     this.ds = e, this.sv = t;
   }
 }
-const Rd = (n, e) => new ia(n, e), Es = (n) => Rd(Md(n.store), Mi(n.store)), Ot = (n, e) => e === void 0 ? !n.deleted : e.sv.has(n.id.client) && (e.sv.get(n.id.client) || 0) > n.id.clock && !An(e.ds, n.id), so = (n, e) => {
+const Rd = (n, e) => new ia(n, e), Es = (n) => Rd(Md(n.store), Mi(n.store)), Ot = (n, e) => e === void 0 ? !n.deleted : e.sv.has(n.id.client) && (e.sv.get(n.id.client) || 0) > n.id.clock && !Tn(e.ds, n.id), so = (n, e) => {
   const t = We(n.meta, so, Ut), i = n.doc.store;
   t.has(e) || (e.sv.forEach((r, s) => {
-    r < $(i, s) && fe(n, E(s, r));
+    r < $(i, s) && fe(n, M(s, r));
   }), xt(n, e.ds, (r) => {
   }), t.add(e));
 };
@@ -14295,7 +14295,7 @@ class Rw {
    * @param {boolean} local
    */
   constructor(e, t, i) {
-    this.doc = e, this.deleteSet = new Tn(), this.beforeState = Mi(e.store), this.afterState = /* @__PURE__ */ new Map(), this.changed = /* @__PURE__ */ new Map(), this.changedParentTypes = /* @__PURE__ */ new Map(), this._mergeStructs = [], this.origin = t, this.meta = /* @__PURE__ */ new Map(), this.local = i, this.subdocsAdded = /* @__PURE__ */ new Set(), this.subdocsRemoved = /* @__PURE__ */ new Set(), this.subdocsLoaded = /* @__PURE__ */ new Set(), this._needFormattingCleanup = !1;
+    this.doc = e, this.deleteSet = new An(), this.beforeState = Mi(e.store), this.afterState = /* @__PURE__ */ new Map(), this.changed = /* @__PURE__ */ new Map(), this.changedParentTypes = /* @__PURE__ */ new Map(), this._mergeStructs = [], this.origin = t, this.meta = /* @__PURE__ */ new Map(), this.local = i, this.subdocsAdded = /* @__PURE__ */ new Set(), this.subdocsRemoved = /* @__PURE__ */ new Set(), this.subdocsLoaded = /* @__PURE__ */ new Set(), this._needFormattingCleanup = !1;
   }
 }
 const Kl = (n, e) => e.deleteSet.clients.size === 0 && !Wb(e.afterState, (t, i) => e.beforeState.get(i) !== t) ? !1 : (ea(e.deleteSet), yw(n, e), On(n, e.deleteSet), !0), Gl = (n, e, t) => {
@@ -14383,7 +14383,7 @@ const Kl = (n, e) => e.deleteSet.clients.size === 0 && !Wb(e.afterState, (t, i)
         ), f = Re(p, h);
         f + 1 < p.length && Yi(p, f + 1) > 1 || f > 0 && Yi(p, f);
       }
-      if (!t.local && t.afterState.get(i.clientID) !== t.beforeState.get(i.clientID) && (dw(Qo, yd, "[yjs] ", wd, kd, "Changed the client-id because another client seems to be using it."), i.clientID = Td()), i.emit("afterTransactionCleanup", [t, i]), i._observers.has("update")) {
+      if (!t.local && t.afterState.get(i.clientID) !== t.beforeState.get(i.clientID) && (dw(Qo, yd, "[yjs] ", wd, kd, "Changed the client-id because another client seems to be using it."), i.clientID = Ad()), i.emit("afterTransactionCleanup", [t, i]), i._observers.has("update")) {
         const u = new Ei();
         Kl(u, t) && i.emit("update", [u.toUint8Array(), t.origin, i, t]);
       }
@@ -14442,7 +14442,7 @@ const Yl = (n, e, t) => {
         if (p instanceof R) {
           if (p.redone !== null) {
             let { item: f, diff: m } = lo(l, p.id);
-            m > 0 && (f = fe(a, E(f.id.client, f.id.clock + m))), p = f;
+            m > 0 && (f = fe(a, M(f.id.client, f.id.clock + m))), p = f;
           }
           !p.deleted && s.some((f) => f === a.doc || ui(
             /** @type {AbstractType<any>} */
@@ -14457,7 +14457,7 @@ const Yl = (n, e, t) => {
           f,
           p
         )) && // Never redo structs in stackItem.insertions because they were created and deleted in the same capture interval.
-        !An(c.insertions, p.id) && u.add(p);
+        !Tn(c.insertions, p.id) && u.add(p);
       }), u.forEach((p) => {
         h = sh(a, p, u, c.insertions, n.ignoreRemoteMapChanges, n) !== null || h;
       });
@@ -14502,10 +14502,10 @@ class $d extends od {
         return;
       const c = this.undoing, u = this.redoing, d = c ? this.redoStack : this.undoStack;
       c ? this.stopCapturing() : u || this.clear(!1, !0);
-      const h = new Tn();
+      const h = new An();
       l.afterState.forEach((g, b) => {
-        const k = l.beforeState.get(b) || 0, S = g - k;
-        S > 0 && li(h, b, k, S);
+        const k = l.beforeState.get(b) || 0, x = g - k;
+        x > 0 && li(h, b, k, x);
       });
       const p = Ny();
       let f = !1;
@@ -14634,18 +14634,18 @@ class $d extends od {
   }
 }
 function* jw(n) {
-  const e = A(n.restDecoder);
+  const e = T(n.restDecoder);
   for (let t = 0; t < e; t++) {
-    const i = A(n.restDecoder), r = n.readClient();
-    let s = A(n.restDecoder);
+    const i = T(n.restDecoder), r = n.readClient();
+    let s = T(n.restDecoder);
     for (let o = 0; o < i; o++) {
       const a = n.readInfo();
       if (a === 10) {
-        const l = A(n.restDecoder);
-        yield new Te(E(r, s), l), s += l;
+        const l = T(n.restDecoder);
+        yield new Ae(M(r, s), l), s += l;
       } else if (Vr & a) {
         const l = (a & (et | ce)) === 0, c = new R(
-          E(r, s),
+          M(r, s),
           null,
           // left
           (a & ce) === ce ? n.readLeftID() : null,
@@ -14665,7 +14665,7 @@ function* jw(n) {
         yield c, s += c.length;
       } else {
         const l = n.readLen();
-        yield new Me(E(r, s), l), s += l;
+        yield new Me(M(r, s), l), s += l;
       }
     }
   }
@@ -14684,7 +14684,7 @@ class ra {
   next() {
     do
       this.curr = this.gen.next().value || null;
-    while (this.filterSkips && this.curr !== null && this.curr.constructor === Te);
+    while (this.filterSkips && this.curr !== null && this.curr.constructor === Ae);
     return this.curr;
   }
 }
@@ -14699,19 +14699,19 @@ class sa {
 const $w = (n) => gr(n, Od, Ei), Vw = (n, e) => {
   if (n.constructor === Me) {
     const { client: t, clock: i } = n.id;
-    return new Me(E(t, i + e), n.length - e);
-  } else if (n.constructor === Te) {
+    return new Me(M(t, i + e), n.length - e);
+  } else if (n.constructor === Ae) {
     const { client: t, clock: i } = n.id;
-    return new Te(E(t, i + e), n.length - e);
+    return new Ae(M(t, i + e), n.length - e);
   } else {
     const t = (
       /** @type {Item} */
       n
     ), { client: i, clock: r } = t.id;
     return new R(
-      E(i, r + e),
+      M(i, r + e),
       null,
-      E(i, r + e - 1),
+      M(i, r + e - 1),
       null,
       t.rightOrigin,
       t.parent,
@@ -14730,7 +14730,7 @@ const $w = (n) => gr(n, Od, Ei), Vw = (n, e) => {
     (h, p) => {
       if (h.curr.id.client === p.curr.id.client) {
         const f = h.curr.id.clock - p.curr.id.clock;
-        return f === 0 ? h.curr.constructor === p.curr.constructor ? 0 : h.curr.constructor === Te ? 1 : -1 : f;
+        return f === 0 ? h.curr.constructor === p.curr.constructor ? 0 : h.curr.constructor === Ae ? 1 : -1 : f;
       } else
         return p.curr.id.client - h.curr.id.client;
     }
@@ -14753,16 +14753,16 @@ const $w = (n) => gr(n, Od, Ei), Vw = (n, e) => {
       if (d !== s.struct.id.client)
         ut(a, s.struct, s.offset), s = { struct: h, offset: 0 }, u.next();
       else if (s.struct.id.clock + s.struct.length < h.id.clock)
-        if (s.struct.constructor === Te)
+        if (s.struct.constructor === Ae)
           s.struct.length = h.id.clock + h.length - s.struct.id.clock;
         else {
           ut(a, s.struct, s.offset);
           const f = h.id.clock - s.struct.id.clock - s.struct.length;
-          s = { struct: new Te(E(d, s.struct.id.clock + s.struct.length), f), offset: 0 };
+          s = { struct: new Ae(M(d, s.struct.id.clock + s.struct.length), f), offset: 0 };
         }
       else {
         const f = s.struct.id.clock + s.struct.length - h.id.clock;
-        f > 0 && (s.struct.constructor === Te ? s.struct.length -= f : h = Vw(h, f)), s.struct.mergeWith(
+        f > 0 && (s.struct.constructor === Ae ? s.struct.length -= f : h = Vw(h, f)), s.struct.mergeWith(
           /** @type {any} */
           h
         ) || (ut(a, s.struct, s.offset), s = { struct: h, offset: 0 }, u.next());
@@ -14772,7 +14772,7 @@ const $w = (n) => gr(n, Od, Ei), Vw = (n, e) => {
         /** @type {Item | GC} */
         u.curr
       ), offset: 0 }, u.next();
-    for (let h = u.curr; h !== null && h.id.client === d && h.id.clock === s.struct.id.clock + s.struct.length && h.constructor !== Te; h = u.next())
+    for (let h = u.curr; h !== null && h.id.client === d && h.id.clock === s.struct.id.clock + s.struct.length && h.constructor !== Ae; h = u.next())
       ut(a, s.struct, s.offset), s = { struct: h, offset: 0 };
   }
   s !== null && (ut(a, s.struct, s.offset), s = null), oa(a);
@@ -14782,7 +14782,7 @@ const $w = (n) => gr(n, Od, Ei), Vw = (n, e) => {
   const r = Id(e), s = new i(), o = new sa(s), a = new t(Mn(n)), l = new ra(a, !1);
   for (; l.curr; ) {
     const u = l.curr, d = u.id.client, h = r.get(d) || 0;
-    if (l.curr.constructor === Te) {
+    if (l.curr.constructor === Ae) {
       l.next();
       continue;
     }
@@ -14849,7 +14849,7 @@ class Ur {
    * @return {boolean}
    */
   deletes(e) {
-    return An(this.transaction.deleteSet, e.id);
+    return Tn(this.transaction.deleteSet, e.id);
   }
   /**
    * @type {Map<string, { action: 'add' | 'update' | 'delete', oldValue: any, newValue: any }>}
@@ -15237,7 +15237,7 @@ const Ud = (n, e, t) => {
   const s = n.doc, o = s.clientID, a = s.store, l = t === null ? e._start : t.right;
   let c = [];
   const u = () => {
-    c.length > 0 && (r = new R(E(o, $(a, o)), r, r && r.lastId, l, l && l.id, e, null, new Jt(c)), r.integrate(n, 0), c = []);
+    c.length > 0 && (r = new R(M(o, $(a, o)), r, r && r.lastId, l, l && l.id, e, null, new Jt(c)), r.integrate(n, 0), c = []);
   };
   i.forEach((d) => {
     if (d === null)
@@ -15255,20 +15255,20 @@ const Ud = (n, e, t) => {
           switch (u(), d.constructor) {
             case Uint8Array:
             case ArrayBuffer:
-              r = new R(E(o, $(a, o)), r, r && r.lastId, l, l && l.id, e, null, new Ti(new Uint8Array(
+              r = new R(M(o, $(a, o)), r, r && r.lastId, l, l && l.id, e, null, new Ai(new Uint8Array(
                 /** @type {Uint8Array} */
                 d
               ))), r.integrate(n, 0);
               break;
             case rt:
-              r = new R(E(o, $(a, o)), r, r && r.lastId, l, l && l.id, e, null, new Ai(
+              r = new R(M(o, $(a, o)), r, r && r.lastId, l, l && l.id, e, null, new Ti(
                 /** @type {Doc} */
                 d
               )), r.integrate(n, 0);
               break;
             default:
               if (d instanceof G)
-                r = new R(E(o, $(a, o)), r, r && r.lastId, l, l && l.id, e, null, new Be(d)), r.integrate(n, 0);
+                r = new R(M(o, $(a, o)), r, r && r.lastId, l, l && l.id, e, null, new Be(d)), r.integrate(n, 0);
               else
                 throw new Error("Unexpected content type in insert operation");
           }
@@ -15284,7 +15284,7 @@ const Ud = (n, e, t) => {
   for (s !== null && (o = s.p, t -= s.index, t === 0 && (o = o.prev, t += o && o.countable && !o.deleted ? o.length : 0)); o !== null; o = o.right)
     if (!o.deleted && o.countable) {
       if (t <= o.length) {
-        t < o.length && fe(n, E(o.id.client, o.id.clock + t));
+        t < o.length && fe(n, M(o.id.client, o.id.clock + t));
         break;
       }
       t -= o.length;
@@ -15302,9 +15302,9 @@ const Ud = (n, e, t) => {
   const r = t, s = i, o = Hr(e, t);
   let a = e._start;
   for (o !== null && (a = o.p, t -= o.index); a !== null && t > 0; a = a.right)
-    !a.deleted && a.countable && (t < a.length && fe(n, E(a.id.client, a.id.clock + t)), t -= a.length);
+    !a.deleted && a.countable && (t < a.length && fe(n, M(a.id.client, a.id.clock + t)), t -= a.length);
   for (; i > 0 && a !== null; )
-    a.deleted || (i < a.length && fe(n, E(a.id.client, a.id.clock + i)), a.delete(n), i -= a.length), a = a.right;
+    a.deleted || (i < a.length && fe(n, M(a.id.client, a.id.clock + i)), a.delete(n), i -= a.length), a = a.right;
   if (i > 0)
     throw Gd();
   e._searchMarker && hi(
@@ -15331,13 +15331,13 @@ const Ud = (n, e, t) => {
         a = new Jt([i]);
         break;
       case Uint8Array:
-        a = new Ti(
+        a = new Ai(
           /** @type {Uint8Array} */
           i
         );
         break;
       case rt:
-        a = new Ai(
+        a = new Ti(
           /** @type {Doc} */
           i
         );
@@ -15348,7 +15348,7 @@ const Ud = (n, e, t) => {
         else
           throw new Error("Unexpected content type");
     }
-  new R(E(o, $(s.store, o)), r, r && r.lastId, null, null, e, t, a).integrate(n, 0);
+  new R(M(o, $(s.store, o)), r, r && r.lastId, null, null, e, t, a).integrate(n, 0);
 }, ca = (n, e) => {
   n.doc ?? ae();
   const t = n._map.get(e);
@@ -15831,7 +15831,7 @@ const Zl = (n, e, t) => {
         );
         break;
       default:
-        e.right.deleted || (t < e.right.length && fe(n, E(e.right.id.client, e.right.id.clock + t)), e.index += e.right.length, t -= e.right.length);
+        e.right.deleted || (t < e.right.length && fe(n, M(e.right.id.client, e.right.id.clock + t)), e.index += e.right.length, t -= e.right.length);
         break;
     }
     e.left = e.right, e.right = e.right.right;
@@ -15861,7 +15861,7 @@ const Zl = (n, e, t) => {
     ), t.forward();
   const r = n.doc, s = r.clientID;
   i.forEach((o, a) => {
-    const l = t.left, c = t.right, u = new R(E(s, $(r.store, s)), l, l && l.lastId, c, c && c.id, e, null, new q(a, o));
+    const l = t.left, c = t.right, u = new R(M(s, $(r.store, s)), l, l && l.lastId, c, c && c.id, e, null, new q(a, o));
     u.integrate(n, 0), t.right = u, t.forward();
   });
 }, Dn = (n, e) => {
@@ -15886,7 +15886,7 @@ const Zl = (n, e, t) => {
     if (!ft(c, l)) {
       o.set(a, c);
       const { left: u, right: d } = t;
-      t.right = new R(E(s, $(r.store, s)), u, u && u.lastId, d, d && d.id, e, null, new q(a, l)), t.right.integrate(n, 0), t.forward();
+      t.right = new R(M(s, $(r.store, s)), u, u && u.lastId, d, d && d.id, e, null, new q(a, l)), t.right.integrate(n, 0), t.forward();
     }
   }
   return o;
@@ -15901,7 +15901,7 @@ const Zl = (n, e, t) => {
     i
   ) : i instanceof G ? new Be(i) : new Yt(i);
   let { left: c, right: u, index: d } = t;
-  e._searchMarker && hi(e._searchMarker, t.index, l.getLength()), u = new R(E(o, $(s.store, o)), c, c && c.lastId, u, u && u.id, e, null, l), u.integrate(n, 0), t.right = u, t.index = d, t.forward(), eh(n, e, t, a);
+  e._searchMarker && hi(e._searchMarker, t.index, l.getLength()), u = new R(M(o, $(s.store, o)), c, c && c.lastId, u, u && u.id, e, null, l), u.integrate(n, 0), t.right = u, t.index = d, t.forward(), eh(n, e, t, a);
 }, ec = (n, e, t, i, r) => {
   const s = n.doc, o = s.clientID;
   th(t, r);
@@ -15928,7 +15928,7 @@ const Zl = (n, e, t) => {
           break;
         }
         default:
-          i < t.right.length && fe(n, E(t.right.id.client, t.right.id.clock + i)), i -= t.right.length;
+          i < t.right.length && fe(n, M(t.right.id.client, t.right.id.clock + i)), i -= t.right.length;
           break;
       }
     t.forward();
@@ -15938,7 +15938,7 @@ const Zl = (n, e, t) => {
     for (; i > 0; i--)
       l += `
 `;
-    t.right = new R(E(o, $(s.store, o)), t.left, t.left && t.left.lastId, t.right, t.right && t.right.id, e, null, new _e(l)), t.right.integrate(n, 0), t.forward();
+    t.right = new R(M(o, $(s.store, o)), t.left, t.left && t.left.lastId, t.right, t.right && t.right.id, e, null, new _e(l)), t.right.integrate(n, 0), t.forward();
   }
   eh(n, e, t, a);
 }, ih = (n, e, t, i, r) => {
@@ -16064,7 +16064,7 @@ const Zl = (n, e, t) => {
         case Be:
         case Yt:
         case _e:
-          t < e.right.length && fe(n, E(e.right.id.client, e.right.id.clock + t)), t -= e.right.length, e.right.delete(n);
+          t < e.right.length && fe(n, M(e.right.id.client, e.right.id.clock + t)), t -= e.right.length, e.right.delete(n);
           break;
       }
     e.forward();
@@ -16507,7 +16507,7 @@ class St extends G {
   }
 }
 const ok = (n) => new St();
-class Ts {
+class As {
   /**
    * @param {YXmlFragment | YXmlElement} root
    * @param {function(AbstractType<any>):boolean} [f]
@@ -16616,7 +16616,7 @@ class Wt extends G {
    * @public
    */
   createTreeWalker(e) {
-    return new Ts(this, e);
+    return new As(this, e);
   }
   /**
    * Returns the first YXmlElement that matches the query.
@@ -16635,7 +16635,7 @@ class Wt extends G {
    */
   querySelector(e) {
     e = e.toUpperCase();
-    const i = new Ts(this, (r) => r.nodeName && r.nodeName.toUpperCase() === e).next();
+    const i = new As(this, (r) => r.nodeName && r.nodeName.toUpperCase() === e).next();
     return i.done ? null : i.value;
   }
   /**
@@ -16650,7 +16650,7 @@ class Wt extends G {
    * @public
    */
   querySelectorAll(e) {
-    return e = e.toUpperCase(), kt(new Ts(this, (t) => t.nodeName && t.nodeName.toUpperCase() === e));
+    return e = e.toUpperCase(), kt(new As(this, (t) => t.nodeName && t.nodeName.toUpperCase() === e));
   }
   /**
    * Creates YXmlEvent and calls observers.
@@ -16809,7 +16809,7 @@ class Wt extends G {
    * @param {UpdateEncoderV1 | UpdateEncoderV2} encoder The encoder to write data to.
    */
   _write(e) {
-    e.writeTypeRef(Tk);
+    e.writeTypeRef(Ak);
   }
 }
 const ak = (n) => new Wt();
@@ -17077,7 +17077,7 @@ class wr extends xn {
    * @param {UpdateEncoderV1 | UpdateEncoderV2} encoder The encoder to write data to.
    */
   _write(e) {
-    e.writeTypeRef(Ak), e.writeKey(this.hookName);
+    e.writeTypeRef(Tk), e.writeKey(this.hookName);
   }
 }
 const uk = (n) => new wr(n.readKey());
@@ -17254,7 +17254,7 @@ class Me extends ua {
     return null;
   }
 }
-class Ti {
+class Ai {
   /**
    * @param {Uint8Array} content
    */
@@ -17283,7 +17283,7 @@ class Ti {
    * @return {ContentBinary}
    */
   copy() {
-    return new Ti(this.content);
+    return new Ai(this.content);
   }
   /**
    * @param {number} offset
@@ -17329,7 +17329,7 @@ class Ti {
     return 3;
   }
 }
-const pk = (n) => new Ti(n.readBuf());
+const pk = (n) => new Ai(n.readBuf());
 class fi {
   /**
    * @param {number} len
@@ -17408,7 +17408,7 @@ class fi {
   }
 }
 const fk = (n) => new fi(n.readLen()), rh = (n, e) => new rt({ guid: n, ...e, shouldLoad: e.shouldLoad || e.autoLoad || !1 });
-class Ai {
+class Ti {
   /**
    * @param {Doc} doc
    */
@@ -17439,7 +17439,7 @@ class Ai {
    * @return {ContentDoc}
    */
   copy() {
-    return new Ai(rh(this.doc.guid, this.opts));
+    return new Ti(rh(this.doc.guid, this.opts));
   }
   /**
    * @param {number} offset
@@ -17487,7 +17487,7 @@ class Ai {
     return 9;
   }
 }
-const mk = (n) => new Ai(rh(n.readString(), n.readAny()));
+const mk = (n) => new Ti(rh(n.readString(), n.readAny()));
 class Yt {
   /**
    * @param {Object} embed
@@ -17908,7 +17908,7 @@ const vk = (n) => new _e(n.readString()), xk = [
   ak,
   uk,
   dk
-], Sk = 0, Ck = 1, Ek = 2, Mk = 3, Tk = 4, Ak = 5, Ok = 6;
+], Sk = 0, Ck = 1, Ek = 2, Mk = 3, Ak = 4, Tk = 5, Ok = 6;
 class Be {
   /**
    * @param {AbstractType<any>} type
@@ -18004,7 +18004,7 @@ class Be {
 const Dk = (n) => new Be(xk[n.readTypeRef()](n)), lo = (n, e) => {
   let t = e, i = 0, r;
   do
-    i > 0 && (t = E(t.client, t.clock + i)), r = un(n, t), i = t.clock - r.id.clock, t = r.redone;
+    i > 0 && (t = M(t.client, t.clock + i)), r = un(n, t), i = t.clock - r.id.clock, t = r.redone;
   while (t !== null && r instanceof R);
   return {
     item: r,
@@ -18016,20 +18016,20 @@ const Dk = (n) => new Be(xk[n.readTypeRef()](n)), lo = (n, e) => {
     n.parent._item;
 }, vr = (n, e, t) => {
   const { client: i, clock: r } = e.id, s = new R(
-    E(i, r + t),
+    M(i, r + t),
     e,
-    E(i, r + t - 1),
+    M(i, r + t - 1),
     e.right,
     e.rightOrigin,
     e.parent,
     e.parentSub,
     e.content.splice(t)
   );
-  return e.deleted && s.markDeleted(), e.keep && (s.keep = !0), e.redone !== null && (s.redone = E(e.redone.client, e.redone.clock + t)), e.right = s, s.right !== null && (s.right.left = s), n._mergeStructs.push(s), s.parentSub !== null && s.right === null && s.parent._map.set(s.parentSub, s), e.length = t, s;
+  return e.deleted && s.markDeleted(), e.keep && (s.keep = !0), e.redone !== null && (s.redone = M(e.redone.client, e.redone.clock + t)), e.right = s, s.right !== null && (s.right.left = s), n._mergeStructs.push(s), s.parentSub !== null && s.right === null && s.parent._map.set(s.parentSub, s), e.length = t, s;
 }, nc = (n, e) => Kb(
   n,
   /** @param {StackItem} s */
-  (t) => An(t.deletions, e)
+  (t) => Tn(t.deletions, e)
 ), sh = (n, e, t, i, r, s) => {
   const o = n.doc, a = o.store, l = o.clientID, c = e.redone;
   if (c !== null)
@@ -18077,13 +18077,13 @@ const Dk = (n) => new Be(xk[n.readTypeRef()](n)), lo = (n, e) => {
       h = h.right;
     }
   } else if (h = null, e.right && !r) {
-    for (d = e; d !== null && d.right !== null && (d.right.redone || An(i, d.right.id) || nc(s.undoStack, d.right.id) || nc(s.redoStack, d.right.id)); )
+    for (d = e; d !== null && d.right !== null && (d.right.redone || Tn(i, d.right.id) || nc(s.undoStack, d.right.id) || nc(s.redoStack, d.right.id)); )
       for (d = d.right; d.redone; ) d = fe(n, d.redone);
     if (d && d.right !== null)
       return null;
   } else
     d = p._map.get(e.parentSub) || null;
-  const f = $(a, l), m = E(l, f), g = new R(
+  const f = $(a, l), m = M(l, f), g = new R(
     m,
     d,
     d && d.lastId,
@@ -18175,7 +18175,7 @@ class R extends ua {
    * @param {number} offset
    */
   integrate(e, t) {
-    if (t > 0 && (this.id.clock += t, this.left = Jl(e, e.doc.store, E(this.id.client, this.id.clock - 1)), this.origin = this.left.lastId, this.content = this.content.splice(t), this.length -= t), this.parent) {
+    if (t > 0 && (this.id.clock += t, this.left = Jl(e, e.doc.store, M(this.id.client, this.id.clock - 1)), this.origin = this.left.lastId, this.content = this.content.splice(t), this.length -= t), this.parent) {
       if (!this.left && (!this.right || this.right.left !== null) || this.left && this.left.right !== this.right) {
         let i = this.left, r;
         if (i !== null)
@@ -18249,7 +18249,7 @@ class R extends ua {
    * Computes the last content address of this Item.
    */
   get lastId() {
-    return this.length === 1 ? this.id : E(this.id.client, this.id.clock + this.length - 1);
+    return this.length === 1 ? this.id : M(this.id.client, this.id.clock + this.length - 1);
   }
   /**
    * Try to merge two items
@@ -18302,7 +18302,7 @@ class R extends ua {
    * @param {number} offset
    */
   write(e, t) {
-    const i = t > 0 ? E(this.id.client, this.id.clock + t - 1) : this.origin, r = this.rightOrigin, s = this.parentSub, o = this.content.getRef() & Vr | (i === null ? 0 : ce) | // origin is defined
+    const i = t > 0 ? M(this.id.client, this.id.clock + t - 1) : this.origin, r = this.rightOrigin, s = this.parentSub, o = this.content.getRef() & Vr | (i === null ? 0 : ce) | // origin is defined
     (r === null ? 0 : et) | // right origin is defined
     (s === null ? 0 : si);
     if (e.writeInfo(o), i !== null && e.writeLeftID(i), r !== null && e.writeRightID(r), i === null && r === null) {
@@ -18351,7 +18351,7 @@ const oh = (n, e) => Nk[e & Vr](n), Nk = [
   }
   // 10 - Skip is not ItemContent
 ], Ik = 10;
-class Te extends ua {
+class Ae extends ua {
   get deleted() {
     return !0;
   }
@@ -18542,13 +18542,13 @@ const Hk = (n) => new Uk().digest(n), Wk = (n) => {
     n[t % 6] = n[t % 6] ^ n[t];
   return n.slice(0, 6);
 }, Jk = (n) => Gy(Wk(Hk(Xy(n)))), xr = (n, e) => e === void 0 ? !n.deleted : e.sv.has(n.id.client) && /** @type {number} */
-e.sv.get(n.id.client) > n.id.clock && !An(e.ds, n.id), Kk = [{ light: "#ecd44433", dark: "#ecd444" }], Gk = (n, e, t) => {
+e.sv.get(n.id.client) > n.id.clock && !Tn(e.ds, n.id), Kk = [{ light: "#ecd44433", dark: "#ecd444" }], Gk = (n, e, t) => {
   if (!n.has(t)) {
     if (n.size < e.length) {
       const i = Ut();
       n.forEach((r) => i.add(r)), e = e.filter((r) => !i.has(r));
     }
-    n.set(t, Ay(e));
+    n.set(t, Ty(e));
   }
   return (
     /** @type {ColorDef} */
@@ -18649,7 +18649,7 @@ e.sv.get(n.id.client) > n.id.clock && !An(e.ds, n.id), Kk = [{ light: "#ecd44433
         e.anchor,
         t.mapping
       );
-      n.setSelection(x.create(n.doc, i));
+      n.setSelection(S.create(n.doc, i));
     } else {
       const i = hn(
         t.doc,
@@ -18662,7 +18662,7 @@ e.sv.get(n.id.client) > n.id.clock && !An(e.ds, n.id), Kk = [{ light: "#ecd44433
         e.head,
         t.mapping
       );
-      i !== null && r !== null && n.setSelection(C.between(n.doc.resolve(i), n.doc.resolve(r)));
+      i !== null && r !== null && n.setSelection(E.between(n.doc.resolve(i), n.doc.resolve(r)));
     }
 }, co = (n, e) => ({
   type: (
@@ -18758,7 +18758,7 @@ class Qk {
       );
       if (e) {
         const r = Ze(Pe(e.anchor, 0), i.doc.content.size), s = Ze(Pe(e.head, 0), i.doc.content.size);
-        i.setSelection(C.create(i.doc, r, s));
+        i.setSelection(E.create(i.doc, r, s));
       }
       this.prosemirrorView.dispatch(
         i.setMeta(B, { isChangeOrigin: !0, binding: this })
@@ -19154,14 +19154,14 @@ const ch = (n, e, t, i, r, s) => {
             /** @type {PModel.Node} */
             p,
             i
-          ), S = rc(
+          ), x = rc(
             /** @type {Y.XmlElement} */
             f,
             /** @type {PModel.Node} */
             m,
             i
           );
-          k.foundMappedChild && !S.foundMappedChild ? b = !1 : !k.foundMappedChild && S.foundMappedChild || k.equalityFactor < S.equalityFactor ? g = !1 : b = !1;
+          k.foundMappedChild && !x.foundMappedChild ? b = !1 : !k.foundMappedChild && x.foundMappedChild || k.equalityFactor < x.equalityFactor ? g = !1 : b = !1;
         }
         g ? (ho(
           n,
@@ -19266,7 +19266,7 @@ const ov = () => {
   return Cs(e, e._length, -1);
 }, lv = (n, e) => {
   let t = null, i = null;
-  return n._item === null ? i = ci(n) : t = E(n._item.id.client, n._item.id.clock), new di(t, i, e.id);
+  return n._item === null ? i = ci(n) : t = M(n._item.id.client, n._item.id.clock), new di(t, i, e.id);
 }, hn = (n, e, t, i) => {
   const r = Iw(t, n);
   if (r === null || r.type !== e && !ui(e, r.type._item))
@@ -19656,7 +19656,7 @@ const uv = (n, e, t) => n !== e, dv = (n) => {
 }, gi = (
   /** @type {TextEncoder} */
   typeof TextEncoder < "u" ? new TextEncoder() : null
-), Mv = (n) => gi.encode(n), Tv = gi ? Mv : Ev;
+), Mv = (n) => gi.encode(n), Av = gi ? Mv : Ev;
 let Hn = typeof TextDecoder > "u" ? null : new TextDecoder("utf-8", { fatal: !0, ignoreBOM: !0 });
 Hn && Hn.decode(new Uint8Array()).length === 1 && (Hn = null);
 const Er = (n, e) => {
@@ -19666,14 +19666,14 @@ const Er = (n, e) => {
   for (; e > Qi; )
     Er(n, ph | Qi & e), e = vv(e / 128);
   Er(n, Qi & e);
-}, fo = new Uint8Array(3e4), Av = fo.length / 3, Ov = (n, e) => {
-  if (e.length < Av) {
+}, fo = new Uint8Array(3e4), Tv = fo.length / 3, Ov = (n, e) => {
+  if (e.length < Tv) {
     const t = gi.encodeInto(e, fo).written || 0;
     Kr(n, t);
     for (let i = 0; i < t; i++)
       Er(n, fo[i]);
   } else
-    zv(n, Tv(e));
+    zv(n, Av(e));
 }, Dv = (n, e) => {
   const t = unescape(encodeURIComponent(e)), i = t.length;
   Kr(n, i);
@@ -19776,7 +19776,7 @@ function Uv(n) {
     calculateDelay: n.calculateDelay === void 0 ? null : n.calculateDelay
   };
 }
-async function As(n) {
+async function Ts(n) {
   return new Promise((e) => setTimeout(e, n));
 }
 function Hv(n, e) {
@@ -19825,7 +19825,7 @@ async function Wv(n, e) {
         throw l;
       i.attemptNum++;
       const c = r(i, t);
-      return c && await As(c), s();
+      return c && await Ts(c), s();
     };
     return i.attemptsRemaining > 0 && i.attemptsRemaining--, t.timeout ? new Promise((l, c) => {
       const u = setTimeout(() => {
@@ -19848,9 +19848,9 @@ async function Wv(n, e) {
     }) : n(i, t).catch(a);
   }
   const o = t.calculateDelay ? t.calculateDelay(i, t) : t.initialDelay;
-  if (o && await As(o), i.attemptNum < 1 && t.initialJitter) {
+  if (o && await Ts(o), i.attemptNum < 1 && t.initialJitter) {
     const a = r(i, t);
-    a && await As(a);
+    a && await Ts(a);
   }
   return s();
 }
@@ -20001,26 +20001,26 @@ const ga = () => new g0(), xh = (n) => {
     e.set(r, t), t += r.length;
   }
   return e.set(new Uint8Array(n.cbuf.buffer, 0, n.cpos), t), e;
-}, Tr = (n, e) => {
+}, Ar = (n, e) => {
   const t = n.cbuf.length;
   n.cpos === t && (n.bufs.push(n.cbuf), n.cbuf = new Uint8Array(t * 2), n.cpos = 0), n.cbuf[n.cpos++] = e;
 }, Y = (n, e) => {
   for (; e > Kn; )
-    Tr(n, Mr | Kn & e), e = kh(e / 128);
-  Tr(n, Kn & e);
+    Ar(n, Mr | Kn & e), e = kh(e / 128);
+  Ar(n, Kn & e);
 }, yo = new Uint8Array(3e4), b0 = yo.length / 3, y0 = (n, e) => {
   if (e.length < b0) {
     const t = yi.encodeInto(e, yo).written || 0;
     Y(n, t);
     for (let i = 0; i < t; i++)
-      Tr(n, yo[i]);
+      Ar(n, yo[i]);
   } else
     Nn(n, t0(e));
 }, w0 = (n, e) => {
   const t = unescape(encodeURIComponent(e)), i = t.length;
   Y(n, i);
   for (let r = 0; r < i; r++)
-    Tr(
+    Ar(
       n,
       /** @type {number} */
       t.codePointAt(r)
@@ -20093,20 +20093,20 @@ const Mh = (n) => new v0(n), x0 = (n, e) => {
 ), Yr = Wn ? E0 : C0, M0 = (n) => {
   const e = n.pos, t = Yr(n);
   return n.pos = e, t;
-}, T0 = (n) => new Uint8Array(n), A0 = (n, e, t) => new Uint8Array(n, e, t), O0 = (n) => new Uint8Array(n), D0 = (n) => {
+}, A0 = (n) => new Uint8Array(n), T0 = (n, e, t) => new Uint8Array(n, e, t), O0 = (n) => new Uint8Array(n), D0 = (n) => {
   let e = "";
   for (let t = 0; t < n.byteLength; t++)
     e += Kv(n[t]);
   return btoa(e);
 }, N0 = (n) => Buffer.from(n.buffer, n.byteOffset, n.byteLength).toString("base64"), I0 = (n) => {
-  const e = atob(n), t = T0(e.length);
+  const e = atob(n), t = A0(e.length);
   for (let i = 0; i < e.length; i++)
     t[i] = e.charCodeAt(i);
   return t;
 }, z0 = (n) => {
   const e = Buffer.from(n, "base64");
-  return A0(e.buffer, e.byteOffset, e.byteLength);
-}, P0 = wh ? D0 : N0, R0 = wh ? I0 : z0, Th = /* @__PURE__ */ new Map();
+  return T0(e.buffer, e.byteOffset, e.byteLength);
+}, P0 = wh ? D0 : N0, R0 = wh ? I0 : z0, Ah = /* @__PURE__ */ new Map();
 class _0 {
   /**
    * @param {string} room
@@ -20124,7 +20124,7 @@ class _0 {
     r0(this._onChange);
   }
 }
-const L0 = typeof BroadcastChannel > "u" ? _0 : BroadcastChannel, ya = (n) => mh(Th, n, () => {
+const L0 = typeof BroadcastChannel > "u" ? _0 : BroadcastChannel, ya = (n) => mh(Ah, n, () => {
   const e = gh(), t = new L0(n);
   return t.onmessage = (i) => e.forEach((r) => r(i.data, "broadcastchannel")), {
     bc: t,
@@ -20132,7 +20132,7 @@ const L0 = typeof BroadcastChannel > "u" ? _0 : BroadcastChannel, ya = (n) => mh
   };
 }), B0 = (n, e) => (ya(n).subs.add(e), e), j0 = (n, e) => {
   const t = ya(n), i = t.subs.delete(e);
-  return i && t.subs.size === 0 && (t.bc.close(), Th.delete(n)), i;
+  return i && t.subs.size === 0 && (t.bc.close(), Ah.delete(n)), i;
 }, $0 = (n, e, t = null) => {
   const i = ya(n);
   i.bc.postMessage(e), i.subs.forEach((r) => r(e, t));
@@ -20303,7 +20303,7 @@ const Zi = (n, e, t) => {
     removed: l
   }, t]);
 };
-class Ah {
+class Th {
   constructor() {
     this.callbacks = {};
   }
@@ -20360,7 +20360,7 @@ class er {
     return xh(this.encoder);
   }
 }
-class W0 extends Ah {
+class W0 extends Th {
   constructor(e) {
     super(), this.messageQueue = [], this.configuration = {
       url: "",
@@ -20545,7 +20545,7 @@ class W0 extends Ah {
 }
 const Oh = 0, wa = 1, Dh = 2, J0 = (n, e) => {
   Y(n, Oh);
-  const t = Tw(e);
+  const t = Aw(e);
   Nn(n, t);
 }, Nh = (n, e, t) => {
   Y(n, wa), Nn(n, Sw(e, t));
@@ -20740,7 +20740,7 @@ class rx extends Error {
     super(...arguments), this.code = 1001;
   }
 }
-class sx extends Ah {
+class sx extends Th {
   constructor(e) {
     var t, i, r;
     super(), this.configuration = {
@@ -21179,7 +21179,7 @@ const ax = Ho.create({
   }
 });
 function hx(n) {
-  return Object.entries(n || {}).map(([e, t]) => `${e}="${t}"`).join(" ");
+  return Object.entries(n || {}).map(([e, t]) => t !== null ? `${e}="${t}"` : "").join(" ");
 }
 const zh = Oi.extend({
   name: "emptyElement",
@@ -21296,7 +21296,7 @@ function mx(n, e, t, i = null) {
       const p = n.doc.nodeAt(d);
       p && (d += p.nodeSize);
     }
-    n = n.setSelection(C.create(
+    n = n.setSelection(E.create(
       n.doc,
       d + 1
     ));
@@ -21464,7 +21464,7 @@ const bx = zh.extend({
             }), p = u + d.nodeSize - 1;
             r = r.insert(p, h);
             const f = p;
-            r.doc.nodeAt(f) && (r = r.setSelection(C.create(
+            r.doc.nodeAt(f) && (r = r.setSelection(E.create(
               r.doc,
               f + 1
             )), r.scrollIntoView());
@@ -21632,33 +21632,11 @@ function Mx(n, e = []) {
     });
   }), t;
 }
-function Tx(n) {
+function Ax(n) {
   const t = new DOMParser().parseFromString(n, "application/xml"), i = t.querySelector("parsererror");
   return i ? (console.error("XML Parsing Error:", i.textContent), null) : t;
 }
-function Ax(n) {
-  if (!n) return "";
-  const e = [], t = n.querySelectorAll("text > body > *"), i = (r) => {
-    if (r.nodeType === Node.ELEMENT_NODE) {
-      const s = document.createElement(`tei-${r.tagName}`);
-      for (const o of r.attributes)
-        o.name === "xml:id" ? s.setAttribute("id", o.value) : s.setAttribute(o.name, o.value);
-      for (const o of r.childNodes)
-        s.appendChild(i(o));
-      return s;
-    } else
-      return r.cloneNode();
-  };
-  return t.forEach((r) => {
-    const s = i(r);
-    e.push(s.outerHTML);
-  }), e.join("");
-}
-function Ox(n) {
-  const e = Tx(n);
-  return e.documentElement.namespaceURI === "http://www.tei-c.org/ns/1.0" ? Ax(e) : xml;
-}
-function Dx(n, e, t, i = 3) {
+function Tx(n, e, t, i = 3) {
   let r = e - 1, s = 0;
   for (; r >= 0; ) {
     if (/[\p{P}\s]/.test(n.charAt(r))) {
@@ -21681,7 +21659,7 @@ function Dx(n, e, t, i = 3) {
   }
   return `&#8230; ${n.substring(r, e)}<mark>${n.substring(e, t)}</mark>${n.substring(t, o + 1)} &#8230;`;
 }
-class Nx {
+class Ox {
   constructor(e, t) {
     this.editor = e.tiptap, this.schemaDef = t, this.panel = e.querySelector(".attribute-panel"), this.currentElement = null, this.currentMark = null, this.setupEventListeners(), this.overlay = document.createElement("div"), this.overlay.className = "jinn-tap overlay", this.overlay.style.display = "block", this.overlay.style.position = "fixed", this.overlay.style.pointerEvents = "none", this.overlay.style.zIndex = "1000", this.overlay.style.display = "none";
   }
@@ -21723,7 +21701,7 @@ class Nx {
   }
   createAttributeInput(e, t, i, r, s = "") {
     const o = document.createElement("label");
-    o.textContent = t;
+    o.textContent = t, e.appendChild(o);
     let a;
     if (i.enum)
       if (i.open) {
@@ -21740,7 +21718,7 @@ class Nx {
         });
     else
       a = document.createElement("input"), a.type = "text";
-    return a.placeholder = s, a.value = r || i.default || "", a.name = t, o.appendChild(a), e.appendChild(o), a;
+    return a.placeholder = s, a.value = r || i.default || "", a.name = t, e.appendChild(a), a;
   }
   updatePanel(e, t) {
     if (!this.panel || (this.panel.innerHTML = "", !e))
@@ -21756,52 +21734,50 @@ class Nx {
     this.panel.appendChild(s);
     const o = document.createElement("form");
     this.panel.appendChild(o);
-    const a = { ...this.schemaDef.attributes, ...i.attributes };
-    if (Object.entries(a).forEach(([l, c]) => {
-      if (!l.startsWith("_"))
-        if (c.connector) {
-          const u = this.createAttributeInput(
-            o,
-            l,
-            c,
-            e.attrs[l],
-            "No reference assigned"
-          );
-          u.readOnly = !0;
-          const d = document.createElement("details");
-          d.open = !e.attrs[l];
-          const h = document.createElement("summary");
-          h.textContent = "Lookup", d.appendChild(h);
-          const p = document.createElement("pb-authority-lookup"), f = e.attrs[l] || e.attrs[l] === "";
-          p.setAttribute("type", c.connector.type), p.setAttribute("query", t), p.setAttribute("auto", f), p.setAttribute("no-occurrences", !0);
-          const m = document.createElement("pb-authority");
-          if (m.setAttribute("connector", c.connector.name), m.setAttribute("name", c.connector.type), c.connector.user && m.setAttribute("user", c.connector.user), p.appendChild(m), document.addEventListener("pb-authority-select", (g) => {
-            const b = `${c.connector.prefix}-${g.detail.properties.ref}`;
-            u.value = b, d.open = !1, this.handleAttributeUpdate(e, { [l]: b });
-          }), d.appendChild(p), o.appendChild(d), e.attrs[l]) {
-            const g = e.attrs[l].substring(e.attrs[l].indexOf("-") + 1);
-            p.lookup(c.connector.type, g, s).then((b) => {
-              const k = b.strings;
-              k.sort((S, z) => z.length - S.length), k.unshift(t), this.updateOccurrences(this.editor, e, k);
+    const a = document.createElement("fieldset");
+    o.appendChild(a);
+    const l = { ...this.schemaDef.attributes, ...i.attributes };
+    if (Object.entries(l).forEach(([c, u]) => {
+      if (!c.startsWith("_"))
+        if (u.connector) {
+          const d = document.createElement("label");
+          d.textContent = c;
+          const h = document.createElement("input");
+          h.type = "text", h.value = e.attrs[c], h.readOnly = !0, h.name = c, h.placeholder = "No reference assigned", o.appendChild(d), o.appendChild(h);
+          const p = document.createElement("details");
+          p.open = !e.attrs[c];
+          const f = document.createElement("summary");
+          f.textContent = "Lookup", p.appendChild(f);
+          const m = document.createElement("pb-authority-lookup"), g = e.attrs[c] || e.attrs[c] === "";
+          m.setAttribute("type", u.connector.type), m.setAttribute("query", t), m.setAttribute("auto", g), m.setAttribute("no-occurrences", !0);
+          const b = document.createElement("pb-authority");
+          if (b.setAttribute("connector", u.connector.name), b.setAttribute("name", u.connector.type), u.connector.user && b.setAttribute("user", u.connector.user), m.appendChild(b), document.addEventListener("pb-authority-select", (k) => {
+            const x = `${u.connector.prefix}-${k.detail.properties.ref}`;
+            h.value = x, p.open = !1, this.handleAttributeUpdate(e, { [c]: x });
+          }), p.appendChild(m), o.appendChild(p), e.attrs[c]) {
+            const k = e.attrs[c].substring(e.attrs[c].indexOf("-") + 1);
+            m.lookup(u.connector.type, k, s).then((x) => {
+              const z = x.strings;
+              z.sort((I, C) => C.length - I.length), z.unshift(t), this.updateOccurrences(this.editor, e, z);
             });
           }
         } else
           this.createAttributeInput(
-            o,
-            l,
+            a,
             c,
-            e.attrs[l]
+            u,
+            e.attrs[c]
           );
-    }), Object.keys(a).length > 0 && !(Object.keys(a).length === 1 && a[Object.keys(a)[0]].connector)) {
-      const l = document.createElement("button");
-      l.dataset.tooltip = "Apply Changes", l.type = "submit", l.innerHTML = `
+    }), Object.keys(l).length > 0 && !(Object.keys(l).length === 1 && l[Object.keys(l)[0]].connector)) {
+      const c = document.createElement("button");
+      c.dataset.tooltip = "Apply Changes", c.type = "submit", c.innerHTML = `
                 <svg xmlns="http://www.w3.org/2000/svg" width="32" height="32" fill="currentColor" class="bi bi-check2-circle" viewBox="0 0 16 16">
                     <path d="M2.5 8a5.5 5.5 0 0 1 8.25-4.764.5.5 0 0 0 .5-.866A6.5 6.5 0 1 0 14.5 8a.5.5 0 0 0-1 0 5.5 5.5 0 1 1-11 0"/>
                     <path d="M15.354 3.354a.5.5 0 0 0-.708-.708L8 9.293 5.354 6.646a.5.5 0 1 0-.708.708l3 3a.5.5 0 0 0 .708 0z"/>
                 </svg>
-                Apply`, l.addEventListener("click", (c) => {
-        c.preventDefault(), this.handleAttributeUpdate(e);
-      }), this.panel.appendChild(l);
+                Apply`, c.addEventListener("click", (u) => {
+        u.preventDefault(), this.handleAttributeUpdate(e);
+      }), this.panel.appendChild(c);
     }
   }
   handleAttributeUpdate(e, t = {}) {
@@ -21842,35 +21818,35 @@ class Nx {
       for (const d of u) {
         const h = e.state.doc.resolve(d.pos);
         let p = h.node(), f = null;
-        p.isText || e.state.doc.nodesBetween(d.pos, d.pos + d.length, (M, L) => {
-          if (M.isText)
-            return f = M, !1;
+        p.isText || e.state.doc.nodesBetween(d.pos, d.pos + d.length, (C, L) => {
+          if (C.isText)
+            return f = C, !1;
         });
-        const m = f && f.marks.find((M) => t.eq(M)), g = document.createElement("li"), b = document.createElement("label"), k = document.createElement("input");
+        const m = f && f.marks.find((C) => t.eq(C)), g = document.createElement("li"), b = document.createElement("label"), k = document.createElement("input");
         k.type = "checkbox", k.checked = m, b.appendChild(k), a.push({
           checkbox: k,
           from: d.pos + d.index,
           to: d.pos + d.index + d.length,
           hasMark: m
         });
-        const S = e.state.doc.textBetween(d.pos, h.end()), z = Dx(S, d.index, d.index + d.length), I = document.createElement("span");
-        I.innerHTML = z, b.appendChild(I), g.appendChild(b), o.appendChild(g), b.addEventListener("mouseenter", (M) => {
-          M.preventDefault(), M.stopPropagation();
+        const x = e.state.doc.textBetween(d.pos, h.end()), z = Tx(x, d.index, d.index + d.length), I = document.createElement("span");
+        I.innerHTML = z, b.appendChild(I), g.appendChild(b), o.appendChild(g), b.addEventListener("mouseenter", (C) => {
+          C.preventDefault(), C.stopPropagation();
           const L = e.view.nodeDOM(d.pos);
           if (L) {
             (L.nodeType === window.Node.TEXT_NODE ? L.parentNode : L).scrollIntoView({ behavior: "instant", block: "center" });
-            let T;
+            let A;
             if (L.nodeType === window.Node.TEXT_NODE) {
               const Se = document.createRange();
-              Se.setStart(L, d.index), Se.setEnd(L, d.index + d.length), T = Se.getBoundingClientRect();
+              Se.setStart(L, d.index), Se.setEnd(L, d.index + d.length), A = Se.getBoundingClientRect();
             } else
-              T = L.getBoundingClientRect();
-            this.overlay.style.display = "block", this.overlay.style.top = T.top - 4 + "px", this.overlay.style.left = T.left - 4 + "px", this.overlay.style.width = T.width + 4 + "px", this.overlay.style.height = T.height + 4 + "px", document.body.appendChild(this.overlay);
+              A = L.getBoundingClientRect();
+            this.overlay.style.display = "block", this.overlay.style.top = A.top - 4 + "px", this.overlay.style.left = A.left - 4 + "px", this.overlay.style.width = A.width + 4 + "px", this.overlay.style.height = A.height + 4 + "px", document.body.appendChild(this.overlay);
           }
-        }), b.addEventListener("mouseleave", (M) => {
-          M.preventDefault(), M.stopPropagation(), this.overlay.style.display = "none";
-        }), k.addEventListener("change", (M) => {
-          M.preventDefault(), M.stopPropagation(), this.editor.chain().focus().setTextSelection({ from: d.pos + d.index, to: d.pos + d.index + d.length }).toggleMark(t.type, t.attrs).run();
+        }), b.addEventListener("mouseleave", (C) => {
+          C.preventDefault(), C.stopPropagation(), this.overlay.style.display = "none";
+        }), k.addEventListener("change", (C) => {
+          C.preventDefault(), C.stopPropagation(), this.editor.chain().focus().setTextSelection({ from: d.pos + d.index, to: d.pos + d.index + d.length }).toggleMark(t.type, t.attrs).run();
         });
       }
     s.querySelector(".apply-all").addEventListener("click", (c) => {
@@ -21885,7 +21861,7 @@ class Nx {
     });
   }
 }
-class Ix {
+class Dx {
   constructor(e, t) {
     this.editor = e.tiptap, this.attributePanel = t, this.panel = e.querySelector(".navigation-panel"), this.setupEventListeners();
   }
@@ -21930,7 +21906,7 @@ class Ix {
     }), this.panel.appendChild(l);
   }
 }
-class zx {
+class Nx {
   /**
    * Create a new Toolbar instance.
    * 
@@ -22068,7 +22044,7 @@ class zx {
     }), e.querySelector("ul").appendChild(o);
   }
 }
-const Px = (n) => {
+const Ix = (n) => {
   let e = parseInt(n.substring(1, 3), 16) / 255, t = parseInt(n.substring(3, 5), 16) / 255, i = parseInt(n.substring(5, 7), 16) / 255, r = Math.max(e, t, i), s = Math.min(e, t, i), o, a, l = (r + s) / 2;
   if (r === s)
     o = a = 0;
@@ -22088,7 +22064,7 @@ const Px = (n) => {
     o /= 6;
   }
   return [o * 360, a * 100, l * 100];
-}, Rx = (n, e, t) => {
+}, zx = (n, e, t) => {
   t /= 100;
   const i = e * Math.min(t, 1 - t) / 100, r = (s) => {
     const o = (s + n / 30) % 12, a = t - i * Math.max(Math.min(o - 3, 9 - o, 1), -1);
@@ -22096,9 +22072,31 @@ const Px = (n) => {
   };
   return `#${r(0)}${r(8)}${r(4)}`;
 };
-function _x() {
-  const n = "#E48500", [e, t, i] = Px(n), r = (e + Math.random() * 360) % 360;
-  return Rx(r, t, i);
+function Px() {
+  const n = "#E48500", [e, t, i] = Ix(n), r = (e + Math.random() * 360) % 360;
+  return zx(r, t, i);
+}
+function Rx(n) {
+  if (!n) return "";
+  const e = [], t = n.querySelectorAll("text > body > *"), i = (r) => {
+    if (r.nodeType === Node.ELEMENT_NODE) {
+      const s = document.createElement(`tei-${r.tagName}`);
+      for (const o of r.attributes)
+        o.name === "xml:id" ? s.setAttribute("id", o.value) : s.setAttribute(o.name, o.value);
+      for (const o of r.childNodes)
+        s.appendChild(i(o));
+      return s;
+    } else
+      return r.cloneNode();
+  };
+  return t.forEach((r) => {
+    const s = i(r);
+    e.push(s.outerHTML);
+  }), e.join("");
+}
+function _x(n) {
+  const e = Ax(n);
+  return e.documentElement.namespaceURI === "http://www.tei-c.org/ns/1.0" ? Rx(e) : xml;
 }
 var Rh = {}, Kt = {}, ka = {};
 Object.defineProperty(ka, "__esModule", { value: !0 });
@@ -38806,7 +38804,7 @@ class Ux extends HTMLElement {
       let s;
       if (r != null && r.includes("application/xml") || r != null && r.includes("text/xml")) {
         const o = await i.text();
-        s = Ox(o);
+        s = _x(o);
       } else if (r != null && r.includes("text/html"))
         s = await i.text();
       else
@@ -38888,9 +38886,9 @@ class Ux extends HTMLElement {
       provider: this.provider,
       user: {
         name: this.collabUser,
-        color: _x()
+        color: Px()
       }
-    }))) : s.extensions.push(qb), this.editor = new Nb(s), this.attributePanel = new Nx(this, this._schema), this.navigationPanel = new Ix(this, this.attributePanel), this.toolbar = new zx(this, this._schema), this.collabEnabled || (this.content = t);
+    }))) : s.extensions.push(qb), this.editor = new Nb(s), this.attributePanel = new Ox(this, this._schema), this.navigationPanel = new Dx(this, this.attributePanel), this.toolbar = new Nx(this, this._schema), this.collabEnabled || (this.content = t);
   }
   dispatchContentChange() {
     this.dispatchEvent(new CustomEvent("content-change", {