@sheetxl/mcp 0.8.0-beta.24 → 1.0.0

package/assets/{CmwNIrRssYuLN2fn.js → DZxHk5oKIVvu3iJR.js}

@@ -1,14 +1,14 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.24
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v1.0.0
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { p as e, tt as t } from "./DMDTS0LH9Ke9t-3z.js";
-import { Qt as n, _ as s, v as r, vt as o } from "./B16G2473LTkZP6Mq.js";
-import { u as a } from "./DRzZ4bEyLRGVOLzV.js";
-import { $ as l, $i as i, Ai as d, Hr as u, I as c, In as f, It as m, Mn as p, Na as h, O as g, Pi as w, Qi as v, Ra as F, S as b, Sa as y, Sn as I, Tt as x, Un as A, Va as C, Vr as E, Za as S, _a as P, aa as k, br as M, fi as T, fr as R, ga as O, gi as N, mn as $, mt as _, p as L, qi as D, st as V, ti as U, u as H, ut as z, wa as B, ya as j, z as q, zr as G } from "./C9iFJ52KwQTePQ81.js";
-import { a as Q, i as K, n as J, o as W, r as Z } from "./CnI4Nli8vtWdFKvf.js";
+import { p as e, tt as t } from "./DzYvbv5u7E2H7IoB.js";
+import { Dt as n, Et as s, _t as r, d as o } from "./8hLtXHueDl7B_SEn.js";
+import { u as a } from "./8mWHFnE0j-CaNsxr.js";
+import { Ar as l, Bi as i, Br as d, Bt as u, E as c, Ei as f, Ga as m, Ja as p, Li as h, Lr as g, Ma as w, Mi as v, Pi as F, Pr as b, Q as y, Qr as I, Sr as x, Vn as A, Yt as C, at as E, c as P, ca as S, cn as k, dt as M, hn as T, io as R, m as O, nt as N, pn as L, q as $, qa as _, qi as D, rn as V, ta as U, uo as H, vi as B, vn as q, xr as G, yi as j, yr as z } from "./Dcw7GSCgw_dgsum7.js";
+import { a as Q, i as K, n as J, o as W, r as Y } from "./B5rrqMYFybo3oW9k.js";
 var X = [
 	"Jan",
 	"Feb",
@@ -22,7 +22,7 @@ var X = [
 	"Oct",
 	"Nov",
 	"Dec"
-], Y = [
+], Z = [
 	31,
 	29,
 	31,
@@ -35,24 +35,24 @@ var X = [
 	31,
 	30,
 	31
-], ee = (e, t, n, s) => {
-	if ("number" != typeof n) return null;
-	if (n < e.start) return 0;
+], ee = (e, t, s, r) => {
+	if ("number" != typeof s) return null;
+	if (s < e.start) return 0;
 	const o = t - 1;
 	if (((e) => "numbers" === e.by || "days" === e.by && 1 !== (e.interval ?? 1))(e)) {
-		const s = Math.floor((n - e.start) / (e.interval ?? 1));
-		return s >= t - 2 ? n <= e.end ? t - 2 : o : s + 1;
+		const n = Math.floor((s - e.start) / (e.interval ?? 1));
+		return n >= t - 2 ? s <= e.end ? t - 2 : o : n + 1;
 	}
-	if (n > e.end) return o;
-	const a = r(n, s, !0);
+	if (s > e.end) return o;
+	const a = n(s, r, !0);
 	if (!a) return null;
 	switch (e.by) {
-		case "years": return Math.min(a.year - (r(e.start, s, !0)?.year ?? a.year) + 1, o);
+		case "years": return Math.min(a.year - (n(e.start, r, !0)?.year ?? a.year) + 1, o);
 		case "quarters": return Math.floor((a.month - 1) / 3) + 1;
 		case "months": return a.month;
 		case "days": {
 			let e = a.day;
-			for (let t = 0; t < a.month - 1; t++) e += Y[t];
+			for (let t = 0; t < a.month - 1; t++) e += Z[t];
 			return e;
 		}
 		case "hours": return a.hour + 1;
@@ -61,15 +61,15 @@ var X = [
 		default: return null;
 	}
 }, te = (e, t) => {
-	const n = e.fields ?? [], s = i(e.records, n.length);
-	if (!n.some(j)) return s;
-	const r = i(e.items, n.length), o = e.recordCount ?? 0, a = s.slice();
+	const n = e.fields ?? [], s = j(e.records, n.length);
+	if (!n.some(F)) return s;
+	const r = j(e.items, n.length), o = e.recordCount ?? 0, a = s.slice();
 	for (let e = 0; e < n.length; e++) {
 		const l = n[e];
-		if (!j(l)) continue;
+		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, g(u[e]), t) : i.discrete?.[e] ?? null;
+			const n = i.range ? ee(i.range, i.items.length, S(u[e]), t) : i.discrete?.[e] ?? null;
 			c[e] = n ?? -1;
 		}
 		const f = new Array(o);
@@ -82,35 +82,35 @@ var X = [
 	}
 	return a;
 }, ne = (e) => String(Number(e.toPrecision(12))), se = (e, t) => {
-	const n = r(e, t, !0);
-	return n ? `${n.month}/${n.day}/${n.year}` : String(e);
-}, re = (e, t, n) => {
-	const s = e.range;
+	const s = n(e, t, !0);
+	return s ? `${s.month}/${s.day}/${s.year}` : String(e);
+}, re = (e, t, s) => {
+	const r = e.range;
 	let o = 1 / 0, a = -1 / 0;
 	for (const e of t) {
 		if ("number" != typeof e) return null;
 		e < o && (o = e), e > a && (a = e);
 	}
 	if (0 === t.length) return e;
-	const l = { ...s };
-	s.fixedStart || (l.start = o), s.fixedEnd || (l.end = "numbers" !== s.by && Number.isInteger(a) ? a + 1 : a);
+	const l = { ...r };
+	r.fixedStart || (l.start = o), r.fixedEnd || (l.end = "numbers" !== r.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 { start: s, end: r } = e, o = e.interval ?? 1, a = se(r, t), l = (e, t) => Array.from({ length: e }, (e, n) => t(n));
 		switch (e.by) {
 			case "numbers": {
-				const e = Math.max(1, Math.ceil(Number(((s - n) / o).toPrecision(12)))), t = Number.isInteger(Number(((s - n) / o).toPrecision(12))), r = Number.isInteger(n) && Number.isInteger(o);
+				const e = Math.max(1, Math.ceil(Number(((r - s) / o).toPrecision(12)))), t = Number.isInteger(Number(((r - s) / o).toPrecision(12))), n = Number.isInteger(s) && 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;
+						const l = s + a * o, i = a === e - 1 && t ? r : n ? l + o - 1 : l + o;
 						return `${ne(l)}-${ne(i)}`;
 					}),
-					endText: ne(t ? s : n + e * o)
+					endText: ne(t ? r : s + e * o)
 				};
 			}
 			case "days":
 				if (1 === o) {
 					const e = [];
-					return Y.forEach((t, n) => {
+					return Z.forEach((t, n) => {
 						for (let s = 1; s <= t; s++) e.push(`${s}-${X[n]}`);
 					}), {
 						inner: e,
@@ -118,9 +118,9 @@ var X = [
 					};
 				}
 				return {
-					inner: l(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)}`;
+					inner: l(Math.max(1, Math.ceil((r - s) / o)), (e) => {
+						const n = s + e * o;
+						return `${se(n, t)} - ${se(Math.min(n + o - 1, r), t)}`;
 					}),
 					endText: a
 				};
@@ -138,9 +138,9 @@ var X = [
 				endText: a
 			};
 			case "years": {
-				const e = r(n, t)?.year ?? 0;
+				const e = n(s, t)?.year ?? 0;
 				return {
-					inner: l((r(s, t)?.year ?? e) - e + 1, (t) => String(e + t)),
+					inner: l((n(r, t)?.year ?? e) - e + 1, (t) => String(e + t)),
 					endText: a
 				};
 			}
@@ -153,7 +153,7 @@ var X = [
 				endText: a
 			};
 		}
-	})(l, n), u = "numbers" === l.by ? ne(l.start) : se(l.start, n);
+	})(l, s), u = "numbers" === l.by ? ne(l.start) : se(l.start, s);
 	return {
 		...e,
 		range: l,
@@ -231,10 +231,10 @@ var X = [
 		if (t.includes(e)) return !1;
 		const i = [];
 		oe(n[e].formula, (e) => {
-			const t = n.findIndex((t) => S(t.name, e));
+			const t = n.findIndex((t) => O(t.name, e));
 			return t >= 0 && i.push(t), t >= 0 ? "" : null;
 		});
-		for (const r of i) if (w(n[r])) {
+		for (const r of i) if (b(n[r])) {
 			if (!l(r, [...t, e])) return !1;
 		} else s.includes(r) || s.push(r);
 		return o.set(e, r.length), a.set(e, n[e].formula), r.push({
@@ -242,7 +242,7 @@ var X = [
 			expression: ""
 		}), !0;
 	}, i = [];
-	for (const [t, s] of (e.dataFields ?? []).entries()) if (w(n[s.field])) {
+	for (const [t, s] of (e.dataFields ?? []).entries()) if (b(n[s.field])) {
 		if (!l(s.field, [])) return null;
 		i.push({
 			data: t,
@@ -251,8 +251,8 @@ var X = [
 	}
 	const d = (e, t) => {
 		if (null !== t) return null;
-		const r = n.findIndex((t) => S(t.name, e));
-		return r >= 0 ? ae(w(n[a = r]) ? s.length + o.get(a) : s.indexOf(a)) : null;
+		const r = n.findIndex((t) => O(t.name, e));
+		return r >= 0 ? ae(b(n[a = r]) ? s.length + o.get(a) : s.indexOf(a)) : null;
 		var a;
 	};
 	for (const e of r) {
@@ -343,75 +343,75 @@ var X = [
 	percent: 13,
 	percentDiff: 14
 }, Ie = (e, t, n, s) => {
-	const r = p.peek(), o = e.fields, a = t.fields;
+	const r = $.peek(), o = e.fields, a = t.fields;
 	if (!r || !o || !a || o.length !== a.length) return null;
-	if (A(e)) return {
+	if (f(e)) return {
 		cells: [],
-		...V,
+		...A,
 		rowPageCount: 0,
 		columnPageCount: 0,
-		header: O(e),
+		header: v(e),
 		rowLines: [],
 		columnLines: [],
 		viewValues: [],
 		firstKey: null,
 		...s?.roles ? { roles: /* @__PURE__ */ new Map() } : {}
 	};
-	const l = L(e, a), i = l ? s?.filters : null;
+	const l = d(e, a), i = l ? s?.filters : null;
 	if (l && !i) return null;
-	const u = o.some((e) => e.items?.some((e) => e.calculated));
-	if (u && !i?.calculatedRecords) return null;
-	const c = de(e, t);
-	if (!c || c.measures.length > 0 && !i?.fieldValues) return null;
+	const c = o.some((e) => e.items?.some((e) => e.calculated));
+	if (c && !i?.calculatedRecords) return null;
+	const m = de(e, t);
+	if (!m || m.measures.length > 0 && !i?.fieldValues) return null;
 	if ((e.dataFields ?? []).some((e) => void 0 === ye[e.showDataAs ?? "normal"] || void 0 === pe[e.subtotal ?? "sum"])) return null;
-	const f = xe(e, t, n, i?.calculatedRecords, c.operands);
-	if (!f) return null;
-	const { items: m, records: h, values: g, n: w } = f, v = (e) => !!e && (!e.noRecords || j(e)), F = e.form ?? "compact", b = (e) => {
+	const p = xe(e, t, n, i?.calculatedRecords, m.operands);
+	if (!p) return null;
+	const { items: h, records: g, values: w, n: b } = p, y = (e) => !!e && (!e.noRecords || F(e)), I = e.form ?? "compact", x = (e) => {
 		const t = [];
 		for (const n of e ?? []) {
 			if (n === ce) {
 				t.push({
 					field: n,
-					form: F
+					form: I
 				});
 				continue;
 			}
 			const e = o[n], s = e?.subtotals;
-			if (!e || !v(a[n])) return null;
-			if (u && s && s.some((e) => "default" !== e)) return null;
+			if (!e || !y(a[n])) return null;
+			if (c && s && s.some((e) => "default" !== e)) return null;
 			t.push({
 				field: n,
 				form: e.form ?? "compact"
 			});
 		}
 		return t;
-	}, y = b(e.rowFields), I = b(e.columnFields), x = e.pageFields ?? [];
-	if (!y || !I || x.some((e) => !v(a[e.field]))) return null;
-	const C = d(e, s?.slicerFields);
-	return C.pageFields?.some((e) => !v(a[e.field])) ? null : Te(e, t, m, y, I, Se(r, C, m, h, g, y, I, w, i?.keep, i?.records, c.operands.length, i?.fieldValues, !0), n, !0 === s?.roles, "columns" === s?.cellOrder);
+	}, C = x(e.rowFields), E = x(e.columnFields), P = e.pageFields ?? [];
+	if (!C || !E || P.some((e) => !y(a[e.field]))) return null;
+	const S = u(e, s?.slicerFields);
+	return S.pageFields?.some((e) => !y(a[e.field])) ? null : Te(e, t, h, C, E, Pe(r, S, h, g, w, C, E, b, i?.keep, i?.records, m.operands.length, i?.fieldValues, !0), n, !0 === s?.roles, "columns" === s?.cellOrder);
 }, xe = (e, t, n, s, r = []) => {
-	const o = t.fields?.length ?? 0, a = u(t);
+	const o = t.fields?.length ?? 0, a = p(t);
 	if (!t.records) return null;
 	const l = te(t, n.isDate1904());
 	if (!l) return null;
-	const d = !0 === t.fields?.some(j), c = d ? i(t.items, o) : a, f = d ? i(t.records, o) : l, m = t.recordCount ?? 0, p = s?.count ?? 0, h = m + p, w = (e, n) => {
-		const s = !t.fields?.[e]?.noRecords, r = s ? f[e] : l[e] ?? [], o = s ? c[e] : a[e], i = new Array(h);
-		for (let e = 0; e < m; e++) i[e] = g(o[r[e]]);
-		for (let e = 0; e < p; e++) i[m + e] = n?.[e] ?? null;
+	const i = !0 === t.fields?.some(F), d = i ? j(t.items, o) : a, u = i ? j(t.records, o) : l, c = t.recordCount ?? 0, f = s?.count ?? 0, m = c + f, h = (e, n) => {
+		const s = !t.fields?.[e]?.noRecords, r = s ? u[e] : l[e] ?? [], o = s ? d[e] : a[e], i = new Array(m);
+		for (let e = 0; e < c; e++) i[e] = S(o[r[e]]);
+		for (let e = 0; e < f; e++) i[c + e] = n?.[e] ?? null;
 		return i;
-	}, v = [...(e.dataFields ?? []).map((e, t) => w(e.field, s?.values[t])), ...r.map((e) => w(e))];
+	}, g = [...(e.dataFields ?? []).map((e, t) => h(e.field, s?.values[t])), ...r.map((e) => h(e))];
 	return {
 		items: a,
 		records: s ? l.map((e, t) => e.concat(s.ids[t] ?? [])) : l,
-		values: v,
-		n: h
+		values: g,
+		n: m
 	};
 }, Ae = async (e, t, n, s, r, o, a, l, i) => {
-	const d = p.peek(), u = e.dataFields?.[r];
+	const d = $.peek(), u = e.dataFields?.[r];
 	if (!d || !e.fields || !u || void 0 === pe[u.subtotal ?? "sum"]) return null;
 	const c = [e.rowFields, e.columnFields].map((e) => (e ?? []).filter((e) => e !== ce)), f = c.findIndex((e) => e.includes(s)), m = c[f];
 	if (!m) return null;
-	const h = m.slice(0, m.indexOf(s)), g = e.fields.map((e) => {
+	const p = m.slice(0, m.indexOf(s)), h = e.fields.map((e) => {
 		const { blankRowAfter: t, showItemsWithNoData: n, sort: s, ...r } = e;
 		return {
 			...r,
@@ -421,46 +421,46 @@ var X = [
 				return n;
 			})
 		};
-	}), { columnGrandTotals: w, ...v } = e, { showDataAs: F, ...b } = u, y = {
-		...v,
-		fields: g,
-		rowFields: [...h, s],
+	}), { columnGrandTotals: g, ...w } = e, { showDataAs: v, ...F } = u, b = {
+		...w,
+		fields: h,
+		rowFields: [...p, s],
 		columnFields: [],
-		dataFields: [b],
+		dataFields: [F],
 		rowGrandTotals: !1
-	}, I = l ? {
+	}, y = l ? {
 		...l,
 		values: [l.values[r] ?? []]
-	} : l, x = de(y, t);
-	if (!x || x.measures.length > 0 && !i) return null;
-	const A = xe(y, t, n, I, x.operands);
-	if (!A) return null;
-	const { items: C, records: E, values: S, n: P } = A, k = y.rowFields.map((e) => ({
+	} : l, I = de(b, t);
+	if (!I || I.measures.length > 0 && !i) return null;
+	const x = xe(b, t, n, y, I.operands);
+	if (!x) return null;
+	const { items: A, records: C, values: E, n: P } = x, S = b.rowFields.map((e) => ({
 		field: e,
 		form: "compact"
 	}));
-	let M;
+	let k;
 	if (a) {
 		const e = 0 === f ? 1 : 2;
-		M = new Uint8Array(P);
+		k = new Uint8Array(P);
 		for (let t = 0; t < P; t++) {
 			const n = a[t];
-			M[t] = (n & e ? 1 : 0) | (3 === n ? 2 : 0);
+			k[t] = (n & e ? 1 : 0) | (3 === n ? 2 : 0);
 		}
 	}
-	const T = x.measures.length > 0 ? await Ee(d, x, y, C, E, S, k, [], P, o, M, i) : void 0, R = Se(d, y, C, E, S, k, [], P, o, M, x.operands.length, T), O = (t, n) => e.fields[t].items?.[n]?.item ?? n, N = /* @__PURE__ */ new Map(), $ = R.columns.length;
-	return R.rows.forEach((e, t) => {
-		if (0 !== e.kind || e.path.length !== h.length + 1) return;
-		const n = h.map((t, n) => O(t, e.path[n])).join(",");
-		let r = N.get(n);
-		r || N.set(n, r = {
+	const M = I.measures.length > 0 ? await Ee(d, I, b, A, C, E, S, [], P, o, k, i) : void 0, T = Pe(d, b, A, C, E, S, [], P, o, k, I.operands.length, M), R = (t, n) => e.fields[t].items?.[n]?.item ?? n, O = /* @__PURE__ */ new Map(), N = T.columns.length;
+	return T.rows.forEach((e, t) => {
+		if (0 !== e.kind || e.path.length !== p.length + 1) return;
+		const n = p.map((t, n) => R(t, e.path[n])).join(",");
+		let r = O.get(n);
+		r || O.set(n, r = {
 			ids: [],
 			totals: []
-		}), r.ids.push(O(s, e.path[h.length])), r.totals.push(R.values[t * $]);
+		}), r.ids.push(R(s, e.path[p.length])), r.totals.push(T.values[t * N]);
 	}), {
-		outer: h,
-		groups: N,
-		records: E
+		outer: p,
+		groups: O,
+		records: C
 	};
 }, Ce = (e, t, n) => {
 	const s = new Uint32Array(t).fill(fe), r = new Uint8Array(t), o = e.items;
@@ -474,7 +474,7 @@ var X = [
 		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);
+	const { request: m, errors: p } = Se(e, n, s, r, o, l, i, d, u, c, t.operands.length);
 	let h = 0;
 	const g = [];
 	try {
@@ -517,8 +517,8 @@ var X = [
 		}
 		return l;
 	})(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);
+}, Pe = (e, t, n, s, r, o, l, i, d, u, c = 0, f, m = !1) => {
+	const { request: p, errors: h } = Se(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);
 	try {
 		const n = ke(v.row_lines(), v.row_stride()), s = ke(v.column_lines(), v.column_stride()), r = v.states(), a = v.values();
 		try {
@@ -537,7 +537,7 @@ var X = [
 	} finally {
 		v.free(), p.free();
 	}
-}, Pe = (e, t, n, s, r, o, a, l, i, d, u = 0, c, f = !1) => {
+}, Se = (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) => {
 		for (const { field: r, form: o } of s) {
 			if (r === ce) {
@@ -608,7 +608,7 @@ var X = [
 			ok: !0,
 			numeric: !0
 		}, o = r[t];
-		for (let e = 0; e < l; e++) Z(n, e, o[e], A, s);
+		for (let e = 0; e < l; e++) Y(n, e, o[e], A, s);
 	});
 	for (const { column: e, ptr: t } of y) {
 		const n = e.length, s = {
@@ -619,7 +619,7 @@ var X = [
 			ok: !0,
 			numeric: !0
 		};
-		for (let t = 0; t < n; t++) Z(s, t, e[t], A, r);
+		for (let t = 0; t < n; t++) Y(s, t, e[t], A, r);
 	}
 	return {
 		request: p,
@@ -649,51 +649,51 @@ var X = [
 		} 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, s, r, o, l, i, d, u) => {
-	const c = e.fields, f = t.fields, m = e.dataFields ?? [], p = (t) => t === ce ? e.valuesCaption ?? "Values" : c[t].name ?? f[t].name, h = (e, t) => {
-		if (e === ce) return m[t]?.name ?? "";
-		const n = c[e].items?.[t];
-		if (void 0 !== n?.name) return n.name;
-		const r = g(s[e][n?.item ?? t]);
-		return null === r ? D : r;
-	}, w = (e, t) => {
-		const s = h(e, t);
-		if ("number" == typeof s) {
-			const o = c[e].items?.[t]?.item ?? t, a = void 0 === (c[e].numberFormat ?? f[e].numberFormat) && C(f[e], o);
-			return n(i, a ? F(T(f[e], o), i) : F(c[r = e].numberFormat ?? f[r].numberFormat, i), s);
+}, Te = (e, t, n, s, r, l, i, d, u) => {
+	const c = e.fields, f = t.fields, p = e.dataFields ?? [], h = (t) => t === ce ? e.valuesCaption ?? "Values" : c[t].name ?? f[t].name, g = (e, t) => {
+		if (e === ce) return p[t]?.name ?? "";
+		const s = c[e].items?.[t];
+		if (void 0 !== s?.name) return s.name;
+		const r = S(n[e][s?.item ?? t]);
+		return null === r ? w : r;
+	}, F = (e, t) => {
+		const n = g(e, t);
+		if ("number" == typeof n) {
+			const r = c[e].items?.[t]?.item ?? t, a = void 0 === (c[e].numberFormat ?? f[e].numberFormat) && E(f[e], r);
+			return o(i, a ? N(I(f[e], r), i) : N(c[s = e].numberFormat ?? f[s].numberFormat, i), n);
 		}
-		var r;
-		return a.isError(s) ? s.getLabel() : "boolean" == typeof s ? s ? "TRUE" : "FALSE" : String(s);
+		var s;
+		return a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
 	}, b = (e) => {
-		if (void 0 !== e.item) return h(e.field, e.item);
+		if (void 0 !== e.item) return g(e.field, e.item);
 		const t = c[e.field].items ?? [];
 		if (!t.some((e) => e.hidden)) return "(All)";
-		const n = t.flatMap((e, t) => I(e) && !e.hidden ? [t] : []);
-		return 1 === n.length ? h(e.field, n[0]) : "(Multiple Items)";
-	}, x = e.grandTotalCaption ?? "Grand Total", A = d ? /* @__PURE__ */ new Map() : null, E = (e, t) => e === ce ? {
+		const n = t.flatMap((e, t) => H(e) && !e.hidden ? [t] : []);
+		return 1 === n.length ? g(e.field, n[0]) : "(Multiple Items)";
+	}, y = e.grandTotalCaption ?? "Grand Total", x = d ? /* @__PURE__ */ new Map() : null, A = (e, t) => e === ce ? {
 		kind: "dataCaption",
 		data: t
 	} : {
 		kind: "item",
 		field: e,
 		rank: t
-	}, S = (e) => e === ce ? null : {
+	}, C = (e) => e === ce ? null : {
 		kind: "fieldCaption",
 		field: e
-	}, P = (e, t) => 2 === e.kind && t === x ? { kind: "grandTotal" } : null, k = 0 === r.length && 0 === o.length && 0 === m.length, M = k ? {
+	}, P = (e, t) => 2 === e.kind && t === y ? { kind: "grandTotal" } : null, k = 0 === s.length && 0 === r.length && 0 === p.length, M = k ? {
 		firstHeaderRow: 0,
 		firstDataRow: 0,
 		firstDataCol: 0
-	} : O(e), N = k ? [] : Me(l.rows, l.functions), $ = k ? [] : Me(l.columns, l.functions), _ = y({
+	} : v(e), T = k ? [] : Me(l.rows, l.functions), R = k ? [] : Me(l.columns, l.functions), O = z({
 		...e,
 		header: M,
-		rowLines: N,
-		columnLines: $
-	}), L = l.columns.length, V = (e) => "row" === e ? r : o, U = (t) => {
+		rowLines: T,
+		columnLines: R
+	}), L = l.columns.length, $ = (e) => "row" === e ? s : r, _ = (t) => {
 		switch (t.kind) {
 			case "pageCaption": {
 				const n = e.pageFields[t.page].field;
-				return [p(n), {
+				return [h(n), {
 					kind: "fieldCaption",
 					field: n
 				}];
@@ -705,31 +705,31 @@ var X = [
 					page: t.page
 				}];
 			}
-			case "dataCaption": return [m[t.data]?.name ?? null, {
+			case "dataCaption": return [p[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 "rowHeader": return [s.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 = V(t.axis)[t.level].field;
-				return [p(e), S(e)];
+				const e = $(t.axis)[t.level].field;
+				return [h(e), C(e)];
 			}
 			case "label": {
-				const e = V(t.axis)[t.level].field, n = t.line.path[t.level];
-				return [h(e, n), E(e, n)];
+				const e = $(t.axis)[t.level].field, n = t.line.path[t.level];
+				return [g(e, n), A(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 ? m[t.data]?.name ?? "" : "";
-					if (2 === t.kind) return n ? `Total ${s}` : x;
-					const r = t.path.length - 1, o = e[r].field, a = w(o, t.path[r]);
+					const n = e.findIndex((e) => e.field === ce) >= t.path.length && null !== t.data, s = n ? p[t.data]?.name ?? "" : "";
+					if (2 === t.kind) return n ? `Total ${s}` : y;
+					const r = t.path.length - 1, o = e[r].field, a = F(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 ${p(m[t.data].field)}` : `${a} ${e}`;
+						return (n || t.across) && null !== t.data ? `${a} ${e} of ${h(p[t.data].field)}` : `${a} ${e}`;
 					}
 					return c[o]?.subtotalCaption ?? (n ? `${a} ${s}` : `${a} Total`);
-				})(V(t.axis), e);
+				})($(t.axis), e);
 				return [n, P(e, n)];
 			}
 			case "value": {
@@ -744,25 +744,25 @@ var X = [
 				})(e.emptyCaption)), [r, null];
 			}
 		}
