@sit-onyx/tiptap 0.1.0-dev-20260220131055 → 0.1.0-dev-20260224080800

package/dist/index.js

@@ -1,5 +1,5 @@
 import { computed as Q, defineComponent as Ee, openBlock as O, createBlock as N, unref as x, mergeProps as qe, withCtx as B, createVNode as z, renderSlot as nn, createElementBlock as Sr, normalizeClass as wr, Fragment as no, renderList as ro, createCommentVNode as J, createTextVNode as io, toDisplayString as oo, toRef as Cr, useId as so, ref as An, watch as Ie, withModifiers as lo, useSlots as ao, createElementVNode as nt } from "vue";
-import { iconChevronDownSmall as co, iconH4 as fo, iconH3 as uo, iconH2 as ho, iconH1 as po, iconParagraphText as On, iconLink as Nn, iconCheckSmall as mo, iconBulletList as go, iconNumberedList as yo, iconList as xo, iconToolBold as bo, iconToolItalic as ko, iconToolUnderlined as So, iconToolStrike as wo, iconAlignmentLeft as Co, iconAlignmentCenter as vo, iconAlignmentRight as To, iconAlignmentBlock as Eo, iconQuote as Mo, iconUndo as Ao, iconRedo as Oo } from "@sit-onyx/icons";
+import { iconChevronDownSmall as co, iconH4 as fo, iconH3 as uo, iconH2 as ho, iconH1 as po, iconParagraphText as On, iconLink as Nn, iconCheckSmall as mo, iconBulletList as go, iconNumberedList as yo, iconList as xo, iconToolBold as ko, iconToolItalic as bo, iconToolUnderlined as So, iconToolStrike as wo, iconAlignmentLeft as Co, iconAlignmentCenter as vo, iconAlignmentRight as To, iconAlignmentBlock as Eo, iconQuote as Mo, iconUndo as Ao, iconRedo as Oo } from "@sit-onyx/icons";
 import { mergeAttributes as vr, Extension as No, useEditor as Io, EditorContent as Ro } from "@tiptap/vue-3";
 import { useForwardProps as Tr, OnyxSystemButton as In, useRootAttrs as zo, OnyxTooltip as Do, mergeVueProps as Bo, OnyxFlyoutMenu as Po, OnyxMenuItem as $o, OnyxIcon as at, injectI18n as Tt, OnyxDialog as Fo, OnyxForm as Lo, OnyxInput as Rn, OnyxBottomBar as Vo, OnyxButton as zn, FORM_INJECTED_SYMBOL as Dn, useFormContext as _o, useVModel as Jo, OnyxFormElement as Bn, getFormMessages as Pn } from "sit-onyx";
 import Wo from "@tiptap/extension-text-align";
@@ -154,7 +154,7 @@ function Mr(n, e, t, r) {
     t -= a, r -= a;
   }
 }
