@guodun/antdv 1.5.3 → 1.6.0

package/dist/es/node_modules/prosemirror-transform/dist/index.mjs

@@ -0,0 +1,1055 @@
+import { Fragment as e, Mark as t, MarkType as n, ReplaceError as r, Slice as i } from "../../prosemirror-model/dist/index.mjs";
+//#region ../../node_modules/prosemirror-transform/dist/index.js
+var a = 65535, o = 2 ** 16;
+function s(e, t) {
+	return e + t * o;
+}
+function c(e) {
+	return e & a;
+}
+function l(e) {
+	return (e - (e & a)) / o;
+}
+var u = 1, d = 2, f = 4, p = 8, m = class {
+	constructor(e, t, n) {
+		this.pos = e, this.delInfo = t, this.recover = n;
+	}
+	get deleted() {
+		return (this.delInfo & p) > 0;
+	}
+	get deletedBefore() {
+		return (this.delInfo & (u | f)) > 0;
+	}
+	get deletedAfter() {
+		return (this.delInfo & (d | f)) > 0;
+	}
+	get deletedAcross() {
+		return (this.delInfo & f) > 0;
+	}
+}, h = 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 = c(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 + l(e);
+	}
+	mapResult(e, t = 1) {
+		return this._map(e, t, !1);
+	}
+	map(e, t = 1) {
+		return this._map(e, t, !0);
+	}
+	_map(e, t, n) {
+		let r = 0, i = this.inverted ? 2 : 1, a = this.inverted ? 1 : 2;
+		for (let o = 0; o < this.ranges.length; o += 3) {
+			let c = this.ranges[o] - (this.inverted ? r : 0);
+			if (c > e) break;
+			let l = this.ranges[o + i], h = this.ranges[o + a], g = c + l;
+			if (e <= g) {
+				let i = l ? e == c ? -1 : e == g ? 1 : t : t, a = c + r + (i < 0 ? 0 : h);
+				if (n) return a;
+				let _ = e == (t < 0 ? c : g) ? null : s(o / 3, e - c), v = e == c ? d : e == g ? u : f;
+				return (t < 0 ? e != c : e != g) && (v |= p), new m(a, v, _);
+			}
+			r += h - l;
+		}
+		return n ? e + r : new m(e + r, 0, null);
+	}
+	touches(e, t) {
+		let n = 0, r = c(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;
+			let s = this.ranges[t + i];
+			if (e <= o + s && t == r * 3) return !0;
+			n += this.ranges[t + a] - s;
+		}
+		return !1;
+	}
+	forEach(e) {
+		let t = this.inverted ? 2 : 1, n = this.inverted ? 1 : 2;
+		for (let r = 0, i = 0; r < this.ranges.length; r += 3) {
+			let a = this.ranges[r], o = a - (this.inverted ? i : 0), s = a + (this.inverted ? 0 : i), c = this.ranges[r + t], l = this.ranges[r + n];
+			e(o, o + c, s, s + l), i += l - c;
+		}
+	}
+	invert() {
+		return new e(this.ranges, !this.inverted);
+	}
+	toString() {
+		return (this.inverted ? "-" : "") + JSON.stringify(this.ranges);
+	}
+	static offset(t) {
+		return t == 0 ? e.empty : new e(t < 0 ? [
+			0,
+			-t,
+			0
+		] : [
+			0,
+			0,
+			t
+		]);
+	}
+};
+h.empty = new h([]);
+var g = class e {
+	constructor(e, t, n = 0, r = e ? e.length : 0) {
+		this.mirror = t, this.from = n, this.to = r, this._maps = e || [], this.ownData = !(e || t);
+	}
+	get maps() {
+		return this._maps;
+	}
+	slice(t = 0, n = this.maps.length) {
+		return new e(this._maps, this.mirror, t, n);
+	}
+	appendMap(e, t) {
+		this.ownData ||= (this._maps = this._maps.slice(), this.mirror = this.mirror && this.mirror.slice(), !0), this.to = this._maps.push(e), t != null && this.setMirror(this._maps.length - 1, t);
+	}
+	appendMapping(e) {
+		for (let t = 0, n = this._maps.length; t < e._maps.length; t++) {
+			let r = e.getMirror(t);
+			this.appendMap(e._maps[t], r != null && r < t ? n + r : void 0);
+		}
+	}
+	getMirror(e) {
+		if (this.mirror) {
+			for (let t = 0; t < this.mirror.length; t++) if (this.mirror[t] == e) return this.mirror[t + (t % 2 ? -1 : 1)];
+		}
+	}
+	setMirror(e, t) {
+		this.mirror ||= [], this.mirror.push(e, t);
+	}
+	appendMappingInverted(e) {
+		for (let t = e.maps.length - 1, n = this._maps.length + e._maps.length; t >= 0; t--) {
+			let r = e.getMirror(t);
+			this.appendMap(e._maps[t].invert(), r != null && r > t ? n - r - 1 : void 0);
+		}
+	}
+	invert() {
+		let t = new e();
+		return t.appendMappingInverted(this), t;
+	}
+	map(e, t = 1) {
+		if (this.mirror) return this._map(e, t, !0);
+		for (let n = this.from; n < this.to; n++) e = this._maps[n].map(e, t);
+		return e;
+	}
+	mapResult(e, t = 1) {
+		return this._map(e, t, !1);
+	}
+	_map(e, t, n) {
+		let r = 0;
+		for (let n = this.from; n < this.to; n++) {
+			let i = this._maps[n].mapResult(e, t);
+			if (i.recover != null) {
+				let t = this.getMirror(n);
+				if (t != null && t > n && t < this.to) {
+					n = t, e = this._maps[t].recover(i.recover);
+					continue;
+				}
+			}
+			r |= i.delInfo, e = i.pos;
+		}
+		return n ? e : new m(e, r, null);
+	}
+}, _ = Object.create(null), v = class {
+	getMap() {
+		return h.empty;
+	}
+	merge(e) {
+		return null;
+	}
+	static fromJSON(e, t) {
+		if (!t || !t.stepType) throw RangeError("Invalid input for Step.fromJSON");
+		let 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 _) throw RangeError("Duplicate use of step JSON ID " + e);
+		return _[e] = t, t.prototype.jsonID = e, t;
+	}
+}, y = class e {
+	constructor(e, t) {
+		this.doc = e, this.failed = t;
+	}
+	static ok(t) {
+		return new e(t, null);
+	}
+	static fail(t) {
+		return new e(null, t);
+	}
+	static fromReplace(t, n, i, a) {
+		try {
+			return e.ok(t.replace(n, i, a));
+		} catch (t) {
+			if (t instanceof r) return e.fail(t.message);
+			throw t;
+		}
+	}
+};
+function b(t, n, r) {
+	let i = [];
+	for (let e = 0; e < t.childCount; e++) {
+		let a = t.child(e);
+		a.content.size && (a = a.copy(b(a.content, n, a))), a.isInline && (a = n(a, r, e)), i.push(a);
+	}
+	return e.fromArray(i);
+}
+var x = class e extends v {
+	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)), a = new i(b(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 y.fromReplace(e, this.from, this.to, a);
+	}
+	invert() {
+		return new S(this.from, this.to, this.mark);
+	}
+	map(t) {
+		let n = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1);
+		return n.deleted && r.deleted || n.pos >= r.pos ? null : new e(n.pos, r.pos, this.mark);
+	}
+	merge(t) {
+		return t instanceof e && t.mark.eq(this.mark) && this.from <= t.to && this.to >= t.from ? new e(Math.min(this.from, t.from), Math.max(this.to, t.to), this.mark) : null;
+	}
+	toJSON() {
+		return {
+			stepType: "addMark",
+			mark: this.mark.toJSON(),
+			from: this.from,
+			to: this.to
+		};
+	}
+	static fromJSON(t, n) {
+		if (typeof n.from != "number" || typeof n.to != "number") throw RangeError("Invalid input for AddMarkStep.fromJSON");
+		return new e(n.from, n.to, t.markFromJSON(n.mark));
+	}
+};
+v.jsonID("addMark", x);
+var S = class e extends v {
+	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 i(b(t.content, (e) => e.mark(this.mark.removeFromSet(e.marks)), e), t.openStart, t.openEnd);
+		return y.fromReplace(e, this.from, this.to, n);
+	}
+	invert() {
+		return new x(this.from, this.to, this.mark);
+	}
+	map(t) {
+		let n = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1);
+		return n.deleted && r.deleted || n.pos >= r.pos ? null : new e(n.pos, r.pos, this.mark);
+	}
+	merge(t) {
+		return t instanceof e && t.mark.eq(this.mark) && this.from <= t.to && this.to >= t.from ? new e(Math.min(this.from, t.from), Math.max(this.to, t.to), this.mark) : null;
+	}
+	toJSON() {
+		return {
+			stepType: "removeMark",
+			mark: this.mark.toJSON(),
+			from: this.from,
+			to: this.to
+		};
+	}
+	static fromJSON(t, n) {
+		if (typeof n.from != "number" || typeof n.to != "number") throw RangeError("Invalid input for RemoveMarkStep.fromJSON");
+		return new e(n.from, n.to, t.markFromJSON(n.mark));
+	}
+};
+v.jsonID("removeMark", S);
+var C = class t extends v {
+	constructor(e, t) {
+		super(), this.pos = e, this.mark = t;
+	}
+	apply(t) {
+		let n = t.nodeAt(this.pos);
+		if (!n) return y.fail("No node at mark step's position");
+		let r = n.type.create(n.attrs, null, this.mark.addToSet(n.marks));
+		return y.fromReplace(t, this.pos, this.pos + 1, new i(e.from(r), 0, +!n.isLeaf));
+	}
+	invert(e) {
+		let n = e.nodeAt(this.pos);
+		if (n) {
+			let e = this.mark.addToSet(n.marks);
+			if (e.length == n.marks.length) {
+				for (let r = 0; r < n.marks.length; r++) if (!n.marks[r].isInSet(e)) return new t(this.pos, n.marks[r]);
+				return new t(this.pos, this.mark);
+			}
+		}
+		return new w(this.pos, this.mark);
+	}
+	map(e) {
+		let n = e.mapResult(this.pos, 1);
+		return n.deletedAfter ? null : new t(n.pos, this.mark);
+	}
+	toJSON() {
+		return {
+			stepType: "addNodeMark",
+			pos: this.pos,
+			mark: this.mark.toJSON()
+		};
+	}
+	static fromJSON(e, n) {
+		if (typeof n.pos != "number") throw RangeError("Invalid input for AddNodeMarkStep.fromJSON");
+		return new t(n.pos, e.markFromJSON(n.mark));
+	}
+};
+v.jsonID("addNodeMark", C);
+var w = class t extends v {
+	constructor(e, t) {
+		super(), this.pos = e, this.mark = t;
+	}
+	apply(t) {
+		let n = t.nodeAt(this.pos);
+		if (!n) return y.fail("No node at mark step's position");
+		let r = n.type.create(n.attrs, null, this.mark.removeFromSet(n.marks));
+		return y.fromReplace(t, this.pos, this.pos + 1, new i(e.from(r), 0, +!n.isLeaf));
+	}
+	invert(e) {
+		let t = e.nodeAt(this.pos);
+		return !t || !this.mark.isInSet(t.marks) ? this : new C(this.pos, this.mark);
+	}
+	map(e) {
+		let n = e.mapResult(this.pos, 1);
+		return n.deletedAfter ? null : new t(n.pos, this.mark);
+	}
+	toJSON() {
+		return {
+			stepType: "removeNodeMark",
+			pos: this.pos,
+			mark: this.mark.toJSON()
+		};
+	}
+	static fromJSON(e, n) {
+		if (typeof n.pos != "number") throw RangeError("Invalid input for RemoveNodeMarkStep.fromJSON");
+		return new t(n.pos, e.markFromJSON(n.mark));
+	}
+};
+v.jsonID("removeNodeMark", w);
+var T = class e extends v {
+	constructor(e, t, n, r = !1) {
+		super(), this.from = e, this.to = t, this.slice = n, this.structure = r;
+	}
+	apply(e) {
+		return this.structure && D(e, this.from, this.to) ? y.fail("Structure replace would overwrite content") : y.fromReplace(e, this.from, this.to, this.slice);
+	}
+	getMap() {
+		return new h([
+			this.from,
+			this.to - this.from,
+			this.slice.size
+		]);
+	}
+	invert(t) {
+		return new e(this.from, this.from + this.slice.size, t.slice(this.from, this.to));
+	}
+	map(t) {
+		let n = t.mapResult(this.to, -1), r = this.from == this.to && e.MAP_BIAS < 0 ? n : t.mapResult(this.from, 1);
+		return r.deletedAcross && n.deletedAcross ? null : new e(r.pos, Math.max(r.pos, n.pos), this.slice, this.structure);
+	}
+	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 ? i.empty : new i(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 ? i.empty : new i(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;
+	}
+	toJSON() {
+		let e = {
+			stepType: "replace",
+			from: this.from,
+			to: this.to
+		};
+		return this.slice.size && (e.slice = this.slice.toJSON()), this.structure && (e.structure = !0), e;
+	}
+	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, i.fromJSON(t, n.slice), !!n.structure);
+	}
+};
+T.MAP_BIAS = 1, v.jsonID("replace", T);
+var E = class e extends v {
+	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 && (D(e, this.from, this.gapFrom) || D(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) return y.fail("Gap is not a flat range");
+		let n = this.slice.insertAt(this.insert, t.content);
+		return n ? y.fromReplace(e, this.from, this.to, n) : y.fail("Content does not fit in gap");
+	}
+	getMap() {
+		return new h([
+			this.from,
+			this.gapFrom - this.from,
+			this.insert,
+			this.gapTo,
+			this.to - this.gapTo,
+			this.slice.size - this.insert
+		]);
+	}
+	invert(t) {
+		let n = this.gapTo - this.gapFrom;
+		return new e(this.from, this.from + this.slice.size + n, this.from + this.insert, this.from + this.insert + n, t.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);
+	}
+	map(t) {
+		let n = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1), i = this.from == this.gapFrom ? n.pos : t.map(this.gapFrom, -1), a = this.to == this.gapTo ? r.pos : t.map(this.gapTo, 1);
+		return n.deletedAcross && r.deletedAcross || i < n.pos || a > r.pos ? null : new e(n.pos, r.pos, i, a, this.slice, this.insert, this.structure);
+	}
+	toJSON() {
+		let e = {
+			stepType: "replaceAround",
+			from: this.from,
+			to: this.to,
+			gapFrom: this.gapFrom,
+			gapTo: this.gapTo,
+			insert: this.insert
+		};
+		return this.slice.size && (e.slice = this.slice.toJSON()), this.structure && (e.structure = !0), e;
+	}
+	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, i.fromJSON(t, n.slice), n.insert, !!n.structure);
+	}
+};
+v.jsonID("replaceAround", E);
+function D(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) {
+		let e = r.node(a).maybeChild(r.indexAfter(a));
+		for (; i > 0;) {
+			if (!e || e.isLeaf) return !0;
+			e = e.firstChild, i--;
+		}
+	}
+	return !1;
+}
+function O(e, t, n, r) {
+	let i = [], a = [], o, s;
+	e.doc.nodesBetween(t, n, (e, c, l) => {
+		if (!e.isInline) return;
+		let u = e.marks;
+		if (!r.isInSet(u) && l.type.allowsMarkType(r.type)) {
+			let l = Math.max(c, t), d = Math.min(c + e.nodeSize, n), f = r.addToSet(u);
+			for (let e = 0; e < u.length; e++) u[e].isInSet(f) || (o && o.to == l && o.mark.eq(u[e]) ? o.to = d : i.push(o = new S(l, d, u[e])));
+			s && s.to == l ? s.to = d : a.push(s = new x(l, d, r));
+		}
+	}), i.forEach((t) => e.step(t)), a.forEach((t) => e.step(t));
+}
+function k(e, t, r, i) {
+	let a = [], o = 0;
+	e.doc.nodesBetween(t, r, (e, s) => {
+		if (!e.isInline) return;
+		o++;
+		let c = null;
+		if (i instanceof n) {
+			let t = e.marks, n;
+			for (; n = i.isInSet(t);) (c ||= []).push(n), t = n.removeFromSet(t);
+		} else i ? i.isInSet(e.marks) && (c = [i]) : c = e.marks;
+		if (c && c.length) {
+			let n = Math.min(s + e.nodeSize, r);
+			for (let e = 0; e < c.length; e++) {
+				let r = c[e], i;
+				for (let e = 0; e < a.length; e++) {
+					let t = a[e];
+					t.step == o - 1 && r.eq(a[e].style) && (i = t);
+				}
+				i ? (i.to = n, i.step = o) : a.push({
+					style: r,
+					from: Math.max(s, t),
+					to: n,
+					step: o
+				});
+			}
+		}
+	}), a.forEach((t) => e.step(new S(t.from, t.to, t.style)));
+}
+function A(t, n, r, a = r.contentMatch, o = !0) {
+	let s = t.doc.nodeAt(n), c = [], l = n + 1;
+	for (let n = 0; n < s.childCount; n++) {
+		let u = s.child(n), d = l + u.nodeSize, f = a.matchType(u.type);
+		if (!f) c.push(new T(l, d, i.empty));
+		else {
+			a = f;
+			for (let e = 0; e < u.marks.length; e++) r.allowsMarkType(u.marks[e].type) || t.step(new S(l, d, u.marks[e]));
+			if (o && u.isText && r.whitespace != "pre") {
+				let t, n = /\r?\n|\r/g, a;
+				for (; t = n.exec(u.text);) a ||= new i(e.from(r.schema.text(" ", r.allowedMarks(u.marks))), 0, 0), c.push(new T(l + t.index, l + t.index + t[0].length, a));
+			}
+		}
+		l = d;
+	}
+	if (!a.validEnd) {
+		let n = a.fillBefore(e.empty, !0);
+		t.replace(l, l, new i(n, 0, 0));
+	}
+	for (let e = c.length - 1; e >= 0; e--) t.step(c[e]);
+}
+function ee(t, n, r) {
+	let { $from: a, $to: o, depth: s } = n, c = a.before(s + 1), l = o.after(s + 1), u = c, d = l, f = e.empty, p = 0;
+	for (let t = s, n = !1; t > r; t--) n || a.index(t) > 0 ? (n = !0, f = e.from(a.node(t).copy(f)), p++) : u--;
+	let m = e.empty, h = 0;
+	for (let t = s, n = !1; t > r; t--) n || o.after(t + 1) < o.end(t) ? (n = !0, m = e.from(o.node(t).copy(m)), h++) : d++;
+	t.step(new E(u, d, c, l, new i(f.append(m), p, h), f.size - p, !0));
+}
+function j(t, n, r) {
+	let a = e.empty;
+	for (let t = r.length - 1; t >= 0; t--) {
+		if (a.size) {
+			let e = r[t].type.contentMatch.matchFragment(a);
+			if (!e || !e.validEnd) throw RangeError("Wrapper type given to Transform.wrap does not form valid content of its parent wrapper");
+		}
+		a = e.from(r[t].type.create(r[t].attrs, a));
+	}
+	let o = n.start, s = n.end;
+	t.step(new E(o, s, o, s, new i(a, 0, 0), r.length, !0));
+}
+function M(t, n, r, a, o) {
+	if (!a.isTextblock) throw RangeError("Type given to setBlockType should be a textblock");
+	let s = t.steps.length;
+	t.doc.nodesBetween(n, r, (n, r) => {
+		let c = typeof o == "function" ? o(n) : o;
+		if (n.isTextblock && !n.hasMarkup(a, c) && F(t.doc, t.mapping.slice(s).map(r), a)) {
+			let o = null;
+			if (a.schema.linebreakReplacement) {
+				let e = a.whitespace == "pre", t = !!a.contentMatch.matchType(a.schema.linebreakReplacement);
+				e && !t ? o = !1 : !e && t && (o = !0);
+			}
+			o === !1 && P(t, n, r, s), A(t, t.mapping.slice(s).map(r, 1), a, void 0, o === null);
+			let l = t.mapping.slice(s), u = l.map(r, 1), d = l.map(r + n.nodeSize, 1);
+			return t.step(new E(u, d, u + 1, d - 1, new i(e.from(a.create(c, null, n.marks)), 0, 0), 1, !0)), o === !0 && N(t, n, r, s), !1;
+		}
+	});
+}
+function N(e, t, n, r) {
+	t.forEach((i, a) => {
+		if (i.isText) {
+			let o, s = /\r?\n|\r/g;
+			for (; o = s.exec(i.text);) {
+				let i = e.mapping.slice(r).map(n + 1 + a + o.index);
+				e.replaceWith(i, i + 1, t.type.schema.linebreakReplacement.create());
+			}
+		}
+	});
+}
+function P(e, t, n, r) {
+	t.forEach((i, a) => {
+		if (i.type == i.type.schema.linebreakReplacement) {
+			let i = e.mapping.slice(r).map(n + 1 + a);
+			e.replaceWith(i, i + 1, t.type.schema.text("\n"));
+		}
+	});
+}
+function F(e, t, n) {
+	let r = e.resolve(t), i = r.index();
+	return r.parent.canReplaceWith(i, i + 1, n);
+}
+function I(t, n, r, a, o) {
+	let s = t.doc.nodeAt(n);
+	if (!s) throw RangeError("No node at given position");
+	r ||= s.type;
+	let c = r.create(a, null, o || s.marks);
+	if (s.isLeaf) return t.replaceWith(n, n + s.nodeSize, c);
+	if (!r.validContent(s.content)) throw RangeError("Invalid content for node type " + r.name);
+	t.step(new E(n, n + s.nodeSize, n + 1, n + s.nodeSize - 1, new i(e.from(c), 0, 0), 1, !0));
+}
+function L(t, n, r = 1, a) {
+	let o = t.doc.resolve(n), s = e.empty, c = e.empty;
+	for (let t = o.depth, n = o.depth - r, i = r - 1; t > n; t--, i--) {
+		s = e.from(o.node(t).copy(s));
+		let n = a && a[i];
+		c = e.from(n ? n.type.create(n.attrs, c) : o.node(t).copy(c));
+	}
+	t.step(new T(n, n, new i(s.append(c), r, r), !0));
+}
+function te(e, t, n) {
+	let r = null, { linebreakReplacement: a } = e.doc.type.schema, o = e.doc.resolve(t - n), s = o.node().type;
+	if (a && s.inlineContent) {
+		let e = s.whitespace == "pre", t = !!s.contentMatch.matchType(a);
+		e && !t ? r = !1 : !e && t && (r = !0);
+	}
+	let c = e.steps.length;
+	if (r === !1) {
+		let r = e.doc.resolve(t + n);
+		P(e, r.node(), r.before(), c);
+	}
+	s.inlineContent && A(e, t + n - 1, s, o.node().contentMatchAt(o.index()), r == null);
+	let l = e.mapping.slice(c), u = l.map(t - n);
+	if (e.step(new T(u, l.map(t + n, -1), i.empty, !0)), r === !0) {
+		let t = e.doc.resolve(u);
+		N(e, t.node(), t.before(), e.steps.length);
+	}
+	return e;
+}
+function ne(e, t, n) {
+	let r = e.resolve(t);
+	if (r.parent.canReplaceWith(r.index(), r.index(), n)) return t;
+	if (r.parentOffset == 0) for (let e = r.depth - 1; e >= 0; e--) {
+		let t = r.index(e);
+		if (r.node(e).canReplaceWith(t, t, n)) return r.before(e + 1);
+		if (t > 0) return null;
+	}
+	if (r.parentOffset == r.parent.content.size) for (let e = r.depth - 1; e >= 0; e--) {
+		let t = r.indexAfter(e);
+		if (r.node(e).canReplaceWith(t, t, n)) return r.after(e + 1);
+		if (t < r.node(e).childCount) return null;
+	}
+	return null;
+}
+function re(e, t, n = t, r = i.empty) {
+	if (t == n && !r.size) return null;
+	let a = e.resolve(t), o = e.resolve(n);
+	return R(a, o, r) ? new T(t, n, r) : new z(a, o, r).fit();
+}
+function R(e, t, n) {
+	return !n.openStart && !n.openEnd && e.start() == t.start() && e.parent.canReplace(e.index(), t.index(), n.content);
+}
+var z = class {
+	constructor(t, n, r) {
+		this.$from = t, this.$to = n, this.unplaced = r, this.frontier = [], this.placed = e.empty;
+		for (let e = 0; e <= t.depth; e++) {
+			let n = t.node(e);
+			this.frontier.push({
+				type: n.type,
+				match: n.contentMatchAt(t.indexAfter(e))
+			});
+		}
+		for (let n = t.depth; n > 0; n--) this.placed = e.from(t.node(n).copy(this.placed));
+	}
+	get depth() {
+		return this.frontier.length - 1;
+	}
+	fit() {
+		for (; this.unplaced.size;) {
+			let e = this.findFittable();
+			e ? this.placeNodes(e) : this.openMore() || this.dropNode();
+		}
+		let e = this.mustMoveInline(), t = this.placed.size - this.depth - this.$from.depth, n = this.$from, r = this.close(e < 0 ? this.$to : n.doc.resolve(e));
+		if (!r) return null;
+		let a = this.placed, o = n.depth, s = r.depth;
+		for (; o && s && a.childCount == 1;) a = a.firstChild.content, o--, s--;
+		let c = new i(a, o, s);
+		return e > -1 ? new E(n.pos, e, this.$to.pos, this.$to.end(), c, t) : c.size || n.pos != this.$to.pos ? new T(n.pos, r.pos, c) : null;
+	}
+	findFittable() {
+		let t = this.unplaced.openStart;
+		for (let e = this.unplaced.content, n = 0, r = this.unplaced.openEnd; n < t; n++) {
+			let i = e.firstChild;
+			if (e.childCount > 1 && (r = 0), i.type.spec.isolating && r <= n) {
+				t = n;
+				break;
+			}
+			e = i.content;
+		}
+		for (let n = 1; n <= 2; n++) for (let r = n == 1 ? t : this.unplaced.openStart; r >= 0; r--) {
+			let t, i = null;
+			r ? (i = H(this.unplaced.content, r - 1).firstChild, t = i.content) : t = this.unplaced.content;
+			let a = t.firstChild;
+			for (let t = this.depth; t >= 0; t--) {
+				let { type: o, match: s } = this.frontier[t], c, l = null;
+				if (n == 1 && (a ? s.matchType(a.type) || (l = s.fillBefore(e.from(a), !1)) : i && o.compatibleContent(i.type))) return {
+					sliceDepth: r,
+					frontierDepth: t,
+					parent: i,
+					inject: l
+				};
+				if (n == 2 && a && (c = s.findWrapping(a.type))) return {
+					sliceDepth: r,
+					frontierDepth: t,
+					parent: i,
+					wrap: c
+				};
+				if (i && s.matchType(i.type)) break;
+			}
+		}
+	}
+	openMore() {
+		let { content: e, openStart: t, openEnd: n } = this.unplaced, r = H(e, t);
+		return !r.childCount || r.firstChild.isLeaf ? !1 : (this.unplaced = new i(e, t + 1, Math.max(n, r.size + t >= e.size - n ? t + 1 : 0)), !0);
+	}
+	dropNode() {
+		let { content: e, openStart: t, openEnd: n } = this.unplaced, r = H(e, t);
+		if (r.childCount <= 1 && t > 0) {
+			let a = e.size - t <= t + r.size;
+			this.unplaced = new i(B(e, t - 1, 1), t - 1, a ? t - 1 : n);
+		} else this.unplaced = new i(B(e, t, 1), t, n);
+	}
+	placeNodes({ sliceDepth: t, frontierDepth: n, parent: r, inject: a, wrap: o }) {
+		for (; this.depth > n;) this.closeFrontierNode();
+		if (o) for (let e = 0; e < o.length; e++) this.openFrontierNode(o[e]);
+		let s = this.unplaced, c = r ? r.content : s.content, l = s.openStart - t, u = 0, d = [], { match: f, type: p } = this.frontier[n];
+		if (a) {
+			for (let e = 0; e < a.childCount; e++) d.push(a.child(e));
+			f = f.matchFragment(a);
+		}
+		let m = c.size + t - (s.content.size - s.openEnd);
+		for (; u < c.childCount;) {
+			let e = c.child(u), t = f.matchType(e.type);
+			if (!t) break;
+			u++, (u > 1 || l == 0 || e.content.size) && (f = t, d.push(U(e.mark(p.allowedMarks(e.marks)), u == 1 ? l : 0, u == c.childCount ? m : -1)));
+		}
+		let h = u == c.childCount;
+		h || (m = -1), this.placed = V(this.placed, n, e.from(d)), this.frontier[n].match = f, h && m < 0 && r && r.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
+		for (let e = 0, t = c; e < m; e++) {
+			let e = t.lastChild;
+			this.frontier.push({
+				type: e.type,
+				match: e.contentMatchAt(e.childCount)
+			}), t = e.content;
+		}
+		this.unplaced = h ? t == 0 ? i.empty : new i(B(s.content, t - 1, 1), t - 1, m < 0 ? s.openEnd : t - 1) : new i(B(s.content, t, u), s.openStart, s.openEnd);
+	}
+	mustMoveInline() {
+		if (!this.$to.parent.isTextblock) return -1;
+		let e = this.frontier[this.depth], t;
+		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: n } = this.$to, r = this.$to.after(n);
+		for (; n > 1 && r == this.$to.end(--n);) ++r;
+		return r;
+	}
+	findCloseLevel(e) {
+		scan: for (let t = Math.min(this.depth, e.depth); t >= 0; t--) {
+			let { match: n, type: r } = this.frontier[t], i = t < e.depth && e.end(t + 1) == e.pos + (e.depth - (t + 1)), a = W(e, t, r, n, i);
+			if (a) {
+				for (let n = t - 1; n >= 0; n--) {
+					let { match: t, type: r } = this.frontier[n], i = W(e, n, r, t, !0);
+					if (!i || i.childCount) continue scan;
+				}
+				return {
+					depth: t,
+					fit: a,
+					move: i ? e.doc.resolve(e.after(t + 1)) : e
+				};
+			}
+		}
+	}
+	close(e) {
+		let t = this.findCloseLevel(e);
+		if (!t) return null;
+		for (; this.depth > t.depth;) this.closeFrontierNode();
+		t.fit.childCount && (this.placed = V(this.placed, t.depth, t.fit)), e = t.move;
+		for (let n = t.depth + 1; n <= e.depth; n++) {
+			let t = e.node(n), r = t.type.contentMatch.fillBefore(t.content, !0, e.index(n));
+			this.openFrontierNode(t.type, t.attrs, r);
+		}
+		return e;
+	}
+	openFrontierNode(t, n = null, r) {
+		let i = this.frontier[this.depth];
+		i.match = i.match.matchType(t), this.placed = V(this.placed, this.depth, e.from(t.create(n, r))), this.frontier.push({
+			type: t,
+			match: t.contentMatch
+		});
+	}
+	closeFrontierNode() {
+		let t = this.frontier.pop().match.fillBefore(e.empty, !0);
+		t.childCount && (this.placed = V(this.placed, this.frontier.length, t));
+	}
+};
+function B(e, t, n) {
+	return t == 0 ? e.cutByIndex(n, e.childCount) : e.replaceChild(0, e.firstChild.copy(B(e.firstChild.content, t - 1, n)));
+}
+function V(e, t, n) {
+	return t == 0 ? e.append(n) : e.replaceChild(e.childCount - 1, e.lastChild.copy(V(e.lastChild.content, t - 1, n)));
+}
+function H(e, t) {
+	for (let n = 0; n < t; n++) e = e.firstChild.content;
+	return e;
+}
+function U(t, n, r) {
+	if (n <= 0) return t;
+	let i = t.content;
+	return n > 1 && (i = i.replaceChild(0, U(i.firstChild, n - 1, i.childCount == 1 ? r - 1 : 0))), n > 0 && (i = t.type.contentMatch.fillBefore(i).append(i), r <= 0 && (i = i.append(t.type.contentMatch.matchFragment(i).fillBefore(e.empty, !0)))), t.copy(i);
+}
+function W(e, t, n, r, i) {
+	let a = e.node(t), o = i ? e.indexAfter(t) : e.index(t);
+	if (o == a.childCount && !n.compatibleContent(a.type)) return null;
+	let s = r.fillBefore(a.content, !0, o);
+	return s && !G(n, a.content, o) ? s : null;
+}
+function G(e, t, n) {
+	for (let r = n; r < t.childCount; r++) if (!e.allowsMarks(t.child(r).marks)) return !0;
+	return !1;
+}
+function K(e) {
+	return e.spec.defining || e.spec.definingForContent;
+}
+function q(e, t, n, r) {
+	if (!r.size) return e.deleteRange(t, n);
+	let a = e.doc.resolve(t), o = e.doc.resolve(n);
+	if (R(a, o, r)) return e.step(new T(t, n, r));
+	let s = X(a, o);
+	s[s.length - 1] == 0 && s.pop();
+	let c = -(a.depth + 1);
+	s.unshift(c);
+	for (let e = a.depth, t = a.pos - 1; e > 0; e--, t--) {
+		let n = a.node(e).type.spec;
+		if (n.defining || n.definingAsContext || n.isolating) break;
+		s.indexOf(e) > -1 ? c = e : a.before(e) == t && s.splice(1, 0, -e);
+	}
+	let l = s.indexOf(c), u = [], d = r.openStart;
+	for (let e = r.content, t = 0;; t++) {
+		let n = e.firstChild;
+		if (u.push(n), t == r.openStart) break;
+		e = n.content;
+	}
+	for (let e = d - 1; e >= 0; e--) {
+		let t = u[e], n = K(t.type);
+		if (n && !t.sameMarkup(a.node(Math.abs(c) - 1))) d = e;
+		else if (n || !t.type.isTextblock) break;
+	}
+	for (let t = r.openStart; t >= 0; t--) {
+		let c = (t + d + 1) % (r.openStart + 1), f = u[c];
+		if (f) for (let t = 0; t < s.length; t++) {
+			let u = s[(t + l) % s.length], d = !0;
+			u < 0 && (d = !1, u = -u);
+			let p = a.node(u - 1), m = a.index(u - 1);
+			if (p.canReplaceWith(m, m, f.type, f.marks)) return e.replace(a.before(u), d ? o.after(u) : n, new i(J(r.content, 0, r.openStart, c), c, r.openEnd));
+		}
+	}
+	let f = e.steps.length;
+	for (let i = s.length - 1; i >= 0 && (e.replace(t, n, r), !(e.steps.length > f)); i--) {
+		let e = s[i];
+		e < 0 || (t = a.before(e), n = o.after(e));
+	}
+}
+function J(t, n, r, i, a) {
+	if (n < r) {
+		let e = t.firstChild;
+		t = t.replaceChild(0, e.copy(J(e.content, n + 1, r, i, e)));
+	}
+	if (n > i) {
+		let n = a.contentMatchAt(0), r = n.fillBefore(t).append(t);
+		t = r.append(n.matchFragment(r).fillBefore(e.empty, !0));
+	}
+	return t;
+}
+function Y(t, n, r, a) {
+	if (!a.isInline && n == r && t.doc.resolve(n).parent.content.size) {
+		let e = ne(t.doc, n, a.type);
+		e != null && (n = r = e);
+	}
+	t.replaceRange(n, r, new i(e.from(a), 0, 0));
+}
+function ie(e, t, n) {
+	let r = e.doc.resolve(t), i = e.doc.resolve(n);
+	if (r.parent.isTextblock && i.parent.isTextblock && r.start() != i.start() && r.parentOffset == 0 && i.parentOffset == 0) {
+		let a = r.sharedDepth(n), o = !1;
+		for (let e = r.depth; e > a; e--) r.node(e).type.spec.isolating && (o = !0);
+		for (let e = i.depth; e > a; e--) i.node(e).type.spec.isolating && (o = !0);
+		if (!o) {
+			for (let e = r.depth; e > 0 && t == r.start(e); e--) t = r.before(e);
+			for (let e = i.depth; e > 0 && n == i.start(e); e--) n = i.before(e);
+			r = e.doc.resolve(t), i = e.doc.resolve(n);
+		}
+	}
+	let a = X(r, i);
+	for (let t = 0; t < a.length; t++) {
+		let n = a[t], o = t == a.length - 1;
+		if (o && n == 0 || r.node(n).type.contentMatch.validEnd) return e.delete(r.start(n), i.end(n));
+		if (n > 0 && (o || r.node(n - 1).canReplace(r.index(n - 1), i.indexAfter(n - 1)))) return e.delete(r.before(n), i.after(n));
+	}
+	for (let a = 1; a <= r.depth && a <= i.depth; a++) if (t - r.start(a) == r.depth - a && n > r.end(a) && i.end(a) - n != i.depth - a && r.start(a - 1) == i.start(a - 1) && r.node(a - 1).canReplace(r.index(a - 1), i.index(a - 1))) return e.delete(r.before(a), n);
+	e.delete(t, n);
+}
+function X(e, t) {
+	let n = [], r = Math.min(e.depth, t.depth);
+	for (let i = r; i >= 0; i--) {
+		let r = e.start(i);
+		if (r < e.pos - (e.depth - i) || t.end(i) > t.pos + (t.depth - i) || e.node(i).type.spec.isolating || t.node(i).type.spec.isolating) break;
+		(r == t.start(i) || i == e.depth && i == t.depth && e.parent.inlineContent && t.parent.inlineContent && i && t.start(i - 1) == r - 1) && n.push(i);
+	}
+	return n;
+}
+var Z = class t extends v {
+	constructor(e, t, n) {
+		super(), this.pos = e, this.attr = t, this.value = n;
+	}
+	apply(t) {
+		let n = t.nodeAt(this.pos);
+		if (!n) return y.fail("No node at attribute step's position");
+		let r = Object.create(null);
+		for (let e in n.attrs) r[e] = n.attrs[e];
+		r[this.attr] = this.value;
+		let a = n.type.create(r, null, n.marks);
+		return y.fromReplace(t, this.pos, this.pos + 1, new i(e.from(a), 0, +!n.isLeaf));
+	}
+	getMap() {
+		return h.empty;
+	}
+	invert(e) {
+		return new t(this.pos, this.attr, e.nodeAt(this.pos).attrs[this.attr]);
+	}
+	map(e) {
+		let n = e.mapResult(this.pos, 1);
+		return n.deletedAfter ? null : new t(n.pos, this.attr, this.value);
+	}
+	toJSON() {
+		return {
+			stepType: "attr",
+			pos: this.pos,
+			attr: this.attr,
+			value: this.value
+		};
+	}
+	static fromJSON(e, n) {
+		if (typeof n.pos != "number" || typeof n.attr != "string") throw RangeError("Invalid input for AttrStep.fromJSON");
+		return new t(n.pos, n.attr, n.value);
+	}
+};
+v.jsonID("attr", Z);
+var Q = class e extends v {
+	constructor(e, t) {
+		super(), this.attr = e, this.value = t;
+	}
+	apply(e) {
+		let t = Object.create(null);
+		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 y.ok(n);
+	}
+	getMap() {
+		return h.empty;
+	}
+	invert(t) {
+		return new e(this.attr, t.attrs[this.attr]);
+	}
+	map(e) {
+		return this;
+	}
+	toJSON() {
+		return {
+			stepType: "docAttr",
+			attr: this.attr,
+			value: this.value
+		};
+	}
+	static fromJSON(t, n) {
+		if (typeof n.attr != "string") throw RangeError("Invalid input for DocAttrStep.fromJSON");
+		return new e(n.attr, n.value);
+	}
+};
+v.jsonID("docAttr", Q);
+var $ = class extends Error {};
+$ = function e(t) {
+	let n = Error.call(this, t);
+	return n.__proto__ = e.prototype, n;
+}, $.prototype = Object.create(Error.prototype), $.prototype.constructor = $, $.prototype.name = "TransformError";
+var ae = class {
+	constructor(e) {
+		this.doc = e, this.steps = [], this.docs = [], this.mapping = new g();
+	}
+	get before() {
+		return this.docs.length ? this.docs[0] : this.doc;
+	}
+	step(e) {
+		let t = this.maybeStep(e);
+		if (t.failed) throw new $(t.failed);
+		return this;
+	}
+	maybeStep(e) {
+		let t = e.apply(this.doc);
+		return t.failed || this.addStep(e, t.doc), t;
+	}
+	get docChanged() {
+		return this.steps.length > 0;
+	}
+	changedRange() {
+		let e = 1e9, t = -1e9;
+		for (let n = 0; n < this.mapping.maps.length; n++) {
+			let r = this.mapping.maps[n];
+			n && (e = r.map(e, 1), t = r.map(t, -1)), r.forEach((n, r, i, a) => {
+				e = Math.min(e, i), t = Math.max(t, a);
+			});
+		}
+		return e == 1e9 ? null : {
+			from: e,
+			to: t
+		};
+	}
+	addStep(e, t) {
+		this.docs.push(this.doc), this.steps.push(e), this.mapping.appendMap(e.getMap()), this.doc = t;
+	}
+	replace(e, t = e, n = i.empty) {
+		let r = re(this.doc, e, t, n);
+		return r && this.step(r), this;
+	}
+	replaceWith(t, n, r) {
+		return this.replace(t, n, new i(e.from(r), 0, 0));
+	}
+	delete(e, t) {
+		return this.replace(e, t, i.empty);
+	}
+	insert(e, t) {
+		return this.replaceWith(e, e, t);
+	}
+	replaceRange(e, t, n) {
+		return q(this, e, t, n), this;
+	}
+	replaceRangeWith(e, t, n) {
+		return Y(this, e, t, n), this;
+	}
+	deleteRange(e, t) {
+		return ie(this, e, t), this;
+	}
+	lift(e, t) {
+		return ee(this, e, t), this;
+	}
+	join(e, t = 1) {
+		return te(this, e, t), this;
+	}
+	wrap(e, t) {
+		return j(this, e, t), this;
+	}
+	setBlockType(e, t = e, n, r = null) {
+		return M(this, e, t, n, r), this;
+	}
+	setNodeMarkup(e, t, n = null, r) {
+		return I(this, e, t, n, r), this;
+	}
+	setNodeAttribute(e, t, n) {
+		return this.step(new Z(e, t, n)), this;
+	}
+	setDocAttribute(e, t) {
+		return this.step(new Q(e, t)), this;
+	}
+	addNodeMark(e, t) {
+		return this.step(new C(e, t)), this;
+	}
+	removeNodeMark(e, n) {
+		let r = this.doc.nodeAt(e);
+		if (!r) throw RangeError("No node at position " + e);
+		if (n instanceof t) n.isInSet(r.marks) && this.step(new w(e, n));
+		else {
+			let t = r.marks, i, a = [];
+			for (; i = n.isInSet(t);) a.push(new w(e, i)), t = i.removeFromSet(t);
+			for (let e = a.length - 1; e >= 0; e--) this.step(a[e]);
+		}
+		return this;
+	}
+	split(e, t = 1, n) {
+		return L(this, e, t, n), this;
+	}
+	addMark(e, t, n) {
+		return O(this, e, t, n), this;
+	}
+	removeMark(e, t, n) {
+		return k(this, e, t, n), this;
+	}
+	clearIncompatible(e, t, n) {
+		return A(this, e, t, n), this;
+	}
+};
+//#endregion
+export { g as Mapping, E as ReplaceAroundStep, T as ReplaceStep, ae as Transform };