@vc-shell/framework 2.0.0-alpha.33 → 2.0.0-alpha.34

package/dist/chunks/{vendor-prosemirror-transform-BUjWd5Tb.js → vendor-prosemirror-transform-DVGD47fI.js}

@@ -9,7 +9,7 @@ function H(s) {
 function he(s) {
   return (s - (s & Q)) / U;
 }
-const V = 1, X = 2, J = 4, Y = 8;
+const V = 1, X = 2, A = 4, Y = 8;
 class L {
   /**
   @internal
@@ -29,13 +29,13 @@ class L {
   Tells you whether the token before the mapped position was deleted.
   */
   get deletedBefore() {
-    return (this.delInfo & (V | J)) > 0;
+    return (this.delInfo & (V | A)) > 0;
   }
   /**
   True when the token after the mapped position was deleted.
   */
   get deletedAfter() {
-    return (this.delInfo & (X | J)) > 0;
+    return (this.delInfo & (X | A)) > 0;
   }
   /**
   Tells whether any of the steps mapped through deletes across the
@@ -43,7 +43,7 @@ class L {
   position).
   */
   get deletedAcross() {
-    return (this.delInfo & J) > 0;
+    return (this.delInfo & A) > 0;
   }
 }
 class S {
@@ -86,7 +86,7 @@ class S {
         let f = h ? e == a ? -1 : e == c ? 1 : t : t, d = a + n + (f < 0 ? 0 : p);
         if (r)
           return d;
-        let u = e == (t < 0 ? a : c) ? null : ae(l / 3, e - a), m = e == a ? X : e == c ? V : J;
+        let u = e == (t < 0 ? a : c) ? null : ae(l / 3, e - a), m = e == a ? X : e == c ? V : A;
         return (t < 0 ? e != a : e != c) && (m |= Y), new L(d, m, u);
       }
       n += p - h;
@@ -143,7 +143,7 @@ class S {
   }
 }
 S.empty = new S([]);
-class A {
+class J {
   /**
   Create a new mapping with the given position maps.
   */
@@ -160,7 +160,7 @@ class A {
   Create a mapping that maps only through a part of this one.
   */
   slice(e = 0, t = this.maps.length) {
-    return new A(this._maps, this.mirror, e, t);
+    return new J(this._maps, this.mirror, e, t);
   }
   /**
   Add a step map to the end of this mapping. If `mirrors` is
@@ -211,7 +211,7 @@ class A {
   Create an inverted version of this mapping.
   */
   invert() {
-    let e = new A();
+    let e = new J();
     return e.appendMappingInverted(this), e;
   }
   /**
@@ -251,7 +251,7 @@ class A {
   }
 }
 const B = /* @__PURE__ */ Object.create(null);
-class k {
+class v {
   /**
   Get the step map that represents the changes made by this step,
   and which can be used to transform between positions in the old
@@ -326,15 +326,15 @@ class y {
     }
   }
 }
-function P(s, e, t) {
+function q(s, e, t) {
   let r = [];
   for (let n = 0; n < s.childCount; n++) {
     let i = s.child(n);
-    i.content.size && (i = i.copy(P(i.content, e, i))), i.isInline && (i = e(i, t, n)), r.push(i);
+    i.content.size && (i = i.copy(q(i.content, e, i))), i.isInline && (i = e(i, t, n)), r.push(i);
   }
   return w.fromArray(r);
 }
-class C extends k {
+class C extends v {
   /**
   Create a mark step.
   */
@@ -342,7 +342,7 @@ class C extends k {
     super(), this.from = e, this.to = t, this.mark = r;
   }
   apply(e) {
-    let t = e.slice(this.from, this.to), r = e.resolve(this.from), n = r.node(r.sharedDepth(this.to)), i = new g(P(t.content, (o, l) => !o.isAtom || !l.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), n), t.openStart, t.openEnd);
+    let t = e.slice(this.from, this.to), r = e.resolve(this.from), n = r.node(r.sharedDepth(this.to)), i = new g(q(t.content, (o, l) => !o.isAtom || !l.type.allowsMarkType(this.mark.type) ? o : o.mark(this.mark.addToSet(o.marks)), n), t.openStart, t.openEnd);
     return y.fromReplace(e, this.from, this.to, i);
   }
   invert() {
@@ -372,8 +372,8 @@ class C extends k {
     return new C(t.from, t.to, e.markFromJSON(t.mark));
   }
 }
-k.jsonID("addMark", C);
-class b extends k {
+v.jsonID("addMark", C);
+class b extends v {
   /**
   Create a mark-removing step.
   */
@@ -381,7 +381,7 @@ class b extends k {
     super(), this.from = e, this.to = t, this.mark = r;
   }
   apply(e) {
-    let t = e.slice(this.from, this.to), r = new g(P(t.content, (n) => n.mark(this.mark.removeFromSet(n.marks)), e), t.openStart, t.openEnd);
+    let t = e.slice(this.from, this.to), r = new g(q(t.content, (n) => n.mark(this.mark.removeFromSet(n.marks)), e), t.openStart, t.openEnd);
     return y.fromReplace(e, this.from, this.to, r);
   }
   invert() {
@@ -411,8 +411,8 @@ class b extends k {
     return new b(t.from, t.to, e.markFromJSON(t.mark));
   }
 }
-k.jsonID("removeMark", b);
-class N extends k {
+v.jsonID("removeMark", b);
+class I extends v {
   /**
   Create a node mark step.
   */
@@ -433,15 +433,15 @@ class N extends k {
       if (r.length == t.marks.length) {
         for (let n = 0; n < t.marks.length; n++)
           if (!t.marks[n].isInSet(r))
-            return new N(this.pos, t.marks[n]);
-        return new N(this.pos, this.mark);
+            return new I(this.pos, t.marks[n]);
+        return new I(this.pos, this.mark);
       }
     }
-    return new I(this.pos, this.mark);
+    return new R(this.pos, this.mark);
   }
   map(e) {
     let t = e.mapResult(this.pos, 1);
-    return t.deletedAfter ? null : new N(t.pos, this.mark);
+    return t.deletedAfter ? null : new I(t.pos, this.mark);
   }
   toJSON() {
     return { stepType: "addNodeMark", pos: this.pos, mark: this.mark.toJSON() };
@@ -452,11 +452,11 @@ class N extends k {
   static fromJSON(e, t) {
     if (typeof t.pos != "number")
       throw new RangeError("Invalid input for AddNodeMarkStep.fromJSON");
-    return new N(t.pos, e.markFromJSON(t.mark));
+    return new I(t.pos, e.markFromJSON(t.mark));
   }
 }
-k.jsonID("addNodeMark", N);
-class I extends k {
+v.jsonID("addNodeMark", I);
+class R extends v {
   /**
   Create a mark-removing step.
   */
@@ -472,11 +472,11 @@ class I extends k {
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
-    return !t || !this.mark.isInSet(t.marks) ? this : new N(this.pos, this.mark);
+    return !t || !this.mark.isInSet(t.marks) ? this : new I(this.pos, this.mark);
   }
   map(e) {
     let t = e.mapResult(this.pos, 1);
-    return t.deletedAfter ? null : new I(t.pos, this.mark);
+    return t.deletedAfter ? null : new R(t.pos, this.mark);
   }
   toJSON() {
     return { stepType: "removeNodeMark", pos: this.pos, mark: this.mark.toJSON() };
@@ -487,11 +487,11 @@ class I extends k {
   static fromJSON(e, t) {
     if (typeof t.pos != "number")
       throw new RangeError("Invalid input for RemoveNodeMarkStep.fromJSON");
-    return new I(t.pos, e.markFromJSON(t.mark));
+    return new R(t.pos, e.markFromJSON(t.mark));
   }
 }
-k.jsonID("removeNodeMark", I);
-class v extends k {
+v.jsonID("removeNodeMark", R);
+class k extends v {
   /**
   The given `slice` should fit the 'gap' between `from` and
   `to`—the depths must line up, and the surrounding nodes must be
@@ -505,27 +505,27 @@ class v extends k {
     super(), this.from = e, this.to = t, this.slice = r, this.structure = n;
   }
   apply(e) {
-    return this.structure && q(e, this.from, this.to) ? y.fail("Structure replace would overwrite content") : y.fromReplace(e, this.from, this.to, this.slice);
+    return this.structure && P(e, this.from, this.to) ? y.fail("Structure replace would overwrite content") : y.fromReplace(e, this.from, this.to, this.slice);
   }
   getMap() {
     return new S([this.from, this.to - this.from, this.slice.size]);
   }
   invert(e) {
-    return new v(this.from, this.from + this.slice.size, e.slice(this.from, this.to));
+    return new k(this.from, this.from + this.slice.size, e.slice(this.from, this.to));
   }
   map(e) {
-    let t = e.mapResult(this.from, 1), r = e.mapResult(this.to, -1);
-    return t.deletedAcross && r.deletedAcross ? null : new v(t.pos, Math.max(t.pos, r.pos), this.slice, this.structure);
+    let t = e.mapResult(this.to, -1), r = this.from == this.to && k.MAP_BIAS < 0 ? t : e.mapResult(this.from, 1);
+    return r.deletedAcross && t.deletedAcross ? null : new k(r.pos, Math.max(r.pos, t.pos), this.slice, this.structure);
   }
   merge(e) {
-    if (!(e instanceof v) || e.structure || this.structure)
+    if (!(e instanceof k) || e.structure || this.structure)
       return null;
     if (this.from + this.slice.size == e.from && !this.slice.openEnd && !e.slice.openStart) {
       let t = this.slice.size + e.slice.size == 0 ? g.empty : new g(this.slice.content.append(e.slice.content), this.slice.openStart, e.slice.openEnd);
-      return new v(this.from, this.to + (e.to - e.from), t, this.structure);
+      return new k(this.from, this.to + (e.to - e.from), t, this.structure);
     } else if (e.to == this.from && !this.slice.openStart && !e.slice.openEnd) {
       let t = this.slice.size + e.slice.size == 0 ? g.empty : new g(e.slice.content.append(this.slice.content), e.slice.openStart, this.slice.openEnd);
-      return new v(e.from, this.to, t, this.structure);
+      return new k(e.from, this.to, t, this.structure);
     } else
       return null;
   }
@@ -539,11 +539,12 @@ class v extends k {
   static fromJSON(e, t) {
     if (typeof t.from != "number" || typeof t.to != "number")
       throw new RangeError("Invalid input for ReplaceStep.fromJSON");
-    return new v(t.from, t.to, g.fromJSON(e, t.slice), !!t.structure);
+    return new k(t.from, t.to, g.fromJSON(e, t.slice), !!t.structure);
   }
 }
-k.jsonID("replace", v);
-class M extends k {
+k.MAP_BIAS = 1;
+v.jsonID("replace", k);
+class M extends v {
   /**
   Create a replace-around step with the given range and gap.
   `insert` should be the point in the slice into which the content
@@ -554,7 +555,7 @@ class M extends k {
     super(), this.from = e, this.to = t, this.gapFrom = r, this.gapTo = n, this.slice = i, this.insert = o, this.structure = l;
   }
   apply(e) {
-    if (this.structure && (q(e, this.from, this.gapFrom) || q(e, this.gapTo, this.to)))
+    if (this.structure && (P(e, this.from, this.gapFrom) || P(e, this.gapTo, this.to)))
       return y.fail("Structure gap-replace would overwrite content");
     let t = e.slice(this.gapFrom, this.gapTo);
     if (t.openStart || t.openEnd)
@@ -600,8 +601,8 @@ class M extends k {
     return new M(t.from, t.to, t.gapFrom, t.gapTo, g.fromJSON(e, t.slice), t.insert, !!t.structure);
   }
 }
-k.jsonID("replaceAround", M);
-function q(s, e, t) {
+v.jsonID("replaceAround", M);
+function P(s, e, t) {
   let r = s.resolve(e), n = t - e, i = r.depth;
   for (; n > 0 && i > 0 && r.indexAfter(i) == r.node(i).childCount; )
     i--, n--;
@@ -659,7 +660,7 @@ function $(s, e, t, r = t.contentMatch, n = !0) {
   for (let a = 0; a < i.childCount; a++) {
     let h = i.child(a), p = l + h.nodeSize, c = r.matchType(h.type);
     if (!c)
-      o.push(new v(l, p, g.empty));
+      o.push(new k(l, p, g.empty));
     else {
       r = c;
       for (let f = 0; f < h.marks.length; f++)
@@ -667,7 +668,7 @@ function $(s, e, t, r = t.contentMatch, n = !0) {
       if (n && h.isText && t.whitespace != "pre") {
         let f, d = /\r?\n|\r/g, u;
         for (; f = d.exec(h.text); )
-          u || (u = new g(w.from(t.schema.text(" ", t.allowedMarks(h.marks))), 0, 0)), o.push(new v(l + f.index, l + f.index + f[0].length, u));
+          u || (u = new g(w.from(t.schema.text(" ", t.allowedMarks(h.marks))), 0, 0)), o.push(new k(l + f.index, l + f.index + f[0].length, u));
       }
     }
     l = p;
@@ -793,7 +794,7 @@ function ke(s, e, t, r, n) {
     throw new RangeError("Invalid content for node type " + t.name);
   s.step(new M(e, e + i.nodeSize, e + 1, e + i.nodeSize - 1, new g(w.from(o), 0, 0), 1, !0));
 }
-function Je(s, e, t = 1, r) {
+function Ae(s, e, t = 1, r) {
   let n = s.resolve(e), i = n.depth - t, o = r && r[r.length - 1] || n.parent;
   if (i < 0 || n.parent.type.spec.isolating || !n.parent.canReplace(n.index(), n.parent.childCount) || !o.type.validContent(n.parent.content.cutByIndex(n.index(), n.parent.childCount)))
     return !1;
@@ -817,9 +818,9 @@ function ve(s, e, t = 1, r) {
     let p = r && r[h];
     o = w.from(p ? p.type.create(p.attrs, o) : n.node(l).copy(o));
   }
-  s.step(new v(e, e, new g(i.append(o), t, t), !0));
+  s.step(new k(e, e, new g(i.append(o), t, t), !0));
 }
-function Ae(s, e) {
+function Je(s, e) {
   let t = s.resolve(e), r = t.index();
   return j(t.nodeBefore, t.nodeAfter) && t.parent.canReplace(r, r + 1);
 }
@@ -860,7 +861,7 @@ function Se(s, e, t) {
   }
   o.inlineContent && $(s, e + t - 1, o, i.node().contentMatchAt(i.index()), r == null);
   let a = s.mapping.slice(l), h = a.map(e - t);
-  if (s.step(new v(h, a.map(e + t, -1), g.empty, !0)), r === !0) {
+  if (s.step(new k(h, a.map(e + t, -1), g.empty, !0)), r === !0) {
     let p = s.doc.resolve(h);
     Z(s, p.node(), p.before(), s.steps.length);
   }
@@ -888,7 +889,7 @@ function be(s, e, t) {
     }
   return null;
 }
-function We(s, e, t) {
+function De(s, e, t) {
   let r = s.resolve(e);
   if (!t.content.size)
     return e;
@@ -913,7 +914,7 @@ function Me(s, e, t = e, r = g.empty) {
   if (e == t && !r.size)
     return null;
   let n = s.resolve(e), i = s.resolve(t);
-  return ee(n, i, r) ? new v(e, t, r) : new Ce(n, i, r).fit();
+  return ee(n, i, r) ? new k(e, t, r) : new Ce(n, i, r).fit();
 }
 function ee(s, e, t) {
   return !t.openStart && !t.openEnd && s.start() == e.start() && s.parent.canReplace(s.index(), e.index(), t.content);
@@ -946,7 +947,7 @@ class Ce {
     for (; o && l && i.childCount == 1; )
       i = i.firstChild.content, o--, l--;
     let a = new g(i, o, l);
-    return e > -1 ? new M(r.pos, e, this.$to.pos, this.$to.end(), a, t) : a.size || r.pos != this.$to.pos ? new v(r.pos, n.pos, a) : null;
+    return e > -1 ? new M(r.pos, e, this.$to.pos, this.$to.end(), a, t) : a.size || r.pos != this.$to.pos ? new k(r.pos, n.pos, a) : null;
   }
   // Find a position on the start spine of `this.unplaced` that has
   // content that can be moved somewhere on the frontier. Returns two
@@ -964,7 +965,7 @@ class Ce {
     for (let t = 1; t <= 2; t++)
       for (let r = t == 1 ? e : this.unplaced.openStart; r >= 0; r--) {
         let n, i = null;
-        r ? (i = W(this.unplaced.content, r - 1).firstChild, n = i.content) : n = this.unplaced.content;
+        r ? (i = D(this.unplaced.content, r - 1).firstChild, n = i.content) : n = this.unplaced.content;
         let o = n.firstChild;
         for (let l = this.depth; l >= 0; l--) {
           let { type: a, match: h } = this.frontier[l], p, c = null;
@@ -978,11 +979,11 @@ class Ce {
       }
   }
   openMore() {
-    let { content: e, openStart: t, openEnd: r } = this.unplaced, n = W(e, t);
+    let { content: e, openStart: t, openEnd: r } = this.unplaced, n = D(e, t);
     return !n.childCount || n.firstChild.isLeaf ? !1 : (this.unplaced = new g(e, t + 1, Math.max(r, n.size + t >= e.size - r ? t + 1 : 0)), !0);
   }
   dropNode() {
-    let { content: e, openStart: t, openEnd: r } = this.unplaced, n = W(e, t);
+    let { content: e, openStart: t, openEnd: r } = this.unplaced, n = D(e, t);
     if (n.childCount <= 1 && t > 0) {
       let i = e.size - t <= t + n.size;
       this.unplaced = new g(O(e, t - 1, 1), t - 1, i ? t - 1 : r);
@@ -1014,8 +1015,8 @@ class Ce {
     let u = h == l.childCount;
     u || (d = -1), this.placed = F(this.placed, t, w.from(p)), this.frontier[t].match = c, u && d < 0 && r && r.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
     for (let m = 0, x = l; m < d; m++) {
-      let R = x.lastChild;
-      this.frontier.push({ type: R.type, match: R.contentMatchAt(R.childCount) }), x = R.content;
+      let N = x.lastChild;
+      this.frontier.push({ type: N.type, match: N.contentMatchAt(N.childCount) }), x = N.content;
     }
     this.unplaced = u ? e == 0 ? g.empty : new g(O(o.content, e - 1, 1), e - 1, d < 0 ? o.openEnd : e - 1) : new g(O(o.content, e, h), o.openStart, o.openEnd);
   }
@@ -1023,7 +1024,7 @@ class Ce {
     if (!this.$to.parent.isTextblock)
       return -1;
     let e = this.frontier[this.depth], t;
-    if (!e.type.isTextblock || !D(this.$to, this.$to.depth, e.type, e.match, !1) || this.$to.depth == this.depth && (t = this.findCloseLevel(this.$to)) && t.depth == this.depth)
+    if (!e.type.isTextblock || !W(this.$to, this.$to.depth, e.type, e.match, !1) || this.$to.depth == this.depth && (t = this.findCloseLevel(this.$to)) && t.depth == this.depth)
       return -1;
     let { depth: r } = this.$to, n = this.$to.after(r);
     for (; r > 1 && n == this.$to.end(--r); )
@@ -1032,10 +1033,10 @@ class Ce {
   }
   findCloseLevel(e) {
     e: for (let t = Math.min(this.depth, e.depth); t >= 0; t--) {
-      let { match: r, type: n } = this.frontier[t], i = t < e.depth && e.end(t + 1) == e.pos + (e.depth - (t + 1)), o = D(e, t, n, r, i);
+      let { match: r, type: n } = this.frontier[t], i = t < e.depth && e.end(t + 1) == e.pos + (e.depth - (t + 1)), o = W(e, t, n, r, i);
       if (o) {
         for (let l = t - 1; l >= 0; l--) {
-          let { match: a, type: h } = this.frontier[l], p = D(e, l, h, a, !0);
+          let { match: a, type: h } = this.frontier[l], p = W(e, l, h, a, !0);
           if (!p || p.childCount)
             continue e;
         }
@@ -1071,7 +1072,7 @@ function O(s, e, t) {
 function F(s, e, t) {
   return e == 0 ? s.append(t) : s.replaceChild(s.childCount - 1, s.lastChild.copy(F(s.lastChild.content, e - 1, t)));
 }
-function W(s, e) {
+function D(s, e) {
   for (let t = 0; t < e; t++)
     s = s.firstChild.content;
   return s;
@@ -1082,28 +1083,28 @@ function te(s, e, t) {
   let r = s.content;
   return e > 1 && (r = r.replaceChild(0, te(r.firstChild, e - 1, r.childCount == 1 ? t - 1 : 0))), e > 0 && (r = s.type.contentMatch.fillBefore(r).append(r), t <= 0 && (r = r.append(s.type.contentMatch.matchFragment(r).fillBefore(w.empty, !0)))), s.copy(r);
 }
-function D(s, e, t, r, n) {
+function W(s, e, t, r, n) {
   let i = s.node(e), o = n ? s.indexAfter(e) : s.index(e);
   if (o == i.childCount && !t.compatibleContent(i.type))
     return null;
   let l = r.fillBefore(i.content, !0, o);
-  return l && !Ne(t, i.content, o) ? l : null;
+  return l && !Ie(t, i.content, o) ? l : null;
 }
-function Ne(s, e, t) {
+function Ie(s, e, t) {
   for (let r = t; r < e.childCount; r++)
     if (!s.allowsMarks(e.child(r).marks))
       return !0;
   return !1;
 }
-function Re(s) {
+function Ne(s) {
   return s.spec.defining || s.spec.definingForContent;
 }
-function Ie(s, e, t, r) {
+function Re(s, e, t, r) {
   if (!r.size)
     return s.deleteRange(e, t);
   let n = s.doc.resolve(e), i = s.doc.resolve(t);
   if (ee(n, i, r))
-    return s.step(new v(e, t, r));
+    return s.step(new k(e, t, r));
   let o = ne(n, i);
   o[o.length - 1] == 0 && o.pop();
   let l = -(n.depth + 1);
@@ -1122,7 +1123,7 @@ function Ie(s, e, t, r) {
     f = u.content;
   }
   for (let f = p - 1; f >= 0; f--) {
-    let d = h[f], u = Re(d.type);
+    let d = h[f], u = Ne(d.type);
     if (u && !d.sameMarkup(n.node(Math.abs(l) - 1)))
       p = f;
     else if (u || !d.type.isTextblock)
@@ -1132,11 +1133,11 @@ function Ie(s, e, t, r) {
     let d = (f + p + 1) % (r.openStart + 1), u = h[d];
     if (u)
       for (let m = 0; m < o.length; m++) {
-        let x = o[(m + a) % o.length], R = !0;
-        x < 0 && (R = !1, x = -x);
+        let x = o[(m + a) % o.length], N = !0;
+        x < 0 && (N = !1, x = -x);
         let ie = n.node(x - 1), G = n.index(x - 1);
         if (ie.canReplaceWith(G, G, u.type, u.marks))
-          return s.replace(n.before(x), R ? i.after(x) : t, new g(re(r.content, 0, r.openStart, d), d, r.openEnd));
+          return s.replace(n.before(x), N ? i.after(x) : t, new g(re(r.content, 0, r.openStart, d), d, r.openEnd));
       }
   }
   let c = s.steps.length;
@@ -1156,15 +1157,30 @@ function re(s, e, t, r, n) {
   }
   return s;
 }
-function Ee(s, e, t, r) {
+function Te(s, e, t, r) {
   if (!r.isInline && e == t && s.doc.resolve(e).parent.content.size) {
     let n = be(s.doc, e, r.type);
     n != null && (e = t = n);
   }
   s.replaceRange(e, t, new g(w.from(r), 0, 0));
 }
-function Te(s, e, t) {
-  let r = s.doc.resolve(e), n = s.doc.resolve(t), i = ne(r, n);
+function Ee(s, e, t) {
+  let r = s.doc.resolve(e), n = s.doc.resolve(t);
+  if (r.parent.isTextblock && n.parent.isTextblock && r.start() != n.start() && r.parentOffset == 0 && n.parentOffset == 0) {
+    let o = r.sharedDepth(t), l = !1;
+    for (let a = r.depth; a > o; a--)
+      r.node(a).type.spec.isolating && (l = !0);
+    for (let a = n.depth; a > o; a--)
+      n.node(a).type.spec.isolating && (l = !0);
+    if (!l) {
+      for (let a = r.depth; a > 0 && e == r.start(a); a--)
+        e = r.before(a);
+      for (let a = n.depth; a > 0 && t == n.start(a); a--)
+        t = n.before(a);
+      r = s.doc.resolve(e), n = s.doc.resolve(t);
+    }
+  }
+  let i = ne(r, n);
   for (let o = 0; o < i.length; o++) {
     let l = i[o], a = o == i.length - 1;
     if (a && l == 0 || r.node(l).type.contentMatch.validEnd)
@@ -1187,7 +1203,7 @@ function ne(s, e) {
   }
   return t;
 }
-class E extends k {
+class T extends v {
   /**
   Construct an attribute step.
   */
@@ -1209,11 +1225,11 @@ class E extends k {
     return S.empty;
   }
   invert(e) {
-    return new E(this.pos, this.attr, e.nodeAt(this.pos).attrs[this.attr]);
+    return new T(this.pos, this.attr, e.nodeAt(this.pos).attrs[this.attr]);
   }
   map(e) {
     let t = e.mapResult(this.pos, 1);
-    return t.deletedAfter ? null : new E(t.pos, this.attr, this.value);
+    return t.deletedAfter ? null : new T(t.pos, this.attr, this.value);
   }
   toJSON() {
     return { stepType: "attr", pos: this.pos, attr: this.attr, value: this.value };
@@ -1221,11 +1237,11 @@ class E extends k {
   static fromJSON(e, t) {
     if (typeof t.pos != "number" || typeof t.attr != "string")
       throw new RangeError("Invalid input for AttrStep.fromJSON");
-    return new E(t.pos, t.attr, t.value);
+    return new T(t.pos, t.attr, t.value);
   }
 }
-k.jsonID("attr", E);
-class z extends k {
+v.jsonID("attr", T);
+class z extends v {
   /**
   Construct an attribute step.
   */
@@ -1258,22 +1274,22 @@ class z extends k {
     return new z(t.attr, t.value);
   }
 }
-k.jsonID("docAttr", z);
-let T = class extends Error {
+v.jsonID("docAttr", z);
+let E = class extends Error {
 };
-T = function s(e) {
+E = function s(e) {
   let t = Error.call(this, e);
   return t.__proto__ = s.prototype, t;
 };
-T.prototype = Object.create(Error.prototype);
-T.prototype.constructor = T;
-T.prototype.name = "TransformError";
-class De {
+E.prototype = Object.create(Error.prototype);
+E.prototype.constructor = E;
+E.prototype.name = "TransformError";
+class We {
   /**
   Create a transform that starts with the given document.
   */
   constructor(e) {
-    this.doc = e, this.steps = [], this.docs = [], this.mapping = new A();
+    this.doc = e, this.steps = [], this.docs = [], this.mapping = new J();
   }
   /**
   The starting document.
@@ -1288,7 +1304,7 @@ class De {
   step(e) {
     let t = this.maybeStep(e);
     if (t.failed)
-      throw new T(t.failed);
+      throw new E(t.failed);
     return this;
   }
   /**
@@ -1375,7 +1391,7 @@ class De {
   control over what happens.
   */
   replaceRange(e, t, r) {
-    return Ie(this, e, t, r), this;
+    return Re(this, e, t, r), this;
   }
   /**
   Replace the given range with a node, but use `from` and `to` as
@@ -1387,14 +1403,14 @@ class De {
   that parent node.
   */
   replaceRangeWith(e, t, r) {
-    return Ee(this, e, t, r), this;
+    return Te(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 Te(this, e, t), this;
+    return Ee(this, e, t), this;
   }
   /**
   Split the content in the given range off from its parent, if there
@@ -1441,7 +1457,7 @@ class De {
   to set attributes on the document itself.
   */
   setNodeAttribute(e, t, r) {
-    return this.step(new E(e, t, r)), this;
+    return this.step(new T(e, t, r)), this;
   }
   /**
   Set a single attribute on the document to a new value.
@@ -1453,7 +1469,7 @@ class De {
   Add a mark to the node at position `pos`.
   */
   addNodeMark(e, t) {
-    return this.step(new N(e, t)), this;
+    return this.step(new I(e, t)), this;
   }
   /**
   Remove a mark (or all marks of the given type) from the node at
@@ -1464,11 +1480,11 @@ class De {
     if (!r)
       throw new RangeError("No node at position " + e);
     if (t instanceof oe)
-      t.isInSet(r.marks) && this.step(new I(e, t));
+      t.isInSet(r.marks) && this.step(new R(e, t));
     else {
       let n = r.marks, i, o = [];
       for (; i = t.isInSet(n); )
-        o.push(new I(e, i)), n = i.removeFromSet(n);
+        o.push(new R(e, i)), n = i.removeFromSet(n);
       for (let l = o.length - 1; l >= 0; l--)
         this.step(o[l]);
     }
@@ -1510,13 +1526,13 @@ class De {
   }
 }
 export {
-  A as M,
-  v as R,
-  De as T,
+  J as M,
+  k as R,
+  We as T,
   M as a,
-  Je as b,
-  Ae as c,
-  We as d,
+  Ae as b,
+  Je as c,
+  De as d,
   b as e,
   ze as f,
   Be as j,

package/dist/chunks/{vendor-prosemirror-view-Chu67Jpw.js → vendor-prosemirror-view-BW4UqvjQ.js}

@@ -1,6 +1,6 @@
-import { N as D, S as be, T as k, A as Sn } from "./vendor-prosemirror-state-IeimrELV.js";
+import { N as D, S as be, T as k, A as Sn } from "./vendor-prosemirror-state-BvFA7AjG.js";
 import { S as se, D as Ve, F as j, c as $t, M as Cn } from "./vendor-prosemirror-model-DAA3avbR.js";
-import { d as On } from "./vendor-prosemirror-transform-BUjWd5Tb.js";
+import { d as On } from "./vendor-prosemirror-transform-DVGD47fI.js";
 const C = function(t) {
   for (var e = 0; ; e++)
     if (t = t.previousSibling, !t)
@@ -2211,7 +2211,7 @@ class Ro {
     const l = i ? null : o.target, a = l ? e.docView.nearestDesc(l, !0) : null;
     this.target = a && a.nodeDOM.nodeType == 1 ? a.nodeDOM : null;
     let { selection: c } = e.state;
-    (o.button == 0 && s.type.spec.draggable && s.type.spec.selectable !== !1 || c instanceof D && c.from <= r && c.to > r) && (this.mightDrag = {
+    o.button == 0 && (s.type.spec.draggable && s.type.spec.selectable !== !1 || c instanceof D && c.from <= r && c.to > r) && (this.mightDrag = {
       node: s,
       pos: r,
       addAttr: !!(this.target && !this.target.draggable),
@@ -2389,8 +2389,10 @@ class mn {
 }
 const qo = V ? "altKey" : "ctrlKey";
 function gn(t, e) {
-  let n = t.someProp("dragCopies", (o) => !o(e));
-  return n ?? !e[qo];
+  let n;
+  return t.someProp("dragCopies", (o) => {
+    n = n || o(e);
+  }), n != null ? !n : !e[qo];
 }
 T.dragstart = (t, e) => {
   let n = e, o = t.input.mouseDown;

package/dist/chunks/{vendor-striptags--4dtoP3u.js → vendor-striptags-DtlgQudQ.js}

@@ -1,4 +1,4 @@
-import { g as M } from "./vendor-markdown-it-task-lists-xwqUBSah.js";
+import { g as M } from "./vendor-iso-639-1-BEjYyfKo.js";
 var _ = { exports: {} }, R = _.exports, v;
 function l() {
   return v || (v = 1, (function(E) {