@sheetxl/studio-vanilla 0.8.0-beta.1 → 0.8.0-beta.10

package/cdn/assets/BVjXdv_wkL1x_8ZJ2.js

@@ -1,1149 +0,0 @@
-/**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.1
-*
-* (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
-*/
-function e(e) {
-	return Array.isArray ? Array.isArray(e) : c(e) === "[object Array]";
-}
-function t(e) {
-	return e == null ? "" : function(e) {
-		if (typeof e == "string") return e;
-		if (typeof e == "bigint") return e.toString();
-		let t = e + "";
-		return t == "0" && 1 / e == -Infinity ? "-0" : t;
-	}(e);
-}
-function n(e) {
-	return typeof e == "string";
-}
-function r(e) {
-	return typeof e == "number";
-}
-function i(e) {
-	return !0 === e || !1 === e || function(e) {
-		return a(e) && e !== null;
-	}(e) && c(e) == "[object Boolean]";
-}
-function a(e) {
-	return typeof e == "object";
-}
-function o(e) {
-	return e != null;
-}
-function s(e) {
-	return !e.trim().length;
-}
-function c(e) {
-	return e == null ? e === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(e);
-}
-var l = "Invalid doc index: must be a non-negative integer within the bounds of the docs array", u = Object.prototype.hasOwnProperty, d = class {
-	constructor(e) {
-		this._keys = [], this._keyMap = {};
-		let t = 0;
-		e.forEach((e) => {
-			let n = f(e);
-			this._keys.push(n), this._keyMap[n.id] = n, t += n.weight;
-		}), this._keys.forEach((e) => {
-			e.weight /= t;
-		});
-	}
-	get(e) {
-		return this._keyMap[e];
-	}
-	keys() {
-		return this._keys;
-	}
-	toJSON() {
-		return JSON.stringify(this._keys);
-	}
-};
-function f(t) {
-	let r = null, i = null, a = null, o = 1, s = null;
-	if (n(t) || e(t)) a = t, r = p(t), i = m(t);
-	else {
-		if (!u.call(t, "name")) throw Error("Missing name property in key");
-		let e = t.name;
-		if (a = e, u.call(t, "weight") && t.weight !== void 0 && (o = t.weight, o <= 0)) throw Error(((e) => `Property 'weight' in key '${e}' must be a positive integer`)(m(e)));
-		r = p(e), i = m(e), s = t.getFn ?? null;
-	}
-	return {
-		path: r,
-		id: i,
-		weight: o,
-		src: a,
-		getFn: s
-	};
-}
-function p(t) {
-	return e(t) ? t : t.split(".");
-}
-function m(t) {
-	return e(t) ? t.join(".") : t;
-}
-var h = Object.freeze({
-	isCaseSensitive: !1,
-	ignoreDiacritics: !1,
-	includeScore: !1,
-	keys: [],
-	shouldSort: !0,
-	sortFn: (e, t) => e.score === t.score ? e.idx < t.idx ? -1 : 1 : e.score < t.score ? -1 : 1,
-	includeMatches: !1,
-	findAllMatches: !1,
-	minMatchCharLength: 1,
-	location: 0,
-	threshold: .6,
-	distance: 100,
-	useExtendedSearch: !1,
-	useTokenSearch: !1,
-	tokenize: void 0,
-	tokenMatch: "any",
-	getFn: function(a, s) {
-		let c = [], l = !1, u = (a, s, d, f) => {
-			if (o(a)) if (s[d]) {
-				let p = a[s[d]];
-				if (!o(p)) return;
-				if (d === s.length - 1 && (n(p) || r(p) || i(p) || typeof p == "bigint")) c.push(f === void 0 ? t(p) : {
-					v: t(p),
-					i: f
-				});
-				else if (e(p)) {
-					l = !0;
-					for (let e = 0, t = p.length; e < t; e += 1) u(p[e], s, d + 1, e);
-				} else s.length && u(p, s, d + 1, f);
-			} else c.push(f === void 0 ? a : {
-				v: a,
-				i: f
-			});
-		};
-		return u(a, n(s) ? s.split(".") : s, 0), l ? c : c[0];
-	},
-	ignoreLocation: !1,
-	ignoreFieldNorm: !1,
-	fieldNormWeight: 1
-});
-function g(e) {
-	return e >= 9 && e <= 13 || e === 32 || e === 160;
-}
-var _ = class {
-	constructor({ getFn: e = h.getFn, fieldNormWeight: t = h.fieldNormWeight } = {}) {
-		this.norm = function(e = 1, t = 3) {
-			let n = /* @__PURE__ */ new Map(), r = 10 ** t;
-			return {
-				get(t) {
-					let i = 0, a = !1;
-					for (let e = 0; e < t.length; e++) g(t.charCodeAt(e)) ? a = !1 : a ||= (i++, !0);
-					if (i === 0 && (i = 1), n.has(i)) return n.get(i);
-					let o = Math.round(r / i ** (.5 * e)) / r;
-					return n.set(i, o), o;
-				},
-				clear() {
-					n.clear();
-				}
-			};
-		}(t, 3), this.getFn = e, this.isCreated = !1, this.docs = [], this.keys = [], this._keysMap = {}, this.setIndexRecords();
-	}
-	setSources(e = []) {
-		this.docs = e;
-	}
-	setIndexRecords(e = []) {
-		this.records = e;
-	}
-	setKeys(e = []) {
-		this.keys = e, this._keysMap = {}, e.forEach((e, t) => {
-			this._keysMap[e.id] = t;
-		});
-	}
-	create() {
-		if (this.isCreated || !this.docs.length) return;
-		this.isCreated = !0;
-		let e = this.docs.length;
-		this.records = Array(e);
-		let t = 0;
-		if (n(this.docs[0])) for (let n = 0; n < e; n++) {
-			let e = this._createStringRecord(this.docs[n], n);
-			e && (this.records[t++] = e);
-		}
-		else for (let n = 0; n < e; n++) this.records[t++] = this._createObjectRecord(this.docs[n], n);
-		this.records.length = t, this.norm.clear();
-	}
-	add(e, t) {
-		if (!Number.isInteger(t) || t < 0) throw Error(l);
-		if (n(e)) {
-			let n = this._createStringRecord(e, t);
-			return n && this.records.push(n), n;
-		}
-		let r = this._createObjectRecord(e, t);
-		return this.records.push(r), r;
-	}
-	removeAt(e) {
-		if (!Number.isInteger(e) || e < 0) throw Error(l);
-		for (let t = 0, n = this.records.length; t < n; t += 1) if (this.records[t].i === e) {
-			this.records.splice(t, 1);
-			break;
-		}
-		for (let t = 0, n = this.records.length; t < n; t += 1) this.records[t].i > e && --this.records[t].i;
-	}
-	removeAll(e) {
-		let t = /* @__PURE__ */ new Set();
-		for (let n of e) Number.isInteger(n) && n >= 0 && t.add(n);
-		if (t.size === 0) return;
-		this.records = this.records.filter((e) => !t.has(e.i));
-		let n = Array.from(t).sort((e, t) => e - t);
-		for (let e of this.records) {
-			let t = 0, r = n.length;
-			for (; t < r;) {
-				let i = t + r >>> 1;
-				n[i] < e.i ? t = i + 1 : r = i;
-			}
-			e.i -= t;
-		}
-	}
-	getValueForItemAtKeyId(e, t) {
-		return e[this._keysMap[t]];
-	}
-	size() {
-		return this.records.length;
-	}
-	_createStringRecord(e, t) {
-		return !o(e) || s(e) ? null : {
-			v: e,
-			i: t,
-			n: this.norm.get(e)
-		};
-	}
-	_createObjectRecord(r, i) {
-		let a = {
-			i,
-			$: {}
-		};
-		for (let i = 0, c = this.keys.length; i < c; i++) {
-			let c = this.keys[i], l = c.getFn ? c.getFn(r) : this.getFn(r, c.path);
-			if (o(l)) {
-				if (e(l)) {
-					let e = [];
-					for (let r = 0, i = l.length; r < i; r += 1) {
-						let i = l[r];
-						if (o(i)) {
-							if (n(i)) {
-								if (!s(i)) {
-									let t = {
-										v: i,
-										i: r,
-										n: this.norm.get(i)
-									};
-									e.push(t);
-								}
-							} else if (o(i.v)) {
-								let r = n(i.v) ? i.v : t(i.v);
-								if (!s(r)) {
-									let t = {
-										v: r,
-										i: i.i,
-										n: this.norm.get(r)
-									};
-									e.push(t);
-								}
-							}
-						}
-					}
-					a.$[i] = e;
-				} else if (n(l) && !s(l)) {
-					let e = {
-						v: l,
-						n: this.norm.get(l)
-					};
-					a.$[i] = e;
-				}
-			}
-		}
-		return a;
-	}
-	toJSON() {
-		return {
-			keys: this.keys.map(({ getFn: e, ...t }) => t),
-			records: this.records
-		};
-	}
-};
-function v(e, t, { getFn: n = h.getFn, fieldNormWeight: r = h.fieldNormWeight } = {}) {
-	let i = new _({
-		getFn: n,
-		fieldNormWeight: r
-	});
-	return i.setKeys(e.map(f)), i.setSources(t), i.create(), i;
-}
-function y(e, t, n, { location: r = h.location, distance: i = h.distance, threshold: a = h.threshold, findAllMatches: o = h.findAllMatches, minMatchCharLength: s = h.minMatchCharLength, includeMatches: c = h.includeMatches, ignoreLocation: l = h.ignoreLocation } = {}) {
-	if (t.length > 32) throw Error("Pattern length exceeds max of 32.");
-	let u, d = t.length, f = e.length, p = Math.max(0, Math.min(r, f)), m = a, g = p, _ = (e, t) => {
-		let n = e / d;
-		if (l) return n;
-		let r = Math.abs(p - t);
-		return i ? n + r / i : r ? 1 : n;
-	}, v = s > 1 || c, y = v ? Array(f) : [];
-	for (; (u = e.indexOf(t, g)) > -1;) {
-		let e = _(0, u);
-		if (m = Math.min(e, m), g = u + d, v) {
-			let e = 0;
-			for (; e < d;) y[u + e] = 1, e += 1;
-		}
-	}
-	g = -1;
-	let b = [], x = 1, S = 0, C = d + f, w = 1 << d - 1;
-	for (let t = 0; t < d; t += 1) {
-		let r = 0, i = C;
-		for (; r < i;) _(t, p + i) <= m ? r = i : C = i, i = Math.floor((C - r) / 2 + r);
-		C = i;
-		let a = Math.max(1, p - i + 1), s = o ? f : Math.min(p + i, f) + d, c = Array(s + 2);
-		c[s + 1] = (1 << t) - 1;
-		for (let r = s; r >= a; --r) {
-			let i = r - 1, o = n[e[i]];
-			if (c[r] = (c[r + 1] << 1 | 1) & o, t && (c[r] |= (b[r + 1] | b[r]) << 1 | 1 | b[r + 1]), c[r] & w && (x = _(t, i), x <= m)) {
-				if (m = x, g = i, S = t, g <= p) break;
-				a = Math.max(1, 2 * p - g);
-			}
-		}
-		if (_(t + 1, p) > m) break;
-		b = c;
-	}
-	if (v && g >= 0) {
-		let t = Math.min(f - 1, g + d - 1 + S);
-		for (let r = g; r <= t; r += 1) n[e[r]] && (y[r] = 1);
-	}
-	let T = {
-		isMatch: g >= 0,
-		score: Math.max(.001, x)
-	};
-	if (v) {
-		let e = function(e = [], t = h.minMatchCharLength) {
-			let n = [], r = -1, i = -1, a = 0;
-			for (let o = e.length; a < o; a += 1) {
-				let o = e[a];
-				o && r === -1 ? r = a : o || r === -1 || (i = a - 1, i - r + 1 >= t && n.push([r, i]), r = -1);
-			}
-			return e[a - 1] && a - r >= t && n.push([r, a - 1]), n;
-		}(y, s);
-		e.length ? c && (T.indices = e) : T.isMatch = !1;
-	}
-	return T;
-}
-function b(e) {
-	let t = {};
-	for (let n = 0, r = e.length; n < r; n += 1) {
-		let i = e.charAt(n);
-		t[i] = (t[i] || 0) | 1 << r - n - 1;
-	}
-	return t;
-}
-function x(e) {
-	if (e.length <= 1) return e;
-	e.sort((e, t) => e[0] - t[0] || e[1] - t[1]);
-	let t = [e[0]];
-	for (let n = 1, r = e.length; n < r; n += 1) {
-		let r = t[t.length - 1], i = e[n];
-		i[0] <= r[1] + 1 ? r[1] = Math.max(r[1], i[1]) : t.push(i);
-	}
-	return t;
-}
-var S = {
-	ł: "l",
-	Ł: "L",
-	đ: "d",
-	Đ: "D",
-	ø: "o",
-	Ø: "O",
-	ħ: "h",
-	Ħ: "H",
-	ŧ: "t",
-	Ŧ: "T",
-	ı: "i",
-	ß: "ss"
-}, C = RegExp("[" + Object.keys(S).join("") + "]", "g"), w = typeof String.prototype.normalize == "function" ? (e) => e.normalize("NFD").replace(/[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u08D3-\u08E1\u08E3-\u0903\u093A-\u093C\u093E-\u094F\u0951-\u0957\u0962\u0963\u0981-\u0983\u09BC\u09BE-\u09C4\u09C7\u09C8\u09CB-\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01-\u0A03\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81-\u0A83\u0ABC\u0ABE-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01-\u0B03\u0B3C\u0B3E-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B62\u0B63\u0B82\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD7\u0C00-\u0C04\u0C3E-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81-\u0C83\u0CBC\u0CBE-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00-\u0D03\u0D3B\u0D3C\u0D3E-\u0D44\u0D46-\u0D48\u0D4A-\u0D4D\u0D57\u0D62\u0D63\u0D82\u0D83\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DF2\u0DF3\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EB9\u0EBB\u0EBC\u0EC8-\u0ECD\u0F18\u0F19\u0F35\u0F37\u0F39\u0F3E\u0F3F\u0F71-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102B-\u103E\u1056-\u1059\u105E-\u1060\u1062-\u1064\u1067-\u106D\u1071-\u1074\u1082-\u108D\u108F\u109A-\u109D\u135D-\u135F\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17B4-\u17D3\u17DD\u180B-\u180D\u1885\u1886\u18A9\u1920-\u192B\u1930-\u193B\u1A17-\u1A1B\u1A55-\u1A5E\u1A60-\u1A7C\u1A7F\u1AB0-\u1ABE\u1B00-\u1B04\u1B34-\u1B44\u1B6B-\u1B73\u1B80-\u1B82\u1BA1-\u1BAD\u1BE6-\u1BF3\u1C24-\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE8\u1CED\u1CF2-\u1CF4\u1CF7-\u1CF9\u1DC0-\u1DF9\u1DFB-\u1DFF\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA823-\uA827\uA880\uA881\uA8B4-\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA953\uA980-\uA983\uA9B3-\uA9C0\uA9E5\uAA29-\uAA36\uAA43\uAA4C\uAA4D\uAA7B-\uAA7D\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEB-\uAAEF\uAAF5\uAAF6\uABE3-\uABEA\uABEC\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F]/g, "").replace(C, (e) => S[e]) : (e) => e, T = class {
-	constructor(e, { location: t = h.location, threshold: n = h.threshold, distance: r = h.distance, includeMatches: i = h.includeMatches, findAllMatches: a = h.findAllMatches, minMatchCharLength: o = h.minMatchCharLength, isCaseSensitive: s = h.isCaseSensitive, ignoreDiacritics: c = h.ignoreDiacritics, ignoreLocation: l = h.ignoreLocation } = {}) {
-		if (this.options = {
-			location: t,
-			threshold: n,
-			distance: r,
-			includeMatches: i,
-			findAllMatches: a,
-			minMatchCharLength: o,
-			isCaseSensitive: s,
-			ignoreDiacritics: c,
-			ignoreLocation: l
-		}, e = s ? e : e.toLowerCase(), e = c ? w(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length) return;
-		let u = (e, t) => {
-			this.chunks.push({
-				pattern: e,
-				alphabet: b(e),
-				startIndex: t
-			});
-		}, d = this.pattern.length;
-		if (d > 32) {
-			let e = 0, t = d % 32, n = d - t;
-			for (; e < n;) u(this.pattern.substr(e, 32), e), e += 32;
-			if (t) {
-				let e = d - 32;
-				u(this.pattern.substr(e), e);
-			}
-		} else u(this.pattern, 0);
-	}
-	searchIn(e) {
-		let { isCaseSensitive: t, ignoreDiacritics: n, includeMatches: r } = this.options;
-		if (e = t ? e : e.toLowerCase(), e = n ? w(e) : e, this.pattern === e) {
-			if (e.length < this.options.minMatchCharLength) return {
-				isMatch: !1,
-				score: 1
-			};
-			let t = {
-				isMatch: !0,
-				score: 0
-			};
-			return r && (t.indices = [[0, e.length - 1]]), t;
-		}
-		let { location: i, distance: a, threshold: o, findAllMatches: s, minMatchCharLength: c, ignoreLocation: l } = this.options, u = [], d = 0, f = !1;
-		this.chunks.forEach(({ pattern: t, alphabet: n, startIndex: p }) => {
-			let { isMatch: m, score: h, indices: g } = y(e, t, n, {
-				location: i + p,
-				distance: a,
-				threshold: o,
-				findAllMatches: s,
-				minMatchCharLength: c,
-				includeMatches: r,
-				ignoreLocation: l
-			});
-			m && (f = !0), d += h, m && g && u.push(...g);
-		});
-		let p = {
-			isMatch: f,
-			score: f ? d / this.chunks.length : 1
-		};
-		return f && r && (p.indices = x(u)), p;
-	}
-}, E = /* @__PURE__ */ new Set(["fuzzy", "include"]);
-function D(e) {
-	return e.startsWith("inverse");
-}
-var O = [
-	{
-		type: "exact",
-		multiRegex: /^="(.*)"$/,
-		singleRegex: /^=(.*)$/,
-		create: (e) => ({
-			type: "exact",
-			search(t) {
-				let n = t === e;
-				return {
-					isMatch: n,
-					score: +!n,
-					indices: [0, e.length - 1]
-				};
-			}
-		})
-	},
-	{
-		type: "include",
-		multiRegex: /^'"(.*)"$/,
-		singleRegex: /^'(.*)$/,
-		create: (e) => ({
-			type: "include",
-			search(t) {
-				let n, r = 0, i = [], a = e.length;
-				for (; (n = t.indexOf(e, r)) > -1;) r = n + a, i.push([n, r - 1]);
-				let o = !!i.length;
-				return {
-					isMatch: o,
-					score: +!o,
-					indices: i
-				};
-			}
-		})
-	},
-	{
-		type: "prefix-exact",
-		multiRegex: /^\^"(.*)"$/,
-		singleRegex: /^\^(.*)$/,
-		create: (e) => ({
-			type: "prefix-exact",
-			search(t) {
-				let n = t.startsWith(e);
-				return {
-					isMatch: n,
-					score: +!n,
-					indices: [0, e.length - 1]
-				};
-			}
-		})
-	},
-	{
-		type: "inverse-prefix-exact",
-		multiRegex: /^!\^"(.*)"$/,
-		singleRegex: /^!\^(.*)$/,
-		create: (e) => ({
-			type: "inverse-prefix-exact",
-			search(t) {
-				let n = !t.startsWith(e);
-				return {
-					isMatch: n,
-					score: +!n,
-					indices: [0, t.length - 1]
-				};
-			}
-		})
-	},
-	{
-		type: "inverse-suffix-exact",
-		multiRegex: /^!"(.*)"\$$/,
-		singleRegex: /^!(.*)\$$/,
-		create: (e) => ({
-			type: "inverse-suffix-exact",
-			search(t) {
-				let n = !t.endsWith(e);
-				return {
-					isMatch: n,
-					score: +!n,
-					indices: [0, t.length - 1]
-				};
-			}
-		})
-	},
-	{
-		type: "suffix-exact",
-		multiRegex: /^"(.*)"\$$/,
-		singleRegex: /^(.*)\$$/,
-		create: (e) => ({
-			type: "suffix-exact",
-			search(t) {
-				let n = t.endsWith(e);
-				return {
-					isMatch: n,
-					score: +!n,
-					indices: [t.length - e.length, t.length - 1]
-				};
-			}
-		})
-	},
-	{
-		type: "inverse-exact",
-		multiRegex: /^!"(.*)"$/,
-		singleRegex: /^!(.*)$/,
-		create: (e) => ({
-			type: "inverse-exact",
-			search(t) {
-				let n = t.indexOf(e) === -1;
-				return {
-					isMatch: n,
-					score: +!n,
-					indices: [0, t.length - 1]
-				};
-			}
-		})
-	},
-	{
-		type: "fuzzy",
-		multiRegex: /^"(.*)"$/,
-		singleRegex: /^(.*)$/,
-		create: (e, t = {}) => {
-			let n = new T(e, {
-				location: t.location ?? h.location,
-				threshold: t.threshold ?? h.threshold,
-				distance: t.distance ?? h.distance,
-				includeMatches: t.includeMatches ?? h.includeMatches,
-				findAllMatches: t.findAllMatches ?? h.findAllMatches,
-				minMatchCharLength: t.minMatchCharLength ?? h.minMatchCharLength,
-				isCaseSensitive: t.isCaseSensitive ?? h.isCaseSensitive,
-				ignoreDiacritics: t.ignoreDiacritics ?? h.ignoreDiacritics,
-				ignoreLocation: t.ignoreLocation ?? h.ignoreLocation
-			});
-			return {
-				type: "fuzzy",
-				search: (e) => n.searchIn(e)
-			};
-		}
-	}
-], k = O.length;
-function A(e, t) {
-	let n = e.match(t);
-	return n ? n[1] : null;
-}
-var j = [];
-function M(...e) {
-	j.push(...e);
-}
-function N(e, t) {
-	for (let n = 0, r = j.length; n < r; n += 1) {
-		let r = j[n];
-		if (r.condition(e, t)) return new r(e, t);
-	}
-	return new T(e, t);
-}
-var P = "$and", F = "$path", I = (e) => !(!e[P] && !e.$or), L = (e) => ({ [P]: Object.keys(e).map((t) => ({ [t]: e[t] })) });
-function R(t, r, { auto: i = !0 } = {}) {
-	let o = (t) => {
-		if (n(t)) {
-			let e = {
-				keyId: null,
-				pattern: t
-			};
-			return i && (e.searcher = N(t, r)), e;
-		}
-		let s = Object.keys(t), c = ((e) => !!e[F])(t);
-		if (!c && s.length > 1 && !I(t)) return o(L(t));
-		if (((t) => !e(t) && a(t) && !I(t))(t)) {
-			let e = c ? t[F] : s[0], a = c ? t.$val : t[e];
-			if (!n(a)) throw Error(((e) => `Invalid value for key ${e}`)(e));
-			let o = {
-				keyId: m(e),
-				pattern: a
-			};
-			return i && (o.searcher = N(a, r)), o;
-		}
-		let l = {
-			children: [],
-			operator: s[0]
-		};
-		return s.forEach((n) => {
-			let r = t[n];
-			e(r) && r.forEach((e) => {
-				l.children.push(o(e));
-			});
-		}), l;
-	};
-	return I(t) || (t = L(t)), o(t);
-}
-function z(e, { ignoreFieldNorm: t = h.ignoreFieldNorm }) {
-	let n = 1;
-	return e.forEach(({ key: e, norm: r, score: i }) => {
-		let a = e ? e.weight : null;
-		n *= (i === 0 && a ? 2 ** -52 : i) ** (+(a || 1) * (t ? 1 : r));
-	}), n;
-}
-var B = class {
-	constructor(e, t) {
-		this.limit = e, this.heap = [], this.comparator = t;
-	}
-	get size() {
-		return this.heap.length;
-	}
-	insert(e) {
-		this.size < this.limit ? (this.heap.push(e), this._bubbleUp(this.size - 1)) : this.comparator(e, this.heap[0]) < 0 && (this.heap[0] = e, this._sinkDown(0));
-	}
-	extractSorted() {
-		return this.heap.sort(this.comparator);
-	}
-	_bubbleUp(e) {
-		let t = this.heap;
-		for (; e > 0;) {
-			let n = e - 1 >> 1;
-			if (this.comparator(t[e], t[n]) <= 0) break;
-			let r = t[e];
-			t[e] = t[n], t[n] = r, e = n;
-		}
-	}
-	_sinkDown(e) {
-		let t = this.heap, n = t.length, r = e;
-		do {
-			let i = 2 * (e = r) + 1, a = 2 * e + 2;
-			if (i < n && this.comparator(t[i], t[r]) > 0 && (r = i), a < n && this.comparator(t[a], t[r]) > 0 && (r = a), r !== e) {
-				let n = t[e];
-				t[e] = t[r], t[r] = n;
-			}
-		} while (r !== e);
-	}
-};
-function V(e, t, { includeMatches: n = h.includeMatches, includeScore: r = h.includeScore } = {}) {
-	return e.map((e) => {
-		let { idx: i } = e, a = {
-			item: t[i],
-			refIndex: i
-		};
-		return n && (a.matches = function(e) {
-			let t = [];
-			return e.matches.forEach((e) => {
-				if (!o(e.indices) || !e.indices.length) return;
-				let n = {
-					indices: e.indices,
-					value: e.value
-				};
-				e.key && (n.key = e.key.id), e.idx > -1 && (n.refIndex = e.idx), t.push(n);
-			}), t;
-		}(e)), r && (a.score = e.score), a;
-	});
-}
-var H = /[\p{L}\p{M}\p{N}_]+/gu, U = /* @__PURE__ */ new WeakSet();
-function W({ isCaseSensitive: e = !1, ignoreDiacritics: t = !1, tokenize: n } = {}) {
-	let r = function(e) {
-		if (typeof e == "function") {
-			let t = !1;
-			return (n) => {
-				let r = e(n);
-				if (!t && (t = !0, !Array.isArray(r) || r.some((e) => typeof e != "string"))) throw Error(`[Fuse] tokenize function must return string[]; received ${Array.isArray(r) ? "array containing non-strings" : typeof r}.`);
-				return r;
-			};
-		}
-		return e instanceof RegExp ? (e.global || (t = e, U.has(t) || (U.add(t), console.warn(`[Fuse] tokenize regex ${t} lacks the global flag; only the first match per text will be returned. Add the 'g' flag.`))), (t) => t.match(e) || []) : (e) => e.match(H) || [];
-		var t;
-	}(n);
-	return { tokenize: (n) => (e || (n = n.toLowerCase()), t && (n = w(n)), r(n)) };
-}
-function G(e, t, n, r) {
-	let i = r.tokenize(t);
-	if (!i.length) return;
-	e.fieldCount++, e.docFieldCount.set(n, (e.docFieldCount.get(n) || 0) + 1);
-	let a = new Set(i), o = e.docTermFieldHits.get(n);
-	o || (o = /* @__PURE__ */ new Map(), e.docTermFieldHits.set(n, o));
-	for (let t of a) o.set(t, (o.get(t) || 0) + 1), e.df.set(t, (e.df.get(t) || 0) + 1);
-}
-function K(e, t, n, r) {
-	let { i, v: a, $: o } = t;
-	if (a === void 0) {
-		if (o) for (let t = 0; t < n; t++) {
-			let n = o[t];
-			if (n) if (Array.isArray(n)) for (let t of n) G(e, t.v, i, r);
-			else G(e, n.v, i, r);
-		}
-	} else G(e, a, i, r);
-}
-function q(e, t) {
-	let n = e.docFieldCount.get(t);
-	if (n === void 0) return;
-	e.fieldCount -= n, e.docFieldCount.delete(t);
-	let r = e.docTermFieldHits.get(t);
-	if (r) {
-		for (let [t, n] of r) {
-			let r = (e.df.get(t) || 0) - n;
-			r <= 0 ? e.df.delete(t) : e.df.set(t, r);
-		}
-		e.docTermFieldHits.delete(t);
-	}
-}
-function J(e, t) {
-	if (t.length === 0) return;
-	let n = Array.from(new Set(t)).sort((e, t) => e - t);
-	for (let t of n) q(e, t);
-	let r = (e) => {
-		let t = 0, r = n.length;
-		for (; t < r;) {
-			let i = t + r >>> 1;
-			n[i] < e ? t = i + 1 : r = i;
-		}
-		return e - t;
-	}, i = n[0], a = /* @__PURE__ */ new Map();
-	for (let [t, n] of e.docFieldCount) a.set(t > i ? r(t) : t, n);
-	e.docFieldCount = a;
-	let o = /* @__PURE__ */ new Map();
-	for (let [t, n] of e.docTermFieldHits) o.set(t > i ? r(t) : t, n);
-	e.docTermFieldHits = o;
-}
-var Y = class {
-	constructor(e, t, n) {
-		this.options = {
-			...h,
-			...t
-		}, this.options.useExtendedSearch, this.options.useTokenSearch, this._keyStore = new d(this.options.keys), this._docs = e, this._myIndex = null, this._invertedIndex = null, this.setCollection(e, n), this._lastQuery = null, this._lastSearcher = null;
-	}
-	_getSearcher(e) {
-		if (this._lastQuery === e) return this._lastSearcher;
-		let t = N(e, this._invertedIndex ? {
-			...this.options,
-			_invertedIndex: this._invertedIndex
-		} : this.options);
-		return this._lastQuery = e, this._lastSearcher = t, t;
-	}
-	setCollection(e, t) {
-		if (this._docs = e, t && !(t instanceof _)) throw Error("Incorrect 'index' type");
-		if (this._myIndex = t || v(this.options.keys, this._docs, {
-			getFn: this.options.getFn,
-			fieldNormWeight: this.options.fieldNormWeight
-		}), this.options.useTokenSearch) {
-			let e = W({
-				isCaseSensitive: this.options.isCaseSensitive,
-				ignoreDiacritics: this.options.ignoreDiacritics,
-				tokenize: this.options.tokenize
-			});
-			this._invertedIndex = function(e, t, n) {
-				let r = {
-					fieldCount: 0,
-					df: /* @__PURE__ */ new Map(),
-					docFieldCount: /* @__PURE__ */ new Map(),
-					docTermFieldHits: /* @__PURE__ */ new Map()
-				};
-				for (let i of e) K(r, i, t, n);
-				return r;
-			}(this._myIndex.records, this._myIndex.keys.length, e);
-		}
-		this._invalidateSearcherCache();
-	}
-	add(e) {
-		if (!o(e)) return;
-		this._docs.push(e);
-		let t = this._myIndex.add(e, this._docs.length - 1);
-		if (this._invertedIndex && t) {
-			let e = W({
-				isCaseSensitive: this.options.isCaseSensitive,
-				ignoreDiacritics: this.options.ignoreDiacritics,
-				tokenize: this.options.tokenize
-			});
-			(function(e, t, n, r) {
-				K(e, t, n, r);
-			})(this._invertedIndex, t, this._myIndex.keys.length, e);
-		}
-		this._invalidateSearcherCache();
-	}
-	remove(e = () => !1) {
-		let t = [], n = [];
-		for (let r = 0, i = this._docs.length; r < i; r += 1) e(this._docs[r], r) && (t.push(this._docs[r]), n.push(r));
-		if (n.length) {
-			this._invertedIndex && J(this._invertedIndex, n);
-			let e = new Set(n);
-			this._docs = this._docs.filter((t, n) => !e.has(n)), this._myIndex.removeAll(n), this._invalidateSearcherCache();
-		}
-		return t;
-	}
-	removeAt(e) {
-		if (!Number.isInteger(e) || e < 0 || e >= this._docs.length) throw Error(l);
-		this._invertedIndex && J(this._invertedIndex, [e]);
-		let t = this._docs.splice(e, 1)[0];
-		return this._myIndex.removeAt(e), this._invalidateSearcherCache(), t;
-	}
-	_invalidateSearcherCache() {
-		this._lastQuery = null, this._lastSearcher = null;
-	}
-	getIndex() {
-		return this._myIndex;
-	}
-	_normalizedKeys() {
-		return this._myIndex.keys.map((e) => this._keyStore.get(e.id) || e);
-	}
-	search(e, t) {
-		let { limit: i = -1 } = t || {}, { includeMatches: a, includeScore: o, shouldSort: s, sortFn: c, ignoreFieldNorm: l } = this.options;
-		if (n(e) && !e.trim()) {
-			let e = this._docs.map((e, t) => ({
-				item: e,
-				refIndex: t
-			}));
-			return r(i) && i > -1 && (e = e.slice(0, i)), e;
-		}
-		let u, d = s && r(i) && i > 0 && n(e), f = c, p = (e, t) => f(e, t) || e.idx - t.idx;
-		if (d) {
-			let t = new B(i, p);
-			n(this._docs[0]) ? this._searchStringList(e, {
-				heap: t,
-				ignoreFieldNorm: l
-			}) : this._searchObjectList(e, {
-				heap: t,
-				ignoreFieldNorm: l
-			}), u = t.extractSorted();
-		} else u = n(e) ? n(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e), function(e, { ignoreFieldNorm: t = h.ignoreFieldNorm }) {
-			e.forEach((e) => {
-				e.score = z(e.matches, { ignoreFieldNorm: t });
-			});
-		}(u, { ignoreFieldNorm: l }), s && u.sort(n(e) ? p : f), r(i) && i > -1 && (u = u.slice(0, i));
-		return V(u, this._docs, {
-			includeMatches: a,
-			includeScore: o
-		});
-	}
-	_searchStringList(e, { heap: t, ignoreFieldNorm: n } = {}) {
-		let r = this._getSearcher(e), i = this.options.useTokenSearch && this.options.tokenMatch === "all", { records: a } = this._myIndex, s = t ? null : [];
-		return a.forEach(({ v: e, i: a, n: c }) => {
-			if (!o(e)) return;
-			let l = r.searchIn(e);
-			if (l.isMatch) {
-				let r = {
-					score: l.score,
-					value: e,
-					norm: c,
-					indices: l.indices
-				};
-				i && (r.matchedMask = l.matchedMask, r.matchedTerms = l.matchedTerms, r.termCount = l.termCount);
-				let o = [r];
-				if (!i || this._coversAllTokens(o)) {
-					let r = {
-						item: e,
-						idx: a,
-						matches: o
-					};
-					t ? (r.score = z(r.matches, { ignoreFieldNorm: n }), t.insert(r)) : s.push(r);
-				}
-			}
-		}), s;
-	}
-	_searchLogical(e) {
-		let t = R(e, this.options), n = this._normalizedKeys(), r = (e, t, i) => {
-			if (!("children" in e)) {
-				let r, { keyId: a, searcher: o } = e;
-				return a === null ? (r = [], n.forEach((e, n) => {
-					r.push(...this._findMatches({
-						key: e,
-						value: t[n],
-						searcher: o
-					}));
-				})) : r = this._findMatches({
-					key: this._keyStore.get(a),
-					value: this._myIndex.getValueForItemAtKeyId(t, a),
-					searcher: o
-				}), r && r.length ? [{
-					idx: i,
-					item: t,
-					matches: r
-				}] : [];
-			}
-			let { children: a, operator: o } = e, s = [];
-			for (let e = 0, n = a.length; e < n; e += 1) {
-				let n = a[e], c = r(n, t, i);
-				if (c.length) s.push(...c);
-				else if (o === P) return [];
-			}
-			return s;
-		}, i = this._myIndex.records, a = /* @__PURE__ */ new Map(), s = [];
-		return i.forEach(({ $: e, i: n }) => {
-			if (o(e)) {
-				let i = r(t, e, n);
-				i.length && (a.has(n) || (a.set(n, {
-					idx: n,
-					item: e,
-					matches: []
-				}), s.push(a.get(n))), i.forEach(({ matches: e }) => {
-					a.get(n).matches.push(...e);
-				}));
-			}
-		}), s;
-	}
-	_searchObjectList(e, { heap: t, ignoreFieldNorm: n } = {}) {
-		let r = this._getSearcher(e), i = this.options.useTokenSearch && this.options.tokenMatch === "all", { records: a } = this._myIndex, s = this._normalizedKeys(), c = t ? null : [];
-		return a.forEach(({ $: e, i: a }) => {
-			if (!o(e)) return;
-			let l = [], u = !1, d = !1;
-			if (s.forEach((t, n) => {
-				let i = this._findMatches({
-					key: t,
-					value: e[n],
-					searcher: r
-				});
-				i.length ? (l.push(...i), i[0].hasInverse && (d = !0)) : u = !0;
-			}), (!d || !u) && l.length && (!i || this._coversAllTokens(l))) {
-				let r = {
-					idx: a,
-					item: e,
-					matches: l
-				};
-				t ? (r.score = z(r.matches, { ignoreFieldNorm: n }), t.insert(r)) : c.push(r);
-			}
-		}), c;
-	}
-	_findMatches({ key: t, value: n, searcher: r }) {
-		if (!o(n)) return [];
-		let i = [];
-		if (e(n)) n.forEach(({ v: e, i: n, n: a }) => {
-			if (!o(e)) return;
-			let s = r.searchIn(e);
-			if (s.isMatch) {
-				let r = {
-					score: s.score,
-					key: t,
-					value: e,
-					idx: n,
-					norm: a,
-					indices: s.indices,
-					hasInverse: s.hasInverse
-				};
-				s.termCount !== void 0 && (r.matchedMask = s.matchedMask, r.matchedTerms = s.matchedTerms, r.termCount = s.termCount), i.push(r);
-			}
-		});
-		else {
-			let { v: e, n: a } = n, o = r.searchIn(e);
-			if (o.isMatch) {
-				let n = {
-					score: o.score,
-					key: t,
-					value: e,
-					norm: a,
-					indices: o.indices,
-					hasInverse: o.hasInverse
-				};
-				o.termCount !== void 0 && (n.matchedMask = o.matchedMask, n.matchedTerms = o.matchedTerms, n.termCount = o.termCount), i.push(n);
-			}
-		}
-		return i;
-	}
-	_coversAllTokens(e) {
-		let t = e.length ? e[0].termCount : void 0;
-		if (t === void 0) return !0;
-		if (t <= 31) {
-			let n = 0;
-			for (let t = 0; t < e.length; t++) n |= e[t].matchedMask || 0;
-			return n === 2 ** t - 1;
-		}
-		let n = /* @__PURE__ */ new Set();
-		for (let t = 0; t < e.length; t++) {
-			let r = e[t].matchedTerms;
-			if (r) for (let e of r) n.add(e);
-		}
-		return n.size === t;
-	}
-};
-Y.version = "7.5.0", Y.createIndex = v, Y.parseIndex = function(e, { getFn: t = h.getFn, fieldNormWeight: n = h.fieldNormWeight } = {}) {
-	let { keys: r, records: i } = e, a = new _({
-		getFn: t,
-		fieldNormWeight: n
-	});
-	return a.setKeys(r), a.setIndexRecords(i), a;
-}, Y.config = h, Y.match = function(e, t, n) {
-	if (n && n.useTokenSearch) throw Error("Fuse.match does not support useTokenSearch: token search requires corpus-level statistics (df, fieldCount) that a one-off string comparison does not have. Use new Fuse(...).search(...) instead.");
-	return N(e, {
-		...h,
-		...n
-	}).searchIn(t);
-}, Y.parseQuery = R, M(class {
-	constructor(e, { isCaseSensitive: t = h.isCaseSensitive, ignoreDiacritics: n = h.ignoreDiacritics, includeMatches: r = h.includeMatches, minMatchCharLength: i = h.minMatchCharLength, ignoreLocation: a = h.ignoreLocation, findAllMatches: o = h.findAllMatches, location: s = h.location, threshold: c = h.threshold, distance: l = h.distance } = {}) {
-		this.query = null, this.options = {
-			isCaseSensitive: t,
-			ignoreDiacritics: n,
-			includeMatches: r,
-			minMatchCharLength: i,
-			findAllMatches: o,
-			ignoreLocation: a,
-			location: s,
-			threshold: c,
-			distance: l
-		}, e = t ? e : e.toLowerCase(), e = n ? w(e) : e, this.pattern = e, this.query = function(e, t = {}) {
-			return e.replace(/\\\|/g, "\0").split("|").map((e) => {
-				let n = function(e) {
-					let t = [], n = e.length, r = 0;
-					for (; r < n;) {
-						for (; r < n && e[r] === " ";) r++;
-						if (r >= n) break;
-						let i = r;
-						for (; i < n && e[i] !== " " && e[i] !== "\"";) i++;
-						if (i < n && e[i] === "\"") {
-							for (i++; i < n;) {
-								if (e[i] === "\"") {
-									let t = i + 1;
-									if (t >= n || e[t] === " ") {
-										i++;
-										break;
-									}
-									if (e[t] === "$" && (t + 1 >= n || e[t + 1] === " ")) {
-										i += 2;
-										break;
-									}
-								}
-								i++;
-							}
-							t.push(e.substring(r, i)), r = i;
-						} else {
-							for (; i < n && e[i] !== " ";) i++;
-							t.push(e.substring(r, i)), r = i;
-						}
-					}
-					return t;
-				}(e.replace(/\u0000/g, "|").trim()).filter((e) => e && !!e.trim()), r = [];
-				for (let e = 0, i = n.length; e < i; e += 1) {
-					let i = n[e], a = !1, o = -1;
-					for (; !a && ++o < k;) {
-						let e = O[o], n = A(i, e.multiRegex);
-						n && (r.push(e.create(n, t)), a = !0);
-					}
-					if (!a) for (o = -1; ++o < k;) {
-						let e = O[o], n = A(i, e.singleRegex);
-						if (n) {
-							r.push(e.create(n, t));
-							break;
-						}
-					}
-				}
-				return r;
-			});
-		}(this.pattern, this.options);
-	}
-	static condition(e, t) {
-		return t.useExtendedSearch;
-	}
-	searchIn(e) {
-		let t = this.query;
-		if (!t) return {
-			isMatch: !1,
-			score: 1
-		};
-		let { includeMatches: n, isCaseSensitive: r, ignoreDiacritics: i } = this.options;
-		e = r ? e : e.toLowerCase(), e = i ? w(e) : e;
-		let a = 0, o = [], s = 0, c = !1;
-		for (let r = 0, i = t.length; r < i; r += 1) {
-			let i = t[r];
-			o.length = 0, a = 0, c = !1;
-			for (let t = 0, r = i.length; t < r; t += 1) {
-				let r = i[t], { isMatch: l, indices: u, score: d } = r.search(e);
-				if (!l) {
-					s = 0, a = 0, o.length = 0, c = !1;
-					break;
-				}
-				a += 1, s += d, D(r.type) && (c = !0), n && (E.has(r.type) ? o.push(...u) : o.push(u));
-			}
-			if (a) {
-				let e = {
-					isMatch: !0,
-					score: s / a
-				};
-				return c && (e.hasInverse = !0), n && (e.indices = x(o)), e;
-			}
-		}
-		return {
-			isMatch: !1,
-			score: 1
-		};
-	}
-}), M(class {
-	static condition(e, t) {
-		return t.useTokenSearch;
-	}
-	constructor(e, t) {
-		this.options = t, this.analyzer = W({
-			isCaseSensitive: t.isCaseSensitive,
-			ignoreDiacritics: t.ignoreDiacritics,
-			tokenize: t.tokenize
-		});
-		let n = this.analyzer.tokenize(e), { df: r, fieldCount: i } = t._invertedIndex;
-		this.termSearchers = [], this.idfWeights = [];
-		for (let e of n) {
-			this.termSearchers.push(new T(e, {
-				location: t.location,
-				threshold: t.threshold,
-				distance: t.distance,
-				includeMatches: t.includeMatches,
-				findAllMatches: t.findAllMatches,
-				minMatchCharLength: t.minMatchCharLength,
-				isCaseSensitive: t.isCaseSensitive,
-				ignoreDiacritics: t.ignoreDiacritics,
-				ignoreLocation: !0
-			}));
-			let n = r.get(e) || 0, a = Math.log(1 + (i - n + .5) / (n + .5));
-			this.idfWeights.push(a);
-		}
-		this.combineAll = t.tokenMatch === "all", this.numTerms = this.termSearchers.length, this.useMask = this.numTerms <= 31;
-	}
-	searchIn(e) {
-		if (!this.termSearchers.length) return {
-			isMatch: !1,
-			score: 1
-		};
-		let t = [], n = 0, r = 0, i = 0, a = 0, o = this.combineAll && !this.useMask ? /* @__PURE__ */ new Set() : null;
-		for (let s = 0; s < this.termSearchers.length; s++) {
-			let c = this.termSearchers[s].searchIn(e), l = this.idfWeights[s];
-			r += l, c.isMatch && (i++, n += l * (1 - c.score), c.indices && t.push(...c.indices), this.combineAll && (this.useMask ? a |= 1 << s : o.add(s)));
-		}
-		if (i === 0) return {
-			isMatch: !1,
-			score: 1
-		};
-		let s = r > 0 ? 1 - n / r : 0, c = {
-			isMatch: !0,
-			score: Math.max(.001, s)
-		};
-		return this.options.includeMatches && t.length && (c.indices = x(t)), this.combineAll && (this.useMask ? c.matchedMask = a : c.matchedTerms = o, c.termCount = this.numTerms), c;
-	}
-}), Y.use = function(...e) {
-	e.forEach((e) => M(e));
-};
-var X = Y;
-export { X as default };