@sheetxl/mcp 0.8.0-beta.17 → 0.8.0-beta.19

package/assets/{BJdWgj1hv57eGVl4.js → zEyWjY3NhC8w_spQ.js}

@@ -1,15 +1,15 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.19
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { p as e, tt as t } from "./CfA8o-FNret9-D6Y.js";
-import { d as n, en as s, f as r, vt as o } from "./BJBoygm-gY68bLAP.js";
-import { d as a } from "./MW2nt7se27FlH9Yb.js";
-import { Bi as i, Dr as l, Dt as d, F as u, G as c, Gi as f, Hi as m, Hr as p, Ii as h, Ir as g, La as w, Oa as v, Oi as F, Pt as b, Qi as y, Qr as I, S as x, Ua as A, Vi as C, Vn as E, Xi as S, Y as P, Ya as k, Yi as M, _r as T, ai as O, at as R, dr as N, fn as L, ha as $, hr as _, ji as D, mt as V, n as U, w as H, xa as B, xn as z, yr as G, zi as j, zn as q } from "./D6ON3ZLcTAXV3fO6.js";
-import { a as Q, i as K, n as J, o as W, r as Y } from "./BjhAYfsKC8iEbtgn.js";
-var X = [
+import { p as e, tt as t } from "./B7vRFm79CUJ1VvFw.js";
+import { d as n, en as s, f as r, vt as o } from "./Cgf5GQVN-D8SlQ7A.js";
+import { u as a } from "./bJ-XKvDf7IkAafUI.js";
+import { $a as i, $i as l, A as d, Bi as u, E as c, Er as f, H as m, I as p, In as h, Ji as g, Li as w, Na as v, Nr as F, On as b, Sa as y, Ta as I, Wa as x, Wn as A, Wr as C, Wt as E, Yi as S, Zr as P, _a as k, d as M, di as T, ea as O, f as R, gr as N, hi as $, ii as L, jr as _, n as D, nt as V, ot as U, pn as H, ra as B, ri as j, u as z, xt as G, y as W } from "./BkhdNc3LdmcyAjwk.js";
+import { a as q, i as K, n as J, o as Q, r as Y } from "./CjrzyKFdie6KYfsG.js";
+var Z = [
 	"Jan",
 	"Feb",
 	"Mar",
@@ -22,7 +22,7 @@ var X = [
 	"Oct",
 	"Nov",
 	"Dec"
-], Z = [
+], X = [
 	31,
 	29,
 	31,
@@ -52,7 +52,7 @@ var X = [
 		case "months": return a.month;
 		case "days": {
 			let e = a.day;
-			for (let t = 0; t < a.month - 1; t++) e += Z[t];
+			for (let t = 0; t < a.month - 1; t++) e += X[t];
 			return e;
 		}
 		case "hours": return a.hour + 1;
@@ -61,15 +61,15 @@ var X = [
 		default: return null;
 	}
 }, te = (e, t) => {
-	const n = e.fields ?? [], s = p(e.records, n.length);
-	if (!n.some(m)) return s;
-	const r = p(e.items, n.length), o = e.recordCount ?? 0, a = s.slice();
+	const n = e.fields ?? [], s = S(e.records, n.length);
+	if (!n.some(B)) return s;
+	const r = S(e.items, n.length), o = e.recordCount ?? 0, a = s.slice();
 	for (let e = 0; e < n.length; e++) {
 		const i = n[e];
-		if (!m(i)) continue;
+		if (!B(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, w(u[e]), t) : l.discrete?.[e] ?? null;
+			const n = l.range ? ee(l.range, l.items.length, T(u[e]), t) : l.discrete?.[e] ?? null;
 			c[e] = n ?? -1;
 		}
 		const f = new Array(o);
@@ -110,8 +110,8 @@ var X = [
 			case "days":
 				if (1 === o) {
 					const e = [];
-					return Z.forEach((t, n) => {
-						for (let s = 1; s <= t; s++) e.push(`${s}-${X[n]}`);
+					return X.forEach((t, n) => {
+						for (let s = 1; s <= t; s++) e.push(`${s}-${Z[n]}`);
 					}), {
 						inner: e,
 						endText: a
@@ -125,7 +125,7 @@ var X = [
 					endText: a
 				};
 			case "months": return {
-				inner: X.slice(),
+				inner: Z.slice(),
 				endText: a
 			};
 			case "quarters": return {
@@ -231,10 +231,10 @@ var X = [
 		if (t.includes(e)) return !1;
 		const l = [];
 		oe(n[e].formula, (e) => {
-			const t = n.findIndex((t) => h(t.name, e));
+			const t = n.findIndex((t) => m(t.name, e));
 			return t >= 0 && l.push(t), t >= 0 ? "" : null;
 		});
-		for (const r of l) if (B(n[r])) {
+		for (const r of l) if ($(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({
@@ -242,7 +242,7 @@ var X = [
 			expression: ""
 		}), !0;
 	}, l = [];
-	for (const [t, s] of (e.dataFields ?? []).entries()) if (B(n[s.field])) {
+	for (const [t, s] of (e.dataFields ?? []).entries()) if ($(n[s.field])) {
 		if (!i(s.field, [])) return null;
 		l.push({
 			data: t,
@@ -251,8 +251,8 @@ var X = [
 	}
 	const d = (e, t) => {
 		if (null !== t) return null;
-		const r = n.findIndex((t) => h(t.name, e));
-		return r >= 0 ? ae(B(n[a = r]) ? s.length + o.get(a) : s.indexOf(a)) : null;
+		const r = n.findIndex((t) => m(t.name, e));
+		return r >= 0 ? ae($(n[a = r]) ? s.length + o.get(a) : s.indexOf(a)) : null;
 		var a;
 	};
 	for (const e of r) {
@@ -343,75 +343,75 @@ var X = [
 	percent: 13,
 	percentDiff: 14
 }, Ie = (e, t, n, s) => {
-	const r = c.peek(), o = e.fields, a = t.fields;
+	const r = V.peek(), o = e.fields, a = t.fields;
 	if (!r || !o || !a || o.length !== a.length) return null;
-	if (q(e)) return {
+	if (k(e)) return {
 		cells: [],
-		...V,
+		...H,
 		rowPageCount: 0,
 		columnPageCount: 0,
-		header: j(e),
+		header: l(e),
 		rowLines: [],
 		columnLines: [],
 		viewValues: [],
 		firstKey: null,
 		...s?.roles ? { roles: /* @__PURE__ */ new Map() } : {}
 	};
-	const i = D(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 u = de(e, t);
-	if (!u || u.measures.length > 0 && !l?.fieldValues) return null;
+	const i = F(e, a), d = i ? s?.filters : null;
+	if (i && !d) return null;
+	const u = o.some((e) => e.items?.some((e) => e.calculated));
+	if (u && !d?.calculatedRecords) return null;
+	const c = de(e, t);
+	if (!c || c.measures.length > 0 && !d?.fieldValues) return null;
 	if ((e.dataFields ?? []).some((e) => void 0 === ye[e.showDataAs ?? "normal"] || void 0 === pe[e.subtotal ?? "sum"])) return null;
-	const f = xe(e, t, n, l?.calculatedRecords, u.operands);
+	const f = xe(e, t, n, d?.calculatedRecords, c.operands);
 	if (!f) return null;
-	const { items: p, records: h, values: g, n: w } = f, v = (e) => !!e && (!e.noRecords || m(e)), F = e.form ?? "compact", b = (e) => {
+	const { items: m, records: h, values: g, n: w } = f, v = (e) => !!e && (!e.noRecords || B(e)), b = e.form ?? "compact", y = (e) => {
 		const t = [];
 		for (const n of e ?? []) {
 			if (n === ce) {
 				t.push({
 					field: n,
-					form: F
+					form: b
 				});
 				continue;
 			}
 			const e = o[n], s = e?.subtotals;
 			if (!e || !v(a[n])) return null;
-			if (d && s && s.some((e) => "default" !== e)) return null;
+			if (u && s && s.some((e) => "default" !== e)) return null;
 			t.push({
 				field: n,
 				form: e.form ?? "compact"
 			});
 		}
 		return t;
-	}, y = b(e.rowFields), I = b(e.columnFields), x = e.pageFields ?? [];
-	if (!y || !I || x.some((e) => !v(a[e.field]))) return null;
-	const C = A(e, s?.slicerFields);
-	return C.pageFields?.some((e) => !v(a[e.field])) ? null : Te(e, t, p, y, I, Se(r, C, p, h, g, y, I, w, l?.keep, l?.records, u.operands.length, l?.fieldValues, !0), n, !0 === s?.roles, "columns" === s?.cellOrder);
+	}, I = y(e.rowFields), x = y(e.columnFields), A = e.pageFields ?? [];
+	if (!I || !x || A.some((e) => !v(a[e.field]))) return null;
+	const C = p(e, s?.slicerFields);
+	return C.pageFields?.some((e) => !v(a[e.field])) ? null : Te(e, t, m, I, x, Se(r, C, m, h, g, I, x, w, d?.keep, d?.records, c.operands.length, d?.fieldValues, !0), n, !0 === s?.roles, "columns" === s?.cellOrder);
 }, xe = (e, t, n, s, r = []) => {
-	const o = t.fields?.length ?? 0, a = G(t);
+	const o = t.fields?.length ?? 0, a = R(t);
 	if (!t.records) return null;
 	const i = te(t, n.isDate1904());
 	if (!i) return null;
-	const l = !0 === t.fields?.some(m), d = l ? p(t.items, o) : a, u = l ? p(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] = w(o[r[e]]);
+	const l = !0 === t.fields?.some(B), d = l ? S(t.items, o) : a, u = l ? S(t.records, o) : i, c = t.recordCount ?? 0, f = s?.count ?? 0, m = c + f, p = (e, n) => {
+		const s = !t.fields?.[e]?.noRecords, r = s ? u[e] : i[e] ?? [], o = s ? d[e] : a[e], l = new Array(m);
+		for (let e = 0; e < c; e++) l[e] = T(o[r[e]]);
 		for (let e = 0; e < f; e++) l[c + e] = n?.[e] ?? null;
 		return l;
-	}, v = [...(e.dataFields ?? []).map((e, t) => g(e.field, s?.values[t])), ...r.map((e) => g(e))];
+	}, h = [...(e.dataFields ?? []).map((e, t) => p(e.field, s?.values[t])), ...r.map((e) => p(e))];
 	return {
 		items: a,
 		records: s ? i.map((e, t) => e.concat(s.ids[t] ?? [])) : i,
-		values: v,
-		n: h
+		values: h,
+		n: m
 	};
 }, Ae = async (e, t, n, s, r, o, a, i, l) => {
-	const d = c.peek(), u = e.dataFields?.[r];
+	const d = V.peek(), u = e.dataFields?.[r];
 	if (!d || !e.fields || !u || void 0 === pe[u.subtotal ?? "sum"]) return null;
-	const f = [e.rowFields, e.columnFields].map((e) => (e ?? []).filter((e) => e !== ce)), m = f.findIndex((e) => e.includes(s)), p = f[m];
-	if (!p) return null;
-	const h = p.slice(0, p.indexOf(s)), g = e.fields.map((e) => {
+	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,
@@ -421,46 +421,46 @@ var X = [
 				return n;
 			})
 		};
-	}), { columnGrandTotals: w, ...v } = e, { showDataAs: F, ...b } = u, y = {
-		...v,
-		fields: g,
-		rowFields: [...h, s],
+	}), { columnGrandTotals: g, ...w } = e, { showDataAs: v, ...F } = u, b = {
+		...w,
+		fields: h,
+		rowFields: [...p, s],
 		columnFields: [],
-		dataFields: [b],
+		dataFields: [F],
 		rowGrandTotals: !1
-	}, I = i ? {
+	}, y = i ? {
 		...i,
 		values: [i.values[r] ?? []]
-	} : i, x = de(y, t);
-	if (!x || x.measures.length > 0 && !l) return null;
-	const A = xe(y, t, n, I, x.operands);
-	if (!A) return null;
-	const { items: C, records: E, values: S, n: P } = A, k = y.rowFields.map((e) => ({
+	} : i, I = de(b, t);
+	if (!I || I.measures.length > 0 && !l) return null;
+	const x = xe(b, t, n, y, I.operands);
+	if (!x) return null;
+	const { items: A, records: C, values: E, n: S } = x, P = b.rowFields.map((e) => ({
 		field: e,
 		form: "compact"
 	}));
-	let M;
+	let k;
 	if (a) {
-		const e = 0 === m ? 1 : 2;
-		M = new Uint8Array(P);
-		for (let t = 0; t < P; t++) {
+		const e = 0 === f ? 1 : 2;
+		k = new Uint8Array(S);
+		for (let t = 0; t < S; t++) {
 			const n = a[t];
-			M[t] = (n & e ? 1 : 0) | (3 === n ? 2 : 0);
+			k[t] = (n & e ? 1 : 0) | (3 === n ? 2 : 0);
 		}
 	}
-	const T = x.measures.length > 0 ? await Ee(d, x, y, C, E, S, k, [], P, o, M, l) : void 0, O = Se(d, y, C, E, S, k, [], P, o, M, x.operands.length, T), R = (t, n) => e.fields[t].items?.[n]?.item ?? n, N = /* @__PURE__ */ new Map(), L = O.columns.length;
-	return O.rows.forEach((e, t) => {
-		if (0 !== e.kind || e.path.length !== h.length + 1) return;
-		const n = h.map((t, n) => R(t, e.path[n])).join(",");
-		let r = N.get(n);
-		r || N.set(n, r = {
+	const M = I.measures.length > 0 ? await Ee(d, I, b, A, C, E, P, [], S, o, k, l) : void 0, T = Se(d, b, A, C, E, P, [], S, o, k, I.operands.length, M), O = (t, n) => e.fields[t].items?.[n]?.item ?? n, R = /* @__PURE__ */ new Map(), N = T.columns.length;
+	return T.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 = R.get(n);
+		r || R.set(n, r = {
 			ids: [],
 			totals: []
-		}), r.ids.push(R(s, e.path[h.length])), r.totals.push(O.values[t * L]);
+		}), r.ids.push(O(s, e.path[p.length])), r.totals.push(T.values[t * N]);
 	}), {
-		outer: h,
-		groups: N,
-		records: E
+		outer: p,
+		groups: R,
+		records: C
 	};
 }, Ce = (e, t, n) => {
 	const s = new Uint32Array(t).fill(fe), r = new Uint8Array(t), o = e.items;
@@ -650,56 +650,56 @@ var X = [
 		return null !== e.data && e.data > 0 && (s.dataField = e.data), s;
 	});
 }, Te = (e, t, n, r, o, i, d, u, c) => {
-	const m = e.fields, p = t.fields, h = e.dataFields ?? [], F = (t) => t === ce ? e.valuesCaption ?? "Values" : m[t].name ?? p[t].name, b = (e, t) => {
+	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 = w(n[e][s?.item ?? t]);
-		return null === r ? v : r;
-	}, y = (e, t) => {
-		const n = b(e, t);
+		const r = T(n[e][s?.item ?? t]);
+		return null === r ? P : 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) && I(p[e], r);
-			return s(d, o ? l(g(p[e], r), d) : ((e) => l(m[e].numberFormat ?? p[e].numberFormat, d))(e), n);
+			const r = m[e].items?.[t]?.item ?? t, o = void 0 === (m[e].numberFormat ?? p[e].numberFormat) && C(p[e], r);
+			return s(d, o ? L(x(p[e], r), d) : ((e) => L(m[e].numberFormat ?? p[e].numberFormat, d))(e), n);
 		}
 		return a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
-	}, x = (e) => {
-		if (void 0 !== e.item) return b(e.field, e.item);
+	}, b = (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) => k(e) && !e.hidden ? [t] : []);
-		return 1 === n.length ? b(e.field, n[0]) : "(Multiple Items)";
-	}, A = e.grandTotalCaption ?? "Grand Total", S = u ? /* @__PURE__ */ new Map() : null, P = (e, t) => e === ce ? {
+		const n = t.flatMap((e, t) => f(e) && !e.hidden ? [t] : []);
+		return 1 === n.length ? v(e.field, n[0]) : "(Multiple Items)";
+	}, I = e.grandTotalCaption ?? "Grand Total", A = u ? /* @__PURE__ */ new Map() : null, E = (e, t) => e === ce ? {
 		kind: "dataCaption",
 		data: t
 	} : {
 		kind: "item",
 		field: e,
 		rank: t
-	}, M = (e) => e === ce ? null : {
+	}, S = (e) => e === ce ? null : {
 		kind: "fieldCaption",
 		field: e
-	}, T = (e, t) => 2 === e.kind && t === A ? { kind: "grandTotal" } : null, O = 0 === r.length && 0 === o.length && 0 === h.length, R = O ? {
+	}, k = (e, t) => 2 === e.kind && t === I ? { kind: "grandTotal" } : null, M = 0 === r.length && 0 === o.length && 0 === h.length, O = M ? {
 		firstHeaderRow: 0,
 		firstDataRow: 0,
 		firstDataCol: 0
-	} : j(e), N = O ? [] : Me(i.rows, i.functions), L = O ? [] : Me(i.columns, i.functions), $ = f({
+	} : l(e), R = M ? [] : Me(i.rows, i.functions), N = M ? [] : Me(i.columns, i.functions), $ = y({
 		...e,
-		header: R,
-		rowLines: N,
-		columnLines: L
-	}), D = i.columns.length, V = (e) => "row" === e ? r : o, U = (t) => {
+		header: O,
+		rowLines: R,
+		columnLines: N
+	}), _ = i.columns.length, V = (e) => "row" === e ? r : o, U = (t) => {
 		switch (t.kind) {
 			case "pageCaption": {
 				const n = e.pageFields[t.page].field;
-				return [F(n), {
+				return [w(n), {
 					kind: "fieldCaption",
 					field: n
 				}];
 			}
 			case "pageItem": {
 				const n = e.pageFields[t.page];
-				return [x(n), {
+				return [b(n), {
 					kind: "pageItem",
 					page: t.page
 				}];
@@ -712,27 +712,27 @@ var X = [
 			case "columnHeader": return [e.columnHeaderCaption ?? "Column Labels", { kind: "columnHeader" }];
 			case "fieldCaption": {
 				const e = V(t.axis)[t.level].field;
-				return [F(e), M(e)];
+				return [w(e), S(e)];
 			}
 			case "label": {
 				const e = V(t.axis)[t.level].field, n = t.line.path[t.level];
-				return [b(e, n), P(e, n)];
+				return [v(e, n), E(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}` : A;
-					const r = t.path.length - 1, o = e[r].field, a = y(o, t.path[r]);
+					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 ${F(h[t.data].field)}` : `${a} ${e}`;
+						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`);
 				})(V(t.axis), e);
-				return [n, T(e, n)];
+				return [n, k(e, n)];
 			}
 			case "value": {
-				const n = t.row.index * D + t.column.index, s = i.states[n];
+				const n = t.row.index * _ + 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;
@@ -743,207 +743,207 @@ var X = [
 				})(e.emptyCaption)), [r, null];
 			}
 		}
-	}, H = new C.Builder(), B = $.top, z = $.pages.reduce((e, t) => Math.max(e, t.column + 2), 0), G = (e, t) => {
-		const n = _($, e, t);
+	}, H = new g.Builder(), B = $.top, j = $.pages.reduce((e, t) => Math.max(e, t.column + 2), 0), G = (e, t) => {
+		const n = z($, e, t);
 		if (!n) return;
 		const [s, r] = U(n);
 		((e, t, n) => {
-			S && n && S.set(e + "," + t, n);
+			A && n && A.set(e + "," + t, n);
 		})(e - B, t, r), null !== s && (c ? H.pushAt(t, e - B, s) : H.pushAt(e - B, t, s));
 	};
 	if (c) {
-		const e = Math.max(z, $.columns.length);
-		for (let t = 0; t < e; t++) for (let e = 0; e < $.rows.length; e++) t < (e < B ? z : $.columns.length) && G(e, t);
+		const e = Math.max(j, $.columns.length);
+		for (let t = 0; t < e; t++) for (let e = 0; e < $.rows.length; e++) t < (e < B ? j : $.columns.length) && G(e, t);
 	} else for (let e = 0; e < $.rows.length; e++) {
-		const t = e < B ? z : $.columns.length;
+		const t = e < B ? j : $.columns.length;
 		for (let n = 0; n < t; n++) G(e, n);
 	}
-	if (O) {
-		const t = E(e);
+	if (M) {
+		const t = D(e);
 		return {
 			cells: H.build()?.tuples ?? [],
 			rows: 1,
 			columns: 1,
 			rowPageCount: t.rows,
 			columnPageCount: t.columns,
-			header: R,
+			header: O,
 			rowLines: [],
 			columnLines: [],
 			viewValues: [],
 			firstKey: null,
-			...S ? { roles: S } : {}
+			...A ? { roles: A } : {}
 		};
 	}
-	const q = (e, t) => {
+	const W = (e, t) => {
 		const n = [];
 		return e.forEach((e, s) => {
 			e.field !== ce && n.push(s < t.path.length ? t.path[s] : -1);
 		}), n;
-	}, K = (e, t) => Q(e.data ?? t.data ?? 0, [...q(r, e), ...q(o, t)]), [J] = i.rows, [W] = i.columns, Y = J && W && 3 !== J.kind && 3 !== W.kind ? K(J, W) : null, X = [], Z = (e) => 1 === e.kind && null !== e.function;
+	}, K = (e, t) => q(e.data ?? t.data ?? 0, [...W(r, e), ...W(o, t)]), [J] = i.rows, [Q] = i.columns, Y = J && Q && 3 !== J.kind && 3 !== Q.kind ? K(J, Q) : null, Z = [], X = (e) => 1 === e.kind && null !== e.function;
 	i.rows.forEach((t, n) => {
-		3 === t.kind || Z(t) || (q(r, t), i.columns.forEach((s, r) => {
-			const o = i.states[n * D + r];
-			if (3 === s.kind || Z(s) || 0 !== o && 1 !== o) return;
-			let l = 0 === o ? i.values[n * D + r] : 0;
-			e.showError && a.isError(l) && (l = e.errorCaption || 0), X.push([K(t, s), l]);
+		3 === t.kind || X(t) || (W(r, t), i.columns.forEach((s, r) => {
+			const o = i.states[n * _ + r];
+			if (3 === s.kind || X(s) || 0 !== o && 1 !== o) return;
+			let l = 0 === o ? i.values[n * _ + r] : 0;
+			e.showError && a.isError(l) && (l = e.errorCaption || 0), Z.push([K(t, s), l]);
 		}));
 	});
-	const ee = E(e);
+	const ee = D(e);
 	return {
 		cells: H.build()?.tuples ?? [],
 		rows: $.rows.length - B,
 		columns: $.columns.length,
 		rowPageCount: ee.rows,
 		columnPageCount: ee.columns,
-		header: R,
-		rowLines: N,
-		columnLines: L,
-		viewValues: X,
+		header: O,
+		rowLines: R,
+		columnLines: N,
+		viewValues: Z,
 		firstKey: Y,
-		...S ? { roles: S } : {}
+		...A ? { roles: A } : {}
 	};
-}, Oe = (e, t, n, r, o = !1, i, d) => {
-	const u = Ie(e, t, r, {
+}, Oe = (e, t, n, r, o = !1, i, l) => {
+	const d = Ie(e, t, r, {
 		filters: i,
-		slicerFields: d
+		slicerFields: l
 	});
-	if (!u) return null;
-	const c = u.rowPageCount > 0 ? u.rowPageCount + 1 : 0, f = u.rowPageCount > 0 ? 3 * u.columnPageCount - 1 : 0, { rowStart: p, colStart: h } = n;
-	if (p - c < 0) return null;
-	const v = {
-		rowStart: p - c,
-		colStart: h,
-		rowEnd: p + u.rows - 1,
-		colEnd: h + Math.max(u.columns, f) - 1
-	}, F = e.fields, b = t.fields, y = G(t), x = (e, t) => {
-		const n = F[e], o = n.numberFormat ?? b[e].numberFormat, i = l(o, r), d = m(b[e]), u = y[e], c = (n.items ?? []).filter((e) => void 0 !== e.item && void 0 === e.type), f = c.length > 0 ? c : u.map((e, t) => ({ item: t })), p = f.map((t) => {
-			const n = w(u[t.item]), c = I(b[e], t.item), f = null === n ? "(blank)" : "number" == typeof n ? s(r, c ? (m = t.item, void 0 === o ? l(g(b[e], m), r) : i) : i, n) : a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
-			var m;
-			const p = d && c ? f : n;
+	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 p = {
+		rowStart: f - u,
+		colStart: m,
+		rowEnd: f + d.rows - 1,
+		colEnd: m + Math.max(d.columns, c) - 1
+	}, h = e.fields, g = t.fields, w = R(t), v = (e, t) => {
+		const n = h[e], o = n.numberFormat ?? g[e].numberFormat, i = L(o, r), l = B(g[e]), d = w[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 = T(d[t.item]), u = C(g[e], t.item), c = null === n ? "(blank)" : "number" == typeof n ? s(r, u ? (f = t.item, void 0 === o ? L(x(g[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: p,
-				text: f,
+				value: m,
+				text: c,
 				name: t.name
 			} : {
-				value: p,
-				text: f
+				value: m,
+				text: c
 			};
-		}), h = {
-			name: n.name ?? b[e].name,
-			items: p
+		}), m = {
+			name: n.name ?? g[e].name,
+			items: f
 		};
 		if (t) {
 			const e = void 0 !== t.item ? (n.items ?? [])[t.item]?.item : void 0;
-			h.page = void 0 !== e ? f.findIndex((t) => t.item === e) : -1;
+			m.page = void 0 !== e ? c.findIndex((t) => t.item === e) : -1;
 		}
-		return h;
-	}, A = (e) => (e ?? []).filter((e) => -2 !== e);
+		return m;
+	}, F = (e) => (e ?? []).filter((e) => -2 !== e);
 	return {
 		view: {
-			range: v,
+			range: p,
 			dataFields: (e.dataFields ?? []).map((e) => ({
 				name: e.name,
-				sourceName: b[e.field].name
+				sourceName: g[e.field].name
 			})),
 			fields: [
-				...A(e.rowFields).map((e) => x(e)),
-				...A(e.columnFields).map((e) => x(e)),
-				...(e.pageFields ?? []).map((e) => x(e.field, e))
+				...F(e.rowFields).map((e) => v(e)),
+				...F(e.columnFields).map((e) => v(e)),
+				...(e.pageFields ?? []).map((e) => v(e.field, e))
 			],
-			values: u.viewValues,
+			values: d.viewValues,
 			block: {
 				anchor: {
-					row: p,
-					column: h
+					row: f,
+					column: m
 				},
 				...o ? { blocked: !0 } : {},
-				...null !== u.firstKey ? { first: u.firstKey } : {}
+				...null !== d.firstKey ? { first: d.firstKey } : {}
 			}
 		},
 		size: {
-			rows: u.rows,
-			columns: u.columns
+			rows: d.rows,
+			columns: d.columns
 		}
 	};
 }, Re = async (e, t, n, r) => {
-	const o = /* @__PURE__ */ new Map(), d = (e.filters ?? []).filter((t) => R(t) || e.rowFields?.includes(t.field) || e.columnFields?.includes(t.field)), u = e.fields?.some((e) => e.items?.some((e) => e.calculated)), f = e.dataFields?.some((e) => B(t.fields?.[e.field]));
-	if (0 === d.length && !u && !f) return { keep: o };
-	const m = G(t);
-	for (const s of d.filter(R)) {
-		const a = s.field, l = m[a];
-		if (!l) continue;
-		const d = i(s.condition) ? $e(e, t, l, a, n) : null, u = new Array(l.length);
-		for (let e = 0; e < l.length; e++) u[e] = d ? d[e] : w(l[e]);
-		const c = await Le(s.condition, u, n, r), f = o.get(a);
+	const o = /* @__PURE__ */ new Map(), i = (e.filters ?? []).filter((t) => j(t) || e.rowFields?.includes(t.field) || e.columnFields?.includes(t.field)), l = e.fields?.some((e) => e.items?.some((e) => e.calculated)), d = e.dataFields?.some((e) => $(t.fields?.[e.field]));
+	if (0 === i.length && !l && !d) return { keep: o };
+	const u = R(t);
+	for (const s of i.filter(j)) {
+		const a = s.field, i = u[a];
+		if (!i) continue;
+		const l = O(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] : T(i[e]);
+		const c = await $e(s.condition, d, n, r), f = o.get(a);
 		if (f) for (let e = 0; e < c.length; e++) f[e] &= c[e];
 		else o.set(a, c);
 	}
-	const p = u && r ? await (async (e, t, n, r, o) => {
-		const i = t.fields ?? [], d = e.fields ?? [], u = i.flatMap((e, t) => e.calculatedItems?.length ? [t] : []), c = e.dataFields ?? [];
-		if (1 !== u.length || c.some((e) => B(i[e.field]) || !ue.has(e.subtotal ?? "sum"))) return null;
-		const f = u[0], m = i[f].calculatedItems, p = te(t, n.isDate1904());
+	const c = l && r ? await (async (e, t, n, r, o) => {
+		const i = t.fields ?? [], l = e.fields ?? [], d = i.flatMap((e, t) => e.calculatedItems?.length ? [t] : []), u = e.dataFields ?? [];
+		if (1 !== d.length || u.some((e) => $(i[e.field]) || !ue.has(e.subtotal ?? "sum"))) return null;
+		const c = d[0], f = i[c].calculatedItems, p = te(t, n.isDate1904());
 		if (!p) return null;
-		const g = G(t), F = G({
+		const h = R(t), g = R({
 			...t,
 			fields: i.map(({ group: e, ...t }) => t)
-		}), b = (e.rowFields ?? []).filter((e) => e >= 0), y = (e.columnFields ?? []).filter((e) => e >= 0), x = b.includes(f) ? b : y.includes(f) ? y : null;
-		if (!x) return null;
-		const A = x.slice(0, x.indexOf(f)), C = [...x.slice(x.indexOf(f) + 1), ...x === b ? y : b], E = [...A, ...C], S = t.recordCount ?? 0, P = (e, t) => {
-			const n = d[e]?.items, s = n?.find((e) => e.item === t && void 0 === e.type);
+		}), w = (e.rowFields ?? []).filter((e) => e >= 0), v = (e.columnFields ?? []).filter((e) => e >= 0), F = w.includes(c) ? w : v.includes(c) ? v : null;
+		if (!F) return null;
+		const b = F.slice(0, F.indexOf(c)), y = [...F.slice(F.indexOf(c) + 1), ...F === w ? v : w], I = [...b, ...y], x = t.recordCount ?? 0, A = (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]);
-		}, k = (e, t) => {
-			const n = d[e.field]?.items;
+		}, E = (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;
-		}, M = e.pageFields ?? [], T = l(i[f].numberFormat ?? 14, n), O = (e) => g[f].findIndex((t, r) => {
-			const o = w(t);
-			return "number" == typeof o && (i[f].dates || I(i[f], r)) ? h(s(n, T, o), e) : h(null === o ? v : H(o), e);
-		}), R = /* @__PURE__ */ new Map(), N = new Map(m.map((e) => [e.item, e.formula])), L = (e) => {
-			let t = R.get(e);
-			return void 0 === t && R.set(e, t = R.size), t;
+		}, S = e.pageFields ?? [], k = L(i[c].numberFormat ?? 14, n), M = (e) => h[c].findIndex((t, r) => {
+			const o = T(t);
+			return "number" == typeof o && (i[c].dates || C(i[c], r)) ? m(s(n, k, o), e) : m(null === o ? P : G(o), e);
+		}), O = /* @__PURE__ */ new Map(), N = new Map(f.map((e) => [e.item, e.formula])), _ = (e) => {
+			let t = O.get(e);
+			return void 0 === t && O.set(e, t = O.size), t;
 		};
-		for (const e of m) if (null === oe(e.formula, (e, t) => {
-			if (null === t || !h(i[f].name, e)) return null;
-			const n = O(t);
-			return n < 0 ? null : (N.has(n) || L(n), "");
+		for (const e of f) if (null === oe(e.formula, (e, t) => {
+			if (null === t || !m(i[c].name, e)) return null;
+			const n = M(t);
+			return n < 0 ? null : (N.has(n) || _(n), "");
 		})) return null;
-		const $ = /* @__PURE__ */ new Map(), _ = /* @__PURE__ */ new Map(), D = c.map((e) => ({
+		const D = /* @__PURE__ */ new Map(), V = /* @__PURE__ */ new Map(), U = u.map((e) => ({
 			column: p[e.field],
-			values: F[e.field],
+			values: g[e.field],
 			fold: e.subtotal ?? "sum"
-		})), V = R.size;
-		for (let e = 0; e < S; e++) {
-			if (!M.every((t) => k(t, p[t.field][e]))) continue;
-			if (!E.every((t) => P(t, p[t][e]))) continue;
+		})), H = O.size;
+		for (let e = 0; e < x; e++) {
+			if (!S.every((t) => E(t, p[t.field][e]))) continue;
+			if (!I.every((t) => A(t, p[t][e]))) continue;
 			let t = "";
-			for (const n of A) t += p[n][e] + ",";
-			_.has(t) || _.set(t, e);
-			const n = R.get(p[f][e]);
+			for (const n of b) t += p[n][e] + ",";
+			V.has(t) || V.set(t, e);
+			const n = O.get(p[c][e]);
 			if (void 0 === n) continue;
 			let s = t;
-			for (const t of C) s += p[t][e] + ",";
-			let r = $.get(s);
+			for (const t of y) s += p[t][e] + ",";
+			let r = D.get(s);
 			r || (r = {
-				sums: c.map(() => new Array(V).fill(0)),
-				errors: c.map(() => new Array(V).fill(void 0))
-			}, $.set(s, r));
+				sums: u.map(() => new Array(H).fill(0)),
+				errors: u.map(() => new Array(H).fill(void 0))
+			}, D.set(s, r));
 			const { sums: o, errors: i } = r;
-			D.forEach(({ column: t, values: s, fold: r }, l) => {
-				const d = w(s[t[e]]);
+			U.forEach(({ column: t, values: s, fold: r }, l) => {
+				const d = T(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 U = C.map((e) => {
-			const t = d[e]?.items;
-			return t ? t.flatMap((t) => void 0 !== t.item && void 0 === t.type && !t.missing && P(e, t.item) ? [t.item] : []) : g[e].map((e, t) => t);
+		const B = y.map((e) => {
+			const t = l[e]?.items;
+			return t ? t.flatMap((t) => void 0 !== t.item && void 0 === t.type && !t.missing && A(e, t.item) ? [t.item] : []) : h[e].map((e, t) => t);
 		});
-		if (U.reduce((e, t) => e * t.length, _.size) > 5e5) return null;
-		const z = [];
-		for (const [e, t] of _) {
+		if (B.reduce((e, t) => e * t.length, V.size) > 5e5) return null;
+		const j = [];
+		for (const [e, t] of V) {
 			const n = (e, s, r) => {
-				if (e !== U.length) for (const t of U[e]) n(e + 1, [...s, t], r + t + ",");
-				else z.push({
+				if (e !== B.length) for (const t of B[e]) n(e + 1, [...s, t], r + t + ",");
+				else j.push({
 					exemplar: t,
 					path: s,
 					key: r
@@ -951,82 +951,82 @@ var X = [
 			};
 			n(0, [], e);
 		}
-		const j = z.length;
-		if (0 === j) return {
+		const z = j.length;
+		if (0 === z) return {
 			count: 0,
 			ids: i.map(() => []),
-			values: c.map(() => [])
+			values: u.map(() => [])
 		};
-		const q = c.length * V, Q = (e, t) => e * V + t, K = (e, t) => q + e * m.length + t, J = [];
-		for (let e = 0; e < c.length; e++) for (let t = 0; t < V; t++) J.push(z.map(({ key: n }) => {
-			const s = $.get(n);
+		const W = u.length * H, q = (e, t) => e * H + t, K = (e, t) => W + e * f.length + t, J = [];
+		for (let e = 0; e < u.length; e++) for (let t = 0; t < H; t++) J.push(j.map(({ key: n }) => {
+			const s = D.get(n);
 			return s ? s.errors[e][t] ?? s.sums[e][t] : 0;
 		}));
-		const W = [];
-		for (let e = 0; e < c.length; e++) for (let t = 0; t < m.length; t++) {
-			const n = oe(m[t].formula, (t, n) => {
+		const Q = [];
+		for (let e = 0; e < u.length; e++) for (let t = 0; t < f.length; t++) {
+			const n = oe(f[t].formula, (t, n) => {
 				if (null === n) return null;
-				const s = O(n), r = m.findIndex((e) => e.item === s);
-				return ae(r >= 0 ? K(e, r) : Q(e, R.get(s)));
+				const s = M(n), r = f.findIndex((e) => e.item === s);
+				return ae(r >= 0 ? K(e, r) : q(e, O.get(s)));
 			});
 			if (null === n) return null;
-			W.push({
+			Q.push({
 				expression: n,
-				coords: ie(K(e, t), j)
+				coords: ie(K(e, t), z)
 			});
 		}
 		const Y = await r.evaluateBatch({
-			values: le(J, j),
-			formulas: W
-		}), X = i.map(() => []), Z = c.map(() => []), ee = (e, t, n, s) => {
+			values: le(J, z),
+			formulas: Q
+		}), Z = i.map(() => []), X = u.map(() => []), ee = (e, t, n, s) => {
 			p.forEach((n, s) => {
-				const r = C.indexOf(s);
-				X[s].push(s === f ? t : r >= 0 ? e.path[r] : n[e.exemplar] ?? 0);
-			}), Z.forEach((e, t) => {
+				const r = y.indexOf(s);
+				Z[s].push(s === c ? t : r >= 0 ? e.path[r] : n[e.exemplar] ?? 0);
+			}), X.forEach((e, t) => {
 				e.push(t === n ? s : null);
 			});
 		};
-		return z.forEach((e, t) => {
-			m.forEach(({ item: n }, s) => {
-				c.forEach((r, o) => {
-					const a = Y[o * m.length + s].getValueAt(t, 0) ?? 0;
+		return j.forEach((e, t) => {
+			f.forEach(({ item: n }, s) => {
+				u.forEach((r, o) => {
+					const a = Y[o * f.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
+			count: Z[0]?.length ?? 0,
+			ids: Z,
+			values: X
 		};
-	})(e, t, n, r, o) : void 0, g = d.filter((e) => !R(e)).map((e, t) => ({
+	})(e, t, n, r, o) : void 0, f = i.filter((e) => !j(e)).map((e, t) => ({
 		filter: e,
 		index: t
-	})).sort((e, t) => (e.filter.evalOrder ?? -1) - (t.filter.evalOrder ?? -1) || e.index - t.index), F = (t.recordCount ?? 0) + (p?.count ?? 0);
-	let b;
-	const y = e.rowFields ?? [];
-	for (const { filter: s } of g) {
-		const a = await Ae(e, t, n, s.field, s.dataField, o, b, p, r);
+	})).sort((e, t) => (e.filter.evalOrder ?? -1) - (t.filter.evalOrder ?? -1) || e.index - t.index), p = (t.recordCount ?? 0) + (c?.count ?? 0);
+	let h;
+	const g = e.rowFields ?? [];
+	for (const { filter: s } of f) {
+		const a = await Ae(e, t, n, s.field, s.dataField, o, h, c, r);
 		if (!a) continue;
 		const i = /* @__PURE__ */ new Set();
 		for (const [e, t] of a.groups) {
-			const o = await Le(s.condition, t.totals, n, r);
+			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;
-		b ??= new Uint8Array(F).fill(3);
-		const l = a.outer.map((e) => a.records[e]), d = a.records[s.field], u = y.includes(s.field) ? 1 : 2;
-		for (let e = 0; e < F; e++) {
-			if (!(b[e] & u)) continue;
+		h ??= new Uint8Array(p).fill(3);
+		const l = a.outer.map((e) => a.records[e]), d = a.records[s.field], u = g.includes(s.field) ? 1 : 2;
+		for (let e = 0; e < p; e++) {
+			if (!(h[e] & u)) continue;
 			let t = "";
 			for (let n = 0; n < l.length; n++) t += (n > 0 ? "," : "") + l[n][e];
-			i.has(`${t}|${d[e]}`) && (b[e] &= ~u);
+			i.has(`${t}|${d[e]}`) && (h[e] &= ~u);
 		}
 	}
-	const x = f && r ? await (async (e, t, n, s, r, o, a) => {
-		const i = c.peek(), l = de(e, t);
+	const w = d && r ? await (async (e, t, n, s, r, o, a) => {
+		const i = V.peek(), l = de(e, t);
 		if (!i || !l) return null;
 		const d = xe(e, t, n, a, l.operands);
 		if (!d) return null;
@@ -1035,19 +1035,19 @@ var X = [
 			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, b, p) : void 0;
+	})(e, t, n, r, o, h, c) : void 0;
 	return {
 		keep: o,
-		...b ? { records: b } : {},
-		...p ? { calculatedRecords: p } : {},
-		...x ? { fieldValues: x } : {}
+		...h ? { records: h } : {},
+		...c ? { calculatedRecords: c } : {},
+		...w ? { fieldValues: w } : {}
 	};
 }, 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);
+		const n = e.condition && _(e.condition, t);
 		return n === e.condition ? e : (s = !0, {
 			...e,
 			condition: n
@@ -1057,13 +1057,13 @@ var X = [
 		...e,
 		filters: r
 	} : e;
-}, Le = async (e, t, n, s) => {
+}, $e = async (e, t, n, s) => {
 	const r = t.length, o = new Uint8Array(r);
 	if (0 === r) return o;
-	const a = new x();
+	const a = new c();
 	for (let e = 0; e < r; e++) null !== t[e] && a.setValueAt(e, 0, t[e]);
 	let i = !1;
-	return await T({
+	return await M({
 		conditions: [e],
 		runtime: n,
 		calculation: s ?? null,
@@ -1085,20 +1085,20 @@ var X = [
 			for (let n = 0; n < r; n++) null === t[n] && e(n, 0) && (o[n] = 1);
 		}
 	}), i || o.fill(1), o;
-}, $e = (e, t, n, r, o) => {
-	const i = e.fields?.[r], d = /* @__PURE__ */ new Map();
-	for (const e of i?.items ?? []) void 0 !== e.item && void 0 === e.type && void 0 !== e.name && d.set(e.item, e.name);
-	const u = i?.numberFormat ?? t.fields?.[r]?.numberFormat, c = l(u, o), f = (e) => void 0 === u ? l(g(t.fields?.[r], e), o) : c, m = new Array(n.length);
+}, 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 d = i?.numberFormat ?? t.fields?.[r]?.numberFormat, u = L(d, o), c = (e) => void 0 === d ? L(x(t.fields?.[r], e), o) : u, f = new Array(n.length);
 	for (let e = 0; e < n.length; e++) {
-		const i = d.get(e);
+		const i = l.get(e);
 		if (void 0 !== i) {
-			m[e] = i;
+			f[e] = i;
 			continue;
 		}
-		const l = w(n[e]);
-		null === l ? m[e] = v : "number" == typeof l ? m[e] = s(o, I(t.fields?.[r], e) ? f(e) : c, l) : "boolean" == typeof l ? m[e] = l ? "TRUE" : "FALSE" : a.isError(l) ? m[e] = l.getLabel() : m[e] = String(l);
+		const d = T(n[e]);
+		null === d ? f[e] = P : "number" == typeof d ? f[e] = s(o, C(t.fields?.[r], e) ? c(e) : u, d) : "boolean" == typeof d ? f[e] = d ? "TRUE" : "FALSE" : a.isError(d) ? f[e] = d.getLabel() : f[e] = String(d);
 	}
-	return m;
+	return f;
 }, _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,
@@ -1107,7 +1107,7 @@ var X = [
 		colEnd: t.colEnd
 	}).getValues()[0] ?? [], a = [];
 	for (let e = 0; e < n; e++) {
-		const n = o[e] ?? null, i = new W(), l = new Uint32Array(s);
+		const n = o[e] ?? null, i = new Q(), l = new Uint32Array(s);
 		let d, u, c = !1, f = i.values;
 		if (s > 0) {
 			const n = r.getRange({
@@ -1184,8 +1184,8 @@ var X = [
 } : a.isError(e) ? {
 	t: "e",
 	v: e.getCode()
-} : e, ze = (e, t) => (t && "number" == typeof e ? "date:" : "") + S(w(e)), Ge = (e, t, n, s = !1) => {
-	const r = e.fields ?? [], o = p(e.items, r.length), a = /\smissingItemsLimit="0"/.test(e.rest ?? ""), i = ((e) => {
+} : e, je = (e, t) => (t && "number" == typeof e ? "date:" : "") + w(T(e)), ze = (e, t, n, s = !1) => {
+	const r = e.fields ?? [], o = S(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;
@@ -1198,8 +1198,8 @@ var X = [
 		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)), f = [], h = [], g = [], v = [], F = [], b = [], y = [], x = (e, t, n) => {
-		v[t] = n.items, b[t] = n.items.length, y[t] = !0, c[e] = ((e, t) => {
+	const d = t.recordCount, u = r.map(() => -1), c = r.map((e, t) => o[t].map(() => -1)), f = [], m = [], p = [], h = [], g = [], w = [], v = [], F = (e, t, n) => {
+		h[t] = n.items, w[t] = n.items.length, v[t] = !0, c[e] = ((e, t) => {
 			const n = /* @__PURE__ */ new Map();
 			return t.forEach((e, t) => {
 				n.set(e, t);
@@ -1209,67 +1209,67 @@ var X = [
 	t.columns.forEach((e, t) => {
 		const n = l.get(i[t].toLocaleLowerCase());
 		void 0 !== n && (l.delete(i[t].toLocaleLowerCase()), u[n] = t);
-		const p = new Int32Array(e.values.length).fill(-1), A = [], C = [], E = new Array(d);
+		const b = new Int32Array(e.values.length).fill(-1), y = [], I = [], x = new Array(d);
 		for (let t = 0; t < d; t++) {
 			const n = e.ids[t];
-			let s = p[n];
-			s < 0 && (s = p[n] = A.length, A.push(Be(e.values[n])), C.push(e.dates || !!e.dateIds?.has(n))), E[t] = s;
+			let s = b[n];
+			s < 0 && (s = b[n] = y.length, y.push(Be(e.values[n])), I.push(e.dates || !!e.dateIds?.has(n))), x[t] = s;
 		}
-		const S = (e) => void 0 !== n && (!!r[n].dates || I(r[n], e)), P = A.length, k = void 0 !== n ? !0 === r[n].inline : A.every((e) => "number" == typeof e || "object" == typeof e && "z" === e?.t), M = [];
-		if (void 0 !== n && k) {
+		const A = (e) => void 0 !== n && (!!r[n].dates || C(r[n], e)), E = y.length, S = void 0 !== n ? !0 === r[n].inline : y.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 < P; t++) e.set(ze(A[t], C[t]), t);
+			for (let t = 0; t < E; t++) e.set(je(y[t], I[t]), t);
 			o[n].forEach((t, s) => {
-				c[n][s] = e.get(ze(t, S(s))) ?? -1;
+				c[n][s] = e.get(je(t, A(s))) ?? -1;
 			});
 		} else if (void 0 !== n) {
 			const e = /* @__PURE__ */ new Map();
-			for (let t = 0; t < P; t++) e.set(ze(A[t], C[t]), t);
+			for (let t = 0; t < E; t++) e.set(je(y[t], I[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, S(r));
+				const o = je(s, A(r));
 				let i = e.get(o);
-				void 0 !== i || a || S(r) || (i = A.length, A.push(s), C.push(S(r)), M.push(i), e.set(o, i)), c[n][r] = i ?? -1;
+				void 0 !== i || a || A(r) || (i = y.length, y.push(s), I.push(A(r)), P.push(i), e.set(o, i)), c[n][r] = i ?? -1;
 			});
 		}
-		const T = { name: i[t] };
-		k && (T.inline = !0), void 0 !== e.numberFormat && (T.numberFormat = e.numberFormat);
-		const O = [];
-		let R = !1;
-		A.forEach((e, t) => {
-			"number" == typeof e && (C[t] ? O.push(t) : R = !0);
-		}), O.length > 0 && !R ? T.dates = !0 : O.length > 0 && (T.dateItems = O), F[t] = T.dateItems ? new Set(T.dateItems) : void 0, M.length > 0 && (T.unused = M);
-		const N = void 0 !== n ? r[n].rest : void 0;
-		N && (T.rest = N);
-		const L = void 0 !== n ? r[n].calculatedItems : void 0;
-		L?.length && (T.calculatedItems = L.map(({ item: e, formula: t }) => {
-			const s = A.length;
-			return A.push(o[n][e]), c[n][e] = s, {
+		const k = { name: i[t] };
+		S && (k.inline = !0), void 0 !== e.numberFormat && (k.numberFormat = e.numberFormat);
+		const M = [];
+		let O = !1;
+		y.forEach((e, t) => {
+			"number" == typeof e && (I[t] ? M.push(t) : O = !0);
+		}), M.length > 0 && !O ? k.dates = !0 : M.length > 0 && (k.dateItems = M), g[t] = k.dateItems ? new Set(k.dateItems) : void 0, P.length > 0 && (k.unused = P);
+		const R = void 0 !== n ? r[n].rest : void 0;
+		R && (k.rest = R);
+		const N = void 0 !== n ? r[n].calculatedItems : void 0;
+		N?.length && (k.calculatedItems = N.map(({ item: e, formula: t }) => {
+			const s = y.length;
+			return y.push(o[n][e]), c[n][e] = s, {
 				item: s,
 				formula: t
 			};
-		})), f.push(T), h.push([t, [[0, A]]]), g.push([t, [[0, E]]]), v.push(A), b.push(P), y.push(!1);
+		})), f.push(k), m.push([t, [[0, y]]]), p.push([t, [[0, x]]]), h.push(y), w.push(E), v.push(!1);
 		const $ = void 0 !== n ? r[n].group : void 0;
 		if ($?.range && $.base === n) {
-			const e = re($, A.slice(0, P).map(w), s);
-			e ? (T.group = {
+			const e = re($, y.slice(0, E).map(T), s);
+			e ? (k.group = {
 				...e,
 				base: t
-			}, x(n, t, e)) : c[n] = o[n].map(() => -1);
-		} else $ && !m(r[n]) && (T.group = $);
+			}, F(n, t, e)) : c[n] = o[n].map(() => -1);
+		} else $ && !B(r[n]) && (k.group = $);
 	}), r.forEach((e, t) => {
 		if (!e.noRecords) return;
-		if (B(e)) return u[t] = f.length, f.push(e), v.push([]), b.push(0), void y.push(!1);
+		if ($(e)) return u[t] = f.length, f.push(e), h.push([]), w.push(0), void v.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];
+		const o = h[r];
 		let a, i = [];
-		if (n.range) a = re(n, o.slice(0, b[r]).map(w), s);
+		if (n.range) a = re(n, o.slice(0, w[r]).map(T), s);
 		else {
-			const e = je(n, c[n.base], o, f[r]);
+			const e = Ge(n, c[n.base], o, f[r]);
 			a = e.group, i = e.itemMap;
 		}
 		if (!a) return;
@@ -1280,7 +1280,7 @@ var X = [
 				...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 ? x(t, l, a) : c[t] = i;
+		}), h.push(a.items), g[l] = a.dateItems ? new Set(a.dateItems) : void 0, w.push(a.items.length), v.push(!1), n.range ? F(t, l, a) : c[t] = i;
 	}), f.forEach((e, t) => {
 		const n = e.group;
 		if (void 0 === n?.parent) return;
@@ -1288,37 +1288,37 @@ var X = [
 		void 0 !== s && s >= 0 ? e.group = {
 			...n,
 			parent: s
-		} : m(e) ? e.group = o : delete e.group, e.group && !m(e) && (e.group = {
+		} : B(e) ? e.group = o : delete e.group, e.group && !B(e) && (e.group = {
 			...e.group,
 			base: t
 		});
 	});
-	const { cacheId: A, part: C, partFormats: E, fields: S, items: P, records: k, ...M } = e;
+	const { cacheId: b, part: y, partFormats: I, fields: x, items: A, records: E, ...P } = e;
 	return {
 		model: {
-			...M,
+			...P,
 			source: n ?? e.source,
 			fields: f,
-			items: h,
-			records: g,
+			items: m,
+			records: p,
 			recordCount: d
 		},
 		remap: {
 			fields: u,
 			items: c,
-			newItems: v,
-			usedCounts: b,
-			inItemOrder: y,
-			dateItems: F
+			newItems: h,
+			usedCounts: w,
+			inItemOrder: v,
+			dateItems: g
 		}
 	};
-}, je = (e, t, n, s) => {
+}, 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 || I(s, t)) && i.push(a.length), a.push(n[t]), a.length - 1)), { dateItems: c, ...f } = 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 || C(s, t)) && i.push(a.length), a.push(n[t]), a.length - 1)), { dateItems: c, ...f } = e;
 	return {
 		group: {
 			...f,
@@ -1328,10 +1328,10 @@ var X = [
 		},
 		itemMap: d
 	};
-}, qe = (e, t, n = !1, s = !1) => {
+}, We = (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;
-}, Qe = (e, t) => {
+}, qe = (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);
@@ -1413,7 +1413,7 @@ var X = [
 		return [t];
 	});
 	Ke(f, "filters", p.length > 0 ? p : void 0);
-	const h = (e) => Xe(e, r, o, d, i), g = (e.formats ?? []).flatMap((e) => {
+	const h = (e) => Ze(e, r, o, d, i), g = (e.formats ?? []).flatMap((e) => {
 		const t = h(e.area);
 		return t ? [{
 			...e,
@@ -1437,7 +1437,7 @@ var X = [
 }, Je = (e, t, n, s, r = !1, o) => {
 	const a = e.items ?? [], i = [], l = [], d = /* @__PURE__ */ new Set();
 	for (const e of a) {
-		if (!k(e)) {
+		if (!f(e)) {
 			l.push(i.length), i.push(e);
 			continue;
 		}
@@ -1459,7 +1459,7 @@ var X = [
 		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) => !k(e.item)), o = [...[...s.filter((e) => k(e.item)), ...u.map((e) => ({
+		})), r = s.filter((e) => !f(e.item)), o = [...[...s.filter((e) => f(e.item)), ...u.map((e) => ({
 			item: n ? {
 				item: e,
 				hidden: !0
@@ -1475,36 +1475,36 @@ var X = [
 		items: i,
 		positions: l
 	};
-	const c = !e.includeNewItemsInFilter && a.some((e) => e.hidden), f = (e) => c ? {
+	const c = !e.includeNewItemsInFilter && a.some((e) => e.hidden), m = (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(N(e, n), w(n[t]), void 0 === e.name && o?.has(e.item), o?.has(t));
+		const t = "descending" === e.sort.order, s = (e, t) => We(b(e, n), T(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) => k(n) && (t ? s(n, e) < 0 : s(n, e) > 0));
-			r < 0 && (r = We(i)), i.splice(r, 0, n);
+			const n = m(e);
+			let r = i.findIndex((n) => f(n) && (t ? s(n, e) < 0 : s(n, e) > 0));
+			r < 0 && (r = Qe(i)), i.splice(r, 0, n);
 			for (let e = 0; e < l.length; e++) l[e] >= r && l[e]++;
 		}
 	} else {
-		const e = We(i);
-		i.splice(e, 0, ...u.map(f));
+		const e = Qe(i);
+		i.splice(e, 0, ...u.map(m));
 		for (let t = 0; t < l.length; t++) l[t] >= e && (l[t] += u.length);
 	}
 	return {
 		items: i,
 		positions: l
 	};
-}, We = (e) => {
-	const t = e.findIndex((e) => !k(e));
+}, Qe = (e) => {
+	const t = e.findIndex((e) => !f(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 (k(r) && !r.missing) return s;
+		if (f(r) && !r.missing) return s;
 	}
-}, Xe = (e, t, n, s, r) => {
+}, Ze = (e, t, n, s, r) => {
 	const o = { ...e };
 	if (void 0 !== e.field) {
 		if (!n(e.field)) return null;
@@ -1531,7 +1531,7 @@ var X = [
 		o.references = a;
 	}
 	return o;
-}, Ze = (e, t, n) => {
+}, Xe = (e, t, n) => {
 	const s = e.fields ?? [], r = s[t]?.items ?? [], o = new Array(r.length);
 	n.forEach((e, t) => {
 		o[e] = t;
@@ -1568,7 +1568,7 @@ var X = [
 		...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;
+	const i = s.map((e, n) => n === t ? o : null), l = (e.dataFields ?? []).map((e, t) => t), d = (e) => Ze(e, (e) => e, () => !0, i, l) ?? e;
 	return e.formats && (a.formats = e.formats.map((e) => ({
 		...e,
 		area: d(e.area)
@@ -1577,50 +1577,50 @@ var X = [
 		areas: e.areas.map(d)
 	}))), a;
 }, et = (e, t, n, s) => {
-	const r = (e.fields ?? [])[n]?.items ?? [], o = G(t)[n] ?? [], a = t.fields?.[n], i = void 0 !== a?.group?.range, l = (e) => void 0 === e.name && I(a, e.item), d = r.map((e, t) => ({
+	const r = (e.fields ?? [])[n]?.items ?? [], o = R(t)[n] ?? [], a = t.fields?.[n], i = void 0 !== a?.group?.range, l = (e) => void 0 === e.name && C(a, e.item), d = r.map((e, t) => ({
 		item: e,
 		at: t
-	})), u = d.filter((e) => k(e.item));
-	u.sort((e, t) => i ? e.item.item - t.item.item : qe(N(e.item, o), N(t.item, o), l(e.item), l(t.item))), "descending" === s && u.reverse();
+	})), u = d.filter((e) => f(e.item));
+	u.sort((e, t) => i ? e.item.item - t.item.item : We(b(e.item, o), b(t.item, o), l(e.item), l(t.item))), "descending" === s && u.reverse();
 	let c = 0;
-	const f = Ze(e, n, d.map((e) => k(e.item) ? u[c++] : e).map((e) => e.at));
+	const m = Xe(e, n, d.map((e) => f(e.item) ? u[c++] : e).map((e) => e.at));
 	return {
-		...f,
-		fields: f.fields.map((e, t) => t === n ? {
+		...m,
+		fields: m.fields.map((e, t) => t === n ? {
 			...e,
 			sort: { order: s }
 		} : e)
 	};
 }, tt = (n, s, r) => {
 	const o = n.fields?.[s]?.items?.[r];
-	if (!o || !k(o)) throw new t(e("error.pivotTable.changePart"));
+	if (!o || !f(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, d = G(s)[r] ?? [], u = (e) => {
-		const t = w(d[e.item]);
-		return null === t ? v : H(t);
+	const i = tt(n, r, o), l = n.fields[r].items, d = R(s)[r] ?? [], u = (e) => {
+		const t = T(d[e.item]);
+		return null === t ? P : G(t);
 	};
-	if (l.some((e, t) => t !== o && k(e) && h(e.name ?? u(e), a))) throw new t(e("error.pivotTable.itemNameExists", { name: a }));
-	const { name: c, ...f } = i, m = a === u(i) ? f : {
+	if (l.some((e, t) => t !== o && f(e) && m(e.name ?? u(e), a))) throw new t(e("error.pivotTable.itemNameExists", { name: a }));
+	const { name: c, ...p } = i, h = a === u(i) ? p : {
 		...i,
 		name: a
 	};
-	if (m.name === i.name) return n;
-	const p = {
+	if (h.name === i.name) return n;
+	const g = {
 		...n,
 		fields: n.fields.map((e, t) => t === r ? {
 			...e,
-			items: l.map((e, t) => t === o ? m : e)
+			items: l.map((e, t) => t === o ? h : e)
 		} : e)
-	}, g = n.fields[r].sort;
-	return g && void 0 === g.dataField ? et(p, s, r, g.order) : p;
+	}, w = n.fields[r].sort;
+	return w && void 0 === w.dataField ? et(g, s, r, w.order) : g;
 }, 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);
+	const a = Xe(e, t, r);
 	return o ? {
 		...a,
 		fields: a.fields.map((e, n) => {
@@ -1630,11 +1630,11 @@ var X = [
 		})
 	} : a;
 }, rt = (n, s, r, o) => {
-	const a = H(o), i = n.fields, l = s.fields, u = n.dataFields ?? [], c = G(s), f = (e, t) => {
+	const a = G(o), i = n.fields, l = s.fields, d = n.dataFields ?? [], u = R(s), c = (e, t) => {
 		if (void 0 !== t.name) return t.name;
-		const n = w(c[e][t.item]);
-		return null === n ? v : H(n);
-	}, m = (r) => {
+		const n = T(u[e][t.item]);
+		return null === n ? P : G(n);
+	}, p = (r) => {
 		if (void 0 !== r.field && a === (i[r.field].name ?? l[r.field].name)) return;
 		const o = void 0 === r.field ? n : {
 			...n,
@@ -1643,18 +1643,18 @@ var X = [
 				name: "\0"
 			} : e)
 		};
-		if (d(o, s, a, r.data) !== a) throw new t(e("error.pivotTable.fieldNameExists"));
+		if (U(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 && k(n) && h(f(e, n), a));
+			const o = i[e].items.findIndex((n, s) => s !== t && f(n) && m(c(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) => ({
+			return p({ field: e }), ((e, t) => ({
 				...n,
 				fields: i.map((n, s) => s === e ? t(n) : n)
 			}))(e, (t) => {
@@ -1667,9 +1667,9 @@ var X = [
 		}
 		case "dataCaption": {
 			const { data: e } = r;
-			return m({ data: e }), {
+			return p({ data: e }), {
 				...n,
-				dataFields: u.map((t, n) => n === e ? {
+				dataFields: d.map((t, n) => n === e ? {
 					...t,
 					name: a
 				} : t)
@@ -1690,18 +1690,18 @@ var X = [
 		case "pageItem": {
 			const s = n.pageFields, o = s[r.page];
 			let l;
-			if (!h(a, "(All)") && (l = (i[o.field].items ?? []).findIndex((e) => k(e) && h(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 : {
+			if (!m(a, "(All)") && (l = (i[o.field].items ?? []).findIndex((e) => f(e) && m(c(o.field, e), a)), l < 0)) throw new t(e("error.pivotTable.notAnItem", { name: a }));
+			const { item: d, ...u } = o, p = void 0 === l ? u : {
 				...o,
 				item: l
 			};
 			return {
 				...n,
-				pageFields: s.map((e, t) => t === r.page ? c : e)
+				pageFields: s.map((e, t) => t === r.page ? p : e)
 			};
 		}
 	}
-}, ot = (e, t, n) => Ge({
+}, ot = (e, t, n) => ze({
 	cacheId: 0,
 	fields: []
 }, e, t, n).model, at = (e, t) => t.some((t) => e.fields?.[t]?.inline) ? {
@@ -1716,8 +1716,8 @@ var X = [
 	...e.columnFields ?? [],
 	...(e.pageFields ?? []).map((e) => e.field)
 ].filter((e) => e >= 0), lt = (e, t) => {
-	const n = e.fields[t], s = G(e)[t], r = s.map((e, t) => t);
-	m(n) || r.sort((e, t) => qe(w(s[e]), w(s[t]), I(n, e), I(n, t)));
+	const n = e.fields[t], s = R(e)[t], r = s.map((e, t) => t);
+	B(n) || r.sort((e, t) => We(T(s[e]), T(s[t]), C(n, e), C(n, t)));
 	const o = new Set(n.calculatedItems?.map((e) => e.item)), a = new Set(n.unused);
 	return [...r.map((e) => ({
 		item: e,
@@ -1727,13 +1727,13 @@ var X = [
 }, 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" === O(e, t) ? "sum" : "count")(s.fields[r], G(s)[r]), i = z[a];
-	if (!i) throw new t(e("error.pivotTable.notAFunction", { name: a }));
-	let l = o?.name;
-	if (void 0 === l) l = d(n, s, `${i} of ${u(n, s, r)}`);
-	else if (d(n, s, l) !== l) throw new t(e("error.pivotTable.fieldNameExists"));
+	const a = o?.function ?? ((e, t) => "number" === d(e, t) ? "sum" : "count")(s.fields[r], R(s)[r]), l = E[a];
+	if (!l) throw new t(e("error.pivotTable.notAFunction", { name: a }));
+	let u = o?.name;
+	if (void 0 === u) u = U(n, s, `${l} of ${i(n, s, r)}`);
+	else if (U(n, s, u) !== u) throw new t(e("error.pivotTable.fieldNameExists"));
 	const c = {
-		name: l,
+		name: u,
 		field: r,
 		baseField: 0,
 		baseItem: 0
@@ -1741,7 +1741,7 @@ var X = [
 	return "sum" !== a && (c.subtotal = a), void 0 !== o?.numberFormat && (dt(o.numberFormat), c.numberFormat = o.numberFormat), c;
 }, ct = (n, s) => {
 	const r = n.fields ?? [], o = (n) => {
-		const s = r.findIndex((e) => h(e.name, n));
+		const s = r.findIndex((e) => m(e.name, n));
 		if (s < 0) throw new t(e("error.pivotTable.notAField", { name: n }));
 		return s;
 	}, a = /* @__PURE__ */ new Map(), i = (e, t) => {
@@ -1759,9 +1759,9 @@ var X = [
 	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 = {
+	}), p = l("column");
+	d.length > 1 && p.push(-2);
+	const h = {
 		fields: f,
 		style: {
 			name: s?.style ?? "PivotStyleLight16",
@@ -1772,13 +1772,13 @@ var X = [
 			showLastColumn: !0
 		}
 	}, g = l("row");
-	g.length > 0 && (p.rowFields = g), m.length > 0 && (p.columnFields = m);
+	g.length > 0 && (h.rowFields = g), p.length > 0 && (h.columnFields = p);
 	const w = l("page");
-	return w.length > 0 && (p.pageFields = w.map((e) => ({ field: e }))), d.length > 0 && (p.dataFields = d), c && (p.form = c), p;
+	return w.length > 0 && (h.pageFields = w.map((e) => ({ field: e }))), d.length > 0 && (h.dataFields = d), c && (h.form = c), h;
 }, ft = (e, t) => t.map((t) => {
 	const n = t.sort?.scope;
 	if (!n) return t;
-	const s = ((t.axis === U.Axis.Row ? e.columnFields : t.axis === U.Axis.Column ? e.rowFields : void 0) ?? []).filter((e) => -2 !== e);
+	const s = ((t.axis === N.Axis.Row ? e.columnFields : t.axis === N.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;
@@ -1795,37 +1795,37 @@ var X = [
 		}
 	};
 }), mt = (n, s, r, o, a) => {
-	const i = U.Axis, l = s.fields?.[r], d = n.fields?.[r]?.axis ?? null;
+	const i = N.Axis, l = s.fields?.[r], d = n.fields?.[r]?.axis ?? null;
 	if (o === i.Values) throw new t(e("error.pivotTable.valuesNotAnAxis"));
 	if (null === o) {
 		if (null === d) return n;
 	} else if (void 0 !== l?.formula || o === i.Page && (l?.calculatedItems?.length ?? 0) > 0) throw new t(e("error.pivotTable.fieldNotPlaceable"));
-	const u = o ? $(n, o).filter((e) => e !== r) : [];
-	if (void 0 !== a && (!Number.isInteger(a) || a < 1 || a > u.length + 1)) throw new t(e("error.pivotTable.fieldPosition"));
-	const c = (a ?? u.length + 1) - 1;
-	if (o === d && (void 0 === a || $(n, o)[c] === r)) return n;
-	u.splice(c, 0, r);
-	const { rowFields: f, columnFields: m, pageFields: p, ...h } = n, g = {}, w = (e) => (e ?? []).filter((e) => e !== r), v = o === i.Row ? u : w(n.rowFields), F = o === i.Column ? u : w(n.columnFields), b = o === i.Page ? u.map((e) => n.pageFields?.find((t) => t.field === e) ?? { field: e }) : (n.pageFields ?? []).filter((e) => e.field !== r);
-	v.length > 0 && (g.rowFields = v), F.length > 0 && (g.columnFields = F), b.length > 0 && (g.pageFields = b);
-	let I = {
-		...h,
-		...g
+	const c = o ? v(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 === d && (void 0 === a || v(n, o)[f] === r)) return n;
+	c.splice(f, 0, r);
+	const { rowFields: m, columnFields: p, pageFields: h, ...g } = n, w = {}, F = (e) => (e ?? []).filter((e) => e !== r), b = o === i.Row ? c : F(n.rowFields), y = o === i.Column ? c : F(n.columnFields), x = o === i.Page ? c.map((e) => n.pageFields?.find((t) => t.field === e) ?? { field: e }) : (n.pageFields ?? []).filter((e) => e.field !== r);
+	b.length > 0 && (w.rowFields = b), y.length > 0 && (w.columnFields = y), x.length > 0 && (w.pageFields = x);
+	let A = {
+		...g,
+		...w
 	};
-	o === i.Page && d !== i.Page && (I = y(I, r, () => !0));
-	const x = { ...n.fields?.[r] };
-	o ? x.axis = o : delete x.axis, o && !x.items && l && (x.items = M(lt(s, r), x.subtotals)), o && void 0 === x.numberFormat && l?.dates && void 0 !== l.numberFormat && (x.numberFormat = l.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)
+	o === i.Page && d !== i.Page && (A = u(A, r, () => !0));
+	const C = { ...n.fields?.[r] };
+	o ? C.axis = o : delete C.axis, o && !C.items && l && (C.items = I(lt(s, r), C.subtotals)), o && void 0 === C.numberFormat && l?.dates && void 0 !== l.numberFormat && (C.numberFormat = l.numberFormat), o === i.Page && C.items?.some((e) => e.hidden) && (C.multipleItemSelection = !0);
+	const E = (n.fields ?? []).map((e, t) => t === r ? C : e);
+	if (A = {
+		...A,
+		fields: ft(A, E)
 	}, 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 ? {
+		const e = n.formats.filter((e) => !e.area.references?.some((e) => e.field === r)), { formats: t, ...s } = A;
+		A = e.length > 0 ? {
 			...s,
 			formats: e
 		} : s;
 	}
-	return I;
+	return A;
 }, pt = -2, ht = /* @__PURE__ */ new Set([
 	"percentOfTotal",
 	"percentOfRow",
@@ -1902,7 +1902,7 @@ var X = [
 		}];
 	});
 	c.length > 0 && (u.filters = c);
-	const f = (e) => Xe(e, (e) => e, () => !0, [], n), m = (e.formats ?? []).flatMap((e) => {
+	const f = (e) => Ze(e, (e) => e, () => !0, [], n), m = (e.formats ?? []).flatMap((e) => {
 		const t = f(e.area);
 		return t ? [{
 			...e,
@@ -1954,7 +1954,7 @@ var X = [
 		i[e] = t;
 	}), It(n, a.map((e) => o[e]), i);
 }, Et = (e, t, n, s) => {
-	const r = P(e, t, n, s);
+	const r = A(e, t, n, s);
 	return (e.dataFields[n].subtotal ?? "sum") === s ? e : bt(e, n, (e) => {
 		const { subtotal: t, ...n } = e, o = {
 			...n,
@@ -1963,40 +1963,40 @@ var X = [
 		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";
+	const a = n.dataFields[r], l = a.showDataAs ?? "normal", d = o?.kind ?? "normal";
 	if (o && !wt.has(o.kind)) throw new t(e("error.pivotTable.notAShowAs", { name: o.kind }));
-	const { showDataAs: d, baseField: c, baseItem: f, ...m } = a, p = { ...m };
-	"normal" !== l && (p.showDataAs = l);
-	let g = a.baseField, w = a.baseItem;
+	const { showDataAs: u, baseField: c, baseItem: f, ...p } = a, g = { ...p };
+	"normal" !== d && (g.showDataAs = d);
+	let w = a.baseField, v = a.baseItem;
 	if (void 0 !== o?.baseField) {
-		const r = o.baseField, a = (s.fields ?? []).findIndex((e, t) => h(u(n, s, t), r));
+		const r = o.baseField, a = (s.fields ?? []).findIndex((e, t) => m(i(n, s, t), r));
 		if (a < 0) throw new t(e("error.pivotTable.notAField", { name: r }));
-		a !== g && (g = a, w = 0);
+		a !== w && (w = a, v = 0);
 	}
 	if (void 0 !== o?.baseItem) {
-		const r = g ?? 0;
-		if (h(o.baseItem, "(previous)")) w = "previous";
-		else if (h(o.baseItem, "(next)")) w = "next";
+		const r = w ?? 0;
+		if (m(o.baseItem, "(previous)")) v = "previous";
+		else if (m(o.baseItem, "(next)")) v = "next";
 		else {
 			const a = n.fields?.[r]?.items ? n : { fields: (n.fields ?? []).map((e, t) => t === r ? {
 				...e,
 				items: lt(s, r)
-			} : e) }, i = L(a, s, r).findIndex((e) => null !== e && h(e, o.baseItem));
+			} : e) }, i = W(a, s, r).findIndex((e) => null !== e && m(e, o.baseItem));
 			if (i < 0) throw new t(e("error.pivotTable.notAnItem", { name: o.baseItem }));
-			w = i;
+			v = i;
 		}
 	}
-	if (void 0 !== g && (p.baseField = g), void 0 !== w && (p.baseItem = w), l === i) return p.baseField === a.baseField && p.baseItem === a.baseItem ? n : bt(n, r, () => p);
-	const v = ((e, t, n) => {
+	if (void 0 !== w && (g.baseField = w), void 0 !== v && (g.baseItem = v), d === l) return g.baseField === a.baseField && g.baseItem === a.baseItem ? n : bt(n, r, () => g);
+	const F = ((e, t, n) => {
 		if (gt.has(n)) return gt.has(t) ? e : void 0;
-		const s = ((e) => b(e).replace(/"[^"]*"|\\./g, "").includes("%"))(e);
+		const s = ((e) => h(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 v === a.numberFormat ? bt(n, r, () => p) : bt(Ft(n, r), r, () => yt(p, v));
+	})(a.numberFormat, l, d);
+	return F === a.numberFormat ? bt(n, r, () => g) : bt(Ft(n, r), r, () => yt(g, F));
 }, Pt = (e, t, n) => {
 	dt(n);
-	const s = b(n), r = e.dataFields[t], o = e.formats?.[e.formats.length - 1];
-	if (b(r.numberFormat) === s && o && vt(o.area, t) && o.style.numberFormat === s) return e;
+	const s = h(n), r = e.dataFields[t], o = e.formats?.[e.formats.length - 1];
+	if (h(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,
@@ -2013,16 +2013,16 @@ var X = [
 	};
 }, kt = (n, s, r) => {
 	if (null === s) return At(n);
-	const o = U.Axis;
+	const o = N.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 = $(n, s).filter((e) => e !== pt);
+	const i = v(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 || $(n, s)[l] === pt)) return n;
+	if (s === a && (void 0 === r || v(n, s)[l] === pt)) return n;
 	i.splice(l, 0, pt);
-	const { rowFields: d, columnFields: u, valuesOnRows: c, ...f } = n, m = $(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;
+	const { rowFields: d, columnFields: u, valuesOnRows: c, ...f } = n, m = v(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;
@@ -2030,10 +2030,10 @@ var X = [
 		...a,
 		valuesCaption: "\0"
 	};
-	if (d(i, s, r) !== r) throw new t(e("error.pivotTable.fieldNameExists"));
+	if (U(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, Oe as buildPivotView, Re as evaluatePivotFilters, R 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, Ge as refreshPivotCache, Qe 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 };
+export { xt as addPivotDataField, Ne as anchorPivotPeriods, dt as assertNumberFormat, it as axisFieldsOf, Oe as buildPivotView, Re as evaluatePivotFilters, j 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, ze as refreshPivotCache, qe as remapPivotTable, At as removePivotDataField, nt as renamePivotItem, Mt as renamePivotValues, Xe as reorderPivotItems, Et as setPivotDataFunction, Pt as setPivotDataNumberFormat, St as setPivotDataShowAs, et as sortPivotItemsByLabel, rt as typeOverPivot, at as withListedFields };