@clevertask/scribe 0.1.4 → 0.1.5

package/dist/dist-CnXCIcnl.js

@@ -0,0 +1,3506 @@
+//#region node_modules/.pnpm/orderedmap@2.1.1/node_modules/orderedmap/dist/index.js
+function e(e) {
+	this.content = e;
+}
+e.prototype = {
+	constructor: e,
+	find: function(e) {
+		for (var t = 0; t < this.content.length; t += 2) if (this.content[t] === e) return t;
+		return -1;
+	},
+	get: function(e) {
+		var t = this.find(e);
+		return t == -1 ? void 0 : this.content[t + 1];
+	},
+	update: function(t, n, r) {
+		var i = r && r != t ? this.remove(r) : this, a = i.find(t), o = i.content.slice();
+		return a == -1 ? o.push(r || t, n) : (o[a + 1] = n, r && (o[a] = r)), new e(o);
+	},
+	remove: function(t) {
+		var n = this.find(t);
+		if (n == -1) return this;
+		var r = this.content.slice();
+		return r.splice(n, 2), new e(r);
+	},
+	addToStart: function(t, n) {
+		return new e([t, n].concat(this.remove(t).content));
+	},
+	addToEnd: function(t, n) {
+		var r = this.remove(t).content.slice();
+		return r.push(t, n), new e(r);
+	},
+	addBefore: function(t, n, r) {
+		var i = this.remove(n), a = i.content.slice(), o = i.find(t);
+		return a.splice(o == -1 ? a.length : o, 0, n, r), new e(a);
+	},
+	forEach: function(e) {
+		for (var t = 0; t < this.content.length; t += 2) e(this.content[t], this.content[t + 1]);
+	},
+	prepend: function(t) {
+		return t = e.from(t), t.size ? new e(t.content.concat(this.subtract(t).content)) : this;
+	},
+	append: function(t) {
+		return t = e.from(t), t.size ? new e(this.subtract(t).content.concat(t.content)) : this;
+	},
+	subtract: function(t) {
+		var n = this;
+		t = e.from(t);
+		for (var r = 0; r < t.content.length; r += 2) n = n.remove(t.content[r]);
+		return n;
+	},
+	toObject: function() {
+		var e = {};
+		return this.forEach(function(t, n) {
+			e[t] = n;
+		}), e;
+	},
+	get size() {
+		return this.content.length >> 1;
+	}
+}, e.from = function(t) {
+	if (t instanceof e) return t;
+	var n = [];
+	if (t) for (var r in t) n.push(r, t[r]);
+	return new e(n);
+};
+//#endregion
+//#region node_modules/.pnpm/prosemirror-model@1.25.11/node_modules/prosemirror-model/dist/index.js
+function t(e, n, a) {
+	for (let o = 0;; o++) {
+		if (o == e.childCount || o == n.childCount) return e.childCount == n.childCount ? null : a;
+		let s = e.child(o), c = n.child(o);
+		if (s == c) {
+			a += s.nodeSize;
+			continue;
+		}
+		if (!s.sameMarkup(c)) return a;
+		if (s.isText && s.text != c.text) {
+			let e = s.text, t = c.text, n = 0;
+			for (; e[n] == t[n]; n++) a++;
+			return n && n < e.length && n < t.length && i(e.charCodeAt(n - 1)) && r(e.charCodeAt(n)) && a--, a;
+		}
+		if (s.content.size || c.content.size) {
+			let e = t(s.content, c.content, a + 1);
+			if (e != null) return e;
+		}
+		a += s.nodeSize;
+	}
+}
+function n(e, t, a, o) {
+	for (let s = e.childCount, c = t.childCount;;) {
+		if (s == 0 || c == 0) return s == c ? null : {
+			a,
+			b: o
+		};
+		let l = e.child(--s), u = t.child(--c), d = l.nodeSize;
+		if (l == u) {
+			a -= d, o -= d;
+			continue;
+		}
+		if (!l.sameMarkup(u)) return {
+			a,
+			b: o
+		};
+		if (l.isText && l.text != u.text) {
+			let e = l.text, t = u.text, n = e.length, s = t.length;
+			for (; n > 0 && s > 0 && e[n - 1] == t[s - 1];) n--, s--, a--, o--;
+			return n && s && n < e.length && i(e.charCodeAt(n - 1)) && r(e.charCodeAt(n)) && (a++, o++), {
+				a,
+				b: o
+			};
+		}
+		if (l.content.size || u.content.size) {
+			let e = n(l.content, u.content, a - 1, o - 1);
+			if (e) return e;
+		}
+		a -= d, o -= d;
+	}
+}
+function r(e) {
+	return e >= 56320 && e < 57344;
+}
+function i(e) {
+	return e >= 55296 && e < 56320;
+}
+var a = class e {
+	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;
+	}
+	nodesBetween(e, t, n, r = 0, i) {
+		for (let a = 0, o = 0; o < t; a++) {
+			let s = this.content[a], c = o + s.nodeSize;
+			if (c > e && n(s, r + o, i || null, a) !== !1 && s.content.size) {
+				let i = o + 1;
+				s.nodesBetween(Math.max(0, e - i), Math.min(s.content.size, t - i), n, r + i);
+			}
+			o = c;
+		}
+	}
+	descendants(e) {
+		this.nodesBetween(0, this.size, e);
+	}
+	textBetween(e, t, n, r) {
+		let i = "", a = !0;
+		return this.nodesBetween(e, t, (o, s) => {
+			let c = o.isText ? o.text.slice(Math.max(e, s) - s, t - s) : o.isLeaf ? r ? typeof r == "function" ? r(o) : r : o.type.spec.leafText ? o.type.spec.leafText(o) : "" : "";
+			o.isBlock && (o.isLeaf && c || o.isTextblock) && n && (a ? a = !1 : i += n), i += c;
+		}, 0), i;
+	}
+	append(t) {
+		if (!t.size) return this;
+		if (!this.size) return t;
+		let n = this.lastChild, r = t.firstChild, i = this.content.slice(), a = 0;
+		for (n.isText && n.sameMarkup(r) && (i[i.length - 1] = n.withText(n.text + r.text), a = 1); a < t.content.length; a++) i.push(t.content[a]);
+		return new e(i, this.size + t.size);
+	}
+	cut(t, n = this.size) {
+		if (t == 0 && n == this.size) return this;
+		let r = [], i = 0;
+		if (n > t) for (let e = 0, a = 0; a < n; e++) {
+			let o = this.content[e], s = a + o.nodeSize;
+			s > t && ((a < t || s > n) && (o = o.isText ? o.cut(Math.max(0, t - a), Math.min(o.text.length, n - a)) : o.cut(Math.max(0, t - a - 1), Math.min(o.content.size, n - a - 1))), r.push(o), i += o.nodeSize), a = s;
+		}
+		return new e(r, i);
+	}
+	cutByIndex(t, n) {
+		return t == n ? e.empty : t == 0 && n == this.content.length ? this : new e(this.content.slice(t, n));
+	}
+	replaceChild(t, n) {
+		let r = this.content[t];
+		if (r == n) return this;
+		let i = this.content.slice(), a = this.size + n.nodeSize - r.nodeSize;
+		return i[t] = n, new e(i, a);
+	}
+	addToStart(t) {
+		return new e([t].concat(this.content), this.size + t.nodeSize);
+	}
+	addToEnd(t) {
+		return new e(this.content.concat(t), this.size + t.nodeSize);
+	}
+	eq(e) {
+		if (this.content.length != e.content.length) return !1;
+		for (let t = 0; t < this.content.length; t++) if (!this.content[t].eq(e.content[t])) return !1;
+		return !0;
+	}
+	get firstChild() {
+		return this.content.length ? this.content[0] : null;
+	}
+	get lastChild() {
+		return this.content.length ? this.content[this.content.length - 1] : null;
+	}
+	get childCount() {
+		return this.content.length;
+	}
+	child(e) {
+		let t = this.content[e];
+		if (!t) throw RangeError("Index " + e + " out of range for " + this);
+		return t;
+	}
+	maybeChild(e) {
+		return this.content[e] || null;
+	}
+	forEach(e) {
+		for (let t = 0, n = 0; t < this.content.length; t++) {
+			let r = this.content[t];
+			e(r, n, t), n += r.nodeSize;
+		}
+	}
+	findDiffStart(e, n = 0) {
+		return t(this, e, n);
+	}
+	findDiffEnd(e, t = this.size, r = e.size) {
+		return n(this, e, t, r);
+	}
+	findIndex(e) {
+		if (e == 0) return s(0, e);
+		if (e == this.size) return s(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), i = n + r.nodeSize;
+			if (i >= e) return i == e ? s(t + 1, i) : s(t, n);
+			n = i;
+		}
+	}
+	toString() {
+		return "<" + this.toStringInner() + ">";
+	}
+	toStringInner() {
+		return this.content.join(", ");
+	}
+	toJSON() {
+		return this.content.length ? this.content.map((e) => e.toJSON()) : null;
+	}
+	static fromJSON(t, n) {
+		if (!n) return e.empty;
+		if (!Array.isArray(n)) throw RangeError("Invalid input for Fragment.fromJSON");
+		return e.fromArray(n.map(t.nodeFromJSON));
+	}
+	static fromArray(t) {
+		if (!t.length) return e.empty;
+		let n, r = 0;
+		for (let e = 0; e < t.length; e++) {
+			let i = t[e];
+			r += i.nodeSize, e && i.isText && t[e - 1].sameMarkup(i) ? (n ||= t.slice(0, e), n[n.length - 1] = i.withText(n[n.length - 1].text + i.text)) : n && n.push(i);
+		}
+		return new e(n || t, r);
+	}
+	static from(t) {
+		if (!t) return e.empty;
+		if (t instanceof e) return t;
+		if (Array.isArray(t)) return this.fromArray(t);
+		if (t.attrs) return new e([t], t.nodeSize);
+		throw RangeError("Can not convert " + t + " to a Fragment" + (t.nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""));
+	}
+};
+a.empty = new a([], 0);
+var o = {
+	index: 0,
+	offset: 0
+};
+function s(e, t) {
+	return o.index = e, o.offset = t, o;
+}
+function c(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 (!c(e[n], t[n])) return !1;
+	} else {
+		for (let n in e) if (!(n in t) || !c(e[n], t[n])) return !1;
+		for (let n in t) if (!(n in e)) return !1;
+	}
+	return !0;
+}
+var l = class e {
+	constructor(e, t) {
+		this.type = e, this.attrs = t;
+	}
+	addToSet(e) {
+		let t, n = !1;
+		for (let r = 0; r < e.length; r++) {
+			let i = e[r];
+			if (this.eq(i)) return e;
+			if (this.type.excludes(i.type)) t ||= e.slice(0, r);
+			else if (i.type.excludes(this.type)) return e;
+			else !n && i.type.rank > this.type.rank && (t ||= e.slice(0, r), t.push(this), n = !0), t && t.push(i);
+		}
+		return t ||= e.slice(), n || t.push(this), t;
+	}
+	removeFromSet(e) {
+		for (let t = 0; t < e.length; t++) if (this.eq(e[t])) return e.slice(0, t).concat(e.slice(t + 1));
+		return e;
+	}
+	isInSet(e) {
+		for (let t = 0; t < e.length; t++) if (this.eq(e[t])) return !0;
+		return !1;
+	}
+	eq(e) {
+		return this == e || this.type == e.type && c(this.attrs, e.attrs);
+	}
+	toJSON() {
+		let e = { type: this.type.name };
+		for (let t in this.attrs) {
+			e.attrs = this.attrs;
+			break;
+		}
+		return e;
+	}
+	static fromJSON(e, t) {
+		if (!t) throw RangeError("Invalid input for Mark.fromJSON");
+		let n = e.marks[t.type];
+		if (!n) throw RangeError(`There is no mark type ${t.type} in this schema`);
+		let r = n.create(t.attrs);
+		return n.checkAttrs(r.attrs), r;
+	}
+	static sameSet(e, t) {
+		if (e == t) return !0;
+		if (e.length != t.length) return !1;
+		for (let n = 0; n < e.length; n++) if (!e[n].eq(t[n])) return !1;
+		return !0;
+	}
+	static setFrom(t) {
+		if (!t || Array.isArray(t) && t.length == 0) return e.none;
+		if (t instanceof e) return [t];
+		let n = t.slice();
+		return n.sort((e, t) => e.type.rank - t.type.rank), n;
+	}
+};
+l.none = [];
+var u = class extends Error {}, d = class e {
+	constructor(e, t, n) {
+		this.content = e, this.openStart = t, this.openEnd = n;
+	}
+	get size() {
+		return this.content.size - this.openStart - this.openEnd;
+	}
+	insertAt(t, n) {
+		let r = p(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(f(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;
+	}
+	toString() {
+		return this.content + "(" + this.openStart + "," + this.openEnd + ")";
+	}
+	toJSON() {
+		if (!this.content.size) return null;
+		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, n) {
+		if (!n) return e.empty;
+		let r = n.openStart || 0, i = n.openEnd || 0;
+		if (typeof r != "number" || typeof i != "number") throw RangeError("Invalid input for Slice.fromJSON");
+		return new e(a.fromJSON(t, n.content), r, i);
+	}
+	static maxOpen(t, n = !0) {
+		let r = 0, i = 0;
+		for (let e = t.firstChild; e && !e.isLeaf && (n || !e.type.spec.isolating); e = e.firstChild) r++;
+		for (let e = t.lastChild; e && !e.isLeaf && (n || !e.type.spec.isolating); e = e.lastChild) i++;
+		return new e(t, r, i);
+	}
+};
+d.empty = new d(a.empty, 0, 0);
+function f(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(f(a.content, t - i - 1, n - i - 1)));
+}
+function p(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 = p(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 m(e, t, n) {
+	if (n.openStart > e.depth) throw new u("Inserted content deeper than insertion position");
+	if (e.depth - n.openStart != t.depth - n.openEnd) throw new u("Inconsistent open depths");
+	return h(e, t, n, 0);
+}
+function h(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 = h(e, t, n, r + 1);
+		return a.copy(a.content.replaceChild(i, o));
+	} else if (!n.content.size) return y(a, b(e, t, r));
+	else if (!n.openStart && !n.openEnd && e.depth == r && t.depth == r) {
+		let r = e.parent, i = r.content;
+		return y(r, i.cut(0, e.parentOffset).append(n.content).append(i.cut(t.parentOffset)));
+	} else {
+		let { start: i, end: o } = ne(n, e);
+		return y(a, te(e, i, o, t, r));
+	}
+}
+function ee(e, t) {
+	if (!t.type.compatibleContent(e.type)) throw new u("Cannot join " + t.type.name + " onto " + e.type.name);
+}
+function g(e, t, n) {
+	let r = e.node(n);
+	return ee(r, t.node(n)), r;
+}
+function _(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 v(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 && (_(e.nodeAfter, r), a++));
+	for (let e = a; e < o; e++) _(i.child(e), r);
+	t && t.depth == n && t.textOffset && _(t.nodeBefore, r);
+}
+function y(e, t) {
+	if (!e.type.validContent(t)) throw new u("Invalid content for node " + e.type.name);
+	return e.copy(t);
+}
+function te(e, t, n, r, i) {
+	let o = e.depth > i && g(e, t, i + 1), s = r.depth > i && g(n, r, i + 1), c = [];
+	return v(null, e, i, c), o && s && t.index(i) == n.index(i) ? (ee(o, s), _(y(o, te(e, t, n, r, i + 1)), c)) : (o && _(y(o, b(e, t, i + 1)), c), v(t, n, i, c), s && _(y(s, b(n, r, i + 1)), c)), v(r, null, i, c), new a(c);
+}
+function b(e, t, n) {
+	let r = [];
+	return v(null, e, n, r), e.depth > n && _(y(g(e, t, n + 1), b(e, t, n + 1)), r), v(t, null, n, r), new a(r);
+}
+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(a.from(r));
+	return {
+		start: r.resolveNoCache(e.openStart + n),
+		end: r.resolveNoCache(r.content.size - e.openEnd - n)
+	};
+}
+var re = class e {
+	constructor(e, t, n) {
+		this.pos = e, this.path = t, this.parentOffset = n, this.depth = t.length / 3 - 1;
+	}
+	resolveDepth(e) {
+		return e == null ? this.depth : e < 0 ? this.depth + e : e;
+	}
+	get parent() {
+		return this.node(this.depth);
+	}
+	get doc() {
+		return this.node(0);
+	}
+	node(e) {
+		return this.path[this.resolveDepth(e) * 3];
+	}
+	index(e) {
+		return this.path[this.resolveDepth(e) * 3 + 1];
+	}
+	indexAfter(e) {
+		return e = this.resolveDepth(e), this.index(e) + (e == this.depth && !this.textOffset ? 0 : 1);
+	}
+	start(e) {
+		return e = this.resolveDepth(e), e == 0 ? 0 : this.path[e * 3 - 1] + 1;
+	}
+	end(e) {
+		return e = this.resolveDepth(e), this.start(e) + this.node(e).content.size;
+	}
+	before(e) {
+		if (e = this.resolveDepth(e), !e) throw RangeError("There is no position before the top-level node");
+		return e == this.depth + 1 ? this.pos : this.path[e * 3 - 1];
+	}
+	after(e) {
+		if (e = this.resolveDepth(e), !e) throw RangeError("There is no position after the top-level node");
+		return e == this.depth + 1 ? this.pos : this.path[e * 3 - 1] + this.path[e * 3].nodeSize;
+	}
+	get textOffset() {
+		return this.pos - this.path[this.path.length - 1];
+	}
+	get nodeAfter() {
+		let e = this.parent, t = this.index(this.depth);
+		if (t == e.childCount) return null;
+		let n = this.pos - this.path[this.path.length - 1], r = e.child(t);
+		return n ? e.child(t).cut(n) : r;
+	}
+	get nodeBefore() {
+		let e = this.index(this.depth), t = this.pos - this.path[this.path.length - 1];
+		return t ? this.parent.child(e).cut(0, t) : e == 0 ? null : this.parent.child(e - 1);
+	}
+	posAtIndex(e, t) {
+		t = this.resolveDepth(t);
+		let n = this.path[t * 3], r = t == 0 ? 0 : this.path[t * 3 - 1] + 1;
+		for (let t = 0; t < e; t++) r += n.child(t).nodeSize;
+		return r;
+	}
+	marks() {
+		let e = this.parent, t = this.index();
+		if (e.content.size == 0) return l.none;
+		if (this.textOffset) return e.child(t).marks;
+		let n = e.maybeChild(t - 1), r = e.maybeChild(t);
+		if (!n) {
+			let e = n;
+			n = r, r = e;
+		}
+		let i = n.marks;
+		for (var a = 0; a < i.length; a++) i[a].type.spec.inclusive === !1 && (!r || !i[a].isInSet(r.marks)) && (i = i[a--].removeFromSet(i));
+		return i;
+	}
+	marksAcross(e) {
+		let t = this.parent.maybeChild(this.index());
+		if (!t || !t.isInline) return null;
+		let n = t.marks, r = e.parent.maybeChild(e.index());
+		for (var i = 0; i < n.length; i++) n[i].type.spec.inclusive === !1 && (!r || !n[i].isInSet(r.marks)) && (n = n[i--].removeFromSet(n));
+		return n;
+	}
+	sharedDepth(e) {
+		for (let t = this.depth; t > 0; t--) if (this.start(t) <= e && this.end(t) >= e) return t;
+		return 0;
+	}
+	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 se(this, e, n);
+		return null;
+	}
+	sameParent(e) {
+		return this.pos - this.parentOffset == e.pos - e.parentOffset;
+	}
+	max(e) {
+		return e.pos > this.pos ? e : this;
+	}
+	min(e) {
+		return e.pos < this.pos ? e : this;
+	}
+	toString() {
+		let e = "";
+		for (let t = 1; t <= this.depth; t++) e += (e ? "/" : "") + this.node(t).type.name + "_" + this.index(t - 1);
+		return e + ":" + this.parentOffset;
+	}
+	static resolve(t, n) {
+		if (!(n >= 0 && n <= t.content.size)) throw RangeError("Position " + n + " out of range");
+		let r = [], i = 0, a = n;
+		for (let e = t;;) {
+			let { index: t, offset: n } = e.content.findIndex(a), o = a - n;
+			if (r.push(e, t, i + n), !o || (e = e.child(t), e.isText)) break;
+			a = o - 1, i += n + 1;
+		}
+		return new e(n, r, a);
+	}
+	static resolveCached(t, n) {
+		let r = oe.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 oe.set(t, r = new ie());
+		let i = r.elts[r.i] = e.resolve(t, n);
+		return r.i = (r.i + 1) % ae, i;
+	}
+}, ie = class {
+	constructor() {
+		this.elts = [], this.i = 0;
+	}
+}, ae = 12, oe = /* @__PURE__ */ new WeakMap(), se = class {
+	constructor(e, t, n) {
+		this.$from = e, this.$to = t, this.depth = n;
+	}
+	get start() {
+		return this.$from.before(this.depth + 1);
+	}
+	get end() {
+		return this.$to.after(this.depth + 1);
+	}
+	get parent() {
+		return this.$from.node(this.depth);
+	}
+	get startIndex() {
+		return this.$from.index(this.depth);
+	}
+	get endIndex() {
+		return this.$to.indexAfter(this.depth);
+	}
+}, ce = Object.create(null), x = class e {
+	constructor(e, t, n, r = l.none) {
+		this.type = e, this.attrs = t, this.marks = r, this.content = n || a.empty;
+	}
+	get children() {
+		return this.content.content;
+	}
+	get nodeSize() {
+		return this.isLeaf ? 1 : 2 + this.content.size;
+	}
+	get childCount() {
+		return this.content.childCount;
+	}
+	child(e) {
+		return this.content.child(e);
+	}
+	maybeChild(e) {
+		return this.content.maybeChild(e);
+	}
+	forEach(e) {
+		this.content.forEach(e);
+	}
+	nodesBetween(e, t, n, r = 0) {
+		this.content.nodesBetween(e, t, n, r, this);
+	}
+	descendants(e) {
+		this.nodesBetween(0, this.content.size, e);
+	}
+	get textContent() {
+		return this.isLeaf && this.type.spec.leafText ? this.type.spec.leafText(this) : this.textBetween(0, this.content.size, "");
+	}
+	textBetween(e, t, n, r) {
+		return this.content.textBetween(e, t, n, r);
+	}
+	get firstChild() {
+		return this.content.firstChild;
+	}
+	get lastChild() {
+		return this.content.lastChild;
+	}
+	eq(e) {
+		return this == e || this.sameMarkup(e) && this.content.eq(e.content);
+	}
+	sameMarkup(e) {
+		return this.hasMarkup(e.type, e.attrs, e.marks);
+	}
+	hasMarkup(e, t, n) {
+		return this.type == e && c(this.attrs, t || e.defaultAttrs || ce) && l.sameSet(this.marks, n || l.none);
+	}
+	copy(t = null) {
+		return t == this.content ? this : new e(this.type, this.attrs, t, this.marks);
+	}
+	mark(t) {
+		return t == this.marks ? this : new e(this.type, this.attrs, this.content, t);
+	}
+	cut(e, t = this.content.size) {
+		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 d.empty;
+		let r = this.resolve(e), i = this.resolve(t), a = n ? 0 : r.sharedDepth(t), o = r.start(a);
+		return new d(r.node(a).content.cut(r.pos - o, i.pos - o), r.depth - a, i.depth - a);
+	}
+	replace(e, t, n) {
+		return m(this.resolve(e), this.resolve(t), n);
+	}
+	nodeAt(e) {
+		for (let t = this;;) {
+			let { index: n, offset: r } = t.content.findIndex(e);
+			if (t = t.maybeChild(n), !t) return null;
+			if (r == e || t.isText) return t;
+			e -= r + 1;
+		}
+	}
+	childAfter(e) {
+		let { index: t, offset: n } = this.content.findIndex(e);
+		return {
+			node: this.content.maybeChild(t),
+			index: t,
+			offset: n
+		};
+	}
+	childBefore(e) {
+		if (e == 0) return {
+			node: null,
+			index: 0,
+			offset: 0
+		};
+		let { index: t, offset: n } = this.content.findIndex(e);
+		if (n < e) return {
+			node: this.content.child(t),
+			index: t,
+			offset: n
+		};
+		let r = this.content.child(t - 1);
+		return {
+			node: r,
+			index: t - 1,
+			offset: n - r.nodeSize
+		};
+	}
+	resolve(e) {
+		return re.resolveCached(this, e);
+	}
+	resolveNoCache(e) {
+		return re.resolve(this, e);
+	}
+	rangeHasMark(e, t, n) {
+		let r = !1;
+		return t > e && this.nodesBetween(e, t, (e) => (n.isInSet(e.marks) && (r = !0), !r)), r;
+	}
+	get isBlock() {
+		return this.type.isBlock;
+	}
+	get isTextblock() {
+		return this.type.isTextblock;
+	}
+	get inlineContent() {
+		return this.type.inlineContent;
+	}
+	get isInline() {
+		return this.type.isInline;
+	}
+	get isText() {
+		return this.type.isText;
+	}
+	get isLeaf() {
+		return this.type.isLeaf;
+	}
+	get isAtom() {
+		return this.type.isAtom;
+	}
+	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() + ")"), ue(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, n = a.empty, r = 0, i = n.childCount) {
+		let o = this.contentMatchAt(e).matchFragment(n, r, i), s = o && o.matchFragment(this.content, t);
+		if (!s || !s.validEnd) return !1;
+		for (let e = r; e < i; e++) if (!this.type.allowsMarks(n.child(e).marks)) return !1;
+		return !0;
+	}
+	canReplaceWith(e, t, n, r) {
+		if (r && !this.type.allowsMarks(r)) return !1;
+		let i = this.contentMatchAt(e).matchType(n), a = i && i.matchFragment(this.content, t);
+		return a ? a.validEnd : !1;
+	}
+	canAppend(e) {
+		return e.content.size ? this.canReplace(this.childCount, this.childCount, e.content) : this.type.compatibleContent(e.type);
+	}
+	check() {
+		this.type.checkContent(this.content), this.type.checkAttrs(this.attrs);
+		let e = l.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 (!l.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() {
+		let e = { type: this.type.name };
+		for (let t in this.attrs) {
+			e.attrs = this.attrs;
+			break;
+		}
+		return this.content.size && (e.content = this.content.toJSON()), this.marks.length && (e.marks = this.marks.map((e) => e.toJSON())), e;
+	}
+	static fromJSON(e, t) {
+		if (!t) throw RangeError("Invalid input for Node.fromJSON");
+		let n;
+		if (t.marks) {
+			if (!Array.isArray(t.marks)) throw RangeError("Invalid mark data for Node.fromJSON");
+			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, n);
+		}
+		let r = a.fromJSON(e, t.content), i = e.nodeType(t.type).create(t.attrs, r, n);
+		return i.type.checkAttrs(i.attrs), i;
+	}
+};
+x.prototype.text = void 0;
+var le = class e extends x {
+	constructor(e, t, n, r) {
+		if (super(e, t, null, r), !n) throw RangeError("Empty text nodes are not allowed");
+		this.text = n;
+	}
+	toString() {
+		return this.type.spec.toDebugString ? this.type.spec.toDebugString(this) : ue(this.marks, JSON.stringify(this.text));
+	}
+	get textContent() {
+		return this.text;
+	}
+	textBetween(e, t) {
+		return this.text.slice(e, t);
+	}
+	get nodeSize() {
+		return this.text.length;
+	}
+	mark(t) {
+		return t == this.marks ? this : new e(this.type, this.attrs, this.text, t);
+	}
+	withText(t) {
+		return t == this.text ? this : new e(this.type, this.attrs, t, this.marks);
+	}
+	cut(e = 0, t = this.text.length) {
+		return e == 0 && t == this.text.length ? this : this.withText(this.text.slice(e, t));
+	}
+	eq(e) {
+		return this.sameMarkup(e) && this.text == e.text;
+	}
+	toJSON() {
+		let e = super.toJSON();
+		return e.text = this.text, e;
+	}
+};
+function ue(e, t) {
+	for (let n = e.length - 1; n >= 0; n--) t = e[n].type.name + "(" + t + ")";
+	return t;
+}
+var S = class e {
+	constructor(e) {
+		this.validEnd = e, this.next = [], this.wrapCache = [];
+	}
+	static parse(t, n) {
+		let r = new de(t, n);
+		if (r.next == null) return e.empty;
+		let i = fe(r);
+		r.next && r.err("Unexpected trailing text");
+		let a = Se(ye(i));
+		return Ce(a, r), a;
+	}
+	matchType(e) {
+		for (let t = 0; t < this.next.length; t++) if (this.next[t].type == e) return this.next[t].next;
+		return null;
+	}
+	matchFragment(e, t = 0, n = e.childCount) {
+		let r = this;
+		for (let i = t; r && i < n; i++) r = r.matchType(e.child(i).type);
+		return r;
+	}
+	get inlineContent() {
+		return this.next.length != 0 && this.next[0].type.isInline;
+	}
+	get defaultType() {
+		for (let e = 0; e < this.next.length; e++) {
+			let { type: t } = this.next[e];
+			if (!(t.isText || t.hasRequiredAttrs())) return t;
+		}
+		return null;
+	}
+	compatible(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, n = 0) {
+		let r = [this];
+		function i(o, s) {
+			let c = o.matchFragment(e, n);
+			if (c && (!t || c.validEnd)) return a.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()) && r.indexOf(n) == -1) {
+					r.push(n);
+					let e = i(n, s.concat(t));
+					if (e) return e;
+				}
+			}
+			return null;
+		}
+		return i(this, []);
+	}
+	findWrapping(e) {
+		for (let t = 0; t < this.wrapCache.length; t += 2) if (this.wrapCache[t] == e) return this.wrapCache[t + 1];
+		let t = this.computeWrapping(e);
+		return this.wrapCache.push(e, t), t;
+	}
+	computeWrapping(e) {
+		let t = Object.create(null), n = [{
+			match: this,
+			type: null,
+			via: null
+		}];
+		for (; n.length;) {
+			let r = n.shift(), i = r.match;
+			if (i.matchType(e)) {
+				let e = [];
+				for (let t = r; t.type; t = t.via) e.push(t.type);
+				return e.reverse();
+			}
+			for (let e = 0; e < i.next.length; e++) {
+				let { type: a, next: o } = i.next[e];
+				!a.isLeaf && !a.hasRequiredAttrs() && !(a.name in t) && (!r.type || o.validEnd) && (n.push({
+					match: a.contentMatch,
+					type: a,
+					via: r
+				}), t[a.name] = !0);
+			}
+		}
+		return null;
+	}
+	get edgeCount() {
+		return this.next.length;
+	}
+	edge(e) {
+		if (e >= this.next.length) throw RangeError(`There's no ${e}th edge in this content match`);
+		return this.next[e];
+	}
+	toString() {
+		let e = [];
+		function t(n) {
+			e.push(n);
+			for (let r = 0; r < n.next.length; r++) e.indexOf(n.next[r].next) == -1 && t(n.next[r].next);
+		}
+		return t(this), e.map((t, n) => {
+			let r = n + (t.validEnd ? "*" : " ") + " ";
+			for (let n = 0; n < t.next.length; n++) r += (n ? ", " : "") + t.next[n].type.name + "->" + e.indexOf(t.next[n].next);
+			return r;
+		}).join("\n");
+	}
+};
+S.empty = new S(!0);
+var de = 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();
+	}
+	get next() {
+		return this.tokens[this.pos];
+	}
+	eat(e) {
+		return this.next == e && (this.pos++ || !0);
+	}
+	err(e) {
+		throw SyntaxError(e + " (in content expression '" + this.string + "')");
+	}
+};
+function fe(e) {
+	let t = [];
+	do
+		t.push(pe(e));
+	while (e.eat("|"));
+	return t.length == 1 ? t[0] : {
+		type: "choice",
+		exprs: t
+	};
+}
+function pe(e) {
+	let t = [];
+	do
+		t.push(me(e));
+	while (e.next && e.next != ")" && e.next != "|");
+	return t.length == 1 ? t[0] : {
+		type: "seq",
+		exprs: t
+	};
+}
+function me(e) {
+	let t = ve(e);
+	for (;;) if (e.eat("+")) t = {
+		type: "plus",
+		expr: t
+	};
+	else if (e.eat("*")) t = {
+		type: "star",
+		expr: t
+	};
+	else if (e.eat("?")) t = {
+		type: "opt",
+		expr: t
+	};
+	else if (e.eat("{")) t = ge(e, t);
+	else break;
+	return t;
+}
+function he(e) {
+	/\D/.test(e.next) && e.err("Expected number, got '" + e.next + "'");
+	let t = Number(e.next);
+	return e.pos++, t;
+}
+function ge(e, t) {
+	let n = he(e), r = n;
+	return e.eat(",") && (r = e.next == "}" ? -1 : he(e)), e.eat("}") || e.err("Unclosed braced range"), {
+		type: "range",
+		min: n,
+		max: r,
+		expr: t
+	};
+}
+function _e(e, t) {
+	let n = e.nodeTypes, r = n[t];
+	if (r) return [r];
+	let i = [];
+	for (let e in n) {
+		let r = n[e];
+		r.isInGroup(t) && i.push(r);
+	}
+	return i.length == 0 && e.err("No node type or group '" + t + "' found"), i;
+}
+function ve(e) {
+	if (e.eat("(")) {
+		let t = fe(e);
+		return e.eat(")") || e.err("Missing closing paren"), t;
+	} else if (/\W/.test(e.next)) e.err("Unexpected token '" + e.next + "'");
+	else {
+		let t = _e(e, e.next).map((t) => (e.inline == null ? e.inline = t.isInline : e.inline != t.isInline && e.err("Mixing inline and block content"), {
+			type: "name",
+			value: t
+		}));
+		return e.pos++, t.length == 1 ? t[0] : {
+			type: "choice",
+			exprs: t
+		};
+	}
+}
+function ye(e) {
+	let t = [[]];
+	return i(a(e, 0), n()), t;
+	function n() {
+		return t.push([]) - 1;
+	}
+	function r(e, n, r) {
+		let i = {
+			term: r,
+			to: n
+		};
+		return t[e].push(i), i;
+	}
+	function i(e, t) {
+		e.forEach((e) => e.to = t);
+	}
+	function a(e, t) {
+		if (e.type == "choice") return e.exprs.reduce((e, n) => e.concat(a(n, t)), []);
+		if (e.type == "seq") for (let r = 0;; r++) {
+			let o = a(e.exprs[r], t);
+			if (r == e.exprs.length - 1) return o;
+			i(o, t = n());
+		}
+		else if (e.type == "star") {
+			let o = n();
+			return r(t, o), i(a(e.expr, o), o), [r(o)];
+		} else if (e.type == "plus") {
+			let o = n();
+			return i(a(e.expr, t), o), i(a(e.expr, o), o), [r(o)];
+		} else if (e.type == "opt") return [r(t)].concat(a(e.expr, t));
+		else if (e.type == "range") {
+			let o = t;
+			for (let t = 0; t < e.min; t++) {
+				let t = n();
+				i(a(e.expr, o), t), o = t;
+			}
+			if (e.max == -1) i(a(e.expr, o), o);
+			else for (let t = e.min; t < e.max; t++) {
+				let t = n();
+				r(o, t), i(a(e.expr, o), t), o = t;
+			}
+			return [r(o)];
+		} else if (e.type == "name") return [r(t, void 0, e.value)];
+		else throw Error("Unknown expr type");
+	}
+}
+function be(e, t) {
+	return t - e;
+}
+function xe(e, t) {
+	let n = [];
+	return r(t), n.sort(be);
+	function r(t) {
+		let i = e[t];
+		if (i.length == 1 && !i[0].term) return r(i[0].to);
+		n.push(t);
+		for (let e = 0; e < i.length; e++) {
+			let { term: t, to: a } = i[e];
+			!t && n.indexOf(a) == -1 && r(a);
+		}
+	}
+}
+function Se(e) {
+	let t = Object.create(null);
+	return n(xe(e, 0));
+	function n(r) {
+		let i = [];
+		r.forEach((t) => {
+			e[t].forEach(({ term: t, to: n }) => {
+				if (!t) return;
+				let r;
+				for (let e = 0; e < i.length; e++) i[e][0] == t && (r = i[e][1]);
+				xe(e, n).forEach((e) => {
+					r || i.push([t, r = []]), r.indexOf(e) == -1 && r.push(e);
+				});
+			});
+		});
+		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(be);
+			a.next.push({
+				type: i[e][0],
+				next: t[r.join(",")] || n(r)
+			});
+		}
+		return a;
+	}
+}
+function Ce(e, t) {
+	for (let n = 0, r = [e]; n < r.length; n++) {
+		let e = r[n], i = !e.validEnd, a = [];
+		for (let t = 0; t < e.next.length; t++) {
+			let { type: n, next: o } = e.next[t];
+			a.push(n.name), i && !(n.isText || n.hasRequiredAttrs()) && (i = !1), r.indexOf(o) == -1 && r.push(o);
+		}
+		i && t.err("Only non-generatable nodes (" + a.join(", ") + ") in a required position (see https://prosemirror.net/docs/guide/#generatable)");
+	}
+}
+function we(e) {
+	let t = Object.create(null);
+	for (let n in e) {
+		let r = e[n];
+		if (!r.hasDefault) return null;
+		t[n] = r.default;
+	}
+	return t;
+}
+function Te(e, t) {
+	let n = Object.create(null);
+	for (let r in e) {
+		let i = t && t[r];
+		if (i === void 0) {
+			let t = e[r];
+			if (t.hasDefault) i = t.default;
+			else throw RangeError("No value supplied for attribute " + r);
+		}
+		n[r] = i;
+	}
+	return n;
+}
+function Ee(e, t, n, r) {
+	for (let i in t) if (!(i in e)) throw RangeError(`Unsupported attribute ${i} for ${n} of type ${r}`);
+	for (let n in e) e[n].validate && e[n].validate(t[n]);
+}
+function De(e, t) {
+	let n = Object.create(null);
+	if (t) for (let r in t) n[r] = new Ae(e, r, t[r]);
+	return n;
+}
+var Oe = class e {
+	constructor(e, t, n) {
+		this.name = e, this.schema = t, this.spec = n, this.markSet = null, this.groups = n.group ? n.group.split(" ") : [], this.attrs = De(e, n.attrs), this.defaultAttrs = we(this.attrs), this.contentMatch = null, this.inlineContent = null, this.isBlock = !(n.inline || e == "text"), this.isText = e == "text";
+	}
+	get isInline() {
+		return !this.isBlock;
+	}
+	get isTextblock() {
+		return this.isBlock && this.inlineContent;
+	}
+	get isLeaf() {
+		return this.contentMatch == S.empty;
+	}
+	get isAtom() {
+		return this.isLeaf || !!this.spec.atom;
+	}
+	isInGroup(e) {
+		return this.groups.indexOf(e) > -1;
+	}
+	get whitespace() {
+		return this.spec.whitespace || (this.spec.code ? "pre" : "normal");
+	}
+	hasRequiredAttrs() {
+		for (let e in this.attrs) if (this.attrs[e].isRequired) return !0;
+		return !1;
+	}
+	compatibleContent(e) {
+		return this == e || this.contentMatch.compatible(e.contentMatch);
+	}
+	computeAttrs(e) {
+		return !e && this.defaultAttrs ? this.defaultAttrs : Te(this.attrs, e);
+	}
+	create(e = null, t, n) {
+		if (this.isText) throw Error("NodeType.create can't construct text nodes");
+		return new x(this, this.computeAttrs(e), a.from(t), l.setFrom(n));
+	}
+	createChecked(e = null, t, n) {
+		return t = a.from(t), this.checkContent(t), new x(this, this.computeAttrs(e), t, l.setFrom(n));
+	}
+	createAndFill(e = null, t, n) {
+		if (e = this.computeAttrs(e), t = a.from(t), t.size) {
+			let e = this.contentMatch.fillBefore(t);
+			if (!e) return null;
+			t = e.append(t);
+		}
+		let r = this.contentMatch.matchFragment(t), i = r && r.fillBefore(a.empty, !0);
+		return i ? new x(this, e, t.append(i), l.setFrom(n)) : null;
+	}
+	validContent(e) {
+		let t = this.contentMatch.matchFragment(e);
+		if (!t || !t.validEnd) return !1;
+		for (let t = 0; t < e.childCount; t++) if (!this.allowsMarks(e.child(t).marks)) return !1;
+		return !0;
+	}
+	checkContent(e) {
+		if (!this.validContent(e)) throw RangeError(`Invalid content for node ${this.name}: ${e.toString().slice(0, 50)}`);
+	}
+	checkAttrs(e) {
+		Ee(this.attrs, e, "node", this.name);
+	}
+	allowsMarkType(e) {
+		return this.markSet == null || this.markSet.indexOf(e) > -1;
+	}
+	allowsMarks(e) {
+		if (this.markSet == null) return !0;
+		for (let t = 0; t < e.length; t++) if (!this.allowsMarkType(e[t].type)) return !1;
+		return !0;
+	}
+	allowedMarks(e) {
+		if (this.markSet == null) return e;
+		let t;
+		for (let n = 0; n < e.length; n++) this.allowsMarkType(e[n].type) ? t && t.push(e[n]) : t ||= e.slice(0, n);
+		return t ? t.length ? t : l.none : e;
+	}
+	static compile(t, n) {
+		let r = Object.create(null);
+		t.forEach((t, i) => r[t] = new e(t, n, i));
+		let i = n.spec.topNode || "doc";
+		if (!r[i]) throw RangeError("Schema is missing its top node type ('" + i + "')");
+		if (!r.text) throw RangeError("Every schema needs a 'text' type");
+		for (let e in r.text.attrs) throw RangeError("The text node type should not have attributes");
+		return r;
+	}
+};
+function ke(e, t, n) {
+	let r = n.split("|");
+	return (n) => {
+		let i = n === null ? "null" : typeof n;
+		if (r.indexOf(i) < 0) throw RangeError(`Expected value of type ${r} for attribute ${t} on type ${e}, got ${i}`);
+	};
+}
+var Ae = class {
+	constructor(e, t, n) {
+		this.hasDefault = Object.prototype.hasOwnProperty.call(n, "default"), this.default = n.default, this.validate = typeof n.validate == "string" ? ke(e, t, n.validate) : n.validate;
+	}
+	get isRequired() {
+		return !this.hasDefault;
+	}
+}, je = class e {
+	constructor(e, t, n, r) {
+		this.name = e, this.rank = t, this.schema = n, this.spec = r, this.attrs = De(e, r.attrs), this.excluded = null;
+		let i = we(this.attrs);
+		this.instance = i ? new l(this, i) : null;
+	}
+	create(e = null) {
+		return !e && this.instance ? this.instance : new l(this, Te(this.attrs, e));
+	}
+	static compile(t, n) {
+		let r = Object.create(null), i = 0;
+		return t.forEach((t, a) => r[t] = new e(t, i++, n, a)), r;
+	}
+	removeFromSet(e) {
+		for (var t = 0; t < e.length; t++) e[t].type == this && (e = e.slice(0, t).concat(e.slice(t + 1)), t--);
+		return e;
+	}
+	isInSet(e) {
+		for (let t = 0; t < e.length; t++) if (e[t].type == this) return e[t];
+	}
+	checkAttrs(e) {
+		Ee(this.attrs, e, "mark", this.name);
+	}
+	excludes(e) {
+		return this.excluded.indexOf(e) > -1;
+	}
+}, Me = class {
+	constructor(t) {
+		this.linebreakReplacement = null, this.cached = Object.create(null);
+		let n = this.spec = {};
+		for (let e in t) n[e] = t[e];
+		n.nodes = e.from(t.nodes), n.marks = e.from(t.marks || {}), this.nodes = Oe.compile(this.spec.nodes, this), this.marks = je.compile(this.spec.marks, this);
+		let r = Object.create(null);
+		for (let e in this.nodes) {
+			if (e in this.marks) throw RangeError(e + " can not be both a node and a mark");
+			let t = this.nodes[e], n = t.spec.content || "", i = t.spec.marks;
+			if (t.contentMatch = r[n] || (r[n] = S.parse(n, this.nodes)), t.inlineContent = t.contentMatch.inlineContent, t.spec.linebreakReplacement) {
+				if (this.linebreakReplacement) throw RangeError("Multiple linebreak nodes defined");
+				if (!t.isInline || !t.isLeaf) throw RangeError("Linebreak replacement nodes must be inline leaf nodes");
+				this.linebreakReplacement = t;
+			}
+			t.markSet = i == "_" ? null : i ? Ne(this, i.split(" ")) : i == "" || !t.inlineContent ? [] : null;
+		}
+		for (let e in this.marks) {
+			let t = this.marks[e], n = t.spec.excludes;
+			t.excluded = n == null ? [t] : n == "" ? [] : Ne(this, n.split(" "));
+		}
+		this.nodeFromJSON = (e) => x.fromJSON(this, e), this.markFromJSON = (e) => l.fromJSON(this, e), this.topNodeType = this.nodes[this.spec.topNode || "doc"], this.cached.wrappings = Object.create(null);
+	}
+	node(e, t = null, n, r) {
+		if (typeof e == "string") e = this.nodeType(e);
+		else if (!(e instanceof Oe)) throw RangeError("Invalid node type: " + e);
+		else if (e.schema != this) throw RangeError("Node type from different schema used (" + e.name + ")");
+		return e.createChecked(t, n, r);
+	}
+	text(e, t) {
+		let n = this.nodes.text;
+		return new le(n, n.defaultAttrs, e, l.setFrom(t));
+	}
+	mark(e, t) {
+		return typeof e == "string" && (e = this.marks[e]), e.create(t);
+	}
+	nodeType(e) {
+		let t = this.nodes[e];
+		if (!t) throw RangeError("Unknown node type: " + e);
+		return t;
+	}
+};
+function Ne(e, t) {
+	let n = [];
+	for (let r = 0; r < t.length; r++) {
+		let i = t[r], a = e.marks[i], o = a;
+		if (a) n.push(a);
+		else for (let t in e.marks) {
+			let r = e.marks[t];
+			(i == "_" || r.spec.group && r.spec.group.split(" ").indexOf(i) > -1) && n.push(o = r);
+		}
+		if (!o) throw SyntaxError("Unknown mark type: '" + t[r] + "'");
+	}
+	return n;
+}
+function Pe(e) {
+	return e.tag != null;
+}
+function Fe(e) {
+	return e.style != null;
+}
+var Ie = class e {
+	constructor(e, t) {
+		this.schema = e, this.rules = t, this.tags = [], this.styles = [];
+		let n = this.matchedStyles = [];
+		t.forEach((e) => {
+			if (Pe(e)) this.tags.push(e);
+			else if (Fe(e)) {
+				let t = /[^=]*/.exec(e.style)[0];
+				n.indexOf(t) < 0 && n.push(t), this.styles.push(e);
+			}
+		}), this.normalizeLists = !this.tags.some((t) => {
+			if (!/^(ul|ol)\b/.test(t.tag) || !t.node) return !1;
+			let n = e.nodes[t.node];
+			return n.contentMatch.matchType(n);
+		});
+	}
+	parse(e, t = {}) {
+		let n = new He(this, t, !1);
+		return n.addAll(e, l.none, t.from, t.to), n.finish();
+	}
+	parseSlice(e, t = {}) {
+		let n = new He(this, t, !0);
+		return n.addAll(e, l.none, t.from, t.to), d.maxOpen(n.finish());
+	}
+	matchTag(e, t, n) {
+		for (let r = n ? this.tags.indexOf(n) + 1 : 0; r < this.tags.length; r++) {
+			let n = this.tags[r];
+			if (We(e, n.tag) && (n.namespace === void 0 || e.namespaceURI == n.namespace) && (!n.context || t.matchesContext(n.context))) {
+				if (n.getAttrs) {
+					let t = n.getAttrs(e);
+					if (t === !1) continue;
+					n.attrs = t || void 0;
+				}
+				return n;
+			}
+		}
+	}
+	matchStyle(e, t, n, r) {
+		for (let i = r ? this.styles.indexOf(r) + 1 : 0; i < this.styles.length; i++) {
+			let r = this.styles[i], a = r.style;
+			if (!(a.indexOf(e) != 0 || r.context && !n.matchesContext(r.context) || a.length > e.length && (a.charCodeAt(e.length) != 61 || a.slice(e.length + 1) != t))) {
+				if (r.getAttrs) {
+					let e = r.getAttrs(t);
+					if (e === !1) continue;
+					r.attrs = e || void 0;
+				}
+				return r;
+			}
+		}
+	}
+	static schemaRules(e) {
+		let t = [];
+		function n(e) {
+			let n = e.priority == null ? 50 : e.priority, r = 0;
+			for (; r < t.length; r++) {
+				let e = t[r];
+				if ((e.priority == null ? 50 : e.priority) < n) break;
+			}
+			t.splice(r, 0, e);
+		}
+		for (let t in e.marks) {
+			let r = e.marks[t].spec.parseDOM;
+			r && r.forEach((e) => {
+				n(e = Ge(e)), e.mark || e.ignore || e.clearMark || (e.mark = t);
+			});
+		}
+		for (let t in e.nodes) {
+			let r = e.nodes[t].spec.parseDOM;
+			r && r.forEach((e) => {
+				n(e = Ge(e)), e.node || e.ignore || e.mark || (e.node = t);
+			});
+		}
+		return t;
+	}
+	static fromSchema(t) {
+		return t.cached.domParser || (t.cached.domParser = new e(t, e.schemaRules(t)));
+	}
+}, Le = {
+	address: !0,
+	article: !0,
+	aside: !0,
+	blockquote: !0,
+	body: !0,
+	canvas: !0,
+	dd: !0,
+	div: !0,
+	dl: !0,
+	fieldset: !0,
+	figcaption: !0,
+	figure: !0,
+	footer: !0,
+	form: !0,
+	h1: !0,
+	h2: !0,
+	h3: !0,
+	h4: !0,
+	h5: !0,
+	h6: !0,
+	header: !0,
+	hgroup: !0,
+	hr: !0,
+	li: !0,
+	noscript: !0,
+	ol: !0,
+	output: !0,
+	p: !0,
+	pre: !0,
+	section: !0,
+	table: !0,
+	tfoot: !0,
+	ul: !0
+}, Re = {
+	head: !0,
+	noscript: !0,
+	object: !0,
+	script: !0,
+	style: !0,
+	title: !0
+}, ze = {
+	ol: !0,
+	ul: !0
+}, C = 1, Be = 2, w = 4;
+function Ve(e, t, n) {
+	return t == null ? e && e.whitespace == "pre" ? 3 : n & -5 : (t ? C : 0) | (t === "full" ? Be : 0);
+}
+var T = class {
+	constructor(e, t, n, r, i, a) {
+		this.type = e, this.attrs = t, this.marks = n, this.solid = r, this.options = a, this.content = [], this.activeMarks = l.none, this.match = i || (a & w ? null : e.contentMatch);
+	}
+	findWrapping(e) {
+		if (!this.match) {
+			if (!this.type) return [];
+			let t = this.type.contentMatch.fillBefore(a.from(e));
+			if (t) this.match = this.type.contentMatch.matchFragment(t);
+			else {
+				let t = this.type.contentMatch, n;
+				return (n = t.findWrapping(e.type)) ? (this.match = t, n) : null;
+			}
+		}
+		return this.match.findWrapping(e.type);
+	}
+	finish(e) {
+		if (!(this.options & C)) {
+			let e = this.content[this.content.length - 1], t;
+			if (e && e.isText && (t = /[ \t\r\n\u000c]+$/.exec(e.text))) {
+				let n = e;
+				e.text.length == t[0].length ? this.content.pop() : this.content[this.content.length - 1] = n.withText(n.text.slice(0, n.text.length - t[0].length));
+			}
+		}
+		let t = a.from(this.content);
+		return !e && this.match && (t = t.append(this.match.fillBefore(a.empty, !0))), this.type ? this.type.create(this.attrs, t, this.marks) : t;
+	}
+	inlineContext(e) {
+		return this.type ? this.type.inlineContent : this.content.length ? this.content[0].isInline : e.parentNode && !Le.hasOwnProperty(e.parentNode.nodeName.toLowerCase());
+	}
+}, He = class {
+	constructor(e, t, n) {
+		this.parser = e, this.options = t, this.isOpen = n, this.open = 0, this.localPreserveWS = !1;
+		let r = t.topNode, i, a = Ve(null, t.preserveWhitespace, 0) | (n ? w : 0);
+		i = r ? new T(r.type, r.attrs, l.none, !0, t.topMatch || r.type.contentMatch, a) : n ? new T(null, null, l.none, !0, null, a) : new T(e.schema.topNodeType, null, l.none, !0, null, a), this.nodes = [i], this.find = t.findPositions, this.needsBlock = !1;
+	}
+	get top() {
+		return this.nodes[this.open];
+	}
+	addDOM(e, t) {
+		e.nodeType == 3 ? this.addTextNode(e, t) : e.nodeType == 1 && this.addElement(e, t);
+	}
+	addTextNode(e, t) {
+		let n = e.nodeValue, r = this.top, i = r.options & Be ? "full" : this.localPreserveWS || (r.options & C) > 0, { schema: a } = this.parser;
+		if (i === "full" || r.inlineContext(e) || /[^ \t\r\n\u000c]/.test(n)) {
+			if (!i) {
+				if (n = n.replace(/[ \t\r\n\u000c]+/g, " "), /^[ \t\r\n\u000c]/.test(n) && this.open == this.nodes.length - 1) {
+					let t = r.content[r.content.length - 1], i = e.previousSibling;
+					(!t || i && i.nodeName == "BR" || t.isText && /[ \t\r\n\u000c]$/.test(t.text)) && (n = n.slice(1));
+				}
+			} else if (i === "full") n = n.replace(/\r\n?/g, "\n");
+			else if (a.linebreakReplacement && /[\r\n]/.test(n) && this.top.findWrapping(a.linebreakReplacement.create())) {
+				let e = n.split(/\r?\n|\r/);
+				for (let n = 0; n < e.length; n++) n && this.insertNode(a.linebreakReplacement.create(), t, !0), e[n] && this.insertNode(a.text(e[n]), t, !/\S/.test(e[n]));
+				n = "";
+			} else n = n.replace(/\r?\n|\r/g, " ");
+			n && this.insertNode(a.text(n), t, !/\S/.test(n)), this.findInText(e);
+		} else this.findInside(e);
+	}
+	addElement(e, t, n) {
+		let r = this.localPreserveWS, i = this.top;
+		(e.tagName == "PRE" || /pre/.test(e.style && e.style.whiteSpace)) && (this.localPreserveWS = !0);
+		let a = e.nodeName.toLowerCase(), o;
+		ze.hasOwnProperty(a) && this.parser.normalizeLists && Ue(e);
+		let s = this.options.ruleFromNode && this.options.ruleFromNode(e) || (o = this.parser.matchTag(e, this, n));
+		out: if (s ? s.ignore : Re.hasOwnProperty(a)) this.findInside(e), this.ignoreFallback(e, t);
+		else if (!s || s.skip || s.closeParent) {
+			s && s.closeParent ? this.open = Math.max(0, this.open - 1) : s && s.skip.nodeType && (e = s.skip);
+			let n, r = this.needsBlock;
+			if (Le.hasOwnProperty(a)) i.content.length && i.content[0].isInline && this.open && (this.open--, i = this.top), n = !0, i.type || (this.needsBlock = !0);
+			else if (!e.firstChild) {
+				this.leafFallback(e, t);
+				break out;
+			}
+			let o = s && s.skip ? t : this.readStyles(e, t);
+			o && this.addAll(e, o), n && this.sync(i), this.needsBlock = r;
+		} else {
+			let n = this.readStyles(e, t);
+			n && this.addElementByRule(e, s, n, s.consuming === !1 ? o : void 0);
+		}
+		this.localPreserveWS = r;
+	}
+	leafFallback(e, t) {
+		e.nodeName == "BR" && this.top.type && this.top.type.inlineContent && this.addTextNode(e.ownerDocument.createTextNode("\n"), t);
+	}
+	ignoreFallback(e, t) {
+		e.nodeName == "BR" && (!this.top.type || !this.top.type.inlineContent) && this.findPlace(this.parser.schema.text("-"), t, !0);
+	}
+	readStyles(e, t) {
+		let n = e.style;
+		if (n && n.length) for (let e = 0; e < this.parser.matchedStyles.length; e++) {
+			let r = this.parser.matchedStyles[e], i = n.getPropertyValue(r);
+			if (i) for (let e;;) {
+				let n = this.parser.matchStyle(r, i, this, e);
+				if (!n) break;
+				if (n.ignore) return null;
+				if (t = n.clearMark ? t.filter((e) => !n.clearMark(e)) : t.concat(this.parser.schema.marks[n.mark].create(n.attrs)), n.consuming === !1) e = n;
+				else break;
+			}
+		}
+		return t;
+	}
+	addElementByRule(e, t, n, r) {
+		let i, a;
+		if (t.node) if (a = this.parser.schema.nodes[t.node], a.isLeaf) this.insertNode(a.create(t.attrs), n, e.nodeName == "BR") || this.leafFallback(e, n);
+		else {
+			let e = this.enter(a, t.attrs || null, n, t.preserveWhitespace);
+			e && (i = !0, n = e);
+		}
+		else {
+			let e = this.parser.schema.marks[t.mark];
+			n = n.concat(e.create(t.attrs));
+		}
+		let o = this.top;
+		if (a && a.isLeaf) this.findInside(e);
+		else if (r) this.addElement(e, n, r);
+		else if (t.getContent) this.findInside(e), t.getContent(e, this.parser.schema).forEach((e) => this.insertNode(e, n, !1));
+		else {
+			let r = e;
+			typeof t.contentElement == "string" ? r = e.querySelector(t.contentElement) : typeof t.contentElement == "function" ? r = t.contentElement(e) : t.contentElement && (r = t.contentElement), this.findAround(e, r, !0), this.addAll(r, n), this.findAround(e, r, !1);
+		}
+		i && this.sync(o) && this.open--;
+	}
+	addAll(e, t, n, r) {
+		let i = n || 0;
+		for (let a = n ? e.childNodes[n] : e.firstChild, o = r == null ? null : e.childNodes[r]; a != o; a = a.nextSibling, ++i) this.findAtPoint(e, i), this.addDOM(a, t);
+		this.findAtPoint(e, i);
+	}
+	findPlace(e, t, n) {
+		let r, i;
+		for (let t = this.open, a = 0; t >= 0; t--) {
+			let o = this.nodes[t], s = o.findWrapping(e);
+			if (s && (!r || r.length > s.length + a) && (r = s, i = o, !s.length)) break;
+			if (o.solid) {
+				if (n) break;
+				a += 2;
+			}
+		}
+		if (!r) return null;
+		this.sync(i);
+		for (let e = 0; e < r.length; e++) t = this.enterInner(r[e], null, t, !1);
+		return t;
+	}
+	insertNode(e, t, n) {
+		if (e.isInline && this.needsBlock && !this.top.type) {
+			let e = this.textblockFromContext();
+			e && (t = this.enterInner(e, null, t));
+		}
+		let r = this.findPlace(e, t, n);
+		if (r) {
+			this.closeExtra();
+			let t = this.top;
+			t.match &&= t.match.matchType(e.type);
+			let n = l.none;
+			for (let i of r.concat(e.marks)) (t.type ? t.type.allowsMarkType(i.type) : Ke(i.type, e.type)) && (n = i.addToSet(n));
+			return t.content.push(e.mark(n)), !0;
+		}
+		return !1;
+	}
+	enter(e, t, n, r) {
+		let i = this.findPlace(e.create(t), n, !1);
+		return i &&= this.enterInner(e, t, n, !0, r), i;
+	}
+	enterInner(e, t, n, r = !1, i) {
+		this.closeExtra();
+		let a = this.top;
+		a.match = a.match && a.match.matchType(e);
+		let o = Ve(e, i, a.options);
+		a.options & w && a.content.length == 0 && (o |= w);
+		let s = l.none;
+		return n = n.filter((t) => (a.type ? a.type.allowsMarkType(t.type) : Ke(t.type, e)) ? (s = t.addToSet(s), !1) : !0), this.nodes.push(new T(e, t, s, r, null, o)), this.open++, n;
+	}
+	closeExtra(e = !1) {
+		let t = this.nodes.length - 1;
+		if (t > this.open) {
+			for (; t > this.open; t--) this.nodes[t - 1].content.push(this.nodes[t].finish(e));
+			this.nodes.length = this.open + 1;
+		}
+	}
+	finish() {
+		return this.open = 0, this.closeExtra(this.isOpen), this.nodes[0].finish(!!(this.isOpen || this.options.topOpen));
+	}
+	sync(e) {
+		for (let t = this.open; t >= 0; t--) if (this.nodes[t] == e) return this.open = t, !0;
+		else this.localPreserveWS && (this.nodes[t].options |= C);
+		return !1;
+	}
+	get currentPos() {
+		this.closeExtra();
+		let e = 0;
+		for (let t = this.open; t >= 0; t--) {
+			let n = this.nodes[t].content;
+			for (let t = n.length - 1; t >= 0; t--) e += n[t].nodeSize;
+			t && e++;
+		}
+		return e;
+	}
+	findAtPoint(e, t) {
+		if (this.find) for (let n = 0; n < this.find.length; n++) this.find[n].node == e && this.find[n].offset == t && (this.find[n].pos = this.currentPos);
+	}
+	findInside(e) {
+		if (this.find) for (let t = 0; t < this.find.length; t++) this.find[t].pos == null && e.nodeType == 1 && e.contains(this.find[t].node) && (this.find[t].pos = this.currentPos);
+	}
+	findAround(e, t, n) {
+		if (e != t && this.find) for (let r = 0; r < this.find.length; r++) this.find[r].pos == null && e.nodeType == 1 && e.contains(this.find[r].node) && t.compareDocumentPosition(this.find[r].node) & (n ? 2 : 4) && (this.find[r].pos = this.currentPos);
+	}
+	findInText(e) {
+		if (this.find) for (let t = 0; t < this.find.length; t++) this.find[t].node == e && (this.find[t].pos = this.currentPos - (e.nodeValue.length - this.find[t].offset));
+	}
+	matchesContext(e) {
+		if (e.indexOf("|") > -1) return e.split(/\s*\|\s*/).some(this.matchesContext, this);
+		let t = e.split("/"), n = this.options.context, r = !this.isOpen && (!n || n.parent.type == this.nodes[0].type), i = -(n ? n.depth + 1 : 0) + +!r, a = (e, o) => {
+			for (; e >= 0; e--) {
+				let s = t[e];
+				if (s == "") {
+					if (e == t.length - 1 || e == 0) continue;
+					for (; o >= i; o--) if (a(e - 1, o)) return !0;
+					return !1;
+				} else {
+					let e = o > 0 || o == 0 && r ? this.nodes[o].type : n && o >= i ? n.node(o - i).type : null;
+					if (!e || e.name != s && !e.isInGroup(s)) return !1;
+					o--;
+				}
+			}
+			return !0;
+		};
+		return a(t.length - 1, this.open);
+	}
+	textblockFromContext() {
+		let e = this.options.context;
+		if (e) for (let t = e.depth; t >= 0; t--) {
+			let n = e.node(t).contentMatchAt(e.indexAfter(t)).defaultType;
+			if (n && n.isTextblock && n.defaultAttrs) return n;
+		}
+		for (let e in this.parser.schema.nodes) {
+			let t = this.parser.schema.nodes[e];
+			if (t.isTextblock && t.defaultAttrs) return t;
+		}
+	}
+};
+function Ue(e) {
+	for (let t = e.firstChild, n = null; t; t = t.nextSibling) {
+		let e = t.nodeType == 1 ? t.nodeName.toLowerCase() : null;
+		e && ze.hasOwnProperty(e) && n ? (n.appendChild(t), t = n) : e == "li" ? n = t : e && (n = null);
+	}
+}
+function We(e, t) {
+	return (e.matches || e.msMatchesSelector || e.webkitMatchesSelector || e.mozMatchesSelector).call(e, t);
+}
+function Ge(e) {
+	let t = {};
+	for (let n in e) t[n] = e[n];
+	return t;
+}
+function Ke(e, t) {
+	let n = t.schema.nodes;
+	for (let r in n) {
+		let i = n[r];
+		if (!i.allowsMarkType(e)) continue;
+		let a = [], o = (e) => {
+			a.push(e);
+			for (let n = 0; n < e.edgeCount; n++) {
+				let { type: r, next: i } = e.edge(n);
+				if (r == t || a.indexOf(i) < 0 && o(i)) return !0;
+			}
+		};
+		if (o(i.contentMatch)) return !0;
+	}
+}
+var qe = class e {
+	constructor(e, t) {
+		this.nodes = e, this.marks = t;
+	}
+	serializeFragment(e, t = {}, n) {
+		n ||= E(t).createDocumentFragment();
+		let r = n, i = [];
+		return e.forEach((e) => {
+			if (i.length || e.marks.length) {
+				let n = 0, a = 0;
+				for (; n < i.length && a < e.marks.length;) {
+					let t = e.marks[a];
+					if (!this.marks[t.type.name]) {
+						a++;
+						continue;
+					}
+					if (!t.eq(i[n][0]) || t.type.spec.spanning === !1) break;
+					n++, a++;
+				}
+				for (; n < i.length;) r = i.pop()[1];
+				for (; a < e.marks.length;) {
+					let n = e.marks[a++], o = this.serializeMark(n, e.isInline, t);
+					o && (i.push([n, r]), r.appendChild(o.dom), r = o.contentDOM || o.dom);
+				}
+			}
+			r.appendChild(this.serializeNodeInner(e, t));
+		}), n;
+	}
+	serializeNodeInner(e, t) {
+		if (e.isText) return E(t).createTextNode(e.text);
+		let { dom: n, contentDOM: r } = D(E(t), this.nodes[e.type.name](e), null, e.attrs);
+		if (r) {
+			if (e.isLeaf) throw RangeError("Content hole not allowed in a leaf node spec");
+			this.serializeFragment(e.content, t, r);
+		}
+		return n;
+	}
+	serializeNode(e, t = {}) {
+		let n = this.serializeNodeInner(e, t);
+		for (let r = e.marks.length - 1; r >= 0; r--) {
+			let i = this.serializeMark(e.marks[r], e.isInline, t);
+			i && ((i.contentDOM || i.dom).appendChild(n), n = i.dom);
+		}
+		return n;
+	}
+	serializeMark(e, t, n = {}) {
+		let r = this.marks[e.type.name];
+		return r && D(E(n), r(e, t), null, e.attrs);
+	}
+	static renderSpec(e, t, n = null, r) {
+		return typeof t == "string" ? { dom: e.createTextNode(t) } : D(e, t, n, r);
+	}
+	static fromSchema(t) {
+		return t.cached.domSerializer || (t.cached.domSerializer = new e(this.nodesFromSchema(t), this.marksFromSchema(t)));
+	}
+	static nodesFromSchema(e) {
+		let t = Je(e.nodes);
+		return t.text ||= (e) => e.text, t;
+	}
+	static marksFromSchema(e) {
+		return Je(e.marks);
+	}
+};
+function Je(e) {
+	let t = {};
+	for (let n in e) {
+		let r = e[n].spec.toDOM;
+		r && (t[n] = r);
+	}
+	return t;
+}
+function E(e) {
+	return e.document || window.document;
+}
+var Ye = /* @__PURE__ */ new WeakMap();
+function Xe(e) {
+	let t = Ye.get(e);
+	return t === void 0 && Ye.set(e, t = Ze(e)), t;
+}
+function Ze(e) {
+	let t = null;
+	function n(e) {
+		if (e && typeof e == "object") if (Array.isArray(e)) if (typeof e[0] == "string") t ||= [], t.push(e);
+		else for (let t = 0; t < e.length; t++) n(e[t]);
+		else for (let t in e) n(e[t]);
+	}
+	return n(e), t;
+}
+function D(e, t, n, r) {
+	if (t.nodeType == 1) return { dom: t };
+	if (t.dom && t.dom.nodeType == 1) return t;
+	let i = t[0], a;
+	if (typeof i != "string") throw RangeError("Invalid array passed to renderSpec");
+	if (r && (a = Xe(r)) && a.indexOf(t) > -1) throw RangeError("Using an array from an attribute object as a DOM spec. This may be an attempted cross site scripting attack.");
+	let o = i.indexOf(" ");
+	o > 0 && (n = i.slice(0, o), i = i.slice(o + 1));
+	let s, c = n ? e.createElementNS(n, i) : e.createElement(i), l = t[1], u = 1;
+	if (l && typeof l == "object" && l.nodeType == null && !Array.isArray(l)) {
+		u = 2;
+		for (let e in l) if (l[e] != null) {
+			let t = e.indexOf(" ");
+			t > 0 ? c.setAttributeNS(e.slice(0, t), e.slice(t + 1), l[e]) : e == "style" && c.style ? c.style.cssText = l[e] : c.setAttribute(e, l[e]);
+		}
+	}
+	for (let i = u; i < t.length; i++) {
+		let a = t[i];
+		if (a === 0) {
+			if (i < t.length - 1 || i > u) throw RangeError("Content hole must be the only child of its parent node");
+			return {
+				dom: c,
+				contentDOM: c
+			};
+		} else if (typeof a == "string") c.appendChild(e.createTextNode(a));
+		else {
+			let { dom: t, contentDOM: i } = D(e, a, n, r);
+			if (c.appendChild(t), i) {
+				if (s) throw RangeError("Multiple content holes");
+				s = i;
+			}
+		}
+	}
+	return {
+		dom: c,
+		contentDOM: s
+	};
+}
+//#endregion
+//#region node_modules/.pnpm/prosemirror-transform@1.12.0/node_modules/prosemirror-transform/dist/index.js
+var Qe = 65535, $e = 2 ** 16;
+function et(e, t) {
+	return e + t * $e;
+}
+function tt(e) {
+	return e & Qe;
+}
+function nt(e) {
+	return (e - (e & Qe)) / $e;
+}
+var rt = 1, it = 2, at = 4, ot = 8, O = class {
+	constructor(e, t, n) {
+		this.pos = e, this.delInfo = t, this.recover = n;
+	}
+	get deleted() {
+		return (this.delInfo & ot) > 0;
+	}
+	get deletedBefore() {
+		return (this.delInfo & 5) > 0;
+	}
+	get deletedAfter() {
+		return (this.delInfo & 6) > 0;
+	}
+	get deletedAcross() {
+		return (this.delInfo & at) > 0;
+	}
+}, k = 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 = tt(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 + nt(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 s = this.ranges[o] - (this.inverted ? r : 0);
+			if (s > e) break;
+			let c = this.ranges[o + i], l = this.ranges[o + a], u = s + c;
+			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 : et(o / 3, e - s), f = e == s ? it : e == u ? rt : at;
+				return (t < 0 ? e != s : e != u) && (f |= ot), new O(a, f, d);
+			}
+			r += l - c;
+		}
+		return n ? e + r : new O(e + r, 0, null);
+	}
+	touches(e, t) {
+		let n = 0, r = tt(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
+		]);
+	}
+};
+k.empty = new k([]);
+var st = 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 O(e, r, null);
+	}
+}, A = Object.create(null), j = class {
+	getMap() {
+		return k.empty;
+	}
+	merge(e) {
+		return null;
+	}
+	static fromJSON(e, t) {
+		if (!t || !t.stepType) throw RangeError("Invalid input for Step.fromJSON");
+		let n = A[t.stepType];
+		if (!n) throw RangeError(`No step type ${t.stepType} defined`);
+		return n.fromJSON(e, t);
+	}
+	static jsonID(e, t) {
+		if (e in A) throw RangeError("Duplicate use of step JSON ID " + e);
+		return A[e] = t, t.prototype.jsonID = e, t;
+	}
+}, M = 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, r, i) {
+		try {
+			return e.ok(t.replace(n, r, i));
+		} catch (t) {
+			if (t instanceof u) return e.fail(t.message);
+			throw t;
+		}
+	}
+};
+function N(e, t, n) {
+	let r = [];
+	for (let i = 0; i < e.childCount; i++) {
+		let a = e.child(i);
+		a.content.size && (a = a.copy(N(a.content, t, a))), a.isInline && (a = t(a, n, i)), r.push(a);
+	}
+	return a.fromArray(r);
+}
+var P = class e extends j {
+	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 d(N(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 M.fromReplace(e, this.from, this.to, i);
+	}
+	invert() {
+		return new F(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));
+	}
+};
+j.jsonID("addMark", P);
+var F = class e extends j {
+	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 d(N(t.content, (e) => e.mark(this.mark.removeFromSet(e.marks)), e), t.openStart, t.openEnd);
+		return M.fromReplace(e, this.from, this.to, n);
+	}
+	invert() {
+		return new P(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));
+	}
+};
+j.jsonID("removeMark", F);
+var I = class e extends j {
+	constructor(e, t) {
+		super(), this.pos = e, this.mark = t;
+	}
+	apply(e) {
+		let t = e.nodeAt(this.pos);
+		if (!t) return M.fail("No node at mark step's position");
+		let n = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
+		return M.fromReplace(e, this.pos, this.pos + 1, new d(a.from(n), 0, +!t.isLeaf));
+	}
+	invert(t) {
+		let n = t.nodeAt(this.pos);
+		if (n) {
+			let t = this.mark.addToSet(n.marks);
+			if (t.length == n.marks.length) {
+				for (let r = 0; r < n.marks.length; r++) if (!n.marks[r].isInSet(t)) return new e(this.pos, n.marks[r]);
+				return new e(this.pos, this.mark);
+			}
+		}
+		return new L(this.pos, this.mark);
+	}
+	map(t) {
+		let n = t.mapResult(this.pos, 1);
+		return n.deletedAfter ? null : new e(n.pos, this.mark);
+	}
+	toJSON() {
+		return {
+			stepType: "addNodeMark",
+			pos: this.pos,
+			mark: this.mark.toJSON()
+		};
+	}
+	static fromJSON(t, n) {
+		if (typeof n.pos != "number") throw RangeError("Invalid input for AddNodeMarkStep.fromJSON");
+		return new e(n.pos, t.markFromJSON(n.mark));
+	}
+};
+j.jsonID("addNodeMark", I);
+var L = class e extends j {
+	constructor(e, t) {
+		super(), this.pos = e, this.mark = t;
+	}
+	apply(e) {
+		let t = e.nodeAt(this.pos);
+		if (!t) return M.fail("No node at mark step's position");
+		let n = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
+		return M.fromReplace(e, this.pos, this.pos + 1, new d(a.from(n), 0, +!t.isLeaf));
+	}
+	invert(e) {
+		let t = e.nodeAt(this.pos);
+		return !t || !this.mark.isInSet(t.marks) ? this : new I(this.pos, this.mark);
+	}
+	map(t) {
+		let n = t.mapResult(this.pos, 1);
+		return n.deletedAfter ? null : new e(n.pos, this.mark);
+	}
+	toJSON() {
+		return {
+			stepType: "removeNodeMark",
+			pos: this.pos,
+			mark: this.mark.toJSON()
+		};
+	}
+	static fromJSON(t, n) {
+		if (typeof n.pos != "number") throw RangeError("Invalid input for RemoveNodeMarkStep.fromJSON");
+		return new e(n.pos, t.markFromJSON(n.mark));
+	}
+};
+j.jsonID("removeNodeMark", L);
+var R = class e extends j {
+	constructor(e, t, n, r = !1) {
+		super(), this.from = e, this.to = t, this.slice = n, this.structure = r;
+	}
+	apply(e) {
+		return this.structure && B(e, this.from, this.to) ? M.fail("Structure replace would overwrite content") : M.fromReplace(e, this.from, this.to, this.slice);
+	}
+	getMap() {
+		return new k([
+			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 ? d.empty : new d(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 ? d.empty : new d(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, d.fromJSON(t, n.slice), !!n.structure);
+	}
+};
+R.MAP_BIAS = 1, j.jsonID("replace", R);
+var z = class e extends j {
+	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 && (B(e, this.from, this.gapFrom) || B(e, this.gapTo, this.to))) return M.fail("Structure gap-replace would overwrite content");
+		let t = e.slice(this.gapFrom, this.gapTo);
+		if (t.openStart || t.openEnd) return M.fail("Gap is not a flat range");
+		let n = this.slice.insertAt(this.insert, t.content);
+		return n ? M.fromReplace(e, this.from, this.to, n) : M.fail("Content does not fit in gap");
+	}
+	getMap() {
+		return new k([
+			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, d.fromJSON(t, n.slice), n.insert, !!n.structure);
+	}
+};
+j.jsonID("replaceAround", z);
+function B(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 ct(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 F(l, d, u[e])));
+			s && s.to == l ? s.to = d : a.push(s = new P(l, d, r));
+		}
+	}), i.forEach((t) => e.step(t)), a.forEach((t) => e.step(t));
+}
+function lt(e, t, n, r) {
+	let i = [], a = 0;
+	e.doc.nodesBetween(t, n, (e, o) => {
+		if (!e.isInline) return;
+		a++;
+		let s = null;
+		if (r instanceof je) {
+			let t = e.marks, n;
+			for (; n = r.isInSet(t);) (s ||= []).push(n), t = n.removeFromSet(t);
+		} else r ? r.isInSet(e.marks) && (s = [r]) : s = e.marks;
+		if (s && s.length) {
+			let r = Math.min(o + e.nodeSize, n);
+			for (let e = 0; e < s.length; e++) {
+				let n = s[e], c;
+				for (let e = 0; e < i.length; e++) {
+					let t = i[e];
+					t.step == a - 1 && n.eq(i[e].style) && (c = t);
+				}
+				c ? (c.to = r, c.step = a) : i.push({
+					style: n,
+					from: Math.max(o, t),
+					to: r,
+					step: a
+				});
+			}
+		}
+	}), i.forEach((t) => e.step(new F(t.from, t.to, t.style)));
+}
+function V(e, t, n, r = n.contentMatch, i = !0) {
+	let o = e.doc.nodeAt(t), s = [], c = t + 1;
+	for (let t = 0; t < o.childCount; t++) {
+		let l = o.child(t), u = c + l.nodeSize, f = r.matchType(l.type);
+		if (!f) s.push(new R(c, u, d.empty));
+		else {
+			r = f;
+			for (let t = 0; t < l.marks.length; t++) n.allowsMarkType(l.marks[t].type) || e.step(new F(c, u, l.marks[t]));
+			if (i && l.isText && n.whitespace != "pre") {
+				let e, t = /\r?\n|\r/g, r;
+				for (; e = t.exec(l.text);) r ||= new d(a.from(n.schema.text(" ", n.allowedMarks(l.marks))), 0, 0), s.push(new R(c + e.index, c + e.index + e[0].length, r));
+			}
+		}
+		c = u;
+	}
+	if (!r.validEnd) {
+		let t = r.fillBefore(a.empty, !0);
+		e.replace(c, c, new d(t, 0, 0));
+	}
+	for (let t = s.length - 1; t >= 0; t--) e.step(s[t]);
+}
+function ut(e, t, n) {
+	return (t == 0 || e.canReplace(t, e.childCount)) && (n == e.childCount || e.canReplace(0, n));
+}
+function dt(e) {
+	let t = e.parent.content.cutByIndex(e.startIndex, e.endIndex);
+	for (let n = e.depth, r = 0, i = 0;; --n) {
+		let a = e.$from.node(n), o = e.$from.index(n) + r, s = e.$to.indexAfter(n) - i;
+		if (n < e.depth && a.canReplace(o, s, t)) return n;
+		if (n == 0 || a.type.spec.isolating || !ut(a, o, s)) break;
+		o && (r = 1), s < a.childCount && (i = 1);
+	}
+	return null;
+}
+function ft(e, t, n) {
+	let { $from: r, $to: i, depth: o } = t, s = r.before(o + 1), c = i.after(o + 1), l = s, u = c, f = a.empty, p = 0;
+	for (let e = o, t = !1; e > n; e--) t || r.index(e) > 0 ? (t = !0, f = a.from(r.node(e).copy(f)), p++) : l--;
+	let m = a.empty, h = 0;
+	for (let e = o, t = !1; e > n; e--) t || i.after(e + 1) < i.end(e) ? (t = !0, m = a.from(i.node(e).copy(m)), h++) : u++;
+	e.step(new z(l, u, s, c, new d(f.append(m), p, h), f.size - p, !0));
+}
+function pt(e, t, n = null, r = e) {
+	let i = ht(e, t), a = i && gt(r, t);
+	return a ? i.map(mt).concat({
+		type: t,
+		attrs: n
+	}).concat(a.map(mt)) : null;
+}
+function mt(e) {
+	return {
+		type: e,
+		attrs: null
+	};
+}
+function ht(e, t) {
+	let { parent: n, startIndex: r, endIndex: i } = e, a = n.contentMatchAt(r).findWrapping(t);
+	if (!a) return null;
+	let o = a.length ? a[0] : t;
+	return n.canReplaceWith(r, i, o) ? a : null;
+}
+function gt(e, t) {
+	let { parent: n, startIndex: r, endIndex: i } = e, a = n.child(r), o = t.contentMatch.findWrapping(a.type);
+	if (!o) return null;
+	let s = (o.length ? o[o.length - 1] : t).contentMatch;
+	for (let e = r; s && e < i; e++) s = s.matchType(n.child(e).type);
+	return !s || !s.validEnd ? null : o;
+}
+function _t(e, t, n) {
+	let r = a.empty;
+	for (let e = n.length - 1; e >= 0; e--) {
+		if (r.size) {
+			let t = n[e].type.contentMatch.matchFragment(r);
+			if (!t || !t.validEnd) throw RangeError("Wrapper type given to Transform.wrap does not form valid content of its parent wrapper");
+		}
+		r = a.from(n[e].type.create(n[e].attrs, r));
+	}
+	let i = t.start, o = t.end;
+	e.step(new z(i, o, i, o, new d(r, 0, 0), n.length, !0));
+}
+function vt(e, t, n, r, i) {
+	if (!r.isTextblock) throw RangeError("Type given to setBlockType should be a textblock");
+	let o = e.steps.length;
+	e.doc.nodesBetween(t, n, (t, n) => {
+		let s = typeof i == "function" ? i(t) : i;
+		if (t.isTextblock && !t.hasMarkup(r, s) && xt(e.doc, e.mapping.slice(o).map(n), r)) {
+			let i = null;
+			if (r.schema.linebreakReplacement) {
+				let e = r.whitespace == "pre", t = !!r.contentMatch.matchType(r.schema.linebreakReplacement);
+				e && !t ? i = !1 : !e && t && (i = !0);
+			}
+			i === !1 && bt(e, t, n, o), V(e, e.mapping.slice(o).map(n, 1), r, void 0, i === null);
+			let c = e.mapping.slice(o), l = c.map(n, 1), u = c.map(n + t.nodeSize, 1);
+			return e.step(new z(l, u, l + 1, u - 1, new d(a.from(r.create(s, null, t.marks)), 0, 0), 1, !0)), i === !0 && yt(e, t, n, o), !1;
+		}
+	});
+}
+function yt(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 bt(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 xt(e, t, n) {
+	let r = e.resolve(t), i = r.index();
+	return r.parent.canReplaceWith(i, i + 1, n);
+}
+function St(e, t, n, r, i) {
+	let o = e.doc.nodeAt(t);
+	if (!o) throw RangeError("No node at given position");
+	n ||= o.type;
+	let s = n.create(r, null, i || o.marks);
+	if (o.isLeaf) return e.replaceWith(t, t + o.nodeSize, s);
+	if (!n.validContent(o.content)) throw RangeError("Invalid content for node type " + n.name);
+	e.step(new z(t, t + o.nodeSize, t + 1, t + o.nodeSize - 1, new d(a.from(s), 0, 0), 1, !0));
+}
+function Ct(e, t, n = 1, r) {
+	let i = e.resolve(t), a = i.depth - n, o = r && r[r.length - 1] || i.parent;
+	if (a < 0 || i.parent.type.spec.isolating || !i.parent.canReplace(i.index(), i.parent.childCount) || !o.type.validContent(i.parent.content.cutByIndex(i.index(), i.parent.childCount))) return !1;
+	for (let e = i.depth - 1, t = n - 2; e > a; e--, t--) {
+		let n = i.node(e), a = i.index(e);
+		if (n.type.spec.isolating) return !1;
+		let o = n.content.cutByIndex(a, n.childCount), s = r && r[t + 1];
+		s && (o = o.replaceChild(0, s.type.create(s.attrs)));
+		let c = r && r[t] || n;
+		if (!n.canReplace(a + 1, n.childCount) || !c.type.validContent(o)) return !1;
+	}
+	let s = i.indexAfter(a), c = r && r[0];
+	return i.node(a).canReplaceWith(s, s, c ? c.type : i.node(a + 1).type);
+}
+function wt(e, t, n = 1, r) {
+	let i = e.doc.resolve(t), o = a.empty, s = a.empty;
+	for (let e = i.depth, t = i.depth - n, c = n - 1; e > t; e--, c--) {
+		o = a.from(i.node(e).copy(o));
+		let t = r && r[c];
+		s = a.from(t ? t.type.create(t.attrs, s) : i.node(e).copy(s));
+	}
+	e.step(new R(t, t, new d(o.append(s), n, n), !0));
+}
+function Tt(e, t) {
+	let n = e.resolve(t), r = n.index();
+	return Dt(n.nodeBefore, n.nodeAfter) && n.parent.canReplace(r, r + 1);
+}
+function Et(e, t) {
+	t.content.size || e.type.compatibleContent(t.type);
+	let n = e.contentMatchAt(e.childCount), { linebreakReplacement: r } = e.type.schema;
+	for (let i = 0; i < t.childCount; i++) {
+		let a = t.child(i), o = a.type == r ? e.type.schema.nodes.text : a.type;
+		if (n = n.matchType(o), !n || !e.type.allowsMarks(a.marks)) return !1;
+	}
+	return n.validEnd;
+}
+function Dt(e, t) {
+	return !!(e && t && !e.isLeaf && Et(e, t));
+}
+function Ot(e, t, n = -1) {
+	let r = e.resolve(t);
+	for (let e = r.depth;; e--) {
+		let i, a, o = r.index(e);
+		if (e == r.depth ? (i = r.nodeBefore, a = r.nodeAfter) : n > 0 ? (i = r.node(e + 1), o++, a = r.node(e).maybeChild(o)) : (i = r.node(e).maybeChild(o - 1), a = r.node(e + 1)), i && !i.isTextblock && Dt(i, a) && r.node(e).canReplace(o, o + 1)) return t;
+		if (e == 0) break;
+		t = n < 0 ? r.before(e) : r.after(e);
+	}
+}
+function kt(e, t, n) {
+	let r = null, { linebreakReplacement: i } = e.doc.type.schema, a = e.doc.resolve(t - n), o = a.node().type;
+	if (i && o.inlineContent) {
+		let e = o.whitespace == "pre", t = !!o.contentMatch.matchType(i);
+		e && !t ? r = !1 : !e && t && (r = !0);
+	}
+	let s = e.steps.length;
+	if (r === !1) {
+		let r = e.doc.resolve(t + n);
+		bt(e, r.node(), r.before(), s);
+	}
+	o.inlineContent && V(e, t + n - 1, o, a.node().contentMatchAt(a.index()), r == null);
+	let c = e.mapping.slice(s), l = c.map(t - n);
+	if (e.step(new R(l, c.map(t + n, -1), d.empty, !0)), r === !0) {
+		let t = e.doc.resolve(l);
+		yt(e, t.node(), t.before(), e.steps.length);
+	}
+	return e;
+}
+function At(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 jt(e, t, n) {
+	let r = e.resolve(t);
+	if (!n.content.size) return t;
+	let i = n.content;
+	for (let e = 0; e < n.openStart; e++) i = i.firstChild.content;
+	for (let e = 1; e <= (n.openStart == 0 && n.size ? 2 : 1); e++) for (let t = r.depth; t >= 0; t--) {
+		let n = t == r.depth ? 0 : r.pos <= (r.start(t + 1) + r.end(t + 1)) / 2 ? -1 : 1, a = r.index(t) + +(n > 0), o = r.node(t), s = !1;
+		if (e == 1) s = o.canReplace(a, a, i);
+		else {
+			let e = o.contentMatchAt(a).findWrapping(i.firstChild.type);
+			s = e && o.canReplaceWith(a, a, e[0]);
+		}
+		if (s) return n == 0 ? r.pos : n < 0 ? r.before(t + 1) : r.after(t + 1);
+	}
+	return null;
+}
+function Mt(e, t, n = t, r = d.empty) {
+	if (t == n && !r.size) return null;
+	let i = e.resolve(t), a = e.resolve(n);
+	return Nt(i, a, r) ? new R(t, n, r) : new Pt(i, a, r).fit();
+}
+function Nt(e, t, n) {
+	return !n.openStart && !n.openEnd && e.start() == t.start() && e.parent.canReplace(e.index(), t.index(), n.content);
+}
+var Pt = class {
+	constructor(e, t, n) {
+		this.$from = e, this.$to = t, this.unplaced = n, this.frontier = [], this.placed = a.empty;
+		for (let t = 0; t <= e.depth; t++) {
+			let n = e.node(t);
+			this.frontier.push({
+				type: n.type,
+				match: n.contentMatchAt(e.indexAfter(t))
+			});
+		}
+		for (let t = e.depth; t > 0; t--) this.placed = a.from(e.node(t).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 i = this.placed, a = n.depth, o = r.depth;
+		for (; a && o && i.childCount == 1;) i = i.firstChild.content, a--, o--;
+		let s = new d(i, a, o);
+		return e > -1 ? new z(n.pos, e, this.$to.pos, this.$to.end(), s, t) : s.size || n.pos != this.$to.pos ? new R(n.pos, r.pos, s) : null;
+	}
+	findFittable() {
+		let e = this.unplaced.openStart;
+		for (let t = this.unplaced.content, n = 0, r = this.unplaced.openEnd; n < e; n++) {
+			let i = t.firstChild;
+			if (t.childCount > 1 && (r = 0), i.type.spec.isolating && r <= n) {
+				e = n;
+				break;
+			}
+			t = i.content;
+		}
+		for (let t = 1; t <= 2; t++) for (let n = t == 1 ? e : this.unplaced.openStart; n >= 0; n--) {
+			let e, r = null;
+			n ? (r = W(this.unplaced.content, n - 1).firstChild, e = r.content) : e = this.unplaced.content;
+			let i = e.firstChild;
+			for (let e = this.depth; e >= 0; e--) {
+				let { type: o, match: s } = this.frontier[e], c, l = null;
+				if (t == 1 && (i ? s.matchType(i.type) || (l = s.fillBefore(a.from(i), !1)) : r && o.compatibleContent(r.type))) return {
+					sliceDepth: n,
+					frontierDepth: e,
+					parent: r,
+					inject: l
+				};
+				if (t == 2 && i && (c = s.findWrapping(i.type))) return {
+					sliceDepth: n,
+					frontierDepth: e,
+					parent: r,
+					wrap: c
+				};
+				if (r && s.matchType(r.type)) break;
+			}
+		}
+	}
+	openMore() {
+		let { content: e, openStart: t, openEnd: n } = this.unplaced, r = W(e, t);
+		return !r.childCount || r.firstChild.isLeaf ? !1 : (this.unplaced = new d(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 = W(e, t);
+		if (r.childCount <= 1 && t > 0) {
+			let i = e.size - t <= t + r.size;
+			this.unplaced = new d(H(e, t - 1, 1), t - 1, i ? t - 1 : n);
+		} else this.unplaced = new d(H(e, t, 1), t, n);
+	}
+	placeNodes({ sliceDepth: e, frontierDepth: t, parent: n, inject: r, wrap: i }) {
+		for (; this.depth > t;) this.closeFrontierNode();
+		if (i) for (let e = 0; e < i.length; e++) this.openFrontierNode(i[e]);
+		let o = this.unplaced, s = n ? n.content : o.content, c = o.openStart - e, l = 0, u = [], { match: f, type: p } = this.frontier[t];
+		if (r) {
+			for (let e = 0; e < r.childCount; e++) u.push(r.child(e));
+			f = f.matchFragment(r);
+		}
+		let m = s.size + e - (o.content.size - o.openEnd);
+		for (; l < s.childCount;) {
+			let e = s.child(l), t = f.matchType(e.type);
+			if (!t) break;
+			l++, (l > 1 || c == 0 || e.content.size) && (f = t, u.push(Ft(e.mark(p.allowedMarks(e.marks)), l == 1 ? c : 0, l == s.childCount ? m : -1)));
+		}
+		let h = l == s.childCount;
+		h || (m = -1), this.placed = U(this.placed, t, a.from(u)), this.frontier[t].match = f, h && m < 0 && n && n.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
+		for (let e = 0, t = s; e < m; e++) {
+			let e = t.lastChild;
+			this.frontier.push({
+				type: e.type,
+				match: e.contentMatchAt(e.childCount)
+			}), t = e.content;
+		}
+		this.unplaced = h ? e == 0 ? d.empty : new d(H(o.content, e - 1, 1), e - 1, m < 0 ? o.openEnd : e - 1) : new d(H(o.content, e, l), o.openStart, o.openEnd);
+	}
+	mustMoveInline() {
+		if (!this.$to.parent.isTextblock) return -1;
+		let e = this.frontier[this.depth], t;
+		if (!e.type.isTextblock || !G(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 = G(e, t, r, n, i);
+			if (a) {
+				for (let n = t - 1; n >= 0; n--) {
+					let { match: t, type: r } = this.frontier[n], i = G(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 = U(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(e, t = null, n) {
+		let r = this.frontier[this.depth];
+		r.match = r.match.matchType(e), this.placed = U(this.placed, this.depth, a.from(e.create(t, n))), this.frontier.push({
+			type: e,
+			match: e.contentMatch
+		});
+	}
+	closeFrontierNode() {
+		let e = this.frontier.pop().match.fillBefore(a.empty, !0);
+		e.childCount && (this.placed = U(this.placed, this.frontier.length, e));
+	}
+};
+function H(e, t, n) {
+	return t == 0 ? e.cutByIndex(n, e.childCount) : e.replaceChild(0, e.firstChild.copy(H(e.firstChild.content, t - 1, n)));
+}
+function U(e, t, n) {
+	return t == 0 ? e.append(n) : e.replaceChild(e.childCount - 1, e.lastChild.copy(U(e.lastChild.content, t - 1, n)));
+}
+function W(e, t) {
+	for (let n = 0; n < t; n++) e = e.firstChild.content;
+	return e;
+}
+function Ft(e, t, n) {
+	if (t <= 0) return e;
+	let r = e.content;
+	return t > 1 && (r = r.replaceChild(0, Ft(r.firstChild, t - 1, r.childCount == 1 ? n - 1 : 0))), t > 0 && (r = e.type.contentMatch.fillBefore(r).append(r), n <= 0 && (r = r.append(e.type.contentMatch.matchFragment(r).fillBefore(a.empty, !0)))), e.copy(r);
+}
+function G(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 && !It(n, a.content, o) ? s : null;
+}
+function It(e, t, n) {
+	for (let r = n; r < t.childCount; r++) if (!e.allowsMarks(t.child(r).marks)) return !0;
+	return !1;
+}
+function Lt(e) {
+	return e.spec.defining || e.spec.definingForContent;
+}
+function Rt(e, t, n, r) {
+	if (!r.size) return e.deleteRange(t, n);
+	let i = e.doc.resolve(t), a = e.doc.resolve(n);
+	if (Nt(i, a, r)) return e.step(new R(t, n, r));
+	let o = Ht(i, a);
+	o[o.length - 1] == 0 && o.pop();
+	let s = -(i.depth + 1);
+	o.unshift(s);
+	for (let e = i.depth, t = i.pos - 1; e > 0; e--, t--) {
+		let n = i.node(e).type.spec;
+		if (n.defining || n.definingAsContext || n.isolating) break;
+		o.indexOf(e) > -1 ? s = e : i.before(e) == t && o.splice(1, 0, -e);
+	}
+	let c = o.indexOf(s), l = [], u = r.openStart;
+	for (let e = r.content, t = 0;; t++) {
+		let n = e.firstChild;
+		if (l.push(n), t == r.openStart) break;
+		e = n.content;
+	}
+	for (let e = u - 1; e >= 0; e--) {
+		let t = l[e], n = Lt(t.type);
+		if (n && !t.sameMarkup(i.node(Math.abs(s) - 1))) u = e;
+		else if (n || !t.type.isTextblock) break;
+	}
+	for (let t = r.openStart; t >= 0; t--) {
+		let s = (t + u + 1) % (r.openStart + 1), f = l[s];
+		if (f) for (let t = 0; t < o.length; t++) {
+			let l = o[(t + c) % o.length], u = !0;
+			l < 0 && (u = !1, l = -l);
+			let p = i.node(l - 1), m = i.index(l - 1);
+			if (p.canReplaceWith(m, m, f.type, f.marks)) return e.replace(i.before(l), u ? a.after(l) : n, new d(zt(r.content, 0, r.openStart, s), s, r.openEnd));
+		}
+	}
+	let f = e.steps.length;
+	for (let s = o.length - 1; s >= 0 && (e.replace(t, n, r), !(e.steps.length > f)); s--) {
+		let e = o[s];
+		e < 0 || (t = i.before(e), n = a.after(e));
+	}
+}
+function zt(e, t, n, r, i) {
+	if (t < n) {
+		let i = e.firstChild;
+		e = e.replaceChild(0, i.copy(zt(i.content, t + 1, n, r, i)));
+	}
+	if (t > r) {
+		let t = i.contentMatchAt(0), n = t.fillBefore(e).append(e);
+		e = n.append(t.matchFragment(n).fillBefore(a.empty, !0));
+	}
+	return e;
+}
+function Bt(e, t, n, r) {
+	if (!r.isInline && t == n && e.doc.resolve(t).parent.content.size) {
+		let i = At(e.doc, t, r.type);
+		i != null && (t = n = i);
+	}
+	e.replaceRange(t, n, new d(a.from(r), 0, 0));
+}
+function Vt(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 = Ht(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 Ht(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 Ut = class e extends j {
+	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 M.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 M.fromReplace(e, this.pos, this.pos + 1, new d(a.from(r), 0, +!t.isLeaf));
+	}
+	getMap() {
+		return k.empty;
+	}
+	invert(t) {
+		return new e(this.pos, this.attr, t.nodeAt(this.pos).attrs[this.attr]);
+	}
+	map(t) {
+		let n = t.mapResult(this.pos, 1);
+		return n.deletedAfter ? null : new e(n.pos, this.attr, this.value);
+	}
+	toJSON() {
+		return {
+			stepType: "attr",
+			pos: this.pos,
+			attr: this.attr,
+			value: this.value
+		};
+	}
+	static fromJSON(t, n) {
+		if (typeof n.pos != "number" || typeof n.attr != "string") throw RangeError("Invalid input for AttrStep.fromJSON");
+		return new e(n.pos, n.attr, n.value);
+	}
+};
+j.jsonID("attr", Ut);
+var Wt = class e extends j {
+	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 M.ok(n);
+	}
+	getMap() {
+		return k.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);
+	}
+};
+j.jsonID("docAttr", Wt);
+var K = class extends Error {};
+K = function e(t) {
+	let n = Error.call(this, t);
+	return n.__proto__ = e.prototype, n;
+}, K.prototype = Object.create(Error.prototype), K.prototype.constructor = K, K.prototype.name = "TransformError";
+var Gt = class {
+	constructor(e) {
+		this.doc = e, this.steps = [], this.docs = [], this.mapping = new st();
+	}
+	get before() {
+		return this.docs.length ? this.docs[0] : this.doc;
+	}
+	step(e) {
+		let t = this.maybeStep(e);
+		if (t.failed) throw new K(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 = d.empty) {
+		let r = Mt(this.doc, e, t, n);
+		return r && this.step(r), this;
+	}
+	replaceWith(e, t, n) {
+		return this.replace(e, t, new d(a.from(n), 0, 0));
+	}
+	delete(e, t) {
+		return this.replace(e, t, d.empty);
+	}
+	insert(e, t) {
+		return this.replaceWith(e, e, t);
+	}
+	replaceRange(e, t, n) {
+		return Rt(this, e, t, n), this;
+	}
+	replaceRangeWith(e, t, n) {
+		return Bt(this, e, t, n), this;
+	}
+	deleteRange(e, t) {
+		return Vt(this, e, t), this;
+	}
+	lift(e, t) {
+		return ft(this, e, t), this;
+	}
+	join(e, t = 1) {
+		return kt(this, e, t), this;
+	}
+	wrap(e, t) {
+		return _t(this, e, t), this;
+	}
+	setBlockType(e, t = e, n, r = null) {
+		return vt(this, e, t, n, r), this;
+	}
+	setNodeMarkup(e, t, n = null, r) {
+		return St(this, e, t, n, r), this;
+	}
+	setNodeAttribute(e, t, n) {
+		return this.step(new Ut(e, t, n)), this;
+	}
+	setDocAttribute(e, t) {
+		return this.step(new Wt(e, t)), this;
+	}
+	addNodeMark(e, t) {
+		return this.step(new I(e, t)), this;
+	}
+	removeNodeMark(e, t) {
+		let n = this.doc.nodeAt(e);
+		if (!n) throw RangeError("No node at position " + e);
+		if (t instanceof l) t.isInSet(n.marks) && this.step(new L(e, t));
+		else {
+			let r = n.marks, i, a = [];
+			for (; i = t.isInSet(r);) a.push(new L(e, i)), r = i.removeFromSet(r);
+			for (let e = a.length - 1; e >= 0; e--) this.step(a[e]);
+		}
+		return this;
+	}
+	split(e, t = 1, n) {
+		return wt(this, e, t, n), this;
+	}
+	addMark(e, t, n) {
+		return ct(this, e, t, n), this;
+	}
+	removeMark(e, t, n) {
+		return lt(this, e, t, n), this;
+	}
+	clearIncompatible(e, t, n) {
+		return V(this, e, t, n), this;
+	}
+}, Kt = Object.create(null), q = class {
+	constructor(e, t, n) {
+		this.$anchor = e, this.$head = t, this.ranges = n || [new qt(e.min(t), e.max(t))];
+	}
+	get anchor() {
+		return this.$anchor.pos;
+	}
+	get head() {
+		return this.$head.pos;
+	}
+	get from() {
+		return this.$from.pos;
+	}
+	get to() {
+		return this.$to.pos;
+	}
+	get $from() {
+		return this.ranges[0].$from;
+	}
+	get $to() {
+		return this.ranges[0].$to;
+	}
+	get empty() {
+		let e = this.ranges;
+		for (let t = 0; t < e.length; t++) if (e[t].$from.pos != e[t].$to.pos) return !1;
+		return !0;
+	}
+	content() {
+		return this.$from.doc.slice(this.from, this.to, !0);
+	}
+	replace(e, t = d.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: c } = a[o], l = e.mapping.slice(i);
+			e.replaceRange(l.map(s.pos), l.map(c.pos), o ? d.empty : t), o == 0 && $t(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), $t(e, n, t.isInline ? -1 : 1));
+		}
+	}
+	static findFrom(e, t, n = !1) {
+		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 ? 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 X(e.node(0));
+	}
+	static atStart(e) {
+		return Z(e, e, 0, 0, 1) || new X(e);
+	}
+	static atEnd(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 = Kt[t.type];
+		if (!n) throw RangeError(`No selection type ${t.type} defined`);
+		return n.fromJSON(e, t);
+	}
+	static jsonID(e, t) {
+		if (e in Kt) throw RangeError("Duplicate use of selection JSON ID " + e);
+		return Kt[e] = t, t.prototype.jsonID = e, t;
+	}
+	getBookmark() {
+		return J.between(this.$anchor, this.$head).getBookmark();
+	}
+};
+q.prototype.visible = !0;
+var qt = class {
+	constructor(e, t) {
+		this.$from = e, this.$to = t;
+	}
+}, Jt = !1;
+function Yt(e) {
+	!Jt && !e.parent.inlineContent && (Jt = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + e.parent.type.name + ")"));
+}
+var J = class e extends q {
+	constructor(e, t = e) {
+		Yt(e), Yt(t), super(e, t);
+	}
+	get $cursor() {
+		return this.$anchor.pos == this.$head.pos ? this.$head : null;
+	}
+	map(t, n) {
+		let r = t.resolve(n.map(this.head));
+		if (!r.parent.inlineContent) return q.near(r);
+		let i = t.resolve(n.map(this.anchor));
+		return new e(i.parent.inlineContent ? i : r, r);
+	}
+	replace(e, t = d.empty) {
+		if (super.replace(e, t), t == d.empty) {
+			let t = this.$from.marksAcross(this.$to);
+			t && e.ensureMarks(t);
+		}
+	}
+	eq(t) {
+		return t instanceof e && t.anchor == this.anchor && t.head == this.head;
+	}
+	getBookmark() {
+		return new Xt(this.anchor, this.head);
+	}
+	toJSON() {
+		return {
+			type: "text",
+			anchor: this.anchor,
+			head: this.head
+		};
+	}
+	static fromJSON(t, n) {
+		if (typeof n.anchor != "number" || typeof n.head != "number") throw RangeError("Invalid input for TextSelection.fromJSON");
+		return new e(t.resolve(n.anchor), t.resolve(n.head));
+	}
+	static create(e, t, n = t) {
+		let r = e.resolve(t);
+		return new this(r, n == t ? r : e.resolve(n));
+	}
+	static between(t, n, r) {
+		let i = t.pos - n.pos;
+		if ((!r || i) && (r = i >= 0 ? 1 : -1), !n.parent.inlineContent) {
+			let e = q.findFrom(n, r, !0) || q.findFrom(n, -r, !0);
+			if (e) n = e.$head;
+			else return q.near(n, r);
+		}
+		return t.parent.inlineContent || (i == 0 ? t = n : (t = (q.findFrom(t, -r, !0) || q.findFrom(t, r, !0)).$anchor, t.pos < n.pos != i < 0 && (t = n))), new e(t, n);
+	}
+};
+q.jsonID("text", J);
+var Xt = class e {
+	constructor(e, t) {
+		this.anchor = e, this.head = t;
+	}
+	map(t) {
+		return new e(t.map(this.anchor), t.map(this.head));
+	}
+	resolve(e) {
+		return J.between(e.resolve(this.anchor), e.resolve(this.head));
+	}
+}, Y = class e extends q {
+	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 ? q.near(a) : new e(a);
+	}
+	content() {
+		return new d(a.from(this.node), 0, 0);
+	}
+	eq(t) {
+		return t instanceof e && t.anchor == this.anchor;
+	}
+	toJSON() {
+		return {
+			type: "node",
+			anchor: this.anchor
+		};
+	}
+	getBookmark() {
+		return new Zt(this.anchor);
+	}
+	static fromJSON(t, n) {
+		if (typeof n.anchor != "number") throw RangeError("Invalid input for NodeSelection.fromJSON");
+		return new e(t.resolve(n.anchor));
+	}
+	static create(t, n) {
+		return new e(t.resolve(n));
+	}
+	static isSelectable(e) {
+		return !e.isText && e.type.spec.selectable !== !1;
+	}
+};
+Y.prototype.visible = !1, q.jsonID("node", Y);
+var Zt = class e {
+	constructor(e) {
+		this.anchor = e;
+	}
+	map(t) {
+		let { deleted: n, pos: r } = t.mapResult(this.anchor);
+		return n ? new Xt(r, r) : new e(r);
+	}
+	resolve(e) {
+		let t = e.resolve(this.anchor), n = t.nodeAfter;
+		return n && Y.isSelectable(n) ? new Y(t) : q.near(t);
+	}
+}, X = class e extends q {
+	constructor(e) {
+		super(e.resolve(0), e.resolve(e.content.size));
+	}
+	replace(e, t = d.empty) {
+		if (t == d.empty) {
+			e.delete(0, e.doc.content.size);
+			let t = q.atStart(e.doc);
+			t.eq(e.selection) || e.setSelection(t);
+		} else super.replace(e, t);
+	}
+	toJSON() {
+		return { type: "all" };
+	}
+	static fromJSON(t) {
+		return new e(t);
+	}
+	map(t) {
+		return new e(t);
+	}
+	eq(t) {
+		return t instanceof e;
+	}
+	getBookmark() {
+		return Qt;
+	}
+};
+q.jsonID("all", X);
+var Qt = {
+	map() {
+		return this;
+	},
+	resolve(e) {
+		return new X(e);
+	}
+};
+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 = Z(e, r, n + i, i < 0 ? r.childCount : 0, i, a);
+			if (t) return t;
+		} else if (!a && Y.isSelectable(r)) return Y.create(e, n - (i < 0 ? r.nodeSize : 0));
+		n += r.nodeSize * i;
+	}
+	return null;
+}
+function $t(e, t, n) {
+	let r = e.steps.length - 1;
+	if (r < t) return;
+	let i = e.steps[r];
+	if (!(i instanceof R || i instanceof z)) return;
+	let a = e.mapping.maps[r], o;
+	a.forEach((e, t, n, r) => {
+		o ??= r;
+	}), e.setSelection(q.near(e.doc.resolve(o), n));
+}
+var en = 1, tn = 2, nn = 4, rn = class extends Gt {
+	constructor(e) {
+		super(e.doc), this.curSelectionFor = 0, this.updated = 0, this.meta = Object.create(null), this.time = Date.now(), this.curSelection = e.selection, this.storedMarks = e.storedMarks;
+	}
+	get selection() {
+		return this.curSelectionFor < this.steps.length && (this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor)), this.curSelectionFor = this.steps.length), this.curSelection;
+	}
+	setSelection(e) {
+		if (e.$from.doc != this.doc) throw RangeError("Selection passed to setSelection must point at the current document");
+		return this.curSelection = e, this.curSelectionFor = this.steps.length, this.updated = (this.updated | en) & -3, this.storedMarks = null, this;
+	}
+	get selectionSet() {
+		return (this.updated & en) > 0;
+	}
+	setStoredMarks(e) {
+		return this.storedMarks = e, this.updated |= tn, this;
+	}
+	ensureMarks(e) {
+		return l.sameSet(this.storedMarks || this.selection.$from.marks(), e) || this.setStoredMarks(e), this;
+	}
+	addStoredMark(e) {
+		return this.ensureMarks(e.addToSet(this.storedMarks || this.selection.$head.marks()));
+	}
+	removeStoredMark(e) {
+		return this.ensureMarks(e.removeFromSet(this.storedMarks || this.selection.$head.marks()));
+	}
+	get storedMarksSet() {
+		return (this.updated & tn) > 0;
+	}
+	addStep(e, t) {
+		super.addStep(e, t), this.updated &= -3, this.storedMarks = null;
+	}
+	setTime(e) {
+		return this.time = e, this;
+	}
+	replaceSelection(e) {
+		return this.selection.replace(this, e), this;
+	}
+	replaceSelectionWith(e, t = !0) {
+		let n = this.selection;
+		return t && (e = e.mark(this.storedMarks || (n.empty ? n.$from.marks() : n.$from.marksAcross(n.$to) || l.none))), n.replaceWith(this, e), this;
+	}
+	deleteSelection() {
+		return this.selection.replace(this), this;
+	}
+	insertText(e, t, n) {
+		let r = this.doc.type.schema;
+		if (t == null) return e ? this.replaceSelectionWith(r.text(e), !0) : this.deleteSelection();
+		{
+			if (n ??= t, !e) return this.deleteRange(t, n);
+			let i = this.storedMarks;
+			if (!i) {
+				let e = this.doc.resolve(t);
+				i = n == t ? e.marks() : e.marksAcross(this.doc.resolve(n));
+			}
+			return this.replaceRangeWith(t, n, r.text(e, i)), !this.selection.empty && this.selection.to == t + e.length && this.setSelection(q.near(this.selection.$to)), this;
+		}
+	}
+	setMeta(e, t) {
+		return this.meta[typeof e == "string" ? e : e.key] = t, this;
+	}
+	getMeta(e) {
+		return this.meta[typeof e == "string" ? e : e.key];
+	}
+	get isGeneric() {
+		for (let e in this.meta) return !1;
+		return !0;
+	}
+	scrollIntoView() {
+		return this.updated |= nn, this;
+	}
+	get scrolledIntoView() {
+		return (this.updated & nn) > 0;
+	}
+};
+function an(e, t) {
+	return !t || !e ? e : e.bind(t);
+}
+var Q = class {
+	constructor(e, t, n) {
+		this.name = e, this.init = an(t.init, n), this.apply = an(t.apply, n);
+	}
+}, on = [
+	new Q("doc", {
+		init(e) {
+			return e.doc || e.schema.topNodeType.createAndFill();
+		},
+		apply(e) {
+			return e.doc;
+		}
+	}),
+	new Q("selection", {
+		init(e, t) {
+			return e.selection || q.atStart(t.doc);
+		},
+		apply(e) {
+			return e.selection;
+		}
+	}),
+	new Q("storedMarks", {
+		init(e) {
+			return e.storedMarks || null;
+		},
+		apply(e, t, n, r) {
+			return r.selection.$cursor ? e.storedMarks : null;
+		}
+	}),
+	new Q("scrollToSelection", {
+		init() {
+			return 0;
+		},
+		apply(e, t) {
+			return e.scrolledIntoView ? t + 1 : t;
+		}
+	})
+], sn = class {
+	constructor(e, t) {
+		this.schema = e, this.plugins = [], this.pluginsByKey = Object.create(null), this.fields = on.slice(), t && t.forEach((e) => {
+			if (this.pluginsByKey[e.key]) throw RangeError("Adding different instances of a keyed plugin (" + e.key + ")");
+			this.plugins.push(e), this.pluginsByKey[e.key] = e, e.spec.state && this.fields.push(new Q(e.key, e.spec.state, e));
+		});
+	}
+}, cn = class e {
+	constructor(e) {
+		this.config = e;
+	}
+	get schema() {
+		return this.config.schema;
+	}
+	get plugins() {
+		return this.config.plugins;
+	}
+	apply(e) {
+		return this.applyTransaction(e).state;
+	}
+	filterTransaction(e, t = -1) {
+		for (let n = 0; n < this.config.plugins.length; n++) if (n != t) {
+			let t = this.config.plugins[n];
+			if (t.spec.filterTransaction && !t.spec.filterTransaction.call(t, e, this)) return !1;
+		}
+		return !0;
+	}
+	applyTransaction(e) {
+		if (!this.filterTransaction(e)) return {
+			state: this,
+			transactions: []
+		};
+		let t = [e], n = this.applyInner(e), r = null;
+		for (;;) {
+			let i = !1;
+			for (let a = 0; a < this.config.plugins.length; a++) {
+				let o = this.config.plugins[a];
+				if (o.spec.appendTransaction) {
+					let s = r ? r[a].n : 0, c = r ? r[a].state : this, l = s < t.length && o.spec.appendTransaction.call(o, s ? t.slice(s) : t, c, n);
+					if (l && n.filterTransaction(l, a)) {
+						if (l.setMeta("appendedTransaction", e), !r) {
+							r = [];
+							for (let e = 0; e < this.config.plugins.length; e++) r.push(e < a ? {
+								state: n,
+								n: t.length
+							} : {
+								state: this,
+								n: 0
+							});
+						}
+						t.push(l), n = n.applyInner(l), i = !0;
+					}
+					r && (r[a] = {
+						state: n,
+						n: t.length
+					});
+				}
+			}
+			if (!i) return {
+				state: n,
+				transactions: t
+			};
+		}
+	}
+	applyInner(t) {
+		if (!t.before.eq(this.doc)) throw RangeError("Applying a mismatched transaction");
+		let n = new e(this.config), r = this.config.fields;
+		for (let e = 0; e < r.length; e++) {
+			let i = r[e];
+			n[i.name] = i.apply(t, this[i.name], this, n);
+		}
+		return n;
+	}
+	get tr() {
+		return new rn(this);
+	}
+	static create(t) {
+		let n = new sn(t.doc ? t.doc.type.schema : t.schema, t.plugins), r = new e(n);
+		for (let e = 0; e < n.fields.length; e++) r[n.fields[e].name] = n.fields[e].init(t, r);
+		return r;
+	}
+	reconfigure(t) {
+		let n = new sn(this.schema, t.plugins), r = n.fields, i = new e(n);
+		for (let e = 0; e < r.length; e++) {
+			let n = r[e].name;
+			i[n] = this.hasOwnProperty(n) ? this[n] : r[e].init(t, i);
+		}
+		return i;
+	}
+	toJSON(e) {
+		let t = {
+			doc: this.doc.toJSON(),
+			selection: this.selection.toJSON()
+		};
+		if (this.storedMarks && (t.storedMarks = this.storedMarks.map((e) => e.toJSON())), e && typeof e == "object") for (let n in e) {
+			if (n == "doc" || n == "selection") throw RangeError("The JSON fields `doc` and `selection` are reserved");
+			let r = e[n], i = r.spec.state;
+			i && i.toJSON && (t[n] = i.toJSON.call(r, this[r.key]));
+		}
+		return t;
+	}
+	static fromJSON(t, n, r) {
+		if (!n) throw RangeError("Invalid input for EditorState.fromJSON");
+		if (!t.schema) throw RangeError("Required config field 'schema' missing");
+		let i = new sn(t.schema, t.plugins), a = new e(i);
+		return i.fields.forEach((e) => {
+			if (e.name == "doc") a.doc = x.fromJSON(t.schema, n.doc);
+			else if (e.name == "selection") a.selection = q.fromJSON(a.doc, n.selection);
+			else if (e.name == "storedMarks") n.storedMarks && (a.storedMarks = n.storedMarks.map(t.schema.markFromJSON));
+			else {
+				if (r) for (let i in r) {
+					let o = r[i], s = o.spec.state;
+					if (o.key == e.name && s && s.fromJSON && Object.prototype.hasOwnProperty.call(n, i)) {
+						a[e.name] = s.fromJSON.call(o, t, n[i], a);
+						return;
+					}
+				}
+				a[e.name] = e.init(t, a);
+			}
+		}), a;
+	}
+};
+function ln(e, t, n) {
+	for (let r in e) {
+		let i = e[r];
+		i instanceof Function ? i = i.bind(t) : r == "handleDOMEvents" && (i = ln(i, t, {})), n[r] = i;
+	}
+	return n;
+}
+var un = class {
+	constructor(e) {
+		this.spec = e, this.props = {}, e.props && ln(e.props, this, this.props), this.key = e.key ? e.key.key : dn("plugin");
+	}
+	getState(e) {
+		return e[this.key];
+	}
+}, $ = Object.create(null);
+function dn(e) {
+	return e in $ ? e + "$" + ++$[e] : ($[e] = 0, e + "$");
+}
+var fn = class {
+	constructor(e = "key") {
+		this.key = dn(e);
+	}
+	get(e) {
+		return e.config.pluginsByKey[this.key];
+	}
+	getState(e) {
+		return e[this.key];
+	}
+};
+//#endregion
+export { a as C, Me as D, se as E, d as O, qe as S, x as T, pt as _, fn as a, Mt as b, J as c, z as d, R as f, jt as g, Ct as h, un as i, st as l, Tt as m, cn as n, q as o, Gt as p, Y as r, qt as s, X as t, F as u, Ot as v, l as w, Ie as x, dt as y };