-class b {
+class k {
   /**
   @internal
   */
@@ -209,7 +209,7 @@ class b {
     let t = this.lastChild, r = e.firstChild, i = this.content.slice(), o = 0;
     for (t.isText && t.sameMarkup(r) && (i[i.length - 1] = t.withText(t.text + r.text), o = 1); o < e.content.length; o++)
       i.push(e.content[o]);
-    return new b(i, this.size + e.size);
+    return new k(i, this.size + e.size);
   }
   /**
   Cut out the sub-fragment between the two given positions.
@@ -223,13 +223,13 @@ class b {
         let l = this.content[o], a = s + l.nodeSize;
         a > e && ((s < e || a > t) && (l.isText ? l = l.cut(Math.max(0, e - s), Math.min(l.text.length, t - s)) : l = l.cut(Math.max(0, e - s - 1), Math.min(l.content.size, t - s - 1))), r.push(l), i += l.nodeSize), s = a;
       }
-    return new b(r, i);
+    return new k(r, i);
   }
   /**
   @internal
   */
   cutByIndex(e, t) {
-    return e == t ? b.empty : e == 0 && t == this.content.length ? this : new b(this.content.slice(e, t));
+    return e == t ? k.empty : e == 0 && t == this.content.length ? this : new k(this.content.slice(e, t));
   }
   /**
   Create a new fragment in which the node at the given index is
@@ -240,21 +240,21 @@ class b {
     if (r == t)
       return this;
     let i = this.content.slice(), o = this.size + t.nodeSize - r.nodeSize;
-    return i[e] = t, new b(i, o);
+    return i[e] = t, new k(i, o);
   }
   /**
   Create a new fragment by prepending the given node to this
   fragment.
   */
   addToStart(e) {
-    return new b([e].concat(this.content), this.size + e.nodeSize);
+    return new k([e].concat(this.content), this.size + e.nodeSize);
   }
   /**
   Create a new fragment by appending the given node to this
   fragment.
   */
   addToEnd(e) {
-    return new b(this.content.concat(e), this.size + e.nodeSize);
+    return new k(this.content.concat(e), this.size + e.nodeSize);
   }
   /**
   Compare this fragment to another one.
@@ -369,10 +369,10 @@ class b {
   */
   static fromJSON(e, t) {
     if (!t)
-      return b.empty;
+      return k.empty;
     if (!Array.isArray(t))
       throw new RangeError("Invalid input for Fragment.fromJSON");
-    return new b(t.map(e.nodeFromJSON));
+    return new k(t.map(e.nodeFromJSON));
   }
   /**
   Build a fragment from an array of nodes. Ensures that adjacent
@@ -380,13 +380,13 @@ class b {
   */
   static fromArray(e) {
     if (!e.length)
-      return b.empty;
+      return k.empty;
     let t, r = 0;
     for (let i = 0; i < e.length; i++) {
       let o = e[i];
       r += o.nodeSize, i && o.isText && e[i - 1].sameMarkup(o) ? (t || (t = e.slice(0, i)), t[t.length - 1] = o.withText(t[t.length - 1].text + o.text)) : t && t.push(o);
     }
-    return new b(t || e, r);
+    return new k(t || e, r);
   }
   /**
   Create a fragment from something that can be interpreted as a
@@ -396,17 +396,17 @@ class b {
   */
   static from(e) {
     if (!e)
-      return b.empty;
-    if (e instanceof b)
+      return k.empty;
+    if (e instanceof k)
       return e;
     if (Array.isArray(e))
       return this.fromArray(e);
     if (e.attrs)
-      return new b([e], e.nodeSize);
+      return new k([e], e.nodeSize);
     throw new RangeError("Can not convert " + e + " to a Fragment" + (e.nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""));
   }
 }
-b.empty = new b([], 0);
+k.empty = new k([], 0);
 const zt = { index: 0, offset: 0 };
 function rt(n, e) {
   return zt.index = n, zt.offset = e, zt;
@@ -543,7 +543,7 @@ class M {
 M.none = [];
 class ht extends Error {
 }
-class k {
+class b {
   /**
   Create a slice. When specifying a non-zero open depth, you must
   make sure that there are nodes of at least that depth at the
@@ -570,13 +570,13 @@ class k {
   */
   insertAt(e, t) {
     let r = Or(this.content, e + this.openStart, t);
-    return r && new k(r, this.openStart, this.openEnd);
+    return r && new b(r, this.openStart, this.openEnd);
   }
   /**
   @internal
   */
   removeBetween(e, t) {
-    return new k(Ar(this.content, e + this.openStart, t + this.openStart), this.openStart, this.openEnd);
+    return new b(Ar(this.content, e + this.openStart, t + this.openStart), this.openStart, this.openEnd);
   }
   /**
   Tests whether this slice is equal to another slice.
@@ -604,11 +604,11 @@ class k {
   */
   static fromJSON(e, t) {
     if (!t)
-      return k.empty;
+      return b.empty;
     let r = t.openStart || 0, i = t.openEnd || 0;
     if (typeof r != "number" || typeof i != "number")
       throw new RangeError("Invalid input for Slice.fromJSON");
-    return new k(b.fromJSON(e, t.content), r, i);
+    return new b(k.fromJSON(e, t.content), r, i);
   }
   /**
   Create a slice from a fragment by taking the maximum possible
@@ -620,10 +620,10 @@ class k {
       r++;
     for (let o = e.lastChild; o && !o.isLeaf && (t || !o.type.spec.isolating); o = o.lastChild)
       i++;
-    return new k(e, r, i);
+    return new b(e, r, i);
   }
 }
-k.empty = new k(b.empty, 0, 0);
+b.empty = new b(k.empty, 0, 0);
 function Ar(n, e, t) {
   let { index: r, offset: i } = n.findIndex(e), o = n.maybeChild(r), { index: s, offset: l } = n.findIndex(t);
   if (i == e || o.isText) {
@@ -657,12 +657,12 @@ function Nr(n, e, t, r) {
   } else if (t.content.size)
     if (!t.openStart && !t.openEnd && n.depth == r && e.depth == r) {
       let s = n.parent, l = s.content;
-      return ke(s, l.cut(0, n.parentOffset).append(t.content).append(l.cut(e.parentOffset)));
+      return be(s, l.cut(0, n.parentOffset).append(t.content).append(l.cut(e.parentOffset)));
     } else {
       let { start: s, end: l } = Ho(t, n);
-      return ke(o, Rr(n, s, l, e, r));
+      return be(o, Rr(n, s, l, e, r));
     }
-  else return ke(o, pt(n, e, r));
+  else return be(o, pt(n, e, r));
 }
 function Ir(n, e) {
   if (!e.type.compatibleContent(n.type))
@@ -672,36 +672,36 @@ function jt(n, e, t) {
   let r = n.node(t);
   return Ir(r, e.node(t)), r;
 }
-function be(n, e) {
+function ke(n, e) {
   let t = e.length - 1;
   t >= 0 && n.isText && n.sameMarkup(e[t]) ? e[t] = n.withText(e[t].text + n.text) : e.push(n);
 }
 function Je(n, e, t, r) {
   let i = (e || n).node(t), o = 0, s = e ? e.index(t) : i.childCount;
-  n && (o = n.index(t), n.depth > t ? o++ : n.textOffset && (be(n.nodeAfter, r), o++));
+  n && (o = n.index(t), n.depth > t ? o++ : n.textOffset && (ke(n.nodeAfter, r), o++));
   for (let l = o; l < s; l++)
-    be(i.child(l), r);
-  e && e.depth == t && e.textOffset && be(e.nodeBefore, r);
+    ke(i.child(l), r);
+  e && e.depth == t && e.textOffset && ke(e.nodeBefore, r);
 }
-function ke(n, e) {
+function be(n, e) {
   return n.type.checkContent(e), n.copy(e);
 }
 function Rr(n, e, t, r, i) {
   let o = n.depth > i && jt(n, e, i + 1), s = r.depth > i && jt(t, r, i + 1), l = [];
-  return Je(null, n, i, l), o && s && e.index(i) == t.index(i) ? (Ir(o, s), be(ke(o, Rr(n, e, t, r, i + 1)), l)) : (o && be(ke(o, pt(n, e, i + 1)), l), Je(e, t, i, l), s && be(ke(s, pt(t, r, i + 1)), l)), Je(r, null, i, l), new b(l);
+  return Je(null, n, i, l), o && s && e.index(i) == t.index(i) ? (Ir(o, s), ke(be(o, Rr(n, e, t, r, i + 1)), l)) : (o && ke(be(o, pt(n, e, i + 1)), l), Je(e, t, i, l), s && ke(be(s, pt(t, r, i + 1)), l)), Je(r, null, i, l), new k(l);
 }
 function pt(n, e, t) {
   let r = [];
   if (Je(null, n, t, r), n.depth > t) {
     let i = jt(n, e, t + 1);
-    be(ke(i, pt(n, e, t + 1)), r);
+    ke(be(i, pt(n, e, t + 1)), r);
   }
-  return Je(e, null, t, r), new b(r);
+  return Je(e, null, t, r), new k(r);
 }
 function Ho(n, e) {
   let t = e.depth - n.openStart, i = e.node(t).copy(n.content);
   for (let o = t - 1; o >= 0; o--)
-    i = e.node(o).copy(b.from(i));
+    i = e.node(o).copy(k.from(i));
   return {
     start: i.resolveNoCache(n.openStart + t),
     end: i.resolveNoCache(i.content.size - n.openEnd - t)
@@ -1006,7 +1006,7 @@ class te {
   @internal
   */
   constructor(e, t, r, i = M.none) {
-    this.type = e, this.attrs = t, this.marks = i, this.content = r || b.empty;
+    this.type = e, this.attrs = t, this.marks = i, this.content = r || k.empty;
   }
   /**
   The array of this node's child nodes.
@@ -1149,9 +1149,9 @@ class te {
   */
   slice(e, t = this.content.size, r = !1) {
     if (e == t)
-      return k.empty;
+      return b.empty;
     let i = this.resolve(e), o = this.resolve(t), s = r ? 0 : i.sharedDepth(t), l = i.start(s), c = i.node(s).content.cut(i.pos - l, o.pos - l);
-    return new k(c, i.depth - s, o.depth - s);
+    return new b(c, i.depth - s, o.depth - s);
   }
   /**
   Replace the part of the document between the given positions with
@@ -1295,7 +1295,7 @@ class te {
   can optionally pass `start` and `end` indices into the
   replacement fragment.
   */
-  canReplace(e, t, r = b.empty, i = 0, o = r.childCount) {
+  canReplace(e, t, r = k.empty, i = 0, o = r.childCount) {
     let s = this.contentMatchAt(e).matchFragment(r, i, o), l = s && s.matchFragment(this.content, t);
     if (!l || !l.validEnd)
       return !1;
@@ -1366,7 +1366,7 @@ class te {
         throw new RangeError("Invalid text node in JSON");
       return e.text(t.text, r);
     }
-    let i = b.fromJSON(e, t.content), o = e.nodeType(t.type).create(t.attrs, i, r);
+    let i = k.fromJSON(e, t.content), o = e.nodeType(t.type).create(t.attrs, i, r);
     return o.type.checkAttrs(o.attrs), o;
   }
 }
@@ -1494,7 +1494,7 @@ class ve {
     function o(s, l) {
       let a = s.matchFragment(e, r);
       if (a && (!t || a.validEnd))
-        return b.from(l.map((c) => c.createAndFill()));
+        return k.from(l.map((c) => c.createAndFill()));
       for (let c = 0; c < s.next.length; c++) {
         let { type: f, next: u } = s.next[c];
         if (!(f.isText || f.hasRequiredAttrs()) && i.indexOf(u) == -1) {
@@ -1877,7 +1877,7 @@ let Vn = class Vr {
   create(e = null, t, r) {
     if (this.isText)
       throw new Error("NodeType.create can't construct text nodes");
-    return new te(this, this.computeAttrs(e), b.from(t), M.setFrom(r));
+    return new te(this, this.computeAttrs(e), k.from(t), M.setFrom(r));
   }
   /**
   Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but check the given content
@@ -1885,7 +1885,7 @@ let Vn = class Vr {
   if it doesn't match.
   */
   createChecked(e = null, t, r) {
-    return t = b.from(t), this.checkContent(t), new te(this, this.computeAttrs(e), t, M.setFrom(r));
+    return t = k.from(t), this.checkContent(t), new te(this, this.computeAttrs(e), t, M.setFrom(r));
   }
   /**
   Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but see if it is
@@ -1896,13 +1896,13 @@ let Vn = class Vr {
   `Fragment.empty` as content.
   */
   createAndFill(e = null, t, r) {
-    if (e = this.computeAttrs(e), t = b.from(t), t.size) {
+    if (e = this.computeAttrs(e), t = k.from(t), t.size) {
       let s = this.contentMatch.fillBefore(t);
       if (!s)
         return null;
       t = s.append(t);
     }
-    let i = this.contentMatch.matchFragment(t), o = i && i.fillBefore(b.empty, !0);
+    let i = this.contentMatch.matchFragment(t), o = i && i.fillBefore(k.empty, !0);
     return o ? new te(this, e, t.append(o), M.setFrom(r)) : null;
   }
   /**
@@ -2178,7 +2178,7 @@ class Se {
   */
   parseSlice(e, t = {}) {
     let r = new Wn(this, t, !0);
-    return r.addAll(e, M.none, t.from, t.to), k.maxOpen(r.finish());
+    return r.addAll(e, M.none, t.from, t.to), b.maxOpen(r.finish());
   }
   /**
   @internal
@@ -2306,7 +2306,7 @@ class it {
     if (!this.match) {
       if (!this.type)
         return [];
-      let t = this.type.contentMatch.fillBefore(b.from(e));
+      let t = this.type.contentMatch.fillBefore(k.from(e));
       if (t)
         this.match = this.type.contentMatch.matchFragment(t);
       else {
@@ -2324,8 +2324,8 @@ class it {
         r.text.length == i[0].length ? this.content.pop() : this.content[this.content.length - 1] = o.withText(o.text.slice(0, o.text.length - i[0].length));
       }
     }
-    let t = b.from(this.content);
-    return !e && this.match && (t = t.append(this.match.fillBefore(b.empty, !0))), this.type ? this.type.create(this.attrs, t, this.marks) : t;
+    let t = k.from(this.content);
+    return !e && this.match && (t = t.append(this.match.fillBefore(k.empty, !0))), this.type ? this.type.create(this.attrs, t, this.marks) : t;
   }
   inlineContext(e) {
     return this.type ? this.type.inlineContent : this.content.length ? this.content[0].isInline : e.parentNode && !_r.hasOwnProperty(e.parentNode.nodeName.toLowerCase());
@@ -3155,7 +3155,7 @@ function rn(n, e, t) {
     let o = n.child(i);
     o.content.size && (o = o.copy(rn(o.content, e, o))), o.isInline && (o = e(o, t, i)), r.push(o);
   }
-  return b.fromArray(r);
+  return k.fromArray(r);
 }
 class ue extends _ {
   /**
@@ -3165,7 +3165,7 @@ class ue extends _ {
     super(), this.from = e, this.to = t, this.mark = r;
   }
   apply(e) {
-    let t = e.slice(this.from, this.to), r = e.resolve(this.from), i = r.node(r.sharedDepth(this.to)), o = new k(rn(t.content, (s, l) => !s.isAtom || !l.type.allowsMarkType(this.mark.type) ? s : s.mark(this.mark.addToSet(s.marks)), i), t.openStart, t.openEnd);
+    let t = e.slice(this.from, this.to), r = e.resolve(this.from), i = r.node(r.sharedDepth(this.to)), o = new b(rn(t.content, (s, l) => !s.isAtom || !l.type.allowsMarkType(this.mark.type) ? s : s.mark(this.mark.addToSet(s.marks)), i), t.openStart, t.openEnd);
     return I.fromReplace(e, this.from, this.to, o);
   }
   invert() {
@@ -3204,7 +3204,7 @@ class G extends _ {
     super(), this.from = e, this.to = t, this.mark = r;
   }
   apply(e) {
-    let t = e.slice(this.from, this.to), r = new k(rn(t.content, (i) => i.mark(this.mark.removeFromSet(i.marks)), e), t.openStart, t.openEnd);
+    let t = e.slice(this.from, this.to), r = new b(rn(t.content, (i) => i.mark(this.mark.removeFromSet(i.marks)), e), t.openStart, t.openEnd);
     return I.fromReplace(e, this.from, this.to, r);
   }
   invert() {
@@ -3247,7 +3247,7 @@ class de extends _ {
     if (!t)
       return I.fail("No node at mark step's position");
     let r = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
-    return I.fromReplace(e, this.pos, this.pos + 1, new k(b.from(r), 0, t.isLeaf ? 0 : 1));
+    return I.fromReplace(e, this.pos, this.pos + 1, new b(k.from(r), 0, t.isLeaf ? 0 : 1));
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
@@ -3291,7 +3291,7 @@ class Te extends _ {
     if (!t)
       return I.fail("No node at mark step's position");
     let r = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
-    return I.fromReplace(e, this.pos, this.pos + 1, new k(b.from(r), 0, t.isLeaf ? 0 : 1));
+    return I.fromReplace(e, this.pos, this.pos + 1, new b(k.from(r), 0, t.isLeaf ? 0 : 1));
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
@@ -3344,10 +3344,10 @@ class P extends _ {
     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);
+      let t = this.slice.size + e.slice.size == 0 ? b.empty : new b(this.slice.content.append(e.slice.content), this.slice.openStart, e.slice.openEnd);
       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);
+      let t = this.slice.size + e.slice.size == 0 ? b.empty : new b(e.slice.content.append(this.slice.content), e.slice.openStart, this.slice.openEnd);
       return new P(e.from, this.to, t, this.structure);
     } else
       return null;
@@ -3362,7 +3362,7 @@ class P extends _ {
   static fromJSON(e, t) {
     if (typeof t.from != "number" || typeof t.to != "number")
       throw new RangeError("Invalid input for ReplaceStep.fromJSON");
-    return new P(t.from, t.to, k.fromJSON(e, t.slice), !!t.structure);
+    return new P(t.from, t.to, b.fromJSON(e, t.slice), !!t.structure);
   }
 }
 _.jsonID("replace", P);
@@ -3420,7 +3420,7 @@ class $ extends _ {
   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 $(t.from, t.to, t.gapFrom, t.gapTo, k.fromJSON(e, t.slice), t.insert, !!t.structure);
+    return new $(t.from, t.to, t.gapFrom, t.gapTo, b.fromJSON(e, t.slice), t.insert, !!t.structure);
   }
 }
 _.jsonID("replaceAround", $);
@@ -3438,7 +3438,7 @@ function Ht(n, e, t) {
   }
   return !1;
 }
-function bs(n, e, t, r) {
+function ks(n, e, t, r) {
   let i = [], o = [], s, l;
   n.doc.nodesBetween(e, t, (a, c, f) => {
     if (!a.isInline)
@@ -3452,7 +3452,7 @@ function bs(n, e, t, r) {
     }
   }), i.forEach((a) => n.step(a)), o.forEach((a) => n.step(a));
 }
-function ks(n, e, t, r) {
+function bs(n, e, t, r) {
   let i = [], o = 0;
   n.doc.nodesBetween(e, t, (s, l) => {
     if (!s.isInline)
@@ -3482,7 +3482,7 @@ function on(n, e, t, r = t.contentMatch, i = !0) {
   for (let a = 0; a < o.childCount; a++) {
     let c = o.child(a), f = l + c.nodeSize, u = r.matchType(c.type);
     if (!u)
-      s.push(new P(l, f, k.empty));
+      s.push(new P(l, f, b.empty));
     else {
       r = u;
       for (let d = 0; d < c.marks.length; d++)
@@ -3490,14 +3490,14 @@ function on(n, e, t, r = t.contentMatch, i = !0) {
       if (i && c.isText && t.whitespace != "pre") {
         let d, h = /\r?\n|\r/g, p;
         for (; d = h.exec(c.text); )
-          p || (p = new k(b.from(t.schema.text(" ", t.allowedMarks(c.marks))), 0, 0)), s.push(new P(l + d.index, l + d.index + d[0].length, p));
+          p || (p = new b(k.from(t.schema.text(" ", t.allowedMarks(c.marks))), 0, 0)), s.push(new P(l + d.index, l + d.index + d[0].length, p));
       }
     }
     l = f;
   }
   if (!r.validEnd) {
-    let a = r.fillBefore(b.empty, !0);
-    n.replace(l, l, new k(a, 0, 0));
+    let a = r.fillBefore(k.empty, !0);
+    n.replace(l, l, new b(a, 0, 0));
   }
   for (let a = s.length - 1; a >= 0; a--)
     n.step(s[a]);
@@ -3518,13 +3518,13 @@ function Fe(n) {
   return null;
 }
 function ws(n, e, t) {
-  let { $from: r, $to: i, depth: o } = e, s = r.before(o + 1), l = i.after(o + 1), a = s, c = l, f = b.empty, u = 0;
+  let { $from: r, $to: i, depth: o } = e, s = r.before(o + 1), l = i.after(o + 1), a = s, c = l, f = k.empty, u = 0;
   for (let p = o, m = !1; p > t; p--)
-    m || r.index(p) > 0 ? (m = !0, f = b.from(r.node(p).copy(f)), u++) : a--;
-  let d = b.empty, h = 0;
+    m || r.index(p) > 0 ? (m = !0, f = k.from(r.node(p).copy(f)), u++) : a--;
+  let d = k.empty, h = 0;
   for (let p = o, m = !1; p > t; p--)
-    m || i.after(p + 1) < i.end(p) ? (m = !0, d = b.from(i.node(p).copy(d)), h++) : c++;
-  n.step(new $(a, c, s, l, new k(f.append(d), u, h), f.size - u, !0));
+    m || i.after(p + 1) < i.end(p) ? (m = !0, d = k.from(i.node(p).copy(d)), h++) : c++;
+  n.step(new $(a, c, s, l, new b(f.append(d), u, h), f.size - u, !0));
 }
 function Ur(n, e, t = null, r = n) {
   let i = Cs(n, e), o = i && vs(r, e);
@@ -3550,17 +3550,17 @@ function vs(n, e) {
   return !a || !a.validEnd ? null : s;
 }
 function Ts(n, e, t) {
-  let r = b.empty;
+  let r = k.empty;
   for (let s = t.length - 1; s >= 0; s--) {
     if (r.size) {
       let l = t[s].type.contentMatch.matchFragment(r);
       if (!l || !l.validEnd)
         throw new RangeError("Wrapper type given to Transform.wrap does not form valid content of its parent wrapper");
     }
-    r = b.from(t[s].type.create(t[s].attrs, r));
+    r = k.from(t[s].type.create(t[s].attrs, r));
   }
   let i = e.start, o = e.end;
-  n.step(new $(i, o, i, o, new k(r, 0, 0), t.length, !0));
+  n.step(new $(i, o, i, o, new b(r, 0, 0), t.length, !0));
 }
 function Es(n, e, t, r, i) {
   if (!r.isTextblock)
@@ -3576,7 +3576,7 @@ function Es(n, e, t, r, i) {
       }
       c === !1 && Qr(n, s, l, o), on(n, n.mapping.slice(o).map(l, 1), r, void 0, c === null);
       let f = n.mapping.slice(o), u = f.map(l, 1), d = f.map(l + s.nodeSize, 1);
-      return n.step(new $(u, d, u + 1, d - 1, new k(b.from(r.create(a, null, s.marks)), 0, 0), 1, !0)), c === !0 && Zr(n, s, l, o), !1;
+      return n.step(new $(u, d, u + 1, d - 1, new b(k.from(r.create(a, null, s.marks)), 0, 0), 1, !0)), c === !0 && Zr(n, s, l, o), !1;
     }
   });
 }
@@ -3614,7 +3614,7 @@ function As(n, e, t, r, i) {
     return n.replaceWith(e, e + o.nodeSize, s);
   if (!t.validContent(o.content))
     throw new RangeError("Invalid content for node type " + t.name);
-  n.step(new $(e, e + o.nodeSize, e + 1, e + o.nodeSize - 1, new k(b.from(s), 0, 0), 1, !0));
+  n.step(new $(e, e + o.nodeSize, e + 1, e + o.nodeSize - 1, new b(k.from(s), 0, 0), 1, !0));
 }
 function ie(n, e, t = 1, r) {
   let i = n.resolve(e), o = i.depth - t, s = r && r[r.length - 1] || i.parent;
@@ -3634,13 +3634,13 @@ function ie(n, e, t = 1, r) {
   return i.node(o).canReplaceWith(l, l, a ? a.type : i.node(o + 1).type);
 }
 function Os(n, e, t = 1, r) {
-  let i = n.doc.resolve(e), o = b.empty, s = b.empty;
+  let i = n.doc.resolve(e), o = k.empty, s = k.empty;
   for (let l = i.depth, a = i.depth - t, c = t - 1; l > a; l--, c--) {
-    o = b.from(i.node(l).copy(o));
+    o = k.from(i.node(l).copy(o));
     let f = r && r[c];
-    s = b.from(f ? f.type.create(f.attrs, s) : i.node(l).copy(s));
+    s = k.from(f ? f.type.create(f.attrs, s) : i.node(l).copy(s));
   }
-  n.step(new P(e, e, new k(o.append(s), t, t), !0));
+  n.step(new P(e, e, new b(o.append(s), t, t), !0));
 }
 function Me(n, e) {
   let t = n.resolve(e), r = t.index();
@@ -3683,7 +3683,7 @@ function Is(n, e, t) {
   }
   s.inlineContent && on(n, e + t - 1, s, o.node().contentMatchAt(o.index()), r == null);
   let a = n.mapping.slice(l), c = a.map(e - t);
-  if (n.step(new P(c, a.map(e + t, -1), k.empty, !0)), r === !0) {
+  if (n.step(new P(c, a.map(e + t, -1), b.empty, !0)), r === !0) {
     let f = n.doc.resolve(c);
     Zr(n, f.node(), f.before(), n.steps.length);
   }
@@ -3732,7 +3732,7 @@ function zs(n, e, t) {
     }
   return null;
 }
-function Ot(n, e, t = e, r = k.empty) {
+function Ot(n, e, t = e, r = b.empty) {
   if (e == t && !r.size)
     return null;
   let i = n.resolve(e), o = n.resolve(t);
@@ -3743,7 +3743,7 @@ function Yr(n, e, t) {
 }
 class Ds {
   constructor(e, t, r) {
-    this.$from = e, this.$to = t, this.unplaced = r, this.frontier = [], this.placed = b.empty;
+    this.$from = e, this.$to = t, this.unplaced = r, this.frontier = [], this.placed = k.empty;
     for (let i = 0; i <= e.depth; i++) {
       let o = e.node(i);
       this.frontier.push({
@@ -3752,7 +3752,7 @@ class Ds {
       });
     }
     for (let i = e.depth; i > 0; i--)
-      this.placed = b.from(e.node(i).copy(this.placed));
+      this.placed = k.from(e.node(i).copy(this.placed));
   }
   get depth() {
     return this.frontier.length - 1;
@@ -3768,7 +3768,7 @@ class Ds {
     let o = this.placed, s = r.depth, l = i.depth;
     for (; s && l && o.childCount == 1; )
       o = o.firstChild.content, s--, l--;
-    let a = new k(o, s, l);
+    let a = new b(o, s, l);
     return e > -1 ? new $(r.pos, e, this.$to.pos, this.$to.end(), a, t) : a.size || r.pos != this.$to.pos ? new P(r.pos, i.pos, a) : null;
   }
   // Find a position on the start spine of `this.unplaced` that has
@@ -3791,7 +3791,7 @@ class Ds {
         let s = i.firstChild;
         for (let l = this.depth; l >= 0; l--) {
           let { type: a, match: c } = this.frontier[l], f, u = null;
-          if (t == 1 && (s ? c.matchType(s.type) || (u = c.fillBefore(b.from(s), !1)) : o && a.compatibleContent(o.type)))
+          if (t == 1 && (s ? c.matchType(s.type) || (u = c.fillBefore(k.from(s), !1)) : o && a.compatibleContent(o.type)))
             return { sliceDepth: r, frontierDepth: l, parent: o, inject: u };
           if (t == 2 && s && (f = c.findWrapping(s.type)))
             return { sliceDepth: r, frontierDepth: l, parent: o, wrap: f };
@@ -3802,15 +3802,15 @@ class Ds {
   }
   openMore() {
     let { content: e, openStart: t, openEnd: r } = this.unplaced, i = Pt(e, t);
-    return !i.childCount || i.firstChild.isLeaf ? !1 : (this.unplaced = new k(e, t + 1, Math.max(r, i.size + t >= e.size - r ? t + 1 : 0)), !0);
+    return !i.childCount || i.firstChild.isLeaf ? !1 : (this.unplaced = new b(e, t + 1, Math.max(r, i.size + t >= e.size - r ? t + 1 : 0)), !0);
   }
   dropNode() {
     let { content: e, openStart: t, openEnd: r } = this.unplaced, i = Pt(e, t);
     if (i.childCount <= 1 && t > 0) {
       let o = e.size - t <= t + i.size;
-      this.unplaced = new k(Ve(e, t - 1, 1), t - 1, o ? t - 1 : r);
+      this.unplaced = new b(Ve(e, t - 1, 1), t - 1, o ? t - 1 : r);
     } else
-      this.unplaced = new k(Ve(e, t, 1), t, r);
+      this.unplaced = new b(Ve(e, t, 1), t, r);
   }
   // Move content from the unplaced slice at `sliceDepth` to the
   // frontier node at `frontierDepth`. Close that frontier node when
@@ -3835,12 +3835,12 @@ class Ds {
       c++, (c > 1 || a == 0 || m.content.size) && (u = g, f.push(Xr(m.mark(d.allowedMarks(m.marks)), c == 1 ? a : 0, c == l.childCount ? h : -1)));
     }
     let p = c == l.childCount;
-    p || (h = -1), this.placed = _e(this.placed, t, b.from(f)), this.frontier[t].match = u, p && h < 0 && r && r.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
+    p || (h = -1), this.placed = _e(this.placed, t, k.from(f)), this.frontier[t].match = u, p && h < 0 && r && r.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
     for (let m = 0, g = l; m < h; m++) {
       let y = g.lastChild;
       this.frontier.push({ type: y.type, match: y.contentMatchAt(y.childCount) }), g = y.content;
     }
-    this.unplaced = p ? e == 0 ? k.empty : new k(Ve(s.content, e - 1, 1), e - 1, h < 0 ? s.openEnd : e - 1) : new k(Ve(s.content, e, c), s.openStart, s.openEnd);
+    this.unplaced = p ? e == 0 ? b.empty : new b(Ve(s.content, e - 1, 1), e - 1, h < 0 ? s.openEnd : e - 1) : new b(Ve(s.content, e, c), s.openStart, s.openEnd);
   }
   mustMoveInline() {
     if (!this.$to.parent.isTextblock)
@@ -3881,10 +3881,10 @@ class Ds {
   }
   openFrontierNode(e, t = null, r) {
     let i = this.frontier[this.depth];
-    i.match = i.match.matchType(e), this.placed = _e(this.placed, this.depth, b.from(e.create(t, r))), this.frontier.push({ type: e, match: e.contentMatch });
+    i.match = i.match.matchType(e), this.placed = _e(this.placed, this.depth, k.from(e.create(t, r))), this.frontier.push({ type: e, match: e.contentMatch });
   }
   closeFrontierNode() {
-    let t = this.frontier.pop().match.fillBefore(b.empty, !0);
+    let t = this.frontier.pop().match.fillBefore(k.empty, !0);
     t.childCount && (this.placed = _e(this.placed, this.frontier.length, t));
   }
 }
@@ -3903,7 +3903,7 @@ function Xr(n, e, t) {
   if (e <= 0)
     return n;
   let r = n.content;
-  return e > 1 && (r = r.replaceChild(0, Xr(r.firstChild, e - 1, r.childCount == 1 ? t - 1 : 0))), e > 0 && (r = n.type.contentMatch.fillBefore(r).append(r), t <= 0 && (r = r.append(n.type.contentMatch.matchFragment(r).fillBefore(b.empty, !0)))), n.copy(r);
+  return e > 1 && (r = r.replaceChild(0, Xr(r.firstChild, e - 1, r.childCount == 1 ? t - 1 : 0))), e > 0 && (r = n.type.contentMatch.fillBefore(r).append(r), t <= 0 && (r = r.append(n.type.contentMatch.matchFragment(r).fillBefore(k.empty, !0)))), n.copy(r);
 }
 function $t(n, e, t, r, i) {
   let o = n.node(e), s = i ? n.indexAfter(e) : n.index(e);
@@ -3959,7 +3959,7 @@ function $s(n, e, t, r) {
         g < 0 && (y = !1, g = -g);
         let S = i.node(g - 1), C = i.index(g - 1);
         if (S.canReplaceWith(C, C, p.type, p.marks))
-          return n.replace(i.before(g), y ? o.after(g) : t, new k(ei(r.content, 0, r.openStart, h), h, r.openEnd));
+          return n.replace(i.before(g), y ? o.after(g) : t, new b(ei(r.content, 0, r.openStart, h), h, r.openEnd));
       }
   }
   let u = n.steps.length;
@@ -3975,7 +3975,7 @@ function ei(n, e, t, r, i) {
   }
   if (e > r) {
     let o = i.contentMatchAt(0), s = o.fillBefore(n).append(n);
-    n = s.append(o.matchFragment(s).fillBefore(b.empty, !0));
+    n = s.append(o.matchFragment(s).fillBefore(k.empty, !0));
   }
   return n;
 }
@@ -3984,7 +3984,7 @@ function Fs(n, e, t, r) {
     let i = Rs(n.doc, e, r.type);
     i != null && (e = t = i);
   }
-  n.replaceRange(e, t, new k(b.from(r), 0, 0));
+  n.replaceRange(e, t, new b(k.from(r), 0, 0));
 }
 function Ls(n, e, t) {
   let r = n.doc.resolve(e), i = n.doc.resolve(t), o = ti(r, i);
@@ -4026,7 +4026,7 @@ class De extends _ {
       r[o] = t.attrs[o];
     r[this.attr] = this.value;
     let i = t.type.create(r, null, t.marks);
-    return I.fromReplace(e, this.pos, this.pos + 1, new k(b.from(i), 0, t.isLeaf ? 0 : 1));
+    return I.fromReplace(e, this.pos, this.pos + 1, new b(k.from(i), 0, t.isLeaf ? 0 : 1));
   }
   getMap() {
     return q.empty;
@@ -4155,7 +4155,7 @@ class Vs {
   Replace the part of the document between `from` and `to` with the
   given `slice`.
   */
-  replace(e, t = e, r = k.empty) {
+  replace(e, t = e, r = b.empty) {
     let i = Ot(this.doc, e, t, r);
     return i && this.step(i), this;
   }
@@ -4164,13 +4164,13 @@ class Vs {
   fragment, node, or array of nodes.
   */
   replaceWith(e, t, r) {
-    return this.replace(e, t, new k(b.from(r), 0, 0));
+    return this.replace(e, t, new b(k.from(r), 0, 0));
   }
   /**
   Delete the content between the given positions.
   */
   delete(e, t) {
-    return this.replace(e, t, k.empty);
+    return this.replace(e, t, b.empty);
   }
   /**
   Insert the given content at the given position.
@@ -4311,7 +4311,7 @@ class Vs {
   Add the given mark to the inline content between `from` and `to`.
   */
   addMark(e, t, r) {
-    return bs(this, e, t, r), this;
+    return ks(this, e, t, r), this;
   }
   /**
   Remove marks from inline nodes between `from` and `to`. When
@@ -4320,7 +4320,7 @@ class Vs {
   remove all marks of any type.
   */
   removeMark(e, t, r) {
-    return ks(this, e, t, r), this;
+    return bs(this, e, t, r), this;
   }
   /**
   Removes all marks and nodes from the content of the node at
@@ -4398,14 +4398,14 @@ class T {
   Replace the selection with a slice or, if no slice is given,
   delete the selection. Will append to the given transaction.
   */
-  replace(e, t = k.empty) {
+  replace(e, t = b.empty) {
     let r = t.content.lastChild, i = null;
     for (let l = 0; l < t.openEnd; l++)
       i = r, r = r.lastChild;
     let o = e.steps.length, s = this.ranges;
     for (let l = 0; l < s.length; l++) {
       let { $from: a, $to: c } = s[l], f = e.mapping.slice(o);
-      e.replaceRange(f.map(a.pos), f.map(c.pos), l ? k.empty : t), l == 0 && Yn(e, o, (r ? r.isInline : i && i.isTextblock) ? -1 : 1);
+      e.replaceRange(f.map(a.pos), f.map(c.pos), l ? b.empty : t), l == 0 && Yn(e, o, (r ? r.isInline : i && i.isTextblock) ? -1 : 1);
     }
   }
   /**
@@ -4531,8 +4531,8 @@ class v extends T {
     let i = e.resolve(t.map(this.anchor));
     return new v(i.parent.inlineContent ? i : r, r);
   }
-  replace(e, t = k.empty) {
-    if (super.replace(e, t), t == k.empty) {
+  replace(e, t = b.empty) {
+    if (super.replace(e, t), t == b.empty) {
       let r = this.$from.marksAcross(this.$to);
       r && e.ensureMarks(r);
     }
@@ -4607,7 +4607,7 @@ class w extends T {
     return r ? T.near(o) : new w(o);
   }
   content() {
-    return new k(b.from(this.node), 0, 0);
+    return new b(k.from(this.node), 0, 0);
   }
   eq(e) {
     return e instanceof w && e.anchor == this.anchor;
@@ -4662,8 +4662,8 @@ class K extends T {
   constructor(e) {
     super(e.resolve(0), e.resolve(e.content.size));
   }
-  replace(e, t = k.empty) {
-    if (t == k.empty) {
+  replace(e, t = b.empty) {
+    if (t == b.empty) {
       e.delete(0, e.doc.content.size);
       let r = T.atStart(e.doc);
       r.eq(e.selection) || e.setSelection(r);
@@ -4829,7 +4829,7 @@ const oi = (n, e, t) => {
     return !0;
   if (r.parent.content.size == 0 && ($e(o, "end") || w.isSelectable(o)))
     for (let s = r.depth; ; s--) {
-      let l = Ot(n.doc, r.before(s), r.after(s), k.empty);
+      let l = Ot(n.doc, r.before(s), r.after(s), b.empty);
       if (l && l.slice.size < l.to - l.from) {
         if (e) {
           let a = n.tr.step(l);
@@ -4873,7 +4873,7 @@ function si(n, e, t) {
       return !1;
     l = f;
   }
-  let c = Ot(n.doc, o, a, k.empty);
+  let c = Ot(n.doc, o, a, b.empty);
   if (!c || c.from != o || c instanceof P && c.slice.size >= a - o)
     return !1;
   if (t) {
@@ -4928,7 +4928,7 @@ const ci = (n, e, t) => {
   if (pi(n, i, e, 1))
     return !0;
   if (r.parent.content.size == 0 && ($e(o, "start") || w.isSelectable(o))) {
-    let s = Ot(n.doc, r.before(), r.after(), k.empty);
+    let s = Ot(n.doc, r.before(), r.after(), b.empty);
     if (s && s.slice.size < s.to - s.from) {
       if (e) {
         let l = n.tr.step(s);
@@ -5079,11 +5079,11 @@ function pi(n, e, t, r) {
   let c = !a && e.parent.canReplace(e.index(), e.index() + 1);
   if (c && (s = (l = i.contentMatchAt(i.childCount)).findWrapping(o.type)) && l.matchType(s[0] || o.type).validEnd) {
     if (t) {
-      let h = e.pos + o.nodeSize, p = b.empty;
+      let h = e.pos + o.nodeSize, p = k.empty;
       for (let y = s.length - 1; y >= 0; y--)
-        p = b.from(s[y].create(null, p));
-      p = b.from(i.copy(p));
-      let m = n.tr.step(new $(e.pos - 1, h, e.pos, h, new k(p, 1, 0), s.length, !0)), g = m.doc.resolve(h + 2 * s.length);
+        p = k.from(s[y].create(null, p));
+      p = k.from(i.copy(p));
+      let m = n.tr.step(new $(e.pos - 1, h, e.pos, h, new b(p, 1, 0), s.length, !0)), g = m.doc.resolve(h + 2 * s.length);
       g.nodeAfter && g.nodeAfter.type == i.type && Me(m.doc, g.pos) && m.join(g.pos), t(m.scrollIntoView());
     }
     return !0;
@@ -5100,10 +5100,10 @@ function pi(n, e, t, r) {
       g++;
     if (h.canReplace(h.childCount, h.childCount, m.content)) {
       if (t) {
-        let y = b.empty;
+        let y = k.empty;
         for (let C = p.length - 1; C >= 0; C--)
-          y = b.from(p[C].copy(y));
-        let S = n.tr.step(new $(e.pos - p.length, e.pos + o.nodeSize, e.pos + g, e.pos + o.nodeSize - g, new k(y, p.length, 0), 0, !0));
+          y = k.from(p[C].copy(y));
+        let S = n.tr.step(new $(e.pos - p.length, e.pos + o.nodeSize, e.pos + g, e.pos + o.nodeSize - g, new b(y, p.length, 0), 0, !0));
         t(S.scrollIntoView());
       }
       return !0;
@@ -5192,10 +5192,10 @@ function rl(n, e, t, r = null) {
   return l ? (n && il(n, e, l, i, t), !0) : !1;
 }
 function il(n, e, t, r, i) {
-  let o = b.empty;
+  let o = k.empty;
   for (let f = t.length - 1; f >= 0; f--)
-    o = b.from(t[f].type.create(t[f].attrs, o));
-  n.step(new $(e.start - (r ? 2 : 0), e.end, e.start, e.end, new k(o, 0, 0), t.length, !0));
+    o = k.from(t[f].type.create(t[f].attrs, o));
+  n.step(new $(e.start - (r ? 2 : 0), e.end, e.start, e.end, new b(o, 0, 0), t.length, !0));
   let s = 0;
   for (let f = 0; f < t.length; f++)
     t[f].type == i && (s = f + 1);
@@ -5212,7 +5212,7 @@ function ol(n) {
 }
 function sl(n, e, t, r) {
   let i = n.tr, o = r.end, s = r.$to.end(r.depth);
-  o < s && (i.step(new $(o - 1, s, o, s, new k(b.from(t.create(null, r.parent.copy())), 1, 0), 1, !0)), r = new mt(i.doc.resolve(r.$from.pos), i.doc.resolve(s), r.depth));
+  o < s && (i.step(new $(o - 1, s, o, s, new b(k.from(t.create(null, r.parent.copy())), 1, 0), 1, !0)), r = new mt(i.doc.resolve(r.$from.pos), i.doc.resolve(s), r.depth));
   const l = Fe(r);
   if (l == null)
     return !1;
@@ -5228,10 +5228,10 @@ function ll(n, e, t) {
   if (r.mapping.map(t.end) != t.start + o.nodeAfter.nodeSize)
     return !1;
   let l = t.startIndex == 0, a = t.endIndex == i.childCount, c = o.node(-1), f = o.index(-1);
-  if (!c.canReplace(f + (l ? 0 : 1), f + 1, s.content.append(a ? b.empty : b.from(i))))
+  if (!c.canReplace(f + (l ? 0 : 1), f + 1, s.content.append(a ? k.empty : k.from(i))))
     return !1;
   let u = o.pos, d = u + s.nodeSize;
-  return r.step(new $(u - (l ? 1 : 0), d + (a ? 1 : 0), u + 1, d - 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(r.scrollIntoView()), !0;
+  return r.step(new $(u - (l ? 1 : 0), d + (a ? 1 : 0), u + 1, d - 1, new b((l ? k.empty : k.from(i.copy(k.empty))).append(a ? k.empty : k.from(i.copy(k.empty))), l ? 0 : 1, a ? 0 : 1), l ? 0 : 1)), e(r.scrollIntoView()), !0;
 }
 function al(n) {
   return function(e, t) {
@@ -5245,7 +5245,7 @@ function al(n) {
     if (a.type != n)
       return !1;
     if (t) {
-      let c = a.lastChild && a.lastChild.type == l.type, f = b.from(c ? n.create() : null), u = new k(b.from(n.create(null, b.from(l.type.create(null, f)))), c ? 3 : 1, 0), d = o.start, h = o.end;
+      let c = a.lastChild && a.lastChild.type == l.type, f = k.from(c ? n.create() : null), u = new b(k.from(n.create(null, k.from(l.type.create(null, f)))), c ? 3 : 1, 0), d = o.start, h = o.end;
       t(e.tr.step(new $(d - (c ? 3 : 1), h, d, h, u, 1, !0)).scrollIntoView());
     }
     return !0;
@@ -5306,7 +5306,7 @@ function xi(n, e) {
   let t = document.createEvent("Event");
   return t.initEvent("keydown", !0, !0), t.keyCode = n, t.key = t.code = e, t;
 }
-const ne = typeof navigator < "u" ? navigator : null, nr = typeof document < "u" ? document : null, me = ne && ne.userAgent || "", Ut = /Edge\/(\d+)/.exec(me), bi = /MSIE \d/.exec(me), Zt = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(me), Xe = !!(bi || Zt || Ut), ki = bi ? document.documentMode : Zt ? +Zt[1] : Ut ? +Ut[1] : 0, It = !Xe && /gecko\/(\d+)/i.test(me);
+const ne = typeof navigator < "u" ? navigator : null, nr = typeof document < "u" ? document : null, me = ne && ne.userAgent || "", Ut = /Edge\/(\d+)/.exec(me), ki = /MSIE \d/.exec(me), Zt = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(me), Xe = !!(ki || Zt || Ut), bi = ki ? document.documentMode : Zt ? +Zt[1] : Ut ? +Ut[1] : 0, It = !Xe && /gecko\/(\d+)/i.test(me);
 It && +(/Firefox\/(\d+)/.exec(me) || [0, 0])[1];
 const Qt = !Xe && /Chrome\/(\d+)/.exec(me), le = !!Qt, Si = Qt ? +Qt[1] : 0, Oe = !Xe && !!ne && /Apple Computer/.test(ne.vendor), hn = Oe && (/Mobile\/\w+/.test(me) || !!ne && ne.maxTouchPoints > 2), Z = hn || (ne ? /Mac/.test(ne.platform) : !1), wi = ne ? /Win/.test(ne.platform) : !1, et = /Android \d/.test(me), pn = !!nr && "webkitFontSmoothing" in nr.documentElement.style, ul = pn ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
 function dl(n, e = null) {
@@ -5402,7 +5402,7 @@ function pl(n) {
   if (!e)
     return;
   let t = n.cursorWrapper.dom, r = t.nodeName == "IMG";
-  r ? e.collapse(t.parentNode, Ae(t) + 1) : e.collapse(t, 0), !r && !n.state.selection.visible && Xe && ki <= 11 && (t.disabled = !0, t.disabled = !1);
+  r ? e.collapse(t.parentNode, Ae(t) + 1) : e.collapse(t, 0), !r && !n.state.selection.visible && Xe && bi <= 11 && (t.disabled = !0, t.disabled = !1);
 }
 function ml(n, e) {
   if (e instanceof w) {
@@ -5464,7 +5464,7 @@ function lr(n, e, t) {
     }
   }
 }
-function bt(n) {
+function kt(n) {
   return n.nodeType == 3 ? n.nodeValue.length : n.childNodes.length;
 }
 function je(n, e) {
@@ -5479,7 +5479,7 @@ function yl(n) {
   if (!t)
     return;
   let i, o, s = !1;
-  for (It && t.nodeType == 1 && r < bt(t) && je(t.childNodes[r], -1) && (s = !0); ; )
+  for (It && t.nodeType == 1 && r < kt(t) && je(t.childNodes[r], -1) && (s = !0); ; )
     if (r > 0) {
       if (t.nodeType != 1)
         break;
@@ -5500,7 +5500,7 @@ function yl(n) {
         for (; l && je(l, -1); )
           i = t.parentNode, o = Ae(l), l = l.previousSibling;
         if (l)
-          t = l, r = bt(t);
+          t = l, r = kt(t);
         else {
           if (t = t.parentNode, t == n.dom)
             break;
@@ -5514,7 +5514,7 @@ function xl(n) {
   let e = n.domSelectionRange(), t = e.focusNode, r = e.focusOffset;
   if (!t)
     return;
-  let i = bt(t), o, s;
+  let i = kt(t), o, s;
   for (; ; )
     if (r < i) {
       if (t.nodeType != 1)
@@ -5532,7 +5532,7 @@ function xl(n) {
         for (; l && je(l, 1); )
           o = l.parentNode, s = Ae(l) + 1, l = l.nextSibling;
         if (l)
-          t = l, r = 0, i = bt(t);
+          t = l, r = 0, i = kt(t);
         else {
           if (t = t.parentNode, t == n.dom)
             break;
@@ -5546,7 +5546,7 @@ function Ti(n) {
   let e = n.pmViewDesc;
   return e && e.node && e.node.isBlock;
 }
-function bl(n, e) {
+function kl(n, e) {
   for (; n && e == n.childNodes.length && !dn(n); )
     e = Ae(n) + 1, n = n.parentNode;
   for (; n && e < n.childNodes.length; ) {
@@ -5558,7 +5558,7 @@ function bl(n, e) {
     n = t, e = 0;
   }
 }
-function kl(n, e) {
+function bl(n, e) {
   for (; n && !e && !dn(n); )
     e = Ae(n), n = n.parentNode;
   for (; n && e; ) {
@@ -5573,7 +5573,7 @@ function kl(n, e) {
 function Yt(n, e, t) {
   if (e.nodeType != 3) {
     let o, s;
-    (s = bl(e, t)) ? (e = s, t = 0) : (o = kl(e, t)) && (e = o, t = o.nodeValue.length);
+    (s = kl(e, t)) ? (e = s, t = 0) : (o = bl(e, t)) && (e = o, t = o.nodeValue.length);
   }
   let r = n.domSelection();
   if (!r)
@@ -5716,7 +5716,7 @@ function Mi(n, e, t, r, i) {
     if (n.someProp("transformPastedText", (d) => {
       e = d(e, o || r, n);
     }), o)
-      return l = new k(b.from(n.state.schema.text(e.replace(/\r\n?/g, `
+      return l = new b(k.from(n.state.schema.text(e.replace(/\r\n?/g, `
 `))), 0, 0), n.someProp("transformPasted", (d) => {
         l = d(l, n, !0);
       }), l;
@@ -5752,7 +5752,7 @@ function Mi(n, e, t, r, i) {
     }
   })), f)
     l = Ol(dr(l, +f[1], +f[2]), f[4]);
-  else if (l = k.maxOpen(Tl(l.content, i), !0), l.openStart || l.openEnd) {
+  else if (l = b.maxOpen(Tl(l.content, i), !0), l.openStart || l.openEnd) {
     let u = 0, d = 0;
     for (let h = l.content.firstChild; u < l.openStart && !h.type.spec.isolating; u++, h = h.firstChild)
       ;
@@ -5784,13 +5784,13 @@ function Tl(n, e) {
         s.push(f), i = i.matchType(f.type), o = a;
       }
     }), s)
-      return b.from(s);
+      return k.from(s);
   }
   return n;
 }
 function Ai(n, e, t = 0) {
   for (let r = e.length - 1; r >= t; r--)
-    n = e[r].create(null, b.from(n));
+    n = e[r].create(null, k.from(n));
   return n;
 }
 function Oi(n, e, t, r, i) {
@@ -5799,21 +5799,21 @@ function Oi(n, e, t, r, i) {
     if (o)
       return r.copy(r.content.replaceChild(r.childCount - 1, o));
     if (r.contentMatchAt(r.childCount).matchType(i == n.length - 1 ? t.type : n[i + 1]))
-      return r.copy(r.content.append(b.from(Ai(t, n, i + 1))));
+      return r.copy(r.content.append(k.from(Ai(t, n, i + 1))));
   }
 }
 function Ni(n, e) {
   if (e == 0)
     return n;
-  let t = n.content.replaceChild(n.childCount - 1, Ni(n.lastChild, e - 1)), r = n.contentMatchAt(n.childCount).fillBefore(b.empty, !0);
+  let t = n.content.replaceChild(n.childCount - 1, Ni(n.lastChild, e - 1)), r = n.contentMatchAt(n.childCount).fillBefore(k.empty, !0);
   return n.copy(t.append(r));
 }
 function Xt(n, e, t, r, i, o) {
   let s = e < 0 ? n.firstChild : n.lastChild, l = s.content;
-  return n.childCount > 1 && (o = 0), i < r - 1 && (l = Xt(l, e, t, r, i + 1, o)), i >= t && (l = e < 0 ? s.contentMatchAt(0).fillBefore(l, o <= i).append(l) : l.append(s.contentMatchAt(s.childCount).fillBefore(b.empty, !0))), n.replaceChild(e < 0 ? 0 : n.childCount - 1, s.copy(l));
+  return n.childCount > 1 && (o = 0), i < r - 1 && (l = Xt(l, e, t, r, i + 1, o)), i >= t && (l = e < 0 ? s.contentMatchAt(0).fillBefore(l, o <= i).append(l) : l.append(s.contentMatchAt(s.childCount).fillBefore(k.empty, !0))), n.replaceChild(e < 0 ? 0 : n.childCount - 1, s.copy(l));
 }
 function dr(n, e, t) {
-  return e < n.openStart && (n = new k(Xt(n.content, -1, e, n.openStart, 0, n.openEnd), e, n.openEnd)), t < n.openEnd && (n = new k(Xt(n.content, 1, t, n.openEnd, 0, 0), n.openStart, t)), n;
+  return e < n.openStart && (n = new b(Xt(n.content, -1, e, n.openStart, 0, n.openEnd), e, n.openEnd)), t < n.openEnd && (n = new b(Xt(n.content, 1, t, n.openEnd, 0, 0), n.openStart, t)), n;
 }
 const Ii = {
   thead: ["table"],
@@ -5865,9 +5865,9 @@ function Ol(n, e) {
     let a = t.nodes[r[l]];
     if (!a || a.hasRequiredAttrs())
       break;
-    i = b.from(a.create(r[l + 1], i)), o++, s++;
+    i = k.from(a.create(r[l + 1], i)), o++, s++;
   }
-  return new k(i, o, s);
+  return new b(i, o, s);
 }
 const Y = {}, H = {};
 function he(n, e) {
@@ -5971,7 +5971,7 @@ function Pl(n, e, t) {
   }
 }
 function yn(n) {
-  return kt(n);
+  return bt(n);
 }
 const zi = Z ? "metaKey" : "ctrlKey";
 Y.mousedown = (n, e) => {
@@ -6044,8 +6044,8 @@ H.compositionstart = H.compositionupdate = (n) => {
     n.domObserver.flush();
     let { state: e } = n, t = e.selection.$to;
     if (e.selection instanceof v && (e.storedMarks || !t.textOffset && t.parentOffset && t.nodeBefore.marks.some((r) => r.type.spec.inclusive === !1) || le && wi && Ll(n)))
-      n.markCursor = n.state.storedMarks || t.marks(), kt(n, !0), n.markCursor = null;
-    else if (kt(n, !e.selection.empty), It && e.selection.empty && t.parentOffset && !t.textOffset && t.nodeBefore.marks.length) {
+      n.markCursor = n.state.storedMarks || t.marks(), bt(n, !0), n.markCursor = null;
+    else if (bt(n, !e.selection.empty), It && e.selection.empty && t.parentOffset && !t.textOffset && t.nodeBefore.marks.length) {
       let r = n.domSelectionRange();
       for (let i = r.focusNode, o = r.focusOffset; i && i.nodeType == 1 && o != 0; ) {
         let s = o < 0 ? i.lastChild : i.childNodes[o - 1];
@@ -6074,7 +6074,7 @@ H.compositionend = (n, e) => {
   n.composing && (n.input.composing = !1, n.input.compositionEndedAt = e.timeStamp, n.input.compositionPendingChanges = n.domObserver.pendingRecords().length ? n.input.compositionID : 0, n.input.compositionNode = null, n.input.badSafariComposition ? n.domObserver.forceFlush() : n.input.compositionPendingChanges && Promise.resolve().then(() => n.domObserver.flush()), n.input.compositionID++, Bi(n, 20));
 };
 function Bi(n, e) {
-  clearTimeout(n.input.composingTimeout), e > -1 && (n.input.composingTimeout = setTimeout(() => kt(n), e));
+  clearTimeout(n.input.composingTimeout), e > -1 && (n.input.composingTimeout = setTimeout(() => bt(n), e));
 }
 function Vl(n) {
   for (n.composing && (n.input.composing = !1, n.input.compositionEndedAt = _l()); n.input.compositionNodes.length > 0; )
@@ -6084,7 +6084,7 @@ function _l() {
   let n = document.createEvent("Event");
   return n.initEvent("event", !0, !0), n.timeStamp;
 }
-function kt(n, e = !1) {
+function bt(n, e = !1) {
   if (!(et && n.domObserver.flushingSoon >= 0)) {
     if (n.domObserver.forceFlush(), Vl(n), e || n.docView && n.docView.dirty) {
       let t = dl(n), r = n.state.selection;
@@ -6103,7 +6103,7 @@ function Jl(n, e) {
     t.parentNode && t.parentNode.removeChild(t), n.focus();
   }, 50);
 }
-const Ze = Xe && ki < 15 || hn && ul < 604;
+const Ze = Xe && bi < 15 || hn && ul < 604;
 Y.copy = H.cut = (n, e) => {
   let t = e, r = n.state.selection, i = t.type == "cut";
   if (r.empty)
@@ -6126,7 +6126,7 @@ function jl(n, e) {
 }
 function en(n, e, t, r, i) {
   let o = Mi(n, e, t, r, n.state.selection.$from);
-  if (n.someProp("handlePaste", (a) => a(n, i, o || k.empty)))
+  if (n.someProp("handlePaste", (a) => a(n, i, o || b.empty)))
     return !0;
   if (!o)
     return !1;
@@ -6198,7 +6198,7 @@ function Hl(n, e, t) {
     o = h(o, n, !1);
   }) : o = Mi(n, Pi(e.dataTransfer), Ze ? null : e.dataTransfer.getData("text/html"), !1, i);
   let s = !!(t && $i(n, e));
-  if (n.someProp("handleDrop", (h) => h(n, e, o || k.empty, s))) {
+  if (n.someProp("handleDrop", (h) => h(n, e, o || b.empty, s))) {
     e.preventDefault();
     return;
   }
@@ -6541,7 +6541,7 @@ class D {
   @internal
   */
   locals(e) {
-    return bn(this.localsInner(e));
+    return kn(this.localsInner(e));
   }
   /**
   @internal
@@ -6561,7 +6561,7 @@ class D {
   }
 }
 D.empty = new D([], []);
-D.removeOverlap = bn;
+D.removeOverlap = kn;
 const W = D.empty;
 class ye {
   constructor(e) {
@@ -6602,7 +6602,7 @@ class ye {
             t.push(o[s]);
         }
     }
-    return t ? bn(r ? t : t.sort(Ce)) : ze;
+    return t ? kn(r ? t : t.sort(Ce)) : ze;
   }
   // Create a group for the given array of decoration sets, or return
   // a single set when possible.
@@ -6725,7 +6725,7 @@ function wt(n, e, t, r) {
 function Ce(n, e) {
   return n.from - e.from || n.to - e.to;
 }
-function bn(n) {
+function kn(n) {
   let e = n;
   for (let t = 0; t < e.length - 1; t++) {
     let r = e[t];
@@ -6748,7 +6748,7 @@ function pr(n, e, t) {
     e++;
   n.splice(e, 0, t);
 }
-var Ql = Object.defineProperty, kn = (n, e) => {
+var Ql = Object.defineProperty, bn = (n, e) => {
   for (var t in e)
     Ql(n, t, { get: e[t], enumerable: !0 });
 };
@@ -6845,7 +6845,7 @@ var Gl = class {
     return s;
   }
 }, Ji = {};
-kn(Ji, {
+bn(Ji, {
   blur: () => Yl,
   clearContent: () => Xl,
   clearNodes: () => ea,
@@ -6863,7 +6863,7 @@ kn(Ji, {
   focus: () => ma,
   forEach: () => ga,
   insertContent: () => ya,
-  insertContentAt: () => ka,
+  insertContentAt: () => ba,
   joinBackward: () => Ca,
   joinDown: () => wa,
   joinForward: () => va,
@@ -6902,8 +6902,8 @@ kn(Ji, {
   undoInputRule: () => gc,
   unsetAllMarks: () => yc,
   unsetMark: () => xc,
-  unsetTextDirection: () => bc,
-  updateAttributes: () => kc,
+  unsetTextDirection: () => kc,
+  updateAttributes: () => bc,
   wrapIn: () => Sc,
   wrapInList: () => wc
 });
@@ -7091,7 +7091,7 @@ function st(n) {
   return Ki(t);
 }
 function Ge(n, e, t) {
-  if (n instanceof te || n instanceof b)
+  if (n instanceof te || n instanceof k)
     return n;
   t = {
     slice: !0,
@@ -7102,7 +7102,7 @@ function Ge(n, e, t) {
   if (r)
     try {
       if (Array.isArray(n) && n.length > 0)
-        return b.fromArray(n.map((l) => e.nodeFromJSON(l)));
+        return k.fromArray(n.map((l) => e.nodeFromJSON(l)));
       const s = e.nodeFromJSON(n);
       return t.errorOnInvalidContent && s.check(), s;
     } catch (o) {
@@ -7154,7 +7154,7 @@ function xa(n, e, t) {
     s === 0 && (s = f);
   }), n.setSelection(T.near(n.doc.resolve(s), t));
 }
-var ba = (n) => !("type" in n), ka = (n, e, t) => ({ tr: r, dispatch: i, editor: o }) => {
+var ka = (n) => !("type" in n), ba = (n, e, t) => ({ tr: r, dispatch: i, editor: o }) => {
   var s;
   if (i) {
     t = {
@@ -7195,7 +7195,7 @@ var ba = (n) => !("type" in n), ka = (n, e, t) => ({ tr: r, dispatch: i, editor:
       return a(g), !1;
     }
     let { from: f, to: u } = typeof n == "number" ? { from: n, to: n } : { from: n.from, to: n.to }, d = !0, h = !0;
-    if ((ba(l) ? l : [l]).forEach((g) => {
+    if ((ka(l) ? l : [l]).forEach((g) => {
       g.check(), d = d ? g.isText && g.marks.length === 0 : !1, h = h ? g.isBlock : !1;
     }), f === u && h) {
       const { parent: g } = r.doc.resolve(f);
@@ -7205,7 +7205,7 @@ var ba = (n) => !("type" in n), ka = (n, e, t) => ({ tr: r, dispatch: i, editor:
     if (d) {
       if (Array.isArray(e))
         m = e.map((g) => g.text || "").join("");
-      else if (e instanceof b) {
+      else if (e instanceof k) {
         let g = "";
         e.forEach((y) => {
           y.text && (g += y.text);
@@ -7491,6 +7491,8 @@ function tc(n, e, t = {}) {
   if (i.forEach(({ $from: u, $to: d }) => {
     const h = u.pos, p = d.pos;
     n.doc.nodesBetween(h, p, (m, g) => {
+      if (o && m.inlineContent && !m.type.allowsMarkType(o))
+        return !1;
       if (!m.isText && !m.marks.length)
         return;
       const y = Math.max(h, g), S = Math.min(p, g + m.nodeSize), C = S - y;
@@ -7623,7 +7625,7 @@ var rc = (n, e = {}) => ({ tr: t, state: r, dispatch: i }) => {
   const r = V(n, e.schema);
   return al(r)(e, t);
 };
-function br(n, e) {
+function kr(n, e) {
   const t = n.storedMarks || n.selection.$to.parentOffset && n.selection.$from.marks();
   if (t) {
     const r = t.filter((i) => e?.includes(i.type.name));
@@ -7633,7 +7635,7 @@ function br(n, e) {
 var fc = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, editor: i }) => {
   const { selection: o, doc: s } = e, { $from: l, $to: a } = o, c = i.extensionManager.attributes, f = ut(c, l.node().type.name, l.node().attrs);
   if (o instanceof w && o.node.isBlock)
-    return !l.parentOffset || !ie(s, l.pos) ? !1 : (r && (n && br(t, i.extensionManager.splittableMarks), e.split(l.pos).scrollIntoView()), !0);
+    return !l.parentOffset || !ie(s, l.pos) ? !1 : (r && (n && kr(t, i.extensionManager.splittableMarks), e.split(l.pos).scrollIntoView()), !0);
   if (!l.parent.isBlock)
     return !1;
   const u = a.parentOffset === a.parent.content.size, d = l.depth === 0 ? void 0 : Ha(l.node(-1).contentMatchAt(l.indexAfter(-1)));
@@ -7653,7 +7655,7 @@ var fc = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, editor
       const m = e.mapping.map(l.before()), g = e.doc.resolve(m);
       l.node(-1).canReplaceWith(g.index(), g.index() + 1, d) && e.setNodeMarkup(e.mapping.map(l.before()), d);
     }
-    n && br(t, i.extensionManager.splittableMarks), e.scrollIntoView();
+    n && kr(t, i.extensionManager.splittableMarks), e.scrollIntoView();
   }
   return p;
 }, uc = (n, e = {}) => ({ tr: t, state: r, dispatch: i, editor: o }) => {
@@ -7669,10 +7671,10 @@ var fc = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, editor
     if (a.depth === 2 || a.node(-3).type !== l || a.index(-2) !== a.node(-2).childCount - 1)
       return !1;
     if (i) {
-      let y = b.empty;
+      let y = k.empty;
       const S = a.index(-1) ? 1 : a.index(-2) ? 2 : 3;
       for (let U = a.depth - S; U >= a.depth - 3; U -= 1)
-        y = b.from(a.node(U).copy(y));
+        y = k.from(a.node(U).copy(y));
       const C = (
         // eslint-disable-next-line no-nested-ternary
         a.indexAfter(-1) < a.node(-2).childCount ? 1 : a.indexAfter(-2) < a.node(-3).childCount ? 2 : 3
@@ -7680,9 +7682,9 @@ var fc = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, editor
         ...ut(d, a.node().type.name, a.node().attrs),
         ...e
       }, E = ((s = l.contentMatch.defaultType) == null ? void 0 : s.createAndFill(A)) || void 0;
-      y = y.append(b.from(l.createAndFill(null, E) || void 0));
+      y = y.append(k.from(l.createAndFill(null, E) || void 0));
       const R = a.before(a.depth - (S - 1));
-      t.replace(R, a.after(-C), new k(y, 4 - S, 0));
+      t.replace(R, a.after(-C), new b(y, 4 - S, 0));
       let L = -1;
       t.doc.nodesBetween(R, t.doc.content.size, (U, ae) => {
         if (L > -1)
@@ -7796,7 +7798,7 @@ var fc = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, editor
       t.removeMark(d.$from.pos, d.$to.pos, a);
     });
   return t.removeStoredMark(a), !0;
-}, bc = (n) => ({ tr: e, state: t, dispatch: r }) => {
+}, kc = (n) => ({ tr: e, state: t, dispatch: r }) => {
   const { selection: i } = t;
   let o, s;
   return typeof n == "number" ? (o = n, s = n) : n && "from" in n && "to" in n ? (o = n.from, s = n.to) : (o = i.from, s = i.to), r && e.doc.nodesBetween(o, s, (l, a) => {
@@ -7805,7 +7807,7 @@ var fc = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, editor
     const c = { ...l.attrs };
     delete c.dir, e.setNodeMarkup(a, void 0, c);
   }), !0;
-}, kc = (n, e = {}) => ({ tr: t, state: r, dispatch: i }) => {
+}, bc = (n, e = {}) => ({ tr: t, state: r, dispatch: i }) => {
   let o = null, s = null;
   const l = Ui(
     typeof n == "string" ? n : n.name,
@@ -7910,7 +7912,7 @@ var vc = class {
     return e.parent = this, this.child = e, e.name = "name" in n ? n.name : e.parent.name, e;
   }
 }, Tc = {};
-kn(Tc, {
+bn(Tc, {
   ClipboardTextSerializer: () => Ec,
   Commands: () => Mc,
   Delete: () => Ac,
@@ -8236,7 +8238,7 @@ var X = class Gi extends vc {
     ];
   }
 }), Pc = {};
-kn(Pc, {
+bn(Pc, {
   createAtomBlockMarkdownSpec: () => $c,
   createBlockMarkdownSpec: () => Fc,
   createInlineMarkdownSpec: () => _c,
@@ -8573,7 +8575,7 @@ function Wc(n, e, t, r) {
   }), a.join(`
 `);
 }
-var kr = "placeholder";
+var br = "placeholder";
 function jc(n) {
   return n.replace(/\s+/g, "-").replace(/[^a-zA-Z0-9-]/g, "").replace(/^[0-9-]+/, "").replace(/^-+/, "").toLowerCase();
 }
@@ -8583,7 +8585,7 @@ var qc = X.create({
     return {
       emptyEditorClass: "is-editor-empty",
       emptyNodeClass: "is-empty",
-      dataAttribute: kr,
+      dataAttribute: br,
       placeholder: "Write something …",
       showOnlyWhenEditable: !0,
       showOnlyCurrent: !0,
@@ -8591,7 +8593,7 @@ var qc = X.create({
     };
   },
   addProseMirrorPlugins() {
-    const n = this.options.dataAttribute ? `data-${jc(this.options.dataAttribute)}` : `data-${kr}`;
+    const n = this.options.dataAttribute ? `data-${jc(this.options.dataAttribute)}` : `data-${br}`;
     return [
       new oe({
         key: new se("placeholder"),
@@ -9073,7 +9075,7 @@ const En = (n) => {
                   x(p)("bold") ? (O(), N(j, {
                     key: 0,
                     label: x(s)("editor.bold"),
-                    icon: x(bo),
+                    icon: x(ko),
                     active: x(c)?.isActive("bold"),
                     disabled: !x(c)?.can().chain().toggleBold().run(),
                     onClick: S[0] || (S[0] = (C) => x(c)?.chain().focus().toggleBold().run())
@@ -9081,7 +9083,7 @@ const En = (n) => {
                   x(p)("italic") ? (O(), N(j, {
                     key: 1,
                     label: x(s)("editor.italic"),
-                    icon: x(ko),
+                    icon: x(bo),
                     active: x(c)?.isActive("italic"),
                     disabled: !x(c)?.can().chain().toggleItalic().run(),
                     onClick: S[1] || (S[1] = (C) => x(c)?.chain().focus().toggleItalic().run())