@fewangsit/wangsvue-fats 1.0.1-rc.9 → 2.0.0-alpha.1

package/vendor/prosemirror-transform/dist/index.es.js

@@ -1,4 +1,4 @@
-import { b as w, F as g, M as se, d as oe, R as le } from "../../prosemirror-model/dist/index.es.js";
+import { S as g, F as w, M as se, a as oe, R as le } from "../../prosemirror-model/dist/index.es.js";
 const Q = 65535, U = Math.pow(2, 16);
 function ae(s, e) {
   return s + e * U;
@@ -332,7 +332,7 @@ function P(s, e, t) {
     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);
   }
-  return g.fromArray(r);
+  return w.fromArray(r);
 }
 class C extends k {
   /**
@@ -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 w(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(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);
     return y.fromReplace(e, this.from, this.to, i);
   }
   invert() {
@@ -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 w(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(P(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() {
@@ -424,7 +424,7 @@ class N extends k {
     if (!t)
       return y.fail("No node at mark step's position");
     let r = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
-    return y.fromReplace(e, this.pos, this.pos + 1, new w(g.from(r), 0, t.isLeaf ? 0 : 1));
+    return y.fromReplace(e, this.pos, this.pos + 1, new g(w.from(r), 0, t.isLeaf ? 0 : 1));
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
@@ -437,7 +437,7 @@ class N extends k {
         return new N(this.pos, this.mark);
       }
     }
-    return new R(this.pos, this.mark);
+    return new I(this.pos, this.mark);
   }
   map(e) {
     let t = e.mapResult(this.pos, 1);
@@ -456,7 +456,7 @@ class N extends k {
   }
 }
 k.jsonID("addNodeMark", N);
-class R extends k {
+class I extends k {
   /**
   Create a mark-removing step.
   */
@@ -468,7 +468,7 @@ class R extends k {
     if (!t)
       return y.fail("No node at mark step's position");
     let r = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
-    return y.fromReplace(e, this.pos, this.pos + 1, new w(g.from(r), 0, t.isLeaf ? 0 : 1));
+    return y.fromReplace(e, this.pos, this.pos + 1, new g(w.from(r), 0, t.isLeaf ? 0 : 1));
   }
   invert(e) {
     let t = e.nodeAt(this.pos);
@@ -476,7 +476,7 @@ class R extends k {
   }
   map(e) {
     let t = e.mapResult(this.pos, 1);
-    return t.deletedAfter ? null : new R(t.pos, this.mark);
+    return t.deletedAfter ? null : new I(t.pos, this.mark);
   }
   toJSON() {
     return { stepType: "removeNodeMark", pos: this.pos, mark: this.mark.toJSON() };
@@ -487,10 +487,10 @@ class R extends k {
   static fromJSON(e, t) {
     if (typeof t.pos != "number")
       throw new RangeError("Invalid input for RemoveNodeMarkStep.fromJSON");
-    return new R(t.pos, e.markFromJSON(t.mark));
+    return new I(t.pos, e.markFromJSON(t.mark));
   }
 }
-k.jsonID("removeNodeMark", R);
+k.jsonID("removeNodeMark", I);
 class v extends k {
   /**
   The given `slice` should fit the 'gap' between `from` and
@@ -521,10 +521,10 @@ class v extends k {
     if (!(e instanceof v) || 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 ? w.empty : new w(this.slice.content.append(e.slice.content), this.slice.openStart, e.slice.openEnd);
+      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);
     } else if (e.to == this.from && !this.slice.openStart && !e.slice.openEnd) {
-      let t = this.slice.size + e.slice.size == 0 ? w.empty : new w(e.slice.content.append(this.slice.content), e.slice.openStart, this.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);
     } else
       return null;
@@ -539,7 +539,7 @@ 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, w.fromJSON(e, t.slice), !!t.structure);
+    return new v(t.from, t.to, g.fromJSON(e, t.slice), !!t.structure);
   }
 }
 k.jsonID("replace", v);
@@ -597,7 +597,7 @@ class M extends k {
   static fromJSON(e, t) {
     if (typeof t.from != "number" || typeof t.to != "number" || typeof t.gapFrom != "number" || typeof t.gapTo != "number" || typeof t.insert != "number")
       throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON");
-    return new M(t.from, t.to, t.gapFrom, t.gapTo, w.fromJSON(e, t.slice), t.insert, !!t.structure);
+    return new M(t.from, t.to, t.gapFrom, t.gapTo, g.fromJSON(e, t.slice), t.insert, !!t.structure);
   }
 }
 k.jsonID("replaceAround", M);
@@ -659,7 +659,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, w.empty));
+      o.push(new v(l, p, g.empty));
     else {
       r = c;
       for (let f = 0; f < h.marks.length; f++)
@@ -667,14 +667,14 @@ 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 w(g.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 v(l + f.index, l + f.index + f[0].length, u));
       }
     }
     l = p;
   }
   if (!r.validEnd) {
-    let a = r.fillBefore(g.empty, !0);
-    s.replace(l, l, new w(a, 0, 0));
+    let a = r.fillBefore(w.empty, !0);
+    s.replace(l, l, new g(a, 0, 0));
   }
   for (let a = o.length - 1; a >= 0; a--)
     s.step(o[a]);
@@ -684,23 +684,24 @@ function ce(s, e, t) {
 }
 function Fe(s) {
   let t = s.parent.content.cutByIndex(s.startIndex, s.endIndex);
-  for (let r = s.depth; ; --r) {
-    let n = s.$from.node(r), i = s.$from.index(r), o = s.$to.indexAfter(r);
-    if (r < s.depth && n.canReplace(i, o, t))
+  for (let r = s.depth, n = 0, i = 0; ; --r) {
+    let o = s.$from.node(r), l = s.$from.index(r) + n, a = s.$to.indexAfter(r) - i;
+    if (r < s.depth && o.canReplace(l, a, t))
       return r;
-    if (r == 0 || n.type.spec.isolating || !ce(n, i, o))
+    if (r == 0 || o.type.spec.isolating || !ce(o, l, a))
       break;
+    l && (n = 1), a < o.childCount && (i = 1);
   }
   return null;
 }
 function de(s, e, t) {
-  let { $from: r, $to: n, depth: i } = e, o = r.before(i + 1), l = n.after(i + 1), a = o, h = l, p = g.empty, c = 0;
+  let { $from: r, $to: n, depth: i } = e, o = r.before(i + 1), l = n.after(i + 1), a = o, h = l, p = w.empty, c = 0;
   for (let u = i, m = !1; u > t; u--)
-    m || r.index(u) > 0 ? (m = !0, p = g.from(r.node(u).copy(p)), c++) : a--;
-  let f = g.empty, d = 0;
+    m || r.index(u) > 0 ? (m = !0, p = w.from(r.node(u).copy(p)), c++) : a--;
+  let f = w.empty, d = 0;
   for (let u = i, m = !1; u > t; u--)
-    m || n.after(u + 1) < n.end(u) ? (m = !0, f = g.from(n.node(u).copy(f)), d++) : h++;
-  s.step(new M(a, h, o, l, new w(p.append(f), c, d), p.size - c, !0));
+    m || n.after(u + 1) < n.end(u) ? (m = !0, f = w.from(n.node(u).copy(f)), d++) : h++;
+  s.step(new M(a, h, o, l, new g(p.append(f), c, d), p.size - c, !0));
 }
 function ze(s, e, t = null, r = s) {
   let n = ue(s, e), i = n && me(r, e);
@@ -725,20 +726,20 @@ function me(s, e) {
     a = a.matchType(t.child(h).type);
   return !a || !a.validEnd ? null : o;
 }
-function we(s, e, t) {
-  let r = g.empty;
+function ge(s, e, t) {
+  let r = w.empty;
   for (let o = t.length - 1; o >= 0; o--) {
     if (r.size) {
       let l = t[o].type.contentMatch.matchFragment(r);
       if (!l || !l.validEnd)
         throw new RangeError("Wrapper type given to Transform.wrap does not form valid content of its parent wrapper");
     }
-    r = g.from(t[o].type.create(t[o].attrs, r));
+    r = w.from(t[o].type.create(t[o].attrs, r));
   }
   let n = e.start, i = e.end;
-  s.step(new M(n, i, n, i, new w(r, 0, 0), t.length, !0));
+  s.step(new M(n, i, n, i, new g(r, 0, 0), t.length, !0));
 }
-function ge(s, e, t, r, n) {
+function we(s, e, t, r, n) {
   if (!r.isTextblock)
     throw new RangeError("Type given to setBlockType should be a textblock");
   let i = s.steps.length;
@@ -752,7 +753,7 @@ function ge(s, e, t, r, n) {
       }
       h === !1 && _(s, o, l, i), $(s, s.mapping.slice(i).map(l, 1), r, void 0, h === null);
       let p = s.mapping.slice(i), c = p.map(l, 1), f = p.map(l + o.nodeSize, 1);
-      return s.step(new M(c, f, c + 1, f - 1, new w(g.from(r.create(a, null, o.marks)), 0, 0), 1, !0)), h === !0 && Z(s, o, l, i), !1;
+      return s.step(new M(c, f, c + 1, f - 1, new g(w.from(r.create(a, null, o.marks)), 0, 0), 1, !0)), h === !0 && Z(s, o, l, i), !1;
     }
   });
 }
@@ -790,7 +791,7 @@ function ke(s, e, t, r, n) {
     return s.replaceWith(e, e + i.nodeSize, o);
   if (!t.validContent(i.content))
     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 w(g.from(o), 0, 0), 1, !0));
+  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) {
   let n = s.resolve(e), i = n.depth - t, o = r && r[r.length - 1] || n.parent;
@@ -810,13 +811,13 @@ function Je(s, e, t = 1, r) {
   return n.node(i).canReplaceWith(l, l, a ? a.type : n.node(i + 1).type);
 }
 function ve(s, e, t = 1, r) {
-  let n = s.doc.resolve(e), i = g.empty, o = g.empty;
+  let n = s.doc.resolve(e), i = w.empty, o = w.empty;
   for (let l = n.depth, a = n.depth - t, h = t - 1; l > a; l--, h--) {
-    i = g.from(n.node(l).copy(i));
+    i = w.from(n.node(l).copy(i));
     let p = r && r[h];
-    o = g.from(p ? p.type.create(p.attrs, o) : n.node(l).copy(o));
+    o = w.from(p ? p.type.create(p.attrs, o) : n.node(l).copy(o));
   }
-  s.step(new v(e, e, new w(i.append(o), t, t), !0));
+  s.step(new v(e, e, new g(i.append(o), t, t), !0));
 }
 function Ae(s, e) {
   let t = s.resolve(e), r = t.index();
@@ -859,7 +860,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), w.empty, !0)), r === !0) {
+  if (s.step(new v(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);
   }
@@ -908,7 +909,7 @@ function We(s, e, t) {
     }
   return null;
 }
-function Me(s, e, t = e, r = w.empty) {
+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);
@@ -919,7 +920,7 @@ function ee(s, e, t) {
 }
 class Ce {
   constructor(e, t, r) {
-    this.$from = e, this.$to = t, this.unplaced = r, this.frontier = [], this.placed = g.empty;
+    this.$from = e, this.$to = t, this.unplaced = r, this.frontier = [], this.placed = w.empty;
     for (let n = 0; n <= e.depth; n++) {
       let i = e.node(n);
       this.frontier.push({
@@ -928,7 +929,7 @@ class Ce {
       });
     }
     for (let n = e.depth; n > 0; n--)
-      this.placed = g.from(e.node(n).copy(this.placed));
+      this.placed = w.from(e.node(n).copy(this.placed));
   }
   get depth() {
     return this.frontier.length - 1;
@@ -944,7 +945,7 @@ class Ce {
     let i = this.placed, o = r.depth, l = n.depth;
     for (; o && l && i.childCount == 1; )
       i = i.firstChild.content, o--, l--;
-    let a = new w(i, 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;
   }
   // Find a position on the start spine of `this.unplaced` that has
@@ -967,7 +968,7 @@ class Ce {
         let o = n.firstChild;
         for (let l = this.depth; l >= 0; l--) {
           let { type: a, match: h } = this.frontier[l], p, c = null;
-          if (t == 1 && (o ? h.matchType(o.type) || (c = h.fillBefore(g.from(o), !1)) : i && a.compatibleContent(i.type)))
+          if (t == 1 && (o ? h.matchType(o.type) || (c = h.fillBefore(w.from(o), !1)) : i && a.compatibleContent(i.type)))
             return { sliceDepth: r, frontierDepth: l, parent: i, inject: c };
           if (t == 2 && o && (p = h.findWrapping(o.type)))
             return { sliceDepth: r, frontierDepth: l, parent: i, wrap: p };
@@ -978,15 +979,15 @@ class Ce {
   }
   openMore() {
     let { content: e, openStart: t, openEnd: r } = this.unplaced, n = W(e, t);
-    return !n.childCount || n.firstChild.isLeaf ? !1 : (this.unplaced = new w(e, t + 1, Math.max(r, n.size + t >= e.size - r ? t + 1 : 0)), !0);
+    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);
     if (n.childCount <= 1 && t > 0) {
       let i = e.size - t <= t + n.size;
-      this.unplaced = new w(O(e, t - 1, 1), t - 1, i ? t - 1 : r);
+      this.unplaced = new g(O(e, t - 1, 1), t - 1, i ? t - 1 : r);
     } else
-      this.unplaced = new w(O(e, t, 1), t, r);
+      this.unplaced = new g(O(e, t, 1), t, r);
   }
   // Move content from the unplaced slice at `sliceDepth` to the
   // frontier node at `frontierDepth`. Close that frontier node when
@@ -1011,12 +1012,12 @@ class Ce {
       h++, (h > 1 || a == 0 || m.content.size) && (c = x, p.push(te(m.mark(f.allowedMarks(m.marks)), h == 1 ? a : 0, h == l.childCount ? d : -1)));
     }
     let u = h == l.childCount;
-    u || (d = -1), this.placed = F(this.placed, t, g.from(p)), this.frontier[t].match = c, u && d < 0 && r && r.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
+    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 I = x.lastChild;
-      this.frontier.push({ type: I.type, match: I.contentMatchAt(I.childCount) }), x = I.content;
+      let R = x.lastChild;
+      this.frontier.push({ type: R.type, match: R.contentMatchAt(R.childCount) }), x = R.content;
     }
-    this.unplaced = u ? e == 0 ? w.empty : new w(O(o.content, e - 1, 1), e - 1, d < 0 ? o.openEnd : e - 1) : new w(O(o.content, e, h), o.openStart, o.openEnd);
+    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);
   }
   mustMoveInline() {
     if (!this.$to.parent.isTextblock)
@@ -1057,10 +1058,10 @@ class Ce {
   }
   openFrontierNode(e, t = null, r) {
     let n = this.frontier[this.depth];
-    n.match = n.match.matchType(e), this.placed = F(this.placed, this.depth, g.from(e.create(t, r))), this.frontier.push({ type: e, match: e.contentMatch });
+    n.match = n.match.matchType(e), this.placed = F(this.placed, this.depth, w.from(e.create(t, r))), this.frontier.push({ type: e, match: e.contentMatch });
   }
   closeFrontierNode() {
-    let t = this.frontier.pop().match.fillBefore(g.empty, !0);
+    let t = this.frontier.pop().match.fillBefore(w.empty, !0);
     t.childCount && (this.placed = F(this.placed, this.frontier.length, t));
   }
 }
@@ -1079,7 +1080,7 @@ function te(s, e, t) {
   if (e <= 0)
     return s;
   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(g.empty, !0)))), s.copy(r);
+  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) {
   let i = s.node(e), o = n ? s.indexAfter(e) : s.index(e);
@@ -1094,16 +1095,16 @@ function Ne(s, e, t) {
       return !0;
   return !1;
 }
-function Ie(s) {
+function Re(s) {
   return s.spec.defining || s.spec.definingForContent;
 }
-function Re(s, e, t, r) {
+function Ie(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));
-  let o = ne(n, s.doc.resolve(t));
+  let o = ne(n, i);
   o[o.length - 1] == 0 && o.pop();
   let l = -(n.depth + 1);
   o.unshift(l);
@@ -1121,7 +1122,7 @@ function Re(s, e, t, r) {
     f = u.content;
   }
   for (let f = p - 1; f >= 0; f--) {
-    let d = h[f], u = Ie(d.type);
+    let d = h[f], u = Re(d.type);
     if (u && !d.sameMarkup(n.node(Math.abs(l) - 1)))
       p = f;
     else if (u || !d.type.isTextblock)
@@ -1131,11 +1132,11 @@ function Re(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], I = !0;
-        x < 0 && (I = !1, x = -x);
+        let x = o[(m + a) % o.length], R = !0;
+        x < 0 && (R = !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), I ? i.after(x) : t, new w(re(r.content, 0, r.openStart, d), d, r.openEnd));
+          return s.replace(n.before(x), R ? i.after(x) : t, new g(re(r.content, 0, r.openStart, d), d, r.openEnd));
       }
   }
   let c = s.steps.length;
@@ -1151,18 +1152,18 @@ function re(s, e, t, r, n) {
   }
   if (e > r) {
     let i = n.contentMatchAt(0), o = i.fillBefore(s).append(s);
-    s = o.append(i.matchFragment(o).fillBefore(g.empty, !0));
+    s = o.append(i.matchFragment(o).fillBefore(w.empty, !0));
   }
   return s;
 }
-function Te(s, e, t, r) {
+function Ee(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 w(g.from(r), 0, 0));
+  s.replaceRange(e, t, new g(w.from(r), 0, 0));
 }
-function Ee(s, e, t) {
+function Te(s, e, t) {
   let r = s.doc.resolve(e), n = s.doc.resolve(t), i = ne(r, n);
   for (let o = 0; o < i.length; o++) {
     let l = i[o], a = o == i.length - 1;
@@ -1186,7 +1187,7 @@ function ne(s, e) {
   }
   return t;
 }
-class T extends k {
+class E extends k {
   /**
   Construct an attribute step.
   */
@@ -1202,17 +1203,17 @@ class T extends k {
       r[i] = t.attrs[i];
     r[this.attr] = this.value;
     let n = t.type.create(r, null, t.marks);
-    return y.fromReplace(e, this.pos, this.pos + 1, new w(g.from(n), 0, t.isLeaf ? 0 : 1));
+    return y.fromReplace(e, this.pos, this.pos + 1, new g(w.from(n), 0, t.isLeaf ? 0 : 1));
   }
   getMap() {
     return S.empty;
   }
   invert(e) {
-    return new T(this.pos, this.attr, e.nodeAt(this.pos).attrs[this.attr]);
+    return new E(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 T(t.pos, this.attr, this.value);
+    return t.deletedAfter ? null : new E(t.pos, this.attr, this.value);
   }
   toJSON() {
     return { stepType: "attr", pos: this.pos, attr: this.attr, value: this.value };
@@ -1220,10 +1221,10 @@ class T 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 T(t.pos, t.attr, t.value);
+    return new E(t.pos, t.attr, t.value);
   }
 }
-k.jsonID("attr", T);
+k.jsonID("attr", E);
 class z extends k {
   /**
   Construct an attribute step.
@@ -1258,15 +1259,15 @@ class z extends k {
   }
 }
 k.jsonID("docAttr", z);
-let E = class extends Error {
+let T = class extends Error {
 };
-E = function s(e) {
+T = function s(e) {
   let t = Error.call(this, e);
   return t.__proto__ = s.prototype, t;
 };
-E.prototype = Object.create(Error.prototype);
-E.prototype.constructor = E;
-E.prototype.name = "TransformError";
+T.prototype = Object.create(Error.prototype);
+T.prototype.constructor = T;
+T.prototype.name = "TransformError";
 class De {
   /**
   Create a transform that starts with the given document.
@@ -1287,7 +1288,7 @@ class De {
   step(e) {
     let t = this.maybeStep(e);
     if (t.failed)
-      throw new E(t.failed);
+      throw new T(t.failed);
     return this;
   }
   /**
@@ -1306,6 +1307,22 @@ class De {
     return this.steps.length > 0;
   }
   /**
+  Return a single range, in post-transform document positions,
+  that covers all content changed by this transform. Returns null
+  if no replacements are made. Note that this will ignore changes
+  that add/remove marks without replacing the underlying content.
+  */
+  changedRange() {
+    let e = 1e9, t = -1e9;
+    for (let r = 0; r < this.mapping.maps.length; r++) {
+      let n = this.mapping.maps[r];
+      r && (e = n.map(e, 1), t = n.map(t, -1)), n.forEach((i, o, l, a) => {
+        e = Math.min(e, l), t = Math.max(t, a);
+      });
+    }
+    return e == 1e9 ? null : { from: e, to: t };
+  }
+  /**
   @internal
   */
   addStep(e, t) {
@@ -1315,7 +1332,7 @@ class De {
   Replace the part of the document between `from` and `to` with the
   given `slice`.
   */
-  replace(e, t = e, r = w.empty) {
+  replace(e, t = e, r = g.empty) {
     let n = Me(this.doc, e, t, r);
     return n && this.step(n), this;
   }
@@ -1324,13 +1341,13 @@ class De {
   fragment, node, or array of nodes.
   */
   replaceWith(e, t, r) {
-    return this.replace(e, t, new w(g.from(r), 0, 0));
+    return this.replace(e, t, new g(w.from(r), 0, 0));
   }
   /**
   Delete the content between the given positions.
   */
   delete(e, t) {
-    return this.replace(e, t, w.empty);
+    return this.replace(e, t, g.empty);
   }
   /**
   Insert the given content at the given position.
@@ -1358,7 +1375,7 @@ class De {
   control over what happens.
   */
   replaceRange(e, t, r) {
-    return Re(this, e, t, r), this;
+    return Ie(this, e, t, r), this;
   }
   /**
   Replace the given range with a node, but use `from` and `to` as
@@ -1370,14 +1387,14 @@ class De {
   that parent node.
   */
   replaceRangeWith(e, t, r) {
-    return Te(this, e, t, r), this;
+    return Ee(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 Ee(this, e, t), this;
+    return Te(this, e, t), this;
   }
   /**
   Split the content in the given range off from its parent, if there
@@ -1402,14 +1419,14 @@ class De {
   probably be computed with [`findWrapping`](https://prosemirror.net/docs/ref/#transform.findWrapping).
   */
   wrap(e, t) {
-    return we(this, e, t), this;
+    return ge(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, n = null) {
-    return ge(this, e, t, r, n), this;
+    return we(this, e, t, r, n), this;
   }
   /**
   Change the type, attributes, and/or marks of the node at `pos`.
@@ -1424,7 +1441,7 @@ class De {
   to set attributes on the document itself.
   */
   setNodeAttribute(e, t, r) {
-    return this.step(new T(e, t, r)), this;
+    return this.step(new E(e, t, r)), this;
   }
   /**
   Set a single attribute on the document to a new value.
@@ -1447,11 +1464,11 @@ class De {
     if (!r)
       throw new RangeError("No node at position " + e);
     if (t instanceof se)
-      t.isInSet(r.marks) && this.step(new R(e, t));
+      t.isInSet(r.marks) && this.step(new I(e, t));
     else {
       let n = r.marks, i, o = [];
       for (; i = t.isInSet(n); )
-        o.push(new R(e, i)), n = i.removeFromSet(n);
+        o.push(new I(e, i)), n = i.removeFromSet(n);
       for (let l = o.length - 1; l >= 0; l--)
         this.step(o[l]);
     }
@@ -1496,12 +1513,13 @@ export {
   A as M,
   v as R,
   De as T,
-  Je as a,
-  M as b,
-  Ae as c,
+  M as a,
+  Ae as b,
+  Je as c,
   We as d,
   ze as f,
   Be as j,
   Fe as l,
   Me as r
 };
+//# sourceMappingURL=index.es.js.map