@box/threaded-annotations 2.1.11 → 3.0.0

package/dist/chunks/dist.js

@@ -1,54 +1,61 @@
-function e(t, n, r) {
-	for (let i = 0;; i++) {
-		if (i == t.childCount || i == n.childCount) return t.childCount == n.childCount ? null : r;
-		let a = t.child(i), o = n.child(i);
-		if (a == o) {
-			r += a.nodeSize;
+function e(t, i, a) {
+	for (let o = 0;; o++) {
+		if (o == t.childCount || o == i.childCount) return t.childCount == i.childCount ? null : a;
+		let s = t.child(o), c = i.child(o);
+		if (s == c) {
+			a += s.nodeSize;
 			continue;
 		}
-		if (!a.sameMarkup(o)) return r;
-		if (a.isText && a.text != o.text) {
-			for (let e = 0; a.text[e] == o.text[e]; e++) r++;
-			return r;
+		if (!s.sameMarkup(c)) return a;
+		if (s.isText && s.text != c.text) {
+			let e = s.text, t = c.text, i = 0;
+			for (; e[i] == t[i]; i++) a++;
+			return i && i < e.length && i < t.length && r(e.charCodeAt(i - 1)) && n(e.charCodeAt(i)) && a--, a;
 		}
-		if (a.content.size || o.content.size) {
-			let t = e(a.content, o.content, r + 1);
+		if (s.content.size || c.content.size) {
+			let t = e(s.content, c.content, a + 1);
 			if (t != null) return t;
 		}
-		r += a.nodeSize;
+		a += s.nodeSize;
 	}
 }
-function t(e, n, r, i) {
-	for (let a = e.childCount, o = n.childCount;;) {
-		if (a == 0 || o == 0) return a == o ? null : {
-			a: r,
-			b: i
+function t(e, i, a, o) {
+	for (let s = e.childCount, c = i.childCount;;) {
+		if (s == 0 || c == 0) return s == c ? null : {
+			a,
+			b: o
 		};
-		let s = e.child(--a), c = n.child(--o), l = s.nodeSize;
-		if (s == c) {
-			r -= l, i -= l;
+		let l = e.child(--s), u = i.child(--c), d = l.nodeSize;
+		if (l == u) {
+			a -= d, o -= d;
 			continue;
 		}
-		if (!s.sameMarkup(c)) return {
-			a: r,
-			b: i
+		if (!l.sameMarkup(u)) return {
+			a,
+			b: o
 		};
-		if (s.isText && s.text != c.text) {
-			let e = 0, t = Math.min(s.text.length, c.text.length);
-			for (; e < t && s.text[s.text.length - e - 1] == c.text[c.text.length - e - 1];) e++, r--, i--;
-			return {
-				a: r,
-				b: i
+		if (l.isText && l.text != u.text) {
+			let e = l.text, t = u.text, i = e.length, s = t.length;
+			for (; i > 0 && s > 0 && e[i - 1] == t[s - 1];) i--, s--, a--, o--;
+			return i && s && i < e.length && r(e.charCodeAt(i - 1)) && n(e.charCodeAt(i)) && (a++, o++), {
+				a,
+				b: o
 			};
 		}
-		if (s.content.size || c.content.size) {
-			let e = t(s.content, c.content, r - 1, i - 1);
+		if (l.content.size || u.content.size) {
+			let e = t(l.content, u.content, a - 1, o - 1);
 			if (e) return e;
 		}
-		r -= l, i -= l;
+		a -= d, o -= d;
 	}
 }
-var n = class n {
+function n(e) {
+	return e >= 56320 && e < 57344;
+}
+function r(e) {
+	return e >= 55296 && e < 56320;
+}
+var i = class n {
 	constructor(e, t) {
 		if (this.content = e, this.size = t || 0, t == null) for (let t = 0; t < e.length; t++) this.size += e[t].nodeSize;
 	}
@@ -138,13 +145,13 @@ var n = class n {
 		return t(this, e, n, r);
 	}
 	findIndex(e) {
-		if (e == 0) return i(0, e);
-		if (e == this.size) return i(this.content.length, e);
+		if (e == 0) return o(0, e);
+		if (e == this.size) return o(this.content.length, e);
 		if (e > this.size || e < 0) throw RangeError(`Position ${e} outside of fragment (${this})`);
 		for (let t = 0, n = 0;; t++) {
-			let r = this.child(t), a = n + r.nodeSize;
-			if (a >= e) return a == e ? i(t + 1, a) : i(t, n);
-			n = a;
+			let r = this.child(t), i = n + r.nodeSize;
+			if (i >= e) return i == e ? o(t + 1, i) : o(t, n);
+			n = i;
 		}
 	}
 	toString() {
@@ -159,7 +166,7 @@ var n = class n {
 	static fromJSON(e, t) {
 		if (!t) return n.empty;
 		if (!Array.isArray(t)) throw RangeError("Invalid input for Fragment.fromJSON");
-		return new n(t.map(e.nodeFromJSON));
+		return n.fromArray(t.map(e.nodeFromJSON));
 	}
 	static fromArray(e) {
 		if (!e.length) return n.empty;
@@ -178,29 +185,29 @@ var n = class n {
 		throw RangeError("Can not convert " + e + " to a Fragment" + (e.nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""));
 	}
 };
-n.empty = new n([], 0);
-var r = {
+i.empty = new i([], 0);
+var a = {
 	index: 0,
 	offset: 0
 };
-function i(e, t) {
-	return r.index = e, r.offset = t, r;
+function o(e, t) {
+	return a.index = e, a.offset = t, a;
 }
-function a(e, t) {
+function s(e, t) {
 	if (e === t) return !0;
 	if (!(e && typeof e == "object") || !(t && typeof t == "object")) return !1;
 	let n = Array.isArray(e);
 	if (Array.isArray(t) != n) return !1;
 	if (n) {
 		if (e.length != t.length) return !1;
-		for (let n = 0; n < e.length; n++) if (!a(e[n], t[n])) return !1;
+		for (let n = 0; n < e.length; n++) if (!s(e[n], t[n])) return !1;
 	} else {
-		for (let n in e) if (!(n in t) || !a(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !s(e[n], t[n])) return !1;
 		for (let n in t) if (!(n in e)) return !1;
 	}
 	return !0;
 }
-var o = class e {
+var c = class e {
 	constructor(e, t) {
 		this.type = e, this.attrs = t;
 	}
@@ -224,7 +231,7 @@ var o = class e {
 		return !1;
 	}
 	eq(e) {
-		return this == e || this.type == e.type && a(this.attrs, e.attrs);
+		return this == e || this.type == e.type && s(this.attrs, e.attrs);
 	}
 	toJSON() {
 		let e = { type: this.type.name };
@@ -254,8 +261,8 @@ var o = class e {
 		return n.sort((e, t) => e.type.rank - t.type.rank), n;
 	}
 };
-o.none = [];
-var s = class extends Error {}, c = class e {
+c.none = [];
+var l = class extends Error {}, u = class e {
 	constructor(e, t, n) {
 		this.content = e, this.openStart = t, this.openEnd = n;
 	}
@@ -263,11 +270,11 @@ var s = class extends Error {}, c = class e {
 		return this.content.size - this.openStart - this.openEnd;
 	}
 	insertAt(t, n) {
-		let r = u(this.content, t + this.openStart, n);
+		let r = f(this.content, t + this.openStart, n, this.openStart + 1, this.openEnd + 1);
 		return r && new e(r, this.openStart, this.openEnd);
 	}
 	removeBetween(t, n) {
-		return new e(l(this.content, t + this.openStart, n + this.openStart), this.openStart, this.openEnd);
+		return new e(d(this.content, t + this.openStart, n + this.openStart), this.openStart, this.openEnd);
 	}
 	eq(e) {
 		return this.content.eq(e.content) && this.openStart == e.openStart && this.openEnd == e.openEnd;
@@ -280,11 +287,11 @@ var s = class extends Error {}, c = class e {
 		let e = { content: this.content.toJSON() };
 		return this.openStart > 0 && (e.openStart = this.openStart), this.openEnd > 0 && (e.openEnd = this.openEnd), e;
 	}
-	static fromJSON(t, r) {
-		if (!r) return e.empty;
-		let i = r.openStart || 0, a = r.openEnd || 0;
-		if (typeof i != "number" || typeof a != "number") throw RangeError("Invalid input for Slice.fromJSON");
-		return new e(n.fromJSON(t, r.content), i, a);
+	static fromJSON(t, n) {
+		if (!n) return e.empty;
+		let r = n.openStart || 0, a = n.openEnd || 0;
+		if (typeof r != "number" || typeof a != "number") throw RangeError("Invalid input for Slice.fromJSON");
+		return new e(i.fromJSON(t, n.content), r, a);
 	}
 	static maxOpen(t, n = !0) {
 		let r = 0, i = 0;
@@ -293,78 +300,79 @@ var s = class extends Error {}, c = class e {
 		return new e(t, r, i);
 	}
 };
-c.empty = new c(n.empty, 0, 0);
-function l(e, t, n) {
+u.empty = new u(i.empty, 0, 0);
+function d(e, t, n) {
 	let { index: r, offset: i } = e.findIndex(t), a = e.maybeChild(r), { index: o, offset: s } = e.findIndex(n);
 	if (i == t || a.isText) {
 		if (s != n && !e.child(o).isText) throw RangeError("Removing non-flat range");
 		return e.cut(0, t).append(e.cut(n));
 	}
 	if (r != o) throw RangeError("Removing non-flat range");
-	return e.replaceChild(r, a.copy(l(a.content, t - i - 1, n - i - 1)));
+	return e.replaceChild(r, a.copy(d(a.content, t - i - 1, n - i - 1)));
 }
-function u(e, t, n, r) {
-	let { index: i, offset: a } = e.findIndex(t), o = e.maybeChild(i);
-	if (a == t || o.isText) return r && !r.canReplace(i, i, n) ? null : e.cut(0, t).append(n).append(e.cut(t));
-	let s = u(o.content, t - a - 1, n, o);
-	return s && e.replaceChild(i, o.copy(s));
+function f(e, t, n, r, i, a) {
+	let { index: o, offset: s } = e.findIndex(t), c = e.maybeChild(o);
+	if (s == t || c.isText) return a && r <= 0 && i <= 0 && !a.canReplace(o, o, n) ? null : e.cut(0, t).append(n).append(e.cut(t));
+	let l = f(c.content, t - s - 1, n, o == 0 ? r - 1 : 0, o == e.childCount - 1 ? i - 1 : 0, c);
+	return l && e.replaceChild(o, c.copy(l));
 }
-function d(e, t, n) {
-	if (n.openStart > e.depth) throw new s("Inserted content deeper than insertion position");
-	if (e.depth - n.openStart != t.depth - n.openEnd) throw new s("Inconsistent open depths");
-	return f(e, t, n, 0);
+function ee(e, t, n) {
+	if (n.openStart > e.depth) throw new l("Inserted content deeper than insertion position");
+	if (e.depth - n.openStart != t.depth - n.openEnd) throw new l("Inconsistent open depths");
+	return p(e, t, n, 0);
 }
-function f(e, t, n, r) {
+function p(e, t, n, r) {
 	let i = e.index(r), a = e.node(r);
 	if (i == t.index(r) && r < e.depth - n.openStart) {
-		let o = f(e, t, n, r + 1);
+		let o = p(e, t, n, r + 1);
 		return a.copy(a.content.replaceChild(i, o));
-	} else if (!n.content.size) return g(a, v(e, t, r));
+	} else if (!n.content.size) return v(a, y(e, t, r));
 	else if (!n.openStart && !n.openEnd && e.depth == r && t.depth == r) {
 		let r = e.parent, i = r.content;
-		return g(r, i.cut(0, e.parentOffset).append(n.content).append(i.cut(t.parentOffset)));
+		return v(r, i.cut(0, e.parentOffset).append(n.content).append(i.cut(t.parentOffset)));
 	} else {
-		let { start: i, end: o } = te(n, e);
-		return g(a, _(e, i, o, t, r));
+		let { start: i, end: o } = ne(n, e);
+		return v(a, te(e, i, o, t, r));
 	}
 }
-function ee(e, t) {
-	if (!t.type.compatibleContent(e.type)) throw new s("Cannot join " + t.type.name + " onto " + e.type.name);
+function m(e, t) {
+	if (!t.type.compatibleContent(e.type)) throw new l("Cannot join " + t.type.name + " onto " + e.type.name);
 }
-function p(e, t, n) {
+function h(e, t, n) {
 	let r = e.node(n);
-	return ee(r, t.node(n)), r;
+	return m(r, t.node(n)), r;
 }
-function m(e, t) {
+function g(e, t) {
 	let n = t.length - 1;
 	n >= 0 && e.isText && e.sameMarkup(t[n]) ? t[n] = e.withText(t[n].text + e.text) : t.push(e);
 }
-function h(e, t, n, r) {
+function _(e, t, n, r) {
 	let i = (t || e).node(n), a = 0, o = t ? t.index(n) : i.childCount;
-	e && (a = e.index(n), e.depth > n ? a++ : e.textOffset && (m(e.nodeAfter, r), a++));
-	for (let e = a; e < o; e++) m(i.child(e), r);
-	t && t.depth == n && t.textOffset && m(t.nodeBefore, r);
+	e && (a = e.index(n), e.depth > n ? a++ : e.textOffset && (g(e.nodeAfter, r), a++));
+	for (let e = a; e < o; e++) g(i.child(e), r);
+	t && t.depth == n && t.textOffset && g(t.nodeBefore, r);
 }
-function g(e, t) {
-	return e.type.checkContent(t), e.copy(t);
+function v(e, t) {
+	if (!e.type.validContent(t)) throw new l("Invalid content for node " + e.type.name);
+	return e.copy(t);
 }
-function _(e, t, r, i, a) {
-	let o = e.depth > a && p(e, t, a + 1), s = i.depth > a && p(r, i, a + 1), c = [];
-	return h(null, e, a, c), o && s && t.index(a) == r.index(a) ? (ee(o, s), m(g(o, _(e, t, r, i, a + 1)), c)) : (o && m(g(o, v(e, t, a + 1)), c), h(t, r, a, c), s && m(g(s, v(r, i, a + 1)), c)), h(i, null, a, c), new n(c);
+function te(e, t, n, r, a) {
+	let o = e.depth > a && h(e, t, a + 1), s = r.depth > a && h(n, r, a + 1), c = [];
+	return _(null, e, a, c), o && s && t.index(a) == n.index(a) ? (m(o, s), g(v(o, te(e, t, n, r, a + 1)), c)) : (o && g(v(o, y(e, t, a + 1)), c), _(t, n, a, c), s && g(v(s, y(n, r, a + 1)), c)), _(r, null, a, c), new i(c);
 }
-function v(e, t, r) {
-	let i = [];
-	return h(null, e, r, i), e.depth > r && m(g(p(e, t, r + 1), v(e, t, r + 1)), i), h(t, null, r, i), new n(i);
+function y(e, t, n) {
+	let r = [];
+	return _(null, e, n, r), e.depth > n && g(v(h(e, t, n + 1), y(e, t, n + 1)), r), _(t, null, n, r), new i(r);
 }
-function te(e, t) {
-	let r = t.depth - e.openStart, i = t.node(r).copy(e.content);
-	for (let e = r - 1; e >= 0; e--) i = t.node(e).copy(n.from(i));
+function ne(e, t) {
+	let n = t.depth - e.openStart, r = t.node(n).copy(e.content);
+	for (let e = n - 1; e >= 0; e--) r = t.node(e).copy(i.from(r));
 	return {
-		start: i.resolveNoCache(e.openStart + r),
-		end: i.resolveNoCache(i.content.size - e.openEnd - r)
+		start: r.resolveNoCache(e.openStart + n),
+		end: r.resolveNoCache(r.content.size - e.openEnd - n)
 	};
 }
-var y = class e {
+var b = class e {
 	constructor(e, t, n) {
 		this.pos = e, this.path = t, this.parentOffset = n, this.depth = t.length / 3 - 1;
 	}
@@ -421,7 +429,7 @@ var y = class e {
 	}
 	marks() {
 		let e = this.parent, t = this.index();
-		if (e.content.size == 0) return o.none;
+		if (e.content.size == 0) return c.none;
 		if (this.textOffset) return e.child(t).marks;
 		let n = e.maybeChild(t - 1), r = e.maybeChild(t);
 		if (!n) {
@@ -445,7 +453,7 @@ var y = class e {
 	}
 	blockRange(e = this, t) {
 		if (e.pos < this.pos) return e.blockRange(this);
-		for (let n = this.depth - (this.parent.inlineContent || this.pos == e.pos ? 1 : 0); n >= 0; n--) if (e.pos <= this.end(n) && (!t || t(this.node(n)))) return new ie(this, e, n);
+		for (let n = this.depth - (this.parent.inlineContent || this.pos == e.pos ? 1 : 0); n >= 0; n--) if (e.pos <= this.end(n) && (!t || t(this.node(n)))) return new ae(this, e, n);
 		return null;
 	}
 	sameParent(e) {
@@ -473,20 +481,20 @@ var y = class e {
 		return new e(n, r, a);
 	}
 	static resolveCached(t, n) {
-		let r = b.get(t);
+		let r = x.get(t);
 		if (r) for (let e = 0; e < r.elts.length; e++) {
 			let t = r.elts[e];
 			if (t.pos == n) return t;
 		}
-		else b.set(t, r = new ne());
+		else x.set(t, r = new re());
 		let i = r.elts[r.i] = e.resolve(t, n);
-		return r.i = (r.i + 1) % re, i;
+		return r.i = (r.i + 1) % ie, i;
 	}
-}, ne = class {
+}, re = class {
 	constructor() {
 		this.elts = [], this.i = 0;
 	}
-}, re = 12, b = /* @__PURE__ */ new WeakMap(), ie = class {
+}, ie = 12, x = /* @__PURE__ */ new WeakMap(), ae = class {
 	constructor(e, t, n) {
 		this.$from = e, this.$to = t, this.depth = n;
 	}
@@ -505,9 +513,9 @@ var y = class e {
 	get endIndex() {
 		return this.$to.indexAfter(this.depth);
 	}
-}, ae = Object.create(null), oe = class e {
-	constructor(e, t, r, i = o.none) {
-		this.type = e, this.attrs = t, this.marks = i, this.content = r || n.empty;
+}, oe = Object.create(null), se = class e {
+	constructor(e, t, n, r = c.none) {
+		this.type = e, this.attrs = t, this.marks = r, this.content = n || i.empty;
 	}
 	get children() {
 		return this.content.content;
@@ -552,7 +560,7 @@ var y = class e {
 		return this.hasMarkup(e.type, e.attrs, e.marks);
 	}
 	hasMarkup(e, t, n) {
-		return this.type == e && a(this.attrs, t || e.defaultAttrs || ae) && o.sameSet(this.marks, n || o.none);
+		return this.type == e && s(this.attrs, t || e.defaultAttrs || oe) && c.sameSet(this.marks, n || c.none);
 	}
 	copy(t = null) {
 		return t == this.content ? this : new e(this.type, this.attrs, t, this.marks);
@@ -564,12 +572,12 @@ var y = class e {
 		return e == 0 && t == this.content.size ? this : this.copy(this.content.cut(e, t));
 	}
 	slice(e, t = this.content.size, n = !1) {
-		if (e == t) return c.empty;
+		if (e == t) return u.empty;
 		let r = this.resolve(e), i = this.resolve(t), a = n ? 0 : r.sharedDepth(t), o = r.start(a);
-		return new c(r.node(a).content.cut(r.pos - o, i.pos - o), r.depth - a, i.depth - a);
+		return new u(r.node(a).content.cut(r.pos - o, i.pos - o), r.depth - a, i.depth - a);
 	}
 	replace(e, t, n) {
-		return d(this.resolve(e), this.resolve(t), n);
+		return ee(this.resolve(e), this.resolve(t), n);
 	}
 	nodeAt(e) {
 		for (let t = this;;) {
@@ -607,10 +615,10 @@ var y = class e {
 		};
 	}
 	resolve(e) {
-		return y.resolveCached(this, e);
+		return b.resolveCached(this, e);
 	}
 	resolveNoCache(e) {
-		return y.resolve(this, e);
+		return b.resolve(this, e);
 	}
 	rangeHasMark(e, t, n) {
 		let r = !1;
@@ -640,17 +648,17 @@ var y = class e {
 	toString() {
 		if (this.type.spec.toDebugString) return this.type.spec.toDebugString(this);
 		let e = this.type.name;
-		return this.content.size && (e += "(" + this.content.toStringInner() + ")"), se(this.marks, e);
+		return this.content.size && (e += "(" + this.content.toStringInner() + ")"), ce(this.marks, e);
 	}
 	contentMatchAt(e) {
 		let t = this.type.contentMatch.matchFragment(this.content, 0, e);
 		if (!t) throw Error("Called contentMatchAt on a node with invalid content");
 		return t;
 	}
-	canReplace(e, t, r = n.empty, i = 0, a = r.childCount) {
-		let o = this.contentMatchAt(e).matchFragment(r, i, a), s = o && o.matchFragment(this.content, t);
+	canReplace(e, t, n = i.empty, r = 0, a = n.childCount) {
+		let o = this.contentMatchAt(e).matchFragment(n, r, a), s = o && o.matchFragment(this.content, t);
 		if (!s || !s.validEnd) return !1;
-		for (let e = i; e < a; e++) if (!this.type.allowsMarks(r.child(e).marks)) return !1;
+		for (let e = r; e < a; e++) if (!this.type.allowsMarks(n.child(e).marks)) return !1;
 		return !0;
 	}
 	canReplaceWith(e, t, n, r) {
@@ -663,12 +671,12 @@ var y = class e {
 	}
 	check() {
 		this.type.checkContent(this.content), this.type.checkAttrs(this.attrs);
-		let e = o.none;
+		let e = c.none;
 		for (let t = 0; t < this.marks.length; t++) {
 			let n = this.marks[t];
 			n.type.checkAttrs(n.attrs), e = n.addToSet(e);
 		}
-		if (!o.sameSet(e, this.marks)) throw RangeError(`Invalid collection of marks for node ${this.type.name}: ${this.marks.map((e) => e.type.name)}`);
+		if (!c.sameSet(e, this.marks)) throw RangeError(`Invalid collection of marks for node ${this.type.name}: ${this.marks.map((e) => e.type.name)}`);
 		this.content.forEach((e) => e.check());
 	}
 	toJSON() {
@@ -681,32 +689,32 @@ var y = class e {
 	}
 	static fromJSON(e, t) {
 		if (!t) throw RangeError("Invalid input for Node.fromJSON");
-		let r;
+		let n;
 		if (t.marks) {
 			if (!Array.isArray(t.marks)) throw RangeError("Invalid mark data for Node.fromJSON");
-			r = t.marks.map(e.markFromJSON);
+			n = t.marks.map(e.markFromJSON);
 		}
 		if (t.type == "text") {
 			if (typeof t.text != "string") throw RangeError("Invalid text node in JSON");
-			return e.text(t.text, r);
+			return e.text(t.text, n);
 		}
-		let i = n.fromJSON(e, t.content), a = e.nodeType(t.type).create(t.attrs, i, r);
+		let r = i.fromJSON(e, t.content), a = e.nodeType(t.type).create(t.attrs, r, n);
 		return a.type.checkAttrs(a.attrs), a;
 	}
 };
-oe.prototype.text = void 0;
-function se(e, t) {
+se.prototype.text = void 0;
+function ce(e, t) {
 	for (let n = e.length - 1; n >= 0; n--) t = e[n].type.name + "(" + t + ")";
 	return t;
 }
-var x = class e {
+var S = class e {
 	constructor(e) {
 		this.validEnd = e, this.next = [], this.wrapCache = [];
 	}
 	static parse(t, n) {
-		let r = new ce(t, n);
+		let r = new le(t, n);
 		if (r.next == null) return e.empty;
-		let i = le(r);
+		let i = ue(r);
 		r.next && r.err("Unexpected trailing text");
 		let a = _e(ge(i));
 		return ve(a, r), a;
@@ -734,15 +742,15 @@ var x = class e {
 		for (let t = 0; t < this.next.length; t++) for (let n = 0; n < e.next.length; n++) if (this.next[t].type == e.next[n].type) return !0;
 		return !1;
 	}
-	fillBefore(e, t = !1, r = 0) {
-		let i = [this];
+	fillBefore(e, t = !1, n = 0) {
+		let r = [this];
 		function a(o, s) {
-			let c = o.matchFragment(e, r);
-			if (c && (!t || c.validEnd)) return n.from(s.map((e) => e.createAndFill()));
+			let c = o.matchFragment(e, n);
+			if (c && (!t || c.validEnd)) return i.from(s.map((e) => e.createAndFill()));
 			for (let e = 0; e < o.next.length; e++) {
 				let { type: t, next: n } = o.next[e];
-				if (!(t.isText || t.hasRequiredAttrs()) && i.indexOf(n) == -1) {
-					i.push(n);
+				if (!(t.isText || t.hasRequiredAttrs()) && r.indexOf(n) == -1) {
+					r.push(n);
 					let e = a(n, s.concat(t));
 					if (e) return e;
 				}
@@ -800,8 +808,8 @@ var x = class e {
 		}).join("\n");
 	}
 };
-x.empty = new x(!0);
-var ce = class {
+S.empty = new S(!0);
+var le = class {
 	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();
 	}
@@ -815,27 +823,27 @@ var ce = class {
 		throw SyntaxError(e + " (in content expression '" + this.string + "')");
 	}
 };
-function le(e) {
+function ue(e) {
 	let t = [];
 	do
-		t.push(ue(e));
+		t.push(de(e));
 	while (e.eat("|"));
 	return t.length == 1 ? t[0] : {
 		type: "choice",
 		exprs: t
 	};
 }
-function ue(e) {
+function de(e) {
 	let t = [];
 	do
-		t.push(de(e));
+		t.push(fe(e));
 	while (e.next && e.next != ")" && e.next != "|");
 	return t.length == 1 ? t[0] : {
 		type: "seq",
 		exprs: t
 	};
 }
-function de(e) {
+function fe(e) {
 	let t = he(e);
 	for (;;) if (e.eat("+")) t = {
 		type: "plus",
@@ -853,14 +861,14 @@ function de(e) {
 	else break;
 	return t;
 }
-function fe(e) {
+function C(e) {
 	/\D/.test(e.next) && e.err("Expected number, got '" + e.next + "'");
 	let t = Number(e.next);
 	return e.pos++, t;
 }
 function pe(e, t) {
-	let n = fe(e), r = n;
-	return e.eat(",") && (r = e.next == "}" ? -1 : fe(e)), e.eat("}") || e.err("Unclosed braced range"), {
+	let n = C(e), r = n;
+	return e.eat(",") && (r = e.next == "}" ? -1 : C(e)), e.eat("}") || e.err("Unclosed braced range"), {
 		type: "range",
 		min: n,
 		max: r,
@@ -879,7 +887,7 @@ function me(e, t) {
 }
 function he(e) {
 	if (e.eat("(")) {
-		let t = le(e);
+		let t = ue(e);
 		return e.eat(")") || e.err("Missing closing paren"), t;
 	} else if (/\W/.test(e.next)) e.err("Unexpected token '" + e.next + "'");
 	else {
@@ -939,12 +947,12 @@ function ge(e) {
 		else throw Error("Unknown expr type");
 	}
 }
-function S(e, t) {
+function w(e, t) {
 	return t - e;
 }
-function C(e, t) {
+function T(e, t) {
 	let n = [];
-	return r(t), n.sort(S);
+	return r(t), n.sort(w);
 	function r(t) {
 		let i = e[t];
 		if (i.length == 1 && !i[0].term) return r(i[0].to);
@@ -957,7 +965,7 @@ function C(e, t) {
 }
 function _e(e) {
 	let t = Object.create(null);
-	return n(C(e, 0));
+	return n(T(e, 0));
 	function n(r) {
 		let i = [];
 		r.forEach((t) => {
@@ -965,14 +973,14 @@ function _e(e) {
 				if (!t) return;
 				let r;
 				for (let e = 0; e < i.length; e++) i[e][0] == t && (r = i[e][1]);
-				C(e, n).forEach((e) => {
+				T(e, n).forEach((e) => {
 					r || i.push([t, r = []]), r.indexOf(e) == -1 && r.push(e);
 				});
 			});
 		});
-		let a = t[r.join(",")] = new x(r.indexOf(e.length - 1) > -1);
+		let a = t[r.join(",")] = new S(r.indexOf(e.length - 1) > -1);
 		for (let e = 0; e < i.length; e++) {
-			let r = i[e][1].sort(S);
+			let r = i[e][1].sort(w);
 			a.next.push({
 				type: i[e][0],
 				next: t[r.join(",")] || n(r)
@@ -991,22 +999,22 @@ function ve(e, t) {
 		i && t.err("Only non-generatable nodes (" + a.join(", ") + ") in a required position (see https://prosemirror.net/docs/guide/#generatable)");
 	}
 }
-var w = 65535, T = 2 ** 16;
+var E = 65535, D = 2 ** 16;
 function ye(e, t) {
-	return e + t * T;
+	return e + t * D;
 }
-function E(e) {
-	return e & w;
+function O(e) {
+	return e & E;
 }
 function be(e) {
-	return (e - (e & w)) / T;
+	return (e - (e & E)) / D;
 }
-var xe = 1, Se = 2, D = 4, O = 8, k = class {
+var xe = 1, Se = 2, k = 4, A = 8, j = class {
 	constructor(e, t, n) {
 		this.pos = e, this.delInfo = t, this.recover = n;
 	}
 	get deleted() {
-		return (this.delInfo & O) > 0;
+		return (this.delInfo & A) > 0;
 	}
 	get deletedBefore() {
 		return (this.delInfo & 5) > 0;
@@ -1015,14 +1023,14 @@ var xe = 1, Se = 2, D = 4, O = 8, k = class {
 		return (this.delInfo & 6) > 0;
 	}
 	get deletedAcross() {
-		return (this.delInfo & D) > 0;
+		return (this.delInfo & k) > 0;
 	}
-}, A = class e {
+}, M = class e {
 	constructor(t, n = !1) {
 		if (this.ranges = t, this.inverted = n, !t.length && e.empty) return e.empty;
 	}
 	recover(e) {
-		let t = 0, n = E(e);
+		let t = 0, n = O(e);
 		if (!this.inverted) for (let e = 0; e < n; e++) t += this.ranges[e * 3 + 2] - this.ranges[e * 3 + 1];
 		return this.ranges[n * 3] + t + be(e);
 	}
@@ -1041,15 +1049,15 @@ var xe = 1, Se = 2, D = 4, O = 8, k = class {
 			if (e <= u) {
 				let i = c ? e == s ? -1 : e == u ? 1 : t : t, a = s + r + (i < 0 ? 0 : l);
 				if (n) return a;
-				let d = e == (t < 0 ? s : u) ? null : ye(o / 3, e - s), f = e == s ? Se : e == u ? xe : D;
-				return (t < 0 ? e != s : e != u) && (f |= O), new k(a, f, d);
+				let d = e == (t < 0 ? s : u) ? null : ye(o / 3, e - s), f = e == s ? Se : e == u ? xe : k;
+				return (t < 0 ? e != s : e != u) && (f |= A), new j(a, f, d);
 			}
 			r += l - c;
 		}
-		return n ? e + r : new k(e + r, 0, null);
+		return n ? e + r : new j(e + r, 0, null);
 	}
 	touches(e, t) {
-		let n = 0, r = E(t), i = this.inverted ? 2 : 1, a = this.inverted ? 1 : 2;
+		let n = 0, r = O(t), i = this.inverted ? 2 : 1, a = this.inverted ? 1 : 2;
 		for (let t = 0; t < this.ranges.length; t += 3) {
 			let o = this.ranges[t] - (this.inverted ? n : 0);
 			if (o > e) break;
@@ -1084,25 +1092,25 @@ var xe = 1, Se = 2, D = 4, O = 8, k = class {
 		]);
 	}
 };
-A.empty = new A([]);
-var j = Object.create(null), M = class {
+M.empty = new M([]);
+var N = Object.create(null), P = class {
 	getMap() {
-		return A.empty;
+		return M.empty;
 	}
 	merge(e) {
 		return null;
 	}
 	static fromJSON(e, t) {
 		if (!t || !t.stepType) throw RangeError("Invalid input for Step.fromJSON");
-		let n = j[t.stepType];
+		let n = N[t.stepType];
 		if (!n) throw RangeError(`No step type ${t.stepType} defined`);
 		return n.fromJSON(e, t);
 	}
 	static jsonID(e, t) {
-		if (e in j) throw RangeError("Duplicate use of step JSON ID " + e);
-		return j[e] = t, t.prototype.jsonID = e, t;
+		if (e in N) throw RangeError("Duplicate use of step JSON ID " + e);
+		return N[e] = t, t.prototype.jsonID = e, t;
 	}
-}, N = class e {
+}, F = class e {
 	constructor(e, t) {
 		this.doc = e, this.failed = t;
 	}
@@ -1116,29 +1124,29 @@ var j = Object.create(null), M = class {
 		try {
 			return e.ok(t.replace(n, r, i));
 		} catch (t) {
-			if (t instanceof s) return e.fail(t.message);
+			if (t instanceof l) return e.fail(t.message);
 			throw t;
 		}
 	}
 };
-function P(e, t, r) {
-	let i = [];
-	for (let n = 0; n < e.childCount; n++) {
-		let a = e.child(n);
-		a.content.size && (a = a.copy(P(a.content, t, a))), a.isInline && (a = t(a, r, n)), i.push(a);
+function I(e, t, n) {
+	let r = [];
+	for (let i = 0; i < e.childCount; i++) {
+		let a = e.child(i);
+		a.content.size && (a = a.copy(I(a.content, t, a))), a.isInline && (a = t(a, n, i)), r.push(a);
 	}
-	return n.fromArray(i);
+	return i.fromArray(r);
 }
-var F = class e extends M {
+var L = class e extends P {
 	constructor(e, t, n) {
 		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), r = n.node(n.sharedDepth(this.to)), i = new c(P(t.content, (e, t) => !e.isAtom || !t.type.allowsMarkType(this.mark.type) ? e : e.mark(this.mark.addToSet(e.marks)), r), t.openStart, t.openEnd);
-		return N.fromReplace(e, this.from, this.to, i);
+		let t = e.slice(this.from, this.to), n = e.resolve(this.from), r = n.node(n.sharedDepth(this.to)), i = new u(I(t.content, (e, t) => !e.isAtom || !t.type.allowsMarkType(this.mark.type) ? e : e.mark(this.mark.addToSet(e.marks)), r), t.openStart, t.openEnd);
+		return F.fromReplace(e, this.from, this.to, i);
 	}
 	invert() {
-		return new I(this.from, this.to, this.mark);
+		return new R(this.from, this.to, this.mark);
 	}
 	map(t) {
 		let n = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1);
@@ -1160,17 +1168,17 @@ var F = class e extends M {
 		return new e(n.from, n.to, t.markFromJSON(n.mark));
 	}
 };
-M.jsonID("addMark", F);
-var I = class e extends M {
+P.jsonID("addMark", L);
+var R = class e extends P {
 	constructor(e, t, n) {
 		super(), this.from = e, this.to = t, this.mark = n;
 	}
 	apply(e) {
-		let t = e.slice(this.from, this.to), n = new c(P(t.content, (e) => e.mark(this.mark.removeFromSet(e.marks)), e), t.openStart, t.openEnd);
-		return N.fromReplace(e, this.from, this.to, n);
+		let t = e.slice(this.from, this.to), n = new u(I(t.content, (e) => e.mark(this.mark.removeFromSet(e.marks)), e), t.openStart, t.openEnd);
+		return F.fromReplace(e, this.from, this.to, n);
 	}
 	invert() {
-		return new F(this.from, this.to, this.mark);
+		return new L(this.from, this.to, this.mark);
 	}
 	map(t) {
 		let n = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1);
@@ -1192,16 +1200,16 @@ var I = class e extends M {
 		return new e(n.from, n.to, t.markFromJSON(n.mark));
 	}
 };
-M.jsonID("removeMark", I);
-var L = class e extends M {
+P.jsonID("removeMark", R);
+var z = class e extends P {
 	constructor(e, t) {
 		super(), this.pos = e, this.mark = t;
 	}
 	apply(e) {
 		let t = e.nodeAt(this.pos);
-		if (!t) return N.fail("No node at mark step's position");
-		let r = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
-		return N.fromReplace(e, this.pos, this.pos + 1, new c(n.from(r), 0, +!t.isLeaf));
+		if (!t) return F.fail("No node at mark step's position");
+		let n = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
+		return F.fromReplace(e, this.pos, this.pos + 1, new u(i.from(n), 0, +!t.isLeaf));
 	}
 	invert(t) {
 		let n = t.nodeAt(this.pos);
@@ -1212,7 +1220,7 @@ var L = class e extends M {
 				return new e(this.pos, this.mark);
 			}
 		}
-		return new R(this.pos, this.mark);
+		return new B(this.pos, this.mark);
 	}
 	map(t) {
 		let n = t.mapResult(this.pos, 1);
@@ -1230,20 +1238,20 @@ var L = class e extends M {
 		return new e(n.pos, t.markFromJSON(n.mark));
 	}
 };
-M.jsonID("addNodeMark", L);
-var R = class e extends M {
+P.jsonID("addNodeMark", z);
+var B = class e extends P {
 	constructor(e, t) {
 		super(), this.pos = e, this.mark = t;
 	}
 	apply(e) {
 		let t = e.nodeAt(this.pos);
-		if (!t) return N.fail("No node at mark step's position");
-		let r = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
-		return N.fromReplace(e, this.pos, this.pos + 1, new c(n.from(r), 0, +!t.isLeaf));
+		if (!t) return F.fail("No node at mark step's position");
+		let n = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
+		return F.fromReplace(e, this.pos, this.pos + 1, new u(i.from(n), 0, +!t.isLeaf));
 	}
 	invert(e) {
 		let t = e.nodeAt(this.pos);
-		return !t || !this.mark.isInSet(t.marks) ? this : new L(this.pos, this.mark);
+		return !t || !this.mark.isInSet(t.marks) ? this : new z(this.pos, this.mark);
 	}
 	map(t) {
 		let n = t.mapResult(this.pos, 1);
@@ -1261,16 +1269,16 @@ var R = class e extends M {
 		return new e(n.pos, t.markFromJSON(n.mark));
 	}
 };
-M.jsonID("removeNodeMark", R);
-var z = class e extends M {
+P.jsonID("removeNodeMark", B);
+var V = class e extends P {
 	constructor(e, t, n, r = !1) {
 		super(), this.from = e, this.to = t, this.slice = n, this.structure = r;
 	}
 	apply(e) {
-		return this.structure && V(e, this.from, this.to) ? N.fail("Structure replace would overwrite content") : N.fromReplace(e, this.from, this.to, this.slice);
+		return this.structure && U(e, this.from, this.to) ? F.fail("Structure replace would overwrite content") : F.fromReplace(e, this.from, this.to, this.slice);
 	}
 	getMap() {
-		return new A([
+		return new M([
 			this.from,
 			this.to - this.from,
 			this.slice.size
@@ -1286,10 +1294,10 @@ var z = class e extends M {
 	merge(t) {
 		if (!(t instanceof e) || t.structure || this.structure) return null;
 		if (this.from + this.slice.size == t.from && !this.slice.openEnd && !t.slice.openStart) {
-			let n = this.slice.size + t.slice.size == 0 ? c.empty : new c(this.slice.content.append(t.slice.content), this.slice.openStart, t.slice.openEnd);
+			let n = this.slice.size + t.slice.size == 0 ? u.empty : new u(this.slice.content.append(t.slice.content), this.slice.openStart, t.slice.openEnd);
 			return new e(this.from, this.to + (t.to - t.from), n, this.structure);
 		} else if (t.to == this.from && !this.slice.openStart && !t.slice.openEnd) {
-			let n = this.slice.size + t.slice.size == 0 ? c.empty : new c(t.slice.content.append(this.slice.content), t.slice.openStart, this.slice.openEnd);
+			let n = this.slice.size + t.slice.size == 0 ? u.empty : new u(t.slice.content.append(this.slice.content), t.slice.openStart, this.slice.openEnd);
 			return new e(t.from, this.to, n, this.structure);
 		} else return null;
 	}
@@ -1303,23 +1311,23 @@ var z = class e extends M {
 	}
 	static fromJSON(t, n) {
 		if (typeof n.from != "number" || typeof n.to != "number") throw RangeError("Invalid input for ReplaceStep.fromJSON");
-		return new e(n.from, n.to, c.fromJSON(t, n.slice), !!n.structure);
+		return new e(n.from, n.to, u.fromJSON(t, n.slice), !!n.structure);
 	}
 };
-M.jsonID("replace", z);
-var B = class e extends M {
+P.jsonID("replace", V);
+var H = class e extends P {
 	constructor(e, t, n, r, i, a, o = !1) {
 		super(), this.from = e, this.to = t, this.gapFrom = n, this.gapTo = r, this.slice = i, this.insert = a, this.structure = o;
 	}
 	apply(e) {
-		if (this.structure && (V(e, this.from, this.gapFrom) || V(e, this.gapTo, this.to))) return N.fail("Structure gap-replace would overwrite content");
+		if (this.structure && (U(e, this.from, this.gapFrom) || U(e, this.gapTo, this.to))) return F.fail("Structure gap-replace would overwrite content");
 		let t = e.slice(this.gapFrom, this.gapTo);
-		if (t.openStart || t.openEnd) return N.fail("Gap is not a flat range");
+		if (t.openStart || t.openEnd) return F.fail("Gap is not a flat range");
 		let n = this.slice.insertAt(this.insert, t.content);
-		return n ? N.fromReplace(e, this.from, this.to, n) : N.fail("Content does not fit in gap");
+		return n ? F.fromReplace(e, this.from, this.to, n) : F.fail("Content does not fit in gap");
 	}
 	getMap() {
-		return new A([
+		return new M([
 			this.from,
 			this.gapFrom - this.from,
 			this.insert,
@@ -1349,11 +1357,11 @@ var B = class e extends M {
 	}
 	static fromJSON(t, n) {
 		if (typeof n.from != "number" || typeof n.to != "number" || typeof n.gapFrom != "number" || typeof n.gapTo != "number" || typeof n.insert != "number") throw RangeError("Invalid input for ReplaceAroundStep.fromJSON");
-		return new e(n.from, n.to, n.gapFrom, n.gapTo, c.fromJSON(t, n.slice), n.insert, !!n.structure);
+		return new e(n.from, n.to, n.gapFrom, n.gapTo, u.fromJSON(t, n.slice), n.insert, !!n.structure);
 	}
 };
-M.jsonID("replaceAround", B);
-function V(e, t, n) {
+P.jsonID("replaceAround", H);
+function U(e, t, n) {
 	let r = e.resolve(t), i = n - t, a = r.depth;
 	for (; i > 0 && a > 0 && r.indexAfter(a) == r.node(a).childCount;) a--, i--;
 	if (i > 0) {
@@ -1365,21 +1373,21 @@ function V(e, t, n) {
 	}
 	return !1;
 }
-var Ce = class e extends M {
+var Ce = class e extends P {
 	constructor(e, t, n) {
 		super(), this.pos = e, this.attr = t, this.value = n;
 	}
 	apply(e) {
 		let t = e.nodeAt(this.pos);
-		if (!t) return N.fail("No node at attribute step's position");
-		let r = Object.create(null);
-		for (let e in t.attrs) r[e] = t.attrs[e];
-		r[this.attr] = this.value;
-		let i = t.type.create(r, null, t.marks);
-		return N.fromReplace(e, this.pos, this.pos + 1, new c(n.from(i), 0, +!t.isLeaf));
+		if (!t) return F.fail("No node at attribute step's position");
+		let n = Object.create(null);
+		for (let e in t.attrs) n[e] = t.attrs[e];
+		n[this.attr] = this.value;
+		let r = t.type.create(n, null, t.marks);
+		return F.fromReplace(e, this.pos, this.pos + 1, new u(i.from(r), 0, +!t.isLeaf));
 	}
 	getMap() {
-		return A.empty;
+		return M.empty;
 	}
 	invert(t) {
 		return new e(this.pos, this.attr, t.nodeAt(this.pos).attrs[this.attr]);
@@ -1401,8 +1409,8 @@ var Ce = class e extends M {
 		return new e(n.pos, n.attr, n.value);
 	}
 };
-M.jsonID("attr", Ce);
-var we = class e extends M {
+P.jsonID("attr", Ce);
+var we = class e extends P {
 	constructor(e, t) {
 		super(), this.attr = e, this.value = t;
 	}
@@ -1411,10 +1419,10 @@ var we = class e extends M {
 		for (let n in e.attrs) t[n] = e.attrs[n];
 		t[this.attr] = this.value;
 		let n = e.type.create(t, e.content, e.marks);
-		return N.ok(n);
+		return F.ok(n);
 	}
 	getMap() {
-		return A.empty;
+		return M.empty;
 	}
 	invert(t) {
 		return new e(this.attr, t.attrs[this.attr]);
@@ -1434,13 +1442,13 @@ var we = class e extends M {
 		return new e(n.attr, n.value);
 	}
 };
-M.jsonID("docAttr", we);
-var H = class extends Error {};
-H = function e(t) {
+P.jsonID("docAttr", we);
+var W = class extends Error {};
+W = function e(t) {
 	let n = Error.call(this, t);
 	return n.__proto__ = e.prototype, n;
-}, H.prototype = Object.create(Error.prototype), H.prototype.constructor = H, H.prototype.name = "TransformError";
-var U = Object.create(null), W = class {
+}, W.prototype = Object.create(Error.prototype), W.prototype.constructor = W, W.prototype.name = "TransformError";
+var G = Object.create(null), K = class {
 	constructor(e, t, n) {
 		this.$anchor = e, this.$head = t, this.ranges = n || [new Te(e.min(t), e.max(t))];
 	}
@@ -1470,64 +1478,64 @@ var U = Object.create(null), W = class {
 	content() {
 		return this.$from.doc.slice(this.from, this.to, !0);
 	}
-	replace(e, t = c.empty) {
+	replace(e, t = u.empty) {
 		let n = t.content.lastChild, r = null;
 		for (let e = 0; e < t.openEnd; e++) r = n, n = n.lastChild;
 		let i = e.steps.length, a = this.ranges;
 		for (let o = 0; o < a.length; o++) {
-			let { $from: s, $to: l } = a[o], u = e.mapping.slice(i);
-			e.replaceRange(u.map(s.pos), u.map(l.pos), o ? c.empty : t), o == 0 && ke(e, i, (n ? n.isInline : r && r.isTextblock) ? -1 : 1);
+			let { $from: s, $to: c } = a[o], l = e.mapping.slice(i);
+			e.replaceRange(l.map(s.pos), l.map(c.pos), o ? u.empty : t), o == 0 && Ae(e, i, (n ? n.isInline : r && r.isTextblock) ? -1 : 1);
 		}
 	}
 	replaceWith(e, t) {
 		let n = e.steps.length, r = this.ranges;
 		for (let i = 0; i < r.length; i++) {
 			let { $from: a, $to: o } = r[i], s = e.mapping.slice(n), c = s.map(a.pos), l = s.map(o.pos);
-			i ? e.deleteRange(c, l) : (e.replaceRangeWith(c, l, t), ke(e, n, t.isInline ? -1 : 1));
+			i ? e.deleteRange(c, l) : (e.replaceRangeWith(c, l, t), Ae(e, n, t.isInline ? -1 : 1));
 		}
 	}
 	static findFrom(e, t, n = !1) {
-		let r = e.parent.inlineContent ? new K(e) : X(e.node(0), e.parent, e.pos, e.index(), t, n);
+		let r = e.parent.inlineContent ? new J(e) : Z(e.node(0), e.parent, e.pos, e.index(), t, n);
 		if (r) return r;
 		for (let r = e.depth - 1; r >= 0; r--) {
-			let i = t < 0 ? X(e.node(0), e.node(r), e.before(r + 1), e.index(r), t, n) : X(e.node(0), e.node(r), e.after(r + 1), e.index(r) + 1, t, n);
+			let i = t < 0 ? Z(e.node(0), e.node(r), e.before(r + 1), e.index(r), t, n) : Z(e.node(0), e.node(r), e.after(r + 1), e.index(r) + 1, t, n);
 			if (i) return i;
 		}
 		return null;
 	}
 	static near(e, t = 1) {
-		return this.findFrom(e, t) || this.findFrom(e, -t) || new Y(e.node(0));
+		return this.findFrom(e, t) || this.findFrom(e, -t) || new X(e.node(0));
 	}
 	static atStart(e) {
-		return X(e, e, 0, 0, 1) || new Y(e);
+		return Z(e, e, 0, 0, 1) || new X(e);
 	}
 	static atEnd(e) {
-		return X(e, e, e.content.size, e.childCount, -1) || new Y(e);
+		return Z(e, e, e.content.size, e.childCount, -1) || new X(e);
 	}
 	static fromJSON(e, t) {
 		if (!t || !t.type) throw RangeError("Invalid input for Selection.fromJSON");
-		let n = U[t.type];
+		let n = G[t.type];
 		if (!n) throw RangeError(`No selection type ${t.type} defined`);
 		return n.fromJSON(e, t);
 	}
 	static jsonID(e, t) {
-		if (e in U) throw RangeError("Duplicate use of selection JSON ID " + e);
-		return U[e] = t, t.prototype.jsonID = e, t;
+		if (e in G) throw RangeError("Duplicate use of selection JSON ID " + e);
+		return G[e] = t, t.prototype.jsonID = e, t;
 	}
 	getBookmark() {
-		return K.between(this.$anchor, this.$head).getBookmark();
+		return J.between(this.$anchor, this.$head).getBookmark();
 	}
 };
-W.prototype.visible = !0;
+K.prototype.visible = !0;
 var Te = class {
 	constructor(e, t) {
 		this.$from = e, this.$to = t;
 	}
-}, G = !1;
+}, q = !1;
 function Ee(e) {
-	!G && !e.parent.inlineContent && (G = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + e.parent.type.name + ")"));
+	!q && !e.parent.inlineContent && (q = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + e.parent.type.name + ")"));
 }
-var K = class e extends W {
+var J = class e extends K {
 	constructor(e, t = e) {
 		Ee(e), Ee(t), super(e, t);
 	}
@@ -1536,12 +1544,12 @@ var K = class e extends W {
 	}
 	map(t, n) {
 		let r = t.resolve(n.map(this.head));
-		if (!r.parent.inlineContent) return W.near(r);
+		if (!r.parent.inlineContent) return K.near(r);
 		let i = t.resolve(n.map(this.anchor));
 		return new e(i.parent.inlineContent ? i : r, r);
 	}
-	replace(e, t = c.empty) {
-		if (super.replace(e, t), t == c.empty) {
+	replace(e, t = u.empty) {
+		if (super.replace(e, t), t == u.empty) {
 			let t = this.$from.marksAcross(this.$to);
 			t && e.ensureMarks(t);
 		}
@@ -1550,7 +1558,7 @@ var K = class e extends W {
 		return t instanceof e && t.anchor == this.anchor && t.head == this.head;
 	}
 	getBookmark() {
-		return new q(this.anchor, this.head);
+		return new De(this.anchor, this.head);
 	}
 	toJSON() {
 		return {
@@ -1570,15 +1578,15 @@ var K = class e extends W {
 	static between(t, n, r) {
 		let i = t.pos - n.pos;
 		if ((!r || i) && (r = i >= 0 ? 1 : -1), !n.parent.inlineContent) {
-			let e = W.findFrom(n, r, !0) || W.findFrom(n, -r, !0);
+			let e = K.findFrom(n, r, !0) || K.findFrom(n, -r, !0);
 			if (e) n = e.$head;
-			else return W.near(n, r);
+			else return K.near(n, r);
 		}
-		return t.parent.inlineContent || (i == 0 ? t = n : (t = (W.findFrom(t, -r, !0) || W.findFrom(t, r, !0)).$anchor, t.pos < n.pos != i < 0 && (t = n))), new e(t, n);
+		return t.parent.inlineContent || (i == 0 ? t = n : (t = (K.findFrom(t, -r, !0) || K.findFrom(t, r, !0)).$anchor, t.pos < n.pos != i < 0 && (t = n))), new e(t, n);
 	}
 };
-W.jsonID("text", K);
-var q = class e {
+K.jsonID("text", J);
+var De = class e {
 	constructor(e, t) {
 		this.anchor = e, this.head = t;
 	}
@@ -1586,19 +1594,19 @@ var q = class e {
 		return new e(t.map(this.anchor), t.map(this.head));
 	}
 	resolve(e) {
-		return K.between(e.resolve(this.anchor), e.resolve(this.head));
+		return J.between(e.resolve(this.anchor), e.resolve(this.head));
 	}
-}, J = class e extends W {
+}, Y = class e extends K {
 	constructor(e) {
 		let t = e.nodeAfter, n = e.node(0).resolve(e.pos + t.nodeSize);
 		super(e, n), this.node = t;
 	}
 	map(t, n) {
 		let { deleted: r, pos: i } = n.mapResult(this.anchor), a = t.resolve(i);
-		return r ? W.near(a) : new e(a);
+		return r ? K.near(a) : new e(a);
 	}
 	content() {
-		return new c(n.from(this.node), 0, 0);
+		return new u(i.from(this.node), 0, 0);
 	}
 	eq(t) {
 		return t instanceof e && t.anchor == this.anchor;
@@ -1610,7 +1618,7 @@ var q = class e {
 		};
 	}
 	getBookmark() {
-		return new De(this.anchor);
+		return new Oe(this.anchor);
 	}
 	static fromJSON(t, n) {
 		if (typeof n.anchor != "number") throw RangeError("Invalid input for NodeSelection.fromJSON");
@@ -1623,27 +1631,27 @@ var q = class e {
 		return !e.isText && e.type.spec.selectable !== !1;
 	}
 };
-J.prototype.visible = !1, W.jsonID("node", J);
-var De = class e {
+Y.prototype.visible = !1, K.jsonID("node", Y);
+var Oe = class e {
 	constructor(e) {
 		this.anchor = e;
 	}
 	map(t) {
 		let { deleted: n, pos: r } = t.mapResult(this.anchor);
-		return n ? new q(r, r) : new e(r);
+		return n ? new De(r, r) : new e(r);
 	}
 	resolve(e) {
 		let t = e.resolve(this.anchor), n = t.nodeAfter;
-		return n && J.isSelectable(n) ? new J(t) : W.near(t);
+		return n && Y.isSelectable(n) ? new Y(t) : K.near(t);
 	}
-}, Y = class e extends W {
+}, X = class e extends K {
 	constructor(e) {
 		super(e.resolve(0), e.resolve(e.content.size));
 	}
-	replace(e, t = c.empty) {
-		if (t == c.empty) {
+	replace(e, t = u.empty) {
+		if (t == u.empty) {
 			e.delete(0, e.doc.content.size);
-			let t = W.atStart(e.doc);
+			let t = K.atStart(e.doc);
 			t.eq(e.selection) || e.setSelection(t);
 		} else super.replace(e, t);
 	}
@@ -1660,46 +1668,46 @@ var De = class e {
 		return t instanceof e;
 	}
 	getBookmark() {
-		return Oe;
+		return ke;
 	}
 };
-W.jsonID("all", Y);
-var Oe = {
+K.jsonID("all", X);
+var ke = {
 	map() {
 		return this;
 	},
 	resolve(e) {
-		return new Y(e);
+		return new X(e);
 	}
 };
-function X(e, t, n, r, i, a = !1) {
-	if (t.inlineContent) return K.create(e, n);
+function Z(e, t, n, r, i, a = !1) {
+	if (t.inlineContent) return J.create(e, n);
 	for (let o = r - (i > 0 ? 0 : 1); i > 0 ? o < t.childCount : o >= 0; o += i) {
 		let r = t.child(o);
 		if (!r.isAtom) {
-			let t = X(e, r, n + i, i < 0 ? r.childCount : 0, i, a);
+			let t = Z(e, r, n + i, i < 0 ? r.childCount : 0, i, a);
 			if (t) return t;
-		} else if (!a && J.isSelectable(r)) return J.create(e, n - (i < 0 ? r.nodeSize : 0));
+		} else if (!a && Y.isSelectable(r)) return Y.create(e, n - (i < 0 ? r.nodeSize : 0));
 		n += r.nodeSize * i;
 	}
 	return null;
 }
-function ke(e, t, n) {
+function Ae(e, t, n) {
 	let r = e.steps.length - 1;
 	if (r < t) return;
 	let i = e.steps[r];
-	if (!(i instanceof z || i instanceof B)) return;
+	if (!(i instanceof V || i instanceof H)) return;
 	let a = e.mapping.maps[r], o;
 	a.forEach((e, t, n, r) => {
 		o ??= r;
-	}), e.setSelection(W.near(e.doc.resolve(o), n));
+	}), e.setSelection(K.near(e.doc.resolve(o), n));
 }
-function Z(e, t) {
+function je(e, t) {
 	return !t || !e ? e : e.bind(t);
 }
 var Q = class {
 	constructor(e, t, n) {
-		this.name = e, this.init = Z(t.init, n), this.apply = Z(t.apply, n);
+		this.name = e, this.init = je(t.init, n), this.apply = je(t.apply, n);
 	}
 };
 new Q("doc", {
@@ -1711,7 +1719,7 @@ new Q("doc", {
 	}
 }), new Q("selection", {
 	init(e, t) {
-		return e.selection || W.atStart(t.doc);
+		return e.selection || K.atStart(t.doc);
 	},
 	apply(e) {
 		return e.selection;
@@ -1732,12 +1740,12 @@ new Q("doc", {
 	}
 });
 var $ = Object.create(null);
-function Ae(e) {
+function Me(e) {
 	return e in $ ? e + "$" + ++$[e] : ($[e] = 0, e + "$");
 }
-var je = class {
+var Ne = class {
 	constructor(e = "key") {
-		this.key = Ae(e);
+		this.key = Me(e);
 	}
 	get(e) {
 		return e.config.pluginsByKey[this.key];
@@ -1746,4 +1754,4 @@ var je = class {
 		return e[this.key];
 	}
 };
-export { je as t };
+export { Ne as t };