@jinntec/jinntap 1.1.1 → 1.1.3

package/dist/jinn-tap.es.js

@@ -1,8 +1,8 @@
-function V(r) {
+function $(r) {
   this.content = r;
 }
-V.prototype = {
-  constructor: V,
+$.prototype = {
+  constructor: $,
   find: function(r) {
     for (var e = 0; e < this.content.length; e += 2)
       if (this.content[e] === r) return e;
@@ -21,7 +21,7 @@ V.prototype = {
   // given, the key of the binding will be replaced with that key.
   update: function(r, e, t) {
     var n = t && t != r ? this.remove(t) : this, i = n.find(r), s = n.content.slice();
-    return i == -1 ? s.push(t || r, e) : (s[i + 1] = e, t && (s[i] = t)), new V(s);
+    return i == -1 ? s.push(t || r, e) : (s[i + 1] = e, t && (s[i] = t)), new $(s);
   },
   // :: (string) → OrderedMap
   // Return a map with the given key removed, if it existed.
@@ -29,25 +29,25 @@ V.prototype = {
     var e = this.find(r);
     if (e == -1) return this;
     var t = this.content.slice();
-    return t.splice(e, 2), new V(t);
+    return t.splice(e, 2), new $(t);
   },
   // :: (string, any) → OrderedMap
   // Add a new key to the start of the map.
   addToStart: function(r, e) {
-    return new V([r, e].concat(this.remove(r).content));
+    return new $([r, e].concat(this.remove(r).content));
   },
   // :: (string, any) → OrderedMap
   // Add a new key to the end of the map.
   addToEnd: function(r, e) {
     var t = this.remove(r).content.slice();
-    return t.push(r, e), new V(t);
+    return t.push(r, e), new $(t);
   },
   // :: (string, string, any) → OrderedMap
   // Add a key after the given key. If `place` is not found, the new
   // key is added to the end.
   addBefore: function(r, e, t) {
     var n = this.remove(e), i = n.content.slice(), s = n.find(r);
-    return i.splice(s == -1 ? i.length : s, 0, e, t), new V(i);
+    return i.splice(s == -1 ? i.length : s, 0, e, t), new $(i);
   },
   // :: ((key: string, value: any))
   // Call the given function for each key/value pair in the map, in
@@ -60,20 +60,20 @@ V.prototype = {
   // Create a new map by prepending the keys in this map that don't
   // appear in `map` before the keys in `map`.
   prepend: function(r) {
-    return r = V.from(r), r.size ? new V(r.content.concat(this.subtract(r).content)) : this;
+    return r = $.from(r), r.size ? new $(r.content.concat(this.subtract(r).content)) : this;
   },
   // :: (union<Object, OrderedMap>) → OrderedMap
   // Create a new map by appending the keys in this map that don't
   // appear in `map` after the keys in `map`.
   append: function(r) {
-    return r = V.from(r), r.size ? new V(this.subtract(r).content.concat(r.content)) : this;
+    return r = $.from(r), r.size ? new $(this.subtract(r).content.concat(r.content)) : this;
   },
   // :: (union<Object, OrderedMap>) → OrderedMap
   // Create a map containing all the keys in this map that don't
   // appear in `map`.
   subtract: function(r) {
     var e = this;
-    r = V.from(r);
+    r = $.from(r);
     for (var t = 0; t < r.content.length; t += 2)
       e = e.remove(r.content[t]);
     return e;
@@ -92,11 +92,11 @@ V.prototype = {
     return this.content.length >> 1;
   }
 };
-V.from = function(r) {
-  if (r instanceof V) return r;
+$.from = function(r) {
+  if (r instanceof $) return r;
   var e = [];
   if (r) for (var t in r) e.push(t, r[t]);
-  return new V(e);
+  return new $(e);
 };
 function Vi(r, e, t) {
   for (let n = 0; ; n++) {
@@ -2050,7 +2050,7 @@ class ts {
     let t = this.spec = {};
     for (let i in e)
       t[i] = e[i];
-    t.nodes = V.from(e.nodes), t.marks = V.from(e.marks || {}), this.nodes = vr.compile(this.spec.nodes, this), this.marks = en.compile(this.spec.marks, this);
+    t.nodes = $.from(e.nodes), t.marks = $.from(e.marks || {}), this.nodes = vr.compile(this.spec.nodes, this), this.marks = en.compile(this.spec.marks, this);
     let n = /* @__PURE__ */ Object.create(null);
     for (let i in this.nodes) {
       if (i in this.marks)
@@ -3109,7 +3109,7 @@ class q {
     return yn[e] = t, t.prototype.jsonID = e, t;
   }
 }
-class B {
+class R {
   /**
   @internal
   */
@@ -3120,13 +3120,13 @@ class B {
   Create a successful step result.
   */
   static ok(e) {
-    return new B(e, null);
+    return new R(e, null);
   }
   /**
   Create a failed step result.
   */
   static fail(e) {
-    return new B(null, e);
+    return new R(null, e);
   }
   /**
   Call [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) with the given
@@ -3135,10 +3135,10 @@ class B {
   */
   static fromReplace(e, t, n, i) {
     try {
-      return B.ok(e.replace(t, n, i));
+      return R.ok(e.replace(t, n, i));
     } catch (s) {
       if (s instanceof jt)
-        return B.fail(s.message);
+        return R.fail(s.message);
       throw s;
     }
   }
@@ -3160,10 +3160,10 @@ class Se extends q {
   }
   apply(e) {
     let t = e.slice(this.from, this.to), n = e.resolve(this.from), i = n.node(n.sharedDepth(this.to)), s = new k(ir(t.content, (o, l) => !o.isAtom || !l.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), i), t.openStart, t.openEnd);
-    return B.fromReplace(e, this.from, this.to, s);
+    return R.fromReplace(e, this.from, this.to, s);
   }
   invert() {
-    return new ae(this.from, this.to, this.mark);
+    return new ce(this.from, this.to, this.mark);
   }
   map(e) {
     let t = e.mapResult(this.from, 1), n = e.mapResult(this.to, -1);
@@ -3190,7 +3190,7 @@ class Se extends q {
   }
 }
 q.jsonID("addMark", Se);
-class ae extends q {
+class ce extends q {
   /**
   Create a mark-removing step.
   */
@@ -3199,17 +3199,17 @@ class ae extends q {
   }
   apply(e) {
     let t = e.slice(this.from, this.to), n = new k(ir(t.content, (i) => i.mark(this.mark.removeFromSet(i.marks)), e), t.openStart, t.openEnd);
-    return B.fromReplace(e, this.from, this.to, n);
+    return R.fromReplace(e, this.from, this.to, n);
   }
   invert() {
     return new Se(this.from, this.to, this.mark);
   }
   map(e) {
     let t = e.mapResult(this.from, 1), n = e.mapResult(this.to, -1);
-    return t.deleted && n.deleted || t.pos >= n.pos ? null : new ae(t.pos, n.pos, this.mark);
+    return t.deleted && n.deleted || t.pos >= n.pos ? null : new ce(t.pos, n.pos, this.mark);
   }
   merge(e) {
-    return e instanceof ae && e.mark.eq(this.mark) && this.from <= e.to && this.to >= e.from ? new ae(Math.min(this.from, e.from), Math.max(this.to, e.to), this.mark) : null;
+    return e instanceof ce && e.mark.eq(this.mark) && this.from <= e.to && this.to >= e.from ? new ce(Math.min(this.from, e.from), Math.max(this.to, e.to), this.mark) : null;
   }
   toJSON() {
     return {
@@ -3225,10 +3225,10 @@ class ae extends q {
   static fromJSON(e, t) {
     if (typeof t.from != "number" || typeof t.to != "number")
       throw new RangeError("Invalid input for RemoveMarkStep.fromJSON");
-    return new ae(t.from, t.to, e.markFromJSON(t.mark));
+    return new ce(t.from, t.to, e.markFromJSON(t.mark));
   }
 }
-q.jsonID("removeMark", ae);
+q.jsonID("removeMark", ce);
 class Ce extends q {
   /**
   Create a node mark step.
@@ -3239,9 +3239,9 @@ class Ce extends q {
   apply(e) {
     let t = e.nodeAt(this.pos);
     if (!t)
-      return B.fail("No node at mark step's position");
+      return R.fail("No node at mark step's position");
     let n = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
-    return B.fromReplace(e, this.pos, this.pos + 1, new k(b.from(n), 0, t.isLeaf ? 0 : 1));
+    return R.fromReplace(e, this.pos, this.pos + 1, new k(b.from(n), 0, t.isLeaf ? 0 : 1));
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
@@ -3283,9 +3283,9 @@ class et extends q {
   apply(e) {
     let t = e.nodeAt(this.pos);
     if (!t)
-      return B.fail("No node at mark step's position");
+      return R.fail("No node at mark step's position");
     let n = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
-    return B.fromReplace(e, this.pos, this.pos + 1, new k(b.from(n), 0, t.isLeaf ? 0 : 1));
+    return R.fromReplace(e, this.pos, this.pos + 1, new k(b.from(n), 0, t.isLeaf ? 0 : 1));
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
@@ -3308,7 +3308,7 @@ class et extends q {
   }
 }
 q.jsonID("removeNodeMark", et);
-class R extends q {
+class P extends q {
   /**
   The given `slice` should fit the 'gap' between `from` and
   `to`—the depths must line up, and the surrounding nodes must be
@@ -3322,27 +3322,27 @@ class R extends q {
     super(), this.from = e, this.to = t, this.slice = n, this.structure = i;
   }
   apply(e) {
-    return this.structure && jn(e, this.from, this.to) ? B.fail("Structure replace would overwrite content") : B.fromReplace(e, this.from, this.to, this.slice);
+    return this.structure && jn(e, this.from, this.to) ? R.fail("Structure replace would overwrite content") : R.fromReplace(e, this.from, this.to, this.slice);
   }
   getMap() {
     return new X([this.from, this.to - this.from, this.slice.size]);
   }
   invert(e) {
-    return new R(this.from, this.from + this.slice.size, e.slice(this.from, this.to));
+    return new P(this.from, this.from + this.slice.size, e.slice(this.from, this.to));
   }
   map(e) {
     let t = e.mapResult(this.from, 1), n = e.mapResult(this.to, -1);
-    return t.deletedAcross && n.deletedAcross ? null : new R(t.pos, Math.max(t.pos, n.pos), this.slice);
+    return t.deletedAcross && n.deletedAcross ? null : new P(t.pos, Math.max(t.pos, n.pos), this.slice);
   }
   merge(e) {
-    if (!(e instanceof R) || e.structure || this.structure)
+    if (!(e instanceof P) || e.structure || this.structure)
       return null;
     if (this.from + this.slice.size == e.from && !this.slice.openEnd && !e.slice.openStart) {
       let t = this.slice.size + e.slice.size == 0 ? k.empty : new k(this.slice.content.append(e.slice.content), this.slice.openStart, e.slice.openEnd);
-      return new R(this.from, this.to + (e.to - e.from), t, this.structure);
+      return new P(this.from, this.to + (e.to - e.from), t, this.structure);
     } else if (e.to == this.from && !this.slice.openStart && !e.slice.openEnd) {
       let t = this.slice.size + e.slice.size == 0 ? k.empty : new k(e.slice.content.append(this.slice.content), e.slice.openStart, this.slice.openEnd);
-      return new R(e.from, this.to, t, this.structure);
+      return new P(e.from, this.to, t, this.structure);
     } else
       return null;
   }
@@ -3356,11 +3356,11 @@ class R extends q {
   static fromJSON(e, t) {
     if (typeof t.from != "number" || typeof t.to != "number")
       throw new RangeError("Invalid input for ReplaceStep.fromJSON");
-    return new R(t.from, t.to, k.fromJSON(e, t.slice), !!t.structure);
+    return new P(t.from, t.to, k.fromJSON(e, t.slice), !!t.structure);
   }
 }
-q.jsonID("replace", R);
-class F extends q {
+q.jsonID("replace", P);
+class z extends q {
   /**
   Create a replace-around step with the given range and gap.
   `insert` should be the point in the slice into which the content
@@ -3372,12 +3372,12 @@ class F extends q {
   }
   apply(e) {
     if (this.structure && (jn(e, this.from, this.gapFrom) || jn(e, this.gapTo, this.to)))
-      return B.fail("Structure gap-replace would overwrite content");
+      return R.fail("Structure gap-replace would overwrite content");
     let t = e.slice(this.gapFrom, this.gapTo);
     if (t.openStart || t.openEnd)
-      return B.fail("Gap is not a flat range");
+      return R.fail("Gap is not a flat range");
     let n = this.slice.insertAt(this.insert, t.content);
-    return n ? B.fromReplace(e, this.from, this.to, n) : B.fail("Content does not fit in gap");
+    return n ? R.fromReplace(e, this.from, this.to, n) : R.fail("Content does not fit in gap");
   }
   getMap() {
     return new X([
@@ -3391,11 +3391,11 @@ class F extends q {
   }
   invert(e) {
     let t = this.gapTo - this.gapFrom;
-    return new F(this.from, this.from + this.slice.size + t, this.from + this.insert, this.from + this.insert + t, e.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);
+    return new z(this.from, this.from + this.slice.size + t, this.from + this.insert, this.from + this.insert + t, e.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);
   }
   map(e) {
     let t = e.mapResult(this.from, 1), n = e.mapResult(this.to, -1), i = this.from == this.gapFrom ? t.pos : e.map(this.gapFrom, -1), s = this.to == this.gapTo ? n.pos : e.map(this.gapTo, 1);
-    return t.deletedAcross && n.deletedAcross || i < t.pos || s > n.pos ? null : new F(t.pos, n.pos, i, s, this.slice, this.insert, this.structure);
+    return t.deletedAcross && n.deletedAcross || i < t.pos || s > n.pos ? null : new z(t.pos, n.pos, i, s, this.slice, this.insert, this.structure);
   }
   toJSON() {
     let e = {
@@ -3414,10 +3414,10 @@ class F extends q {
   static fromJSON(e, t) {
     if (typeof t.from != "number" || typeof t.to != "number" || typeof t.gapFrom != "number" || typeof t.gapTo != "number" || typeof t.insert != "number")
       throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON");
-    return new F(t.from, t.to, t.gapFrom, t.gapTo, k.fromJSON(e, t.slice), t.insert, !!t.structure);
+    return new z(t.from, t.to, t.gapFrom, t.gapTo, k.fromJSON(e, t.slice), t.insert, !!t.structure);
   }
 }
-q.jsonID("replaceAround", F);
+q.jsonID("replaceAround", z);
 function jn(r, e, t) {
   let n = r.resolve(e), i = t - e, s = n.depth;
   for (; i > 0 && s > 0 && n.indexAfter(s) == n.node(s).childCount; )
@@ -3441,7 +3441,7 @@ function tl(r, e, t, n) {
     if (!n.isInSet(d) && u.type.allowsMarkType(n.type)) {
       let h = Math.max(c, e), f = Math.min(c + a.nodeSize, t), p = n.addToSet(d);
       for (let m = 0; m < d.length; m++)
-        d[m].isInSet(p) || (o && o.to == h && o.mark.eq(d[m]) ? o.to = f : i.push(o = new ae(h, f, d[m])));
+        d[m].isInSet(p) || (o && o.to == h && o.mark.eq(d[m]) ? o.to = f : i.push(o = new ce(h, f, d[m])));
       l && l.to == h ? l.to = f : s.push(l = new Se(h, f, n));
     }
   }), i.forEach((a) => r.step(a)), s.forEach((a) => r.step(a));
@@ -3469,22 +3469,22 @@ function nl(r, e, t, n) {
         h ? (h.to = c, h.step = s) : i.push({ style: d, from: Math.max(l, e), to: c, step: s });
       }
     }
-  }), i.forEach((o) => r.step(new ae(o.from, o.to, o.style)));
+  }), i.forEach((o) => r.step(new ce(o.from, o.to, o.style)));
 }
 function sr(r, e, t, n = t.contentMatch, i = !0) {
   let s = r.doc.nodeAt(e), o = [], l = e + 1;
   for (let a = 0; a < s.childCount; a++) {
     let c = s.child(a), u = l + c.nodeSize, d = n.matchType(c.type);
     if (!d)
-      o.push(new R(l, u, k.empty));
+      o.push(new P(l, u, k.empty));
     else {
       n = d;
       for (let h = 0; h < c.marks.length; h++)
-        t.allowsMarkType(c.marks[h].type) || r.step(new ae(l, u, c.marks[h]));
+        t.allowsMarkType(c.marks[h].type) || r.step(new ce(l, u, c.marks[h]));
       if (i && c.isText && t.whitespace != "pre") {
         let h, f = /\r?\n|\r/g, p;
         for (; h = f.exec(c.text); )
-          p || (p = new k(b.from(t.schema.text(" ", t.allowedMarks(c.marks))), 0, 0)), o.push(new R(l + h.index, l + h.index + h[0].length, p));
+          p || (p = new k(b.from(t.schema.text(" ", t.allowedMarks(c.marks))), 0, 0)), o.push(new P(l + h.index, l + h.index + h[0].length, p));
       }
     }
     l = u;
@@ -3517,7 +3517,7 @@ function il(r, e, t) {
   let h = b.empty, f = 0;
   for (let p = s, m = !1; p > t; p--)
     m || i.after(p + 1) < i.end(p) ? (m = !0, h = b.from(i.node(p).copy(h)), f++) : c++;
-  r.step(new F(a, c, o, l, new k(u.append(h), d, f), u.size - d, !0));
+  r.step(new z(a, c, o, l, new k(u.append(h), d, f), u.size - d, !0));
 }
 function us(r, e, t = null, n = r) {
   let i = sl(r, e), s = i && ol(n, e);
@@ -3553,7 +3553,7 @@ function ll(r, e, t) {
     n = b.from(t[o].type.create(t[o].attrs, n));
   }
   let i = e.start, s = e.end;
-  r.step(new F(i, s, i, s, new k(n, 0, 0), t.length, !0));
+  r.step(new z(i, s, i, s, new k(n, 0, 0), t.length, !0));
 }
 function al(r, e, t, n, i) {
   if (!n.isTextblock)
@@ -3569,7 +3569,7 @@ function al(r, e, t, n, i) {
       }
       c === !1 && hs(r, o, l, s), sr(r, r.mapping.slice(s).map(l, 1), n, void 0, c === null);
       let u = r.mapping.slice(s), d = u.map(l, 1), h = u.map(l + o.nodeSize, 1);
-      return r.step(new F(d, h, d + 1, h - 1, new k(b.from(n.create(a, null, o.marks)), 0, 0), 1, !0)), c === !0 && ds(r, o, l, s), !1;
+      return r.step(new z(d, h, d + 1, h - 1, new k(b.from(n.create(a, null, o.marks)), 0, 0), 1, !0)), c === !0 && ds(r, o, l, s), !1;
     }
   });
 }
@@ -3607,9 +3607,9 @@ function ul(r, e, t, n, i) {
     return r.replaceWith(e, e + s.nodeSize, o);
   if (!t.validContent(s.content))
     throw new RangeError("Invalid content for node type " + t.name);
-  r.step(new F(e, e + s.nodeSize, e + 1, e + s.nodeSize - 1, new k(b.from(o), 0, 0), 1, !0));
+  r.step(new z(e, e + s.nodeSize, e + 1, e + s.nodeSize - 1, new k(b.from(o), 0, 0), 1, !0));
 }
-function pe(r, e, t = 1, n) {
+function me(r, e, t = 1, n) {
   let i = r.resolve(e), s = i.depth - t, o = n && n[n.length - 1] || i.parent;
   if (s < 0 || i.parent.type.spec.isolating || !i.parent.canReplace(i.index(), i.parent.childCount) || !o.type.validContent(i.parent.content.cutByIndex(i.index(), i.parent.childCount)))
     return !1;
@@ -3633,7 +3633,7 @@ function dl(r, e, t = 1, n) {
     let u = n && n[c];
     o = b.from(u ? u.type.create(u.attrs, o) : i.node(l).copy(o));
   }
-  r.step(new R(e, e, new k(s.append(o), t, t), !0));
+  r.step(new P(e, e, new k(s.append(o), t, t), !0));
 }
 function qe(r, e) {
   let t = r.resolve(e), n = t.index();
@@ -3676,7 +3676,7 @@ function fl(r, e, t) {
   }
   o.inlineContent && sr(r, e + t - 1, o, s.node().contentMatchAt(s.index()), n == null);
   let a = r.mapping.slice(l), c = a.map(e - t);
-  if (r.step(new R(c, a.map(e + t, -1), k.empty, !0)), n === !0) {
+  if (r.step(new P(c, a.map(e + t, -1), k.empty, !0)), n === !0) {
     let u = r.doc.resolve(c);
     ds(r, u.node(), u.before(), r.steps.length);
   }
@@ -3729,7 +3729,7 @@ function nn(r, e, t = e, n = k.empty) {
   if (e == t && !n.size)
     return null;
   let i = r.resolve(e), s = r.resolve(t);
-  return ps(i, s, n) ? new R(e, t, n) : new gl(i, s, n).fit();
+  return ps(i, s, n) ? new P(e, t, n) : new gl(i, s, n).fit();
 }
 function ps(r, e, t) {
   return !t.openStart && !t.openEnd && r.start() == e.start() && r.parent.canReplace(r.index(), e.index(), t.content);
@@ -3762,7 +3762,7 @@ class gl {
     for (; o && l && s.childCount == 1; )
       s = s.firstChild.content, o--, l--;
     let a = new k(s, o, l);
-    return e > -1 ? new F(n.pos, e, this.$to.pos, this.$to.end(), a, t) : a.size || n.pos != this.$to.pos ? new R(n.pos, i.pos, a) : null;
+    return e > -1 ? new z(n.pos, e, this.$to.pos, this.$to.end(), a, t) : a.size || n.pos != this.$to.pos ? new P(n.pos, i.pos, a) : null;
   }
   // Find a position on the start spine of `this.unplaced` that has
   // content that can be moved somewhere on the frontier. Returns two
@@ -3919,7 +3919,7 @@ function kl(r, e, t, n) {
     return r.deleteRange(e, t);
   let i = r.doc.resolve(e), s = r.doc.resolve(t);
   if (ps(i, s, n))
-    return r.step(new R(e, t, n));
+    return r.step(new P(e, t, n));
   let o = ys(i, r.doc.resolve(t));
   o[o.length - 1] == 0 && o.pop();
   let l = -(i.depth + 1);
@@ -4013,13 +4013,13 @@ class Ze extends q {
   apply(e) {
     let t = e.nodeAt(this.pos);
     if (!t)
-      return B.fail("No node at attribute step's position");
+      return R.fail("No node at attribute step's position");
     let n = /* @__PURE__ */ Object.create(null);
     for (let s in t.attrs)
       n[s] = t.attrs[s];
     n[this.attr] = this.value;
     let i = t.type.create(n, null, t.marks);
-    return B.fromReplace(e, this.pos, this.pos + 1, new k(b.from(i), 0, t.isLeaf ? 0 : 1));
+    return R.fromReplace(e, this.pos, this.pos + 1, new k(b.from(i), 0, t.isLeaf ? 0 : 1));
   }
   getMap() {
     return X.empty;
@@ -4054,7 +4054,7 @@ class yt extends q {
       t[i] = e.attrs[i];
     t[this.attr] = this.value;
     let n = e.type.create(t, e.content, e.marks);
-    return B.ok(n);
+    return R.ok(n);
   }
   getMap() {
     return X.empty;
@@ -4399,7 +4399,7 @@ class O {
   found.
   */
   static findFrom(e, t, n = !1) {
-    let i = e.parent.inlineContent ? new E(e) : _e(e.node(0), e.parent, e.pos, e.index(), t, n);
+    let i = e.parent.inlineContent ? new T(e) : _e(e.node(0), e.parent, e.pos, e.index(), t, n);
     if (i)
       return i;
     for (let s = e.depth - 1; s >= 0; s--) {
@@ -4466,7 +4466,7 @@ class O {
   returns the bookmark for that.
   */
   getBookmark() {
-    return E.between(this.$anchor, this.$head).getBookmark();
+    return T.between(this.$anchor, this.$head).getBookmark();
   }
 }
 O.prototype.visible = !0;
@@ -4482,7 +4482,7 @@ let Vr = !1;
 function jr(r) {
   !Vr && !r.parent.inlineContent && (Vr = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + r.parent.type.name + ")"));
 }
-class E extends O {
+class T extends O {
   /**
   Construct a text selection between the given points.
   */
@@ -4501,7 +4501,7 @@ class E extends O {
     if (!n.parent.inlineContent)
       return O.near(n);
     let i = e.resolve(t.map(this.anchor));
-    return new E(i.parent.inlineContent ? i : n, n);
+    return new T(i.parent.inlineContent ? i : n, n);
   }
   replace(e, t = k.empty) {
     if (super.replace(e, t), t == k.empty) {
@@ -4510,7 +4510,7 @@ class E extends O {
     }
   }
   eq(e) {
-    return e instanceof E && e.anchor == this.anchor && e.head == this.head;
+    return e instanceof T && e.anchor == this.anchor && e.head == this.head;
   }
   getBookmark() {
     return new rn(this.anchor, this.head);
@@ -4524,7 +4524,7 @@ class E extends O {
   static fromJSON(e, t) {
     if (typeof t.anchor != "number" || typeof t.head != "number")
       throw new RangeError("Invalid input for TextSelection.fromJSON");
-    return new E(e.resolve(t.anchor), e.resolve(t.head));
+    return new T(e.resolve(t.anchor), e.resolve(t.head));
   }
   /**
   Create a text selection from non-resolved positions.
@@ -4550,10 +4550,10 @@ class E extends O {
       else
         return O.near(t, n);
     }
-    return e.parent.inlineContent || (i == 0 ? e = t : (e = (O.findFrom(e, -n, !0) || O.findFrom(e, n, !0)).$anchor, e.pos < t.pos != i < 0 && (e = t))), new E(e, t);
+    return e.parent.inlineContent || (i == 0 ? e = t : (e = (O.findFrom(e, -n, !0) || O.findFrom(e, n, !0)).$anchor, e.pos < t.pos != i < 0 && (e = t))), new T(e, t);
   }
 }
-O.jsonID("text", E);
+O.jsonID("text", T);
 class rn {
   constructor(e, t) {
     this.anchor = e, this.head = t;
@@ -4562,7 +4562,7 @@ class rn {
     return new rn(e.map(this.anchor), e.map(this.head));
   }
   resolve(e) {
-    return E.between(e.resolve(this.anchor), e.resolve(this.head));
+    return T.between(e.resolve(this.anchor), e.resolve(this.head));
   }
 }
 class C extends O {
@@ -4672,7 +4672,7 @@ const Ml = {
 };
 function _e(r, e, t, n, i, s = !1) {
   if (e.inlineContent)
-    return E.create(r, t);
+    return T.create(r, t);
   for (let o = n - (i > 0 ? 0 : 1); i > 0 ? o < e.childCount : o >= 0; o += i) {
     let l = e.child(o);
     if (l.isAtom) {
@@ -4692,7 +4692,7 @@ function Wr(r, e, t) {
   if (n < e)
     return;
   let i = r.steps[n];
-  if (!(i instanceof R || i instanceof F))
+  if (!(i instanceof P || i instanceof z))
     return;
   let s = r.mapping.maps[n], o;
   s.forEach((l, a, c, u) => {
@@ -5092,7 +5092,7 @@ const Cn = /* @__PURE__ */ Object.create(null);
 function ks(r) {
   return r in Cn ? r + "$" + ++Cn[r] : (Cn[r] = 0, r + "$");
 }
-class oe {
+class le {
   /**
   Create a plugin key.
   */
@@ -5113,7 +5113,7 @@ class oe {
     return e[this.key];
   }
 }
-const j = function(r) {
+const V = function(r) {
   for (var e = 0; ; e++)
     if (r = r.previousSibling, !r)
       return e;
@@ -5122,7 +5122,7 @@ const j = function(r) {
   return e && e.nodeType == 11 ? e.host : e;
 };
 let Wn = null;
-const he = function(r, e, t) {
+const fe = function(r, e, t) {
   let n = Wn || (Wn = document.createRange());
   return n.setEnd(r, t ?? r.nodeValue.length), n.setStart(r, e || 0), n;
 }, Ol = function() {
@@ -5134,20 +5134,20 @@ function Ur(r, e, t, n, i) {
   for (; ; ) {
     if (r == t && e == n)
       return !0;
-    if (e == (i < 0 ? 0 : te(r))) {
+    if (e == (i < 0 ? 0 : ne(r))) {
       let s = r.parentNode;
       if (!s || s.nodeType != 1 || Mt(r) || Nl.test(r.nodeName) || r.contentEditable == "false")
         return !1;
-      e = j(r) + (i < 0 ? 0 : 1), r = s;
+      e = V(r) + (i < 0 ? 0 : 1), r = s;
     } else if (r.nodeType == 1) {
       if (r = r.childNodes[e + (i < 0 ? -1 : 0)], r.contentEditable == "false")
         return !1;
-      e = i < 0 ? te(r) : 0;
+      e = i < 0 ? ne(r) : 0;
     } else
       return !1;
   }
 }
-function te(r) {
+function ne(r) {
   return r.nodeType == 3 ? r.nodeValue.length : r.childNodes.length;
 }
 function Al(r, e) {
@@ -5157,9 +5157,9 @@ function Al(r, e) {
     if (r.nodeType == 1 && e > 0) {
       if (r.contentEditable == "false")
         return null;
-      r = r.childNodes[e - 1], e = te(r);
+      r = r.childNodes[e - 1], e = ne(r);
     } else if (r.parentNode && !Mt(r))
-      e = j(r), r = r.parentNode;
+      e = V(r), r = r.parentNode;
     else
       return null;
   }
@@ -5173,19 +5173,19 @@ function vl(r, e) {
         return null;
       r = r.childNodes[e], e = 0;
     } else if (r.parentNode && !Mt(r))
-      e = j(r) + 1, r = r.parentNode;
+      e = V(r) + 1, r = r.parentNode;
     else
       return null;
   }
 }
 function Dl(r, e, t) {
-  for (let n = e == 0, i = e == te(r); n || i; ) {
+  for (let n = e == 0, i = e == ne(r); n || i; ) {
     if (r == t)
       return !0;
-    let s = j(r);
+    let s = V(r);
     if (r = r.parentNode, !r)
       return !1;
-    n = n && s == 0, i = i && s == te(r);
+    n = n && s == 0, i = i && s == ne(r);
   }
 }
 function Mt(r) {
@@ -5212,18 +5212,18 @@ function Pl(r, e, t) {
     try {
       let n = r.caretPositionFromPoint(e, t);
       if (n)
-        return { node: n.offsetNode, offset: Math.min(te(n.offsetNode), n.offset) };
+        return { node: n.offsetNode, offset: Math.min(ne(n.offsetNode), n.offset) };
     } catch {
     }
   if (r.caretRangeFromPoint) {
     let n = r.caretRangeFromPoint(e, t);
     if (n)
-      return { node: n.startContainer, offset: Math.min(te(n.startContainer), n.startOffset) };
+      return { node: n.startContainer, offset: Math.min(ne(n.startContainer), n.startOffset) };
   }
 }
-const ce = typeof navigator < "u" ? navigator : null, _r = typeof document < "u" ? document : null, Ae = ce && ce.userAgent || "", Hn = /Edge\/(\d+)/.exec(Ae), xs = /MSIE \d/.exec(Ae), Jn = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(Ae), G = !!(xs || Jn || Hn), Ee = xs ? document.documentMode : Jn ? +Jn[1] : Hn ? +Hn[1] : 0, se = !G && /gecko\/(\d+)/i.test(Ae);
-se && +(/Firefox\/(\d+)/.exec(Ae) || [0, 0])[1];
-const qn = !G && /Chrome\/(\d+)/.exec(Ae), J = !!qn, Ss = qn ? +qn[1] : 0, K = !G && !!ce && /Apple Computer/.test(ce.vendor), rt = K && (/Mobile\/\w+/.test(Ae) || !!ce && ce.maxTouchPoints > 2), ee = rt || (ce ? /Mac/.test(ce.platform) : !1), Rl = ce ? /Win/.test(ce.platform) : !1, fe = /Android \d/.test(Ae), Et = !!_r && "webkitFontSmoothing" in _r.documentElement.style, Bl = Et ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
+const ue = typeof navigator < "u" ? navigator : null, _r = typeof document < "u" ? document : null, Ae = ue && ue.userAgent || "", Hn = /Edge\/(\d+)/.exec(Ae), xs = /MSIE \d/.exec(Ae), Jn = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(Ae), G = !!(xs || Jn || Hn), Ee = xs ? document.documentMode : Jn ? +Jn[1] : Hn ? +Hn[1] : 0, oe = !G && /gecko\/(\d+)/i.test(Ae);
+oe && +(/Firefox\/(\d+)/.exec(Ae) || [0, 0])[1];
+const qn = !G && /Chrome\/(\d+)/.exec(Ae), J = !!qn, Ss = qn ? +qn[1] : 0, K = !G && !!ue && /Apple Computer/.test(ue.vendor), rt = K && (/Mobile\/\w+/.test(Ae) || !!ue && ue.maxTouchPoints > 2), te = rt || (ue ? /Mac/.test(ue.platform) : !1), Rl = ue ? /Win/.test(ue.platform) : !1, pe = /Android \d/.test(Ae), Et = !!_r && "webkitFontSmoothing" in _r.documentElement.style, Bl = Et ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
 function zl(r) {
   let e = r.defaultView && r.defaultView.visualViewport;
   return e ? {
@@ -5238,7 +5238,7 @@ function zl(r) {
     bottom: r.documentElement.clientHeight
   };
 }
-function de(r, e) {
+function he(r, e) {
   return typeof r == "number" ? r : r[e];
 }
 function Fl(r) {
@@ -5258,7 +5258,7 @@ function Gr(r, e, t) {
       continue;
     }
     let l = o, a = l == s.body, c = a ? zl(s) : Fl(l), u = 0, d = 0;
-    if (e.top < c.top + de(n, "top") ? d = -(c.top - e.top + de(i, "top")) : e.bottom > c.bottom - de(n, "bottom") && (d = e.bottom - e.top > c.bottom - c.top ? e.top + de(i, "top") - c.top : e.bottom - c.bottom + de(i, "bottom")), e.left < c.left + de(n, "left") ? u = -(c.left - e.left + de(i, "left")) : e.right > c.right - de(n, "right") && (u = e.right - c.right + de(i, "right")), u || d)
+    if (e.top < c.top + he(n, "top") ? d = -(c.top - e.top + he(i, "top")) : e.bottom > c.bottom - he(n, "bottom") && (d = e.bottom - e.top > c.bottom - c.top ? e.top + he(i, "top") - c.top : e.bottom - c.bottom + he(i, "bottom")), e.left < c.left + he(n, "left") ? u = -(c.left - e.left + he(i, "left")) : e.right > c.right - he(n, "right") && (u = e.right - c.right + he(i, "right")), u || d)
       if (a)
         s.defaultView.scrollBy(u, d);
       else {
@@ -5323,7 +5323,7 @@ function Ms(r, e) {
     if (u.nodeType == 1)
       h = u.getClientRects();
     else if (u.nodeType == 3)
-      h = he(u).getClientRects();
+      h = fe(u).getClientRects();
     else
       continue;
     for (let f = 0; f < h.length; f++) {
@@ -5413,7 +5413,7 @@ function ql(r, e) {
     for (let c = o; n && c; c = nt(c))
       c.draggable && (n = void 0);
   if (o = Wl(o, e), n) {
-    if (se && n.nodeType == 1 && (i = Math.min(i, n.childNodes.length), i < n.childNodes.length)) {
+    if (oe && n.nodeType == 1 && (i = Math.min(i, n.childNodes.length), i < n.childNodes.length)) {
       let u = n.childNodes[i], d;
       u.nodeName == "IMG" && (d = u.getBoundingClientRect()).right <= e.left && d.bottom > e.top && i++;
     }
@@ -5438,14 +5438,14 @@ function ye(r, e) {
 }
 const Kl = /[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac]/;
 function Ts(r, e, t) {
-  let { node: n, offset: i, atom: s } = r.docView.domFromPos(e, t < 0 ? -1 : 1), o = Et || se;
+  let { node: n, offset: i, atom: s } = r.docView.domFromPos(e, t < 0 ? -1 : 1), o = Et || oe;
   if (n.nodeType == 3)
     if (o && (Kl.test(n.nodeValue) || (t < 0 ? !i : i == n.nodeValue.length))) {
-      let a = ye(he(n, i, i), t);
-      if (se && i && /\s/.test(n.nodeValue[i - 1]) && i < n.nodeValue.length) {
-        let c = ye(he(n, i - 1, i - 1), -1);
+      let a = ye(fe(n, i, i), t);
+      if (oe && i && /\s/.test(n.nodeValue[i - 1]) && i < n.nodeValue.length) {
+        let c = ye(fe(n, i - 1, i - 1), -1);
         if (c.top == a.top) {
-          let u = ye(he(n, i, i + 1), -1);
+          let u = ye(fe(n, i, i + 1), -1);
           if (u.top != a.top)
             return ot(u, u.left < c.left);
         }
@@ -5453,35 +5453,35 @@ function Ts(r, e, t) {
       return a;
     } else {
       let a = i, c = i, u = t < 0 ? 1 : -1;
-      return t < 0 && !i ? (c++, u = -1) : t >= 0 && i == n.nodeValue.length ? (a--, u = 1) : t < 0 ? a-- : c++, ot(ye(he(n, a, c), u), u < 0);
+      return t < 0 && !i ? (c++, u = -1) : t >= 0 && i == n.nodeValue.length ? (a--, u = 1) : t < 0 ? a-- : c++, ot(ye(fe(n, a, c), u), u < 0);
     }
   if (!r.state.doc.resolve(e - (s || 0)).parent.inlineContent) {
-    if (s == null && i && (t < 0 || i == te(n))) {
+    if (s == null && i && (t < 0 || i == ne(n))) {
       let a = n.childNodes[i - 1];
       if (a.nodeType == 1)
         return wn(a.getBoundingClientRect(), !1);
     }
-    if (s == null && i < te(n)) {
+    if (s == null && i < ne(n)) {
       let a = n.childNodes[i];
       if (a.nodeType == 1)
         return wn(a.getBoundingClientRect(), !0);
     }
     return wn(n.getBoundingClientRect(), t >= 0);
   }
-  if (s == null && i && (t < 0 || i == te(n))) {
-    let a = n.childNodes[i - 1], c = a.nodeType == 3 ? he(a, te(a) - (o ? 0 : 1)) : a.nodeType == 1 && (a.nodeName != "BR" || !a.nextSibling) ? a : null;
+  if (s == null && i && (t < 0 || i == ne(n))) {
+    let a = n.childNodes[i - 1], c = a.nodeType == 3 ? fe(a, ne(a) - (o ? 0 : 1)) : a.nodeType == 1 && (a.nodeName != "BR" || !a.nextSibling) ? a : null;
     if (c)
       return ot(ye(c, 1), !1);
   }
-  if (s == null && i < te(n)) {
+  if (s == null && i < ne(n)) {
     let a = n.childNodes[i];
     for (; a.pmViewDesc && a.pmViewDesc.ignoreForCoords; )
       a = a.nextSibling;
-    let c = a ? a.nodeType == 3 ? he(a, 0, o ? 0 : 1) : a.nodeType == 1 ? a : null : null;
+    let c = a ? a.nodeType == 3 ? fe(a, 0, o ? 0 : 1) : a.nodeType == 1 ? a : null : null;
     if (c)
       return ot(ye(c, -1), !0);
   }
-  return ot(ye(n.nodeType == 3 ? he(n) : n, -t), t >= 0);
+  return ot(ye(n.nodeType == 3 ? fe(n) : n, -t), t >= 0);
 }
 function ot(r, e) {
   if (r.width == 0)
@@ -5524,7 +5524,7 @@ function Ul(r, e, t) {
       if (l.nodeType == 1)
         a = l.getClientRects();
       else if (l.nodeType == 3)
-        a = he(l, 0, l.nodeValue.length).getClientRects();
+        a = fe(l, 0, l.nodeValue.length).getClientRects();
       else
         continue;
       for (let c = 0; c < a.length; c++) {
@@ -5557,10 +5557,10 @@ let Xr = null, Zr = null, Qr = !1;
 function Yl(r, e, t) {
   return Xr == e && Zr == t ? Qr : (Xr = e, Zr = t, Qr = t == "up" || t == "down" ? Ul(r, e, t) : Gl(r, e, t));
 }
-const re = 0, ei = 1, Pe = 2, ue = 3;
+const ie = 0, ei = 1, Pe = 2, de = 3;
 class Tt {
   constructor(e, t, n, i) {
-    this.parent = e, this.children = t, this.dom = n, this.contentDOM = i, this.dirty = re, n.pmViewDesc = this;
+    this.parent = e, this.children = t, this.dom = n, this.contentDOM = i, this.dirty = ie, n.pmViewDesc = this;
   }
   // Used to check whether a given description corresponds to a
   // widget/mark/node.
@@ -5653,7 +5653,7 @@ class Tt {
       }
     let i;
     if (e == this.dom && this.contentDOM)
-      i = t > j(this.contentDOM);
+      i = t > V(this.contentDOM);
     else if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM))
       i = e.compareDocumentPosition(this.contentDOM) & 2;
     else if (this.dom.firstChild) {
@@ -5743,12 +5743,12 @@ class Tt {
       let s, o = !0;
       for (; s = n ? this.children[n - 1] : null, !(!s || s.dom.parentNode == this.contentDOM); n--, o = !1)
         ;
-      return s && t && o && !s.border && !s.domAtom ? s.domFromPos(s.size, t) : { node: this.contentDOM, offset: s ? j(s.dom) + 1 : 0 };
+      return s && t && o && !s.border && !s.domAtom ? s.domFromPos(s.size, t) : { node: this.contentDOM, offset: s ? V(s.dom) + 1 : 0 };
     } else {
       let s, o = !0;
       for (; s = n < this.children.length ? this.children[n] : null, !(!s || s.dom.parentNode == this.contentDOM); n++, o = !1)
         ;
-      return s && o && !s.border && !s.domAtom ? s.domFromPos(0, t) : { node: this.contentDOM, offset: s ? j(s.dom) : this.contentDOM.childNodes.length };
+      return s && o && !s.border && !s.domAtom ? s.domFromPos(0, t) : { node: this.contentDOM, offset: s ? V(s.dom) : this.contentDOM.childNodes.length };
     }
   }
   // Used to find a DOM range in a single parent for a given changed
@@ -5767,7 +5767,7 @@ class Tt {
         for (let d = l; d > 0; d--) {
           let h = this.children[d - 1];
           if (h.size && h.dom.parentNode == this.contentDOM && !h.emptyChildAt(1)) {
-            i = j(h.dom) + 1;
+            i = V(h.dom) + 1;
             break;
           }
           e -= h.size;
@@ -5779,7 +5779,7 @@ class Tt {
         for (let u = l + 1; u < this.children.length; u++) {
           let d = this.children[u];
           if (d.size && d.dom.parentNode == this.contentDOM && !d.emptyChildAt(-1)) {
-            s = j(d.dom);
+            s = V(d.dom);
             break;
           }
           t += d.size;
@@ -5817,14 +5817,14 @@ class Tt {
       p = g;
     }
     let l = this.domFromPos(e, e ? -1 : 1), a = t == e ? l : this.domFromPos(t, t ? -1 : 1), c = n.root.getSelection(), u = n.domSelectionRange(), d = !1;
-    if ((se || K) && e == t) {
+    if ((oe || K) && e == t) {
       let { node: f, offset: p } = l;
       if (f.nodeType == 3) {
         if (d = !!(p && f.nodeValue[p - 1] == `
 `), d && p == f.nodeValue.length)
           for (let m = f, g; m; m = m.parentNode) {
             if (g = m.nextSibling) {
-              g.nodeName == "BR" && (l = a = { node: g.parentNode, offset: j(g) + 1 });
+              g.nodeName == "BR" && (l = a = { node: g.parentNode, offset: V(g) + 1 });
               break;
             }
             let y = m.pmViewDesc;
@@ -5836,7 +5836,7 @@ class Tt {
         d = m && (m.nodeName == "BR" || m.contentEditable == "false");
       }
     }
-    if (se && u.focusNode && u.focusNode != a.node && u.focusNode.nodeType == 1) {
+    if (oe && u.focusNode && u.focusNode != a.node && u.focusNode.nodeType == 1) {
       let f = u.focusNode.childNodes[u.focusOffset];
       f && f.contentEditable == "false" && (i = !0);
     }
@@ -5873,10 +5873,10 @@ class Tt {
       if (n == o ? e <= o && t >= n : e < o && t > n) {
         let l = n + s.border, a = o - s.border;
         if (e >= l && t <= a) {
-          this.dirty = e == n || t == o ? Pe : ei, e == l && t == a && (s.contentLost || s.dom.parentNode != this.contentDOM) ? s.dirty = ue : s.markDirty(e - l, t - l);
+          this.dirty = e == n || t == o ? Pe : ei, e == l && t == a && (s.contentLost || s.dom.parentNode != this.contentDOM) ? s.dirty = de : s.markDirty(e - l, t - l);
           return;
         } else
-          s.dirty = s.dom == s.contentDOM && s.dom.parentNode == this.contentDOM && !s.children.length ? Pe : ue;
+          s.dirty = s.dom == s.contentDOM && s.dom.parentNode == this.contentDOM && !s.children.length ? Pe : de;
       }
       n = o;
     }
@@ -5917,7 +5917,7 @@ class Ns extends Tt {
     super(e, [], o, null), this.widget = t, this.widget = t, s = this;
   }
   matchesWidget(e) {
-    return this.dirty == re && e.type.eq(this.widget.type);
+    return this.dirty == ie && e.type.eq(this.widget.type);
   }
   parseRule() {
     return { ignore: !0 };
@@ -5965,17 +5965,17 @@ class He extends Tt {
     return (!o || !o.dom) && (o = Je.renderSpec(document, t.type.spec.toDOM(t, n), null, t.attrs)), new He(e, t, o.dom, o.contentDOM || o.dom, o);
   }
   parseRule() {
-    return this.dirty & ue || this.mark.type.spec.reparseInView ? null : { mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM };
+    return this.dirty & de || this.mark.type.spec.reparseInView ? null : { mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM };
   }
   matchesMark(e) {
-    return this.dirty != ue && this.mark.eq(e);
+    return this.dirty != de && this.mark.eq(e);
   }
   markDirty(e, t) {
-    if (super.markDirty(e, t), this.dirty != re) {
+    if (super.markDirty(e, t), this.dirty != ie) {
       let n = this.parent;
       for (; !n.node; )
         n = n.parent;
-      n.dirty < this.dirty && (n.dirty = this.dirty), this.dirty = re;
+      n.dirty < this.dirty && (n.dirty = this.dirty), this.dirty = ie;
     }
   }
   slice(e, t, n) {
@@ -6043,7 +6043,7 @@ class Te extends Tt {
     return e;
   }
   matchesNode(e, t, n) {
-    return this.dirty == re && e.eq(this.node) && qt(t, this.outerDeco) && n.eq(this.innerDeco);
+    return this.dirty == ie && e.eq(this.node) && qt(t, this.outerDeco) && n.eq(this.innerDeco);
   }
   get size() {
     return this.node.nodeSize;
@@ -6067,7 +6067,7 @@ class Te extends Tt {
   }
   localCompositionInfo(e, t) {
     let { from: n, to: i } = e.state.selection;
-    if (!(e.state.selection instanceof E) || n < t || i > t + this.node.content.size)
+    if (!(e.state.selection instanceof T) || n < t || i > t + this.node.content.size)
       return null;
     let s = e.input.compositionNode;
     if (!s || !this.dom.contains(s.parentNode))
@@ -6095,10 +6095,10 @@ class Te extends Tt {
   // If this desc must be updated to match the given node decoration,
   // do so and return true.
   update(e, t, n, i) {
-    return this.dirty == ue || !e.sameMarkup(this.node) ? !1 : (this.updateInner(e, t, n, i), !0);
+    return this.dirty == de || !e.sameMarkup(this.node) ? !1 : (this.updateInner(e, t, n, i), !0);
   }
   updateInner(e, t, n, i) {
-    this.updateOuterDeco(t), this.node = e, this.innerDeco = n, this.contentDOM && this.updateChildren(i, this.posAtStart), this.dirty = re;
+    this.updateOuterDeco(t), this.node = e, this.innerDeco = n, this.contentDOM && this.updateChildren(i, this.posAtStart), this.dirty = ie;
   }
   updateOuterDeco(e) {
     if (qt(e, this.outerDeco))
@@ -6134,7 +6134,7 @@ class on extends Te {
     return { skip: e || !0 };
   }
   update(e, t, n, i) {
-    return this.dirty == ue || this.dirty != re && !this.inParent() || !e.sameMarkup(this.node) ? !1 : (this.updateOuterDeco(t), (this.dirty != re || e.text != this.node.text) && e.text != this.nodeDOM.nodeValue && (this.nodeDOM.nodeValue = e.text, i.trackWrites == this.nodeDOM && (i.trackWrites = null)), this.node = e, this.dirty = re, !0);
+    return this.dirty == de || this.dirty != ie && !this.inParent() || !e.sameMarkup(this.node) ? !1 : (this.updateOuterDeco(t), (this.dirty != ie || e.text != this.node.text) && e.text != this.nodeDOM.nodeValue && (this.nodeDOM.nodeValue = e.text, i.trackWrites == this.nodeDOM && (i.trackWrites = null)), this.node = e, this.dirty = ie, !0);
   }
   inParent() {
     let e = this.parent.contentDOM;
@@ -6157,7 +6157,7 @@ class on extends Te {
     return new on(this.parent, i, this.outerDeco, this.innerDeco, s, s, n);
   }
   markDirty(e, t) {
-    super.markDirty(e, t), this.dom != this.nodeDOM && (e == 0 || t == this.nodeDOM.nodeValue.length) && (this.dirty = ue);
+    super.markDirty(e, t), this.dom != this.nodeDOM && (e == 0 || t == this.nodeDOM.nodeValue.length) && (this.dirty = de);
   }
   get domAtom() {
     return !1;
@@ -6171,7 +6171,7 @@ class As extends Tt {
     return { ignore: !0 };
   }
   matchesHack(e) {
-    return this.dirty == re && this.dom.nodeName == e;
+    return this.dirty == ie && this.dom.nodeName == e;
   }
   get domAtom() {
     return !0;
@@ -6188,7 +6188,7 @@ class Zl extends Te {
   // through. If it does, and there's a `contentDOM` node, our logic
   // updates the children.
   update(e, t, n, i) {
-    if (this.dirty == ue)
+    if (this.dirty == de)
       return !1;
     if (this.spec.update && (this.node.type == e.type || this.spec.multiType)) {
       let s = this.spec.update(e, t, n);
@@ -6329,7 +6329,7 @@ class ea {
     for (; i < o && (i == s - 1 ? this.top : this.stack[i + 1 << 1]).matchesMark(e[i]) && e[i].type.spec.spanning !== !1; )
       i++;
     for (; i < s; )
-      this.destroyRest(), this.top.dirty = re, this.index = this.stack.pop(), this.top = this.stack.pop(), s--;
+      this.destroyRest(), this.top.dirty = ie, this.index = this.stack.pop(), this.top = this.stack.pop(), s--;
     for (; s < e.length; ) {
       this.stack.push(this.top, this.index + 1);
       let l = -1;
@@ -6367,7 +6367,7 @@ class ea {
   }
   updateNodeAt(e, t, n, i, s) {
     let o = this.top.children[i];
-    return o.dirty == ue && o.dom == o.contentDOM && (o.dirty = Pe), o.update(e, t, n, s) ? (this.destroyBetween(this.index, i), this.index++, !0) : !1;
+    return o.dirty == de && o.dom == o.contentDOM && (o.dirty = Pe), o.update(e, t, n, s) ? (this.destroyBetween(this.index, i), this.index++, !0) : !1;
   }
   findIndexWithChild(e) {
     for (; ; ) {
@@ -6395,11 +6395,11 @@ class ea {
         let c = this.preMatch.matched.get(a);
         if (c != null && c != s)
           return !1;
-        let u = a.dom, d, h = this.isLocked(u) && !(e.isText && a.node && a.node.isText && a.nodeDOM.nodeValue == e.text && a.dirty != ue && qt(t, a.outerDeco));
+        let u = a.dom, d, h = this.isLocked(u) && !(e.isText && a.node && a.node.isText && a.nodeDOM.nodeValue == e.text && a.dirty != de && qt(t, a.outerDeco));
         if (!h && a.update(e, t, n, i))
           return this.destroyBetween(this.index, l), a.dom != u && (this.changed = !0), this.index++, !0;
         if (!h && (d = this.recreateWrapper(a, e, t, n, i, o)))
-          return this.destroyBetween(this.index, l), this.top.children[this.index] = d, d.contentDOM && (d.dirty = Pe, d.updateChildren(i, o + 1), d.dirty = re), this.changed = !0, this.index++, !0;
+          return this.destroyBetween(this.index, l), this.top.children[this.index] = d, d.contentDOM && (d.dirty = Pe, d.updateChildren(i, o + 1), d.dirty = ie), this.changed = !0, this.index++, !0;
         break;
       }
     }
@@ -6612,7 +6612,7 @@ function ar(r, e = null) {
 function Ps(r) {
   return r.editable ? r.hasFocus() : Bs(r) && document.activeElement && document.activeElement.contains(r.dom);
 }
-function me(r, e = !1) {
+function ge(r, e = !1) {
   let t = r.state.selection;
   if (Rs(r, t), !!Ps(r)) {
     if (!e && r.input.mouseDown && r.input.mouseDown.allowDefault && J) {
@@ -6626,7 +6626,7 @@ function me(r, e = !1) {
       la(r);
     else {
       let { anchor: n, head: i } = t, s, o;
-      ri && !(t instanceof E) && (t.$from.parent.inlineContent || (s = ii(r, t.from)), !t.empty && !t.$from.parent.inlineContent && (o = ii(r, t.to))), r.docView.setSelection(n, i, r, e), ri && (s && si(s), o && si(o)), t.visible ? r.dom.classList.remove("ProseMirror-hideselection") : (r.dom.classList.add("ProseMirror-hideselection"), "onselectionchange" in document && oa(r));
+      ri && !(t instanceof T) && (t.$from.parent.inlineContent || (s = ii(r, t.from)), !t.empty && !t.$from.parent.inlineContent && (o = ii(r, t.to))), r.docView.setSelection(n, i, r, e), ri && (s && si(s), o && si(o)), t.visible ? r.dom.classList.remove("ProseMirror-hideselection") : (r.dom.classList.add("ProseMirror-hideselection"), "onselectionchange" in document && oa(r));
     }
     r.domObserver.setCurSelection(), r.domObserver.connectSelection();
   }
@@ -6664,7 +6664,7 @@ function la(r) {
   if (!e)
     return;
   let n = r.cursorWrapper.dom, i = n.nodeName == "IMG";
-  i ? t.setStart(n.parentNode, j(n) + 1) : t.setStart(n, 0), t.collapse(!0), e.removeAllRanges(), e.addRange(t), !i && !r.state.selection.visible && G && Ee <= 11 && (n.disabled = !0, n.disabled = !1);
+  i ? t.setStart(n.parentNode, V(n) + 1) : t.setStart(n, 0), t.collapse(!0), e.removeAllRanges(), e.addRange(t), !i && !r.state.selection.visible && G && Ee <= 11 && (n.disabled = !0, n.disabled = !1);
 }
 function Rs(r, e) {
   if (e instanceof C) {
@@ -6677,7 +6677,7 @@ function oi(r) {
   r.lastSelectedViewDesc && (r.lastSelectedViewDesc.parent && r.lastSelectedViewDesc.deselectNode(), r.lastSelectedViewDesc = void 0);
 }
 function cr(r, e, t, n) {
-  return r.someProp("createSelectionBetween", (i) => i(r, e, t)) || E.between(e, t, n);
+  return r.someProp("createSelectionBetween", (i) => i(r, e, t)) || T.between(e, t, n);
 }
 function li(r) {
   return r.editable && !r.hasFocus() ? !1 : Bs(r);
@@ -6705,28 +6705,28 @@ function be(r, e) {
 }
 function ai(r, e, t) {
   let n = r.state.selection;
-  if (n instanceof E)
+  if (n instanceof T)
     if (t.indexOf("s") > -1) {
       let { $head: i } = n, s = i.textOffset ? null : e < 0 ? i.nodeBefore : i.nodeAfter;
       if (!s || s.isText || !s.isLeaf)
         return !1;
       let o = r.state.doc.resolve(i.pos + s.nodeSize * (e < 0 ? -1 : 1));
-      return be(r, new E(n.$anchor, o));
+      return be(r, new T(n.$anchor, o));
     } else if (n.empty) {
       if (r.endOfTextblock(e > 0 ? "forward" : "backward")) {
         let i = _n(r.state, e);
         return i && i instanceof C ? be(r, i) : !1;
-      } else if (!(ee && t.indexOf("m") > -1)) {
+      } else if (!(te && t.indexOf("m") > -1)) {
         let i = n.$head, s = i.textOffset ? null : e < 0 ? i.nodeBefore : i.nodeAfter, o;
         if (!s || s.isText)
           return !1;
         let l = e < 0 ? i.pos - s.nodeSize : i.pos;
-        return s.isAtom || (o = r.docView.descAt(l)) && !o.contentDOM ? C.isSelectable(s) ? be(r, new C(e < 0 ? r.state.doc.resolve(i.pos - s.nodeSize) : i)) : Et ? be(r, new E(r.state.doc.resolve(e < 0 ? l : l + s.nodeSize))) : !1 : !1;
+        return s.isAtom || (o = r.docView.descAt(l)) && !o.contentDOM ? C.isSelectable(s) ? be(r, new C(e < 0 ? r.state.doc.resolve(i.pos - s.nodeSize) : i)) : Et ? be(r, new T(r.state.doc.resolve(e < 0 ? l : l + s.nodeSize))) : !1 : !1;
       }
     } else return !1;
   else {
     if (n instanceof C && n.node.isInline)
-      return be(r, new E(e > 0 ? n.$to : n.$from));
+      return be(r, new T(e > 0 ? n.$to : n.$from));
     {
       let i = _n(r.state, e);
       return i ? be(r, i) : !1;
@@ -6748,7 +6748,7 @@ function ca(r) {
   if (!t)
     return;
   let i, s, o = !1;
-  for (se && t.nodeType == 1 && n < Kt(t) && ft(t.childNodes[n], -1) && (o = !0); ; )
+  for (oe && t.nodeType == 1 && n < Kt(t) && ft(t.childNodes[n], -1) && (o = !0); ; )
     if (n > 0) {
       if (t.nodeType != 1)
         break;
@@ -6767,7 +6767,7 @@ function ca(r) {
       {
         let l = t.previousSibling;
         for (; l && ft(l, -1); )
-          i = t.parentNode, s = j(l), l = l.previousSibling;
+          i = t.parentNode, s = V(l), l = l.previousSibling;
         if (l)
           t = l, n = Kt(t);
         else {
@@ -6799,7 +6799,7 @@ function ua(r) {
       {
         let l = t.nextSibling;
         for (; l && ft(l, 1); )
-          s = l.parentNode, o = j(l) + 1, l = l.nextSibling;
+          s = l.parentNode, o = V(l) + 1, l = l.nextSibling;
         if (l)
           t = l, n = 0, i = Kt(t);
         else {
@@ -6817,7 +6817,7 @@ function zs(r) {
 }
 function da(r, e) {
   for (; r && e == r.childNodes.length && !Mt(r); )
-    e = j(r) + 1, r = r.parentNode;
+    e = V(r) + 1, r = r.parentNode;
   for (; r && e < r.childNodes.length; ) {
     let t = r.childNodes[e];
     if (t.nodeType == 3)
@@ -6829,7 +6829,7 @@ function da(r, e) {
 }
 function ha(r, e) {
   for (; r && !e && !Mt(r); )
-    e = j(r), r = r.parentNode;
+    e = V(r), r = r.parentNode;
   for (; r && e; ) {
     let t = r.childNodes[e - 1];
     if (t.nodeType == 3)
@@ -6854,7 +6854,7 @@ function Gn(r, e, t) {
   r.domObserver.setCurSelection();
   let { state: i } = r;
   setTimeout(() => {
-    r.state == i && me(r);
+    r.state == i && ge(r);
   }, 50);
 }
 function ci(r, e) {
@@ -6876,7 +6876,7 @@ function ci(r, e) {
 }
 function ui(r, e, t) {
   let n = r.state.selection;
-  if (n instanceof E && !n.empty || t.indexOf("s") > -1 || ee && t.indexOf("m") > -1)
+  if (n instanceof T && !n.empty || t.indexOf("s") > -1 || te && t.indexOf("m") > -1)
     return !1;
   let { $from: i, $to: s } = n;
   if (!i.parent.inlineContent || r.endOfTextblock(e < 0 ? "up" : "down")) {
@@ -6891,7 +6891,7 @@ function ui(r, e, t) {
   return !1;
 }
 function di(r, e) {
-  if (!(r.state.selection instanceof E))
+  if (!(r.state.selection instanceof T))
     return !0;
   let { $head: t, $anchor: n, empty: i } = r.state.selection;
   if (!t.sameParent(n))
@@ -6926,24 +6926,24 @@ function pa(r) {
 }
 function ma(r, e) {
   let t = e.keyCode, n = pa(e);
-  if (t == 8 || ee && t == 72 && n == "c")
+  if (t == 8 || te && t == 72 && n == "c")
     return di(r, -1) || Ue(r, -1);
-  if (t == 46 && !e.shiftKey || ee && t == 68 && n == "c")
+  if (t == 46 && !e.shiftKey || te && t == 68 && n == "c")
     return di(r, 1) || Ue(r, 1);
   if (t == 13 || t == 27)
     return !0;
-  if (t == 37 || ee && t == 66 && n == "c") {
+  if (t == 37 || te && t == 66 && n == "c") {
     let i = t == 37 ? ci(r, r.state.selection.from) == "ltr" ? -1 : 1 : -1;
     return ai(r, i, n) || Ue(r, i);
-  } else if (t == 39 || ee && t == 70 && n == "c") {
+  } else if (t == 39 || te && t == 70 && n == "c") {
     let i = t == 39 ? ci(r, r.state.selection.from) == "ltr" ? 1 : -1 : 1;
     return ai(r, i, n) || Ue(r, i);
   } else {
-    if (t == 38 || ee && t == 80 && n == "c")
+    if (t == 38 || te && t == 80 && n == "c")
       return ui(r, -1, n) || Ue(r, -1);
-    if (t == 40 || ee && t == 78 && n == "c")
+    if (t == 40 || te && t == 78 && n == "c")
       return fa(r) || ui(r, 1, n) || Ue(r, 1);
-    if (n == (ee ? "m" : "c") && (t == 66 || t == 73 || t == 89 || t == 90))
+    if (n == (te ? "m" : "c") && (t == 66 || t == 73 || t == 89 || t == 90))
       return !0;
   }
   return !1;
@@ -7187,7 +7187,7 @@ function Oa(r, e) {
 }
 _.keydown = (r, e) => {
   let t = e;
-  if (r.input.shiftKey = t.keyCode == 16 || t.shiftKey, !Js(r, t) && (r.input.lastKeyCode = t.keyCode, r.input.lastKeyCodeTime = Date.now(), !(fe && J && t.keyCode == 13)))
+  if (r.input.shiftKey = t.keyCode == 16 || t.shiftKey, !Js(r, t) && (r.input.lastKeyCode = t.keyCode, r.input.lastKeyCodeTime = Date.now(), !(pe && J && t.keyCode == 13)))
     if (t.keyCode != 229 && r.domObserver.forceFlush(), rt && t.keyCode == 13 && !t.ctrlKey && !t.altKey && !t.metaKey) {
       let n = Date.now();
       r.input.lastIOSEnter = n, r.input.lastIOSEnterFallbackTimeout = setTimeout(() => {
@@ -7200,14 +7200,14 @@ _.keyup = (r, e) => {
 };
 _.keypress = (r, e) => {
   let t = e;
-  if (Js(r, t) || !t.charCode || t.ctrlKey && !t.altKey || ee && t.metaKey)
+  if (Js(r, t) || !t.charCode || t.ctrlKey && !t.altKey || te && t.metaKey)
     return;
   if (r.someProp("handleKeyPress", (i) => i(r, t))) {
     t.preventDefault();
     return;
   }
   let n = r.state.selection;
-  if (!(n instanceof E) || !n.$from.sameParent(n.$to)) {
+  if (!(n instanceof T) || !n.$from.sameParent(n.$to)) {
     let i = String.fromCharCode(t.charCode);
     !/[\r\n]/.test(i) && !r.someProp("handleTextInput", (s) => s(r, n.$from.pos, n.$to.pos, i)) && r.dispatch(r.state.tr.insertText(i).scrollIntoView()), t.preventDefault();
   }
@@ -7269,12 +7269,12 @@ function Ra(r, e, t) {
     return !1;
   let n = r.state.doc;
   if (e == -1)
-    return n.inlineContent ? (Qe(r, E.create(n, 0, n.content.size)), !0) : !1;
+    return n.inlineContent ? (Qe(r, T.create(n, 0, n.content.size)), !0) : !1;
   let i = n.resolve(e);
   for (let s = i.depth + 1; s > 0; s--) {
     let o = s > i.depth ? i.nodeAfter : i.node(s), l = i.before(s);
     if (o.inlineContent)
-      Qe(r, E.create(n, l + 1, l + 1 + o.content.size));
+      Qe(r, T.create(n, l + 1, l + 1 + o.content.size));
     else if (C.isSelectable(o))
       Qe(r, C.create(n, l));
     else
@@ -7285,7 +7285,7 @@ function Ra(r, e, t) {
 function fr(r) {
   return Ut(r);
 }
-const Hs = ee ? "metaKey" : "ctrlKey";
+const Hs = te ? "metaKey" : "ctrlKey";
 U.mousedown = (r, e) => {
   let t = e;
   r.input.shiftKey = t.shiftKey;
@@ -7311,13 +7311,13 @@ class Ba {
       node: s,
       pos: o,
       addAttr: !!(this.target && !this.target.draggable),
-      setUneditable: !!(this.target && se && !this.target.hasAttribute("contentEditable"))
+      setUneditable: !!(this.target && oe && !this.target.hasAttribute("contentEditable"))
     }), this.target && this.mightDrag && (this.mightDrag.addAttr || this.mightDrag.setUneditable) && (this.view.domObserver.stop(), this.mightDrag.addAttr && (this.target.draggable = !0), this.mightDrag.setUneditable && setTimeout(() => {
       this.view.input.mouseDown == this && this.target.setAttribute("contentEditable", "false");
     }, 20), this.view.domObserver.start()), e.root.addEventListener("mouseup", this.up = this.up.bind(this)), e.root.addEventListener("mousemove", this.move = this.move.bind(this)), we(e, "pointer");
   }
   done() {
-    this.view.root.removeEventListener("mouseup", this.up), this.view.root.removeEventListener("mousemove", this.move), this.mightDrag && this.target && (this.view.domObserver.stop(), this.mightDrag.addAttr && this.target.removeAttribute("draggable"), this.mightDrag.setUneditable && this.target.removeAttribute("contentEditable"), this.view.domObserver.start()), this.delayedSelectionSync && setTimeout(() => me(this.view)), this.view.input.mouseDown = null;
+    this.view.root.removeEventListener("mouseup", this.up), this.view.root.removeEventListener("mousemove", this.move), this.mightDrag && this.target && (this.view.domObserver.stop(), this.mightDrag.addAttr && this.target.removeAttribute("draggable"), this.mightDrag.setUneditable && this.target.removeAttribute("contentEditable"), this.view.domObserver.start()), this.delayedSelectionSync && setTimeout(() => ge(this.view)), this.view.input.mouseDown = null;
   }
   up(e) {
     if (this.done(), !this.view.dom.contains(e.target))
@@ -7350,14 +7350,14 @@ U.contextmenu = (r) => fr(r);
 function Js(r, e) {
   return r.composing ? !0 : K && Math.abs(e.timeStamp - r.input.compositionEndedAt) < 500 ? (r.input.compositionEndedAt = -2e8, !0) : !1;
 }
-const za = fe ? 5e3 : -1;
+const za = pe ? 5e3 : -1;
 _.compositionstart = _.compositionupdate = (r) => {
   if (!r.composing) {
     r.domObserver.flush();
     let { state: e } = r, t = e.selection.$to;
-    if (e.selection instanceof E && (e.storedMarks || !t.textOffset && t.parentOffset && t.nodeBefore.marks.some((n) => n.type.spec.inclusive === !1)))
+    if (e.selection instanceof T && (e.storedMarks || !t.textOffset && t.parentOffset && t.nodeBefore.marks.some((n) => n.type.spec.inclusive === !1)))
       r.markCursor = r.state.storedMarks || t.marks(), Ut(r, !0), r.markCursor = null;
-    else if (Ut(r, !e.selection.empty), se && e.selection.empty && t.parentOffset && !t.textOffset && t.nodeBefore.marks.length) {
+    else if (Ut(r, !e.selection.empty), oe && e.selection.empty && t.parentOffset && !t.textOffset && t.nodeBefore.marks.length) {
       let n = r.domSelectionRange();
       for (let i = n.focusNode, s = n.focusOffset; i && i.nodeType == 1 && s != 0; ) {
         let o = s < 0 ? i.lastChild : i.childNodes[s - 1];
@@ -7409,7 +7409,7 @@ function La() {
   return r.initEvent("event", !0, !0), r.timeStamp;
 }
 function Ut(r, e = !1) {
-  if (!(fe && r.domObserver.flushingSoon >= 0)) {
+  if (!(pe && r.domObserver.flushingSoon >= 0)) {
     if (r.domObserver.forceFlush(), Ks(r), e || r.docView && r.docView.dirty) {
       let t = ar(r);
       return t && !t.eq(r.state.selection) ? r.dispatch(r.state.tr.setSelection(t)) : (r.markCursor || e) && !r.state.selection.empty ? r.dispatch(r.state.tr.deleteSelection()) : r.updateState(r.state), !0;
@@ -7466,7 +7466,7 @@ function Us(r) {
 }
 _.paste = (r, e) => {
   let t = e;
-  if (r.composing && !fe)
+  if (r.composing && !pe)
     return;
   let n = bt ? null : t.clipboardData, i = r.input.shiftKey && r.input.lastKeyCode != 45;
   n && kt(r, Us(n), n.getData("text/html"), i, t) ? t.preventDefault() : ja(r, t);
@@ -7476,7 +7476,7 @@ class _s {
     this.slice = e, this.move = t, this.node = n;
   }
 }
-const Wa = ee ? "altKey" : "ctrlKey";
+const Wa = te ? "altKey" : "ctrlKey";
 function Gs(r, e) {
   let t = r.someProp("dragCopies", (n) => !n(e));
   return t ?? !e[Wa];
@@ -7544,7 +7544,7 @@ _.drop = (r, e) => {
 };
 U.focus = (r) => {
   r.input.lastFocus = Date.now(), r.focused || (r.domObserver.stop(), r.dom.classList.add("ProseMirror-focused"), r.domObserver.start(), r.focused = !0, setTimeout(() => {
-    r.docView && r.hasFocus() && !r.domObserver.currentSelection.eq(r.domSelectionRange()) && me(r);
+    r.docView && r.hasFocus() && !r.domObserver.currentSelection.eq(r.domSelectionRange()) && ge(r);
   }, 20));
 };
 U.blur = (r, e) => {
@@ -7552,7 +7552,7 @@ U.blur = (r, e) => {
   r.focused && (r.domObserver.stop(), r.dom.classList.remove("ProseMirror-focused"), r.domObserver.start(), t.relatedTarget && r.dom.contains(t.relatedTarget) && r.domObserver.currentSelection.clear(), r.focused = !1);
 };
 U.beforeinput = (r, e) => {
-  if (J && fe && e.inputType == "deleteContentBackward") {
+  if (J && pe && e.inputType == "deleteContentBackward") {
     r.domObserver.flushSoon();
     let { domChangeCount: n } = r.input;
     setTimeout(() => {
@@ -7582,7 +7582,7 @@ class _t {
   }
   map(e, t, n, i) {
     let { pos: s, deleted: o } = e.mapResult(t.from + i, this.side < 0 ? -1 : 1);
-    return o ? null : new ne(s - n, s - n, this);
+    return o ? null : new re(s - n, s - n, this);
   }
   valid() {
     return !0;
@@ -7600,7 +7600,7 @@ class Oe {
   }
   map(e, t, n, i) {
     let s = e.map(t.from + i, this.spec.inclusiveStart ? -1 : 1) - n, o = e.map(t.to + i, this.spec.inclusiveEnd ? 1 : -1) - n;
-    return s >= o ? null : new ne(s, o, this);
+    return s >= o ? null : new re(s, o, this);
   }
   valid(e, t) {
     return t.from < t.to;
@@ -7623,7 +7623,7 @@ class pr {
     if (s.deleted)
       return null;
     let o = e.mapResult(t.to + i, -1);
-    return o.deleted || o.pos <= s.pos ? null : new ne(s.pos - n, o.pos - n, this);
+    return o.deleted || o.pos <= s.pos ? null : new re(s.pos - n, o.pos - n, this);
   }
   valid(e, t) {
     let { index: n, offset: i } = e.content.findIndex(t.from), s;
@@ -7635,7 +7635,7 @@ class pr {
   destroy() {
   }
 }
-class ne {
+class re {
   /**
   @internal
   */
@@ -7646,7 +7646,7 @@ class ne {
   @internal
   */
   copy(e, t) {
-    return new ne(e, t, this.type);
+    return new re(e, t, this.type);
   }
   /**
   @internal
@@ -7669,14 +7669,14 @@ class ne {
   widget's current document position.
   */
   static widget(e, t, n) {
-    return new ne(e, e, new _t(t, n));
+    return new re(e, e, new _t(t, n));
   }
   /**
   Creates an inline decoration, which adds the given attributes to
   each inline node between `from` and `to`.
   */
   static inline(e, t, n, i) {
-    return new ne(e, t, new Oe(n, i));
+    return new re(e, t, new Oe(n, i));
   }
   /**
   Creates a node decoration. `from` and `to` should point precisely
@@ -7684,7 +7684,7 @@ class ne {
   node, will receive the given attributes.
   */
   static node(e, t, n, i) {
-    return new ne(e, t, new pr(n, i));
+    return new re(e, t, new pr(n, i));
   }
   /**
   The spec provided when creating this decoration. Can be useful
@@ -7707,7 +7707,7 @@ class ne {
   }
 }
 const Ge = [], Le = {};
-class z {
+class B {
   /**
   @internal
   */
@@ -7761,7 +7761,7 @@ class z {
       let a = this.local[l].map(e, n, i);
       a && a.type.valid(t, a) ? (o || (o = [])).push(a) : s.onRemove && s.onRemove(this.local[l].spec);
     }
-    return this.children.length ? Ha(this.children, o || [], e, t, n, i, s) : o ? new z(o.sort($e), Ge) : H;
+    return this.children.length ? Ha(this.children, o || [], e, t, n, i, s) : o ? new B(o.sort($e), Ge) : H;
   }
   /**
   Add the given array of decorations to the ones in the set,
@@ -7770,7 +7770,7 @@ class z {
   structure.
   */
   add(e, t) {
-    return t.length ? this == H ? z.create(e, t) : this.addInner(e, t, 0) : this;
+    return t.length ? this == H ? B.create(e, t) : this.addInner(e, t, 0) : this;
   }
   addInner(e, t, n) {
     let i, s = 0;
@@ -7785,7 +7785,7 @@ class z {
     let o = Ys(s ? Zs(t) : t, -n);
     for (let l = 0; l < o.length; l++)
       o[l].type.valid(e, o[l]) || o.splice(l--, 1);
-    return new z(o.length ? this.local.concat(o).sort($e) : this.local, i || this.children);
+    return new B(o.length ? this.local.concat(o).sort($e) : this.local, i || this.children);
   }
   /**
   Create a new set that contains the decorations in this set, minus
@@ -7812,13 +7812,13 @@ class z {
           for (let l = 0; l < i.length; l++)
             i[l].eq(o, t) && (i == this.local && (i = this.local.slice()), i.splice(l--, 1));
     }
-    return n == this.children && i == this.local ? this : i.length || n.length ? new z(i, n) : H;
+    return n == this.children && i == this.local ? this : i.length || n.length ? new B(i, n) : H;
   }
   forChild(e, t) {
     if (this == H)
       return this;
     if (t.isLeaf)
-      return z.empty;
+      return B.empty;
     let n, i;
     for (let l = 0; l < this.children.length; l += 3)
       if (this.children[l] >= e) {
@@ -7834,7 +7834,7 @@ class z {
       }
     }
     if (i) {
-      let l = new z(i.sort($e), Ge);
+      let l = new B(i.sort($e), Ge);
       return n ? new xe([l, n]) : l;
     }
     return n || H;
@@ -7845,7 +7845,7 @@ class z {
   eq(e) {
     if (this == e)
       return !0;
-    if (!(e instanceof z) || this.local.length != e.local.length || this.children.length != e.children.length)
+    if (!(e instanceof B) || this.local.length != e.local.length || this.children.length != e.children.length)
       return !1;
     for (let t = 0; t < this.local.length; t++)
       if (!this.local[t].eq(e.local[t]))
@@ -7878,9 +7878,9 @@ class z {
     e(this);
   }
 }
-z.empty = new z([], []);
-z.removeOverlap = mr;
-const H = z.empty;
+B.empty = new B([], []);
+B.removeOverlap = mr;
+const H = B.empty;
 class xe {
   constructor(e) {
     this.members = e;
@@ -7891,7 +7891,7 @@ class xe {
   }
   forChild(e, t) {
     if (t.isLeaf)
-      return z.empty;
+      return B.empty;
     let n = [];
     for (let i = 0; i < this.members.length; i++) {
       let s = this.members[i].forChild(e, t);
@@ -7931,7 +7931,7 @@ class xe {
       case 1:
         return e[0];
       default:
-        return new xe(e.every((t) => t instanceof z) ? e : e.reduce((t, n) => t.concat(n instanceof z ? n : n.members), []));
+        return new xe(e.every((t) => t instanceof B) ? e : e.reduce((t, n) => t.concat(n instanceof B ? n : n.members), []));
     }
   }
   forEachSet(e) {
@@ -7986,7 +7986,7 @@ function Ha(r, e, t, n, i, s, o) {
       l.splice(h, 0, u.children[d], u.children[d + 1], u.children[d + 2]);
     }
   }
-  return new z(e.sort($e), l);
+  return new B(e.sort($e), l);
 }
 function Ys(r, e) {
   if (!e || !r.length)
@@ -7994,7 +7994,7 @@ function Ys(r, e) {
   let t = [];
   for (let n = 0; n < r.length; n++) {
     let i = r[n];
-    t.push(new ne(i.from + e, i.to + e, i.type));
+    t.push(new re(i.from + e, i.to + e, i.type));
   }
   return t;
 }
@@ -8038,7 +8038,7 @@ function Gt(r, e, t, n) {
   let o = Ys(s ? Zs(r) : r, -t).sort($e);
   for (let l = 0; l < o.length; l++)
     o[l].type.valid(e, o[l]) || (n.onRemove && n.onRemove(o[l].spec), o.splice(l--, 1));
-  return o.length || i.length ? new z(o, i) : H;
+  return o.length || i.length ? new B(o, i) : H;
 }
 function $e(r, e) {
   return r.from - e.from || r.to - e.to;
@@ -8071,7 +8071,7 @@ function Tn(r) {
   return r.someProp("decorations", (t) => {
     let n = t(r.state);
     n && n != H && e.push(n);
-  }), r.cursorWrapper && e.push(z.create(r.state.doc, [r.cursorWrapper.deco])), xe.from(e);
+  }), r.cursorWrapper && e.push(B.create(r.state.doc, [r.cursorWrapper.deco])), xe.from(e);
 }
 const qa = {
   childList: !0,
@@ -8140,7 +8140,7 @@ class _a {
   onSelectionChange() {
     if (li(this.view)) {
       if (this.suppressingSelectionUpdates)
-        return me(this.view);
+        return ge(this.view);
       if (G && Ee <= 11 && !this.view.state.selection.empty) {
         let e = this.view.domSelectionRange();
         if (e.focusNode && We(e.focusNode, e.focusOffset, e.anchorNode, e.anchorOffset))
@@ -8188,7 +8188,7 @@ class _a {
         let d = this.registerMutation(t[u], a);
         d && (s = s < 0 ? d.from : Math.min(d.from, s), o = o < 0 ? d.to : Math.max(d.to, o), d.typeOver && (l = !0));
       }
-    if (se && a.length) {
+    if (oe && a.length) {
       let u = a.filter((d) => d.nodeName == "BR");
       if (u.length == 2) {
         let [d, h] = u;
@@ -8202,7 +8202,7 @@ class _a {
       }
     }
     let c = null;
-    s < 0 && i && e.input.lastFocus > Date.now() - 200 && Math.max(e.input.lastTouch, e.input.lastClick.time) < Date.now() - 300 && sn(n) && (c = ar(e)) && c.eq(O.near(e.state.doc.resolve(0), 1)) ? (e.input.lastFocus = 0, me(e), this.currentSelection.set(n), e.scrollToSelection()) : (s > -1 || i) && (s > -1 && (e.docView.markDirty(s, o), Ga(e)), this.handleDOMChange(s, o, l, a), e.docView && e.docView.dirty ? e.updateState(e.state) : this.currentSelection.eq(n) || me(e), this.currentSelection.set(n));
+    s < 0 && i && e.input.lastFocus > Date.now() - 200 && Math.max(e.input.lastTouch, e.input.lastClick.time) < Date.now() - 300 && sn(n) && (c = ar(e)) && c.eq(O.near(e.state.doc.resolve(0), 1)) ? (e.input.lastFocus = 0, ge(e), this.currentSelection.set(n), e.scrollToSelection()) : (s > -1 || i) && (s > -1 && (e.docView.markDirty(s, o), Ga(e)), this.handleDOMChange(s, o, l, a), e.docView && e.docView.dirty ? e.updateState(e.state) : this.currentSelection.eq(n) || ge(e), this.currentSelection.set(n));
   }
   registerMutation(e, t) {
     if (t.indexOf(e.target) > -1)
@@ -8224,7 +8224,7 @@ class _a {
           let { previousSibling: d, nextSibling: h } = e.addedNodes[u];
           (!d || Array.prototype.indexOf.call(e.addedNodes, d) < 0) && (i = d), (!h || Array.prototype.indexOf.call(e.addedNodes, h) < 0) && (s = h);
         }
-      let o = i && i.parentNode == e.target ? j(i) + 1 : 0, l = n.localPosFromDOM(e.target, o, -1), a = s && s.parentNode == e.target ? j(s) : e.target.childNodes.length, c = n.localPosFromDOM(e.target, a, 1);
+      let o = i && i.parentNode == e.target ? V(i) + 1 : 0, l = n.localPosFromDOM(e.target, o, -1), a = s && s.parentNode == e.target ? V(s) : e.target.childNodes.length, c = n.localPosFromDOM(e.target, a, 1);
       return { from: l, to: c };
     } else return e.type == "attributes" ? { from: n.posAtStart - n.border, to: n.posAtEnd + n.border } : (this.lastChangedTextNode = e.target, {
       from: n.posAtStart,
@@ -8240,7 +8240,7 @@ class _a {
 let gi = /* @__PURE__ */ new WeakMap(), yi = !1;
 function Ga(r) {
   if (!gi.has(r) && (gi.set(r, null), ["normal", "nowrap", "pre-line"].indexOf(getComputedStyle(r.dom).whiteSpace) !== -1)) {
-    if (r.requiresGeckoHackNode = se, yi)
+    if (r.requiresGeckoHackNode = oe, yi)
       return;
     console.warn("ProseMirror expects the CSS white-space property to be set, preferably to 'pre-wrap'. It is recommended to load style/prosemirror.css from the prosemirror-view package."), yi = !0;
   }
@@ -8316,12 +8316,12 @@ const ec = /^(a|abbr|acronym|b|bd[io]|big|br|button|cite|code|data(list)?|del|df
 function tc(r, e, t, n, i) {
   let s = r.input.compositionPendingChanges || (r.composing ? r.input.compositionID : 0);
   if (r.input.compositionPendingChanges = 0, e < 0) {
-    let T = r.input.lastSelectionTime > Date.now() - 50 ? r.input.lastSelectionOrigin : null, ge = ar(r, T);
-    if (ge && !r.state.selection.eq(ge)) {
-      if (J && fe && r.input.lastKeyCode === 13 && Date.now() - 100 < r.input.lastKeyCodeTime && r.someProp("handleKeyDown", (Ao) => Ao(r, De(13, "Enter"))))
+    let E = r.input.lastSelectionTime > Date.now() - 50 ? r.input.lastSelectionOrigin : null, ee = ar(r, E);
+    if (ee && !r.state.selection.eq(ee)) {
+      if (J && pe && r.input.lastKeyCode === 13 && Date.now() - 100 < r.input.lastKeyCodeTime && r.someProp("handleKeyDown", (Ao) => Ao(r, De(13, "Enter"))))
         return;
-      let Ot = r.state.tr.setSelection(ge);
-      T == "pointer" ? Ot.setMeta("pointer", !0) : T == "key" && Ot.scrollIntoView(), s && Ot.setMeta("composition", s), r.dispatch(Ot);
+      let Ot = r.state.tr.setSelection(ee);
+      E == "pointer" ? Ot.setMeta("pointer", !0) : E == "key" && Ot.scrollIntoView(), s && Ot.setMeta("composition", s), r.dispatch(Ot);
     }
     return;
   }
@@ -8330,59 +8330,59 @@ function tc(r, e, t, n, i) {
   let a = r.state.selection, c = Za(r, e, t), u = r.state.doc, d = u.slice(c.from, c.to), h, f;
   r.input.lastKeyCode === 8 && Date.now() - 100 < r.input.lastKeyCodeTime ? (h = r.state.selection.to, f = "end") : (h = r.state.selection.from, f = "start"), r.input.lastKeyCode = null;
   let p = ic(d.content, c.doc.content, c.from, h, f);
-  if (p && r.input.domChangeCount++, (rt && r.input.lastIOSEnter > Date.now() - 225 || fe) && i.some((T) => T.nodeType == 1 && !ec.test(T.nodeName)) && (!p || p.endA >= p.endB) && r.someProp("handleKeyDown", (T) => T(r, De(13, "Enter")))) {
+  if (p && r.input.domChangeCount++, (rt && r.input.lastIOSEnter > Date.now() - 225 || pe) && i.some((E) => E.nodeType == 1 && !ec.test(E.nodeName)) && (!p || p.endA >= p.endB) && r.someProp("handleKeyDown", (E) => E(r, De(13, "Enter")))) {
     r.input.lastIOSEnter = 0;
     return;
   }
   if (!p)
-    if (n && a instanceof E && !a.empty && a.$head.sameParent(a.$anchor) && !r.composing && !(c.sel && c.sel.anchor != c.sel.head))
+    if (n && a instanceof T && !a.empty && a.$head.sameParent(a.$anchor) && !r.composing && !(c.sel && c.sel.anchor != c.sel.head))
       p = { start: a.from, endA: a.to, endB: a.to };
     else {
       if (c.sel) {
-        let T = ki(r, r.state.doc, c.sel);
-        if (T && !T.eq(r.state.selection)) {
-          let ge = r.state.tr.setSelection(T);
-          s && ge.setMeta("composition", s), r.dispatch(ge);
+        let E = ki(r, r.state.doc, c.sel);
+        if (E && !E.eq(r.state.selection)) {
+          let ee = r.state.tr.setSelection(E);
+          s && ee.setMeta("composition", s), r.dispatch(ee);
         }
       }
       return;
     }
-  r.state.selection.from < r.state.selection.to && p.start == p.endB && r.state.selection instanceof E && (p.start > r.state.selection.from && p.start <= r.state.selection.from + 2 && r.state.selection.from >= c.from ? p.start = r.state.selection.from : p.endA < r.state.selection.to && p.endA >= r.state.selection.to - 2 && r.state.selection.to <= c.to && (p.endB += r.state.selection.to - p.endA, p.endA = r.state.selection.to)), G && Ee <= 11 && p.endB == p.start + 1 && p.endA == p.start && p.start > c.from && c.doc.textBetween(p.start - c.from - 1, p.start - c.from + 1) == "  " && (p.start--, p.endA--, p.endB--);
+  r.state.selection.from < r.state.selection.to && p.start == p.endB && r.state.selection instanceof T && (p.start > r.state.selection.from && p.start <= r.state.selection.from + 2 && r.state.selection.from >= c.from ? p.start = r.state.selection.from : p.endA < r.state.selection.to && p.endA >= r.state.selection.to - 2 && r.state.selection.to <= c.to && (p.endB += r.state.selection.to - p.endA, p.endA = r.state.selection.to)), G && Ee <= 11 && p.endB == p.start + 1 && p.endA == p.start && p.start > c.from && c.doc.textBetween(p.start - c.from - 1, p.start - c.from + 1) == "  " && (p.start--, p.endA--, p.endB--);
   let m = c.doc.resolveNoCache(p.start - c.from), g = c.doc.resolveNoCache(p.endB - c.from), y = u.resolve(p.start), S = m.sameParent(g) && m.parent.inlineContent && y.end() >= p.endA, w;
-  if ((rt && r.input.lastIOSEnter > Date.now() - 225 && (!S || i.some((T) => T.nodeName == "DIV" || T.nodeName == "P")) || !S && m.pos < c.doc.content.size && (!m.sameParent(g) || !m.parent.inlineContent) && (w = O.findFrom(c.doc.resolve(m.pos + 1), 1, !0)) && w.head > m.pos) && r.someProp("handleKeyDown", (T) => T(r, De(13, "Enter")))) {
+  if ((rt && r.input.lastIOSEnter > Date.now() - 225 && (!S || i.some((E) => E.nodeName == "DIV" || E.nodeName == "P")) || !S && m.pos < c.doc.content.size && (!m.sameParent(g) || !m.parent.inlineContent) && (w = O.findFrom(c.doc.resolve(m.pos + 1), 1, !0)) && w.head > m.pos) && r.someProp("handleKeyDown", (E) => E(r, De(13, "Enter")))) {
     r.input.lastIOSEnter = 0;
     return;
   }
-  if (r.state.selection.anchor > p.start && rc(u, p.start, p.endA, m, g) && r.someProp("handleKeyDown", (T) => T(r, De(8, "Backspace")))) {
-    fe && J && r.domObserver.suppressSelectionUpdates();
+  if (r.state.selection.anchor > p.start && rc(u, p.start, p.endA, m, g) && r.someProp("handleKeyDown", (E) => E(r, De(8, "Backspace")))) {
+    pe && J && r.domObserver.suppressSelectionUpdates();
     return;
   }
-  J && p.endB == p.start && (r.input.lastChromeDelete = Date.now()), fe && !S && m.start() != g.start() && g.parentOffset == 0 && m.depth == g.depth && c.sel && c.sel.anchor == c.sel.head && c.sel.head == p.endA && (p.endB -= 2, g = c.doc.resolveNoCache(p.endB - c.from), setTimeout(() => {
-    r.someProp("handleKeyDown", function(T) {
-      return T(r, De(13, "Enter"));
+  J && p.endB == p.start && (r.input.lastChromeDelete = Date.now()), pe && !S && m.start() != g.start() && g.parentOffset == 0 && m.depth == g.depth && c.sel && c.sel.anchor == c.sel.head && c.sel.head == p.endA && (p.endB -= 2, g = c.doc.resolveNoCache(p.endB - c.from), setTimeout(() => {
+    r.someProp("handleKeyDown", function(E) {
+      return E(r, De(13, "Enter"));
     });
   }, 20));
-  let v = p.start, A = p.endA, M, P, I;
+  let v = p.start, A = p.endA, M, I, W;
   if (S) {
     if (m.pos == g.pos)
-      G && Ee <= 11 && m.parentOffset == 0 && (r.domObserver.suppressSelectionUpdates(), setTimeout(() => me(r), 20)), M = r.state.tr.delete(v, A), P = u.resolve(p.start).marksAcross(u.resolve(p.endA));
+      G && Ee <= 11 && m.parentOffset == 0 && (r.domObserver.suppressSelectionUpdates(), setTimeout(() => ge(r), 20)), M = r.state.tr.delete(v, A), I = u.resolve(p.start).marksAcross(u.resolve(p.endA));
     else if (
       // Adding or removing a mark
-      p.endA == p.endB && (I = nc(m.parent.content.cut(m.parentOffset, g.parentOffset), y.parent.content.cut(y.parentOffset, p.endA - y.start())))
+      p.endA == p.endB && (W = nc(m.parent.content.cut(m.parentOffset, g.parentOffset), y.parent.content.cut(y.parentOffset, p.endA - y.start())))
     )
-      M = r.state.tr, I.type == "add" ? M.addMark(v, A, I.mark) : M.removeMark(v, A, I.mark);
+      M = r.state.tr, W.type == "add" ? M.addMark(v, A, W.mark) : M.removeMark(v, A, W.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 (r.someProp("handleTextInput", (ge) => ge(r, v, A, T)))
+      let E = m.parent.textBetween(m.parentOffset, g.parentOffset);
+      if (r.someProp("handleTextInput", (ee) => ee(r, v, A, E)))
         return;
-      M = r.state.tr.insertText(T, v, A);
+      M = r.state.tr.insertText(E, v, A);
     }
   }
   if (M || (M = r.state.tr.replace(v, A, c.doc.slice(p.start - c.from, p.endB - c.from))), c.sel) {
-    let T = ki(r, M.doc, c.sel);
-    T && !(J && r.composing && T.empty && (p.start != p.endB || r.input.lastChromeDelete < Date.now() - 100) && (T.head == v || T.head == M.mapping.map(A) - 1) || G && T.empty && T.head == v) && M.setSelection(T);
+    let E = ki(r, M.doc, c.sel);
+    E && !(J && r.composing && E.empty && (p.start != p.endB || r.input.lastChromeDelete < Date.now() - 100) && (E.head == v || E.head == M.mapping.map(A) - 1) || G && E.empty && E.head == v) && M.setSelection(E);
   }
-  P && M.ensureMarks(P), s && M.setMeta("composition", s), r.dispatch(M.scrollIntoView());
+  I && M.ensureMarks(I), s && M.setMeta("composition", s), r.dispatch(M.scrollIntoView());
 }
 function ki(r, e, t) {
   return Math.max(t.anchor, t.head) > e.content.size ? null : cr(r, e.resolve(t.anchor), e.resolve(t.head));
@@ -8539,7 +8539,7 @@ class sc {
         let p = J ? this.trackWrites = this.domSelectionRange().focusNode : null;
         this.composing && (this.input.compositionNode = Fa(this)), (s || !this.docView.update(e.doc, c, a, this)) && (this.docView.updateOuterDeco(c), this.docView.destroy(), this.docView = ti(e.doc, c, a, this.dom, this)), p && !this.trackWrites && (f = !0);
       }
-      f || !(this.input.mouseDown && this.domObserver.currentSelection.eq(this.domSelectionRange()) && aa(this)) ? me(this, f) : (Rs(this, e.selection), this.domObserver.setCurSelection()), this.domObserver.start();
+      f || !(this.input.mouseDown && this.domObserver.currentSelection.eq(this.domSelectionRange()) && aa(this)) ? ge(this, f) : (Rs(this, e.selection), this.domObserver.setCurSelection()), this.domObserver.start();
     }
     this.updatePluginViews(i), !((n = this.dragging) === null || n === void 0) && n.node && !i.doc.eq(e.doc) && this.updateDraggedNode(this.dragging, i), u == "reset" ? this.dom.scrollTop = 0 : u == "to selection" ? this.scrollToSelection() : h && $l(h);
   }
@@ -8628,7 +8628,7 @@ class sc {
   Focus the editor.
   */
   focus() {
-    this.domObserver.stop(), this.editable && Vl(this.dom), me(this), this.domObserver.start();
+    this.domObserver.stop(), this.editable && Vl(this.dom), ge(this), this.domObserver.start();
   }
   /**
   Get the document root in which the editor exists. This will
@@ -8808,12 +8808,12 @@ function Si(r) {
     if (typeof t == "function" && (t = t(r.state)), t)
       for (let n in t)
         n == "class" ? e.class += " " + t[n] : n == "style" ? e.style = (e.style ? e.style + ";" : "") + t[n] : !e[n] && n != "contenteditable" && n != "nodeName" && (e[n] = String(t[n]));
-  }), e.translate || (e.translate = "no"), [ne.node(0, r.state.doc.content.size, e)];
+  }), e.translate || (e.translate = "no"), [re.node(0, r.state.doc.content.size, e)];
 }
 function Ci(r) {
   if (r.markCursor) {
     let e = document.createElement("img");
-    e.className = "ProseMirror-separator", e.setAttribute("mark-placeholder", "true"), e.setAttribute("alt", ""), r.cursorWrapper = { dom: e, deco: ne.widget(r.state.selection.from, e, { raw: !0, marks: r.markCursor }) };
+    e.className = "ProseMirror-separator", e.setAttribute("mark-placeholder", "true"), e.setAttribute("alt", ""), r.cursorWrapper = { dom: e, deco: re.widget(r.state.selection.from, e, { raw: !0, marks: r.markCursor }) };
   } else
     r.cursorWrapper = null;
 }
@@ -8926,10 +8926,10 @@ var Ne = {
   221: "}",
   222: '"'
 }, ac = typeof navigator < "u" && /Mac/.test(navigator.platform), cc = typeof navigator < "u" && /MSIE \d|Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(navigator.userAgent);
-for (var W = 0; W < 10; W++) Ne[48 + W] = Ne[96 + W] = String(W);
-for (var W = 1; W <= 24; W++) Ne[W + 111] = "F" + W;
-for (var W = 65; W <= 90; W++)
-  Ne[W] = String.fromCharCode(W + 32), Yt[W] = String.fromCharCode(W);
+for (var j = 0; j < 10; j++) Ne[48 + j] = Ne[96 + j] = String(j);
+for (var j = 1; j <= 24; j++) Ne[j + 111] = "F" + j;
+for (var j = 65; j <= 90; j++)
+  Ne[j] = String.fromCharCode(j + 32), Yt[j] = String.fromCharCode(j);
 for (var Nn in Ne) Yt.hasOwnProperty(Nn) || (Yt[Nn] = Ne[Nn]);
 function uc(r) {
   var e = ac && r.metaKey && r.shiftKey && !r.ctrlKey && !r.altKey || cc && r.shiftKey && r.key && r.key.length == 1 || r.key == "Unidentified", t = !e && r.key || (r.shiftKey ? Yt : Ne)[r.keyCode] || r.key || "Unidentified";
@@ -9054,11 +9054,11 @@ function to(r, e, t) {
     l = u;
   }
   let c = nn(r.doc, s, a, k.empty);
-  if (!c || c.from != s || c instanceof R && c.slice.size >= a - s)
+  if (!c || c.from != s || c instanceof P && c.slice.size >= a - s)
     return !1;
   if (t) {
     let u = r.tr.step(c);
-    u.setSelection(E.create(u.doc, s)), t(u.scrollIntoView());
+    u.setSelection(T.create(u.doc, s)), t(u.scrollIntoView());
   }
   return !0;
 }
@@ -9200,7 +9200,7 @@ const Sc = (r, e) => {
     return !1;
   if (e) {
     let o = (!n.parentOffset && i.index() < i.parent.childCount ? n : i).pos, l = r.tr.insert(o, s.createAndFill());
-    l.setSelection(E.create(l.doc, o + 1)), e(l.scrollIntoView());
+    l.setSelection(T.create(l.doc, o + 1)), e(l.scrollIntoView());
   }
   return !0;
 }, ao = (r, e) => {
@@ -9209,7 +9209,7 @@ const Sc = (r, e) => {
     return !1;
   if (t.depth > 1 && t.after() != t.end(-1)) {
     let s = t.before();
-    if (pe(r.doc, s))
+    if (me(r.doc, s))
       return e && e(r.tr.split(s).scrollIntoView()), !0;
   }
   let n = t.blockRange(), i = n && st(n);
@@ -9219,7 +9219,7 @@ function Cc(r) {
   return (e, t) => {
     let { $from: n, $to: i } = e.selection;
     if (e.selection instanceof C && e.selection.node.isBlock)
-      return !n.parentOffset || !pe(e.doc, n.pos) ? !1 : (t && t(e.tr.split(n.pos).scrollIntoView()), !0);
+      return !n.parentOffset || !me(e.doc, n.pos) ? !1 : (t && t(e.tr.split(n.pos).scrollIntoView()), !0);
     if (!n.depth)
       return !1;
     let s = [], o, l, a = !1, c = !1;
@@ -9233,9 +9233,9 @@ function Cc(r) {
         s.unshift(null);
       }
     let u = e.tr;
-    (e.selection instanceof E || e.selection instanceof Z) && u.deleteSelection();
-    let d = u.mapping.map(n.pos), h = pe(u.doc, d, s.length, s);
-    if (h || (s[0] = l ? { type: l } : null, h = pe(u.doc, d, s.length, s)), !h)
+    (e.selection instanceof T || e.selection instanceof Z) && u.deleteSelection();
+    let d = u.mapping.map(n.pos), h = me(u.doc, d, s.length, s);
+    if (h || (s[0] = l ? { type: l } : null, h = me(u.doc, d, s.length, s)), !h)
       return !1;
     if (u.split(d, s.length, s), !a && c && n.node(o).type != l) {
       let f = u.mapping.map(n.before(o)), p = u.doc.resolve(f);
@@ -9263,7 +9263,7 @@ function co(r, e, t, n) {
       for (let y = o.length - 1; y >= 0; y--)
         p = b.from(o[y].create(null, p));
       p = b.from(i.copy(p));
-      let m = r.tr.step(new F(e.pos - 1, f, e.pos, f, new k(p, 1, 0), o.length, !0)), g = m.doc.resolve(f + 2 * o.length);
+      let m = r.tr.step(new z(e.pos - 1, f, e.pos, f, new k(p, 1, 0), o.length, !0)), g = m.doc.resolve(f + 2 * o.length);
       g.nodeAfter && g.nodeAfter.type == i.type && qe(m.doc, g.pos) && m.join(g.pos), t(m.scrollIntoView());
     }
     return !0;
@@ -9283,7 +9283,7 @@ function co(r, e, t, n) {
         let y = b.empty;
         for (let w = p.length - 1; w >= 0; w--)
           y = b.from(p[w].copy(y));
-        let S = r.tr.step(new F(e.pos - p.length, e.pos + s.nodeSize, e.pos + g, e.pos + s.nodeSize - g, new k(y, p.length, 0), 0, !0));
+        let S = r.tr.step(new z(e.pos - p.length, e.pos + s.nodeSize, e.pos + g, e.pos + s.nodeSize - g, new k(y, p.length, 0), 0, !0));
         t(S.scrollIntoView());
       }
       return !0;
@@ -9299,7 +9299,7 @@ function uo(r) {
         return !1;
       s--;
     }
-    return i.node(s).isTextblock ? (t && t(e.tr.setSelection(E.create(e.doc, r < 0 ? i.start(s) : i.end(s)))), !0) : !1;
+    return i.node(s).isTextblock ? (t && t(e.tr.setSelection(T.create(e.doc, r < 0 ? i.start(s) : i.end(s)))), !0) : !1;
   };
 }
 const Tc = uo(-1), Oc = uo(1);
@@ -9375,13 +9375,13 @@ function Dc(r, e, t, n, i) {
   let s = b.empty;
   for (let u = t.length - 1; u >= 0; u--)
     s = b.from(t[u].type.create(t[u].attrs, s));
-  r.step(new F(e.start - (n ? 2 : 0), e.end, e.start, e.end, new k(s, 0, 0), t.length, !0));
+  r.step(new z(e.start - (n ? 2 : 0), e.end, e.start, e.end, new k(s, 0, 0), t.length, !0));
   let o = 0;
   for (let u = 0; u < t.length; u++)
     t[u].type == i && (o = u + 1);
   let l = t.length - o, a = e.start + t.length - (n ? 2 : 0), c = e.parent;
   for (let u = e.startIndex, d = e.endIndex, h = !0; u < d; u++, h = !1)
-    !h && pe(r.doc, a, l) && (r.split(a, l), a += 2 * l), a += c.child(u).nodeSize;
+    !h && me(r.doc, a, l) && (r.split(a, l), a += 2 * l), a += c.child(u).nodeSize;
   return r;
 }
 function Ic(r) {
@@ -9392,7 +9392,7 @@ function Ic(r) {
 }
 function Pc(r, e, t, n) {
   let i = r.tr, s = n.end, o = n.$to.end(n.depth);
-  s < o && (i.step(new F(s - 1, o, s, o, new k(b.from(t.create(null, n.parent.copy())), 1, 0), 1, !0)), n = new Ht(i.doc.resolve(n.$from.pos), i.doc.resolve(o), n.depth));
+  s < o && (i.step(new z(s - 1, o, s, o, new k(b.from(t.create(null, n.parent.copy())), 1, 0), 1, !0)), n = new Ht(i.doc.resolve(n.$from.pos), i.doc.resolve(o), n.depth));
   const l = st(n);
   if (l == null)
     return !1;
@@ -9411,7 +9411,7 @@ function Rc(r, e, t) {
   if (!c.canReplace(u + (l ? 0 : 1), u + 1, o.content.append(a ? b.empty : b.from(i))))
     return !1;
   let d = s.pos, h = d + o.nodeSize;
-  return n.step(new F(d - (l ? 1 : 0), h + (a ? 1 : 0), d + 1, h - 1, new k((l ? b.empty : b.from(i.copy(b.empty))).append(a ? b.empty : b.from(i.copy(b.empty))), l ? 0 : 1, a ? 0 : 1), l ? 0 : 1)), e(n.scrollIntoView()), !0;
+  return n.step(new z(d - (l ? 1 : 0), h + (a ? 1 : 0), d + 1, h - 1, new k((l ? b.empty : b.from(i.copy(b.empty))).append(a ? b.empty : b.from(i.copy(b.empty))), l ? 0 : 1, a ? 0 : 1), l ? 0 : 1)), e(n.scrollIntoView()), !0;
 }
 function Bc(r) {
   return function(e, t) {
@@ -9426,7 +9426,7 @@ function Bc(r) {
       return !1;
     if (t) {
       let c = a.lastChild && a.lastChild.type == l.type, u = b.from(c ? r.create() : null), d = new k(b.from(r.create(null, b.from(l.type.create(null, u)))), c ? 3 : 1, 0), h = s.start, f = s.end;
-      t(e.tr.step(new F(h - (c ? 3 : 1), f, h, f, d, 1, !0)).scrollIntoView());
+      t(e.tr.step(new z(h - (c ? 3 : 1), f, h, f, d, 1, !0)).scrollIntoView());
     }
     return !0;
   };
@@ -9609,7 +9609,7 @@ function ho(r) {
     });
   }), e;
 }
-function $(r, e) {
+function L(r, e) {
   if (typeof r == "string") {
     if (!e.nodes[r])
       throw Error(`There is no node type named '${r}'. Maybe you forgot to add the extension?`);
@@ -9998,7 +9998,7 @@ function Uc(r) {
       const v = m + w.index + 1, A = v + w[0].length, M = {
         from: t.tr.mapping.map(v),
         to: t.tr.mapping.map(A)
-      }, P = s.handler({
+      }, I = s.handler({
         state: t,
         range: M,
         match: w,
@@ -10008,7 +10008,7 @@ function Uc(r) {
         pasteEvent: o,
         dropEvent: l
       });
-      d.push(P);
+      d.push(I);
     });
   }), d.every((f) => f !== null);
 }
@@ -10091,13 +10091,13 @@ function Gc(r) {
       if (S) {
         let { text: A } = y;
         typeof A == "string" ? A = A : A = Sr(b.from(A), f.schema);
-        const { from: M } = y, P = M + A.length, I = _c(A);
+        const { from: M } = y, I = M + A.length, W = _c(A);
         return a({
           rule: u,
           state: f,
           from: M,
-          to: { b: P },
-          pasteEvt: I
+          to: { b: I },
+          pasteEvt: W
         });
       }
       const w = h.doc.content.findDiffStart(f.doc.content), v = h.doc.content.findDiffEnd(f.doc.content);
@@ -10237,7 +10237,7 @@ class Xe {
         options: n.options,
         storage: n.storage,
         editor: e,
-        type: $(n.name, this.schema)
+        type: L(n.name, this.schema)
       }, o = x(n, "addNodeView", s);
       if (!o)
         return [];
@@ -10348,7 +10348,7 @@ const Xc = Y.create({
   addProseMirrorPlugins() {
     return [
       new Q({
-        key: new oe("clipboardTextSerializer"),
+        key: new le("clipboardTextSerializer"),
         props: {
           clipboardTextSerializer: () => {
             const { editor: r } = this, { state: e, schema: t } = r, { doc: n, selection: i } = e, { ranges: s } = i, o = Math.min(...s.map((u) => u.$from.pos)), l = Math.max(...s.map((u) => u.$to.pos)), a = mo(t);
@@ -10385,7 +10385,7 @@ const Xc = Y.create({
   const { state: i } = t, s = i.doc.slice(r.from, r.to);
   n.deleteRange(r.from, r.to);
   const o = n.mapping.map(e);
-  return n.insert(o, s.content), n.setSelection(new E(n.doc.resolve(o - 1))), !0;
+  return n.insert(o, s.content), n.setSelection(new T(n.doc.resolve(o - 1))), !0;
 }, iu = () => ({ tr: r, dispatch: e }) => {
   const { selection: t } = r, n = t.$anchor.node();
   if (n.content.size > 0)
@@ -10401,7 +10401,7 @@ const Xc = Y.create({
     }
   return !1;
 }, su = (r) => ({ tr: e, state: t, dispatch: n }) => {
-  const i = $(r, t.schema), s = e.selection.$anchor;
+  const i = L(r, t.schema), s = e.selection.$anchor;
   for (let o = s.depth; o > 0; o -= 1)
     if (s.node(o).type === i) {
       if (n) {
@@ -10459,7 +10459,7 @@ const uu = (r, e = {}) => ({ tr: t, state: n, dispatch: i }) => {
   if (i) {
     const d = wr(a, s, e);
     if (d && d.from <= c && d.to >= u) {
-      const h = E.create(o, d.from, d.to);
+      const h = T.create(o, d.from, d.to);
       t.setSelection(h);
     }
   }
@@ -10472,7 +10472,7 @@ const uu = (r, e = {}) => ({ tr: t, state: n, dispatch: i }) => {
   return !1;
 };
 function yo(r) {
-  return r instanceof E;
+  return r instanceof T;
 }
 function Be(r = 0, e = 0, t = 0) {
   return Math.min(Math.max(r, e), t);
@@ -10486,7 +10486,7 @@ function bo(r, e = null) {
   if (e === "end")
     return n;
   const i = t.from, s = n.to;
-  return e === "all" ? E.create(r, Be(0, i, s), Be(r.content.size, i, s)) : E.create(r, Be(e, i, s), Be(e, i, s));
+  return e === "all" ? T.create(r, Be(0, i, s), Be(r.content.size, i, s)) : T.create(r, Be(e, i, s), Be(e, i, s));
 }
 function hu() {
   return navigator.platform === "Android" || /android/i.test(navigator.userAgent);
@@ -10583,7 +10583,7 @@ function gu(r, e, t) {
   if (n < e)
     return;
   const i = r.steps[n];
-  if (!(i instanceof R || i instanceof F))
+  if (!(i instanceof P || i instanceof z))
     return;
   const s = r.mapping.maps[n];
   let o = 0;
@@ -10700,7 +10700,7 @@ const Nu = (r) => ({ editor: e, view: t, tr: n, dispatch: i }) => {
   }), !0;
 };
 function Ct(r, e, t = {}) {
-  const { from: n, to: i, empty: s } = r.selection, o = e ? $(e, r.schema) : null, l = [];
+  const { from: n, to: i, empty: s } = r.selection, o = e ? L(e, r.schema) : null, l = [];
   r.doc.nodesBetween(n, i, (d, h) => {
     if (d.isText)
       return;
@@ -10715,10 +10715,10 @@ function Ct(r, e, t = {}) {
   return s ? !!c.length : c.reduce((d, h) => d + h.to - h.from, 0) >= a;
 }
 const Au = (r, e = {}) => ({ state: t, dispatch: n }) => {
-  const i = $(r, t.schema);
+  const i = L(r, t.schema);
   return Ct(t, i, e) ? xc(t, n) : !1;
 }, vu = () => ({ state: r, dispatch: e }) => ao(r, e), Du = (r) => ({ state: e, dispatch: t }) => {
-  const n = $(r, e.schema);
+  const n = L(r, e.schema);
   return Ic(n)(e, t);
 }, Iu = () => ({ state: r, dispatch: e }) => oo(r, e);
 function hn(r, e) {
@@ -10731,7 +10731,7 @@ function Di(r, e) {
 const Pu = (r, e) => ({ tr: t, state: n, dispatch: i }) => {
   let s = null, o = null;
   const l = hn(typeof r == "string" ? r : r.name, n.schema);
-  return l ? (l === "node" && (s = $(r, n.schema)), l === "mark" && (o = ve(r, n.schema)), i && t.selection.ranges.forEach((a) => {
+  return l ? (l === "node" && (s = L(r, n.schema)), l === "mark" && (o = ve(r, n.schema)), i && t.selection.ranges.forEach((a) => {
     n.doc.nodesBetween(a.$from.pos, a.$to.pos, (c, u) => {
       s && s === c.type && t.setNodeMarkup(u, void 0, Di(c.attrs, e)), o && c.marks.length && c.marks.forEach((d) => {
         o === d.type && t.addMark(u, u + c.nodeSize, o.create(Di(d.attrs, e)));
@@ -10805,7 +10805,7 @@ function Hu(r, e) {
   return po(r, t, e);
 }
 function Ju(r, e) {
-  const t = $(e, r.schema), { from: n, to: i } = r.selection, s = [];
+  const t = L(e, r.schema), { from: n, to: i } = r.selection, s = [];
   r.doc.nodesBetween(n, i, (l) => {
     s.push(l);
   });
@@ -10930,7 +10930,7 @@ const _u = (r, e = {}) => ({ tr: t, state: n, dispatch: i }) => {
       });
   return Uu(n, t, a);
 }, Gu = (r, e) => ({ tr: t }) => (t.setMeta(r, e), !0), Yu = (r, e = {}) => ({ state: t, dispatch: n, chain: i }) => {
-  const s = $(r, t.schema);
+  const s = L(r, t.schema);
   let o;
   return t.selection.$anchor.sameParent(t.selection.$head) && (o = t.selection.$anchor.parent.attrs), s.isTextblock ? i().command(({ commands: l }) => Ti(s, { ...o, ...e })(t) ? !0 : l.clearNodes()).command(({ state: l }) => Ti(s, { ...o, ...e })(l, n)).run() : (console.warn('[tiptap warn]: Currently "setNode()" only supports text block nodes.'), !1);
 }, Xu = (r) => ({ tr: e, dispatch: t }) => {
@@ -10941,12 +10941,12 @@ const _u = (r, e = {}) => ({ tr: t, state: n, dispatch: i }) => {
   return !0;
 }, Zu = (r) => ({ tr: e, dispatch: t }) => {
   if (t) {
-    const { doc: n } = e, { from: i, to: s } = typeof r == "number" ? { from: r, to: r } : r, o = E.atStart(n).from, l = E.atEnd(n).to, a = Be(i, o, l), c = Be(s, o, l), u = E.create(n, a, c);
+    const { doc: n } = e, { from: i, to: s } = typeof r == "number" ? { from: r, to: r } : r, o = T.atStart(n).from, l = T.atEnd(n).to, a = Be(i, o, l), c = Be(s, o, l), u = T.create(n, a, c);
     e.setSelection(u);
   }
   return !0;
 }, Qu = (r) => ({ state: e, dispatch: t }) => {
-  const n = $(r, e.schema);
+  const n = L(r, e.schema);
   return Bc(n)(e, t);
 };
 function Pi(r, e) {
@@ -10959,7 +10959,7 @@ function Pi(r, e) {
 const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, editor: i }) => {
   const { selection: s, doc: o } = e, { $from: l, $to: a } = s, c = i.extensionManager.attributes, u = Ft(c, l.node().type.name, l.node().attrs);
   if (s instanceof C && s.node.isBlock)
-    return !l.parentOffset || !pe(o, l.pos) ? !1 : (n && (r && Pi(t, i.extensionManager.splittableMarks), e.split(l.pos).scrollIntoView()), !0);
+    return !l.parentOffset || !me(o, l.pos) ? !1 : (n && (r && Pi(t, i.extensionManager.splittableMarks), e.split(l.pos).scrollIntoView()), !0);
   if (!l.parent.isBlock)
     return !1;
   const d = a.parentOffset === a.parent.content.size, h = l.depth === 0 ? void 0 : Wu(l.node(-1).contentMatchAt(l.indexAfter(-1)));
@@ -10968,14 +10968,14 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
       type: h,
       attrs: u
     }
-  ] : void 0, p = pe(e.doc, e.mapping.map(l.pos), 1, f);
-  if (!f && !p && pe(e.doc, e.mapping.map(l.pos), 1, h ? [{ type: h }] : void 0) && (p = !0, f = h ? [
+  ] : void 0, p = me(e.doc, e.mapping.map(l.pos), 1, f);
+  if (!f && !p && me(e.doc, e.mapping.map(l.pos), 1, h ? [{ type: h }] : void 0) && (p = !0, f = h ? [
     {
       type: h,
       attrs: u
     }
   ] : void 0), n) {
-    if (p && (s instanceof E && e.deleteSelection(), e.split(e.mapping.map(l.pos), 1, f), h && !d && !l.parentOffset && l.parent.type !== h)) {
+    if (p && (s instanceof T && e.deleteSelection(), e.split(e.mapping.map(l.pos), 1, f), h && !d && !l.parentOffset && l.parent.type !== h)) {
       const m = e.mapping.map(l.before()), g = e.doc.resolve(m);
       l.node(-1).canReplaceWith(g.index(), g.index() + 1, h) && e.setNodeMarkup(e.mapping.map(l.before()), h);
     }
@@ -10984,7 +10984,7 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
   return p;
 }, td = (r, e = {}) => ({ tr: t, state: n, dispatch: i, editor: s }) => {
   var o;
-  const l = $(r, n.schema), { $from: a, $to: c } = n.selection, u = n.selection.node;
+  const l = L(r, n.schema), { $from: a, $to: c } = n.selection, u = n.selection.node;
   if (u && u.isBlock || a.depth < 2 || !a.sameParent(c))
     return !1;
   const d = a.node(-1);
@@ -10997,8 +10997,8 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
     if (i) {
       let y = b.empty;
       const S = a.index(-1) ? 1 : a.index(-2) ? 2 : 3;
-      for (let I = a.depth - S; I >= a.depth - 3; I -= 1)
-        y = b.from(a.node(I).copy(y));
+      for (let W = a.depth - S; W >= a.depth - 3; W -= 1)
+        y = b.from(a.node(W).copy(y));
       const w = a.indexAfter(-1) < a.node(-2).childCount ? 1 : a.indexAfter(-2) < a.node(-3).childCount ? 2 : 3, v = {
         ...Ft(h, a.node().type.name, a.node().attrs),
         ...e
@@ -11006,12 +11006,12 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
       y = y.append(b.from(l.createAndFill(null, A) || void 0));
       const M = a.before(a.depth - (S - 1));
       t.replace(M, a.after(-w), new k(y, 4 - S, 0));
-      let P = -1;
-      t.doc.nodesBetween(M, t.doc.content.size, (I, T) => {
-        if (P > -1)
+      let I = -1;
+      t.doc.nodesBetween(M, t.doc.content.size, (W, E) => {
+        if (I > -1)
           return !1;
-        I.isTextblock && I.content.size === 0 && (P = T + 1);
-      }), P > -1 && t.setSelection(E.near(t.doc.resolve(P))), t.scrollIntoView();
+        W.isTextblock && W.content.size === 0 && (I = E + 1);
+      }), I > -1 && t.setSelection(T.near(t.doc.resolve(I))), t.scrollIntoView();
     }
     return !0;
   }
@@ -11027,7 +11027,7 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
     { type: l, attrs: p },
     { type: f, attrs: m }
   ] : [{ type: l, attrs: p }];
-  if (!pe(t.doc, a.pos, 2))
+  if (!me(t.doc, a.pos, 2))
     return !1;
   if (i) {
     const { selection: y, storedMarks: S } = n, { splittableMarks: w } = s.extensionManager, v = S || y.$to.parentOffset && y.$from.marks();
@@ -11056,7 +11056,7 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
   const i = r.doc.nodeAt(n);
   return t.node.type === (i == null ? void 0 : i.type) && qe(r.doc, n) && r.join(n), !0;
 }, nd = (r, e, t, n = {}) => ({ editor: i, tr: s, state: o, dispatch: l, chain: a, commands: c, can: u }) => {
-  const { extensions: d, splittableMarks: h } = i.extensionManager, f = $(r, o.schema), p = $(e, o.schema), { selection: m, storedMarks: g } = o, { $from: y, $to: S } = m, w = y.blockRange(S), v = g || m.$to.parentOffset && m.$from.marks();
+  const { extensions: d, splittableMarks: h } = i.extensionManager, f = L(r, o.schema), p = L(e, o.schema), { selection: m, storedMarks: g } = o, { $from: y, $to: S } = m, w = y.blockRange(S), v = g || m.$to.parentOffset && m.$from.marks();
   if (!w)
     return !1;
   const A = Er((M) => Ii(M.type.name, d))(m);
@@ -11067,18 +11067,18 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
       return a().command(() => (s.setNodeMarkup(A.pos, f), !0)).command(() => Dn(s, f)).command(() => In(s, f)).run();
   }
   return !t || !v || !l ? a().command(() => u().wrapInList(f, n) ? !0 : c.clearNodes()).wrapInList(f, n).command(() => Dn(s, f)).command(() => In(s, f)).run() : a().command(() => {
-    const M = u().wrapInList(f, n), P = v.filter((I) => h.includes(I.type.name));
-    return s.ensureMarks(P), M ? !0 : c.clearNodes();
+    const M = u().wrapInList(f, n), I = v.filter((W) => h.includes(W.type.name));
+    return s.ensureMarks(I), M ? !0 : c.clearNodes();
   }).wrapInList(f, n).command(() => Dn(s, f)).command(() => In(s, f)).run();
 }, rd = (r, e = {}, t = {}) => ({ state: n, commands: i }) => {
   const { extendEmptyMarkRange: s = !1 } = t, o = ve(r, n.schema);
   return er(n, o, e) ? i.unsetMark(o, { extendEmptyMarkRange: s }) : i.setMark(o, e);
 }, id = (r, e, t = {}) => ({ state: n, commands: i }) => {
-  const s = $(r, n.schema), o = $(e, n.schema), l = Ct(n, s, t);
+  const s = L(r, n.schema), o = L(e, n.schema), l = Ct(n, s, t);
   let a;
   return n.selection.$anchor.sameParent(n.selection.$head) && (a = n.selection.$anchor.parent.attrs), l ? i.setNode(o, a) : i.setNode(s, { ...a, ...t });
 }, sd = (r, e = {}) => ({ state: t, commands: n }) => {
-  const i = $(r, t.schema);
+  const i = L(r, t.schema);
   return Ct(t, i, e) ? n.lift(i) : n.wrapIn(i, e);
 }, od = () => ({ state: r, dispatch: e }) => {
   const t = r.plugins;
@@ -11122,7 +11122,7 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
 }, cd = (r, e = {}) => ({ tr: t, state: n, dispatch: i }) => {
   let s = null, o = null;
   const l = hn(typeof r == "string" ? r : r.name, n.schema);
-  return l ? (l === "node" && (s = $(r, n.schema)), l === "mark" && (o = ve(r, n.schema)), i && t.selection.ranges.forEach((a) => {
+  return l ? (l === "node" && (s = L(r, n.schema)), l === "mark" && (o = ve(r, n.schema)), i && t.selection.ranges.forEach((a) => {
     const c = a.$from.pos, u = a.$to.pos;
     let d, h, f, p;
     t.selection.empty ? n.doc.nodesBetween(c, u, (m, g) => {
@@ -11151,10 +11151,10 @@ const ed = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
     }));
   }), !0) : !1;
 }, ud = (r, e = {}) => ({ state: t, dispatch: n }) => {
-  const i = $(r, t.schema);
+  const i = L(r, t.schema);
   return Nc(i, e)(t, n);
 }, dd = (r, e = {}) => ({ state: t, dispatch: n }) => {
-  const i = $(r, t.schema);
+  const i = L(r, t.schema);
   return Ac(i, e)(t, n);
 };
 var hd = /* @__PURE__ */ Object.freeze({
@@ -11230,7 +11230,7 @@ const fd = Y.create({
   addProseMirrorPlugins() {
     return [
       new Q({
-        key: new oe("tiptapDrop"),
+        key: new le("tiptapDrop"),
         props: {
           handleDrop: (r, e, t, n) => {
             this.editor.emit("drop", {
@@ -11249,14 +11249,14 @@ const fd = Y.create({
   addProseMirrorPlugins() {
     return [
       new Q({
-        key: new oe("editable"),
+        key: new le("editable"),
         props: {
           editable: () => this.editor.options.editable
         }
       })
     ];
   }
-}), gd = new oe("focusEvents"), yd = Y.create({
+}), gd = new le("focusEvents"), yd = Y.create({
   name: "focusEvents",
   addProseMirrorPlugins() {
     const { editor: r } = this;
@@ -11335,7 +11335,7 @@ const fd = Y.create({
       // This is an alternative to ProseMirror's `AllSelection`, which doesn’t work well
       // with many other commands.
       new Q({
-        key: new oe("clearDocument"),
+        key: new le("clearDocument"),
         appendTransaction: (r, e, t) => {
           if (r.some((m) => m.getMeta("composition")))
             return;
@@ -11363,7 +11363,7 @@ const fd = Y.create({
   addProseMirrorPlugins() {
     return [
       new Q({
-        key: new oe("tiptapPaste"),
+        key: new le("tiptapPaste"),
         props: {
           handlePaste: (r, e, t) => {
             this.editor.emit("paste", {
@@ -11381,7 +11381,7 @@ const fd = Y.create({
   addProseMirrorPlugins() {
     return [
       new Q({
-        key: new oe("tabindex"),
+        key: new le("tabindex"),
         props: {
           attributes: () => this.editor.isEditable ? { tabindex: "0" } : {}
         }
@@ -11975,36 +11975,36 @@ let Tr = class tr {
     })), t;
   }
 };
-var Qt = 200, L = function() {
+var Qt = 200, F = function() {
 };
-L.prototype.append = function(e) {
-  return e.length ? (e = L.from(e), !this.length && e || e.length < Qt && this.leafAppend(e) || this.length < Qt && e.leafPrepend(this) || this.appendInner(e)) : this;
+F.prototype.append = function(e) {
+  return e.length ? (e = F.from(e), !this.length && e || e.length < Qt && this.leafAppend(e) || this.length < Qt && e.leafPrepend(this) || this.appendInner(e)) : this;
 };
-L.prototype.prepend = function(e) {
-  return e.length ? L.from(e).append(this) : this;
+F.prototype.prepend = function(e) {
+  return e.length ? F.from(e).append(this) : this;
 };
-L.prototype.appendInner = function(e) {
+F.prototype.appendInner = function(e) {
   return new Md(this, e);
 };
-L.prototype.slice = function(e, t) {
-  return e === void 0 && (e = 0), t === void 0 && (t = this.length), e >= t ? L.empty : this.sliceInner(Math.max(0, e), Math.min(this.length, t));
+F.prototype.slice = function(e, t) {
+  return e === void 0 && (e = 0), t === void 0 && (t = this.length), e >= t ? F.empty : this.sliceInner(Math.max(0, e), Math.min(this.length, t));
 };
-L.prototype.get = function(e) {
+F.prototype.get = function(e) {
   if (!(e < 0 || e >= this.length))
     return this.getInner(e);
 };
-L.prototype.forEach = function(e, t, n) {
+F.prototype.forEach = function(e, t, n) {
   t === void 0 && (t = 0), n === void 0 && (n = this.length), t <= n ? this.forEachInner(e, t, n, 0) : this.forEachInvertedInner(e, t, n, 0);
 };
-L.prototype.map = function(e, t, n) {
+F.prototype.map = function(e, t, n) {
   t === void 0 && (t = 0), n === void 0 && (n = this.length);
   var i = [];
   return this.forEach(function(s, o) {
     return i.push(e(s, o));
   }, t, n), i;
 };
-L.from = function(e) {
-  return e instanceof L ? e : e && e.length ? new wo(e) : L.empty;
+F.from = function(e) {
+  return e instanceof F ? e : e && e.length ? new wo(e) : F.empty;
 };
 var wo = /* @__PURE__ */ function(r) {
   function e(n) {
@@ -12037,8 +12037,8 @@ var wo = /* @__PURE__ */ function(r) {
   }, t.depth.get = function() {
     return 0;
   }, Object.defineProperties(e.prototype, t), e;
-}(L);
-L.empty = new wo([]);
+}(F);
+F.empty = new wo([]);
 var Md = /* @__PURE__ */ function(r) {
   function e(t, n) {
     r.call(this), this.left = t, this.right = n, this.length = t.length + n.length, this.depth = Math.max(t.depth, n.depth) + 1;
@@ -12071,9 +12071,9 @@ var Md = /* @__PURE__ */ function(r) {
   }, e.prototype.appendInner = function(n) {
     return this.left.depth >= Math.max(this.right.depth, n.depth) + 1 ? new e(this.left, new e(this.right, n)) : new e(this, n);
   }, e;
-}(L);
+}(F);
 const Ed = 500;
-class ie {
+class se {
   constructor(e, t) {
     this.items = e, this.eventCount = t;
   }
@@ -12097,24 +12097,24 @@ class ie {
         return;
       }
       if (i) {
-        u.push(new le(d.map));
+        u.push(new ae(d.map));
         let f = d.step.map(i.slice(s)), p;
-        f && o.maybeStep(f).doc && (p = o.mapping.maps[o.mapping.maps.length - 1], c.push(new le(p, void 0, void 0, c.length + u.length))), s--, p && i.appendMap(p, s);
+        f && o.maybeStep(f).doc && (p = o.mapping.maps[o.mapping.maps.length - 1], c.push(new ae(p, void 0, void 0, c.length + u.length))), s--, p && i.appendMap(p, s);
       } else
         o.maybeStep(d.step);
       if (d.selection)
-        return l = i ? d.selection.map(i.slice(s)) : d.selection, a = new ie(this.items.slice(0, n).append(u.reverse().concat(c)), this.eventCount - 1), !1;
+        return l = i ? d.selection.map(i.slice(s)) : d.selection, a = new se(this.items.slice(0, n).append(u.reverse().concat(c)), this.eventCount - 1), !1;
     }, this.items.length, 0), { remaining: a, transform: o, selection: l };
   }
   // Create a new branch with the given transform added.
   addTransform(e, t, n, i) {
     let s = [], o = this.eventCount, l = this.items, a = !i && l.length ? l.get(l.length - 1) : null;
     for (let u = 0; u < e.steps.length; u++) {
-      let d = e.steps[u].invert(e.docs[u]), h = new le(e.mapping.maps[u], d, t), f;
+      let d = e.steps[u].invert(e.docs[u]), h = new ae(e.mapping.maps[u], d, t), f;
       (f = a && a.merge(h)) && (h = f, u ? s.pop() : l = l.slice(0, l.length - 1)), s.push(h), t && (o++, t = void 0), i || (a = h);
     }
     let c = o - n.depth;
-    return c > Od && (l = Td(l, c), o -= c), new ie(l.append(s), o);
+    return c > Od && (l = Td(l, c), o -= c), new se(l.append(s), o);
   }
   remapping(e, t) {
     let n = new gt();
@@ -12124,7 +12124,7 @@ class ie {
     }, e, t), n;
   }
   addMaps(e) {
-    return this.eventCount == 0 ? this : new ie(this.items.append(e.map((t) => new le(t))), this.eventCount);
+    return this.eventCount == 0 ? this : new se(this.items.append(e.map((t) => new ae(t))), this.eventCount);
   }
   // When the collab module receives remote changes, the history has
   // to know about those, so that it can adjust the steps that were
@@ -12146,14 +12146,14 @@ class ie {
       let p = s.maps[f];
       if (h.step) {
         let m = e.steps[f].invert(e.docs[f]), g = h.selection && h.selection.map(s.slice(a + 1, f));
-        g && l++, n.push(new le(p, m, g));
+        g && l++, n.push(new ae(p, m, g));
       } else
-        n.push(new le(p));
+        n.push(new ae(p));
     }, i);
     let c = [];
     for (let h = t; h < o; h++)
-      c.push(new le(s.maps[h]));
-    let u = this.items.slice(0, i).append(c).append(n), d = new ie(u, l);
+      c.push(new ae(s.maps[h]));
+    let u = this.items.slice(0, i).append(c).append(n), d = new se(u, l);
     return d.emptyItemCount() > Ed && (d = d.compress(this.items.length - n.length)), d;
   }
   emptyItemCount() {
@@ -12178,14 +12178,14 @@ class ie {
         if (n--, c && t.appendMap(c, n), a) {
           let u = o.selection && o.selection.map(t.slice(n));
           u && s++;
-          let d = new le(c.invert(), a, u), h, f = i.length - 1;
+          let d = new ae(c.invert(), a, u), h, f = i.length - 1;
           (h = i.length && i[f].merge(d)) ? i[f] = h : i.push(d);
         }
       } else o.map && n--;
-    }, this.items.length, 0), new ie(L.from(i.reverse()), s);
+    }, this.items.length, 0), new se(F.from(i.reverse()), s);
   }
 }
-ie.empty = new ie(L.empty, 0);
+se.empty = new se(F.empty, 0);
 function Td(r, e) {
   let t;
   return r.forEach((n, i) => {
@@ -12193,7 +12193,7 @@ function Td(r, e) {
       return t = i, !1;
   }), r.slice(t);
 }
-class le {
+class ae {
   constructor(e, t, n, i) {
     this.map = e, this.step = t, this.selection = n, this.mirrorOffset = i;
   }
@@ -12201,7 +12201,7 @@ class le {
     if (this.step && e.step && !e.selection) {
       let t = e.step.merge(this.step);
       if (t)
-        return new le(t.getMap().invert(), t, this.selection);
+        return new ae(t.getMap().invert(), t, this.selection);
     }
   }
 }
@@ -12223,7 +12223,7 @@ function Nd(r, e, t, n) {
     return o.getMeta(Ve).redo ? new ke(r.done.addTransform(t, void 0, n, Lt(e)), r.undone, Ri(t.mapping.maps), r.prevTime, r.prevComposition) : new ke(r.done, r.undone.addTransform(t, void 0, n, Lt(e)), null, r.prevTime, r.prevComposition);
   if (t.getMeta("addToHistory") !== !1 && !(o && o.getMeta("addToHistory") === !1)) {
     let l = t.getMeta("composition"), a = r.prevTime == 0 || !o && r.prevComposition != l && (r.prevTime < (t.time || 0) - n.newGroupDelay || !Ad(t, r.prevRanges)), c = o ? Pn(r.prevRanges, t.mapping) : Ri(t.mapping.maps);
-    return new ke(r.done.addTransform(t, a ? e.selection.getBookmark() : void 0, n, Lt(e)), ie.empty, c, t.time, l ?? r.prevComposition);
+    return new ke(r.done.addTransform(t, a ? e.selection.getBookmark() : void 0, n, Lt(e)), se.empty, c, t.time, l ?? r.prevComposition);
   } else return (s = t.getMeta("rebased")) ? new ke(r.done.rebased(t, s), r.undone.rebased(t, s), Pn(r.prevRanges, t.mapping), r.prevTime, r.prevComposition) : new ke(r.done.addMaps(t.mapping.maps), r.undone.addMaps(t.mapping.maps), Pn(r.prevRanges, t.mapping), r.prevTime, r.prevComposition);
 }
 function Ad(r, e) {
@@ -12273,7 +12273,7 @@ function Lt(r) {
   }
   return Rn;
 }
-const Ve = new oe("history"), Dd = new oe("closeHistory");
+const Ve = new le("history"), Dd = new le("closeHistory");
 function Id(r = {}) {
   return r = {
     depth: r.depth || 100,
@@ -12282,7 +12282,7 @@ function Id(r = {}) {
     key: Ve,
     state: {
       init() {
-        return new ke(ie.empty, ie.empty, null, 0, -1);
+        return new ke(se.empty, se.empty, null, 0, -1);
       },
       apply(e, t, n) {
         return Nd(t, n, e, r);
@@ -12355,7 +12355,7 @@ const Eo = Mo(!1, !0), To = Mo(!0, !0), Pd = Y.create({
   addProseMirrorPlugins() {
     return [
       new Q({
-        key: new oe("placeholder"),
+        key: new le("placeholder"),
         props: {
           decorations: ({ doc: r, selection: e }) => {
             const t = this.editor.isEditable || !this.options.showOnlyWhenEditable, { anchor: n } = e, i = [];
@@ -12367,7 +12367,7 @@ const Eo = Mo(!1, !0), To = Mo(!0, !0), Pd = Y.create({
               if ((a || !this.options.showOnlyCurrent) && c) {
                 const u = [this.options.emptyNodeClass];
                 s && u.push(this.options.emptyEditorClass);
-                const d = ne.node(l, l + o.nodeSize, {
+                const d = re.node(l, l + o.nodeSize, {
                   class: u.join(" "),
                   "data-placeholder": typeof this.options.placeholder == "function" ? this.options.placeholder({
                     editor: this.editor,
@@ -12379,7 +12379,7 @@ const Eo = Mo(!1, !0), To = Mo(!0, !0), Pd = Y.create({
                 i.push(d);
               }
               return this.options.includeChildren;
-            }), z.create(r, i);
+            }), B.create(r, i);
           }
         }
       })
@@ -12687,7 +12687,7 @@ function Hd(r, e, t = null) {
       const h = r.doc.nodeAt(u);
       h && (u += h.nodeSize);
     }
-    r = r.setSelection(E.create(
+    r = r.setSelection(T.create(
       r.doc,
       u + 1
     ));
@@ -12795,16 +12795,16 @@ const qd = Oo.extend({
   addProseMirrorPlugins() {
     return [
       new Q({
-        key: new oe("footnoteRules"),
+        key: new le("footnoteRules"),
         appendTransaction(r, e, t) {
           let n = t.tr, i = null, s = !1, o = /* @__PURE__ */ new Set();
-          if (r.some((a) => a.steps.some((c) => c instanceof R ? c.from === 0 && c.to === e.doc.content.size : !1)))
+          if (r.some((a) => a.steps.some((c) => c instanceof P ? c.from === 0 && c.to === e.doc.content.size : !1)))
             s = !0;
           else
             for (let a of r)
               if (a.docChanged)
                 for (let c of a.steps) {
-                  if (!(c instanceof R)) continue;
+                  if (!(c instanceof P)) continue;
                   c.slice.size > 0 && c.slice.content.descendants((m, g) => {
                     if ((m == null ? void 0 : m.type.name) == "anchor")
                       return i = m.attrs.id, s = !0, !1;
@@ -12849,7 +12849,7 @@ const qd = Oo.extend({
             }), h = c + u.nodeSize - 1;
             n = n.insert(h, d);
             const f = h;
-            n.doc.nodeAt(f) && (n = n.setSelection(E.create(
+            n.doc.nodeAt(f) && (n = n.setSelection(T.create(
               n.doc,
               f + 1
             )));
@@ -13108,7 +13108,7 @@ class eh {
       for (const d of u) {
         const h = e.state.doc.resolve(d.pos);
         let f = h.node(), p = null;
-        f.isText || e.state.doc.nodesBetween(d.pos, d.pos + d.length, (M, P) => {
+        f.isText || e.state.doc.nodesBetween(d.pos, d.pos + d.length, (M, I) => {
           if (M.isText)
             return p = M, !1;
         });
@@ -13122,15 +13122,16 @@ class eh {
         const w = e.state.doc.textBetween(d.pos, h.end()), v = Qd(w, d.index, d.index + d.length), A = document.createElement("span");
         A.innerHTML = v, y.appendChild(A), g.appendChild(y), o.appendChild(g), y.addEventListener("mouseenter", (M) => {
           M.preventDefault(), M.stopPropagation();
-          const P = e.view.nodeDOM(d.pos);
-          if (P) {
-            let I;
-            if (P.nodeType === Node.TEXT_NODE) {
-              const T = document.createRange();
-              T.setStart(P, d.index), T.setEnd(P, d.index + d.length), I = T.getBoundingClientRect();
+          const I = e.view.nodeDOM(d.pos);
+          if (I) {
+            (I.nodeType === Node.TEXT_NODE ? I.parentNode : I).scrollIntoView({ behavior: "instant", block: "center" });
+            let E;
+            if (I.nodeType === Node.TEXT_NODE) {
+              const ee = document.createRange();
+              ee.setStart(I, d.index), ee.setEnd(I, d.index + d.length), E = ee.getBoundingClientRect();
             } else
-              I = P.getBoundingClientRect();
-            this.overlay.style.display = "block", this.overlay.style.top = I.top - 10 + "px", this.overlay.style.left = I.left - 10 + "px", this.overlay.style.width = I.width + 20 + "px", this.overlay.style.height = I.height + 20 + "px", document.body.appendChild(this.overlay);
+              E = I.getBoundingClientRect();
+            this.overlay.style.display = "block", this.overlay.style.top = E.top - 10 + "px", this.overlay.style.left = E.left - 10 + "px", this.overlay.style.width = E.width + 20 + "px", this.overlay.style.height = E.height + 20 + "px", document.body.appendChild(this.overlay);
           }
         }), y.addEventListener("mouseleave", (M) => {
           M.preventDefault(), M.stopPropagation(), this.overlay.style.display = "none";
@@ -13202,19 +13203,16 @@ class nh {
    * @param {Object} schemaDef - The schema definition.
    * @param {Element} toolbarSlot - The toolbar slot element.
    */
-  constructor(e, t, n) {
+  constructor(e, t) {
     this.editor = e.tiptap, this.toolbar = e.querySelector(".toolbar"), this.schemaDef = t, this.addButtons(t);
-    const i = document.createElement("a");
-    i.href = "#", i.dataset.tooltip = "Toggle debug mode", i.dataset.placement = "bottom", i.className = "outline toolbar-button", i.innerHTML = '<i class="bi bi-question-circle"></i>', i.title = "Toggle debug mode", i.addEventListener("click", (o) => {
-      o.preventDefault();
-      const l = this.toolbar.closest("jinn-tap");
-      l.hasAttribute("debug") ? l.removeAttribute("debug") : l.setAttribute("debug", "");
-    });
-    const s = document.createElement("li");
-    s.appendChild(i), this.toolbar.appendChild(s), n && Array.from(n.children).forEach((l) => {
-      const a = document.createElement("li");
-      a.appendChild(l.cloneNode(!0)), this.toolbar.appendChild(a);
+    const n = document.createElement("a");
+    n.href = "#", n.dataset.tooltip = "Toggle debug mode", n.dataset.placement = "bottom", n.className = "outline toolbar-button", n.innerHTML = '<i class="bi bi-question-circle"></i>', n.title = "Toggle debug mode", n.addEventListener("click", (s) => {
+      s.preventDefault();
+      const o = this.toolbar.closest("jinn-tap");
+      o.hasAttribute("debug") ? o.removeAttribute("debug") : o.setAttribute("debug", "");
     });
+    const i = document.createElement("li");
+    i.appendChild(n), this.toolbar.appendChild(i);
   }
   addButtons(e) {
     const t = Object.entries(e.schema).sort(([, i], [, s]) => {
@@ -13869,26 +13867,25 @@ class oh extends HTMLElement {
     this.setupEditor();
   }
   setupEditor() {
-    const e = this.querySelector('[slot="toolbar"]'), t = document.createElement("div");
-    t.innerHTML = this.innerHTML;
-    const n = t.querySelector('[slot="toolbar"]');
-    n && n.remove();
-    const i = t.innerHTML.trim();
-    this.innerHTML = `
+    const e = document.createElement("div");
+    e.innerHTML = this.innerHTML, this.innerHTML = `
             <nav>
-                <ul class="toolbar"></ul>
+                <ul class="toolbar">
+                    <slot name="toolbar"></slot>
+                </ul>
             </nav>
             <div class="editor-area"></div>
             <div class="aside">
+                <slot name="aside"></slot>
                 <nav class="navigation-panel" aria-label="breadcrumb"></nav>
                 <div class="attribute-panel"></div>
             </div>
-        `;
-    const s = Ud($t);
+        `, this.applySlots(e);
+    const t = e.innerHTML.trim(), n = Ud($t);
     this.editor = new wd({
       element: this.querySelector(".editor-area"),
       extensions: [
-        ...s,
+        ...n,
         Kd,
         Pd,
         Rd.configure({
@@ -13896,7 +13893,7 @@ class oh extends HTMLElement {
           includeChildren: !0
         })
       ],
-      content: this._pendingContent || i || `
+      content: this._pendingContent || t || `
                 <tei-div>
                     <tei-p></tei-p>
                 </tei-div>
@@ -13906,9 +13903,9 @@ class oh extends HTMLElement {
         this.dispatchContentChange(), this.dispatchEvent(new CustomEvent("ready"));
       },
       onUpdate: () => this.dispatchContentChange()
-    }), this.toolbar = new nh(this, $t, e), this.attributePanel = new eh(this, $t), this.navigationPanel = new th(this, this.attributePanel);
-    const o = this.getAttribute("url");
-    o && this.loadFromUrl(o);
+    }), this.toolbar = new nh(this, $t), this.attributePanel = new eh(this, $t), this.navigationPanel = new th(this, this.attributePanel);
+    const i = this.getAttribute("url");
+    i && this.loadFromUrl(i);
   }
   dispatchContentChange() {
     this.dispatchEvent(new CustomEvent("content-change", {
@@ -13938,6 +13935,19 @@ class oh extends HTMLElement {
   get tiptap() {
     return this.editor;
   }
+  applySlots(e) {
+    const t = this.querySelectorAll("slot");
+    for (const n of t) {
+      const i = n.name, s = e.querySelector(`[slot="${i}"]`);
+      if (s) {
+        const o = document.createElement("div");
+        o.innerHTML = s.outerHTML;
+        const l = n.parentNode;
+        Array.from(o.children).forEach((c) => l.insertBefore(c, n)), s.remove();
+      }
+    }
+    return t.forEach((n) => n.remove()), e;
+  }
 }
 customElements.define("jinn-tap", oh);
 export {