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

package/browser/esm/C3JOjQwdG9kAig7i.mjs

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