tuikit-atomicx-vue3 4.5.0 → 4.5.2

package/dist/{index-Do-2CngU.js → index-DuAffztD.js}

@@ -3142,11 +3142,11 @@ class R {
     }
   }
 }
-function Jn(r, e, t) {
+function jn(r, e, t) {
   let n = [];
   for (let i = 0; i < r.childCount; i++) {
     let s = r.child(i);
-    s.content.size && (s = s.copy(Jn(s.content, e, s))), s.isInline && (s = e(s, t, i)), n.push(s);
+    s.content.size && (s = s.copy(jn(s.content, e, s))), s.isInline && (s = e(s, t, i)), n.push(s);
   }
   return b.fromArray(n);
 }
@@ -3158,7 +3158,7 @@ class me extends K {
     super(), this.from = e, this.to = t, this.mark = n;
   }
   apply(e) {
-    let t = e.slice(this.from, this.to), n = e.resolve(this.from), i = n.node(n.sharedDepth(this.to)), s = new k(Jn(t.content, (o, l) => !o.isAtom || !l.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), i), t.openStart, t.openEnd);
+    let t = e.slice(this.from, this.to), n = e.resolve(this.from), i = n.node(n.sharedDepth(this.to)), s = new k(jn(t.content, (o, l) => !o.isAtom || !l.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), i), t.openStart, t.openEnd);
     return R.fromReplace(e, this.from, this.to, s);
   }
   invert() {
@@ -3197,7 +3197,7 @@ class re extends K {
     super(), this.from = e, this.to = t, this.mark = n;
   }
   apply(e) {
-    let t = e.slice(this.from, this.to), n = new k(Jn(t.content, (i) => i.mark(this.mark.removeFromSet(i.marks)), e), t.openStart, t.openEnd);
+    let t = e.slice(this.from, this.to), n = new k(jn(t.content, (i) => i.mark(this.mark.removeFromSet(i.marks)), e), t.openStart, t.openEnd);
     return R.fromReplace(e, this.from, this.to, n);
   }
   invert() {
@@ -3470,7 +3470,7 @@ function xo(r, e, t, n) {
     }
   }), i.forEach((o) => r.step(new re(o.from, o.to, o.style)));
 }