-	}, H = new v.Builder(), z = _.top, B = _.pages.reduce((e, t) => Math.max(e, t.column + 2), 0), j = (e, t) => {
-		const n = G(_, e, t);
+	}, V = new B.Builder(), U = O.top, q = O.pages.reduce((e, t) => Math.max(e, t.column + 2), 0), G = (e, t) => {
+		const n = m(O, e, t);
 		if (!n) return;
-		const [s, r] = U(n);
+		const [s, r] = _(n);
 		((e, t, n) => {
-			A && n && A.set(e + "," + t, n);
-		})(e - z, t, r), null !== s && (u ? H.pushAt(t, e - z, s) : H.pushAt(e - z, t, s));
+			x && n && x.set(e + "," + t, n);
+		})(e - U, t, r), null !== s && (u ? V.pushAt(t, e - U, s) : V.pushAt(e - U, t, s));
 	};
 	if (u) {
-		const e = Math.max(B, _.columns.length);
-		for (let t = 0; t < e; t++) for (let e = 0; e < _.rows.length; e++) t < (e < z ? B : _.columns.length) && j(e, t);
-	} else for (let e = 0; e < _.rows.length; e++) {
-		const t = e < z ? B : _.columns.length;
-		for (let n = 0; n < t; n++) j(e, n);
+		const e = Math.max(q, O.columns.length);
+		for (let t = 0; t < e; t++) for (let e = 0; e < O.rows.length; e++) t < (e < U ? q : O.columns.length) && G(e, t);
+	} else for (let e = 0; e < O.rows.length; e++) {
+		const t = e < U ? q : O.columns.length;
+		for (let n = 0; n < t; n++) G(e, n);
 	}
 	if (k) {
-		const t = R(e);
+		const t = D(e);
 		return {
-			cells: H.build()?.tuples ?? [],
+			cells: V.build()?.tuples ?? [],
 			rows: 1,
 			columns: 1,
 			rowPageCount: t.rows,
@@ -772,55 +772,55 @@ var X = [
 			columnLines: [],
 			viewValues: [],
 			firstKey: null,
-			...A ? { roles: A } : {}
+			...x ? { roles: x } : {}
 		};
 	}
-	const q = (e, t) => {
+	const j = (e, t) => {
 		const n = [];
 		return e.forEach((e, s) => {
 			e.field !== ce && n.push(s < t.path.length ? t.path[s] : -1);
 		}), n;
-	}, K = (e, t) => Q(e.data ?? t.data ?? 0, [...q(r, e), ...q(o, t)]), [J] = l.rows, [W] = l.columns, Z = J && W && 3 !== J.kind && 3 !== W.kind ? K(J, W) : null, X = [], Y = (e) => 1 === e.kind && null !== e.function;
+	}, K = (e, t) => Q(e.data ?? t.data ?? 0, [...j(s, e), ...j(r, t)]), [J] = l.rows, [W] = l.columns, Y = J && W && 3 !== J.kind && 3 !== W.kind ? K(J, W) : null, X = [], Z = (e) => 1 === e.kind && null !== e.function;
 	l.rows.forEach((t, n) => {
-		3 === t.kind || Y(t) || (q(r, t), l.columns.forEach((s, r) => {
+		3 === t.kind || Z(t) || (j(s, t), l.columns.forEach((s, r) => {
 			const o = l.states[n * L + r];
-			if (3 === s.kind || Y(s) || 0 !== o && 1 !== o) return;
+			if (3 === s.kind || Z(s) || 0 !== o && 1 !== o) return;
 			let i = 0 === o ? l.values[n * L + r] : 0;
 			e.showError && a.isError(i) && (i = e.errorCaption || 0), X.push([K(t, s), i]);
 		}));
 	});
-	const ee = R(e);
+	const ee = D(e);
 	return {
-		cells: H.build()?.tuples ?? [],
-		rows: _.rows.length - z,
-		columns: _.columns.length,
+		cells: V.build()?.tuples ?? [],
+		rows: O.rows.length - U,
+		columns: O.columns.length,
 		rowPageCount: ee.rows,
 		columnPageCount: ee.columns,
 		header: M,
-		rowLines: N,
-		columnLines: $,
+		rowLines: T,
+		columnLines: R,
 		viewValues: X,
-		firstKey: Z,
-		...A ? { roles: A } : {}
+		firstKey: Y,
+		...x ? { roles: x } : {}
 	};
-}, Re = (e, t, s, r, o = !1, l, i) => {
-	const d = Ie(e, t, r, {
+}, Re = (e, t, n, s, r = !1, l, i) => {
+	const d = Ie(e, t, s, {
 		filters: l,
 		slicerFields: i
 	});
 	if (!d) return null;
-	const c = d.rowPageCount > 0 ? d.rowPageCount + 1 : 0, f = d.rowPageCount > 0 ? 3 * d.columnPageCount - 1 : 0, { rowStart: m, colStart: p } = s;
-	if (m - c < 0) return null;
+	const u = d.rowPageCount > 0 ? d.rowPageCount + 1 : 0, c = d.rowPageCount > 0 ? 3 * d.columnPageCount - 1 : 0, { rowStart: f, colStart: m } = n;
+	if (f - u < 0) return null;
 	const h = {
-		rowStart: m - c,
-		colStart: p,
-		rowEnd: m + d.rows - 1,
-		colEnd: p + Math.max(d.columns, f) - 1
-	}, w = e.fields, v = t.fields, b = u(t), y = (e, t) => {
-		const s = w[e], o = s.numberFormat ?? v[e].numberFormat, l = F(o, r), i = j(v[e]), d = b[e], u = (s.items ?? []).filter((e) => void 0 !== e.item && void 0 === e.type), c = u.length > 0 ? u : d.map((e, t) => ({ item: t })), f = c.map((t) => {
-			const s = g(d[t.item]), u = C(v[e], t.item), c = null === s ? "(blank)" : "number" == typeof s ? n(r, u ? (f = t.item, void 0 === o ? F(T(v[e], f), r) : l) : l, s) : a.isError(s) ? s.getLabel() : "boolean" == typeof s ? s ? "TRUE" : "FALSE" : String(s);
+		rowStart: f - u,
+		colStart: m,
+		rowEnd: f + d.rows - 1,
+		colEnd: m + Math.max(d.columns, c) - 1
+	}, g = e.fields, w = t.fields, v = p(t), b = (e, t) => {
+		const n = g[e], r = n.numberFormat ?? w[e].numberFormat, l = N(r, s), 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 })), f = c.map((t) => {
+			const n = S(d[t.item]), u = E(w[e], t.item), c = null === n ? "(blank)" : "number" == typeof n ? o(s, u ? (f = t.item, void 0 === r ? N(I(w[e], f), s) : l) : l, n) : a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
 			var f;
-			const m = i && u ? c : s;
+			const m = i && u ? c : n;
 			return void 0 !== t.name ? {
 				value: m,
 				text: c,
@@ -830,34 +830,34 @@ var X = [
 				text: c
 			};
 		}), m = {
-			name: s.name ?? v[e].name,
+			name: n.name ?? w[e].name,
 			items: f
 		};
 		if (t) {
-			const e = void 0 !== t.item ? (s.items ?? [])[t.item]?.item : void 0;
+			const e = void 0 !== t.item ? (n.items ?? [])[t.item]?.item : void 0;
 			m.page = void 0 !== e ? c.findIndex((t) => t.item === e) : -1;
 		}
 		return m;
-	}, I = (e) => (e ?? []).filter((e) => -2 !== e);
+	}, y = (e) => (e ?? []).filter((e) => -2 !== e);
 	return {
 		view: {
 			range: h,
 			dataFields: (e.dataFields ?? []).map((e) => ({
 				name: e.name,
-				sourceName: v[e.field].name
+				sourceName: w[e.field].name
 			})),
 			fields: [
-				...I(e.rowFields).map((e) => y(e)),
-				...I(e.columnFields).map((e) => y(e)),
-				...(e.pageFields ?? []).map((e) => y(e.field, e))
+				...y(e.rowFields).map((e) => b(e)),
+				...y(e.columnFields).map((e) => b(e)),
+				...(e.pageFields ?? []).map((e) => b(e.field, e))
 			],
 			values: d.viewValues,
 			block: {
 				anchor: {
-					row: m,
-					column: p
+					row: f,
+					column: m
 				},
-				...o ? { blocked: !0 } : {},
+				...r ? { blocked: !0 } : {},
 				...null !== d.firstKey ? { first: d.firstKey } : {}
 			}
 		},
@@ -866,85 +866,85 @@ var X = [
 			columns: d.columns
 		}
 	};
-}, Oe = async (e, t, s, r) => {
-	const o = /* @__PURE__ */ new Map(), l = (e.filters ?? []).filter((t) => k(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) => w(t.fields?.[e.field]));
-	if (0 === l.length && !i && !d) return { keep: o };
-	const c = u(t);
-	for (const n of l.filter(k)) {
-		const a = n.field, l = c[a];
+}, Oe = async (e, t, n, s) => {
+	const r = /* @__PURE__ */ new Map(), l = (e.filters ?? []).filter((t) => R(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) => b(t.fields?.[e.field]));
+	if (0 === l.length && !i && !d) return { keep: r };
+	const u = p(t);
+	for (const o of l.filter(R)) {
+		const a = o.field, l = u[a];
 		if (!l) continue;
-		const i = P(n.condition) ? _e(e, t, l, a, s) : null, d = new Array(l.length);
-		for (let e = 0; e < l.length; e++) d[e] = i ? i[e] : g(l[e]);
-		const u = await $e(n.condition, d, s, 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 i = G(o.condition) ? $e(e, t, l, a, n) : null, d = new Array(l.length);
+		for (let e = 0; e < l.length; e++) d[e] = i ? i[e] : S(l[e]);
+		const c = await Le(o.condition, d, n, s), f = r.get(a);
+		if (f) for (let e = 0; e < c.length; e++) f[e] &= c[e];
+		else r.set(a, c);
 	}
-	const f = i && r ? await (async (e, t, s, r, o) => {
-		const l = t.fields ?? [], i = e.fields ?? [], d = l.flatMap((e, t) => e.calculatedItems?.length ? [t] : []), c = e.dataFields ?? [];
-		if (1 !== d.length || c.some((e) => w(l[e.field]) || !ue.has(e.subtotal ?? "sum"))) return null;
-		const f = d[0], m = l[f].calculatedItems, p = te(t, s.isDate1904());
-		if (!p) return null;
-		const h = u(t), v = u({
+	const f = i && s ? await (async (e, t, n, s, r) => {
+		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) => b(l[e.field]) || !ue.has(e.subtotal ?? "sum"))) return null;
+		const f = d[0], m = l[f].calculatedItems, h = te(t, n.isDate1904());
+		if (!h) return null;
+		const g = p(t), v = p({
 			...t,
 			fields: l.map(({ group: e, ...t }) => t)
-		}), b = (e.rowFields ?? []).filter((e) => e >= 0), y = (e.columnFields ?? []).filter((e) => e >= 0), I = b.includes(f) ? b : y.includes(f) ? y : null;
+		}), F = (e.rowFields ?? []).filter((e) => e >= 0), y = (e.columnFields ?? []).filter((e) => e >= 0), I = F.includes(f) ? F : y.includes(f) ? y : null;
 		if (!I) return null;
-		const x = I.slice(0, I.indexOf(f)), A = [...I.slice(I.indexOf(f) + 1), ...I === b ? y : b], E = [...x, ...A], P = t.recordCount ?? 0, k = (e, t) => {
+		const x = I.slice(0, I.indexOf(f)), A = [...I.slice(I.indexOf(f) + 1), ...I === F ? y : F], C = [...x, ...A], P = t.recordCount ?? 0, k = (e, t) => {
 			const n = i[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]);
+			return !(n && (!s || s.hidden) || r?.get(e) && 0 === r.get(e)[t]);
 		}, M = (e, t) => {
 			const n = i[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;
-		}, T = e.pageFields ?? [], R = F(l[f].numberFormat ?? 14, s), O = (e) => h[f].findIndex((t, r) => {
-			const o = g(t);
-			return "number" == typeof o && (l[f].dates || C(l[f], r)) ? S(n(s, R, o), e) : S(null === o ? D : U(o), e);
-		}), N = /* @__PURE__ */ new Map(), $ = new Map(m.map((e) => [e.item, e.formula])), _ = (e) => {
-			let t = N.get(e);
-			return void 0 === t && N.set(e, t = N.size), t;
+		}, T = e.pageFields ?? [], R = N(l[f].numberFormat ?? 14, n), L = (e) => g[f].findIndex((t, s) => {
+			const r = S(t);
+			return "number" == typeof r && (l[f].dates || E(l[f], s)) ? O(o(n, R, r), e) : O(null === r ? w : c(r), e);
+		}), $ = /* @__PURE__ */ new Map(), _ = new Map(m.map((e) => [e.item, e.formula])), D = (e) => {
+			let t = $.get(e);
+			return void 0 === t && $.set(e, t = $.size), t;
 		};
 		for (const e of m) if (null === oe(e.formula, (e, t) => {
-			if (null === t || !S(l[f].name, e)) return null;
-			const n = O(t);
-			return n < 0 ? null : ($.has(n) || _(n), "");
+			if (null === t || !O(l[f].name, e)) return null;
+			const n = L(t);
+			return n < 0 ? null : (_.has(n) || D(n), "");
 		})) return null;
-		const L = /* @__PURE__ */ new Map(), V = /* @__PURE__ */ new Map(), H = c.map((e) => ({
-			column: p[e.field],
+		const V = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), H = u.map((e) => ({
+			column: h[e.field],
 			values: v[e.field],
 			fold: e.subtotal ?? "sum"
-		})), z = N.size;
+		})), B = $.size;
 		for (let e = 0; e < P; e++) {
-			if (!T.every((t) => M(t, p[t.field][e]))) continue;
-			if (!E.every((t) => k(t, p[t][e]))) continue;
+			if (!T.every((t) => M(t, h[t.field][e]))) continue;
+			if (!C.every((t) => k(t, h[t][e]))) continue;
 			let t = "";
-			for (const n of x) t += p[n][e] + ",";
-			V.has(t) || V.set(t, e);
-			const n = N.get(p[f][e]);
+			for (const n of x) t += h[n][e] + ",";
+			U.has(t) || U.set(t, e);
+			const n = $.get(h[f][e]);
 			if (void 0 === n) continue;
 			let s = t;
-			for (const t of A) s += p[t][e] + ",";
-			let r = L.get(s);
+			for (const t of A) s += h[t][e] + ",";
+			let r = V.get(s);
 			r || (r = {
-				sums: c.map(() => new Array(z).fill(0)),
-				errors: c.map(() => new Array(z).fill(void 0))
-			}, L.set(s, r));
+				sums: u.map(() => new Array(B).fill(0)),
+				errors: u.map(() => new Array(B).fill(void 0))
+			}, V.set(s, r));
 			const { sums: o, errors: l } = r;
 			H.forEach(({ column: t, values: s, fold: r }, i) => {
-				const d = g(s[t[e]]);
+				const d = S(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);
 			});
 		}
-		const B = A.map((e) => {
+		const q = A.map((e) => {
 			const t = i[e]?.items;
-			return t ? t.flatMap((t) => void 0 !== t.item && void 0 === t.type && !t.missing && k(e, t.item) ? [t.item] : []) : h[e].map((e, t) => t);
+			return t ? t.flatMap((t) => void 0 !== t.item && void 0 === t.type && !t.missing && k(e, t.item) ? [t.item] : []) : g[e].map((e, t) => t);
 		});
-		if (B.reduce((e, t) => e * t.length, V.size) > 5e5) return null;
-		const j = [];
-		for (const [e, t] of V) {
+		if (q.reduce((e, t) => e * t.length, U.size) > 5e5) return null;
+		const G = [];
+		for (const [e, t] of U) {
 			const n = (e, s, r) => {
-				if (e !== B.length) for (const t of B[e]) n(e + 1, [...s, t], r + t + ",");
-				else j.push({
+				if (e !== q.length) for (const t of q[e]) n(e + 1, [...s, t], r + t + ",");
+				else G.push({
 					exemplar: t,
 					path: s,
 					key: r
@@ -952,45 +952,45 @@ var X = [
 			};
 			n(0, [], e);
 		}
-		const q = j.length;
-		if (0 === q) return {
+		const j = G.length;
+		if (0 === j) return {
 			count: 0,
 			ids: l.map(() => []),
-			values: c.map(() => [])
+			values: u.map(() => [])
 		};
-		const G = c.length * z, Q = (e, t) => e * z + t, K = (e, t) => G + e * m.length + t, J = [];
-		for (let e = 0; e < c.length; e++) for (let t = 0; t < z; t++) J.push(j.map(({ key: n }) => {
-			const s = L.get(n);
+		const z = u.length * B, Q = (e, t) => e * B + t, K = (e, t) => z + e * m.length + t, J = [];
+		for (let e = 0; e < u.length; e++) for (let t = 0; t < B; t++) J.push(G.map(({ key: n }) => {
+			const s = V.get(n);
 			return s ? s.errors[e][t] ?? s.sums[e][t] : 0;
 		}));
 		const W = [];
-		for (let e = 0; e < c.length; e++) for (let t = 0; t < m.length; t++) {
+		for (let e = 0; e < u.length; e++) for (let t = 0; t < m.length; t++) {
 			const n = oe(m[t].formula, (t, n) => {
 				if (null === n) return null;
-				const s = O(n), r = m.findIndex((e) => e.item === s);
-				return ae(r >= 0 ? K(e, r) : Q(e, N.get(s)));
+				const s = L(n), r = m.findIndex((e) => e.item === s);
+				return ae(r >= 0 ? K(e, r) : Q(e, $.get(s)));
 			});
 			if (null === n) return null;
 			W.push({
 				expression: n,
-				coords: le(K(e, t), q)
+				coords: le(K(e, t), j)
 			});
 		}
-		const Z = await r.evaluateBatch({
-			values: ie(J, q),
+		const Y = await s.evaluateBatch({
+			values: ie(J, j),
 			formulas: W
-		}), X = l.map(() => []), Y = c.map(() => []), ee = (e, t, n, s) => {
-			p.forEach((n, s) => {
+		}), X = l.map(() => []), Z = u.map(() => []), ee = (e, t, n, s) => {
+			h.forEach((n, s) => {
 				const r = A.indexOf(s);
 				X[s].push(s === f ? t : r >= 0 ? e.path[r] : n[e.exemplar] ?? 0);
-			}), Y.forEach((e, t) => {
+			}), Z.forEach((e, t) => {
 				e.push(t === n ? s : null);
 			});
 		};
-		return j.forEach((e, t) => {
+		return G.forEach((e, t) => {
 			m.forEach(({ item: n }, s) => {
-				c.forEach((r, o) => {
-					const a = Z[o * m.length + s].getValueAt(t, 0) ?? 0;
+				u.forEach((r, o) => {
+					const a = Y[o * m.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);
 				});
@@ -998,36 +998,36 @@ var X = [
 		}), {
 			count: X[0]?.length ?? 0,
 			ids: X,
-			values: Y
+			values: Z
 		};
-	})(e, t, s, r, o) : void 0, m = l.filter((e) => !k(e)).map((e, t) => ({
+	})(e, t, n, s, r) : void 0, m = l.filter((e) => !R(e)).map((e, t) => ({
 		filter: e,
 		index: t
 	})).sort((e, t) => (e.filter.evalOrder ?? -1) - (t.filter.evalOrder ?? -1) || e.index - t.index), h = (t.recordCount ?? 0) + (f?.count ?? 0);
-	let v;
-	const b = e.rowFields ?? [];
-	for (const { filter: n } of m) {
-		const a = await Ae(e, t, s, n.field, n.dataField, o, v, f, r);
+	let g;
+	const v = e.rowFields ?? [];
+	for (const { filter: o } of m) {
+		const a = await Ae(e, t, n, o.field, o.dataField, r, g, f, s);
 		if (!a) continue;
 		const l = /* @__PURE__ */ new Set();
 		for (const [e, t] of a.groups) {
-			const o = await $e(n.condition, t.totals, s, r);
+			const r = await Le(o.condition, t.totals, n, s);
 			t.ids.forEach((t, n) => {
-				o[n] || l.add(`${e}|${t}`);
+				r[n] || l.add(`${e}|${t}`);
 			});
 		}
 		if (0 === l.size) continue;
-		v ??= new Uint8Array(h).fill(3);
-		const i = a.outer.map((e) => a.records[e]), d = a.records[n.field], u = b.includes(n.field) ? 1 : 2;
+		g ??= new Uint8Array(h).fill(3);
+		const i = a.outer.map((e) => a.records[e]), d = a.records[o.field], u = v.includes(o.field) ? 1 : 2;
 		for (let e = 0; e < h; e++) {
-			if (!(v[e] & u)) continue;
+			if (!(g[e] & u)) continue;
 			let t = "";
 			for (let n = 0; n < i.length; n++) t += (n > 0 ? "," : "") + i[n][e];
-			l.has(`${t}|${d[e]}`) && (v[e] &= ~u);
+			l.has(`${t}|${d[e]}`) && (g[e] &= ~u);
 		}
 	}
-	const y = d && r ? await (async (e, t, n, s, r, o, a) => {
-		const l = p.peek(), i = de(e, t);
+	const F = d && s ? await (async (e, t, n, s, r, o, a) => {
+		const l = $.peek(), i = de(e, t);
 		if (!l || !i) return null;
 		const d = xe(e, t, n, a, i.operands);
 		if (!d) return null;
@@ -1036,19 +1036,19 @@ var X = [
 			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, s, r, o, v, f) : void 0;
+	})(e, t, n, s, r, g, f) : void 0;
 	return {
-		keep: o,
-		...v ? { records: v } : {},
+		keep: r,
+		...g ? { records: g } : {},
 		...f ? { calculatedRecords: f } : {},
-		...y ? { fieldValues: y } : {}
+		...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 && H(e.condition, t);
+		const n = e.condition && g(e.condition, t);
 		return n === e.condition ? e : (s = !0, {
 			...e,
 			condition: n
@@ -1058,13 +1058,13 @@ var X = [
 		...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 z();
+	const a = new h();
 	for (let e = 0; e < r; e++) null !== t[e] && a.setValueAt(e, 0, t[e]);
 	let l = !1;
-	return await E({
+	return await _({
 		conditions: [e],
 		runtime: n,
 		calculation: s ?? null,
@@ -1086,21 +1086,21 @@ var X = [
 			for (let n = 0; n < r; n++) null === t[n] && e(n, 0) && (o[n] = 1);
 		}
 	}), l || o.fill(1), o;
-}, _e = (e, t, s, r, o) => {
-	const l = e.fields?.[r], i = /* @__PURE__ */ new Map();
+}, $e = (e, t, n, s, r) => {
+	const l = e.fields?.[s], 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 = F(d, o), c = (e) => void 0 === d ? F(T(t.fields?.[r], e), o) : u, f = new Array(s.length);
-	for (let e = 0; e < s.length; e++) {
+	const d = l?.numberFormat ?? t.fields?.[s]?.numberFormat, u = N(d, r), c = (e) => void 0 === d ? N(I(t.fields?.[s], e), r) : u, f = new Array(n.length);
+	for (let e = 0; e < n.length; e++) {
 		const l = i.get(e);
 		if (void 0 !== l) {
 			f[e] = l;
 			continue;
 		}
-		const d = g(s[e]);
-		null === d ? f[e] = D : "number" == typeof d ? f[e] = n(o, C(t.fields?.[r], e) ? c(e) : u, d) : "boolean" == typeof d ? f[e] = d ? "TRUE" : "FALSE" : a.isError(d) ? f[e] = d.getLabel() : f[e] = String(d);
+		const d = S(n[e]);
+		null === d ? f[e] = w : "number" == typeof d ? f[e] = o(r, E(t.fields?.[s], e) ? c(e) : u, d) : "boolean" == typeof d ? f[e] = d ? "TRUE" : "FALSE" : a.isError(d) ? f[e] = d.getLabel() : f[e] = String(d);
 	}
 	return f;
-}, Le = (e) => {
+}, _e = (e) => {
 	const t = e.getCoords(), n = t.colEnd - t.colStart + 1, s = t.rowEnd - t.rowStart, r = e.getWorksheet(), o = r.getRange({
 		rowStart: t.rowStart,
 		rowEnd: t.rowStart,
@@ -1179,14 +1179,14 @@ var X = [
 		}
 	}
 	return !1;
-}, ze = (e) => null == e ? {
+}, Be = (e) => null == e ? {
 	t: "z",
 	v: 0
 } : a.isError(e) ? {
 	t: "e",
 	v: e.getCode()
-} : e, Be = (e, t) => (t && "number" == typeof e ? "date:" : "") + c(g(e)), je = (e, t, n, s = !1) => {
-	const r = e.fields ?? [], o = i(e.items, r.length), a = /\smissingItemsLimit="0"/.test(e.rest ?? ""), l = ((e) => {
+} : e, qe = (e, t) => (t && "number" == typeof e ? "date:" : "") + T(S(e)), Ge = (e, t, n, s = !1) => {
+	const r = e.fields ?? [], o = j(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 X = [
 			for (let e = 2; t.has(r.toLocaleLowerCase()); e++) r = `${s}${e}`;
 			return t.add(r.toLocaleLowerCase()), r;
 		});
-	})(t.columns.map((e) => e.header)), d = /* @__PURE__ */ new Map();
+	})(t.columns.map((e) => e.header)), i = /* @__PURE__ */ new Map();
 	r.forEach((e, t) => {
 		const n = e.name.toLocaleLowerCase();
-		e.noRecords || d.has(n) || d.set(n, t);
+		e.noRecords || i.has(n) || i.set(n, t);
 	});
-	const u = t.recordCount, c = r.map(() => -1), f = r.map((e, t) => o[t].map(() => -1)), m = [], p = [], h = [], v = [], F = [], b = [], y = [], I = (e, t, n) => {
-		v[t] = n.items, b[t] = n.items.length, y[t] = !0, f[e] = ((e, t) => {
+	const d = t.recordCount, u = r.map(() => -1), c = r.map((e, t) => o[t].map(() => -1)), f = [], m = [], p = [], h = [], g = [], w = [], v = [], y = (e, t, n) => {
+		h[t] = n.items, w[t] = n.items.length, v[t] = !0, c[e] = ((e, t) => {
 			const n = /* @__PURE__ */ new Map();
 			return t.forEach((e, t) => {
 				n.set(e, t);
@@ -1208,118 +1208,118 @@ var X = [
 		})(r[e].group.items, n.items);
 	};
 	t.columns.forEach((e, t) => {
-		const n = d.get(l[t].toLocaleLowerCase());
-		void 0 !== n && (d.delete(l[t].toLocaleLowerCase()), c[n] = t);
-		const i = new Int32Array(e.values.length).fill(-1), w = [], x = [], A = new Array(u);
-		for (let t = 0; t < u; t++) {
+		const n = i.get(l[t].toLocaleLowerCase());
+		void 0 !== n && (i.delete(l[t].toLocaleLowerCase()), u[n] = t);
+		const b = new Int32Array(e.values.length).fill(-1), I = [], x = [], A = new Array(d);
+		for (let t = 0; t < d; t++) {
 			const n = e.ids[t];
-			let s = i[n];
-			s < 0 && (s = i[n] = w.length, w.push(ze(e.values[n])), x.push(e.dates || !!e.dateIds?.has(n))), A[t] = s;
+			let s = b[n];
+			s < 0 && (s = b[n] = I.length, I.push(Be(e.values[n])), x.push(e.dates || !!e.dateIds?.has(n))), A[t] = s;
 		}
-		const E = (e) => void 0 !== n && (!!r[n].dates || C(r[n], e)), S = w.length, P = void 0 !== n ? !0 === r[n].inline : w.every((e) => "number" == typeof e || "object" == typeof e && "z" === e?.t), k = [];
-		if (void 0 !== n && P) {
+		const C = (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 = [];
+		if (void 0 !== n && k) {
 			const e = /* @__PURE__ */ new Map();
-			for (let t = 0; t < S; t++) e.set(Be(w[t], x[t]), t);
+			for (let t = 0; t < P; t++) e.set(qe(I[t], x[t]), t);
 			o[n].forEach((t, s) => {
-				f[n][s] = e.get(Be(t, E(s))) ?? -1;
+				c[n][s] = e.get(qe(t, C(s))) ?? -1;
 			});
 		} else if (void 0 !== n) {
 			const e = /* @__PURE__ */ new Map();
-			for (let t = 0; t < S; t++) e.set(Be(w[t], x[t]), t);
+			for (let t = 0; t < P; t++) e.set(qe(I[t], x[t]), t);
 			const t = new Set(r[n].calculatedItems?.map((e) => e.item));
 			o[n].forEach((s, r) => {
 				if (t.has(r)) return;
-				const o = Be(s, E(r));
+				const o = qe(s, C(r));
 				let l = e.get(o);
-				void 0 !== l || a || E(r) || (l = w.length, w.push(s), x.push(E(r)), k.push(l), e.set(o, l)), f[n][r] = l ?? -1;
+				void 0 !== l || a || C(r) || (l = I.length, I.push(s), x.push(C(r)), M.push(l), e.set(o, l)), c[n][r] = l ?? -1;
 			});
 		}
-		const M = { name: l[t] };
-		P && (M.inline = !0), void 0 !== e.numberFormat && (M.numberFormat = e.numberFormat);
-		const T = [];
-		let R = !1;
-		w.forEach((e, t) => {
-			"number" == typeof e && (x[t] ? T.push(t) : R = !0);
-		}), T.length > 0 && !R ? M.dates = !0 : T.length > 0 && (M.dateItems = T), F[t] = M.dateItems ? new Set(M.dateItems) : void 0, k.length > 0 && (M.unused = k);
-		const O = void 0 !== n ? r[n].rest : void 0;
-		O && (M.rest = O);
-		const N = void 0 !== n ? r[n].calculatedItems : void 0;
-		N?.length && (M.calculatedItems = N.map(({ item: e, formula: t }) => {
-			const s = w.length;
-			return w.push(o[n][e]), f[n][e] = s, {
+		const T = { name: l[t] };
+		k && (T.inline = !0), void 0 !== e.numberFormat && (T.numberFormat = e.numberFormat);
+		const R = [];
+		let O = !1;
+		I.forEach((e, t) => {
+			"number" == typeof e && (x[t] ? R.push(t) : O = !0);
+		}), R.length > 0 && !O ? T.dates = !0 : R.length > 0 && (T.dateItems = R), g[t] = T.dateItems ? new Set(T.dateItems) : void 0, M.length > 0 && (T.unused = M);
+		const N = void 0 !== n ? r[n].rest : void 0;
+		N && (T.rest = N);
+		const L = void 0 !== n ? r[n].calculatedItems : void 0;
+		L?.length && (T.calculatedItems = L.map(({ item: e, formula: t }) => {
+			const s = I.length;
+			return I.push(o[n][e]), c[n][e] = s, {
 				item: s,
 				formula: t
 			};
-		})), m.push(M), p.push([t, [[0, w]]]), h.push([t, [[0, A]]]), v.push(w), b.push(S), y.push(!1);
+		})), f.push(T), m.push([t, [[0, I]]]), p.push([t, [[0, A]]]), h.push(I), w.push(P), v.push(!1);
 		const $ = void 0 !== n ? r[n].group : void 0;
 		if ($?.range && $.base === n) {
-			const e = re($, w.slice(0, S).map(g), s);
-			e ? (M.group = {
+			const e = re($, I.slice(0, P).map(S), s);
+			e ? (T.group = {
 				...e,
 				base: t
-			}, I(n, t, e)) : f[n] = o[n].map(() => -1);
-		} else $ && !j(r[n]) && (M.group = $);
+			}, y(n, t, e)) : c[n] = o[n].map(() => -1);
+		} else $ && !F(r[n]) && (T.group = $);
 	}), r.forEach((e, t) => {
 		if (!e.noRecords) return;
-		if (w(e)) return c[t] = m.length, m.push(e), v.push([]), b.push(0), void y.push(!1);
+		if (b(e)) return u[t] = f.length, f.push(e), h.push([]), w.push(0), void v.push(!1);
 		const n = e.group;
 		if (!n) return;
-		const r = c[n.base];
+		const r = u[n.base];
 		if (void 0 === r || r < 0) return;
-		const o = v[r];
+		const o = h[r];
 		let a, l = [];
-		if (n.range) a = re(n, o.slice(0, b[r]).map(g), s);
+		if (n.range) a = re(n, o.slice(0, w[r]).map(S), s);
 		else {
-			const e = qe(n, f[n.base], o, m[r]);
+			const e = je(n, c[n.base], o, f[r]);
 			a = e.group, l = e.itemMap;
 		}
 		if (!a) return;
-		const i = m.length;
-		c[t] = i, m.push({
+		const i = f.length;
+		u[t] = i, f.push({
 			...e,
 			group: {
 				...a,
 				base: r
 			}
-		}), v.push(a.items), F[i] = a.dateItems ? new Set(a.dateItems) : void 0, b.push(a.items.length), y.push(!1), n.range ? I(t, i, a) : f[t] = l;
-	}), m.forEach((e, t) => {
+		}), h.push(a.items), g[i] = a.dateItems ? new Set(a.dateItems) : void 0, w.push(a.items.length), v.push(!1), n.range ? y(t, i, a) : c[t] = l;
+	}), f.forEach((e, t) => {
 		const n = e.group;
 		if (void 0 === n?.parent) return;
-		const s = c[n.parent], { parent: r, ...o } = n;
+		const s = u[n.parent], { parent: r, ...o } = n;
 		void 0 !== s && s >= 0 ? e.group = {
 			...n,
 			parent: s
-		} : j(e) ? e.group = o : delete e.group, e.group && !j(e) && (e.group = {
+		} : F(e) ? e.group = o : delete e.group, e.group && !F(e) && (e.group = {
 			...e.group,
 			base: t
 		});
 	});
-	const { cacheId: x, part: A, partFormats: E, fields: S, items: P, records: k, ...M } = e;
+	const { cacheId: I, part: x, partFormats: A, fields: C, items: P, records: k, ...M } = e;
 	return {
 		model: {
 			...M,
 			source: n ?? e.source,
-			fields: m,
-			items: p,
-			records: h,
-			recordCount: u
+			fields: f,
+			items: m,
+			records: p,
+			recordCount: d
 		},
 		remap: {
-			fields: c,
-			items: f,
-			newItems: v,
-			usedCounts: b,
-			inItemOrder: y,
-			dateItems: F
+			fields: u,
+			items: c,
+			newItems: h,
+			usedCounts: w,
+			inItemOrder: v,
+			dateItems: g
 		}
 	};
-}, qe = (e, t, n, s) => {
+}, je = (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 || C(s, t)) && l.push(a.length), a.push(n[t]), a.length - 1)), { dateItems: c, ...f } = 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;
 	return {
 		group: {
 			...f,
@@ -1329,7 +1329,7 @@ var X = [
 		},
 		itemMap: d
 	};
-}, Ge = (e, t, n = !1, s = !1) => {
+}, ze = (e, t, n = !1, s = !1) => {
 	const r = (e, t) => null === e ? 5 : "number" == typeof e ? t ? 3 : 0 : "string" == typeof e ? 1 : "boolean" == typeof e ? 2 : 4, o = r(e, n), a = r(t, s);
 	return o !== a ? o - a : 0 === o || 3 === o ? e - t : 1 === o ? e.localeCompare(t, void 0, { sensitivity: "base" }) : 2 === o ? Number(e) - Number(t) : 4 === o ? e.getCode() - t.getCode() : 0;
 }, Qe = (e, t) => {
@@ -1394,7 +1394,7 @@ var X = [
 		if (!o(e.field)) return [];
 		const t = { field: r(e.field) };
 		if (void 0 !== e.item) {
-			const n = Ze(u[t.field].items ?? [], d[e.field]?.[e.item] ?? -1);
+			const n = Ye(u[t.field].items ?? [], d[e.field]?.[e.item] ?? -1);
 			void 0 !== n && (t.item = n);
 		}
 		return [t];
@@ -1436,74 +1436,74 @@ var X = [
 }, Ke = (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 = [], d = [], u = /* @__PURE__ */ new Set();
 	for (const e of a) {
-		if (!I(e)) {
-			i.push(l.length), l.push(e);
+		if (!H(e)) {
+			d.push(i.length), i.push(e);
 			continue;
 		}
 		const n = t[e.item] ?? -1;
 		if (n < 0) {
-			i.push(-1);
+			d.push(-1);
 			continue;
 		}
-		d.add(n);
+		u.add(n);
 		const r = {
 			...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, d.push(i.length), i.push(r);
 	}
-	const u = [];
-	for (let e = 0; e < n.length; e++) d.has(e) || u.push(e);
+	const c = [];
+	for (let e = 0; e < n.length; e++) u.has(e) || c.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) => !I(e.item)), o = [...[...s.filter((e) => I(e.item)), ...u.map((e) => ({
+		})), r = s.filter((e) => !H(e.item)), o = [...[...s.filter((e) => H(e.item)), ...c.map((e) => ({
 			item: n ? {
 				item: e,
 				hidden: !0
 			} : { item: e },
 			at: -1
-		}))].sort((e, n) => t ? n.item.item - e.item.item : e.item.item - n.item.item), ...r], d = new Map(o.map((e, t) => [e.at, t]));
+		}))].sort((e, n) => t ? n.item.item - e.item.item : e.item.item - n.item.item), ...r], l = 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: d.map((e) => e < 0 ? e : l.get(e) ?? -1)
 		};
 	}
-	if (0 === u.length) return {
-		items: l,
-		positions: i
+	if (0 === c.length) return {
+		items: i,
+		positions: d
 	};
-	const c = !e.includeNewItemsInFilter && a.some((e) => e.hidden), f = (e) => c ? {
+	const f = !e.includeNewItemsInFilter && a.some((e) => e.hidden), m = (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) => Ge(b(e, n), g(n[t]), void 0 === e.name && o?.has(e.item), o?.has(t));
-		for (const e of u) {
-			const n = f(e);
-			let r = l.findIndex((n) => I(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 t = "descending" === e.sort.order, s = (e, t) => ze(l(e, n), S(n[t]), void 0 === e.name && o?.has(e.item), o?.has(t));
+		for (const e of c) {
+			const n = m(e);
+			let r = i.findIndex((n) => H(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 < d.length; e++) d[e] >= r && d[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, ...c.map(m));
+		for (let t = 0; t < d.length; t++) d[t] >= e && (d[t] += c.length);
 	}
 	return {
-		items: l,
-		positions: i
+		items: i,
+		positions: d
 	};
 }, We = (e) => {
-	const t = e.findIndex((e) => !I(e));
+	const t = e.findIndex((e) => !H(e));
 	return t < 0 ? e.length : t;
-}, Ze = (e, t) => {
+}, Ye = (e, t) => {
 	if (!(t < 0)) for (let n = 0; n < e.length; n++) {
 		const s = (t + n) % e.length, r = e[s];
-		if (I(r) && !r.missing) return s;
+		if (H(r) && !r.missing) return s;
 	}
 }, Xe = (e, t, n, s, r) => {
 	const o = { ...e };
@@ -1532,7 +1532,7 @@ var X = [
 		o.references = a;
 	}
 	return o;
-}, Ye = (e, t, n) => {
+}, Ze = (e, t, n) => {
 	const s = e.fields ?? [], r = s[t]?.items ?? [], o = new Array(r.length);
 	n.forEach((e, t) => {
 		o[e] = t;
@@ -1578,13 +1578,13 @@ var X = [
 		areas: e.areas.map(d)
 	}))), a;
 }, et = (e, t, n, s) => {
-	const r = (e.fields ?? [])[n]?.items ?? [], o = u(t)[n] ?? [], a = t.fields?.[n], l = void 0 !== a?.group?.range, i = (e) => void 0 === e.name && C(a, e.item), d = r.map((e, t) => ({
+	const r = (e.fields ?? [])[n]?.items ?? [], o = p(t)[n] ?? [], a = t.fields?.[n], i = void 0 !== a?.group?.range, d = (e) => void 0 === e.name && E(a, e.item), u = r.map((e, t) => ({
 		item: e,
 		at: t
-	})), c = d.filter((e) => I(e.item));
-	c.sort((e, t) => l ? e.item.item - t.item.item : Ge(b(e.item, o), b(t.item, o), i(e.item), i(t.item))), "descending" === s && c.reverse();
+	})), c = u.filter((e) => H(e.item));
+	c.sort((e, t) => i ? e.item.item - t.item.item : ze(l(e.item, o), l(t.item, o), d(e.item), d(t.item))), "descending" === s && c.reverse();
 	let f = 0;
-	const m = Ye(e, n, d.map((e) => I(e.item) ? c[f++] : e).map((e) => e.at));
+	const m = Ze(e, n, u.map((e) => H(e.item) ? c[f++] : e).map((e) => e.at));
 	return {
 		...m,
 		fields: m.fields.map((e, t) => t === n ? {
@@ -1594,34 +1594,34 @@ var X = [
 	};
 }, tt = (n, s, r) => {
 	const o = n.fields?.[s]?.items?.[r];
-	if (!o || !I(o)) throw new t(e("error.pivotTable.changePart"));
+	if (!o || !H(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 = u(s)[r] ?? [], c = (e) => {
-		const t = g(d[e.item]);
-		return null === t ? D : U(t);
+	const l = tt(n, r, o), i = n.fields[r].items, d = p(s)[r] ?? [], u = (e) => {
+		const t = S(d[e.item]);
+		return null === t ? w : c(t);
 	};
-	if (i.some((e, t) => t !== o && I(e) && S(e.name ?? c(e), a))) throw new t(e("error.pivotTable.itemNameExists", { name: a }));
-	const { name: f, ...m } = l, p = a === c(l) ? m : {
+	if (i.some((e, t) => t !== o && H(e) && O(e.name ?? u(e), a))) throw new t(e("error.pivotTable.itemNameExists", { name: a }));
+	const { name: f, ...m } = l, h = a === u(l) ? m : {
 		...l,
 		name: a
 	};
-	if (p.name === l.name) return n;
-	const h = {
+	if (h.name === l.name) return n;
+	const g = {
 		...n,
 		fields: n.fields.map((e, t) => t === r ? {
 			...e,
-			items: i.map((e, t) => t === o ? p : e)
+			items: i.map((e, t) => t === o ? h : e)
 		} : e)
-	}, w = n.fields[r].sort;
-	return w && void 0 === w.dataField ? et(h, s, r, w.order) : h;
+	}, 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 = Ye(e, t, r);
+	const a = Ze(e, t, r);
 	return o ? {
 		...a,
 		fields: a.fields.map((e, n) => {
@@ -1631,11 +1631,11 @@ var X = [
 		})
 	} : a;
 }, rt = (n, s, r, o) => {
-	const a = U(o), l = n.fields, i = s.fields, d = n.dataFields ?? [], c = u(s), m = (e, t) => {
+	const a = c(o), l = n.fields, i = s.fields, d = n.dataFields ?? [], u = p(s), f = (e, t) => {
 		if (void 0 !== t.name) return t.name;
-		const n = g(c[e][t.item]);
-		return null === n ? D : U(n);
-	}, p = (r) => {
+		const n = S(u[e][t.item]);
+		return null === n ? w : c(n);
+	}, m = (r) => {
 		if (void 0 !== r.field && a === (l[r.field].name ?? i[r.field].name)) return;
 		const o = void 0 === r.field ? n : {
 			...n,
@@ -1644,18 +1644,18 @@ var X = [
 				name: "\0"
 			} : e)
 		};
-		if (f(o, s, a, r.data) !== a) throw new t(e("error.pivotTable.fieldNameExists"));
+		if (y(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 && I(n) && S(m(e, n), a));
+			const o = l[e].items.findIndex((n, s) => s !== t && H(n) && O(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 p({ field: e }), ((e, t) => ({
+			return m({ field: e }), ((e, t) => ({
 				...n,
 				fields: l.map((n, s) => s === e ? t(n) : n)
 			}))(e, (t) => {
@@ -1668,7 +1668,7 @@ var X = [
 		}
 		case "dataCaption": {
 			const { data: e } = r;
-			return p({ data: e }), {
+			return m({ data: e }), {
 				...n,
 				dataFields: d.map((t, n) => n === e ? {
 					...t,
@@ -1691,7 +1691,7 @@ var X = [
 		case "pageItem": {
 			const s = n.pageFields, o = s[r.page];
 			let i;
-			if (!S(a, "(All)") && (i = (l[o.field].items ?? []).findIndex((e) => I(e) && S(m(o.field, e), a)), i < 0)) throw new t(e("error.pivotTable.notAnItem", { name: a }));
+			if (!O(a, "(All)") && (i = (l[o.field].items ?? []).findIndex((e) => H(e) && O(f(o.field, e), a)), i < 0)) throw new t(e("error.pivotTable.notAnItem", { name: a }));
 			const { item: d, ...u } = o, c = void 0 === i ? u : {
 				...o,
 				item: i
@@ -1702,7 +1702,7 @@ var X = [
 			};
 		}
 	}
-}, ot = (e, t, n) => je({
+}, ot = (e, t, n) => Ge({
 	cacheId: 0,
 	fields: []
 }, e, t, n).model, at = (e, t) => t.some((t) => e.fields?.[t]?.inline) ? {
@@ -1717,8 +1717,8 @@ var X = [
 	...e.columnFields ?? [],
 	...(e.pageFields ?? []).map((e) => e.field)
 ].filter((e) => e >= 0), it = (e, t) => {
-	const n = e.fields[t], s = u(e)[t], r = s.map((e, t) => t);
-	j(n) || r.sort((e, t) => Ge(g(s[e]), g(s[t]), C(n, e), C(n, t)));
+	const n = e.fields[t], s = p(e)[t], r = s.map((e, t) => t);
+	F(n) || r.sort((e, t) => ze(S(s[e]), S(s[t]), E(n, e), E(n, t)));
 	const o = new Set(n.calculatedItems?.map((e) => e.item)), a = new Set(n.unused);
 	return [...r.map((e) => ({
 		item: e,
@@ -1726,23 +1726,23 @@ var X = [
 		...a.has(e) ? { missing: !0 } : {}
 	})), { type: "default" }];
 }, dt = (n) => {
-	if (!("number" == typeof n ? void 0 !== o(n) : "" !== n && s.isValidFormat(n))) throw new t(e("error.pivotTable.notANumberFormat", { name: String(n) }));
+	if (!("number" == typeof n ? void 0 !== r(n) : "" !== n && s.isValidFormat(n))) throw new t(e("error.pivotTable.notANumberFormat", { name: String(n) }));
 }, ut = (n, s, r, o) => {
-	const a = o?.function ?? ((e, t) => "number" === _(e, t) ? "sum" : "count")(s.fields[r], u(s)[r]), i = l[a];
-	if (!i) throw new t(e("error.pivotTable.notAFunction", { name: a }));
+	const a = o?.function ?? ((e, t) => "number" === i(e, t) ? "sum" : "count")(s.fields[r], p(s)[r]), l = C[a];
+	if (!l) throw new t(e("error.pivotTable.notAFunction", { name: a }));
 	let d = o?.name;
-	if (void 0 === d) d = f(n, s, `${i} of ${M(n, s, r)}`);
-	else if (f(n, s, d) !== d) throw new t(e("error.pivotTable.fieldNameExists"));
-	const c = {
+	if (void 0 === d) d = y(n, s, `${l} of ${k(n, s, r)}`);
+	else if (y(n, s, d) !== d) throw new t(e("error.pivotTable.fieldNameExists"));
+	const u = {
 		name: d,
 		field: r,
 		baseField: 0,
 		baseItem: 0
 	};
-	return "sum" !== a && (c.subtotal = a), void 0 !== o?.numberFormat && (dt(o.numberFormat), c.numberFormat = o.numberFormat), c;
+	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) => S(e.name, n));
+		const s = r.findIndex((e) => O(e.name, n));
 		if (s < 0) throw new t(e("error.pivotTable.notAField", { name: n }));
 		return s;
 	}, a = /* @__PURE__ */ new Map(), l = (e, t) => {
@@ -1779,7 +1779,7 @@ var X = [
 }, ft = (e, t) => t.map((t) => {
 	const n = t.sort?.scope;
 	if (!n) return t;
-	const s = ((t.axis === h.Axis.Row ? e.columnFields : t.axis === h.Axis.Column ? e.rowFields : void 0) ?? []).filter((e) => -2 !== e);
+	const s = ((t.axis === U.Axis.Row ? e.columnFields : t.axis === U.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,37 +1796,37 @@ var X = [
 		}
 	};
 }), mt = (n, s, r, o, a) => {
-	const l = h.Axis, i = s.fields?.[r], d = n.fields?.[r]?.axis ?? null;
+	const l = U.Axis, i = s.fields?.[r], d = n.fields?.[r]?.axis ?? null;
 	if (o === l.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 u = o ? N(n, o).filter((e) => e !== r) : [];
+	const u = o ? P(n, o).filter((e) => e !== r) : [];
 	if (void 0 !== a && (!Number.isInteger(a) || a < 1 || a > u.length + 1)) throw new t(e("error.pivotTable.fieldPosition"));
 	const c = (a ?? u.length + 1) - 1;
-	if (o === d && (void 0 === a || N(n, o)[c] === r)) return n;
+	if (o === d && (void 0 === a || P(n, o)[c] === r)) return n;
 	u.splice(c, 0, r);
-	const { rowFields: f, columnFields: m, pageFields: p, ...g } = n, w = {}, v = (e) => (e ?? []).filter((e) => e !== r), F = o === l.Row ? u : v(n.rowFields), b = o === l.Column ? u : v(n.columnFields), y = o === l.Page ? u.map((e) => n.pageFields?.find((t) => t.field === e) ?? { field: e }) : (n.pageFields ?? []).filter((e) => e.field !== r);
-	F.length > 0 && (w.rowFields = F), b.length > 0 && (w.columnFields = b), y.length > 0 && (w.pageFields = y);
-	let I = {
-		...g,
-		...w
+	const { rowFields: f, columnFields: m, pageFields: p, ...h } = n, g = {}, w = (e) => (e ?? []).filter((e) => e !== r), v = o === l.Row ? u : w(n.rowFields), F = o === l.Column ? u : w(n.columnFields), b = o === l.Page ? u.map((e) => n.pageFields?.find((t) => t.field === e) ?? { field: e }) : (n.pageFields ?? []).filter((e) => e.field !== r);
+	v.length > 0 && (g.rowFields = v), F.length > 0 && (g.columnFields = F), b.length > 0 && (g.pageFields = b);
+	let y = {
+		...h,
+		...g
 	};
-	o === l.Page && d !== l.Page && (I = q(I, r, () => !0));
-	const x = { ...n.fields?.[r] };
-	o ? x.axis = o : delete x.axis, o && !x.items && i && (x.items = B(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);
-	const A = (n.fields ?? []).map((e, t) => t === r ? x : e);
-	if (I = {
-		...I,
-		fields: ft(I, A)
+	o === l.Page && d !== l.Page && (y = q(y, r, () => !0));
+	const I = { ...n.fields?.[r] };
+	o ? I.axis = o : delete I.axis, o && !I.items && i && (I.items = x(it(s, r), I.subtotals)), o && void 0 === I.numberFormat && i?.dates && void 0 !== i.numberFormat && (I.numberFormat = i.numberFormat), o === l.Page && I.items?.some((e) => e.hidden) && (I.multipleItemSelection = !0);
+	const A = (n.fields ?? []).map((e, t) => t === r ? I : e);
+	if (y = {
+		...y,
+		fields: ft(y, A)
 	}, null === o && n.formats?.some((e) => e.area.references?.some((e) => e.field === r))) {
-		const e = n.formats.filter((e) => !e.area.references?.some((e) => e.field === r)), { formats: t, ...s } = I;
-		I = e.length > 0 ? {
+		const e = n.formats.filter((e) => !e.area.references?.some((e) => e.field === r)), { formats: t, ...s } = y;
+		y = e.length > 0 ? {
 			...s,
 			formats: e
 		} : s;
 	}
-	return I;
+	return y;
 }, pt = -2, ht = /* @__PURE__ */ new Set([
 	"percentOfTotal",
 	"percentOfRow",
@@ -1955,7 +1955,7 @@ var X = [
 		l[e] = t;
 	}), It(n, a.map((e) => o[e]), l);
 }, Et = (e, t, n, s) => {
-	const r = x(e, t, n, s);
+	const r = V(e, t, n, s);
 	return (e.dataFields[n].subtotal ?? "sum") === s ? e : bt(e, n, (e) => {
 		const { subtotal: t, ...n } = e, o = {
 			...n,
@@ -1963,41 +1963,41 @@ var X = [
 		};
 		return "sum" !== s && (o.subtotal = s), o;
 	});
-}, St = (n, s, r, o) => {
+}, Pt = (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 { showDataAs: d, baseField: u, baseItem: c, ...f } = a, p = { ...f };
-	"normal" !== i && (p.showDataAs = i);
-	let h = a.baseField, g = a.baseItem;
+	const { showDataAs: d, baseField: u, baseItem: c, ...f } = a, m = { ...f };
+	"normal" !== i && (m.showDataAs = i);
+	let p = a.baseField, h = a.baseItem;
 	if (void 0 !== o?.baseField) {
-		const r = o.baseField, a = (s.fields ?? []).findIndex((e, t) => S(M(n, s, t), r));
+		const r = o.baseField, a = (s.fields ?? []).findIndex((e, t) => O(k(n, s, t), r));
 		if (a < 0) throw new t(e("error.pivotTable.notAField", { name: r }));
-		a !== h && (h = a, g = 0);
+		a !== p && (p = a, h = 0);
 	}
 	if (void 0 !== o?.baseItem) {
-		const r = h ?? 0;
-		if (S(o.baseItem, "(previous)")) g = "previous";
-		else if (S(o.baseItem, "(next)")) g = "next";
+		const r = p ?? 0;
+		if (O(o.baseItem, "(previous)")) h = "previous";
+		else if (O(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 = $(a, s, r).findIndex((e) => null !== e && S(e, o.baseItem));
+			} : e) }, l = L(a, s, r).findIndex((e) => null !== e && O(e, o.baseItem));
 			if (l < 0) throw new t(e("error.pivotTable.notAnItem", { name: o.baseItem }));
-			g = l;
+			h = l;
 		}
 	}
-	if (void 0 !== h && (p.baseField = h), void 0 !== g && (p.baseItem = g), i === l) return p.baseField === a.baseField && p.baseItem === a.baseItem ? n : bt(n, r, () => p);
-	const w = ((e, t, n) => {
+	if (void 0 !== p && (m.baseField = p), void 0 !== h && (m.baseItem = h), i === l) 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) => m(e).replace(/"[^"]*"|\\./g, "").includes("%"))(e);
+		const s = ((e) => M(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 w === a.numberFormat ? bt(n, r, () => p) : bt(Ft(n, r), r, () => yt(p, w));
-}, Pt = (e, t, n) => {
+	return g === a.numberFormat ? bt(n, r, () => m) : bt(Ft(n, r), r, () => yt(m, g));
+}, St = (e, t, n) => {
 	dt(n);
-	const s = m(n), r = e.dataFields[t], o = e.formats?.[e.formats.length - 1];
-	if (m(r.numberFormat) === s && o && vt(o.area, t) && o.style.numberFormat === s) return e;
+	const s = M(n), r = e.dataFields[t], o = e.formats?.[e.formats.length - 1];
+	if (M(r.numberFormat) === s && o && vt(o.area, t) && o.style.numberFormat === s) return e;
 	const a = bt(Ft(e, t), t, (e) => yt(e, "General" === s ? void 0 : n));
 	return {
 		...a,
@@ -2014,27 +2014,27 @@ var X = [
 	};
 }, kt = (n, s, r) => {
 	if (null === s) return At(n);
-	const o = h.Axis;
+	const o = U.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 = N(n, s).filter((e) => e !== pt);
+	const l = P(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 || N(n, s)[i] === pt)) return n;
+	if (s === a && (void 0 === r || P(n, s)[i] === pt)) return n;
 	l.splice(i, 0, pt);
-	const { rowFields: d, columnFields: u, valuesOnRows: c, ...f } = n, m = N(n, s === o.Row ? o.Column : o.Row).filter((e) => e !== pt), p = { ...f }, g = s === o.Row ? l : m, w = s === o.Column ? l : m;
-	return g.length > 0 && (p.rowFields = [...g]), w.length > 0 && (p.columnFields = [...w]), s === o.Row && (p.valuesOnRows = !0), p;
+	const { rowFields: d, columnFields: u, valuesOnRows: c, ...f } = n, m = P(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;
+	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 = {
 		...a,
 		valuesCaption: "\0"
 	};
-	if (f(l, s, r) !== r) throw new t(e("error.pivotTable.fieldNameExists"));
+	if (y(l, 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, Re as buildPivotView, Oe as evaluatePivotFilters, k 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, Le as readPivotSource, je as refreshPivotCache, Qe 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 };
+export { xt as addPivotDataField, Ne as anchorPivotPeriods, dt as assertNumberFormat, lt as axisFieldsOf, Re as buildPivotView, Oe as evaluatePivotFilters, R 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, Ge as refreshPivotCache, Qe as remapPivotTable, At as removePivotDataField, nt as renamePivotItem, Mt as renamePivotValues, Ze as reorderPivotItems, Et as setPivotDataFunction, St as setPivotDataNumberFormat, Pt as setPivotDataShowAs, et as sortPivotItemsByLabel, rt as typeOverPivot, at as withListedFields };