@sheetxl/mcp 0.8.0-beta.21 → 0.8.0-beta.23

package/assets/{Q2j8yQZX1kL_MbbB.js → DZt1ONN8CTTfmHGn.js}

@@ -1,15 +1,15 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.21
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { p as e, tt as t } from "./DjbBTiei0H-BIJaN.js";
-import { d as n, en as s, f as r, vt as o } from "./CB9TsE5n0FEyFnAz.js";
-import { u as a } from "./D5mfuGSeGXSDHj9-.js";
-import { $a as l, Ba as i, Ga as d, Ja as u, Lr as c, Ma as f, Oa as m, Qr as p, Sr as h, Ta as g, Tn as w, Vn as v, aa as F, ao as b, b as y, bi as I, ci as x, dr as A, ft as C, gi as E, gn as S, gt as P, ka as k, kr as M, li as T, nn as O, pi as R, q as N, qi as $, qr as L, ti as _, ua as D, ui as V, un as U, w as H, wa as B, wi as q, yt as z, zi as G, zr as j } from "./Vo34QvIefEN595xl.js";
-import { a as K, i as Q, n as J, o as W, r as X } from "./B1l0k4ErELObdQKE.js";
-var Y = [
+import { p as e, tt as t } from "./DIAQ_WlBCWhgHt-z.js";
+import { d as n, en as s, f as r, vt as o } from "./BomatnedZsGMF7MW.js";
+import { u as a } from "./BI8kb-rd9dW85XJs.js";
+import { $r as i, Ba as l, Bi as d, Br as u, E as c, Hi as f, Kr as m, La as p, Lr as h, Na as g, Pa as v, Qi as w, Rt as F, Si as b, Ta as y, Tn as I, Ui as x, Xi as A, Xr as C, Zr as E, bi as S, ci as P, ei as k, jt as M, la as T, mn as R, na as O, no as N, or as L, pi as $, qi as _, qn as D, ri as V, rn as U, ut as H, v as B, va as j, vn as q, vr as z, xt as G } from "./Cl04_aSpBHTwfsQR.js";
+import { a as K, i as Q, n as J, o as W, r as X } from "./t4qTfgdlstczTs2z.js";
+var Z = [
 	"Jan",
 	"Feb",
 	"Mar",
@@ -22,7 +22,7 @@ var Y = [
 	"Oct",
 	"Nov",
 	"Dec"
-], Z = [
+], Y = [
 	31,
 	29,
 	31,
@@ -52,7 +52,7 @@ var Y = [
 		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 += Y[t];
 			return e;
 		}
 		case "hours": return a.hour + 1;
@@ -61,24 +61,24 @@ var Y = [
 		default: return null;
 	}
 }, te = (e, t) => {
-	const n = e.fields ?? [], s = g(e.records, n.length);
-	if (!n.some(f)) return s;
-	const r = g(e.items, n.length), o = e.recordCount ?? 0, a = s.slice();
+	const n = e.fields ?? [], s = v(e.records, n.length);
+	if (!n.some(i)) return s;
+	const r = v(e.items, n.length), o = e.recordCount ?? 0, a = s.slice();
 	for (let e = 0; e < n.length; e++) {
 		const l = n[e];
-		if (!f(l)) continue;
-		const i = l.group, d = s[i.base] ?? [], u = r[i.base] ?? [], c = new Int32Array(u.length);
-		for (let e = 0; e < u.length; e++) {
-			const n = i.range ? ee(i.range, i.items.length, C(u[e]), t) : i.discrete?.[e] ?? null;
-			c[e] = n ?? -1;
+		if (!i(l)) continue;
+		const d = l.group, u = s[d.base] ?? [], c = r[d.base] ?? [], f = new Int32Array(c.length);
+		for (let e = 0; e < c.length; e++) {
+			const n = d.range ? ee(d.range, d.items.length, m(c[e]), t) : d.discrete?.[e] ?? null;
+			f[e] = n ?? -1;
 		}
-		const m = new Array(o);
+		const p = new Array(o);
 		for (let e = 0; e < o; e++) {
-			const t = c[d[e]];
+			const t = f[u[e]];
 			if (void 0 === t || t < 0) return null;
-			m[e] = t;
+			p[e] = t;
 		}
-		a[e] = m;
+		a[e] = p;
 	}
 	return a;
 }, ne = (e) => String(Number(e.toPrecision(12))), se = (e, t) => {
@@ -92,17 +92,17 @@ var Y = [
 		e < o && (o = e), e > a && (a = e);
 	}
 	if (0 === t.length) return e;
-	const l = { ...s };
-	s.fixedStart || (l.start = o), s.fixedEnd || (l.end = "numbers" !== s.by && Number.isInteger(a) ? a + 1 : a);
-	const { inner: i, endText: d } = ((e, t) => {
-		const { start: n, end: s } = e, o = e.interval ?? 1, a = se(s, t), l = (e, t) => Array.from({ length: e }, (e, n) => t(n));
+	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: l(e, (a) => {
-						const l = n + a * o, i = a === e - 1 && t ? s : r ? l + o - 1 : l + o;
-						return `${ne(l)}-${ne(i)}`;
+					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)
 				};
@@ -110,22 +110,22 @@ var Y = [
 			case "days":
 				if (1 === o) {
 					const e = [];
-					return Z.forEach((t, n) => {
-						for (let s = 1; s <= t; s++) e.push(`${s}-${Y[n]}`);
+					return Y.forEach((t, n) => {
+						for (let s = 1; s <= t; s++) e.push(`${s}-${Z[n]}`);
 					}), {
 						inner: e,
 						endText: a
 					};
 				}
 				return {
-					inner: l(Math.max(1, Math.ceil((s - n) / o)), (e) => {
+					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: Y.slice(),
+				inner: Z.slice(),
 				endText: a
 			};
 			case "quarters": return {
@@ -140,26 +140,26 @@ var Y = [
 			case "years": {
 				const e = r(n, t)?.year ?? 0;
 				return {
-					inner: l((r(s, t)?.year ?? e) - e + 1, (t) => String(e + t)),
+					inner: i((r(s, t)?.year ?? e) - e + 1, (t) => String(e + t)),
 					endText: a
 				};
 			}
 			case "hours": return {
-				inner: l(24, (e) => `${e % 12 == 0 ? 12 : e % 12} ${e < 12 ? "AM" : "PM"}`),
+				inner: i(24, (e) => `${e % 12 == 0 ? 12 : e % 12} ${e < 12 ? "AM" : "PM"}`),
 				endText: a
 			};
 			default: return {
-				inner: l(60, (e) => `:${String(e).padStart(2, "0")}`),
+				inner: i(60, (e) => `:${String(e).padStart(2, "0")}`),
 				endText: a
 			};
 		}
-	})(l, n), u = "numbers" === l.by ? ne(l.start) : se(l.start, n);
+	})(i, n), u = "numbers" === i.by ? ne(i.start) : se(i.start, n);
 	return {
 		...e,
-		range: l,
+		range: i,
 		items: [
 			`<${u}`,
-			...i,
+			...l,
 			`>${d}`
 		]
 	};
@@ -191,68 +191,68 @@ var Y = [
 			n += t, s += t.length;
 			continue;
 		}
-		const a = "'" === o, l = a ? null : /^[\p{L}_][\p{L}\p{N}_.]*/u.exec(e.slice(s))?.[0];
-		if (!a && !l) {
+		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 i = a ? r() : l;
-		if (a || (s += i.length), "(" !== e[s]) {
+		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(i, o);
+				const a = t(l, o);
 				if (null === a) return null;
 				n += a;
 				continue;
 			}
-			n += t(i, null) ?? (a ? `'${i.replace(/'/g, "''")}'` : i);
-		} else n += i;
+			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`;
-}, le = (e, t) => ({
+}, ie = (e, t) => ({
 	rowStart: 0,
 	colStart: e,
 	rowEnd: t - 1,
 	colEnd: e
-}), ie = (e, t) => {
+}), 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(), l = (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 i = [];
+		const l = [];
 		oe(n[e].formula, (e) => {
-			const t = n.findIndex((t) => h(t.name, e));
-			return t >= 0 && i.push(t), t >= 0 ? "" : null;
+			const t = n.findIndex((t) => T(t.name, e));
+			return t >= 0 && l.push(t), t >= 0 ? "" : null;
 		});
-		for (const r of i) if (M(n[r])) {
-			if (!l(r, [...t, e])) return !1;
+		for (const r of l) if (j(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;
-	}, i = [];
-	for (const [t, s] of (e.dataFields ?? []).entries()) if (M(n[s.field])) {
-		if (!l(s.field, [])) return null;
-		i.push({
+	}, l = [];
+	for (const [t, s] of (e.dataFields ?? []).entries()) if (j(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) => h(t.name, e));
-		return r >= 0 ? ae(M(n[a = r]) ? s.length + o.get(a) : s.indexOf(a)) : null;
+		const r = n.findIndex((t) => T(t.name, e));
+		return r >= 0 ? ae(j(n[a = r]) ? s.length + o.get(a) : s.indexOf(a)) : null;
 		var a;
 	};
 	for (const e of r) {
@@ -263,7 +263,7 @@ var Y = [
 	return {
 		operands: s,
 		formulas: r,
-		measures: i
+		measures: l
 	};
 }, ue = /* @__PURE__ */ new Set([
 	"sum",
@@ -305,7 +305,7 @@ var Y = [
 	stdDevP: 10,
 	var: 7,
 	varP: 8
-}, we = {
+}, ve = {
 	sum: "Sum",
 	countA: "Count",
 	avg: "Average",
@@ -317,11 +317,11 @@ var Y = [
 	stdDevP: "StdDevp",
 	var: "Var",
 	varP: "Varp"
-}, ve = (e) => {
+}, we = (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])));
+	const n = new Set(t.flatMap((t) => t.field === ce ? [] : we(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);
@@ -343,41 +343,41 @@ var Y = [
 	percent: 13,
 	percentDiff: 14
 }, Ie = (e, t, n, s) => {
-	const r = P.peek(), o = e.fields, a = t.fields;
+	const r = R.peek(), o = e.fields, a = t.fields;
 	if (!r || !o || !a || o.length !== a.length) return null;
-	if (A(e)) return {
+	if (H(e)) return {
 		cells: [],
-		...U,
+		...I,
 		rowPageCount: 0,
 		columnPageCount: 0,
-		header: m(e),
+		header: C(e),
 		rowLines: [],
 		columnLines: [],
 		viewValues: [],
 		firstKey: null,
 		...s?.roles ? { roles: /* @__PURE__ */ new Map() } : {}
 	};
-	const i = j(e, a), d = i ? s?.filters : null;
-	if (i && !d) return null;
+	const l = S(e, a), d = l ? s?.filters : null;
+	if (l && !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 p = xe(e, t, n, d?.calculatedRecords, c.operands);
-	if (!p) return null;
-	const { items: h, records: g, values: w, n: v } = p, F = (e) => !!e && (!e.noRecords || f(e)), b = e.form ?? "compact", y = (e) => {
+	const f = xe(e, t, n, d?.calculatedRecords, c.operands);
+	if (!f) return null;
+	const { items: m, records: p, values: h, n: g } = f, v = (e) => !!e && (!e.noRecords || i(e)), w = e.form ?? "compact", F = (e) => {
 		const t = [];
 		for (const n of e ?? []) {
 			if (n === ce) {
 				t.push({
 					field: n,
-					form: b
+					form: w
 				});
 				continue;
 			}
 			const e = o[n], s = e?.subtotals;
-			if (!e || !F(a[n])) return null;
+			if (!e || !v(a[n])) return null;
 			if (u && s && s.some((e) => "default" !== e)) return null;
 			t.push({
 				field: n,
@@ -385,29 +385,29 @@ var Y = [
 			});
 		}
 		return t;
-	}, I = y(e.rowFields), x = y(e.columnFields), C = e.pageFields ?? [];
-	if (!I || !x || C.some((e) => !F(a[e.field]))) return null;
-	const E = l(e, s?.slicerFields);
-	return E.pageFields?.some((e) => !F(a[e.field])) ? null : Te(e, t, h, I, x, Se(r, E, h, g, w, I, x, v, d?.keep, d?.records, c.operands.length, d?.fieldValues, !0), n, !0 === s?.roles, "columns" === s?.cellOrder);
+	}, b = F(e.rowFields), y = F(e.columnFields), x = e.pageFields ?? [];
+	if (!b || !y || x.some((e) => !v(a[e.field]))) return null;
+	const A = U(e, s?.slicerFields);
+	return A.pageFields?.some((e) => !v(a[e.field])) ? null : Te(e, t, m, b, y, Se(r, A, m, p, h, b, y, g, 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 = V(t);
+	const o = t.fields?.length ?? 0, a = x(t);
 	if (!t.records) return null;
 	const l = te(t, n.isDate1904());
 	if (!l) return null;
-	const i = !0 === t.fields?.some(f), d = i ? g(t.items, o) : a, u = i ? g(t.records, o) : l, c = t.recordCount ?? 0, m = s?.count ?? 0, p = c + m, h = (e, n) => {
-		const s = !t.fields?.[e]?.noRecords, r = s ? u[e] : l[e] ?? [], o = s ? d[e] : a[e], i = new Array(p);
-		for (let e = 0; e < c; e++) i[e] = C(o[r[e]]);
-		for (let e = 0; e < m; e++) i[c + e] = n?.[e] ?? null;
+	const d = !0 === t.fields?.some(i), u = d ? v(t.items, o) : a, c = d ? v(t.records, o) : l, f = t.recordCount ?? 0, p = s?.count ?? 0, h = f + p, g = (e, n) => {
+		const s = !t.fields?.[e]?.noRecords, r = s ? c[e] : l[e] ?? [], o = s ? u[e] : a[e], i = new Array(h);
+		for (let e = 0; e < f; e++) i[e] = m(o[r[e]]);
+		for (let e = 0; e < p; e++) i[f + e] = n?.[e] ?? null;
 		return i;
-	}, w = [...(e.dataFields ?? []).map((e, t) => h(e.field, s?.values[t])), ...r.map((e) => h(e))];
+	}, w = [...(e.dataFields ?? []).map((e, t) => g(e.field, s?.values[t])), ...r.map((e) => g(e))];
 	return {
 		items: a,
 		records: s ? l.map((e, t) => e.concat(s.ids[t] ?? [])) : l,
 		values: w,
-		n: p
+		n: h
 	};
-}, Ae = async (e, t, n, s, r, o, a, l, i) => {
-	const d = P.peek(), u = e.dataFields?.[r];
+}, Ae = async (e, t, n, s, r, o, a, i, l) => {
+	const d = R.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;
@@ -421,42 +421,42 @@ var Y = [
 				return n;
 			})
 		};
-	}), { columnGrandTotals: g, ...w } = e, { showDataAs: v, ...F } = u, b = {
-		...w,
+	}), { columnGrandTotals: g, ...v } = e, { showDataAs: w, ...F } = u, b = {
+		...v,
 		fields: h,
 		rowFields: [...p, s],
 		columnFields: [],
 		dataFields: [F],
 		rowGrandTotals: !1
-	}, y = l ? {
-		...l,
-		values: [l.values[r] ?? []]
-	} : l, I = de(b, t);
-	if (!I || I.measures.length > 0 && !i) return null;
+	}, y = i ? {
+		...i,
+		values: [i.values[r] ?? []]
+	} : 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, k = b.rowFields.map((e) => ({
+	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 === f ? 1 : 2;
-		M = new Uint8Array(S);
+		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 = I.measures.length > 0 ? await Ee(d, I, b, A, C, E, k, [], S, o, M, i) : void 0, O = Se(d, b, A, C, E, k, [], S, o, M, I.operands.length, T), R = (t, n) => e.fields[t].items?.[n]?.item ?? n, N = /* @__PURE__ */ new Map(), $ = O.columns.length;
-	return O.rows.forEach((e, t) => {
+	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, N = /* @__PURE__ */ new Map(), L = 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) => R(t, e.path[n])).join(",");
+		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(R(s, e.path[p.length])), r.totals.push(O.values[t * $]);
+		}), r.ids.push(O(s, e.path[p.length])), r.totals.push(T.values[t * L]);
 	}), {
 		outer: p,
 		groups: N,
@@ -473,8 +473,8 @@ var Y = [
 		ranks: s,
 		flags: r
 	};
-}, Ee = async (e, t, n, s, r, o, l, i, d, u, c, f) => {
-	const { request: m, errors: p } = Pe(e, n, s, r, o, l, i, d, u, c, t.operands.length);
+}, 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 {
@@ -504,49 +504,49 @@ var Y = [
 			for (let s = 0; s < n; s++) t[s] = e[s] ?? 0;
 			return t[n] = 0, t;
 		}), a = await s.evaluateBatch({
-			values: ie(o, r),
+			values: le(o, r),
 			formulas: e.formulas.map(({ expression: e }, n) => ({
 				expression: e,
-				coords: le(t.length + n, r)
+				coords: ie(t.length + n, r)
 			}))
-		}), l = /* @__PURE__ */ new Map();
+		}), 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;
-			l.set(t, e);
+			i.set(t, e);
 		}
-		return l;
+		return i;
 	})(t, g, h, f);
-}, Se = (e, t, n, s, r, o, l, i, d, u, c = 0, f, m = !1) => {
-	const { request: p, errors: h } = Pe(e, t, n, s, r, o, l, i, d, u, c, f, m), g = h.codeOf(a.BuiltIn.NA), w = h.codeOf(a.BuiltIn.Null), v = p.lay_out(0, g, w);
+}, 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), v = h.codeOf(a.BuiltIn.Null), w = p.lay_out(0, g, v);
 	try {
-		const n = ke(v.row_lines(), v.row_stride()), s = ke(v.column_lines(), v.column_stride()), r = v.states(), a = v.values();
+		const n = ke(w.row_lines(), w.row_stride()), s = ke(w.column_lines(), w.column_stride()), r = w.states(), a = w.values();
 		try {
-			const i = 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] ? i(e) : null;
+			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, ...l]) : []
+				functions: m ? Fe(t, [...o, ...i]) : []
 			};
 		} finally {
 			a.free();
 		}
 	} finally {
-		v.free(), p.free();
+		w.free(), p.free();
 	}
-}, Pe = (e, t, n, s, r, o, a, l, i, d, u = 0, c, f = !1) => {
-	const m = t.fields, p = new e.LayoutRequest(l), h = f ? Fe(t, [...o, ...a]) : [], g = [], w = (e, s) => {
+}, 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 = [], v = (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], l = a.subtotals, i = (!l || l.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, i), u = a.sort;
+			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) : [];
+			const c = f ? we(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);
@@ -558,8 +558,8 @@ var Y = [
 			});
 		}
 	};
-	w(0, o), w(1, a);
-	const v = (t.pageFields ?? []).map((e) => ({
+	v(0, o), v(1, a);
+	const w = (t.pageFields ?? []).map((e) => ({
 		page: e,
 		index: p.add_page(n[e.field].length)
 	})), F = r.map(() => p.add_values(127)), b = t.dataFields ?? [];
@@ -569,8 +569,8 @@ var Y = [
 		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 l = "previous" === e.baseItem ? 4294967294 : "next" === e.baseItem ? 4294967295 : e.baseItem ?? 0;
-		p.set_show_as(t, n, s, Math.max(r, 0), l);
+		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);
@@ -582,17 +582,17 @@ var Y = [
 	}));
 	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, l).set(d.subarray(0, l));
+	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), l).set(s[r].slice(0, l));
-		const { ranks: a, flags: d } = Ce(m[r], o, i?.get(r));
+		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) {
+	for (const { page: e, index: t } of w) {
 		const r = n[e.field].length;
-		new Uint32Array(x, p.page_ids(t), l).set(s[e.field].slice(0, l));
-		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 ? i?.get(e.field) : void 0;
+		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;
@@ -601,14 +601,14 @@ var Y = [
 	const A = new J();
 	F.forEach((e, t) => {
 		const n = {
-			doubles: new Float64Array(x, e, l),
-			ints: new Int32Array(x, e, 2 * l),
-			types: new Uint8Array(x, e + 8 * l, l)
+			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 < l; e++) X(n, e, o[e], A, s);
+		for (let e = 0; e < i; e++) X(n, e, o[e], A, s);
 	});
 	for (const { column: e, ptr: t } of y) {
 		const n = e.length, s = {
@@ -649,93 +649,93 @@ var Y = [
 		} 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, l, d, u, c) => {
-	const f = e.fields, p = t.fields, h = e.dataFields ?? [], g = (t) => t === ce ? e.valuesCaption ?? "Values" : f[t].name ?? p[t].name, w = (e, t) => {
-		if (e === ce) return h[t]?.name ?? "";
-		const s = f[e].items?.[t];
+}, Te = (e, t, n, r, o, i, l, f, p) => {
+	const v = e.fields, w = t.fields, F = e.dataFields ?? [], y = (t) => t === ce ? e.valuesCaption ?? "Values" : v[t].name ?? w[t].name, I = (e, t) => {
+		if (e === ce) return F[t]?.name ?? "";
+		const s = v[e].items?.[t];
 		if (void 0 !== s?.name) return s.name;
-		const r = C(n[e][s?.item ?? t]);
-		return null === r ? F : r;
-	}, v = (e, t) => {
-		const n = w(e, t);
+		const r = m(n[e][s?.item ?? t]);
+		return null === r ? L : r;
+	}, x = (e, t) => {
+		const n = I(e, t);
 		if ("number" == typeof n) {
-			const o = f[e].items?.[t]?.item ?? t, a = void 0 === (f[e].numberFormat ?? p[e].numberFormat) && E(p[e], o);
-			return s(d, a ? R(H(p[e], o), d) : R(f[r = e].numberFormat ?? p[r].numberFormat, d), n);
+			const o = v[e].items?.[t]?.item ?? t, a = void 0 === (v[e].numberFormat ?? w[e].numberFormat) && u(w[e], o);
+			return s(l, a ? h(P(w[e], o), l) : h(v[r = e].numberFormat ?? w[r].numberFormat, l), n);
 		}
 		var r;
 		return a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
-	}, b = (e) => {
-		if (void 0 !== e.item) return w(e.field, e.item);
-		const t = f[e.field].items ?? [];
+	}, E = (e) => {
+		if (void 0 !== e.item) return I(e.field, e.item);
+		const t = v[e.field].items ?? [];
 		if (!t.some((e) => e.hidden)) return "(All)";
-		const n = t.flatMap((e, t) => y(e) && !e.hidden ? [t] : []);
-		return 1 === n.length ? w(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) => c(e) && !e.hidden ? [t] : []);
+		return 1 === n.length ? I(e.field, n[0]) : "(Multiple Items)";
+	}, S = e.grandTotalCaption ?? "Grand Total", k = f ? /* @__PURE__ */ new Map() : null, M = (e, t) => e === ce ? {
 		kind: "dataCaption",
 		data: t
 	} : {
 		kind: "item",
 		field: e,
 		rank: t
-	}, k = (e) => e === ce ? null : {
+	}, T = (e) => e === ce ? null : {
 		kind: "fieldCaption",
 		field: e
-	}, M = (e, t) => 2 === e.kind && t === A ? { kind: "grandTotal" } : null, T = 0 === r.length && 0 === o.length && 0 === h.length, O = T ? {
+	}, R = (e, t) => 2 === e.kind && t === S ? { kind: "grandTotal" } : null, O = 0 === r.length && 0 === o.length && 0 === F.length, N = O ? {
 		firstHeaderRow: 0,
 		firstDataRow: 0,
 		firstDataCol: 0
-	} : m(e), N = T ? [] : Me(l.rows, l.functions), $ = T ? [] : Me(l.columns, l.functions), L = I({
+	} : C(e), $ = O ? [] : Me(i.rows, i.functions), _ = O ? [] : Me(i.columns, i.functions), D = A({
 		...e,
-		header: O,
-		rowLines: N,
-		columnLines: $
-	}), _ = l.columns.length, D = (e) => "row" === e ? r : o, V = (t) => {
+		header: N,
+		rowLines: $,
+		columnLines: _
+	}), V = i.columns.length, U = (e) => "row" === e ? r : o, H = (t) => {
 		switch (t.kind) {
 			case "pageCaption": {
 				const n = e.pageFields[t.page].field;
-				return [g(n), {
+				return [y(n), {
 					kind: "fieldCaption",
 					field: n
 				}];
 			}
 			case "pageItem": {
 				const n = e.pageFields[t.page];
-				return [b(n), {
+				return [E(n), {
 					kind: "pageItem",
 					page: t.page
 				}];
 			}
-			case "dataCaption": return [h[t.data]?.name ?? null, {
+			case "dataCaption": return [F[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 = D(t.axis)[t.level].field;
-				return [g(e), k(e)];
+				const e = U(t.axis)[t.level].field;
+				return [y(e), T(e)];
 			}
 			case "label": {
-				const e = D(t.axis)[t.level].field, n = t.line.path[t.level];
-				return [w(e, n), P(e, n)];
+				const e = U(t.axis)[t.level].field, n = t.line.path[t.level];
+				return [I(e, n), M(e, n)];
 			}
 			case "total": {
-				const e = ("row" === t.axis ? l.rows : l.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 = v(o, t.path[r]);
+				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 ? F[t.data]?.name ?? "" : "";
+					if (2 === t.kind) return n ? `Total ${s}` : S;
+					const r = t.path.length - 1, o = e[r].field, a = x(o, t.path[r]);
 					if (null !== t.function) {
-						const e = we[l.functions[t.function]];
-						return (n || t.across) && null !== t.data ? `${a} ${e} of ${g(h[t.data].field)}` : `${a} ${e}`;
+						const e = ve[i.functions[t.function]];
+						return (n || t.across) && null !== t.data ? `${a} ${e} of ${y(F[t.data].field)}` : `${a} ${e}`;
 					}
-					return f[o]?.subtotalCaption ?? (n ? `${a} ${s}` : `${a} Total`);
-				})(D(t.axis), e);
-				return [n, M(e, n)];
+					return v[o]?.subtotalCaption ?? (n ? `${a} ${s}` : `${a} Total`);
+				})(U(t.axis), e);
+				return [n, R(e, n)];
 			}
 			case "value": {
-				const n = t.row.index * _ + t.column.index, s = l.states[n];
+				const n = t.row.index * V + t.column.index, s = i.states[n];
 				let r = null;
-				return 0 === s ? (r = l.values[n], e.showError && a.isError(r) && (r = e.errorCaption ?? "")) : 1 === s && (r = !1 === e.showEmpty ? 0 : ((e) => {
+				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;
@@ -744,207 +744,207 @@ var Y = [
 				})(e.emptyCaption)), [r, null];
 			}
 		}
-	}, U = new B.Builder(), q = L.top, z = L.pages.reduce((e, t) => Math.max(e, t.column + 2), 0), G = (e, t) => {
-		const n = x(L, e, t);
+	}, B = new g.Builder(), j = D.top, q = D.pages.reduce((e, t) => Math.max(e, t.column + 2), 0), z = (e, t) => {
+		const n = d(D, e, t);
 		if (!n) return;
-		const [s, r] = V(n);
+		const [s, r] = H(n);
 		((e, t, n) => {
-			S && n && S.set(e + "," + t, n);
-		})(e - q, t, r), null !== s && (c ? U.pushAt(t, e - q, s) : U.pushAt(e - q, t, s));
+			k && n && k.set(e + "," + t, n);
+		})(e - j, t, r), null !== s && (p ? B.pushAt(t, e - j, s) : B.pushAt(e - j, t, s));
 	};
-	if (c) {
-		const e = Math.max(z, L.columns.length);
-		for (let t = 0; t < e; t++) for (let e = 0; e < L.rows.length; e++) t < (e < q ? z : L.columns.length) && G(e, t);
-	} else for (let e = 0; e < L.rows.length; e++) {
-		const t = e < q ? z : L.columns.length;
-		for (let n = 0; n < t; n++) G(e, n);
+	if (p) {
+		const e = Math.max(q, D.columns.length);
+		for (let t = 0; t < e; t++) for (let e = 0; e < D.rows.length; e++) t < (e < j ? q : D.columns.length) && z(e, t);
+	} else for (let e = 0; e < D.rows.length; e++) {
+		const t = e < j ? q : D.columns.length;
+		for (let n = 0; n < t; n++) z(e, n);
 	}
-	if (T) {
-		const t = i(e);
+	if (O) {
+		const t = b(e);
 		return {
-			cells: U.build()?.tuples ?? [],
+			cells: B.build()?.tuples ?? [],
 			rows: 1,
 			columns: 1,
 			rowPageCount: t.rows,
 			columnPageCount: t.columns,
-			header: O,
+			header: N,
 			rowLines: [],
 			columnLines: [],
 			viewValues: [],
 			firstKey: null,
-			...S ? { roles: S } : {}
+			...k ? { roles: k } : {}
 		};
 	}
-	const j = (e, t) => {
+	const G = (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, [...j(r, e), ...j(o, t)]), [J] = l.rows, [W] = l.columns, X = J && W && 3 !== J.kind && 3 !== W.kind ? Q(J, W) : null, Y = [], Z = (e) => 1 === e.kind && null !== e.function;
-	l.rows.forEach((t, n) => {
-		3 === t.kind || Z(t) || (j(r, t), l.columns.forEach((s, r) => {
-			const o = l.states[n * _ + r];
-			if (3 === s.kind || Z(s) || 0 !== o && 1 !== o) return;
-			let i = 0 === o ? l.values[n * _ + r] : 0;
-			e.showError && a.isError(i) && (i = e.errorCaption || 0), Y.push([Q(t, s), i]);
+	}, Q = (e, t) => K(e.data ?? t.data ?? 0, [...G(r, e), ...G(o, t)]), [J] = i.rows, [W] = i.columns, X = J && W && 3 !== J.kind && 3 !== W.kind ? Q(J, W) : null, Z = [], Y = (e) => 1 === e.kind && null !== e.function;
+	i.rows.forEach((t, n) => {
+		3 === t.kind || Y(t) || (G(r, t), i.columns.forEach((s, r) => {
+			const o = i.states[n * V + r];
+			if (3 === s.kind || Y(s) || 0 !== o && 1 !== o) return;
+			let l = 0 === o ? i.values[n * V + r] : 0;
+			e.showError && a.isError(l) && (l = e.errorCaption || 0), Z.push([Q(t, s), l]);
 		}));
 	});
-	const ee = i(e);
+	const ee = b(e);
 	return {
-		cells: U.build()?.tuples ?? [],
-		rows: L.rows.length - q,
-		columns: L.columns.length,
+		cells: B.build()?.tuples ?? [],
+		rows: D.rows.length - j,
+		columns: D.columns.length,
 		rowPageCount: ee.rows,
 		columnPageCount: ee.columns,
-		header: O,
-		rowLines: N,
-		columnLines: $,
-		viewValues: Y,
+		header: N,
+		rowLines: $,
+		columnLines: _,
+		viewValues: Z,
 		firstKey: X,
-		...S ? { roles: S } : {}
+		...k ? { roles: k } : {}
 	};
-}, Oe = (e, t, n, r, o = !1, l, i) => {
-	const d = Ie(e, t, r, {
+}, Re = (e, t, n, r, o = !1, l, d) => {
+	const c = Ie(e, t, r, {
 		filters: l,
-		slicerFields: i
+		slicerFields: d
 	});
-	if (!d) return null;
-	const u = d.rowPageCount > 0 ? d.rowPageCount + 1 : 0, c = d.rowPageCount > 0 ? 3 * d.columnPageCount - 1 : 0, { rowStart: m, colStart: p } = n;
-	if (m - u < 0) return null;
-	const h = {
-		rowStart: m - u,
-		colStart: p,
-		rowEnd: m + d.rows - 1,
-		colEnd: p + Math.max(d.columns, c) - 1
-	}, g = e.fields, w = t.fields, v = V(t), F = (e, t) => {
-		const n = g[e], o = n.numberFormat ?? w[e].numberFormat, l = R(o, r), i = f(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 })), m = c.map((t) => {
-			const n = C(d[t.item]), u = E(w[e], t.item), c = null === n ? "(blank)" : "number" == typeof n ? s(r, u ? (f = t.item, void 0 === o ? R(H(w[e], f), r) : l) : l, n) : a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
-			var f;
-			const m = i && u ? c : n;
+	if (!c) return null;
+	const f = c.rowPageCount > 0 ? c.rowPageCount + 1 : 0, p = c.rowPageCount > 0 ? 3 * c.columnPageCount - 1 : 0, { rowStart: g, colStart: v } = n;
+	if (g - f < 0) return null;
+	const w = {
+		rowStart: g - f,
+		colStart: v,
+		rowEnd: g + c.rows - 1,
+		colEnd: v + Math.max(c.columns, p) - 1
+	}, F = e.fields, b = t.fields, y = x(t), I = (e, t) => {
+		const n = F[e], o = n.numberFormat ?? b[e].numberFormat, l = h(o, r), d = i(b[e]), c = y[e], f = (n.items ?? []).filter((e) => void 0 !== e.item && void 0 === e.type), p = f.length > 0 ? f : c.map((e, t) => ({ item: t })), g = p.map((t) => {
+			const n = m(c[t.item]), i = u(b[e], t.item), f = null === n ? "(blank)" : "number" == typeof n ? s(r, i ? (p = t.item, void 0 === o ? h(P(b[e], p), r) : l) : l, n) : a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
+			var p;
+			const g = d && i ? f : n;
 			return void 0 !== t.name ? {
-				value: m,
-				text: c,
+				value: g,
+				text: f,
 				name: t.name
 			} : {
-				value: m,
-				text: c
+				value: g,
+				text: f
 			};
-		}), p = {
-			name: n.name ?? w[e].name,
-			items: m
+		}), v = {
+			name: n.name ?? b[e].name,
+			items: g
 		};
 		if (t) {
 			const e = void 0 !== t.item ? (n.items ?? [])[t.item]?.item : void 0;
-			p.page = void 0 !== e ? c.findIndex((t) => t.item === e) : -1;
+			v.page = void 0 !== e ? p.findIndex((t) => t.item === e) : -1;
 		}
-		return p;
-	}, b = (e) => (e ?? []).filter((e) => -2 !== e);
+		return v;
+	}, A = (e) => (e ?? []).filter((e) => -2 !== e);
 	return {
 		view: {
-			range: h,
+			range: w,
 			dataFields: (e.dataFields ?? []).map((e) => ({
 				name: e.name,
-				sourceName: w[e.field].name
+				sourceName: b[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))
+				...A(e.rowFields).map((e) => I(e)),
+				...A(e.columnFields).map((e) => I(e)),
+				...(e.pageFields ?? []).map((e) => I(e.field, e))
 			],
-			values: d.viewValues,
+			values: c.viewValues,
 			block: {
 				anchor: {
-					row: m,
-					column: p
+					row: g,
+					column: v
 				},
 				...o ? { blocked: !0 } : {},
-				...null !== d.firstKey ? { first: d.firstKey } : {}
+				...null !== c.firstKey ? { first: c.firstKey } : {}
 			}
 		},
 		size: {
-			rows: d.rows,
-			columns: d.columns
+			rows: c.rows,
+			columns: c.columns
 		}
 	};
-}, Re = async (e, t, n, r) => {
-	const o = /* @__PURE__ */ new Map(), l = (e.filters ?? []).filter((t) => $(t) || e.rowFields?.includes(t.field) || e.columnFields?.includes(t.field)), i = e.fields?.some((e) => e.items?.some((e) => e.calculated)), d = e.dataFields?.some((e) => M(t.fields?.[e.field]));
-	if (0 === l.length && !i && !d) return { keep: o };
-	const u = V(t);
-	for (const s of l.filter($)) {
-		const a = s.field, l = u[a];
-		if (!l) continue;
-		const i = k(s.condition) ? Le(e, t, l, a, n) : null, d = new Array(l.length);
-		for (let e = 0; e < l.length; e++) d[e] = i ? i[e] : C(l[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);
+}, Oe = async (e, t, n, r) => {
+	const o = /* @__PURE__ */ new Map(), i = (e.filters ?? []).filter((t) => B(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) => j(t.fields?.[e.field]));
+	if (0 === i.length && !l && !d) return { keep: o };
+	const c = x(t);
+	for (const s of i.filter(B)) {
+		const a = s.field, i = c[a];
+		if (!i) continue;
+		const l = E(s.condition) ? $e(e, t, i, a, n) : null, d = new Array(i.length);
+		for (let e = 0; e < i.length; e++) d[e] = l ? l[e] : m(i[e]);
+		const u = await Le(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 c = i && r ? await (async (e, t, n, r, o) => {
-		const l = t.fields ?? [], i = e.fields ?? [], d = l.flatMap((e, t) => e.calculatedItems?.length ? [t] : []), u = e.dataFields ?? [];
-		if (1 !== d.length || u.some((e) => M(l[e.field]) || !ue.has(e.subtotal ?? "sum"))) return null;
-		const c = d[0], f = l[c].calculatedItems, m = te(t, n.isDate1904());
-		if (!m) return null;
-		const p = V(t), g = V({
+	const f = 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] : []), c = e.dataFields ?? [];
+		if (1 !== d.length || c.some((e) => j(i[e.field]) || !ue.has(e.subtotal ?? "sum"))) return null;
+		const f = d[0], p = i[f].calculatedItems, g = te(t, n.isDate1904());
+		if (!g) return null;
+		const v = x(t), w = x({
 			...t,
-			fields: l.map(({ group: e, ...t }) => t)
-		}), w = (e.rowFields ?? []).filter((e) => e >= 0), v = (e.columnFields ?? []).filter((e) => e >= 0), b = w.includes(c) ? w : v.includes(c) ? v : null;
-		if (!b) return null;
-		const y = b.slice(0, b.indexOf(c)), I = [...b.slice(b.indexOf(c) + 1), ...b === w ? v : w], x = [...y, ...I], A = t.recordCount ?? 0, S = (e, t) => {
-			const n = i[e]?.items, s = n?.find((e) => e.item === t && void 0 === e.type);
+			fields: i.map(({ group: e, ...t }) => t)
+		}), F = (e.rowFields ?? []).filter((e) => e >= 0), b = (e.columnFields ?? []).filter((e) => e >= 0), y = F.includes(f) ? F : b.includes(f) ? b : null;
+		if (!y) return null;
+		const I = y.slice(0, y.indexOf(f)), A = [...y.slice(y.indexOf(f) + 1), ...y === F ? b : F], C = [...I, ...A], E = t.recordCount ?? 0, S = (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]);
 		}, P = (e, t) => {
-			const n = i[e.field]?.items;
+			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;
-		}, k = e.pageFields ?? [], T = R(l[c].numberFormat ?? 14, n), O = (e) => p[c].findIndex((t, r) => {
-			const o = C(t);
-			return "number" == typeof o && (l[c].dates || E(l[c], r)) ? h(s(n, T, o), e) : h(null === o ? F : D(o), e);
-		}), N = /* @__PURE__ */ new Map(), $ = new Map(f.map((e) => [e.item, e.formula])), L = (e) => {
-			let t = N.get(e);
-			return void 0 === t && N.set(e, t = N.size), t;
+		}, k = e.pageFields ?? [], M = h(i[f].numberFormat ?? 14, n), R = (e) => v[f].findIndex((t, r) => {
+			const o = m(t);
+			return "number" == typeof o && (i[f].dates || u(i[f], r)) ? T(s(n, M, o), e) : T(null === o ? L : $(o), e);
+		}), O = /* @__PURE__ */ new Map(), N = new Map(p.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 f) if (null === oe(e.formula, (e, t) => {
-			if (null === t || !h(l[c].name, e)) return null;
-			const n = O(t);
-			return n < 0 ? null : ($.has(n) || L(n), "");
+		for (const e of p) if (null === oe(e.formula, (e, t) => {
+			if (null === t || !T(i[f].name, e)) return null;
+			const n = R(t);
+			return n < 0 ? null : (N.has(n) || _(n), "");
 		})) return null;
-		const _ = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), H = u.map((e) => ({
-			column: m[e.field],
-			values: g[e.field],
+		const D = /* @__PURE__ */ new Map(), V = /* @__PURE__ */ new Map(), U = c.map((e) => ({
+			column: g[e.field],
+			values: w[e.field],
 			fold: e.subtotal ?? "sum"
-		})), B = N.size;
-		for (let e = 0; e < A; e++) {
-			if (!k.every((t) => P(t, m[t.field][e]))) continue;
-			if (!x.every((t) => S(t, m[t][e]))) continue;
+		})), H = O.size;
+		for (let e = 0; e < E; e++) {
+			if (!k.every((t) => P(t, g[t.field][e]))) continue;
+			if (!C.every((t) => S(t, g[t][e]))) continue;
 			let t = "";
-			for (const n of y) t += m[n][e] + ",";
-			U.has(t) || U.set(t, e);
-			const n = N.get(m[c][e]);
+			for (const n of I) t += g[n][e] + ",";
+			V.has(t) || V.set(t, e);
+			const n = O.get(g[f][e]);
 			if (void 0 === n) continue;
 			let s = t;
-			for (const t of I) s += m[t][e] + ",";
-			let r = _.get(s);
+			for (const t of A) s += g[t][e] + ",";
+			let r = D.get(s);
 			r || (r = {
-				sums: u.map(() => new Array(B).fill(0)),
-				errors: u.map(() => new Array(B).fill(void 0))
-			}, _.set(s, r));
-			const { sums: o, errors: l } = r;
-			H.forEach(({ column: t, values: s, fold: r }, i) => {
-				const d = C(s[t[e]]);
-				"sum" === r ? "number" == typeof d ? o[i][n] += d : a.isError(d) && (l[i][n] ??= d) : ("countNums" === r ? "number" == typeof d : null !== d) && (o[i][n] += 1);
+				sums: c.map(() => new Array(H).fill(0)),
+				errors: c.map(() => new Array(H).fill(void 0))
+			}, D.set(s, r));
+			const { sums: o, errors: i } = r;
+			U.forEach(({ column: t, values: s, fold: r }, l) => {
+				const d = m(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 q = I.map((e) => {
-			const t = i[e]?.items;
-			return t ? t.flatMap((t) => void 0 !== t.item && void 0 === t.type && !t.missing && S(e, t.item) ? [t.item] : []) : p[e].map((e, t) => t);
+		const B = A.map((e) => {
+			const t = l[e]?.items;
+			return t ? t.flatMap((t) => void 0 !== t.item && void 0 === t.type && !t.missing && S(e, t.item) ? [t.item] : []) : v[e].map((e, t) => t);
 		});
-		if (q.reduce((e, t) => e * t.length, U.size) > 5e5) return null;
-		const z = [];
-		for (const [e, t] of U) {
+		if (B.reduce((e, t) => e * t.length, V.size) > 5e5) return null;
+		const q = [];
+		for (const [e, t] of V) {
 			const n = (e, s, r) => {
-				if (e !== q.length) for (const t of q[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 q.push({
 					exemplar: t,
 					path: s,
 					key: r
@@ -952,103 +952,103 @@ var Y = [
 			};
 			n(0, [], e);
 		}
-		const G = z.length;
-		if (0 === G) return {
+		const z = q.length;
+		if (0 === z) return {
 			count: 0,
-			ids: l.map(() => []),
-			values: u.map(() => [])
+			ids: i.map(() => []),
+			values: c.map(() => [])
 		};
-		const j = u.length * B, K = (e, t) => e * B + t, Q = (e, t) => j + e * f.length + t, J = [];
-		for (let e = 0; e < u.length; e++) for (let t = 0; t < B; t++) J.push(z.map(({ key: n }) => {
-			const s = _.get(n);
+		const G = c.length * H, K = (e, t) => e * H + t, Q = (e, t) => G + e * p.length + t, J = [];
+		for (let e = 0; e < c.length; e++) for (let t = 0; t < H; t++) J.push(q.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 < u.length; e++) for (let t = 0; t < f.length; t++) {
-			const n = oe(f[t].formula, (t, n) => {
+		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 = O(n), r = f.findIndex((e) => e.item === s);
-				return ae(r >= 0 ? Q(e, r) : K(e, N.get(s)));
+				const s = R(n), r = p.findIndex((e) => e.item === s);
+				return ae(r >= 0 ? Q(e, r) : K(e, O.get(s)));
 			});
 			if (null === n) return null;
 			W.push({
 				expression: n,
-				coords: le(Q(e, t), G)
+				coords: ie(Q(e, t), z)
 			});
 		}
 		const X = await r.evaluateBatch({
-			values: ie(J, G),
+			values: le(J, z),
 			formulas: W
-		}), Y = l.map(() => []), Z = u.map(() => []), ee = (e, t, n, s) => {
-			m.forEach((n, s) => {
-				const r = I.indexOf(s);
-				Y[s].push(s === c ? t : r >= 0 ? e.path[r] : n[e.exemplar] ?? 0);
-			}), Z.forEach((e, t) => {
+		}), Z = i.map(() => []), Y = c.map(() => []), ee = (e, t, n, s) => {
+			g.forEach((n, s) => {
+				const r = A.indexOf(s);
+				Z[s].push(s === f ? t : r >= 0 ? e.path[r] : n[e.exemplar] ?? 0);
+			}), Y.forEach((e, t) => {
 				e.push(t === n ? s : null);
 			});
 		};
-		return z.forEach((e, t) => {
-			f.forEach(({ item: n }, s) => {
-				u.forEach((r, o) => {
-					const a = X[o * f.length + s].getValueAt(t, 0) ?? 0;
+		return q.forEach((e, t) => {
+			p.forEach(({ item: n }, s) => {
+				c.forEach((r, o) => {
+					const a = X[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: Y[0]?.length ?? 0,
-			ids: Y,
-			values: Z
+			count: Z[0]?.length ?? 0,
+			ids: Z,
+			values: Y
 		};
-	})(e, t, n, r, o) : void 0, f = l.filter((e) => !$(e)).map((e, t) => ({
+	})(e, t, n, r, o) : void 0, p = i.filter((e) => !B(e)).map((e, t) => ({
 		filter: e,
 		index: t
-	})).sort((e, t) => (e.filter.evalOrder ?? -1) - (t.filter.evalOrder ?? -1) || e.index - t.index), m = (t.recordCount ?? 0) + (c?.count ?? 0);
-	let p;
-	const g = e.rowFields ?? [];
-	for (const { filter: s } of f) {
-		const a = await Ae(e, t, n, s.field, s.dataField, o, p, c, r);
+	})).sort((e, t) => (e.filter.evalOrder ?? -1) - (t.filter.evalOrder ?? -1) || e.index - t.index), g = (t.recordCount ?? 0) + (f?.count ?? 0);
+	let v;
+	const w = e.rowFields ?? [];
+	for (const { filter: s } of p) {
+		const a = await Ae(e, t, n, s.field, s.dataField, o, v, f, r);
 		if (!a) continue;
-		const l = /* @__PURE__ */ new Set();
+		const i = /* @__PURE__ */ new Set();
 		for (const [e, t] of a.groups) {
-			const o = await $e(s.condition, t.totals, n, r);
+			const o = await Le(s.condition, t.totals, n, r);
 			t.ids.forEach((t, n) => {
-				o[n] || l.add(`${e}|${t}`);
+				o[n] || i.add(`${e}|${t}`);
 			});
 		}
-		if (0 === l.size) continue;
-		p ??= new Uint8Array(m).fill(3);
-		const i = a.outer.map((e) => a.records[e]), d = a.records[s.field], u = g.includes(s.field) ? 1 : 2;
-		for (let e = 0; e < m; e++) {
-			if (!(p[e] & u)) continue;
+		if (0 === i.size) continue;
+		v ??= new Uint8Array(g).fill(3);
+		const l = a.outer.map((e) => a.records[e]), d = a.records[s.field], u = w.includes(s.field) ? 1 : 2;
+		for (let e = 0; e < g; e++) {
+			if (!(v[e] & u)) continue;
 			let t = "";
-			for (let n = 0; n < i.length; n++) t += (n > 0 ? "," : "") + i[n][e];
-			l.has(`${t}|${d[e]}`) && (p[e] &= ~u);
+			for (let n = 0; n < l.length; n++) t += (n > 0 ? "," : "") + l[n][e];
+			i.has(`${t}|${d[e]}`) && (v[e] &= ~u);
 		}
 	}
-	const w = d && r ? await (async (e, t, n, s, r, o, a) => {
-		const l = P.peek(), i = de(e, t);
-		if (!l || !i) return null;
-		const d = xe(e, t, n, a, i.operands);
+	const F = d && r ? await (async (e, t, n, s, r, o, a) => {
+		const i = R.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(l, i, e, d.items, d.records, d.values, u(e.rowFields), u(e.columnFields), d.n, r, o, s);
-	})(e, t, n, r, o, p, c) : void 0;
+		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, v, f) : void 0;
 	return {
 		keep: o,
-		...p ? { records: p } : {},
-		...c ? { calculatedRecords: c } : {},
-		...w ? { fieldValues: w } : {}
+		...v ? { records: v } : {},
+		...f ? { calculatedRecords: f } : {},
+		...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 && c(e.condition, t);
+		const n = e.condition && y(e.condition, t);
 		return n === e.condition ? e : (s = !0, {
 			...e,
 			condition: n
@@ -1058,13 +1058,13 @@ var Y = [
 		...e,
 		filters: r
 	} : e;
-}, $e = async (e, t, n, s) => {
+}, Le = async (e, t, n, s) => {
 	const r = t.length, o = new Uint8Array(r);
 	if (0 === r) return o;
 	const a = new p();
 	for (let e = 0; e < r; e++) null !== t[e] && a.setValueAt(e, 0, t[e]);
-	let l = !1;
-	return await T({
+	let i = !1;
+	return await f({
 		conditions: [e],
 		runtime: n,
 		calculation: s ?? null,
@@ -1076,30 +1076,30 @@ var Y = [
 			colEnd: 0
 		},
 		onTrue: (e) => {
-			l = !0, o[e.rowIndex] = 1;
+			i = !0, o[e.rowIndex] = 1;
 		},
 		onFalse: () => {
-			l = !0;
+			i = !0;
 		},
 		onBlank: (e) => {
-			l = !0;
+			i = !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 l = e.fields?.[r], i = /* @__PURE__ */ new Map();
-	for (const e of l?.items ?? []) void 0 !== e.item && void 0 === e.type && void 0 !== e.name && i.set(e.item, e.name);
-	const d = l?.numberFormat ?? t.fields?.[r]?.numberFormat, u = R(d, o), c = (e) => void 0 === d ? R(H(t.fields?.[r], e), o) : u, f = new Array(n.length);
+	}), i || o.fill(1), o;
+}, $e = (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, c = h(d, o), f = (e) => void 0 === d ? h(P(t.fields?.[r], e), o) : c, p = new Array(n.length);
 	for (let e = 0; e < n.length; e++) {
-		const l = i.get(e);
-		if (void 0 !== l) {
-			f[e] = l;
+		const i = l.get(e);
+		if (void 0 !== i) {
+			p[e] = i;
 			continue;
 		}
-		const d = C(n[e]);
-		null === d ? f[e] = F : "number" == typeof d ? f[e] = s(o, E(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);
+		const d = m(n[e]);
+		null === d ? p[e] = L : "number" == typeof d ? p[e] = s(o, u(t.fields?.[r], e) ? f(e) : c, d) : "boolean" == typeof d ? p[e] = d ? "TRUE" : "FALSE" : a.isError(d) ? p[e] = d.getLabel() : p[e] = String(d);
 	}
-	return f;
+	return p;
 }, _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,
@@ -1108,8 +1108,8 @@ var Y = [
 		colEnd: t.colEnd
 	}).getValues()[0] ?? [], a = [];
 	for (let e = 0; e < n; e++) {
-		const n = o[e] ?? null, l = new W(), i = new Uint32Array(s);
-		let d, u, c = !1, f = l.values;
+		const n = o[e] ?? null, i = new W(), l = new Uint32Array(s);
+		let d, u, c = !1, f = i.values;
 		if (s > 0) {
 			const n = r.getRange({
 				rowStart: t.rowStart + 1,
@@ -1117,13 +1117,13 @@ var Y = [
 				colStart: t.colStart + e,
 				colEnd: t.colStart + e
 			});
-			l.fill(n.getValuesRange(), i), d = Ve(n, s);
-			const o = Ue(n, t.rowStart + 1, i, l.values);
+			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: i,
+			ids: l,
 			values: f,
 			numberFormat: d,
 			dates: c,
@@ -1156,17 +1156,17 @@ var Y = [
 		dates: o,
 		values: s
 	};
-	const l = s.slice(), i = /* @__PURE__ */ new Map();
+	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 = i.get(t);
-		void 0 === o && (o = l.length, l.push(s[t]), i.set(t, o)), n[e] = o;
+		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(i.values()),
-		values: l
+		dateIds: new Set(l.values()),
+		values: i
 	};
 }, He = (e, t) => {
 	let n = 0, s = e.length - 1;
@@ -1185,8 +1185,8 @@ var Y = [
 } : a.isError(e) ? {
 	t: "e",
 	v: e.getCode()
-} : e, qe = (e, t) => (t && "number" == typeof e ? "date:" : "") + d(C(e)), ze = (e, t, n, s = !1) => {
-	const r = e.fields ?? [], o = g(e.items, r.length), a = /\smissingItemsLimit="0"/.test(e.rest ?? ""), l = ((e) => {
+} : e, je = (e, t) => (t && "number" == typeof e ? "date:" : "") + k(m(e)), qe = (e, t, n, s = !1) => {
+	const r = e.fields ?? [], o = v(e.items, r.length), a = /\smissingItemsLimit="0"/.test(e.rest ?? ""), l = ((e) => {
 		const t = /* @__PURE__ */ new Set();
 		return e.map((e, n) => {
 			const s = "" === e ? `Field${n + 1}` : e;
@@ -1194,13 +1194,13 @@ var Y = [
 			for (let e = 2; t.has(r.toLocaleLowerCase()); e++) r = `${s}${e}`;
 			return t.add(r.toLocaleLowerCase()), r;
 		});
-	})(t.columns.map((e) => e.header)), i = /* @__PURE__ */ new Map();
+	})(t.columns.map((e) => e.header)), d = /* @__PURE__ */ new Map();
 	r.forEach((e, t) => {
 		const n = e.name.toLocaleLowerCase();
-		e.noRecords || i.has(n) || i.set(n, t);
+		e.noRecords || d.has(n) || d.set(n, t);
 	});
-	const d = t.recordCount, u = r.map(() => -1), c = r.map((e, t) => o[t].map(() => -1)), m = [], p = [], h = [], w = [], v = [], F = [], b = [], y = (e, t, n) => {
-		w[t] = n.items, F[t] = n.items.length, b[t] = !0, c[e] = ((e, t) => {
+	const c = t.recordCount, f = r.map(() => -1), p = r.map((e, t) => o[t].map(() => -1)), h = [], g = [], w = [], F = [], b = [], y = [], I = [], x = (e, t, n) => {
+		F[t] = n.items, y[t] = n.items.length, I[t] = !0, p[e] = ((e, t) => {
 			const n = /* @__PURE__ */ new Map();
 			return t.forEach((e, t) => {
 				n.set(e, t);
@@ -1208,140 +1208,140 @@ var Y = [
 		})(r[e].group.items, n.items);
 	};
 	t.columns.forEach((e, t) => {
-		const n = i.get(l[t].toLocaleLowerCase());
-		void 0 !== n && (i.delete(l[t].toLocaleLowerCase()), u[n] = t);
-		const g = new Int32Array(e.values.length).fill(-1), I = [], x = [], A = new Array(d);
-		for (let t = 0; t < d; t++) {
+		const n = d.get(l[t].toLocaleLowerCase());
+		void 0 !== n && (d.delete(l[t].toLocaleLowerCase()), f[n] = t);
+		const v = new Int32Array(e.values.length).fill(-1), A = [], C = [], E = new Array(c);
+		for (let t = 0; t < c; t++) {
 			const n = e.ids[t];
-			let s = g[n];
-			s < 0 && (s = g[n] = I.length, I.push(Be(e.values[n])), x.push(e.dates || !!e.dateIds?.has(n))), A[t] = s;
+			let s = v[n];
+			s < 0 && (s = v[n] = A.length, A.push(Be(e.values[n])), C.push(e.dates || !!e.dateIds?.has(n))), E[t] = s;
 		}
-		const S = (e) => void 0 !== n && (!!r[n].dates || E(r[n], e)), P = I.length, k = void 0 !== n ? !0 === r[n].inline : I.every((e) => "number" == typeof e || "object" == typeof e && "z" === e?.t), M = [];
+		const S = (e) => void 0 !== n && (!!r[n].dates || u(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 e = /* @__PURE__ */ new Map();
-			for (let t = 0; t < P; t++) e.set(qe(I[t], x[t]), t);
+			for (let t = 0; t < P; t++) e.set(je(A[t], C[t]), t);
 			o[n].forEach((t, s) => {
-				c[n][s] = e.get(qe(t, S(s))) ?? -1;
+				p[n][s] = e.get(je(t, S(s))) ?? -1;
 			});
 		} else if (void 0 !== n) {
 			const e = /* @__PURE__ */ new Map();
-			for (let t = 0; t < P; t++) e.set(qe(I[t], x[t]), t);
+			for (let t = 0; t < P; t++) e.set(je(A[t], C[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 = qe(s, S(r));
-				let l = e.get(o);
-				void 0 !== l || a || S(r) || (l = I.length, I.push(s), x.push(S(r)), M.push(l), e.set(o, l)), c[n][r] = l ?? -1;
+				const o = je(s, S(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)), p[n][r] = i ?? -1;
 			});
 		}
 		const T = { name: l[t] };
 		k && (T.inline = !0), void 0 !== e.numberFormat && (T.numberFormat = e.numberFormat);
-		const O = [];
-		let R = !1;
-		I.forEach((e, t) => {
-			"number" == typeof e && (x[t] ? O.push(t) : R = !0);
-		}), O.length > 0 && !R ? T.dates = !0 : O.length > 0 && (T.dateItems = O), v[t] = T.dateItems ? new Set(T.dateItems) : void 0, M.length > 0 && (T.unused = M);
+		const R = [];
+		let O = !1;
+		A.forEach((e, t) => {
+			"number" == typeof e && (C[t] ? R.push(t) : O = !0);
+		}), R.length > 0 && !O ? T.dates = !0 : R.length > 0 && (T.dateItems = R), b[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 $ = void 0 !== n ? r[n].calculatedItems : void 0;
-		$?.length && (T.calculatedItems = $.map(({ item: e, formula: t }) => {
-			const s = I.length;
-			return I.push(o[n][e]), c[n][e] = s, {
+		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]), p[n][e] = s, {
 				item: s,
 				formula: t
 			};
-		})), m.push(T), p.push([t, [[0, I]]]), h.push([t, [[0, A]]]), w.push(I), F.push(P), b.push(!1);
-		const L = void 0 !== n ? r[n].group : void 0;
-		if (L?.range && L.base === n) {
-			const e = re(L, I.slice(0, P).map(C), s);
+		})), h.push(T), g.push([t, [[0, A]]]), w.push([t, [[0, E]]]), F.push(A), y.push(P), I.push(!1);
+		const $ = void 0 !== n ? r[n].group : void 0;
+		if ($?.range && $.base === n) {
+			const e = re($, A.slice(0, P).map(m), s);
 			e ? (T.group = {
 				...e,
 				base: t
-			}, y(n, t, e)) : c[n] = o[n].map(() => -1);
-		} else L && !f(r[n]) && (T.group = L);
+			}, x(n, t, e)) : p[n] = o[n].map(() => -1);
+		} else $ && !i(r[n]) && (T.group = $);
 	}), r.forEach((e, t) => {
 		if (!e.noRecords) return;
-		if (M(e)) return u[t] = m.length, m.push(e), w.push([]), F.push(0), void b.push(!1);
+		if (j(e)) return f[t] = h.length, h.push(e), F.push([]), y.push(0), void I.push(!1);
 		const n = e.group;
 		if (!n) return;
-		const r = u[n.base];
+		const r = f[n.base];
 		if (void 0 === r || r < 0) return;
-		const o = w[r];
-		let a, l = [];
-		if (n.range) a = re(n, o.slice(0, F[r]).map(C), s);
+		const o = F[r];
+		let a, i = [];
+		if (n.range) a = re(n, o.slice(0, y[r]).map(m), s);
 		else {
-			const e = Ge(n, c[n.base], o, m[r]);
-			a = e.group, l = e.itemMap;
+			const e = ze(n, p[n.base], o, h[r]);
+			a = e.group, i = e.itemMap;
 		}
 		if (!a) return;
-		const i = m.length;
-		u[t] = i, m.push({
+		const l = h.length;
+		f[t] = l, h.push({
 			...e,
 			group: {
 				...a,
 				base: r
 			}
-		}), w.push(a.items), v[i] = a.dateItems ? new Set(a.dateItems) : void 0, F.push(a.items.length), b.push(!1), n.range ? y(t, i, a) : c[t] = l;
-	}), m.forEach((e, t) => {
+		}), F.push(a.items), b[l] = a.dateItems ? new Set(a.dateItems) : void 0, y.push(a.items.length), I.push(!1), n.range ? x(t, l, a) : p[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;
+		const s = f[n.parent], { parent: r, ...o } = n;
 		void 0 !== s && s >= 0 ? e.group = {
 			...n,
 			parent: s
-		} : f(e) ? e.group = o : delete e.group, e.group && !f(e) && (e.group = {
+		} : i(e) ? e.group = o : delete e.group, e.group && !i(e) && (e.group = {
 			...e.group,
 			base: t
 		});
 	});
-	const { cacheId: I, part: x, partFormats: A, fields: S, items: P, records: k, ...T } = e;
+	const { cacheId: A, part: C, partFormats: E, fields: S, items: P, records: k, ...M } = e;
 	return {
 		model: {
-			...T,
+			...M,
 			source: n ?? e.source,
-			fields: m,
-			items: p,
-			records: h,
-			recordCount: d
+			fields: h,
+			items: g,
+			records: w,
+			recordCount: c
 		},
 		remap: {
-			fields: u,
-			items: c,
-			newItems: w,
-			usedCounts: F,
-			inItemOrder: b,
-			dateItems: v
+			fields: f,
+			items: p,
+			newItems: F,
+			usedCounts: y,
+			inItemOrder: I,
+			dateItems: b
 		}
 	};
-}, Ge = (e, t, n, s) => {
+}, ze = (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 = [], l = [], i = new Set(e.dateItems), d = e.items.map((e, t) => r.has(t) ? (i.has(t) && l.push(a.length), a.push(e), a.length - 1) : -1), u = o.map((e, t) => e >= 0 ? d[e] : ((s.dates || E(s, t)) && l.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), c = o.map((e, t) => e >= 0 ? d[e] : ((s.dates || u(s, t)) && i.push(a.length), a.push(n[t]), a.length - 1)), { dateItems: f, ...m } = e;
 	return {
 		group: {
-			...f,
+			...m,
 			items: a,
-			discrete: u,
-			...l.length > 0 ? { dateItems: l } : {}
+			discrete: c,
+			...i.length > 0 ? { dateItems: i } : {}
 		},
 		itemMap: d
 	};
-}, je = (e, t, n = !1, s = !1) => {
+}, Ge = (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 ?? [], l = [], i = [];
+	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 l.push(-1);
-		l.push(i.length);
+		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), i.push(t);
+		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({});
@@ -1350,7 +1350,7 @@ var Y = [
 		if (s < 0) return;
 		const o = { ...e };
 		if (void 0 !== e.sort?.dataField) {
-			const t = l[e.sort.dataField];
+			const t = i[e.sort.dataField];
 			o.sort = t >= 0 ? {
 				...e.sort,
 				dataField: t
@@ -1379,16 +1379,16 @@ var Y = [
 	const c = (e) => {
 		if (!e) return;
 		let t = e.filter(o).map(r);
-		return i.length < 2 && (t = t.filter((e) => -2 !== e)), t.length > 0 ? t : void 0;
+		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", i.length > 0 ? i : void 0), a.forEach((e, t) => {
-		const n = l[t];
+	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 && (i[n].baseItem = s);
+		void 0 !== s && s >= 0 && (l[n].baseItem = s);
 	});
 	const m = (e.pageFields ?? []).flatMap((e) => {
 		if (!o(e.field)) return [];
@@ -1407,14 +1407,14 @@ var Y = [
 			field: r(e.field)
 		};
 		if (void 0 !== e.dataField) {
-			const n = l[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) => Ye(e, r, o, d, l), 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,
@@ -1422,7 +1422,7 @@ var Y = [
 		}] : [];
 	});
 	Qe(f, "formats", g.length > 0 ? g : void 0);
-	const w = (e.conditionalFormats ?? []).flatMap((e) => {
+	const v = (e.conditionalFormats ?? []).flatMap((e) => {
 		const t = e.areas.flatMap((e) => {
 			const t = h(e);
 			return t ? [t] : [];
@@ -1432,19 +1432,19 @@ var Y = [
 			areas: t
 		}] : [];
 	});
-	return Qe(f, "conditionalFormats", w.length > 0 ? w : void 0), f;
+	return Qe(f, "conditionalFormats", v.length > 0 ? v : void 0), f;
 }, Qe = (e, t, n) => {
 	void 0 === n ? delete e[t] : e[t] = n;
 }, Je = (e, t, n, s, r = !1, o) => {
-	const a = e.items ?? [], l = [], i = [], d = /* @__PURE__ */ new Set();
+	const a = e.items ?? [], i = [], l = [], d = /* @__PURE__ */ new Set();
 	for (const e of a) {
-		if (!y(e)) {
-			i.push(l.length), l.push(e);
+		if (!c(e)) {
+			l.push(i.length), i.push(e);
 			continue;
 		}
 		const n = t[e.item] ?? -1;
 		if (n < 0) {
-			i.push(-1);
+			l.push(-1);
 			continue;
 		}
 		d.add(n);
@@ -1452,15 +1452,15 @@ var Y = [
 			...e,
 			item: n
 		};
-		n >= s && !e.calculated ? r.missing = !0 : delete r.missing, i.push(l.length), l.push(r);
+		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 = l.map((e, t) => ({
+		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) => !y(e.item)), o = [...[...s.filter((e) => y(e.item)), ...u.map((e) => ({
+		})), r = s.filter((e) => !c(e.item)), o = [...[...s.filter((e) => c(e.item)), ...u.map((e) => ({
 			item: n ? {
 				item: e,
 				hidden: !0
@@ -1469,43 +1469,43 @@ var Y = [
 		}))].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: i.map((e) => e < 0 ? e : d.get(e) ?? -1)
+			positions: l.map((e) => e < 0 ? e : d.get(e) ?? -1)
 		};
 	}
 	if (0 === u.length) return {
-		items: l,
-		positions: i
+		items: i,
+		positions: l
 	};
-	const c = !e.includeNewItemsInFilter && a.some((e) => e.hidden), f = (e) => c ? {
+	const f = !e.includeNewItemsInFilter && a.some((e) => e.hidden), p = (e) => f ? {
 		item: e,
 		hidden: !0
 	} : { item: e };
 	if (e.sort && void 0 === e.sort.dataField) {
-		const t = "descending" === e.sort.order, s = (e, t) => je(S(e, n), C(n[t]), void 0 === e.name && o?.has(e.item), o?.has(t));
+		const t = "descending" === e.sort.order, s = (e, t) => Ge(N(e, n), m(n[t]), void 0 === e.name && o?.has(e.item), o?.has(t));
 		for (const e of u) {
-			const n = f(e);
-			let r = l.findIndex((n) => y(n) && (t ? s(n, e) < 0 : s(n, e) > 0));
-			r < 0 && (r = We(l)), l.splice(r, 0, n);
-			for (let e = 0; e < i.length; e++) i[e] >= r && i[e]++;
+			const n = p(e);
+			let r = i.findIndex((n) => c(n) && (t ? s(n, e) < 0 : s(n, e) > 0));
+			r < 0 && (r = We(i)), i.splice(r, 0, n);
+			for (let e = 0; e < l.length; e++) l[e] >= r && l[e]++;
 		}
 	} else {
-		const e = We(l);
-		l.splice(e, 0, ...u.map(f));
-		for (let t = 0; t < i.length; t++) i[t] >= e && (i[t] += u.length);
+		const e = We(i);
+		i.splice(e, 0, ...u.map(p));
+		for (let t = 0; t < l.length; t++) l[t] >= e && (l[t] += u.length);
 	}
 	return {
-		items: l,
-		positions: i
+		items: i,
+		positions: l
 	};
 }, We = (e) => {
-	const t = e.findIndex((e) => !y(e));
+	const t = e.findIndex((e) => !c(e));
 	return t < 0 ? e.length : t;
 }, Xe = (e, t) => {
 	if (!(t < 0)) for (let n = 0; n < e.length; n++) {
 		const s = (t + n) % e.length, r = e[s];
-		if (y(r) && !r.missing) return s;
+		if (c(r) && !r.missing) return s;
 	}
-}, Ye = (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;
@@ -1532,7 +1532,7 @@ var Y = [
 		o.references = a;
 	}
 	return o;
-}, Ze = (e, t, n) => {
+}, Ye = (e, t, n) => {
 	const s = e.fields ?? [], r = s[t]?.items ?? [], o = new Array(r.length);
 	n.forEach((e, t) => {
 		o[e] = t;
@@ -1546,7 +1546,7 @@ var Y = [
 			};
 			const a = e.sort?.scope;
 			if (!a?.items.some((e) => e.field === t)) return e;
-			const l = a.items.map((e) => e.field === t ? {
+			const i = a.items.map((e) => e.field === t ? {
 				...e,
 				item: o[e.item] ?? e.item
 			} : e);
@@ -1556,7 +1556,7 @@ var Y = [
 					...e.sort,
 					scope: {
 						...a,
-						items: l
+						items: i
 					}
 				}
 			};
@@ -1569,7 +1569,7 @@ var Y = [
 		...e,
 		baseItem: o[e.baseItem] ?? e.baseItem
 	} : e));
-	const l = s.map((e, n) => n === t ? o : null), i = (e.dataFields ?? []).map((e, t) => t), d = (e) => Ye(e, (e) => e, () => !0, l, i) ?? 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)
@@ -1578,50 +1578,50 @@ var Y = [
 		areas: e.areas.map(d)
 	}))), a;
 }, et = (e, t, n, s) => {
-	const r = (e.fields ?? [])[n]?.items ?? [], o = V(t)[n] ?? [], a = t.fields?.[n], l = void 0 !== a?.group?.range, i = (e) => void 0 === e.name && E(a, e.item), d = r.map((e, t) => ({
+	const r = (e.fields ?? [])[n]?.items ?? [], o = x(t)[n] ?? [], a = t.fields?.[n], i = void 0 !== a?.group?.range, l = (e) => void 0 === e.name && u(a, e.item), d = r.map((e, t) => ({
 		item: e,
 		at: t
-	})), u = d.filter((e) => y(e.item));
-	u.sort((e, t) => l ? e.item.item - t.item.item : je(S(e.item, o), S(t.item, o), i(e.item), i(t.item))), "descending" === s && u.reverse();
-	let c = 0;
-	const f = Ze(e, n, d.map((e) => y(e.item) ? u[c++] : e).map((e) => e.at));
+	})), f = d.filter((e) => c(e.item));
+	f.sort((e, t) => i ? e.item.item - t.item.item : Ge(N(e.item, o), N(t.item, o), l(e.item), l(t.item))), "descending" === s && f.reverse();
+	let m = 0;
+	const p = Ye(e, n, d.map((e) => c(e.item) ? f[m++] : e).map((e) => e.at));
 	return {
-		...f,
-		fields: f.fields.map((e, t) => t === n ? {
+		...p,
+		fields: p.fields.map((e, t) => t === n ? {
 			...e,
 			sort: { order: s }
 		} : e)
 	};
 }, tt = (n, s, r) => {
 	const o = n.fields?.[s]?.items?.[r];
-	if (!o || !y(o)) throw new t(e("error.pivotTable.changePart"));
+	if (!o || !c(o)) throw new t(e("error.pivotTable.changePart"));
 	return o;
 }, nt = (n, s, r, o, a) => {
-	const l = tt(n, r, o), i = n.fields[r].items, d = V(s)[r] ?? [], u = (e) => {
-		const t = C(d[e.item]);
-		return null === t ? F : D(t);
+	const i = tt(n, r, o), l = n.fields[r].items, d = x(s)[r] ?? [], u = (e) => {
+		const t = m(d[e.item]);
+		return null === t ? L : $(t);
 	};
-	if (i.some((e, t) => t !== o && y(e) && h(e.name ?? u(e), a))) throw new t(e("error.pivotTable.itemNameExists", { name: a }));
-	const { name: c, ...f } = l, m = a === u(l) ? f : {
-		...l,
+	if (l.some((e, t) => t !== o && c(e) && T(e.name ?? u(e), a))) throw new t(e("error.pivotTable.itemNameExists", { name: a }));
+	const { name: f, ...p } = i, h = a === u(i) ? p : {
+		...i,
 		name: a
 	};
-	if (m.name === l.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: i.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;
+	}, v = n.fields[r].sort;
+	return v && void 0 === v.dataField ? et(g, s, r, v.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 = Ye(e, t, r);
 	return o ? {
 		...a,
 		fields: a.fields.map((e, n) => {
@@ -1631,36 +1631,36 @@ var Y = [
 		})
 	} : a;
 }, rt = (n, s, r, o) => {
-	const a = D(o), l = n.fields, i = s.fields, d = n.dataFields ?? [], u = V(s), c = (e, t) => {
+	const a = $(o), i = n.fields, l = s.fields, d = n.dataFields ?? [], u = x(s), f = (e, t) => {
 		if (void 0 !== t.name) return t.name;
-		const n = C(u[e][t.item]);
-		return null === n ? F : D(n);
-	}, f = (r) => {
-		if (void 0 !== r.field && a === (l[r.field].name ?? i[r.field].name)) return;
+		const n = m(u[e][t.item]);
+		return null === n ? L : $(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,
-			fields: l.map((e, t) => t === r.field ? {
+			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"));
+		if (q(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 = l[e].items.findIndex((n, s) => s !== t && y(n) && h(c(e, n), a));
+			const o = i[e].items.findIndex((n, s) => s !== t && c(n) && T(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 f({ field: e }), ((e, t) => ({
+			return p({ field: e }), ((e, t) => ({
 				...n,
-				fields: l.map((n, s) => s === e ? t(n) : n)
+				fields: i.map((n, s) => s === e ? t(n) : n)
 			}))(e, (t) => {
 				const { name: n, ...s } = t;
-				return a === i[e].name ? s : {
+				return a === l[e].name ? s : {
 					...t,
 					name: a
 				};
@@ -1668,7 +1668,7 @@ var Y = [
 		}
 		case "dataCaption": {
 			const { data: e } = r;
-			return f({ data: e }), {
+			return p({ data: e }), {
 				...n,
 				dataFields: d.map((t, n) => n === e ? {
 					...t,
@@ -1690,19 +1690,19 @@ var Y = [
 		};
 		case "pageItem": {
 			const s = n.pageFields, o = s[r.page];
-			let i;
-			if (!h(a, "(All)") && (i = (l[o.field].items ?? []).findIndex((e) => y(e) && h(c(o.field, e), a)), i < 0)) throw new t(e("error.pivotTable.notAnItem", { name: a }));
-			const { item: d, ...u } = o, f = void 0 === i ? u : {
+			let l;
+			if (!T(a, "(All)") && (l = (i[o.field].items ?? []).findIndex((e) => c(e) && T(f(o.field, e), a)), l < 0)) throw new t(e("error.pivotTable.notAnItem", { name: a }));
+			const { item: d, ...u } = o, m = void 0 === l ? u : {
 				...o,
-				item: i
+				item: l
 			};
 			return {
 				...n,
-				pageFields: s.map((e, t) => t === r.page ? f : e)
+				pageFields: s.map((e, t) => t === r.page ? m : e)
 			};
 		}
 	}
-}, ot = (e, t, n) => ze({
+}, ot = (e, t, n) => qe({
 	cacheId: 0,
 	fields: []
 }, e, t, n).model, at = (e, t) => t.some((t) => e.fields?.[t]?.inline) ? {
@@ -1712,13 +1712,13 @@ var Y = [
 		const { inline: s, ...r } = e;
 		return r;
 	})
-} : e, lt = (e) => [
+} : e, it = (e) => [
 	...e.rowFields ?? [],
 	...e.columnFields ?? [],
 	...(e.pageFields ?? []).map((e) => e.field)
-].filter((e) => e >= 0), it = (e, t) => {
-	const n = e.fields[t], s = V(e)[t], r = s.map((e, t) => t);
-	f(n) || r.sort((e, t) => je(C(s[e]), C(s[t]), E(n, e), E(n, t)));
+].filter((e) => e >= 0), lt = (e, t) => {
+	const n = e.fields[t], s = x(e)[t], r = s.map((e, t) => t);
+	i(n) || r.sort((e, t) => Ge(m(s[e]), m(s[t]), u(n, e), u(n, t)));
 	const o = new Set(n.calculatedItems?.map((e) => e.item)), a = new Set(n.unused);
 	return [...r.map((e) => ({
 		item: e,
@@ -1728,39 +1728,39 @@ var Y = [
 }, 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" === _(e, t) ? "sum" : "count")(s.fields[r], V(s)[r]), l = v[a];
-	if (!l) throw new t(e("error.pivotTable.notAFunction", { name: a }));
-	let i = o?.name;
-	if (void 0 === i) i = z(n, s, `${l} of ${w(n, s, r)}`);
-	else if (z(n, s, i) !== i) throw new t(e("error.pivotTable.fieldNameExists"));
-	const d = {
-		name: i,
+	const a = o?.function ?? ((e, t) => "number" === l(e, t) ? "sum" : "count")(s.fields[r], x(s)[r]), i = M[a];
+	if (!i) throw new t(e("error.pivotTable.notAFunction", { name: a }));
+	let d = o?.name;
+	if (void 0 === d) d = q(n, s, `${i} of ${_(n, s, r)}`);
+	else if (q(n, s, d) !== d) throw new t(e("error.pivotTable.fieldNameExists"));
+	const u = {
+		name: d,
 		field: r,
 		baseField: 0,
 		baseItem: 0
 	};
-	return "sum" !== a && (d.subtotal = a), void 0 !== o?.numberFormat && (dt(o.numberFormat), d.numberFormat = o.numberFormat), d;
+	return "sum" !== a && (u.subtotal = a), void 0 !== o?.numberFormat && (dt(o.numberFormat), u.numberFormat = o.numberFormat), u;
 }, ct = (n, s) => {
 	const r = n.fields ?? [], o = (n) => {
-		const s = r.findIndex((e) => h(e.name, n));
+		const s = r.findIndex((e) => T(e.name, n));
 		if (s < 0) throw new t(e("error.pivotTable.notAField", { name: n }));
 		return s;
-	}, a = /* @__PURE__ */ new Map(), l = (e, t) => {
+	}, a = /* @__PURE__ */ new Map(), i = (e, t) => {
 		for (const n of e ?? []) {
 			const e = o(n);
 			a.delete(e), a.set(e, t);
 		}
 	};
-	l(s?.rows, "row"), l(s?.columns, "column"), l(s?.pages, "page");
-	const i = (e) => [...a].filter(([, t]) => t === e).map(([e]) => e), d = [];
+	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 = it(n, t)), u.has(t) && (s.dataField = !0), c && (s.form = c), e.dates && void 0 !== e.numberFormat && (s.numberFormat = e.numberFormat), s;
-	}), m = i("column");
+		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,
@@ -1772,14 +1772,14 @@ var Y = [
 			showColumnStripes: !1,
 			showLastColumn: !0
 		}
-	}, g = i("row");
-	g.length > 0 && (p.rowFields = g), m.length > 0 && (p.columnFields = m);
-	const w = i("page");
-	return w.length > 0 && (p.pageFields = w.map((e) => ({ field: e }))), d.length > 0 && (p.dataFields = d), c && (p.form = c), p;
+	}, 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 === L.Axis.Row ? e.columnFields : t.axis === L.Axis.Column ? e.rowFields : void 0) ?? []).filter((e) => -2 !== e);
+	const s = ((t.axis === D.Axis.Row ? e.columnFields : t.axis === D.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;
@@ -1796,25 +1796,25 @@ var Y = [
 		}
 	};
 }), mt = (n, s, r, o, a) => {
-	const l = L.Axis, i = s.fields?.[r], d = n.fields?.[r]?.axis ?? null;
-	if (o === l.Values) throw new t(e("error.pivotTable.valuesNotAnAxis"));
+	const i = D.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 !== i?.formula || o === l.Page && (i?.calculatedItems?.length ?? 0) > 0) throw new t(e("error.pivotTable.fieldNotPlaceable"));
-	const c = o ? G(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 || G(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 === l.Row ? c : v(n.rowFields), b = o === l.Column ? c : v(n.columnFields), y = o === l.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);
+	} else if (void 0 !== l?.formula || o === i.Page && (l?.calculatedItems?.length ?? 0) > 0) throw new t(e("error.pivotTable.fieldNotPlaceable"));
+	const u = o ? 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 || O(n, o)[c] === r)) return n;
+	u.splice(c, 0, r);
+	const { rowFields: f, columnFields: m, pageFields: p, ...h } = n, g = {}, v = (e) => (e ?? []).filter((e) => e !== r), F = o === i.Row ? u : v(n.rowFields), b = o === i.Column ? u : v(n.columnFields), y = o === i.Page ? u.map((e) => n.pageFields?.find((t) => t.field === e) ?? { field: e }) : (n.pageFields ?? []).filter((e) => e.field !== r);
+	F.length > 0 && (g.rowFields = F), b.length > 0 && (g.columnFields = b), y.length > 0 && (g.pageFields = y);
 	let I = {
-		...g,
-		...w
+		...h,
+		...g
 	};
-	o === l.Page && d !== l.Page && (I = u(I, r, () => !0));
+	o === i.Page && d !== i.Page && (I = V(I, r, () => !0));
 	const x = { ...n.fields?.[r] };
-	o ? x.axis = o : delete x.axis, o && !x.items && i && (x.items = q(it(s, r), x.subtotals)), o && void 0 === x.numberFormat && i?.dates && void 0 !== i.numberFormat && (x.numberFormat = i.numberFormat), o === l.Page && x.items?.some((e) => e.hidden) && (x.multipleItemSelection = !0);
+	o ? x.axis = o : delete x.axis, o && !x.items && l && (x.items = w(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,
@@ -1841,17 +1841,17 @@ var Y = [
 	"index",
 	"rankAscending",
 	"rankDescending"
-]), wt = /* @__PURE__ */ new Set([
+]), vt = /* @__PURE__ */ new Set([
 	...ht,
 	...gt,
 	"runTotal",
 	"difference"
-]), vt = (e, t) => {
+]), wt = (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;
+	if (!e.formats?.some((e) => wt(e.area, t))) return e;
+	const n = e.formats.filter((e) => !wt(e.area, t)), { formats: s, ...r } = e;
 	return n.length > 0 ? {
 		...r,
 		formats: n
@@ -1889,7 +1889,7 @@ var Y = [
 			} : n;
 		}
 		return r;
-	}), { dataFields: o, filters: a, formats: l, conditionalFormats: i, ...d } = e, u = {
+	}), { dataFields: o, filters: a, formats: i, conditionalFormats: l, ...d } = e, u = {
 		...d,
 		fields: r
 	};
@@ -1903,7 +1903,7 @@ var Y = [
 		}];
 	});
 	c.length > 0 && (u.filters = c);
-	const f = (e) => Ye(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,
@@ -1921,11 +1921,11 @@ var Y = [
 	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), l = {
+			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 ? l[t] = a : delete l[t], l;
+			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] ?? []];
@@ -1950,12 +1950,12 @@ var Y = [
 	if (r - 1 === s) return n;
 	const a = o.map((e, t) => t).filter((e) => e !== s);
 	a.splice(r - 1, 0, s);
-	const l = [];
+	const i = [];
 	return a.forEach((e, t) => {
-		l[e] = t;
-	}), It(n, a.map((e) => o[e]), l);
+		i[e] = t;
+	}), It(n, a.map((e) => o[e]), i);
 }, Et = (e, t, n, s) => {
-	const r = O(e, t, n, s);
+	const r = G(e, t, n, s);
 	return (e.dataFields[n].subtotal ?? "sum") === s ? e : bt(e, n, (e) => {
 		const { subtotal: t, ...n } = e, o = {
 			...n,
@@ -1964,40 +1964,40 @@ var Y = [
 		return "sum" !== s && (o.subtotal = s), o;
 	});
 }, St = (n, s, r, o) => {
-	const a = n.dataFields[r], l = a.showDataAs ?? "normal", i = o?.kind ?? "normal";
-	if (o && !wt.has(o.kind)) throw new t(e("error.pivotTable.notAShowAs", { name: o.kind }));
+	const a = n.dataFields[r], i = a.showDataAs ?? "normal", l = o?.kind ?? "normal";
+	if (o && !vt.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" !== i && (m.showDataAs = i);
-	let p = a.baseField, g = a.baseItem;
+	"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) => h(w(n, s, t), r));
+		const r = o.baseField, a = (s.fields ?? []).findIndex((e, t) => T(_(n, s, t), r));
 		if (a < 0) throw new t(e("error.pivotTable.notAField", { name: r }));
-		a !== p && (p = a, g = 0);
+		a !== p && (p = a, h = 0);
 	}
 	if (void 0 !== o?.baseItem) {
 		const r = p ?? 0;
-		if (h(o.baseItem, "(previous)")) g = "previous";
-		else if (h(o.baseItem, "(next)")) g = "next";
+		if (T(o.baseItem, "(previous)")) h = "previous";
+		else if (T(o.baseItem, "(next)")) h = "next";
 		else {
 			const a = n.fields?.[r]?.items ? n : { fields: (n.fields ?? []).map((e, t) => t === r ? {
 				...e,
-				items: it(s, r)
-			} : e) }, l = b(a, s, r).findIndex((e) => null !== e && h(e, o.baseItem));
-			if (l < 0) throw new t(e("error.pivotTable.notAnItem", { name: o.baseItem }));
-			g = l;
+				items: lt(s, r)
+			} : e) }, i = z(a, s, r).findIndex((e) => null !== e && T(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 !== g && (m.baseItem = g), i === l) return m.baseField === a.baseField && m.baseItem === a.baseItem ? n : bt(n, r, () => m);
-	const v = ((e, t, n) => {
+	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);
+		const s = ((e) => F(e).replace(/"[^"]*"|\\./g, "").includes("%"))(e);
 		return ht.has(n) ? ht.has(t) || s ? e : 10 : ht.has(t) && s ? void 0 : e;
-	})(a.numberFormat, l, i);
-	return v === a.numberFormat ? bt(n, r, () => m) : bt(Ft(n, r), r, () => yt(m, v));
+	})(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 s = F(n), r = e.dataFields[t], o = e.formats?.[e.formats.length - 1];
+	if (F(r.numberFormat) === s && o && wt(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,
@@ -2014,27 +2014,27 @@ var Y = [
 	};
 }, kt = (n, s, r) => {
 	if (null === s) return At(n);
-	const o = L.Axis;
+	const o = D.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 l = G(n, s).filter((e) => e !== pt);
-	if (void 0 !== r && (!Number.isInteger(r) || r < 1 || r > l.length + 1)) throw new t(e("error.pivotTable.fieldPosition"));
-	const i = (r ?? l.length + 1) - 1;
-	if (s === a && (void 0 === r || G(n, s)[i] === pt)) return n;
-	l.splice(i, 0, pt);
-	const { rowFields: d, columnFields: u, valuesOnRows: c, ...f } = n, m = G(n, s === o.Row ? o.Column : o.Row).filter((e) => e !== pt), p = { ...f }, h = s === o.Row ? l : m, g = s === o.Column ? l : m;
+	const i = O(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 || O(n, s)[l] === pt)) return n;
+	i.splice(l, 0, pt);
+	const { rowFields: d, columnFields: u, valuesOnRows: c, ...f } = n, m = O(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, l = {
+	const { valuesCaption: o, ...a } = n, i = {
 		...a,
 		valuesCaption: "\0"
 	};
-	if (z(l, s, r) !== r) throw new t(e("error.pivotTable.fieldNameExists"));
+	if (q(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, lt as axisFieldsOf, Oe as buildPivotView, Re as evaluatePivotFilters, $ as isItemFilter, Ie as layOutPivot, it 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, 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 };
+export { xt as addPivotDataField, Ne as anchorPivotPeriods, dt as assertNumberFormat, it as axisFieldsOf, Re as buildPivotView, Oe as evaluatePivotFilters, B 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, qe as refreshPivotCache, Ke as remapPivotTable, At as removePivotDataField, nt as renamePivotItem, Mt as renamePivotValues, Ye as reorderPivotItems, Et as setPivotDataFunction, Pt as setPivotDataNumberFormat, St as setPivotDataShowAs, et as sortPivotItemsByLabel, rt as typeOverPivot, at as withListedFields };