@burdenoff/microfe-technospam 2026.1102.1 → 2026.1102.2

package/dist/node_modules/@codemirror/state/dist/index.js

@@ -0,0 +1,1739 @@
+import { findClusterBreak as e } from "../../../@marijn/find-cluster-break/src/index.js";
+//#region node_modules/@codemirror/state/dist/index.js
+var t = class e {
+	lineAt(e) {
+		if (e < 0 || e > this.length) throw RangeError(`Invalid position ${e} in document of length ${this.length}`);
+		return this.lineInner(e, !1, 1, 0);
+	}
+	line(e) {
+		if (e < 1 || e > this.lines) throw RangeError(`Invalid line number ${e} in ${this.lines}-line document`);
+		return this.lineInner(e, !0, 1, 0);
+	}
+	replace(e, t, n) {
+		[e, t] = d(this, e, t);
+		let i = [];
+		return this.decompose(0, e, i, 2), n.length && n.decompose(0, n.length, i, 3), this.decompose(t, this.length, i, 1), r.from(i, this.length - (t - e) + n.length);
+	}
+	append(e) {
+		return this.replace(this.length, this.length, e);
+	}
+	slice(e, t = this.length) {
+		[e, t] = d(this, e, t);
+		let n = [];
+		return this.decompose(e, t, n, 0), r.from(n, t - e);
+	}
+	eq(e) {
+		if (e == this) return !0;
+		if (e.length != this.length || e.lines != this.lines) return !1;
+		let t = this.scanIdentical(e, 1), n = this.length - this.scanIdentical(e, -1), r = new s(this), i = new s(e);
+		for (let e = t, a = t;;) {
+			if (r.next(e), i.next(e), e = 0, r.lineBreak != i.lineBreak || r.done != i.done || r.value != i.value) return !1;
+			if (a += r.value.length, r.done || a >= n) return !0;
+		}
+	}
+	iter(e = 1) {
+		return new s(this, e);
+	}
+	iterRange(e, t = this.length) {
+		return new c(this, e, t);
+	}
+	iterLines(e, t) {
+		let n;
+		if (e == null) n = this.iter();
+		else {
+			t ??= this.lines + 1;
+			let r = this.line(e).from;
+			n = this.iterRange(r, Math.max(r, t == this.lines + 1 ? this.length : t <= 1 ? 0 : this.line(t - 1).to));
+		}
+		return new l(n);
+	}
+	toString() {
+		return this.sliceString(0);
+	}
+	toJSON() {
+		let e = [];
+		return this.flatten(e), e;
+	}
+	constructor() {}
+	static of(t) {
+		if (t.length == 0) throw RangeError("A document must have at least one line");
+		return t.length == 1 && !t[0] ? e.empty : t.length <= 32 ? new n(t) : r.from(n.split(t, []));
+	}
+}, n = class e extends t {
+	constructor(e, t = i(e)) {
+		super(), this.text = e, this.length = t;
+	}
+	get lines() {
+		return this.text.length;
+	}
+	get children() {
+		return null;
+	}
+	lineInner(e, t, n, r) {
+		for (let i = 0;; i++) {
+			let a = this.text[i], o = r + a.length;
+			if ((t ? n : o) >= e) return new u(r, o, n, a);
+			r = o + 1, n++;
+		}
+	}
+	decompose(t, n, r, i) {
+		let s = t <= 0 && n >= this.length ? this : new e(o(this.text, t, n), Math.min(n, this.length) - Math.max(0, t));
+		if (i & 1) {
+			let t = r.pop(), n = a(s.text, t.text.slice(), 0, s.length);
+			if (n.length <= 32) r.push(new e(n, t.length + s.length));
+			else {
+				let t = n.length >> 1;
+				r.push(new e(n.slice(0, t)), new e(n.slice(t)));
+			}
+		} else r.push(s);
+	}
+	replace(t, n, i) {
+		if (!(i instanceof e)) return super.replace(t, n, i);
+		[t, n] = d(this, t, n);
+		let s = a(this.text, a(i.text, o(this.text, 0, t)), n), c = this.length + i.length - (n - t);
+		return s.length <= 32 ? new e(s, c) : r.from(e.split(s, []), c);
+	}
+	sliceString(e, t = this.length, n = "\n") {
+		[e, t] = d(this, e, t);
+		let r = "";
+		for (let i = 0, a = 0; i <= t && a < this.text.length; a++) {
+			let o = this.text[a], s = i + o.length;
+			i > e && a && (r += n), e < s && t > i && (r += o.slice(Math.max(0, e - i), t - i)), i = s + 1;
+		}
+		return r;
+	}
+	flatten(e) {
+		for (let t of this.text) e.push(t);
+	}
+	scanIdentical() {
+		return 0;
+	}
+	static split(t, n) {
+		let r = [], i = -1;
+		for (let a of t) r.push(a), i += a.length + 1, r.length == 32 && (n.push(new e(r, i)), r = [], i = -1);
+		return i > -1 && n.push(new e(r, i)), n;
+	}
+}, r = class e extends t {
+	constructor(e, t) {
+		super(), this.children = e, this.length = t, this.lines = 0;
+		for (let t of e) this.lines += t.lines;
+	}
+	lineInner(e, t, n, r) {
+		for (let i = 0;; i++) {
+			let a = this.children[i], o = r + a.length, s = n + a.lines - 1;
+			if ((t ? s : o) >= e) return a.lineInner(e, t, n, r);
+			r = o + 1, n = s + 1;
+		}
+	}
+	decompose(e, t, n, r) {
+		for (let i = 0, a = 0; a <= t && i < this.children.length; i++) {
+			let o = this.children[i], s = a + o.length;
+			if (e <= s && t >= a) {
+				let i = r & (a <= e | (s >= t ? 2 : 0));
+				a >= e && s <= t && !i ? n.push(o) : o.decompose(e - a, t - a, n, i);
+			}
+			a = s + 1;
+		}
+	}
+	replace(t, n, r) {
+		if ([t, n] = d(this, t, n), r.lines < this.lines) for (let i = 0, a = 0; i < this.children.length; i++) {
+			let o = this.children[i], s = a + o.length;
+			if (t >= a && n <= s) {
+				let c = o.replace(t - a, n - a, r), l = this.lines - o.lines + c.lines;
+				if (c.lines < l >> 4 && c.lines > l >> 6) {
+					let a = this.children.slice();
+					return a[i] = c, new e(a, this.length - (n - t) + r.length);
+				}
+				return super.replace(a, s, c);
+			}
+			a = s + 1;
+		}
+		return super.replace(t, n, r);
+	}
+	sliceString(e, t = this.length, n = "\n") {
+		[e, t] = d(this, e, t);
+		let r = "";
+		for (let i = 0, a = 0; i < this.children.length && a <= t; i++) {
+			let o = this.children[i], s = a + o.length;
+			a > e && i && (r += n), e < s && t > a && (r += o.sliceString(e - a, t - a, n)), a = s + 1;
+		}
+		return r;
+	}
+	flatten(e) {
+		for (let t of this.children) t.flatten(e);
+	}
+	scanIdentical(t, n) {
+		if (!(t instanceof e)) return 0;
+		let r = 0, [i, a, o, s] = n > 0 ? [
+			0,
+			0,
+			this.children.length,
+			t.children.length
+		] : [
+			this.children.length - 1,
+			t.children.length - 1,
+			-1,
+			-1
+		];
+		for (;; i += n, a += n) {
+			if (i == o || a == s) return r;
+			let e = this.children[i], c = t.children[a];
+			if (e != c) return r + e.scanIdentical(c, n);
+			r += e.length + 1;
+		}
+	}
+	static from(t, r = t.reduce((e, t) => e + t.length + 1, -1)) {
+		let i = 0;
+		for (let e of t) i += e.lines;
+		if (i < 32) {
+			let e = [];
+			for (let n of t) n.flatten(e);
+			return new n(e, r);
+		}
+		let a = Math.max(32, i >> 5), o = a << 1, s = a >> 1, c = [], l = 0, u = -1, d = [];
+		function f(t) {
+			let r;
+			if (t.lines > o && t instanceof e) for (let e of t.children) f(e);
+			else t.lines > s && (l > s || !l) ? (p(), c.push(t)) : t instanceof n && l && (r = d[d.length - 1]) instanceof n && t.lines + r.lines <= 32 ? (l += t.lines, u += t.length + 1, d[d.length - 1] = new n(r.text.concat(t.text), r.length + 1 + t.length)) : (l + t.lines > a && p(), l += t.lines, u += t.length + 1, d.push(t));
+		}
+		function p() {
+			l != 0 && (c.push(d.length == 1 ? d[0] : e.from(d, u)), u = -1, l = d.length = 0);
+		}
+		for (let e of t) f(e);
+		return p(), c.length == 1 ? c[0] : new e(c, r);
+	}
+};
+t.empty = /* @__PURE__ */ new n([""], 0);
+function i(e) {
+	let t = -1;
+	for (let n of e) t += n.length + 1;
+	return t;
+}
+function a(e, t, n = 0, r = 1e9) {
+	for (let i = 0, a = 0, o = !0; a < e.length && i <= r; a++) {
+		let s = e[a], c = i + s.length;
+		c >= n && (c > r && (s = s.slice(0, r - i)), i < n && (s = s.slice(n - i)), o ? (t[t.length - 1] += s, o = !1) : t.push(s)), i = c + 1;
+	}
+	return t;
+}
+function o(e, t, n) {
+	return a(e, [""], t, n);
+}
+var s = class {
+	constructor(e, t = 1) {
+		this.dir = t, this.done = !1, this.lineBreak = !1, this.value = "", this.nodes = [e], this.offsets = [t > 0 ? 1 : (e instanceof n ? e.text.length : e.children.length) << 1];
+	}
+	nextInner(e, t) {
+		for (this.done = this.lineBreak = !1;;) {
+			let r = this.nodes.length - 1, i = this.nodes[r], a = this.offsets[r], o = a >> 1, s = i instanceof n ? i.text.length : i.children.length;
+			if (o == (t > 0 ? s : 0)) {
+				if (r == 0) return this.done = !0, this.value = "", this;
+				t > 0 && this.offsets[r - 1]++, this.nodes.pop(), this.offsets.pop();
+			} else if ((a & 1) == (t > 0 ? 0 : 1)) {
+				if (this.offsets[r] += t, e == 0) return this.lineBreak = !0, this.value = "\n", this;
+				e--;
+			} else if (i instanceof n) {
+				let n = i.text[o + (t < 0 ? -1 : 0)];
+				if (this.offsets[r] += t, n.length > Math.max(0, e)) return this.value = e == 0 ? n : t > 0 ? n.slice(e) : n.slice(0, n.length - e), this;
+				e -= n.length;
+			} else {
+				let a = i.children[o + (t < 0 ? -1 : 0)];
+				e > a.length ? (e -= a.length, this.offsets[r] += t) : (t < 0 && this.offsets[r]--, this.nodes.push(a), this.offsets.push(t > 0 ? 1 : (a instanceof n ? a.text.length : a.children.length) << 1));
+			}
+		}
+	}
+	next(e = 0) {
+		return e < 0 && (this.nextInner(-e, -this.dir), e = this.value.length), this.nextInner(e, this.dir);
+	}
+}, c = class {
+	constructor(e, t, n) {
+		this.value = "", this.done = !1, this.cursor = new s(e, t > n ? -1 : 1), this.pos = t > n ? e.length : 0, this.from = Math.min(t, n), this.to = Math.max(t, n);
+	}
+	nextInner(e, t) {
+		if (t < 0 ? this.pos <= this.from : this.pos >= this.to) return this.value = "", this.done = !0, this;
+		e += Math.max(0, t < 0 ? this.pos - this.to : this.from - this.pos);
+		let n = t < 0 ? this.pos - this.from : this.to - this.pos;
+		e > n && (e = n), n -= e;
+		let { value: r } = this.cursor.next(e);
+		return this.pos += (r.length + e) * t, this.value = r.length <= n ? r : t < 0 ? r.slice(r.length - n) : r.slice(0, n), this.done = !this.value, this;
+	}
+	next(e = 0) {
+		return e < 0 ? e = Math.max(e, this.from - this.pos) : e > 0 && (e = Math.min(e, this.to - this.pos)), this.nextInner(e, this.cursor.dir);
+	}
+	get lineBreak() {
+		return this.cursor.lineBreak && this.value != "";
+	}
+}, l = class {
+	constructor(e) {
+		this.inner = e, this.afterBreak = !0, this.value = "", this.done = !1;
+	}
+	next(e = 0) {
+		let { done: t, lineBreak: n, value: r } = this.inner.next(e);
+		return t && this.afterBreak ? (this.value = "", this.afterBreak = !1) : t ? (this.done = !0, this.value = "") : n ? this.afterBreak ? this.value = "" : (this.afterBreak = !0, this.next()) : (this.value = r, this.afterBreak = !1), this;
+	}
+	get lineBreak() {
+		return !1;
+	}
+};
+typeof Symbol < "u" && (t.prototype[Symbol.iterator] = function() {
+	return this.iter();
+}, s.prototype[Symbol.iterator] = c.prototype[Symbol.iterator] = l.prototype[Symbol.iterator] = function() {
+	return this;
+});
+var u = class {
+	constructor(e, t, n, r) {
+		this.from = e, this.to = t, this.number = n, this.text = r;
+	}
+	get length() {
+		return this.to - this.from;
+	}
+};
+function d(e, t, n) {
+	return t = Math.max(0, Math.min(e.length, t)), [t, Math.max(t, Math.min(e.length, n))];
+}
+function f(t, n, r = !0, i = !0) {
+	return e(t, n, r, i);
+}
+function p(e) {
+	return e >= 56320 && e < 57344;
+}
+function m(e) {
+	return e >= 55296 && e < 56320;
+}
+function h(e, t) {
+	let n = e.charCodeAt(t);
+	if (!m(n) || t + 1 == e.length) return n;
+	let r = e.charCodeAt(t + 1);
+	return p(r) ? (n - 55296 << 10) + (r - 56320) + 65536 : n;
+}
+function ee(e) {
+	return e <= 65535 ? String.fromCharCode(e) : (e -= 65536, String.fromCharCode((e >> 10) + 55296, (e & 1023) + 56320));
+}
+function te(e) {
+	return e < 65536 ? 1 : 2;
+}
+var ne = /\r\n?|\n/, g = /* @__PURE__ */ (function(e) {
+	return e[e.Simple = 0] = "Simple", e[e.TrackDel = 1] = "TrackDel", e[e.TrackBefore = 2] = "TrackBefore", e[e.TrackAfter = 3] = "TrackAfter", e;
+})(g ||= {}), _ = class e {
+	constructor(e) {
+		this.sections = e;
+	}
+	get length() {
+		let e = 0;
+		for (let t = 0; t < this.sections.length; t += 2) e += this.sections[t];
+		return e;
+	}
+	get newLength() {
+		let e = 0;
+		for (let t = 0; t < this.sections.length; t += 2) {
+			let n = this.sections[t + 1];
+			e += n < 0 ? this.sections[t] : n;
+		}
+		return e;
+	}
+	get empty() {
+		return this.sections.length == 0 || this.sections.length == 2 && this.sections[1] < 0;
+	}
+	iterGaps(e) {
+		for (let t = 0, n = 0, r = 0; t < this.sections.length;) {
+			let i = this.sections[t++], a = this.sections[t++];
+			a < 0 ? (e(n, r, i), r += i) : r += a, n += i;
+		}
+	}
+	iterChangedRanges(e, t = !1) {
+		x(this, e, t);
+	}
+	get invertedDesc() {
+		let t = [];
+		for (let e = 0; e < this.sections.length;) {
+			let n = this.sections[e++], r = this.sections[e++];
+			r < 0 ? t.push(n, r) : t.push(r, n);
+		}
+		return new e(t);
+	}
+	composeDesc(e) {
+		return this.empty ? e : e.empty ? this : re(this, e);
+	}
+	mapDesc(e, t = !1) {
+		return e.empty ? this : S(this, e, t);
+	}
+	mapPos(e, t = -1, n = g.Simple) {
+		let r = 0, i = 0;
+		for (let a = 0; a < this.sections.length;) {
+			let o = this.sections[a++], s = this.sections[a++], c = r + o;
+			if (s < 0) {
+				if (c > e) return i + (e - r);
+				i += o;
+			} else {
+				if (n != g.Simple && c >= e && (n == g.TrackDel && r < e && c > e || n == g.TrackBefore && r < e || n == g.TrackAfter && c > e)) return null;
+				if (c > e || c == e && t < 0 && !o) return e == r || t < 0 ? i : i + s;
+				i += s;
+			}
+			r = c;
+		}
+		if (e > r) throw RangeError(`Position ${e} is out of range for changeset of length ${r}`);
+		return i;
+	}
+	touchesRange(e, t = e) {
+		for (let n = 0, r = 0; n < this.sections.length && r <= t;) {
+			let i = this.sections[n++], a = this.sections[n++], o = r + i;
+			if (a >= 0 && r <= t && o >= e) return r < e && o > t ? "cover" : !0;
+			r = o;
+		}
+		return !1;
+	}
+	toString() {
+		let e = "";
+		for (let t = 0; t < this.sections.length;) {
+			let n = this.sections[t++], r = this.sections[t++];
+			e += (e ? " " : "") + n + (r >= 0 ? ":" + r : "");
+		}
+		return e;
+	}
+	toJSON() {
+		return this.sections;
+	}
+	static fromJSON(t) {
+		if (!Array.isArray(t) || t.length % 2 || t.some((e) => typeof e != "number")) throw RangeError("Invalid JSON representation of ChangeDesc");
+		return new e(t);
+	}
+	static create(t) {
+		return new e(t);
+	}
+}, v = class e extends _ {
+	constructor(e, t) {
+		super(e), this.inserted = t;
+	}
+	apply(e) {
+		if (this.length != e.length) throw RangeError("Applying change set to a document with the wrong length");
+		return x(this, (t, n, r, i, a) => e = e.replace(r, r + (n - t), a), !1), e;
+	}
+	mapDesc(e, t = !1) {
+		return S(this, e, t, !0);
+	}
+	invert(n) {
+		let r = this.sections.slice(), i = [];
+		for (let e = 0, a = 0; e < r.length; e += 2) {
+			let o = r[e], s = r[e + 1];
+			if (s >= 0) {
+				r[e] = s, r[e + 1] = o;
+				let c = e >> 1;
+				for (; i.length < c;) i.push(t.empty);
+				i.push(o ? n.slice(a, a + o) : t.empty);
+			}
+			a += o;
+		}
+		return new e(r, i);
+	}
+	compose(e) {
+		return this.empty ? e : e.empty ? this : re(this, e, !0);
+	}
+	map(e, t = !1) {
+		return e.empty ? this : S(this, e, t, !0);
+	}
+	iterChanges(e, t = !1) {
+		x(this, e, t);
+	}
+	get desc() {
+		return _.create(this.sections);
+	}
+	filter(t) {
+		let n = [], r = [], i = [], a = new C(this);
+		done: for (let e = 0, o = 0;;) {
+			let s = e == t.length ? 1e9 : t[e++];
+			for (; o < s || o == s && a.len == 0;) {
+				if (a.done) break done;
+				let e = Math.min(a.len, s - o);
+				y(i, e, -1);
+				let t = a.ins == -1 ? -1 : a.off == 0 ? a.ins : 0;
+				y(n, e, t), t > 0 && b(r, n, a.text), a.forward(e), o += e;
+			}
+			let c = t[e++];
+			for (; o < c;) {
+				if (a.done) break done;
+				let e = Math.min(a.len, c - o);
+				y(n, e, -1), y(i, e, a.ins == -1 ? -1 : a.off == 0 ? a.ins : 0), a.forward(e), o += e;
+			}
+		}
+		return {
+			changes: new e(n, r),
+			filtered: _.create(i)
+		};
+	}
+	toJSON() {
+		let e = [];
+		for (let t = 0; t < this.sections.length; t += 2) {
+			let n = this.sections[t], r = this.sections[t + 1];
+			r < 0 ? e.push(n) : r == 0 ? e.push([n]) : e.push([n].concat(this.inserted[t >> 1].toJSON()));
+		}
+		return e;
+	}
+	static of(n, r, i) {
+		let a = [], o = [], s = 0, c = null;
+		function l(t = !1) {
+			if (!t && !a.length) return;
+			s < r && y(a, r - s, -1);
+			let n = new e(a, o);
+			c = c ? c.compose(n.map(c)) : n, a = [], o = [], s = 0;
+		}
+		function u(n) {
+			if (Array.isArray(n)) for (let e of n) u(e);
+			else if (n instanceof e) {
+				if (n.length != r) throw RangeError(`Mismatched change set length (got ${n.length}, expected ${r})`);
+				l(), c = c ? c.compose(n.map(c)) : n;
+			} else {
+				let { from: e, to: c = e, insert: u } = n;
+				if (e > c || e < 0 || c > r) throw RangeError(`Invalid change range ${e} to ${c} (in doc of length ${r})`);
+				let d = u ? typeof u == "string" ? t.of(u.split(i || ne)) : u : t.empty, f = d.length;
+				if (e == c && f == 0) return;
+				e < s && l(), e > s && y(a, e - s, -1), y(a, c - e, f), b(o, a, d), s = c;
+			}
+		}
+		return u(n), l(!c), c;
+	}
+	static empty(t) {
+		return new e(t ? [t, -1] : [], []);
+	}
+	static fromJSON(n) {
+		if (!Array.isArray(n)) throw RangeError("Invalid JSON representation of ChangeSet");
+		let r = [], i = [];
+		for (let e = 0; e < n.length; e++) {
+			let a = n[e];
+			if (typeof a == "number") r.push(a, -1);
+			else if (!Array.isArray(a) || typeof a[0] != "number" || a.some((e, t) => t && typeof e != "string")) throw RangeError("Invalid JSON representation of ChangeSet");
+			else if (a.length == 1) r.push(a[0], 0);
+			else {
+				for (; i.length < e;) i.push(t.empty);
+				i[e] = t.of(a.slice(1)), r.push(a[0], i[e].length);
+			}
+		}
+		return new e(r, i);
+	}
+	static createSet(t, n) {
+		return new e(t, n);
+	}
+};
+function y(e, t, n, r = !1) {
+	if (t == 0 && n <= 0) return;
+	let i = e.length - 2;
+	i >= 0 && n <= 0 && n == e[i + 1] ? e[i] += t : i >= 0 && t == 0 && e[i] == 0 ? e[i + 1] += n : r ? (e[i] += t, e[i + 1] += n) : e.push(t, n);
+}
+function b(e, n, r) {
+	if (r.length == 0) return;
+	let i = n.length - 2 >> 1;
+	if (i < e.length) e[e.length - 1] = e[e.length - 1].append(r);
+	else {
+		for (; e.length < i;) e.push(t.empty);
+		e.push(r);
+	}
+}
+function x(e, n, r) {
+	let i = e.inserted;
+	for (let a = 0, o = 0, s = 0; s < e.sections.length;) {
+		let c = e.sections[s++], l = e.sections[s++];
+		if (l < 0) a += c, o += c;
+		else {
+			let u = a, d = o, f = t.empty;
+			for (; u += c, d += l, l && i && (f = f.append(i[s - 2 >> 1])), !(r || s == e.sections.length || e.sections[s + 1] < 0);) c = e.sections[s++], l = e.sections[s++];
+			n(a, u, o, d, f), a = u, o = d;
+		}
+	}
+}
+function S(e, t, n, r = !1) {
+	let i = [], a = r ? [] : null, o = new C(e), s = new C(t);
+	for (let e = -1;;) if (o.done && s.len || s.done && o.len) throw Error("Mismatched change set lengths");
+	else if (o.ins == -1 && s.ins == -1) {
+		let e = Math.min(o.len, s.len);
+		y(i, e, -1), o.forward(e), s.forward(e);
+	} else if (s.ins >= 0 && (o.ins < 0 || e == o.i || o.off == 0 && (s.len < o.len || s.len == o.len && !n))) {
+		let t = s.len;
+		for (y(i, s.ins, -1); t;) {
+			let n = Math.min(o.len, t);
+			o.ins >= 0 && e < o.i && o.len <= n && (y(i, 0, o.ins), a && b(a, i, o.text), e = o.i), o.forward(n), t -= n;
+		}
+		s.next();
+	} else if (o.ins >= 0) {
+		let t = 0, n = o.len;
+		for (; n;) if (s.ins == -1) {
+			let e = Math.min(n, s.len);
+			t += e, n -= e, s.forward(e);
+		} else if (s.ins == 0 && s.len < n) n -= s.len, s.next();
+		else break;
+		y(i, t, e < o.i ? o.ins : 0), a && e < o.i && b(a, i, o.text), e = o.i, o.forward(o.len - n);
+	} else if (o.done && s.done) return a ? v.createSet(i, a) : _.create(i);
+	else throw Error("Mismatched change set lengths");
+}
+function re(e, t, n = !1) {
+	let r = [], i = n ? [] : null, a = new C(e), o = new C(t);
+	for (let e = !1;;) if (a.done && o.done) return i ? v.createSet(r, i) : _.create(r);
+	else if (a.ins == 0) y(r, a.len, 0, e), a.next();
+	else if (o.len == 0 && !o.done) y(r, 0, o.ins, e), i && b(i, r, o.text), o.next();
+	else if (a.done || o.done) throw Error("Mismatched change set lengths");
+	else {
+		let t = Math.min(a.len2, o.len), n = r.length;
+		if (a.ins == -1) {
+			let n = o.ins == -1 ? -1 : o.off ? 0 : o.ins;
+			y(r, t, n, e), i && n && b(i, r, o.text);
+		} else o.ins == -1 ? (y(r, a.off ? 0 : a.len, t, e), i && b(i, r, a.textBit(t))) : (y(r, a.off ? 0 : a.len, o.off ? 0 : o.ins, e), i && !o.off && b(i, r, o.text));
+		e = (a.ins > t || o.ins >= 0 && o.len > t) && (e || r.length > n), a.forward2(t), o.forward(t);
+	}
+}
+var C = class {
+	constructor(e) {
+		this.set = e, this.i = 0, this.next();
+	}
+	next() {
+		let { sections: e } = this.set;
+		this.i < e.length ? (this.len = e[this.i++], this.ins = e[this.i++]) : (this.len = 0, this.ins = -2), this.off = 0;
+	}
+	get done() {
+		return this.ins == -2;
+	}
+	get len2() {
+		return this.ins < 0 ? this.len : this.ins;
+	}
+	get text() {
+		let { inserted: e } = this.set, n = this.i - 2 >> 1;
+		return n >= e.length ? t.empty : e[n];
+	}
+	textBit(e) {
+		let { inserted: n } = this.set, r = this.i - 2 >> 1;
+		return r >= n.length && !e ? t.empty : n[r].slice(this.off, e == null ? void 0 : this.off + e);
+	}
+	forward(e) {
+		e == this.len ? this.next() : (this.len -= e, this.off += e);
+	}
+	forward2(e) {
+		this.ins == -1 ? this.forward(e) : e == this.ins ? this.next() : (this.ins -= e, this.off += e);
+	}
+}, w = class e {
+	constructor(e, t, n, r) {
+		this.from = e, this.to = t, this.flags = n, this.goalColumn = r;
+	}
+	get anchor() {
+		return this.flags & 32 ? this.to : this.from;
+	}
+	get head() {
+		return this.flags & 32 ? this.from : this.to;
+	}
+	get empty() {
+		return this.from == this.to;
+	}
+	get assoc() {
+		return this.flags & 8 ? -1 : this.flags & 16 ? 1 : 0;
+	}
+	get undirectional() {
+		return (this.flags & 64) > 0;
+	}
+	get bidiLevel() {
+		let e = this.flags & 7;
+		return e == 7 ? null : e;
+	}
+	map(t, n = -1) {
+		let r, i;
+		return this.empty ? r = i = t.mapPos(this.from, n) : (r = t.mapPos(this.from, 1), i = t.mapPos(this.to, -1)), r == this.from && i == this.to ? this : new e(r, i, this.flags, this.goalColumn);
+	}
+	extend(e, t = e, n = 0) {
+		if (e <= this.anchor && t >= this.anchor) return T.range(e, t, void 0, void 0, n);
+		let r = Math.abs(e - this.anchor) > Math.abs(t - this.anchor) ? e : t;
+		return T.range(this.anchor, r, void 0, void 0, n);
+	}
+	eq(e, t = !1) {
+		return this.anchor == e.anchor && this.head == e.head && this.goalColumn == e.goalColumn && (!t || !this.empty || this.assoc == e.assoc);
+	}
+	toJSON() {
+		return {
+			anchor: this.anchor,
+			head: this.head
+		};
+	}
+	static fromJSON(e) {
+		if (!e || typeof e.anchor != "number" || typeof e.head != "number") throw RangeError("Invalid JSON representation for SelectionRange");
+		return T.range(e.anchor, e.head);
+	}
+	static create(t, n, r, i) {
+		return new e(t, n, r, i);
+	}
+}, T = class e {
+	constructor(e, t) {
+		this.ranges = e, this.mainIndex = t;
+	}
+	map(t, n = -1) {
+		return t.empty ? this : e.create(this.ranges.map((e) => e.map(t, n)), this.mainIndex);
+	}
+	eq(e, t = !1) {
+		if (this.ranges.length != e.ranges.length || this.mainIndex != e.mainIndex) return !1;
+		for (let n = 0; n < this.ranges.length; n++) if (!this.ranges[n].eq(e.ranges[n], t)) return !1;
+		return !0;
+	}
+	get main() {
+		return this.ranges[this.mainIndex];
+	}
+	asSingle() {
+		return this.ranges.length == 1 ? this : new e([this.main], 0);
+	}
+	addRange(t, n = !0) {
+		return e.create([t].concat(this.ranges), n ? 0 : this.mainIndex + 1);
+	}
+	replaceRange(t, n = this.mainIndex) {
+		let r = this.ranges.slice();
+		return r[n] = t, e.create(r, this.mainIndex);
+	}
+	toJSON() {
+		return {
+			ranges: this.ranges.map((e) => e.toJSON()),
+			main: this.mainIndex
+		};
+	}
+	static fromJSON(t) {
+		if (!t || !Array.isArray(t.ranges) || typeof t.main != "number" || t.main >= t.ranges.length) throw RangeError("Invalid JSON representation for EditorSelection");
+		return new e(t.ranges.map((e) => w.fromJSON(e)), t.main);
+	}
+	static single(t, n = t) {
+		return new e([e.range(t, n)], 0);
+	}
+	static create(t, n = 0) {
+		if (t.length == 0) throw RangeError("A selection needs at least one range");
+		for (let r = 0, i = 0; i < t.length; i++) {
+			let a = t[i];
+			if (a.empty ? a.from <= r : a.from < r) return e.normalized(t.slice(), n);
+			r = a.to;
+		}
+		return new e(t, n);
+	}
+	static cursor(e, t = 0, n, r) {
+		return w.create(e, e, (t == 0 ? 0 : t < 0 ? 8 : 16) | (n == null ? 7 : Math.min(6, n)), r);
+	}
+	static range(e, t, n, r, i) {
+		let a = r == null ? 7 : Math.min(6, r);
+		return !i && e != t && (i = t < e ? 1 : -1), i && (a |= i < 0 ? 8 : 16), t < e ? w.create(t, e, a | 32, n) : w.create(e, t, a, n);
+	}
+	static undirectionalRange(e, t) {
+		return w.create(e, t, 64, void 0);
+	}
+	static normalized(t, n = 0) {
+		let r = t[n];
+		t.sort((e, t) => e.from - t.from), n = t.indexOf(r);
+		for (let r = 1; r < t.length; r++) {
+			let i = t[r], a = t[r - 1];
+			if (i.empty ? i.from <= a.to : i.from < a.to) {
+				let o = a.from, s = Math.max(i.to, a.to);
+				r <= n && n--, t.splice(--r, 2, i.anchor > i.head ? e.range(s, o) : e.range(o, s));
+			}
+		}
+		return new e(t, n);
+	}
+};
+function ie(e, t) {
+	for (let n of e.ranges) if (n.to > t) throw RangeError("Selection points outside of document");
+}
+var ae = 0, E = class e {
+	constructor(e, t, n, r, i) {
+		this.combine = e, this.compareInput = t, this.compare = n, this.isStatic = r, this.id = ae++, this.default = e([]), this.extensions = typeof i == "function" ? i(this) : i;
+	}
+	get reader() {
+		return this;
+	}
+	static define(t = {}) {
+		return new e(t.combine || ((e) => e), t.compareInput || ((e, t) => e === t), t.compare || (t.combine ? (e, t) => e === t : oe), !!t.static, t.enables);
+	}
+	of(e) {
+		return new D([], this, 0, e);
+	}
+	compute(e, t) {
+		if (this.isStatic) throw Error("Can't compute a static facet");
+		return new D(e, this, 1, t);
+	}
+	computeN(e, t) {
+		if (this.isStatic) throw Error("Can't compute a static facet");
+		return new D(e, this, 2, t);
+	}
+	from(e, t) {
+		return t ||= (e) => e, this.compute([e], (n) => t(n.field(e)));
+	}
+};
+function oe(e, t) {
+	return e == t || e.length == t.length && e.every((e, n) => e === t[n]);
+}
+var D = class {
+	constructor(e, t, n, r) {
+		this.dependencies = e, this.facet = t, this.type = n, this.value = r, this.id = ae++;
+	}
+	dynamicSlot(e) {
+		let t = this.value, n = this.facet.compareInput, r = this.id, i = e[r] >> 1, a = this.type == 2, o = !1, s = !1, c = [];
+		for (let t of this.dependencies) t == "doc" ? o = !0 : t == "selection" ? s = !0 : (e[t.id] ?? 1) & 1 || c.push(e[t.id]);
+		return {
+			create(e) {
+				return e.values[i] = t(e), 1;
+			},
+			update(e, r) {
+				if (o && r.docChanged || s && (r.docChanged || r.selection) || O(e, c)) {
+					let r = t(e);
+					if (a ? !se(r, e.values[i], n) : !n(r, e.values[i])) return e.values[i] = r, 1;
+				}
+				return 0;
+			},
+			reconfigure: (e, o) => {
+				let s, c = o.config.address[r];
+				if (c != null) {
+					let r = F(o, c);
+					if (this.dependencies.every((t) => t instanceof E ? o.facet(t) === e.facet(t) : t instanceof A ? o.field(t, !1) == e.field(t, !1) : !0) || (a ? se(s = t(e), r, n) : n(s = t(e), r))) return e.values[i] = r, 0;
+				} else s = t(e);
+				return e.values[i] = s, 1;
+			}
+		};
+	}
+	get extension() {
+		return this;
+	}
+};
+function se(e, t, n) {
+	if (e.length != t.length) return !1;
+	for (let r = 0; r < e.length; r++) if (!n(e[r], t[r])) return !1;
+	return !0;
+}
+function O(e, t) {
+	let n = !1;
+	for (let r of t) P(e, r) & 1 && (n = !0);
+	return n;
+}
+function ce(e, t, n) {
+	let r = n.map((t) => e[t.id]), i = n.map((e) => e.type), a = r.filter((e) => !(e & 1)), o = e[t.id] >> 1;
+	function s(e) {
+		let n = [];
+		for (let t = 0; t < r.length; t++) {
+			let a = F(e, r[t]);
+			if (i[t] == 2) for (let e of a) n.push(e);
+			else n.push(a);
+		}
+		return t.combine(n);
+	}
+	return {
+		create(e) {
+			for (let t of r) P(e, t);
+			return e.values[o] = s(e), 1;
+		},
+		update(e, n) {
+			if (!O(e, a)) return 0;
+			let r = s(e);
+			return t.compare(r, e.values[o]) ? 0 : (e.values[o] = r, 1);
+		},
+		reconfigure(e, i) {
+			let a = O(e, r), c = i.config.facets[t.id], l = i.facet(t);
+			if (c && !a && oe(n, c)) return e.values[o] = l, 0;
+			let u = s(e);
+			return t.compare(u, l) ? (e.values[o] = l, 0) : (e.values[o] = u, 1);
+		}
+	};
+}
+var k = /* @__PURE__ */ E.define({ static: !0 }), A = class e {
+	constructor(e, t, n, r, i) {
+		this.id = e, this.createF = t, this.updateF = n, this.compareF = r, this.spec = i, this.provides = void 0;
+	}
+	static define(t) {
+		let n = new e(ae++, t.create, t.update, t.compare || ((e, t) => e === t), t);
+		return t.provide && (n.provides = t.provide(n)), n;
+	}
+	create(e) {
+		return (e.facet(k).find((e) => e.field == this)?.create || this.createF)(e);
+	}
+	slot(e) {
+		let t = e[this.id] >> 1;
+		return {
+			create: (e) => (e.values[t] = this.create(e), 1),
+			update: (e, n) => {
+				let r = e.values[t], i = this.updateF(r, n);
+				return this.compareF(r, i) ? 0 : (e.values[t] = i, 1);
+			},
+			reconfigure: (e, n) => {
+				let r = e.facet(k), i = n.facet(k), a;
+				return (a = r.find((e) => e.field == this)) && a != i.find((e) => e.field == this) ? (e.values[t] = a.create(e), 1) : n.config.address[this.id] == null ? (e.values[t] = this.create(e), 1) : (e.values[t] = n.field(this), 0);
+			}
+		};
+	}
+	init(e) {
+		return [this, k.of({
+			field: this,
+			create: e
+		})];
+	}
+	get extension() {
+		return this;
+	}
+}, j = {
+	lowest: 4,
+	low: 3,
+	default: 2,
+	high: 1,
+	highest: 0
+};
+function M(e) {
+	return (t) => new ue(t, e);
+}
+var le = {
+	highest: /* @__PURE__ */ M(j.highest),
+	high: /* @__PURE__ */ M(j.high),
+	default: /* @__PURE__ */ M(j.default),
+	low: /* @__PURE__ */ M(j.low),
+	lowest: /* @__PURE__ */ M(j.lowest)
+}, ue = class {
+	constructor(e, t) {
+		this.inner = e, this.prec = t;
+	}
+	get extension() {
+		return this;
+	}
+}, de = class e {
+	of(e) {
+		return new N(this, e);
+	}
+	reconfigure(t) {
+		return e.reconfigure.of({
+			compartment: this,
+			extension: t
+		});
+	}
+	get(e) {
+		return e.config.compartments.get(this);
+	}
+}, N = class {
+	constructor(e, t) {
+		this.compartment = e, this.inner = t;
+	}
+	get extension() {
+		return this;
+	}
+}, fe = class e {
+	constructor(e, t, n, r, i, a) {
+		for (this.base = e, this.compartments = t, this.dynamicSlots = n, this.address = r, this.staticValues = i, this.facets = a, this.statusTemplate = []; this.statusTemplate.length < n.length;) this.statusTemplate.push(0);
+	}
+	staticFacet(e) {
+		let t = this.address[e.id];
+		return t == null ? e.default : this.staticValues[t >> 1];
+	}
+	static resolve(t, n, r) {
+		let i = [], a = Object.create(null), o = /* @__PURE__ */ new Map();
+		for (let e of pe(t, n, o)) e instanceof A ? i.push(e) : (a[e.facet.id] || (a[e.facet.id] = [])).push(e);
+		let s = Object.create(null), c = [], l = [];
+		for (let e of i) s[e.id] = l.length << 1, l.push((t) => e.slot(t));
+		let u = r?.config.facets;
+		for (let e in a) {
+			let t = a[e], n = t[0].facet, i = u && u[e] || [];
+			if (t.every((e) => e.type == 0)) if (s[n.id] = c.length << 1 | 1, oe(i, t)) c.push(r.facet(n));
+			else {
+				let e = n.combine(t.map((e) => e.value));
+				c.push(r && n.compare(e, r.facet(n)) ? r.facet(n) : e);
+			}
+			else {
+				for (let e of t) e.type == 0 ? (s[e.id] = c.length << 1 | 1, c.push(e.value)) : (s[e.id] = l.length << 1, l.push((t) => e.dynamicSlot(t)));
+				s[n.id] = l.length << 1, l.push((e) => ce(e, n, t));
+			}
+		}
+		return new e(t, o, l.map((e) => e(s)), s, c, a);
+	}
+};
+function pe(e, t, n) {
+	let r = [
+		[],
+		[],
+		[],
+		[],
+		[]
+	], i = /* @__PURE__ */ new Map();
+	function a(e, o) {
+		let s = i.get(e);
+		if (s != null) {
+			if (s <= o) return;
+			let t = r[s].indexOf(e);
+			t > -1 && r[s].splice(t, 1), e instanceof N && n.delete(e.compartment);
+		}
+		if (i.set(e, o), Array.isArray(e)) for (let t of e) a(t, o);
+		else if (e instanceof N) {
+			if (n.has(e.compartment)) throw RangeError("Duplicate use of compartment in extensions");
+			let r = t.get(e.compartment) || e.inner;
+			n.set(e.compartment, r), a(r, o);
+		} else if (e instanceof ue) a(e.inner, e.prec);
+		else if (e instanceof A) r[o].push(e), e.provides && a(e.provides, o);
+		else if (e instanceof D) r[o].push(e), e.facet.extensions && a(e.facet.extensions, j.default);
+		else {
+			let t = e.extension;
+			if (!t) throw Error(`Unrecognized extension value in extension set (${e}).`);
+			if (t == e) throw Error(`Unrecognized extension value in extension set (${e}). This sometimes happens because multiple instances of @codemirror/state are loaded, breaking instanceof checks.`);
+			a(t, o);
+		}
+	}
+	return a(e, j.default), r.reduce((e, t) => e.concat(t));
+}
+function P(e, t) {
+	if (t & 1) return 2;
+	let n = t >> 1, r = e.status[n];
+	if (r == 4) throw Error("Cyclic dependency between fields and/or facets");
+	if (r & 2) return r;
+	e.status[n] = 4;
+	let i = e.computeSlot(e, e.config.dynamicSlots[n]);
+	return e.status[n] = 2 | i;
+}
+function F(e, t) {
+	return t & 1 ? e.config.staticValues[t >> 1] : e.values[t >> 1];
+}
+var me = /* @__PURE__ */ E.define(), I = /* @__PURE__ */ E.define({
+	combine: (e) => e.some((e) => e),
+	static: !0
+}), he = /* @__PURE__ */ E.define({
+	combine: (e) => e.length ? e[0] : void 0,
+	static: !0
+}), ge = /* @__PURE__ */ E.define(), _e = /* @__PURE__ */ E.define(), ve = /* @__PURE__ */ E.define(), ye = /* @__PURE__ */ E.define({ combine: (e) => e.length ? e[0] : !1 }), L = class {
+	constructor(e, t) {
+		this.type = e, this.value = t;
+	}
+	static define() {
+		return new be();
+	}
+}, be = class {
+	of(e) {
+		return new L(this, e);
+	}
+}, xe = class {
+	constructor(e) {
+		this.map = e;
+	}
+	of(e) {
+		return new R(this, e);
+	}
+}, R = class e {
+	constructor(e, t) {
+		this.type = e, this.value = t;
+	}
+	map(t) {
+		let n = this.type.map(this.value, t);
+		return n === void 0 ? void 0 : n == this.value ? this : new e(this.type, n);
+	}
+	is(e) {
+		return this.type == e;
+	}
+	static define(e = {}) {
+		return new xe(e.map || ((e) => e));
+	}
+	static mapEffects(e, t) {
+		if (!e.length) return e;
+		let n = [];
+		for (let r of e) {
+			let e = r.map(t);
+			e && n.push(e);
+		}
+		return n;
+	}
+};
+R.reconfigure = /* @__PURE__ */ R.define(), R.appendConfig = /* @__PURE__ */ R.define();
+var z = class e {
+	constructor(t, n, r, i, a, o) {
+		this.startState = t, this.changes = n, this.selection = r, this.effects = i, this.annotations = a, this.scrollIntoView = o, this._doc = null, this._state = null, r && ie(r, n.newLength), a.some((t) => t.type == e.time) || (this.annotations = a.concat(e.time.of(Date.now())));
+	}
+	static create(t, n, r, i, a, o) {
+		return new e(t, n, r, i, a, o);
+	}
+	get newDoc() {
+		return this._doc ||= this.changes.apply(this.startState.doc);
+	}
+	get newSelection() {
+		return this.selection || this.startState.selection.map(this.changes);
+	}
+	get state() {
+		return this._state || this.startState.applyTransaction(this), this._state;
+	}
+	annotation(e) {
+		for (let t of this.annotations) if (t.type == e) return t.value;
+	}
+	get docChanged() {
+		return !this.changes.empty;
+	}
+	get reconfigured() {
+		return this.startState.config != this.state.config;
+	}
+	isUserEvent(t) {
+		let n = this.annotation(e.userEvent);
+		return !!(n && (n == t || n.length > t.length && n.slice(0, t.length) == t && n[t.length] == "."));
+	}
+};
+z.time = /* @__PURE__ */ L.define(), z.userEvent = /* @__PURE__ */ L.define(), z.addToHistory = /* @__PURE__ */ L.define(), z.remote = /* @__PURE__ */ L.define();
+function Se(e, t) {
+	let n = [];
+	for (let r = 0, i = 0;;) {
+		let a, o;
+		if (r < e.length && (i == t.length || t[i] >= e[r])) a = e[r++], o = e[r++];
+		else if (i < t.length) a = t[i++], o = t[i++];
+		else return n;
+		!n.length || n[n.length - 1] < a ? n.push(a, o) : n[n.length - 1] < o && (n[n.length - 1] = o);
+	}
+}
+function Ce(e, t, n) {
+	let r, i, a;
+	return n ? (r = t.changes, i = v.empty(t.changes.length), a = e.changes.compose(t.changes)) : (r = t.changes.map(e.changes), i = e.changes.mapDesc(t.changes, !0), a = e.changes.compose(r)), {
+		changes: a,
+		selection: t.selection ? t.selection.map(i) : e.selection?.map(r),
+		effects: R.mapEffects(e.effects, r).concat(R.mapEffects(t.effects, i)),
+		annotations: e.annotations.length ? e.annotations.concat(t.annotations) : t.annotations,
+		scrollIntoView: e.scrollIntoView || t.scrollIntoView
+	};
+}
+function we(e, t, n) {
+	let r = t.selection, i = B(t.annotations);
+	return t.userEvent && (i = i.concat(z.userEvent.of(t.userEvent))), {
+		changes: t.changes instanceof v ? t.changes : v.of(t.changes || [], n, e.facet(he)),
+		selection: r && (r instanceof T ? r : T.single(r.anchor, r.head)),
+		effects: B(t.effects),
+		annotations: i,
+		scrollIntoView: !!t.scrollIntoView
+	};
+}
+function Te(e, t, n) {
+	let r = we(e, t.length ? t[0] : {}, e.doc.length);
+	t.length && t[0].filter === !1 && (n = !1);
+	for (let i = 1; i < t.length; i++) {
+		t[i].filter === !1 && (n = !1);
+		let a = !!t[i].sequential;
+		r = Ce(r, we(e, t[i], a ? r.changes.newLength : e.doc.length), a);
+	}
+	let i = z.create(e, r.changes, r.selection, r.effects, r.annotations, r.scrollIntoView);
+	return De(n ? Ee(i) : i);
+}
+function Ee(e) {
+	let t = e.startState, n = !0;
+	for (let r of t.facet(ge)) {
+		let t = r(e);
+		if (t === !1) {
+			n = !1;
+			break;
+		}
+		Array.isArray(t) && (n = n === !0 ? t : Se(n, t));
+	}
+	if (n !== !0) {
+		let r, i;
+		if (n === !1) i = e.changes.invertedDesc, r = v.empty(t.doc.length);
+		else {
+			let t = e.changes.filter(n);
+			r = t.changes, i = t.filtered.mapDesc(t.changes).invertedDesc;
+		}
+		e = z.create(t, r, e.selection && e.selection.map(i), R.mapEffects(e.effects, i), e.annotations, e.scrollIntoView);
+	}
+	let r = t.facet(_e);
+	for (let n = r.length - 1; n >= 0; n--) {
+		let i = r[n](e);
+		e = i instanceof z ? i : Array.isArray(i) && i.length == 1 && i[0] instanceof z ? i[0] : Te(t, B(i), !1);
+	}
+	return e;
+}
+function De(e) {
+	let t = e.startState, n = t.facet(ve), r = e;
+	for (let i = n.length - 1; i >= 0; i--) {
+		let a = n[i](e);
+		a && Object.keys(a).length && (r = Ce(r, we(t, a, e.changes.newLength), !0));
+	}
+	return r == e ? e : z.create(t, e.changes, e.selection, r.effects, r.annotations, r.scrollIntoView);
+}
+var Oe = [];
+function B(e) {
+	return e == null ? Oe : Array.isArray(e) ? e : [e];
+}
+var V = /* @__PURE__ */ (function(e) {
+	return e[e.Word = 0] = "Word", e[e.Space = 1] = "Space", e[e.Other = 2] = "Other", e;
+})(V ||= {}), ke = /[\u00df\u0587\u0590-\u05f4\u0600-\u06ff\u3040-\u309f\u30a0-\u30ff\u3400-\u4db5\u4e00-\u9fcc\uac00-\ud7af]/, H;
+try {
+	H = /* @__PURE__ */ RegExp("[\\p{Alphabetic}\\p{Number}_]", "u");
+} catch {}
+function Ae(e) {
+	if (H) return H.test(e);
+	for (let t = 0; t < e.length; t++) {
+		let n = e[t];
+		if (/\w/.test(n) || n > "€" && (n.toUpperCase() != n.toLowerCase() || ke.test(n))) return !0;
+	}
+	return !1;
+}
+function je(e) {
+	return (t) => {
+		if (!/\S/.test(t)) return V.Space;
+		if (Ae(t)) return V.Word;
+		for (let n = 0; n < e.length; n++) if (t.indexOf(e[n]) > -1) return V.Word;
+		return V.Other;
+	};
+}
+var U = class e {
+	constructor(e, t, n, r, i, a) {
+		this.config = e, this.doc = t, this.selection = n, this.values = r, this.status = e.statusTemplate.slice(), this.computeSlot = i, a && (a._state = this);
+		for (let e = 0; e < this.config.dynamicSlots.length; e++) P(this, e << 1);
+		this.computeSlot = null;
+	}
+	field(e, t = !0) {
+		let n = this.config.address[e.id];
+		if (n == null) {
+			if (t) throw RangeError("Field is not present in this state");
+			return;
+		}
+		return P(this, n), F(this, n);
+	}
+	update(...e) {
+		return Te(this, e, !0);
+	}
+	applyTransaction(t) {
+		let n = this.config, { base: r, compartments: i } = n;
+		for (let e of t.effects) e.is(de.reconfigure) ? (n &&= (i = /* @__PURE__ */ new Map(), n.compartments.forEach((e, t) => i.set(t, e)), null), i.set(e.value.compartment, e.value.extension)) : e.is(R.reconfigure) ? (n = null, r = e.value) : e.is(R.appendConfig) && (n = null, r = B(r).concat(e.value));
+		let a;
+		n ? a = t.startState.values.slice() : (n = fe.resolve(r, i, this), a = new e(n, this.doc, this.selection, n.dynamicSlots.map(() => null), (e, t) => t.reconfigure(e, this), null).values);
+		let o = t.startState.facet(I) ? t.newSelection : t.newSelection.asSingle();
+		new e(n, t.newDoc, o, a, (e, n) => n.update(e, t), t);
+	}
+	replaceSelection(e) {
+		return typeof e == "string" && (e = this.toText(e)), this.changeByRange((t) => ({
+			changes: {
+				from: t.from,
+				to: t.to,
+				insert: e
+			},
+			range: T.cursor(t.from + e.length, -1)
+		}));
+	}
+	changeByRange(e) {
+		let t = this.selection, n = e(t.ranges[0]), r = this.changes(n.changes), i = [n.range], a = B(n.effects);
+		for (let n = 1; n < t.ranges.length; n++) {
+			let o = e(t.ranges[n]), s = this.changes(o.changes), c = s.map(r);
+			for (let e = 0; e < n; e++) i[e] = i[e].map(c);
+			let l = r.mapDesc(s, !0);
+			i.push(o.range.map(l)), r = r.compose(c), a = R.mapEffects(a, c).concat(R.mapEffects(B(o.effects), l));
+		}
+		return {
+			changes: r,
+			selection: T.create(i, t.mainIndex),
+			effects: a
+		};
+	}
+	changes(t = []) {
+		return t instanceof v ? t : v.of(t, this.doc.length, this.facet(e.lineSeparator));
+	}
+	toText(n) {
+		return t.of(n.split(this.facet(e.lineSeparator) || ne));
+	}
+	sliceDoc(e = 0, t = this.doc.length) {
+		return this.doc.sliceString(e, t, this.lineBreak);
+	}
+	facet(e) {
+		let t = this.config.address[e.id];
+		return t == null ? e.default : (P(this, t), F(this, t));
+	}
+	toJSON(e) {
+		let t = {
+			doc: this.sliceDoc(),
+			selection: this.selection.toJSON()
+		};
+		if (e) for (let n in e) {
+			let r = e[n];
+			r instanceof A && this.config.address[r.id] != null && (t[n] = r.spec.toJSON(this.field(e[n]), this));
+		}
+		return t;
+	}
+	static fromJSON(t, n = {}, r) {
+		if (!t || typeof t.doc != "string") throw RangeError("Invalid JSON representation for EditorState");
+		let i = [];
+		if (r) {
+			for (let e in r) if (Object.prototype.hasOwnProperty.call(t, e)) {
+				let n = r[e], a = t[e];
+				i.push(n.init((e) => n.spec.fromJSON(a, e)));
+			}
+		}
+		return e.create({
+			doc: t.doc,
+			selection: T.fromJSON(t.selection),
+			extensions: n.extensions ? i.concat([n.extensions]) : i
+		});
+	}
+	static create(n = {}) {
+		let r = fe.resolve(n.extensions || [], /* @__PURE__ */ new Map()), i = n.doc instanceof t ? n.doc : t.of((n.doc || "").split(r.staticFacet(e.lineSeparator) || ne)), a = n.selection ? n.selection instanceof T ? n.selection : T.single(n.selection.anchor, n.selection.head) : T.single(0);
+		return ie(a, i.length), r.staticFacet(I) || (a = a.asSingle()), new e(r, i, a, r.dynamicSlots.map(() => null), (e, t) => t.create(e), null);
+	}
+	get tabSize() {
+		return this.facet(e.tabSize);
+	}
+	get lineBreak() {
+		return this.facet(e.lineSeparator) || "\n";
+	}
+	get readOnly() {
+		return this.facet(ye);
+	}
+	phrase(t, ...n) {
+		for (let n of this.facet(e.phrases)) if (Object.prototype.hasOwnProperty.call(n, t)) {
+			t = n[t];
+			break;
+		}
+		return n.length && (t = t.replace(/\$(\$|\d*)/g, (e, t) => {
+			if (t == "$") return "$";
+			let r = +(t || 1);
+			return !r || r > n.length ? e : n[r - 1];
+		})), t;
+	}
+	languageDataAt(e, t, n = -1) {
+		let r = [];
+		for (let i of this.facet(me)) for (let a of i(this, t, n)) Object.prototype.hasOwnProperty.call(a, e) && r.push(a[e]);
+		return r;
+	}
+	charCategorizer(e) {
+		let t = this.languageDataAt("wordChars", e);
+		return je(t.length ? t[0] : "");
+	}
+	wordAt(e) {
+		let { text: t, from: n, length: r } = this.doc.lineAt(e), i = this.charCategorizer(e), a = e - n, o = e - n;
+		for (; a > 0;) {
+			let e = f(t, a, !1);
+			if (i(t.slice(e, a)) != V.Word) break;
+			a = e;
+		}
+		for (; o < r;) {
+			let e = f(t, o);
+			if (i(t.slice(o, e)) != V.Word) break;
+			o = e;
+		}
+		return a == o ? null : T.range(a + n, o + n);
+	}
+};
+U.allowMultipleSelections = I, U.tabSize = /* @__PURE__ */ E.define({ combine: (e) => e.length ? e[0] : 4 }), U.lineSeparator = he, U.readOnly = ye, U.phrases = /* @__PURE__ */ E.define({ compare(e, t) {
+	let n = Object.keys(e), r = Object.keys(t);
+	return n.length == r.length && n.every((n) => e[n] == t[n]);
+} }), U.languageData = me, U.changeFilter = ge, U.transactionFilter = _e, U.transactionExtender = ve, de.reconfigure = /* @__PURE__ */ R.define();
+function Me(e, t, n = {}) {
+	let r = {};
+	for (let t of e) for (let e of Object.keys(t)) {
+		let i = t[e], a = r[e];
+		if (a === void 0) r[e] = i;
+		else if (!(a === i || i === void 0)) if (Object.hasOwnProperty.call(n, e)) r[e] = n[e](a, i);
+		else throw Error("Config merge conflict for field " + e);
+	}
+	for (let e in t) r[e] === void 0 && (r[e] = t[e]);
+	return r;
+}
+var W = class {
+	eq(e) {
+		return this == e;
+	}
+	range(e, t = e) {
+		return K.create(e, t, this);
+	}
+};
+W.prototype.startSide = W.prototype.endSide = 0, W.prototype.point = !1, W.prototype.mapMode = g.TrackDel;
+function G(e, t) {
+	return e == t || e.constructor == t.constructor && e.eq(t);
+}
+var K = class e {
+	constructor(e, t, n) {
+		this.from = e, this.to = t, this.value = n;
+	}
+	static create(t, n, r) {
+		return new e(t, n, r);
+	}
+};
+function q(e, t) {
+	return e.from - t.from || e.value.startSide - t.value.startSide;
+}
+var Ne = class e {
+	constructor(e, t, n, r) {
+		this.from = e, this.to = t, this.value = n, this.maxPoint = r;
+	}
+	get length() {
+		return Y(this.to);
+	}
+	findIndex(e, t, n, r = 0) {
+		let i = n ? this.to : this.from;
+		for (let a = r, o = i.length;;) {
+			if (a == o) return a;
+			let r = a + o >> 1, s = i[r] - e || (n ? this.value[r].endSide : this.value[r].startSide) - t;
+			if (r == a) return s >= 0 ? a : o;
+			s >= 0 ? o = r : a = r + 1;
+		}
+	}
+	between(e, t, n, r) {
+		for (let i = this.findIndex(t, -1e9, !0), a = this.findIndex(n, 1e9, !1, i); i < a; i++) if (r(this.from[i] + e, this.to[i] + e, this.value[i]) === !1) return !1;
+	}
+	map(t, n, r, i, a) {
+		let o = [], s = [], c = [], l = -1, u = -1;
+		iter: for (let e = 0; e < this.value.length; e++) {
+			let d = this.value[e], f = this.from[e] + t, p = this.to[e] + t, m, h;
+			if (f == p) {
+				let e = n.mapPos(f, d.startSide, d.mapMode);
+				if (e == null || (m = h = e, d.startSide != d.endSide && (h = n.mapPos(f, d.endSide), h < m))) continue;
+			} else if (m = n.mapPos(f, d.startSide), h = n.mapPos(p, d.endSide), m > h || m == h && d.startSide > 0 && d.endSide <= 0) continue;
+			if (!((h - m || d.endSide - d.startSide) < 0)) if (l < 0 && (l = m), d.point && (u = Math.max(u, h - m)), (m - r || d.startSide - i) >= 0) o.push(d), s.push(m - l), c.push(h - l), r = h, i = d.endSide;
+			else {
+				if (m == h) for (let e = o.length; e > 0; e--) {
+					if ((m - (c[e - 1] + l) || d.startSide - o[e - 1].endSide) >= 0) {
+						o.splice(e, 0, d), s.splice(e, 0, m - l), c.splice(e, 0, h - l);
+						continue iter;
+					}
+					if ((m - (s[e - 1] + l) || d.endSide - o[e - 1].startSide) > 0) break;
+				}
+				a(m, h, d);
+			}
+		}
+		return {
+			mapped: o.length ? new e(s, c, o, u) : null,
+			pos: l
+		};
+	}
+}, J = class e {
+	constructor(e, t, n, r) {
+		this.chunkPos = e, this.chunk = t, this.nextLayer = n, this.maxPoint = r;
+	}
+	static create(t, n, r, i) {
+		return new e(t, n, r, i);
+	}
+	get length() {
+		let e = this.chunk.length - 1;
+		return e < 0 ? 0 : Math.max(this.chunkEnd(e), this.nextLayer.length);
+	}
+	get size() {
+		if (this.isEmpty) return 0;
+		let e = this.nextLayer.size;
+		for (let t of this.chunk) e += t.value.length;
+		return e;
+	}
+	chunkEnd(e) {
+		return this.chunkPos[e] + this.chunk[e].length;
+	}
+	update(t) {
+		let { add: n = [], sort: r = !1, filterFrom: i = 0, filterTo: a = this.length } = t, o = t.filter;
+		if (n.length == 0 && !o) return this;
+		if (r && (n = n.slice().sort(q)), this.isEmpty) return n.length ? e.of(n) : this;
+		let s = new Ie(this, null, -1).goto(0), c = 0, l = [], u = new X();
+		for (; s.value || c < n.length;) if (c < n.length && (s.from - n[c].from || s.startSide - n[c].value.startSide) >= 0) {
+			let e = n[c++];
+			u.addInner(e.from, e.to, e.value, !1) || l.push(e);
+		} else s.rangeIndex == 1 && s.chunkIndex < this.chunk.length && (c == n.length || this.chunkEnd(s.chunkIndex) < n[c].from) && (!o || i > this.chunkEnd(s.chunkIndex) || a < this.chunkPos[s.chunkIndex]) && u.addChunk(this.chunkPos[s.chunkIndex], this.chunk[s.chunkIndex]) ? s.nextChunk() : ((!o || i > s.to || a < s.from || o(s.from, s.to, s.value)) && (u.addInner(s.from, s.to, s.value, !1) || l.push(K.create(s.from, s.to, s.value))), s.next());
+		return u.finishInner(this.nextLayer.isEmpty && !l.length ? e.empty : this.nextLayer.update({
+			add: l,
+			filter: o,
+			filterFrom: i,
+			filterTo: a
+		}));
+	}
+	map(t) {
+		if (t.empty || this.isEmpty) return this;
+		let n = [], r = [], i = -1, a, o = (e, t, n) => {
+			a ||= new X(), a.addRange(e, t, n, !1);
+		};
+		for (let e = 0; e < this.chunk.length; e++) {
+			let a = this.chunkPos[e], s = this.chunk[e], c = t.touchesRange(a, a + s.length);
+			if (c === !1) i = Math.max(i, s.maxPoint), n.push(s), r.push(t.mapPos(a));
+			else if (c === !0) {
+				let [e, c] = n.length ? [Y(r) + Y(n).length, Y(Y(n).value).endSide] : [-1, -1], { mapped: l, pos: u } = s.map(a, t, e, c, o);
+				l && (i = Math.max(i, l.maxPoint), n.push(l), r.push(u));
+			}
+		}
+		let s = this.nextLayer.map(t);
+		return a && (s = a.finishInner(s)), n.length == 0 ? s : new e(r, n, s || e.empty, i);
+	}
+	between(e, t, n) {
+		if (!this.isEmpty) {
+			for (let r = 0; r < this.chunk.length; r++) {
+				let i = this.chunkPos[r], a = this.chunk[r];
+				if (t >= i && e <= i + a.length && a.between(i, e - i, t - i, n) === !1) return;
+			}
+			this.nextLayer.between(e, t, n);
+		}
+	}
+	iter(e = 0) {
+		return Le.from([this]).goto(e);
+	}
+	get isEmpty() {
+		return this.nextLayer == this;
+	}
+	static iter(e, t = 0) {
+		return Le.from(e).goto(t);
+	}
+	static compare(e, t, n, r, i = -1) {
+		let a = e.filter((e) => e.maxPoint > 0 || !e.isEmpty && e.maxPoint >= i), o = t.filter((e) => e.maxPoint > 0 || !e.isEmpty && e.maxPoint >= i), s = Fe(a, o, n), c = new Z(a, s, i), l = new Z(o, s, i);
+		n.iterGaps((e, t, n) => ze(c, e, l, t, n, r)), n.empty && n.length == 0 && ze(c, 0, l, 0, 0, r);
+	}
+	static eq(e, t, n = 0, r) {
+		r ??= 999999999;
+		let i = e.filter((e) => !e.isEmpty && t.indexOf(e) < 0), a = t.filter((t) => !t.isEmpty && e.indexOf(t) < 0);
+		if (i.length != a.length) return !1;
+		if (!i.length) return !0;
+		let o = Fe(i, a), s = new Z(i, o, 0).goto(n), c = new Z(a, o, 0).goto(n);
+		for (;;) {
+			if (s.to != c.to || !Be(s.active, c.active) || s.point && (!c.point || !G(s.point, c.point))) return !1;
+			if (s.to > r) return !0;
+			s.next(), c.next();
+		}
+	}
+	static spans(e, t, n, r, i = -1) {
+		let a = new Z(e, null, i).goto(t), o = t, s = a.openStart;
+		for (;;) {
+			let e = Math.min(a.to, n);
+			if (a.point) {
+				let n = a.activeForPoint(a.to), i = a.pointFrom < t ? n.length + 1 : a.point.startSide < 0 ? n.length : Math.min(n.length, s);
+				r.point(o, e, a.point, n, i, a.pointRank), s = Math.min(a.openEnd(e), n.length);
+			} else e > o && (r.span(o, e, a.active, s), s = a.openEnd(e));
+			if (a.to > n) return s + (a.point && a.to > n ? 1 : 0);
+			o = a.to, a.next();
+		}
+	}
+	static of(e, t = !1) {
+		let n = new X();
+		for (let r of e instanceof K ? [e] : t ? Pe(e) : e) n.add(r.from, r.to, r.value);
+		return n.finish();
+	}
+	static join(t) {
+		if (!t.length) return e.empty;
+		let n = Y(t);
+		for (let r = t.length - 2; r >= 0; r--) for (let i = t[r]; i != e.empty; i = i.nextLayer) n = new e(i.chunkPos, i.chunk, n, Math.max(i.maxPoint, n.maxPoint));
+		return n;
+	}
+};
+J.empty = /* @__PURE__ */ new J([], [], null, -1);
+function Y(e) {
+	return e[e.length - 1];
+}
+function Pe(e) {
+	if (e.length > 1) for (let t = e[0], n = 1; n < e.length; n++) {
+		let r = e[n];
+		if (q(t, r) > 0) return e.slice().sort(q);
+		t = r;
+	}
+	return e;
+}
+J.empty.nextLayer = J.empty;
+var X = class e {
+	finishChunk(e) {
+		this.chunks.push(new Ne(this.from, this.to, this.value, this.maxPoint)), this.chunkPos.push(this.chunkStart), this.chunkStart = -1, this.setMaxPoint = Math.max(this.setMaxPoint, this.maxPoint), this.maxPoint = -1, e && (this.from = [], this.to = [], this.value = []);
+	}
+	constructor() {
+		this.chunks = [], this.chunkPos = [], this.chunkStart = -1, this.last = null, this.lastFrom = -1e9, this.lastTo = -1e9, this.from = [], this.to = [], this.value = [], this.maxPoint = -1, this.setMaxPoint = -1, this.nextLayer = null;
+	}
+	add(e, t, n) {
+		this.addRange(e, t, n, !0);
+	}
+	addRange(t, n, r, i) {
+		this.addInner(t, n, r, i) || (this.nextLayer ||= new e()).addRange(t, n, r, i);
+	}
+	addInner(e, t, n, r) {
+		let i = e - this.lastTo || n.startSide - this.last.endSide;
+		if (r && i <= 0 && (e - this.lastFrom || n.startSide - this.last.startSide) < 0) throw Error("Ranges must be added sorted by `from` position and `startSide`");
+		return i < 0 ? !1 : (this.from.length == 250 && this.finishChunk(!0), this.chunkStart < 0 && (this.chunkStart = e), this.from.push(e - this.chunkStart), this.to.push(t - this.chunkStart), this.last = n, this.lastFrom = e, this.lastTo = t, this.value.push(n), n.point && (this.maxPoint = Math.max(this.maxPoint, t - e)), !0);
+	}
+	addChunk(e, t) {
+		if ((e - this.lastTo || t.value[0].startSide - this.last.endSide) < 0) return !1;
+		this.from.length && this.finishChunk(!0), this.setMaxPoint = Math.max(this.setMaxPoint, t.maxPoint), this.chunks.push(t), this.chunkPos.push(e);
+		let n = t.value.length - 1;
+		return this.last = t.value[n], this.lastFrom = t.from[n] + e, this.lastTo = t.to[n] + e, !0;
+	}
+	finish() {
+		return this.finishInner(J.empty);
+	}
+	finishInner(e) {
+		if (this.from.length && this.finishChunk(!1), this.chunks.length == 0) return e;
+		let t = J.create(this.chunkPos, this.chunks, this.nextLayer ? this.nextLayer.finishInner(e) : e, this.setMaxPoint);
+		return this.from = null, t;
+	}
+};
+function Fe(e, t, n) {
+	let r = /* @__PURE__ */ new Map();
+	for (let t of e) for (let e = 0; e < t.chunk.length; e++) t.chunk[e].maxPoint <= 0 && r.set(t.chunk[e], t.chunkPos[e]);
+	let i = /* @__PURE__ */ new Set();
+	for (let e of t) for (let t = 0; t < e.chunk.length; t++) {
+		let a = r.get(e.chunk[t]);
+		a != null && (n ? n.mapPos(a) : a) == e.chunkPos[t] && !n?.touchesRange(a, a + e.chunk[t].length) && i.add(e.chunk[t]);
+	}
+	return i;
+}
+var Ie = class {
+	constructor(e, t, n, r = 0) {
+		this.layer = e, this.skip = t, this.minPoint = n, this.rank = r;
+	}
+	get startSide() {
+		return this.value ? this.value.startSide : 0;
+	}
+	get endSide() {
+		return this.value ? this.value.endSide : 0;
+	}
+	goto(e, t = -1e9) {
+		return this.chunkIndex = this.rangeIndex = 0, this.gotoInner(e, t, !1), this;
+	}
+	gotoInner(e, t, n) {
+		for (; this.chunkIndex < this.layer.chunk.length;) {
+			let t = this.layer.chunk[this.chunkIndex];
+			if (!(this.skip && this.skip.has(t) || this.layer.chunkEnd(this.chunkIndex) < e || t.maxPoint < this.minPoint)) break;
+			this.chunkIndex++, n = !1;
+		}
+		if (this.chunkIndex < this.layer.chunk.length) {
+			let r = this.layer.chunk[this.chunkIndex].findIndex(e - this.layer.chunkPos[this.chunkIndex], t, !0);
+			(!n || this.rangeIndex < r) && this.setRangeIndex(r);
+		}
+		this.next();
+	}
+	forward(e, t) {
+		(this.to - e || this.endSide - t) < 0 && this.gotoInner(e, t, !0);
+	}
+	next() {
+		for (;;) if (this.chunkIndex == this.layer.chunk.length) {
+			this.from = this.to = 1e9, this.value = null;
+			break;
+		} else {
+			let e = this.layer.chunkPos[this.chunkIndex], t = this.layer.chunk[this.chunkIndex];
+			if (this.from = e + t.from[this.rangeIndex], this.to = e + t.to[this.rangeIndex], this.value = t.value[this.rangeIndex], this.setRangeIndex(this.rangeIndex + 1), this.minPoint < 0 || this.value.point && this.to - this.from >= this.minPoint) break;
+		}
+	}
+	setRangeIndex(e) {
+		if (e == this.layer.chunk[this.chunkIndex].value.length) {
+			if (this.chunkIndex++, this.skip) for (; this.chunkIndex < this.layer.chunk.length && this.skip.has(this.layer.chunk[this.chunkIndex]);) this.chunkIndex++;
+			this.rangeIndex = 0;
+		} else this.rangeIndex = e;
+	}
+	nextChunk() {
+		this.chunkIndex++, this.rangeIndex = 0, this.next();
+	}
+	compare(e) {
+		return this.from - e.from || this.startSide - e.startSide || this.rank - e.rank || this.to - e.to || this.endSide - e.endSide;
+	}
+}, Le = class e {
+	constructor(e) {
+		this.heap = e;
+	}
+	static from(t, n = null, r = -1) {
+		let i = [];
+		for (let e = 0; e < t.length; e++) for (let a = t[e]; !a.isEmpty; a = a.nextLayer) a.maxPoint >= r && i.push(new Ie(a, n, r, e));
+		return i.length == 1 ? i[0] : new e(i);
+	}
+	get startSide() {
+		return this.value ? this.value.startSide : 0;
+	}
+	goto(e, t = -1e9) {
+		for (let n of this.heap) n.goto(e, t);
+		for (let e = this.heap.length >> 1; e >= 0; e--) Re(this.heap, e);
+		return this.next(), this;
+	}
+	forward(e, t) {
+		for (let n of this.heap) n.forward(e, t);
+		for (let e = this.heap.length >> 1; e >= 0; e--) Re(this.heap, e);
+		(this.to - e || this.value.endSide - t) < 0 && this.next();
+	}
+	next() {
+		if (this.heap.length == 0) this.from = this.to = 1e9, this.value = null, this.rank = -1;
+		else {
+			let e = this.heap[0];
+			this.from = e.from, this.to = e.to, this.value = e.value, this.rank = e.rank, e.value && e.next(), Re(this.heap, 0);
+		}
+	}
+};
+function Re(e, t) {
+	for (let n = e[t];;) {
+		let r = (t << 1) + 1;
+		if (r >= e.length) break;
+		let i = e[r];
+		if (r + 1 < e.length && i.compare(e[r + 1]) >= 0 && (i = e[r + 1], r++), n.compare(i) < 0) break;
+		e[r] = n, e[t] = i, t = r;
+	}
+}
+var Z = class {
+	constructor(e, t, n) {
+		this.minPoint = n, this.active = [], this.activeTo = [], this.activeRank = [], this.minActive = -1, this.point = null, this.pointFrom = 0, this.pointRank = 0, this.to = -1e9, this.endSide = 0, this.openStart = -1, this.cursor = Le.from(e, t, n);
+	}
+	goto(e, t = -1e9) {
+		return this.cursor.goto(e, t), this.active.length = this.activeTo.length = this.activeRank.length = 0, this.minActive = -1, this.to = e, this.endSide = t, this.openStart = -1, this.next(), this;
+	}
+	forward(e, t) {
+		for (; this.minActive > -1 && (this.activeTo[this.minActive] - e || this.active[this.minActive].endSide - t) < 0;) this.removeActive(this.minActive);
+		this.cursor.forward(e, t);
+	}
+	removeActive(e) {
+		Q(this.active, e), Q(this.activeTo, e), Q(this.activeRank, e), this.minActive = Ve(this.active, this.activeTo);
+	}
+	addActive(e) {
+		let t = 0, { value: n, to: r, rank: i } = this.cursor;
+		for (; t < this.activeRank.length && (i - this.activeRank[t] || r - this.activeTo[t]) > 0;) t++;
+		$(this.active, t, n), $(this.activeTo, t, r), $(this.activeRank, t, i), e && $(e, t, this.cursor.from), this.minActive = Ve(this.active, this.activeTo);
+	}
+	next() {
+		let e = this.to, t = this.point;
+		this.point = null;
+		let n = this.openStart < 0 ? [] : null;
+		for (;;) {
+			let r = this.minActive;
+			if (r > -1 && (this.activeTo[r] - this.cursor.from || this.active[r].endSide - this.cursor.startSide) < 0) {
+				if (this.activeTo[r] > e) {
+					this.to = this.activeTo[r], this.endSide = this.active[r].endSide;
+					break;
+				}
+				this.removeActive(r), n && Q(n, r);
+			} else if (!this.cursor.value) {
+				this.to = this.endSide = 1e9;
+				break;
+			} else if (this.cursor.from > e) {
+				this.to = this.cursor.from, this.endSide = this.cursor.startSide;
+				break;
+			} else {
+				let e = this.cursor.value;
+				if (!e.point) this.addActive(n), this.cursor.next();
+				else if (t && this.cursor.to == this.to && this.cursor.from < this.cursor.to) this.cursor.next();
+				else {
+					this.point = e, this.pointFrom = this.cursor.from, this.pointRank = this.cursor.rank, this.to = this.cursor.to, this.endSide = e.endSide, this.cursor.next(), this.forward(this.to, this.endSide);
+					break;
+				}
+			}
+		}
+		if (n) {
+			this.openStart = 0;
+			for (let t = n.length - 1; t >= 0 && n[t] < e; t--) this.openStart++;
+		}
+	}
+	activeForPoint(e) {
+		if (!this.active.length) return this.active;
+		let t = [];
+		for (let n = this.active.length - 1; n >= 0 && !(this.activeRank[n] < this.pointRank); n--) (this.activeTo[n] > e || this.activeTo[n] == e && this.active[n].endSide >= this.point.endSide) && t.push(this.active[n]);
+		return t.reverse();
+	}
+	openEnd(e) {
+		let t = 0;
+		for (let n = this.activeTo.length - 1; n >= 0 && this.activeTo[n] > e; n--) t++;
+		return t;
+	}
+};
+function ze(e, t, n, r, i, a) {
+	e.goto(t), n.goto(r);
+	let o = r + i, s = r, c = r - t, l = !!a.boundChange;
+	for (let t = !1;;) {
+		let r = e.to + c - n.to, i = r || e.endSide - n.endSide, u = i < 0 ? e.to + c : n.to, d = Math.min(u, o);
+		if (e.point || n.point ? (e.point && n.point && G(e.point, n.point) && Be(e.activeForPoint(e.to), n.activeForPoint(n.to)) || a.comparePoint(s, d, e.point, n.point), t = !1) : (t &&= (a.boundChange(s), !1), d > s && !Be(e.active, n.active) && a.compareRange(s, d, e.active, n.active), l && d < o && (r || e.openEnd(u) != n.openEnd(u)) && (t = !0)), u > o) break;
+		s = u, i <= 0 && e.next(), i >= 0 && n.next();
+	}
+}
+function Be(e, t) {
+	if (e.length != t.length) return !1;
+	for (let n = 0; n < e.length; n++) if (e[n] != t[n] && !G(e[n], t[n])) return !1;
+	return !0;
+}
+function Q(e, t) {
+	for (let n = t, r = e.length - 1; n < r; n++) e[n] = e[n + 1];
+	e.pop();
+}
+function $(e, t, n) {
+	for (let n = e.length - 1; n >= t; n--) e[n + 1] = e[n];
+	e[t] = n;
+}
+function Ve(e, t) {
+	let n = -1, r = 1e9;
+	for (let i = 0; i < t.length; i++) (t[i] - r || e[i].endSide - e[n].endSide) < 0 && (n = i, r = t[i]);
+	return n;
+}
+function He(e, t, n = e.length) {
+	let r = 0;
+	for (let i = 0; i < n && i < e.length;) e.charCodeAt(i) == 9 ? (r += t - r % t, i++) : (r++, i = f(e, i));
+	return r;
+}
+function Ue(e, t, n, r) {
+	for (let r = 0, i = 0;;) {
+		if (i >= t) return r;
+		if (r == e.length) break;
+		i += e.charCodeAt(r) == 9 ? n - i % n : 1, r = f(e, r);
+	}
+	return r === !0 ? -1 : e.length;
+}
+//#endregion
+export { L as Annotation, _ as ChangeDesc, v as ChangeSet, V as CharCategory, de as Compartment, T as EditorSelection, U as EditorState, E as Facet, g as MapMode, le as Prec, J as RangeSet, X as RangeSetBuilder, W as RangeValue, R as StateEffect, A as StateField, t as Text, z as Transaction, h as codePointAt, te as codePointSize, Me as combineConfig, He as countColumn, f as findClusterBreak, Ue as findColumn, ee as fromCodePoint };
+
+//# sourceMappingURL=index.js.map