-function jn(r, e, t, n = t.contentMatch, i = !0) {
+function Jn(r, e, t, n = t.contentMatch, i = !0) {
   let s = r.doc.nodeAt(e), o = [], l = e + 1;
   for (let a = 0; a < s.childCount; a++) {
     let c = s.child(a), f = l + c.nodeSize, d = n.matchType(c.type);
@@ -3567,7 +3567,7 @@ function No(r, e, t, n, i) {
         let h = n.whitespace == "pre", p = !!n.contentMatch.matchType(n.schema.linebreakReplacement);
         h && !p ? c = !1 : !h && p && (c = !0);
       }
-      c === !1 && $i(r, o, l, s), jn(r, r.mapping.slice(s).map(l, 1), n, void 0, c === null);
+      c === !1 && $i(r, o, l, s), Jn(r, r.mapping.slice(s).map(l, 1), n, void 0, c === null);
       let f = r.mapping.slice(s), d = f.map(l, 1), u = f.map(l + o.nodeSize, 1);
       return r.step(new F(d, u, d + 1, u - 1, new k(b.from(n.create(a, null, o.marks)), 0, 0), 1, !0)), c === !0 && Vi(r, o, l, s), !1;
     }
@@ -3674,7 +3674,7 @@ function Io(r, e, t) {
     let f = r.doc.resolve(e + t);
     $i(r, f.node(), f.before(), l);
   }
-  o.inlineContent && jn(r, e + t - 1, o, s.node().contentMatchAt(s.index()), n == null);
+  o.inlineContent && Jn(r, e + t - 1, o, s.node().contentMatchAt(s.index()), n == null);
   let a = r.mapping.slice(l), c = a.map(e - t);
   if (r.step(new B(c, a.map(e + t, -1), k.empty, !0)), n === !0) {
     let f = r.doc.resolve(c);
@@ -3825,7 +3825,7 @@ class vo {
       let m = l.child(c), g = d.matchType(m.type);
       if (!g)
         break;
-      c++, (c > 1 || a == 0 || m.content.size) && (d = g, f.push(Ji(m.mark(u.allowedMarks(m.marks)), c == 1 ? a : 0, c == l.childCount ? h : -1)));
+      c++, (c > 1 || a == 0 || m.content.size) && (d = g, f.push(ji(m.mark(u.allowedMarks(m.marks)), c == 1 ? a : 0, c == l.childCount ? h : -1)));
     }
     let p = c == l.childCount;
     p || (h = -1), this.placed = rt(this.placed, t, b.from(f)), this.frontier[t].match = d, p && h < 0 && n && n.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
@@ -3892,11 +3892,11 @@ function ln(r, e) {
     r = r.firstChild.content;
   return r;
 }
-function Ji(r, e, t) {
+function ji(r, e, t) {
   if (e <= 0)
     return r;
   let n = r.content;
-  return e > 1 && (n = n.replaceChild(0, Ji(n.firstChild, e - 1, n.childCount == 1 ? t - 1 : 0))), e > 0 && (n = r.type.contentMatch.fillBefore(n).append(n), t <= 0 && (n = n.append(r.type.contentMatch.matchFragment(n).fillBefore(b.empty, !0)))), r.copy(n);
+  return e > 1 && (n = n.replaceChild(0, ji(n.firstChild, e - 1, n.childCount == 1 ? t - 1 : 0))), e > 0 && (n = r.type.contentMatch.fillBefore(n).append(n), t <= 0 && (n = n.append(r.type.contentMatch.matchFragment(n).fillBefore(b.empty, !0)))), r.copy(n);
 }
 function an(r, e, t, n, i) {
   let s = r.node(e), o = i ? r.indexAfter(e) : r.index(e);
@@ -3952,7 +3952,7 @@ function Fo(r, e, t, n) {
         g < 0 && (y = !1, g = -g);
         let w = i.node(g - 1), C = i.index(g - 1);
         if (w.canReplaceWith(C, C, p.type, p.marks))
-          return r.replace(i.before(g), y ? s.after(g) : t, new k(ji(n.content, 0, n.openStart, h), h, n.openEnd));
+          return r.replace(i.before(g), y ? s.after(g) : t, new k(Ji(n.content, 0, n.openStart, h), h, n.openEnd));
       }
   }
   let d = r.steps.length;
@@ -3961,10 +3961,10 @@ function Fo(r, e, t, n) {
     h < 0 || (e = i.before(h), t = s.after(h));
   }
 }
-function ji(r, e, t, n, i) {
+function Ji(r, e, t, n, i) {
   if (e < t) {
     let s = r.firstChild;
-    r = r.replaceChild(0, s.copy(ji(s.content, e + 1, t, n, s)));
+    r = r.replaceChild(0, s.copy(Ji(s.content, e + 1, t, n, s)));
   }
   if (e > n) {
     let s = i.contentMatchAt(0), o = s.fillBefore(r).append(r);
@@ -4306,7 +4306,7 @@ class Lo {
   third argument.
   */
   clearIncompatible(e, t, n) {
-    return jn(this, e, t, n), this;
+    return Jn(this, e, t, n), this;
   }
 }
 const cn = /* @__PURE__ */ Object.create(null);
@@ -4404,11 +4404,11 @@ class T {
   found.
   */
   static findFrom(e, t, n = !1) {
-    let i = e.parent.inlineContent ? new N(e) : je(e.node(0), e.parent, e.pos, e.index(), t, n);
+    let i = e.parent.inlineContent ? new N(e) : Je(e.node(0), e.parent, e.pos, e.index(), t, n);
     if (i)
       return i;
     for (let s = e.depth - 1; s >= 0; s--) {
-      let o = t < 0 ? je(e.node(0), e.node(s), e.before(s + 1), e.index(s), t, n) : je(e.node(0), e.node(s), e.after(s + 1), e.index(s) + 1, t, n);
+      let o = t < 0 ? Je(e.node(0), e.node(s), e.before(s + 1), e.index(s), t, n) : Je(e.node(0), e.node(s), e.after(s + 1), e.index(s) + 1, t, n);
       if (o)
         return o;
     }
@@ -4429,14 +4429,14 @@ class T {
   exists.
   */
   static atStart(e) {
-    return je(e, e, 0, 0, 1) || new Z(e);
+    return Je(e, e, 0, 0, 1) || new Z(e);
   }
   /**
   Find the cursor or leaf node selection closest to the end of the
   given document.
   */
   static atEnd(e) {
-    return je(e, e, e.content.size, e.childCount, -1) || new Z(e);
+    return Je(e, e, e.content.size, e.childCount, -1) || new Z(e);
   }
   /**
   Deserialize the JSON representation of a selection. Must be
@@ -4663,11 +4663,11 @@ class Z extends T {
     return e instanceof Z;
   }
   getBookmark() {
-    return Jo;
+    return jo;
   }
 }
 T.jsonID("all", Z);
-const Jo = {
+const jo = {
   map() {
     return this;
   },
@@ -4675,7 +4675,7 @@ const Jo = {
     return new Z(r);
   }
 };
-function je(r, e, t, n, i, s = !1) {
+function Je(r, e, t, n, i, s = !1) {
   if (e.inlineContent)
     return N.create(r, t);
   for (let o = n - (i > 0 ? 0 : 1); i > 0 ? o < e.childCount : o >= 0; o += i) {
@@ -4684,7 +4684,7 @@ function je(r, e, t, n, i, s = !1) {
       if (!s && S.isSelectable(l))
         return S.create(r, t - (i < 0 ? l.nodeSize : 0));
     } else {
-      let a = je(r, l, t + i, i < 0 ? l.childCount : 0, i, s);
+      let a = Je(r, l, t + i, i < 0 ? l.childCount : 0, i, s);
       if (a)
         return a;
     }
@@ -4705,7 +4705,7 @@ function wr(r, e, t) {
   }), r.setSelection(T.near(r.doc.resolve(o), t));
 }
 const Or = 1, Ct = 2, Nr = 4;
-class jo extends Lo {
+class Jo extends Lo {
   /**
   @internal
   */
@@ -4993,7 +4993,7 @@ class Ke {
   Accessor that constructs and returns a new [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.
   */
   get tr() {
-    return new jo(this);
+    return new Jo(this);
   }
   /**
   Create a new state.
@@ -6695,7 +6695,7 @@ function Wr(r) {
 function Gn(r, e, t, n) {
   return r.someProp("createSelectionBetween", (i) => i(r, e, t)) || N.between(e, t, n);
 }
-function Jr(r) {
+function jr(r) {
   return r.editable && !r.hasFocus() ? !1 : fs(r);
 }
 function fs(r) {
@@ -6719,7 +6719,7 @@ function vn(r, e) {
 function he(r, e) {
   return r.dispatch(r.state.tr.setSelection(e).scrollIntoView()), !0;
 }
-function jr(r, e, t) {
+function Jr(r, e, t) {
   let n = r.state.selection;
   if (n instanceof N)
     if (t.indexOf("s") > -1) {
@@ -6756,7 +6756,7 @@ function at(r, e) {
   let t = r.pmViewDesc;
   return t && t.size == 0 && (e < 0 || r.nextSibling || r.nodeName != "BR");
 }
-function Je(r, e) {
+function je(r, e) {
   return e < 0 ? Nl(r) : Tl(r);
 }
 function Nl(r) {
@@ -6943,22 +6943,22 @@ function Il(r) {
 function Rl(r, e) {
   let t = e.keyCode, n = Il(e);
   if (t == 8 || Y && t == 72 && n == "c")
-    return Hr(r, -1) || Je(r, -1);
+    return Hr(r, -1) || je(r, -1);
   if (t == 46 && !e.shiftKey || Y && t == 68 && n == "c")
-    return Hr(r, 1) || Je(r, 1);
+    return Hr(r, 1) || je(r, 1);
   if (t == 13 || t == 27)
     return !0;
   if (t == 37 || Y && t == 66 && n == "c") {
     let i = t == 37 ? qr(r, r.state.selection.from) == "ltr" ? -1 : 1 : -1;
-    return jr(r, i, n) || Je(r, i);
+    return Jr(r, i, n) || je(r, i);
   } else if (t == 39 || Y && t == 70 && n == "c") {
     let i = t == 39 ? qr(r, r.state.selection.from) == "ltr" ? 1 : -1 : 1;
-    return jr(r, i, n) || Je(r, i);
+    return Jr(r, i, n) || je(r, i);
   } else {
     if (t == 38 || Y && t == 80 && n == "c")
-      return Kr(r, -1, n) || Je(r, -1);
+      return Kr(r, -1, n) || je(r, -1);
     if (t == 40 || Y && t == 78 && n == "c")
-      return Al(r) || Kr(r, 1, n) || Je(r, 1);
+      return Al(r) || Kr(r, 1, n) || je(r, 1);
     if (n == (Y ? "m" : "c") && (t == 66 || t == 73 || t == 89 || t == 90))
       return !0;
   }
@@ -7164,7 +7164,7 @@ function Wl(r) {
   for (let e in H) {
     let t = H[e];
     r.dom.addEventListener(e, r.input.eventHandlers[e] = (n) => {
-      jl(r, n) && !Yn(r, n) && (r.editable || !(n.type in U)) && t(r, n);
+      Jl(r, n) && !Yn(r, n) && (r.editable || !(n.type in U)) && t(r, n);
     }, $l[e] ? { passive: !0 } : void 0);
   }
   q && r.dom.addEventListener("input", () => null), Fn(r);
@@ -7172,7 +7172,7 @@ function Wl(r) {
 function ye(r, e) {
   r.input.lastSelectionOrigin = e, r.input.lastSelectionTime = Date.now();
 }
-function Jl(r) {
+function jl(r) {
   r.domObserver.stop();
   for (let e in r.input.eventHandlers)
     r.dom.removeEventListener(e, r.input.eventHandlers[e]);
@@ -7190,7 +7190,7 @@ function Yn(r, e) {
     return n ? n(r, e) || e.defaultPrevented : !1;
   });
 }
-function jl(r, e) {
+function Jl(r, e) {
   if (!e.bubbles)
     return !0;
   if (e.defaultPrevented)
@@ -7751,7 +7751,7 @@ class v {
   you must make a copy if you want need to preserve that.
   */
   static create(e, t) {
-    return t.length ? Lt(t, e, 0, Re) : j;
+    return t.length ? Lt(t, e, 0, Re) : J;
   }
   /**
   Find all decorations in this set which touch the given range
@@ -7781,7 +7781,7 @@ class v {
   document.
   */
   map(e, t, n) {
-    return this == j || e.maps.length == 0 ? this : this.mapInner(e, t, 0, 0, n || Re);
+    return this == J || e.maps.length == 0 ? this : this.mapInner(e, t, 0, 0, n || Re);
   }
   /**
   @internal
@@ -7792,7 +7792,7 @@ class v {
       let a = this.local[l].map(e, n, i);
       a && a.type.valid(t, a) ? (o || (o = [])).push(a) : s.onRemove && s.onRemove(this.local[l].spec);
     }
-    return this.children.length ? aa(this.children, o || [], e, t, n, i, s) : o ? new v(o.sort(Pe), qe) : j;
+    return this.children.length ? aa(this.children, o || [], e, t, n, i, s) : o ? new v(o.sort(Pe), qe) : J;
   }
   /**
   Add the given array of decorations to the ones in the set,
@@ -7801,7 +7801,7 @@ class v {
   structure.
   */
   add(e, t) {
-    return t.length ? this == j ? v.create(e, t) : this.addInner(e, t, 0) : this;
+    return t.length ? this == J ? v.create(e, t) : this.addInner(e, t, 0) : this;
   }
   addInner(e, t, n) {
     let i, s = 0;
@@ -7823,7 +7823,7 @@ class v {
   the ones in the given array.
   */
   remove(e) {
-    return e.length == 0 || this == j ? this : this.removeInner(e, 0);
+    return e.length == 0 || this == J ? this : this.removeInner(e, 0);
   }
   removeInner(e, t) {
     let n = this.children, i = this.local;
@@ -7835,7 +7835,7 @@ class v {
         continue;
       n == this.children && (n = this.children.slice());
       let c = n[s + 2].removeInner(o, l + 1);
-      c != j ? n[s + 2] = c : (n.splice(s, 3), s -= 3);
+      c != J ? n[s + 2] = c : (n.splice(s, 3), s -= 3);
     }
     if (i.length) {
       for (let s = 0, o; s < e.length; s++)
@@ -7843,10 +7843,10 @@ class v {
           for (let l = 0; l < i.length; l++)
             i[l].eq(o, t) && (i == this.local && (i = this.local.slice()), i.splice(l--, 1));
     }
-    return n == this.children && i == this.local ? this : i.length || n.length ? new v(i, n) : j;
+    return n == this.children && i == this.local ? this : i.length || n.length ? new v(i, n) : J;
   }
   forChild(e, t) {
-    if (this == j)
+    if (this == J)
       return this;
     if (t.isLeaf)
       return v.empty;
@@ -7868,7 +7868,7 @@ class v {
       let l = new v(i.sort(Pe), qe);
       return n ? new pe([l, n]) : l;
     }
-    return n || j;
+    return n || J;
   }
   /**
   @internal
@@ -7896,7 +7896,7 @@ class v {
   @internal
   */
   localsInner(e) {
-    if (this == j)
+    if (this == J)
       return qe;
     if (e.inlineContent || !this.local.some(Ce.is))
       return this.local;
@@ -7911,7 +7911,7 @@ class v {
 }
 v.empty = new v([], []);
 v.removeOverlap = er;
-const j = v.empty;
+const J = v.empty;
 class pe {
   constructor(e) {
     this.members = e;
@@ -7926,7 +7926,7 @@ class pe {
     let n = [];
     for (let i = 0; i < this.members.length; i++) {
       let s = this.members[i].forChild(e, t);
-      s != j && (s instanceof pe ? n = n.concat(s.members) : n.push(s));
+      s != J && (s instanceof pe ? n = n.concat(s.members) : n.push(s));
     }
     return pe.from(n);
   }
@@ -7958,7 +7958,7 @@ class pe {
   static from(e) {
     switch (e.length) {
       case 0:
-        return j;
+        return J;
       case 1:
         return e[0];
       default:
@@ -8001,7 +8001,7 @@ function aa(r, e, t, n, i, s, o) {
       let u = t.map(r[c + 1] + s, -1), h = u - i, { index: p, offset: m } = n.content.findIndex(d), g = n.maybeChild(p);
       if (g && m == d && m + g.nodeSize == h) {
         let y = l[c + 2].mapInner(t, g, f + 1, r[c] + s + 1, o);
-        y != j ? (l[c] = d, l[c + 1] = h, l[c + 2] = y) : (l[c + 1] = -2, a = !0);
+        y != J ? (l[c] = d, l[c + 1] = h, l[c + 2] = y) : (l[c + 1] = -2, a = !0);
       } else
         a = !0;
     }
@@ -8063,13 +8063,13 @@ function Lt(r, e, t, n) {
     if (c) {
       s = !0;
       let f = Lt(c, l, t + a + 1, n);
-      f != j && i.push(a, a + l.nodeSize, f);
+      f != J && i.push(a, a + l.nodeSize, f);
     }
   });
   let o = Os(s ? Ts(r) : r, -t).sort(Pe);
   for (let l = 0; l < o.length; l++)
     o[l].type.valid(e, o[l]) || (n.onRemove && n.onRemove(o[l].spec), o.splice(l--, 1));
-  return o.length || i.length ? new v(o, i) : j;
+  return o.length || i.length ? new v(o, i) : J;
 }
 function Pe(r, e) {
   return r.from - e.from || r.to - e.to;
@@ -8101,7 +8101,7 @@ function mn(r) {
   let e = [];
   return r.someProp("decorations", (t) => {
     let n = t(r.state);
-    n && n != j && e.push(n);
+    n && n != J && e.push(n);
   }), r.cursorWrapper && e.push(v.create(r.state.doc, [r.cursorWrapper.deco])), pe.from(e);
 }
 const fa = {
@@ -8169,7 +8169,7 @@ class ha {
     this.suppressingSelectionUpdates = !0, setTimeout(() => this.suppressingSelectionUpdates = !1, 50);
   }
   onSelectionChange() {
-    if (Jr(this.view)) {
+    if (jr(this.view)) {
       if (this.suppressingSelectionUpdates)
         return de(this.view);
       if (G && xe <= 11 && !this.view.state.selection.empty) {
@@ -8213,7 +8213,7 @@ class ha {
       return;
     let t = this.pendingRecords();
     t.length && (this.queue = []);
-    let n = e.domSelectionRange(), i = !this.suppressingSelectionUpdates && !this.currentSelection.eq(n) && Jr(e) && !this.ignoreSelectionChange(n), s = -1, o = -1, l = !1, a = [];
+    let n = e.domSelectionRange(), i = !this.suppressingSelectionUpdates && !this.currentSelection.eq(n) && jr(e) && !this.ignoreSelectionChange(n), s = -1, o = -1, l = !1, a = [];
     if (e.editable)
       for (let f = 0; f < t.length; f++) {
         let d = this.registerMutation(t[f], a);
@@ -8357,8 +8357,8 @@ function xa(r, e, t, n, i) {
     if (E && !r.state.selection.eq(E)) {
       if (z && ce && r.input.lastKeyCode === 13 && Date.now() - 100 < r.input.lastKeyCodeTime && r.someProp("handleKeyDown", (Hs) => Hs(r, Ne(13, "Enter"))))
         return;
-      let J = r.state.tr.setSelection(E);
-      M == "pointer" ? J.setMeta("pointer", !0) : M == "key" && J.scrollIntoView(), s && J.setMeta("composition", s), r.dispatch(J);
+      let j = r.state.tr.setSelection(E);
+      M == "pointer" ? j.setMeta("pointer", !0) : M == "key" && j.scrollIntoView(), s && j.setMeta("composition", s), r.dispatch(j);
     }
     return;
   }
@@ -8402,8 +8402,8 @@ function xa(r, e, t, n, i) {
   let C = p.start, I = p.endA, A = (M) => {
     let E = M || r.state.tr.replace(C, I, c.doc.slice(p.start - c.from, p.endB - c.from));
     if (c.sel) {
-      let J = ei(r, E.doc, c.sel);
-      J && !(z && r.composing && J.empty && (p.start != p.endB || r.input.lastChromeDelete < Date.now() - 100) && (J.head == C || J.head == E.mapping.map(I) - 1) || G && J.empty && J.head == C) && E.setSelection(J);
+      let j = ei(r, E.doc, c.sel);
+      j && !(z && r.composing && j.empty && (p.start != p.endB || r.input.lastChromeDelete < Date.now() - 100) && (j.head == C || j.head == E.mapping.map(I) - 1) || G && j.empty && j.head == C) && E.setSelection(j);
     }
     return s && E.setMeta("composition", s), E.scrollIntoView();
   }, P;
@@ -8420,7 +8420,7 @@ function xa(r, e, t, n, i) {
       P.type == "add" ? M.addMark(C, I, P.mark) : M.removeMark(C, I, P.mark), r.dispatch(M);
     } else if (m.parent.child(m.index()).isText && m.index() == g.index() - (g.textOffset ? 0 : 1)) {
       let M = m.parent.textBetween(m.parentOffset, g.parentOffset), E = () => A(r.state.tr.insertText(M, C, I));
-      r.someProp("handleTextInput", (J) => J(r, C, I, M, E)) || r.dispatch(E());
+      r.someProp("handleTextInput", (j) => j(r, C, I, M, E)) || r.dispatch(E());
     } else
       r.dispatch(A());
   else
@@ -8801,7 +8801,7 @@ class Es {
   views](https://prosemirror.net/docs/ref/#view.NodeView).
   */
   destroy() {
-    this.docView && (Jl(this), this.destroyPluginViews(), this.mounted ? (this.docView.update(this.state.doc, [], mn(this), this), this.dom.textContent = "") : this.dom.parentNode && this.dom.parentNode.removeChild(this.dom), this.docView.destroy(), this.docView = null, Ko());
+    this.docView && (jl(this), this.destroyPluginViews(), this.mounted ? (this.docView.update(this.state.doc, [], mn(this), this), this.dom.textContent = "") : this.dom.parentNode && this.dom.parentNode.removeChild(this.dom), this.docView.destroy(), this.docView = null, Ko());
   }
   /**
   This is true when the view has been
@@ -9175,7 +9175,7 @@ function nr(r) {
     }
   return null;
 }
-const Ja = (r, e) => {
+const ja = (r, e) => {
   let t = r.selection, n = t instanceof S, i;
   if (n) {
     if (t.node.isTextblock || !we(r.doc, t.from))
@@ -9188,7 +9188,7 @@ const Ja = (r, e) => {
     n && s.setSelection(S.create(s.doc, i - r.doc.resolve(i).nodeBefore.nodeSize)), e(s.scrollIntoView());
   }
   return !0;
-}, ja = (r, e) => {
+}, Ja = (r, e) => {
   let t = r.selection, n;
   if (t instanceof S) {
     if (t.node.isTextblock || !we(r.doc, t.to))
@@ -9923,7 +9923,7 @@ function tn(r, e) {
     wt(e[n]) && wt(r[n]) ? t[n] = tn(r[n], e[n]) : t[n] = e[n];
   }), t;
 }
-class Jt {
+class jt {
   constructor(e = {}) {
     this.type = "mark", this.name = "mark", this.parent = null, this.child = null, this.config = {
       name: this.name,
@@ -9939,7 +9939,7 @@ class Jt {
     })) || {};
   }
   static create(e = {}) {
-    return new Jt(e);
+    return new jt(e);
   }
   configure(e = {}) {
     const t = this.extend({
@@ -9949,7 +9949,7 @@ class Jt {
     return t.name = this.name, t.parent = this.parent, t;
   }
   extend(e = {}) {
-    const t = new Jt(e);
+    const t = new jt(e);
     return t.parent = this, this.child = t, t.name = e.name ? e.name : t.parent.name, e.defaultOptions && Object.keys(e.defaultOptions).length > 0 && console.warn(`[tiptap warn]: BREAKING CHANGE: "defaultOptions" is deprecated. Please use "addOptions" instead. Found in extension: "${t.name}".`), t.options = O(x(t, "addOptions", {
       name: t.name
     })), t.storage = O(x(t, "addStorage", {
@@ -10192,7 +10192,7 @@ class He {
         type: kn(o.name, this.schema)
       }, a = [], c = x(o, "addKeyboardShortcuts", l);
       let f = {};
-      if (o.type === "mark" && x(o, "exitable", l) && (f.ArrowRight = () => Jt.handleExit({ editor: e, mark: o })), c) {
+      if (o.type === "mark" && x(o, "exitable", l) && (f.ArrowRight = () => jt.handleExit({ editor: e, mark: o })), c) {
         const m = Object.fromEntries(Object.entries(c()).map(([g, y]) => [g, () => y({ editor: e })]));
         f = { ...f, ...m };
       }
@@ -10418,12 +10418,12 @@ const Mc = ne.create({
   const { from: n, to: i } = r;
   return t && e.delete(n, i), !0;
 }, Pc = () => ({ state: r, dispatch: e }) => Ba(r, e), vc = () => ({ commands: r }) => r.keyboardShortcut("Enter"), Bc = () => ({ state: r, dispatch: e }) => Ha(r, e);
-function jt(r, e, t = { strict: !0 }) {
+function Jt(r, e, t = { strict: !0 }) {
   const n = Object.keys(e);
   return n.length ? n.every((i) => t.strict ? e[i] === r[i] : ir(e[i]) ? e[i].test(r[i]) : e[i] === r[i]) : !0;
 }
 function $s(r, e, t = {}) {
-  return r.find((n) => n.type === e && jt(
+  return r.find((n) => n.type === e && Jt(
     // Only check equality for the attributes that are provided
     Object.fromEntries(Object.keys(t).map((i) => [i, n.attrs[i]])),
     t
@@ -10520,17 +10520,17 @@ const $c = (r = null, e = {}) => ({ editor: t, view: n, tr: i, dispatch: s }) =>
     return o(), !0;
   const l = Ws(i.doc, r) || t.state.selection, a = t.state.selection.eq(l);
   return s && (a || i.setSelection(l), a && i.storedMarks && i.setStoredMarks(i.storedMarks), o()), !0;
-}, Lc = (r, e) => (t) => r.every((n, i) => e(n, { ...t, index: i })), Wc = (r, e) => ({ tr: t, commands: n }) => n.insertContentAt({ from: t.selection.from, to: t.selection.to }, r, e), Js = (r) => {
+}, Lc = (r, e) => (t) => r.every((n, i) => e(n, { ...t, index: i })), Wc = (r, e) => ({ tr: t, commands: n }) => n.insertContentAt({ from: t.selection.from, to: t.selection.to }, r, e), js = (r) => {
   const e = r.childNodes;
   for (let t = e.length - 1; t >= 0; t -= 1) {
     const n = e[t];
-    n.nodeType === 3 && n.nodeValue && /^(\n\s\s|\n)$/.test(n.nodeValue) ? r.removeChild(n) : n.nodeType === 1 && Js(n);
+    n.nodeType === 3 && n.nodeValue && /^(\n\s\s|\n)$/.test(n.nodeValue) ? r.removeChild(n) : n.nodeType === 1 && js(n);
   }
   return r;
 };
 function Nt(r) {
   const e = `<body>${r}</body>`, t = new window.DOMParser().parseFromString(e, "text/html").body;
-  return Js(t);
+  return js(t);
 }
 function mt(r, e, t) {
   if (r instanceof be || r instanceof b)
@@ -10581,7 +10581,7 @@ function mt(r, e, t) {
   }
   return mt("", e, t);
 }
-function Jc(r, e, t) {
+function jc(r, e, t) {
   const n = r.steps.length - 1;
   if (n < e)
     return;
@@ -10594,7 +10594,7 @@ function Jc(r, e, t) {
     o === 0 && (o = f);
   }), r.setSelection(T.near(r.doc.resolve(o), t));
 }
-const jc = (r) => !("type" in r), qc = (r, e, t) => ({ tr: n, dispatch: i, editor: s }) => {
+const Jc = (r) => !("type" in r), qc = (r, e, t) => ({ tr: n, dispatch: i, editor: s }) => {
   var o;
   if (i) {
     t = {
@@ -10635,7 +10635,7 @@ const jc = (r) => !("type" in r), qc = (r, e, t) => ({ tr: n, dispatch: i, edito
       return a(g), !1;
     }
     let { from: f, to: d } = typeof r == "number" ? { from: r, to: r } : { from: r.from, to: r.to }, u = !0, h = !0;
-    if ((jc(l) ? l : [l]).forEach((g) => {
+    if ((Jc(l) ? l : [l]).forEach((g) => {
       g.check(), u = u ? g.isText && g.marks.length === 0 : !1, h = h ? g.isBlock : !1;
     }), f === d && h) {
       const { parent: g } = n.doc.resolve(f);
@@ -10654,10 +10654,10 @@ const jc = (r) => !("type" in r), qc = (r, e, t) => ({ tr: n, dispatch: i, edito
       n.insertText(m, f, d);
     } else
       m = l, n.replaceWith(f, d, m);
-    t.updateSelection && Jc(n, n.steps.length - 1, -1), t.applyInputRules && n.setMeta("applyInputRules", { from: f, text: m }), t.applyPasteRules && n.setMeta("applyPasteRules", { from: f, text: m });
+    t.updateSelection && jc(n, n.steps.length - 1, -1), t.applyInputRules && n.setMeta("applyInputRules", { from: f, text: m }), t.applyPasteRules && n.setMeta("applyPasteRules", { from: f, text: m });
   }
   return !0;
-}, Kc = () => ({ state: r, dispatch: e }) => Ja(r, e), Hc = () => ({ state: r, dispatch: e }) => ja(r, e), Uc = () => ({ state: r, dispatch: e }) => za(r, e), Gc = () => ({ state: r, dispatch: e }) => La(r, e), _c = () => ({ state: r, dispatch: e, tr: t }) => {
+}, Kc = () => ({ state: r, dispatch: e }) => ja(r, e), Hc = () => ({ state: r, dispatch: e }) => Ja(r, e), Uc = () => ({ state: r, dispatch: e }) => za(r, e), Gc = () => ({ state: r, dispatch: e }) => La(r, e), _c = () => ({ state: r, dispatch: e, tr: t }) => {
   try {
     const n = Kt(r.doc, r.selection.$from.pos, -1);
     return n == null ? !1 : (t.join(n, 2), e && e(t), !0);
@@ -10672,7 +10672,7 @@ const jc = (r) => !("type" in r), qc = (r, e, t) => ({ tr: n, dispatch: i, edito
     return !1;
   }
 }, Xc = () => ({ state: r, dispatch: e }) => Fa(r, e), Zc = () => ({ state: r, dispatch: e }) => Va(r, e);
-function js() {
+function Js() {
   return typeof navigator < "u" ? /Mac/.test(navigator.platform) : !1;
 }
 function Qc(r) {
@@ -10691,7 +10691,7 @@ function Qc(r) {
     else if (/^s(hift)?$/i.test(a))
       s = !0;
     else if (/^mod$/i.test(a))
-      or() || js() ? o = !0 : i = !0;
+      or() || Js() ? o = !0 : i = !0;
     else
       throw new Error(`Unrecognized modifier name: ${a}`);
   }
@@ -10726,7 +10726,7 @@ function gt(r, e, t = {}) {
       to: p
     });
   });
-  const a = i - n, c = l.filter((d) => o ? o.name === d.node.type.name : !0).filter((d) => jt(d.node.attrs, t, { strict: !1 }));
+  const a = i - n, c = l.filter((d) => o ? o.name === d.node.type.name : !0).filter((d) => Jt(d.node.attrs, t, { strict: !1 }));
   return s ? !!c.length : c.reduce((d, u) => d + u.to - u.from, 0) >= a;
 }
 const tf = (r, e = {}) => ({ state: t, dispatch: n }) => {
@@ -10856,7 +10856,7 @@ function Dt(r, e, t) {
 function Ln(r, e, t = {}) {
   const { empty: n, ranges: i } = r.selection, s = e ? Oe(e, r.schema) : null;
   if (n)
-    return !!(r.storedMarks || r.selection.$from.marks()).filter((d) => s ? s.name === d.type.name : !0).find((d) => jt(d.attrs, t, { strict: !1 }));
+    return !!(r.storedMarks || r.selection.$from.marks()).filter((d) => s ? s.name === d.type.name : !0).find((d) => Jt(d.attrs, t, { strict: !1 }));
   let o = 0;
   const l = [];
   if (i.forEach(({ $from: d, $to: u }) => {
@@ -10873,7 +10873,7 @@ function Ln(r, e, t = {}) {
     });
   }), o === 0)
     return !1;
-  const a = l.filter((d) => s ? s.name === d.mark.type.name : !0).filter((d) => jt(d.mark.attrs, t, { strict: !1 })).reduce((d, u) => d + u.to - u.from, 0), c = l.filter((d) => s ? d.mark.type !== s && d.mark.type.excludes(s) : !0).reduce((d, u) => d + u.to - u.from, 0);
+  const a = l.filter((d) => s ? s.name === d.mark.type.name : !0).filter((d) => Jt(d.mark.attrs, t, { strict: !1 })).reduce((d, u) => d + u.to - u.from, 0), c = l.filter((d) => s ? d.mark.type !== s && d.mark.type.excludes(s) : !0).reduce((d, u) => d + u.to - u.from, 0);
   return (a > 0 ? a + c : a) >= o;
 }
 function xf(r, e, t = {}) {
@@ -11057,10 +11057,10 @@ const Ef = ({ keepMarks: r = !0 } = {}) => ({ tr: e, state: t, dispatch: n, edit
       const P = a.before(a.depth - (w - 1));
       t.replace(P, a.after(-C), new k(y, 4 - w, 0));
       let M = -1;
-      t.doc.nodesBetween(P, t.doc.content.size, (E, J) => {
+      t.doc.nodesBetween(P, t.doc.content.size, (E, j) => {
         if (M > -1)
           return !1;
-        E.isTextblock && E.content.size === 0 && (M = J + 1);
+        E.isTextblock && E.content.size === 0 && (M = j + 1);
       }), M > -1 && t.setSelection(N.near(t.doc.resolve(M))), t.scrollIntoView();
     }
     return !0;
@@ -11275,7 +11275,7 @@ const Wf = ne.create({
       ...Lf
     };
   }
-}), Jf = ne.create({
+}), jf = ne.create({
   name: "drop",
   addProseMirrorPlugins() {
     return [
@@ -11294,7 +11294,7 @@ const Wf = ne.create({
       })
     ];
   }
-}), jf = ne.create({
+}), Jf = ne.create({
   name: "editable",
   addProseMirrorPlugins() {
     return [
@@ -11375,7 +11375,7 @@ const Wf = ne.create({
       "Ctrl-a": () => this.editor.commands.selectTextblockStart(),
       "Ctrl-e": () => this.editor.commands.selectTextblockEnd()
     };
-    return or() || js() ? s : i;
+    return or() || Js() ? s : i;
   },
   addProseMirrorPlugins() {
     return [
@@ -11768,7 +11768,7 @@ let Qf = class extends lc {
   createExtensionManager() {
     var e, t;
     const i = [...this.options.enableCoreExtensions ? [
-      jf,
+      Jf,
       Mc.configure({
         blockSeparator: (t = (e = this.options.coreExtensionOptions) === null || e === void 0 ? void 0 : e.clipboardTextSerializer) === null || t === void 0 ? void 0 : t.blockSeparator
       }),
@@ -11776,7 +11776,7 @@ let Qf = class extends lc {
       Kf,
       Hf,
       Gf,
-      Jf,
+      jf,
       Uf
     ].filter((s) => typeof this.options.enableCoreExtensions == "object" ? this.options.enableCoreExtensions[s.name] !== !1 : !0) : [], ...this.options.extensions].filter((s) => ["extension", "node", "mark"].includes(s == null ? void 0 : s.type));
     this.extensionManager = new He(i, this);
@@ -12125,68 +12125,41 @@ function od(r, e) {
   }
   return !1;
 }
+function ld(r) {
+  return r.replace(/[-/\\^$*+?.()|[\]{}]/g, "\\$&");
+}
 export {
-  O as $,
-  Z as A,
-  ja as B,
-  za as C,
-  ee as D,
+  v as D,
   ne as E,
   b as F,
-  Ha as G,
-  Ba as H,
-  Ua as I,
-  et as J,
-  we as K,
-  be as L,
-  Ai as M,
+  jt as M,
   Wn as N,
-  ke as O,
   oe as P,
-  F as Q,
-  B as R,
   T as S,
   N as T,
-  id as U,
-  Jt as V,
-  sd as W,
-  td as X,
-  rd as Y,
-  Po as Z,
-  va as _,
   $e as a,
-  x as a0,
-  Bt as a1,
-  od as a2,
-  Xf as a3,
-  Ls as a4,
-  Zf as a5,
-  yf as a6,
-  Vs as a7,
-  Qf as a8,
-  v as b,
-  Qa as c,
-  k as d,
-  Ue as e,
-  S as f,
-  li as g,
-  Xa as h,
+  ee as b,
+  be as c,
+  sd as d,
+  ld as e,
+  td as f,
+  Po as g,
+  k as h,
   ar as i,
-  Za as j,
-  _a as k,
-  Wa as l,
+  S as j,
+  va as k,
+  O as l,
   ac as m,
   nd as n,
-  $a as o,
-  Ka as p,
-  rc as q,
-  Ga as r,
-  oc as s,
-  qa as t,
-  Ja as u,
-  Va as v,
-  ec as w,
-  Fa as x,
-  Kt as y,
-  La as z
+  x as o,
+  Bt as p,
+  od as q,
+  Xf as r,
+  Ls as s,
+  rd as t,
+  Zf as u,
+  yf as v,
+  id as w,
+  Vs as x,
+  Qf as y
 };