@dialpad/dialtone 9.19.0 → 9.20.0

package/dist/vue2/{rich_text_editor-AZuWkf9m.js → rich_text_editor-QsHU2mru.js}

@@ -1,6 +1,6 @@
 import { n as ee, g as Ti, d as Ya, u as Xa, e as Qa, P as Za, h as As, i as ec, j as tc, k as nc, l as rc, m as ic, o as sc, p as oc, q as lc, T as Ns, t as sl, r as ac, s as cc } from "./tooltip-mMe9F6C6.js";
 import De from "vue";
-import { B as uc, w as hr, I as dc, L as fc, C as hc, t as ol, D as ll, E as pc, m as mc, o as al } from "./index-74FmkvkN.js";
+import { B as dc, w as hr, I as uc, L as fc, C as hc, t as ol, D as ll, E as pc, m as mc, o as al } from "./index-74FmkvkN.js";
 const Lt = {
   BUSY: "busy",
   AWAY: "away",
@@ -99,7 +99,7 @@ const xc = Sc.exports, Xr = {
   "1800"
 ], Ds = (n) => n > 1;
 function Tc() {
-  return [void 0, ...uc];
+  return [void 0, ...dc];
 }
 const Mc = (n) => {
   if (typeof n != "string" || !n.trim())
@@ -246,7 +246,7 @@ const Mc = (n) => {
     iconSize: {
       type: String,
       default: "",
-      validator: (n) => !n || Object.keys(dc).includes(n)
+      validator: (n) => !n || Object.keys(uc).includes(n)
     },
     /**
      * Full name used to extract initials.
@@ -373,8 +373,7 @@ const Mc = (n) => {
       this.imageLoadedSuccessfully = !1, n.classList.add("d-d-none");
     },
     validateProps() {
-      if (this.imageSrc && this.imageAlt === void 0)
-        throw new Error("full-name or image-alt must be set if image-src is provided");
+      this.imageSrc && this.imageAlt === void 0 && console.error('image-alt required if image-src is provided. Can be set to "" (empty string) if the image is described in text nearby');
     },
     handleClick(n) {
       this.clickable && this.$emit("click", n);
@@ -618,7 +617,7 @@ const qc = Vc.exports, cl = ':not(:disabled):not([aria-disabled="true"]):not([ro
 }, Qr = {
   DEFAULT: "default",
   CUSTOM: "custom"
-}, un = {
+}, dn = {
   ARROW_KEYS: "arrow-keys",
   TAB: "tab",
   NONE: "none"
@@ -710,8 +709,8 @@ const Is = Xc.exports, Qc = ["listitem", "menuitem", "option"], Zc = {
      */
     navigationType: {
       type: String,
-      default: un.NONE,
-      validator: (n) => Object.values(un).includes(n)
+      default: dn.NONE,
+      validator: (n) => Object.values(dn).includes(n)
     },
     /**
      * Applies selected styles to the list item
@@ -788,13 +787,13 @@ const Is = Xc.exports, Qc = ["listitem", "menuitem", "option"], Zc = {
       return this.isHoverable ? this.highlightId && this.highlightId() ? this.id === this.highlightId() : this.mouseHighlighted : !1;
     },
     isFocusable() {
-      return this.navigationType === un.TAB;
+      return this.navigationType === dn.TAB;
     },
     /**
      * Whether to apply hover styles.
      */
     isHoverable() {
-      return this.navigationType !== un.NONE;
+      return this.navigationType !== dn.NONE;
     }
   },
   methods: {
@@ -809,7 +808,7 @@ const Is = Xc.exports, Qc = ["listitem", "menuitem", "option"], Zc = {
     }
   }
 };
-var eu = function() {
+var ed = function() {
   var e = this, t = e._self._c;
   return t(e.elementType, e._g({ tag: "component", class: ["dt-list-item", {
     "dt-list-item--focusable": e.isFocusable,
@@ -822,27 +821,27 @@ var eu = function() {
   }), e.selected ? { key: "selected", fn: function() {
     return [t("dt-icon", { staticClass: "dt-list-item--selected-icon", attrs: { name: "check", size: "400" } })];
   }, proxy: !0 } : null], null, !0) }) : e._t("default")], 2);
-}, tu = [], nu = /* @__PURE__ */ ee(
+}, td = [], nd = /* @__PURE__ */ ee(
   Zc,
-  eu,
-  tu,
+  ed,
+  td,
   !1,
   null,
   null,
   null,
   null
 );
-const ru = nu.exports, ut = {
+const rd = nd.exports, dt = {
   default: "column",
   column: "column",
   row: "row",
   "row-reverse": "row-reverse",
   "column-reverse": "column-reverse"
-}, ul = ["sm", "md", "lg", "xl"], es = ["0", "100", "200", "300", "400", "450", "500", "600"];
-let iu = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict", su = (n = 21) => {
+}, dl = ["sm", "md", "lg", "xl"], es = ["0", "100", "200", "300", "400", "450", "500", "600"];
+let id = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict", sd = (n = 21) => {
   let e = "", t = n;
   for (; t--; )
-    e += iu[Math.random() * 64 | 0];
+    e += id[Math.random() * 64 | 0];
   return e;
 };
 function kn(n) {
@@ -853,11 +852,11 @@ function kn(n) {
     return e && typeof Symbol == "function" && e.constructor === Symbol && e !== Symbol.prototype ? "symbol" : typeof e;
   }, kn(n);
 }
