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

package/browser/esm/Dic2cHiohtgkK2jT.mjs

@@ -0,0 +1,89 @@
+/**
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.11
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+var e = class {
+	constructor(e) {
+		this._worker = null, this._nextId = 1, this._pendingRequests = /* @__PURE__ */ new Map(), this._workerFactory = e;
+	}
+	start() {
+		if (typeof Worker > "u") throw Error("Web Workers are not supported in this environment.");
+		return this._worker || (this._worker = this._workerFactory(), this._worker.onmessage = (e) => {
+			let { id: t, result: n, error: r } = e.data, i = this._pendingRequests.get(t);
+			if (i) {
+				if (this._pendingRequests.delete(t), r) {
+					let e = Error(r.message);
+					e.stack = r.stack, r.cause && (e.cause = r.cause), i.reject(e);
+				} else i.resolve(n);
+			}
+		}, this._worker.onerror = (e) => {
+			console.error("Worker error:", e), this._pendingRequests.forEach((t) => {
+				t.reject(/* @__PURE__ */ Error(`Worker failed: ${e.message}`));
+			}), this._pendingRequests.clear(), this._worker = null;
+		}), Promise.resolve();
+	}
+	execute(e) {
+		if (!this._worker) throw Error("Worker is not initialized. Call start() first.");
+		let t = this._nextId++;
+		return new Promise((n, r) => {
+			this._pendingRequests.set(t, {
+				resolve: n,
+				reject: r
+			}), this._worker.postMessage({
+				id: t,
+				params: e
+			});
+		});
+	}
+	terminate() {
+		this._worker &&= (this._worker.terminate(), null);
+	}
+}, t = class {
+	constructor(e) {
+		this._onExecute = e;
+	}
+	execute(e) {
+		return this._onExecute(e);
+	}
+	start() {
+		return Promise.resolve();
+	}
+	terminate() {}
+}, n = "var bt = Object.defineProperty, tr = (e, t, r) => () => {\n	if (r) throw r[0];\n	try {\n		return e && (t = e(e = 0)), t;\n	} catch (n) {\n		throw r = [n], n;\n	}\n}, rr = (e, t) => {\n	let r = {};\n	for (var n in e) bt(r, n, {\n		get: e[n],\n		enumerable: !0\n	});\n	return t || bt(r, Symbol.toStringTag, { value: \"Module\" }), r;\n}, vt = Object.defineProperty, ge = (e, t) => {\n	let r = {};\n	for (var n in e) vt(r, n, {\n		get: e[n],\n		enumerable: !0\n	});\n	return t || vt(r, Symbol.toStringTag, { value: \"Module\" }), r;\n}, oe = {\n	Column: \"column\",\n	Row: \"row\"\n};\n({ ...oe });\nfunction ze(e, t) {\n	if (e === t) return !0;\n	if (e && t && typeof e == \"object\" && typeof t == \"object\") {\n		if (e.constructor !== t.constructor) return !1;\n		let r, n, i;\n		if (Array.isArray(e)) {\n			if (r = e.length, r != t.length) return !1;\n			for (n = r; n-- !== 0;) if (!ze(e[n], t[n])) return !1;\n			return !0;\n		}\n		if (e instanceof Map && t instanceof Map) {\n			if (e.size !== t.size) return !1;\n			for (n of e.entries()) if (!t.has(n[0])) return !1;\n			for (n of e.entries()) if (!ze(n[1], t.get(n[0]))) return !1;\n			return !0;\n		}\n		if (e instanceof Set && t instanceof Set) {\n			if (e.size !== t.size) return !1;\n			for (n of e.entries()) if (!t.has(n[0])) return !1;\n			return !0;\n		}\n		if (ArrayBuffer.isView(e) && ArrayBuffer.isView(t)) {\n			if (r = e.length, r != t.length) return !1;\n			for (n = r; n-- !== 0;) if (e[n] !== t[n]) return !1;\n			return !0;\n		}\n		if (e.constructor === RegExp) return e.source === t.source && e.flags === t.flags;\n		if (e.valueOf !== Object.prototype.valueOf) return e.valueOf() === t.valueOf();\n		if (e.toString !== Object.prototype.toString) return e.toString() === t.toString();\n		if (i = Object.keys(e), r = i.length, r !== Object.keys(t).length) return !1;\n		for (n = r; n-- !== 0;) if (!Object.prototype.hasOwnProperty.call(t, i[n])) return !1;\n		for (n = r; n-- !== 0;) {\n			let o = i[n];\n			if ((o !== \"_owner\" || !e.$$typeof) && !ze(e[o], t[o])) return !1;\n		}\n		return !0;\n	}\n	return e != e && t != t;\n}\nfunction an(e) {\n	let t = Object.prototype.toString.call(e);\n	return t === \"[object RegExp]\" || t === \"[object Date]\" || (function(r) {\n		return r.$$typeof === ln;\n	})(e);\n}\nvar ln = typeof Symbol == \"function\" && Symbol.for ? /* @__PURE__ */ Symbol.for(\"react.element\") : 60103;\nfunction sn(e) {\n	return /* @__PURE__ */ (function(t) {\n		return !!t && typeof t == \"object\";\n	})(e) && !an(e);\n}\nfunction Le(e, t) {\n	return t.clone !== !1 && t.isMergeableObject(e) ? ve((r = e, Array.isArray(r) ? [] : {}), e, t) : e;\n	var r;\n}\nfunction cn(e, t, r) {\n	return e.concat(t).map(function(n) {\n		return Le(n, r);\n	});\n}\nfunction Et(e) {\n	return Object.keys(e).concat((function(t) {\n		return Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols(t).filter(function(r) {\n			return Object.propertyIsEnumerable.call(t, r);\n		}) : [];\n	})(e));\n}\nfunction _t(e, t) {\n	try {\n		return t in e;\n	} catch {\n		return !1;\n	}\n}\nfunction un(e, t, r) {\n	let n = {};\n	return r.isMergeableObject(e) && Et(e).forEach(function(i) {\n		n[i] = Le(e[i], r);\n	}), Et(t).forEach(function(i) {\n		(function(o, l) {\n			return _t(o, l) && !(Object.hasOwnProperty.call(o, l) && Object.propertyIsEnumerable.call(o, l));\n		})(e, i) || (_t(e, i) && r.isMergeableObject(t[i]) ? n[i] = (function(o, l) {\n			if (!l.customMerge) return ve;\n			let s = l.customMerge(o);\n			return typeof s == \"function\" ? s : ve;\n		})(i, r)(e[i], t[i], r) : n[i] = Le(t[i], r));\n	}), n;\n}\nfunction ve(e, t, r) {\n	(r ||= {}).arrayMerge = r.arrayMerge || cn, r.isMergeableObject = r.isMergeableObject || sn, r.cloneUnlessOtherwiseSpecified = Le;\n	let n = Array.isArray(t);\n	return n === Array.isArray(e) ? n ? r.arrayMerge(e, t, r) : un(e, t, r) : Le(t, r);\n}\nve.all = function(e, t) {\n	if (!Array.isArray(e)) throw Error(\"first argument should be an array\");\n	return e.reduce(function(r, n) {\n		return ve(r, n, t);\n	}, {});\n};\nvar nr = ge({\n	DonePromise: () => fn,\n	EmptyArray: () => ke,\n	EmptyObject: () => dn,\n	OSType: () => fe,\n	arrayMove: () => Rn,\n	asNumber: () => gn,\n	camelToPrettyCase: () => mn,\n	castToString: () => $n,\n	cloneObject: () => bn,\n	consoleWithNoSource: () => Un,\n	deepEqual: () => ze,\n	deepFreeze: () => fr,\n	deepMerge: () => ve,\n	diffValues: () => Cn,\n	findEqualOrGreater: () => In,\n	findEqualOrLesser: () => An,\n	getFromPath: () => Fn,\n	getPlatform: () => He,\n	isDefined: () => Nn,\n	isEmpty: () => Ln,\n	isEqualArrays: () => or,\n	isEqualBounds: () => En,\n	isNullOrUndefined: () => ur,\n	isNumeric: () => yn,\n	isObject: () => Me,\n	isPromiseLike: () => kn,\n	isRectInsideRect: () => Mn,\n	isRectIntersect: () => dr,\n	mergeContentful: () => Tn,\n	removeEmptyProperties: () => ar,\n	removeEqualValues: () => sr,\n	removeEqualValuesLayered: () => cr,\n	removeListenerAll: () => _n,\n	roundAccurately: () => Sn,\n	setToPath: () => Dn,\n	splitNumber: () => wn,\n	subtractRect: () => On,\n	textToKey: () => hn,\n	toSafeJSON: () => st,\n	transpose: () => xn,\n	uuidV4: () => Ve,\n	validEnumValue: () => pn\n}), ke = Object.freeze([]), dn = Object.freeze({}), fn = Promise.resolve(), ir = (e) => e;\nfunction pn(e, t) {\n	if (!Object.values(e).includes(t)) throw Error(`Invalid type: ${t ?? \"null\"}. Must be one of: ${Object.values(e).join(\", \")}.`);\n}\nfunction mn(e) {\n	return e ? e.replace(/([a-z0-9])([A-Z])/g, \"$1 $2\").replace(/([A-Z]+)([A-Z][a-z])/g, \"$1 $2\").replace(/^./, (t) => t.toUpperCase()) : \"\";\n}\nfunction hn(e) {\n	return e.replace(/[^a-zA-Z0-9]/g, \"\").toLowerCase();\n}\nvar le = Array.from({ length: 256 }, (e, t) => (t + 256).toString(16).slice(1));\nfunction Ve() {\n	let e = globalThis.crypto;\n	if (e?.randomUUID) return e.randomUUID();\n	if (e?.getRandomValues) {\n		let t = e.getRandomValues(/* @__PURE__ */ new Uint8Array(16));\n		return t[6] = 15 & t[6] | 64, t[8] = 63 & t[8] | 128, le[t[0]] + le[t[1]] + le[t[2]] + le[t[3]] + \"-\" + le[t[4]] + le[t[5]] + \"-\" + le[t[6]] + le[t[7]] + \"-\" + le[t[8]] + le[t[9]] + \"-\" + le[t[10]] + le[t[11]] + le[t[12]] + le[t[13]] + le[t[14]] + le[t[15]];\n	}\n	return \"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx\".replace(/[xy]/g, function(t) {\n		let r = 16 * Math.random() | 0;\n		return (t === \"x\" ? r : 3 & r | 8).toString(16);\n	});\n}\nfunction gn(e) {\n	let t = (function(r) {\n		return 1 * r;\n	})(e);\n	return Number.isFinite(t) ? t : 0;\n}\nfunction yn(e) {\n	let t = 1 * e;\n	return Number.isFinite(t) && typeof t == \"number\";\n}\nvar qe = [\n	1,\n	10,\n	100,\n	1e3,\n	1e4,\n	1e5,\n	1e6,\n	1e7,\n	1e8,\n	1e9,\n	1e10,\n	1e11,\n	0xe8d4a51000,\n	0x9184e72a000,\n	0x5af3107a4000,\n	0x38d7ea4c68000,\n	0x2386f26fc10000\n];\nfunction wn(e) {\n	let t = Math.abs(e);\n	if (!Number.isFinite(t)) return null;\n	let r = Math.trunc(t), n = t - r, i;\n	r > 2 ** 53 - 1 ? i = Number(r.toExponential().split(\"e\")[1]) + 1 : (i = Math.ceil(Math.log10(r + 1)), qe[i] <= r && i++);\n	let o = 0, l = 0, s = 15 - i;\n	if (n > 0 && s > 0) {\n		let c = qe[s];\n		if (o = Math.round(n * c), o === c) r++, o = 0, r >= qe[i] && i++;\n		else if (o > 0) for (l = s; o % 10 == 0;) o /= 10, l--;\n	}\n	return {\n		ip: e < 0 ? -r : r,\n		fp: o,\n		ipLength: i,\n		fpLength: l\n	};\n}\nfunction Sn(e, t = 0) {\n	if (e == null || !isFinite(e)) return null;\n	let r = 10 ** t;\n	return Number(Math.round(e * r) / r);\n}\nfunction bn(e) {\n	return ur(e) ? e : JSON.parse(JSON.stringify(e));\n}\nvar vn = (e, t) => e === t;\nfunction or(e, t, r) {\n	if (e === t) return !0;\n	if (!Array.isArray(e) || !Array.isArray(t) || e.length !== t.length) return !1;\n	r ||= vn;\n	let n = e.length;\n	for (let i = 0; i < n; i++) if (!r(e[i], t[i])) return !1;\n	return !0;\n}\nfunction En(e, t) {\n	return e === t || !(!e || !t) && e.x === t.x && e.y === t.y && e.width === t.width && e.height === t.height;\n}\nfunction Me(e) {\n	return typeof e == \"object\" && !Array.isArray(e) && e !== null;\n}\nfunction ar(e) {\n	if (typeof e != \"object\" || Array.isArray(e) || e === null) return e;\n	let t = e;\n	return Object.keys(t).forEach(function(r) {\n		t[r] && typeof t[r] == \"object\" ? ar(t[r]) : t[r] !== null && t[r] !== void 0 || delete t[r], typeof t[r] == \"object\" && Object.keys(t[r]).length === 0 && delete t[r];\n	}), Object.keys(e).length === 0 ? null : e;\n}\nfunction _n(e, t) {\n	if (!e) return ke;\n	let r = e.length;\n	for (let n = 0; n < r; n++) {\n		let i = e[n];\n		i && i(t);\n	}\n	return ke;\n}\nfunction xn(e) {\n	if (!e) return e;\n	let t = e.length, r = e[0].length, n = [];\n	for (let i = 0; i < r; i++) n[i] = Array(t);\n	for (let i = 0; i < t; i++) {\n		let o = e[i];\n		for (let l = 0; l < r; l++) n[l][i] = o[l];\n	}\n	return n;\n}\nvar lr = (e, t) => !(e !== t && !or(e, t)) || !!e.isEqual?.(t);\nfunction sr(e, t, r = lr) {\n	if (e == null || e === t) return null;\n	if (!e || typeof e != \"object\" || Array.isArray(e) || e.isImmutable?.()) return r(e, t) ? null : e;\n	let n = Object.keys(e), i = n.length;\n	if (i === 0) return null;\n	let o = !1;\n	for (let l = 0; l < i; l++) {\n		let s = n[l];\n		sr(e[s], t?.[s], r) === null && (o = !0, delete e[s]);\n	}\n	return o && Object.keys(e).length === 0 ? null : void 0;\n}\nfunction cr(e, t, r = lr) {\n	if (e == null) return !0;\n	if (!e || typeof e != \"object\" || Array.isArray(e) || e.isImmutable?.()) {\n		let s, c = !1;\n		for (let d = 0; !c && d < t.length; d++) t[d] !== void 0 && (c = !0, s = t[d]);\n		return c && (e === s || r(e, s));\n	}\n	let n = Object.keys(e), i = n.length;\n	if (i === 0) return !0;\n	let o = t.length, l = !1;\n	for (let s = 0; s < i; s++) {\n		let c = n[s], d = [];\n		for (let m = 0; m < o; m++) {\n			let a = t[m]?.[c];\n			a !== void 0 && d.push(a);\n		}\n		cr(e[c], d, r) && (l = !0, delete e[c]);\n	}\n	return l && Object.keys(e).length === 0;\n}\nfunction Tn(...e) {\n	let t = e.length;\n	if (t > 0 && e[t - 1] !== void 0 && !Me(e[t - 1])) return e[t - 1];\n	let r = e[0] || {};\n	for (let n = 1; n < t; n++) r = ve(r, e[n] || {}, { arrayMerge: (i, o) => [...o] });\n	return r;\n}\nfunction Cn(e, t) {\n	let r = {}, n = Object.keys(t), i = n.length;\n	for (let o = 0; o < i; o++) {\n		let l = n[o], s = e[l], c = t[l];\n		s !== c && (r[l] = s === void 0 ? c : s);\n	}\n	return Object.keys(r).length === 0 ? null : r;\n}\nfunction In(e, t, r = ir) {\n	let n = 0, i = e.length - 1;\n	for (; n <= i;) {\n		let o = Math.floor((n + i) / 2), l = r(e[o]);\n		if (l === t) return o;\n		l < t ? n = o + 1 : i = o - 1;\n	}\n	return n;\n}\nfunction An(e, t, r = ir) {\n	let n = e.length - 1, i = 0;\n	for (; n >= i;) {\n		let o = Math.floor((n + i) / 2), l = r(e[o]);\n		if (l === t) return o;\n		l > t ? n = o - 1 : i = o + 1;\n	}\n	return n;\n}\nfunction Rn(e, t, r) {\n	let n = e.slice();\n	return n.splice(r < 0 ? n.length + r : r, 0, n.splice(t, 1)[0]), n;\n}\nfunction $n(e) {\n	return e == null || e === void 0 ? \"\" : typeof e == \"string\" ? e : \"\" + e;\n}\nfunction ur(e) {\n	return e == null;\n}\nfunction Nn(e) {\n	return e != null;\n}\nfunction Ln(e) {\n	return e == null || e === \"\";\n}\nfunction kn(e) {\n	return !!e && typeof e.then == \"function\";\n}\nfunction dr(e, t) {\n	return !(t.left > e.right || t.right < e.left || t.top > e.bottom || t.bottom < e.top);\n}\nfunction Mn(e, t) {\n	return e.top >= t.top && e.bottom <= t.bottom && e.left >= t.left && e.right <= t.right;\n}\nfunction On(e, t, r = !1) {\n	if (!t) return [e];\n	if (!dr(e, t)) return [];\n	let n = [], i = e, o = () => {\n		t.top > i.top && t.top < i.bottom && (n.push({\n			...i,\n			bottom: t.top\n		}), i = {\n			...i,\n			top: t.top\n		});\n	}, l = () => {\n		t.bottom > i.top && t.bottom < i.bottom && (n.push({\n			...i,\n			top: t.bottom\n		}), i = {\n			...i,\n			bottom: t.bottom\n		});\n	}, s = () => {\n		t.right > i.left && t.right < i.right && (n.push({\n			...i,\n			left: t.right\n		}), i = {\n			...i,\n			right: t.right\n		});\n	}, c = () => {\n		t.left > i.left && t.left < i.right && (n.push({\n			...i,\n			right: t.left\n		}), i = {\n			...i,\n			left: t.left\n		});\n	};\n	return r ? (c(), s(), o(), l()) : (o(), l(), s(), c()), n;\n}\nfunction Fn(e, t) {\n	let r = t.split(\".\"), n = e, i = r.length;\n	for (let o = 0; o < i; o++) {\n		let l = r[o];\n		if (!n) return null;\n		let s = n[l];\n		if (typeof s == \"function\" && (s = s.bind(n)()), !s || !Me(s)) return s;\n		n = s;\n	}\n	return n ?? null;\n}\nfunction Dn(e, t, r) {\n	let n = t.split(\".\"), i = e;\n	if (!i) throw Error(\"Can not set path to a null path.\");\n	let o = n.length;\n	for (let l = 0; i && l < o - 1; l++) {\n		let s = n[l], c = i[s];\n		if (c ?? (c = {}, i[s] = c), !Me(c)) throw Error(\"Can not set path to a non object path.\");\n		i = c;\n	}\n	if (typeof r != \"number\" && typeof r != \"boolean\" && typeof r != \"string\" && !Me(r)) throw Error(`Can not set path to ${r} that is not a a supported primitive.`);\n	return i[n[o - 1]] = r, e;\n}\nfunction Un(...e) {\n	return new Promise((t) => {\n		setTimeout(() => {\n			Function(\"console.log.apply(console, arguments)\").apply(null, e), t();\n		});\n	});\n}\nvar fe = {\n	Windows: \"windows\",\n	MacOS: \"macos\",\n	IOS: \"ios\",\n	Linux: \"linux\",\n	Android: \"android\",\n	Safari: \"safari\",\n	Firefox: \"firefox\",\n	Unknown: \"unknown\"\n};\nfunction He() {\n	let e = globalThis.navigator !== void 0 && globalThis.navigator.userAgent ? globalThis.navigator.userAgent.toLowerCase() : \"\";\n	return e ? /(win32|win64|windows|wince)/i.test(e) ? fe.Windows : /(macintosh|macintel|macppc|mac68k|macos)/i.test(e) ? fe.MacOS : /(iphone|ipad|ipod)/i.test(e) ? fe.IOS : /android/.test(e) ? fe.Android : /linux/.test(e) ? fe.Linux : /^((?!chrome|android|).)*safari/i.test(e) ? fe.Safari : /^((?!chrome|android|Seamonkey).)*firefox/i.test(e) ? fe.Firefox : fe.Unknown : fe.Unknown;\n}\nfunction fr(e) {\n	Object.freeze(e);\n	let t = e;\n	return Object.keys(t).forEach((r) => {\n		typeof t[r] != \"object\" || t[r] === null || Object.isFrozen(t[r]) || fr(t[r]);\n	}), e;\n}\nfunction st(e) {\n	if (typeof e != \"object\" || !e) return e;\n	if (typeof e.toJSON == \"function\") return e.toJSON();\n	if (Array.isArray(e)) return e.map((r) => st(r));\n	if (typeof e.toString == \"function\" && e.toString !== Object.prototype.toString) return e.toString();\n	let t = {};\n	for (let r in e) e.hasOwnProperty(r) && (t[r] = st(e[r]));\n	return t;\n}\nge({\n	EmptyCell: () => pr,\n	EmptyRange: () => Bn,\n	EmptyRanges: () => Pn,\n	EmptySelection: () => jn,\n	InsertCutShift: () => be,\n	cellToRange: () => Vn,\n	classifyInsertCut: () => ei,\n	columnFirstCellComparator: () => wr,\n	columnFirstRangeComparator: () => mr,\n	createCellComparator: () => _r,\n	createConflatingRanges: () => Qn,\n	createRangeComparator: () => Er,\n	defaultRange: () => Yn,\n	extendRangeToIntersectingRanges: () => Rr,\n	extendRangeToUnionRanges: () => Hn,\n	intersectRanges: () => Ir,\n	isCellWithinRange: () => Kn,\n	isEqualCells: () => xr,\n	isEqualRanges: () => mt,\n	isEqualRangesArrays: () => Cr,\n	isEqualSelectionCoords: () => Ar,\n	isRangeWithinRange: () => Tr,\n	isRangesIntersect: () => ht,\n	isRefusedInsertCut: () => ti,\n	isSingleCell: () => zn,\n	isValidRange: () => Gn,\n	mergeRangeCoordValues: () => Nr,\n	reverseColumnFirstCellComparator: () => vr,\n	reverseColumnFirstRangeComparator: () => yr,\n	reverseRowFirstCellComparator: () => br,\n	reverseRowFirstRangeComparator: () => gr,\n	rowFirstCellComparator: () => Sr,\n	rowFirstRangeComparator: () => hr,\n	sanitizeRange: () => $r,\n	sanitizeRangeArray: () => Jn,\n	translateRange: () => Wn,\n	unionRanges: () => ct,\n	unionRangesArrays: () => Xn\n});\nvar pr = Object.freeze({\n	colIndex: 0,\n	rowIndex: 0\n}), Bn = Object.freeze({\n	colStart: 0,\n	rowStart: 0,\n	colEnd: 0,\n	rowEnd: 0\n}), Pn = ke, jn = Object.freeze({\n	cell: pr,\n	ranges: ke,\n	rangeIndex: -1\n});\nfunction mr(e, t) {\n	return e.colStart === t.colStart ? e.rowStart - t.rowStart : e.colStart - t.colStart;\n}\nfunction hr(e, t) {\n	return e.rowStart === t.rowStart ? e.colStart - t.colStart : e.rowStart - t.rowStart;\n}\nfunction gr(e, t) {\n	return e.rowEnd === t.rowEnd ? t.colEnd - e.colEnd : t.rowEnd - e.rowEnd;\n}\nfunction yr(e, t) {\n	return e.colEnd === t.colEnd ? t.rowEnd - e.rowEnd : t.colEnd - e.colEnd;\n}\nfunction wr(e, t) {\n	return e.colIndex === t.colIndex ? e.rowIndex - t.rowIndex : e.colIndex - t.colIndex;\n}\nfunction Sr(e, t) {\n	return e.rowIndex === t.rowIndex ? e.colIndex - t.colIndex : e.rowIndex - t.rowIndex;\n}\nfunction br(e, t) {\n	return e.rowIndex === t.rowIndex ? t.colIndex - e.colIndex : t.rowIndex - e.rowIndex;\n}\nfunction vr(e, t) {\n	return e.colIndex === t.colIndex ? t.rowIndex - e.rowIndex : t.colIndex - e.colIndex;\n}\nfunction Er(e = oe.Row, t = !1) {\n	return t ? e === oe.Column ? yr : gr : e === oe.Column ? mr : hr;\n}\nfunction _r(e = oe.Row, t = !1) {\n	return t ? e === oe.Column ? vr : br : e === oe.Column ? wr : Sr;\n}\nfunction xr(e, t) {\n	return e === t || !(!e || !t) && e.rowIndex === t.rowIndex && e.colIndex === t.colIndex && e.scope === t.scope;\n}\nfunction mt(e, t) {\n	return e === t || !(!e || !t) && e.rowStart === t.rowStart && e.rowEnd === t.rowEnd && e.colStart === t.colStart && e.colEnd === t.colEnd && e.scope === t.scope;\n}\nfunction Kn(e, t) {\n	if (!e || !t) return !1;\n	let r = e.rowIndex;\n	if (r < t.rowStart || r > t.rowEnd) return !1;\n	let n = e.colIndex;\n	return !(n < t.colStart || n > t.colEnd);\n}\nfunction Tr(e, t) {\n	return !(!e || !t) && !(e.rowStart < t.rowStart || e.rowEnd > t.rowEnd) && !(e.colStart < t.colStart || e.colEnd > t.colEnd);\n}\nfunction ht(e, t) {\n	return !(!e || !t) && !(e.colStart > t.colEnd || t.colStart > e.colEnd) && !(e.rowStart > t.rowEnd || t.rowStart > e.rowEnd);\n}\nfunction Cr(e, t) {\n	if (e === t) return !0;\n	if (!e || !t || e.length !== t.length) return !1;\n	for (let r = 0; r < e.length; r++) if (!mt(e[r], t[r])) return !1;\n	return !0;\n}\nfunction zn(e) {\n	return !!e && e.rowEnd === e.rowStart && e.colStart === e.colEnd;\n}\nfunction Vn(e, t) {\n	if (!e) return null;\n	let r = t;\n	return r || (r = { ...e }, delete r.colIndex, delete r.rowIndex), r.colStart = e.colIndex ?? 0, r.rowStart = e.rowIndex ?? 0, r.colEnd = e.colIndex ?? 0, r.rowEnd = e.rowIndex ?? 0, r;\n}\nfunction Ir(e, t, r) {\n	if (!e) return r ? t : { ...t };\n	if (!t) return r ? e : { ...e };\n	if (!e && !t || e.rowStart > t.rowEnd || e.rowEnd < t.rowStart || e.colStart > t.colEnd || e.colEnd < t.colStart) return null;\n	let n = Math.max(e.colStart, t.colStart), i = Math.max(e.rowStart, t.rowStart), o = Math.min(e.colEnd, t.colEnd), l = Math.min(e.rowEnd, t.rowEnd), s = r;\n	return s ? (s.colStart = n, s.rowStart = i, s.colEnd = o, s.rowEnd = l) : s = {\n		colStart: n,\n		rowStart: i,\n		colEnd: o,\n		rowEnd: l\n	}, s;\n}\nfunction ct(e, t, r) {\n	if (!e && !t) return null;\n	if (!e) return r ? t : { ...t };\n	if (!t) return r ? e : { ...e };\n	let n = Math.min(e.colStart, t.colStart), i = Math.min(e.rowStart, t.rowStart), o = Math.max(e.colEnd, t.colEnd), l = Math.max(e.rowEnd, t.rowEnd), s = r;\n	return s ? (s.colStart = n, s.rowStart = i, s.colEnd = o, s.rowEnd = l) : s = {\n		colStart: n,\n		rowStart: i,\n		colEnd: o,\n		rowEnd: l\n	}, s;\n}\nfunction Ar(e, t) {\n	return e === t || !(!e || !t) && e.rangeIndex === t.rangeIndex && !!xr(e.cell, t.cell) && Cr(e.ranges, t.ranges);\n}\nfunction Xn(e, t, r) {\n	if (!e || e.length === 0) return null;\n	if (e.length === 1 && !t) return e[0];\n	let n = e[0];\n	for (let i = 1; i < e.length; i++) n = ct(n, e[i], r);\n	return t && (n = ct(n, t, r)), n;\n}\nfunction Gn(e) {\n	return !!e && !(typeof e.colStart != \"number\" || e.colStart < 0) && !(typeof e.colEnd != \"number\" || e.colEnd < e.colStart) && !(typeof e.rowStart != \"number\" || e.rowStart < 0) && !(typeof e.rowEnd != \"number\" || e.rowEnd < e.rowStart);\n}\nfunction Hn(e, t) {\n	if (!t || t.length === 0) return e;\n	let r = e, n = null;\n	for (; !mt(r, n);) n = r, r = Rr(n, t);\n	return r;\n}\nfunction Rr(e, t) {\n	if (!t || t.length === 0) return e;\n	let r = { ...e };\n	for (let n = 0; n < t.length; n++) {\n		let i = t[n];\n		ht(r, i) && (r.rowStart = Math.min(r.rowStart, i.rowStart), r.colStart = Math.min(r.colStart, i.colStart), r.rowEnd = Math.max(r.rowEnd, i.rowEnd), r.colEnd = Math.max(r.colEnd, i.colEnd));\n	}\n	return r;\n}\nfunction Wn(e, t = -e.rowStart, r = -e.colStart, n) {\n	return n ? (n.colStart = e.colStart + r, n.rowStart = e.rowStart + t, n.colEnd = e.colEnd + r, n.rowEnd = e.rowEnd + t, n) : {\n		colStart: e.colStart + r,\n		rowStart: e.rowStart + t,\n		colEnd: e.colEnd + r,\n		rowEnd: e.rowEnd + t\n	};\n}\nfunction $r(e, t) {\n	return e ? e.scope ? {\n		colStart: e.colIndex ?? e.colStart ?? t?.colStart ?? 0,\n		rowStart: e.rowIndex ?? e.rowStart ?? t?.rowStart ?? 0,\n		colEnd: e.colIndex ?? e.colEnd ?? t?.colEnd ?? 0,\n		rowEnd: e.rowIndex ?? e.rowEnd ?? t?.rowEnd ?? 0,\n		scope: e.scope\n	} : {\n		colStart: e.colIndex ?? e.colStart ?? t?.colStart ?? 0,\n		rowStart: e.rowIndex ?? e.rowStart ?? t?.rowStart ?? 0,\n		colEnd: e.colIndex ?? e.colEnd ?? t?.colEnd ?? 0,\n		rowEnd: e.rowIndex ?? e.rowEnd ?? t?.rowEnd ?? 0\n	} : null;\n}\nfunction Jn(e, t) {\n	if (!e) return null;\n	let r = e.length, n = Array(r);\n	for (let i = 0; i < r; i++) n[i] = $r(e[i], t);\n	return n;\n}\nfunction Yn(e, t, r) {\n	return e ? r ? (r.colStart = e.colStart ?? t.colStart, r.rowStart = e.rowStart ?? t.rowStart, r.colEnd = e.colEnd ?? t.colEnd, r.rowEnd = e.rowEnd ?? t.rowEnd, r) : {\n		colStart: e.colStart ?? t.colStart,\n		rowStart: e.rowStart ?? t.rowStart,\n		colEnd: e.colEnd ?? t.colEnd,\n		rowEnd: e.rowEnd ?? t.rowEnd\n	} : t;\n}\nvar qn = [null, null], Zn = (e, t, r) => {\n	if (e[0].value === e[1].value) return t;\n};\nfunction Nr(e, t = 2, r, n = oe.Row, i) {\n	let o = [...e];\n	if (t <= 0 || e.length <= 1) return o;\n	let l = n === oe.Column, s = 0, c = !1;\n	do {\n		let d = o.sort(Er(l ? oe.Row : oe.Column));\n		o = [], o.push(d[0]);\n		let m = d.length, a = 0, f = d[0], b = f.colStart, v = f.rowStart, A = f.colEnd, U = f.rowEnd;\n		for (let h = 1; h < m; h++) {\n			let w = d[h], S = !1;\n			if (S = l ? f && v === w.rowStart && U === w.rowEnd && A + 1 === w.colStart : f && b === w.colStart && A === w.colEnd && U + 1 === w.rowStart, S) {\n				let F = {\n					colStart: b,\n					rowStart: v,\n					colEnd: l ? w.colEnd : A,\n					rowEnd: l ? U : w.rowEnd\n				};\n				if (f.value !== void 0 && (F.value = f.value), r) {\n					let z = i ?? [null, null];\n					z[0] = f, z[1] = w, F = r(z, F, n);\n				}\n				if (F) {\n					o[a] = F, c = !0, f = F, b = f.colStart, v = f.rowStart, A = f.colEnd, U = f.rowEnd;\n					continue;\n				}\n			}\n			o[++a] = w, f = w, b = f.colStart, v = f.rowStart, A = f.colEnd, U = f.rowEnd;\n		}\n		s++, l = !l, s === 1 && (c = !0);\n	} while (s < t && c && o.length > 1);\n	return o;\n}\nfunction Qn(e, t = !1) {\n	let r = [], n, i = null, o = -(2 ** 53 - 1), l = -(2 ** 53 - 1);\n	return {\n		append: (s, c, d) => {\n			let m = !0, a = d !== void 0;\n			if (a) {\n				let v = e ? e(n, d, t) : n === d ? d : void 0;\n				v === void 0 ? m = !1 : d = v;\n			}\n			if (m && c === l + 1 && s === o) return t ? i.rowEnd = c : i.colEnd = c, l = c, void (n = d);\n			i && r.push(i);\n			let f = t ? s : c, b = t ? c : s;\n			i = {\n				colStart: f,\n				rowStart: b,\n				colEnd: f,\n				rowEnd: b\n			}, a && (i.value = d), o = s, l = c, n = d;\n		},\n		done: (s) => (i &&= (r.push(i), null), s ? Nr(r, 3, s === !0 ? Zn : s, t ? oe.Column : oe.Row, qn) : r)\n	};\n}\nvar be = {\n	Close: \"close\",\n	Blank: \"blank\",\n	Inside: \"inside\",\n	Tear: \"tear\"\n};\nfunction ei(e, t, r) {\n	let n = r === oe.Row;\n	return (n ? e.colStart === t.colStart && e.colEnd === t.colEnd : e.rowStart === t.rowStart && e.rowEnd === t.rowEnd) ? (n ? t.rowStart > e.rowStart && t.rowStart <= e.rowEnd : t.colStart > e.colStart && t.colStart <= e.colEnd) ? be.Inside : be.Close : (n ? e.rowEnd >= t.rowStart && e.colStart <= t.colEnd && e.colEnd >= t.colStart : e.colEnd >= t.colStart && e.rowStart <= t.rowEnd && e.rowEnd >= t.rowStart) ? be.Tear : be.Blank;\n}\nfunction ti(e) {\n	return e === be.Inside || e === be.Tear;\n}\nvar Z = {\n	Up: \"up\",\n	Down: \"down\",\n	Left: \"left\",\n	Right: \"right\"\n}, J = {\n	Html: \"text/html\",\n	Plain: \"text/plain\",\n	Png: \"image/png\"\n};\nge({\n	findNextCellWithinSelection: () => Lr,\n	traverseHiddenHeaders: () => de\n});\nfunction de(e, t, r, n) {\n	if (!e) return t;\n	let i = t, o = r === Z.Right || r === Z.Down;\n	for (;;) {\n		let l = e(i, !o);\n		if (l === 0) return i;\n		let s = o ? i + l : i - l;\n		if (n !== void 0 && (o ? s > n : s < n)) return n;\n		i = s;\n	}\n}\nfunction Lr(e, t = Z.Right, r, n, i, o = null) {\n	if (o && Ar(o, e)) return e;\n	let l = e.ranges, s = e.rangeIndex, c = l[s];\n	if (!ht({\n		rowStart: e.cell.rowIndex,\n		colStart: e.cell.colIndex,\n		rowEnd: e.cell.rowIndex,\n		colEnd: e.cell.colIndex\n	}, c)) return e;\n	let d = { ...e.cell }, m = s;\n	switch (t) {\n		case Z.Right:\n			d.colIndex = de(i, d.colIndex + 1, t, c.colEnd + 1);\n			break;\n		case Z.Left:\n			d.colIndex = de(i, d.colIndex - 1, t, c.colStart - 1);\n			break;\n		case Z.Down:\n			d.rowIndex = de(n, d.rowIndex + 1, t, c.rowEnd + 1);\n			break;\n		case Z.Up: d.rowIndex = de(n, d.rowIndex - 1, t, c.rowStart - 1);\n	}\n	let a = (v) => {\n		if (v) {\n			m = s >= l.length - 1 ? 0 : s + 1;\n			let A = l[m];\n			d = {\n				colIndex: A.colStart,\n				rowIndex: A.rowStart\n			};\n		} else {\n			m = s <= 0 ? l.length - 1 : s - 1;\n			let A = l[m];\n			d = {\n				colIndex: A.colEnd,\n				rowIndex: A.rowEnd\n			};\n		}\n	};\n	if (t === Z.Right && d.colIndex > c.colEnd && d.rowIndex === c.rowEnd) a(!0);\n	else if (t === Z.Left && d.colIndex < c.colStart && d.rowIndex === c.rowStart) a(!1);\n	else if (t === Z.Down && d.colIndex === c.colEnd && d.rowIndex > c.rowEnd) a(!0);\n	else if (t === Z.Up && d.colIndex === c.colStart && d.rowIndex < c.rowStart) a(!1);\n	else {\n		let v = d.rowIndex, A = d.colIndex;\n		switch (t) {\n			case Z.Right:\n				A > c.colEnd && (v = de(n, v + 1, t, c.rowEnd + 1), A = c.colStart, v > c.rowEnd && (v = c.rowStart));\n				break;\n			case Z.Left:\n				A < c.colStart && (v = de(n, v - 1, t, c.rowStart - 1), A = c.colEnd, v < c.rowStart && (v = c.rowEnd));\n				break;\n			case Z.Down:\n				v > c.rowEnd && (A = de(i, A + 1, t, c.colEnd + 1), v = c.rowStart, A > c.colEnd && (A = c.colStart));\n				break;\n			case Z.Up: v < c.rowStart && (A = de(i, A - 1, t, c.colStart - 1), v = c.rowEnd, A < c.colStart && (A = c.colEnd));\n		}\n		d = {\n			rowIndex: v,\n			colIndex: A\n		};\n	}\n	let f = r(d);\n	if (!Tr(f, c)) {\n		let v = Ir(f, c);\n		v && (f = v);\n	}\n	let b = {\n		rowStart: de(n, f.rowStart, Z.Down, f.rowEnd),\n		colStart: de(i, f.colStart, Z.Right, f.colEnd),\n		rowEnd: de(n, f.rowEnd, Z.Up, f.rowStart),\n		colEnd: de(i, f.colEnd, Z.Left, f.colStart)\n	};\n	if (b.rowStart !== d.rowIndex || b.colStart !== d.colIndex) {\n		switch (t) {\n			case Z.Right:\n				l[m].colStart === b.colStart && l[m].colEnd === b.colEnd && (d.rowIndex = b.rowEnd), d.colIndex = b.colEnd;\n				break;\n			case Z.Left:\n				l[m].colStart === b.colStart && l[m].colEnd === b.colEnd && (d.rowIndex = b.rowStart), d.rowIndex === b.rowStart ? d.colIndex = b.colStart + 1 : d.colIndex = b.colStart;\n				break;\n			case Z.Down:\n				l[m].rowStart === b.rowStart && l[m].rowEnd === b.rowEnd && (d.colIndex = b.colEnd), d.rowIndex = b.rowEnd;\n				break;\n			case Z.Up: l[m].rowStart === b.rowStart && l[m].rowEnd === b.rowEnd && (d.colIndex = b.colStart), d.colIndex === b.colStart ? d.rowIndex = b.rowStart + 1 : d.rowIndex = b.rowStart;\n		}\n		return Lr({\n			cell: d,\n			ranges: e.ranges,\n			rangeIndex: m\n		}, t, r, n, i, o ?? e);\n	}\n	return {\n		ranges: e.ranges,\n		cell: d,\n		rangeIndex: m\n	};\n}\nvar ri, Ae = (e, t) => {\n	if (e.length >= t) return e;\n	let r = new Int32Array(Math.max(t, 2 * e.length));\n	return r.set(e), r;\n}, Re = /* @__PURE__ */ new Int32Array(1024), Ze = (e) => (Re.length < e && (Re = new Int32Array(Math.max(e, 2 * Re.length))), Re.fill(0, 0, e), Re), ni = class {\n	constructor(e, t, r, n) {\n		this._nextOrder = 0, this._activeLen = 0, this._events = /* @__PURE__ */ new Int32Array(64), this._hasBand = !1, this._bandStart = 0, this._bandEnd = 0, this._rMinS = /* @__PURE__ */ new Int32Array(64), this._rMinE = /* @__PURE__ */ new Int32Array(64), this._rOff = /* @__PURE__ */ new Int32Array(65), this._rCount = 0, this._pool = /* @__PURE__ */ new Int32Array(256), this._overlaps = /* @__PURE__ */ new Int32Array(16), this._rInter = null, this._region = -1, this._major = 0, this._minor = 0, this._done = !1, this.rowStart = 0, this.rowEnd = 0, this.colStart = 0, this.colEnd = 0, this.cellRow = 0, this.cellCol = 0, this.intersection = null, this._isColumn = r, this._isReverse = n, this._store = e;\n		let i = e.count;\n		this._n = i;\n		let o = new Int32Array(i), l = new Int32Array(i), s = new Int32Array(i), c = new Int32Array(i), d = r ? e.colS : e.rowS, m = r ? e.colE : e.rowE, a = r ? e.rowS : e.colS, f = r ? e.rowE : e.colE;\n		for (let h = 0; h < i; h++) n ? (o[h] = -m[h], l[h] = -d[h], s[h] = -f[h], c[h] = -a[h]) : (o[h] = d[h], l[h] = m[h], s[h] = a[h], c[h] = f[h]);\n		this._M0 = o, this._M1 = l, this._m0 = s, this._m1 = c;\n		let b = r ? t.colStart : t.rowStart, v = r ? t.colEnd : t.rowEnd, A = v - b + 1, U = new Int32Array(i);\n		if (i < 256 || A > 16 * i) {\n			for (let h = 0; h < i; h++) U[h] = h;\n			U.sort((h, w) => o[h] - o[w] || h - w);\n		} else {\n			let h = n ? -v : b, w = Ze(A + 1);\n			for (let S = 0; S < i; S++) w[o[S] - h + 1]++;\n			for (let S = 1; S <= A; S++) w[S] += w[S - 1];\n			for (let S = 0; S < i; S++) U[w[o[S] - h]++] = S;\n		}\n		this._order = U, this._active = new Int32Array(Math.min(2 * i, 1024)), this._scratch = new Int32Array(this._active.length);\n	}\n	_stable(e) {\n		return this._isReverse ? this._n - 1 - e : e;\n	}\n	_compareEvents(e, t) {\n		let r = e >> 1, n = t >> 1, i = 1 & e, o = 1 & t, l = this._m0, s = this._m1, c = i ? s[r] : l[r], d = o ? s[n] : l[n];\n		if (c !== d) return c - d;\n		if (i !== o) return i - o;\n		let m = i ? l[r] : s[r], a = o ? l[n] : s[n];\n		return m === a ? this._stable(r) - this._stable(n) : m - a;\n	}\n	_sortEvents(e, t, r, n) {\n		let i = n - r + 1;\n		if (t < 256 || i > 16 * t) return e.subarray(0, t).sort((a, f) => this._compareEvents(a, f)), e;\n		let o = this._m0, l = this._m1, s = e, c = this._scratch;\n		c.length < t && (c = this._scratch = new Int32Array(t));\n		let d = Ze(i + 1);\n		for (let a = 0; a < t; a++) {\n			let f = s[a];\n			d[(1 & f ? o[f >> 1] : l[f >> 1]) - r + 1]++;\n		}\n		for (let a = 1; a <= i; a++) d[a] += d[a - 1];\n		for (let a = 0; a < t; a++) {\n			let f = s[a];\n			c[d[(1 & f ? o[f >> 1] : l[f >> 1]) - r]++] = f;\n		}\n		let m = 0;\n		for (let a = 0; a < t; a++) 1 & c[a] || (s[m++] = c[a]);\n		for (let a = 0; a < t; a++) 1 & ~c[a] || (s[m++] = c[a]);\n		d = Ze(i + 1);\n		for (let a = 0; a < t; a++) {\n			let f = s[a];\n			d[(1 & f ? l[f >> 1] : o[f >> 1]) - r + 1]++;\n		}\n		for (let a = 1; a <= i; a++) d[a] += d[a - 1];\n		for (let a = 0; a < t; a++) {\n			let f = s[a];\n			c[d[(1 & f ? l[f >> 1] : o[f >> 1]) - r]++] = f;\n		}\n		return this._scratch = s, this._events = c, c;\n	}\n	_advanceBand() {\n		let e = this._n, t = this._M0, r = this._M1, n = this._order, i, o = this._active, l = this._activeLen;\n		if (this._hasBand) {\n			let a = this._bandEnd, f = 0;\n			for (let b = 0; b < l; b++) {\n				let v = o[b];\n				r[v >> 1] > a && (o[f++] = v);\n			}\n			l = f;\n		}\n		let s = this._nextOrder;\n		if (l > 0) i = this._bandEnd + 1;\n		else {\n			if (s >= e) return this._activeLen = 0, this._done = !0, !1;\n			i = t[n[s]];\n		}\n		let c = s;\n		for (; c < e && t[n[c]] === i;) c++;\n		let d = c - s;\n		if (d > 0) {\n			let a = 2 * d, f = this._events;\n			f.length < a && (f = this._events = new Int32Array(Math.max(a, 2 * f.length)));\n			let b = this._m0, v = this._m1, A = 2 ** 53 - 1, U = -(2 ** 53 - 1), h = 0;\n			if (this._isReverse) for (let z = c - 1; z >= s; z--) {\n				let L = n[z];\n				f[h++] = L << 1, f[h++] = L << 1 | 1, b[L] < A && (A = b[L]), v[L] > U && (U = v[L]);\n			}\n			else for (let z = s; z < c; z++) {\n				let L = n[z];\n				f[h++] = L << 1, f[h++] = L << 1 | 1, b[L] < A && (A = b[L]), v[L] > U && (U = v[L]);\n			}\n			let w = this._sortEvents(f, a, A, U), S = l + a, F = this._scratch;\n			if ((F === w || F.length < S) && (F = new Int32Array(Math.max(S, 2 * o.length))), l === 0) F.set(w.subarray(0, a));\n			else {\n				let z = 0, L = 0, R = 0;\n				for (; z < l && L < a;) this._compareEvents(o[z], w[L]) <= 0 ? F[R++] = o[z++] : F[R++] = w[L++];\n				for (; z < l;) F[R++] = o[z++];\n				for (; L < a;) F[R++] = w[L++];\n			}\n			this._scratch = o.length >= F.length ? o : new Int32Array(F.length), o = this._active = F, l = S;\n		}\n		this._activeLen = l, this._nextOrder = c;\n		let m = c < e ? t[n[c]] - 1 : 2 ** 53 - 1;\n		for (let a = 0; a < l; a++) {\n			let f = r[o[a] >> 1];\n			f < m && (m = f);\n		}\n		return this._bandStart = i, this._bandEnd = m, this._hasBand = !0, this._sweepBand(), !0;\n	}\n	_sweepBand() {\n		let e = this._active, t = this._activeLen, r = this._m0, n = this._m1, i = this._rMinS, o = this._rMinE, l = this._rOff, s = this._pool, c = this._overlaps, d = 0, m = 0, a = 0, f = 0, b = (v, A) => {\n			a >= i.length && (i = this._rMinS = Ae(i, a + 1), o = this._rMinE = Ae(o, a + 1), l = this._rOff = Ae(l, i.length + 1)), i[a] = v, o[a] = A, l[a] = m, a++, m + d > s.length && (s = this._pool = Ae(s, m + d));\n			for (let U = 0; U < d; U++) s[m++] = c[U];\n		};\n		for (let v = 0; v < t; v++) {\n			let A = e[v], U = A >> 1;\n			if (1 & A) {\n				let h = n[U];\n				if (f <= h && b(f, h), d > 1) {\n					let w = d - 1;\n					for (; w >= 0 && c[w] !== U;) w--;\n					w !== -1 && (c[w] = c[d - 1]);\n				}\n				d--, f = h + 1;\n			} else {\n				let h = r[U];\n				d > 0 && f < h && b(f, h - 1), d >= c.length && (c = this._overlaps = Ae(c, d + 1)), c[d++] = U, f = h;\n			}\n		}\n		l[a] = m, this._rCount = a, this._region = -1, this._rInter = null;\n	}\n	_setRegion(e) {\n		let t = this._isReverse, r = t ? 0 - this._bandEnd : this._bandStart, n = t ? 0 - this._bandStart : this._bandEnd, i = this._rMinS[e], o = this._rMinE[e], l = t ? 0 - o : i, s = t ? 0 - i : o;\n		this._isColumn ? (this.colStart = r, this.colEnd = n, this.rowStart = l, this.rowEnd = s) : (this.rowStart = r, this.rowEnd = n, this.colStart = l, this.colEnd = s);\n		let c = this._rInter;\n		if (c) {\n			let d = c[e];\n			d ||= c[e] = this._materialize(e), this.intersection = d;\n		} else this.intersection = this._materialize(e);\n	}\n	nextRegion() {\n		if (this._done) return !1;\n		let e = this._region + 1;\n		for (; !this._hasBand || e >= this._rCount;) {\n			if (!this._advanceBand()) return !1;\n			e = 0;\n		}\n		return this._region = e, this._setRegion(e), !0;\n	}\n	_setCell(e) {\n		let t = this._isReverse, r = t ? 0 - this._major : this._major, n = t ? 0 - this._minor : this._minor;\n		this._isColumn ? (this.cellCol = r, this.cellRow = n) : (this.cellRow = r, this.cellCol = n), e !== this._region && (this._region = e, this._setRegion(e));\n	}\n	_enterBandByCell() {\n		this._rInter = this._bandEnd > this._bandStart ? Array(this._rCount) : null, this._major = this._bandStart;\n	}\n	nextCell() {\n		if (this._done) return !1;\n		let e = this._region;\n		if (!this._hasBand || e < 0) {\n			if (!this._hasBand) {\n				if (!this._advanceBand()) return !1;\n				this._enterBandByCell();\n			}\n			return this._minor = this._rMinS[0], this._setCell(0), !0;\n		}\n		let t = this._minor + 1;\n		if (t <= this._rMinE[e]) return this._minor = t, this._setCell(e), !0;\n		if (e++, e >= this._rCount && (e = 0, ++this._major > this._bandEnd)) {\n			if (!this._advanceBand()) return !1;\n			this._enterBandByCell();\n		}\n		return this._minor = this._rMinS[e], this._setCell(e), !0;\n	}\n	seekCell(e, t) {\n		if (this._done) return !1;\n		let r = this._isReverse, n = this._isColumn ? t : e, i = this._isColumn ? e : t;\n		if (r && (n = -n, i = -i), this._hasBand && this._region >= 0 && (n < this._major || n === this._major && i <= this._minor)) return this.nextCell();\n		for (;;) {\n			if (!this._hasBand || n > this._bandEnd) {\n				if (!this._advanceBand()) return !1;\n				this._enterBandByCell();\n				continue;\n			}\n			if (n < this._bandStart) return this._major = this._bandStart, this._minor = this._rMinS[0], this._setCell(0), !0;\n			this._major = n;\n			let o = this._rMinE, l = 0, s = this._rCount;\n			for (; l < s;) {\n				let c = l + s >>> 1;\n				o[c] < i ? l = c + 1 : s = c;\n			}\n			if (l < this._rCount) {\n				let c = this._rMinS[l];\n				return this._minor = c > i ? c : i, this._setCell(l), !0;\n			}\n			if (!(++this._major > this._bandEnd)) return this._minor = this._rMinS[0], this._setCell(0), !0;\n			if (!this._advanceBand()) return !1;\n			this._enterBandByCell();\n		}\n	}\n}, xt = Object.freeze({\n	done: !0,\n	value: void 0\n});\n(function(e) {\n	class t extends ni {\n		constructor(...i) {\n			super(...i), this._reuseOverlaps = null;\n		}\n		_materialize(i) {\n			let o = this._rOff, l = this._pool, s = this._store.value, c = o[i], d = o[i + 1], m = this._reuseOverlaps;\n			m ? m.length = 0 : m = [];\n			for (let a = c; a < d; a++) m.push(s[l[a]]);\n			return m;\n		}\n	}\n	class r {\n		constructor(i, o) {\n			if (this._sweep = null, this._isByCell = !1, this._cellComparator = null, this._lastCell = null, this._reuse = null, !i || i.length === 0) return;\n			let l, s = !0, c = !1, d = !1;\n			if (o && (s = (o.axis ?? oe.Column) !== oe.Row, c = o.reverse ?? !1, d = o.byCell ?? !1, l = o.reuseIterator), this._isByCell = d, l) {\n				let w = typeof l == \"boolean\" ? {\n					done: !1,\n					value: {\n						cell: null,\n						range: null,\n						overlaps: null\n					}\n				} : l;\n				w.done = !1;\n				let S = w.value;\n				S ||= w.value = {\n					cell: null,\n					range: null,\n					overlaps: null\n				}, S.range || (S.range = {\n					colStart: 0,\n					rowStart: 0,\n					colEnd: 0,\n					rowEnd: 0\n				}), S.cell = d ? S.cell ?? {\n					colIndex: -1,\n					rowIndex: -1\n				} : null, this._reuse = w;\n			}\n			let m = i.length, a = {\n				count: m,\n				rowS: new Int32Array(m),\n				rowE: new Int32Array(m),\n				colS: new Int32Array(m),\n				colE: new Int32Array(m),\n				type: new Uint16Array(m),\n				value: [],\n				keys: [\"range\"]\n			}, f = 2 ** 53 - 1, b = -(2 ** 53 - 1), v = 2 ** 53 - 1, A = -(2 ** 53 - 1);\n			for (let w = 0; w < m; w++) {\n				let S = i[w];\n				a.rowS[w] = S.rowStart, a.rowE[w] = S.rowEnd, a.colS[w] = S.colStart, a.colE[w] = S.colEnd, a.value.push(S), S.rowStart < f && (f = S.rowStart), S.rowEnd > b && (b = S.rowEnd), S.colStart < v && (v = S.colStart), S.colEnd > A && (A = S.colEnd);\n			}\n			let U = {\n				rowStart: f,\n				rowEnd: b,\n				colStart: v,\n				colEnd: A\n			}, h = this._sweep = new t(a, U, s, c);\n			d ? this._cellComparator = _r(s ? oe.Column : oe.Row, c) : l && (h._reuseOverlaps = []);\n		}\n		next(i) {\n			let o = this._sweep;\n			if (!o) return xt;\n			let l = this._isByCell, s;\n			if (i) {\n				if (!l) throw Error(\"nextCell is only supported when byCell is true\");\n				let a = this._lastCell;\n				if (a && this._cellComparator(a, i) >= 0) throw Error(\"nextCell must be after the current iteration cell\");\n				s = o.seekCell(i.rowIndex, i.colIndex);\n			} else s = l ? o.nextCell() : o.nextRegion();\n			if (!s) return this._sweep = null, xt;\n			let c = this._reuse;\n			if (c) {\n				let a = c.value;\n				c.done = !1;\n				let f = a.range;\n				if (f.colStart = o.colStart, f.rowStart = o.rowStart, f.colEnd = o.colEnd, f.rowEnd = o.rowEnd, l) {\n					let b = a.cell;\n					b.colIndex = o.cellCol, b.rowIndex = o.cellRow;\n					let v = this._lastCell;\n					v ||= this._lastCell = {\n						colIndex: 0,\n						rowIndex: 0\n					}, v.colIndex = o.cellCol, v.rowIndex = o.cellRow;\n				}\n				return a.overlaps = o.intersection, c;\n			}\n			let d = null, m = o.intersection;\n			return l && (d = this._lastCell = {\n				colIndex: o.cellCol,\n				rowIndex: o.cellRow\n			}, m = m.slice()), {\n				done: !1,\n				value: {\n					cell: d,\n					range: {\n						colStart: o.colStart,\n						rowStart: o.rowStart,\n						colEnd: o.colEnd,\n						rowEnd: o.rowEnd\n					},\n					overlaps: m\n				}\n			};\n		}\n		return(i) {\n			return null;\n		}\n		throw(i) {\n			return null;\n		}\n		[Symbol.iterator]() {\n			return this;\n		}\n	}\n	e.IteratorInstance = r;\n})(ri ||= {});\nvar ii = class {\n	constructor() {\n		this._onceMessageKeys = /* @__PURE__ */ new Set(), this._overrides = null;\n	}\n	setOverrides(e) {\n		this._overrides = e ?? null;\n	}\n	getOverrides() {\n		return this._overrides;\n	}\n	_write(e, t, r) {\n		if (r?.onceKey) {\n			let o = this._onceMessageKeys;\n			if (o.has(r.onceKey)) return;\n			o.add(r.onceKey);\n		}\n		let n = r?.meta, i = this._overrides;\n		if (i) {\n			let o = i[e];\n			if (o) return void o.bind(i)(t, r);\n		}\n		n === void 0 ? console[e](t) : console[e](t, n);\n	}\n	log(e, t) {\n		return this._write(\"log\", e, t);\n	}\n	error(e, t) {\n		return this._write(\"error\", e, t);\n	}\n	warn(e, t) {\n		return this._write(\"warn\", e, t);\n	}\n	debug(e, t) {\n		return this._write(\"debug\", e, t);\n	}\n};\nnew ii();\nvar Qe;\nge({\n	EmptyBounds: () => li,\n	EmptyRect: () => ai,\n	EmptyTopLeft: () => oi\n});\nvar oi = Object.freeze({\n	left: 0,\n	top: 0\n}), ai = Object.freeze({\n	left: 0,\n	top: 0,\n	bottom: 0,\n	right: 0\n}), li = Object.freeze({\n	x: 0,\n	y: 0,\n	width: 0,\n	height: 0\n});\nge({\n	canUseDOM: () => kr,\n	getDPI: () => ci,\n	hasFocus: () => Mr,\n	openFileDialog: () => si,\n	scrollIntoContainer: () => ui,\n	whenFocus: () => di\n});\nvar kr = !(typeof window > \"u\" || !window.document || !window.document.createElement), si = (e = \"*.*\") => new Promise((t, r) => {\n	if (!kr) return void r(\"Unable to open dialog with no dom.\");\n	let n = document.createElement(\"input\");\n	n.type = \"file\", n.accept = e;\n	let i = null, o = !1;\n	globalThis.addEventListener?.(\"focus\", () => {\n		setTimeout(() => {\n			i || o || (o = !0, t(null));\n		}, 1e3);\n	}, {\n		once: !0,\n		passive: !0\n	}), n.onchange = () => {\n		if (i = n.files?.[0] ?? null, i) {\n			if (o) return void console.warn(\"File open detected after faux cancel.\", i);\n			t(i);\n		}\n	}, n.autofocus = !0, n.click();\n}), ci = () => {\n	let e = 1;\n	return typeof window == \"object\" && (e = window.devicePixelRatio || 1), e;\n}, Mr = (e, t = !1) => (document.hasFocus() || t) && (e === document.activeElement || e?.contains(document.activeElement)), ui = (e, t, r = \"auto\") => {\n	if ((() => {\n		if (Qe === void 0) {\n			let c = !1;\n			try {\n				document.createElement(\"div\").scrollIntoView({ get container() {\n					return c = !0, \"nearest\";\n				} });\n			} catch {}\n			Qe = c;\n		}\n		return Qe;\n	})()) return void t.scrollIntoView({\n		block: \"nearest\",\n		inline: \"nearest\",\n		behavior: r,\n		container: \"nearest\"\n	});\n	let n = e.getBoundingClientRect(), i = t.getBoundingClientRect(), o = n.top + e.clientTop, l = o + e.clientHeight, s = 0;\n	i.top < o ? s = i.top - o : i.bottom > l && (s = Math.min(i.bottom - l, i.top - o)), s !== 0 && e.scrollBy({\n		top: s,\n		behavior: r\n	});\n}, di = async (e, t = !1) => new Promise((r) => {\n	Mr(e, t) ? r(!0) : e.addEventListener(\"focusin\", () => {\n		r(!0);\n	}, { once: !0 }), e.focus();\n});\nge({\n	cancelTimeout: () => yi,\n	debounce: () => mi,\n	nextTick: () => gi,\n	rafThrottle: () => hi,\n	requestTimeout: () => wi,\n	throttle: () => pi\n});\nvar Oe = globalThis.requestAnimationFrame, fi = globalThis.cancelAnimationFrame;\nfunction pi(e, t) {\n	let r = null;\n	return (...n) => {\n		let i = Date.now();\n		(!r || i - r >= t) && (r = i, e(...n));\n	};\n}\nfunction mi(e, t = 300, r = !1) {\n	let n, i, o, l = null, s = 0;\n	function c() {\n		let m = Date.now() - s;\n		m < t && m >= 0 ? l = setTimeout(c, t - m) : (l = null, r || (o = e.apply(i, n), i = n = null));\n	}\n	t ??= 100;\n	let d = function() {\n		i = globalThis, n = arguments, s = Date.now();\n		var m = r && !l;\n		return l ||= setTimeout(c, t), m && (o = e.apply(i, n), i = n = null), o;\n	};\n	return d.clear = function() {\n		l &&= (clearTimeout(l), null);\n	}, d.flush = function() {\n		l &&= (o = e.apply(i, n), i = n = null, clearTimeout(l), null);\n	}, d;\n}\nvar hi = (e) => {\n	let t, r = !1, n = function() {\n		r = !1, e(t);\n	};\n	return function(i) {\n		t = i, t && t.persist && t.persist(), r || (r = !0, Oe(n));\n	};\n}, gi = (e) => {\n	if (typeof Oe == \"function\") Oe(() => {\n		e();\n	});\n	else {\n		let t = globalThis.setImmediate;\n		(typeof t == \"function\" ? t : setTimeout)(() => {\n			e();\n		});\n	}\n}, Tt = typeof performance == \"object\" && typeof performance.now == \"function\" ? () => performance.now() : () => Date.now(), yi = (e) => {\n	fi(e.id);\n}, wi = (e, t) => {\n	let r = Tt(), n = { id: Oe(function i() {\n		Tt() - r >= t ? e.call(null) : n.id = Oe(i);\n	}) };\n	return n;\n};\nge({ MESSAGE_ERROR_INVALID_ARG: () => Si });\nvar Si = (e) => `Invalid argument: '${e}'.`;\nge({\n	APP_MIME_TYPE: () => bi,\n	DEFAULT_MIME_TYPE: () => \"*/*\",\n	JSONStableStringify: () => Ti,\n	arrayBufferToBase64: () => Or,\n	base64ToArrayBuffer: () => xi,\n	blobToString: () => ut,\n	isLittleEndian: () => _i,\n	isNodeBuffer: () => vi,\n	isSharedArrayBufferSupported: () => Ei\n});\nvar bi = \"application/octet-stream\", Ce = globalThis.Buffer, vi = (e) => Ce?.isBuffer(e) ?? !1, Ei = typeof SharedArrayBuffer == \"function\" && (globalThis.crossOriginIsolated === void 0 || globalThis.crossOriginIsolated === !0), _i = new Uint8Array(new Uint16Array([1]).buffer)[0] === 1, Ct = globalThis.FileReader, xi = (e) => {\n	let t = typeof globalThis.atob == \"function\" ? globalThis.atob(e) : Ce.from(e, \"base64\").toString(\"binary\"), r = t.length, n = new Uint8Array(r);\n	for (let i = 0; i < r; i++) n[i] = t.charCodeAt(i);\n	return n.buffer;\n}, Or = (e) => {\n	let t = new Uint8Array(e), r = t.byteLength, n = \"\";\n	for (let i = 0; i < r; i++) n += String.fromCharCode(t[i]);\n	if (typeof globalThis.btoa == \"function\") return globalThis.btoa(n);\n	if (Ce) return Ce.from(n, \"binary\").toString(\"base64\");\n	throw Error(\"Unsupported environment\");\n}, ut = (e) => new Promise((t, r) => {\n	if (e) if (Ct) {\n		let n = new Ct();\n		n.onload = () => {\n			t(n.result);\n		}, n.onerror = () => {\n			r(n.error);\n		}, n.readAsText(e);\n	} else if (Ce) {\n		let n = (i) => Ce.from(i).toString(\"utf-8\");\n		e.arrayBuffer().then((i) => {\n			t(n(i));\n		}).catch((i) => {\n			r(i);\n		});\n	} else r(/* @__PURE__ */ Error(\"Unsupported environment\"));\n	else t(\"\");\n});\nfunction Ti(e, t) {\n	t ||= {}, typeof t == \"function\" && (t = { cmp: t });\n	let r = typeof t.cycles == \"boolean\" && t.cycles, n = t.cmp && (i = t.cmp, function(l) {\n		return function(s, c) {\n			return i({\n				key: s,\n				value: l[s]\n			}, {\n				key: c,\n				value: l[c]\n			});\n		};\n	});\n	var i;\n	let o = [];\n	return (function l(s) {\n		if (s && s.toJSON && typeof s.toJSON == \"function\" && (s = s.toJSON()), s === void 0) return;\n		if (typeof s == \"number\") return isFinite(s) ? \"\" + s : \"null\";\n		if (typeof s != \"object\") return JSON.stringify(s);\n		let c;\n		if (Array.isArray(s)) {\n			c = \"[\";\n			for (let a = 0; a < s.length; a++) a && (c += \",\"), c += l(s[a]) || \"null\";\n			return c + \"]\";\n		}\n		if (s === null) return \"null\";\n		if (o.indexOf(s) !== -1) {\n			if (r) return JSON.stringify(\"__cycle__\");\n			throw TypeError(\"Converting circular structure to JSON\");\n		}\n		let d = o.push(s) - 1, m = Object.keys(s).sort(n && n(s));\n		c = \"\";\n		for (let a = 0; a < m.length; a++) {\n			let f = m[a], b = l(s[f]);\n			b && (c && (c += \",\"), c += JSON.stringify(f) + \":\" + b);\n		}\n		return o.splice(d, 1), \"{\" + c + \"}\";\n	})(e);\n}\nvar Ci;\nge({\n	DATA_URL_PNG_PREFIX: () => Fr,\n	getImageDataUrl: () => Ii,\n	loadImageDetails: () => Ai\n});\nvar Fr = \"data:image/png;base64,\", Dr = \"Unable to resolve image.\", It = (e) => new Promise(async (t, r) => {\n	let n = null;\n	try {\n		let i = n = new Image();\n		i.src = e, i.addEventListener(\"load\", function() {\n			t({\n				width: i.naturalWidth,\n				height: i.naturalHeight\n			});\n		}, { once: !0 }), i.addEventListener(\"error\", function(o) {\n			URL.revokeObjectURL(e);\n			let l = o?.error?.message ?? \"\";\n			l &&= `: ${l}`, r(`Invalid Image${l}`);\n		}, { once: !0 }), await i.decode();\n	} catch {\n		n?.src && URL.revokeObjectURL(n.src);\n	}\n	n || r(Error(Dr));\n}), Ii = (e, t = 1) => new Promise(async (r, n) => {\n	let i = null;\n	try {\n		let o = i = new Image();\n		o.src = e, o.addEventListener(\"load\", function() {\n			try {\n				let l = document.createElement(\"canvas\");\n				l.width = o.naturalWidth, l.height = o.naturalHeight;\n				let s = l.getContext(\"2d\");\n				if (!s) throw Error(\"Unable to create 2d context\");\n				s.drawImage(o, 0, 0);\n				let c = l.toDataURL(\"image/png\", t);\n				r({\n					elemImg: o,\n					dataUrl: c\n				});\n			} catch (l) {\n				URL.revokeObjectURL(e), n(l);\n			}\n		}, { once: !0 }), o.addEventListener(\"error\", function() {\n			URL.revokeObjectURL(e), n(\"Invalid Image\");\n		}, { once: !0 }), await o.decode();\n	} catch {\n		i?.src && URL.revokeObjectURL(i.src);\n	}\n	i || n(Error(Dr));\n}), et = \"image/svg+xml\", Ai = async (e, t = null) => {\n	let r = null, n = async () => {\n		try {\n			let o = t ?? \"image/*\", l = URL.createObjectURL(new Blob([e], { type: o }));\n			r = {\n				mimeType: o,\n				naturalSize: await It(l),\n				asUrl: l\n			};\n		} catch {}\n	}, i = async () => {\n		try {\n			let o = new TextDecoder().decode(e), l = URL.createObjectURL(new Blob([o], { type: et })), s = await It(l);\n			r = {\n				mimeType: t ?? et,\n				naturalSize: s,\n				asUrl: l,\n				asSVGText: o\n			};\n		} catch {}\n	};\n	if (t === et ? await i() : t?.startsWith(\"image/\") ? await n() : (await n(), r || await i()), !r) throw Error(\"Failed to load image\");\n	return r;\n}, At = /* @__PURE__ */ new Set(), Ri = (e) => {\n	At.has(e) || (At.add(e), console.warn(`Unknown property '${e}' in update; ignoring.`));\n};\n(function(e) {\n	e.PassThrough = Object.freeze({});\n	let t = e.resolveTypedUpdates = (r, n, i, o, l = !1) => {\n		if (r === null) return r;\n		if (r === void 0) return o;\n		let s = r;\n		if (n?.shorthand) {\n			let a = n?.shorthand(r, i);\n			a !== void 0 && (s = a);\n		}\n		if (s !== null && n?.getSubType) {\n			let a = n.getSubType(s, o);\n			a && (n = a);\n		}\n		let c = n?.properties, d = n?.arrayType ?? !1, m = s;\n		if (n && n.merge && m && o) m = n.merge(m, o, i);\n		else if (!d && c) {\n			let a = Object.keys({\n				...s,\n				...o\n			});\n			m = null;\n			let f = a.length;\n			for (let b = 0; b < f; b++) {\n				let v = a[b], A, U = s?.[v];\n				if (U !== void 0) {\n					let h = c[v];\n					if (!h) {\n						Ri(v);\n						continue;\n					}\n					A = t(U, h, i, o?.[v], l);\n				} else A = o?.[v];\n				A == null ? l && U === null && (m ??= {}, m[v] = null) : (m ??= {}, m[v] = A);\n			}\n		}\n		return m;\n	};\n})(Ci ||= {});\nvar gt = {\n	code: \"safari\",\n	message: `The Safari browser does not support advanced copy and paste.\nCopy and paste will be limited to within the browser tab.\n\nPlease use Chrome or Edge if external copy and paste is required.`\n}, Ur = {\n	code: \"perms\",\n	message: `You do not have permissions to access the clipboard.\nAll copy and paste operations will be limited to the browser tab.`\n}, Rt = He() === fe.Safari ? gt : Ur, $i = {\n	Safari: gt,\n	Perms: Ur,\n	PermsWrite: Rt,\n	PermsRead: Rt\n}, tt = async () => new Promise((e) => {\n	document.hasFocus() ? e() : globalThis.addEventListener?.(\"focus\", () => {\n		e();\n	}, { once: !0 }), document.activeElement.focus?.();\n}), rt = async (e, t, r) => {\n	if (He() === fe.Safari) return await r(Error(gt.message));\n	try {\n		let n = async (l) => {\n			try {\n				return await l();\n			} catch (s) {\n				if (s.message?.includes(\"Document is not focused\")) return !1;\n				throw s;\n			}\n		}, i = await globalThis?.navigator?.permissions?.query({\n			name: e,\n			allowWithoutGesture: !0,\n			allowWithoutSanitization: !0\n		}), o = !1;\n		if (i.state === \"prompt\" && (o = await n(t)), o || i.state !== \"granted\" || (o = await t()), !o) return await r(Error(i.state));\n	} catch (n) {\n		return n.message === \"No valid data on clipboard\" || n.name === \"DataError\" ? void 0 : await r(n);\n	}\n}, Br = async (e) => {\n	if (!e) return null;\n	try {\n		return await e.read({ unsanitized: [J.Html] });\n	} catch {}\n	return await e.read();\n}, Ni = async (e, t) => {\n	if (!e) return null;\n	let r = await Br(e), n = !1;\n	for (let i = 0; !n && r && i < r.length; i++) if (n = r[i].types.includes(t), n) return await r[i].getType(t);\n	return null;\n};\nif (!globalThis.ClipboardItem) {\n	let e = (r, n) => new Blob([n], { type: r });\n	class t {\n		constructor(n, i) {\n			this._items = {}, this._types = Object.keys(n);\n			let o = {}, l = Object.keys(n);\n			for (let s = 0; s < l.length; s++) {\n				let c = l[s], d = n[c];\n				o[c] = typeof d == \"string\" ? e(c, d) : d;\n			}\n			this._items = o, this._presentationStyle = i?.presentationStyle ?? \"unspecified\";\n		}\n		get types() {\n			return this._types;\n		}\n		getType(n) {\n			return Promise.resolve(this._items[n]);\n		}\n		supports(n) {\n			return !0;\n		}\n	}\n	globalThis.ClipboardItem = t;\n}\nvar $t, dt = async (e, t = J.Html) => new Promise(async (r, n) => {\n	try {\n		let i = await Ni(e, t);\n		if (i) {\n			let o = new FileReader();\n			o.onload = () => {\n				r(o.result);\n			}, o.onerror = () => {\n				r(\"\");\n			}, o.readAsText(i);\n		} else r(\"\");\n	} catch (i) {\n		n(i);\n	}\n}), Nt = async (e, t = J.Html) => {\n	let r = await dt(e, t);\n	if (!r) return null;\n	let n = null;\n	try {\n		n = new DOMParser().parseFromString(r, J.Html);\n	} catch {\n		console.warn(\"Can't parse html from clipboard.\");\n	}\n	return n;\n}, Li = async (e) => {\n	e && await e.writeText(\"\");\n}, Fe = \"clipboard-uuid\", Ne = \"web text/uuid\", Lt = (e) => `<div style=\"display:none\" ${Fe}=\"${e}\"/>`, kt = { type: J.Plain }, Mt = { type: J.Html }, Ot = { type: Ne }, ki = (e, t) => {\n	let r = null;\n	try {\n		let n = new DOMParser().parseFromString(t, J.Html);\n		n.body.firstElementChild?.setAttribute(Fe, e), r = n.getElementsByTagName(\"body\")[0].innerHTML;\n	} catch (n) {\n		console.warn(\"Can't embed uuid.\", n);\n	}\n	return r;\n}, Ft = (e, t) => {\n	if (!t || !e) return !1;\n	try {\n		let r = t.querySelectorAll(`[${Fe}=\"${e}\"]`);\n		if (r && r.length === 1) return !0;\n		if (t.querySelector(\"parsererror\")) throw Error(\"We are unable to parse node\");\n		return !1;\n	} catch {\n		return !1;\n	}\n}, Dt = class {\n	constructor(e) {\n		if (this._state = null, this._nativeClipboard = null, this._onFocus = null, this._onBlur = null, e?.nativeClipboard === void 0 || e?.nativeClipboard === !0) try {\n			this._nativeClipboard = globalThis?.navigator.clipboard;\n		} catch {\n			e?.nativeClipboard === !0 && console.warn(\"NativeClipboard option set to true but no native clipboard available.\");\n		}\n		else this._nativeClipboard = e?.nativeClipboard === !1 ? null : e?.nativeClipboard ?? null;\n		this._disableCheckOnFocus = e?.disableCheckOnFocus ?? !1, this._init();\n	}\n	async _checkForChanges() {\n		this._nativeClipboard && this._state && !this._disableCheckOnFocus && await rt(\"clipboard-read\", async () => {\n			await tt();\n			let e = await dt(this._nativeClipboard, Ne);\n			if (!this._state || e && e === this._state.uuid) return !0;\n			let t = await Nt(this._nativeClipboard, J.Html);\n			return !this._state || (Ft(this._state.uuid, t) || this.clear(), !0);\n		}, async (e) => {\n			e?.message === \"denied\" || e.message?.includes(\"Document is not focused\") || He() === fe.Safari || console.warn(\"Unable to detect clipboard changes: \", e);\n		});\n	}\n	_init() {\n		let e = this;\n		this._listeners = /* @__PURE__ */ new Map(), this._listenersCapture = /* @__PURE__ */ new Map(), this._state = null, this._nativeClipboard && (this._onFocus = () => {\n			e._checkForChanges();\n		}, this._onBlur = () => {\n			globalThis.addEventListener?.(\"focus\", e._onFocus, { once: !0 });\n		}, globalThis.addEventListener?.(\"blur\", this._onBlur), this._nativeClipboard.addEventListener(\"clipboardchange\", (t) => {\n			e._checkForChanges();\n		}));\n	}\n	async read() {\n		if (!this._nativeClipboard) return this._state?.items ?? null;\n		let e = this;\n		return await rt(\"clipboard-read\", async () => {\n			if (await tt(), this._state?.uuid) {\n				let t = await dt(this._nativeClipboard, Ne);\n				if (t && t === e._state?.uuid) return !0;\n				let r = await Nt(this._nativeClipboard, J.Html);\n				if (Ft(e._state?.uuid, r)) return !0;\n			}\n			return e._state = {\n				items: await Br(this._nativeClipboard),\n				uuid: null,\n				ref: null\n			}, this.dispatchEvent(new Event(\"clipboardread\")), !0;\n		}, async (t) => {\n			this.dispatchEvent(new Event(\"clipboarderrorread\"));\n		}), this._state?.items ?? [];\n	}\n	async write(e) {\n		return this._write({\n			uuid: Ve(),\n			items: e,\n			ref: null\n		});\n	}\n	async _write(e) {\n		if (!this._nativeClipboard) return this._state = e, this.dispatchEvent(new Event(\"clipboardwrite\")), void this.dispatchEvent(new Event(\"clipboardchange\"));\n		let t = this, r = [], n = e.uuid, i = e.items ?? [], o = () => {\n			t._state = {\n				uuid: n,\n				ref: e.ref,\n				items: r\n			}, t.dispatchEvent(new Event(\"clipboardwrite\")), t.dispatchEvent(new Event(\"clipboardchange\"));\n		};\n		await rt(\"clipboard-write\", async () => {\n			await tt(), n && i.length === 0 && (i.push(new ClipboardItem({ [Ne]: new Blob([n], Ot) })), i.push(new ClipboardItem({ [J.Html]: new Blob([Lt(n)], Mt) })));\n			for (let l = 0; l < Math.min(1, i.length); l++) {\n				let s = i[l], c = s.types.indexOf(J.Html), d = null;\n				if (c !== -1 && (d = await ut(await s.getType(J.Html)), d &&= ki(n, d)), !d && s.types.includes(J.Plain)) {\n					let v = await s.getType(J.Plain);\n					if (v) {\n						let A = null;\n						typeof v == \"string\" ? (console.warn(\"text as string\", v), A = v) : A = await ut(v), A && (d = `<div ${Fe}=\"${n}\">${A}</div>`);\n					}\n				}\n				if (!d && s.types.includes(J.Png)) {\n					let v = Or(await (await s.getType(J.Png)).arrayBuffer());\n					d = `<div ${Fe}=\"${n}\"><img src=\"${Fr + v}\"/></div>`;\n				}\n				!d && n && (d = Lt(n));\n				let m = new Blob([d ?? \"\"], Mt), a = {}, f = s.types, b = f.length;\n				for (let v = 0; v < b; v++) {\n					let A = f[v];\n					a[A] = v === c ? m : s.getType(A);\n				}\n				d && c === -1 && (a[J.Html] = m), n && (a[Ne] = new Blob([n], Ot)), r.push(new ClipboardItem(a));\n			}\n			try {\n				r && r.length !== 0 ? await this._nativeClipboard.write(r) : await Li(this._nativeClipboard);\n			} catch (l) {\n				l.message?.includes(\"Document is not focused\") || console.warn(\"Unable to write to native clipboard: \", l);\n			}\n			return o(), !0;\n		}, async (l) => {\n			this.dispatchEvent(new Event(\"clipboarderrorwrite\")), o();\n		});\n	}\n	async writeReference(e) {\n		if (!e) return void this.clear();\n		let t = null, r = {};\n		try {\n			let i = await e.toText?.() ?? null;\n			i && (r[J.Plain] = new Blob([i ?? \"\"], kt));\n		} catch (i) {\n			t = i;\n		}\n		try {\n			let i = await e.toHtml?.() ?? null;\n			i && (r[J.Html] = new Blob([i], { type: J.Html }));\n		} catch (i) {\n			t = i, console.warn(\"export to html\", i);\n		}\n		try {\n			let i = await e.toImage?.() ?? null;\n			i && (r[J.Png] = i);\n		} catch (i) {\n			t = i, console.warn(\"export to png\", i);\n		}\n		let n = this._write({\n			uuid: Ve(),\n			ref: e,\n			items: Object.keys(r).length > 0 ? [new ClipboardItem(r)] : null\n		});\n		if (t) throw t;\n		return n;\n	}\n	clear(e = !1) {\n		this._state && (this._state = null, e && this._write({\n			uuid: null,\n			ref: null,\n			items: null\n		}), this.dispatchEvent(new Event(\"clipboardwrite\")), this.dispatchEvent(new Event(\"clipboardchange\")));\n	}\n	async readReference() {\n		return await this.read(), this._state?.ref ?? null;\n	}\n	readText() {\n		return new Promise(async (e, t) => {\n			let r = await this.read(), n = null, i = r ? r.length : 0;\n			for (let l = 0; !n && l < i; l++) {\n				let s = r[l];\n				s.types.includes(J.Plain) && (n = await s.getType(J.Plain));\n			}\n			if (!n) return void e(\"\");\n			let o = new FileReader();\n			o.onload = () => {\n				e(o.result);\n			}, o.readAsText(n), o.onerror = (l) => {\n				t(l);\n			};\n		});\n	}\n	async writeText(e) {\n		let t = [new ClipboardItem({ [J.Plain]: new Blob([e], kt) })];\n		return this._write({\n			uuid: Ve(),\n			items: t,\n			ref: null\n		});\n	}\n	addEventListener(e, t, r = {}) {\n		let n = r?.capture ? this._listenersCapture : this._listeners, i = n.get(e);\n		i || (i = /* @__PURE__ */ new Map(), n.set(e, i)), t && i.set(t, typeof r == \"boolean\" ? {} : r);\n	}\n	dispatchEvent(e) {\n		if (!e) return !1;\n		let t = (r) => {\n			let n = r.get(e.type);\n			n && n.forEach((i, o) => {\n				try {\n					typeof o == \"function\" ? o(e) : o.handleEvent && o.handleEvent(e), i.once && n.delete(o);\n				} catch (l) {\n					console.warn(l);\n				}\n			});\n		};\n		return t(this._listenersCapture), t(this._listeners), !0;\n	}\n	removeEventListener(e, t, r) {\n		let n = r?.capture ? this._listenersCapture : this._listeners, i = n.get(e);\n		i && t && (i.delete(t), i.size === 0 && n.delete(e));\n	}\n	close() {\n		this._onFocus && globalThis.removeEventListener?.(\"focus\", this._onFocus), this._onBlur && globalThis.removeEventListener?.(\"blur\", this._onBlur);\n	}\n};\n($t = Dt ||= {}).ErrorMessages = $i, $t.Global = new Dt();\nObject.freeze({});\nnew TextDecoder();\nconst _ = Object.freeze({\n	/** Exported function has no body. */\n	NoBody: \"SXL1001\",\n	/** Anonymous exported function is not allowed. */\n	Anonymous: \"SXL1002\",\n	/** Internal parse failure while analyzing the module. */\n	ParseError: \"SXL1003\",\n	/** Invalid parameter type. */\n	InvalidParamType: \"SXL2001\",\n	/** Invalid return type. */\n	InvalidReturnType: \"SXL2002\",\n	/** `undefined` / `null` / `void` is not valid as an input type. */\n	UndefinedInput: \"SXL2003\",\n	/** A type annotation is required but missing. */\n	MissingType: \"SXL2004\",\n	/** An `Array` must be typed (e.g. `number[]`, not bare `[]`). */\n	UntypedArray: \"SXL2005\",\n	/** A generic type must be supplied exactly one type argument. */\n	GenericArity: \"SXL2006\",\n	/** A return type cannot combine multiple modifiers (e.g. async + stream). */\n	MultipleModifiers: \"SXL2007\",\n	/** A context parameter must be the first parameter. */\n	ContextNotFirst: \"SXL2010\",\n	/** More than one `Lambda` parameter. */\n	MultipleLambda: \"SXL2020\",\n	/** A `Lambda` parameter must be the last parameter. */\n	LambdaNotLast: \"SXL2021\",\n	/** A `Lambda` parameter/return scalar type mismatch. */\n	LambdaScalarMismatch: \"SXL2022\",\n	/** `Lambda` is not valid as a return type. */\n	LambdaReturn: \"SXL2023\",\n	/** A bare function type is not valid as a return type. */\n	FunctionReturn: \"SXL2024\",\n	/** A `Lambda` function type has the wrong number of parameters. */\n	LambdaArity: \"SXL2025\",\n	/** Arrays of more than 2 dimensions are not supported. */\n	ArrayDepth: \"SXL2030\",\n	/** `Repeating<T>` used somewhere it cannot be (a return type, a rest parameter, nested in an array). */\n	RepeatingPosition: \"SXL2040\",\n	/** More than one `Repeating<T>` parameter. */\n	MultipleRepeating: \"SXL2041\",\n	/** A `Repeating<T>` group's slots are malformed (unlabelled tuple member, or a 1-element tuple). */\n	RepeatingSlots: \"SXL2042\",\n	/** An optional parameter/slot where a repeating group does not allow one. */\n	RepeatingOptional: \"SXL2043\",\n	/** `Repeating<T, Max>`'s maximum argument count is not a whole number in range. */\n	RepeatingMax: \"SXL2044\",\n	/** An enum mixes number and string members. */\n	EnumMixed: \"SXL2050\",\n	/** An enum member is not a constant number or string. */\n	EnumMemberNotConstant: \"SXL2051\",\n	/** A parameter type that is not declared in this module, so an enum behind it cannot be read. */\n	EnumNotLocal: \"SXL2052\",\n	/** An `as const` object used as a parameter type without its same-name type alias. */\n	EnumMissingAlias: \"SXL2053\",\n	/** An enum where no single argument is coerced to it (`IRange<E>`, `Lazy<E>`). */\n	EnumPosition: \"SXL2054\",\n	/** `Omittable<E, V>` whose `V` is neither a member of `E` nor `null`. */\n	EnumOmittedValue: \"SXL2055\",\n	/** No exported functions found in the module. */\n	NoExports: \"SXL3001\",\n	/** A `@param` tag references a parameter that does not exist. */\n	UnknownParam: \"SXL3002\",\n	/** A calculation function takes a built-in function's name. */\n	BuiltInName: \"SXL3003\",\n	/** A `@returnKind` tag names a value kind that does not exist, or names none at all. */\n	UnknownReturnKind: \"SXL3005\",\n	/** A calculation function's name (its `@name`, or else its own) is not a name a formula can call. */\n	InvalidName: \"SXL3006\",\n	/** Two functions in one module register under the same name (an `@name` repeats another's). */\n	DuplicateName: \"SXL3007\",\n	/** A function has no JSDoc description. */\n	MissingSummary: \"SXL9001\",\n	/** A `@param` is missing a description. */\n	MissingParamDescription: \"SXL9002\",\n	/**\n	* Missing `@returns` on a non-void function.\n	* @deprecated Retained for code stability but no longer emitted - Excel-style tooltips describe\n	* behavior via the summary, so a standalone `@returns` warning is noise.\n	*/\n	MissingReturns: \"SXL9003\",\n	/** Two enum members share a value. */\n	EnumDuplicateValue: \"SXL9004\",\n	/** An enum member has no doc comment. */\n	EnumMemberUndocumented: \"SXL9005\"\n});\nvar ji;\n(function(e) {\n	e.MAX_TEXT_LENGTH = 32767;\n	let t = e.MAX_SIGNIFICANT_DIGITS = 15;\n	e.truncateNumberText = function(r) {\n		let n = r.length;\n		if (n <= t) return r;\n		let i = 0, o = null;\n		for (let l = 0; l < n; l++) {\n			let s = r.charCodeAt(l);\n			if (s >= 48 && s <= 57) {\n				if (i === 0 && s === 48) continue;\n				i++, i > t && ((o ??= r.split(\"\"))[l] = \"0\");\n			} else if ((s === 69 || s === 101) && i > 0) break;\n		}\n		return o === null ? r : o.join(\"\");\n	};\n})(ji ||= {});\nvar Kt, nt, Ki, T, me = {\n	Number: \"number\",\n	String: \"string\",\n	Boolean: \"boolean\",\n	Error: \"error\",\n	RichData: \"richData\",\n	Null: \"null\"\n}, zt = {\n	...me,\n	Date: \"date\"\n}, Vt = {\n	...me,\n	Reference: \"reference\",\n	Array: \"array\",\n	Lambda: \"lambda\",\n	Omitted: \"omitted\"\n};\n(nt = Kt ||= {}).Axis = {\n	Column: \"column\",\n	Row: \"row\"\n}, nt.AxisSelection = {\n	...Kt.Axis,\n	Both: \"both\"\n}, nt.Direction = {\n	Up: \"up\",\n	Down: \"down\",\n	Left: \"left\",\n	Right: \"right\"\n}, (Ki ||= {}).Aggregate = {\n	Count: \"count\",\n	NumericalCount: \"numericalCount\",\n	Sum: \"sum\",\n	Average: \"average\",\n	StdDev: \"stdDev\",\n	PopulationStdDev: \"stdDevP\",\n	Variance: \"var\",\n	PopulationVariance: \"varP\",\n	Min: \"min\",\n	Max: \"max\"\n}, (function(e) {\n	let t = e.Code = {\n		Parse: 0,\n		Null: 1,\n		Div0: 2,\n		Value: 3,\n		Ref: 4,\n		Name: 5,\n		Num: 6,\n		NA: 7,\n		GettingData: 8,\n		Spill: 9,\n		Connect: 10,\n		Blocked: 11,\n		Unknown: 12,\n		Field: 13,\n		Calc: 14,\n		Busy: 16,\n		Python: 19,\n		Timeout: 20\n	}, r = e.Label = {\n		Parse: \"#PARSE!\",\n		Null: \"#NULL!\",\n		Div0: \"#DIV/0!\",\n		Value: \"#VALUE!\",\n		Ref: \"#REF!\",\n		Name: \"#NAME?\",\n		Num: \"#NUM!\",\n		NA: \"#N/A\",\n		GettingData: \"#GETTING_DATA\",\n		Spill: \"#SPILL!\",\n		Connect: \"#CONNECT!\",\n		Blocked: \"#BLOCKED!\",\n		Unknown: \"#UNKNOWN!\",\n		Field: \"#FIELD!\",\n		Calc: \"#CALC!\",\n		Busy: \"#BUSY!\",\n		Python: \"#PYTHON!\",\n		Timeout: \"#TIMEOUT!\"\n	};\n	class n extends Error {\n		constructor(R, M, pe, Y) {\n			super(pe, Y), this._label = M, this._code = R, this.details = Y;\n		}\n		static {\n			this.code = T.Code.Unknown;\n		}\n		get isFormulaError() {\n			return !0;\n		}\n		getLabel() {\n			return this._label;\n		}\n		getCode() {\n			return this._code;\n		}\n		equals(R) {\n			return !!R && (this._code === R._code || this._code === R.code);\n		}\n		get [Symbol.toStringTag]() {\n			return \"[FormulaError]\";\n		}\n		toString() {\n			return this._label;\n		}\n	}\n	e.Known = n;\n	class i extends n {\n		constructor(R, M) {\n			super(t.Parse, r.Parse, R, M);\n		}\n		static {\n			this.code = T.Code.Parse;\n		}\n		getDetails() {\n			let R = this.details;\n			return {\n				line: R?.line ?? 1,\n				column: R?.column ?? 1,\n				offset: R?.offset ?? 0,\n				length: R?.length ?? 0\n			};\n		}\n	}\n	e.Parse = i;\n	class o extends n {\n		constructor(R, M) {\n			super(t.Null, r.Null, R, M);\n		}\n		static {\n			this.code = T.Code.Null;\n		}\n	}\n	e.Null = o;\n	class l extends n {\n		constructor(R, M) {\n			super(t.Div0, r.Div0, R, M);\n		}\n		static {\n			this.code = T.Code.Div0;\n		}\n	}\n	e.Div0 = l;\n	class s extends n {\n		constructor(R, M) {\n			super(t.Value, r.Value, R, M);\n		}\n		static {\n			this.code = T.Code.Value;\n		}\n	}\n	e.Value = s;\n	class c extends n {\n		constructor(R, M) {\n			super(t.Ref, r.Ref, R, M);\n		}\n		static {\n			this.code = T.Code.Ref;\n		}\n	}\n	e.Ref = c;\n	class d extends n {\n		constructor(R, M) {\n			super(t.Name, r.Name, R, M);\n		}\n		static {\n			this.code = T.Code.Name;\n		}\n	}\n	e.Name = d;\n	class m extends n {\n		constructor(R, M) {\n			super(t.Num, r.Num, R, M);\n		}\n		static {\n			this.code = T.Code.Num;\n		}\n	}\n	e.Num = m;\n	class a extends n {\n		constructor(R, M) {\n			super(t.NA, r.NA, R, M);\n		}\n		static {\n			this.code = T.Code.NA;\n		}\n	}\n	e.NA = a;\n	class f extends n {\n		constructor(R, M) {\n			super(t.GettingData, r.GettingData, R, M);\n		}\n		static {\n			this.code = T.Code.GettingData;\n		}\n	}\n	e.GettingData = f;\n	class b extends n {\n		constructor(R, M) {\n			super(t.Spill, r.Spill, R, M);\n		}\n		static {\n			this.code = T.Code.Spill;\n		}\n	}\n	e.Spill = b;\n	class v extends n {\n		constructor(R, M) {\n			super(t.Connect, r.Connect, R, M);\n		}\n		static {\n			this.code = T.Code.Connect;\n		}\n	}\n	e.Connect = v;\n	class A extends n {\n		constructor(R, M) {\n			super(t.Blocked, r.Blocked, R, M);\n		}\n		static {\n			this.code = T.Code.Blocked;\n		}\n	}\n	e.Blocked = A;\n	class U extends n {\n		constructor(R, M) {\n			super(t.Unknown, r.Unknown, R, M);\n		}\n		static {\n			this.code = T.Code.Unknown;\n		}\n	}\n	e.Unknown = U;\n	class h extends n {\n		constructor(R, M) {\n			super(t.Field, r.Field, R, M);\n		}\n		static {\n			this.code = T.Code.Field;\n		}\n	}\n	e.Field = h;\n	class w extends n {\n		constructor(R, M) {\n			super(t.Calc, r.Calc, R, M);\n		}\n		static {\n			this.code = T.Code.Calc;\n		}\n	}\n	e.Calc = w;\n	class S extends n {\n		constructor(R, M) {\n			super(t.Busy, r.Busy, R, M);\n		}\n		static {\n			this.code = T.Code.Busy;\n		}\n	}\n	e.Busy = S;\n	class F extends n {\n		constructor(R, M) {\n			super(t.Python, r.Python, R, M);\n		}\n		static {\n			this.code = T.Code.Python;\n		}\n	}\n	e.Python = F;\n	class z extends n {\n		constructor(R, M) {\n			super(t.Timeout, r.Timeout, R, M);\n		}\n		static {\n			this.code = T.Code.Timeout;\n		}\n	}\n	e.Timeout = z;\n})(T ||= {});\nvar te = {};\nte[T.Code.Parse] = T.Parse, te[T.Code.Null] = T.Null, te[T.Code.Div0] = T.Div0, te[T.Code.Value] = T.Value, te[T.Code.Ref] = T.Ref, te[T.Code.Name] = T.Name, te[T.Code.Num] = T.Num, te[T.Code.NA] = T.NA, te[T.Code.GettingData] = T.GettingData, te[T.Code.Spill] = T.Spill, te[T.Code.Connect] = T.Connect, te[T.Code.Blocked] = T.Blocked, te[T.Code.Unknown] = T.Unknown, te[T.Code.Field] = T.Field, te[T.Code.Calc] = T.Calc, te[T.Code.Busy] = T.Busy, te[T.Code.Python] = T.Python, te[T.Code.Timeout] = T.Timeout;\nvar Kr = /* @__PURE__ */ new Map(), zr = /* @__PURE__ */ new Map(), Vr = /* @__PURE__ */ new Map(), Xr = /* @__PURE__ */ new Map(), Xt = Object.keys(te);\nfor (let e = 0; e < Xt.length; e++) {\n	let t = te[Xt[e]], r = new t();\n	Vr.set(r.getLabel(), t), Xr.set(r.getCode(), t), Kr.set(r.getLabel(), r), zr.set(r.getCode(), r);\n}\n(function(e) {\n	let t = e.getBuiltInByCode = (r) => zr.get(r);\n	e.BuiltIn = {\n		Parse: t(T.Code.Parse),\n		Null: t(T.Code.Null),\n		Div0: t(T.Code.Div0),\n		Value: t(T.Code.Value),\n		Ref: t(T.Code.Ref),\n		Name: t(T.Code.Name),\n		Num: t(T.Code.Num),\n		NA: t(T.Code.NA),\n		GettingData: t(T.Code.GettingData),\n		Spill: t(T.Code.Spill),\n		Connect: t(T.Code.Connect),\n		Blocked: t(T.Code.Blocked),\n		Unknown: t(T.Code.Unknown),\n		Field: t(T.Code.Field),\n		Calc: t(T.Code.Calc),\n		Busy: t(T.Code.Busy),\n		Python: t(T.Code.Python),\n		Timeout: t(T.Code.Timeout)\n	}, e.newTypedError = (r, n, i) => {\n		let o;\n		return o = typeof r == \"string\" ? Vr.get(r) : Xr.get(r), o ||= T.Unknown, new o(n, i);\n	}, e.getBuiltInByLabel = (r) => Kr.get(r), e.isError = function(r, n) {\n		return !!r && r.isFormulaError === !0 && (n === void 0 || r.getCode() === n);\n	};\n})(T ||= {});\nvar zi = class {\n	createRange(e, t, r) {\n		throw new ie();\n	}\n	flattenAreas(e) {\n		throw new ie();\n	}\n	getReference(e, t) {\n		throw new ie();\n	}\n	getResizedReference(e, t, r) {\n		throw new ie();\n	}\n	getNumberFormat(e, t) {\n		throw new ie();\n	}\n	fromSerialDate(e, t) {\n		throw new ie();\n	}\n	toSerialDate(e, t) {\n		throw new ie();\n	}\n	getDateParts(e, t) {\n		throw new ie();\n	}\n	getSerialDate(e, t, r, n, i, o, l) {\n		throw new ie();\n	}\n	getNow() {\n		throw new ie();\n	}\n	getRandom() {\n		return Math.random();\n	}\n	getValueAt(e, t, r, n) {\n		return null;\n	}\n	getEntireCoords() {\n		return Hr;\n	}\n	isValidDate(e, t) {\n		return e instanceof Date || Object.prototype.toString.call(e) === \"[object Date]\" ? !isNaN(e.getTime()) : !t && typeof e == \"number\" && !(e < 0 || e > Xi);\n	}\n	getRow() {\n		return 0;\n	}\n	getColumn() {\n		return 0;\n	}\n	isImplicitIntersect() {\n		return !1;\n	}\n	getFormulaAt(e, t, r) {\n		return null;\n	}\n	getSpillAt(e, t, r) {\n		return null;\n	}\n	getSheetIndex(e) {\n		return -1;\n	}\n	getSheetCount() {\n		return 1;\n	}\n	markVolatile() {}\n	formatResults(e) {}\n	filterHidden(e, t) {\n		return e;\n	}\n	filterTotals(e) {\n		return e;\n	}\n	getFunction(e) {\n		return null;\n	}\n	getAddress(e, t) {\n		throw new ie();\n	}\n	parseAsSerialDate(e, t) {\n		throw new ie();\n	}\n	parseAsDate(e, t) {\n		throw new ie();\n	}\n	parseAsNumber(e, t) {\n		throw new ie();\n	}\n	createCriteria(e, t) {\n		throw new ie();\n	}\n	createGrouping(e, t) {\n		throw new ie();\n	}\n	parseAsLiteral(e) {\n		let t = e.toUpperCase();\n		return t === \"TRUE\" || t !== \"FALSE\" && T.getBuiltInByLabel(t);\n	}\n	toText(e) {\n		return typeof e == \"string\" ? e : e == null ? \"\" : typeof e == \"boolean\" ? e ? \"TRUE\" : \"FALSE\" : e?.isFormulaError ? e.getLabel() : String(e);\n	}\n	compare(e, t, r) {\n		if (e === t) return 0;\n		let n = Gt(e), i = Gt(t);\n		return n === i ? e < t ? -1 : +(e > t) : n < i ? -1 : 1;\n	}\n	getRuntime() {\n		return Vi;\n	}\n	getArgs() {\n		throw new ie(Gr);\n	}\n}, Gt = (e) => {\n	if (e == null) return 0;\n	switch (typeof e) {\n		case \"number\": return 1;\n		case \"string\": return 2;\n		case \"boolean\": return 3;\n		default: return 4;\n	}\n}, Gr = \"FormulaContext.getArgs() is only valid while a function body is running\", ie = class extends Error {\n	constructor(e = \"Not implemented in StubbedFormulaContext\") {\n		super(e), this.name = \"NotImplementedError\";\n	}\n}, Hr = Object.freeze({\n	colStart: 0,\n	rowStart: 0,\n	colEnd: 2 ** 14 - 1,\n	rowEnd: 2 ** 20 - 1\n}), Vi = {\n	isDate1904: () => !1,\n	getLocale: () => Ht.tag,\n	getLocaleProfile: () => Ht,\n	isR1C1: () => !1,\n	getNow: () => 0,\n	getRandom: () => Math.random(),\n	getLocation: () => \"unknown\",\n	getVersion: () => \"1.0.0\",\n	getOS: () => \"unknown\",\n	getUser: () => \"unidentified\",\n	getDescription: () => \"Stubbed Formula Context\"\n}, Xi = 2958465, Pe = new zi(), Gi = class {\n	constructor() {\n		this._scope = Pe, this._argsFn = null;\n	}\n	_setScope(e) {\n		this._scope = e ?? Pe;\n	}\n	_getScope() {\n		return this._scope;\n	}\n	_setArgsProvider(e) {\n		this._argsFn = e;\n	}\n	getNumberFormat(e, t) {\n		return this._getScope().getNumberFormat(e, t);\n	}\n	getEntireCoords() {\n		return this._getScope().getEntireCoords() ?? Hr;\n	}\n	parseAsSerialDate(e, t) {\n		return this._getScope().parseAsSerialDate(e, t);\n	}\n	parseAsDate(e, t) {\n		return this._getScope().parseAsDate(e, t);\n	}\n	parseAsNumber(e, t) {\n		return this._getScope().parseAsNumber(e, t);\n	}\n	createCriteria(e, t) {\n		return this._getScope().createCriteria(e, t);\n	}\n	createGrouping(e, t) {\n		return this._getScope().createGrouping(e, t);\n	}\n	parseAsLiteral(e) {\n		let t = this._getScope();\n		return t.parseAsLiteral ? t.parseAsLiteral(e) : Pe.parseAsLiteral(e);\n	}\n	toText(e) {\n		return this._getScope().toText(e);\n	}\n	isValidDate(e, t = !1) {\n		return this._getScope().isValidDate(e, t);\n	}\n	fromSerialDate(e, t = !1) {\n		return this._getScope().fromSerialDate(e, t);\n	}\n	toSerialDate(e, t = !1) {\n		return this._getScope().toSerialDate(e, t);\n	}\n	getDateParts(e, t) {\n		return this._getScope().getDateParts(e, t);\n	}\n	getSerialDate(e, t, r, n = 0, i = 0, o = 0, l = 0) {\n		return this._getScope().getSerialDate(e, t, r, n, i, o, l);\n	}\n	getNow() {\n		return this._getScope().getNow();\n	}\n	getRandom() {\n		return this._getScope().getRandom?.() ?? Math.random();\n	}\n	createRange(e, t, r) {\n		return this._getScope().createRange(e, t, r);\n	}\n	flattenAreas(e) {\n		if (!Array.isArray(e)) return e;\n		let t = [];\n		for (let r = 0; r < e.length; r++) {\n			let n = e[r], { rows: i, columns: o } = n.getShape();\n			for (let l = 0; l < i; l++) for (let s = 0; s < o; s++) t.push(n.getValueAt(l, s));\n		}\n		return this.createRange(t.length, 1, (r, n) => t[n.rowIndex]);\n	}\n	getRow() {\n		return this._getScope().getRow?.() ?? 0;\n	}\n	getColumn() {\n		return this._getScope().getColumn?.() ?? 0;\n	}\n	isImplicitIntersect() {\n		return this._getScope().isImplicitIntersect?.() ?? !1;\n	}\n	getReference(e, t) {\n		return this._getScope().getReference(e, t);\n	}\n	getResizedReference(e, t, r) {\n		return this._getScope().getResizedReference(e, t, r);\n	}\n	getValueAt(e, t, r) {\n		return this._getScope().getValueAt(e, t, r);\n	}\n	getFormulaAt(e, t, r) {\n		return this._getScope().getFormulaAt?.(e, t, r) ?? null;\n	}\n	getSpillAt(e, t, r) {\n		return this._getScope().getSpillAt?.(e, t, r) ?? null;\n	}\n	getSheetIndex(e) {\n		return this._getScope().getSheetIndex?.(e) ?? -1;\n	}\n	getSheetCount() {\n		return this._getScope().getSheetCount?.() ?? 1;\n	}\n	markVolatile() {\n		this._getScope().markVolatile?.();\n	}\n	formatResults(e) {\n		this._getScope().formatResults?.(e);\n	}\n	filterHidden(e, t) {\n		return this._getScope().filterHidden?.(e, t) ?? e;\n	}\n	filterTotals(e) {\n		return this._getScope().filterTotals?.(e) ?? e;\n	}\n	getFunction(e) {\n		return this._getScope().getFunction?.(e) ?? null;\n	}\n	getAddress(e, t) {\n		return this._getScope().getAddress(e, t);\n	}\n	compare(e, t, r) {\n		return this._getScope().compare?.(e, t, r) ?? Pe.compare(e, t, r);\n	}\n	getRuntime() {\n		return this._getScope().getRuntime();\n	}\n	getArgs() {\n		let e = this._argsFn, t = e ? e() : null;\n		if (!t) throw new ie(Gr);\n		return t;\n	}\n	get [Symbol.toStringTag]() {\n		return \"[FormulaContext]\";\n	}\n	toString() {\n		return this._getScope()?.toString?.() ?? \"{STUB SCOPE}\";\n	}\n}, Ht = Object.freeze({\n	tag: \"en-US\",\n	numberingSystem: \"latn\",\n	decimal: \".\",\n	group: \",\",\n	grouping: [3],\n	minusSign: \"-\",\n	percentSign: \"%\",\n	permilleSign: \"‰\",\n	currencyCode: \"USD\",\n	currencySymbol: \"$\",\n	currencyDisplay: \"symbol\",\n	currencyPosition: \"before\",\n	currencySpacing: \"tight\",\n	date: Object.freeze({\n		calendar: \"gregory\",\n		short: \"M/d/yy\",\n		medium: \"MMM d, y\",\n		long: \"MMMM d, y\",\n		timeShort: \"h:mm a\",\n		timeLong: \"h:mm:ss a\",\n		am: \"AM\",\n		pm: \"PM\",\n		firstDay: 0,\n		weekend: [6, 0],\n		monthsWide: [\n			\"January\",\n			\"February\",\n			\"March\",\n			\"April\",\n			\"May\",\n			\"June\",\n			\"July\",\n			\"August\",\n			\"September\",\n			\"October\",\n			\"November\",\n			\"December\"\n		],\n		monthsAbbr: [\n			\"Jan\",\n			\"Feb\",\n			\"Mar\",\n			\"Apr\",\n			\"May\",\n			\"Jun\",\n			\"Jul\",\n			\"Aug\",\n			\"Sep\",\n			\"Oct\",\n			\"Nov\",\n			\"Dec\"\n		],\n		weekdaysWide: [\n			\"Sunday\",\n			\"Monday\",\n			\"Tuesday\",\n			\"Wednesday\",\n			\"Thursday\",\n			\"Friday\",\n			\"Saturday\"\n		],\n		weekdaysAbbr: [\n			\"Sun\",\n			\"Mon\",\n			\"Tue\",\n			\"Wed\",\n			\"Thu\",\n			\"Fri\",\n			\"Sat\"\n		],\n		hour12: !0\n	}),\n	listSeparator: \",\",\n	csvDelimiter: \",\",\n	rtl: !1,\n	collator: Object.freeze({\n		sensitivity: \"base\",\n		numeric: !0\n	})\n});\nnew Gi();\nconst Hi = [\n	{\n		name: \"param\",\n		group: \"jsdoc\",\n		description: \"Document a parameter. A string union type becomes a dropdown of allowed options.\",\n		snippet: \"param ${1:name} ${2:description}\"\n	},\n	{\n		name: \"returns\",\n		aliases: [\"return\"],\n		group: \"jsdoc\",\n		description: \"Describe the return value.\"\n	},\n	{\n		name: \"category\",\n		group: \"sheetxl\",\n		description: \"Group the function under a category in the function list.\",\n		snippet: \"category ${1:name}\"\n	},\n	{\n		name: \"name\",\n		group: \"sheetxl\",\n		description: \"A name an identifier cannot spell: the name formulas call a function by (MY.FUNC), or an enum member's label.\",\n		snippet: \"name ${1:NAME}\"\n	},\n	{\n		name: \"description\",\n		group: \"sheetxl\",\n		description: \"A longer description of the function.\"\n	},\n	{\n		name: \"deprecated\",\n		group: \"sheetxl\",\n		standalone: !0,\n		description: \"Mark the function as deprecated (optionally with a reason).\"\n	},\n	{\n		name: \"hidden\",\n		group: \"sheetxl\",\n		standalone: !0,\n		description: \"Hide the function from the function list.\"\n	},\n	{\n		name: \"returnkind\",\n		group: \"sheetxl\",\n		description: \"Declare the value kind of the return (a ValueKind word, e.g. `number`, `array`, `reference`) where the type spelling cannot say it (a union return collapses to any).\",\n		snippet: \"returnKind ${1:number}\"\n	},\n	{\n		name: \"example\",\n		group: \"jsdoc\",\n		description: \"Provide a usage example.\"\n	},\n	{\n		name: \"see\",\n		group: \"jsdoc\",\n		description: \"Reference a related function or link.\"\n	}\n], Wi = (() => {\n	const e = /* @__PURE__ */ new Map();\n	for (const t of Hi) if (e.set(t.name, t), t.aliases) for (const r of t.aliases) e.set(r, t);\n	return e;\n})();\nfunction Ji(e) {\n	if (!e) return;\n	const t = (e.startsWith(\"@\") ? e.slice(1) : e).toLowerCase();\n	return Wi.get(t);\n}\nfunction Yi(e) {\n	return Ji(e)?.standalone === !0;\n}\nconst ft = /* @__PURE__ */ new Map([[\"IReferenceRange\", \"p\"], [\"IRange\", \"r\"]]), it = new Set(Object.values(Vt).filter((e) => e !== Vt.Omitted)), yt = /* @__PURE__ */ new Map([\n	[\"IWorkbook\", \"workbook\"],\n	[\"IWorksheet\", \"sheet\"],\n	[\"ICellRanges\", \"ranges\"],\n	[\"ICellRange\", \"range\"]\n]), qi = Array.from(yt.keys()), wt = (e, t) => {\n	Array.from(t.keys()).forEach((r) => {\n		const n = t.get(r);\n		t.set(`${e}.${r}`, n);\n	});\n}, Zi = /* @__PURE__ */ new Map([\n	[\"Scalar\", \"*\"],\n	[\"Lambda\", \"l\"],\n	[\"FormulaError.Known\", me.Error],\n	[\"Date\", zt.Date],\n	[\"IRichData\", zt.RichData]\n]), Wr = /* @__PURE__ */ new Map([[\"Repeating\", \"repeating\"]]), Qi = /* @__PURE__ */ new Set([\"Flatten\", \"SheetXL.Flatten\"]), Jr = /* @__PURE__ */ new Set([\"AcceptError\"]), Yr = /* @__PURE__ */ new Set([\"Omittable\"]), qr = /* @__PURE__ */ new Set([\"NoLift\"]), Zr = /* @__PURE__ */ new Set([\"NoFilter\"]), Qr = /* @__PURE__ */ new Set([\"Lazy\"]), pt = /* @__PURE__ */ new Set([\"ReportType\"]), Wt = 255, eo = /^[a-zA-Z_-￿][a-zA-Z0-9_.-￿]*$/, to = /^([a-z]{1,3})([0-9]+)$/i, ro = /^r[0-9]*c[0-9]*$/i, no = (e) => {\n	if (ro.test(e)) return !0;\n	const t = to.exec(e);\n	if (!t) return !1;\n	let r = 0;\n	for (const i of t[1].toUpperCase()) r = r * 26 + (i.charCodeAt(0) - 64);\n	const n = Number(t[2]);\n	return r <= 16384 && n >= 1 && n <= 1048576;\n}, se = \"SheetXL\", Ee = (e) => {\n	const t = e.typeName.getText();\n	return t.startsWith(`${se}.`) ? t.slice(8) : t;\n};\nwt(se, ft);\nwt(se, yt);\nwt(se, Wr);\nJr.add(se + \".AcceptError\");\nYr.add(`${se}.Omittable`);\nqr.add(`${se}.NoLift`);\nZr.add(`${se}.NoFilter`);\nQr.add(`${se}.Lazy`);\npt.add(`${se}.ReportType`);\nconst io = /* @__PURE__ */ new Map([\n	[\"Promise\", () => ({ async: !0 })],\n	[\"Observable\", () => ({ stream: !0 })],\n	[\"Volatile\", () => ({ volatile: !0 })],\n	[`${se}.Volatile`, () => ({ volatile: !0 })]\n]), Jt = \"__scriptContext__\", Yt = \"script\", oo = /* @__PURE__ */ new Set([\n	\"IScript.ScriptContext\",\n	`${se}.IScript.ScriptContext`,\n	\"ScriptContext\"\n]), qt = (e, t) => {\n	const r = t.literal;\n	if (r === void 0) return;\n	const n = e.SyntaxKind;\n	switch (r.kind) {\n		case n.StringLiteral: return r.text;\n		case n.NumericLiteral: return parseFloat(r.text);\n		case n.TrueKeyword: return !0;\n		case n.FalseKeyword: return !1;\n		case n.NullKeyword: return null;\n		case n.PrefixUnaryExpression: return r.operator === n.MinusToken && r.operand?.kind === n.NumericLiteral ? -parseFloat(r.operand.text) : void 0;\n		default: return;\n	}\n}, $e = (e) => {\n	if (!e || e.length === 0) return \"\";\n	let t = \"\";\n	for (let r = 0; r < e.length; r++) {\n		const n = e[r], i = n.kind;\n		if (i !== \"link\") {\n			if (i === \"linkName\") {\n				const o = e[r + 1];\n				if (o?.kind === \"linkText\" && o.text.trim()) continue;\n				t += n.text;\n				continue;\n			}\n			if (i === \"linkText\") {\n				t += n.text.trim();\n				continue;\n			}\n			t += n.text;\n		}\n	}\n	return t.replace(/\\r\\n?/g, `\n`).split(/\\n[^\\S\\n]*\\n\\s*/).map((r) => r.split(`\n`).map((n) => n.trim()).filter(Boolean).join(\" \")).filter(Boolean).join(`\n`).trim();\n};\nfunction ao(e, t, r, n) {\n	const i = n?.builtInNames?.length ? new Set(n.builtInNames.map((u) => u.toUpperCase())) : null, o = [], l = /* @__PURE__ */ new Map(), s = [];\n	let c = null;\n	const d = (u) => {\n		if (!u || typeof u.getStart != \"function\") return {\n			start: 0,\n			length: 0\n		};\n		try {\n			return {\n				start: u.getStart(),\n				length: u.getWidth()\n			};\n		} catch {\n			return {\n				start: 0,\n				length: 0\n			};\n		}\n	}, m = (u, g, p, E) => {\n		const { start: C, length: O } = d(u);\n		s.push({\n			start: C,\n			length: O,\n			severity: p,\n			code: g,\n			message: E\n		});\n	}, a = (u, g, p) => {\n		m(u, g, \"error\", p);\n	}, f = (u) => u?.parent?.name?.escapedText, b = (u, g, p, E, C = !1, O = !1, j = !1) => {\n		const D = { count: 0 }, $ = Y(u, g, p, E, D, C, O, j);\n		D.count >= 2 && (g.range || (g.range = \"m\", D.count -= 2), !E && D.count >= 1 && (D.count -= 1, D.count > 0 && a(u, _.ArrayDepth, `Arrays of more than 2 dimensions are not supported: '${f(u)}'.`))), D.count > 0 && (g.arrayDepth = D.count);\n		const P = g.enum;\n		return P && (D.count > (j ? 1 : 0) || g.range) && !F.has(g) && (g.valueOrRange || (a(u, _.EnumPosition, `A list cannot hold the enum '${P.id}': '${g.name ?? f(u)}'. Its members reach the body as they are, so nothing checks them against the enum. Take one value per argument ('...x: ${P.id}[]'), or type the list by its scalar ('${P.type}').`), delete g.enum)), $;\n	}, v = (u, g, p, E, C) => {\n		if (g !== \"Lambda\" && g !== `${se}.Lambda`) return !1;\n		const O = u.typeArguments;\n		let j = \"*\";\n		if (O && O.length === 2) if (C && O[0].kind === e.SyntaxKind.TupleType && (p.lambdaArity = O[0].elements.length), O[1].kind === e.SyntaxKind.AnyKeyword) j = \"raw\";\n		else {\n			const D = {};\n			Y(O[1], D, E, !1, { count: 0 }), j = D.scalar ?? \"*\";\n		}\n		else if (O && O.length === 1 && O[0].kind !== e.SyntaxKind.TupleType && O[0].kind !== e.SyntaxKind.ArrayType) if (C && (p.lambdaArity = 2), O[0].kind === e.SyntaxKind.AnyKeyword) j = \"raw\";\n		else {\n			const D = {};\n			Y(O[0], D, E, !1, { count: 0 }), j = D.scalar ?? \"*\";\n		}\n		return p.lambda = j, !0;\n	}, A = (u, g, p, E) => {\n		if (!E) {\n			a(u, _.FunctionReturn, `Function type is not a valid return type: '${f(u)}'. Declare a 'Lambda' return instead.`);\n			return;\n		}\n		const C = u.type, O = {};\n		let j = \"*\";\n		C && (C.kind === e.SyntaxKind.AnyKeyword ? j = \"raw\" : (Y(C, O, p, !1, { count: 0 }), j = O.scalar ?? \"*\"));\n		const D = u.parameters;\n		D && !D.some(($) => $.dotDotDotToken) && (g.lambdaArity = D.length), g.lambda = j;\n	}, U = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map(), w = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Set(), F = /* @__PURE__ */ new WeakSet(), z = (u) => u !== void 0 && u.getSourceFile() === t, L = (u, g = !1) => {\n		return u.getJsDocTags(r).find((E) => E.name === \"name\")?.text?.map((E) => E.text).join(\"\").trim() || (g ? nr.camelToPrettyCase(u.name) : u.name);\n	}, R = (u) => {\n		const g = u.getJsDocTags(r).find((p) => p.name === \"deprecated\");\n		if (g) return g.text?.map((p) => p.text).join(\"\").trim() || !0;\n	}, M = (u, g) => {\n		const p = e.isTypeReferenceNode(u) ? u.typeName : void 0, E = p ? r.getSymbolAtLocation(p) : void 0, C = E?.declarations?.length ? E : void 0;\n		if (p) {\n			if (C && C.flags & e.SymbolFlags.Alias) {\n				a(u, _.EnumNotLocal, `'${p.getText()}' is imported, so its declaration cannot be read: '${g}'. An enum must be declared in the module that uses it.`);\n				return;\n			}\n			if (!C || !(C.flags & e.SymbolFlags.Type)) {\n				const x = p.getText();\n				if (!(C ? (C.flags & e.SymbolFlags.Variable) !== 0 : t.statements.some((I) => e.isVariableStatement(I) && I.declarationList.declarations.some((V) => e.isIdentifier(V.name) && V.name.text === x)))) return null;\n				a(u, _.EnumMissingAlias, `'${x}' is a value, not a type: '${g}'. Pair the object with a same-name type — 'type ${x} = typeof ${x}[keyof typeof ${x}];' — or declare it as 'enum ${x} { … }'.`);\n				return;\n			}\n			const y = U.get(C);\n			if (y !== void 0) return y;\n			if (S.has(C)) return;\n		}\n		const O = [];\n		let j = !1;\n		if (C && C.flags & e.SymbolFlags.Enum) {\n			if (!C.declarations?.some(z)) {\n				a(u, _.EnumNotLocal, `'${C.name}' is not declared in this module: '${g}'. An enum must be declared in the module that uses it.`);\n				return;\n			}\n			j = !0;\n			let y = !1;\n			if (C.exports?.forEach((x) => {\n				const I = x.valueDeclaration;\n				if (!I || !e.isEnumMember(I)) return;\n				const V = r.getConstantValue(I);\n				if (V === void 0) {\n					a(I, _.EnumMemberNotConstant, `'${C.name}.${x.name}' is not a constant number or string. A formula passes the VALUE, so every member needs one that can be read at compile time.`), y = !0;\n					return;\n				}\n				O.push([\n					L(x, !0),\n					V,\n					I,\n					$e(x.getDocumentationComment(r)),\n					R(x)\n				]);\n			}), y) {\n				S.add(C);\n				return;\n			}\n		} else {\n			const y = r.getTypeFromTypeNode(u), x = e.TypeFlags.Null | e.TypeFlags.Undefined | e.TypeFlags.Void, I = (y.isUnion() ? y.types : [y]).filter((B) => !(B.flags & x)), V = [];\n			for (const B of I) {\n				if (!(B.flags & (e.TypeFlags.NumberLiteral | e.TypeFlags.StringLiteral))) return C && U.set(C, null), null;\n				V.push(B.value);\n			}\n			if (V.length === 0) return null;\n			const re = C?.declarations?.find((B) => e.isTypeAliasDeclaration(B)), q = e.isUnionTypeNode(u) ? u : re?.type;\n			if (q && e.isUnionTypeNode(q)) {\n				const B = q.types.map((N) => {\n					const ne = r.getTypeFromTypeNode(N);\n					return ne.isLiteral() ? ne.value : void 0;\n				}), k = (N) => {\n					const ne = B.indexOf(N);\n					return ne < 0 ? B.length : ne;\n				};\n				V.sort((N, ne) => k(N) - k(ne));\n			}\n			const ee = C && C.flags & e.SymbolFlags.Variable ? C.valueDeclaration : void 0, he = new Set(V);\n			if (C && ee && z(ee)) for (const B of r.getTypeOfSymbolAtLocation(C, ee).getProperties()) {\n				const k = B.valueDeclaration, N = r.getTypeOfSymbolAtLocation(B, k ?? ee);\n				if (!(N.flags & (e.TypeFlags.NumberLiteral | e.TypeFlags.StringLiteral))) continue;\n				const ne = N.value;\n				V.includes(ne) && (j = !0, he.delete(ne), O.push([\n					L(B, !0),\n					ne,\n					k,\n					$e(B.getDocumentationComment(r)),\n					R(B)\n				]));\n			}\n			for (const B of V) he.has(B) && O.push([\n				String(B),\n				B,\n				void 0,\n				null\n			]);\n		}\n		if (O.length === 0) return null;\n		const D = typeof O[0][1] == \"number\";\n		if (O.some(([, y]) => typeof y == \"number\" !== D)) {\n			a(u, _.EnumMixed, `'${C?.name ?? u.getText()}' mixes number and string members: '${g}'. A parameter has one type, so an enum is all numbers or all strings.`);\n			return;\n		}\n		const $ = C ? L(C) : O.map(([, y]) => String(y)).join(\"|\"), P = C ? void 0 : h.get($);\n		if (P) return P;\n		if (j) {\n			const y = /* @__PURE__ */ new Map();\n			for (const [x, I, V, re] of O) {\n				const q = V?.name?.getText() ?? x, ee = y.get(I);\n				ee !== void 0 ? m(V ?? u, _.EnumDuplicateValue, \"warning\", `'${$}.${q}' has the same value as '${$}.${ee}' (${JSON.stringify(I)}). A formula passes the value, so the two cannot be told apart.`) : y.set(I, q), re === \"\" && m(V ?? u, _.EnumMemberUndocumented, \"warning\", `'${$}.${q}' is missing a description. Add a doc comment above the member — it is what the argument dropdown shows.`);\n			}\n		}\n		const G = {\n			id: $,\n			type: D ? me.Number : me.String,\n			members: O.map(([y, x, , , I]) => I ? [\n				y,\n				x,\n				I\n			] : [y, x])\n		};\n		C ? U.set(C, G) : h.set($, G);\n		const X = C ? $e(C.getDocumentationComment(r)) : \"\", K = {};\n		for (const [y, , , x] of O) x && (K[y] = { description: x });\n		if (X || Object.keys(K).length > 0) {\n			const y = {};\n			X && (y.summary = X), Object.keys(K).length > 0 && (y.members = K), w.set(G, y);\n		}\n		return G;\n	}, pe = (u, g, p, E) => {\n		const C = (D, $, P) => {\n			const G = { name: D };\n			return b($, G, p, !0), P && (G.optional = !0), E && !G.acceptError && (G.acceptError = !0), G;\n		};\n		if (u.kind !== e.SyntaxKind.TupleType) return [C(g, u, !1)];\n		const O = u.elements;\n		if (O.length < 2) return a(u, _.RepeatingSlots, `'${g}': a repeating group of period ${O.length} must be spelled 'Repeating<T>' without the tuple.`), null;\n		const j = [];\n		for (let D = 0; D < O.length; D++) {\n			const $ = O[D];\n			if ($.kind !== e.SyntaxKind.NamedTupleMember) return a($, _.RepeatingSlots, `'${g}': every slot of a repeating group must be labelled, e.g. 'Repeating<[criteriaRange: IRange, criteria: Scalar]>'.`), null;\n			const P = !!$.questionToken;\n			if (P && D !== O.length - 1) return a($, _.RepeatingOptional, `'${g}': only the LAST slot of a repeating group may be optional (slot '${$.name?.getText?.()}' is not).`), null;\n			j.push(C($.name?.getText?.() ?? `${D}`, $.type, P));\n		}\n		return j;\n	}, Y = (u, g, p, E, C, O = !1, j = !1, D = !1) => {\n		if (!u) {\n			a(u, _.MissingType, `Type is not defined for '${g?.name ?? \"return\"}'.`);\n			return;\n		}\n		if (u.kind === e.SyntaxKind.ParenthesizedType) return Y(u.type, g, p, E, C, O, j, D);\n		if (u.kind === e.SyntaxKind.UnionType) {\n			const $ = (X) => X.kind === e.SyntaxKind.UndefinedKeyword || X.kind === e.SyntaxKind.VoidKeyword || X.kind === e.SyntaxKind.NullKeyword || X.kind === e.SyntaxKind.LiteralType && X.literal?.kind === e.SyntaxKind.NullKeyword, P = u.types.filter((X) => !$(X));\n			if (P.length === 1) return Y(P[0], g, p, E, C, O, j, D);\n			const G = M(u, g.name ?? f(u));\n			if (G === void 0) return;\n			if (G !== null) {\n				g.scalar = G.type, E && (g.enum = G);\n				return;\n			}\n			if (!E) {\n				g.scalar = \"*\";\n				return;\n			}\n			if (P.length === 2) {\n				const X = (y) => y.kind !== e.SyntaxKind.TypeReference ? !1 : e.isTypeReferenceNode(y) && Ee(y) === \"Lambda\", K = P.findIndex(X);\n				if (K >= 0 && !X(P[1 - K])) {\n					Y(P[1 - K], g, p, E, C, O, j, D), v(P[K], Ee(P[K]), g, p, E);\n					return;\n				}\n			}\n			if (E && P.length === 2) {\n				const X = (y) => {\n					if (!(y.kind !== e.SyntaxKind.TypeReference || y.typeArguments?.length)) return ft.get(Ee(y));\n				}, K = P.findIndex((y) => X(y) !== void 0);\n				if (K >= 0 && X(P[1 - K]) === void 0) {\n					const y = {}, x = C.count;\n					if (Y(P[1 - K], y, p, E, C, O, !1), y.scalar && !y.range && y.lambda == null && C.count === x) {\n						g.range = X(P[K]), g.scalar = y.scalar, g.valueOrRange = !0;\n						const I = y.enum;\n						I && (g.enum = I);\n						return;\n					}\n				}\n			}\n			if (E && P.length === 2) {\n				const X = (y) => y.kind === e.SyntaxKind.TypeReference && !y.typeArguments?.length && Ee(y) === \"Scalar\", K = P.findIndex(X);\n				if (K >= 0 && !X(P[1 - K])) {\n					const y = M(P[1 - K], g.name ?? f(u));\n					if (y === void 0) return;\n					if (y !== null) {\n						g.scalar = \"*\", g.enum = y;\n						return;\n					}\n				}\n			}\n			a(u, _.InvalidParamType, `Union parameter types are not supported: '${f(u)}'. Use a single type, optionally with '| null' or '| undefined', 'T | Lambda<…>' for a value-or-lambda slot, 'IRange | Scalar' for a value-or-range slot, or 'E | Scalar' for an uncoerced slot whose values an enum documents.`);\n			return;\n		}\n		if (u.kind === e.SyntaxKind.NumberKeyword) g.scalar = me.Number;\n		else if (u.kind === e.SyntaxKind.StringKeyword) g.scalar = me.String;\n		else if (u.kind === e.SyntaxKind.BooleanKeyword) g.scalar = me.Boolean;\n		else if (u.kind === e.SyntaxKind.UndefinedKeyword || u.kind === e.SyntaxKind.NullKeyword || u.kind === e.SyntaxKind.VoidKeyword) {\n			if (E) {\n				a(u, _.UndefinedInput, `'undefined' is not a valid type for input: '${f(u)}'.`);\n				return;\n			}\n			g.scalar = me.Null;\n		} else if (u.kind === e.SyntaxKind.BigIntKeyword) g.scalar = me.Number;\n		else if (u.kind === e.SyntaxKind.AnyKeyword) E && (g.range = \"*\");\n		else if (u.kind === e.SyntaxKind.ArrayType) {\n			const $ = u.elementType;\n			if (!$) {\n				a(u, _.UntypedArray, `'Array' must be typed: '${f(u)}'.`);\n				return;\n			}\n			if (E && j) {\n				const P = g, G = P.name ?? f(u) ?? \"parameter\", X = P.acceptError;\n				delete P.acceptError;\n				const K = { name: G };\n				b($, K, p, !0), X && !K.acceptError && (K.acceptError = !0), P.repeating = [K];\n				return;\n			}\n			C.count++, Y($, g, p, E, C);\n		} else if (u.kind !== e.SyntaxKind.TupleType) if (u.kind === e.SyntaxKind.TypeReference) {\n			const $ = Ee(u);\n			if (Jr.has($)) {\n				const y = f(u);\n				if (!E) {\n					a(u, _.InvalidReturnType, `'${$}' is not a valid return type: '${y}'. It describes how an ARGUMENT is received.`);\n					return;\n				}\n				const x = g;\n				if (x.acceptError) {\n					a(u, _.InvalidParamType, `'${y}' declares 'AcceptError' more than once.`);\n					return;\n				}\n				const I = u.typeArguments;\n				if (!I || I.length !== 1) {\n					a(u, _.GenericArity, `'${$}' must be typed with exactly 1 type: '${y}'.`);\n					return;\n				}\n				return x.acceptError = !0, Y(I[0], g, p, E, C, O, j, D);\n			}\n			if (pt.has($)) {\n				const y = g.name ?? f(u);\n				if (!E) {\n					a(u, _.InvalidReturnType, `'ReportType' is not a valid return type: '${y}'. It describes how an ARGUMENT is received.`);\n					return;\n				}\n				const x = u.typeArguments;\n				if (!x || x.length !== 1) {\n					a(u, _.GenericArity, `'${$}' must be typed with exactly 1 type: '${y}'.`);\n					return;\n				}\n				return g.reportType = !0, Y(x[0], g, p, E, C, O, j, D);\n			}\n			if (qr.has($)) {\n				const y = g.name ?? f(u);\n				if (!E) {\n					a(u, _.InvalidReturnType, `'NoLift' is not a valid return type: '${y}'. It describes how an ARGUMENT is received.`);\n					return;\n				}\n				const x = u.typeArguments;\n				if (!x || x.length !== 1) {\n					a(u, _.GenericArity, `'${$}' must be typed with exactly 1 type: '${y}'.`);\n					return;\n				}\n				const I = g;\n				I.noLift = !0;\n				const V = C.count;\n				Y(x[0], g, p, E, C, O, j, D), (I.range || I.lambda != null || I.repeating || C.count !== V) && a(u, _.InvalidParamType, `'${y}': 'NoLift' applies to a SCALAR parameter only - a range, list, repeating or lambda slot never lifts.`);\n				return;\n			}\n			if (Zr.has($)) {\n				const y = g.name ?? f(u);\n				if (!E) {\n					a(u, _.InvalidReturnType, `'NoFilter' is not a valid return type: '${y}'. It describes how an ARGUMENT is received.`);\n					return;\n				}\n				const x = u.typeArguments;\n				if (!x || x.length !== 1) {\n					a(u, _.GenericArity, `'${$}' must be typed with exactly 1 type: '${y}'.`);\n					return;\n				}\n				const I = g;\n				I.noFilter = !0;\n				const V = C.count;\n				if (Y(x[0], g, p, E, C, O, j, D), I.range || I.lambda != null || C.count !== V) {\n					a(u, _.InvalidParamType, `'${y}': 'NoFilter' applies to a SCALAR slot only - a range, list or lambda slot has no members to coerce.`);\n					return;\n				}\n				const re = I.repeating;\n				if (re) {\n					if (delete I.noFilter, re.length !== 1) {\n						a(u, _.InvalidParamType, `'${y}': 'NoFilter' over a repeating group applies to a period-1 group only - write it on the slot that takes the members.`);\n						return;\n					}\n					re[0].noFilter = !0;\n				} else j && a(u, _.InvalidParamType, `'${y}': 'NoFilter' applies to a REPEATING slot only - a single scalar argument has no members to coerce.`);\n				return;\n			}\n			if (Yr.has($)) {\n				const y = g.name ?? f(u);\n				if (!E) {\n					a(u, _.InvalidReturnType, `'Omittable' is not a valid return type: '${y}'. It describes how an ARGUMENT is received.`);\n					return;\n				}\n				const x = u.typeArguments;\n				if (!x || x.length < 1 || x.length > 2) {\n					a(u, _.GenericArity, `'${$}' must be typed with 1 or 2 types: '${y}'.`);\n					return;\n				}\n				const I = g;\n				if (I.omittable = !0, x.length === 2) {\n					const q = qt(e, x[1]);\n					if (q === void 0) {\n						a(u, _.InvalidParamType, `'${y}' declares '${$}' with a second type that is not a literal value. Use a number, string, boolean or null - the engine substitutes it for an omitted argument.`);\n						return;\n					}\n					I.omittedValue = q;\n				}\n				const V = Y(x[0], g, p, E, C, O, j, D), re = I.omittedValue;\n				return I.enum && re !== void 0 && re !== null && !I.enum.members.some(([, q]) => q === re) && a(x[1], _.EnumOmittedValue, `'${y}': ${JSON.stringify(re)} is not a member of '${I.enum.id}'. An omitted argument must mean a member (${I.enum.members.map(([, q]) => JSON.stringify(q)).join(\", \")}) or null.`), V;\n			}\n			if (Qr.has($)) {\n				const y = g.name ?? f(u);\n				if (!E) {\n					a(u, _.InvalidReturnType, `'Lazy' is not a valid return type: '${y}'. It describes how an ARGUMENT is received.`);\n					return;\n				}\n				const x = g;\n				if (x.lazy) {\n					a(u, _.InvalidParamType, `'${y}' declares 'Lazy' more than once.`);\n					return;\n				}\n				const I = u.typeArguments;\n				if (!I || I.length < 1 || I.length > 2) {\n					a(u, _.GenericArity, `'${$}' must be typed with 1 or 2 types: '${y}'.`);\n					return;\n				}\n				if (x.lazy = !0, I.length === 2) {\n					const V = qt(e, I[1]);\n					if (V === void 0) {\n						a(u, _.InvalidParamType, `'${y}' declares '${$}' with a second type that is not a literal value. Use a number, string, boolean or null - the engine substitutes it for an absent argument.`);\n						return;\n					}\n					x.optional = !0, x.defaultValue = V;\n				}\n				Y(I[0], g, p, E, C, O, j, D), x.enum ? (a(u, _.EnumPosition, `'${y}': 'Lazy' cannot hold the enum '${x.enum.id}'. The argument may never be evaluated, so there is no point at which it could be checked against the members.`), delete x.enum) : x.lambda != null ? a(u, _.InvalidParamType, `'${y}': 'Lazy' cannot be combined with a Lambda parameter - a callable slot is already the body's to call, or not.`) : x.repeating && a(u, _.InvalidParamType, `'${y}': 'Lazy' applies to a VALUE, not to a repeating group - mark the group's slots instead.`);\n				return;\n			}\n			if (Qi.has($)) {\n				const y = g.name ?? f(u);\n				if (!E) {\n					a(u, _.InvalidReturnType, `'Flatten' is not a valid return type: '${y}'. It describes how an ARGUMENT is received.`);\n					return;\n				}\n				const x = u.typeArguments;\n				if (!x || x.length !== 1) {\n					a(u, _.GenericArity, `'${$}' must be typed with exactly 1 type: '${y}'.`);\n					return;\n				}\n				return C.count++, Y(x[0], g, p, E, C, O);\n			}\n			if (Wr.get($) === \"repeating\") {\n				const y = g.name ?? f(u);\n				if (!E) {\n					a(u, _.RepeatingPosition, `'Repeating' is not a valid return type: '${y}'.`);\n					return;\n				}\n				if (C.count !== 0) {\n					a(u, _.RepeatingPosition, `'Repeating' cannot be nested inside another type: '${y}'.`);\n					return;\n				}\n				const x = g, I = u.typeArguments;\n				if (!I || I.length < 1 || I.length > 2) {\n					a(u, _.GenericArity, `'${$}' must be typed with 1 type, optionally followed by a maximum argument count: '${y}'.`);\n					return;\n				}\n				let V;\n				if (I.length === 2) {\n					const ee = I[1], he = ee.kind === e.SyntaxKind.LiteralType ? ee.literal : null, B = he && he.kind === e.SyntaxKind.NumericLiteral ? Number(he.text) : NaN;\n					if (!Number.isInteger(B) || B < 1 || B > Wt) {\n						a(ee, _.RepeatingMax, `'${y}': '${$}'’s maximum must be a whole number between 1 and ${Wt}.`);\n						return;\n					}\n					V = B, p.maxArguments = B;\n				}\n				if (D) {\n					if (V === void 0) {\n						a(u, _.RepeatingPosition, `'${y}' is a rest parameter and a repeating group. A group already repeats — drop the '...', or give the group a maximum ('Repeating<T, 254>') if the ceiling is all you meant.`);\n						return;\n					}\n					return Y(I[0], g, p, E, C, O, j);\n				}\n				const re = x.acceptError;\n				delete x.acceptError;\n				const q = pe(I[0], y ?? \"parameter\", p, re);\n				q && (x.repeating = q);\n				return;\n			}\n			const P = ft.get($);\n			let G = !1;\n			P && (g.range = P, G = !0);\n			const X = Zi.get($);\n			if (X && (g.scalar = X), X !== void 0 && (G = !0), v(u, $, g, p, E)) return;\n			if (E) {\n				if ($ === \"Volatile\" || $ === `${se}.Volatile`) {\n					a(u, _.InvalidParamType, `'Volatile' is not a valid parameter type: '${f(u)}'. It describes the function's RESULT, so it belongs on the return type.`);\n					return;\n				}\n				if (oo.has($)) return Jt;\n				const y = yt.get($);\n				if (y) return y;\n			} else {\n				const y = io.get($);\n				if (y) {\n					const x = Object.assign(g, y());\n					let I = 0;\n					if (x.async && I++, x.stream && I++, I > 1) {\n						a(u, _.MultipleModifiers, `'${$}' cannot have multiple modifiers: '${f(u)}'.`);\n						return;\n					}\n					G = !0;\n				}\n			}\n			if (!G) {\n				const y = M(u, g.name ?? f(u));\n				if (y === void 0) return;\n				if (y !== null) {\n					g.scalar = y.type, E && (g.enum = y);\n					return;\n				}\n			}\n			if (!G) {\n				const y = \"number, string, boolean, Scalar, Lambda, Date, FormulaError.Known, IRichData, IRange, IReferenceRange (and arrays of these; optionally wrapped in AcceptError<T>, or grouped with Repeating<T>)\", x = \"number, string, boolean, Scalar, Date, FormulaError.Known, IRichData, IRange, Promise<T>, Observable<T>, Volatile<T> (and arrays of these)\";\n				let I;\n				E ? O ? I = `'${$}' is not a valid first parameter: '${f(u)}'. The first parameter is EITHER a macro target (making this a macro) OR a calculation input (making this a calculation function). Allowed: ${qi.join(\", \")} (macro target); ${y} (calculation input).` : I = `'${$}' is not a valid parameter type: '${f(u)}'. Allowed: ${y}.` : I = `'${$}' is not a valid return type: '${f(u)}'. Allowed: ${x}.`, a(u, E ? _.InvalidParamType : _.InvalidReturnType, I);\n				return;\n			}\n			const K = u.typeArguments;\n			if (K) {\n				if (K.length !== 1) {\n					a(u, _.GenericArity, `'${$}' must be typed with exactly 1 type: '${f(u)}'.`);\n					return;\n				}\n				const y = K[0], x = E && e.isTypeReferenceNode(y) && pt.has(Ee(y)), I = g.reportType;\n				x && F.add(g), b(y, g, p, E), x && I === void 0 && delete g.reportType;\n				const V = g.enum;\n				V && !x && (a(K[0], _.EnumPosition, `'${$}' cannot hold the enum '${V.id}': '${f(u)}'. The members of a range reach the body as they are, so nothing checks them against the enum. Take the enum as a value, or type the range by its scalar ('${$}<${V.type}>').`), delete g.enum);\n			}\n		} else u.kind === e.SyntaxKind.FunctionType && A(u, g, p, E);\n	}, We = (u) => (e.getCombinedModifierFlags(u) & e.ModifierFlags.Export) !== 0, Je = (u) => (e.getCombinedModifierFlags(u) & e.ModifierFlags.Default) !== 0;\n	try {\n		e.forEachChild(t, (u) => {\n			if (We(u) && e.isFunctionDeclaration(u)) {\n				const g = u?.name?.getText();\n				if (!u.body) {\n					a(u, _.NoBody, `'${g}': function has no body.`);\n					return;\n				}\n				if (!g) {\n					a(u, _.Anonymous, \"Anonymous exported functions are not allowed.\");\n					return;\n				}\n				const p = {}, E = { parameters: {} };\n				try {\n					p.name = g;\n					const C = r.getSymbolAtLocation(u.name), O = $e(C?.getDocumentationComment(r));\n					O && (E.summary = O);\n					const j = {};\n					b(u.type, j, p, !1), p.returnType = j;\n					const D = {};\n					Je(u) && (D.default = !0, c = g), p.parameters = [];\n					const $ = /* @__PURE__ */ new Map(), P = /* @__PURE__ */ new Map(), G = /* @__PURE__ */ new Set();\n					let X = null, K = null, y = null, x = 0, I = !1, V = 0;\n					for (let B = 0; B < u.parameters.length; B++) {\n						const k = u.parameters[B], N = {};\n						N.name = k.name?.getText();\n						const ne = p.parameters.length === 0;\n						if (n?.lenient && B === 0 && !k.type && D.default) {\n							p.context = Yt;\n							continue;\n						}\n						const Ie = b(k.type, N, p, !0, ne, !k.dotDotDotToken, !!k.dotDotDotToken);\n						if (Ie === Jt) {\n							B === 0 && p.context === void 0 && (p.context = Yt);\n							continue;\n						}\n						if (Ie) {\n							if (p.parameters.length !== 0) {\n								a(k, _.ContextNotFirst, `'${p.name}' contexts must be the first parameter: '${N.name}'.`);\n								return;\n							}\n							p.context = Ie;\n							continue;\n						}\n						if (N.lambda !== void 0) {\n							if (X !== null) {\n								a(k, _.MultipleLambda, `'${p.name}' has more than one Lambda parameter ('${X}' and '${N.name}'). Only one Lambda parameter is allowed.`);\n								return;\n							}\n							X = N.name;\n						} else if (X !== null) {\n							a(k, _.LambdaNotLast, `'${p.name}' Lambda parameter ('${X}') must be the last parameter, but '${N.name}' follows it.`);\n							return;\n						}\n						const ye = N.optional === !0 || !((k.initializer === void 0 || k.initializer === null) && (k.questionToken === void 0 || k.questionToken === null));\n						let ae;\n						if (ye && (N.optional = !0, k.initializer)) try {\n							if (k.initializer.kind === e.SyntaxKind.StringLiteral) ae = k.initializer.text;\n							else if (k.initializer.kind === e.SyntaxKind.NumericLiteral) ae = parseFloat(k.initializer.text);\n							else if (k.initializer.kind === e.SyntaxKind.TrueKeyword || k.initializer.kind === e.SyntaxKind.FalseKeyword) ae = k.initializer.kind === e.SyntaxKind.TrueKeyword;\n							else if (k.initializer.kind === e.SyntaxKind.NullKeyword) ae = null;\n							else if (e.isPrefixUnaryExpression(k.initializer) && k.initializer.operator === e.SyntaxKind.MinusToken && k.initializer.operand.kind === e.SyntaxKind.NumericLiteral) ae = -parseFloat(k.initializer.operand.text);\n							else if (e.isPropertyAccessExpression(k.initializer) || e.isElementAccessExpression(k.initializer)) {\n								const ue = r.getTypeAtLocation(k.initializer);\n								ue.flags & (e.TypeFlags.NumberLiteral | e.TypeFlags.StringLiteral) && (ae = ue.value);\n							}\n						} catch (ue) {\n							console.warn(`Couldn't extract default value for parameter '${N.name}'`, ue);\n						}\n						k.dotDotDotToken && (N.rest = !0);\n						const H = N.repeating;\n						if (H) {\n							if (N.rest) {\n								a(k, _.RepeatingPosition, `'${p.name}' parameter '${N.name}' is both a rest parameter and a repeating group. A group already repeats — drop the '...'.`);\n								return;\n							}\n							if (ye && H.length === 1) {\n								a(k, _.RepeatingOptional, `'${p.name}' parameter '${N.name}' cannot be an optional repeating group. Use '...${N.name}: T[]' for zero-or-more, or drop the '?' for one-or-more.`);\n								return;\n							}\n							if (K !== null) {\n								a(k, _.MultipleRepeating, `'${p.name}' has more than one repeating group ('${K}' and '${N.name}'). Only one is allowed — two would make the argument count ambiguous.`);\n								return;\n							}\n							if (y !== null) {\n								a(k, _.RepeatingOptional, `'${p.name}' parameter '${y}' is optional and precedes the repeating group '${N.name}'. Every parameter outside a group must be required.`);\n								return;\n							}\n							K = N.name, x = H.length, I = H[H.length - 1].optional === !0;\n						} else if (K !== null && N.rest) {\n							a(k, _.RepeatingOptional, `'${p.name}' parameter '${N.name}' is a rest parameter and follows the repeating group '${K}'. Two variadic tails would make the argument count ambiguous.`);\n							return;\n						} else if (K !== null && ye) {\n							if (V >= x - 1) {\n								a(k, _.RepeatingOptional, x === 1 ? `'${p.name}' parameter '${N.name}' is optional and follows the period-1 repeating group '${K}'. One more argument is indistinguishable from one more repetition — make it required, or give the group a period.` : `'${p.name}' has ${V + 1} optional parameters after the repeating group '${K}', which has period ${x}. At most ${x - 1} may be optional, or the argument count no longer decides the parse.`);\n								return;\n							}\n							if (I) {\n								a(k, _.RepeatingOptional, `'${p.name}' parameter '${N.name}' is optional and follows '${K}', whose own last slot is already optional. Both omissions reach the same argument count — drop one.`);\n								return;\n							}\n							V++;\n						}\n						ye && !H && (y = N.name);\n						const W = (N.range ? 2 : 0) + (N.arrayDepth ?? 0), De = N.range === \"r\" || N.range === \"p\" || N.range === \"*\", Q = N.rest || De ? 3 : 2;\n						if (W > Q) {\n							a(k, _.ArrayDepth, `'${p.name}' parameter '${N.name}' has an array depth of ${W}; the maximum is ${Q}${N.rest ? \" for a rest parameter\" : \" (use a rest parameter for one more level, or an IRange)\"}.`);\n							return;\n						}\n						p.parameters.push(N);\n						const ce = { description: \"\" };\n						E.parameters[N.name] = ce;\n						const Ye = r.getSymbolAtLocation(k.name);\n						ce.description = $e(Ye?.getDocumentationComment(r)), ae !== void 0 && (N.defaultValue = ae);\n						for (const ue of [N, ...N.repeating ?? []]) {\n							const we = ue.enum ? w.get(ue.enum) : void 0;\n							we && ((E.enums ??= {})[ue.enum.id] = we);\n						}\n						if ($.set(N.name, N), P.set(N.name, k), H && H.length > 1) {\n							G.add(N.name);\n							for (const ue of H) {\n								const we = `${N.name}.${ue.name}`;\n								E.parameters[we] = { description: \"\" }, $.set(we, ue), P.set(we, k);\n							}\n						}\n					}\n					const re = p.maxArguments;\n					if (re !== void 0) {\n						const B = p.parameters ?? [];\n						if (!B.some((N) => N.rest === !0 || N.repeating !== void 0)) {\n							a(u, _.RepeatingMax, `'${p.name}' declares a maximum of ${re} arguments but takes a fixed ${B.length}. A maximum only means something on a variadic tail.`);\n							return;\n						}\n						let k = 0;\n						for (const N of B) N.rest === !0 || N.optional === !0 || (k += N.repeating ? N.repeating.length : 1);\n						if (re < k) {\n							a(u, _.RepeatingMax, `'${p.name}' declares a maximum of ${re} arguments but requires ${k}.`);\n							return;\n						}\n					}\n					if (u.jsDoc && u.jsDoc.length > 0) {\n						const B = u.jsDoc, k = B.length;\n						for (let N = 0; N < k; N++) {\n							const ne = B[N]?.tags;\n							if (!ne) continue;\n							const Ie = ne.length;\n							for (let ye = 0; ye < Ie; ye++) {\n								const ae = ne[ye];\n								let H = ae?.tagName?.text;\n								if (!H) continue;\n								H = H.toLowerCase();\n								let W = ae.comment;\n								const De = Yi(H);\n								if (typeof W != \"string\" && !De) {\n									H === \"returnkind\" && a(ae, _.UnknownReturnKind, `'@returnKind' needs a value kind. Known: ${[...it].map((Q) => `'${Q}'`).join(\", \")}.`);\n									continue;\n								}\n								if (typeof W == \"string\" && (W = W.replace(/\\r\\n?/g, `\n`).trim()), !(!De && W && (W = W.split(`\n`)[0].trim(), !W || W.length === 0))) {\n									if (W && typeof W == \"string\") {\n										const Q = /\\{@link(code|plain)?\\s+([^}|]+)(?:\\s*\\|\\s*([^}]+))?\\}/g;\n										let ce, Ye = W, ue = [];\n										for (; (ce = Q.exec(W)) !== null;) {\n											const [we, xo, nn, St] = ce, on = [nn.trim()];\n											St && on.push(St.trim());\n										}\n										W = Ye, ue.length > 0 && H === \"see\" && (E.links || (E.links = []), E.links.push(...ue));\n									}\n									if (H === \"name\") {\n										const Q = W;\n										Q !== g && (E.name = Q);\n									} else if (H !== \"description\") {\n										if (H === \"param\") {\n											const Q = ae.name?.getText?.() ?? ae.name?.text;\n											if (!$.get(Q)) {\n												a(ae, _.UnknownParam, `Parameter '${Q}' not found in function '${g}'.`);\n												continue;\n											}\n											const ce = E.parameters?.[Q];\n											ce && !ce.description && typeof W == \"string\" && W && (ce.description = W);\n										} else if (H === \"returns\" || H === \"return\") p.returnType.description = W;\n										else if (H === \"returnkind\") {\n											const Q = (W ?? \"\").trim().toLowerCase();\n											it.has(Q) ? p.returnType.kind = Q : a(ae, _.UnknownReturnKind, `'@returnKind ${Q}' is not a known value kind. Known: ${[...it].map((ce) => `'${ce}'`).join(\", \")}.`);\n										} else if (H === \"category\") E.category = W;\n										else if (H === \"deprecated\" || H === \"hidden\") {\n											let Q = !0;\n											const ce = W?.toLowerCase();\n											ce === \"false\" ? Q = !1 : ce !== \"true\" && (Q = W), Q !== !1 && (E.deprecated = Q ?? !0, p.hidden = !0);\n										}\n									}\n								}\n							}\n						}\n					}\n					Object.keys(p.returnType).length === 0 && delete p.returnType, Object.keys(D).length > 0 && (p.behavior = D), E.summary || m(u.name ?? u, _.MissingSummary, \"warning\", `'${g}': missing a description. Add a JSDoc comment above the function.`);\n					const q = !p.context, ee = q && E.name || g;\n					if (q && !eo.test(ee)) {\n						const B = E.name ? `'@name ${E.name}'` : `'${ee}'`;\n						a(u.name ?? u, _.InvalidName, `'${g}': ${B} cannot be called from a formula. A function name starts with a letter or '_', and continues with letters, digits, '_' or '.'.` + (E.name ? \"\" : \" Add an '@name' tag to register it under another name.\"));\n						return;\n					}\n					if (q && !n?.isBuiltIn && no(ee)) {\n						const B = E.name ? `'@name ${E.name}'` : `'${ee}'`;\n						a(u.name ?? u, _.InvalidName, `'${g}': ${B} cannot be called from a formula. It reads as a cell address.` + (E.name ? \"\" : \" Add an '@name' tag to register it under another name.\"));\n						return;\n					}\n					const he = l.get(ee.toUpperCase());\n					if (he !== void 0) {\n						a(u.name ?? u, _.DuplicateName, `'${g}': '${ee}' is already the name of '${he}' in this module.`);\n						return;\n					}\n					if (l.set(ee.toUpperCase(), g), q && i?.has(ee.toUpperCase())) {\n						a(u.name ?? u, _.BuiltInName, `'${ee}' is a built-in function. Choose a different name - a calculation function cannot replace a built-in.`);\n						return;\n					}\n					if (q) {\n						const B = E.parameters ?? {};\n						for (const [k, N] of Object.entries(B)) if (!G.has(k) && !N.description) {\n							const ne = P.get(k);\n							m(ne, _.MissingParamDescription, \"warning\", `'${g}': parameter '${k}' is missing a description. Add an '@param ${k}' tag.`);\n						}\n					}\n					o.push([p, E]);\n				} catch (C) {\n					a(u, _.ParseError, `'${g}': ${C.message}`);\n				}\n			}\n		});\n	} catch (u) {\n		a(void 0, _.ParseError, `Unable to analyze module: ${u?.message ?? u}`);\n	}\n	return {\n		functions: o,\n		autoRun: c,\n		diagnostics: s\n	};\n}\nconst Ge = \"__SHEETXL\";\nvar lo = /* @__PURE__ */ rr({ initialize: () => so });\nasync function so() {\n	return xe || (xe = new Promise(async (e, t) => {\n		try {\n			const r = \"0.20.2\", n = `https://esm.sh/esbuild-wasm@${r}`, i = `https://esm.sh/esbuild-wasm@${r}/esbuild.wasm`, o = (await import(\n				/* webpackIgnore: true */\n				/* @vite-ignore */\n				n\n)).default;\n			await o.initialize({\n				wasmURL: i,\n				worker: !1\n			}), e(o);\n		} catch (r) {\n			console.error(\"Error initializing esbuild:\", r), xe = null, t(new Error(\"The script bundler could not be loaded. Check your connection and try again.\", { cause: r }));\n		}\n	}), xe);\n}\nvar xe, co = tr((() => {\n	xe = null;\n}));\nlet _e = null, je = null;\nasync function uo() {\n	if (_e) return _e;\n	if (je) {\n		if (await je, !_e) throw new Error(\"ESBuild initialization promise resolved, but instance is not available.\");\n		return _e;\n	}\n	let e, t;\n	je = new Promise((r, n) => {\n		e = r, t = n;\n	});\n	try {\n		const { initialize: r } = await Promise.resolve().then(() => (co(), lo));\n		return _e = await r(), e(), _e;\n	} catch (r) {\n		throw console.error(\"Failed to import or initialize esbuild:\", r), je = null, t(r), r;\n	}\n}\nconst fo = { compilerOptions: { target: \"esnext\" } };\nasync function po(e, t, r = \"/script.js\", n = Ge, i = !1) {\n	try {\n		const o = await uo(), l = \"@sheetxl/primitives\", s = `\n      export const FormulaContext = globalThis.${n}?.FormulaContext;\n      export const ScalarType = globalThis.${n}?.ScalarType;\n      export const Observable = globalThis.${n}?.Observable;\n      export const IRange = globalThis.${n}?.IRange;\n      export const FormulaError = globalThis.${n}?.FormulaError;\n      // Add more exports as needed\n    `, c = await o.build({\n			entryPoints: [r],\n			bundle: !0,\n			write: !1,\n			format: \"esm\",\n			plugins: [{\n				name: \"sheetxl-esbuild-in-memory\",\n				setup(d) {\n					const m = \"sheetxl-\" + (/* @__PURE__ */ new Date()).getTime();\n					d.onResolve({ filter: new RegExp(`^(${r.replace(\"/\", \"\\\\/\")}|${l})$`) }, (a) => ({\n						path: a.path,\n						namespace: m\n					})), d.onResolve({ filter: /.*/ }, (a) => {\n						if (a.namespace !== m) return console.warn(`esbuild: Treating import \"${a.path}\" as external.`), {\n							path: a.path,\n							external: !0\n						};\n					}), d.onLoad({\n						filter: /.*/,\n						namespace: m\n					}, (a) => {\n						let f;\n						if (a.path === r) f = t;\n						else if (a.path === l) f = s;\n						else return { errors: [{ text: `Cannot load unknown path in ${m}: ${a.path}` }] };\n						return {\n							contents: f,\n							loader: \"ts\"\n						};\n					});\n				}\n			}],\n			sourcemap: \"inline\",\n			tsconfigRaw: fo,\n			minify: i,\n			platform: \"neutral\"\n		});\n		if (c.outputFiles && c.outputFiles.length > 0) return c.outputFiles[0].text;\n		throw c.errors && c.errors.length > 0 ? /* @__PURE__ */ new Error(`esbuild bundling failed: ${c.errors.map((d) => d.text).join(`\n`)}`) : /* @__PURE__ */ new Error(\"esbuild did not produce an output file.\");\n	} catch (o) {\n		throw console.error(\"esbuild bundling process failed:\", o), o;\n	}\n}\nfunction mo(e, t, r) {\n	return (n) => {\n		const i = n.factory, o = () => i.createExpressionStatement(i.createCallChain(i.createPropertyAccessExpression(i.createIdentifier(Ge), \"checkRun\"), i.createToken(e.SyntaxKind.QuestionDotToken), void 0, [i.createStringLiteral(t), i.createNumericLiteral(r)])), l = (a) => {\n			const f = a.statements;\n			let b = 0;\n			for (; b < f.length && e.isExpressionStatement(f[b]) && e.isStringLiteral(f[b].expression);) b++;\n			return i.updateBlock(a, [\n				...f.slice(0, b),\n				o(),\n				...f.slice(b)\n			]);\n		}, s = (a) => e.isBlock(a) ? l(a) : i.createBlock([o(), a], !0), c = (a) => e.isBlock(a) ? l(a) : i.createBlock([o(), i.createReturnStatement(a)], !0), d = (a) => e.isForStatement(a) || e.isForInStatement(a) || e.isForOfStatement(a) || e.isWhileStatement(a) || e.isDoStatement(a), m = (a) => {\n			if (d(a)) {\n				const f = a.statement;\n				return e.visitEachChild(a, (b) => {\n					const v = m(b);\n					return b === f ? s(v) : v;\n				}, n);\n			}\n			if (e.isFunctionLike(a) && a.body) {\n				const f = a.body;\n				return e.visitEachChild(a, (b) => {\n					const v = m(b);\n					return b === f ? c(v) : v;\n				}, n);\n			}\n			return e.visitEachChild(a, m, n);\n		};\n		return (a) => e.visitNode(a, m);\n	};\n}\nconst Zt = \"//# sourceMappingURL\";\nvar en = /* @__PURE__ */ rr({\n	initialize: () => ho,\n	readLibFile: () => go\n});\nasync function ho() {\n	return Te || (Te = new Promise(async (e, t) => {\n		let r = null;\n		try {\n			r = await import(\n				/* webpackIgnore: true */\n				/* @vite-ignore */\n				\"https://esm.sh/typescript@5.7.2\"\n);\n		} catch (n) {\n			console.error(\"Error initializing Browser TypeScript module:\", n);\n		}\n		r || (console.log(\"use script fallback\"), Te = null), e(r);\n	}), Te);\n}\nfunction go(e, t) {}\nvar Te, tn = tr((() => {\n	Te = null;\n}));\nconst yo = `\n/**\n * Represents the completion of an asynchronous operation\n */\ninterface Promise<T> {\n  /**\n   * Attaches a callback that is invoked when the Promise is settled (fulfilled or rejected). The\n   * resolved value cannot be modified from the callback.\n   * @param onfinally The callback to execute when the Promise is settled (fulfilled or rejected).\n   * @returns A Promise for the completion of the callback.\n   */\n  finally(onfinally?: (() => void) | undefined | null): Promise<T>;\n}\n`, wo = `\n  interface FirstTest {\n    isTrue?: boolean;\n  }\n`, So = async () => wo;\nlet Ke = null;\nconst ot = \"sheetxl.d.ts\", Qt = \"sheetxl-modules.d.ts\", bo = `declare module '@sheetxl/primitives' { export = SheetXL; }\n`, vo = [\n	\"lib.webworker.d.ts\",\n	\"lib.es2020.d.ts\",\n	\"lib.esnext.asynciterable.d.ts\"\n], er = /* @__PURE__ */ new Map();\nlet at = null, lt = null;\nasync function Eo() {\n	return lt || (lt = Promise.resolve().then(() => (tn(), en)).then(async (e) => {\n		const t = await rn();\n		return e.readLibFile(t, \"lib.es5.d.ts\") !== void 0 ? e.readLibFile : null;\n	})), lt;\n}\nasync function rn() {\n	if (Ke) return Ke;\n	try {\n		const e = await (await Promise.resolve().then(() => (tn(), en))).initialize();\n		if (!e) throw new Error(\"TypeScript could not be loaded. Check your connection and try again.\");\n		return e;\n	} catch (e) {\n		throw Ke = null, e;\n	} finally {\n		Ke = null;\n	}\n}\nasync function _o(e) {\n	const t = e?.source ?? null;\n	if (!t) return {\n		module: null,\n		diagnostics: []\n	};\n	const r = (e.disableBundle || e.declarationsOnly) ?? !1, [n, i, o] = await Promise.all([\n		So(),\n		rn(),\n		e.ambientTypes ? Eo() : null\n	]), l = o ? e.ambientTypes ?? null : null;\n	let s = \"\";\n	const c = {\n		allowJs: !0,\n		declaration: !1,\n		sourceMap: !1,\n		inlineSourceMap: !1,\n		inlineSources: !1,\n		isolatedModules: !0,\n		preserveConstEnums: !1,\n		module: 99,\n		noResolve: !0,\n		emitDeclarationOnly: !1,\n		target: i.ScriptTarget.ES2020,\n		...l ? {\n			lib: vo,\n			skipLibCheck: !0,\n			strict: !0\n		} : {}\n	}, d = \"script\", m = `${d}.ts`, a = \"lib.d.ts\", f = \"global.d.ts\", b = {\n		[m]: t,\n		[a]: yo,\n		[f]: n,\n		...l ? {\n			[ot]: l,\n			[Qt]: bo\n		} : {}\n	}, v = (p) => b[p] ?? (o && p.startsWith(\"lib.\") ? o(i, p) : void 0), A = {\n		getSourceFile: (p, E, C, O) => {\n			if (p === ot) return at?.text !== l && (at = {\n				text: l,\n				file: i.createSourceFile(p, l, i.ScriptTarget.Latest, !1)\n			}), at.file;\n			if (b[p] === void 0) {\n				let j = er.get(p);\n				if (!j) {\n					const D = v(p);\n					if (D === void 0) return;\n					j = i.createSourceFile(p, D, i.ScriptTarget.Latest, !1), er.set(p, j);\n				}\n				return j;\n			}\n			return i.createSourceFile(p, b[p], i.ScriptTarget.Latest, !0);\n		},\n		fileExists: (p) => v(p) !== void 0,\n		readFile: v,\n		writeFile: (p, E) => {\n			b[p] = E;\n		},\n		getCurrentDirectory: () => \"./\",\n		getCanonicalFileName: (p) => p,\n		useCaseSensitiveFileNames: () => !0,\n		getDefaultLibFileName: (p) => a,\n		getNewLine: () => `\n`\n	}, U = i.createProgram([\n		m,\n		f,\n		...l ? [ot, Qt] : []\n	], c, A), h = U.getTypeChecker(), w = U.getSourceFile(m), S = e.runGuard;\n	U.emit(void 0, void 0, void 0, void 0, S ? { before: [mo(i, S.key, S.timeoutMs)] } : void 0), s = b[`${d}.js`] ?? \"\";\n	const F = (p) => ({\n		start: p.start ?? 0,\n		length: p.length ?? 0,\n		severity: p.category === i.DiagnosticCategory.Warning ? \"warning\" : \"error\",\n		code: `TS${p.code}`,\n		message: i.flattenDiagnosticMessageText(p.messageText, `\n`)\n	}), z = U.getSyntacticDiagnostics(w).map(F), L = l ? U.getSemanticDiagnostics(w).filter((p) => p.category === i.DiagnosticCategory.Error || p.category === i.DiagnosticCategory.Warning).map(F) : [], R = ao(i, w, h, {\n		builtInNames: e.builtInNames,\n		isBuiltIn: e.isBuiltIn,\n		lenient: e.lenient\n	});\n	let M = [\n		...z,\n		...L,\n		...R.diagnostics\n	];\n	e.lenient && (M = M.filter((p) => p.code !== _.MissingType));\n	const pe = R.functions, Y = R.autoRun, We = M.some((p) => p.severity === \"error\"), Je = `${nr.uuidV4()}-script`;\n	let u = null;\n	if (We) s = \"\";\n	else {\n		try {\n			r || (s = await po(i, s, d, void 0, e.minify ?? !1));\n		} catch {\n			console.warn(\"Error bundling script\");\n		}\n		const p = s.indexOf(Zt);\n		p > -1 && (u = s.substring(p + 20 + 1, s.length), s = s.substring(0, p), s = s.replaceAll(\"globalThis.\" + Ge, Ge));\n	}\n	const g = {\n		functions: pe,\n		commitId: Je,\n		source: t,\n		language: \"typescript\",\n		compiled: s\n	};\n	return u && (g.sourceMap = u), Y && (g.autoRun = Y), {\n		module: g,\n		diagnostics: M\n	};\n}\nself.addEventListener(\"message\", async (e) => {\n	const { id: t, params: r } = e.data;\n	try {\n		const n = await _o(r);\n		self.postMessage({\n			id: t,\n			result: n,\n			error: null\n		});\n	} catch (n) {\n		self.postMessage({\n			id: t,\n			result: null,\n			error: {\n				message: n.message,\n				stack: n.stack,\n				cause: n.cause\n			}\n		});\n	}\n});\n", r = typeof self < "u" && self.Blob && new Blob(["URL.revokeObjectURL(import.meta.url);", n], { type: "text/javascript;charset=utf-8" });
+function i(e) {
+	let t;
+	try {
+		if (t = r && (self.URL || self.webkitURL).createObjectURL(r), !t) throw "";
+		let n = new Worker(t, {
+			type: "module",
+			name: e?.name
+		});
+		return n.addEventListener("error", () => {
+			(self.URL || self.webkitURL).revokeObjectURL(t);
+		}), n;
+	} catch {
+		return new Worker("data:text/javascript;charset=utf-8," + encodeURIComponent(n), {
+			type: "module",
+			name: e?.name
+		});
+	}
+}
+async function a() {
+	if (globalThis.process?.versions?.node && typeof Worker > "u") return await o();
+	if (typeof Worker < "u") {
+		let t = new e(() => new i());
+		try {
+			return await t.start(), t;
+		} catch (e) {
+			console.error("Failed to start TypescriptCompiler worker reverting to fallback:", e);
+		}
+	}
+	return await o();
+}
+var o = async () => {
+	let { compileModule: e } = await import("./Ub7lo1Zsgc4OkWHw.mjs"), n = new t((t) => e(t));
+	return await n.start(), n;
+};
+export { a as createCompilerWorker };

