https://vrienden.artsencollectief.nl/vendor/cms-editor/cms-editor.js?v=1790755016

1//#region node_modules/orderedmap/dist/index.js
2function e(e) {
3	this.content = e;
4}
5e.prototype = {
6	constructor: e,
7	find: function(e) {
8		for (var t = 0; t < this.content.length; t += 2) if (this.content[t] === e) return t;
9		return -1;
10	},
11	get: function(e) {
12		var t = this.find(e);
13		return t == -1 ? void 0 : this.content[t + 1];
14	},
15	update: function(t, n, r) {
16		var i = r && r != t ? this.remove(r) : this, a = i.find(t), o = i.content.slice();
17		return a == -1 ? o.push(r || t, n) : (o[a + 1] = n, r && (o[a] = r)), new e(o);
18	},
19	remove: function(t) {
20		var n = this.find(t);
21		if (n == -1) return this;
22		var r = this.content.slice();
23		return r.splice(n, 2), new e(r);
24	},
25	addToStart: function(t, n) {
26		return new e([t, n].concat(this.remove(t).content));
27	},
28	addToEnd: function(t, n) {
29		var r = this.remove(t).content.slice();
30		return r.push(t, n), new e(r);
31	},
32	addBefore: function(t, n, r) {
33		var i = this.remove(n), a = i.content.slice(), o = i.find(t);
34		return a.splice(o == -1 ? a.length : o, 0, n, r), new e(a);
35	},
36	forEach: function(e) {
37		for (var t = 0; t < this.content.length; t += 2) e(this.content[t], this.content[t + 1]);
38	},
39	prepend: function(t) {
40		return t = e.from(t), t.size ? new e(t.content.concat(this.subtract(t).content)) : this;
41	},
42	append: function(t) {
43		return t = e.from(t), t.size ? new e(this.subtract(t).content.concat(t.content)) : this;
44	},
45	subtract: function(t) {
46		var n = this;
47		t = e.from(t);
48		for (var r = 0; r < t.content.length; r += 2) n = n.remove(t.content[r]);
49		return n;
50	},
51	toObject: function() {
52		var e = {};
53		return this.forEach(function(t, n) {
54			e[t] = n;
55		}), e;
56	},
57	get size() {
58		return this.content.length >> 1;
59	}
60}, e.from = function(t) {
61	if (t instanceof e) return t;
62	var n = [];
63	if (t) for (var r in t) n.push(r, t[r]);
64	return new e(n);
65};
66//#endregion
67//#region node_modules/prosemirror-model/dist/index.js
68function t(e, n, a) {
69	for (let o = 0;; o++) {
70		if (o == e.childCount || o == n.childCount) return e.childCount == n.childCount ? null : a;
71		let s = e.child(o), c = n.child(o);
72		if (s == c) {
73			a += s.nodeSize;
74			continue;
75		}
76		if (!s.sameMarkup(c)) return a;
77		if (s.isText && s.text != c.text) {
78			let e = s.text, t = c.text, n = 0;
79			for (; e[n] == t[n]; n++) a++;
80			return n && n < e.length && n < t.length && i(e.charCodeAt(n - 1)) && r(e.charCodeAt(n)) && a--, a;
81		}
82		if (s.content.size || c.content.size) {
83			let e = t(s.content, c.content, a + 1);
84			if (e != null) return e;
85		}
86		a += s.nodeSize;
87	}
88}
89function n(e, t, a, o) {
90	for (let s = e.childCount, c = t.childCount;;) {
91		if (s == 0 || c == 0) return s == c ? null : {
92			a,
93			b: o
94		};
95		let l = e.child(--s), u = t.child(--c), d = l.nodeSize;
96		if (l == u) {
97			a -= d, o -= d;
98			continue;
99		}
100		if (!l.sameMarkup(u)) return {
101			a,
102			b: o
103		};
104		if (l.isText && l.text != u.text) {
105			let e = l.text, t = u.text, n = e.length, s = t.length;
106			for (; n > 0 && s > 0 && e[n - 1] == t[s - 1];) n--, s--, a--, o--;
107			return n && s && n < e.length && i(e.charCodeAt(n - 1)) && r(e.charCodeAt(n)) && (a++, o++), {
108				a,
109				b: o
110			};
111		}
112		if (l.content.size || u.content.size) {
113			let e = n(l.content, u.content, a - 1, o - 1);
114			if (e) return e;
115		}
116		a -= d, o -= d;
117	}
118}
119function r(e) {
120	return e >= 56320 && e < 57344;
121}
122function i(e) {
123	return e >= 55296 && e < 56320;
124}
125var a = class e {
126	constructor(e, t) {
127		if (this.content = e, this.size = t || 0, t == null) for (let t = 0; t < e.length; t++) this.size += e[t].nodeSize;
128	}
129	nodesBetween(e, t, n, r = 0, i) {
130		for (let a = 0, o = 0; o < t; a++) {
131			let s = this.content[a], c = o + s.nodeSize;
132			if (c > e && n(s, r + o, i || null, a) !== !1 && s.content.size) {
133				let i = o + 1;
134				s.nodesBetween(Math.max(0, e - i), Math.min(s.content.size, t - i), n, r + i);
135			}
136			o = c;
137		}
138	}
139	descendants(e) {
140		this.nodesBetween(0, this.size, e);
141	}
142	textBetween(e, t, n, r) {
143		let i = "", a = !0;
144		return this.nodesBetween(e, t, (o, s) => {
145			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) : "" : "";
146			o.isBlock && (o.isLeaf && c || o.isTextblock) && n && (a ? a = !1 : i += n), i += c;
147		}, 0), i;
148	}
149	append(t) {
150		if (!t.size) return this;
151		if (!this.size) return t;
152		let n = this.lastChild, r = t.firstChild, i = this.content.slice(), a = 0;
153		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]);
154		return new e(i, this.size + t.size);
155	}
156	cut(t, n = this.size) {
157		if (t == 0 && n == this.size) return this;
158		let r = [], i = 0;
159		if (n > t) for (let e = 0, a = 0; a < n; e++) {
160			let o = this.content[e], s = a + o.nodeSize;
161			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;
162		}
163		return new e(r, i);
164	}
165	cutByIndex(t, n) {
166		return t == n ? e.empty : t == 0 && n == this.content.length ? this : new e(this.content.slice(t, n));
167	}
168	replaceChild(t, n) {
169		let r = this.content[t];
170		if (r == n) return this;
171		let i = this.content.slice(), a = this.size + n.nodeSize - r.nodeSize;
172		return i[t] = n, new e(i, a);
173	}
174	addToStart(t) {
175		return new e([t].concat(this.content), this.size + t.nodeSize);
176	}
177	addToEnd(t) {
178		return new e(this.content.concat(t), this.size + t.nodeSize);
179	}
180	eq(e) {
181		if (this.content.length != e.content.length) return !1;
182		for (let t = 0; t < this.content.length; t++) if (!this.content[t].eq(e.content[t])) return !1;
183		return !0;
184	}
185	get firstChild() {
186		return this.content.length ? this.content[0] : null;
187	}
188	get lastChild() {
189		return this.content.length ? this.content[this.content.length - 1] : null;
190	}
191	get childCount() {
192		return this.content.length;
193	}
194	child(e) {
195		let t = this.content[e];
196		if (!t) throw RangeError("Index " + e + " out of range for " + this);
197		return t;
198	}
199	maybeChild(e) {
200		return this.content[e] || null;
201	}
202	forEach(e) {
203		for (let t = 0, n = 0; t < this.content.length; t++) {
204			let r = this.content[t];
205			e(r, n, t), n += r.nodeSize;
206		}
207	}
208	findDiffStart(e, n = 0) {
209		return t(this, e, n);
210	}
211	findDiffEnd(e, t = this.size, r = e.size) {
212		return n(this, e, t, r);
213	}
214	findIndex(e) {
215		if (e == 0) return s(0, e);
216		if (e == this.size) return s(this.content.length, e);
217		if (e > this.size || e < 0) throw RangeError(`Position ${e} outside of fragment (${this})`);
218		for (let t = 0, n = 0;; t++) {
219			let r = this.child(t), i = n + r.nodeSize;
220			if (i >= e) return i == e ? s(t + 1, i) : s(t, n);
221			n = i;
222		}
223	}
224	toString() {
225		return "<" + this.toStringInner() + ">";
226	}
227	toStringInner() {
228		return this.content.join(", ");
229	}
230	toJSON() {
231		return this.content.length ? this.content.map((e) => e.toJSON()) : null;
232	}
233	static fromJSON(t, n) {
234		if (!n) return e.empty;
235		if (!Array.isArray(n)) throw RangeError("Invalid input for Fragment.fromJSON");
236		return e.fromArray(n.map(t.nodeFromJSON));
237	}
238	static fromArray(t) {
239		if (!t.length) return e.empty;
240		let n, r = 0;
241		for (let e = 0; e < t.length; e++) {
242			let i = t[e];
243			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);
244		}
245		return new e(n || t, r);
246	}
247	static from(t) {
248		if (!t) return e.empty;
249		if (t instanceof e) return t;
250		if (Array.isArray(t)) return this.fromArray(t);
251		if (t.attrs) return new e([t], t.nodeSize);
252		throw RangeError("Can not convert " + t + " to a Fragment" + (t.nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""));
253	}
254};
255a.empty = new a([], 0);
256var o = {
257	index: 0,
258	offset: 0
259};
260function s(e, t) {
261	return o.index = e, o.offset = t, o;
262}
263function c(e, t) {
264	if (e === t) return !0;
265	if (!(e && typeof e == "object") || !(t && typeof t == "object")) return !1;
266	let n = Array.isArray(e);
267	if (Array.isArray(t) != n) return !1;
268	if (n) {
269		if (e.length != t.length) return !1;
270		for (let n = 0; n < e.length; n++) if (!c(e[n], t[n])) return !1;
271	} else {
272		for (let n in e) if (!(n in t) || !c(e[n], t[n])) return !1;
273		for (let n in t) if (!(n in e)) return !1;
274	}
275	return !0;
276}
277var l = class e {
278	constructor(e, t) {
279		this.type = e, this.attrs = t;
280	}
281	addToSet(e) {
282		let t, n = !1;
283		for (let r = 0; r < e.length; r++) {
284			let i = e[r];
285			if (this.eq(i)) return e;
286			if (this.type.excludes(i.type)) t ||= e.slice(0, r);
287			else if (i.type.excludes(this.type)) return e;
288			else !n && i.type.rank > this.type.rank && (t ||= e.slice(0, r), t.push(this), n = !0), t && t.push(i);
289		}
290		return t ||= e.slice(), n || t.push(this), t;
291	}
292	removeFromSet(e) {
293		for (let t = 0; t < e.length; t++) if (this.eq(e[t])) return e.slice(0, t).concat(e.slice(t + 1));
294		return e;
295	}
296	isInSet(e) {
297		for (let t = 0; t < e.length; t++) if (this.eq(e[t])) return !0;
298		return !1;
299	}
300	eq(e) {
301		return this == e || this.type == e.type && c(this.attrs, e.attrs);
302	}
303	toJSON() {
304		let e = { type: this.type.name };
305		for (let t in this.attrs) {
306			e.attrs = this.attrs;
307			break;
308		}
309		return e;
310	}
311	static fromJSON(e, t) {
312		if (!t) throw RangeError("Invalid input for Mark.fromJSON");
313		let n = e.marks[t.type];
314		if (!n) throw RangeError(`There is no mark type ${t.type} in this schema`);
315		let r = n.create(t.attrs);
316		return n.checkAttrs(r.attrs), r;
317	}
318	static sameSet(e, t) {
319		if (e == t) return !0;
320		if (e.length != t.length) return !1;
321		for (let n = 0; n < e.length; n++) if (!e[n].eq(t[n])) return !1;
322		return !0;
323	}
324	static setFrom(t) {
325		if (!t || Array.isArray(t) && t.length == 0) return e.none;
326		if (t instanceof e) return [t];
327		let n = t.slice();
328		return n.sort((e, t) => e.type.rank - t.type.rank), n;
329	}
330};
331l.none = [];
332var u = class extends Error {}, d = class e {
333	constructor(e, t, n) {
334		this.content = e, this.openStart = t, this.openEnd = n;
335	}
336	get size() {
337		return this.content.size - this.openStart - this.openEnd;
338	}
339	insertAt(t, n) {
340		let r = p(this.content, t + this.openStart, n, this.openStart + 1, this.openEnd + 1);
341		return r && new e(r, this.openStart, this.openEnd);
342	}
343	removeBetween(t, n) {
344		return new e(f(this.content, t + this.openStart, n + this.openStart), this.openStart, this.openEnd);
345	}
346	eq(e) {
347		return this.content.eq(e.content) && this.openStart == e.openStart && this.openEnd == e.openEnd;
348	}
349	toString() {
350		return this.content + "(" + this.openStart + "," + this.openEnd + ")";
351	}
352	toJSON() {
353		if (!this.content.size) return null;
354		let e = { content: this.content.toJSON() };
355		return this.openStart > 0 && (e.openStart = this.openStart), this.openEnd > 0 && (e.openEnd = this.openEnd), e;
356	}
357	static fromJSON(t, n) {
358		if (!n) return e.empty;
359		let r = n.openStart || 0, i = n.openEnd || 0;
360		if (typeof r != "number" || typeof i != "number") throw RangeError("Invalid input for Slice.fromJSON");
361		return new e(a.fromJSON(t, n.content), r, i);
362	}
363	static maxOpen(t, n = !0) {
364		let r = 0, i = 0;
365		for (let e = t.firstChild; e && !e.isLeaf && (n || !e.type.spec.isolating); e = e.firstChild) r++;
366		for (let e = t.lastChild; e && !e.isLeaf && (n || !e.type.spec.isolating); e = e.lastChild) i++;
367		return new e(t, r, i);
368	}
369};
370d.empty = new d(a.empty, 0, 0);
371function f(e, t, n) {
372	let { index: r, offset: i } = e.findIndex(t), a = e.maybeChild(r), { index: o, offset: s } = e.findIndex(n);
373	if (i == t || a.isText) {
374		if (s != n && !e.child(o).isText) throw RangeError("Removing non-flat range");
375		return e.cut(0, t).append(e.cut(n));
376	}
377	if (r != o) throw RangeError("Removing non-flat range");
378	return e.replaceChild(r, a.copy(f(a.content, t - i - 1, n - i - 1)));
379}
380function p(e, t, n, r, i, a) {
381	let { index: o, offset: s } = e.findIndex(t), c = e.maybeChild(o);
382	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));
383	let l = p(c.content, t - s - 1, n, o == 0 ? r - 1 : 0, o == e.childCount - 1 ? i - 1 : 0, c);
384	return l && e.replaceChild(o, c.copy(l));
385}
386function m(e, t, n) {
387	if (n.openStart > e.depth) throw new u("Inserted content deeper than insertion position");
388	if (e.depth - n.openStart != t.depth - n.openEnd) throw new u("Inconsistent open depths");
389	return h(e, t, n, 0);
390}
391function h(e, t, n, r) {
392	let i = e.index(r), a = e.node(r);
393	if (i == t.index(r) && r < e.depth - n.openStart) {
394		let o = h(e, t, n, r + 1);
395		return a.copy(a.content.replaceChild(i, o));
396	} else if (!n.content.size) return y(a, te(e, t, r));
397	else if (!n.openStart && !n.openEnd && e.depth == r && t.depth == r) {
398		let r = e.parent, i = r.content;
399		return y(r, i.cut(0, e.parentOffset).append(n.content).append(i.cut(t.parentOffset)));
400	} else {
401		let { start: i, end: o } = ne(n, e);
402		return y(a, b(e, i, o, t, r));
403	}
404}
405function g(e, t) {
406	if (!t.type.compatibleContent(e.type)) throw new u("Cannot join " + t.type.name + " onto " + e.type.name);
407}
408function _(e, t, n) {
409	let r = e.node(n);
410	return g(r, t.node(n)), r;
411}
412function ee(e, t) {
413	let n = t.length - 1;
414	n >= 0 && e.isText && e.sameMarkup(t[n]) ? t[n] = e.withText(t[n].text + e.text) : t.push(e);
415}
416function v(e, t, n, r) {
417	let i = (t || e).node(n), a = 0, o = t ? t.index(n) : i.childCount;
418	e && (a = e.index(n), e.depth > n ? a++ : e.textOffset && (ee(e.nodeAfter, r), a++));
419	for (let e = a; e < o; e++) ee(i.child(e), r);
420	t && t.depth == n && t.textOffset && ee(t.nodeBefore, r);
421}
422function y(e, t) {
423	if (!e.type.validContent(t)) throw new u("Invalid content for node " + e.type.name);
424	return e.copy(t);
425}
426function b(e, t, n, r, i) {
427	let o = e.depth > i && _(e, t, i + 1), s = r.depth > i && _(n, r, i + 1), c = [];
428	return v(null, e, i, c), o && s && t.index(i) == n.index(i) ? (g(o, s), ee(y(o, b(e, t, n, r, i + 1)), c)) : (o && ee(y(o, te(e, t, i + 1)), c), v(t, n, i, c), s && ee(y(s, te(n, r, i + 1)), c)), v(r, null, i, c), new a(c);
429}
430function te(e, t, n) {
431	let r = [];
432	return v(null, e, n, r), e.depth > n && ee(y(_(e, t, n + 1), te(e, t, n + 1)), r), v(t, null, n, r), new a(r);
433}
434function ne(e, t) {
435	let n = t.depth - e.openStart, r = t.node(n).copy(e.content);
436	for (let e = n - 1; e >= 0; e--) r = t.node(e).copy(a.from(r));
437	return {
438		start: r.resolveNoCache(e.openStart + n),
439		end: r.resolveNoCache(r.content.size - e.openEnd - n)
440	};
441}
442var re = class e {
443	constructor(e, t, n) {
444		this.pos = e, this.path = t, this.parentOffset = n, this.depth = t.length / 3 - 1;
445	}
446	resolveDepth(e) {
447		return e == null ? this.depth : e < 0 ? this.depth + e : e;
448	}
449	get parent() {
450		return this.node(this.depth);
451	}
452	get doc() {
453		return this.node(0);
454	}
455	node(e) {
456		return this.path[this.resolveDepth(e) * 3];
457	}
458	index(e) {
459		return this.path[this.resolveDepth(e) * 3 + 1];
460	}
461	indexAfter(e) {
462		return e = this.resolveDepth(e), this.index(e) + (e == this.depth && !this.textOffset ? 0 : 1);
463	}
464	start(e) {
465		return e = this.resolveDepth(e), e == 0 ? 0 : this.path[e * 3 - 1] + 1;
466	}
467	end(e) {
468		return e = this.resolveDepth(e), this.start(e) + this.node(e).content.size;
469	}
470	before(e) {
471		if (e = this.resolveDepth(e), !e) throw RangeError("There is no position before the top-level node");
472		return e == this.depth + 1 ? this.pos : this.path[e * 3 - 1];
473	}
474	after(e) {
475		if (e = this.resolveDepth(e), !e) throw RangeError("There is no position after the top-level node");
476		return e == this.depth + 1 ? this.pos : this.path[e * 3 - 1] + this.path[e * 3].nodeSize;
477	}
478	get textOffset() {
479		return this.pos - this.path[this.path.length - 1];
480	}
481	get nodeAfter() {
482		let e = this.parent, t = this.index(this.depth);
483		if (t == e.childCount) return null;
484		let n = this.pos - this.path[this.path.length - 1], r = e.child(t);
485		return n ? e.child(t).cut(n) : r;
486	}
487	get nodeBefore() {
488		let e = this.index(this.depth), t = this.pos - this.path[this.path.length - 1];
489		return t ? this.parent.child(e).cut(0, t) : e == 0 ? null : this.parent.child(e - 1);
490	}
491	posAtIndex(e, t) {
492		t = this.resolveDepth(t);
493		let n = this.path[t * 3], r = t == 0 ? 0 : this.path[t * 3 - 1] + 1;
494		for (let t = 0; t < e; t++) r += n.child(t).nodeSize;
495		return r;
496	}
497	marks() {
498		let e = this.parent, t = this.index();
499		if (e.content.size == 0) return l.none;
500		if (this.textOffset) return e.child(t).marks;
501		let n = e.maybeChild(t - 1), r = e.maybeChild(t);
502		if (!n) {
503			let e = n;
504			n = r, r = e;
505		}
506		let i = n.marks;
507		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));
508		return i;
509	}
510	marksAcross(e) {
511		let t = this.parent.maybeChild(this.index());
512		if (!t || !t.isInline) return null;
513		let n = t.marks, r = e.parent.maybeChild(e.index());
514		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));
515		return n;
516	}
517	sharedDepth(e) {
518		for (let t = this.depth; t > 0; t--) if (this.start(t) <= e && this.end(t) >= e) return t;
519		return 0;
520	}
521	blockRange(e = this, t) {
522		if (e.pos < this.pos) return e.blockRange(this);
523		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);
524		return null;
525	}
526	sameParent(e) {
527		return this.pos - this.parentOffset == e.pos - e.parentOffset;
528	}
529	max(e) {
530		return e.pos > this.pos ? e : this;
531	}
532	min(e) {
533		return e.pos < this.pos ? e : this;
534	}
535	toString() {
536		let e = "";
537		for (let t = 1; t <= this.depth; t++) e += (e ? "/" : "") + this.node(t).type.name + "_" + this.index(t - 1);
538		return e + ":" + this.parentOffset;
539	}
540	static resolve(t, n) {
541		if (!(n >= 0 && n <= t.content.size)) throw RangeError("Position " + n + " out of range");
542		let r = [], i = 0, a = n;
543		for (let e = t;;) {
544			let { index: t, offset: n } = e.content.findIndex(a), o = a - n;
545			if (r.push(e, t, i + n), !o || (e = e.child(t), e.isText)) break;
546			a = o - 1, i += n + 1;
547		}
548		return new e(n, r, a);
549	}
550	static resolveCached(t, n) {
551		let r = oe.get(t);
552		if (r) for (let e = 0; e < r.elts.length; e++) {
553			let t = r.elts[e];
554			if (t.pos == n) return t;
555		}
556		else oe.set(t, r = new ie());
557		let i = r.elts[r.i] = e.resolve(t, n);
558		return r.i = (r.i + 1) % ae, i;
559	}
560}, ie = class {
561	constructor() {
562		this.elts = [], this.i = 0;
563	}
564}, ae = 12, oe = /* @__PURE__ */ new WeakMap(), se = class {
565	constructor(e, t, n) {
566		this.$from = e, this.$to = t, this.depth = n;
567	}
568	get start() {
569		return this.$from.before(this.depth + 1);
570	}
571	get end() {
572		return this.$to.after(this.depth + 1);
573	}
574	get parent() {
575		return this.$from.node(this.depth);
576	}
577	get startIndex() {
578		return this.$from.index(this.depth);
579	}
580	get endIndex() {
581		return this.$to.indexAfter(this.depth);
582	}
583}, ce = Object.create(null), le = class e {
584	constructor(e, t, n, r = l.none) {
585		this.type = e, this.attrs = t, this.marks = r, this.content = n || a.empty;
586	}
587	get children() {
588		return this.content.content;
589	}
590	get nodeSize() {
591		return this.isLeaf ? 1 : 2 + this.content.size;
592	}
593	get childCount() {
594		return this.content.childCount;
595	}
596	child(e) {
597		return this.content.child(e);
598	}
599	maybeChild(e) {
600		return this.content.maybeChild(e);
601	}
602	forEach(e) {
603		this.content.forEach(e);
604	}
605	nodesBetween(e, t, n, r = 0) {
606		this.content.nodesBetween(e, t, n, r, this);
607	}
608	descendants(e) {
609		this.nodesBetween(0, this.content.size, e);
610	}
611	get textContent() {
612		return this.isLeaf && this.type.spec.leafText ? this.type.spec.leafText(this) : this.textBetween(0, this.content.size, "");
613	}
614	textBetween(e, t, n, r) {
615		return this.content.textBetween(e, t, n, r);
616	}
617	get firstChild() {
618		return this.content.firstChild;
619	}
620	get lastChild() {
621		return this.content.lastChild;
622	}
623	eq(e) {
624		return this == e || this.sameMarkup(e) && this.content.eq(e.content);
625	}
626	sameMarkup(e) {
627		return this.hasMarkup(e.type, e.attrs, e.marks);
628	}
629	hasMarkup(e, t, n) {
630		return this.type == e && c(this.attrs, t || e.defaultAttrs || ce) && l.sameSet(this.marks, n || l.none);
631	}
632	copy(t = null) {
633		return t == this.content ? this : new e(this.type, this.attrs, t, this.marks);
634	}
635	mark(t) {
636		return t == this.marks ? this : new e(this.type, this.attrs, this.content, t);
637	}
638	cut(e, t = this.content.size) {
639		return e == 0 && t == this.content.size ? this : this.copy(this.content.cut(e, t));
640	}
641	slice(e, t = this.content.size, n = !1) {
642		if (e == t) return d.empty;
643		let r = this.resolve(e), i = this.resolve(t), a = n ? 0 : r.sharedDepth(t), o = r.start(a);
644		return new d(r.node(a).content.cut(r.pos - o, i.pos - o), r.depth - a, i.depth - a);
645	}
646	replace(e, t, n) {
647		return m(this.resolve(e), this.resolve(t), n);
648	}
649	nodeAt(e) {
650		for (let t = this;;) {
651			let { index: n, offset: r } = t.content.findIndex(e);
652			if (t = t.maybeChild(n), !t) return null;
653			if (r == e || t.isText) return t;
654			e -= r + 1;
655		}
656	}
657	childAfter(e) {
658		let { index: t, offset: n } = this.content.findIndex(e);
659		return {
660			node: this.content.maybeChild(t),
661			index: t,
662			offset: n
663		};
664	}
665	childBefore(e) {
666		if (e == 0) return {
667			node: null,
668			index: 0,
669			offset: 0
670		};
671		let { index: t, offset: n } = this.content.findIndex(e);
672		if (n < e) return {
673			node: this.content.child(t),
674			index: t,
675			offset: n
676		};
677		let r = this.content.child(t - 1);
678		return {
679			node: r,
680			index: t - 1,
681			offset: n - r.nodeSize
682		};
683	}
684	resolve(e) {
685		return re.resolveCached(this, e);
686	}
687	resolveNoCache(e) {
688		return re.resolve(this, e);
689	}
690	rangeHasMark(e, t, n) {
691		let r = !1;
692		return t > e && this.nodesBetween(e, t, (e) => (n.isInSet(e.marks) && (r = !0), !r)), r;
693	}
694	get isBlock() {
695		return this.type.isBlock;
696	}
697	get isTextblock() {
698		return this.type.isTextblock;
699	}
700	get inlineContent() {
701		return this.type.inlineContent;
702	}
703	get isInline() {
704		return this.type.isInline;
705	}
706	get isText() {
707		return this.type.isText;
708	}
709	get isLeaf() {
710		return this.type.isLeaf;
711	}
712	get isAtom() {
713		return this.type.isAtom;
714	}
715	toString() {
716		if (this.type.spec.toDebugString) return this.type.spec.toDebugString(this);
717		let e = this.type.name;
718		return this.content.size && (e += "(" + this.content.toStringInner() + ")"), de(this.marks, e);
719	}
720	contentMatchAt(e) {
721		let t = this.type.contentMatch.matchFragment(this.content, 0, e);
722		if (!t) throw Error("Called contentMatchAt on a node with invalid content");
723		return t;
724	}
725	canReplace(e, t, n = a.empty, r = 0, i = n.childCount) {
726		let o = this.contentMatchAt(e).matchFragment(n, r, i), s = o && o.matchFragment(this.content, t);
727		if (!s || !s.validEnd) return !1;
728		for (let e = r; e < i; e++) if (!this.type.allowsMarks(n.child(e).marks)) return !1;
729		return !0;
730	}
731	canReplaceWith(e, t, n, r) {
732		if (r && !this.type.allowsMarks(r)) return !1;
733		let i = this.contentMatchAt(e).matchType(n), a = i && i.matchFragment(this.content, t);
734		return a ? a.validEnd : !1;
735	}
736	canAppend(e) {
737		return e.content.size ? this.canReplace(this.childCount, this.childCount, e.content) : this.type.compatibleContent(e.type);
738	}
739	check() {
740		this.type.checkContent(this.content), this.type.checkAttrs(this.attrs);
741		let e = l.none;
742		for (let t = 0; t < this.marks.length; t++) {
743			let n = this.marks[t];
744			n.type.checkAttrs(n.attrs), e = n.addToSet(e);
745		}
746		if (!l.sameSet(e, this.marks)) throw RangeError(`Invalid collection of marks for node ${this.type.name}: ${this.marks.map((e) => e.type.name)}`);
747		this.content.forEach((e) => e.check());
748	}
749	toJSON() {
750		let e = { type: this.type.name };
751		for (let t in this.attrs) {
752			e.attrs = this.attrs;
753			break;
754		}
755		return this.content.size && (e.content = this.content.toJSON()), this.marks.length && (e.marks = this.marks.map((e) => e.toJSON())), e;
756	}
757	static fromJSON(e, t) {
758		if (!t) throw RangeError("Invalid input for Node.fromJSON");
759		let n;
760		if (t.marks) {
761			if (!Array.isArray(t.marks)) throw RangeError("Invalid mark data for Node.fromJSON");
762			n = t.marks.map(e.markFromJSON);
763		}
764		if (t.type == "text") {
765			if (typeof t.text != "string") throw RangeError("Invalid text node in JSON");
766			return e.text(t.text, n);
767		}
768		let r = a.fromJSON(e, t.content), i = e.nodeType(t.type).create(t.attrs, r, n);
769		return i.type.checkAttrs(i.attrs), i;
770	}
771};
772le.prototype.text = void 0;
773var ue = class e extends le {
774	constructor(e, t, n, r) {
775		if (super(e, t, null, r), !n) throw RangeError("Empty text nodes are not allowed");
776		this.text = n;
777	}
778	toString() {
779		return this.type.spec.toDebugString ? this.type.spec.toDebugString(this) : de(this.marks, JSON.stringify(this.text));
780	}
781	get textContent() {
782		return this.text;
783	}
784	textBetween(e, t) {
785		return this.text.slice(e, t);
786	}
787	get nodeSize() {
788		return this.text.length;
789	}
790	mark(t) {
791		return t == this.marks ? this : new e(this.type, this.attrs, this.text, t);
792	}
793	withText(t) {
794		return t == this.text ? this : new e(this.type, this.attrs, t, this.marks);
795	}
796	cut(e = 0, t = this.text.length) {
797		return e == 0 && t == this.text.length ? this : this.withText(this.text.slice(e, t));
798	}
799	eq(e) {
800		return this.sameMarkup(e) && this.text == e.text;
801	}
802	toJSON() {
803		let e = super.toJSON();
804		return e.text = this.text, e;
805	}
806};
807function de(e, t) {
808	for (let n = e.length - 1; n >= 0; n--) t = e[n].type.name + "(" + t + ")";
809	return t;
810}
811var fe = class e {
812	constructor(e) {
813		this.validEnd = e, this.next = [], this.wrapCache = [];
814	}
815	static parse(t, n) {
816		let r = new pe(t, n);
817		if (r.next == null) return e.empty;
818		let i = me(r);
819		r.next && r.err("Unexpected trailing text");
820		let a = we(xe(i));
821		return Te(a, r), a;
822	}
823	matchType(e) {
824		for (let t = 0; t < this.next.length; t++) if (this.next[t].type == e) return this.next[t].next;
825		return null;
826	}
827	matchFragment(e, t = 0, n = e.childCount) {
828		let r = this;
829		for (let i = t; r && i < n; i++) r = r.matchType(e.child(i).type);
830		return r;
831	}
832	get inlineContent() {
833		return this.next.length != 0 && this.next[0].type.isInline;
834	}
835	get defaultType() {
836		for (let e = 0; e < this.next.length; e++) {
837			let { type: t } = this.next[e];
838			if (!(t.isText || t.hasRequiredAttrs())) return t;
839		}
840		return null;
841	}
842	compatible(e) {
843		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;
844		return !1;
845	}
846	fillBefore(e, t = !1, n = 0) {
847		let r = [this];
848		function i(o, s) {
849			let c = o.matchFragment(e, n);
850			if (c && (!t || c.validEnd)) return a.from(s.map((e) => e.createAndFill()));
851			for (let e = 0; e < o.next.length; e++) {
852				let { type: t, next: n } = o.next[e];
853				if (!(t.isText || t.hasRequiredAttrs()) && r.indexOf(n) == -1) {
854					r.push(n);
855					let e = i(n, s.concat(t));
856					if (e) return e;
857				}
858			}
859			return null;
860		}
861		return i(this, []);
862	}
863	findWrapping(e) {
864		for (let t = 0; t < this.wrapCache.length; t += 2) if (this.wrapCache[t] == e) return this.wrapCache[t + 1];
865		let t = this.computeWrapping(e);
866		return this.wrapCache.push(e, t), t;
867	}
868	computeWrapping(e) {
869		let t = Object.create(null), n = [{
870			match: this,
871			type: null,
872			via: null
873		}];
874		for (; n.length;) {
875			let r = n.shift(), i = r.match;
876			if (i.matchType(e)) {
877				let e = [];
878				for (let t = r; t.type; t = t.via) e.push(t.type);
879				return e.reverse();
880			}
881			for (let e = 0; e < i.next.length; e++) {
882				let { type: a, next: o } = i.next[e];
883				!a.isLeaf && !a.hasRequiredAttrs() && !(a.name in t) && (!r.type || o.validEnd) && (n.push({
884					match: a.contentMatch,
885					type: a,
886					via: r
887				}), t[a.name] = !0);
888			}
889		}
890		return null;
891	}
892	get edgeCount() {
893		return this.next.length;
894	}
895	edge(e) {
896		if (e >= this.next.length) throw RangeError(`There's no ${e}th edge in this content match`);
897		return this.next[e];
898	}
899	toString() {
900		let e = [];
901		function t(n) {
902			e.push(n);
903			for (let r = 0; r < n.next.length; r++) e.indexOf(n.next[r].next) == -1 && t(n.next[r].next);
904		}
905		return t(this), e.map((t, n) => {
906			let r = n + (t.validEnd ? "*" : " ") + " ";
907			for (let n = 0; n < t.next.length; n++) r += (n ? ", " : "") + t.next[n].type.name + "->" + e.indexOf(t.next[n].next);
908			return r;
909		}).join("\n");
910	}
911};
912fe.empty = new fe(!0);
913var pe = class {
914	constructor(e, t) {
915		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();
916	}
917	get next() {
918		return this.tokens[this.pos];
919	}
920	eat(e) {
921		return this.next == e && (this.pos++ || !0);
922	}
923	err(e) {
924		throw SyntaxError(e + " (in content expression '" + this.string + "')");
925	}
926};
927function me(e) {
928	let t = [];
929	do
930		t.push(he(e));
931	while (e.eat("|"));
932	return t.length == 1 ? t[0] : {
933		type: "choice",
934		exprs: t
935	};
936}
937function he(e) {
938	let t = [];
939	do
940		t.push(ge(e));
941	while (e.next && e.next != ")" && e.next != "|");
942	return t.length == 1 ? t[0] : {
943		type: "seq",
944		exprs: t
945	};
946}
947function ge(e) {
948	let t = be(e);
949	for (;;) if (e.eat("+")) t = {
950		type: "plus",
951		expr: t
952	};
953	else if (e.eat("*")) t = {
954		type: "star",
955		expr: t
956	};
957	else if (e.eat("?")) t = {
958		type: "opt",
959		expr: t
960	};
961	else if (e.eat("{")) t = ve(e, t);
962	else break;
963	return t;
964}
965function _e(e) {
966	/\D/.test(e.next) && e.err("Expected number, got '" + e.next + "'");
967	let t = Number(e.next);
968	return e.pos++, t;
969}
970function ve(e, t) {
971	let n = _e(e), r = n;
972	return e.eat(",") && (r = e.next == "}" ? -1 : _e(e)), e.eat("}") || e.err("Unclosed braced range"), {
973		type: "range",
974		min: n,
975		max: r,
976		expr: t
977	};
978}
979function ye(e, t) {
980	let n = e.nodeTypes, r = n[t];
981	if (r) return [r];
982	let i = [];
983	for (let e in n) {
984		let r = n[e];
985		r.isInGroup(t) && i.push(r);
986	}
987	return i.length == 0 && e.err("No node type or group '" + t + "' found"), i;
988}
989function be(e) {
990	if (e.eat("(")) {
991		let t = me(e);
992		return e.eat(")") || e.err("Missing closing paren"), t;
993	} else if (/\W/.test(e.next)) e.err("Unexpected token '" + e.next + "'");
994	else {
995		let t = ye(e, e.next).map((t) => (e.inline == null ? e.inline = t.isInline : e.inline != t.isInline && e.err("Mixing inline and block content"), {
996			type: "name",
997			value: t
998		}));
999		return e.pos++, t.length == 1 ? t[0] : {
1000			type: "choice",
1001			exprs: t
1002		};
1003	}
1004}
1005function xe(e) {
1006	let t = [[]];
1007	return i(a(e, 0), n()), t;
1008	function n() {
1009		return t.push([]) - 1;
1010	}
1011	function r(e, n, r) {
1012		let i = {
1013			term: r,
1014			to: n
1015		};
1016		return t[e].push(i), i;
1017	}
1018	function i(e, t) {
1019		e.forEach((e) => e.to = t);
1020	}
1021	function a(e, t) {
1022		if (e.type == "choice") return e.exprs.reduce((e, n) => e.concat(a(n, t)), []);
1023		if (e.type == "seq") for (let r = 0;; r++) {
1024			let o = a(e.exprs[r], t);
1025			if (r == e.exprs.length - 1) return o;
1026			i(o, t = n());
1027		}
1028		else if (e.type == "star") {
1029			let o = n();
1030			return r(t, o), i(a(e.expr, o), o), [r(o)];
1031		} else if (e.type == "plus") {
1032			let o = n();
1033			return i(a(e.expr, t), o), i(a(e.expr, o), o), [r(o)];
1034		} else if (e.type == "opt") return [r(t)].concat(a(e.expr, t));
1035		else if (e.type == "range") {
1036			let o = t;
1037			for (let t = 0; t < e.min; t++) {
1038				let t = n();
1039				i(a(e.expr, o), t), o = t;
1040			}
1041			if (e.max == -1) i(a(e.expr, o), o);
1042			else for (let t = e.min; t < e.max; t++) {
1043				let t = n();
1044				r(o, t), i(a(e.expr, o), t), o = t;
1045			}
1046			return [r(o)];
1047		} else if (e.type == "name") return [r(t, void 0, e.value)];
1048		else throw Error("Unknown expr type");
1049	}
1050}
1051function Se(e, t) {
1052	return t - e;
1053}
1054function Ce(e, t) {
1055	let n = [];
1056	return r(t), n.sort(Se);
1057	function r(t) {
1058		let i = e[t];
1059		if (i.length == 1 && !i[0].term) return r(i[0].to);
1060		n.push(t);
1061		for (let e = 0; e < i.length; e++) {
1062			let { term: t, to: a } = i[e];
1063			!t && n.indexOf(a) == -1 && r(a);
1064		}
1065	}
1066}
1067function we(e) {
1068	let t = Object.create(null);
1069	return n(Ce(e, 0));
1070	function n(r) {
1071		let i = [];
1072		r.forEach((t) => {
1073			e[t].forEach(({ term: t, to: n }) => {
1074				if (!t) return;
1075				let r;
1076				for (let e = 0; e < i.length; e++) i[e][0] == t && (r = i[e][1]);
1077				Ce(e, n).forEach((e) => {
1078					r || i.push([t, r = []]), r.indexOf(e) == -1 && r.push(e);
1079				});
1080			});
1081		});
1082		let a = t[r.join(",")] = new fe(r.indexOf(e.length - 1) > -1);
1083		for (let e = 0; e < i.length; e++) {
1084			let r = i[e][1].sort(Se);
1085			a.next.push({
1086				type: i[e][0],
1087				next: t[r.join(",")] || n(r)
1088			});
1089		}
1090		return a;
1091	}
1092}
1093function Te(e, t) {
1094	for (let n = 0, r = [e]; n < r.length; n++) {
1095		let e = r[n], i = !e.validEnd, a = [];
1096		for (let t = 0; t < e.next.length; t++) {
1097			let { type: n, next: o } = e.next[t];
1098			a.push(n.name), i && !(n.isText || n.hasRequiredAttrs()) && (i = !1), r.indexOf(o) == -1 && r.push(o);
1099		}
1100		i && t.err("Only non-generatable nodes (" + a.join(", ") + ") in a required position (see https://prosemirror.net/docs/guide/#generatable)");
1101	}
1102}
1103function Ee(e) {
1104	let t = Object.create(null);
1105	for (let n in e) {
1106		let r = e[n];
1107		if (!r.hasDefault) return null;
1108		t[n] = r.default;
1109	}
1110	return t;
1111}
1112function De(e, t) {
1113	let n = Object.create(null);
1114	for (let r in e) {
1115		let i = t && t[r];
1116		if (i === void 0) {
1117			let t = e[r];
1118			if (t.hasDefault) i = t.default;
1119			else throw RangeError("No value supplied for attribute " + r);
1120		}
1121		n[r] = i;
1122	}
1123	return n;
1124}
1125function Oe(e, t, n, r) {
1126	for (let i in t) if (!(i in e)) throw RangeError(`Unsupported attribute ${i} for ${n} of type ${r}`);
1127	for (let n in e) e[n].validate && e[n].validate(t[n]);
1128}
1129function ke(e, t) {
1130	let n = Object.create(null);
1131	if (t) for (let r in t) n[r] = new Me(e, r, t[r]);
1132	return n;
1133}
1134var Ae = class e {
1135	constructor(e, t, n) {
1136		this.name = e, this.schema = t, this.spec = n, this.markSet = null, this.groups = n.group ? n.group.split(" ") : [], this.attrs = ke(e, n.attrs), this.defaultAttrs = Ee(this.attrs), this.contentMatch = null, this.inlineContent = null, this.isBlock = !(n.inline || e == "text"), this.isText = e == "text";
1137	}
1138	get isInline() {
1139		return !this.isBlock;
1140	}
1141	get isTextblock() {
1142		return this.isBlock && this.inlineContent;
1143	}
1144	get isLeaf() {
1145		return this.contentMatch == fe.empty;
1146	}
1147	get isAtom() {
1148		return this.isLeaf || !!this.spec.atom;
1149	}
1150	isInGroup(e) {
1151		return this.groups.indexOf(e) > -1;
1152	}
1153	get whitespace() {
1154		return this.spec.whitespace || (this.spec.code ? "pre" : "normal");
1155	}
1156	hasRequiredAttrs() {
1157		for (let e in this.attrs) if (this.attrs[e].isRequired) return !0;
1158		return !1;
1159	}
1160	compatibleContent(e) {
1161		return this == e || this.contentMatch.compatible(e.contentMatch);
1162	}
1163	computeAttrs(e) {
1164		return !e && this.defaultAttrs ? this.defaultAttrs : De(this.attrs, e);
1165	}
1166	create(e = null, t, n) {
1167		if (this.isText) throw Error("NodeType.create can't construct text nodes");
1168		return new le(this, this.computeAttrs(e), a.from(t), l.setFrom(n));
1169	}
1170	createChecked(e = null, t, n) {
1171		return t = a.from(t), this.checkContent(t), new le(this, this.computeAttrs(e), t, l.setFrom(n));
1172	}
1173	createAndFill(e = null, t, n) {
1174		if (e = this.computeAttrs(e), t = a.from(t), t.size) {
1175			let e = this.contentMatch.fillBefore(t);
1176			if (!e) return null;
1177			t = e.append(t);
1178		}
1179		let r = this.contentMatch.matchFragment(t), i = r && r.fillBefore(a.empty, !0);
1180		return i ? new le(this, e, t.append(i), l.setFrom(n)) : null;
1181	}
1182	validContent(e) {
1183		let t = this.contentMatch.matchFragment(e);
1184		if (!t || !t.validEnd) return !1;
1185		for (let t = 0; t < e.childCount; t++) if (!this.allowsMarks(e.child(t).marks)) return !1;
1186		return !0;
1187	}
1188	checkContent(e) {
1189		if (!this.validContent(e)) throw RangeError(`Invalid content for node ${this.name}: ${e.toString().slice(0, 50)}`);
1190	}
1191	checkAttrs(e) {
1192		Oe(this.attrs, e, "node", this.name);
1193	}
1194	allowsMarkType(e) {
1195		return this.markSet == null || this.markSet.indexOf(e) > -1;
1196	}
1197	allowsMarks(e) {
1198		if (this.markSet == null) return !0;
1199		for (let t = 0; t < e.length; t++) if (!this.allowsMarkType(e[t].type)) return !1;
1200		return !0;
1201	}
1202	allowedMarks(e) {
1203		if (this.markSet == null) return e;
1204		let t;
1205		for (let n = 0; n < e.length; n++) this.allowsMarkType(e[n].type) ? t && t.push(e[n]) : t ||= e.slice(0, n);
1206		return t ? t.length ? t : l.none : e;
1207	}
1208	static compile(t, n) {
1209		let r = Object.create(null);
1210		t.forEach((t, i) => r[t] = new e(t, n, i));
1211		let i = n.spec.topNode || "doc";
1212		if (!r[i]) throw RangeError("Schema is missing its top node type ('" + i + "')");
1213		if (!r.text) throw RangeError("Every schema needs a 'text' type");
1214		for (let e in r.text.attrs) throw RangeError("The text node type should not have attributes");
1215		return r;
1216	}
1217};
1218function je(e, t, n) {
1219	let r = n.split("|");
1220	return (n) => {
1221		let i = n === null ? "null" : typeof n;
1222		if (r.indexOf(i) < 0) throw RangeError(`Expected value of type ${r} for attribute ${t} on type ${e}, got ${i}`);
1223	};
1224}
1225var Me = class {
1226	constructor(e, t, n) {
1227		this.hasDefault = Object.prototype.hasOwnProperty.call(n, "default"), this.default = n.default, this.validate = typeof n.validate == "string" ? je(e, t, n.validate) : n.validate;
1228	}
1229	get isRequired() {
1230		return !this.hasDefault;
1231	}
1232}, Ne = class e {
1233	constructor(e, t, n, r) {
1234		this.name = e, this.rank = t, this.schema = n, this.spec = r, this.attrs = ke(e, r.attrs), this.excluded = null;
1235		let i = Ee(this.attrs);
1236		this.instance = i ? new l(this, i) : null;
1237	}
1238	create(e = null) {
1239		return !e && this.instance ? this.instance : new l(this, De(this.attrs, e));
1240	}
1241	static compile(t, n) {
1242		let r = Object.create(null), i = 0;
1243		return t.forEach((t, a) => r[t] = new e(t, i++, n, a)), r;
1244	}
1245	removeFromSet(e) {
1246		for (var t = 0; t < e.length; t++) e[t].type == this && (e = e.slice(0, t).concat(e.slice(t + 1)), t--);
1247		return e;
1248	}
1249	isInSet(e) {
1250		for (let t = 0; t < e.length; t++) if (e[t].type == this) return e[t];
1251	}
1252	checkAttrs(e) {
1253		Oe(this.attrs, e, "mark", this.name);
1254	}
1255	excludes(e) {
1256		return this.excluded.indexOf(e) > -1;
1257	}
1258}, Pe = class {
1259	constructor(t) {
1260		this.linebreakReplacement = null, this.cached = Object.create(null);
1261		let n = this.spec = {};
1262		for (let e in t) n[e] = t[e];
1263		n.nodes = e.from(t.nodes), n.marks = e.from(t.marks || {}), this.nodes = Ae.compile(this.spec.nodes, this), this.marks = Ne.compile(this.spec.marks, this);
1264		let r = Object.create(null);
1265		for (let e in this.nodes) {
1266			if (e in this.marks) throw RangeError(e + " can not be both a node and a mark");
1267			let t = this.nodes[e], n = t.spec.content || "", i = t.spec.marks;
1268			if (t.contentMatch = r[n] || (r[n] = fe.parse(n, this.nodes)), t.inlineContent = t.contentMatch.inlineContent, t.spec.linebreakReplacement) {
1269				if (this.linebreakReplacement) throw RangeError("Multiple linebreak nodes defined");
1270				if (!t.isInline || !t.isLeaf) throw RangeError("Linebreak replacement nodes must be inline leaf nodes");
1271				this.linebreakReplacement = t;
1272			}
1273			t.markSet = i == "_" ? null : i ? Fe(this, i.split(" ")) : i == "" || !t.inlineContent ? [] : null;
1274		}
1275		for (let e in this.marks) {
1276			let t = this.marks[e], n = t.spec.excludes;
1277			t.excluded = n == null ? [t] : n == "" ? [] : Fe(this, n.split(" "));
1278		}
1279		this.nodeFromJSON = (e) => le.fromJSON(this, e), this.markFromJSON = (e) => l.fromJSON(this, e), this.topNodeType = this.nodes[this.spec.topNode || "doc"], this.cached.wrappings = Object.create(null);
1280	}
1281	node(e, t = null, n, r) {
1282		if (typeof e == "string") e = this.nodeType(e);
1283		else if (!(e instanceof Ae)) throw RangeError("Invalid node type: " + e);
1284		else if (e.schema != this) throw RangeError("Node type from different schema used (" + e.name + ")");
1285		return e.createChecked(t, n, r);
1286	}
1287	text(e, t) {
1288		let n = this.nodes.text;
1289		return new ue(n, n.defaultAttrs, e, l.setFrom(t));
1290	}
1291	mark(e, t) {
1292		return typeof e == "string" && (e = this.marks[e]), e.create(t);
1293	}
1294	nodeType(e) {
1295		let t = this.nodes[e];
1296		if (!t) throw RangeError("Unknown node type: " + e);
1297		return t;
1298	}
1299};
1300function Fe(e, t) {
1301	let n = [];
1302	for (let r = 0; r < t.length; r++) {
1303		let i = t[r], a = e.marks[i], o = a;
1304		if (a) n.push(a);
1305		else for (let t in e.marks) {
1306			let r = e.marks[t];
1307			(i == "_" || r.spec.group && r.spec.group.split(" ").indexOf(i) > -1) && n.push(o = r);
1308		}
1309		if (!o) throw SyntaxError("Unknown mark type: '" + t[r] + "'");
1310	}
1311	return n;
1312}
1313function Ie(e) {
1314	return e.tag != null;
1315}
1316function Le(e) {
1317	return e.style != null;
1318}
1319var Re = class e {
1320	constructor(e, t) {
1321		this.schema = e, this.rules = t, this.tags = [], this.styles = [];
1322		let n = this.matchedStyles = [];
1323		t.forEach((e) => {
1324			if (Ie(e)) this.tags.push(e);
1325			else if (Le(e)) {
1326				let t = /[^=]*/.exec(e.style)[0];
1327				n.indexOf(t) < 0 && n.push(t), this.styles.push(e);
1328			}
1329		}), this.normalizeLists = !this.tags.some((t) => {
1330			if (!/^(ul|ol)\b/.test(t.tag) || !t.node) return !1;
1331			let n = e.nodes[t.node];
1332			return n.contentMatch.matchType(n);
1333		});
1334	}
1335	parse(e, t = {}) {
1336		let n = new qe(this, t, !1);
1337		return n.addAll(e, l.none, t.from, t.to), n.finish();
1338	}
1339	parseSlice(e, t = {}) {
1340		let n = new qe(this, t, !0);
1341		return n.addAll(e, l.none, t.from, t.to), d.maxOpen(n.finish());
1342	}
1343	matchTag(e, t, n) {
1344		for (let r = n ? this.tags.indexOf(n) + 1 : 0; r < this.tags.length; r++) {
1345			let n = this.tags[r];
1346			if (Ye(e, n.tag) && (n.namespace === void 0 || e.namespaceURI == n.namespace) && (!n.context || t.matchesContext(n.context))) {
1347				if (n.getAttrs) {
1348					let t = n.getAttrs(e);
1349					if (t === !1) continue;
1350					n.attrs = t || void 0;
1351				}
1352				return n;
1353			}
1354		}
1355	}
1356	matchStyle(e, t, n, r) {
1357		for (let i = r ? this.styles.indexOf(r) + 1 : 0; i < this.styles.length; i++) {
1358			let r = this.styles[i], a = r.style;
1359			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))) {
1360				if (r.getAttrs) {
1361					let e = r.getAttrs(t);
1362					if (e === !1) continue;
1363					r.attrs = e || void 0;
1364				}
1365				return r;
1366			}
1367		}
1368	}
1369	static schemaRules(e) {
1370		let t = [];
1371		function n(e) {
1372			let n = e.priority == null ? 50 : e.priority, r = 0;
1373			for (; r < t.length; r++) {
1374				let e = t[r];
1375				if ((e.priority == null ? 50 : e.priority) < n) break;
1376			}
1377			t.splice(r, 0, e);
1378		}
1379		for (let t in e.marks) {
1380			let r = e.marks[t].spec.parseDOM;
1381			r && r.forEach((e) => {
1382				n(e = Xe(e)), e.mark || e.ignore || e.clearMark || (e.mark = t);
1383			});
1384		}
1385		for (let t in e.nodes) {
1386			let r = e.nodes[t].spec.parseDOM;
1387			r && r.forEach((e) => {
1388				n(e = Xe(e)), e.node || e.ignore || e.mark || (e.node = t);
1389			});
1390		}
1391		return t;
1392	}
1393	static fromSchema(t) {
1394		return t.cached.domParser || (t.cached.domParser = new e(t, e.schemaRules(t)));
1395	}
1396}, ze = {
1397	address: !0,
1398	article: !0,
1399	aside: !0,
1400	blockquote: !0,
1401	canvas: !0,
1402	dd: !0,
1403	div: !0,
1404	dl: !0,
1405	fieldset: !0,
1406	figcaption: !0,
1407	figure: !0,
1408	footer: !0,
1409	form: !0,
1410	h1: !0,
1411	h2: !0,
1412	h3: !0,
1413	h4: !0,
1414	h5: !0,
1415	h6: !0,
1416	header: !0,
1417	hgroup: !0,
1418	hr: !0,
1419	li: !0,
1420	noscript: !0,
1421	ol: !0,
1422	output: !0,
1423	p: !0,
1424	pre: !0,
1425	section: !0,
1426	table: !0,
1427	tfoot: !0,
1428	ul: !0
1429}, Be = {
1430	head: !0,
1431	noscript: !0,
1432	object: !0,
1433	script: !0,
1434	style: !0,
1435	title: !0
1436}, Ve = {
1437	ol: !0,
1438	ul: !0
1439}, He = 1, Ue = 2, We = 4;
1440function Ge(e, t, n) {
1441	return t == null ? e && e.whitespace == "pre" ? 3 : n & -5 : (t ? He : 0) | (t === "full" ? Ue : 0);
1442}
1443var Ke = class {
1444	constructor(e, t, n, r, i, a) {
1445		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 & We ? null : e.contentMatch);
1446	}
1447	findWrapping(e) {
1448		if (!this.match) {
1449			if (!this.type) return [];
1450			let t = this.type.contentMatch.fillBefore(a.from(e));
1451			if (t) this.match = this.type.contentMatch.matchFragment(t);
1452			else {
1453				let t = this.type.contentMatch, n;
1454				return (n = t.findWrapping(e.type)) ? (this.match = t, n) : null;
1455			}
1456		}
1457		return this.match.findWrapping(e.type);
1458	}
1459	finish(e) {
1460		if (!(this.options & He)) {
1461			let e = this.content[this.content.length - 1], t;
1462			if (e && e.isText && (t = /[ \t\r\n\u000c]+$/.exec(e.text))) {
1463				let n = e;
1464				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));
1465			}
1466		}
1467		let t = a.from(this.content);
1468		return !e && this.match && (t = t.append(this.match.fillBefore(a.empty, !0))), this.type ? this.type.create(this.attrs, t, this.marks) : t;
1469	}
1470	inlineContext(e) {
1471		return this.type ? this.type.inlineContent : this.content.length ? this.content[0].isInline : e.parentNode && !ze.hasOwnProperty(e.parentNode.nodeName.toLowerCase());
1472	}
1473}, qe = class {
1474	constructor(e, t, n) {
1475		this.parser = e, this.options = t, this.isOpen = n, this.open = 0, this.localPreserveWS = !1;
1476		let r = t.topNode, i, a = Ge(null, t.preserveWhitespace, 0) | (n ? We : 0);
1477		i = r ? new Ke(r.type, r.attrs, l.none, !0, t.topMatch || r.type.contentMatch, a) : n ? new Ke(null, null, l.none, !0, null, a) : new Ke(e.schema.topNodeType, null, l.none, !0, null, a), this.nodes = [i], this.find = t.findPositions, this.needsBlock = !1;
1478	}
1479	get top() {
1480		return this.nodes[this.open];
1481	}
1482	addDOM(e, t) {
1483		e.nodeType == 3 ? this.addTextNode(e, t) : e.nodeType == 1 && this.addElement(e, t);
1484	}
1485	addTextNode(e, t) {
1486		let n = e.nodeValue, r = this.top, i = r.options & Ue ? "full" : this.localPreserveWS || (r.options & He) > 0, { schema: a } = this.parser;
1487		if (i === "full" || r.inlineContext(e) || /[^ \t\r\n\u000c]/.test(n)) {
1488			if (!i) {
1489				if (n = n.replace(/[ \t\r\n\u000c]+/g, " "), /^[ \t\r\n\u000c]/.test(n) && this.open == this.nodes.length - 1) {
1490					let t = r.content[r.content.length - 1], i = e.previousSibling;
1491					(!t || i && i.nodeName == "BR" || t.isText && /[ \t\r\n\u000c]$/.test(t.text)) && (n = n.slice(1));
1492				}
1493			} else if (i === "full") n = n.replace(/\r\n?/g, "\n");
1494			else if (a.linebreakReplacement && /[\r\n]/.test(n) && this.top.findWrapping(a.linebreakReplacement.create())) {
1495				let e = n.split(/\r?\n|\r/);
1496				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]));
1497				n = "";
1498			} else n = n.replace(/\r?\n|\r/g, " ");
1499			n && this.insertNode(a.text(n), t, !/\S/.test(n)), this.findInText(e);
1500		} else this.findInside(e);
1501	}
1502	addElement(e, t, n) {
1503		let r = this.localPreserveWS, i = this.top;
1504		(e.tagName == "PRE" || /pre/.test(e.style && e.style.whiteSpace)) && (this.localPreserveWS = !0);
1505		let a = e.nodeName.toLowerCase(), o;
1506		Ve.hasOwnProperty(a) && this.parser.normalizeLists && Je(e);
1507		let s = this.options.ruleFromNode && this.options.ruleFromNode(e) || (o = this.parser.matchTag(e, this, n));
1508		out: if (s ? s.ignore : Be.hasOwnProperty(a)) this.findInside(e), this.ignoreFallback(e, t);
1509		else if (!s || s.skip || s.closeParent) {
1510			s && s.closeParent ? this.open = Math.max(0, this.open - 1) : s && s.skip.nodeType && (e = s.skip);
1511			let n, r = this.needsBlock;
1512			if (ze.hasOwnProperty(a)) i.content.length && i.content[0].isInline && this.open && (this.open--, i = this.top), n = !0, i.type || (this.needsBlock = !0);
1513			else if (!e.firstChild) {
1514				this.leafFallback(e, t);
1515				break out;
1516			}
1517			let o = s && s.skip ? t : this.readStyles(e, t);
1518			o && this.addAll(e, o), n && this.sync(i), this.needsBlock = r;
1519		} else {
1520			let n = this.readStyles(e, t);
1521			n && this.addElementByRule(e, s, n, s.consuming === !1 ? o : void 0);
1522		}
1523		this.localPreserveWS = r;
1524	}
1525	leafFallback(e, t) {
1526		e.nodeName == "BR" && this.top.type && this.top.type.inlineContent && this.addTextNode(e.ownerDocument.createTextNode("\n"), t);
1527	}
1528	ignoreFallback(e, t) {
1529		e.nodeName == "BR" && (!this.top.type || !this.top.type.inlineContent) && this.findPlace(this.parser.schema.text("-"), t, !0);
1530	}
1531	readStyles(e, t) {
1532		let n = e.style;
1533		if (n && n.length) for (let e = 0; e < this.parser.matchedStyles.length; e++) {
1534			let r = this.parser.matchedStyles[e], i = n.getPropertyValue(r);
1535			if (i) for (let e;;) {
1536				let n = this.parser.matchStyle(r, i, this, e);
1537				if (!n) break;
1538				if (n.ignore) return null;
1539				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;
1540				else break;
1541			}
1542		}
1543		return t;
1544	}
1545	addElementByRule(e, t, n, r) {
1546		let i, a;
1547		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);
1548		else {
1549			let e = this.enter(a, t.attrs || null, n, t.preserveWhitespace);
1550			e && (i = !0, n = e);
1551		}
1552		else {
1553			let e = this.parser.schema.marks[t.mark];
1554			n = n.concat(e.create(t.attrs));
1555		}
1556		let o = this.top;
1557		if (a && a.isLeaf) this.findInside(e);
1558		else if (r) this.addElement(e, n, r);
1559		else if (t.getContent) this.findInside(e), t.getContent(e, this.parser.schema).forEach((e) => this.insertNode(e, n, !1));
1560		else {
1561			let r = e;
1562			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);
1563		}
1564		i && this.sync(o) && this.open--;
1565	}
1566	addAll(e, t, n, r) {
1567		let i = n || 0;
1568		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);
1569		this.findAtPoint(e, i);
1570	}
1571	findPlace(e, t, n) {
1572		let r, i;
1573		for (let t = this.open, a = 0; t >= 0; t--) {
1574			let o = this.nodes[t], s = o.findWrapping(e);
1575			if (s && (!r || r.length > s.length + a) && (r = s, i = o, !s.length)) break;
1576			if (o.solid) {
1577				if (n) break;
1578				a += 2;
1579			}
1580		}
1581		if (!r) return null;
1582		this.sync(i);
1583		for (let e = 0; e < r.length; e++) t = this.enterInner(r[e], null, t, !1);
1584		return t;
1585	}
1586	insertNode(e, t, n) {
1587		if (e.isInline && this.needsBlock && !this.top.type) {
1588			let e = this.textblockFromContext();
1589			e && (t = this.enterInner(e, null, t));
1590		}
1591		let r = this.findPlace(e, t, n);
1592		if (r) {
1593			this.closeExtra();
1594			let t = this.top;
1595			t.match &&= t.match.matchType(e.type);
1596			let n = l.none;
1597			for (let i of r.concat(e.marks)) (t.type ? t.type.allowsMarkType(i.type) : Ze(i.type, e.type)) && (n = i.addToSet(n));
1598			return t.content.push(e.mark(n)), !0;
1599		}
1600		return !1;
1601	}
1602	enter(e, t, n, r) {
1603		let i = this.findPlace(e.create(t), n, !1);
1604		return i &&= this.enterInner(e, t, n, !0, r), i;
1605	}
1606	enterInner(e, t, n, r = !1, i) {
1607		this.closeExtra();
1608		let a = this.top;
1609		a.match = a.match && a.match.matchType(e);
1610		let o = Ge(e, i, a.options);
1611		a.options & We && a.content.length == 0 && (o |= We);
1612		let s = l.none;
1613		return n = n.filter((t) => (a.type ? a.type.allowsMarkType(t.type) : Ze(t.type, e)) ? (s = t.addToSet(s), !1) : !0), this.nodes.push(new Ke(e, t, s, r, null, o)), this.open++, n;
1614	}
1615	closeExtra(e = !1) {
1616		let t = this.nodes.length - 1;
1617		if (t > this.open) {
1618			for (; t > this.open; t--) this.nodes[t - 1].content.push(this.nodes[t].finish(e));
1619			this.nodes.length = this.open + 1;
1620		}
1621	}
1622	finish() {
1623		return this.open = 0, this.closeExtra(this.isOpen), this.nodes[0].finish(!!(this.isOpen || this.options.topOpen));
1624	}
1625	sync(e) {
1626		for (let t = this.open; t >= 0; t--) if (this.nodes[t] == e) return this.open = t, !0;
1627		else this.localPreserveWS && (this.nodes[t].options |= He);
1628		return !1;
1629	}
1630	get currentPos() {
1631		this.closeExtra();
1632		let e = 0;
1633		for (let t = this.open; t >= 0; t--) {
1634			let n = this.nodes[t].content;
1635			for (let t = n.length - 1; t >= 0; t--) e += n[t].nodeSize;
1636			t && e++;
1637		}
1638		return e;
1639	}
1640	findAtPoint(e, t) {
1641		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);
1642	}
1643	findInside(e) {
1644		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);
1645	}
1646	findAround(e, t, n) {
1647		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);
1648	}
1649	findInText(e) {
1650		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));
1651	}
1652	matchesContext(e) {
1653		if (e.indexOf("|") > -1) return e.split(/\s*\|\s*/).some(this.matchesContext, this);
1654		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) => {
1655			for (; e >= 0; e--) {
1656				let s = t[e];
1657				if (s == "") {
1658					if (e == t.length - 1 || e == 0) continue;
1659					for (; o >= i; o--) if (a(e - 1, o)) return !0;
1660					return !1;
1661				} else {
1662					let e = o > 0 || o == 0 && r ? this.nodes[o].type : n && o >= i ? n.node(o - i).type : null;
1663					if (!e || e.name != s && !e.isInGroup(s)) return !1;
1664					o--;
1665				}
1666			}
1667			return !0;
1668		};
1669		return a(t.length - 1, this.open);
1670	}
1671	textblockFromContext() {
1672		let e = this.options.context;
1673		if (e) for (let t = e.depth; t >= 0; t--) {
1674			let n = e.node(t).contentMatchAt(e.indexAfter(t)).defaultType;
1675			if (n && n.isTextblock && n.defaultAttrs) return n;
1676		}
1677		for (let e in this.parser.schema.nodes) {
1678			let t = this.parser.schema.nodes[e];
1679			if (t.isTextblock && t.defaultAttrs) return t;
1680		}
1681	}
1682};
1683function Je(e) {
1684	for (let t = e.firstChild, n = null; t; t = t.nextSibling) {
1685		let e = t.nodeType == 1 ? t.nodeName.toLowerCase() : null;
1686		e && Ve.hasOwnProperty(e) && n ? (n.appendChild(t), t = n) : e == "li" ? n = t : e && (n = null);
1687	}
1688}
1689function Ye(e, t) {
1690	return (e.matches || e.msMatchesSelector || e.webkitMatchesSelector || e.mozMatchesSelector).call(e, t);
1691}
1692function Xe(e) {
1693	let t = {};
1694	for (let n in e) t[n] = e[n];
1695	return t;
1696}
1697function Ze(e, t) {
1698	let n = t.schema.nodes;
1699	for (let r in n) {
1700		let i = n[r];
1701		if (!i.allowsMarkType(e)) continue;
1702		let a = [], o = (e) => {
1703			a.push(e);
1704			for (let n = 0; n < e.edgeCount; n++) {
1705				let { type: r, next: i } = e.edge(n);
1706				if (r == t || a.indexOf(i) < 0 && o(i)) return !0;
1707			}
1708		};
1709		if (o(i.contentMatch)) return !0;
1710	}
1711}
1712var Qe = class e {
1713	constructor(e, t) {
1714		this.nodes = e, this.marks = t;
1715	}
1716	serializeFragment(e, t = {}, n) {
1717		n ||= et(t).createDocumentFragment();
1718		let r = n, i = [];
1719		return e.forEach((e) => {
1720			if (i.length || e.marks.length) {
1721				let n = 0, a = 0;
1722				for (; n < i.length && a < e.marks.length;) {
1723					let t = e.marks[a];
1724					if (!this.marks[t.type.name]) {
1725						a++;
1726						continue;
1727					}
1728					if (!t.eq(i[n][0]) || t.type.spec.spanning === !1) break;
1729					n++, a++;
1730				}
1731				for (; n < i.length;) r = i.pop()[1];
1732				for (; a < e.marks.length;) {
1733					let n = e.marks[a++], o = this.serializeMark(n, e.isInline, t);
1734					o && (i.push([n, r]), r.appendChild(o.dom), r = o.contentDOM || o.dom);
1735				}
1736			}
1737			r.appendChild(this.serializeNodeInner(e, t));
1738		}), n;
1739	}
1740	serializeNodeInner(e, t) {
1741		if (e.isText) return et(t).createTextNode(e.text);
1742		let { dom: n, contentDOM: r } = it(et(t), this.nodes[e.type.name](e), null, e.attrs);
1743		if (r) {
1744			if (e.isLeaf) throw RangeError("Content hole not allowed in a leaf node spec");
1745			this.serializeFragment(e.content, t, r);
1746		}
1747		return n;
1748	}
1749	serializeNode(e, t = {}) {
1750		let n = this.serializeNodeInner(e, t);
1751		for (let r = e.marks.length - 1; r >= 0; r--) {
1752			let i = this.serializeMark(e.marks[r], e.isInline, t);
1753			i && ((i.contentDOM || i.dom).appendChild(n), n = i.dom);
1754		}
1755		return n;
1756	}
1757	serializeMark(e, t, n = {}) {
1758		let r = this.marks[e.type.name];
1759		return r && it(et(n), r(e, t), null, e.attrs);
1760	}
1761	static renderSpec(e, t, n = null, r) {
1762		return typeof t == "string" ? { dom: e.createTextNode(t) } : it(e, t, n, r);
1763	}
1764	static fromSchema(t) {
1765		return t.cached.domSerializer || (t.cached.domSerializer = new e(this.nodesFromSchema(t), this.marksFromSchema(t)));
1766	}
1767	static nodesFromSchema(e) {
1768		let t = $e(e.nodes);
1769		return t.text ||= (e) => e.text, t;
1770	}
1771	static marksFromSchema(e) {
1772		return $e(e.marks);
1773	}
1774};
1775function $e(e) {
1776	let t = {};
1777	for (let n in e) {
1778		let r = e[n].spec.toDOM;
1779		r && (t[n] = r);
1780	}
1781	return t;
1782}
1783function et(e) {
1784	return e.document || window.document;
1785}
1786var tt = /* @__PURE__ */ new WeakMap();
1787function nt(e) {
1788	let t = tt.get(e);
1789	return t === void 0 && tt.set(e, t = rt(e)), t;
1790}
1791function rt(e) {
1792	let t = null;
1793	function n(e) {
1794		if (e && typeof e == "object") if (Array.isArray(e)) if (typeof e[0] == "string") t ||= [], t.push(e);
1795		else for (let t = 0; t < e.length; t++) n(e[t]);
1796		else for (let t in e) n(e[t]);
1797	}
1798	return n(e), t;
1799}
1800function it(e, t, n, r) {
1801	if (t.nodeType == 1) return { dom: t };
1802	if (t.dom && t.dom.nodeType == 1) return t;
1803	let i = t[0], a;
1804	if (typeof i != "string") throw RangeError("Invalid array passed to renderSpec");
1805	if (r && (a = nt(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.");
1806	let o = i.indexOf(" ");
1807	o > 0 && (n = i.slice(0, o), i = i.slice(o + 1));
1808	let s, c = n ? e.createElementNS(n, i) : e.createElement(i), l = t[1], u = 1;
1809	if (l && typeof l == "object" && l.nodeType == null && !Array.isArray(l)) {
1810		u = 2;
1811		for (let e in l) if (l[e] != null) {
1812			let t = e.indexOf(" ");
1813			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]);
1814		}
1815	}
1816	for (let i = u; i < t.length; i++) {
1817		let a = t[i];
1818		if (a === 0) {
1819			if (i < t.length - 1 || i > u) throw RangeError("Content hole must be the only child of its parent node");
1820			return {
1821				dom: c,
1822				contentDOM: c
1823			};
1824		} else if (typeof a == "string") c.appendChild(e.createTextNode(a));
1825		else {
1826			let { dom: t, contentDOM: i } = it(e, a, n, r);
1827			if (c.appendChild(t), i) {
1828				if (s) throw RangeError("Multiple content holes");
1829				s = i;
1830			}
1831		}
1832	}
1833	return {
1834		dom: c,
1835		contentDOM: s
1836	};
1837}
1838//#endregion
1839//#region node_modules/prosemirror-transform/dist/index.js
1840var at = 65535, ot = 2 ** 16;
1841function st(e, t) {
1842	return e + t * ot;
1843}
1844function ct(e) {
1845	return e & at;
1846}
1847function lt(e) {
1848	return (e - (e & at)) / ot;
1849}
1850var ut = 1, dt = 2, ft = 4, pt = 8, mt = class {
1851	constructor(e, t, n) {
1852		this.pos = e, this.delInfo = t, this.recover = n;
1853	}
1854	get deleted() {
1855		return (this.delInfo & pt) > 0;
1856	}
1857	get deletedBefore() {
1858		return (this.delInfo & 5) > 0;
1859	}
1860	get deletedAfter() {
1861		return (this.delInfo & 6) > 0;
1862	}
1863	get deletedAcross() {
1864		return (this.delInfo & ft) > 0;
1865	}
1866}, ht = class e {
1867	constructor(t, n = !1) {
1868		if (this.ranges = t, this.inverted = n, !t.length && e.empty) return e.empty;
1869	}
1870	recover(e) {
1871		let t = 0, n = ct(e);
1872		if (!this.inverted) for (let e = 0; e < n; e++) t += this.ranges[e * 3 + 2] - this.ranges[e * 3 + 1];
1873		return this.ranges[n * 3] + t + lt(e);
1874	}
1875	mapResult(e, t = 1) {
1876		return this._map(e, t, !1);
1877	}
1878	map(e, t = 1) {
1879		return this._map(e, t, !0);
1880	}
1881	_map(e, t, n) {
1882		let r = 0, i = this.inverted ? 2 : 1, a = this.inverted ? 1 : 2;
1883		for (let o = 0; o < this.ranges.length; o += 3) {
1884			let s = this.ranges[o] - (this.inverted ? r : 0);
1885			if (s > e) break;
1886			let c = this.ranges[o + i], l = this.ranges[o + a], u = s + c;
1887			if (e <= u) {
1888				let i = c ? e == s ? -1 : e == u ? 1 : t : t, a = s + r + (i < 0 ? 0 : l);
1889				if (n) return a;
1890				let d = e == (t < 0 ? s : u) ? null : st(o / 3, e - s), f = e == s ? dt : e == u ? ut : ft;
1891				return (t < 0 ? e != s : e != u) && (f |= pt), new mt(a, f, d);
1892			}
1893			r += l - c;
1894		}
1895		return n ? e + r : new mt(e + r, 0, null);
1896	}
1897	touches(e, t) {
1898		let n = 0, r = ct(t), i = this.inverted ? 2 : 1, a = this.inverted ? 1 : 2;
1899		for (let t = 0; t < this.ranges.length; t += 3) {
1900			let o = this.ranges[t] - (this.inverted ? n : 0);
1901			if (o > e) break;
1902			let s = this.ranges[t + i];
1903			if (e <= o + s && t == r * 3) return !0;
1904			n += this.ranges[t + a] - s;
1905		}
1906		return !1;
1907	}
1908	forEach(e) {
1909		let t = this.inverted ? 2 : 1, n = this.inverted ? 1 : 2;
1910		for (let r = 0, i = 0; r < this.ranges.length; r += 3) {
1911			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];
1912			e(o, o + c, s, s + l), i += l - c;
1913		}
1914	}
1915	invert() {
1916		return new e(this.ranges, !this.inverted);
1917	}
1918	toString() {
1919		return (this.inverted ? "-" : "") + JSON.stringify(this.ranges);
1920	}
1921	static offset(t) {
1922		return t == 0 ? e.empty : new e(t < 0 ? [
1923			0,
1924			-t,
1925			0
1926		] : [
1927			0,
1928			0,
1929			t
1930		]);
1931	}
1932};
1933ht.empty = new ht([]);
1934var gt = class e {
1935	constructor(e, t, n = 0, r = e ? e.length : 0) {
1936		this.mirror = t, this.from = n, this.to = r, this._maps = e || [], this.ownData = !(e || t);
1937	}
1938	get maps() {
1939		return this._maps;
1940	}
1941	slice(t = 0, n = this.maps.length) {
1942		return new e(this._maps, this.mirror, t, n);
1943	}
1944	appendMap(e, t) {
1945		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);
1946	}
1947	appendMapping(e) {
1948		for (let t = 0, n = this._maps.length; t < e._maps.length; t++) {
1949			let r = e.getMirror(t);
1950			this.appendMap(e._maps[t], r != null && r < t ? n + r : void 0);
1951		}
1952	}
1953	getMirror(e) {
1954		if (this.mirror) {
1955			for (let t = 0; t < this.mirror.length; t++) if (this.mirror[t] == e) return this.mirror[t + (t % 2 ? -1 : 1)];
1956		}
1957	}
1958	setMirror(e, t) {
1959		this.mirror ||= [], this.mirror.push(e, t);
1960	}
1961	appendMappingInverted(e) {
1962		for (let t = e.maps.length - 1, n = this._maps.length + e._maps.length; t >= 0; t--) {
1963			let r = e.getMirror(t);
1964			this.appendMap(e._maps[t].invert(), r != null && r > t ? n - r - 1 : void 0);
1965		}
1966	}
1967	invert() {
1968		let t = new e();
1969		return t.appendMappingInverted(this), t;
1970	}
1971	map(e, t = 1) {
1972		if (this.mirror) return this._map(e, t, !0);
1973		for (let n = this.from; n < this.to; n++) e = this._maps[n].map(e, t);
1974		return e;
1975	}
1976	mapResult(e, t = 1) {
1977		return this._map(e, t, !1);
1978	}
1979	_map(e, t, n) {
1980		let r = 0;
1981		for (let n = this.from; n < this.to; n++) {
1982			let i = this._maps[n].mapResult(e, t);
1983			if (i.recover != null) {
1984				let t = this.getMirror(n);
1985				if (t != null && t > n && t < this.to) {
1986					n = t, e = this._maps[t].recover(i.recover);
1987					continue;
1988				}
1989			}
1990			r |= i.delInfo, e = i.pos;
1991		}
1992		return n ? e : new mt(e, r, null);
1993	}
1994}, _t = Object.create(null), x = class {
1995	getMap() {
1996		return ht.empty;
1997	}
1998	merge(e) {
1999		return null;
2000	}
2001	static fromJSON(e, t) {
2002		if (!t || !t.stepType) throw RangeError("Invalid input for Step.fromJSON");
2003		let n = _t[t.stepType];
2004		if (!n) throw RangeError(`No step type ${t.stepType} defined`);
2005		return n.fromJSON(e, t);
2006	}
2007	static jsonID(e, t) {
2008		if (e in _t) throw RangeError("Duplicate use of step JSON ID " + e);
2009		return _t[e] = t, t.prototype.jsonID = e, t;
2010	}
2011}, S = class e {
2012	constructor(e, t) {
2013		this.doc = e, this.failed = t;
2014	}
2015	static ok(t) {
2016		return new e(t, null);
2017	}
2018	static fail(t) {
2019		return new e(null, t);
2020	}
2021	static fromReplace(t, n, r, i) {
2022		try {
2023			return e.ok(t.replace(n, r, i));
2024		} catch (t) {
2025			if (t instanceof u) return e.fail(t.message);
2026			throw t;
2027		}
2028	}
2029};
2030function vt(e, t, n) {
2031	let r = [];
2032	for (let i = 0; i < e.childCount; i++) {
2033		let a = e.child(i);
2034		a.content.size && (a = a.copy(vt(a.content, t, a))), a.isInline && (a = t(a, n, i)), r.push(a);
2035	}
2036	return a.fromArray(r);
2037}
2038var yt = class e extends x {
2039	constructor(e, t, n) {
2040		super(), this.from = e, this.to = t, this.mark = n;
2041	}
2042	apply(e) {
2043		let t = e.slice(this.from, this.to), n = e.resolve(this.from), r = n.node(n.sharedDepth(this.to)), i = new d(vt(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);
2044		return S.fromReplace(e, this.from, this.to, i);
2045	}
2046	invert() {
2047		return new bt(this.from, this.to, this.mark);
2048	}
2049	map(t) {
2050		let n = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1);
2051		return n.deleted && r.deleted || n.pos >= r.pos ? null : new e(n.pos, r.pos, this.mark);
2052	}
2053	merge(t) {
2054		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;
2055	}
2056	toJSON() {
2057		return {
2058			stepType: "addMark",
2059			mark: this.mark.toJSON(),
2060			from: this.from,
2061			to: this.to
2062		};
2063	}
2064	static fromJSON(t, n) {
2065		if (typeof n.from != "number" || typeof n.to != "number") throw RangeError("Invalid input for AddMarkStep.fromJSON");
2066		return new e(n.from, n.to, t.markFromJSON(n.mark));
2067	}
2068};
2069x.jsonID("addMark", yt);
2070var bt = class e extends x {
2071	constructor(e, t, n) {
2072		super(), this.from = e, this.to = t, this.mark = n;
2073	}
2074	apply(e) {
2075		let t = e.slice(this.from, this.to), n = new d(vt(t.content, (e) => e.mark(this.mark.removeFromSet(e.marks)), e), t.openStart, t.openEnd);
2076		return S.fromReplace(e, this.from, this.to, n);
2077	}
2078	invert() {
2079		return new yt(this.from, this.to, this.mark);
2080	}
2081	map(t) {
2082		let n = t.mapResult(this.from, 1), r = t.mapResult(this.to, -1);
2083		return n.deleted && r.deleted || n.pos >= r.pos ? null : new e(n.pos, r.pos, this.mark);
2084	}
2085	merge(t) {
2086		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;
2087	}
2088	toJSON() {
2089		return {
2090			stepType: "removeMark",
2091			mark: this.mark.toJSON(),
2092			from: this.from,
2093			to: this.to
2094		};
2095	}
2096	static fromJSON(t, n) {
2097		if (typeof n.from != "number" || typeof n.to != "number") throw RangeError("Invalid input for RemoveMarkStep.fromJSON");
2098		return new e(n.from, n.to, t.markFromJSON(n.mark));
2099	}
2100};
2101x.jsonID("removeMark", bt);
2102var xt = class e extends x {
2103	constructor(e, t) {
2104		super(), this.pos = e, this.mark = t;
2105	}
2106	apply(e) {
2107		let t = e.nodeAt(this.pos);
2108		if (!t) return S.fail("No node at mark step's position");
2109		let n = t.type.create(t.attrs, null, this.mark.addToSet(t.marks));
2110		return S.fromReplace(e, this.pos, this.pos + 1, new d(a.from(n), 0, +!t.isLeaf));
2111	}
2112	invert(t) {
2113		let n = t.nodeAt(this.pos);
2114		if (n) {
2115			let t = this.mark.addToSet(n.marks);
2116			if (t.length == n.marks.length) {
2117				for (let r = 0; r < n.marks.length; r++) if (!n.marks[r].isInSet(t)) return new e(this.pos, n.marks[r]);
2118				return new e(this.pos, this.mark);
2119			}
2120		}
2121		return new St(this.pos, this.mark);
2122	}
2123	map(t) {
2124		let n = t.mapResult(this.pos, 1);
2125		return n.deletedAfter ? null : new e(n.pos, this.mark);
2126	}
2127	toJSON() {
2128		return {
2129			stepType: "addNodeMark",
2130			pos: this.pos,
2131			mark: this.mark.toJSON()
2132		};
2133	}
2134	static fromJSON(t, n) {
2135		if (typeof n.pos != "number") throw RangeError("Invalid input for AddNodeMarkStep.fromJSON");
2136		return new e(n.pos, t.markFromJSON(n.mark));
2137	}
2138};
2139x.jsonID("addNodeMark", xt);
2140var St = class e extends x {
2141	constructor(e, t) {
2142		super(), this.pos = e, this.mark = t;
2143	}
2144	apply(e) {
2145		let t = e.nodeAt(this.pos);
2146		if (!t) return S.fail("No node at mark step's position");
2147		let n = t.type.create(t.attrs, null, this.mark.removeFromSet(t.marks));
2148		return S.fromReplace(e, this.pos, this.pos + 1, new d(a.from(n), 0, +!t.isLeaf));
2149	}
2150	invert(e) {
2151		let t = e.nodeAt(this.pos);
2152		return !t || !this.mark.isInSet(t.marks) ? this : new xt(this.pos, this.mark);
2153	}
2154	map(t) {
2155		let n = t.mapResult(this.pos, 1);
2156		return n.deletedAfter ? null : new e(n.pos, this.mark);
2157	}
2158	toJSON() {
2159		return {
2160			stepType: "removeNodeMark",
2161			pos: this.pos,
2162			mark: this.mark.toJSON()
2163		};
2164	}
2165	static fromJSON(t, n) {
2166		if (typeof n.pos != "number") throw RangeError("Invalid input for RemoveNodeMarkStep.fromJSON");
2167		return new e(n.pos, t.markFromJSON(n.mark));
2168	}
2169};
2170x.jsonID("removeNodeMark", St);
2171var Ct = class e extends x {
2172	constructor(e, t, n, r = !1) {
2173		super(), this.from = e, this.to = t, this.slice = n, this.structure = r;
2174	}
2175	apply(e) {
2176		return this.structure && wt(e, this.from, this.to) ? S.fail("Structure replace would overwrite content") : S.fromReplace(e, this.from, this.to, this.slice);
2177	}
2178	getMap() {
2179		return new ht([
2180			this.from,
2181			this.to - this.from,
2182			this.slice.size
2183		]);
2184	}
2185	invert(t) {
2186		return new e(this.from, this.from + this.slice.size, t.slice(this.from, this.to));
2187	}
2188	map(t) {
2189		let n = t.mapResult(this.to, -1), r = this.from == this.to && e.MAP_BIAS < 0 ? n : t.mapResult(this.from, 1);
2190		return r.deletedAcross && n.deletedAcross ? null : new e(r.pos, Math.max(r.pos, n.pos), this.slice, this.structure);
2191	}
2192	merge(t) {
2193		if (!(t instanceof e) || t.structure || this.structure) return null;
2194		if (this.from + this.slice.size == t.from && !this.slice.openEnd && !t.slice.openStart) {
2195			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);
2196			return new e(this.from, this.to + (t.to - t.from), n, this.structure);
2197		} else if (t.to == this.from && !this.slice.openStart && !t.slice.openEnd) {
2198			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);
2199			return new e(t.from, this.to, n, this.structure);
2200		} else return null;
2201	}
2202	toJSON() {
2203		let e = {
2204			stepType: "replace",
2205			from: this.from,
2206			to: this.to
2207		};
2208		return this.slice.size && (e.slice = this.slice.toJSON()), this.structure && (e.structure = !0), e;
2209	}
2210	static fromJSON(t, n) {
2211		if (typeof n.from != "number" || typeof n.to != "number") throw RangeError("Invalid input for ReplaceStep.fromJSON");
2212		return new e(n.from, n.to, d.fromJSON(t, n.slice), !!n.structure);
2213	}
2214};
2215Ct.MAP_BIAS = 1, x.jsonID("replace", Ct);
2216var C = class e extends x {
2217	constructor(e, t, n, r, i, a, o = !1) {
2218		super(), this.from = e, this.to = t, this.gapFrom = n, this.gapTo = r, this.slice = i, this.insert = a, this.structure = o;
2219	}
2220	apply(e) {
2221		if (this.structure && (wt(e, this.from, this.gapFrom) || wt(e, this.gapTo, this.to))) return S.fail("Structure gap-replace would overwrite content");
2222		let t = e.slice(this.gapFrom, this.gapTo);
2223		if (t.openStart || t.openEnd) return S.fail("Gap is not a flat range");
2224		let n = this.slice.insertAt(this.insert, t.content);
2225		return n ? S.fromReplace(e, this.from, this.to, n) : S.fail("Content does not fit in gap");
2226	}
2227	getMap() {
2228		return new ht([
2229			this.from,
2230			this.gapFrom - this.from,
2231			this.insert,
2232			this.gapTo,
2233			this.to - this.gapTo,
2234			this.slice.size - this.insert
2235		]);
2236	}
2237	invert(t) {
2238		let n = this.gapTo - this.gapFrom;
2239		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);
2240	}
2241	map(t) {
2242		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);
2243		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);
2244	}
2245	toJSON() {
2246		let e = {
2247			stepType: "replaceAround",
2248			from: this.from,
2249			to: this.to,
2250			gapFrom: this.gapFrom,
2251			gapTo: this.gapTo,
2252			insert: this.insert
2253		};
2254		return this.slice.size && (e.slice = this.slice.toJSON()), this.structure && (e.structure = !0), e;
2255	}
2256	static fromJSON(t, n) {
2257		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");
2258		return new e(n.from, n.to, n.gapFrom, n.gapTo, d.fromJSON(t, n.slice), n.insert, !!n.structure);
2259	}
2260};
2261x.jsonID("replaceAround", C);
2262function wt(e, t, n) {
2263	let r = e.resolve(t), i = n - t, a = r.depth;
2264	for (; i > 0 && a > 0 && r.indexAfter(a) == r.node(a).childCount;) a--, i--;
2265	if (i > 0) {
2266		let e = r.node(a).maybeChild(r.indexAfter(a));
2267		for (; i > 0;) {
2268			if (!e || e.isLeaf) return !0;
2269			e = e.firstChild, i--;
2270		}
2271	}
2272	return !1;
2273}
2274function Tt(e, t, n, r) {
2275	let i = [], a = [], o, s;
2276	e.doc.nodesBetween(t, n, (e, c, l) => {
2277		if (!e.isInline) return;
2278		let u = e.marks;
2279		if (!r.isInSet(u) && l.type.allowsMarkType(r.type)) {
2280			let l = Math.max(c, t), d = Math.min(c + e.nodeSize, n), f = r.addToSet(u);
2281			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 bt(l, d, u[e])));
2282			s && s.to == l ? s.to = d : a.push(s = new yt(l, d, r));
2283		}
2284	}), i.forEach((t) => e.step(t)), a.forEach((t) => e.step(t));
2285}
2286function Et(e, t, n, r) {
2287	let i = [], a = 0;
2288	e.doc.nodesBetween(t, n, (e, o) => {
2289		if (!e.isInline) return;
2290		a++;
2291		let s = null;
2292		if (r instanceof Ne) {
2293			let t = e.marks, n;
2294			for (; n = r.isInSet(t);) (s ||= []).push(n), t = n.removeFromSet(t);
2295		} else r ? r.isInSet(e.marks) && (s = [r]) : s = e.marks;
2296		if (s && s.length) {
2297			let r = Math.min(o + e.nodeSize, n);
2298			for (let e = 0; e < s.length; e++) {
2299				let n = s[e], c;
2300				for (let e = 0; e < i.length; e++) {
2301					let t = i[e];
2302					t.step == a - 1 && n.eq(i[e].style) && (c = t);
2303				}
2304				c ? (c.to = r, c.step = a) : i.push({
2305					style: n,
2306					from: Math.max(o, t),
2307					to: r,
2308					step: a
2309				});
2310			}
2311		}
2312	}), i.forEach((t) => e.step(new bt(t.from, t.to, t.style)));
2313}
2314function Dt(e, t, n, r = n.contentMatch, i = !0) {
2315	let o = e.doc.nodeAt(t), s = [], c = t + 1;
2316	for (let t = 0; t < o.childCount; t++) {
2317		let l = o.child(t), u = c + l.nodeSize, f = r.matchType(l.type);
2318		if (!f) s.push(new Ct(c, u, d.empty));
2319		else {
2320			r = f;
2321			for (let t = 0; t < l.marks.length; t++) n.allowsMarkType(l.marks[t].type) || e.step(new bt(c, u, l.marks[t]));
2322			if (i && l.isText && n.whitespace != "pre") {
2323				let e, t = /\r?\n|\r/g, r;
2324				for (; e = t.exec(l.text);) r ||= new d(a.from(n.schema.text(" ", n.allowedMarks(l.marks))), 0, 0), s.push(new Ct(c + e.index, c + e.index + e[0].length, r));
2325			}
2326		}
2327		c = u;
2328	}
2329	if (!r.validEnd) {
2330		let t = r.fillBefore(a.empty, !0);
2331		e.replace(c, c, new d(t, 0, 0));
2332	}
2333	for (let t = s.length - 1; t >= 0; t--) e.step(s[t]);
2334}
2335function Ot(e, t, n) {
2336	return (t == 0 || e.canReplace(t, e.childCount)) && (n == e.childCount || e.canReplace(0, n));
2337}
2338function kt(e) {
2339	let t = e.parent.content.cutByIndex(e.startIndex, e.endIndex);
2340	for (let n = e.depth, r = 0, i = 0;; --n) {
2341		let a = e.$from.node(n), o = e.$from.index(n) + r, s = e.$to.indexAfter(n) - i;
2342		if (n < e.depth && a.canReplace(o, s, t)) return n;
2343		if (n == 0 || a.type.spec.isolating || !Ot(a, o, s)) break;
2344		o && (r = 1), s < a.childCount && (i = 1);
2345	}
2346	return null;
2347}
2348function At(e, t, n) {
2349	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;
2350	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--;
2351	let m = a.empty, h = 0;
2352	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++;
2353	e.step(new C(l, u, s, c, new d(f.append(m), p, h), f.size - p, !0));
2354}
2355function jt(e, t, n = null, r = e) {
2356	let i = Nt(e, t), a = i && Pt(r, t);
2357	return a ? i.map(Mt).concat({
2358		type: t,
2359		attrs: n
2360	}).concat(a.map(Mt)) : null;
2361}
2362function Mt(e) {
2363	return {
2364		type: e,
2365		attrs: null
2366	};
2367}
2368function Nt(e, t) {
2369	let { parent: n, startIndex: r, endIndex: i } = e, a = n.contentMatchAt(r).findWrapping(t);
2370	if (!a) return null;
2371	let o = a.length ? a[0] : t;
2372	return n.canReplaceWith(r, i, o) ? a : null;
2373}
2374function Pt(e, t) {
2375	let { parent: n, startIndex: r, endIndex: i } = e, a = n.child(r), o = t.contentMatch.findWrapping(a.type);
2376	if (!o) return null;
2377	let s = (o.length ? o[o.length - 1] : t).contentMatch;
2378	for (let e = r; s && e < i; e++) s = s.matchType(n.child(e).type);
2379	return !s || !s.validEnd ? null : o;
2380}
2381function Ft(e, t, n) {
2382	let r = a.empty;
2383	for (let e = n.length - 1; e >= 0; e--) {
2384		if (r.size) {
2385			let t = n[e].type.contentMatch.matchFragment(r);
2386			if (!t || !t.validEnd) throw RangeError("Wrapper type given to Transform.wrap does not form valid content of its parent wrapper");
2387		}
2388		r = a.from(n[e].type.create(n[e].attrs, r));
2389	}
2390	let i = t.start, o = t.end;
2391	e.step(new C(i, o, i, o, new d(r, 0, 0), n.length, !0));
2392}
2393function It(e, t, n, r, i) {
2394	if (!r.isTextblock) throw RangeError("Type given to setBlockType should be a textblock");
2395	let o = e.steps.length;
2396	e.doc.nodesBetween(t, n, (t, n) => {
2397		let s = typeof i == "function" ? i(t) : i;
2398		if (t.isTextblock && !t.hasMarkup(r, s) && zt(e.doc, e.mapping.slice(o).map(n), r)) {
2399			let i = null;
2400			if (r.schema.linebreakReplacement) {
2401				let e = r.whitespace == "pre", t = !!r.contentMatch.matchType(r.schema.linebreakReplacement);
2402				e && !t ? i = !1 : !e && t && (i = !0);
2403			}
2404			i === !1 && Rt(e, t, n, o), Dt(e, e.mapping.slice(o).map(n, 1), r, void 0, i === null);
2405			let c = e.mapping.slice(o), l = c.map(n, 1), u = c.map(n + t.nodeSize, 1);
2406			return e.step(new C(l, u, l + 1, u - 1, new d(a.from(r.create(s, null, t.marks)), 0, 0), 1, !0)), i === !0 && Lt(e, t, n, o), !1;
2407		}
2408	});
2409}
2410function Lt(e, t, n, r) {
2411	t.forEach((i, a) => {
2412		if (i.isText) {
2413			let o, s = /\r?\n|\r/g;
2414			for (; o = s.exec(i.text);) {
2415				let i = e.mapping.slice(r).map(n + 1 + a + o.index);
2416				e.replaceWith(i, i + 1, t.type.schema.linebreakReplacement.create());
2417			}
2418		}
2419	});
2420}
2421function Rt(e, t, n, r) {
2422	t.forEach((i, a) => {
2423		if (i.type == i.type.schema.linebreakReplacement) {
2424			let i = e.mapping.slice(r).map(n + 1 + a);
2425			e.replaceWith(i, i + 1, t.type.schema.text("\n"));
2426		}
2427	});
2428}
2429function zt(e, t, n) {
2430	let r = e.resolve(t), i = r.index();
2431	return r.parent.canReplaceWith(i, i + 1, n);
2432}
2433function Bt(e, t, n, r, i) {
2434	let o = e.doc.nodeAt(t);
2435	if (!o) throw RangeError("No node at given position");
2436	n ||= o.type;
2437	let s = n.create(r, null, i || o.marks);
2438	if (o.isLeaf) return e.replaceWith(t, t + o.nodeSize, s);
2439	if (!n.validContent(o.content)) throw RangeError("Invalid content for node type " + n.name);
2440	e.step(new C(t, t + o.nodeSize, t + 1, t + o.nodeSize - 1, new d(a.from(s), 0, 0), 1, !0));
2441}
2442function Vt(e, t, n = 1, r) {
2443	let i = e.resolve(t), a = i.depth - n, o = r && r[r.length - 1] || i.parent;
2444	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;
2445	for (let e = i.depth - 1, t = n - 2; e > a; e--, t--) {
2446		let n = i.node(e), a = i.index(e);
2447		if (n.type.spec.isolating) return !1;
2448		let o = n.content.cutByIndex(a, n.childCount), s = r && r[t + 1];
2449		s && (o = o.replaceChild(0, s.type.create(s.attrs)));
2450		let c = r && r[t] || n;
2451		if (!n.canReplace(a + 1, n.childCount) || !c.type.validContent(o)) return !1;
2452	}
2453	let s = i.indexAfter(a), c = r && r[0];
2454	return i.node(a).canReplaceWith(s, s, c ? c.type : i.node(a + 1).type);
2455}
2456function Ht(e, t, n = 1, r) {
2457	let i = e.doc.resolve(t), o = a.empty, s = a.empty;
2458	for (let e = i.depth, t = i.depth - n, c = n - 1; e > t; e--, c--) {
2459		o = a.from(i.node(e).copy(o));
2460		let t = r && r[c];
2461		s = a.from(t ? t.type.create(t.attrs, s) : i.node(e).copy(s));
2462	}
2463	e.step(new Ct(t, t, new d(o.append(s), n, n), !0));
2464}
2465function Ut(e, t) {
2466	let n = e.resolve(t), r = n.index();
2467	return Gt(n.nodeBefore, n.nodeAfter) && n.parent.canReplace(r, r + 1);
2468}
2469function Wt(e, t) {
2470	t.content.size || e.type.compatibleContent(t.type);
2471	let n = e.contentMatchAt(e.childCount), { linebreakReplacement: r } = e.type.schema;
2472	for (let i = 0; i < t.childCount; i++) {
2473		let a = t.child(i), o = a.type == r ? e.type.schema.nodes.text : a.type;
2474		if (n = n.matchType(o), !n || !e.type.allowsMarks(a.marks)) return !1;
2475	}
2476	return n.validEnd;
2477}
2478function Gt(e, t) {
2479	return !!(e && t && !e.isLeaf && Wt(e, t));
2480}
2481function Kt(e, t, n = -1) {
2482	let r = e.resolve(t);
2483	for (let e = r.depth;; e--) {
2484		let i, a, o = r.index(e);
2485		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 && Gt(i, a) && r.node(e).canReplace(o, o + 1)) return t;
2486		if (e == 0) break;
2487		t = n < 0 ? r.before(e) : r.after(e);
2488	}
2489}
2490function qt(e, t, n) {
2491	let r = null, { linebreakReplacement: i } = e.doc.type.schema, a = e.doc.resolve(t - n), o = a.node().type;
2492	if (i && o.inlineContent) {
2493		let e = o.whitespace == "pre", t = !!o.contentMatch.matchType(i);
2494		e && !t ? r = !1 : !e && t && (r = !0);
2495	}
2496	let s = e.steps.length;
2497	if (r === !1) {
2498		let r = e.doc.resolve(t + n);
2499		Rt(e, r.node(), r.before(), s);
2500	}
2501	o.inlineContent && Dt(e, t + n - 1, o, a.node().contentMatchAt(a.index()), r == null);
2502	let c = e.mapping.slice(s), l = c.map(t - n);
2503	if (e.step(new Ct(l, c.map(t + n, -1), d.empty, !0)), r === !0) {
2504		let t = e.doc.resolve(l);
2505		Lt(e, t.node(), t.before(), e.steps.length);
2506	}
2507	return e;
2508}
2509function Jt(e, t, n) {
2510	let r = e.resolve(t);
2511	if (r.parent.canReplaceWith(r.index(), r.index(), n)) return t;
2512	if (r.parentOffset == 0) for (let e = r.depth - 1; e >= 0; e--) {
2513		let t = r.index(e);
2514		if (r.node(e).canReplaceWith(t, t, n)) return r.before(e + 1);
2515		if (t > 0) return null;
2516	}
2517	if (r.parentOffset == r.parent.content.size) for (let e = r.depth - 1; e >= 0; e--) {
2518		let t = r.indexAfter(e);
2519		if (r.node(e).canReplaceWith(t, t, n)) return r.after(e + 1);
2520		if (t < r.node(e).childCount) return null;
2521	}
2522	return null;
2523}
2524function Yt(e, t, n) {
2525	let r = e.resolve(t);
2526	if (!n.content.size) return t;
2527	let i = n.content;
2528	for (let e = 0; e < n.openStart; e++) i = i.firstChild.content;
2529	for (let e = 1; e <= (n.openStart == 0 && n.size ? 2 : 1); e++) for (let t = r.depth; t >= 0; t--) {
2530		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;
2531		if (e == 1) s = o.canReplace(a, a, i);
2532		else {
2533			let e = o.contentMatchAt(a).findWrapping(i.firstChild.type);
2534			s = e && o.canReplaceWith(a, a, e[0]);
2535		}
2536		if (s) return n == 0 ? r.pos : n < 0 ? r.before(t + 1) : r.after(t + 1);
2537	}
2538	return null;
2539}
2540function Xt(e, t, n = t, r = d.empty) {
2541	if (t == n && !r.size) return null;
2542	let i = e.resolve(t), a = e.resolve(n);
2543	return Zt(i, a, r) ? new Ct(t, n, r) : new Qt(i, a, r).fit();
2544}
2545function Zt(e, t, n) {
2546	return !n.openStart && !n.openEnd && e.start() == t.start() && e.parent.canReplace(e.index(), t.index(), n.content);
2547}
2548var Qt = class {
2549	constructor(e, t, n) {
2550		this.$from = e, this.$to = t, this.unplaced = n, this.frontier = [], this.placed = a.empty;
2551		for (let t = 0; t <= e.depth; t++) {
2552			let n = e.node(t);
2553			this.frontier.push({
2554				type: n.type,
2555				match: n.contentMatchAt(e.indexAfter(t))
2556			});
2557		}
2558		for (let t = e.depth; t > 0; t--) this.placed = a.from(e.node(t).copy(this.placed));
2559	}
2560	get depth() {
2561		return this.frontier.length - 1;
2562	}
2563	fit() {
2564		for (; this.unplaced.size;) {
2565			let e = this.findFittable();
2566			e ? this.placeNodes(e) : this.openMore() || this.dropNode();
2567		}
2568		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));
2569		if (!r) return null;
2570		let i = this.placed, a = n.depth, o = r.depth;
2571		for (; a && o && i.childCount == 1;) i = i.firstChild.content, a--, o--;
2572		let s = new d(i, a, o);
2573		return e > -1 ? new C(n.pos, e, this.$to.pos, this.$to.end(), s, t) : s.size || n.pos != this.$to.pos ? new Ct(n.pos, r.pos, s) : null;
2574	}
2575	findFittable() {
2576		let e = this.unplaced.openStart;
2577		for (let t = this.unplaced.content, n = 0, r = this.unplaced.openEnd; n < e; n++) {
2578			let i = t.firstChild;
2579			if (t.childCount > 1 && (r = 0), i.type.spec.isolating && r <= n) {
2580				e = n;
2581				break;
2582			}
2583			t = i.content;
2584		}
2585		for (let t = 1; t <= 2; t++) for (let n = t == 1 ? e : this.unplaced.openStart; n >= 0; n--) {
2586			let e, r = null;
2587			n ? (r = tn(this.unplaced.content, n - 1).firstChild, e = r.content) : e = this.unplaced.content;
2588			let i = e.firstChild;
2589			for (let e = this.depth; e >= 0; e--) {
2590				let { type: o, match: s } = this.frontier[e], c, l = null;
2591				if (t == 1 && (i ? s.matchType(i.type) || (l = s.fillBefore(a.from(i), !1)) : r && o.compatibleContent(r.type))) return {
2592					sliceDepth: n,
2593					frontierDepth: e,
2594					parent: r,
2595					inject: l
2596				};
2597				if (t == 2 && i && (c = s.findWrapping(i.type))) return {
2598					sliceDepth: n,
2599					frontierDepth: e,
2600					parent: r,
2601					wrap: c
2602				};
2603				if (r && s.matchType(r.type)) break;
2604			}
2605		}
2606	}
2607	openMore() {
2608		let { content: e, openStart: t, openEnd: n } = this.unplaced, r = tn(e, t);
2609		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);
2610	}
2611	dropNode() {
2612		let { content: e, openStart: t, openEnd: n } = this.unplaced, r = tn(e, t);
2613		if (r.childCount <= 1 && t > 0) {
2614			let i = e.size - t <= t + r.size;
2615			this.unplaced = new d($t(e, t - 1, 1), t - 1, i ? t - 1 : n);
2616		} else this.unplaced = new d($t(e, t, 1), t, n);
2617	}
2618	placeNodes({ sliceDepth: e, frontierDepth: t, parent: n, inject: r, wrap: i }) {
2619		for (; this.depth > t;) this.closeFrontierNode();
2620		if (i) for (let e = 0; e < i.length; e++) this.openFrontierNode(i[e]);
2621		let o = this.unplaced, s = n ? n.content : o.content, c = o.openStart - e, l = 0, u = [], { match: f, type: p } = this.frontier[t];
2622		if (r) {
2623			for (let e = 0; e < r.childCount; e++) u.push(r.child(e));
2624			f = f.matchFragment(r);
2625		}
2626		let m = s.size + e - (o.content.size - o.openEnd);
2627		for (; l < s.childCount;) {
2628			let e = s.child(l), t = f.matchType(e.type);
2629			if (!t) break;
2630			l++, (l > 1 || c == 0 || e.content.size) && (f = t, u.push(nn(e.mark(p.allowedMarks(e.marks)), l == 1 ? c : 0, l == s.childCount ? m : -1)));
2631		}
2632		let h = l == s.childCount;
2633		h || (m = -1), this.placed = en(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();
2634		for (let e = 0, t = s; e < m; e++) {
2635			let e = t.lastChild;
2636			this.frontier.push({
2637				type: e.type,
2638				match: e.contentMatchAt(e.childCount)
2639			}), t = e.content;
2640		}
2641		this.unplaced = h ? e == 0 ? d.empty : new d($t(o.content, e - 1, 1), e - 1, m < 0 ? o.openEnd : e - 1) : new d($t(o.content, e, l), o.openStart, o.openEnd);
2642	}
2643	mustMoveInline() {
2644		if (!this.$to.parent.isTextblock) return -1;
2645		let e = this.frontier[this.depth], t;
2646		if (!e.type.isTextblock || !rn(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;
2647		let { depth: n } = this.$to, r = this.$to.after(n);
2648		for (; n > 1 && r == this.$to.end(--n);) ++r;
2649		return r;
2650	}
2651	findCloseLevel(e) {
2652		scan: for (let t = Math.min(this.depth, e.depth); t >= 0; t--) {
2653			let { match: n, type: r } = this.frontier[t], i = t < e.depth && e.end(t + 1) == e.pos + (e.depth - (t + 1)), a = rn(e, t, r, n, i);
2654			if (a) {
2655				for (let n = t - 1; n >= 0; n--) {
2656					let { match: t, type: r } = this.frontier[n], i = rn(e, n, r, t, !0);
2657					if (!i || i.childCount) continue scan;
2658				}
2659				return {
2660					depth: t,
2661					fit: a,
2662					move: i ? e.doc.resolve(e.after(t + 1)) : e
2663				};
2664			}
2665		}
2666	}
2667	close(e) {
2668		let t = this.findCloseLevel(e);
2669		if (!t) return null;
2670		for (; this.depth > t.depth;) this.closeFrontierNode();
2671		t.fit.childCount && (this.placed = en(this.placed, t.depth, t.fit)), e = t.move;
2672		for (let n = t.depth + 1; n <= e.depth; n++) {
2673			let t = e.node(n), r = t.type.contentMatch.fillBefore(t.content, !0, e.index(n));
2674			this.openFrontierNode(t.type, t.attrs, r);
2675		}
2676		return e;
2677	}
2678	openFrontierNode(e, t = null, n) {
2679		let r = this.frontier[this.depth];
2680		r.match = r.match.matchType(e), this.placed = en(this.placed, this.depth, a.from(e.create(t, n))), this.frontier.push({
2681			type: e,
2682			match: e.contentMatch
2683		});
2684	}
2685	closeFrontierNode() {
2686		let e = this.frontier.pop().match.fillBefore(a.empty, !0);
2687		e.childCount && (this.placed = en(this.placed, this.frontier.length, e));
2688	}
2689};
2690function $t(e, t, n) {
2691	return t == 0 ? e.cutByIndex(n, e.childCount) : e.replaceChild(0, e.firstChild.copy($t(e.firstChild.content, t - 1, n)));
2692}
2693function en(e, t, n) {
2694	return t == 0 ? e.append(n) : e.replaceChild(e.childCount - 1, e.lastChild.copy(en(e.lastChild.content, t - 1, n)));
2695}
2696function tn(e, t) {
2697	for (let n = 0; n < t; n++) e = e.firstChild.content;
2698	return e;
2699}
2700function nn(e, t, n) {
2701	if (t <= 0) return e;
2702	let r = e.content;
2703	return t > 1 && (r = r.replaceChild(0, nn(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);
2704}
2705function rn(e, t, n, r, i) {
2706	let a = e.node(t), o = i ? e.indexAfter(t) : e.index(t);
2707	if (o == a.childCount && !n.compatibleContent(a.type)) return null;
2708	let s = r.fillBefore(a.content, !0, o);
2709	return s && !an(n, a.content, o) ? s : null;
2710}
2711function an(e, t, n) {
2712	for (let r = n; r < t.childCount; r++) if (!e.allowsMarks(t.child(r).marks)) return !0;
2713	return !1;
2714}
2715function on(e) {
2716	return e.spec.defining || e.spec.definingForContent;
2717}
2718function sn(e, t, n, r) {
2719	if (!r.size) return e.deleteRange(t, n);
2720	let i = e.doc.resolve(t), a = e.doc.resolve(n);
2721	if (Zt(i, a, r)) return e.step(new Ct(t, n, r));
2722	let o = dn(i, a);
2723	o[o.length - 1] == 0 && o.pop();
2724	let s = -(i.depth + 1);
2725	o.unshift(s);
2726	for (let e = i.depth, t = i.pos - 1; e > 0; e--, t--) {
2727		let n = i.node(e).type.spec;
2728		if (n.defining || n.definingAsContext || n.isolating) break;
2729		o.indexOf(e) > -1 ? s = e : i.before(e) == t && o.splice(1, 0, -e);
2730	}
2731	let c = o.indexOf(s), l = [], u = r.openStart;
2732	for (let e = r.content, t = 0;; t++) {
2733		let n = e.firstChild;
2734		if (l.push(n), t == r.openStart) break;
2735		e = n.content;
2736	}
2737	for (let e = u - 1; e >= 0; e--) {
2738		let t = l[e], n = on(t.type);
2739		if (n && !t.sameMarkup(i.node(Math.abs(s) - 1))) u = e;
2740		else if (n || !t.type.isTextblock) break;
2741	}
2742	for (let t = r.openStart; t >= 0; t--) {
2743		let s = (t + u + 1) % (r.openStart + 1), f = l[s];
2744		if (f) for (let t = 0; t < o.length; t++) {
2745			let l = o[(t + c) % o.length], u = !0;
2746			l < 0 && (u = !1, l = -l);
2747			let p = i.node(l - 1), m = i.index(l - 1);
2748			if (p.canReplaceWith(m, m, f.type, f.marks)) return e.replace(i.before(l), u ? a.after(l) : n, new d(cn(r.content, 0, r.openStart, s), s, r.openEnd));
2749		}
2750	}
2751	let f = e.steps.length;
2752	for (let s = o.length - 1; s >= 0 && (e.replace(t, n, r), !(e.steps.length > f)); s--) {
2753		let e = o[s];
2754		e < 0 || (t = i.before(e), n = a.after(e));
2755	}
2756}
2757function cn(e, t, n, r, i) {
2758	if (t < n) {
2759		let i = e.firstChild;
2760		e = e.replaceChild(0, i.copy(cn(i.content, t + 1, n, r, i)));
2761	}
2762	if (t > r) {
2763		let t = i.contentMatchAt(0), n = t.fillBefore(e).append(e);
2764		e = n.append(t.matchFragment(n).fillBefore(a.empty, !0));
2765	}
2766	return e;
2767}
2768function ln(e, t, n, r) {
2769	if (!r.isInline && t == n && e.doc.resolve(t).parent.content.size) {
2770		let i = Jt(e.doc, t, r.type);
2771		i != null && (t = n = i);
2772	}
2773	e.replaceRange(t, n, new d(a.from(r), 0, 0));
2774}
2775function un(e, t, n) {
2776	let r = e.doc.resolve(t), i = e.doc.resolve(n);
2777	if (r.parent.isTextblock && i.parent.isTextblock && r.start() != i.start() && r.parentOffset == 0 && i.parentOffset == 0) {
2778		let a = r.sharedDepth(n), o = !1;
2779		for (let e = r.depth; e > a; e--) r.node(e).type.spec.isolating && (o = !0);
2780		for (let e = i.depth; e > a; e--) i.node(e).type.spec.isolating && (o = !0);
2781		if (!o) {
2782			for (let e = r.depth; e > 0 && t == r.start(e); e--) t = r.before(e);
2783			for (let e = i.depth; e > 0 && n == i.start(e); e--) n = i.before(e);
2784			r = e.doc.resolve(t), i = e.doc.resolve(n);
2785		}
2786	}
2787	let a = dn(r, i);
2788	for (let t = 0; t < a.length; t++) {
2789		let n = a[t], o = t == a.length - 1;
2790		if (o && n == 0 || r.node(n).type.contentMatch.validEnd) return e.delete(r.start(n), i.end(n));
2791		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));
2792	}
2793	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);
2794	e.delete(t, n);
2795}
2796function dn(e, t) {
2797	let n = [], r = Math.min(e.depth, t.depth);
2798	for (let i = r; i >= 0; i--) {
2799		let r = e.start(i);
2800		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;
2801		(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);
2802	}
2803	return n;
2804}
2805var fn = class e extends x {
2806	constructor(e, t, n) {
2807		super(), this.pos = e, this.attr = t, this.value = n;
2808	}
2809	apply(e) {
2810		let t = e.nodeAt(this.pos);
2811		if (!t) return S.fail("No node at attribute step's position");
2812		let n = Object.create(null);
2813		for (let e in t.attrs) n[e] = t.attrs[e];
2814		n[this.attr] = this.value;
2815		let r = t.type.create(n, null, t.marks);
2816		return S.fromReplace(e, this.pos, this.pos + 1, new d(a.from(r), 0, +!t.isLeaf));
2817	}
2818	getMap() {
2819		return ht.empty;
2820	}
2821	invert(t) {
2822		return new e(this.pos, this.attr, t.nodeAt(this.pos).attrs[this.attr]);
2823	}
2824	map(t) {
2825		let n = t.mapResult(this.pos, 1);
2826		return n.deletedAfter ? null : new e(n.pos, this.attr, this.value);
2827	}
2828	toJSON() {
2829		return {
2830			stepType: "attr",
2831			pos: this.pos,
2832			attr: this.attr,
2833			value: this.value
2834		};
2835	}
2836	static fromJSON(t, n) {
2837		if (typeof n.pos != "number" || typeof n.attr != "string") throw RangeError("Invalid input for AttrStep.fromJSON");
2838		return new e(n.pos, n.attr, n.value);
2839	}
2840};
2841x.jsonID("attr", fn);
2842var pn = class e extends x {
2843	constructor(e, t) {
2844		super(), this.attr = e, this.value = t;
2845	}
2846	apply(e) {
2847		let t = Object.create(null);
2848		for (let n in e.attrs) t[n] = e.attrs[n];
2849		t[this.attr] = this.value;
2850		let n = e.type.create(t, e.content, e.marks);
2851		return S.ok(n);
2852	}
2853	getMap() {
2854		return ht.empty;
2855	}
2856	invert(t) {
2857		return new e(this.attr, t.attrs[this.attr]);
2858	}
2859	map(e) {
2860		return this;
2861	}
2862	toJSON() {
2863		return {
2864			stepType: "docAttr",
2865			attr: this.attr,
2866			value: this.value
2867		};
2868	}
2869	static fromJSON(t, n) {
2870		if (typeof n.attr != "string") throw RangeError("Invalid input for DocAttrStep.fromJSON");
2871		return new e(n.attr, n.value);
2872	}
2873};
2874x.jsonID("docAttr", pn);
2875var mn = class extends Error {};
2876mn = function e(t) {
2877	let n = Error.call(this, t);
2878	return n.__proto__ = e.prototype, n;
2879}, mn.prototype = Object.create(Error.prototype), mn.prototype.constructor = mn, mn.prototype.name = "TransformError";
2880var hn = class {
2881	constructor(e) {
2882		this.doc = e, this.steps = [], this.docs = [], this.mapping = new gt();
2883	}
2884	get before() {
2885		return this.docs.length ? this.docs[0] : this.doc;
2886	}
2887	step(e) {
2888		let t = this.maybeStep(e);
2889		if (t.failed) throw new mn(t.failed);
2890		return this;
2891	}
2892	maybeStep(e) {
2893		let t = e.apply(this.doc);
2894		return t.failed || this.addStep(e, t.doc), t;
2895	}
2896	get docChanged() {
2897		return this.steps.length > 0;
2898	}
2899	changedRange() {
2900		let e = 1e9, t = -1e9;
2901		for (let n = 0; n < this.mapping.maps.length; n++) {
2902			let r = this.mapping.maps[n];
2903			n && (e = r.map(e, 1), t = r.map(t, -1)), r.forEach((n, r, i, a) => {
2904				e = Math.min(e, i), t = Math.max(t, a);
2905			});
2906		}
2907		return e == 1e9 ? null : {
2908			from: e,
2909			to: t
2910		};
2911	}
2912	addStep(e, t) {
2913		this.docs.push(this.doc), this.steps.push(e), this.mapping.appendMap(e.getMap()), this.doc = t;
2914	}
2915	replace(e, t = e, n = d.empty) {
2916		let r = Xt(this.doc, e, t, n);
2917		return r && this.step(r), this;
2918	}
2919	replaceWith(e, t, n) {
2920		return this.replace(e, t, new d(a.from(n), 0, 0));
2921	}
2922	delete(e, t) {
2923		return this.replace(e, t, d.empty);
2924	}
2925	insert(e, t) {
2926		return this.replaceWith(e, e, t);
2927	}
2928	replaceRange(e, t, n) {
2929		return sn(this, e, t, n), this;
2930	}
2931	replaceRangeWith(e, t, n) {
2932		return ln(this, e, t, n), this;
2933	}
2934	deleteRange(e, t) {
2935		return un(this, e, t), this;
2936	}
2937	lift(e, t) {
2938		return At(this, e, t), this;
2939	}
2940	join(e, t = 1) {
2941		return qt(this, e, t), this;
2942	}
2943	wrap(e, t) {
2944		return Ft(this, e, t), this;
2945	}
2946	setBlockType(e, t = e, n, r = null) {
2947		return It(this, e, t, n, r), this;
2948	}
2949	setNodeMarkup(e, t, n = null, r) {
2950		return Bt(this, e, t, n, r), this;
2951	}
2952	setNodeAttribute(e, t, n) {
2953		return this.step(new fn(e, t, n)), this;
2954	}
2955	setDocAttribute(e, t) {
2956		return this.step(new pn(e, t)), this;
2957	}
2958	addNodeMark(e, t) {
2959		return this.step(new xt(e, t)), this;
2960	}
2961	removeNodeMark(e, t) {
2962		let n = this.doc.nodeAt(e);
2963		if (!n) throw RangeError("No node at position " + e);
2964		if (t instanceof l) t.isInSet(n.marks) && this.step(new St(e, t));
2965		else {
2966			let r = n.marks, i, a = [];
2967			for (; i = t.isInSet(r);) a.push(new St(e, i)), r = i.removeFromSet(r);
2968			for (let e = a.length - 1; e >= 0; e--) this.step(a[e]);
2969		}
2970		return this;
2971	}
2972	split(e, t = 1, n) {
2973		return Ht(this, e, t, n), this;
2974	}
2975	addMark(e, t, n) {
2976		return Tt(this, e, t, n), this;
2977	}
2978	removeMark(e, t, n) {
2979		return Et(this, e, t, n), this;
2980	}
2981	clearIncompatible(e, t, n) {
2982		return Dt(this, e, t, n), this;
2983	}
2984}, gn = Object.create(null), w = class {
2985	constructor(e, t, n) {
2986		this.$anchor = e, this.$head = t, this.ranges = n || [new _n(e.min(t), e.max(t))];
2987	}
2988	get anchor() {
2989		return this.$anchor.pos;
2990	}
2991	get head() {
2992		return this.$head.pos;
2993	}
2994	get from() {
2995		return this.$from.pos;
2996	}
2997	get to() {
2998		return this.$to.pos;
2999	}
3000	get $from() {
3001		return this.ranges[0].$from;
3002	}
3003	get $to() {
3004		return this.ranges[0].$to;
3005	}
3006	get empty() {
3007		let e = this.ranges;
3008		for (let t = 0; t < e.length; t++) if (e[t].$from.pos != e[t].$to.pos) return !1;
3009		return !0;
3010	}
3011	content() {
3012		return this.$from.doc.slice(this.from, this.to, !0);
3013	}
3014	replace(e, t = d.empty) {
3015		let n = t.content.lastChild, r = null;
3016		for (let e = 0; e < t.openEnd; e++) r = n, n = n.lastChild;
3017		let i = e.steps.length, a = this.ranges;
3018		for (let o = 0; o < a.length; o++) {
3019			let { $from: s, $to: c } = a[o], l = e.mapping.slice(i);
3020			e.replaceRange(l.map(s.pos), l.map(c.pos), o ? d.empty : t), o == 0 && Tn(e, i, (n ? n.isInline : r && r.isTextblock) ? -1 : 1);
3021		}
3022	}
3023	replaceWith(e, t) {
3024		let n = e.steps.length, r = this.ranges;
3025		for (let i = 0; i < r.length; i++) {
3026			let { $from: a, $to: o } = r[i], s = e.mapping.slice(n), c = s.map(a.pos), l = s.map(o.pos);
3027			i ? e.deleteRange(c, l) : (e.replaceRangeWith(c, l, t), Tn(e, n, t.isInline ? -1 : 1));
3028		}
3029	}
3030	static findFrom(e, t, n = !1) {
3031		let r = e.parent.inlineContent ? new T(e) : wn(e.node(0), e.parent, e.pos, e.index(), t, n);
3032		if (r) return r;
3033		for (let r = e.depth - 1; r >= 0; r--) {
3034			let i = t < 0 ? wn(e.node(0), e.node(r), e.before(r + 1), e.index(r), t, n) : wn(e.node(0), e.node(r), e.after(r + 1), e.index(r) + 1, t, n);
3035			if (i) return i;
3036		}
3037		return null;
3038	}
3039	static near(e, t = 1) {
3040		return this.findFrom(e, t) || this.findFrom(e, -t) || new Sn(e.node(0));
3041	}
3042	static atStart(e) {
3043		return wn(e, e, 0, 0, 1) || new Sn(e);
3044	}
3045	static atEnd(e) {
3046		return wn(e, e, e.content.size, e.childCount, -1) || new Sn(e);
3047	}
3048	static fromJSON(e, t) {
3049		if (!t || !t.type) throw RangeError("Invalid input for Selection.fromJSON");
3050		let n = gn[t.type];
3051		if (!n) throw RangeError(`No selection type ${t.type} defined`);
3052		return n.fromJSON(e, t);
3053	}
3054	static jsonID(e, t) {
3055		if (e in gn) throw RangeError("Duplicate use of selection JSON ID " + e);
3056		return gn[e] = t, t.prototype.jsonID = e, t;
3057	}
3058	getBookmark() {
3059		return T.between(this.$anchor, this.$head).getBookmark();
3060	}
3061};
3062w.prototype.visible = !0;
3063var _n = class {
3064	constructor(e, t) {
3065		this.$from = e, this.$to = t;
3066	}
3067}, vn = !1;
3068function yn(e) {
3069	!vn && !e.parent.inlineContent && (vn = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + e.parent.type.name + ")"));
3070}
3071var T = class e extends w {
3072	constructor(e, t = e) {
3073		yn(e), yn(t), super(e, t);
3074	}
3075	get $cursor() {
3076		return this.$anchor.pos == this.$head.pos ? this.$head : null;
3077	}
3078	map(t, n) {
3079		let r = t.resolve(n.map(this.head));
3080		if (!r.parent.inlineContent) return w.near(r);
3081		let i = t.resolve(n.map(this.anchor));
3082		return new e(i.parent.inlineContent ? i : r, r);
3083	}
3084	replace(e, t = d.empty) {
3085		if (super.replace(e, t), t == d.empty) {
3086			let t = this.$from.marksAcross(this.$to);
3087			t && e.ensureMarks(t);
3088		}
3089	}
3090	eq(t) {
3091		return t instanceof e && t.anchor == this.anchor && t.head == this.head;
3092	}
3093	getBookmark() {
3094		return new bn(this.anchor, this.head);
3095	}
3096	toJSON() {
3097		return {
3098			type: "text",
3099			anchor: this.anchor,
3100			head: this.head
3101		};
3102	}
3103	static fromJSON(t, n) {
3104		if (typeof n.anchor != "number" || typeof n.head != "number") throw RangeError("Invalid input for TextSelection.fromJSON");
3105		return new e(t.resolve(n.anchor), t.resolve(n.head));
3106	}
3107	static create(e, t, n = t) {
3108		let r = e.resolve(t);
3109		return new this(r, n == t ? r : e.resolve(n));
3110	}
3111	static between(t, n, r) {
3112		let i = t.pos - n.pos;
3113		if ((!r || i) && (r = i >= 0 ? 1 : -1), !n.parent.inlineContent) {
3114			let e = w.findFrom(n, r, !0) || w.findFrom(n, -r, !0);
3115			if (e) n = e.$head;
3116			else return w.near(n, r);
3117		}
3118		return t.parent.inlineContent || (i == 0 ? t = n : (t = (w.findFrom(t, -r, !0) || w.findFrom(t, r, !0)).$anchor, t.pos < n.pos != i < 0 && (t = n))), new e(t, n);
3119	}
3120};
3121w.jsonID("text", T);
3122var bn = class e {
3123	constructor(e, t) {
3124		this.anchor = e, this.head = t;
3125	}
3126	map(t) {
3127		return new e(t.map(this.anchor), t.map(this.head));
3128	}
3129	resolve(e) {
3130		return T.between(e.resolve(this.anchor), e.resolve(this.head));
3131	}
3132}, E = class e extends w {
3133	constructor(e) {
3134		let t = e.nodeAfter, n = e.node(0).resolve(e.pos + t.nodeSize);
3135		super(e, n), this.node = t;
3136	}
3137	map(t, n) {
3138		let { deleted: r, pos: i } = n.mapResult(this.anchor), a = t.resolve(i);
3139		return r ? w.near(a) : new e(a);
3140	}
3141	content() {
3142		return new d(a.from(this.node), 0, 0);
3143	}
3144	eq(t) {
3145		return t instanceof e && t.anchor == this.anchor;
3146	}
3147	toJSON() {
3148		return {
3149			type: "node",
3150			anchor: this.anchor
3151		};
3152	}
3153	getBookmark() {
3154		return new xn(this.anchor);
3155	}
3156	static fromJSON(t, n) {
3157		if (typeof n.anchor != "number") throw RangeError("Invalid input for NodeSelection.fromJSON");
3158		return new e(t.resolve(n.anchor));
3159	}
3160	static create(t, n) {
3161		return new e(t.resolve(n));
3162	}
3163	static isSelectable(e) {
3164		return !e.isText && e.type.spec.selectable !== !1;
3165	}
3166};
3167E.prototype.visible = !1, w.jsonID("node", E);
3168var xn = class e {
3169	constructor(e) {
3170		this.anchor = e;
3171	}
3172	map(t) {
3173		let { deleted: n, pos: r } = t.mapResult(this.anchor);
3174		return n ? new bn(r, r) : new e(r);
3175	}
3176	resolve(e) {
3177		let t = e.resolve(this.anchor), n = t.nodeAfter;
3178		return n && E.isSelectable(n) ? new E(t) : w.near(t);
3179	}
3180}, Sn = class e extends w {
3181	constructor(e) {
3182		super(e.resolve(0), e.resolve(e.content.size));
3183	}
3184	replace(e, t = d.empty) {
3185		if (t == d.empty) {