-var dl = {
-  selector: "vue-portal-target-".concat(su())
-}, ou = function(e) {
-  return dl.selector = e;
-}, Zr = typeof window < "u" && (typeof document > "u" ? "undefined" : kn(document)) !== void 0, lu = De.extend({
+var ul = {
+  selector: "vue-portal-target-".concat(sd())
+}, od = function(e) {
+  return ul.selector = e;
+}, Zr = typeof window < "u" && (typeof document > "u" ? "undefined" : kn(document)) !== void 0, ld = De.extend({
   // as an abstract component, it doesn't appear in
   // the $parent chain of components.
   // which means the next parent of any component rendered inside of this oen
@@ -891,7 +890,7 @@ var dl = {
     selector: {
       type: String,
       default: function() {
-        return "#".concat(dl.selector);
+        return "#".concat(ul.selector);
       }
     },
     tag: {
@@ -941,7 +940,7 @@ var dl = {
     mount: function() {
       if (Zr) {
         var e = this.getTargetEl(), t = document.createElement("DIV");
-        this.prepend && e.firstChild ? e.insertBefore(t, e.firstChild) : e.appendChild(t), this.container = new lu({
+        this.prepend && e.firstChild ? e.insertBefore(t, e.firstChild) : e.appendChild(t), this.container = new ld({
           el: t,
           parent: this,
           propsData: {
@@ -956,12 +955,12 @@ var dl = {
     }
   }
 });
-function au(n) {
+function ad(n) {
   var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  n.component(e.name || "portal", fl), e.defaultSelector && ou(e.defaultSelector);
+  n.component(e.name || "portal", fl), e.defaultSelector && od(e.defaultSelector);
 }
-typeof window < "u" && window.Vue && window.Vue === De && De.use(au);
-const cu = {
+typeof window < "u" && window.Vue && window.Vue === De && De.use(ad);
+const cd = {
   name: "PopoverHeaderFooter",
   components: {
     DtButton: ol,
@@ -1017,7 +1016,7 @@ const cu = {
     }
   }
 };
-var uu = function() {
+var dd = function() {
   var e = this, t = e._self._c;
   return t("div", { class: {
     "d-popover__header": e.type === "header",
@@ -1033,17 +1032,17 @@ var uu = function() {
   } }, scopedSlots: e._u([{ key: "icon", fn: function() {
     return [t("dt-icon", { attrs: { name: "close", size: "300" } })];
   }, proxy: !0 }], null, !1, 2538694920) }, "dt-button", e.closeButtonProps, !1)) : e._e()], 1);
-}, du = [], fu = /* @__PURE__ */ ee(
-  cu,
-  uu,
-  du,
+}, ud = [], fd = /* @__PURE__ */ ee(
+  cd,
+  dd,
+  ud,
   !1,
   null,
   null,
   null,
   null
 );
-const hu = fu.exports, pu = {
+const hd = fd.exports, pd = {
   name: "DtPopover",
   /********************
    * CHILD COMPONENTS *
@@ -1051,7 +1050,7 @@ const hu = fu.exports, pu = {
   components: {
     SrOnlyCloseButton: qc,
     DtLazyShow: Qa,
-    PopoverHeaderFooter: hu,
+    PopoverHeaderFooter: hd,
     Portal: fl
   },
   mixins: [Uc, Fc],
@@ -1671,7 +1670,7 @@ const hu = fu.exports, pu = {
     //  ----------------------------------------------------------------------------
   }
 };
-var mu = function() {
+var md = function() {
   var e = this, t = e._self._c;
   return t("div", [e.modal && e.isOpen ? t("portal", [t("div", { staticClass: "d-modal--transparent", attrs: { "aria-hidden": e.modal && e.isOpen ? "false" : "true" }, on: { click: function(r) {
     r.preventDefault(), r.stopPropagation();
@@ -1699,56 +1698,56 @@ var mu = function() {
   ], attrs: { "data-qa": e.$attrs["data-qa"] ? `${e.$attrs["data-qa"]}-content` : "dt-popover-content" } }, [e._t("content", null, { close: e.closePopover })], 2), e.$slots.footerContent ? t("popover-header-footer", { ref: "popover__footer", class: e.POPOVER_HEADER_FOOTER_PADDING_CLASSES[e.padding], attrs: { type: "footer", "content-class": e.footerClass }, scopedSlots: e._u([{ key: "content", fn: function() {
     return [e._t("footerContent", null, { close: e.closePopover })];
   }, proxy: !0 }], null, !0) }) : e._e(), e.showVisuallyHiddenClose ? t("sr-only-close-button", { attrs: { "visually-hidden-close-label": e.visuallyHiddenCloseLabel }, on: { close: e.closePopover } }) : e._e()], 1)], 1)], 1);
-}, gu = [], yu = /* @__PURE__ */ ee(
-  pu,
-  mu,
-  gu,
+}, gd = [], yd = /* @__PURE__ */ ee(
+  pd,
+  md,
+  gd,
   !1,
   null,
   null,
   null,
   null
 );
-const a0 = yu.exports;
+const a0 = yd.exports;
 function Rs(n) {
-  return n === ut.default;
+  return n === dt.default;
 }
 function _s(n) {
   if (Jt(n) === "string")
-    return Rs(n) ? null : ut[n];
+    return Rs(n) ? null : dt[n];
   if (Jt(n) === "object") {
     const { default: e } = n;
-    return Rs(e) ? null : ut[e];
+    return Rs(e) ? null : dt[e];
   } else
     return null;
 }
 function Jt(n) {
   return typeof n;
 }
-function bu(n) {
-  return _s(n) ? `d-stack--${ut[_s(n)]}` : null;
+function bd(n) {
+  return _s(n) ? `d-stack--${dt[_s(n)]}` : null;
 }
-function ku(n) {
+function kd(n) {
   return Jt(n) === "object" ? [
-    ...ul.map((e) => n[e] ? `d-stack--${e}--${n[e]}` : null)
+    ...dl.map((e) => n[e] ? `d-stack--${e}--${n[e]}` : null)
   ] : null;
 }
-function Su(n) {
+function Sd(n) {
   return es.includes(n) ? `d-stack--gap-${n}` : null;
 }
-function xu(n) {
+function xd(n) {
   if (Jt(n) === "string")
-    return Object.keys(ut).includes(n);
+    return Object.keys(dt).includes(n);
   if (Jt(n) === "object") {
     const { default: e } = n;
-    return Object.keys(ut).includes(e);
+    return Object.keys(dt).includes(e);
   } else
     return null;
 }
-function Ou(n) {
+function Od(n) {
   return es.includes(n);
 }
-const vu = {
+const vd = {
   name: "DtStack",
   props: {
     /**
@@ -1762,7 +1761,7 @@ const vu = {
     direction: {
       type: [String, Object],
       default: "column",
-      validator: (n) => xu(n)
+      validator: (n) => xd(n)
     },
     /**
      * Set this prop to render stack as a specific HTML element.
@@ -1778,29 +1777,29 @@ const vu = {
     gap: {
       type: String,
       default: "0",
-      validator: (n) => Ou(n)
+      validator: (n) => Od(n)
     }
   },
   data() {
     return {
-      DT_STACK_DIRECTION: ut,
+      DT_STACK_DIRECTION: dt,
       DT_STACK_GAP: es,
-      DT_STACK_RESPONSIVE_BREAKPOINTS: ul
+      DT_STACK_RESPONSIVE_BREAKPOINTS: dl
     };
   },
   computed: {
     stackGap() {
-      return Su(this.gap);
+      return Sd(this.gap);
     },
     defaultDirection() {
-      return bu(this.direction);
+      return bd(this.direction);
     },
     stackResponsive() {
-      return ku(this.direction);
+      return kd(this.direction);
     }
   }
 };
-var Cu = function() {
+var Cd = function() {
   var e = this, t = e._self._c;
   return t(e.as, { tag: "component", class: [
     "d-stack",
@@ -1808,17 +1807,17 @@ var Cu = function() {
     e.stackResponsive,
     e.stackGap
   ] }, [e._t("default")], 2);
-}, Eu = [], Tu = /* @__PURE__ */ ee(
-  vu,
-  Cu,
-  Eu,
+}, Ed = [], Td = /* @__PURE__ */ ee(
+  vd,
+  Cd,
+  Ed,
   !1,
   null,
   null,
   null,
   null
 );
-const hl = Tu.exports;
+const hl = Td.exports;
 function j(n) {
   this.content = n;
 }
@@ -1960,8 +1959,8 @@ function ml(n, e, t, r) {
     if (!o.sameMarkup(l))
       return { a: t, b: r };
     if (o.isText && o.text != l.text) {
-      let c = 0, u = Math.min(o.text.length, l.text.length);
-      for (; c < u && o.text[o.text.length - c - 1] == l.text[l.text.length - c - 1]; )
+      let c = 0, d = Math.min(o.text.length, l.text.length);
+      for (; c < d && o.text[o.text.length - c - 1] == l.text[l.text.length - c - 1]; )
         c++, t--, r--;
       return { a: t, b: r };
     }
@@ -1991,8 +1990,8 @@ class b {
     for (let o = 0, l = 0; l < t; o++) {
       let a = this.content[o], c = l + a.nodeSize;
       if (c > e && r(a, i + l, s || null, o) !== !1 && a.content.size) {
-        let u = l + 1;
-        a.nodesBetween(Math.max(0, e - u), Math.min(a.content.size, t - u), r, i + u);
+        let d = l + 1;
+        a.nodesBetween(Math.max(0, e - d), Math.min(a.content.size, t - d), r, i + d);
       }
       l = c;
     }
@@ -2152,15 +2151,15 @@ class b {
   */
   findIndex(e, t = -1) {
     if (e == 0)
-      return dn(0, e);
+      return un(0, e);
     if (e == this.size)
-      return dn(this.content.length, e);
+      return un(this.content.length, e);
     if (e > this.size || e < 0)
       throw new RangeError(`Position ${e} outside of fragment (${this})`);
     for (let r = 0, i = 0; ; r++) {
       let s = this.child(r), o = i + s.nodeSize;
       if (o >= e)
-        return o == e || t > 0 ? dn(r + 1, o) : dn(r, i);
+        return o == e || t > 0 ? un(r + 1, o) : un(r, i);
       i = o;
     }
   }
@@ -2226,7 +2225,7 @@ class b {
 }
 b.empty = new b([], 0);
 const ei = { index: 0, offset: 0 };
-function dn(n, e) {
+function un(n, e) {
   return ei.index = n, ei.offset = e, ei;
 }
 function Cn(n, e) {
@@ -2459,7 +2458,7 @@ function yl(n, e, t, r) {
   let l = yl(o.content, e - s - 1, t);
   return l && n.replaceChild(i, o.copy(l));
 }
-function Mu(n, e, t) {
+function Md(n, e, t) {
   if (t.openStart > n.depth)
     throw new En("Inserted content deeper than insertion position");
   if (n.depth - t.openStart != e.depth - t.openEnd)
@@ -2476,7 +2475,7 @@ function bl(n, e, t, r) {
       let o = n.parent, l = o.content;
       return ot(o, l.cut(0, n.parentOffset).append(t.content).append(l.cut(e.parentOffset)));
     } else {
-      let { start: o, end: l } = wu(t, n);
+      let { start: o, end: l } = wd(t, n);
       return ot(s, Sl(n, o, l, e, r));
     }
   else
@@ -2516,7 +2515,7 @@ function Tn(n, e, t) {
   }
   return zt(e, null, t, r), new b(r);
 }
-function wu(n, e) {
+function wd(n, e) {
   let t = e.depth - n.openStart, i = e.node(t).copy(n.content);
   for (let s = t - 1; s >= 0; s--)
     i = e.node(s).copy(b.from(i));
@@ -2765,10 +2764,10 @@ class Gt {
         return s;
     }
     let r = ti[ni] = Gt.resolve(e, t);
-    return ni = (ni + 1) % Au, r;
+    return ni = (ni + 1) % Ad, r;
   }
 }
-let ti = [], ni = 0, Au = 12;
+let ti = [], ni = 0, Ad = 12;
 class Mn {
   /**
   Construct a node range. `$from` and `$to` should point into the
@@ -2809,7 +2808,7 @@ class Mn {
     return this.$to.indexAfter(this.depth);
   }
 }
-const Nu = /* @__PURE__ */ Object.create(null);
+const Nd = /* @__PURE__ */ Object.create(null);
 let lt = class Ai {
   /**
   @internal
@@ -2922,7 +2921,7 @@ let lt = class Ai {
   attributes, and marks.
   */
   hasMarkup(e, t, r) {
-    return this.type == e && Cn(this.attrs, t || e.defaultAttrs || Nu) && R.sameSet(this.marks, r || R.none);
+    return this.type == e && Cn(this.attrs, t || e.defaultAttrs || Nd) && R.sameSet(this.marks, r || R.none);
   }
   /**
   Create a new node with the same markup as this node, containing
@@ -2965,7 +2964,7 @@ let lt = class Ai {
   [`ReplaceError`](https://prosemirror.net/docs/ref/#model.ReplaceError) is thrown.
   */
   replace(e, t, r) {
-    return Mu(this.resolve(e), this.resolve(t), r);
+    return Md(this.resolve(e), this.resolve(t), r);
   }
   /**
   Find the node directly after the given position.
@@ -3215,7 +3214,7 @@ function xl(n, e) {
     e = n[t].type.name + "(" + e + ")";
   return e;
 }
-class dt {
+class ut {
   /**
   @internal
   */
@@ -3226,13 +3225,13 @@ class dt {
   @internal
   */
   static parse(e, t) {
-    let r = new Pu(e, t);
+    let r = new Pd(e, t);
     if (r.next == null)
-      return dt.empty;
+      return ut.empty;
     let i = Ol(r);
     r.next && r.err("Unexpected trailing text");
-    let s = $u(Bu(i));
-    return Fu(s, r), s;
+    let s = $d(Bd(i));
+    return Fd(s, r), s;
   }
   /**
   Match a node type, returning a match after that node if
@@ -3297,10 +3296,10 @@ class dt {
       if (a && (!t || a.validEnd))
         return b.from(l.map((c) => c.createAndFill()));
       for (let c = 0; c < o.next.length; c++) {
-        let { type: u, next: d } = o.next[c];
-        if (!(u.isText || u.hasRequiredAttrs()) && i.indexOf(d) == -1) {
-          i.push(d);
-          let f = s(d, l.concat(u));
+        let { type: d, next: u } = o.next[c];
+        if (!(d.isText || d.hasRequiredAttrs()) && i.indexOf(u) == -1) {
+          i.push(u);
+          let f = s(u, l.concat(d));
           if (f)
             return f;
         }
@@ -3377,8 +3376,8 @@ class dt {
 `);
   }
 }
-dt.empty = new dt(!0);
-class Pu {
+ut.empty = new ut(!0);
+class Pd {
   constructor(e, t) {
     this.string = e, this.nodeTypes = t, this.inline = null, this.pos = 0, this.tokens = e.split(/\s*(?=\b|\W|$)/), this.tokens[this.tokens.length - 1] == "" && this.tokens.pop(), this.tokens[0] == "" && this.tokens.shift();
   }
@@ -3395,19 +3394,19 @@ class Pu {
 function Ol(n) {
   let e = [];
   do
-    e.push(Du(n));
+    e.push(Dd(n));
   while (n.eat("|"));
   return e.length == 1 ? e[0] : { type: "choice", exprs: e };
 }
-function Du(n) {
+function Dd(n) {
   let e = [];
   do
-    e.push(Iu(n));
+    e.push(Id(n));
   while (n.next && n.next != ")" && n.next != "|");
   return e.length == 1 ? e[0] : { type: "seq", exprs: e };
 }
-function Iu(n) {
-  let e = Lu(n);
+function Id(n) {
+  let e = Ld(n);
   for (; ; )
     if (n.eat("+"))
       e = { type: "plus", expr: e };
@@ -3416,7 +3415,7 @@ function Iu(n) {
     else if (n.eat("?"))
       e = { type: "opt", expr: e };
     else if (n.eat("{"))
-      e = Ru(n, e);
+      e = Rd(n, e);
     else
       break;
   return e;
@@ -3426,11 +3425,11 @@ function Ls(n) {
   let e = Number(n.next);
   return n.pos++, e;
 }
-function Ru(n, e) {
+function Rd(n, e) {
   let t = Ls(n), r = t;
   return n.eat(",") && (n.next != "}" ? r = Ls(n) : r = -1), n.eat("}") || n.err("Unclosed braced range"), { type: "range", min: t, max: r, expr: e };
 }
-function _u(n, e) {
+function _d(n, e) {
   let t = n.nodeTypes, r = t[e];
   if (r)
     return [r];
@@ -3441,18 +3440,18 @@ function _u(n, e) {
   }
   return i.length == 0 && n.err("No node type or group '" + e + "' found"), i;
 }
-function Lu(n) {
+function Ld(n) {
   if (n.eat("(")) {
     let e = Ol(n);
     return n.eat(")") || n.err("Missing closing paren"), e;
   } else if (/\W/.test(n.next))
     n.err("Unexpected token '" + n.next + "'");
   else {
-    let e = _u(n, n.next).map((t) => (n.inline == null ? n.inline = t.isInline : n.inline != t.isInline && n.err("Mixing inline and block content"), { type: "name", value: t }));
+    let e = _d(n, n.next).map((t) => (n.inline == null ? n.inline = t.isInline : n.inline != t.isInline && n.err("Mixing inline and block content"), { type: "name", value: t }));
     return n.pos++, e.length == 1 ? e[0] : { type: "choice", exprs: e };
   }
 }
-function Bu(n) {
+function Bd(n) {
   let e = [[]];
   return i(s(n, 0), t()), e;
   function t() {
@@ -3487,15 +3486,15 @@ function Bu(n) {
       if (o.type == "range") {
         let a = l;
         for (let c = 0; c < o.min; c++) {
-          let u = t();
-          i(s(o.expr, a), u), a = u;
+          let d = t();
+          i(s(o.expr, a), d), a = d;
         }
         if (o.max == -1)
           i(s(o.expr, a), a);
         else
           for (let c = o.min; c < o.max; c++) {
-            let u = t();
-            r(a, u), i(s(o.expr, a), u), a = u;
+            let d = t();
+            r(a, d), i(s(o.expr, a), d), a = d;
           }
         return [r(a)];
       } else {
@@ -3523,7 +3522,7 @@ function Bs(n, e) {
     }
   }
 }
-function $u(n) {
+function $d(n) {
   let e = /* @__PURE__ */ Object.create(null);
   return t(Bs(n, 0));
   function t(r) {
@@ -3533,14 +3532,14 @@ function $u(n) {
         if (!l)
           return;
         let c;
-        for (let u = 0; u < i.length; u++)
-          i[u][0] == l && (c = i[u][1]);
-        Bs(n, a).forEach((u) => {
-          c || i.push([l, c = []]), c.indexOf(u) == -1 && c.push(u);
+        for (let d = 0; d < i.length; d++)
+          i[d][0] == l && (c = i[d][1]);
+        Bs(n, a).forEach((d) => {
+          c || i.push([l, c = []]), c.indexOf(d) == -1 && c.push(d);
         });
       });
     });
-    let s = e[r.join(",")] = new dt(r.indexOf(n.length - 1) > -1);
+    let s = e[r.join(",")] = new ut(r.indexOf(n.length - 1) > -1);
     for (let o = 0; o < i.length; o++) {
       let l = i[o][1].sort(vl);
       s.next.push({ type: i[o][0], next: e[l.join(",")] || t(l) });
@@ -3548,7 +3547,7 @@ function $u(n) {
     return s;
   }
 }
-function Fu(n, e) {
+function Fd(n, e) {
   for (let t = 0, r = [n]; t < r.length; t++) {
     let i = r[t], s = !i.validEnd, o = [];
     for (let l = 0; l < i.next.length; l++) {
@@ -3587,7 +3586,7 @@ function Tl(n) {
   let e = /* @__PURE__ */ Object.create(null);
   if (n)
     for (let t in n)
-      e[t] = new zu(n[t]);
+      e[t] = new zd(n[t]);
   return e;
 }
 let $s = class Ml {
@@ -3614,7 +3613,7 @@ let $s = class Ml {
   True for node types that allow no content.
   */
   get isLeaf() {
-    return this.contentMatch == dt.empty;
+    return this.contentMatch == ut.empty;
   }
   /**
   True when this node is an atom, i.e. when it does not have
@@ -3756,7 +3755,7 @@ let $s = class Ml {
     return r;
   }
 };
-class zu {
+class zd {
   constructor(e) {
     this.hasDefault = Object.prototype.hasOwnProperty.call(e, "default"), this.default = e.default;
   }
@@ -3813,7 +3812,7 @@ class pr {
     return this.excluded.indexOf(e) > -1;
   }
 }
-class Hu {
+class Hd {
   /**
   Construct a schema from a schema [specification](https://prosemirror.net/docs/ref/#model.SchemaSpec).
   */
@@ -3828,7 +3827,7 @@ class Hu {
       if (i in this.marks)
         throw new RangeError(i + " can not be both a node and a mark");
       let s = this.nodes[i], o = s.spec.content || "", l = s.spec.marks;
-      s.contentMatch = r[o] || (r[o] = dt.parse(o, this.nodes)), s.inlineContent = s.contentMatch.inlineContent, s.markSet = l == "_" ? null : l ? Fs(this, l.split(" ")) : l == "" || !s.inlineContent ? [] : null;
+      s.contentMatch = r[o] || (r[o] = ut.parse(o, this.nodes)), s.inlineContent = s.contentMatch.inlineContent, s.markSet = l == "_" ? null : l ? Fs(this, l.split(" ")) : l == "" || !s.inlineContent ? [] : null;
     }
     for (let i in this.marks) {
       let s = this.marks[i], o = s.spec.excludes;
@@ -3946,7 +3945,7 @@ let ts = class Ni {
   matchTag(e, t, r) {
     for (let i = r ? this.tags.indexOf(r) + 1 : 0; i < this.tags.length; i++) {
       let s = this.tags[i];
-      if (qu(e, s.tag) && (s.namespace === void 0 || e.namespaceURI == s.namespace) && (!s.context || t.matchesContext(s.context))) {
+      if (qd(e, s.tag) && (s.namespace === void 0 || e.namespaceURI == s.namespace) && (!s.context || t.matchesContext(s.context))) {
         if (s.getAttrs) {
           let o = s.getAttrs(e);
           if (o === !1)
@@ -4047,7 +4046,7 @@ const wl = {
   table: !0,
   tfoot: !0,
   ul: !0
-}, ju = {
+}, jd = {
   head: !0,
   noscript: !0,
   object: !0,
@@ -4095,7 +4094,7 @@ class fn {
   applyPending(e) {
     for (let t = 0, r = this.pendingMarks; t < r.length; t++) {
       let i = r[t];
-      (this.type ? this.type.allowsMarkType(i.type) : Ku(i.type, e)) && !i.isInSet(this.activeMarks) && (this.activeMarks = i.addToSet(this.activeMarks), this.pendingMarks = i.removeFromSet(this.pendingMarks));
+      (this.type ? this.type.allowsMarkType(i.type) : Kd(i.type, e)) && !i.isInSet(this.activeMarks) && (this.activeMarks = i.addToSet(this.activeMarks), this.pendingMarks = i.removeFromSet(this.pendingMarks));
     }
   }
   inlineContext(e) {
@@ -4121,7 +4120,7 @@ class Hs {
     let r = e.getAttribute("style");
     if (!r)
       return t();
-    let i = this.readStyles(Wu(r));
+    let i = this.readStyles(Wd(r));
     if (!i)
       return;
     let [s, o] = i, l = this.top;
@@ -4153,9 +4152,9 @@ class Hs {
   // none is found, the element's content nodes are added directly.
   addElement(e, t) {
     let r = e.nodeName.toLowerCase(), i;
-    Al.hasOwnProperty(r) && this.parser.normalizeLists && Vu(e);
+    Al.hasOwnProperty(r) && this.parser.normalizeLists && Vd(e);
     let s = this.options.ruleFromNode && this.options.ruleFromNode(e) || (i = this.parser.matchTag(e, this, t));
-    if (s ? s.ignore : ju.hasOwnProperty(r))
+    if (s ? s.ignore : jd.hasOwnProperty(r))
       this.findInside(e), this.ignoreFallback(e);
     else if (!s || s.skip || s.closeParent) {
       s && s.closeParent ? this.open = Math.max(0, this.open - 1) : s && s.skip.nodeType && (e = s.skip);
@@ -4343,8 +4342,8 @@ class Hs {
               return !0;
           return !1;
         } else {
-          let u = a > 0 || a == 0 && i ? this.nodes[a].type : r && a >= s ? r.node(a - s).type : null;
-          if (!u || u.name != c && u.groups.indexOf(c) == -1)
+          let d = a > 0 || a == 0 && i ? this.nodes[a].type : r && a >= s ? r.node(a - s).type : null;
+          if (!d || d.name != c && d.groups.indexOf(c) == -1)
             return !1;
           a--;
         }
@@ -4368,7 +4367,7 @@ class Hs {
     }
   }
   addPendingMark(e) {
-    let t = Uu(e, this.top.pendingMarks);
+    let t = Ud(e, this.top.pendingMarks);
     t && this.top.stashMarks.push(t), this.top.pendingMarks = e.addToSet(this.top.pendingMarks);
   }
   removePendingMark(e, t) {
@@ -4386,16 +4385,16 @@ class Hs {
     }
   }
 }
-function Vu(n) {
+function Vd(n) {
   for (let e = n.firstChild, t = null; e; e = e.nextSibling) {
     let r = e.nodeType == 1 ? e.nodeName.toLowerCase() : null;
     r && Al.hasOwnProperty(r) && t ? (t.appendChild(e), e = t) : r == "li" ? t = e : r && (t = null);
   }
 }
-function qu(n, e) {
+function qd(n, e) {
   return (n.matches || n.msMatchesSelector || n.webkitMatchesSelector || n.mozMatchesSelector).call(n, e);
 }
-function Wu(n) {
+function Wd(n) {
   let e = /\s*([\w-]+)\s*:\s*([^;]+)/g, t, r = [];
   for (; t = e.exec(n); )
     r.push(t[1], t[2].trim());
@@ -4407,7 +4406,7 @@ function js(n) {
     e[t] = n[t];
   return e;
 }
-function Ku(n, e) {
+function Kd(n, e) {
   let t = e.schema.nodes;
   for (let r in t) {
     let i = t[r];
@@ -4416,8 +4415,8 @@ function Ku(n, e) {
     let s = [], o = (l) => {
       s.push(l);
       for (let a = 0; a < l.edgeCount; a++) {
-        let { type: c, next: u } = l.edge(a);
-        if (c == e || s.indexOf(u) < 0 && o(u))
+        let { type: c, next: d } = l.edge(a);
+        if (c == e || s.indexOf(d) < 0 && o(d))
           return !0;
       }
     };
@@ -4425,7 +4424,7 @@ function Ku(n, e) {
       return !0;
   }
 }
-function Uu(n, e) {
+function Ud(n, e) {
   for (let t = 0; t < e.length; t++)
     if (n.eq(e[t]))
       return e[t];
@@ -4468,8 +4467,8 @@ class ve {
         for (; l < s.length; )
           i = s.pop()[1];
         for (; a < o.marks.length; ) {
-          let c = o.marks[a++], u = this.serializeMark(c, o.isInline, t);
-          u && (s.push([c, i]), i.appendChild(u.dom), i = u.contentDOM || u.dom);
+          let c = o.marks[a++], d = this.serializeMark(c, o.isInline, t);
+          d && (s.push([c, i]), i.appendChild(d.dom), i = d.contentDOM || d.dom);
         }
       }
       i.appendChild(this.serializeNodeInner(o, t));
@@ -4526,20 +4525,20 @@ class ve {
     let o, l = r ? e.createElementNS(r, i) : e.createElement(i), a = t[1], c = 1;
     if (a && typeof a == "object" && a.nodeType == null && !Array.isArray(a)) {
       c = 2;
-      for (let u in a)
-        if (a[u] != null) {
-          let d = u.indexOf(" ");
-          d > 0 ? l.setAttributeNS(u.slice(0, d), u.slice(d + 1), a[u]) : l.setAttribute(u, a[u]);
+      for (let d in a)
+        if (a[d] != null) {
+          let u = d.indexOf(" ");
+          u > 0 ? l.setAttributeNS(d.slice(0, u), d.slice(u + 1), a[d]) : l.setAttribute(d, a[d]);
         }
     }
-    for (let u = c; u < t.length; u++) {
-      let d = t[u];
-      if (d === 0) {
-        if (u < t.length - 1 || u > c)
+    for (let d = c; d < t.length; d++) {
+      let u = t[d];
+      if (u === 0) {
+        if (d < t.length - 1 || d > c)
           throw new RangeError("Content hole must be the only child of its parent node");
         return { dom: l, contentDOM: l };
       } else {
-        let { dom: f, contentDOM: h } = ve.renderSpec(e, d, r);
+        let { dom: f, contentDOM: h } = ve.renderSpec(e, u, r);
         if (l.appendChild(f), h) {
           if (o)
             throw new RangeError("Multiple content holes");
@@ -4583,13 +4582,13 @@ function ri(n) {
   return n.document || window.document;
 }
 const Nl = 65535, Pl = Math.pow(2, 16);
-function Ju(n, e) {
+function Jd(n, e) {
   return n + e * Pl;
 }
 function qs(n) {
   return n & Nl;
 }
-function Gu(n) {
+function Gd(n) {
   return (n - (n & Nl)) / Pl;
 }
 const Dl = 1, Il = 2, Sn = 4, Rl = 8;
@@ -4647,7 +4646,7 @@ class le {
     if (!this.inverted)
       for (let i = 0; i < r; i++)
         t += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1];
-    return this.ranges[r * 3] + t + Gu(e);
+    return this.ranges[r * 3] + t + Gd(e);
   }
   mapResult(e, t = 1) {
     return this._map(e, t, !1);
@@ -4664,15 +4663,15 @@ class le {
       let a = this.ranges[l] - (this.inverted ? i : 0);
       if (a > e)
         break;
-      let c = this.ranges[l + s], u = this.ranges[l + o], d = a + c;
-      if (e <= d) {
-        let f = c ? e == a ? -1 : e == d ? 1 : t : t, h = a + i + (f < 0 ? 0 : u);
+      let c = this.ranges[l + s], d = this.ranges[l + o], u = a + c;
+      if (e <= u) {
+        let f = c ? e == a ? -1 : e == u ? 1 : t : t, h = a + i + (f < 0 ? 0 : d);
         if (r)
           return h;
-        let p = e == (t < 0 ? a : d) ? null : Ju(l / 3, e - a), m = e == a ? Il : e == d ? Dl : Sn;
-        return (t < 0 ? e != a : e != d) && (m |= Rl), new Pi(h, m, p);
+        let p = e == (t < 0 ? a : u) ? null : Jd(l / 3, e - a), m = e == a ? Il : e == u ? Dl : Sn;
+        return (t < 0 ? e != a : e != u) && (m |= Rl), new Pi(h, m, p);
       }
-      i += u - c;
+      i += d - c;
     }
     return r ? e + i : new Pi(e + i, 0, null);
   }
@@ -4685,8 +4684,8 @@ class le {
       let a = this.ranges[l] - (this.inverted ? r : 0);
       if (a > e)
         break;
-      let c = this.ranges[l + s], u = a + c;
-      if (e <= u && l == i * 3)
+      let c = this.ranges[l + s], d = a + c;
+      if (e <= d && l == i * 3)
         return !0;
       r += this.ranges[l + o] - c;
     }
@@ -4699,8 +4698,8 @@ class le {
   forEach(e) {
     let t = this.inverted ? 2 : 1, r = this.inverted ? 1 : 2;
     for (let i = 0, s = 0; i < this.ranges.length; i += 3) {
-      let o = this.ranges[i], l = o - (this.inverted ? s : 0), a = o + (this.inverted ? 0 : s), c = this.ranges[i + t], u = this.ranges[i + r];
-      e(l, l + c, a, a + u), s += u - c;
+      let o = this.ranges[i], l = o - (this.inverted ? s : 0), a = o + (this.inverted ? 0 : s), c = this.ranges[i + t], d = this.ranges[i + r];
+      e(l, l + c, a, a + d), s += d - c;
     }
   }
   /**
@@ -5198,21 +5197,21 @@ function Di(n, e, t) {
   }
   return !1;
 }
-function Yu(n, e, t, r) {
+function Yd(n, e, t, r) {
   let i = [], s = [], o, l;
-  n.doc.nodesBetween(e, t, (a, c, u) => {
+  n.doc.nodesBetween(e, t, (a, c, d) => {
     if (!a.isInline)
       return;
-    let d = a.marks;
-    if (!r.isInSet(d) && u.type.allowsMarkType(r.type)) {
-      let f = Math.max(c, e), h = Math.min(c + a.nodeSize, t), p = r.addToSet(d);
-      for (let m = 0; m < d.length; m++)
-        d[m].isInSet(p) || (o && o.to == f && o.mark.eq(d[m]) ? o.to = h : i.push(o = new Ce(f, h, d[m])));
+    let u = a.marks;
+    if (!r.isInSet(u) && d.type.allowsMarkType(r.type)) {
+      let f = Math.max(c, e), h = Math.min(c + a.nodeSize, t), p = r.addToSet(u);
+      for (let m = 0; m < u.length; m++)
+        u[m].isInSet(p) || (o && o.to == f && o.mark.eq(u[m]) ? o.to = h : i.push(o = new Ce(f, h, u[m])));
       l && l.to == f ? l.to = h : s.push(l = new Ve(f, h, r));
     }
   }), i.forEach((a) => n.step(a)), s.forEach((a) => n.step(a));
 }
-function Xu(n, e, t, r) {
+function Xd(n, e, t, r) {
   let i = [], s = 0;
   n.doc.nodesBetween(e, t, (o, l) => {
     if (!o.isInline)
@@ -5220,38 +5219,38 @@ function Xu(n, e, t, r) {
     s++;
     let a = null;
     if (r instanceof pr) {
-      let c = o.marks, u;
-      for (; u = r.isInSet(c); )
-        (a || (a = [])).push(u), c = u.removeFromSet(c);
+      let c = o.marks, d;
+      for (; d = r.isInSet(c); )
+        (a || (a = [])).push(d), c = d.removeFromSet(c);
     } else
       r ? r.isInSet(o.marks) && (a = [r]) : a = o.marks;
     if (a && a.length) {
       let c = Math.min(l + o.nodeSize, t);
-      for (let u = 0; u < a.length; u++) {
-        let d = a[u], f;
+      for (let d = 0; d < a.length; d++) {
+        let u = a[d], f;
         for (let h = 0; h < i.length; h++) {
           let p = i[h];
-          p.step == s - 1 && d.eq(i[h].style) && (f = p);
+          p.step == s - 1 && u.eq(i[h].style) && (f = p);
         }
-        f ? (f.to = c, f.step = s) : i.push({ style: d, from: Math.max(l, e), to: c, step: s });
+        f ? (f.to = c, f.step = s) : i.push({ style: u, from: Math.max(l, e), to: c, step: s });
       }
     }
   }), i.forEach((o) => n.step(new Ce(o.from, o.to, o.style)));
 }
-function Qu(n, e, t, r = t.contentMatch) {
+function Qd(n, e, t, r = t.contentMatch) {
   let i = n.doc.nodeAt(e), s = [], o = e + 1;
   for (let l = 0; l < i.childCount; l++) {
-    let a = i.child(l), c = o + a.nodeSize, u = r.matchType(a.type);
-    if (!u)
+    let a = i.child(l), c = o + a.nodeSize, d = r.matchType(a.type);
+    if (!d)
       s.push(new V(o, c, S.empty));
     else {
-      r = u;
-      for (let d = 0; d < a.marks.length; d++)
-        t.allowsMarkType(a.marks[d].type) || n.step(new Ce(o, c, a.marks[d]));
+      r = d;
+      for (let u = 0; u < a.marks.length; u++)
+        t.allowsMarkType(a.marks[u].type) || n.step(new Ce(o, c, a.marks[u]));
       if (a.isText && !t.spec.code) {
-        let d, f = /\r?\n|\r/g, h;
-        for (; d = f.exec(a.text); )
-          h || (h = new S(b.from(t.schema.text(" ", t.allowedMarks(a.marks))), 0, 0)), s.push(new V(o + d.index, o + d.index + d[0].length, h));
+        let u, f = /\r?\n|\r/g, h;
+        for (; u = f.exec(a.text); )
+          h || (h = new S(b.from(t.schema.text(" ", t.allowedMarks(a.marks))), 0, 0)), s.push(new V(o + u.index, o + u.index + u[0].length, h));
       }
     }
     o = c;
@@ -5263,7 +5262,7 @@ function Qu(n, e, t, r = t.contentMatch) {
   for (let l = s.length - 1; l >= 0; l--)
     n.step(s[l]);
 }
-function Zu(n, e, t) {
+function Zd(n, e, t) {
   return (e == 0 || n.canReplace(e, n.childCount)) && (t == n.childCount || n.canReplace(0, t));
 }
 function Dt(n) {
@@ -5272,35 +5271,35 @@ function Dt(n) {
     let i = n.$from.node(r), s = n.$from.index(r), o = n.$to.indexAfter(r);
     if (r < n.depth && i.canReplace(s, o, t))
       return r;
-    if (r == 0 || i.type.spec.isolating || !Zu(i, s, o))
+    if (r == 0 || i.type.spec.isolating || !Zd(i, s, o))
       break;
   }
   return null;
 }
-function ed(n, e, t) {
-  let { $from: r, $to: i, depth: s } = e, o = r.before(s + 1), l = i.after(s + 1), a = o, c = l, u = b.empty, d = 0;
+function eu(n, e, t) {
+  let { $from: r, $to: i, depth: s } = e, o = r.before(s + 1), l = i.after(s + 1), a = o, c = l, d = b.empty, u = 0;
   for (let p = s, m = !1; p > t; p--)
-    m || r.index(p) > 0 ? (m = !0, u = b.from(r.node(p).copy(u)), d++) : a--;
+    m || r.index(p) > 0 ? (m = !0, d = b.from(r.node(p).copy(d)), u++) : a--;
   let f = b.empty, h = 0;
   for (let p = s, m = !1; p > t; p--)
     m || i.after(p + 1) < i.end(p) ? (m = !0, f = b.from(i.node(p).copy(f)), h++) : c++;
-  n.step(new z(a, c, o, l, new S(u.append(f), d, h), u.size - d, !0));
+  n.step(new z(a, c, o, l, new S(d.append(f), u, h), d.size - u, !0));
 }
 function rs(n, e, t = null, r = n) {
-  let i = td(n, e), s = i && nd(r, e);
+  let i = tu(n, e), s = i && nu(r, e);
   return s ? i.map(Ws).concat({ type: e, attrs: t }).concat(s.map(Ws)) : null;
 }
 function Ws(n) {
   return { type: n, attrs: null };
 }
-function td(n, e) {
+function tu(n, e) {
   let { parent: t, startIndex: r, endIndex: i } = n, s = t.contentMatchAt(r).findWrapping(e);
   if (!s)
     return null;
   let o = s.length ? s[0] : e;
   return t.canReplaceWith(r, i, o) ? s : null;
 }
-function nd(n, e) {
+function nu(n, e) {
   let { parent: t, startIndex: r, endIndex: i } = n, s = t.child(r), o = e.contentMatch.findWrapping(s.type);
   if (!o)
     return null;
@@ -5309,7 +5308,7 @@ function nd(n, e) {
     a = a.matchType(t.child(c).type);
   return !a || !a.validEnd ? null : o;
 }
-function rd(n, e, t) {
+function ru(n, e, t) {
   let r = b.empty;
   for (let o = t.length - 1; o >= 0; o--) {
     if (r.size) {
@@ -5322,23 +5321,23 @@ function rd(n, e, t) {
   let i = e.start, s = e.end;
   n.step(new z(i, s, i, s, new S(r, 0, 0), t.length, !0));
 }
-function id(n, e, t, r, i) {
+function iu(n, e, t, r, i) {
   if (!r.isTextblock)
     throw new RangeError("Type given to setBlockType should be a textblock");
   let s = n.steps.length;
   n.doc.nodesBetween(e, t, (o, l) => {
-    if (o.isTextblock && !o.hasMarkup(r, i) && sd(n.doc, n.mapping.slice(s).map(l), r)) {
+    if (o.isTextblock && !o.hasMarkup(r, i) && su(n.doc, n.mapping.slice(s).map(l), r)) {
       n.clearIncompatible(n.mapping.slice(s).map(l, 1), r);
-      let a = n.mapping.slice(s), c = a.map(l, 1), u = a.map(l + o.nodeSize, 1);
-      return n.step(new z(c, u, c + 1, u - 1, new S(b.from(r.create(i, null, o.marks)), 0, 0), 1, !0)), !1;
+      let a = n.mapping.slice(s), c = a.map(l, 1), d = a.map(l + o.nodeSize, 1);
+      return n.step(new z(c, d, c + 1, d - 1, new S(b.from(r.create(i, null, o.marks)), 0, 0), 1, !0)), !1;
     }
   });
 }
-function sd(n, e, t) {
+function su(n, e, t) {
   let r = n.resolve(e), i = r.index();
   return r.parent.canReplaceWith(i, i + 1, t);
 }
-function od(n, e, t, r, i) {
+function ou(n, e, t, r, i) {
   let s = n.doc.nodeAt(e);
   if (!s)
     throw new RangeError("No node at given position");
@@ -5354,25 +5353,25 @@ function vt(n, e, t = 1, r) {
   let i = n.resolve(e), s = i.depth - t, o = r && r[r.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;
-  for (let c = i.depth - 1, u = t - 2; c > s; c--, u--) {
-    let d = i.node(c), f = i.index(c);
-    if (d.type.spec.isolating)
+  for (let c = i.depth - 1, d = t - 2; c > s; c--, d--) {
+    let u = i.node(c), f = i.index(c);
+    if (u.type.spec.isolating)
       return !1;
-    let h = d.content.cutByIndex(f, d.childCount), p = r && r[u + 1];
+    let h = u.content.cutByIndex(f, u.childCount), p = r && r[d + 1];
     p && (h = h.replaceChild(0, p.type.create(p.attrs)));
-    let m = r && r[u] || d;
-    if (!d.canReplace(f + 1, d.childCount) || !m.type.validContent(h))
+    let m = r && r[d] || u;
+    if (!u.canReplace(f + 1, u.childCount) || !m.type.validContent(h))
       return !1;
   }
   let l = i.indexAfter(s), a = r && r[0];
   return i.node(s).canReplaceWith(l, l, a ? a.type : i.node(s + 1).type);
 }
-function ld(n, e, t = 1, r) {
+function lu(n, e, t = 1, r) {
   let i = n.doc.resolve(e), s = b.empty, o = b.empty;
   for (let l = i.depth, a = i.depth - t, c = t - 1; l > a; l--, c--) {
     s = b.from(i.node(l).copy(s));
-    let u = r && r[c];
-    o = b.from(u ? u.type.create(u.attrs, o) : i.node(l).copy(o));
+    let d = r && r[c];
+    o = b.from(d ? d.type.create(d.attrs, o) : i.node(l).copy(o));
   }
   n.step(new V(e, e, new S(s.append(o), t, t), !0));
 }
@@ -5394,11 +5393,11 @@ function Ll(n, e, t = -1) {
     e = t < 0 ? r.before(i) : r.after(i);
   }
 }
-function ad(n, e, t) {
+function au(n, e, t) {
   let r = new V(e - t, e + t, S.empty, !0);
   n.step(r);
 }
-function cd(n, e, t) {
+function cu(n, e, t) {
   let r = n.resolve(e);
   if (r.parent.canReplaceWith(r.index(), r.index(), t))
     return e;
@@ -5420,7 +5419,7 @@ function cd(n, e, t) {
     }
   return null;
 }
-function ud(n, e, t) {
+function du(n, e, t) {
   let r = n.resolve(e);
   if (!t.content.size)
     return e;
@@ -5429,14 +5428,14 @@ function ud(n, e, t) {
     i = i.firstChild.content;
   for (let s = 1; s <= (t.openStart == 0 && t.size ? 2 : 1); s++)
     for (let o = r.depth; o >= 0; o--) {
-      let l = o == r.depth ? 0 : r.pos <= (r.start(o + 1) + r.end(o + 1)) / 2 ? -1 : 1, a = r.index(o) + (l > 0 ? 1 : 0), c = r.node(o), u = !1;
+      let l = o == r.depth ? 0 : r.pos <= (r.start(o + 1) + r.end(o + 1)) / 2 ? -1 : 1, a = r.index(o) + (l > 0 ? 1 : 0), c = r.node(o), d = !1;
       if (s == 1)
-        u = c.canReplace(a, a, i);
+        d = c.canReplace(a, a, i);
       else {
-        let d = c.contentMatchAt(a).findWrapping(i.firstChild.type);
-        u = d && c.canReplaceWith(a, a, d[0]);
+        let u = c.contentMatchAt(a).findWrapping(i.firstChild.type);
+        d = u && c.canReplaceWith(a, a, u[0]);
       }
-      if (u)
+      if (d)
         return l == 0 ? r.pos : l < 0 ? r.before(o + 1) : r.after(o + 1);
     }
   return null;
@@ -5445,12 +5444,12 @@ function is(n, e, t = e, r = S.empty) {
   if (e == t && !r.size)
     return null;
   let i = n.resolve(e), s = n.resolve(t);
-  return Bl(i, s, r) ? new V(e, t, r) : new dd(i, s, r).fit();
+  return Bl(i, s, r) ? new V(e, t, r) : new uu(i, s, r).fit();
 }
 function Bl(n, e, t) {
   return !t.openStart && !t.openEnd && n.start() == e.start() && n.parent.canReplace(n.index(), e.index(), t.content);
 }
-class dd {
+class uu {
   constructor(e, t, r) {
     this.$from = e, this.$to = t, this.unplaced = r, this.frontier = [], this.placed = b.empty;
     for (let i = 0; i <= e.depth; i++) {
@@ -5499,11 +5498,11 @@ class dd {
         r ? (s = si(this.unplaced.content, r - 1).firstChild, i = s.content) : i = this.unplaced.content;
         let o = i.firstChild;
         for (let l = this.depth; l >= 0; l--) {
-          let { type: a, match: c } = this.frontier[l], u, d = null;
-          if (t == 1 && (o ? c.matchType(o.type) || (d = c.fillBefore(b.from(o), !1)) : s && a.compatibleContent(s.type)))
-            return { sliceDepth: r, frontierDepth: l, parent: s, inject: d };
-          if (t == 2 && o && (u = c.findWrapping(o.type)))
-            return { sliceDepth: r, frontierDepth: l, parent: s, wrap: u };
+          let { type: a, match: c } = this.frontier[l], d, u = null;
+          if (t == 1 && (o ? c.matchType(o.type) || (u = c.fillBefore(b.from(o), !1)) : s && a.compatibleContent(s.type)))
+            return { sliceDepth: r, frontierDepth: l, parent: s, inject: u };
+          if (t == 2 && o && (d = c.findWrapping(o.type)))
+            return { sliceDepth: r, frontierDepth: l, parent: s, wrap: d };
           if (s && c.matchType(s.type))
             break;
         }
@@ -5530,21 +5529,21 @@ class dd {
     if (s)
       for (let m = 0; m < s.length; m++)
         this.openFrontierNode(s[m]);
-    let o = this.unplaced, l = r ? r.content : o.content, a = o.openStart - e, c = 0, u = [], { match: d, type: f } = this.frontier[t];
+    let o = this.unplaced, l = r ? r.content : o.content, a = o.openStart - e, c = 0, d = [], { match: u, type: f } = this.frontier[t];
     if (i) {
       for (let m = 0; m < i.childCount; m++)
-        u.push(i.child(m));
-      d = d.matchFragment(i);
+        d.push(i.child(m));
+      u = u.matchFragment(i);
     }
     let h = l.size + e - (o.content.size - o.openEnd);
     for (; c < l.childCount; ) {
-      let m = l.child(c), g = d.matchType(m.type);
+      let m = l.child(c), g = u.matchType(m.type);
       if (!g)
         break;
-      c++, (c > 1 || a == 0 || m.content.size) && (d = g, u.push($l(m.mark(f.allowedMarks(m.marks)), c == 1 ? a : 0, c == l.childCount ? h : -1)));
+      c++, (c > 1 || a == 0 || m.content.size) && (u = g, d.push($l(m.mark(f.allowedMarks(m.marks)), c == 1 ? a : 0, c == l.childCount ? h : -1)));
     }
     let p = c == l.childCount;
-    p || (h = -1), this.placed = $t(this.placed, t, b.from(u)), this.frontier[t].match = d, p && h < 0 && r && r.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
+    p || (h = -1), this.placed = $t(this.placed, t, b.from(d)), 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;
@@ -5568,8 +5567,8 @@ class dd {
         let { match: r, type: i } = this.frontier[t], s = t < e.depth && e.end(t + 1) == e.pos + (e.depth - (t + 1)), o = oi(e, t, i, r, s);
         if (o) {
           for (let l = t - 1; l >= 0; l--) {
-            let { match: a, type: c } = this.frontier[l], u = oi(e, l, c, a, !0);
-            if (!u || u.childCount)
+            let { match: a, type: c } = this.frontier[l], d = oi(e, l, c, a, !0);
+            if (!d || d.childCount)
               continue e;
           }
           return { depth: t, fit: o, move: s ? e.doc.resolve(e.after(t + 1)) : e };
@@ -5620,18 +5619,18 @@ function oi(n, e, t, r, i) {
   if (o == s.childCount && !t.compatibleContent(s.type))
     return null;
   let l = r.fillBefore(s.content, !0, o);
-  return l && !fd(t, s.content, o) ? l : null;
+  return l && !fu(t, s.content, o) ? l : null;
 }
-function fd(n, e, t) {
+function fu(n, e, t) {
   for (let r = t; r < e.childCount; r++)
     if (!n.allowsMarks(e.child(r).marks))
       return !0;
   return !1;
 }
-function hd(n) {
+function hu(n) {
   return n.spec.defining || n.spec.definingForContent;
 }
-function pd(n, e, t, r) {
+function pu(n, e, t, r) {
   if (!r.size)
     return n.deleteRange(e, t);
   let i = n.doc.resolve(e), s = n.doc.resolve(t);
@@ -5647,22 +5646,22 @@ function pd(n, e, t, r) {
       break;
     o.indexOf(f) > -1 ? l = f : i.before(f) == h && o.splice(1, 0, -f);
   }
-  let a = o.indexOf(l), c = [], u = r.openStart;
+  let a = o.indexOf(l), c = [], d = r.openStart;
   for (let f = r.content, h = 0; ; h++) {
     let p = f.firstChild;
     if (c.push(p), h == r.openStart)
       break;
     f = p.content;
   }
-  for (let f = u - 1; f >= 0; f--) {
-    let h = c[f], p = hd(h.type);
+  for (let f = d - 1; f >= 0; f--) {
+    let h = c[f], p = hu(h.type);
     if (p && !h.sameMarkup(i.node(Math.abs(l) - 1)))
-      u = f;
+      d = f;
     else if (p || !h.type.isTextblock)
       break;
   }
   for (let f = r.openStart; f >= 0; f--) {
-    let h = (f + u + 1) % (r.openStart + 1), p = c[h];
+    let h = (f + d + 1) % (r.openStart + 1), p = c[h];
     if (p)
       for (let m = 0; m < o.length; m++) {
         let g = o[(m + a) % o.length], y = !0;
@@ -5672,8 +5671,8 @@ function pd(n, e, t, r) {
           return n.replace(i.before(g), y ? s.after(g) : t, new S(Fl(r.content, 0, r.openStart, h), h, r.openEnd));
       }
   }
-  let d = n.steps.length;
-  for (let f = o.length - 1; f >= 0 && (n.replace(e, t, r), !(n.steps.length > d)); f--) {
+  let u = n.steps.length;
+  for (let f = o.length - 1; f >= 0 && (n.replace(e, t, r), !(n.steps.length > u)); f--) {
     let h = o[f];
     h < 0 || (e = i.before(h), t = s.after(h));
   }
@@ -5689,14 +5688,14 @@ function Fl(n, e, t, r, i) {
   }
   return n;
 }
-function md(n, e, t, r) {
+function mu(n, e, t, r) {
   if (!r.isInline && e == t && n.doc.resolve(e).parent.content.size) {
-    let i = cd(n.doc, e, r.type);
+    let i = cu(n.doc, e, r.type);
     i != null && (e = t = i);
   }
   n.replaceRange(e, t, new S(b.from(r), 0, 0));
 }
-function gd(n, e, t) {
+function gu(n, e, t) {
   let r = n.doc.resolve(e), i = n.doc.resolve(t), s = zl(r, i);
   for (let o = 0; o < s.length; o++) {
     let l = s[o], a = o == s.length - 1;
@@ -5892,7 +5891,7 @@ class Hl {
   control over what happens.
   */
   replaceRange(e, t, r) {
-    return pd(this, e, t, r), this;
+    return pu(this, e, t, r), this;
   }
   /**
   Replace the given range with a node, but use `from` and `to` as
@@ -5904,14 +5903,14 @@ class Hl {
   that parent node.
   */
   replaceRangeWith(e, t, r) {
-    return md(this, e, t, r), this;
+    return mu(this, e, t, r), this;
   }
   /**
   Delete the given range, expanding it to cover fully covered
   parent nodes until a valid replace is found.
   */
   deleteRange(e, t) {
-    return gd(this, e, t), this;
+    return gu(this, e, t), this;
   }
   /**
   Split the content in the given range off from its parent, if there
@@ -5921,14 +5920,14 @@ class Hl {
   sure the lift is valid.
   */
   lift(e, t) {
-    return ed(this, e, t), this;
+    return eu(this, e, t), this;
   }
   /**
   Join the blocks around the given position. If depth is 2, their
   last and first siblings are also joined, and so on.
   */
   join(e, t = 1) {
-    return ad(this, e, t), this;
+    return au(this, e, t), this;
   }
   /**
   Wrap the given [range](https://prosemirror.net/docs/ref/#model.NodeRange) in the given set of wrappers.
@@ -5936,21 +5935,21 @@ class Hl {
   probably be computed with [`findWrapping`](https://prosemirror.net/docs/ref/#transform.findWrapping).
   */
   wrap(e, t) {
-    return rd(this, e, t), this;
+    return ru(this, e, t), this;
   }
   /**
   Set the type of all textblocks (partly) between `from` and `to` to
   the given node type with the given attributes.
   */
   setBlockType(e, t = e, r, i = null) {
-    return id(this, e, t, r, i), this;
+    return iu(this, e, t, r, i), this;
   }
   /**
   Change the type, attributes, and/or marks of the node at `pos`.
   When `type` isn't given, the existing node type is preserved,
   */
   setNodeMarkup(e, t, r = null, i) {
-    return od(this, e, t, r, i), this;
+    return ou(this, e, t, r, i), this;
   }
   /**
   Set a single attribute on a given node to a new value.
@@ -5994,13 +5993,13 @@ class Hl {
   use after the split.
   */
   split(e, t = 1, r) {
-    return ld(this, e, t, r), this;
+    return lu(this, e, t, r), this;
   }
   /**
   Add the given mark to the inline content between `from` and `to`.
   */
   addMark(e, t, r) {
-    return Yu(this, e, t, r), this;
+    return Yd(this, e, t, r), this;
   }
   /**
   Remove marks from inline nodes between `from` and `to`. When
@@ -6009,7 +6008,7 @@ class Hl {
   remove all marks of any type.
   */
   removeMark(e, t, r) {
-    return Xu(this, e, t, r), this;
+    return Xd(this, e, t, r), this;
   }
   /**
   Removes all marks and nodes from the content of the node at
@@ -6018,7 +6017,7 @@ class Hl {
   third argument.
   */
   clearIncompatible(e, t, r) {
-    return Qu(this, e, t, r), this;
+    return Qd(this, e, t, r), this;
   }
 }
 const li = /* @__PURE__ */ Object.create(null);
@@ -6029,7 +6028,7 @@ class A {
   `$head`.
   */
   constructor(e, t, r) {
-    this.$anchor = e, this.$head = t, this.ranges = r || [new yd(e.min(t), e.max(t))];
+    this.$anchor = e, this.$head = t, this.ranges = r || [new yu(e.min(t), e.max(t))];
   }
   /**
   The selection's anchor, as an unresolved position.
@@ -6093,8 +6092,8 @@ class A {
       i = r, r = r.lastChild;
     let s = e.steps.length, o = this.ranges;
     for (let l = 0; l < o.length; l++) {
-      let { $from: a, $to: c } = o[l], u = e.mapping.slice(s);
-      e.replaceRange(u.map(a.pos), u.map(c.pos), l ? S.empty : t), l == 0 && Js(e, s, (r ? r.isInline : i && i.isTextblock) ? -1 : 1);
+      let { $from: a, $to: c } = o[l], d = e.mapping.slice(s);
+      e.replaceRange(d.map(a.pos), d.map(c.pos), l ? S.empty : t), l == 0 && Js(e, s, (r ? r.isInline : i && i.isTextblock) ? -1 : 1);
     }
   }
   /**
@@ -6104,8 +6103,8 @@ class A {
   replaceWith(e, t) {
     let r = e.steps.length, i = this.ranges;
     for (let s = 0; s < i.length; s++) {
-      let { $from: o, $to: l } = i[s], a = e.mapping.slice(r), c = a.map(o.pos), u = a.map(l.pos);
-      s ? e.deleteRange(c, u) : (e.replaceRangeWith(c, u, t), Js(e, r, t.isInline ? -1 : 1));
+      let { $from: o, $to: l } = i[s], a = e.mapping.slice(r), c = a.map(o.pos), d = a.map(l.pos);
+      s ? e.deleteRange(c, d) : (e.replaceRangeWith(c, d, t), Js(e, r, t.isInline ? -1 : 1));
     }
   }
   /**
@@ -6187,7 +6186,7 @@ class A {
   }
 }
 A.prototype.visible = !0;
-class yd {
+class yu {
   /**
   Create a range.
   */
@@ -6375,11 +6374,11 @@ class ge extends A {
     return e instanceof ge;
   }
   getBookmark() {
-    return bd;
+    return bu;
   }
 }
 A.jsonID("all", ge);
-const bd = {
+const bu = {
   map() {
     return this;
   },
@@ -6412,12 +6411,12 @@ function Js(n, e, t) {
   if (!(i instanceof V || i instanceof z))
     return;
   let s = n.mapping.maps[r], o;
-  s.forEach((l, a, c, u) => {
-    o == null && (o = u);
+  s.forEach((l, a, c, d) => {
+    o == null && (o = d);
   }), n.setSelection(A.near(n.doc.resolve(o), t));
 }
 const Gs = 1, hn = 2, Ys = 4;
-class kd extends Hl {
+class ku extends Hl {
   /**
   @internal
   */
@@ -6576,7 +6575,7 @@ class Ft {
     this.name = e, this.init = Xs(t.init, r), this.apply = Xs(t.apply, r);
   }
 }
-const Sd = [
+const Su = [
   new Ft("doc", {
     init(n) {
       return n.doc || n.schema.topNodeType.createAndFill();
@@ -6612,7 +6611,7 @@ const Sd = [
 ];
 class ai {
   constructor(e, t) {
-    this.schema = e, this.plugins = [], this.pluginsByKey = /* @__PURE__ */ Object.create(null), this.fields = Sd.slice(), t && t.forEach((r) => {
+    this.schema = e, this.plugins = [], this.pluginsByKey = /* @__PURE__ */ Object.create(null), this.fields = Su.slice(), t && t.forEach((r) => {
       if (this.pluginsByKey[r.key])
         throw new RangeError("Adding different instances of a keyed plugin (" + r.key + ")");
       this.plugins.push(r), this.pluginsByKey[r.key] = r, r.spec.state && this.fields.push(new Ft(r.key, r.spec.state, r));
@@ -6672,14 +6671,14 @@ class xt {
       for (let o = 0; o < this.config.plugins.length; o++) {
         let l = this.config.plugins[o];
         if (l.spec.appendTransaction) {
-          let a = i ? i[o].n : 0, c = i ? i[o].state : this, u = a < t.length && l.spec.appendTransaction.call(l, a ? t.slice(a) : t, c, r);
-          if (u && r.filterTransaction(u, o)) {
-            if (u.setMeta("appendedTransaction", e), !i) {
+          let a = i ? i[o].n : 0, c = i ? i[o].state : this, d = a < t.length && l.spec.appendTransaction.call(l, a ? t.slice(a) : t, c, r);
+          if (d && r.filterTransaction(d, o)) {
+            if (d.setMeta("appendedTransaction", e), !i) {
               i = [];
-              for (let d = 0; d < this.config.plugins.length; d++)
-                i.push(d < o ? { state: r, n: t.length } : { state: this, n: 0 });
+              for (let u = 0; u < this.config.plugins.length; u++)
+                i.push(u < o ? { state: r, n: t.length } : { state: this, n: 0 });
             }
-            t.push(u), r = r.applyInner(u), s = !0;
+            t.push(d), r = r.applyInner(d), s = !0;
           }
           i && (i[o] = { state: r, n: t.length });
         }
@@ -6705,7 +6704,7 @@ class xt {
   Start a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.
   */
   get tr() {
-    return new kd(this);
+    return new ku(this);
   }
   /**
   Create a new state.
@@ -6844,14 +6843,14 @@ const Ne = function(n, e, t) {
   return r.setEnd(n, t ?? n.nodeValue.length), r.setStart(n, e || 0), r;
 }, ft = function(n, e, t, r) {
   return t && (Zs(n, e, t, r, -1) || Zs(n, e, t, r, 1));
-}, xd = /^(img|br|input|textarea|hr)$/i;
+}, xu = /^(img|br|input|textarea|hr)$/i;
 function Zs(n, e, t, r, i) {
   for (; ; ) {
     if (n == t && e == r)
       return !0;
     if (e == (i < 0 ? 0 : Oe(n))) {
       let s = n.parentNode;
-      if (!s || s.nodeType != 1 || ls(n) || xd.test(n.nodeName) || n.contentEditable == "false")
+      if (!s || s.nodeType != 1 || ls(n) || xu.test(n.nodeName) || n.contentEditable == "false")
         return !1;
       e = Y(n) + (i < 0 ? 0 : 1), n = s;
     } else if (n.nodeType == 1) {
@@ -6865,7 +6864,7 @@ function Zs(n, e, t, r, i) {
 function Oe(n) {
   return n.nodeType == 3 ? n.nodeValue.length : n.childNodes.length;
 }
-function Od(n, e, t) {
+function Ou(n, e, t) {
   for (let r = e == 0, i = e == Oe(n); r || i; ) {
     if (n == t)
       return !0;
@@ -6888,13 +6887,13 @@ function et(n, e) {
   let t = document.createEvent("Event");
   return t.initEvent("keydown", !0, !0), t.keyCode = n, t.key = t.code = e, t;
 }
-function vd(n) {
+function vu(n) {
   let e = n.activeElement;
   for (; e && e.shadowRoot; )
     e = e.shadowRoot.activeElement;
   return e;
 }
-function Cd(n, e, t) {
+function Cu(n, e, t) {
   if (n.caretPositionFromPoint)
     try {
       let r = n.caretPositionFromPoint(e, t);
@@ -6910,8 +6909,8 @@ function Cd(n, e, t) {
 }
 const Ee = typeof navigator < "u" ? navigator : null, eo = typeof document < "u" ? document : null, Xe = Ee && Ee.userAgent || "", Ii = /Edge\/(\d+)/.exec(Xe), ql = /MSIE \d/.exec(Xe), Ri = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(Xe), ie = !!(ql || Ri || Ii), Ke = ql ? document.documentMode : Ri ? +Ri[1] : Ii ? +Ii[1] : 0, ye = !ie && /gecko\/(\d+)/i.test(Xe);
 ye && +(/Firefox\/(\d+)/.exec(Xe) || [0, 0])[1];
-const _i = !ie && /Chrome\/(\d+)/.exec(Xe), U = !!_i, Ed = _i ? +_i[1] : 0, X = !ie && !!Ee && /Apple Computer/.test(Ee.vendor), wt = X && (/Mobile\/\w+/.test(Xe) || !!Ee && Ee.maxTouchPoints > 2), de = wt || (Ee ? /Mac/.test(Ee.platform) : !1), Td = Ee ? /Win/.test(Ee.platform) : !1, me = /Android \d/.test(Xe), ln = !!eo && "webkitFontSmoothing" in eo.documentElement.style, Md = ln ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
-function wd(n) {
+const _i = !ie && /Chrome\/(\d+)/.exec(Xe), U = !!_i, Eu = _i ? +_i[1] : 0, X = !ie && !!Ee && /Apple Computer/.test(Ee.vendor), wt = X && (/Mobile\/\w+/.test(Xe) || !!Ee && Ee.maxTouchPoints > 2), ue = wt || (Ee ? /Mac/.test(Ee.platform) : !1), Tu = Ee ? /Win/.test(Ee.platform) : !1, me = /Android \d/.test(Xe), ln = !!eo && "webkitFontSmoothing" in eo.documentElement.style, Mu = ln ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
+function wu(n) {
   return {
     left: 0,
     right: n.documentElement.clientWidth,
@@ -6922,7 +6921,7 @@ function wd(n) {
 function Me(n, e) {
   return typeof n == "number" ? n : n[e];
 }
-function Ad(n) {
+function Au(n) {
   let e = n.getBoundingClientRect(), t = e.width / n.offsetWidth || 1, r = e.height / n.offsetHeight || 1;
   return {
     left: e.left,
@@ -6936,13 +6935,13 @@ function to(n, e, t) {
   for (let o = t || n.dom; o; o = Xt(o)) {
     if (o.nodeType != 1)
       continue;
-    let l = o, a = l == s.body, c = a ? wd(s) : Ad(l), u = 0, d = 0;
-    if (e.top < c.top + Me(r, "top") ? d = -(c.top - e.top + Me(i, "top")) : e.bottom > c.bottom - Me(r, "bottom") && (d = e.bottom - e.top > c.bottom - c.top ? e.top + Me(i, "top") - c.top : e.bottom - c.bottom + Me(i, "bottom")), e.left < c.left + Me(r, "left") ? u = -(c.left - e.left + Me(i, "left")) : e.right > c.right - Me(r, "right") && (u = e.right - c.right + Me(i, "right")), u || d)
+    let l = o, a = l == s.body, c = a ? wu(s) : Au(l), d = 0, u = 0;
+    if (e.top < c.top + Me(r, "top") ? u = -(c.top - e.top + Me(i, "top")) : e.bottom > c.bottom - Me(r, "bottom") && (u = e.bottom - e.top > c.bottom - c.top ? e.top + Me(i, "top") - c.top : e.bottom - c.bottom + Me(i, "bottom")), e.left < c.left + Me(r, "left") ? d = -(c.left - e.left + Me(i, "left")) : e.right > c.right - Me(r, "right") && (d = e.right - c.right + Me(i, "right")), d || u)
       if (a)
-        s.defaultView.scrollBy(u, d);
+        s.defaultView.scrollBy(d, u);
       else {
         let f = l.scrollLeft, h = l.scrollTop;
-        d && (l.scrollTop += d), u && (l.scrollLeft += u);
+        u && (l.scrollTop += u), d && (l.scrollLeft += d);
         let p = l.scrollLeft - f, m = l.scrollTop - h;
         e = { left: e.left - p, top: e.top - m, right: e.right - p, bottom: e.bottom - m };
       }
@@ -6950,7 +6949,7 @@ function to(n, e, t) {
       break;
   }
 }
-function Nd(n) {
+function Nu(n) {
   let e = n.dom.getBoundingClientRect(), t = Math.max(0, e.top), r, i;
   for (let s = (e.left + e.right) / 2, o = t + 1; o < Math.min(innerHeight, e.bottom); o += 5) {
     let l = n.root.elementFromPoint(s, o);
@@ -6970,7 +6969,7 @@ function Wl(n) {
     ;
   return e;
 }
-function Pd({ refDOM: n, refTop: e, stack: t }) {
+function Pu({ refDOM: n, refTop: e, stack: t }) {
   let r = n ? n.getBoundingClientRect().top : 0;
   Kl(t, r == 0 ? 0 : r - e);
 }
@@ -6981,7 +6980,7 @@ function Kl(n, e) {
   }
 }
 let mt = null;
-function Dd(n) {
+function Du(n) {
   if (n.setActive)
     return n.setActive();
   if (mt)
@@ -6995,12 +6994,12 @@ function Dd(n) {
 }
 function Ul(n, e) {
   let t, r = 2e8, i, s = 0, o = e.top, l = e.top, a, c;
-  for (let u = n.firstChild, d = 0; u; u = u.nextSibling, d++) {
+  for (let d = n.firstChild, u = 0; d; d = d.nextSibling, u++) {
     let f;
-    if (u.nodeType == 1)
-      f = u.getClientRects();
-    else if (u.nodeType == 3)
-      f = Ne(u).getClientRects();
+    if (d.nodeType == 1)
+      f = d.getClientRects();
+    else if (d.nodeType == 3)
+      f = Ne(d).getClientRects();
     else
       continue;
     for (let h = 0; h < f.length; h++) {
@@ -7009,20 +7008,20 @@ function Ul(n, e) {
         o = Math.max(p.bottom, o), l = Math.min(p.top, l);
         let m = p.left > e.left ? p.left - e.left : p.right < e.left ? e.left - p.right : 0;
         if (m < r) {
-          t = u, r = m, i = m && t.nodeType == 3 ? {
+          t = d, r = m, i = m && t.nodeType == 3 ? {
             left: p.right < e.left ? p.right : p.left,
             top: e.top
-          } : e, u.nodeType == 1 && m && (s = d + (e.left >= (p.left + p.right) / 2 ? 1 : 0));
+          } : e, d.nodeType == 1 && m && (s = u + (e.left >= (p.left + p.right) / 2 ? 1 : 0));
           continue;
         }
       } else
-        p.top > e.top && !a && p.left <= e.left && p.right >= e.left && (a = u, c = { left: Math.max(p.left, Math.min(p.right, e.left)), top: p.top });
-      !t && (e.left >= p.right && e.top >= p.top || e.left >= p.left && e.top >= p.bottom) && (s = d + 1);
+        p.top > e.top && !a && p.left <= e.left && p.right >= e.left && (a = d, c = { left: Math.max(p.left, Math.min(p.right, e.left)), top: p.top });
+      !t && (e.left >= p.right && e.top >= p.top || e.left >= p.left && e.top >= p.bottom) && (s = u + 1);
     }
   }
-  return !t && a && (t = a, i = c, r = 0), t && t.nodeType == 3 ? Id(t, i) : !t || r && t.nodeType == 1 ? { node: n, offset: s } : Ul(t, i);
+  return !t && a && (t = a, i = c, r = 0), t && t.nodeType == 3 ? Iu(t, i) : !t || r && t.nodeType == 1 ? { node: n, offset: s } : Ul(t, i);
 }
-function Id(n, e) {
+function Iu(n, e) {
   let t = n.nodeValue.length, r = document.createRange();
   for (let i = 0; i < t; i++) {
     r.setEnd(n, i + 1), r.setStart(n, i);
@@ -7035,11 +7034,11 @@ function Id(n, e) {
 function as(n, e) {
   return n.left >= e.left - 1 && n.left <= e.right + 1 && n.top >= e.top - 1 && n.top <= e.bottom + 1;
 }
-function Rd(n, e) {
+function Ru(n, e) {
   let t = n.parentNode;
   return t && /^li$/i.test(t.nodeName) && e.left < n.getBoundingClientRect().left ? t : n;
 }
-function _d(n, e, t) {
+function _u(n, e, t) {
   let { node: r, offset: i } = Ul(e, t), s = -1;
   if (r.nodeType == 1 && !r.firstChild) {
     let o = r.getBoundingClientRect();
@@ -7047,7 +7046,7 @@ function _d(n, e, t) {
   }
   return n.docView.posFromDOM(r, i, s);
 }
-function Ld(n, e, t, r) {
+function Lu(n, e, t, r) {
   let i = -1;
   for (let s = e, o = !1; s != n.dom; ) {
     let l = n.docView.nearestDesc(s, !0);
@@ -7080,8 +7079,8 @@ function Jl(n, e, t) {
     }
   return n;
 }
-function Bd(n, e) {
-  let t = n.dom.ownerDocument, r, i = 0, s = Cd(t, e.left, e.top);
+function Bu(n, e) {
+  let t = n.dom.ownerDocument, r, i = 0, s = Cu(t, e.left, e.top);
   s && ({ node: r, offset: i } = s);
   let o = (n.root.elementFromPoint ? n.root : t).elementFromPoint(e.left, e.top), l;
   if (!o || !n.dom.contains(o.nodeType != 1 ? o.parentNode : o)) {
@@ -7092,15 +7091,15 @@ function Bd(n, e) {
   if (X)
     for (let c = o; r && c; c = Xt(c))
       c.draggable && (r = void 0);
-  if (o = Rd(o, e), r) {
+  if (o = Ru(o, e), r) {
     if (ye && r.nodeType == 1 && (i = Math.min(i, r.childNodes.length), i < r.childNodes.length)) {
-      let u = r.childNodes[i], d;
-      u.nodeName == "IMG" && (d = u.getBoundingClientRect()).right <= e.left && d.bottom > e.top && i++;
+      let d = r.childNodes[i], u;
+      d.nodeName == "IMG" && (u = d.getBoundingClientRect()).right <= e.left && u.bottom > e.top && i++;
     }
     let c;
-    ln && i && r.nodeType == 1 && (c = r.childNodes[i - 1]).nodeType == 1 && c.contentEditable == "false" && c.getBoundingClientRect().top >= e.top && i--, r == n.dom && i == r.childNodes.length - 1 && r.lastChild.nodeType == 1 && e.top > r.lastChild.getBoundingClientRect().bottom ? l = n.state.doc.content.size : (i == 0 || r.nodeType != 1 || r.childNodes[i - 1].nodeName != "BR") && (l = Ld(n, r, i, e));
+    ln && i && r.nodeType == 1 && (c = r.childNodes[i - 1]).nodeType == 1 && c.contentEditable == "false" && c.getBoundingClientRect().top >= e.top && i--, r == n.dom && i == r.childNodes.length - 1 && r.lastChild.nodeType == 1 && e.top > r.lastChild.getBoundingClientRect().bottom ? l = n.state.doc.content.size : (i == 0 || r.nodeType != 1 || r.childNodes[i - 1].nodeName != "BR") && (l = Lu(n, r, i, e));
   }
-  l == null && (l = _d(n, o, e));
+  l == null && (l = _u(n, o, e));
   let a = n.docView.nearestDesc(o, !0);
   return { pos: l, inside: a ? a.posAtStart - a.border : -1 };
 }
@@ -7116,37 +7115,37 @@ function $e(n, e) {
   }
   return Array.prototype.find.call(t, no) || n.getBoundingClientRect();
 }
-const $d = /[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac]/;
+const $u = /[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac]/;
 function Gl(n, e, t) {
   let { node: r, offset: i, atom: s } = n.docView.domFromPos(e, t < 0 ? -1 : 1), o = ln || ye;
   if (r.nodeType == 3)
-    if (o && ($d.test(r.nodeValue) || (t < 0 ? !i : i == r.nodeValue.length))) {
+    if (o && ($u.test(r.nodeValue) || (t < 0 ? !i : i == r.nodeValue.length))) {
       let a = $e(Ne(r, i, i), t);
       if (ye && i && /\s/.test(r.nodeValue[i - 1]) && i < r.nodeValue.length) {
         let c = $e(Ne(r, i - 1, i - 1), -1);
         if (c.top == a.top) {
-          let u = $e(Ne(r, i, i + 1), -1);
-          if (u.top != a.top)
-            return _t(u, u.left < c.left);
+          let d = $e(Ne(r, i, i + 1), -1);
+          if (d.top != a.top)
+            return _t(d, d.left < c.left);
         }
       }
       return a;
     } else {
-      let a = i, c = i, u = t < 0 ? 1 : -1;
-      return t < 0 && !i ? (c++, u = -1) : t >= 0 && i == r.nodeValue.length ? (a--, u = 1) : t < 0 ? a-- : c++, _t($e(Ne(r, a, c), u), u < 0);
+      let a = i, c = i, d = t < 0 ? 1 : -1;
+      return t < 0 && !i ? (c++, d = -1) : t >= 0 && i == r.nodeValue.length ? (a--, d = 1) : t < 0 ? a-- : c++, _t($e(Ne(r, a, c), d), d < 0);
     }
   if (!n.state.doc.resolve(e - (s || 0)).parent.inlineContent) {
     if (s == null && i && (t < 0 || i == Oe(r))) {
       let a = r.childNodes[i - 1];
       if (a.nodeType == 1)
-        return ui(a.getBoundingClientRect(), !1);
+        return di(a.getBoundingClientRect(), !1);
     }
     if (s == null && i < Oe(r)) {
       let a = r.childNodes[i];
       if (a.nodeType == 1)
-        return ui(a.getBoundingClientRect(), !0);
+        return di(a.getBoundingClientRect(), !0);
     }
-    return ui(r.getBoundingClientRect(), t >= 0);
+    return di(r.getBoundingClientRect(), t >= 0);
   }
   if (s == null && i && (t < 0 || i == Oe(r))) {
     let a = r.childNodes[i - 1], c = a.nodeType == 3 ? Ne(a, Oe(a) - (o ? 0 : 1)) : a.nodeType == 1 && (a.nodeName != "BR" || !a.nextSibling) ? a : null;
@@ -7169,7 +7168,7 @@ function _t(n, e) {
   let t = e ? n.left : n.right;
   return { top: n.top, bottom: n.bottom, left: t, right: t };
 }
-function ui(n, e) {
+function di(n, e) {
   if (n.height == 0)
     return n;
   let t = e ? n.top : n.bottom;
@@ -7184,7 +7183,7 @@ function Yl(n, e, t) {
     r != e && n.updateState(r), i != n.dom && i && i.focus();
   }
 }
-function Fd(n, e, t) {
+function Fu(n, e, t) {
   let r = e.selection, i = t == "up" ? r.$from : r.$to;
   return Yl(n, e, () => {
     let { node: s } = n.docView.domFromPos(i.pos, t == "up" ? -1 : 1);
@@ -7208,34 +7207,34 @@ function Fd(n, e, t) {
       else
         continue;
       for (let c = 0; c < a.length; c++) {
-        let u = a[c];
-        if (u.bottom > u.top + 1 && (t == "up" ? o.top - u.top > (u.bottom - o.top) * 2 : u.bottom - o.bottom > (o.bottom - u.top) * 2))
+        let d = a[c];
+        if (d.bottom > d.top + 1 && (t == "up" ? o.top - d.top > (d.bottom - o.top) * 2 : d.bottom - o.bottom > (o.bottom - d.top) * 2))
           return !1;
       }
     }
     return !0;
   });
 }
-const zd = /[\u0590-\u08ac]/;
-function Hd(n, e, t) {
+const zu = /[\u0590-\u08ac]/;
+function Hu(n, e, t) {
   let { $head: r } = e.selection;
   if (!r.parent.isTextblock)
     return !1;
   let i = r.parentOffset, s = !i, o = i == r.parent.content.size, l = n.domSelection();
-  return !zd.test(r.parent.textContent) || !l.modify ? t == "left" || t == "backward" ? s : o : Yl(n, e, () => {
-    let { focusNode: a, focusOffset: c, anchorNode: u, anchorOffset: d } = n.domSelectionRange(), f = l.caretBidiLevel;
+  return !zu.test(r.parent.textContent) || !l.modify ? t == "left" || t == "backward" ? s : o : Yl(n, e, () => {
+    let { focusNode: a, focusOffset: c, anchorNode: d, anchorOffset: u } = n.domSelectionRange(), f = l.caretBidiLevel;
     l.modify("move", t, "character");
     let h = r.depth ? n.docView.domAfterPos(r.before()) : n.dom, { focusNode: p, focusOffset: m } = n.domSelectionRange(), g = p && !h.contains(p.nodeType == 1 ? p : p.parentNode) || a == p && c == m;
     try {
-      l.collapse(u, d), a && (a != u || c != d) && l.extend && l.extend(a, c);
+      l.collapse(d, u), a && (a != d || c != u) && l.extend && l.extend(a, c);
     } catch {
     }
     return f != null && (l.caretBidiLevel = f), g;
   });
 }
 let ro = null, io = null, so = !1;
-function jd(n, e, t) {
-  return ro == e && io == t ? so : (ro = e, io = t, so = t == "up" || t == "down" ? Fd(n, e, t) : Hd(n, e, t));
+function ju(n, e, t) {
+  return ro == e && io == t ? so : (ro = e, io = t, so = t == "up" || t == "down" ? Fu(n, e, t) : Hu(n, e, t));
 }
 const fe = 0, oo = 1, tt = 2, Te = 3;
 class an {
@@ -7434,12 +7433,12 @@ class an {
     for (let o = r, l = 0; ; l++) {
       let a = this.children[l], c = o + a.size;
       if (i == -1 && e <= c) {
-        let u = o + a.border;
-        if (e >= u && t <= c - a.border && a.node && a.contentDOM && this.contentDOM.contains(a.contentDOM))
-          return a.parseRange(e, t, u);
+        let d = o + a.border;
+        if (e >= d && t <= c - a.border && a.node && a.contentDOM && this.contentDOM.contains(a.contentDOM))
+          return a.parseRange(e, t, d);
         e = o;
-        for (let d = l; d > 0; d--) {
-          let f = this.children[d - 1];
+        for (let u = l; u > 0; u--) {
+          let f = this.children[u - 1];
           if (f.size && f.dom.parentNode == this.contentDOM && !f.emptyChildAt(1)) {
             i = Y(f.dom) + 1;
             break;
@@ -7450,13 +7449,13 @@ class an {
       }
       if (i > -1 && (c > t || l == this.children.length - 1)) {
         t = c;
-        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 = Y(d.dom);
+        for (let d = l + 1; d < this.children.length; d++) {
+          let u = this.children[d];
+          if (u.size && u.dom.parentNode == this.contentDOM && !u.emptyChildAt(-1)) {
+            s = Y(u.dom);
             break;
           }
-          t += d.size;
+          t += u.size;
         }
         s == -1 && (s = this.contentDOM.childNodes.length);
         break;
@@ -7490,12 +7489,12 @@ class an {
         return p.setSelection(e - h - p.border, t - h - p.border, r, i);
       h = m;
     }
-    let l = this.domFromPos(e, e ? -1 : 1), a = t == e ? l : this.domFromPos(t, t ? -1 : 1), c = r.getSelection(), u = !1;
+    let l = this.domFromPos(e, e ? -1 : 1), a = t == e ? l : this.domFromPos(t, t ? -1 : 1), c = r.getSelection(), d = !1;
     if ((ye || X) && e == t) {
       let { node: f, offset: h } = l;
       if (f.nodeType == 3) {
-        if (u = !!(h && f.nodeValue[h - 1] == `
-`), u && h == f.nodeValue.length)
+        if (d = !!(h && f.nodeValue[h - 1] == `
+`), d && h == f.nodeValue.length)
           for (let p = f, m; p; p = p.parentNode) {
             if (m = p.nextSibling) {
               m.nodeName == "BR" && (l = a = { node: m.parentNode, offset: Y(m) + 1 });
@@ -7507,24 +7506,24 @@ class an {
           }
       } else {
         let p = f.childNodes[h - 1];
-        u = p && (p.nodeName == "BR" || p.contentEditable == "false");
+        d = p && (p.nodeName == "BR" || p.contentEditable == "false");
       }
     }
     if (ye && c.focusNode && c.focusNode != a.node && c.focusNode.nodeType == 1) {
       let f = c.focusNode.childNodes[c.focusOffset];
       f && f.contentEditable == "false" && (i = !0);
     }
-    if (!(i || u && X) && ft(l.node, l.offset, c.anchorNode, c.anchorOffset) && ft(a.node, a.offset, c.focusNode, c.focusOffset))
+    if (!(i || d && X) && ft(l.node, l.offset, c.anchorNode, c.anchorOffset) && ft(a.node, a.offset, c.focusNode, c.focusOffset))
       return;
-    let d = !1;
-    if ((c.extend || e == t) && !u) {
+    let u = !1;
+    if ((c.extend || e == t) && !d) {
       c.collapse(l.node, l.offset);
       try {
-        e != t && c.extend(a.node, a.offset), d = !0;
+        e != t && c.extend(a.node, a.offset), u = !0;
       } catch {
       }
     }
-    if (!d) {
+    if (!u) {
       if (e > t) {
         let h = l;
         l = a, a = h;
@@ -7610,7 +7609,7 @@ class Xl extends an {
     return this.widget.type.side;
   }
 }
-class Vd extends an {
+class Vu extends an {
   constructor(e, t, r, i) {
     super(e, [], t, null), this.textDOM = r, this.text = i;
   }
@@ -7676,17 +7675,17 @@ class Ue extends an {
         return o;
       if (a.parent)
         return a.parent.posBeforeChild(a);
-    }, r, i), u = c && c.dom, d = c && c.contentDOM;
+    }, r, i), d = c && c.dom, u = c && c.contentDOM;
     if (t.isText) {
-      if (!u)
-        u = document.createTextNode(t.text);
-      else if (u.nodeType != 3)
+      if (!d)
+        d = document.createTextNode(t.text);
+      else if (d.nodeType != 3)
         throw new RangeError("Text must be rendered as a DOM text node");
     } else
-      u || ({ dom: u, contentDOM: d } = ve.renderSpec(document, t.type.spec.toDOM(t)));
-    !d && !t.isText && u.nodeName != "BR" && (u.hasAttribute("contenteditable") || (u.contentEditable = "false"), t.type.spec.draggable && (u.draggable = !0));
-    let f = u;
-    return u = ta(u, r, t), c ? a = new qd(e, t, r, i, u, d || null, f, c, s, o + 1) : t.isText ? new yr(e, t, r, i, u, f, s) : new Ue(e, t, r, i, u, d || null, f, s, o + 1);
+      d || ({ dom: d, contentDOM: u } = ve.renderSpec(document, t.type.spec.toDOM(t)));
+    !u && !t.isText && d.nodeName != "BR" && (d.hasAttribute("contenteditable") || (d.contentEditable = "false"), t.type.spec.draggable && (d.draggable = !0));
+    let f = d;
+    return d = ta(d, r, t), c ? a = new qu(e, t, r, i, d, u || null, f, c, s, o + 1) : t.isText ? new yr(e, t, r, i, d, f, s) : new Ue(e, t, r, i, d, u || null, f, s, o + 1);
   }
   parseRule() {
     if (this.node.type.spec.reparseInView)
@@ -7722,24 +7721,24 @@ class Ue extends an {
   // separate step, syncs the DOM inside `this.contentDOM` to
   // `this.children`.
   updateChildren(e, t) {
-    let r = this.node.inlineContent, i = t, s = e.composing ? this.localCompositionInfo(e, t) : null, o = s && s.pos > -1 ? s : null, l = s && s.pos < 0, a = new Kd(this, o && o.node, e);
-    Gd(this.node, this.innerDeco, (c, u, d) => {
-      c.spec.marks ? a.syncToMarks(c.spec.marks, r, e) : c.type.side >= 0 && !d && a.syncToMarks(u == this.node.childCount ? R.none : this.node.child(u).marks, r, e), a.placeWidget(c, e, i);
-    }, (c, u, d, f) => {
+    let r = this.node.inlineContent, i = t, s = e.composing ? this.localCompositionInfo(e, t) : null, o = s && s.pos > -1 ? s : null, l = s && s.pos < 0, a = new Ku(this, o && o.node, e);
+    Gu(this.node, this.innerDeco, (c, d, u) => {
+      c.spec.marks ? a.syncToMarks(c.spec.marks, r, e) : c.type.side >= 0 && !u && a.syncToMarks(d == this.node.childCount ? R.none : this.node.child(d).marks, r, e), a.placeWidget(c, e, i);
+    }, (c, d, u, f) => {
       a.syncToMarks(c.marks, r, e);
       let h;
-      a.findNodeMatch(c, u, d, f) || l && e.state.selection.from > i && e.state.selection.to < i + c.nodeSize && (h = a.findIndexWithChild(s.node)) > -1 && a.updateNodeAt(c, u, d, h, e) || a.updateNextNode(c, u, d, e, f, i) || a.addNode(c, u, d, e, i), i += c.nodeSize;
-    }), a.syncToMarks([], r, e), this.node.isTextblock && a.addTextblockHacks(), a.destroyRest(), (a.changed || this.dirty == tt) && (o && this.protectLocalComposition(e, o), Zl(this.contentDOM, this.children, e), wt && Yd(this.dom));
+      a.findNodeMatch(c, d, u, f) || l && e.state.selection.from > i && e.state.selection.to < i + c.nodeSize && (h = a.findIndexWithChild(s.node)) > -1 && a.updateNodeAt(c, d, u, h, e) || a.updateNextNode(c, d, u, e, f, i) || a.addNode(c, d, u, e, i), i += c.nodeSize;
+    }), a.syncToMarks([], r, e), this.node.isTextblock && a.addTextblockHacks(), a.destroyRest(), (a.changed || this.dirty == tt) && (o && this.protectLocalComposition(e, o), Zl(this.contentDOM, this.children, e), wt && Yu(this.dom));
   }
   localCompositionInfo(e, t) {
     let { from: r, to: i } = e.state.selection;
     if (!(e.state.selection instanceof N) || r < t || i > t + this.node.content.size)
       return null;
-    let s = e.domSelectionRange(), o = Xd(s.focusNode, s.focusOffset);
+    let s = e.domSelectionRange(), o = Xu(s.focusNode, s.focusOffset);
     if (!o || !this.dom.contains(o.parentNode))
       return null;
     if (this.node.inlineContent) {
-      let l = o.nodeValue, a = Qd(this.node.content, l, r - t, i - t);
+      let l = o.nodeValue, a = Qu(this.node.content, l, r - t, i - t);
       return a < 0 ? null : { node: o, pos: a, text: l };
     } else
       return { node: o, pos: -1, text: "" };
@@ -7755,7 +7754,7 @@ class Ue extends an {
         s.parentNode.removeChild(s.nextSibling);
       s.pmViewDesc && (s.pmViewDesc = void 0);
     }
-    let o = new Vd(this, s, t, i);
+    let o = new Vu(this, s, t, i);
     e.input.compositionNodes.push(o), this.children = $i(this.children, r, r + i.length, e, o);
   }
   // If this desc must be updated to match the given node decoration,
@@ -7843,9 +7842,9 @@ class Ql extends an {
     return this.dom.nodeName == "IMG";
   }
 }
-class qd extends Ue {
-  constructor(e, t, r, i, s, o, l, a, c, u) {
-    super(e, t, r, i, s, o, l, c, u), this.spec = a;
+class qu extends Ue {
+  constructor(e, t, r, i, s, o, l, a, c, d) {
+    super(e, t, r, i, s, o, l, c, d), this.spec = a;
   }
   // A custom `update` method gets to decide whether the update goes
   // through. If it does, and there's a `contentDOM` node, our logic
@@ -7928,11 +7927,11 @@ function ea(n, e, t, r) {
       let a;
       l && l.nodeName == o.nodeName && i != n && (a = i.parentNode) && a.nodeName.toLowerCase() == o.nodeName || (a = document.createElement(o.nodeName), a.pmIsDeco = !0, a.appendChild(i), l = nt[0]), i = a;
     }
-    Wd(i, l || nt[0], o);
+    Wu(i, l || nt[0], o);
   }
   return i;
 }
-function Wd(n, e, t) {
+function Wu(n, e, t) {
   for (let r in e)
     r != "class" && r != "style" && r != "nodeName" && !(r in t) && n.removeAttribute(r);
   for (let r in t)
@@ -7969,9 +7968,9 @@ function ao(n) {
   let e = n.nextSibling;
   return n.parentNode.removeChild(n), e;
 }
-class Kd {
+class Ku {
   constructor(e, t, r) {
-    this.lock = t, this.view = r, this.index = 0, this.stack = [], this.changed = !1, this.top = e, this.preMatch = Ud(e.node.content, e);
+    this.lock = t, this.view = r, this.index = 0, this.stack = [], this.changed = !1, this.top = e, this.preMatch = Uu(e.node.content, e);
   }
   // Destroy and remove the children between the given indices in
   // `this.top`.
@@ -8059,11 +8058,11 @@ class Kd {
         let c = this.preMatch.matched.get(a);
         if (c != null && c != s)
           return !1;
-        let u = a.dom, d, f = this.isLocked(u) && !(e.isText && a.node && a.node.isText && a.nodeDOM.nodeValue == e.text && a.dirty != Te && Bi(t, a.outerDeco));
+        let d = a.dom, u, f = this.isLocked(d) && !(e.isText && a.node && a.node.isText && a.nodeDOM.nodeValue == e.text && a.dirty != Te && Bi(t, a.outerDeco));
         if (!f && a.update(e, t, r, i))
-          return this.destroyBetween(this.index, l), a.dom != u && (this.changed = !0), this.index++, !0;
-        if (!f && (d = this.recreateWrapper(a, e, t, r, i, o)))
-          return this.top.children[this.index] = d, d.contentDOM && (d.dirty = tt, d.updateChildren(i, o + 1), d.dirty = fe), this.changed = !0, this.index++, !0;
+          return this.destroyBetween(this.index, l), a.dom != d && (this.changed = !0), this.index++, !0;
+        if (!f && (u = this.recreateWrapper(a, e, t, r, i, o)))
+          return this.top.children[this.index] = u, u.contentDOM && (u.dirty = tt, u.updateChildren(i, o + 1), u.dirty = fe), this.changed = !0, this.index++, !0;
         break;
       }
     }
@@ -8119,7 +8118,7 @@ class Kd {
     return this.lock && (e == this.lock || e.nodeType == 1 && e.contains(this.lock.parentNode));
   }
 }
-function Ud(n, e) {
+function Uu(n, e) {
   let t = e, r = t.children.length, i = n.childCount, s = /* @__PURE__ */ new Map(), o = [];
   e:
     for (; i > 0; ) {
@@ -8147,32 +8146,32 @@ function Ud(n, e) {
     }
   return { index: i, matched: s, matches: o.reverse() };
 }
-function Jd(n, e) {
+function Ju(n, e) {
   return n.type.side - e.type.side;
 }
-function Gd(n, e, t, r) {
+function Gu(n, e, t, r) {
   let i = e.locals(n), s = 0;
   if (i.length == 0) {
     for (let c = 0; c < n.childCount; c++) {
-      let u = n.child(c);
-      r(u, i, e.forChild(s, u), c), s += u.nodeSize;
+      let d = n.child(c);
+      r(d, i, e.forChild(s, d), c), s += d.nodeSize;
     }
     return;
   }
   let o = 0, l = [], a = null;
   for (let c = 0; ; ) {
-    let u, d;
+    let d, u;
     for (; o < i.length && i[o].to == s; ) {
       let g = i[o++];
-      g.widget && (u ? (d || (d = [u])).push(g) : u = g);
+      g.widget && (d ? (u || (u = [d])).push(g) : d = g);
     }
-    if (u)
-      if (d) {
-        d.sort(Jd);
-        for (let g = 0; g < d.length; g++)
-          t(d[g], c, !!a);
+    if (d)
+      if (u) {
+        u.sort(Ju);
+        for (let g = 0; g < u.length; g++)
+          t(u[g], c, !!a);
       } else
-        t(u, c, !!a);
+        t(d, c, !!a);
     let f, h;
     if (a)
       h = -1, f = a, a = null;
@@ -8196,13 +8195,13 @@ function Gd(n, e, t, r) {
     r(f, m, e.forChild(s, f), h), s = p;
   }
 }
-function Yd(n) {
+function Yu(n) {
   if (n.nodeName == "UL" || n.nodeName == "OL") {
     let e = n.style.cssText;
     n.style.cssText = e + "; list-style: square !important", window.getComputedStyle(n).listStyle, n.style.cssText = e;
   }
 }
-function Xd(n, e) {
+function Xu(n, e) {
   for (; ; ) {
     if (n.nodeType == 3)
       return n;
@@ -8216,7 +8215,7 @@ function Xd(n, e) {
       return null;
   }
 }
-function Qd(n, e, t, r) {
+function Qu(n, e, t, r) {
   for (let i = 0, s = 0; i < n.childCount && s <= r; ) {
     let o = n.child(i++), l = s;
     if (s += o.nodeSize, !o.isText)
@@ -8243,8 +8242,8 @@ function Qd(n, e, t, r) {
 function $i(n, e, t, r, i) {
   let s = [];
   for (let o = 0, l = 0; o < n.length; o++) {
-    let a = n[o], c = l, u = l += a.size;
-    c >= t || u <= e ? s.push(a) : (c < e && s.push(a.slice(0, e - c, r)), i && (s.push(i), i = void 0), u > t && s.push(a.slice(t - c, a.size, r)));
+    let a = n[o], c = l, d = l += a.size;
+    c >= t || d <= e ? s.push(a) : (c < e && s.push(a.slice(0, e - c, r)), i && (s.push(i), i = void 0), d > t && s.push(a.slice(t - c, a.size, r)));
   }
   return s;
 }
@@ -8259,20 +8258,20 @@ function cs(n, e = null) {
   if (gr(t)) {
     for (a = l; i && !i.node; )
       i = i.parent;
-    let u = i.node;
-    if (i && u.isAtom && C.isSelectable(u) && i.parent && !(u.isInline && Od(t.focusNode, t.focusOffset, i.dom))) {
-      let d = i.posBefore;
-      c = new C(o == d ? l : r.resolve(d));
+    let d = i.node;
+    if (i && d.isAtom && C.isSelectable(d) && i.parent && !(d.isInline && Ou(t.focusNode, t.focusOffset, i.dom))) {
+      let u = i.posBefore;
+      c = new C(o == u ? l : r.resolve(u));
     }
   } else {
-    let u = n.docView.posFromDOM(t.anchorNode, t.anchorOffset, 1);
-    if (u < 0)
+    let d = n.docView.posFromDOM(t.anchorNode, t.anchorOffset, 1);
+    if (d < 0)
       return null;
-    a = r.resolve(u);
+    a = r.resolve(d);
   }
   if (!c) {
-    let u = e == "pointer" || n.state.selection.head < l.pos && !s ? 1 : -1;
-    c = us(n, a, l, u);
+    let d = e == "pointer" || n.state.selection.head < l.pos && !s ? 1 : -1;
+    c = ds(n, a, l, d);
   }
   return c;
 }
@@ -8293,30 +8292,30 @@ function Pe(n, e = !1) {
       ef(n);
     else {
       let { anchor: r, head: i } = t, s, o;
-      co && !(t instanceof N) && (t.$from.parent.inlineContent || (s = uo(n, t.from)), !t.empty && !t.$from.parent.inlineContent && (o = uo(n, t.to))), n.docView.setSelection(r, i, n.root, e), co && (s && fo(s), o && fo(o)), t.visible ? n.dom.classList.remove("ProseMirror-hideselection") : (n.dom.classList.add("ProseMirror-hideselection"), "onselectionchange" in document && Zd(n));
+      co && !(t instanceof N) && (t.$from.parent.inlineContent || (s = uo(n, t.from)), !t.empty && !t.$from.parent.inlineContent && (o = uo(n, t.to))), n.docView.setSelection(r, i, n.root, e), co && (s && fo(s), o && fo(o)), t.visible ? n.dom.classList.remove("ProseMirror-hideselection") : (n.dom.classList.add("ProseMirror-hideselection"), "onselectionchange" in document && Zu(n));
     }
     n.domObserver.setCurSelection(), n.domObserver.connectSelection();
   }
 }
-const co = X || U && Ed < 63;
+const co = X || U && Eu < 63;
 function uo(n, e) {
   let { node: t, offset: r } = n.docView.domFromPos(e, 0), i = r < t.childNodes.length ? t.childNodes[r] : null, s = r ? t.childNodes[r - 1] : null;
   if (X && i && i.contentEditable == "false")
-    return di(i);
+    return ui(i);
   if ((!i || i.contentEditable == "false") && (!s || s.contentEditable == "false")) {
     if (i)
-      return di(i);
+      return ui(i);
     if (s)
-      return di(s);
+      return ui(s);
   }
 }
-function di(n) {
+function ui(n) {
   return n.contentEditable = "true", X && n.draggable && (n.draggable = !1, n.wasDraggable = !0), n;
 }
 function fo(n) {
   n.contentEditable = "false", n.wasDraggable && (n.draggable = !0, n.wasDraggable = null);
 }
-function Zd(n) {
+function Zu(n) {
   let e = n.dom.ownerDocument;
   e.removeEventListener("selectionchange", n.input.hideSelectionGuard);
   let t = n.domSelectionRange(), r = t.anchorNode, i = t.anchorOffset;
@@ -8340,7 +8339,7 @@ function ra(n, e) {
 function ho(n) {
   n.lastSelectedViewDesc && (n.lastSelectedViewDesc.parent && n.lastSelectedViewDesc.deselectNode(), n.lastSelectedViewDesc = void 0);
 }
-function us(n, e, t, r) {
+function ds(n, e, t, r) {
   return n.someProp("createSelectionBetween", (i) => i(n, e, t)) || N.between(e, t, r);
 }
 function po(n) {
@@ -8380,7 +8379,7 @@ function mo(n, e, t) {
       if (n.endOfTextblock(e > 0 ? "forward" : "backward")) {
         let i = Fi(n.state, e);
         return i && i instanceof C ? Fe(n, i) : !1;
-      } else if (!(de && t.indexOf("m") > -1)) {
+      } else if (!(ue && t.indexOf("m") > -1)) {
         let i = r.$head, s = i.textOffset ? null : e < 0 ? i.nodeBefore : i.nodeAfter, o;
         if (!s || s.isText)
           return !1;
@@ -8523,7 +8522,7 @@ function zi(n, e, t) {
 }
 function go(n, e) {
   let t = n.state.doc.resolve(e);
-  if (!(U || Td) && t.parent.inlineContent) {
+  if (!(U || Tu) && t.parent.inlineContent) {
     let i = n.coordsAtPos(e);
     if (e > t.start()) {
       let s = n.coordsAtPos(e - 1), o = (s.top + s.bottom) / 2;
@@ -8540,7 +8539,7 @@ function go(n, e) {
 }
 function yo(n, e, t) {
   let r = n.state.selection;
-  if (r instanceof N && !r.empty || t.indexOf("s") > -1 || de && t.indexOf("m") > -1)
+  if (r instanceof N && !r.empty || t.indexOf("s") > -1 || ue && t.indexOf("m") > -1)
     return !1;
   let { $from: i, $to: s } = r;
   if (!i.parent.inlineContent || n.endOfTextblock(e < 0 ? "up" : "down")) {
@@ -8590,24 +8589,24 @@ function af(n) {
 }
 function cf(n, e) {
   let t = e.keyCode, r = af(e);
-  if (t == 8 || de && t == 72 && r == "c")
+  if (t == 8 || ue && t == 72 && r == "c")
     return bo(n, -1) || gt(n, -1);
-  if (t == 46 && !e.shiftKey || de && t == 68 && r == "c")
+  if (t == 46 && !e.shiftKey || ue && t == 68 && r == "c")
     return bo(n, 1) || gt(n, 1);
   if (t == 13 || t == 27)
     return !0;
-  if (t == 37 || de && t == 66 && r == "c") {
+  if (t == 37 || ue && t == 66 && r == "c") {
     let i = t == 37 ? go(n, n.state.selection.from) == "ltr" ? -1 : 1 : -1;
     return mo(n, i, r) || gt(n, i);
-  } else if (t == 39 || de && t == 70 && r == "c") {
+  } else if (t == 39 || ue && t == 70 && r == "c") {
     let i = t == 39 ? go(n, n.state.selection.from) == "ltr" ? 1 : -1 : 1;
     return mo(n, i, r) || gt(n, i);
   } else {
-    if (t == 38 || de && t == 80 && r == "c")
+    if (t == 38 || ue && t == 80 && r == "c")
       return yo(n, -1, r) || gt(n, -1);
-    if (t == 40 || de && t == 78 && r == "c")
+    if (t == 40 || ue && t == 78 && r == "c")
       return lf(n) || yo(n, 1, r) || gt(n, 1);
-    if (r == (de ? "m" : "c") && (t == 66 || t == 73 || t == 89 || t == 90))
+    if (r == (ue ? "m" : "c") && (t == 66 || t == 73 || t == 89 || t == 90))
       return !0;
   }
   return !1;
@@ -8624,17 +8623,17 @@ function oa(n, e) {
   }
   let o = n.someProp("clipboardSerializer") || ve.fromSchema(n.state.schema), l = fa(), a = l.createElement("div");
   a.appendChild(o.serializeFragment(r, { document: l }));
-  let c = a.firstChild, u, d = 0;
-  for (; c && c.nodeType == 1 && (u = da[c.nodeName.toLowerCase()]); ) {
-    for (let h = u.length - 1; h >= 0; h--) {
-      let p = l.createElement(u[h]);
+  let c = a.firstChild, d, u = 0;
+  for (; c && c.nodeType == 1 && (d = ua[c.nodeName.toLowerCase()]); ) {
+    for (let h = d.length - 1; h >= 0; h--) {
+      let p = l.createElement(d[h]);
       for (; a.firstChild; )
         p.appendChild(a.firstChild);
-      a.appendChild(p), d++;
+      a.appendChild(p), u++;
     }
     c = a.firstChild;
   }
-  c && c.nodeType == 1 && c.setAttribute("data-pm-slice", `${i} ${s}${d ? ` -${d}` : ""} ${JSON.stringify(t)}`);
+  c && c.nodeType == 1 && c.setAttribute("data-pm-slice", `${i} ${s}${u ? ` -${u}` : ""} ${JSON.stringify(t)}`);
   let f = n.someProp("clipboardTextSerializer", (h) => h(e, n)) || e.content.textBetween(0, e.content.size, `
 
 `);
@@ -8651,9 +8650,9 @@ function la(n, e, t, r, i) {
     }), s)
       return e ? new S(b.from(n.state.schema.text(e.replace(/\r\n?/g, `
 `))), 0, 0) : S.empty;
-    let d = n.someProp("clipboardTextParser", (f) => f(e, i, r, n));
-    if (d)
-      l = d;
+    let u = n.someProp("clipboardTextParser", (f) => f(e, i, r, n));
+    if (u)
+      l = u;
     else {
       let f = i.marks(), { schema: h } = n.state, p = ve.fromSchema(h);
       o = document.createElement("div"), e.split(/(?:\r\n?|\n)+/).forEach((m) => {
@@ -8662,12 +8661,12 @@ function la(n, e, t, r, i) {
       });
     }
   } else
-    n.someProp("transformPastedHTML", (d) => {
-      t = d(t, n);
+    n.someProp("transformPastedHTML", (u) => {
+      t = u(t, n);
     }), o = ff(t), ln && hf(o);
-  let c = o && o.querySelector("[data-pm-slice]"), u = c && /^(\d+) (\d+)(?: -(\d+))? (.*)/.exec(c.getAttribute("data-pm-slice") || "");
-  if (u && u[3])
-    for (let d = +u[3]; d > 0; d--) {
+  let c = o && o.querySelector("[data-pm-slice]"), d = c && /^(\d+) (\d+)(?: -(\d+))? (.*)/.exec(c.getAttribute("data-pm-slice") || "");
+  if (d && d[3])
+    for (let u = +d[3]; u > 0; u--) {
       let f = o.firstChild;
       for (; f && f.nodeType != 1; )
         f = f.nextSibling;
@@ -8676,27 +8675,27 @@ function la(n, e, t, r, i) {
       o = f;
     }
   if (l || (l = (n.someProp("clipboardParser") || n.someProp("domParser") || ts.fromSchema(n.state.schema)).parseSlice(o, {
-    preserveWhitespace: !!(a || u),
+    preserveWhitespace: !!(a || d),
     context: i,
     ruleFromNode(f) {
-      return f.nodeName == "BR" && !f.nextSibling && f.parentNode && !uf.test(f.parentNode.nodeName) ? { ignore: !0 } : null;
+      return f.nodeName == "BR" && !f.nextSibling && f.parentNode && !df.test(f.parentNode.nodeName) ? { ignore: !0 } : null;
     }
-  })), u)
-    l = pf(So(l, +u[1], +u[2]), u[4]);
-  else if (l = S.maxOpen(df(l.content, i), !0), l.openStart || l.openEnd) {
-    let d = 0, f = 0;
-    for (let h = l.content.firstChild; d < l.openStart && !h.type.spec.isolating; d++, h = h.firstChild)
+  })), d)
+    l = pf(So(l, +d[1], +d[2]), d[4]);
+  else if (l = S.maxOpen(uf(l.content, i), !0), l.openStart || l.openEnd) {
+    let u = 0, f = 0;
+    for (let h = l.content.firstChild; u < l.openStart && !h.type.spec.isolating; u++, h = h.firstChild)
       ;
     for (let h = l.content.lastChild; f < l.openEnd && !h.type.spec.isolating; f++, h = h.lastChild)
       ;
-    l = So(l, d, f);
+    l = So(l, u, f);
   }
-  return n.someProp("transformPasted", (d) => {
-    l = d(l, n);
+  return n.someProp("transformPasted", (u) => {
+    l = u(l, n);
   }), l;
 }
-const uf = /^(a|abbr|acronym|b|cite|code|del|em|i|ins|kbd|label|output|q|ruby|s|samp|span|strong|sub|sup|time|u|tt|var)$/i;
-function df(n, e) {
+const df = /^(a|abbr|acronym|b|cite|code|del|em|i|ins|kbd|label|output|q|ruby|s|samp|span|strong|sub|sup|time|u|tt|var)$/i;
+function uf(n, e) {
   if (n.childCount < 2)
     return n;
   for (let t = e.depth; t >= 0; t--) {
@@ -8710,9 +8709,9 @@ function df(n, e) {
       if (c = o.length && s.length && ca(a, s, l, o[o.length - 1], 0))
         o[o.length - 1] = c;
       else {
-        o.length && (o[o.length - 1] = ua(o[o.length - 1], s.length));
-        let u = aa(l, a);
-        o.push(u), i = i.matchType(u.type), s = a;
+        o.length && (o[o.length - 1] = da(o[o.length - 1], s.length));
+        let d = aa(l, a);
+        o.push(d), i = i.matchType(d.type), s = a;
       }
     }), o)
       return b.from(o);
@@ -8733,10 +8732,10 @@ function ca(n, e, t, r, i) {
       return r.copy(r.content.append(b.from(aa(t, n, i + 1))));
   }
 }
-function ua(n, e) {
+function da(n, e) {
   if (e == 0)
     return n;
-  let t = n.content.replaceChild(n.childCount - 1, ua(n.lastChild, e - 1)), r = n.contentMatchAt(n.childCount).fillBefore(b.empty, !0);
+  let t = n.content.replaceChild(n.childCount - 1, da(n.lastChild, e - 1)), r = n.contentMatchAt(n.childCount).fillBefore(b.empty, !0);
   return n.copy(t.append(r));
 }
 function Hi(n, e, t, r, i, s) {
@@ -8746,7 +8745,7 @@ function Hi(n, e, t, r, i, s) {
 function So(n, e, t) {
   return e < n.openStart && (n = new S(Hi(n.content, -1, e, n.openStart, 0, n.openEnd), e, n.openEnd)), t < n.openEnd && (n = new S(Hi(n.content, 1, t, n.openEnd, 0, 0), n.openStart, t)), n;
 }
-const da = {
+const ua = {
   thead: ["table"],
   tbody: ["table"],
   tfoot: ["table"],
@@ -8765,7 +8764,7 @@ function ff(n) {
   let e = /^(\s*<meta [^>]*>)*/.exec(n);
   e && (n = n.slice(e[0].length));
   let t = fa().createElement("div"), r = /<([a-z][^>\s]+)/i.exec(n), i;
-  if ((i = r && da[r[1].toLowerCase()]) && (n = i.map((s) => "<" + s + ">").join("") + n + i.map((s) => "</" + s + ">").reverse().join("")), t.innerHTML = n, i)
+  if ((i = r && ua[r[1].toLowerCase()]) && (n = i.map((s) => "<" + s + ">").join("") + n + i.map((s) => "</" + s + ">").reverse().join("")), t.innerHTML = n, i)
     for (let s = 0; s < i.length; s++)
       t = t.querySelector(i[s]) || t;
   return t;
@@ -8805,7 +8804,7 @@ function yf(n) {
   for (let e in Q) {
     let t = Q[e];
     n.dom.addEventListener(e, n.input.eventHandlers[e] = (r) => {
-      kf(n, r) && !ds(n, r) && (n.editable || !(r.type in Z)) && t(n, r);
+      kf(n, r) && !us(n, r) && (n.editable || !(r.type in Z)) && t(n, r);
     }, mf[e] ? { passive: !0 } : void 0);
   }
   X && n.dom.addEventListener("input", () => null), ji(n);
@@ -8822,10 +8821,10 @@ function bf(n) {
 function ji(n) {
   n.someProp("handleDOMEvents", (e) => {
     for (let t in e)
-      n.input.eventHandlers[t] || n.dom.addEventListener(t, n.input.eventHandlers[t] = (r) => ds(n, r));
+      n.input.eventHandlers[t] || n.dom.addEventListener(t, n.input.eventHandlers[t] = (r) => us(n, r));
   });
 }
-function ds(n, e) {
+function us(n, e) {
   return n.someProp("handleDOMEvents", (t) => {
     let r = t[e.type];
     return r ? r(n, e) || e.defaultPrevented : !1;
@@ -8842,7 +8841,7 @@ function kf(n, e) {
   return !0;
 }
 function Sf(n, e) {
-  !ds(n, e) && Q[e.type] && (n.editable || !(e.type in Z)) && Q[e.type](n, e);
+  !us(n, e) && Q[e.type] && (n.editable || !(e.type in Z)) && Q[e.type](n, e);
 }
 Z.keydown = (n, e) => {
   let t = e;
@@ -8860,7 +8859,7 @@ Z.keyup = (n, e) => {
 };
 Z.keypress = (n, e) => {
   let t = e;
-  if (pa(n, t) || !t.charCode || t.ctrlKey && !t.altKey || de && t.metaKey)
+  if (pa(n, t) || !t.charCode || t.ctrlKey && !t.altKey || ue && t.metaKey)
     return;
   if (n.someProp("handleKeyPress", (i) => i(n, t))) {
     t.preventDefault();
@@ -8944,7 +8943,7 @@ function Mf(n, e, t) {
 function hs(n) {
   return Dn(n);
 }
-const ha = de ? "metaKey" : "ctrlKey";
+const ha = ue ? "metaKey" : "ctrlKey";
 Q.mousedown = (n, e) => {
   let t = e;
   n.input.shiftKey = t.shiftKey;
@@ -8960,8 +8959,8 @@ class wf {
     if (t.inside > -1)
       s = e.state.doc.nodeAt(t.inside), o = t.inside;
     else {
-      let u = e.state.doc.resolve(t.pos);
-      s = u.parent, o = u.depth ? u.before() : 0;
+      let d = e.state.doc.resolve(t.pos);
+      s = d.parent, o = d.depth ? d.before() : 0;
     }
     const l = i ? null : r.target, a = l ? e.docView.nearestDesc(l, !0) : null;
     this.target = a ? a.dom : null;
@@ -9066,7 +9065,7 @@ function Pf(n, e) {
     t.parentNode && t.parentNode.removeChild(t), n.focus();
   }, 50);
 }
-const Qt = ie && Ke < 15 || wt && Md < 604;
+const Qt = ie && Ke < 15 || wt && Mu < 604;
 Q.copy = Z.cut = (n, e) => {
   let t = e, r = n.state.selection, i = t.type == "cut";
   if (r.empty)
@@ -9115,7 +9114,7 @@ class Rf {
     this.slice = e, this.move = t;
   }
 }
-const ba = de ? "altKey" : "ctrlKey";
+const ba = ue ? "altKey" : "ctrlKey";
 Q.dragstart = (n, e) => {
   let t = e, r = n.input.mouseDown;
   if (r && r.done(), !t.dataTransfer)
@@ -9158,19 +9157,19 @@ Z.drop = (n, e) => {
   if (!o)
     return;
   t.preventDefault();
-  let a = o ? ud(n.state.doc, s.pos, o) : s.pos;
+  let a = o ? du(n.state.doc, s.pos, o) : s.pos;
   a == null && (a = s.pos);
   let c = n.state.tr;
   l && c.deleteSelection();
-  let u = c.mapping.map(a), d = o.openStart == 0 && o.openEnd == 0 && o.content.childCount == 1, f = c.doc;
-  if (d ? c.replaceRangeWith(u, u, o.content.firstChild) : c.replaceRange(u, u, o), c.doc.eq(f))
+  let d = c.mapping.map(a), u = o.openStart == 0 && o.openEnd == 0 && o.content.childCount == 1, f = c.doc;
+  if (u ? c.replaceRangeWith(d, d, o.content.firstChild) : c.replaceRange(d, d, o), c.doc.eq(f))
     return;
-  let h = c.doc.resolve(u);
-  if (d && C.isSelectable(o.content.firstChild) && h.nodeAfter && h.nodeAfter.sameMarkup(o.content.firstChild))
+  let h = c.doc.resolve(d);
+  if (u && C.isSelectable(o.content.firstChild) && h.nodeAfter && h.nodeAfter.sameMarkup(o.content.firstChild))
     c.setSelection(new C(h));
   else {
     let p = c.mapping.map(a);
-    c.mapping.maps[c.mapping.maps.length - 1].forEach((m, g, y, O) => p = O), c.setSelection(us(n, h, c.doc.resolve(p)));
+    c.mapping.maps[c.mapping.maps.length - 1].forEach((m, g, y, O) => p = O), c.setSelection(ds(n, h, c.doc.resolve(p)));
   }
   n.focus(), n.dispatch(c.setMeta("uiEvent", "drop"));
 };
@@ -9407,11 +9406,11 @@ class $ {
   addInner(e, t, r) {
     let i, s = 0;
     e.forEach((l, a) => {
-      let c = a + r, u;
-      if (u = Sa(t, l, c)) {
+      let c = a + r, d;
+      if (d = Sa(t, l, c)) {
         for (i || (i = this.children.slice()); s < i.length && i[s] < a; )
           s += 3;
-        i[s] == a ? i[s + 2] = i[s + 2].addInner(l, u, c + 1) : i.splice(s, 0, a, a + l.nodeSize, Rn(u, l, c + 1, at)), s += 3;
+        i[s] == a ? i[s + 2] = i[s + 2].addInner(l, d, c + 1) : i.splice(s, 0, a, a + l.nodeSize, Rn(d, l, c + 1, at)), s += 3;
       }
     });
     let o = ka(s ? xa(t) : t, -r);
@@ -9430,8 +9429,8 @@ class $ {
     let r = this.children, i = this.local;
     for (let s = 0; s < r.length; s += 3) {
       let o, l = r[s] + t, a = r[s + 1] + t;
-      for (let u = 0, d; u < e.length; u++)
-        (d = e[u]) && d.from > l && d.to < a && (e[u] = null, (o || (o = [])).push(d));
+      for (let d = 0, u; d < e.length; d++)
+        (u = e[d]) && u.from > l && u.to < a && (e[d] = null, (o || (o = [])).push(u));
       if (!o)
         continue;
       r == this.children && (r = this.children.slice());
@@ -9464,8 +9463,8 @@ class $ {
     for (let l = 0; l < this.local.length; l++) {
       let a = this.local[l];
       if (a.from < o && a.to > s && a.type instanceof Je) {
-        let c = Math.max(s, a.from) - s, u = Math.min(o, a.to) - s;
-        c < u && (i || (i = [])).push(a.copy(c, u));
+        let c = Math.max(s, a.from) - s, d = Math.min(o, a.to) - s;
+        c < d && (i || (i = [])).push(a.copy(c, d));
       }
     }
     if (i) {
@@ -9569,19 +9568,19 @@ class He {
 }
 function _f(n, e, t, r, i, s, o) {
   let l = n.slice();
-  for (let c = 0, u = s; c < t.maps.length; c++) {
-    let d = 0;
+  for (let c = 0, d = s; c < t.maps.length; c++) {
+    let u = 0;
     t.maps[c].forEach((f, h, p, m) => {
       let g = m - p - (h - f);
       for (let y = 0; y < l.length; y += 3) {
         let O = l[y + 1];
-        if (O < 0 || f > O + u - d)
+        if (O < 0 || f > O + d - u)
           continue;
-        let E = l[y] + u - d;
+        let E = l[y] + d - u;
         h >= E ? l[y + 1] = f <= E ? -2 : -1 : p >= i && g && (l[y] += g, l[y + 1] += g);
       }
-      d += g;
-    }), u = t.maps[c].map(u, -1);
+      u += g;
+    }), d = t.maps[c].map(d, -1);
   }
   let a = !1;
   for (let c = 0; c < l.length; c += 3)
@@ -9590,28 +9589,28 @@ function _f(n, e, t, r, i, s, o) {
         a = !0, l[c + 1] = -1;
         continue;
       }
-      let u = t.map(n[c] + s), d = u - i;
-      if (d < 0 || d >= r.content.size) {
+      let d = t.map(n[c] + s), u = d - i;
+      if (u < 0 || u >= r.content.size) {
         a = !0;
         continue;
       }
-      let f = t.map(n[c + 1] + s, -1), h = f - i, { index: p, offset: m } = r.content.findIndex(d), g = r.maybeChild(p);
-      if (g && m == d && m + g.nodeSize == h) {
-        let y = l[c + 2].mapInner(t, g, u + 1, n[c] + s + 1, o);
-        y != K ? (l[c] = d, l[c + 1] = h, l[c + 2] = y) : (l[c + 1] = -2, a = !0);
+      let f = t.map(n[c + 1] + s, -1), h = f - i, { index: p, offset: m } = r.content.findIndex(u), g = r.maybeChild(p);
+      if (g && m == u && m + g.nodeSize == h) {
+        let y = l[c + 2].mapInner(t, g, d + 1, n[c] + s + 1, o);
+        y != K ? (l[c] = u, l[c + 1] = h, l[c + 2] = y) : (l[c + 1] = -2, a = !0);
       } else
         a = !0;
     }
   if (a) {
-    let c = Lf(l, n, e, t, i, s, o), u = Rn(c, r, 0, o);
-    e = u.local;
-    for (let d = 0; d < l.length; d += 3)
-      l[d + 1] < 0 && (l.splice(d, 3), d -= 3);
-    for (let d = 0, f = 0; d < u.children.length; d += 3) {
-      let h = u.children[d];
+    let c = Lf(l, n, e, t, i, s, o), d = Rn(c, r, 0, o);
+    e = d.local;
+    for (let u = 0; u < l.length; u += 3)
+      l[u + 1] < 0 && (l.splice(u, 3), u -= 3);
+    for (let u = 0, f = 0; u < d.children.length; u += 3) {
+      let h = d.children[u];
       for (; f < l.length && l[f] < h; )
         f += 3;
-      l.splice(f, 0, u.children[d], u.children[d + 1], u.children[d + 2]);
+      l.splice(f, 0, d.children[u], d.children[u + 1], d.children[u + 2]);
     }
   }
   return new $(e.sort(ct), l);
@@ -9628,12 +9627,12 @@ function ka(n, e) {
 }
 function Lf(n, e, t, r, i, s, o) {
   function l(a, c) {
-    for (let u = 0; u < a.local.length; u++) {
-      let d = a.local[u].map(r, i, c);
-      d ? t.push(d) : o.onRemove && o.onRemove(a.local[u].spec);
+    for (let d = 0; d < a.local.length; d++) {
+      let u = a.local[d].map(r, i, c);
+      u ? t.push(u) : o.onRemove && o.onRemove(a.local[d].spec);
     }
-    for (let u = 0; u < a.children.length; u += 3)
-      l(a.children[u + 2], a.children[u] + c + 1);
+    for (let d = 0; d < a.children.length; d += 3)
+      l(a.children[d + 2], a.children[d] + c + 1);
   }
   for (let a = 0; a < n.length; a += 3)
     n[a + 1] == -1 && l(n[a + 2], e[a] + s + 1);
@@ -9659,8 +9658,8 @@ function Rn(n, e, t, r) {
     let c = Sa(n, l, a + t);
     if (c) {
       s = !0;
-      let u = Rn(c, l, t + a + 1, r);
-      u != K && i.push(a, a + l.nodeSize, u);
+      let d = Rn(c, l, t + a + 1, r);
+      d != K && i.push(a, a + l.nodeSize, d);
     }
   });
   let o = ka(s ? xa(n) : n, -t).sort(ct);
@@ -9812,15 +9811,15 @@ class zf {
     t.length && (this.queue = []);
     let r = e.domSelectionRange(), i = !this.suppressingSelectionUpdates && !this.currentSelection.eq(r) && po(e) && !this.ignoreSelectionChange(r), s = -1, o = -1, l = !1, a = [];
     if (e.editable)
-      for (let u = 0; u < t.length; u++) {
-        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));
+      for (let d = 0; d < t.length; d++) {
+        let u = this.registerMutation(t[d], a);
+        u && (s = s < 0 ? u.from : Math.min(u.from, s), o = o < 0 ? u.to : Math.max(u.to, o), u.typeOver && (l = !0));
       }
     if (ye && a.length > 1) {
-      let u = a.filter((d) => d.nodeName == "BR");
-      if (u.length == 2) {
-        let d = u[0], f = u[1];
-        d.parentNode && d.parentNode.parentNode == f.parentNode ? f.remove() : d.remove();
+      let d = a.filter((u) => u.nodeName == "BR");
+      if (d.length == 2) {
+        let u = d[0], f = d[1];
+        u.parentNode && u.parentNode.parentNode == f.parentNode ? f.remove() : u.remove();
       }
     }
     let c = null;
@@ -9834,15 +9833,15 @@ class zf {
     e.attributeName == "style" && !e.oldValue && !e.target.getAttribute("style")) || !r || r.ignoreMutation(e))
       return null;
     if (e.type == "childList") {
-      for (let u = 0; u < e.addedNodes.length; u++)
-        t.push(e.addedNodes[u]);
+      for (let d = 0; d < e.addedNodes.length; d++)
+        t.push(e.addedNodes[d]);
       if (r.contentDOM && r.contentDOM != r.dom && !r.contentDOM.contains(e.target))
         return { from: r.posBefore, to: r.posAfter };
       let i = e.previousSibling, s = e.nextSibling;
       if (ie && Ke <= 11 && e.addedNodes.length)
-        for (let u = 0; u < e.addedNodes.length; u++) {
-          let { previousSibling: d, nextSibling: f } = e.addedNodes[u];
-          (!d || Array.prototype.indexOf.call(e.addedNodes, d) < 0) && (i = d), (!f || Array.prototype.indexOf.call(e.addedNodes, f) < 0) && (s = f);
+        for (let d = 0; d < e.addedNodes.length; d++) {
+          let { previousSibling: u, nextSibling: f } = e.addedNodes[d];
+          (!u || Array.prototype.indexOf.call(e.addedNodes, u) < 0) && (i = u), (!f || Array.prototype.indexOf.call(e.addedNodes, f) < 0) && (s = f);
         }
       let o = i && i.parentNode == e.target ? Y(i) + 1 : 0, l = r.localPosFromDOM(e.target, o, -1), a = s && s.parentNode == e.target ? Y(s) : e.target.childNodes.length, c = r.localPosFromDOM(e.target, a, 1);
       return { from: l, to: c };
@@ -9876,8 +9875,8 @@ function jf(n) {
   return ft(l.node, l.offset, s, o) && ([r, i, s, o] = [s, o, r, i]), { anchorNode: r, anchorOffset: i, focusNode: s, focusOffset: o };
 }
 function Vf(n, e, t) {
-  let { node: r, fromOffset: i, toOffset: s, from: o, to: l } = n.docView.parseRange(e, t), a = n.domSelectionRange(), c, u = a.anchorNode;
-  if (u && n.dom.contains(u.nodeType == 1 ? u : u.parentNode) && (c = [{ node: u, offset: a.anchorOffset }], gr(a) || c.push({ node: a.focusNode, offset: a.focusOffset })), U && n.input.lastKeyCode === 8)
+  let { node: r, fromOffset: i, toOffset: s, from: o, to: l } = n.docView.parseRange(e, t), a = n.domSelectionRange(), c, d = a.anchorNode;
+  if (d && n.dom.contains(d.nodeType == 1 ? d : d.parentNode) && (c = [{ node: d, offset: a.anchorOffset }], gr(a) || c.push({ node: a.focusNode, offset: a.focusOffset })), U && n.input.lastKeyCode === 8)
     for (let g = s; g > i; g--) {
       let y = r.childNodes[g - 1], O = y.pmViewDesc;
       if (y.nodeName == "BR" && !O) {
@@ -9887,7 +9886,7 @@ function Vf(n, e, t) {
       if (!O || O.size)
         break;
     }
-  let d = n.state.doc, f = n.someProp("domParser") || ts.fromSchema(n.state.schema), h = d.resolve(o), p = null, m = f.parse(r, {
+  let u = n.state.doc, f = n.someProp("domParser") || ts.fromSchema(n.state.schema), h = u.resolve(o), p = null, m = f.parse(r, {
     topNode: h.parent,
     topMatch: h.parent.contentMatchAt(h.index()),
     topOpen: !0,
@@ -9933,9 +9932,9 @@ function Kf(n, e, t, r, i) {
   }
   let o = n.state.doc.resolve(e), l = o.sharedDepth(t);
   e = o.before(l + 1), t = n.state.doc.resolve(t).after(l + 1);
-  let a = n.state.selection, c = Vf(n, e, t), u = n.state.doc, d = u.slice(c.from, c.to), f, h;
+  let a = n.state.selection, c = Vf(n, e, t), d = n.state.doc, u = d.slice(c.from, c.to), f, h;
   n.input.lastKeyCode === 8 && Date.now() - 100 < n.input.lastKeyCodeTime ? (f = n.state.selection.to, h = "end") : (f = n.state.selection.from, h = "start"), n.input.lastKeyCode = null;
-  let p = Gf(d.content, c.doc.content, c.from, f, h);
+  let p = Gf(u.content, c.doc.content, c.from, f, h);
   if ((wt && n.input.lastIOSEnter > Date.now() - 225 || me) && i.some((v) => v.nodeType == 1 && !Wf.test(v.nodeName)) && (!p || p.endA >= p.endB) && n.someProp("handleKeyDown", (v) => v(n, et(13, "Enter")))) {
     n.input.lastIOSEnter = 0;
     return;
@@ -9958,12 +9957,12 @@ function Kf(n, e, t, r, i) {
     c.sel = { anchor: c.sel.anchor + v, head: c.sel.anchor + v };
   }
   n.input.domChangeCount++, n.state.selection.from < n.state.selection.to && p.start == p.endB && n.state.selection instanceof N && (p.start > n.state.selection.from && p.start <= n.state.selection.from + 2 && n.state.selection.from >= c.from ? p.start = n.state.selection.from : p.endA < n.state.selection.to && p.endA >= n.state.selection.to - 2 && n.state.selection.to <= c.to && (p.endB += n.state.selection.to - p.endA, p.endA = n.state.selection.to)), ie && Ke <= 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), O = m.sameParent(g) && m.parent.inlineContent && y.end() >= p.endA, E;
+  let m = c.doc.resolveNoCache(p.start - c.from), g = c.doc.resolveNoCache(p.endB - c.from), y = d.resolve(p.start), O = m.sameParent(g) && m.parent.inlineContent && y.end() >= p.endA, E;
   if ((wt && n.input.lastIOSEnter > Date.now() - 225 && (!O || i.some((v) => v.nodeName == "DIV" || v.nodeName == "P")) || !O && m.pos < c.doc.content.size && !m.sameParent(g) && (E = A.findFrom(c.doc.resolve(m.pos + 1), 1, !0)) && E.head == g.pos) && n.someProp("handleKeyDown", (v) => v(n, et(13, "Enter")))) {
     n.input.lastIOSEnter = 0;
     return;
   }
-  if (n.state.selection.anchor > p.start && Jf(u, p.start, p.endA, m, g) && n.someProp("handleKeyDown", (v) => v(n, et(8, "Backspace")))) {
+  if (n.state.selection.anchor > p.start && Jf(d, p.start, p.endA, m, g) && n.someProp("handleKeyDown", (v) => v(n, et(8, "Backspace")))) {
     me && U && n.domObserver.suppressSelectionUpdates();
     return;
   }
@@ -9975,7 +9974,7 @@ function Kf(n, e, t, r, i) {
   let I = p.start, D = p.endA, T, _, P;
   if (O) {
     if (m.pos == g.pos)
-      ie && Ke <= 11 && m.parentOffset == 0 && (n.domObserver.suppressSelectionUpdates(), setTimeout(() => Pe(n), 20)), T = n.state.tr.delete(I, D), _ = u.resolve(p.start).marksAcross(u.resolve(p.endA));
+      ie && Ke <= 11 && m.parentOffset == 0 && (n.domObserver.suppressSelectionUpdates(), setTimeout(() => Pe(n), 20)), T = n.state.tr.delete(I, D), _ = d.resolve(p.start).marksAcross(d.resolve(p.endA));
     else if (
       // Adding or removing a mark
       p.endA == p.endB && (P = Uf(m.parent.content.cut(m.parentOffset, g.parentOffset), y.parent.content.cut(y.parentOffset, p.endA - y.start())))
@@ -9995,23 +9994,23 @@ function Kf(n, e, t, r, i) {
   _ && T.ensureMarks(_), s && T.setMeta("composition", s), n.dispatch(T.scrollIntoView());
 }
 function Eo(n, e, t) {
-  return Math.max(t.anchor, t.head) > e.content.size ? null : us(n, e.resolve(t.anchor), e.resolve(t.head));
+  return Math.max(t.anchor, t.head) > e.content.size ? null : ds(n, e.resolve(t.anchor), e.resolve(t.head));
 }
 function Uf(n, e) {
   let t = n.firstChild.marks, r = e.firstChild.marks, i = t, s = r, o, l, a;
-  for (let u = 0; u < r.length; u++)
-    i = r[u].removeFromSet(i);
-  for (let u = 0; u < t.length; u++)
-    s = t[u].removeFromSet(s);
+  for (let d = 0; d < r.length; d++)
+    i = r[d].removeFromSet(i);
+  for (let d = 0; d < t.length; d++)
+    s = t[d].removeFromSet(s);
   if (i.length == 1 && s.length == 0)
-    l = i[0], o = "add", a = (u) => u.mark(l.addToSet(u.marks));
+    l = i[0], o = "add", a = (d) => d.mark(l.addToSet(d.marks));
   else if (i.length == 0 && s.length == 1)
-    l = s[0], o = "remove", a = (u) => u.mark(l.removeFromSet(u.marks));
+    l = s[0], o = "remove", a = (d) => d.mark(l.removeFromSet(d.marks));
   else
     return null;
   let c = [];
-  for (let u = 0; u < e.childCount; u++)
-    c.push(a(e.child(u)));
+  for (let d = 0; d < e.childCount; d++)
+    c.push(a(e.child(d)));
   if (b.from(c).eq(n))
     return { mark: l, type: o };
 }
@@ -10126,19 +10125,19 @@ class Yf {
       Qf(f, this.nodeViews) && (this.nodeViews = f, i = !0);
     }
     (o || t.handleDOMEvents != this._props.handleDOMEvents) && ji(this), this.editable = wo(this), Mo(this);
-    let l = fi(this), a = To(this), c = r.plugins != e.plugins && !r.doc.eq(e.doc) ? "reset" : e.scrollToSelection > r.scrollToSelection ? "to selection" : "preserve", u = i || !this.docView.matchesNode(e.doc, a, l);
-    (u || !e.selection.eq(r.selection)) && (s = !0);
-    let d = c == "preserve" && s && this.dom.style.overflowAnchor == null && Nd(this);
+    let l = fi(this), a = To(this), c = r.plugins != e.plugins && !r.doc.eq(e.doc) ? "reset" : e.scrollToSelection > r.scrollToSelection ? "to selection" : "preserve", d = i || !this.docView.matchesNode(e.doc, a, l);
+    (d || !e.selection.eq(r.selection)) && (s = !0);
+    let u = c == "preserve" && s && this.dom.style.overflowAnchor == null && Nu(this);
     if (s) {
       this.domObserver.stop();
-      let f = u && (ie || U) && !this.composing && !r.selection.empty && !e.selection.empty && Xf(r.selection, e.selection);
-      if (u) {
+      let f = d && (ie || U) && !this.composing && !r.selection.empty && !e.selection.empty && Xf(r.selection, e.selection);
+      if (d) {
         let h = U ? this.trackWrites = this.domSelectionRange().focusNode : null;
         (i || !this.docView.update(e.doc, a, l, this)) && (this.docView.updateOuterDeco([]), this.docView.destroy(), this.docView = lo(e.doc, a, l, this.dom, this)), h && !this.trackWrites && (f = !0);
       }
       f || !(this.input.mouseDown && this.domObserver.currentSelection.eq(this.domSelectionRange()) && tf(this)) ? Pe(this, f) : (ra(this, e.selection), this.domObserver.setCurSelection()), this.domObserver.start();
     }
-    this.updatePluginViews(r), c == "reset" ? this.dom.scrollTop = 0 : c == "to selection" ? this.scrollToSelection() : d && Pd(d);
+    this.updatePluginViews(r), c == "reset" ? this.dom.scrollTop = 0 : c == "to selection" ? this.scrollToSelection() : u && Pu(u);
   }
   /**
   @internal
@@ -10214,7 +10213,7 @@ class Yf {
   Focus the editor.
   */
   focus() {
-    this.domObserver.stop(), this.editable && Dd(this.dom), Pe(this), this.domObserver.start();
+    this.domObserver.stop(), this.editable && Du(this.dom), Pe(this), this.domObserver.start();
   }
   /**
   Get the document root in which the editor exists. This will
@@ -10248,7 +10247,7 @@ class Yf {
   the top level, not in any node.
   */
   posAtCoords(e) {
-    return Bd(this, e);
+    return Bu(this, e);
   }
   /**
   Returns the viewport rectangle at a given document position.
@@ -10313,7 +10312,7 @@ class Yf {
   pass a different state.
   */
   endOfTextblock(e, t) {
-    return jd(this, t || this.state, e);
+    return ju(this, t || this.state, e);
   }
   /**
   Run the editor's paste logic with the given HTML string. The
@@ -10367,7 +10366,7 @@ class Yf {
   @internal
   */
   domSelectionRange() {
-    return X && this.root.nodeType === 11 && vd(this.dom.ownerDocument) == this.dom ? jf(this) : this.domSelection();
+    return X && this.root.nodeType === 11 && vu(this.dom.ownerDocument) == this.dom ? jf(this) : this.domSelection();
   }
   /**
   @internal
@@ -10605,7 +10604,7 @@ function At(n, e, t = !1) {
   }
   return !1;
 }
-const uh = (n, e, t) => {
+const dh = (n, e, t) => {
   let { $head: r, empty: i } = n.selection, s = r;
   if (!i)
     return !1;
@@ -10627,12 +10626,12 @@ function Oa(n) {
     }
   return null;
 }
-function dh(n, e) {
+function uh(n, e) {
   let { $cursor: t } = n.selection;
   return !t || (e ? !e.endOfTextblock("forward", n) : t.parentOffset < t.parent.content.size) ? null : t;
 }
 const fh = (n, e, t) => {
-  let r = dh(n, t);
+  let r = uh(n, t);
   if (!r)
     return !1;
   let i = va(r);
@@ -10765,26 +10764,26 @@ function Ea(n, e, t) {
   let l = e.parent.canReplace(e.index(), e.index() + 1);
   if (l && (s = (o = r.contentMatchAt(r.childCount)).findWrapping(i.type)) && o.matchType(s[0] || i.type).validEnd) {
     if (t) {
-      let d = e.pos + i.nodeSize, f = b.empty;
+      let u = e.pos + i.nodeSize, f = b.empty;
       for (let m = s.length - 1; m >= 0; m--)
         f = b.from(s[m].create(null, f));
       f = b.from(r.copy(f));
-      let h = n.tr.step(new z(e.pos - 1, d, e.pos, d, new S(f, 1, 0), s.length, !0)), p = d + 2 * s.length;
+      let h = n.tr.step(new z(e.pos - 1, u, e.pos, u, new S(f, 1, 0), s.length, !0)), p = u + 2 * s.length;
       Ye(h.doc, p) && h.join(p), t(h.scrollIntoView());
     }
     return !0;
   }
-  let a = A.findFrom(e, 1), c = a && a.$from.blockRange(a.$to), u = c && Dt(c);
-  if (u != null && u >= e.depth)
-    return t && t(n.tr.lift(c, u).scrollIntoView()), !0;
+  let a = A.findFrom(e, 1), c = a && a.$from.blockRange(a.$to), d = c && Dt(c);
+  if (d != null && d >= e.depth)
+    return t && t(n.tr.lift(c, d).scrollIntoView()), !0;
   if (l && At(i, "start", !0) && At(r, "end")) {
-    let d = r, f = [];
-    for (; f.push(d), !d.isTextblock; )
-      d = d.lastChild;
+    let u = r, f = [];
+    for (; f.push(u), !u.isTextblock; )
+      u = u.lastChild;
     let h = i, p = 1;
     for (; !h.isTextblock; h = h.firstChild)
       p++;
-    if (d.canReplace(d.childCount, d.childCount, h.content)) {
+    if (u.canReplace(u.childCount, u.childCount, h.content)) {
       if (t) {
         let m = b.empty;
         for (let y = f.length - 1; y >= 0; y--)
@@ -10827,8 +10826,8 @@ function Po(n, e = null) {
           if (a.type == n)
             i = !0;
           else {
-            let u = t.doc.resolve(c), d = u.index();
-            i = u.parent.canReplaceWith(d, d + 1, n);
+            let d = t.doc.resolve(c), u = d.index();
+            i = d.parent.canReplaceWith(u, u + 1, n);
           }
       });
     }
@@ -10854,8 +10853,8 @@ function Th(n, e = null) {
     if (o.depth >= 2 && i.node(o.depth - 1).type.compatibleContent(n) && o.startIndex == 0) {
       if (i.index(o.depth - 1) == 0)
         return !1;
-      let u = t.doc.resolve(o.start - 2);
-      a = new Mn(u, u, o.depth), o.endIndex < o.parent.childCount && (o = new Mn(i, t.doc.resolve(s.end(o.depth)), o.depth)), l = !0;
+      let d = t.doc.resolve(o.start - 2);
+      a = new Mn(d, d, o.depth), o.endIndex < o.parent.childCount && (o = new Mn(i, t.doc.resolve(s.end(o.depth)), o.depth)), l = !0;
     }
     let c = rs(a, n, e, o);
     return c ? (r && r(Mh(t.tr, o, c, l, n).scrollIntoView()), !0) : !1;
@@ -10863,15 +10862,15 @@ function Th(n, e = null) {
 }
 function Mh(n, e, t, r, 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));
+  for (let d = t.length - 1; d >= 0; d--)
+    s = b.from(t[d].type.create(t[d].attrs, s));
   n.step(new z(e.start - (r ? 2 : 0), e.end, e.start, e.end, new S(s, 0, 0), t.length, !0));
   let o = 0;
-  for (let u = 0; u < t.length; u++)
-    t[u].type == i && (o = u + 1);
+  for (let d = 0; d < t.length; d++)
+    t[d].type == i && (o = d + 1);
   let l = t.length - o, a = e.start + t.length - (r ? 2 : 0), c = e.parent;
-  for (let u = e.startIndex, d = e.endIndex, f = !0; u < d; u++, f = !1)
-    !f && vt(n.doc, a, l) && (n.split(a, l), a += 2 * l), a += c.child(u).nodeSize;
+  for (let d = e.startIndex, u = e.endIndex, f = !0; d < u; d++, f = !1)
+    !f && vt(n.doc, a, l) && (n.split(a, l), a += 2 * l), a += c.child(d).nodeSize;
   return n;
 }
 function wh(n) {
@@ -10897,11 +10896,11 @@ function Nh(n, e, t) {
   let s = r.doc.resolve(t.start), o = s.nodeAfter;
   if (r.mapping.map(t.end) != t.start + s.nodeAfter.nodeSize)
     return !1;
-  let l = t.startIndex == 0, a = t.endIndex == i.childCount, c = s.node(-1), u = s.index(-1);
-  if (!c.canReplace(u + (l ? 0 : 1), u + 1, o.content.append(a ? b.empty : b.from(i))))
+  let l = t.startIndex == 0, a = t.endIndex == i.childCount, c = s.node(-1), d = s.index(-1);
+  if (!c.canReplace(d + (l ? 0 : 1), d + 1, o.content.append(a ? b.empty : b.from(i))))
     return !1;
-  let d = s.pos, f = d + o.nodeSize;
-  return r.step(new z(d - (l ? 1 : 0), f + (a ? 1 : 0), d + 1, f - 1, new S((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;
+  let u = s.pos, f = u + o.nodeSize;
+  return r.step(new z(u - (l ? 1 : 0), f + (a ? 1 : 0), u + 1, f - 1, new S((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;
 }
 function Ph(n) {
   return function(e, t) {
@@ -10915,8 +10914,8 @@ function Ph(n) {
     if (a.type != n)
       return !1;
     if (t) {
-      let c = a.lastChild && a.lastChild.type == l.type, u = b.from(c ? n.create() : null), d = new S(b.from(n.create(null, b.from(l.type.create(null, u)))), c ? 3 : 1, 0), f = s.start, h = s.end;
-      t(e.tr.step(new z(f - (c ? 3 : 1), h, f, h, d, 1, !0)).scrollIntoView());
+      let c = a.lastChild && a.lastChild.type == l.type, d = b.from(c ? n.create() : null), u = new S(b.from(n.create(null, b.from(l.type.create(null, d)))), c ? 3 : 1, 0), f = s.start, h = s.end;
+      t(e.tr.step(new z(f - (c ? 3 : 1), h, f, h, u, 1, !0)).scrollIntoView());
     }
     return !0;
   };
@@ -10959,9 +10958,9 @@ class Sr {
   }
   get commands() {
     const { rawCommands: e, editor: t, state: r } = this, { view: i } = t, { tr: s } = r, o = this.buildProps(s);
-    return Object.fromEntries(Object.entries(e).map(([l, a]) => [l, (...u) => {
-      const d = a(...u)(o);
-      return !s.getMeta("preventDispatch") && !this.hasCustomState && i.dispatch(s), d;
+    return Object.fromEntries(Object.entries(e).map(([l, a]) => [l, (...d) => {
+      const u = a(...d)(o);
+      return !s.getMeta("preventDispatch") && !this.hasCustomState && i.dispatch(s), u;
     }]));
   }
   get chain() {
@@ -10971,19 +10970,19 @@ class Sr {
     return () => this.createCan();
   }
   createChain(e, t = !0) {
-    const { rawCommands: r, editor: i, state: s } = this, { view: o } = i, l = [], a = !!e, c = e || s.tr, u = () => (!a && t && !c.getMeta("preventDispatch") && !this.hasCustomState && o.dispatch(c), l.every((f) => f === !0)), d = {
+    const { rawCommands: r, editor: i, state: s } = this, { view: o } = i, l = [], a = !!e, c = e || s.tr, d = () => (!a && t && !c.getMeta("preventDispatch") && !this.hasCustomState && o.dispatch(c), l.every((f) => f === !0)), u = {
       ...Object.fromEntries(Object.entries(r).map(([f, h]) => [f, (...m) => {
         const g = this.buildProps(c, t), y = h(...m)(g);
-        return l.push(y), d;
+        return l.push(y), u;
       }])),
-      run: u
+      run: d
     };
-    return d;
+    return u;
   }
   createCan(e) {
     const { rawCommands: t, state: r } = this, i = !1, s = e || r.tr, o = this.buildProps(s, i);
     return {
-      ...Object.fromEntries(Object.entries(t).map(([a, c]) => [a, (...u) => c(...u)({ ...o, dispatch: void 0 })])),
+      ...Object.fromEntries(Object.entries(t).map(([a, c]) => [a, (...d) => c(...d)({ ...o, dispatch: void 0 })])),
       chain: () => this.createChain(s, i)
     };
   }
@@ -11003,7 +11002,7 @@ class Sr {
       chain: () => this.createChain(e),
       can: () => this.createCan(e),
       get commands() {
-        return Object.fromEntries(Object.entries(r).map(([a, c]) => [a, (...u) => c(...u)(l)]));
+        return Object.fromEntries(Object.entries(r).map(([a, c]) => [a, (...d) => c(...d)(l)]));
       }
     };
     return l;
@@ -11059,11 +11058,11 @@ function Ma(n) {
     }, a = x(o, "addGlobalAttributes", l);
     if (!a)
       return;
-    a().forEach((u) => {
-      u.types.forEach((d) => {
-        Object.entries(u.attributes).forEach(([f, h]) => {
+    a().forEach((d) => {
+      d.types.forEach((u) => {
+        Object.entries(d.attributes).forEach(([f, h]) => {
           e.push({
-            type: d,
+            type: u,
             name: f,
             attribute: {
               ...s,
@@ -11082,14 +11081,14 @@ function Ma(n) {
     if (!a)
       return;
     const c = a();
-    Object.entries(c).forEach(([u, d]) => {
+    Object.entries(c).forEach(([d, u]) => {
       const f = {
         ...s,
-        ...d
+        ...u
       };
       typeof (f == null ? void 0 : f.default) == "function" && (f.default = f.default()), f != null && f.isRequired && (f == null ? void 0 : f.default) === void 0 && delete f.default, e.push({
         type: o.name,
-        name: u,
+        name: d,
         attribute: f
       });
     });
@@ -11159,74 +11158,74 @@ function Io(n) {
 function _h(n, e) {
   var t;
   const r = Ma(n), { nodeExtensions: i, markExtensions: s } = xr(n), o = (t = i.find((c) => x(c, "topNode"))) === null || t === void 0 ? void 0 : t.name, l = Object.fromEntries(i.map((c) => {
-    const u = r.filter((y) => y.type === c.name), d = {
+    const d = r.filter((y) => y.type === c.name), u = {
       name: c.name,
       options: c.options,
       storage: c.storage,
       editor: e
     }, f = n.reduce((y, O) => {
-      const E = x(O, "extendNodeSchema", d);
+      const E = x(O, "extendNodeSchema", u);
       return {
         ...y,
         ...E ? E(c) : {}
       };
     }, {}), h = Io({
       ...f,
-      content: w(x(c, "content", d)),
-      marks: w(x(c, "marks", d)),
-      group: w(x(c, "group", d)),
-      inline: w(x(c, "inline", d)),
-      atom: w(x(c, "atom", d)),
-      selectable: w(x(c, "selectable", d)),
-      draggable: w(x(c, "draggable", d)),
-      code: w(x(c, "code", d)),
-      defining: w(x(c, "defining", d)),
-      isolating: w(x(c, "isolating", d)),
-      attrs: Object.fromEntries(u.map((y) => {
+      content: w(x(c, "content", u)),
+      marks: w(x(c, "marks", u)),
+      group: w(x(c, "group", u)),
+      inline: w(x(c, "inline", u)),
+      atom: w(x(c, "atom", u)),
+      selectable: w(x(c, "selectable", u)),
+      draggable: w(x(c, "draggable", u)),
+      code: w(x(c, "code", u)),
+      defining: w(x(c, "defining", u)),
+      isolating: w(x(c, "isolating", u)),
+      attrs: Object.fromEntries(d.map((y) => {
         var O;
         return [y.name, { default: (O = y == null ? void 0 : y.attribute) === null || O === void 0 ? void 0 : O.default }];
       }))
-    }), p = w(x(c, "parseHTML", d));
-    p && (h.parseDOM = p.map((y) => Do(y, u)));
-    const m = x(c, "renderHTML", d);
+    }), p = w(x(c, "parseHTML", u));
+    p && (h.parseDOM = p.map((y) => Do(y, d)));
+    const m = x(c, "renderHTML", u);
     m && (h.toDOM = (y) => m({
       node: y,
-      HTMLAttributes: Vi(y, u)
+      HTMLAttributes: Vi(y, d)
     }));
-    const g = x(c, "renderText", d);
+    const g = x(c, "renderText", u);
     return g && (h.toText = g), [c.name, h];
   })), a = Object.fromEntries(s.map((c) => {
-    const u = r.filter((g) => g.type === c.name), d = {
+    const d = r.filter((g) => g.type === c.name), u = {
       name: c.name,
       options: c.options,
       storage: c.storage,
       editor: e
     }, f = n.reduce((g, y) => {
-      const O = x(y, "extendMarkSchema", d);
+      const O = x(y, "extendMarkSchema", u);
       return {
         ...g,
         ...O ? O(c) : {}
       };
     }, {}), h = Io({
       ...f,
-      inclusive: w(x(c, "inclusive", d)),
-      excludes: w(x(c, "excludes", d)),
-      group: w(x(c, "group", d)),
-      spanning: w(x(c, "spanning", d)),
-      code: w(x(c, "code", d)),
-      attrs: Object.fromEntries(u.map((g) => {
+      inclusive: w(x(c, "inclusive", u)),
+      excludes: w(x(c, "excludes", u)),
+      group: w(x(c, "group", u)),
+      spanning: w(x(c, "spanning", u)),
+      code: w(x(c, "code", u)),
+      attrs: Object.fromEntries(d.map((g) => {
         var y;
         return [g.name, { default: (y = g == null ? void 0 : g.attribute) === null || y === void 0 ? void 0 : y.default }];
       }))
-    }), p = w(x(c, "parseHTML", d));
-    p && (h.parseDOM = p.map((g) => Do(g, u)));
-    const m = x(c, "renderHTML", d);
+    }), p = w(x(c, "parseHTML", u));
+    p && (h.parseDOM = p.map((g) => Do(g, d)));
+    const m = x(c, "renderHTML", u);
     return m && (h.toDOM = (g) => m({
       mark: g,
-      HTMLAttributes: Vi(g, u)
+      HTMLAttributes: Vi(g, d)
     })), [c.name, h];
   }));
-  return new Hu({
+  return new Hd({
     topNode: o,
     nodes: l,
     marks: a
@@ -11243,13 +11242,13 @@ const Lh = (n, e = 500) => {
   const r = n.parentOffset;
   return n.parent.nodesBetween(Math.max(0, r - e), r, (i, s, o, l) => {
     var a, c;
-    const u = ((c = (a = i.type.spec).toText) === null || c === void 0 ? void 0 : c.call(a, {
+    const d = ((c = (a = i.type.spec).toText) === null || c === void 0 ? void 0 : c.call(a, {
       node: i,
       pos: s,
       parent: o,
       index: l
     })) || i.textContent || "%leaf%";
-    t += u.slice(0, Math.max(0, r - s));
+    t += d.slice(0, Math.max(0, r - s));
   }), t;
 };
 function gs(n) {
@@ -11280,12 +11279,12 @@ function yi(n) {
     c.parent.type.spec.code || !((e = c.nodeBefore || c.nodeAfter) === null || e === void 0) && e.marks.find((f) => f.type.spec.code)
   )
     return !1;
-  let u = !1;
-  const d = Lh(c) + s;
+  let d = !1;
+  const u = Lh(c) + s;
   return o.forEach((f) => {
-    if (u)
+    if (d)
       return;
-    const h = Bh(d, f.find);
+    const h = Bh(u, f.find);
     if (!h)
       return;
     const p = a.state.tr, m = kr({
@@ -11310,8 +11309,8 @@ function yi(n) {
       from: r,
       to: i,
       text: s
-    }), a.dispatch(p), u = !0);
-  }), u;
+    }), a.dispatch(p), d = !0);
+  }), d;
 }
 function $h(n) {
   const { editor: e, rules: t } = n, r = new te({
@@ -11392,10 +11391,10 @@ function Hh(n) {
     editor: e,
     state: t
   }), c = [];
-  return t.doc.nodesBetween(r, i, (d, f) => {
-    if (!d.isTextblock || d.type.spec.code)
+  return t.doc.nodesBetween(r, i, (u, f) => {
+    if (!u.isTextblock || u.type.spec.code)
       return;
-    const h = Math.max(r, f), p = Math.min(i, f + d.content.size), m = d.textBetween(h - f, p - f, void 0, "");
+    const h = Math.max(r, f), p = Math.min(i, f + u.content.size), m = u.textBetween(h - f, p - f, void 0, "");
     zh(m, s.find).forEach((y) => {
       if (y.index === void 0)
         return;
@@ -11412,7 +11411,7 @@ function Hh(n) {
       });
       c.push(D);
     });
-  }), c.every((d) => d !== null);
+  }), c.every((u) => u !== null);
 }
 function jh(n) {
   const { editor: e, rules: t } = n;
@@ -11420,9 +11419,9 @@ function jh(n) {
   return t.map((l) => new te({
     // we register a global drag handler to track the current drag source element
     view(a) {
-      const c = (u) => {
-        var d;
-        r = !((d = a.dom.parentElement) === null || d === void 0) && d.contains(u.target) ? a.dom.parentElement : null;
+      const c = (d) => {
+        var u;
+        r = !((u = a.dom.parentElement) === null || u === void 0) && u.contains(d.target) ? a.dom.parentElement : null;
       };
       return window.addEventListener("dragstart", c), {
         destroy() {
@@ -11434,21 +11433,21 @@ function jh(n) {
       handleDOMEvents: {
         drop: (a) => (s = r === a.dom.parentElement, !1),
         paste: (a, c) => {
-          var u;
-          const d = (u = c.clipboardData) === null || u === void 0 ? void 0 : u.getData("text/html");
-          return i = !!(d != null && d.includes("data-pm-slice")), !1;
+          var d;
+          const u = (d = c.clipboardData) === null || d === void 0 ? void 0 : d.getData("text/html");
+          return i = !!(u != null && u.includes("data-pm-slice")), !1;
         }
       }
     },
-    appendTransaction: (a, c, u) => {
-      const d = a[0], f = d.getMeta("uiEvent") === "paste" && !i, h = d.getMeta("uiEvent") === "drop" && !s;
+    appendTransaction: (a, c, d) => {
+      const u = a[0], f = u.getMeta("uiEvent") === "paste" && !i, h = u.getMeta("uiEvent") === "drop" && !s;
       if (!f && !h)
         return;
-      const p = c.doc.content.findDiffStart(u.doc.content), m = c.doc.content.findDiffEnd(u.doc.content);
+      const p = c.doc.content.findDiffStart(d.doc.content), m = c.doc.content.findDiffEnd(d.doc.content);
       if (!Fh(p) || !m || p === m.b)
         return;
-      const g = u.tr, y = kr({
-        state: u,
+      const g = d.tr, y = kr({
+        state: d,
         transaction: g
       });
       if (!(!Hh({
@@ -11487,10 +11486,10 @@ class Ot {
       a && this.editor.on("update", a);
       const c = x(r, "onSelectionUpdate", s);
       c && this.editor.on("selectionUpdate", c);
-      const u = x(r, "onTransaction", s);
-      u && this.editor.on("transaction", u);
-      const d = x(r, "onFocus", s);
-      d && this.editor.on("focus", d);
+      const d = x(r, "onTransaction", s);
+      d && this.editor.on("transaction", d);
+      const u = x(r, "onFocus", s);
+      u && this.editor.on("focus", u);
       const f = x(r, "onBlur", s);
       f && this.editor.on("blur", f);
       const h = x(r, "onDestroy", s);
@@ -11541,13 +11540,13 @@ class Ot {
         editor: e,
         type: gi(o.name, this.schema)
       }, a = [], c = x(o, "addKeyboardShortcuts", l);
-      let u = {};
-      if (o.type === "mark" && o.config.exitable && (u.ArrowRight = () => he.handleExit({ editor: e, mark: o })), c) {
+      let d = {};
+      if (o.type === "mark" && o.config.exitable && (d.ArrowRight = () => he.handleExit({ editor: e, mark: o })), c) {
         const m = Object.fromEntries(Object.entries(c()).map(([g, y]) => [g, () => y({ editor: e })]));
-        u = { ...u, ...m };
+        d = { ...d, ...m };
       }
-      const d = sh(u);
-      a.push(d);
+      const u = sh(d);
+      a.push(u);
       const f = x(o, "addInputRules", l);
       Ro(o, e.options.enableInputRules) && f && r.push(...f());
       const h = x(o, "addPasteRules", l);
@@ -11586,13 +11585,13 @@ class Ot {
       }, o = x(r, "addNodeView", s);
       if (!o)
         return [];
-      const l = (a, c, u, d) => {
+      const l = (a, c, d, u) => {
         const f = Vi(a, i);
         return o()({
           editor: e,
           node: a,
-          getPos: u,
-          decorations: d,
+          getPos: d,
+          decorations: u,
           HTMLAttributes: f,
           extension: r
         });
@@ -11653,16 +11652,16 @@ function Na(n, e, t) {
 
 `, textSerializers: o = {} } = t || {};
   let l = "", a = !0;
-  return n.nodesBetween(r, i, (c, u, d, f) => {
+  return n.nodesBetween(r, i, (c, d, u, f) => {
     var h;
     const p = o == null ? void 0 : o[c.type.name];
-    p ? (c.isBlock && !a && (l += s, a = !0), d && (l += p({
+    p ? (c.isBlock && !a && (l += s, a = !0), u && (l += p({
       node: c,
-      pos: u,
-      parent: d,
+      pos: d,
+      parent: u,
       index: f,
       range: e
-    }))) : c.isText ? (l += (h = c == null ? void 0 : c.text) === null || h === void 0 ? void 0 : h.slice(Math.max(r, u) - u, i - u), a = !1) : c.isBlock && !a && (l += s, a = !0);
+    }))) : c.isText ? (l += (h = c == null ? void 0 : c.text) === null || h === void 0 ? void 0 : h.slice(Math.max(r, d) - d, i - d), a = !1) : c.isBlock && !a && (l += s, a = !0);
   }), l;
 }
 function Pa(n) {
@@ -11676,7 +11675,7 @@ const Wh = be.create({
         key: new se("clipboardTextSerializer"),
         props: {
           clipboardTextSerializer: () => {
-            const { editor: n } = this, { state: e, schema: t } = n, { doc: r, 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 = Pa(t);
+            const { editor: n } = this, { state: e, schema: t } = n, { doc: r, selection: i } = e, { ranges: s } = i, o = Math.min(...s.map((d) => d.$from.pos)), l = Math.max(...s.map((d) => d.$to.pos)), a = Pa(t);
             return Na(r, { from: o, to: l }, {
               textSerializers: a
             });
@@ -11694,12 +11693,12 @@ const Wh = be.create({
     n.doc.nodesBetween(s.pos, o.pos, (l, a) => {
       if (l.type.isText)
         return;
-      const { doc: c, mapping: u } = e, d = c.resolve(u.map(a)), f = c.resolve(u.map(a + l.nodeSize)), h = d.blockRange(f);
+      const { doc: c, mapping: d } = e, u = c.resolve(d.map(a)), f = c.resolve(d.map(a + l.nodeSize)), h = u.blockRange(f);
       if (!h)
         return;
       const p = Dt(h);
       if (l.type.isTextblock) {
-        const { defaultType: m } = d.parent.contentMatchAt(d.index());
+        const { defaultType: m } = u.parent.contentMatchAt(u.index());
         e.setNodeMarkup(h.start, m);
       }
       (p || p === 0) && e.lift(h, p);
@@ -11772,11 +11771,11 @@ function Qe(n, e) {
   return n;
 }
 const ip = (n, e = {}) => ({ tr: t, state: r, dispatch: i }) => {
-  const s = Qe(n, r.schema), { doc: o, selection: l } = t, { $from: a, from: c, to: u } = l;
+  const s = Qe(n, r.schema), { doc: o, selection: l } = t, { $from: a, from: c, to: d } = l;
   if (i) {
-    const d = ys(a, s, e);
-    if (d && d.from <= c && d.to >= u) {
-      const f = N.create(o, d.from, d.to);
+    const u = ys(a, s, e);
+    if (u && u.from <= c && u.to >= d) {
+      const f = N.create(o, u.from, u.to);
       t.setSelection(f);
     }
   }
@@ -11862,11 +11861,11 @@ function cp(n, e, t) {
     return;
   const s = n.mapping.maps[r];
   let o = 0;
-  s.forEach((l, a, c, u) => {
-    o === 0 && (o = u);
+  s.forEach((l, a, c, d) => {
+    o === 0 && (o = d);
   }), n.setSelection(A.near(n.doc.resolve(o), t));
 }
-const up = (n) => n.toString().startsWith("<"), dp = (n, e, t) => ({ tr: r, dispatch: i, editor: s }) => {
+const dp = (n) => n.toString().startsWith("<"), up = (n, e, t) => ({ tr: r, dispatch: i, editor: s }) => {
   if (i) {
     t = {
       parseOptions: {},
@@ -11881,10 +11880,10 @@ const up = (n) => n.toString().startsWith("<"), dp = (n, e, t) => ({ tr: r, disp
     });
     if (o.toString() === "<>")
       return !0;
-    let { from: l, to: a } = typeof n == "number" ? { from: n, to: n } : n, c = !0, u = !0;
-    if ((up(o) ? o : [o]).forEach((f) => {
-      f.check(), c = c ? f.isText && f.marks.length === 0 : !1, u = u ? f.isBlock : !1;
-    }), l === a && u) {
+    let { from: l, to: a } = typeof n == "number" ? { from: n, to: n } : n, c = !0, d = !0;
+    if ((dp(o) ? o : [o]).forEach((f) => {
+      f.check(), c = c ? f.isText && f.marks.length === 0 : !1, d = d ? f.isBlock : !1;
+    }), l === a && d) {
       const { parent: f } = r.doc.resolve(l);
       f.isTextblock && !f.type.spec.code && !f.childCount && (l -= 1, a += 1);
     }
@@ -11930,24 +11929,24 @@ const yp = (n) => ({ editor: e, view: t, tr: r, dispatch: i }) => {
     t.someProp("handleKeyDown", (c) => c(t, l));
   });
   return a == null || a.steps.forEach((c) => {
-    const u = c.map(r.mapping);
-    u && i && r.maybeStep(u);
+    const d = c.map(r.mapping);
+    d && i && r.maybeStep(d);
   }), !0;
 };
 function tn(n, e, t = {}) {
   const { from: r, to: i, empty: s } = n.selection, o = e ? H(e, n.schema) : null, l = [];
-  n.doc.nodesBetween(r, i, (d, f) => {
-    if (d.isText)
+  n.doc.nodesBetween(r, i, (u, f) => {
+    if (u.isText)
       return;
-    const h = Math.max(r, f), p = Math.min(i, f + d.nodeSize);
+    const h = Math.max(r, f), p = Math.min(i, f + u.nodeSize);
     l.push({
-      node: d,
+      node: u,
       from: h,
       to: p
     });
   });
-  const a = i - r, c = l.filter((d) => o ? o.name === d.node.type.name : !0).filter((d) => Ln(d.node.attrs, t, { strict: !1 }));
-  return s ? !!c.length : c.reduce((d, f) => d + f.to - f.from, 0) >= a;
+  const a = i - r, c = l.filter((u) => o ? o.name === u.node.type.name : !0).filter((u) => Ln(u.node.attrs, t, { strict: !1 }));
+  return s ? !!c.length : c.reduce((u, f) => u + f.to - f.from, 0) >= a;
 }
 const bp = (n, e = {}) => ({ state: t, dispatch: r }) => {
   const i = H(n, t.schema);
@@ -11967,16 +11966,16 @@ const Op = (n, e) => ({ tr: t, state: r, dispatch: i }) => {
   let s = null, o = null;
   const l = Er(typeof n == "string" ? n : n.name, r.schema);
   return l ? (l === "node" && (s = H(n, r.schema)), l === "mark" && (o = Qe(n, r.schema)), i && t.selection.ranges.forEach((a) => {
-    r.doc.nodesBetween(a.$from.pos, a.$to.pos, (c, u) => {
-      s && s === c.type && t.setNodeMarkup(u, void 0, Lo(c.attrs, e)), o && c.marks.length && c.marks.forEach((d) => {
-        o === d.type && t.addMark(u, u + c.nodeSize, o.create(Lo(d.attrs, e)));
+    r.doc.nodesBetween(a.$from.pos, a.$to.pos, (c, d) => {
+      s && s === c.type && t.setNodeMarkup(d, void 0, Lo(c.attrs, e)), o && c.marks.length && c.marks.forEach((u) => {
+        o === u.type && t.addMark(d, d + c.nodeSize, o.create(Lo(u.attrs, e)));
       });
     });
   }), !0) : !1;
 }, vp = () => ({ tr: n, dispatch: e }) => (e && n.scrollIntoView(), !0), Cp = () => ({ tr: n, commands: e }) => e.setTextSelection({
   from: 0,
   to: n.doc.content.size
-}), Ep = () => ({ state: n, dispatch: e }) => uh(n, e), Tp = () => ({ state: n, dispatch: e }) => hh(n, e), Mp = () => ({ state: n, dispatch: e }) => xh(n, e), wp = () => ({ state: n, dispatch: e }) => Ch(n, e), Ap = () => ({ state: n, dispatch: e }) => vh(n, e);
+}), Ep = () => ({ state: n, dispatch: e }) => dh(n, e), Tp = () => ({ state: n, dispatch: e }) => hh(n, e), Mp = () => ({ state: n, dispatch: e }) => xh(n, e), wp = () => ({ state: n, dispatch: e }) => Ch(n, e), Ap = () => ({ state: n, dispatch: e }) => vh(n, e);
 function Ra(n, e, t = {}) {
   return Bn(n, e, { slice: !1, parseOptions: t });
 }
@@ -12081,15 +12080,15 @@ function $a(n) {
       o.push({ from: l, to: a });
     }
     o.forEach(({ from: l, to: a }) => {
-      const c = e.slice(s).map(l, -1), u = e.slice(s).map(a), d = e.invert().map(c, -1), f = e.invert().map(u);
+      const c = e.slice(s).map(l, -1), d = e.slice(s).map(a), u = e.invert().map(c, -1), f = e.invert().map(d);
       r.push({
         oldRange: {
-          from: d,
+          from: u,
           to: f
         },
         newRange: {
           from: c,
-          to: u
+          to: d
         }
       });
     });
@@ -12120,11 +12119,11 @@ function xn(n, e, t) {
 function Wi(n, e, t = {}) {
   const { empty: r, ranges: i } = n.selection, s = e ? Qe(e, n.schema) : null;
   if (r)
-    return !!(n.storedMarks || n.selection.$from.marks()).filter((d) => s ? s.name === d.type.name : !0).find((d) => Ln(d.attrs, t, { strict: !1 }));
+    return !!(n.storedMarks || n.selection.$from.marks()).filter((u) => s ? s.name === u.type.name : !0).find((u) => Ln(u.attrs, t, { strict: !1 }));
   let o = 0;
   const l = [];
-  if (i.forEach(({ $from: d, $to: f }) => {
-    const h = d.pos, p = f.pos;
+  if (i.forEach(({ $from: u, $to: f }) => {
+    const h = u.pos, p = f.pos;
     n.doc.nodesBetween(h, p, (m, g) => {
       if (!m.isText && !m.marks.length)
         return;
@@ -12137,7 +12136,7 @@ function Wi(n, e, t = {}) {
     });
   }), o === 0)
     return !1;
-  const a = l.filter((d) => s ? s.name === d.mark.type.name : !0).filter((d) => Ln(d.mark.attrs, t, { strict: !1 })).reduce((d, f) => d + f.to - f.from, 0), c = l.filter((d) => s ? d.mark.type !== s && d.mark.type.excludes(s) : !0).reduce((d, f) => d + f.to - f.from, 0);
+  const a = l.filter((u) => s ? s.name === u.mark.type.name : !0).filter((u) => Ln(u.mark.attrs, t, { strict: !1 })).reduce((u, f) => u + f.to - f.from, 0), c = l.filter((u) => s ? u.mark.type !== s && u.mark.type.excludes(s) : !0).reduce((u, f) => u + f.to - f.from, 0);
   return (a > 0 ? a + c : a) >= o;
 }
 function $p(n, e, t = {}) {
@@ -12173,11 +12172,11 @@ function zp(n, e, t) {
   const { ranges: o } = i;
   return o.some(({ $from: l, $to: a }) => {
     let c = l.depth === 0 ? n.doc.inlineContent && n.doc.type.allowsMarkType(t) : !1;
-    return n.doc.nodesBetween(l.pos, a.pos, (u, d, f) => {
+    return n.doc.nodesBetween(l.pos, a.pos, (d, u, f) => {
       if (c)
         return !1;
-      if (u.isInline) {
-        const h = !f || f.type.allowsMarkType(t), p = !!t.isInSet(u.marks) || !u.marks.some((m) => m.type.excludes(t));
+      if (d.isInline) {
+        const h = !f || f.type.allowsMarkType(t), p = !!t.isInSet(d.marks) || !d.marks.some((m) => m.type.excludes(t));
         c = h && p;
       }
       return !c;
@@ -12195,9 +12194,9 @@ const Hp = (n, e = {}) => ({ tr: t, state: r, dispatch: i }) => {
       }));
     } else
       l.forEach((c) => {
-        const u = c.$from.pos, d = c.$to.pos;
-        r.doc.nodesBetween(u, d, (f, h) => {
-          const p = Math.max(h, u), m = Math.min(h + f.nodeSize, d);
+        const d = c.$from.pos, u = c.$to.pos;
+        r.doc.nodesBetween(d, u, (f, h) => {
+          const p = Math.max(h, d), m = Math.min(h + f.nodeSize, u);
           f.marks.find((y) => y.type === a) ? f.marks.forEach((y) => {
             a === y.type && t.addMark(p, m, a.create({
               ...y.attrs,
@@ -12218,8 +12217,8 @@ const Hp = (n, e = {}) => ({ tr: t, state: r, dispatch: i }) => {
   return !0;
 }, Wp = (n) => ({ tr: e, dispatch: t }) => {
   if (t) {
-    const { doc: r } = e, { from: i, to: s } = typeof n == "number" ? { from: n, to: n } : n, o = N.atStart(r).from, l = N.atEnd(r).to, a = rt(i, o, l), c = rt(s, o, l), u = N.create(r, a, c);
-    e.setSelection(u);
+    const { doc: r } = e, { from: i, to: s } = typeof n == "number" ? { from: n, to: n } : n, o = N.atStart(r).from, l = N.atEnd(r).to, a = rt(i, o, l), c = rt(s, o, l), d = N.create(r, a, c);
+    e.setSelection(d);
   }
   return !0;
 }, Kp = (n) => ({ state: e, dispatch: t }) => {
@@ -12234,27 +12233,27 @@ function $o(n, e) {
   }
 }
 const Up = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, editor: i }) => {
-  const { selection: s, doc: o } = e, { $from: l, $to: a } = s, c = i.extensionManager.attributes, u = xn(c, l.node().type.name, l.node().attrs);
+  const { selection: s, doc: o } = e, { $from: l, $to: a } = s, c = i.extensionManager.attributes, d = xn(c, l.node().type.name, l.node().attrs);
   if (s instanceof C && s.node.isBlock)
     return !l.parentOffset || !vt(o, l.pos) ? !1 : (r && (n && $o(t, i.extensionManager.splittableMarks), e.split(l.pos).scrollIntoView()), !0);
   if (!l.parent.isBlock)
     return !1;
   if (r) {
-    const d = a.parentOffset === a.parent.content.size;
+    const u = a.parentOffset === a.parent.content.size;
     s instanceof N && e.deleteSelection();
     const f = l.depth === 0 ? void 0 : Pp(l.node(-1).contentMatchAt(l.indexAfter(-1)));
-    let h = d && f ? [
+    let h = u && f ? [
       {
         type: f,
-        attrs: u
+        attrs: d
       }
     ] : void 0, p = vt(e.doc, e.mapping.map(l.pos), 1, h);
     if (!h && !p && vt(e.doc, e.mapping.map(l.pos), 1, f ? [{ type: f }] : void 0) && (p = !0, h = f ? [
       {
         type: f,
-        attrs: u
+        attrs: d
       }
-    ] : void 0), p && (e.split(e.mapping.map(l.pos), 1, h), f && !d && !l.parentOffset && l.parent.type !== f)) {
+    ] : void 0), p && (e.split(e.mapping.map(l.pos), 1, h), f && !u && !l.parentOffset && l.parent.type !== f)) {
       const m = e.mapping.map(l.before()), g = e.doc.resolve(m);
       l.node(-1).canReplaceWith(g.index(), g.index() + 1, f) && e.setNodeMarkup(e.mapping.map(l.before()), f);
     }
@@ -12266,10 +12265,10 @@ const Up = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, edit
   const o = H(n, t.schema), { $from: l, $to: a } = t.selection, c = t.selection.node;
   if (c && c.isBlock || l.depth < 2 || !l.sameParent(a))
     return !1;
-  const u = l.node(-1);
-  if (u.type !== o)
+  const d = l.node(-1);
+  if (d.type !== o)
     return !1;
-  const d = i.extensionManager.attributes;
+  const u = i.extensionManager.attributes;
   if (l.parent.content.size === 0 && l.node(-1).childCount === l.indexAfter(-1)) {
     if (l.depth === 2 || l.node(-3).type !== o || l.index(-2) !== l.node(-2).childCount - 1)
       return !1;
@@ -12278,7 +12277,7 @@ const Up = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, edit
       const y = l.index(-1) ? 1 : l.index(-2) ? 2 : 3;
       for (let _ = l.depth - y; _ >= l.depth - 3; _ -= 1)
         g = b.from(l.node(_).copy(g));
-      const O = l.indexAfter(-1) < l.node(-2).childCount ? 1 : l.indexAfter(-2) < l.node(-3).childCount ? 2 : 3, E = xn(d, l.node().type.name, l.node().attrs), I = ((s = o.contentMatch.defaultType) === null || s === void 0 ? void 0 : s.createAndFill(E)) || void 0;
+      const O = l.indexAfter(-1) < l.node(-2).childCount ? 1 : l.indexAfter(-2) < l.node(-3).childCount ? 2 : 3, E = xn(u, l.node().type.name, l.node().attrs), I = ((s = o.contentMatch.defaultType) === null || s === void 0 ? void 0 : s.createAndFill(E)) || void 0;
       g = g.append(b.from(o.createAndFill(null, I) || void 0));
       const D = l.before(l.depth - (y - 1));
       e.replace(D, l.after(-O), new S(g, 4 - y, 0));
@@ -12291,7 +12290,7 @@ const Up = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, edit
     }
     return !0;
   }
-  const f = a.pos === l.end() ? u.contentMatchAt(0).defaultType : null, h = xn(d, u.type.name, u.attrs), p = xn(d, l.node().type.name, l.node().attrs);
+  const f = a.pos === l.end() ? d.contentMatchAt(0).defaultType : null, h = xn(u, d.type.name, d.attrs), p = xn(u, l.node().type.name, l.node().attrs);
   e.delete(l.pos, a.pos);
   const m = f ? [
     { type: o, attrs: h },
@@ -12325,19 +12324,19 @@ const Up = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, edit
     return !0;
   const i = n.doc.nodeAt(r);
   return t.node.type === (i == null ? void 0 : i.type) && Ye(n.doc, r) && n.join(r), !0;
-}, Gp = (n, e, t, r = {}) => ({ editor: i, tr: s, state: o, dispatch: l, chain: a, commands: c, can: u }) => {
-  const { extensions: d, splittableMarks: f } = i.extensionManager, h = H(n, o.schema), p = H(e, o.schema), { selection: m, storedMarks: g } = o, { $from: y, $to: O } = m, E = y.blockRange(O), I = g || m.$to.parentOffset && m.$from.marks();
+}, Gp = (n, e, t, r = {}) => ({ editor: i, tr: s, state: o, dispatch: l, chain: a, commands: c, can: d }) => {
+  const { extensions: u, splittableMarks: f } = i.extensionManager, h = H(n, o.schema), p = H(e, o.schema), { selection: m, storedMarks: g } = o, { $from: y, $to: O } = m, E = y.blockRange(O), I = g || m.$to.parentOffset && m.$from.marks();
   if (!E)
     return !1;
-  const D = ks((T) => Bo(T.type.name, d))(m);
+  const D = ks((T) => Bo(T.type.name, u))(m);
   if (E.depth >= 1 && D && E.depth - D.depth <= 1) {
     if (D.node.type === h)
       return c.liftListItem(p);
-    if (Bo(D.node.type.name, d) && h.validContent(D.node.content) && l)
+    if (Bo(D.node.type.name, u) && h.validContent(D.node.content) && l)
       return a().command(() => (s.setNodeMarkup(D.pos, h), !0)).command(() => ki(s, h)).command(() => Si(s, h)).run();
   }
-  return !t || !I || !l ? a().command(() => u().wrapInList(h, r) ? !0 : c.clearNodes()).wrapInList(h, r).command(() => ki(s, h)).command(() => Si(s, h)).run() : a().command(() => {
-    const T = u().wrapInList(h, r), _ = I.filter((P) => f.includes(P.type.name));
+  return !t || !I || !l ? a().command(() => d().wrapInList(h, r) ? !0 : c.clearNodes()).wrapInList(h, r).command(() => ki(s, h)).command(() => Si(s, h)).run() : a().command(() => {
+    const T = d().wrapInList(h, r), _ = I.filter((P) => f.includes(P.type.name));
     return s.ensureMarks(_), T ? !0 : c.clearNodes();
   }).wrapInList(h, r).command(() => ki(s, h)).command(() => Si(s, h)).run();
 }, Yp = (n, e = {}, t = {}) => ({ state: r, commands: i }) => {
@@ -12376,15 +12375,15 @@ const Up = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, edit
   }), !0;
 }, tm = (n, e = {}) => ({ tr: t, state: r, dispatch: i }) => {
   var s;
-  const { extendEmptyMarkRange: o = !1 } = e, { selection: l } = t, a = Qe(n, r.schema), { $from: c, empty: u, ranges: d } = l;
+  const { extendEmptyMarkRange: o = !1 } = e, { selection: l } = t, a = Qe(n, r.schema), { $from: c, empty: d, ranges: u } = l;
   if (!i)
     return !0;
-  if (u && o) {
+  if (d && o) {
     let { from: f, to: h } = l;
     const p = (s = c.marks().find((g) => g.type === a)) === null || s === void 0 ? void 0 : s.attrs, m = ys(c, a, p);
     m && (f = m.from, h = m.to), t.removeMark(f, h, a);
   } else
-    d.forEach((f) => {
+    u.forEach((f) => {
       t.removeMark(f.$from.pos, f.$to.pos, a);
     });
   return t.removeStoredMark(a), !0;
@@ -12392,14 +12391,14 @@ const Up = ({ keepMarks: n = !0 } = {}) => ({ tr: e, state: t, dispatch: r, edit
   let s = null, o = null;
   const l = Er(typeof n == "string" ? n : n.name, r.schema);
   return l ? (l === "node" && (s = H(n, r.schema)), l === "mark" && (o = Qe(n, r.schema)), i && t.selection.ranges.forEach((a) => {
-    const c = a.$from.pos, u = a.$to.pos;
-    r.doc.nodesBetween(c, u, (d, f) => {
-      s && s === d.type && t.setNodeMarkup(f, void 0, {
-        ...d.attrs,
+    const c = a.$from.pos, d = a.$to.pos;
+    r.doc.nodesBetween(c, d, (u, f) => {
+      s && s === u.type && t.setNodeMarkup(f, void 0, {
+        ...u.attrs,
         ...e
-      }), o && d.marks.length && d.marks.forEach((h) => {
+      }), o && u.marks.length && u.marks.forEach((h) => {
         if (o === h.type) {
-          const p = Math.max(f, c), m = Math.min(f + d.nodeSize, u);
+          const p = Math.max(f, c), m = Math.min(f + u.nodeSize, d);
           t.addMark(p, m, o.create({
             ...h.attrs,
             ...e
@@ -12433,7 +12432,7 @@ var sm = /* @__PURE__ */ Object.freeze({
   focus: op,
   forEach: lp,
   insertContent: ap,
-  insertContentAt: dp,
+  insertContentAt: up,
   joinUp: fp,
   joinDown: hp,
   joinBackward: pp,
@@ -12521,8 +12520,8 @@ const om = be.create({
       () => o.undoInputRule(),
       // maybe convert first text block node to default node
       () => o.command(({ tr: l }) => {
-        const { selection: a, doc: c } = l, { empty: u, $anchor: d } = a, { pos: f, parent: h } = d, p = A.atStart(c).from === f;
-        return !u || !p || !h.type.isTextblock || h.textContent.length ? !1 : o.clearNodes();
+        const { selection: a, doc: c } = l, { empty: d, $anchor: u } = a, { pos: f, parent: h } = u, p = A.atStart(c).from === f;
+        return !d || !p || !h.type.isTextblock || h.textContent.length ? !1 : o.clearNodes();
       }),
       () => o.deleteSelection(),
       () => o.joinBackward(),
@@ -12576,20 +12575,20 @@ const om = be.create({
           const { empty: i, from: s, to: o } = e.selection, l = A.atStart(e.doc).from, a = A.atEnd(e.doc).to;
           if (i || !(s === l && o === a) || !(t.doc.textBetween(0, t.doc.content.size, " ", " ").length === 0))
             return;
-          const d = t.tr, f = kr({
+          const u = t.tr, f = kr({
             state: t,
-            transaction: d
+            transaction: u
           }), { commands: h } = new Sr({
             editor: this.editor,
             state: f
           });
-          if (h.clearNodes(), !!d.steps.length)
-            return d;
+          if (h.clearNodes(), !!u.steps.length)
+            return u;
         }
       })
     ];
   }
-}), um = be.create({
+}), dm = be.create({
   name: "tabindex",
   addProseMirrorPlugins() {
     return [
@@ -12602,14 +12601,14 @@ const om = be.create({
     ];
   }
 });
-var dm = /* @__PURE__ */ Object.freeze({
+var um = /* @__PURE__ */ Object.freeze({
   __proto__: null,
   ClipboardTextSerializer: Wh,
   Commands: om,
   Editable: lm,
   FocusEvents: am,
   Keymap: cm,
-  Tabindex: um
+  Tabindex: dm
 });
 const fm = `.ProseMirror {
   position: relative;
@@ -12807,7 +12806,7 @@ let pm = class extends Dh {
    * Creates an extension manager.
    */
   createExtensionManager() {
-    const t = [...this.options.enableCoreExtensions ? Object.values(dm) : [], ...this.options.extensions].filter((r) => ["extension", "node", "mark"].includes(r == null ? void 0 : r.type));
+    const t = [...this.options.enableCoreExtensions ? Object.values(um) : [], ...this.options.extensions].filter((r) => ["extension", "node", "mark"].includes(r == null ? void 0 : r.type));
     this.extensionManager = new Ot(t, this);
   }
   /**
@@ -12973,10 +12972,10 @@ function nn(n) {
       const { tr: s } = e, o = r[r.length - 1], l = r[0];
       let a = t.to;
       if (o) {
-        const c = l.search(/\S/), u = t.from + l.indexOf(o), d = u + o.length;
-        if (Mr(t.from, t.to, e.doc).filter((h) => h.mark.type.excluded.find((m) => m === n.type && m !== h.mark.type)).filter((h) => h.to > u).length)
+        const c = l.search(/\S/), d = t.from + l.indexOf(o), u = d + o.length;
+        if (Mr(t.from, t.to, e.doc).filter((h) => h.mark.type.excluded.find((m) => m === n.type && m !== h.mark.type)).filter((h) => h.to > d).length)
           return null;
-        d < t.to && s.delete(d, t.to), u > t.from && s.delete(t.from + c, u), a = t.from + c + o.length, s.addMark(t.from + c, a, n.type.create(i || {})), s.removeStoredMark(n.type);
+        u < t.to && s.delete(u, t.to), d > t.from && s.delete(t.from + c, d), a = t.from + c + o.length, s.addMark(t.from + c, a, n.type.create(i || {})), s.removeStoredMark(n.type);
       }
     }
   });
@@ -12991,8 +12990,8 @@ function Fo(n) {
         const a = r[0].lastIndexOf(r[1]);
         let c = o + a;
         c > l ? c = l : l = c + r[1].length;
-        const u = r[0][r[0].length - 1];
-        s.insertText(u, o + r[0].length - 1), s.replaceWith(c, l, n.type.create(i));
+        const d = r[0][r[0].length - 1];
+        s.insertText(d, o + r[0].length - 1), s.replaceWith(c, l, n.type.create(i));
       } else
         r[0] && s.replaceWith(o, l, n.type.create(i));
     }
@@ -13017,18 +13016,18 @@ function rn(n) {
       if (!c)
         return null;
       if (o.wrap(a, c), n.keepMarks && n.editor) {
-        const { selection: d, storedMarks: f } = e, { splittableMarks: h } = n.editor.extensionManager, p = f || d.$to.parentOffset && d.$from.marks();
+        const { selection: u, storedMarks: f } = e, { splittableMarks: h } = n.editor.extensionManager, p = f || u.$to.parentOffset && u.$from.marks();
         if (p) {
           const m = p.filter((g) => h.includes(g.type.name));
           o.ensureMarks(m);
         }
       }
       if (n.keepAttributes) {
-        const d = n.type.name === "bulletList" || n.type.name === "orderedList" ? "listItem" : "taskList";
-        i().updateAttributes(d, s).run();
+        const u = n.type.name === "bulletList" || n.type.name === "orderedList" ? "listItem" : "taskList";
+        i().updateAttributes(u, s).run();
       }
-      const u = o.doc.resolve(t.from - 1).nodeBefore;
-      u && u.type === n.type && Ye(o.doc, t.from - 1) && (!n.joinPredicate || n.joinPredicate(r, u)) && o.join(t.from - 1);
+      const d = o.doc.resolve(t.from - 1).nodeBefore;
+      d && d.type === n.type && Ye(o.doc, t.from - 1) && (!n.joinPredicate || n.joinPredicate(r, d)) && o.join(t.from - 1);
     }
   });
 }
@@ -13131,12 +13130,12 @@ class mm {
   }
   onDragStart(e) {
     var t, r, i, s, o, l, a;
-    const { view: c } = this.editor, u = e.target, d = u.nodeType === 3 ? (t = u.parentElement) === null || t === void 0 ? void 0 : t.closest("[data-drag-handle]") : u.closest("[data-drag-handle]");
-    if (!this.dom || !((r = this.contentDOM) === null || r === void 0) && r.contains(u) || !d)
+    const { view: c } = this.editor, d = e.target, u = d.nodeType === 3 ? (t = d.parentElement) === null || t === void 0 ? void 0 : t.closest("[data-drag-handle]") : d.closest("[data-drag-handle]");
+    if (!this.dom || !((r = this.contentDOM) === null || r === void 0) && r.contains(d) || !u)
       return;
     let f = 0, h = 0;
-    if (this.dom !== d) {
-      const g = this.dom.getBoundingClientRect(), y = d.getBoundingClientRect(), O = (i = e.offsetX) !== null && i !== void 0 ? i : (s = e.nativeEvent) === null || s === void 0 ? void 0 : s.offsetX, E = (o = e.offsetY) !== null && o !== void 0 ? o : (l = e.nativeEvent) === null || l === void 0 ? void 0 : l.offsetY;
+    if (this.dom !== u) {
+      const g = this.dom.getBoundingClientRect(), y = u.getBoundingClientRect(), O = (i = e.offsetX) !== null && i !== void 0 ? i : (s = e.nativeEvent) === null || s === void 0 ? void 0 : s.offsetX, E = (o = e.offsetY) !== null && o !== void 0 ? o : (l = e.nativeEvent) === null || l === void 0 ? void 0 : l.offsetY;
       f = y.x - g.x + O, h = y.y - g.y + E;
     }
     (a = e.dataTransfer) === null || a === void 0 || a.setDragImage(this.dom, f, h);
@@ -13155,10 +13154,10 @@ class mm {
     const s = e.type.startsWith("drag"), o = e.type === "drop";
     if ((["INPUT", "BUTTON", "SELECT", "TEXTAREA"].includes(r.tagName) || r.isContentEditable) && !o && !s)
       return !0;
-    const { isEditable: a } = this.editor, { isDragging: c } = this, u = !!this.node.type.spec.draggable, d = C.isSelectable(this.node), f = e.type === "copy", h = e.type === "paste", p = e.type === "cut", m = e.type === "mousedown";
-    if (!u && d && s && e.preventDefault(), u && s && !c)
+    const { isEditable: a } = this.editor, { isDragging: c } = this, d = !!this.node.type.spec.draggable, u = C.isSelectable(this.node), f = e.type === "copy", h = e.type === "paste", p = e.type === "cut", m = e.type === "mousedown";
+    if (!d && u && s && e.preventDefault(), d && s && !c)
       return e.preventDefault(), !1;
-    if (u && a && !c && m) {
+    if (d && a && !c && m) {
       const g = r.closest("[data-drag-handle]");
       g && (this.dom === g || this.dom.contains(g)) && (this.isDragging = !0, document.addEventListener("dragend", () => {
         this.isDragging = !1;
@@ -13168,7 +13167,7 @@ class mm {
         this.isDragging = !1;
       }, { once: !0 }));
     }
-    return !(c || o || f || h || p || m && d);
+    return !(c || o || f || h || p || m && u);
   }
   ignoreMutation(e) {
     return !this.dom || !this.contentDOM ? !0 : typeof this.options.ignoreMutation == "function" ? this.options.ignoreMutation({ mutation: e }) : this.node.isLeaf || this.node.isAtom ? !0 : e.type === "selection" || this.dom.contains(e.target) && e.type === "childList" && Cr() && this.editor.isFocused && [
@@ -13200,10 +13199,10 @@ function Nt(n) {
       const { tr: s } = e, o = r[r.length - 1], l = r[0];
       let a = t.to;
       if (o) {
-        const c = l.search(/\S/), u = t.from + l.indexOf(o), d = u + o.length;
-        if (Mr(t.from, t.to, e.doc).filter((h) => h.mark.type.excluded.find((m) => m === n.type && m !== h.mark.type)).filter((h) => h.to > u).length)
+        const c = l.search(/\S/), d = t.from + l.indexOf(o), u = d + o.length;
+        if (Mr(t.from, t.to, e.doc).filter((h) => h.mark.type.excluded.find((m) => m === n.type && m !== h.mark.type)).filter((h) => h.to > d).length)
           return null;
-        d < t.to && s.delete(d, t.to), u > t.from && s.delete(t.from + c, u), a = t.from + c + o.length, s.addMark(t.from + c, a, n.type.create(i || {})), s.removeStoredMark(n.type);
+        u < t.to && s.delete(u, t.to), d > t.from && s.delete(t.from + c, d), a = t.from + c + o.length, s.addMark(t.from + c, a, n.type.create(i || {})), s.removeStoredMark(n.type);
       }
     }
   });
@@ -13264,13 +13263,13 @@ Dr.isSymbol = Sm;
   Object.defineProperty(n, "__esModule", { value: !0 }), n.isSymbol = n.isOneOf = n.isInteger = n.isInstanceOf = n.vuePropValidator = void 0;
   const t = e(De);
   function r(a, ...c) {
-    const u = a ? [...c, a] : c;
-    if (u.length !== 0)
-      return (d) => {
-        for (const f of u) {
-          const h = f(d);
+    const d = a ? [...c, a] : c;
+    if (d.length !== 0)
+      return (u) => {
+        for (const f of d) {
+          const h = f(u);
           if (h)
-            return typeof t.default == "object" && "util" in t.default ? t.default.util.warn(`${h} (received: '${String(d)}')`) : console.warn(`${h} (received: '${String(d)}')`), !1;
+            return typeof t.default == "object" && "util" in t.default ? t.default.util.warn(`${h} (received: '${String(u)}')`) : console.warn(`${h} (received: '${String(u)}')`), !1;
         }
         return !0;
       };
@@ -13490,13 +13489,13 @@ Jr.isNonPositive = rg;
   Object.defineProperty(n, "objectProp", { enumerable: !0, get: function() {
     return c.objectProp;
   } });
-  var u = Hr;
+  var d = Hr;
   Object.defineProperty(n, "functionProp", { enumerable: !0, get: function() {
-    return u.functionProp;
+    return d.functionProp;
   } });
-  var d = cn;
+  var u = cn;
   Object.defineProperty(n, "oneOfProp", { enumerable: !0, get: function() {
-    return d.oneOfProp;
+    return u.oneOfProp;
   } });
   var f = jr;
   Object.defineProperty(n, "oneOfObjectKeysProp", { enumerable: !0, get: function() {
@@ -13731,7 +13730,7 @@ const lg = /^\s*>\s$/, ag = J.create({
       })
     ];
   }
-}), cg = /^```([a-z]+)?[\s\n]$/, ug = /^~~~([a-z]+)?[\s\n]$/, dg = J.create({
+}), cg = /^```([a-z]+)?[\s\n]$/, dg = /^~~~([a-z]+)?[\s\n]$/, ug = J.create({
   name: "codeBlock",
   addOptions() {
     return {
@@ -13828,7 +13827,7 @@ const lg = /^\s*>\s$/, ag = J.create({
         })
       }),
       zo({
-        find: ug,
+        find: dg,
         type: this.type,
         getAttributes: (n) => ({
           language: n[1]
@@ -13893,10 +13892,10 @@ const lg = /^\s*>\s$/, ag = J.create({
           if (i.$from.parent.type.spec.isolating)
             return !1;
           const { keepMarks: o } = this.options, { splittableMarks: l } = r.extensionManager, a = s || i.$to.parentOffset && i.$from.marks();
-          return e().insertContent({ type: this.name }).command(({ tr: c, dispatch: u }) => {
-            if (u && a && o) {
-              const d = a.filter((f) => l.includes(f.type.name));
-              c.ensureMarks(d);
+          return e().insertContent({ type: this.name }).command(({ tr: c, dispatch: d }) => {
+            if (d && a && o) {
+              const u = a.filter((f) => l.includes(f.type.name));
+              c.ensureMarks(u);
             }
             return !0;
           }).run();
@@ -13961,12 +13960,12 @@ const lg = /^\s*>\s$/, ag = J.create({
               return null;
             const s = n.type.createAndFill(), o = (s == null ? void 0 : s.sameMarkup(n)) && s.content.findDiffStart(n.content) === null;
             return n.descendants((l, a) => {
-              const c = r >= a && r <= a + l.nodeSize, u = !l.isLeaf && !l.childCount;
-              if ((c || !this.options.showOnlyCurrent) && u) {
-                const d = [this.options.emptyNodeClass];
-                o && d.push(this.options.emptyEditorClass);
+              const c = r >= a && r <= a + l.nodeSize, d = !l.isLeaf && !l.childCount;
+              if ((c || !this.options.showOnlyCurrent) && d) {
+                const u = [this.options.emptyNodeClass];
+                o && u.push(this.options.emptyEditorClass);
                 const f = ae.node(a, a + l.nodeSize, {
-                  class: d.join(" "),
+                  class: u.join(" "),
                   "data-placeholder": typeof this.options.placeholder == "function" ? this.options.placeholder({
                     editor: this.editor,
                     node: l,
@@ -14354,7 +14353,7 @@ re.prototype = {
     return i.j[n] = o, o;
   }
 };
-const M = (n, e, t, r, i) => n.ta(e, t, r, i), ce = (n, e, t, r, i) => n.tr(e, t, r, i), Ko = (n, e, t, r, i) => n.ts(e, t, r, i), k = (n, e, t, r, i) => n.tt(e, t, r, i), Ae = "WORD", Yi = "UWORD", sn = "LOCALHOST", Xi = "TLD", Qi = "UTLD", vn = "SCHEME", St = "SLASH_SCHEME", xs = "NUM", Va = "WS", Os = "NL", Wt = "OPENBRACE", Kt = "CLOSEBRACE", $n = "OPENBRACKET", Fn = "CLOSEBRACKET", zn = "OPENPAREN", Hn = "CLOSEPAREN", jn = "OPENANGLEBRACKET", Vn = "CLOSEANGLEBRACKET", qn = "FULLWIDTHLEFTPAREN", Wn = "FULLWIDTHRIGHTPAREN", Kn = "LEFTCORNERBRACKET", Un = "RIGHTCORNERBRACKET", Jn = "LEFTWHITECORNERBRACKET", Gn = "RIGHTWHITECORNERBRACKET", Yn = "FULLWIDTHLESSTHAN", Xn = "FULLWIDTHGREATERTHAN", Qn = "AMPERSAND", Zn = "APOSTROPHE", er = "ASTERISK", ze = "AT", tr = "BACKSLASH", nr = "BACKTICK", rr = "CARET", je = "COLON", vs = "COMMA", ir = "DOLLAR", ke = "DOT", sr = "EQUALS", Cs = "EXCLAMATION", Se = "HYPHEN", or = "PERCENT", lr = "PIPE", ar = "PLUS", cr = "POUND", ur = "QUERY", Es = "QUOTE", Ts = "SEMI", xe = "SLASH", Ut = "TILDE", dr = "UNDERSCORE", qa = "EMOJI", fr = "SYM";
+const M = (n, e, t, r, i) => n.ta(e, t, r, i), ce = (n, e, t, r, i) => n.tr(e, t, r, i), Ko = (n, e, t, r, i) => n.ts(e, t, r, i), k = (n, e, t, r, i) => n.tt(e, t, r, i), Ae = "WORD", Yi = "UWORD", sn = "LOCALHOST", Xi = "TLD", Qi = "UTLD", vn = "SCHEME", St = "SLASH_SCHEME", xs = "NUM", Va = "WS", Os = "NL", Wt = "OPENBRACE", Kt = "CLOSEBRACE", $n = "OPENBRACKET", Fn = "CLOSEBRACKET", zn = "OPENPAREN", Hn = "CLOSEPAREN", jn = "OPENANGLEBRACKET", Vn = "CLOSEANGLEBRACKET", qn = "FULLWIDTHLEFTPAREN", Wn = "FULLWIDTHRIGHTPAREN", Kn = "LEFTCORNERBRACKET", Un = "RIGHTCORNERBRACKET", Jn = "LEFTWHITECORNERBRACKET", Gn = "RIGHTWHITECORNERBRACKET", Yn = "FULLWIDTHLESSTHAN", Xn = "FULLWIDTHGREATERTHAN", Qn = "AMPERSAND", Zn = "APOSTROPHE", er = "ASTERISK", ze = "AT", tr = "BACKSLASH", nr = "BACKTICK", rr = "CARET", je = "COLON", vs = "COMMA", ir = "DOLLAR", ke = "DOT", sr = "EQUALS", Cs = "EXCLAMATION", Se = "HYPHEN", or = "PERCENT", lr = "PIPE", ar = "PLUS", cr = "POUND", dr = "QUERY", Es = "QUOTE", Ts = "SEMI", xe = "SLASH", Ut = "TILDE", ur = "UNDERSCORE", qa = "EMOJI", fr = "SYM";
 var Wa = /* @__PURE__ */ Object.freeze({
   __proto__: null,
   WORD: Ae,
@@ -14401,12 +14400,12 @@ var Wa = /* @__PURE__ */ Object.freeze({
   PIPE: lr,
   PLUS: ar,
   POUND: cr,
-  QUERY: ur,
+  QUERY: dr,
   QUOTE: Es,
   SEMI: Ts,
   SLASH: xe,
   TILDE: Ut,
-  UNDERSCORE: dr,
+  UNDERSCORE: ur,
   EMOJI: qa,
   SYM: fr
 });
@@ -14418,7 +14417,7 @@ function Lg(n) {
   const e = {};
   re.groups = e;
   const t = new re();
-  gn == null && (gn = Go(wg)), yn == null && (yn = Go(Ag)), k(t, "'", Zn), k(t, "{", Wt), k(t, "}", Kt), k(t, "[", $n), k(t, "]", Fn), k(t, "(", zn), k(t, ")", Hn), k(t, "<", jn), k(t, ">", Vn), k(t, "（", qn), k(t, "）", Wn), k(t, "「", Kn), k(t, "」", Un), k(t, "『", Jn), k(t, "』", Gn), k(t, "＜", Yn), k(t, "＞", Xn), k(t, "&", Qn), k(t, "*", er), k(t, "@", ze), k(t, "`", nr), k(t, "^", rr), k(t, ":", je), k(t, ",", vs), k(t, "$", ir), k(t, ".", ke), k(t, "=", sr), k(t, "!", Cs), k(t, "-", Se), k(t, "%", or), k(t, "|", lr), k(t, "+", ar), k(t, "#", cr), k(t, "?", ur), k(t, '"', Es), k(t, "/", xe), k(t, ";", Ts), k(t, "~", Ut), k(t, "_", dr), k(t, "\\", tr);
+  gn == null && (gn = Go(wg)), yn == null && (yn = Go(Ag)), k(t, "'", Zn), k(t, "{", Wt), k(t, "}", Kt), k(t, "[", $n), k(t, "]", Fn), k(t, "(", zn), k(t, ")", Hn), k(t, "<", jn), k(t, ">", Vn), k(t, "（", qn), k(t, "）", Wn), k(t, "「", Kn), k(t, "」", Un), k(t, "『", Jn), k(t, "』", Gn), k(t, "＜", Yn), k(t, "＞", Xn), k(t, "&", Qn), k(t, "*", er), k(t, "@", ze), k(t, "`", nr), k(t, "^", rr), k(t, ":", je), k(t, ",", vs), k(t, "$", ir), k(t, ".", ke), k(t, "=", sr), k(t, "!", Cs), k(t, "-", Se), k(t, "%", or), k(t, "|", lr), k(t, "+", ar), k(t, "#", cr), k(t, "?", dr), k(t, '"', Es), k(t, "/", xe), k(t, ";", Ts), k(t, "~", Ut), k(t, "_", ur), k(t, "\\", tr);
   const r = ce(t, Ci, xs, {
     [Ki]: !0
   });
@@ -14443,11 +14442,11 @@ function Lg(n) {
   ce(l, vi, l), k(l, Rg, l);
   const a = k(l, _g);
   ce(a, vi, l);
-  const c = [[yt, i]], u = [[yt, null], [Oi, s]];
-  for (let d = 0; d < gn.length; d++)
-    Be(t, gn[d], Xi, Ae, c);
-  for (let d = 0; d < yn.length; d++)
-    Be(t, yn[d], Qi, Yi, u);
+  const c = [[yt, i]], d = [[yt, null], [Oi, s]];
+  for (let u = 0; u < gn.length; u++)
+    Be(t, gn[u], Xi, Ae, c);
+  for (let u = 0; u < yn.length; u++)
+    Be(t, yn[u], Qi, Yi, d);
   it(Xi, {
     tld: !0,
     ascii: !0
@@ -14460,9 +14459,9 @@ function Lg(n) {
   }, e), it(St, {
     slashscheme: !0,
     ascii: !0
-  }, e), n = n.sort((d, f) => d[0] > f[0] ? 1 : -1);
-  for (let d = 0; d < n.length; d++) {
-    const f = n[d][0], p = n[d][1] ? {
+  }, e), n = n.sort((u, f) => u[0] > f[0] ? 1 : -1);
+  for (let u = 0; u < n.length; u++) {
+    const f = n[u][0], p = n[u][1] ? {
       [Ng]: !0
     } : {
       [Pg]: !0
@@ -14482,11 +14481,11 @@ function Bg(n, e) {
   const t = $g(e.replace(/[A-Z]/g, (l) => l.toLowerCase())), r = t.length, i = [];
   let s = 0, o = 0;
   for (; o < r; ) {
-    let l = n, a = null, c = 0, u = null, d = -1, f = -1;
+    let l = n, a = null, c = 0, d = null, u = -1, f = -1;
     for (; o < r && (a = l.go(t[o])); )
-      l = a, l.accepts() ? (d = 0, f = 0, u = l) : d >= 0 && (d += t[o].length, f++), c += t[o].length, s += t[o].length, o++;
-    s -= d, o -= f, c -= d, i.push({
-      t: u.t,
+      l = a, l.accepts() ? (u = 0, f = 0, d = l) : u >= 0 && (u += t[o].length, f++), c += t[o].length, s += t[o].length, o++;
+    s -= u, o -= f, c -= u, i.push({
+      t: d.t,
       // token type/name
       v: e.slice(s - c, s),
       // string value
@@ -14721,12 +14720,12 @@ Ka.prototype = {
    * @param {Options} options Formattinng options
    */
   render(n) {
-    const e = this, t = this.toHref(n.get("defaultProtocol")), r = n.get("formatHref", t, this), i = n.get("tagName", t, e), s = this.toFormattedString(n), o = {}, l = n.get("className", t, e), a = n.get("target", t, e), c = n.get("rel", t, e), u = n.getObj("attributes", t, e), d = n.getObj("events", t, e);
-    return o.href = r, l && (o.class = l), a && (o.target = a), c && (o.rel = c), u && Pt(o, u), {
+    const e = this, t = this.toHref(n.get("defaultProtocol")), r = n.get("formatHref", t, this), i = n.get("tagName", t, e), s = this.toFormattedString(n), o = {}, l = n.get("className", t, e), a = n.get("target", t, e), c = n.get("rel", t, e), d = n.getObj("attributes", t, e), u = n.getObj("events", t, e);
+    return o.href = r, l && (o.class = l), a && (o.target = a), c && (o.rel = c), d && Pt(o, d), {
       tagName: i,
       attributes: o,
       content: s,
-      eventListeners: d
+      eventListeners: u
     };
   }
 };
@@ -14765,36 +14764,36 @@ const Xo = Gr("email", {
     const n = this.tk;
     return n.length >= 2 && n[0].t !== sn && n[1].t === je;
   }
-}), ue = (n) => new re(n);
+}), de = (n) => new re(n);
 function zg(n) {
   let {
     groups: e
   } = n;
-  const t = e.domain.concat([Qn, er, ze, tr, nr, rr, ir, sr, Se, xs, or, lr, ar, cr, xe, fr, Ut, dr]), r = [Zn, je, vs, ke, Cs, ur, Es, Ts, jn, Vn, Wt, Kt, Fn, $n, zn, Hn, qn, Wn, Kn, Un, Jn, Gn, Yn, Xn], i = [Qn, Zn, er, tr, nr, rr, ir, sr, Se, Wt, Kt, or, lr, ar, cr, ur, xe, fr, Ut, dr], s = ue(), o = k(s, Ut);
+  const t = e.domain.concat([Qn, er, ze, tr, nr, rr, ir, sr, Se, xs, or, lr, ar, cr, xe, fr, Ut, ur]), r = [Zn, je, vs, ke, Cs, dr, Es, Ts, jn, Vn, Wt, Kt, Fn, $n, zn, Hn, qn, Wn, Kn, Un, Jn, Gn, Yn, Xn], i = [Qn, Zn, er, tr, nr, rr, ir, sr, Se, Wt, Kt, or, lr, ar, cr, dr, xe, fr, Ut, ur], s = de(), o = k(s, Ut);
   M(o, i, o), M(o, e.domain, o);
-  const l = ue(), a = ue(), c = ue();
+  const l = de(), a = de(), c = de();
   M(s, e.domain, l), M(s, e.scheme, a), M(s, e.slashscheme, c), M(l, i, o), M(l, e.domain, l);
-  const u = k(l, ze);
-  k(o, ze, u), k(a, ze, u), k(c, ze, u);
-  const d = k(o, ke);
-  M(d, i, o), M(d, e.domain, o);
-  const f = ue();
-  M(u, e.domain, f), M(f, e.domain, f);
+  const d = k(l, ze);
+  k(o, ze, d), k(a, ze, d), k(c, ze, d);
+  const u = k(o, ke);
+  M(u, i, o), M(u, e.domain, o);
+  const f = de();
+  M(d, e.domain, f), M(f, e.domain, f);
   const h = k(f, ke);
   M(h, e.domain, f);
-  const p = ue(Xo);
-  M(h, e.tld, p), M(h, e.utld, p), k(u, sn, p);
+  const p = de(Xo);
+  M(h, e.tld, p), M(h, e.utld, p), k(d, sn, p);
   const m = k(f, Se);
   M(m, e.domain, f), M(p, e.domain, f), k(p, ke, h), k(p, Se, m);
   const g = k(p, je);
   M(g, e.numeric, Xo);
   const y = k(l, Se), O = k(l, ke);
   M(y, e.domain, l), M(O, i, o), M(O, e.domain, l);
-  const E = ue(bn);
-  M(O, e.tld, E), M(O, e.utld, E), M(E, e.domain, l), M(E, i, o), k(E, ke, O), k(E, Se, y), k(E, ze, u);
-  const I = k(E, je), D = ue(bn);
+  const E = de(bn);
+  M(O, e.tld, E), M(O, e.utld, E), M(E, e.domain, l), M(E, i, o), k(E, ke, O), k(E, Se, y), k(E, ze, d);
+  const I = k(E, je), D = de(bn);
   M(I, e.numeric, D);
-  const T = ue(bn), _ = ue();
+  const T = de(bn), _ = de();
   M(T, t, T), M(T, r, _), M(_, t, T), M(_, r, _), k(E, xe, T), k(D, xe, T);
   const P = k(a, je), v = k(c, je), W = k(v, xe), pe = k(W, xe);
   M(a, e.domain, l), k(a, ke, O), k(a, Se, y), M(c, e.domain, l), k(c, ke, O), k(c, Se, y), M(P, e.domain, T), k(P, xe, T), M(pe, e.domain, T), M(pe, t, T), k(pe, xe, T);
@@ -14819,9 +14818,9 @@ function zg(n) {
   for (let It = 0; It < Ze.length; It++) {
     const [Ie, Re] = Ze[It], _e = k(T, Ie);
     k(_, Ie, _e), k(_e, Re, T);
-    const oe = ue(bn);
+    const oe = de(bn);
     M(_e, t, oe);
-    const Le = ue();
+    const Le = de();
     M(_e, r), M(oe, t, oe), M(oe, r, Le), M(Le, t, oe), M(Le, r, Le), k(oe, Re, T), k(Le, Re, T);
   }
   return k(s, sn, E), k(s, Os, Fg), {
@@ -14832,16 +14831,16 @@ function zg(n) {
 function Hg(n, e, t) {
   let r = t.length, i = 0, s = [], o = [];
   for (; i < r; ) {
-    let l = n, a = null, c = null, u = 0, d = null, f = -1;
+    let l = n, a = null, c = null, d = 0, u = null, f = -1;
     for (; i < r && !(a = l.go(t[i].t)); )
       o.push(t[i++]);
     for (; i < r && (c = a || l.go(t[i].t)); )
-      a = null, l = c, l.accepts() ? (f = 0, d = l) : f >= 0 && f++, i++, u++;
+      a = null, l = c, l.accepts() ? (f = 0, u = l) : f >= 0 && f++, i++, d++;
     if (f < 0)
-      i -= u, i < r && (o.push(t[i]), i++);
+      i -= d, i < r && (o.push(t[i]), i++);
     else {
-      o.length > 0 && (s.push(Ei(Qo, e, o)), o = []), i -= f, u -= f;
-      const h = d.t, p = t.slice(i - u, i);
+      o.length > 0 && (s.push(Ei(Qo, e, o)), o = []), i -= f, d -= f;
+      const h = u.t, p = t.slice(i - d, i);
       s.push(Ei(h, e, p));
     }
   }
@@ -14910,13 +14909,13 @@ function Ug(n) {
         return;
       const { tr: o } = r, l = _a(t.doc, [...e]);
       if ($a(l).forEach(({ newRange: c }) => {
-        const u = La(r.doc, c, (h) => h.isTextblock);
-        let d, f;
-        if (u.length > 1 ? (d = u[0], f = r.doc.textBetween(d.pos, d.pos + d.node.nodeSize, void 0, " ")) : u.length && r.doc.textBetween(c.from, c.to, " ", " ").endsWith(" ") && (d = u[0], f = r.doc.textBetween(d.pos, c.to, void 0, " ")), d && f) {
+        const d = La(r.doc, c, (h) => h.isTextblock);
+        let u, f;
+        if (d.length > 1 ? (u = d[0], f = r.doc.textBetween(u.pos, u.pos + u.node.nodeSize, void 0, " ")) : d.length && r.doc.textBetween(c.from, c.to, " ", " ").endsWith(" ") && (u = d[0], f = r.doc.textBetween(u.pos, c.to, void 0, " ")), u && f) {
           const h = f.split(" ").filter((g) => g !== "");
           if (h.length <= 0)
             return !1;
-          const p = h[h.length - 1], m = d.pos + f.lastIndexOf(p);
+          const p = h[h.length - 1], m = u.pos + f.lastIndexOf(p);
           if (!p)
             return !1;
           ws(p).filter((g) => g.isLink).map((g) => ({
@@ -14942,8 +14941,8 @@ function Jg(n) {
         var i, s;
         if (r.button !== 0 || r.target.nodeName !== "A")
           return !1;
-        const l = Ba(e.state, n.type.name), a = r.target, c = (i = a == null ? void 0 : a.href) !== null && i !== void 0 ? i : l.href, u = (s = a == null ? void 0 : a.target) !== null && s !== void 0 ? s : l.target;
-        return a && c ? (e.editable && window.open(c, u), !0) : !1;
+        const l = Ba(e.state, n.type.name), a = r.target, c = (i = a == null ? void 0 : a.href) !== null && i !== void 0 ? i : l.href, d = (s = a == null ? void 0 : a.target) !== null && s !== void 0 ? s : l.target;
+        return a && c ? (e.editable && window.open(c, d), !0) : !1;
       }
     }
   });
@@ -15378,13 +15377,13 @@ var ly = function() {
   null,
   null
 );
-const uy = cy.exports;
-function dy(n) {
+const dy = cy.exports;
+function uy(n) {
   var e;
-  const { char: t, allowSpaces: r, allowedPrefixes: i, startOfLine: s, $position: o } = n, l = gm(t), a = new RegExp(`\\s${l}$`), c = s ? "^" : "", u = r ? new RegExp(`${c}${l}.*?(?=\\s${l}|$)`, "gm") : new RegExp(`${c}(?:^)?${l}[^\\s${l}]*`, "gm"), d = ((e = o.nodeBefore) === null || e === void 0 ? void 0 : e.isText) && o.nodeBefore.text;
-  if (!d)
+  const { char: t, allowSpaces: r, allowedPrefixes: i, startOfLine: s, $position: o } = n, l = gm(t), a = new RegExp(`\\s${l}$`), c = s ? "^" : "", d = r ? new RegExp(`${c}${l}.*?(?=\\s${l}|$)`, "gm") : new RegExp(`${c}(?:^)?${l}[^\\s${l}]*`, "gm"), u = ((e = o.nodeBefore) === null || e === void 0 ? void 0 : e.isText) && o.nodeBefore.text;
+  if (!u)
     return null;
-  const f = o.pos - d.length, h = Array.from(d.matchAll(u)).pop();
+  const f = o.pos - u.length, h = Array.from(u.matchAll(d)).pop();
   if (!h || h.input === void 0 || h.index === void 0)
     return null;
   const p = h.input.slice(Math.max(0, h.index - 1), h.index), m = new RegExp(`^[${i == null ? void 0 : i.join("")}\0]?$`).test(p);
@@ -15392,7 +15391,7 @@ function dy(n) {
     return null;
   const g = f + h.index;
   let y = g + h[0].length;
-  return r && a.test(d.slice(y - 1, y + 1)) && (h[0] += " ", y += 1), g < o.pos && y >= o.pos ? {
+  return r && a.test(u.slice(y - 1, y + 1)) && (h[0] += " ", y += 1), g < o.pos && y >= o.pos ? {
     range: {
       from: g,
       to: y
@@ -15402,9 +15401,9 @@ function dy(n) {
   } : null;
 }
 const fy = new se("suggestion");
-function Ua({ pluginKey: n = fy, editor: e, char: t = "@", allowSpaces: r = !1, allowedPrefixes: i = [" "], startOfLine: s = !1, decorationTag: o = "span", decorationClass: l = "suggestion", command: a = () => null, items: c = () => [], render: u = () => ({}), allow: d = () => !0 }) {
+function Ua({ pluginKey: n = fy, editor: e, char: t = "@", allowSpaces: r = !1, allowedPrefixes: i = [" "], startOfLine: s = !1, decorationTag: o = "span", decorationClass: l = "suggestion", command: a = () => null, items: c = () => [], render: d = () => ({}), allow: u = () => !0 }) {
   let f;
-  const h = u == null ? void 0 : u(), p = new te({
+  const h = d == null ? void 0 : d(), p = new te({
     key: n,
     view() {
       return {
@@ -15465,14 +15464,14 @@ function Ua({ pluginKey: n = fy, editor: e, char: t = "@", allowSpaces: r = !1,
         const { isEditable: E } = e, { composing: I } = e.view, { selection: D } = m, { empty: T, from: _ } = D, P = { ...g };
         if (P.composing = I, E && (T || e.view.composing)) {
           (_ < g.range.from || _ > g.range.to) && !I && !g.composing && (P.active = !1);
-          const v = dy({
+          const v = uy({
             char: t,
             allowSpaces: r,
             allowedPrefixes: i,
             startOfLine: s,
             $position: D.$from
           }), W = `id_${Math.floor(Math.random() * 4294967295)}`;
-          v && d({ editor: e, state: O, range: v.range }) ? (P.active = !0, P.decorationId = g.decorationId ? g.decorationId : W, P.range = v.range, P.query = v.query, P.text = v.text) : P.active = !1;
+          v && u({ editor: e, state: O, range: v.range }) ? (P.active = !0, P.decorationId = g.decorationId ? g.decorationId : W, P.range = v.range, P.query = v.query, P.text = v.text) : P.active = !1;
         } else
           P.active = !1;
         return P.active || (P.decorationId = null, P.range = { from: 0, to: 0 }, P.query = null, P.text = null), P;
@@ -15503,7 +15502,7 @@ function Ua({ pluginKey: n = fy, editor: e, char: t = "@", allowSpaces: r = !1,
 const hy = {
   name: "SuggestionList",
   components: {
-    DtListItem: ru
+    DtListItem: rd
   },
   props: {
     items: {
@@ -15696,7 +15695,7 @@ const xy = Sy.exports, Oy = {
   inline: !0,
   selectable: !0,
   addNodeView() {
-    return Ha(uy);
+    return Ha(dy);
   },
   addAttributes() {
     return {
@@ -15849,8 +15848,8 @@ function il(n, e, t, r, i, s) {
     l,
     "right",
     rl
-  ), u = n.slice(a.from, c.to);
-  Ny(u, cc, Py).forEach((f) => {
+  ), d = n.slice(a.from, c.to);
+  Ny(d, cc, Py).forEach((f) => {
     const h = Dy(f[0]), p = e + a.from + f.index + 1, m = p + h.length;
     i.addMark(p, m, s.create());
   });
@@ -15860,7 +15859,7 @@ function _y(n) {
   return new te({
     key: new se("autolink"),
     appendTransaction: (t, r, i) => {
-      const s = t.some((u) => u.docChanged) && !r.doc.eq(i.doc);
+      const s = t.some((d) => d.docChanged) && !r.doc.eq(i.doc);
       if (e && !s)
         return;
       const { tr: o } = i, { textContent: l } = i.doc;
@@ -15869,17 +15868,17 @@ function _y(n) {
         r.doc,
         [...t]
       );
-      return $a(a).forEach(({ oldRange: u, newRange: d }) => {
-        Ry(d, i.doc, o, n.type), La(
+      return $a(a).forEach(({ oldRange: d, newRange: u }) => {
+        Ry(u, i.doc, o, n.type), La(
           i.doc,
-          d,
+          u,
           (h) => h.isTextblock
         ).forEach(({ node: h, pos: p }) => {
           il(
             h.textContent,
             p,
-            u.from,
-            d.to,
+            d.from,
+            u.to,
             o,
             n.type
           );
@@ -16104,7 +16103,7 @@ const qy = Vy.exports, Wy = Fy.extend({
 };
 var Yy = function() {
   var e = this, t = e._self._c;
-  return t("dt-stack", { attrs: { direction: "row", gap: "400" } }, [t("dt-avatar", { attrs: { "full-name": e.name, "image-src": e.avatarSrc, size: "xs" } }), e._v(" " + e._s(e.name) + " ")], 1);
+  return t("dt-stack", { attrs: { direction: "row", gap: "400" } }, [t("dt-avatar", { attrs: { "full-name": e.name, "image-src": e.avatarSrc, "image-alt": "", size: "xs" } }), e._v(" " + e._s(e.name) + " ")], 1);
 }, Xy = [], Qy = /* @__PURE__ */ ee(
   Gy,
   Yy,
@@ -16332,7 +16331,7 @@ const Zy = Qy.exports, e0 = {
       return n.push(Ay), n.push(sy.configure({
         types: ["paragraph"],
         defaultAlignment: "left"
-      })), n.push(dg.configure({
+      })), n.push(ug.configure({
         HTMLAttributes: {
           class: "dt-rich-text-editor--code-block"
         }
@@ -16446,20 +16445,20 @@ var n0 = function() {
   null,
   null
 );
-const u0 = i0.exports;
+const d0 = i0.exports;
 export {
   Xr as A,
   a0 as D,
-  un as L,
+  dn as L,
   Uc as M,
   fl as P,
   Uy as R,
   qc as S,
-  u0 as a,
+  d0 as a,
   Ky as b,
   Fc as c,
   $c as d,
-  ru as e,
+  rd as e,
   es as f,
   hl as g,
   Ic as h,
@@ -16474,6 +16473,6 @@ export {
   xc as q,
   Lt as r,
   gc as s,
-  ut as t,
-  ul as u
+  dt as t,
+  dl as u
 };