package/browser/esm/DizmXzo0RwB1aISW.mjs

@@ -0,0 +1,86 @@
+/**
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.11
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { A as e } from "./PD_ckP5IyZurtALu.mjs";
+import { r as t } from "./CBRVZmrwcMfEHc5P.mjs";
+import { n } from "./BLoUmwvJ5t1eBdZ8.mjs";
+var r = t({
+	MAX_WORKBOOK_NAME_SIZE: () => 96,
+	isReservedFileNameChar: () => o,
+	isValidFileName: () => s
+}), i = /^(con|prn|aux|nul|com\d|lpt\d)$/i, a = /[<>:"/\\|?*\u0000-\u001F]/, o = (e) => a.test(e), s = (e) => !(!e || e.length > 255 || a.test(e) || i.test(e) || e === "." || e === ".."), c = e("io:sxlReader", () => import("./BHKm0iIUckEaUMLV.mjs")), l = e("io:sxlWriter", () => import("./BldyCakCtPYtGXcm.mjs")), u = async (e, t) => (await c.load()).readSXL(e, t), d = (e) => async (t, n) => (await l.load()).writeSXL(t, {
+	...n,
+	compress: n?.compress ?? e.compress,
+	whiteSpace: n?.whiteSpace ?? e.whiteSpace
+}), f = {
+	key: "SheetXL",
+	description: "SheetXL Workbook",
+	mimeType: "application/vnd.sheetxl.sheet",
+	exts: ["sxl"],
+	handler: u
+}, p = {
+	key: "JSON",
+	description: "SheetXL Workbook (JSON)",
+	mimeType: "application/json",
+	exts: ["json"],
+	handler: u
+}, m = {
+	key: "SheetXL",
+	mimeType: "application/vnd.sheetxl.sheet",
+	description: "SheetXL Workbook",
+	exts: ["sxl"],
+	handler: d({
+		compress: !0,
+		whiteSpace: 0
+	})
+}, h = {
+	key: "JSON",
+	mimeType: "application/json",
+	description: "SheetXL Workbook (JSON)",
+	exts: ["json"],
+	advanced: !0,
+	handler: d({
+		compress: !1,
+		whiteSpace: 2
+	})
+}, g = {
+	name: "SXLPlugin",
+	version: "0.8.0-beta.11",
+	description: "Import and export SXL format",
+	author: "SheetXL",
+	async register(e) {
+		await e.registerReadFormat(f), await e.registerReadFormat(p), await e.registerWriteFormat(m), await e.registerWriteFormat(h);
+	}
+}, _ = e("io:csvReader", () => import("./D5wm_fLXLK3Ve1ir.mjs")), v = e("io:csvWriter", () => import("./CpzzMIebww7p4m_V.mjs")), y = {
+	key: "CSV",
+	description: "Comma Separated Values",
+	mimeType: "text/csv",
+	exts: ["csv"],
+	handler: async (e, t) => (await _.load()).readCSV(e, t)
+}, b = {
+	key: "CSV",
+	mimeType: "text/csv",
+	description: "Comma Separated Values",
+	exts: ["csv"],
+	handler: async (e, t) => (await v.load()).writeCSV(e, t)
+}, x = {
+	name: "CSVPlugin",
+	version: "0.8.0-beta.11",
+	description: "Import and export CSV format",
+	author: "SheetXL",
+	async register(e) {
+		await e.registerReadFormat(y), await e.registerWriteFormat(b);
+	}
+}, S = {
+	name: "@sheetxl/io",
+	version: "0.8.0-beta.11",
+	description: "Built-in I/O formats for SheetXL",
+	author: "SheetXL",
+	async register(e) {
+		await g.register(e), await x.register(e), await n.register(e);
+	}
+};
+export { x as i, g as n, r, S as t };

package/browser/esm/{DrI_S0A9TQvriTua.mjs → Dl29uXIaOLiBIDEI.mjs}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.10
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.11
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/browser/esm/{BtGmrIqU9W1L8zfZ.mjs → Dl40S1lFKvsN0DvK.mjs}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.10
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.11
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/{cdn/assets/DxcRLd7wmBGDgJsA.js → browser/esm/DlWoVcsWZHiN-EYf.mjs}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.10
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.11
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.