@sheetxl/sdk 0.8.0-beta.15 → 0.8.0-beta.17

package/node/esm/BoLecFnIxhYKGor-.mjs

@@ -0,0 +1,2040 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.17
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: SheetXL EULA — https://www.sheetxl.com/eula
+*/
+import { An as e, Bn as t, Cn as n, Cr as r, Dn as s, Ea as o, En as l, Fa as i, Fn as a, In as d, Ln as u, Mn as c, Nn as f, On as m, Pn as p, Rn as h, Sn as g, Sr as w, Tn as v, Un as F, Vn as b, Ya as y, _n as I, bn as x, cn as A, dn as C, fn as E, gi as S, gn as k, jn as T, kn as P, ln as R, pn as O, un as _, vn as $, wn as L, wr as D, xn as V, yn as U, zn as H } from "./Cb1-r2RCxcJZB6fM.mjs";
+import { Mt as B, Vt as z, _t as G, vt as j } from "./D51xu0rubo34Ppeg.mjs";
+import { c as q, i as K, r as Q, s as J, t as W } from "./DfbVTAhNutxM74E8.mjs";
+import { FormulaError as Y } from "@sheetxl/primitives";
+import { ExpectedError as X, t as Z } from "@sheetxl/utils";
+var ee = [
+	"Jan",
+	"Feb",
+	"Mar",
+	"Apr",
+	"May",
+	"Jun",
+	"Jul",
+	"Aug",
+	"Sep",
+	"Oct",
+	"Nov",
+	"Dec"
+], te = [
+	31,
+	29,
+	31,
+	30,
+	31,
+	30,
+	31,
+	31,
+	30,
+	31,
+	30,
+	31
+], ne = (e, t, n, r) => {
+	if ("number" != typeof n) return null;
+	if (n < e.start) return 0;
+	const s = t - 1;
+	if (((e) => "numbers" === e.by || "days" === e.by && 1 !== (e.interval ?? 1))(e)) {
+		const r = Math.floor((n - e.start) / (e.interval ?? 1));
+		return r >= t - 2 ? n <= e.end ? t - 2 : s : r + 1;
+	}
+	if (n > e.end) return s;
+	const o = B(n, r, !0);
+	if (!o) return null;
+	switch (e.by) {
+		case "years": return Math.min(o.year - (B(e.start, r, !0)?.year ?? o.year) + 1, s);
+		case "quarters": return Math.floor((o.month - 1) / 3) + 1;
+		case "months": return o.month;
+		case "days": {
+			let e = o.day;
+			for (let t = 0; t < o.month - 1; t++) e += te[t];
+			return e;
+		}
+		case "hours": return o.hour + 1;
+		case "minutes": return o.minute + 1;
+		case "seconds": return o.second + 1;
+		default: return null;
+	}
+}, re = (e, t) => {
+	const n = e.fields ?? [], r = $(e.records, n.length);
+	if (!n.some(P)) return r;
+	const s = $(e.items, n.length), o = e.recordCount ?? 0, l = r.slice();
+	for (let e = 0; e < n.length; e++) {
+		const i = n[e];
+		if (!P(i)) continue;
+		const d = i.group, u = r[d.base] ?? [], c = s[d.base] ?? [], f = new Int32Array(c.length);
+		for (let e = 0; e < c.length; e++) {
+			const n = d.range ? ne(d.range, d.items.length, a(c[e]), t) : d.discrete?.[e] ?? null;
+			f[e] = n ?? -1;
+		}
+		const m = new Array(o);
+		for (let e = 0; e < o; e++) {
+			const t = f[u[e]];
+			if (void 0 === t || t < 0) return null;
+			m[e] = t;
+		}
+		l[e] = m;
+	}
+	return l;
+}, se = (e) => String(Number(e.toPrecision(12))), oe = (e, t) => {
+	const n = B(e, t, !0);
+	return n ? `${n.month}/${n.day}/${n.year}` : String(e);
+}, le = (e, t, n) => {
+	const r = e.range;
+	let s = 1 / 0, o = -1 / 0;
+	for (const e of t) {
+		if ("number" != typeof e) return null;
+		e < s && (s = e), e > o && (o = e);
+	}
+	if (0 === t.length) return e;
+	const l = { ...r };
+	r.fixedStart || (l.start = s), r.fixedEnd || (l.end = "numbers" !== r.by && Number.isInteger(o) ? o + 1 : o);
+	const { inner: i, endText: a } = ((e, t) => {
+		const { start: n, end: r } = e, s = e.interval ?? 1, o = oe(r, t), l = (e, t) => Array.from({ length: e }, (e, n) => t(n));
+		switch (e.by) {
+			case "numbers": {
+				const e = Math.max(1, Math.ceil(Number(((r - n) / s).toPrecision(12)))), t = Number.isInteger(Number(((r - n) / s).toPrecision(12))), o = Number.isInteger(n) && Number.isInteger(s);
+				return {
+					inner: l(e, (l) => {
+						const i = n + l * s, a = l === e - 1 && t ? r : o ? i + s - 1 : i + s;
+						return `${se(i)}-${se(a)}`;
+					}),
+					endText: se(t ? r : n + e * s)
+				};
+			}
+			case "days":
+				if (1 === s) {
+					const e = [];
+					return te.forEach((t, n) => {
+						for (let r = 1; r <= t; r++) e.push(`${r}-${ee[n]}`);
+					}), {
+						inner: e,
+						endText: o
+					};
+				}
+				return {
+					inner: l(Math.max(1, Math.ceil((r - n) / s)), (e) => {
+						const o = n + e * s;
+						return `${oe(o, t)} - ${oe(Math.min(o + s - 1, r), t)}`;
+					}),
+					endText: o
+				};
+			case "months": return {
+				inner: ee.slice(),
+				endText: o
+			};
+			case "quarters": return {
+				inner: [
+					"Qtr1",
+					"Qtr2",
+					"Qtr3",
+					"Qtr4"
+				],
+				endText: o
+			};
+			case "years": {
+				const e = B(n, t)?.year ?? 0;
+				return {
+					inner: l((B(r, t)?.year ?? e) - e + 1, (t) => String(e + t)),
+					endText: o
+				};
+			}
+			case "hours": return {
+				inner: l(24, (e) => `${e % 12 == 0 ? 12 : e % 12} ${e < 12 ? "AM" : "PM"}`),
+				endText: o
+			};
+			default: return {
+				inner: l(60, (e) => `:${String(e).padStart(2, "0")}`),
+				endText: o
+			};
+		}
+	})(l, n), d = "numbers" === l.by ? se(l.start) : oe(l.start, n);
+	return {
+		...e,
+		range: l,
+		items: [
+			`<${d}`,
+			...i,
+			`>${a}`
+		]
+	};
+}, ie = (e, t) => {
+	let n = "", r = 0;
+	const s = () => {
+		let t = "";
+		for (r++; r < e.length;) {
+			if ("'" === e[r]) {
+				if ("'" !== e[r + 1]) {
+					r++;
+					break;
+				}
+				r++;
+			}
+			t += e[r++];
+		}
+		return t;
+	};
+	for (; r < e.length;) {
+		const o = e[r];
+		if ("\"" === o) {
+			const t = /^"(?:[^"]|"")*"/.exec(e.slice(r)), s = t ? t[0] : e.slice(r);
+			n += s, r += s.length;
+			continue;
+		}
+		if (/[0-9.]/.test(o)) {
+			const t = /^[0-9.]+(?:[eE][+-]?[0-9]+)?/.exec(e.slice(r))[0];
+			n += t, r += t.length;
+			continue;
+		}
+		const l = "'" === o, i = l ? null : /^[\p{L}_][\p{L}\p{N}_.]*/u.exec(e.slice(r))?.[0];
+		if (!l && !i) {
+			n += o, r++;
+			continue;
+		}
+		const a = l ? s() : i;
+		if (l || (r += a.length), "(" !== e[r]) {
+			if ("[" === e[r]) {
+				r++;
+				let o = "";
+				for ("'" === e[r] && (o = s()); r < e.length && "]" !== e[r];) o += e[r++];
+				r++;
+				const l = t(a, o);
+				if (null === l) return null;
+				n += l;
+				continue;
+			}
+			n += t(a, null) ?? (l ? `'${a.replace(/'/g, "''")}'` : a);
+		} else n += a;
+	}
+	return n;
+}, ae = (e) => {
+	let t = "";
+	for (let n = e + 1; n > 0; n = Math.floor((n - 1) / 26)) t = String.fromCharCode(65 + (n - 1) % 26) + t;
+	return `${t}1`;
+}, de = (e, t) => ({
+	rowStart: 0,
+	colStart: e,
+	rowEnd: t - 1,
+	colEnd: e
+}), ue = (e, t) => {
+	const n = [];
+	for (let r = 0; r < t; r++) n.push([r, [[0, e.map((e) => e[r] ?? null)]]]);
+	return n;
+}, ce = (e, t) => {
+	const n = t.fields ?? [], r = [], o = [], l = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = (e, t) => {
+		if (l.has(e)) return !0;
+		if (t.includes(e)) return !1;
+		const d = [];
+		ie(n[e].formula, (e) => {
+			const t = n.findIndex((t) => T(t.name, e));
+			return t >= 0 && d.push(t), t >= 0 ? "" : null;
+		});
+		for (const o of d) if (s(n[o])) {
+			if (!a(o, [...t, e])) return !1;
+		} else r.includes(o) || r.push(o);
+		return l.set(e, o.length), i.set(e, n[e].formula), o.push({
+			field: e,
+			expression: ""
+		}), !0;
+	}, d = [];
+	for (const [t, r] of (e.dataFields ?? []).entries()) if (s(n[r.field])) {
+		if (!a(r.field, [])) return null;
+		d.push({
+			data: t,
+			formula: l.get(r.field)
+		});
+	}
+	const u = (e, t) => {
+		if (null !== t) return null;
+		const o = n.findIndex((t) => T(t.name, e));
+		return o >= 0 ? ae(s(n[i = o]) ? r.length + l.get(i) : r.indexOf(i)) : null;
+		var i;
+	};
+	for (const e of o) {
+		const t = ie(i.get(e.field), u);
+		if (null === t) return null;
+		e.expression = t;
+	}
+	return {
+		operands: r,
+		formulas: o,
+		measures: d
+	};
+}, fe = /* @__PURE__ */ new Set([
+	"sum",
+	"count",
+	"countNums"
+]), me = -2, pe = 4294967295, he = 1, ge = 2, we = 4, ve = 8, Fe = 16, be = 4294967295, ye = 0, Ie = 1, xe = 2, Ae = 3, Ce = 0, Ee = 1, Se = {
+	sum: 0,
+	countNums: 1,
+	count: 11,
+	average: 3,
+	min: 4,
+	max: 5,
+	product: 6,
+	var: 7,
+	varp: 8,
+	stdDev: 9,
+	stdDevp: 10
+}, ke = [
+	"sum",
+	"countA",
+	"avg",
+	"max",
+	"min",
+	"product",
+	"count",
+	"stdDev",
+	"stdDevP",
+	"var",
+	"varP"
+], Me = {
+	sum: 0,
+	countA: 13,
+	avg: 3,
+	max: 5,
+	min: 4,
+	product: 6,
+	count: 12,
+	stdDev: 9,
+	stdDevP: 10,
+	var: 7,
+	varP: 8
+}, Te = {
+	sum: "Sum",
+	countA: "Count",
+	avg: "Average",
+	max: "Max",
+	min: "Min",
+	product: "Product",
+	count: "Count",
+	stdDev: "StdDev",
+	stdDevP: "StdDevp",
+	var: "Var",
+	varP: "Varp"
+}, Pe = (e) => {
+	const t = e?.subtotals;
+	return t && !t.includes("default") ? ke.filter((e) => t.includes(e)) : [];
+}, Re = (e, t) => {
+	const n = new Set(t.flatMap((t) => t.field === me ? [] : Pe(e.fields?.[t.field])));
+	return ke.filter((e) => n.has(e));
+}, Ne = (e, t) => {
+	const n = t.filter((e) => e.field !== me).map((e) => e.field);
+	return !(n.length < 2 || t[t.length - 1].field === me) && !n.slice(0, -1).some((t) => e.fields?.[t]?.items?.some((e) => e.collapsed)) && !e.filters?.some((e) => void 0 !== e.dataField && n.includes(e.field));
+}, Oe = {
+	normal: 0,
+	percentOfTotal: 1,
+	percentOfRow: 2,
+	percentOfCol: 3,
+	index: 4,
+	percentOfParentRow: 5,
+	percentOfParentCol: 6,
+	percentOfParent: 7,
+	runTotal: 8,
+	percentOfRunningTotal: 9,
+	rankAscending: 10,
+	rankDescending: 11,
+	difference: 12,
+	percent: 13,
+	percentDiff: 14
+}, _e = (e, t, n, r) => {
+	const s = o.peek(), l = e.fields, i = t.fields;
+	if (!s || !l || !i || l.length !== i.length) return null;
+	if (C(e)) return {
+		cells: [],
+		...A,
+		rowPageCount: 0,
+		columnPageCount: 0,
+		header: _(e),
+		rowLines: [],
+		columnLines: [],
+		viewValues: [],
+		firstKey: null,
+		...r?.roles ? { roles: /* @__PURE__ */ new Map() } : {}
+	};
+	const a = p(e, i), d = a ? r?.filters : null;
+	if (a && !d) return null;
+	const u = l.some((e) => e.items?.some((e) => e.calculated));
+	if (u && !d?.calculatedRecords) return null;
+	const c = ce(e, t);
+	if (!c || c.measures.length > 0 && !d?.fieldValues) return null;
+	if ((e.dataFields ?? []).some((e) => void 0 === Oe[e.showDataAs ?? "normal"] || void 0 === Se[e.subtotal ?? "sum"])) return null;
+	const f = $e(e, t, n, d?.calculatedRecords, c.operands);
+	if (!f) return null;
+	const { items: m, records: h, values: g, n: w } = f, v = (e) => !!e && (!e.noRecords || P(e)), F = e.form ?? "compact", b = (e) => {
+		const t = [];
+		for (const n of e ?? []) {
+			if (n === me) {
+				t.push({
+					field: n,
+					form: F
+				});
+				continue;
+			}
+			const e = l[n], r = e?.subtotals;
+			if (!e || !v(i[n])) return null;
+			if (u && r && r.some((e) => "default" !== e)) return null;
+			t.push({
+				field: n,
+				form: e.form ?? "compact"
+			});
+		}
+		return t;
+	}, y = b(e.rowFields), I = b(e.columnFields), x = e.pageFields ?? [];
+	if (!y || !I || x.some((e) => !v(i[e.field]))) return null;
+	const E = H(e, r?.slicerFields);
+	if (E.pageFields?.some((e) => !v(i[e.field]))) return null;
+	return Ge(e, t, m, y, I, Ue(s, E, m, h, g, y, I, w, d?.keep, d?.records, c.operands.length, d?.fieldValues, !0), n, !0 === r?.roles, "columns" === r?.cellOrder);
+}, $e = (e, t, n, r, s = []) => {
+	const o = t.fields?.length ?? 0, l = f(t);
+	if (!t.records) return null;
+	const i = re(t, n.isDate1904());
+	if (!i) return null;
+	const d = !0 === t.fields?.some(P), u = d ? $(t.items, o) : l, c = d ? $(t.records, o) : i, m = t.recordCount ?? 0, p = r?.count ?? 0, h = m + p, g = (e, n) => {
+		const r = !t.fields?.[e]?.noRecords, s = r ? c[e] : i[e] ?? [], o = r ? u[e] : l[e], d = new Array(h);
+		for (let e = 0; e < m; e++) d[e] = a(o[s[e]]);
+		for (let e = 0; e < p; e++) d[m + e] = n?.[e] ?? null;
+		return d;
+	}, w = [...(e.dataFields ?? []).map((e, t) => g(e.field, r?.values[t])), ...s.map((e) => g(e))];
+	return {
+		items: l,
+		records: r ? i.map((e, t) => e.concat(r.ids[t] ?? [])) : i,
+		values: w,
+		n: h
+	};
+}, Le = async (e, t, n, r, s, l, i, a, d) => {
+	const u = o.peek(), c = e.dataFields?.[s];
+	if (!u || !e.fields || !c || void 0 === Se[c.subtotal ?? "sum"]) return null;
+	const f = [e.rowFields, e.columnFields].map((e) => (e ?? []).filter((e) => e !== me)), m = f.findIndex((e) => e.includes(r)), p = f[m];
+	if (!p) return null;
+	const h = p.slice(0, p.indexOf(r)), g = e.fields.map((e) => {
+		const { blankRowAfter: t, showItemsWithNoData: n, sort: r, ...s } = e;
+		return {
+			...s,
+			items: e.items?.map((e) => {
+				if (!e.collapsed) return e;
+				const { collapsed: t, ...n } = e;
+				return n;
+			})
+		};
+	}), { columnGrandTotals: w, ...v } = e, { showDataAs: F, ...b } = c, y = {
+		...v,
+		fields: g,
+		rowFields: [...h, r],
+		columnFields: [],
+		dataFields: [b],
+		rowGrandTotals: !1
+	}, I = a ? {
+		...a,
+		values: [a.values[s] ?? []]
+	} : a, x = ce(y, t);
+	if (!x || x.measures.length > 0 && !d) return null;
+	const A = $e(y, t, n, I, x.operands);
+	if (!A) return null;
+	const { items: C, records: E, values: S, n: k } = A, M = y.rowFields.map((e) => ({
+		field: e,
+		form: "compact"
+	}));
+	let T;
+	if (i) {
+		const e = 0 === m ? 1 : 2;
+		T = new Uint8Array(k);
+		for (let t = 0; t < k; t++) {
+			const n = i[t];
+			T[t] = (n & e ? 1 : 0) | (3 === n ? 2 : 0);
+		}
+	}
+	const P = x.measures.length > 0 ? await Ve(u, x, y, C, E, S, M, [], k, l, T, d) : void 0, R = Ue(u, y, C, E, S, M, [], k, l, T, x.operands.length, P), N = (t, n) => e.fields[t].items?.[n]?.item ?? n, O = /* @__PURE__ */ new Map(), _ = R.columns.length;
+	return R.rows.forEach((e, t) => {
+		if (e.kind !== ye || e.path.length !== h.length + 1) return;
+		const n = h.map((t, n) => N(t, e.path[n])).join(",");
+		let s = O.get(n);
+		s || O.set(n, s = {
+			ids: [],
+			totals: []
+		}), s.ids.push(N(r, e.path[h.length])), s.totals.push(R.values[t * _]);
+	}), {
+		outer: h,
+		groups: O,
+		records: E
+	};
+}, De = (e, t, n) => {
+	const r = new Uint32Array(t).fill(pe), s = new Uint8Array(t), o = e.items;
+	if (o) o.forEach((e, n) => {
+		void 0 === e.item || void 0 !== e.type || e.item >= t || (r[e.item] = n, s[e.item] = (e.hidden ? 1 : 0) | (e.collapsed ? 2 : 0));
+	});
+	else for (let e = 0; e < t; e++) r[e] = e;
+	if (n) for (let e = 0; e < t; e++) n[e] || (s[e] |= 1);
+	return {
+		ranks: r,
+		flags: s
+	};
+}, Ve = async (e, t, n, r, s, o, l, i, a, d, u, c) => {
+	const { request: f, errors: m } = He(e, n, r, s, o, l, i, a, d, u, t.operands.length);
+	let p = 0;
+	const h = [];
+	try {
+		const r = f.operands(0, m.codeOf(Y.BuiltIn.NA), m.codeOf(Y.BuiltIn.Null));
+		try {
+			p = r.cell_count();
+			const s = n.dataFields?.length ?? 0;
+			t.operands.forEach((t, n) => {
+				const o = r.values(s + n);
+				try {
+					const t = J(e.wasm_memory().buffer, o, m), n = new Array(p);
+					for (let e = 0; e < p; e++) n[e] = t(e);
+					h.push(n);
+				} finally {
+					o.free();
+				}
+			});
+		} finally {
+			r.free();
+		}
+	} finally {
+		f.free();
+	}
+	return (async (e, t, n, r) => {
+		const s = n + 1, o = t.map((e) => {
+			const t = new Array(s);
+			for (let r = 0; r < n; r++) t[r] = e[r] ?? 0;
+			return t[n] = 0, t;
+		}), l = await r.evaluateBatch({
+			values: ue(o, s),
+			formulas: e.formulas.map(({ expression: e }, n) => ({
+				expression: e,
+				coords: de(t.length + n, s)
+			}))
+		}), i = /* @__PURE__ */ new Map();
+		for (const { data: t, formula: n } of e.measures) {
+			const e = new Array(s);
+			for (let t = 0; t < s; t++) e[t] = l[n].getValueAt(t, 0) ?? 0;
+			i.set(t, e);
+		}
+		return i;
+	})(t, h, p, c);
+}, Ue = (e, t, n, r, s, o, l, i, a, d, u = 0, c, f = !1) => {
+	const { request: m, errors: p } = He(e, t, n, r, s, o, l, i, a, d, u, c, f), h = p.codeOf(Y.BuiltIn.NA), g = p.codeOf(Y.BuiltIn.Null), w = m.lay_out(0, h, g);
+	try {
+		const n = Be(w.row_lines(), w.row_stride()), r = Be(w.column_lines(), w.column_stride()), s = w.states(), i = w.values();
+		try {
+			const a = J(e.wasm_memory().buffer, i, p), d = new Array(s.length);
+			for (let e = 0; e < s.length; e++) d[e] = s[e] === Ce ? a(e) : null;
+			return {
+				rows: n,
+				columns: r,
+				states: s,
+				values: d,
+				functions: f ? Re(t, [...o, ...l]) : []
+			};
+		} finally {
+			i.free();
+		}
+	} finally {
+		w.free(), m.free();
+	}
+}, He = (e, t, n, r, s, o, l, i, a, d, u = 0, c, f = !1) => {
+	const m = t.fields, p = new e.LayoutRequest(i), h = f ? Re(t, [...o, ...l]) : [], g = [], w = (e, r) => {
+		for (const { field: s, form: o } of r) {
+			if (s === me) {
+				p.add_values_slot(e, "tabular" === o);
+				continue;
+			}
+			const l = m[s], i = l.subtotals, a = (!i || i.includes("default") ? he : 0) | (!1 !== l.subtotalsOnTop ? ge : 0) | (l.blankRowAfter ? we : 0) | (l.showItemsWithNoData ? ve : 0) | ("tabular" === o ? Fe : 0), d = p.add_field(e, n[s].length, a), u = l.sort;
+			void 0 !== u?.dataField && p.set_field_sort(e, d, u.dataField, "descending" === u.order, new Uint32Array((u.scope?.items ?? []).map((e) => e.item)));
+			const c = f ? Pe(l) : [];
+			if (c.length > 0) {
+				const n = r[r.length - 1].field === s && Ne(t, r);
+				p.set_field_functions(e, d, new Uint32Array(c.map((e) => h.indexOf(e))), n);
+			}
+			g.push({
+				axis: e,
+				slot: d,
+				field: s
+			});
+		}
+	};
+	w(0, o), w(1, l);
+	const v = (t.pageFields ?? []).map((e) => ({
+		page: e,
+		index: p.add_page(n[e.field].length)
+	})), F = s.map(() => p.add_values(127)), b = t.dataFields ?? [];
+	b.forEach((e, t) => {
+		p.add_measure(t, Se[e.subtotal ?? "sum"]);
+		const n = Oe[e.showDataAs ?? "normal"];
+		if (!n) return;
+		let r = 2, s = o.findIndex((t) => t.field === e.baseField);
+		s >= 0 ? r = 0 : (s = l.findIndex((t) => t.field === e.baseField), s >= 0 && (r = 1));
+		const i = "previous" === e.baseItem ? 4294967294 : "next" === e.baseItem ? 4294967295 : e.baseItem ?? 0;
+		p.set_show_as(t, n, r, Math.max(s, 0), i);
+	});
+	for (let e = 0; e < u; e++) p.add_measure(b.length + e, Se.sum);
+	u > 0 && p.set_operand_measures(u);
+	for (const e of h) b.forEach((t, n) => p.add_measure(n, Me[e]));
+	h.length > 0 && p.set_functions(h.length);
+	const y = [...c ?? []].map(([e, t]) => ({
+		column: t,
+		ptr: p.add_calculated(e, t.length - 1, 127)
+	}));
+	p.set_grand(!1 !== t.rowGrandTotals, !1 !== t.columnGrandTotals);
+	const I = d ? p.record_keep() : null, x = e.wasm_memory().buffer;
+	d && null !== I && new Uint8Array(x, I, i).set(d.subarray(0, i));
+	for (const { axis: e, slot: t, field: s } of g) {
+		const o = n[s].length;
+		new Uint32Array(x, p.field_ids(e, t), i).set(r[s].slice(0, i));
+		const { ranks: l, flags: d } = De(m[s], o, a?.get(s));
+		new Uint32Array(x, p.field_ranks(e, t), o).set(l), new Uint8Array(x, p.field_flags(e, t), o).set(d);
+	}
+	for (const { page: e, index: t } of v) {
+		const s = n[e.field].length;
+		new Uint32Array(x, p.page_ids(t), i).set(r[e.field].slice(0, i));
+		const { ranks: o, flags: l } = De(m[e.field], s), d = new Uint8Array(x, p.page_keep(t), s), u = void 0 !== e.item ? m[e.field].items?.[e.item]?.item : void 0, c = e.slicer ? a?.get(e.field) : void 0;
+		for (let t = 0; t < s; t++) {
+			const n = void 0 !== u ? t === u : !(o[t] === pe && m[e.field].items || 1 & l[t]);
+			d[t] = !n || c && 0 === c[t] ? 0 : 1;
+		}
+	}
+	const A = new Q();
+	F.forEach((e, t) => {
+		const n = {
+			doubles: new Float64Array(x, e, i),
+			ints: new Int32Array(x, e, 2 * i),
+			types: new Uint8Array(x, e + 8 * i, i)
+		}, r = {
+			ok: !0,
+			numeric: !0
+		}, o = s[t];
+		for (let e = 0; e < i; e++) q(n, e, o[e], A, r);
+	});
+	for (const { column: e, ptr: t } of y) {
+		const n = e.length, r = {
+			doubles: new Float64Array(x, t, n),
+			ints: new Int32Array(x, t, 2 * n),
+			types: new Uint8Array(x, t + 8 * n, n)
+		}, s = {
+			ok: !0,
+			numeric: !0
+		};
+		for (let t = 0; t < n; t++) q(r, t, e[t], A, s);
+	}
+	return {
+		request: p,
+		errors: A
+	};
+}, Be = (e, t) => {
+	const n = [], r = 7 + t;
+	for (let t = 0; t + r <= e.length; t += r) {
+		const r = e[t + 1], s = e[t + 3], o = e[t + 5];
+		n.push({
+			kind: e[t],
+			path: Array.from(e.subarray(t + 7, t + 7 + r)),
+			data: s === be ? null : s,
+			function: o === be ? null : o,
+			across: 1 === e[t + 6]
+		});
+	}
+	return n;
+}, ze = (e, t) => {
+	let n = [];
+	return e.map((e) => {
+		const r = { items: [] };
+		if (e.kind === ye) {
+			let t = 0;
+			for (; t < e.path.length - 1 && t < n.length && e.path[t] === n[t];) t++;
+			t > 0 && (r.repeat = t), r.items = e.path.slice(t), n = e.path;
+		} else r.type = e.kind === Ie ? null !== e.function ? t[e.function] : "default" : e.kind === xe ? "grand" : "blank", r.items = e.kind === xe ? [0] : e.path.slice();
+		return null !== e.data && e.data > 0 && (r.dataField = e.data), r;
+	});
+}, Ge = (e, t, n, r, s, o, i, d, u) => {
+	const c = e.fields, f = t.fields, p = e.dataFields ?? [], h = (t) => t === me ? e.valuesCaption ?? "Values" : c[t].name ?? f[t].name, g = (e, t) => {
+		if (e === me) return p[t]?.name ?? "";
+		const r = c[e].items?.[t];
+		if (void 0 !== r?.name) return r.name;
+		const s = a(n[e][r?.item ?? t]);
+		return null === s ? k : s;
+	}, w = (e, t) => {
+		const n = g(e, t);
+		if ("number" == typeof n) {
+			const r = c[e].items?.[t]?.item ?? t, s = void 0 === (c[e].numberFormat ?? f[e].numberFormat) && m(f[e], r);
+			return j(i, s ? R(V(f[e], r), i) : ((e) => R(c[e].numberFormat ?? f[e].numberFormat, i))(e), n);
+		}
+		return Y.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
+	}, v = (e) => {
+		if (void 0 !== e.item) return g(e.field, e.item);
+		const t = c[e.field].items ?? [];
+		if (!t.some((e) => e.hidden)) return "(All)";
+		const n = t.flatMap((e, t) => l(e) && !e.hidden ? [t] : []);
+		return 1 === n.length ? g(e.field, n[0]) : "(Multiple Items)";
+	}, b = e.grandTotalCaption ?? "Grand Total", I = d ? /* @__PURE__ */ new Map() : null, x = (e, t) => e === me ? {
+		kind: "dataCaption",
+		data: t
+	} : {
+		kind: "item",
+		field: e,
+		rank: t
+	}, A = (e) => e === me ? null : {
+		kind: "fieldCaption",
+		field: e
+	}, C = (e, t) => e.kind === xe && t === b ? { kind: "grandTotal" } : null, S = 0 === r.length && 0 === s.length && 0 === p.length, M = S ? {
+		firstHeaderRow: 0,
+		firstDataRow: 0,
+		firstDataCol: 0
+	} : _(e), T = S ? [] : ze(o.rows, o.functions), P = S ? [] : ze(o.columns, o.functions), N = O({
+		...e,
+		header: M,
+		rowLines: T,
+		columnLines: P
+	}), $ = o.columns.length, L = (e) => "row" === e ? r : s, D = (t) => {
+		switch (t.kind) {
+			case "pageCaption": {
+				const n = e.pageFields[t.page].field;
+				return [h(n), {
+					kind: "fieldCaption",
+					field: n
+				}];
+			}
+			case "pageItem": {
+				const n = e.pageFields[t.page];
+				return [v(n), {
+					kind: "pageItem",
+					page: t.page
+				}];
+			}
+			case "dataCaption": return [p[t.data]?.name ?? null, {
+				kind: "dataCaption",
+				data: t.data
+			}];
+			case "rowHeader": return [r.every((e) => e.field === me) ? e.valuesCaption ?? "Values" : e.rowHeaderCaption ?? "Row Labels", { kind: "rowHeader" }];
+			case "columnHeader": return [e.columnHeaderCaption ?? "Column Labels", { kind: "columnHeader" }];
+			case "fieldCaption": {
+				const e = L(t.axis)[t.level].field;
+				return [h(e), A(e)];
+			}
+			case "label": {
+				const e = L(t.axis)[t.level].field, n = t.line.path[t.level];
+				return [g(e, n), x(e, n)];
+			}
+			case "total": {
+				const e = ("row" === t.axis ? o.rows : o.columns)[t.line.index], n = ((e, t) => {
+					const n = e.findIndex((e) => e.field === me) >= t.path.length && null !== t.data, r = n ? p[t.data]?.name ?? "" : "";
+					if (t.kind === xe) return n ? `Total ${r}` : b;
+					const s = t.path.length - 1, l = e[s].field, i = w(l, t.path[s]);
+					if (null !== t.function) {
+						const e = Te[o.functions[t.function]];
+						return (n || t.across) && null !== t.data ? `${i} ${e} of ${h(p[t.data].field)}` : `${i} ${e}`;
+					}
+					return c[l]?.subtotalCaption ?? (n ? `${i} ${r}` : `${i} Total`);
+				})(L(t.axis), e);
+				return [n, C(e, n)];
+			}
+			case "value": {
+				const n = t.row.index * $ + t.column.index, r = o.states[n];
+				let s = null;
+				return r === Ce ? (s = o.values[n], e.showError && Y.isError(s) && (s = e.errorCaption ?? "")) : r === Ee && (s = !1 === e.showEmpty ? 0 : ((e) => {
+					if (void 0 === e) return null;
+					const t = e.trim();
+					if (!/^[+-]?\d*(?:\.\d*)?$/.test(t)) return e;
+					const n = Number(t.replace(/^([+-]?)\.?$/, "$10"));
+					return Number.isFinite(n) ? n + 0 : e;
+				})(e.emptyCaption)), [s, null];
+			}
+		}
+	}, U = new y.Builder(), H = N.top, B = N.pages.reduce((e, t) => Math.max(e, t.column + 2), 0), z = (e, t) => {
+		const n = E(N, e, t);
+		if (!n) return;
+		const [r, s] = D(n);
+		((e, t, n) => {
+			I && n && I.set(e + "," + t, n);
+		})(e - H, t, s), null !== r && (u ? U.pushAt(t, e - H, r) : U.pushAt(e - H, t, r));
+	};
+	if (u) {
+		const e = Math.max(B, N.columns.length);
+		for (let t = 0; t < e; t++) for (let e = 0; e < N.rows.length; e++) t < (e < H ? B : N.columns.length) && z(e, t);
+	} else for (let e = 0; e < N.rows.length; e++) {
+		const t = e < H ? B : N.columns.length;
+		for (let n = 0; n < t; n++) z(e, n);
+	}
+	if (S) {
+		const t = F(e);
+		return {
+			cells: U.build()?.tuples ?? [],
+			rows: 1,
+			columns: 1,
+			rowPageCount: t.rows,
+			columnPageCount: t.columns,
+			header: M,
+			rowLines: [],
+			columnLines: [],
+			viewValues: [],
+			firstKey: null,
+			...I ? { roles: I } : {}
+		};
+	}
+	const G = (e, t) => {
+		const n = [];
+		return e.forEach((e, r) => {
+			e.field !== me && n.push(r < t.path.length ? t.path[r] : -1);
+		}), n;
+	}, q = (e, t) => W(e.data ?? t.data ?? 0, [...G(r, e), ...G(s, t)]), [K] = o.rows, [Q] = o.columns, J = K && Q && K.kind !== Ae && Q.kind !== Ae ? q(K, Q) : null, X = [], Z = (e) => e.kind === Ie && null !== e.function;
+	o.rows.forEach((t, n) => {
+		t.kind === Ae || Z(t) || (G(r, t), o.columns.forEach((r, s) => {
+			const l = o.states[n * $ + s];
+			if (r.kind === Ae || Z(r) || l !== Ce && l !== Ee) return;
+			let i = l === Ce ? o.values[n * $ + s] : 0;
+			e.showError && Y.isError(i) && (i = e.errorCaption || 0), X.push([q(t, r), i]);
+		}));
+	});
+	const ee = F(e);
+	return {
+		cells: U.build()?.tuples ?? [],
+		rows: N.rows.length - H,
+		columns: N.columns.length,
+		rowPageCount: ee.rows,
+		columnPageCount: ee.columns,
+		header: M,
+		rowLines: T,
+		columnLines: P,
+		viewValues: X,
+		firstKey: J,
+		...I ? { roles: I } : {}
+	};
+}, je = (e, t, n, r, s = !1, o, l) => {
+	const i = _e(e, t, r, {
+		filters: o,
+		slicerFields: l
+	});
+	if (!i) return null;
+	const d = i.rowPageCount > 0 ? i.rowPageCount + 1 : 0, u = i.rowPageCount > 0 ? 3 * i.columnPageCount - 1 : 0, { rowStart: c, colStart: p } = n;
+	if (c - d < 0) return null;
+	const h = {
+		rowStart: c - d,
+		colStart: p,
+		rowEnd: c + i.rows - 1,
+		colEnd: p + Math.max(i.columns, u) - 1
+	}, g = e.fields, w = t.fields, v = f(t), F = (e, t) => {
+		const n = g[e], s = n.numberFormat ?? w[e].numberFormat, o = R(s, r), l = P(w[e]), i = v[e], d = (n.items ?? []).filter((e) => void 0 !== e.item && void 0 === e.type), u = d.length > 0 ? d : i.map((e, t) => ({ item: t })), c = u.map((t) => {
+			const n = a(i[t.item]), d = m(w[e], t.item), u = null === n ? "(blank)" : "number" == typeof n ? j(r, d ? (c = t.item, void 0 === s ? R(V(w[e], c), r) : o) : o, n) : Y.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
+			var c;
+			const f = l && d ? u : n;
+			return void 0 !== t.name ? {
+				value: f,
+				text: u,
+				name: t.name
+			} : {
+				value: f,
+				text: u
+			};
+		}), f = {
+			name: n.name ?? w[e].name,
+			items: c
+		};
+		if (t) {
+			const e = void 0 !== t.item ? (n.items ?? [])[t.item]?.item : void 0;
+			f.page = void 0 !== e ? u.findIndex((t) => t.item === e) : -1;
+		}
+		return f;
+	}, b = (e) => (e ?? []).filter((e) => -2 !== e);
+	return {
+		view: {
+			range: h,
+			dataFields: (e.dataFields ?? []).map((e) => ({
+				name: e.name,
+				sourceName: w[e.field].name
+			})),
+			fields: [
+				...b(e.rowFields).map((e) => F(e)),
+				...b(e.columnFields).map((e) => F(e)),
+				...(e.pageFields ?? []).map((e) => F(e.field, e))
+			],
+			values: i.viewValues,
+			block: {
+				anchor: {
+					row: c,
+					column: p
+				},
+				...s ? { blocked: !0 } : {},
+				...null !== i.firstKey ? { first: i.firstKey } : {}
+			}
+		},
+		size: {
+			rows: i.rows,
+			columns: i.columns
+		}
+	};
+}, qe = async (t, n, r, l) => {
+	const i = /* @__PURE__ */ new Map(), d = (t.filters ?? []).filter((n) => e(n) || t.rowFields?.includes(n.field) || t.columnFields?.includes(n.field)), c = t.fields?.some((e) => e.items?.some((e) => e.calculated)), p = t.dataFields?.some((e) => s(n.fields?.[e.field]));
+	if (0 === d.length && !c && !p) return { keep: i };
+	const h = f(n);
+	for (const s of d.filter(e)) {
+		const e = s.field, o = h[e];
+		if (!o) continue;
+		const d = D(s.condition) ? Je(t, n, o, e, r) : null, u = new Array(o.length);
+		for (let e = 0; e < o.length; e++) u[e] = d ? d[e] : a(o[e]);
+		const c = await Qe(s.condition, u, r, l), f = i.get(e);
+		if (f) for (let e = 0; e < c.length; e++) f[e] &= c[e];
+		else i.set(e, c);
+	}
+	const g = c && l ? await (async (e, t, n, r, o) => {
+		const l = t.fields ?? [], i = e.fields ?? [], d = l.flatMap((e, t) => e.calculatedItems?.length ? [t] : []), c = e.dataFields ?? [];
+		if (1 !== d.length || c.some((e) => s(l[e.field]) || !fe.has(e.subtotal ?? "sum"))) return null;
+		const p = d[0], h = l[p].calculatedItems, g = re(t, n.isDate1904());
+		if (!g) return null;
+		const w = f(t), v = f({
+			...t,
+			fields: l.map(({ group: e, ...t }) => t)
+		}), F = (e.rowFields ?? []).filter((e) => e >= 0), b = (e.columnFields ?? []).filter((e) => e >= 0), y = F.includes(p) ? F : b.includes(p) ? b : null;
+		if (!y) return null;
+		const I = y.slice(0, y.indexOf(p)), x = [...y.slice(y.indexOf(p) + 1), ...y === F ? b : F], A = [...I, ...x], C = t.recordCount ?? 0, E = (e, t) => {
+			const n = i[e]?.items, r = n?.find((e) => e.item === t && void 0 === e.type);
+			return !(n && (!r || r.hidden) || o?.get(e) && 0 === o.get(e)[t]);
+		}, S = (e, t) => {
+			const n = i[e.field]?.items;
+			if (void 0 !== e.item) return n?.[e.item]?.item === t;
+			const r = n?.find((e) => e.item === t && void 0 === e.type);
+			return !n || !!r && !r.hidden;
+		}, M = e.pageFields ?? [], P = R(l[p].numberFormat ?? 14, n), N = (e) => w[p].findIndex((t, r) => {
+			const s = a(t);
+			return "number" == typeof s && (l[p].dates || m(l[p], r)) ? T(j(n, P, s), e) : T(null === s ? k : u(s), e);
+		}), O = /* @__PURE__ */ new Map(), _ = new Map(h.map((e) => [e.item, e.formula])), $ = (e) => {
+			let t = O.get(e);
+			return void 0 === t && O.set(e, t = O.size), t;
+		};
+		for (const e of h) if (null === ie(e.formula, (e, t) => {
+			if (null === t || !T(l[p].name, e)) return null;
+			const n = N(t);
+			return n < 0 ? null : (_.has(n) || $(n), "");
+		})) return null;
+		const L = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), V = c.map((e) => ({
+			column: g[e.field],
+			values: v[e.field],
+			fold: e.subtotal ?? "sum"
+		})), U = O.size;
+		for (let e = 0; e < C; e++) {
+			if (!M.every((t) => S(t, g[t.field][e]))) continue;
+			if (!A.every((t) => E(t, g[t][e]))) continue;
+			let t = "";
+			for (const n of I) t += g[n][e] + ",";
+			D.has(t) || D.set(t, e);
+			const n = O.get(g[p][e]);
+			if (void 0 === n) continue;
+			let r = t;
+			for (const t of x) r += g[t][e] + ",";
+			let s = L.get(r);
+			s || (s = {
+				sums: c.map(() => new Array(U).fill(0)),
+				errors: c.map(() => new Array(U).fill(void 0))
+			}, L.set(r, s));
+			const { sums: o, errors: l } = s;
+			V.forEach(({ column: t, values: r, fold: s }, i) => {
+				const d = a(r[t[e]]);
+				"sum" === s ? "number" == typeof d ? o[i][n] += d : Y.isError(d) && (l[i][n] ??= d) : ("countNums" === s ? "number" == typeof d : null !== d) && (o[i][n] += 1);
+			});
+		}
+		const H = x.map((e) => {
+			const t = i[e]?.items;
+			return t ? t.flatMap((t) => void 0 !== t.item && void 0 === t.type && !t.missing && E(e, t.item) ? [t.item] : []) : w[e].map((e, t) => t);
+		});
+		if (H.reduce((e, t) => e * t.length, D.size) > 5e5) return null;
+		const B = [];
+		for (const [e, t] of D) {
+			const n = (e, r, s) => {
+				if (e !== H.length) for (const t of H[e]) n(e + 1, [...r, t], s + t + ",");
+				else B.push({
+					exemplar: t,
+					path: r,
+					key: s
+				});
+			};
+			n(0, [], e);
+		}
+		const z = B.length;
+		if (0 === z) return {
+			count: 0,
+			ids: l.map(() => []),
+			values: c.map(() => [])
+		};
+		const G = c.length * U, q = (e, t) => e * U + t, K = (e, t) => G + e * h.length + t, Q = [];
+		for (let e = 0; e < c.length; e++) for (let t = 0; t < U; t++) Q.push(B.map(({ key: n }) => {
+			const r = L.get(n);
+			return r ? r.errors[e][t] ?? r.sums[e][t] : 0;
+		}));
+		const J = [];
+		for (let e = 0; e < c.length; e++) for (let t = 0; t < h.length; t++) {
+			const n = ie(h[t].formula, (t, n) => {
+				if (null === n) return null;
+				const r = N(n), s = h.findIndex((e) => e.item === r);
+				return ae(s >= 0 ? K(e, s) : q(e, O.get(r)));
+			});
+			if (null === n) return null;
+			J.push({
+				expression: n,
+				coords: de(K(e, t), z)
+			});
+		}
+		const W = await r.evaluateBatch({
+			values: ue(Q, z),
+			formulas: J
+		}), X = l.map(() => []), Z = c.map(() => []), ee = (e, t, n, r) => {
+			g.forEach((n, r) => {
+				const s = x.indexOf(r);
+				X[r].push(r === p ? t : s >= 0 ? e.path[s] : n[e.exemplar] ?? 0);
+			}), Z.forEach((e, t) => {
+				e.push(t === n ? r : null);
+			});
+		};
+		return B.forEach((e, t) => {
+			h.forEach(({ item: n }, r) => {
+				c.forEach((s, o) => {
+					const l = W[o * h.length + r].getValueAt(t, 0) ?? 0;
+					if ("sum" !== (s.subtotal ?? "sum") && "number" == typeof l) for (let t = 0; t < Math.round(l); t++) ee(e, n, o, 1);
+					else ee(e, n, o, l);
+				});
+			});
+		}), {
+			count: X[0]?.length ?? 0,
+			ids: X,
+			values: Z
+		};
+	})(t, n, r, l, i) : void 0, w = d.filter((t) => !e(t)).map((e, t) => ({
+		filter: e,
+		index: t
+	})).sort((e, t) => (e.filter.evalOrder ?? -1) - (t.filter.evalOrder ?? -1) || e.index - t.index), v = (n.recordCount ?? 0) + (g?.count ?? 0);
+	let F;
+	const b = t.rowFields ?? [];
+	for (const { filter: e } of w) {
+		const s = await Le(t, n, r, e.field, e.dataField, i, F, g, l);
+		if (!s) continue;
+		const o = /* @__PURE__ */ new Set();
+		for (const [t, n] of s.groups) {
+			const s = await Qe(e.condition, n.totals, r, l);
+			n.ids.forEach((e, n) => {
+				s[n] || o.add(`${t}|${e}`);
+			});
+		}
+		if (0 === o.size) continue;
+		F ??= new Uint8Array(v).fill(3);
+		const a = s.outer.map((e) => s.records[e]), d = s.records[e.field], u = b.includes(e.field) ? 1 : 2;
+		for (let e = 0; e < v; e++) {
+			if (!(F[e] & u)) continue;
+			let t = "";
+			for (let n = 0; n < a.length; n++) t += (n > 0 ? "," : "") + a[n][e];
+			o.has(`${t}|${d[e]}`) && (F[e] &= ~u);
+		}
+	}
+	const y = p && l ? await (async (e, t, n, r, s, l, i) => {
+		const a = o.peek(), d = ce(e, t);
+		if (!a || !d) return null;
+		const u = $e(e, t, n, i, d.operands);
+		if (!u) return null;
+		const c = (t) => (t ?? []).map((t) => ({
+			field: t,
+			form: t === me ? e.form ?? "compact" : e.fields?.[t]?.form ?? "compact"
+		}));
+		return Ve(a, d, e, u.items, u.records, u.values, c(e.rowFields), c(e.columnFields), u.n, s, l, r);
+	})(t, n, r, l, i, F, g) : void 0;
+	return {
+		keep: i,
+		...F ? { records: F } : {},
+		...g ? { calculatedRecords: g } : {},
+		...y ? { fieldValues: y } : {}
+	};
+}, Ke = (e, t) => {
+	const n = e.filters;
+	if (!n) return e;
+	let r = !1;
+	const s = n.map((e) => {
+		const n = e.condition && w(e.condition, t);
+		return n === e.condition ? e : (r = !0, {
+			...e,
+			condition: n
+		});
+	});
+	return r ? {
+		...e,
+		filters: s
+	} : e;
+}, Qe = async (e, t, n, s) => {
+	const o = t.length, l = new Uint8Array(o);
+	if (0 === o) return l;
+	const a = new i();
+	for (let e = 0; e < o; e++) null !== t[e] && a.setValueAt(e, 0, t[e]);
+	let d = !1;
+	return await r({
+		conditions: [e],
+		runtime: n,
+		calculation: s ?? null,
+		values: a,
+		coords: {
+			rowStart: 0,
+			rowEnd: o - 1,
+			colStart: 0,
+			colEnd: 0
+		},
+		onTrue: (e) => {
+			d = !0, l[e.rowIndex] = 1;
+		},
+		onFalse: () => {
+			d = !0;
+		},
+		onBlank: (e) => {
+			d = !0;
+			for (let n = 0; n < o; n++) null === t[n] && e(n, 0) && (l[n] = 1);
+		}
+	}), d || l.fill(1), l;
+}, Je = (e, t, n, r, s) => {
+	const o = e.fields?.[r], l = /* @__PURE__ */ new Map();
+	for (const e of o?.items ?? []) void 0 !== e.item && void 0 === e.type && void 0 !== e.name && l.set(e.item, e.name);
+	const i = o?.numberFormat ?? t.fields?.[r]?.numberFormat, d = R(i, s), u = (e) => void 0 === i ? R(V(t.fields?.[r], e), s) : d, c = new Array(n.length);
+	for (let e = 0; e < n.length; e++) {
+		const o = l.get(e);
+		if (void 0 !== o) {
+			c[e] = o;
+			continue;
+		}
+		const i = a(n[e]);
+		null === i ? c[e] = k : "number" == typeof i ? c[e] = j(s, m(t.fields?.[r], e) ? u(e) : d, i) : "boolean" == typeof i ? c[e] = i ? "TRUE" : "FALSE" : Y.isError(i) ? c[e] = i.getLabel() : c[e] = String(i);
+	}
+	return c;
+}, We = (e) => {
+	const t = e.getCoords(), n = t.colEnd - t.colStart + 1, r = t.rowEnd - t.rowStart, s = e.getWorksheet(), o = s.getRange({
+		rowStart: t.rowStart,
+		rowEnd: t.rowStart,
+		colStart: t.colStart,
+		colEnd: t.colEnd
+	}).getValues()[0] ?? [], l = [];
+	for (let e = 0; e < n; e++) {
+		const n = o[e] ?? null, i = new K(), a = new Uint32Array(r);
+		let d, u, c = !1, f = i.values;
+		if (r > 0) {
+			const n = s.getRange({
+				rowStart: t.rowStart + 1,
+				rowEnd: t.rowEnd,
+				colStart: t.colStart + e,
+				colEnd: t.colStart + e
+			});
+			i.fill(n.getValuesRange(), a), d = Xe(n, r);
+			const o = Ze(n, t.rowStart + 1, a, i.values);
+			c = o.dates, u = o.dateIds, f = o.values;
+		}
+		l.push({
+			header: Ye(n),
+			ids: a,
+			values: f,
+			numberFormat: d,
+			dates: c,
+			...u ? { dateIds: u } : {}
+		});
+	}
+	return {
+		columns: l,
+		recordCount: r
+	};
+}, Ye = (e) => null == e ? "" : "boolean" == typeof e ? e ? "TRUE" : "FALSE" : Y.isError(e) ? e.getLabel() : String(e), Xe = (e, t) => {
+	const n = [...e.getRegions("numberFormat")];
+	if (1 !== n.length || n[0].getRowCount() !== t) return;
+	const r = n[0].getCell().getStyle().getNumberFormat();
+	return r && "General" !== r ? r : void 0;
+}, Ze = (e, t, n, r) => {
+	const s = [];
+	for (const n of e.getRegions("dateFormat")) {
+		const { rowStart: e, rowEnd: r } = n.getCoords();
+		s.push([e - t, r - t]);
+	}
+	if (0 === s.length) return {
+		dates: !1,
+		values: r
+	};
+	s.sort((e, t) => e[0] - t[0]);
+	let o = !1, l = !1;
+	for (let e = 0; e < n.length && (!o || !l); e++) "number" == typeof r[n[e]] && (et(s, e) ? o = !0 : l = !0);
+	if (!o || !l) return {
+		dates: o,
+		values: r
+	};
+	const i = r.slice(), a = /* @__PURE__ */ new Map();
+	for (let e = 0; e < n.length; e++) {
+		const t = n[e];
+		if ("number" != typeof r[t] || !et(s, e)) continue;
+		let o = a.get(t);
+		void 0 === o && (o = i.length, i.push(r[t]), a.set(t, o)), n[e] = o;
+	}
+	return {
+		dates: !1,
+		dateIds: new Set(a.values()),
+		values: i
+	};
+}, et = (e, t) => {
+	let n = 0, r = e.length - 1;
+	for (; n <= r;) {
+		const s = n + r >> 1, [o, l] = e[s];
+		if (t < o) r = s - 1;
+		else {
+			if (!(t > l)) return !0;
+			n = s + 1;
+		}
+	}
+	return !1;
+}, tt = (e) => null == e ? {
+	t: "z",
+	v: 0
+} : Y.isError(e) ? {
+	t: "e",
+	v: e.getCode()
+} : e, nt = (e, t) => (t && "number" == typeof e ? "date:" : "") + S(a(e)), rt = (e, t, n, r = !1) => {
+	const o = e.fields ?? [], l = $(e.items, o.length), i = /\smissingItemsLimit="0"/.test(e.rest ?? ""), d = ((e) => {
+		const t = /* @__PURE__ */ new Set();
+		return e.map((e, n) => {
+			const r = "" === e ? `Field${n + 1}` : e;
+			let s = r;
+			for (let e = 2; t.has(s.toLocaleLowerCase()); e++) s = `${r}${e}`;
+			return t.add(s.toLocaleLowerCase()), s;
+		});
+	})(t.columns.map((e) => e.header)), u = /* @__PURE__ */ new Map();
+	o.forEach((e, t) => {
+		const n = e.name.toLocaleLowerCase();
+		e.noRecords || u.has(n) || u.set(n, t);
+	});
+	const c = t.recordCount, f = o.map(() => -1), p = o.map((e, t) => l[t].map(() => -1)), h = [], g = [], w = [], v = [], F = [], b = [], y = [], I = (e, t, n) => {
+		v[t] = n.items, b[t] = n.items.length, y[t] = !0, p[e] = ((e, t) => {
+			const n = /* @__PURE__ */ new Map();
+			return t.forEach((e, t) => {
+				n.set(e, t);
+			}), e.map((r, s) => 0 === s ? 0 : s === e.length - 1 ? t.length - 1 : n.get(r) ?? -1);
+		})(o[e].group.items, n.items);
+	};
+	t.columns.forEach((e, t) => {
+		const n = u.get(d[t].toLocaleLowerCase());
+		void 0 !== n && (u.delete(d[t].toLocaleLowerCase()), f[n] = t);
+		const s = new Int32Array(e.values.length).fill(-1), x = [], A = [], C = new Array(c);
+		for (let t = 0; t < c; t++) {
+			const n = e.ids[t];
+			let r = s[n];
+			r < 0 && (r = s[n] = x.length, x.push(tt(e.values[n])), A.push(e.dates || !!e.dateIds?.has(n))), C[t] = r;
+		}
+		const E = (e) => void 0 !== n && (!!o[n].dates || m(o[n], e)), S = x.length, k = void 0 !== n ? !0 === o[n].inline : x.every((e) => "number" == typeof e || "object" == typeof e && "z" === e?.t), M = [];
+		if (void 0 !== n && k) {
+			const e = /* @__PURE__ */ new Map();
+			for (let t = 0; t < S; t++) e.set(nt(x[t], A[t]), t);
+			l[n].forEach((t, r) => {
+				p[n][r] = e.get(nt(t, E(r))) ?? -1;
+			});
+		} else if (void 0 !== n) {
+			const e = /* @__PURE__ */ new Map();
+			for (let t = 0; t < S; t++) e.set(nt(x[t], A[t]), t);
+			const t = new Set(o[n].calculatedItems?.map((e) => e.item));
+			l[n].forEach((r, s) => {
+				if (t.has(s)) return;
+				const o = nt(r, E(s));
+				let l = e.get(o);
+				void 0 !== l || i || E(s) || (l = x.length, x.push(r), A.push(E(s)), M.push(l), e.set(o, l)), p[n][s] = l ?? -1;
+			});
+		}
+		const T = { name: d[t] };
+		k && (T.inline = !0), void 0 !== e.numberFormat && (T.numberFormat = e.numberFormat);
+		const R = [];
+		let N = !1;
+		x.forEach((e, t) => {
+			"number" == typeof e && (A[t] ? R.push(t) : N = !0);
+		}), R.length > 0 && !N ? T.dates = !0 : R.length > 0 && (T.dateItems = R), F[t] = T.dateItems ? new Set(T.dateItems) : void 0, M.length > 0 && (T.unused = M);
+		const O = void 0 !== n ? o[n].rest : void 0;
+		O && (T.rest = O);
+		const _ = void 0 !== n ? o[n].calculatedItems : void 0;
+		_?.length && (T.calculatedItems = _.map(({ item: e, formula: t }) => {
+			const r = x.length;
+			return x.push(l[n][e]), p[n][e] = r, {
+				item: r,
+				formula: t
+			};
+		})), h.push(T), g.push([t, [[0, x]]]), w.push([t, [[0, C]]]), v.push(x), b.push(S), y.push(!1);
+		const $ = void 0 !== n ? o[n].group : void 0;
+		if ($?.range && $.base === n) {
+			const e = le($, x.slice(0, S).map(a), r);
+			e ? (T.group = {
+				...e,
+				base: t
+			}, I(n, t, e)) : p[n] = l[n].map(() => -1);
+		} else $ && !P(o[n]) && (T.group = $);
+	}), o.forEach((e, t) => {
+		if (!e.noRecords) return;
+		if (s(e)) return f[t] = h.length, h.push(e), v.push([]), b.push(0), void y.push(!1);
+		const n = e.group;
+		if (!n) return;
+		const o = f[n.base];
+		if (void 0 === o || o < 0) return;
+		const l = v[o];
+		let i, d = [];
+		if (n.range) i = le(n, l.slice(0, b[o]).map(a), r);
+		else {
+			const e = st(n, p[n.base], l, h[o]);
+			i = e.group, d = e.itemMap;
+		}
+		if (!i) return;
+		const u = h.length;
+		f[t] = u, h.push({
+			...e,
+			group: {
+				...i,
+				base: o
+			}
+		}), v.push(i.items), F[u] = i.dateItems ? new Set(i.dateItems) : void 0, b.push(i.items.length), y.push(!1), n.range ? I(t, u, i) : p[t] = d;
+	}), h.forEach((e, t) => {
+		const n = e.group;
+		if (void 0 === n?.parent) return;
+		const r = f[n.parent], { parent: s, ...o } = n;
+		void 0 !== r && r >= 0 ? e.group = {
+			...n,
+			parent: r
+		} : P(e) ? e.group = o : delete e.group, e.group && !P(e) && (e.group = {
+			...e.group,
+			base: t
+		});
+	});
+	const { cacheId: x, part: A, partFormats: C, fields: E, items: S, records: k, ...M } = e;
+	return {
+		model: {
+			...M,
+			source: n ?? e.source,
+			fields: h,
+			items: g,
+			records: w,
+			recordCount: c
+		},
+		remap: {
+			fields: f,
+			items: p,
+			newItems: v,
+			usedCounts: b,
+			inItemOrder: y,
+			dateItems: F
+		}
+	};
+}, st = (e, t, n, r) => {
+	const s = /* @__PURE__ */ new Set(), o = new Array(n.length).fill(-1);
+	(e.discrete ?? []).forEach((e, n) => {
+		const r = t?.[n] ?? -1;
+		r < 0 || (o[r] = e, s.add(e));
+	});
+	const l = [], i = [], a = new Set(e.dateItems), d = e.items.map((e, t) => s.has(t) ? (a.has(t) && i.push(l.length), l.push(e), l.length - 1) : -1), u = o.map((e, t) => e >= 0 ? d[e] : ((r.dates || m(r, t)) && i.push(l.length), l.push(n[t]), l.length - 1)), { dateItems: c, ...f } = e;
+	return {
+		group: {
+			...f,
+			items: l,
+			discrete: u,
+			...i.length > 0 ? { dateItems: i } : {}
+		},
+		itemMap: d
+	};
+}, ot = (e, t, n = !1, r = !1) => {
+	const s = (e, t) => null === e ? 5 : "number" == typeof e ? t ? 3 : 0 : "string" == typeof e ? 1 : "boolean" == typeof e ? 2 : 4, o = s(e, n), l = s(t, r);
+	return o !== l ? o - l : 0 === o || 3 === o ? e - t : 1 === o ? e.localeCompare(t, void 0, { sensitivity: "base" }) : 2 === o ? Number(e) - Number(t) : 4 === o ? e.getCode() - t.getCode() : 0;
+}, lt = (e, t) => {
+	const n = e.fields ?? [], r = t.newItems.length, s = (e) => e < 0 ? e : t.fields[e] ?? -1, o = (e) => e < 0 || s(e) >= 0, l = e.dataFields ?? [], i = [], a = [];
+	l.forEach((e) => {
+		if (!o(e.field)) return void i.push(-1);
+		i.push(a.length);
+		const t = {
+			...e,
+			field: s(e.field)
+		};
+		void 0 !== e.baseField && (o(e.baseField) ? t.baseField = s(e.baseField) : delete t.baseField), a.push(t);
+	});
+	const d = n.map(() => null), u = [];
+	for (let e = 0; e < r; e++) u.push({});
+	n.forEach((e, n) => {
+		const r = s(n);
+		if (r < 0) return;
+		const o = { ...e };
+		if (void 0 !== e.sort?.dataField) {
+			const t = i[e.sort.dataField];
+			o.sort = t >= 0 ? {
+				...e.sort,
+				dataField: t
+			} : { order: e.sort.order };
+		}
+		if (e.items) {
+			const { items: s, positions: l } = at(e, t.items[n], t.newItems[r], t.usedCounts[r], t.inItemOrder[r], t.dateItems[r]);
+			o.items = s, d[n] = l;
+		}
+		u[r] = o;
+	}), n.forEach((e, t) => {
+		const n = e.sort?.scope, r = s(t);
+		if (!n || r < 0 || void 0 === u[r].sort?.scope) return;
+		const o = n.items.map((e) => ({
+			field: s(e.field),
+			item: d[e.field]?.[e.item] ?? -1
+		}));
+		o.some((e) => e.field < 0 || e.item < 0) ? delete u[r].sort : u[r].sort = {
+			...u[r].sort,
+			scope: {
+				...n,
+				items: o
+			}
+		};
+	});
+	const c = (e) => {
+		if (!e) return;
+		let t = e.filter(o).map(s);
+		return a.length < 2 && (t = t.filter((e) => -2 !== e)), t.length > 0 ? t : void 0;
+	}, f = {
+		...e,
+		fields: u
+	};
+	it(f, "rowFields", c(e.rowFields)), it(f, "columnFields", c(e.columnFields)), it(f, "dataFields", a.length > 0 ? a : void 0), l.forEach((e, t) => {
+		const n = i[t];
+		if (n < 0 || void 0 === e.baseField || "number" != typeof e.baseItem) return;
+		const r = d[e.baseField]?.[e.baseItem];
+		void 0 !== r && r >= 0 && (a[n].baseItem = r);
+	});
+	const m = (e.pageFields ?? []).flatMap((e) => {
+		if (!o(e.field)) return [];
+		const t = { field: s(e.field) };
+		if (void 0 !== e.item) {
+			const n = ut(u[t.field].items ?? [], d[e.field]?.[e.item] ?? -1);
+			void 0 !== n && (t.item = n);
+		}
+		return [t];
+	});
+	it(f, "pageFields", m.length > 0 ? m : void 0);
+	const p = (e.filters ?? []).flatMap((e) => {
+		if (!o(e.field)) return [];
+		const t = {
+			...e,
+			field: s(e.field)
+		};
+		if (void 0 !== e.dataField) {
+			const n = i[e.dataField];
+			if (void 0 === n || n < 0) return [];
+			t.dataField = n;
+		}
+		return [t];
+	});
+	it(f, "filters", p.length > 0 ? p : void 0);
+	const h = (e) => ct(e, s, o, d, i), g = (e.formats ?? []).flatMap((e) => {
+		const t = h(e.area);
+		return t ? [{
+			...e,
+			area: t
+		}] : [];
+	});
+	it(f, "formats", g.length > 0 ? g : void 0);
+	const w = (e.conditionalFormats ?? []).flatMap((e) => {
+		const t = e.areas.flatMap((e) => {
+			const t = h(e);
+			return t ? [t] : [];
+		});
+		return t.length > 0 ? [{
+			...e,
+			areas: t
+		}] : [];
+	});
+	return it(f, "conditionalFormats", w.length > 0 ? w : void 0), f;
+}, it = (e, t, n) => {
+	void 0 === n ? delete e[t] : e[t] = n;
+}, at = (e, t, n, r, s = !1, o) => {
+	const i = e.items ?? [], u = [], c = [], f = /* @__PURE__ */ new Set();
+	for (const e of i) {
+		if (!l(e)) {
+			c.push(u.length), u.push(e);
+			continue;
+		}
+		const n = t[e.item] ?? -1;
+		if (n < 0) {
+			c.push(-1);
+			continue;
+		}
+		f.add(n);
+		const s = {
+			...e,
+			item: n
+		};
+		n >= r && !e.calculated ? s.missing = !0 : delete s.missing, c.push(u.length), u.push(s);
+	}
+	const m = [];
+	for (let e = 0; e < n.length; e++) f.has(e) || m.push(e);
+	if (s) {
+		const t = void 0 === e.sort?.dataField && "descending" === e.sort?.order, n = !e.includeNewItemsInFilter && i.some((e) => e.hidden), r = u.map((e, t) => ({
+			item: e,
+			at: t
+		})), s = r.filter((e) => !l(e.item)), o = [...[...r.filter((e) => l(e.item)), ...m.map((e) => ({
+			item: n ? {
+				item: e,
+				hidden: !0
+			} : { item: e },
+			at: -1
+		}))].sort((e, n) => t ? n.item.item - e.item.item : e.item.item - n.item.item), ...s], a = new Map(o.map((e, t) => [e.at, t]));
+		return {
+			items: o.map((e) => e.item),
+			positions: c.map((e) => e < 0 ? e : a.get(e) ?? -1)
+		};
+	}
+	if (0 === m.length) return {
+		items: u,
+		positions: c
+	};
+	const p = !e.includeNewItemsInFilter && i.some((e) => e.hidden), h = (e) => p ? {
+		item: e,
+		hidden: !0
+	} : { item: e };
+	if (e.sort && void 0 === e.sort.dataField) {
+		const t = "descending" === e.sort.order, r = (e, t) => ot(d(e, n), a(n[t]), void 0 === e.name && o?.has(e.item), o?.has(t));
+		for (const e of m) {
+			const n = h(e);
+			let s = u.findIndex((n) => l(n) && (t ? r(n, e) < 0 : r(n, e) > 0));
+			s < 0 && (s = dt(u)), u.splice(s, 0, n);
+			for (let e = 0; e < c.length; e++) c[e] >= s && c[e]++;
+		}
+	} else {
+		const e = dt(u);
+		u.splice(e, 0, ...m.map(h));
+		for (let t = 0; t < c.length; t++) c[t] >= e && (c[t] += m.length);
+	}
+	return {
+		items: u,
+		positions: c
+	};
+}, dt = (e) => {
+	const t = e.findIndex((e) => !l(e));
+	return t < 0 ? e.length : t;
+}, ut = (e, t) => {
+	if (!(t < 0)) for (let n = 0; n < e.length; n++) {
+		const r = (t + n) % e.length, s = e[r];
+		if (l(s) && !s.missing) return r;
+	}
+}, ct = (e, t, n, r, s) => {
+	const o = { ...e };
+	if (void 0 !== e.field) {
+		if (!n(e.field)) return null;
+		o.field = t(e.field);
+	}
+	if (e.references) {
+		const l = [];
+		for (const o of e.references) {
+			if (!n(o.field)) return null;
+			const e = {
+				...o,
+				field: t(o.field)
+			};
+			if (o.items && !o.byPosition && !o.relative) {
+				const t = -2 === o.field ? s : r[o.field];
+				if (t) {
+					const n = o.items.map((e) => t[e] ?? -1);
+					if (n.some((e) => e < 0)) return null;
+					e.items = n;
+				}
+			}
+			l.push(e);
+		}
+		o.references = l;
+	}
+	return o;
+}, ft = (e, t, n) => {
+	const r = e.fields ?? [], s = r[t]?.items ?? [], o = new Array(s.length);
+	n.forEach((e, t) => {
+		o[e] = t;
+	});
+	const l = {
+		...e,
+		fields: r.map((e, r) => {
+			if (r === t) return {
+				...e,
+				items: n.map((e) => s[e])
+			};
+			const l = e.sort?.scope;
+			if (!l?.items.some((e) => e.field === t)) return e;
+			const i = l.items.map((e) => e.field === t ? {
+				...e,
+				item: o[e.item] ?? e.item
+			} : e);
+			return {
+				...e,
+				sort: {
+					...e.sort,
+					scope: {
+						...l,
+						items: i
+					}
+				}
+			};
+		})
+	};
+	e.pageFields?.some((e) => e.field === t && void 0 !== e.item) && (l.pageFields = e.pageFields.map((e) => e.field === t && void 0 !== e.item ? {
+		...e,
+		item: o[e.item]
+	} : e)), e.dataFields?.some((e) => e.baseField === t && "number" == typeof e.baseItem) && (l.dataFields = e.dataFields.map((e) => e.baseField === t && "number" == typeof e.baseItem ? {
+		...e,
+		baseItem: o[e.baseItem] ?? e.baseItem
+	} : e));
+	const i = r.map((e, n) => n === t ? o : null), a = (e.dataFields ?? []).map((e, t) => t), d = (e) => ct(e, (e) => e, () => !0, i, a) ?? e;
+	return e.formats && (l.formats = e.formats.map((e) => ({
+		...e,
+		area: d(e.area)
+	}))), e.conditionalFormats && (l.conditionalFormats = e.conditionalFormats.map((e) => ({
+		...e,
+		areas: e.areas.map(d)
+	}))), l;
+}, mt = (e, t, n, r) => {
+	const s = (e.fields ?? [])[n]?.items ?? [], o = f(t)[n] ?? [], i = t.fields?.[n], a = void 0 !== i?.group?.range, u = (e) => void 0 === e.name && m(i, e.item), c = s.map((e, t) => ({
+		item: e,
+		at: t
+	})), p = c.filter((e) => l(e.item));
+	p.sort((e, t) => a ? e.item.item - t.item.item : ot(d(e.item, o), d(t.item, o), u(e.item), u(t.item))), "descending" === r && p.reverse();
+	let h = 0;
+	const w = ft(e, n, c.map((e) => l(e.item) ? p[h++] : e).map((e) => e.at));
+	return {
+		...w,
+		fields: w.fields.map((e, t) => t === n ? {
+			...e,
+			sort: { order: r }
+		} : e)
+	};
+}, pt = (e, t, n) => {
+	const r = e.fields?.[t]?.items?.[n];
+	if (!r || !l(r)) throw new X(Z("error.pivotTable.changePart"));
+	return r;
+}, ht = (e, t, n, r, s) => {
+	const o = pt(e, n, r), i = e.fields[n].items, d = f(t)[n] ?? [], c = (e) => {
+		const t = a(d[e.item]);
+		return null === t ? k : u(t);
+	};
+	if (i.some((e, t) => t !== r && l(e) && T(e.name ?? c(e), s))) throw new X(Z("error.pivotTable.itemNameExists", { name: s }));
+	const { name: m, ...p } = o, h = s === c(o) ? p : {
+		...o,
+		name: s
+	};
+	if (h.name === o.name) return e;
+	const g = {
+		...e,
+		fields: e.fields.map((e, t) => t === n ? {
+			...e,
+			items: i.map((e, t) => t === r ? h : e)
+		} : e)
+	}, w = e.fields[n].sort;
+	return w && void 0 === w.dataField ? mt(g, t, n, w.order) : g;
+}, gt = (e, t, n, r) => {
+	pt(e, t, n);
+	const s = e.fields[t].items.map((e, t) => t).filter((e) => e !== n);
+	s.splice(r, 0, n);
+	const o = e.fields[t].sort;
+	if (!o && s.every((e, t) => e === t)) return e;
+	const l = ft(e, t, s);
+	return o ? {
+		...l,
+		fields: l.fields.map((e, n) => {
+			if (n !== t) return e;
+			const { sort: r, ...s } = e;
+			return s;
+		})
+	} : l;
+}, wt = (e, t, n, r) => {
+	const s = u(r), o = e.fields, i = t.fields, d = e.dataFields ?? [], c = f(t), m = (e, t) => {
+		if (void 0 !== t.name) return t.name;
+		const n = a(c[e][t.item]);
+		return null === n ? k : u(n);
+	}, p = (n) => {
+		if (void 0 !== n.field && s === (o[n.field].name ?? i[n.field].name)) return;
+		const r = void 0 === n.field ? e : {
+			...e,
+			fields: o.map((e, t) => t === n.field ? {
+				...e,
+				name: "\0"
+			} : e)
+		};
+		if (v(r, t, s, n.data) !== s) throw new X(Z("error.pivotTable.fieldNameExists"));
+	};
+	switch (n.kind) {
+		case "item": {
+			const { field: r, rank: i } = n;
+			pt(e, r, i);
+			const a = o[r].items.findIndex((e, t) => t !== i && l(e) && T(m(r, e), s));
+			return a >= 0 ? gt(e, r, a, i) : ht(e, t, r, i, s);
+		}
+		case "fieldCaption": {
+			const { field: t } = n;
+			return p({ field: t }), ((t, n) => ({
+				...e,
+				fields: o.map((e, r) => r === t ? n(e) : e)
+			}))(t, (e) => {
+				const { name: n, ...r } = e;
+				return s === i[t].name ? r : {
+					...e,
+					name: s
+				};
+			});
+		}
+		case "dataCaption": {
+			const { data: t } = n;
+			return p({ data: t }), {
+				...e,
+				dataFields: d.map((e, n) => n === t ? {
+					...e,
+					name: s
+				} : e)
+			};
+		}
+		case "rowHeader": return {
+			...e,
+			rowHeaderCaption: s
+		};
+		case "columnHeader": return {
+			...e,
+			columnHeaderCaption: s
+		};
+		case "grandTotal": return {
+			...e,
+			grandTotalCaption: s
+		};
+		case "pageItem": {
+			const t = e.pageFields, r = t[n.page];
+			let i;
+			if (!T(s, "(All)") && (i = (o[r.field].items ?? []).findIndex((e) => l(e) && T(m(r.field, e), s)), i < 0)) throw new X(Z("error.pivotTable.notAnItem", { name: s }));
+			const { item: a, ...d } = r, u = void 0 === i ? d : {
+				...r,
+				item: i
+			};
+			return {
+				...e,
+				pageFields: t.map((e, t) => t === n.page ? u : e)
+			};
+		}
+	}
+}, vt = (e, t, n) => rt({
+	cacheId: 0,
+	fields: []
+}, e, t, n).model, Ft = (e, t) => t.some((t) => e.fields?.[t]?.inline) ? {
+	...e,
+	fields: e.fields.map((e, n) => {
+		if (!e.inline || !t.includes(n)) return e;
+		const { inline: r, ...s } = e;
+		return s;
+	})
+} : e, bt = (e) => [
+	...e.rowFields ?? [],
+	...e.columnFields ?? [],
+	...(e.pageFields ?? []).map((e) => e.field)
+].filter((e) => e >= 0), yt = (e, t) => {
+	const n = e.fields[t], r = f(e)[t], s = r.map((e, t) => t);
+	P(n) || s.sort((e, t) => ot(a(r[e]), a(r[t]), m(n, e), m(n, t)));
+	const o = new Set(n.calculatedItems?.map((e) => e.item)), l = new Set(n.unused);
+	return [...s.map((e) => ({
+		item: e,
+		...o.has(e) ? { calculated: !0 } : {},
+		...l.has(e) ? { missing: !0 } : {}
+	})), { type: "default" }];
+}, It = (e) => {
+	if (!("number" == typeof e ? void 0 !== z(e) : "" !== e && G.isValidFormat(e))) throw new X(Z("error.pivotTable.notANumberFormat", { name: String(e) }));
+}, xt = (e, t, n, r) => {
+	const s = r?.function ?? ((e, t) => "number" === x(e, t) ? "sum" : "count")(t.fields[n], f(t)[n]), o = I[s];
+	if (!o) throw new X(Z("error.pivotTable.notAFunction", { name: s }));
+	let l = r?.name;
+	if (void 0 === l) l = v(e, t, `${o} of ${g(e, t, n)}`);
+	else if (v(e, t, l) !== l) throw new X(Z("error.pivotTable.fieldNameExists"));
+	const i = {
+		name: l,
+		field: n,
+		baseField: 0,
+		baseItem: 0
+	};
+	return "sum" !== s && (i.subtotal = s), void 0 !== r?.numberFormat && (It(r.numberFormat), i.numberFormat = r.numberFormat), i;
+}, At = (e, t) => {
+	const n = e.fields ?? [], r = (e) => {
+		const t = n.findIndex((t) => T(t.name, e));
+		if (t < 0) throw new X(Z("error.pivotTable.notAField", { name: e }));
+		return t;
+	}, s = /* @__PURE__ */ new Map(), o = (e, t) => {
+		for (const n of e ?? []) {
+			const e = r(n);
+			s.delete(e), s.set(e, t);
+		}
+	};
+	o(t?.rows, "row"), o(t?.columns, "column"), o(t?.pages, "page");
+	const l = (e) => [...s].filter(([, t]) => t === e).map(([e]) => e), i = [];
+	for (const n of t?.values ?? []) {
+		const { field: t, ...s } = "string" == typeof n ? { field: n } : n;
+		i.push(xt({ dataFields: i }, e, r(t), s));
+	}
+	const a = new Set(i.map((e) => e.field)), d = t?.form && "compact" !== t.form ? t.form : void 0, u = n.map((t, n) => {
+		const r = {}, o = s.get(n);
+		return o && (r.axis = o, r.items = yt(e, n)), a.has(n) && (r.dataField = !0), d && (r.form = d), t.dates && void 0 !== t.numberFormat && (r.numberFormat = t.numberFormat), r;
+	}), c = l("column");
+	i.length > 1 && c.push(-2);
+	const f = {
+		fields: u,
+		style: {
+			name: t?.style ?? "PivotStyleLight16",
+			showRowHeaders: !0,
+			showColumnHeaders: !0,
+			showRowStripes: !1,
+			showColumnStripes: !1,
+			showLastColumn: !0
+		}
+	}, m = l("row");
+	m.length > 0 && (f.rowFields = m), c.length > 0 && (f.columnFields = c);
+	const p = l("page");
+	return p.length > 0 && (f.pageFields = p.map((e) => ({ field: e }))), i.length > 0 && (f.dataFields = i), d && (f.form = d), f;
+}, Ct = (e, t) => t.map((t) => {
+	const n = t.sort?.scope;
+	if (!n) return t;
+	const r = ((t.axis === b.Axis.Row ? e.columnFields : t.axis === b.Axis.Column ? e.rowFields : void 0) ?? []).filter((e) => -2 !== e);
+	if (!n.items.every((e, t) => r[t] === e.field)) {
+		const { sort: e, ...n } = t;
+		return n;
+	}
+	const { subtotal: s, ...o } = n;
+	return {
+		...t,
+		sort: {
+			...t.sort,
+			scope: n.items.length < r.length ? {
+				...o,
+				subtotal: !0
+			} : o
+		}
+	};
+}), Et = (e, r, s, o, l) => {
+	const i = b.Axis, a = r.fields?.[s], d = e.fields?.[s]?.axis ?? null;
+	if (o === i.Values) throw new X(Z("error.pivotTable.valuesNotAnAxis"));
+	if (null === o) {
+		if (null === d) return e;
+	} else if (void 0 !== a?.formula || o === i.Page && (a?.calculatedItems?.length ?? 0) > 0) throw new X(Z("error.pivotTable.fieldNotPlaceable"));
+	const u = o ? n(e, o).filter((e) => e !== s) : [];
+	if (void 0 !== l && (!Number.isInteger(l) || l < 1 || l > u.length + 1)) throw new X(Z("error.pivotTable.fieldPosition"));
+	const c = (l ?? u.length + 1) - 1;
+	if (o === d && (void 0 === l || n(e, o)[c] === s)) return e;
+	u.splice(c, 0, s);
+	const { rowFields: f, columnFields: m, pageFields: p, ...g } = e, w = {}, v = (e) => (e ?? []).filter((e) => e !== s), F = o === i.Row ? u : v(e.rowFields), y = o === i.Column ? u : v(e.columnFields), I = o === i.Page ? u.map((t) => e.pageFields?.find((e) => e.field === t) ?? { field: t }) : (e.pageFields ?? []).filter((e) => e.field !== s);
+	F.length > 0 && (w.rowFields = F), y.length > 0 && (w.columnFields = y), I.length > 0 && (w.pageFields = I);
+	let x = {
+		...g,
+		...w
+	};
+	o === i.Page && d !== i.Page && (x = h(x, s, () => !0));
+	const A = { ...e.fields?.[s] };
+	o ? A.axis = o : delete A.axis, o && !A.items && a && (A.items = t(yt(r, s), A.subtotals)), o && void 0 === A.numberFormat && a?.dates && void 0 !== a.numberFormat && (A.numberFormat = a.numberFormat), o === i.Page && A.items?.some((e) => e.hidden) && (A.multipleItemSelection = !0);
+	const C = (e.fields ?? []).map((e, t) => t === s ? A : e);
+	if (x = {
+		...x,
+		fields: Ct(x, C)
+	}, null === o && e.formats?.some((e) => e.area.references?.some((e) => e.field === s))) {
+		const t = e.formats.filter((e) => !e.area.references?.some((e) => e.field === s)), { formats: n, ...r } = x;
+		x = t.length > 0 ? {
+			...r,
+			formats: t
+		} : r;
+	}
+	return x;
+}, St = -2, kt = /* @__PURE__ */ new Set([
+	"percentOfTotal",
+	"percentOfRow",
+	"percentOfCol",
+	"percentOfParentRow",
+	"percentOfParentCol",
+	"percentOfParent",
+	"percentOfRunningTotal",
+	"percent",
+	"percentDiff"
+]), Mt = /* @__PURE__ */ new Set([
+	"index",
+	"rankAscending",
+	"rankDescending"
+]), Tt = /* @__PURE__ */ new Set([
+	...kt,
+	...Mt,
+	"runTotal",
+	"difference"
+]), Pt = (e, t, n) => {
+	if (Mt.has(n)) return Mt.has(t) ? e : void 0;
+	const r = ((e) => L(e).replace(/"[^"]*"|\\./g, "").includes("%"))(e);
+	return kt.has(n) ? kt.has(t) || r ? e : 10 : kt.has(t) && r ? void 0 : e;
+}, Rt = (e, t) => {
+	const n = 1 === e.references?.length ? e.references[0] : null;
+	return !1 === e.outline && n?.field === St && 1 === n.items?.length && n.items[0] === t && void 0 === n.selected && !e.type && !e.labelOnly && void 0 === e.dataOnly;
+}, Nt = (e, t) => {
+	if (!e.formats?.some((e) => Rt(e.area, t))) return e;
+	const n = e.formats.filter((e) => !Rt(e.area, t)), { formats: r, ...s } = e;
+	return n.length > 0 ? {
+		...s,
+		formats: n
+	} : s;
+}, Ot = (e, t, n) => ({
+	...e,
+	dataFields: e.dataFields.map((e, r) => r === t ? n(e) : e)
+}), _t = (e, t) => {
+	const { numberFormat: n, ...r } = e;
+	return void 0 === t ? r : {
+		...r,
+		numberFormat: t
+	};
+}, $t = (e, t, n) => {
+	const r = new Set(t.map((e) => e.field)), s = (e.fields ?? []).map((e, t) => {
+		let s = e;
+		if (void 0 !== e.sort?.dataField) {
+			const t = n[e.sort.dataField];
+			if (t < 0) {
+				const { sort: e, ...t } = s;
+				s = t;
+			} else t !== e.sort.dataField && (s = {
+				...s,
+				sort: {
+					...e.sort,
+					dataField: t
+				}
+			});
+		}
+		if (!!e.dataField !== r.has(t)) {
+			const { dataField: e, ...n } = s;
+			s = r.has(t) ? {
+				...n,
+				dataField: !0
+			} : n;
+		}
+		return s;
+	}), { dataFields: o, filters: l, formats: i, conditionalFormats: a, ...d } = e, u = {
+		...d,
+		fields: s
+	};
+	t.length > 0 && (u.dataFields = t);
+	const c = (e.filters ?? []).flatMap((e) => {
+		if (void 0 === e.dataField) return [e];
+		const t = n[e.dataField];
+		return t < 0 ? [] : [{
+			...e,
+			dataField: t
+		}];
+	});
+	c.length > 0 && (u.filters = c);
+	const f = (e) => ct(e, (e) => e, () => !0, [], n), m = (e.formats ?? []).flatMap((e) => {
+		const t = f(e.area);
+		return t ? [{
+			...e,
+			area: t
+		}] : [];
+	});
+	m.length > 0 && (u.formats = m);
+	const p = (e.conditionalFormats ?? []).flatMap((e) => {
+		const t = e.areas.flatMap((e) => f(e) ?? []);
+		return t.length > 0 ? [{
+			...e,
+			areas: t
+		}] : [];
+	});
+	return p.length > 0 && (u.conditionalFormats = p), ((e) => {
+		const t = e.dataFields?.length ?? 0, n = e.rowFields?.includes(St), r = e.columnFields?.includes(St), { valuesPosition: s, ...o } = e;
+		if (t < 2 && (n || r)) {
+			const t = n ? "rowFields" : "columnFields", r = e[t], s = r.indexOf(St), l = r.filter((e) => e !== St), i = {
+				...o,
+				...s < l.length ? { valuesPosition: s } : {}
+			};
+			return l.length > 0 ? i[t] = l : delete i[t], i;
+		}
+		if (t >= 2 && !n && !r) {
+			const t = e.valuesOnRows ? "rowFields" : "columnFields", n = [...e[t] ?? []];
+			return n.splice(Math.min(s ?? n.length, n.length), 0, St), {
+				...o,
+				[t]: n
+			};
+		}
+		return e;
+	})(u);
+}, Lt = (e, t, n, r) => {
+	const s = Et(e, t, n, null), o = s.dataFields?.length ?? 0, l = xt(s, t, n, r);
+	return $t(s, [...s.dataFields ?? [], l], Array.from({ length: o }, (e, t) => t));
+}, Dt = (e, t) => {
+	const n = e.dataFields ?? [], r = [], s = [];
+	return n.forEach((e, n) => {
+		void 0 !== t && n !== t ? (r.push(s.length), s.push(e)) : r.push(-1);
+	}), $t(e, s, r);
+}, Vt = (e, t, n) => {
+	const r = e.dataFields ?? [];
+	if (!Number.isInteger(n) || n < 1 || n > r.length) throw new X(Z("error.pivotTable.valuePosition"));
+	if (n - 1 === t) return e;
+	const s = r.map((e, t) => t).filter((e) => e !== t);
+	s.splice(n - 1, 0, t);
+	const o = [];
+	return s.forEach((e, t) => {
+		o[e] = t;
+	}), $t(e, s.map((e) => r[e]), o);
+}, Ut = (e, t, n, r) => {
+	const s = U(e, t, n, r);
+	return (e.dataFields[n].subtotal ?? "sum") === r ? e : Ot(e, n, (e) => {
+		const { subtotal: t, ...n } = e, o = {
+			...n,
+			name: s
+		};
+		return "sum" !== r && (o.subtotal = r), o;
+	});
+}, Ht = (e, t, n, r) => {
+	const s = e.dataFields[n], o = s.showDataAs ?? "normal", l = r?.kind ?? "normal";
+	if (r && !Tt.has(r.kind)) throw new X(Z("error.pivotTable.notAShowAs", { name: r.kind }));
+	const { showDataAs: i, baseField: a, baseItem: d, ...u } = s, f = { ...u };
+	"normal" !== l && (f.showDataAs = l);
+	let m = s.baseField, p = s.baseItem;
+	if (void 0 !== r?.baseField) {
+		const n = r.baseField, s = (t.fields ?? []).findIndex((r, s) => T(g(e, t, s), n));
+		if (s < 0) throw new X(Z("error.pivotTable.notAField", { name: n }));
+		s !== m && (m = s, p = 0);
+	}
+	if (void 0 !== r?.baseItem) {
+		const n = m ?? 0;
+		if (T(r.baseItem, "(previous)")) p = "previous";
+		else if (T(r.baseItem, "(next)")) p = "next";
+		else {
+			const s = e.fields?.[n]?.items ? e : { fields: (e.fields ?? []).map((e, r) => r === n ? {
+				...e,
+				items: yt(t, n)
+			} : e) }, o = c(s, t, n).findIndex((e) => null !== e && T(e, r.baseItem));
+			if (o < 0) throw new X(Z("error.pivotTable.notAnItem", { name: r.baseItem }));
+			p = o;
+		}
+	}
+	if (void 0 !== m && (f.baseField = m), void 0 !== p && (f.baseItem = p), l === o) return f.baseField === s.baseField && f.baseItem === s.baseItem ? e : Ot(e, n, () => f);
+	const h = Pt(s.numberFormat, o, l);
+	return h === s.numberFormat ? Ot(e, n, () => f) : Ot(Nt(e, n), n, () => _t(f, h));
+}, Bt = (e, t, n) => {
+	It(n);
+	const r = L(n), s = e.dataFields[t], o = e.formats?.[e.formats.length - 1];
+	if (L(s.numberFormat) === r && o && Rt(o.area, t) && o.style.numberFormat === r) return e;
+	const i = Ot(Nt(e, t), t, (e) => _t(e, "General" === r ? void 0 : n));
+	return {
+		...i,
+		formats: [...i.formats ?? [], {
+			style: { numberFormat: r },
+			area: {
+				outline: !1,
+				references: [{
+					field: St,
+					items: [t]
+				}]
+			}
+		}]
+	};
+}, zt = (e, t, r) => {
+	if (null === t) return Dt(e);
+	const s = b.Axis;
+	if (t !== s.Row && t !== s.Column) throw new X(Z("error.pivotTable.fieldNotPlaceable"));
+	const o = e.rowFields?.includes(St) ? s.Row : e.columnFields?.includes(St) ? s.Column : null;
+	if (!o) throw new X(Z("error.pivotTable.fieldPosition"));
+	const l = n(e, t).filter((e) => e !== St);
+	if (void 0 !== r && (!Number.isInteger(r) || r < 1 || r > l.length + 1)) throw new X(Z("error.pivotTable.fieldPosition"));
+	const i = (r ?? l.length + 1) - 1;
+	if (t === o && (void 0 === r || n(e, t)[i] === St)) return e;
+	l.splice(i, 0, St);
+	const { rowFields: a, columnFields: d, valuesOnRows: u, ...c } = e, f = n(e, t === s.Row ? s.Column : s.Row).filter((e) => e !== St), m = { ...c }, p = t === s.Row ? l : f, h = t === s.Column ? l : f;
+	return p.length > 0 && (m.rowFields = [...p]), h.length > 0 && (m.columnFields = [...h]), t === s.Row && (m.valuesOnRows = !0), m;
+}, Gt = (e, t, n) => {
+	if (n === (e.valuesCaption ?? "Values")) return e;
+	const { valuesCaption: r, ...s } = e, o = {
+		...s,
+		valuesCaption: "\0"
+	};
+	if (v(o, t, n) !== n) throw new X(Z("error.pivotTable.fieldNameExists"));
+	return "Values" === n ? s : {
+		...s,
+		valuesCaption: n
+	};
+};
+export { Lt as addPivotDataField, Ke as anchorPivotPeriods, It as assertNumberFormat, bt as axisFieldsOf, je as buildPivotView, qe as evaluatePivotFilters, e as isItemFilter, _e as layOutPivot, yt as listedItemsOf, Vt as movePivotDataField, Et as movePivotField, gt as movePivotItem, zt as movePivotValues, vt as newPivotCache, At as newPivotTable, We as readPivotSource, rt as refreshPivotCache, lt as remapPivotTable, Dt as removePivotDataField, ht as renamePivotItem, Gt as renamePivotValues, ft as reorderPivotItems, Ut as setPivotDataFunction, Bt as setPivotDataNumberFormat, Ht as setPivotDataShowAs, mt as sortPivotItemsByLabel, wt as typeOverPivot, Ft as withListedFields };