@sheetxl/mcp 0.8.0-beta.25 → 1.0.0

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

@@ -1,15 +1,15 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.25
+* @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 "./ixHQtoul8ubEJfWS.js";
-import { Dt as n, Et as s, _t as r, d as o } from "./BbfSzxx5EzAvn-_F.js";
-import { u as a } from "./CCOaNx5_BfWCc9yz.js";
-import { $a as l, $i as i, Aa as d, Bi as u, D as c, Gn as f, Gr as m, Ha as p, I as h, Ii as g, Jr as w, Ka as v, Ln as F, Nn as b, Nt as y, Oa as I, Q as x, Ra as A, Sa as C, aa as E, b as S, bi as P, f as k, fa as M, fn as T, hr as R, l as O, li as N, oa as $, pt as L, qr as _, st as D, ut as V, wa as U, wi as H, wr as B, xa as G, xn as z, xt as j, z as q } from "./ckvxz2tZRlY1UPpg.js";
-import { a as K, i as Q, n as J, o as W, r as X } from "./BSJ_L1gNOejEih6N.js";
-var Y = [
+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",
 	"Mar",
@@ -61,24 +61,24 @@ var Y = [
 		default: return null;
 	}
 }, te = (e, t) => {
-	const n = e.fields ?? [], s = $(e.records, n.length);
-	if (!n.some(U)) return s;
-	const r = $(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 (!U(l)) continue;
-		const i = l.group, d = s[i.base] ?? [], u = r[i.base] ?? [], f = new Int32Array(u.length);
+		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;
-			f[e] = n ?? -1;
+			const n = i.range ? ee(i.range, i.items.length, S(u[e]), t) : i.discrete?.[e] ?? null;
+			c[e] = n ?? -1;
 		}
-		const m = new Array(o);
+		const f = new Array(o);
 		for (let e = 0; e < o; e++) {
-			const t = f[d[e]];
+			const t = c[d[e]];
 			if (void 0 === t || t < 0) return null;
-			m[e] = t;
+			f[e] = t;
 		}
-		a[e] = m;
+		a[e] = f;
 	}
 	return a;
 }, ne = (e) => String(Number(e.toPrecision(12))), se = (e, t) => {
@@ -111,7 +111,7 @@ var Y = [
 				if (1 === o) {
 					const e = [];
 					return Z.forEach((t, n) => {
-						for (let s = 1; s <= t; s++) e.push(`${s}-${Y[n]}`);
+						for (let s = 1; s <= t; s++) e.push(`${s}-${X[n]}`);
 					}), {
 						inner: e,
 						endText: a
@@ -125,7 +125,7 @@ var Y = [
 					endText: a
 				};
 			case "months": return {
-				inner: Y.slice(),
+				inner: X.slice(),
 				endText: a
 			};
 			case "quarters": return {
@@ -226,44 +226,44 @@ var Y = [
 	for (let s = 0; s < t; s++) n.push([s, [[0, e.map((e) => e[s] ?? null)]]]);
 	return n;
 }, de = (e, t) => {
-	const n = t.fields ?? [], s = [], r = [], o = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), i = (e, t) => {
+	const n = t.fields ?? [], s = [], r = [], o = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), l = (e, t) => {
 		if (o.has(e)) return !0;
 		if (t.includes(e)) return !1;
-		const d = [];
+		const i = [];
 		oe(n[e].formula, (e) => {
-			const t = n.findIndex((t) => l(t.name, e));
-			return t >= 0 && d.push(t), t >= 0 ? "" : null;
+			const t = n.findIndex((t) => O(t.name, e));
+			return t >= 0 && i.push(t), t >= 0 ? "" : null;
 		});
-		for (const r of d) if (u(n[r])) {
-			if (!i(r, [...t, e])) return !1;
+		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({
 			field: e,
 			expression: ""
 		}), !0;
-	}, d = [];
-	for (const [t, s] of (e.dataFields ?? []).entries()) if (u(n[s.field])) {
-		if (!i(s.field, [])) return null;
-		d.push({
+	}, i = [];
+	for (const [t, s] of (e.dataFields ?? []).entries()) if (b(n[s.field])) {
+		if (!l(s.field, [])) return null;
+		i.push({
 			data: t,
 			formula: o.get(s.field)
 		});
 	}
-	const c = (e, t) => {
+	const d = (e, t) => {
 		if (null !== t) return null;
-		const r = n.findIndex((t) => l(t.name, e));
-		return r >= 0 ? ae(u(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) {
-		const t = oe(a.get(e.field), c);
+		const t = oe(a.get(e.field), d);
 		if (null === t) return null;
 		e.expression = t;
 	}
 	return {
 		operands: s,
 		formulas: r,
-		measures: d
+		measures: i
 	};
 }, ue = /* @__PURE__ */ new Set([
 	"sum",
@@ -343,71 +343,71 @@ var Y = [
 	percent: 13,
 	percentDiff: 14
 }, Ie = (e, t, n, s) => {
-	const r = b.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 (f(e)) return {
 		cells: [],
-		...D,
+		...A,
 		rowPageCount: 0,
 		columnPageCount: 0,
-		header: G(e),
+		header: v(e),
 		rowLines: [],
 		columnLines: [],
 		viewValues: [],
 		firstKey: null,
 		...s?.roles ? { roles: /* @__PURE__ */ new Map() } : {}
 	};
-	const l = k(e, a), i = l ? s?.filters : null;
+	const l = d(e, a), i = l ? s?.filters : null;
 	if (l && !i) return null;
-	const d = o.some((e) => e.items?.some((e) => e.calculated));
-	if (d && !i?.calculatedRecords) return null;
-	const u = de(e, t);
-	if (!u || u.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 c = xe(e, t, n, i?.calculatedRecords, u.operands);
-	if (!c) return null;
-	const { items: m, records: p, values: h, n: w } = c, v = (e) => !!e && (!e.noRecords || U(e)), F = e.form ?? "compact", y = (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 (d && 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;
-	}, I = y(e.rowFields), x = y(e.columnFields), A = e.pageFields ?? [];
-	if (!I || !x || A.some((e) => !v(a[e.field]))) return null;
-	const C = g(e, s?.slicerFields);
-	return C.pageFields?.some((e) => !v(a[e.field])) ? null : Te(e, t, m, I, x, Se(r, C, m, p, h, I, x, w, i?.keep, i?.records, u.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 = w(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 i = !0 === t.fields?.some(U), d = i ? $(t.items, o) : a, u = i ? $(t.records, o) : l, f = t.recordCount ?? 0, m = s?.count ?? 0, p = f + 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 < f; e++) i[e] = c(o[r[e]]);
-		for (let e = 0; e < m; e++) i[f + 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;
 	}, 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: g,
-		n: p
+		n: m
 	};
 }, Ae = async (e, t, n, s, r, o, a, l, i) => {
-	const d = b.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;
@@ -421,46 +421,46 @@ var Y = [
 				return n;
 			})
 		};
-	}), { columnGrandTotals: g, ...w } = e, { showDataAs: v, ...F } = u, y = {
+	}), { columnGrandTotals: g, ...w } = e, { showDataAs: v, ...F } = u, b = {
 		...w,
 		fields: h,
 		rowFields: [...p, s],
 		columnFields: [],
 		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) => {
+	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) => O(t, e.path[n])).join(",");
-		let r = N.get(n);
-		r || N.set(n, r = {
+		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[p.length])), r.totals.push(R.values[t * $]);
+		}), r.ids.push(R(s, e.path[p.length])), r.totals.push(T.values[t * N]);
 	}), {
 		outer: p,
-		groups: N,
-		records: E
+		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 Y = [
 		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 {
@@ -485,7 +485,7 @@ var Y = [
 			t.operands.forEach((t, n) => {
 				const o = s.values(r + n);
 				try {
-					const t = Q(e.wasm_memory().buffer, o, p), n = new Array(h);
+					const t = K(e.wasm_memory().buffer, o, p), n = new Array(h);
 					for (let e = 0; e < h; e++) n[e] = t(e);
 					g.push(n);
 				} finally {
@@ -517,12 +517,12 @@ var Y = [
 		}
 		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 {
-			const i = Q(e.wasm_memory().buffer, a, h), d = new Array(r.length);
+			const i = K(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;
 			return {
 				rows: n,
@@ -537,7 +537,7 @@ var Y = [
 	} 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 Y = [
 			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 < 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 Y = [
 			ok: !0,
 			numeric: !0
 		};
-		for (let t = 0; t < n; t++) X(s, t, e[t], A, r);
+		for (let t = 0; t < n; t++) Y(s, t, e[t], A, r);
 	}
 	return {
 		request: p,
@@ -649,91 +649,91 @@ 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, s, r, l, d, u, f) => {
-	const h = e.fields, g = t.fields, w = e.dataFields ?? [], F = (t) => t === ce ? e.valuesCaption ?? "Values" : h[t].name ?? g[t].name, b = (e, t) => {
-		if (e === ce) return w[t]?.name ?? "";
-		const s = h[e].items?.[t];
+}, 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 = c(n[e][s?.item ?? t]);
-		return null === r ? i : r;
-	}, y = (e, t) => {
-		const n = b(e, t);
+		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 = h[e].items?.[t]?.item ?? t, a = void 0 === (h[e].numberFormat ?? g[e].numberFormat) && v(g[e], r);
-			return o(d, a ? p(P(g[e], r), d) : p(h[s = e].numberFormat ?? g[s].numberFormat, d), 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 s;
 		return a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
-	}, x = (e) => {
-		if (void 0 !== e.item) return b(e.field, e.item);
-		const t = h[e.field].items ?? [];
+	}, b = (e) => {
+		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) => z(e) && !e.hidden ? [t] : []);
-		return 1 === n.length ? b(e.field, n[0]) : "(Multiple Items)";
-	}, A = e.grandTotalCaption ?? "Grand Total", C = u ? /* @__PURE__ */ new Map() : null, S = (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
-	}, k = (e) => e === ce ? null : {
+	}, C = (e) => e === ce ? null : {
 		kind: "fieldCaption",
 		field: e
-	}, M = (e, t) => 2 === e.kind && t === A ? { kind: "grandTotal" } : null, T = 0 === s.length && 0 === r.length && 0 === w.length, O = T ? {
+	}, 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
-	} : G(e), N = T ? [] : Me(l.rows, l.functions), $ = T ? [] : Me(l.columns, l.functions), L = I({
+	} : v(e), T = k ? [] : Me(l.rows, l.functions), R = k ? [] : Me(l.columns, l.functions), O = z({
 		...e,
-		header: O,
-		rowLines: N,
-		columnLines: $
-	}), _ = l.columns.length, D = (e) => "row" === e ? s : r, V = (t) => {
+		header: M,
+		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 [F(n), {
+				return [h(n), {
 					kind: "fieldCaption",
 					field: n
 				}];
 			}
 			case "pageItem": {
 				const n = e.pageFields[t.page];
-				return [x(n), {
+				return [b(n), {
 					kind: "pageItem",
 					page: t.page
 				}];
 			}
-			case "dataCaption": return [w[t.data]?.name ?? null, {
+			case "dataCaption": return [p[t.data]?.name ?? null, {
 				kind: "dataCaption",
 				data: t.data
 			}];
 			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 = D(t.axis)[t.level].field;
-				return [F(e), k(e)];
+				const e = $(t.axis)[t.level].field;
+				return [h(e), C(e)];
 			}
 			case "label": {
-				const e = D(t.axis)[t.level].field, n = t.line.path[t.level];
-				return [b(e, n), S(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 ? w[t.data]?.name ?? "" : "";
-					if (2 === t.kind) return n ? `Total ${s}` : A;
-					const r = t.path.length - 1, o = e[r].field, a = y(o, t.path[r]);
+					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 ${F(w[t.data].field)}` : `${a} ${e}`;
+						return (n || t.across) && null !== t.data ? `${a} ${e} of ${h(p[t.data].field)}` : `${a} ${e}`;
 					}
-					return h[o]?.subtotalCaption ?? (n ? `${a} ${s}` : `${a} Total`);
-				})(D(t.axis), e);
-				return [n, M(e, n)];
+					return c[o]?.subtotalCaption ?? (n ? `${a} ${s}` : `${a} Total`);
+				})($(t.axis), e);
+				return [n, P(e, n)];
 			}
 			case "value": {
-				const n = t.row.index * _ + t.column.index, s = l.states[n];
+				const n = t.row.index * L + t.column.index, s = l.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) => {
 					if (void 0 === e) return null;
@@ -744,64 +744,64 @@ var Y = [
 				})(e.emptyCaption)), [r, null];
 			}
 		}
-	}, U = new E.Builder(), H = L.top, B = L.pages.reduce((e, t) => Math.max(e, t.column + 2), 0), j = (e, t) => {
-		const n = m(L, 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] = V(n);
+		const [s, r] = _(n);
 		((e, t, n) => {
-			C && n && C.set(e + "," + t, n);
-		})(e - H, t, r), null !== s && (f ? U.pushAt(t, e - H, s) : U.pushAt(e - H, 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 (f) {
-		const e = Math.max(B, L.columns.length);
-		for (let t = 0; t < e; t++) for (let e = 0; e < L.rows.length; e++) t < (e < H ? B : L.columns.length) && j(e, t);
-	} else for (let e = 0; e < L.rows.length; e++) {
-		const t = e < H ? B : L.columns.length;
-		for (let n = 0; n < t; n++) j(e, n);
+	if (u) {
+		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 (T) {
-		const t = R(e);
+	if (k) {
+		const t = D(e);
 		return {
-			cells: U.build()?.tuples ?? [],
+			cells: V.build()?.tuples ?? [],
 			rows: 1,
 			columns: 1,
 			rowPageCount: t.rows,
 			columnPageCount: t.columns,
-			header: O,
+			header: M,
 			rowLines: [],
 			columnLines: [],
 			viewValues: [],
 			firstKey: null,
-			...C ? { roles: C } : {}
+			...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;
-	}, Q = (e, t) => K(e.data ?? t.data ?? 0, [...q(s, e), ...q(r, 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;
+	}, 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 || Z(t) || (q(s, t), l.columns.forEach((s, r) => {
-			const o = l.states[n * _ + 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 || 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]);
+			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: U.build()?.tuples ?? [],
-		rows: L.rows.length - H,
-		columns: L.columns.length,
+		cells: V.build()?.tuples ?? [],
+		rows: O.rows.length - U,
+		columns: O.columns.length,
 		rowPageCount: ee.rows,
 		columnPageCount: ee.columns,
-		header: O,
-		rowLines: N,
-		columnLines: $,
-		viewValues: Y,
-		firstKey: X,
-		...C ? { roles: C } : {}
+		header: M,
+		rowLines: T,
+		columnLines: R,
+		viewValues: X,
+		firstKey: Y,
+		...x ? { roles: x } : {}
 	};
 }, Re = (e, t, n, s, r = !1, l, i) => {
 	const d = Ie(e, t, s, {
@@ -809,53 +809,53 @@ var Y = [
 		slicerFields: i
 	});
 	if (!d) return null;
-	const u = d.rowPageCount > 0 ? d.rowPageCount + 1 : 0, f = d.rowPageCount > 0 ? 3 * d.columnPageCount - 1 : 0, { rowStart: m, colStart: h } = n;
-	if (m - u < 0) return null;
-	const g = {
-		rowStart: m - u,
-		colStart: h,
-		rowEnd: m + d.rows - 1,
-		colEnd: h + Math.max(d.columns, f) - 1
-	}, F = e.fields, b = t.fields, y = w(t), I = (e, t) => {
-		const n = F[e], r = n.numberFormat ?? b[e].numberFormat, l = p(r, s), i = U(b[e]), d = y[e], u = (n.items ?? []).filter((e) => void 0 !== e.item && void 0 === e.type), f = u.length > 0 ? u : d.map((e, t) => ({ item: t })), m = f.map((t) => {
-			const n = c(d[t.item]), u = v(b[e], t.item), f = null === n ? "(blank)" : "number" == typeof n ? o(s, u ? (m = t.item, void 0 === r ? p(P(b[e], m), s) : l) : l, n) : a.isError(n) ? n.getLabel() : "boolean" == typeof n ? n ? "TRUE" : "FALSE" : String(n);
-			var m;
-			const h = i && u ? f : n;
+	const u = d.rowPageCount > 0 ? d.rowPageCount + 1 : 0, c = d.rowPageCount > 0 ? 3 * d.columnPageCount - 1 : 0, { rowStart: f, colStart: m } = n;
+	if (f - u < 0) return null;
+	const h = {
+		rowStart: f - u,
+		colStart: m,
+		rowEnd: f + d.rows - 1,
+		colEnd: m + Math.max(d.columns, c) - 1
+	}, g = e.fields, w = t.fields, v = 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 : n;
 			return void 0 !== t.name ? {
-				value: h,
-				text: f,
+				value: m,
+				text: c,
 				name: t.name
 			} : {
-				value: h,
-				text: f
+				value: m,
+				text: c
 			};
-		}), h = {
-			name: n.name ?? b[e].name,
-			items: m
+		}), m = {
+			name: n.name ?? w[e].name,
+			items: f
 		};
 		if (t) {
 			const e = void 0 !== t.item ? (n.items ?? [])[t.item]?.item : void 0;
-			h.page = void 0 !== e ? f.findIndex((t) => t.item === e) : -1;
+			m.page = void 0 !== e ? c.findIndex((t) => t.item === e) : -1;
 		}
-		return h;
-	}, x = (e) => (e ?? []).filter((e) => -2 !== e);
+		return m;
+	}, y = (e) => (e ?? []).filter((e) => -2 !== e);
 	return {
 		view: {
-			range: g,
+			range: h,
 			dataFields: (e.dataFields ?? []).map((e) => ({
 				name: e.name,
-				sourceName: b[e.field].name
+				sourceName: w[e.field].name
 			})),
 			fields: [
-				...x(e.rowFields).map((e) => I(e)),
-				...x(e.columnFields).map((e) => I(e)),
-				...(e.pageFields ?? []).map((e) => I(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: h
+					row: f,
+					column: m
 				},
 				...r ? { blocked: !0 } : {},
 				...null !== d.firstKey ? { first: d.firstKey } : {}
@@ -867,84 +867,84 @@ var Y = [
 		}
 	};
 }, Oe = async (e, t, n, s) => {
-	const r = /* @__PURE__ */ new Map(), d = (e.filters ?? []).filter((t) => M(t) || e.rowFields?.includes(t.field) || e.columnFields?.includes(t.field)), f = e.fields?.some((e) => e.items?.some((e) => e.calculated)), m = e.dataFields?.some((e) => u(t.fields?.[e.field]));
-	if (0 === d.length && !f && !m) return { keep: r };
-	const h = w(t);
-	for (const o of d.filter(M)) {
-		const a = o.field, l = h[a];
+	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 = C(o.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 u = await $e(o.condition, d, n, s), f = r.get(a);
-		if (f) for (let e = 0; e < u.length; e++) f[e] &= u[e];
-		else r.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 g = f && s ? await (async (e, t, n, s, r) => {
-		const d = t.fields ?? [], f = e.fields ?? [], m = d.flatMap((e, t) => e.calculatedItems?.length ? [t] : []), h = e.dataFields ?? [];
-		if (1 !== m.length || h.some((e) => u(d[e.field]) || !ue.has(e.subtotal ?? "sum"))) return null;
-		const g = m[0], F = d[g].calculatedItems, b = te(t, n.isDate1904());
-		if (!b) return null;
-		const y = w(t), I = w({
+	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: d.map(({ group: e, ...t }) => t)
-		}), x = (e.rowFields ?? []).filter((e) => e >= 0), A = (e.columnFields ?? []).filter((e) => e >= 0), C = x.includes(g) ? x : A.includes(g) ? A : null;
-		if (!C) return null;
-		const E = C.slice(0, C.indexOf(g)), S = [...C.slice(C.indexOf(g) + 1), ...C === x ? A : x], P = [...E, ...S], k = t.recordCount ?? 0, M = (e, t) => {
-			const n = f[e]?.items, s = n?.find((e) => e.item === t && void 0 === e.type);
+			fields: l.map(({ group: e, ...t }) => t)
+		}), 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 === 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) || r?.get(e) && 0 === r.get(e)[t]);
-		}, T = (e, t) => {
-			const n = f[e.field]?.items;
+		}, 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;
-		}, R = e.pageFields ?? [], O = p(d[g].numberFormat ?? 14, n), $ = (e) => y[g].findIndex((t, s) => {
-			const r = c(t);
-			return "number" == typeof r && (d[g].dates || v(d[g], s)) ? l(o(n, O, r), e) : l(null === r ? i : N(r), e);
-		}), L = /* @__PURE__ */ new Map(), _ = new Map(F.map((e) => [e.item, e.formula])), D = (e) => {
-			let t = L.get(e);
-			return void 0 === t && L.set(e, t = L.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 F) if (null === oe(e.formula, (e, t) => {
-			if (null === t || !l(d[g].name, e)) return null;
-			const n = $(t);
+		for (const e of m) if (null === oe(e.formula, (e, t) => {
+			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 V = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), H = h.map((e) => ({
-			column: b[e.field],
-			values: I[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"
-		})), B = L.size;
-		for (let e = 0; e < k; e++) {
-			if (!R.every((t) => T(t, b[t.field][e]))) continue;
-			if (!P.every((t) => M(t, b[t][e]))) continue;
+		})), B = $.size;
+		for (let e = 0; e < P; e++) {
+			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 E) t += b[n][e] + ",";
+			for (const n of x) t += h[n][e] + ",";
 			U.has(t) || U.set(t, e);
-			const n = L.get(b[g][e]);
+			const n = $.get(h[f][e]);
 			if (void 0 === n) continue;
 			let s = t;
-			for (const t of S) s += b[t][e] + ",";
+			for (const t of A) s += h[t][e] + ",";
 			let r = V.get(s);
 			r || (r = {
-				sums: h.map(() => new Array(B).fill(0)),
-				errors: h.map(() => new Array(B).fill(void 0))
+				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 = c(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 G = S.map((e) => {
-			const t = f[e]?.items;
-			return t ? t.flatMap((t) => void 0 !== t.item && void 0 === t.type && !t.missing && M(e, t.item) ? [t.item] : []) : y[e].map((e, t) => t);
+		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] : []) : g[e].map((e, t) => t);
 		});
-		if (G.reduce((e, t) => e * t.length, U.size) > 5e5) return null;
-		const z = [];
+		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 !== G.length) for (const t of G[e]) n(e + 1, [...s, t], r + t + ",");
-				else z.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,82 +952,82 @@ var Y = [
 			};
 			n(0, [], e);
 		}
-		const j = z.length;
+		const j = G.length;
 		if (0 === j) return {
 			count: 0,
-			ids: d.map(() => []),
-			values: h.map(() => [])
+			ids: l.map(() => []),
+			values: u.map(() => [])
 		};
-		const q = h.length * B, K = (e, t) => e * B + t, Q = (e, t) => q + e * F.length + t, J = [];
-		for (let e = 0; e < h.length; e++) for (let t = 0; t < B; t++) J.push(z.map(({ key: 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 < h.length; e++) for (let t = 0; t < F.length; t++) {
-			const n = oe(F[t].formula, (t, n) => {
+		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 = $(n), r = F.findIndex((e) => e.item === s);
-				return ae(r >= 0 ? Q(e, r) : K(e, L.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(Q(e, t), j)
+				coords: le(K(e, t), j)
 			});
 		}
-		const X = await s.evaluateBatch({
+		const Y = await s.evaluateBatch({
 			values: ie(J, j),
 			formulas: W
-		}), Y = d.map(() => []), Z = h.map(() => []), ee = (e, t, n, s) => {
-			b.forEach((n, s) => {
-				const r = S.indexOf(s);
-				Y[s].push(s === g ? t : r >= 0 ? e.path[r] : n[e.exemplar] ?? 0);
+		}), 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);
 			}), Z.forEach((e, t) => {
 				e.push(t === n ? s : null);
 			});
 		};
-		return z.forEach((e, t) => {
-			F.forEach(({ item: n }, s) => {
-				h.forEach((r, o) => {
-					const a = X[o * F.length + s].getValueAt(t, 0) ?? 0;
+		return G.forEach((e, t) => {
+			m.forEach(({ item: n }, s) => {
+				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);
 				});
 			});
 		}), {
-			count: Y[0]?.length ?? 0,
-			ids: Y,
+			count: X[0]?.length ?? 0,
+			ids: X,
 			values: Z
 		};
-	})(e, t, n, s, r) : void 0, F = d.filter((e) => !M(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), y = (t.recordCount ?? 0) + (g?.count ?? 0);
-	let I;
-	const x = e.rowFields ?? [];
-	for (const { filter: o } of F) {
-		const a = await Ae(e, t, n, o.field, o.dataField, r, I, g, s);
+	})).sort((e, t) => (e.filter.evalOrder ?? -1) - (t.filter.evalOrder ?? -1) || e.index - t.index), h = (t.recordCount ?? 0) + (f?.count ?? 0);
+	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 r = await $e(o.condition, t.totals, n, s);
+			const r = await Le(o.condition, t.totals, n, s);
 			t.ids.forEach((t, n) => {
 				r[n] || l.add(`${e}|${t}`);
 			});
 		}
 		if (0 === l.size) continue;
-		I ??= new Uint8Array(y).fill(3);
-		const i = a.outer.map((e) => a.records[e]), d = a.records[o.field], u = x.includes(o.field) ? 1 : 2;
-		for (let e = 0; e < y; e++) {
-			if (!(I[e] & u)) continue;
+		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 (!(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]}`) && (I[e] &= ~u);
+			l.has(`${t}|${d[e]}`) && (g[e] &= ~u);
 		}
 	}
-	const A = m && s ? await (async (e, t, n, s, r, o, a) => {
-		const l = b.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 Y = [
 			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, s, r, I, g) : void 0;
+	})(e, t, n, s, r, g, f) : void 0;
 	return {
 		keep: r,
-		...I ? { records: I } : {},
-		...g ? { calculatedRecords: g } : {},
-		...A ? { fieldValues: A } : {}
+		...g ? { records: g } : {},
+		...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 && O(e.condition, t);
+		const n = e.condition && g(e.condition, t);
 		return n === e.condition ? e : (s = !0, {
 			...e,
 			condition: n
@@ -1058,10 +1058,10 @@ 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 V();
+	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 _({
@@ -1086,20 +1086,20 @@ var Y = [
 			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, s, r) => {
-	const l = e.fields?.[s], d = /* @__PURE__ */ new Map();
-	for (const e of l?.items ?? []) void 0 !== e.item && void 0 === e.type && void 0 !== e.name && d.set(e.item, e.name);
-	const u = l?.numberFormat ?? t.fields?.[s]?.numberFormat, f = p(u, r), m = (e) => void 0 === u ? p(P(t.fields?.[s], e), r) : f, h = new Array(n.length);
+}, $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?.[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 = d.get(e);
+		const l = i.get(e);
 		if (void 0 !== l) {
-			h[e] = l;
+			f[e] = l;
 			continue;
 		}
-		const u = c(n[e]);
-		null === u ? h[e] = i : "number" == typeof u ? h[e] = o(r, v(t.fields?.[s], e) ? m(e) : f, u) : "boolean" == typeof u ? h[e] = u ? "TRUE" : "FALSE" : a.isError(u) ? h[e] = u.getLabel() : h[e] = String(u);
+		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 h;
+	return f;
 }, _e = (e) => {
 	const t = e.getCoords(), n = t.colEnd - t.colStart + 1, s = t.rowEnd - t.rowStart, r = e.getWorksheet(), o = r.getRange({
 		rowStart: t.rowStart,
@@ -1185,8 +1185,8 @@ var Y = [
 } : a.isError(e) ? {
 	t: "e",
 	v: e.getCode()
-} : e, Ge = (e, t) => (t && "number" == typeof e ? "date:" : "") + h(c(e)), ze = (e, t, n, s = !1) => {
-	const r = e.fields ?? [], o = $(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;
@@ -1199,8 +1199,8 @@ var Y = [
 		const n = e.name.toLocaleLowerCase();
 		e.noRecords || i.has(n) || i.set(n, t);
 	});
-	const d = t.recordCount, f = r.map(() => -1), m = r.map((e, t) => o[t].map(() => -1)), p = [], h = [], g = [], w = [], F = [], b = [], y = [], I = (e, t, n) => {
-		w[t] = n.items, b[t] = n.items.length, y[t] = !0, m[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);
@@ -1209,108 +1209,108 @@ var Y = [
 	};
 	t.columns.forEach((e, t) => {
 		const n = i.get(l[t].toLocaleLowerCase());
-		void 0 !== n && (i.delete(l[t].toLocaleLowerCase()), f[n] = t);
-		const u = new Int32Array(e.values.length).fill(-1), x = [], A = [], C = new Array(d);
+		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 = u[n];
-			s < 0 && (s = u[n] = x.length, x.push(Be(e.values[n])), A.push(e.dates || !!e.dateIds?.has(n))), C[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 || v(r[n], e)), S = x.length, P = void 0 !== n ? !0 === r[n].inline : x.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(Ge(x[t], A[t]), t);
+			for (let t = 0; t < P; t++) e.set(qe(I[t], x[t]), t);
 			o[n].forEach((t, s) => {
-				m[n][s] = e.get(Ge(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(Ge(x[t], A[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 = Ge(s, E(r));
+				const o = qe(s, C(r));
 				let l = e.get(o);
-				void 0 !== l || a || E(r) || (l = x.length, x.push(s), A.push(E(r)), k.push(l), e.set(o, l)), m[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;
-		x.forEach((e, t) => {
-			"number" == typeof e && (A[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 = x.length;
-			return x.push(o[n][e]), m[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
 			};
-		})), p.push(M), h.push([t, [[0, x]]]), g.push([t, [[0, C]]]), w.push(x), 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($, x.slice(0, S).map(c), s);
-			e ? (M.group = {
+			const e = re($, I.slice(0, P).map(S), s);
+			e ? (T.group = {
 				...e,
 				base: t
-			}, I(n, t, e)) : m[n] = o[n].map(() => -1);
-		} else $ && !U(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 (u(e)) return f[t] = p.length, p.push(e), w.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 = f[n.base];
+		const r = u[n.base];
 		if (void 0 === r || r < 0) return;
-		const o = w[r];
+		const o = h[r];
 		let a, l = [];
-		if (n.range) a = re(n, o.slice(0, b[r]).map(c), s);
+		if (n.range) a = re(n, o.slice(0, w[r]).map(S), s);
 		else {
-			const e = je(n, m[n.base], o, p[r]);
+			const e = je(n, c[n.base], o, f[r]);
 			a = e.group, l = e.itemMap;
 		}
 		if (!a) return;
-		const i = p.length;
-		f[t] = i, p.push({
+		const i = f.length;
+		u[t] = i, f.push({
 			...e,
 			group: {
 				...a,
 				base: r
 			}
-		}), w.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) : m[t] = l;
-	}), p.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 = f[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
-		} : U(e) ? e.group = o : delete e.group, e.group && !U(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: C, fields: E, items: S, records: P, ...k } = e;
+	const { cacheId: I, part: x, partFormats: A, fields: C, items: P, records: k, ...M } = e;
 	return {
 		model: {
-			...k,
+			...M,
 			source: n ?? e.source,
-			fields: p,
-			items: h,
-			records: g,
+			fields: f,
+			items: m,
+			records: p,
 			recordCount: d
 		},
 		remap: {
-			fields: f,
-			items: m,
-			newItems: w,
-			usedCounts: b,
-			inItemOrder: y,
-			dateItems: F
+			fields: u,
+			items: c,
+			newItems: h,
+			usedCounts: w,
+			inItemOrder: v,
+			dateItems: g
 		}
 	};
 }, je = (e, t, n, s) => {
@@ -1319,7 +1319,7 @@ var Y = [
 		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 || v(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,10 +1329,10 @@ var Y = [
 		},
 		itemMap: d
 	};
-}, qe = (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;
-}, Ke = (e, t) => {
+}, Qe = (e, t) => {
 	const n = e.fields ?? [], s = t.newItems.length, r = (e) => e < 0 ? e : t.fields[e] ?? -1, o = (e) => e < 0 || r(e) >= 0, a = e.dataFields ?? [], l = [], i = [];
 	a.forEach((e) => {
 		if (!o(e.field)) return void l.push(-1);
@@ -1384,7 +1384,7 @@ var Y = [
 		...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) => {
+	Ke(f, "rowFields", c(e.rowFields)), Ke(f, "columnFields", c(e.columnFields)), Ke(f, "dataFields", i.length > 0 ? i : void 0), a.forEach((e, t) => {
 		const n = l[t];
 		if (n < 0 || void 0 === e.baseField || "number" != typeof e.baseItem) return;
 		const s = d[e.baseField]?.[e.baseItem];
@@ -1394,12 +1394,12 @@ var Y = [
 		if (!o(e.field)) return [];
 		const t = { field: r(e.field) };
 		if (void 0 !== e.item) {
-			const n = Xe(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];
 	});
-	Qe(f, "pageFields", m.length > 0 ? m : void 0);
+	Ke(f, "pageFields", m.length > 0 ? m : void 0);
 	const p = (e.filters ?? []).flatMap((e) => {
 		if (!o(e.field)) return [];
 		const t = {
@@ -1413,15 +1413,15 @@ var Y = [
 		}
 		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) => {
+	Ke(f, "filters", p.length > 0 ? p : void 0);
+	const h = (e) => Xe(e, r, o, d, l), g = (e.formats ?? []).flatMap((e) => {
 		const t = h(e.area);
 		return t ? [{
 			...e,
 			area: t
 		}] : [];
 	});
-	Qe(f, "formats", g.length > 0 ? g : void 0);
+	Ke(f, "formats", g.length > 0 ? g : void 0);
 	const w = (e.conditionalFormats ?? []).flatMap((e) => {
 		const t = e.areas.flatMap((e) => {
 			const t = h(e);
@@ -1432,80 +1432,80 @@ var Y = [
 			areas: t
 		}] : [];
 	});
-	return Qe(f, "conditionalFormats", w.length > 0 ? w : void 0), f;
-}, Qe = (e, t, n) => {
+	return Ke(f, "conditionalFormats", w.length > 0 ? w : void 0), f;
+}, 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 (!z(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) => !z(e.item)), o = [...[...s.filter((e) => z(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 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) => qe(S(e, n), c(n[t]), void 0 === e.name && o?.has(e.item), o?.has(t));
-		for (const e of u) {
+		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 = l.findIndex((n) => z(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]++;
+			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(m));
-		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) => !z(e));
+	const t = e.findIndex((e) => !H(e));
 	return t < 0 ? e.length : t;
-}, Xe = (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 (z(r) && !r.missing) return s;
+		if (H(r) && !r.missing) return s;
 	}
-}, Ye = (e, t, n, s, r) => {
+}, Xe = (e, t, n, s, r) => {
 	const o = { ...e };
 	if (void 0 !== e.field) {
 		if (!n(e.field)) return null;
@@ -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 l = s.map((e, n) => n === t ? o : null), i = (e.dataFields ?? []).map((e, t) => t), d = (e) => Xe(e, (e) => e, () => !0, l, i) ?? e;
 	return e.formats && (a.formats = e.formats.map((e) => ({
 		...e,
 		area: d(e.area)
@@ -1578,43 +1578,43 @@ var Y = [
 		areas: e.areas.map(d)
 	}))), a;
 }, et = (e, t, n, s) => {
-	const r = (e.fields ?? [])[n]?.items ?? [], o = w(t)[n] ?? [], a = t.fields?.[n], l = void 0 !== a?.group?.range, i = (e) => void 0 === e.name && v(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
-	})), u = d.filter((e) => z(e.item));
-	u.sort((e, t) => l ? e.item.item - t.item.item : qe(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) => z(e.item) ? u[c++] : e).map((e) => e.at));
+	})), 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 = Ze(e, n, u.map((e) => H(e.item) ? c[f++] : e).map((e) => e.at));
 	return {
-		...f,
-		fields: f.fields.map((e, t) => t === n ? {
+		...m,
+		fields: m.fields.map((e, t) => t === n ? {
 			...e,
 			sort: { order: s }
 		} : e)
 	};
 }, tt = (n, s, r) => {
 	const o = n.fields?.[s]?.items?.[r];
-	if (!o || !z(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 d = tt(n, r, o), u = n.fields[r].items, f = w(s)[r] ?? [], m = (e) => {
-		const t = c(f[e.item]);
-		return null === t ? i : N(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 (u.some((e, t) => t !== o && z(e) && l(e.name ?? m(e), a))) throw new t(e("error.pivotTable.itemNameExists", { name: a }));
-	const { name: p, ...h } = d, g = a === m(d) ? h : {
-		...d,
+	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 (g.name === d.name) return n;
-	const v = {
+	if (h.name === l.name) return n;
+	const g = {
 		...n,
 		fields: n.fields.map((e, t) => t === r ? {
 			...e,
-			items: u.map((e, t) => t === o ? g : e)
+			items: i.map((e, t) => t === o ? h : e)
 		} : e)
-	}, F = n.fields[r].sort;
-	return F && void 0 === F.dataField ? et(v, s, r, F.order) : v;
+	}, 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);
@@ -1631,36 +1631,36 @@ var Y = [
 		})
 	} : a;
 }, rt = (n, s, r, o) => {
-	const a = N(o), d = n.fields, u = s.fields, f = n.dataFields ?? [], m = w(s), p = (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 = c(m[e][t.item]);
-		return null === n ? i : N(n);
-	}, h = (r) => {
-		if (void 0 !== r.field && a === (d[r.field].name ?? u[r.field].name)) return;
+		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,
-			fields: d.map((e, t) => t === r.field ? {
+			fields: l.map((e, t) => t === r.field ? {
 				...e,
 				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 = d[e].items.findIndex((n, s) => s !== t && z(n) && l(p(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 h({ field: e }), ((e, t) => ({
+			return m({ field: e }), ((e, t) => ({
 				...n,
-				fields: d.map((n, s) => s === e ? t(n) : n)
+				fields: l.map((n, s) => s === e ? t(n) : n)
 			}))(e, (t) => {
 				const { name: n, ...s } = t;
-				return a === u[e].name ? s : {
+				return a === i[e].name ? s : {
 					...t,
 					name: a
 				};
@@ -1668,9 +1668,9 @@ var Y = [
 		}
 		case "dataCaption": {
 			const { data: e } = r;
-			return h({ data: e }), {
+			return m({ data: e }), {
 				...n,
-				dataFields: f.map((t, n) => n === e ? {
+				dataFields: d.map((t, n) => n === e ? {
 					...t,
 					name: a
 				} : t)
@@ -1691,18 +1691,18 @@ var Y = [
 		case "pageItem": {
 			const s = n.pageFields, o = s[r.page];
 			let i;
-			if (!l(a, "(All)") && (i = (d[o.field].items ?? []).findIndex((e) => z(e) && l(p(o.field, e), a)), i < 0)) throw new t(e("error.pivotTable.notAnItem", { name: a }));
-			const { item: u, ...c } = o, f = void 0 === i ? c : {
+			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
 			};
 			return {
 				...n,
-				pageFields: s.map((e, t) => t === r.page ? f : e)
+				pageFields: s.map((e, t) => t === r.page ? c : e)
 			};
 		}
 	}
-}, ot = (e, t, n) => ze({
+}, 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 Y = [
 	...e.columnFields ?? [],
 	...(e.pageFields ?? []).map((e) => e.field)
 ].filter((e) => e >= 0), it = (e, t) => {
-	const n = e.fields[t], s = w(e)[t], r = s.map((e, t) => t);
-	U(n) || r.sort((e, t) => qe(c(s[e]), c(s[t]), v(n, e), v(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,
@@ -1728,42 +1728,42 @@ var Y = [
 }, dt = (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" === L(e, t) ? "sum" : "count")(s.fields[r], w(s)[r]), l = x[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 i = o?.name;
-	if (void 0 === i) i = F(n, s, `${l} of ${B(n, s, r)}`);
-	else if (F(n, s, i) !== i) throw new t(e("error.pivotTable.fieldNameExists"));
-	const d = {
-		name: i,
+	let d = o?.name;
+	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 && (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) => l(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(), i = (e, t) => {
+	}, a = /* @__PURE__ */ new Map(), l = (e, t) => {
 		for (const n of e ?? []) {
 			const e = o(n);
 			a.delete(e), a.set(e, t);
 		}
 	};
-	i(s?.rows, "row"), i(s?.columns, "column"), i(s?.pages, "page");
-	const d = (e) => [...a].filter(([, t]) => t === e).map(([e]) => e), u = [];
+	l(s?.rows, "row"), l(s?.columns, "column"), l(s?.pages, "page");
+	const i = (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;
-		u.push(ut({ dataFields: u }, n, o(t), s));
+		d.push(ut({ dataFields: d }, n, o(t), s));
 	}
-	const c = new Set(u.map((e) => e.field)), f = s?.form && "compact" !== s.form ? s.form : void 0, m = r.map((e, t) => {
+	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)), c.has(t) && (s.dataField = !0), f && (s.form = f), e.dates && void 0 !== e.numberFormat && (s.numberFormat = e.numberFormat), s;
-	}), p = d("column");
-	u.length > 1 && p.push(-2);
-	const h = {
-		fields: m,
+		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");
+	d.length > 1 && m.push(-2);
+	const p = {
+		fields: f,
 		style: {
 			name: s?.style ?? "PivotStyleLight16",
 			showRowHeaders: !0,
@@ -1772,14 +1772,14 @@ var Y = [
 			showColumnStripes: !1,
 			showLastColumn: !0
 		}
-	}, g = d("row");
-	g.length > 0 && (h.rowFields = g), p.length > 0 && (h.columnFields = p);
-	const w = d("page");
-	return w.length > 0 && (h.pageFields = w.map((e) => ({ field: e }))), u.length > 0 && (h.dataFields = u), f && (h.form = f), h;
+	}, h = i("row");
+	h.length > 0 && (p.rowFields = h), m.length > 0 && (p.columnFields = m);
+	const g = i("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 === A.Axis.Row ? e.columnFields : t.axis === A.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 Y = [
 		}
 	};
 }), mt = (n, s, r, o, a) => {
-	const l = A.Axis, i = s.fields?.[r], u = 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 === u) return n;
+		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 ? H(n, o).filter((e) => e !== r) : [];
-	if (void 0 !== a && (!Number.isInteger(a) || a < 1 || a > c.length + 1)) throw new t(e("error.pivotTable.fieldPosition"));
-	const f = (a ?? c.length + 1) - 1;
-	if (o === u && (void 0 === a || H(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);
-	let I = {
-		...g,
-		...w
+	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 || P(n, o)[c] === r)) return n;
+	u.splice(c, 0, r);
+	const { rowFields: f, columnFields: m, pageFields: p, ...h } = n, g = {}, w = (e) => (e ?? []).filter((e) => e !== r), v = o === 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 && u !== 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 = d(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 C = (n.fields ?? []).map((e, t) => t === r ? x : e);
-	if (I = {
-		...I,
-		fields: ft(I, C)
+	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",
@@ -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) => Xe(e, (e) => e, () => !0, [], n), m = (e.formats ?? []).flatMap((e) => {
 		const t = f(e.area);
 		return t ? [{
 			...e,
@@ -1955,7 +1955,7 @@ var Y = [
 		l[e] = t;
 	}), It(n, a.map((e) => o[e]), l);
 }, Et = (e, t, n, s) => {
-	const r = j(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 Y = [
 		};
 		return "sum" !== s && (o.subtotal = s), o;
 	});
-}, St = (n, s, r, o) => {
-	const a = n.dataFields[r], i = a.showDataAs ?? "normal", d = o?.kind ?? "normal";
+}, 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: u, baseField: c, baseItem: f, ...m } = a, p = { ...m };
-	"normal" !== d && (p.showDataAs = d);
-	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) => l(B(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 (l(o.baseItem, "(previous)")) g = "previous";
-		else if (l(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) }, i = T(a, s, r).findIndex((e) => null !== e && l(e, o.baseItem));
-			if (i < 0) throw new t(e("error.pivotTable.notAnItem", { name: o.baseItem }));
-			g = i;
+			} : 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 }));
+			h = l;
 		}
 	}
-	if (void 0 !== h && (p.baseField = h), void 0 !== g && (p.baseItem = g), d === i) 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) => y(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, i, d);
-	return w === a.numberFormat ? bt(n, r, () => p) : bt(Ft(n, r), r, () => yt(p, w));
-}, Pt = (e, t, n) => {
+	})(a.numberFormat, l, i);
+	return g === a.numberFormat ? bt(n, r, () => m) : bt(Ft(n, r), r, () => yt(m, g));
+}, St = (e, t, n) => {
 	dt(n);
-	const s = y(n), r = e.dataFields[t], o = e.formats?.[e.formats.length - 1];
-	if (y(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,16 +2014,16 @@ var Y = [
 	};
 }, kt = (n, s, r) => {
 	if (null === s) return At(n);
-	const o = A.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 = H(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 || H(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 = H(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 { 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;
@@ -2031,10 +2031,10 @@ var Y = [
 		...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, M 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, 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 };