@sheetxl/mcp 0.8.0-beta.14 → 0.8.0-beta.16

package/assets/SaCo3me4_hw2b1L4.js

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