@agile-team/mach-report 2.22.0 → 2.23.0

package/dist/{computed-C8NRZQss.js → computed-f3pOqWLX.js}

@@ -1,81 +1,93 @@
-function g(r) {
-  if (!Number.isSafeInteger(r) || r < 0 || r > 1e3 * 2)
+function G(r, e, t) {
+  if (!Array.isArray(r) || Object.getPrototypeOf(r) !== Array.prototype || r.length > e) throw new TypeError(`${t}应为有界普通数组`);
+  if (Reflect.ownKeys(r).length !== r.length + 1) throw new TypeError(`${t}不支持自定义数组方法或迭代器`);
+  const n = [];
+  for (let o = 0; o < r.length; o++) {
+    const c = Object.getOwnPropertyDescriptor(r, String(o));
+    if (!c || !Object.prototype.hasOwnProperty.call(c, "value")) throw new TypeError(`${t}不支持空洞或访问器`);
+    n.push(c.value);
+  }
+  return n;
+}
+const b = 1e3;
+function d(r) {
+  if (!Number.isSafeInteger(r) || r < 0 || r > b * 2)
     throw new Error("十进制精度超出预算");
   return 10n ** BigInt(r);
 }
-function O(r) {
-  if (r.coefficient.toString().length > 1e3 * 2 || r.scale > 1e3 * 2)
+function j(r) {
+  if (r.coefficient.toString().length > b * 2 || r.scale > b * 2)
     throw new Error("十进制结果超出精度预算");
   return r;
 }
-function l(r) {
+function u(r) {
   if (typeof r != "string" && !(typeof r == "number" && Number.isFinite(r)))
     throw new Error("十进制参数必须是有限数字或十进制文本");
   const e = String(r);
-  if (e.length > 1e3) throw new Error("十进制文本超出精度预算");
+  if (e.length > b) throw new Error("十进制文本超出精度预算");
   const t = /^([+-]?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d{1,4}))?$/.exec(
     e
   );
   if (!t) throw new Error("无效十进制文本");
-  const n = t[3] ?? "", i = Number(t[4] ?? 0), c = n.length - i, o = BigInt(
+  const n = t[3] ?? "", o = Number(t[4] ?? 0), c = n.length - o, i = BigInt(
     `${t[1] === "-" ? "-" : ""}${t[2]}${n}`
   );
-  return O(
-    c < 0 ? { coefficient: o * g(-c), scale: 0 } : { coefficient: o, scale: c }
+  return j(
+    c < 0 ? { coefficient: i * d(-c), scale: 0 } : { coefficient: i, scale: c }
   );
 }
-function J(r, e) {
+function L(r, e) {
   const t = Math.max(r.scale, e.scale);
   return [
-    r.coefficient * g(t - r.scale),
-    e.coefficient * g(t - e.scale),
+    r.coefficient * d(t - r.scale),
+    e.coefficient * d(t - e.scale),
     t
   ];
 }
-function b(r, e) {
-  const [t, n] = J(r, e);
+function A(r, e) {
+  const [t, n] = L(r, e);
   return t < n ? -1 : t > n ? 1 : 0;
 }
-function E(r, e) {
-  const [t, n, i] = J(r, e);
-  return O({ coefficient: t + n, scale: i });
+function O(r, e) {
+  const [t, n, o] = L(r, e);
+  return j({ coefficient: t + n, scale: o });
 }
-function Y(r, e) {
-  return O({
+function P(r, e) {
+  return j({
     coefficient: r.coefficient * e.coefficient,
     scale: r.scale + e.scale
   });
 }
-function V(r, e) {
-  const t = r / e, n = r % e, i = (c) => c < 0n ? -c : c;
-  return i(n) * 2n < i(e) ? t : t + (r < 0n == e < 0n ? 1n : -1n);
+function H(r, e) {
+  const t = r / e, n = r % e, o = (c) => c < 0n ? -c : c;
+  return o(n) * 2n < o(e) ? t : t + (r < 0n == e < 0n ? 1n : -1n);
 }
-function w(r) {
+function h(r) {
   if (!Number.isInteger(r) || r < 0 || r > 100)
     throw new Error("十进制小数位应为 0–100 的整数");
 }
-function j(r, e, t = 20) {
-  if (w(t), e.coefficient === 0n) throw new Error("不能除以零");
-  const n = e.scale - r.scale + t, i = r.coefficient * g(Math.max(0, n)), c = e.coefficient * g(Math.max(0, -n));
-  return O({
-    coefficient: V(i, c),
+function k(r, e, t = 20) {
+  if (h(t), e.coefficient === 0n) throw new Error("不能除以零");
+  const n = e.scale - r.scale + t, o = r.coefficient * d(Math.max(0, n)), c = e.coefficient * d(Math.max(0, -n));
+  return j({
+    coefficient: H(o, c),
     scale: t
   });
 }
-function S(r, e) {
+function F(r, e) {
   let t = r.coefficient, n = r.scale;
-  e !== void 0 && (w(e), t = e >= n ? t * g(e - n) : V(t, g(n - e)), n = e);
-  const i = t < 0n, c = (i ? -t : t).toString().padStart(n + 1, "0");
-  let o = n ? c.slice(-n) : "";
-  return e === void 0 && (o = o.replace(/0+$/, "")), `${i ? "-" : ""}${n ? c.slice(0, -n) : c}${o ? `.${o}` : ""}`;
-}
-function Fr(r, e, t = !1, n = !1) {
-  let i = l(r);
-  n && (i = Y(i, { coefficient: 100n, scale: 0 }));
-  const [c, o] = S(i, e).split(".");
-  return `${t ? c.replace(/\B(?=(\d{3})+(?!\d))/g, ",") : c}${o === void 0 ? "" : `.${o}`}${n ? "%" : ""}`;
-}
-const H = [
+  e !== void 0 && (h(e), t = e >= n ? t * d(e - n) : H(t, d(n - e)), n = e);
+  const o = t < 0n, c = (o ? -t : t).toString().padStart(n + 1, "0");
+  let i = n ? c.slice(-n) : "";
+  return e === void 0 && (i = i.replace(/0+$/, "")), `${o ? "-" : ""}${n ? c.slice(0, -n) : c}${i ? `.${i}` : ""}`;
+}
+function Cr(r, e, t = !1, n = !1) {
+  let o = u(r);
+  n && (o = P(o, { coefficient: 100n, scale: 0 }));
+  const [c, i] = F(o, e).split(".");
+  return `${t ? c.replace(/\B(?=(\d{3})+(?!\d))/g, ",") : c}${i === void 0 ? "" : `.${i}`}${n ? "%" : ""}`;
+}
+const er = [
   "sum",
   "count",
   "avg",
@@ -83,143 +95,143 @@ const H = [
   "max",
   "weightedAvg"
 ];
-function _(r) {
+function I(r) {
   if (typeof r != "number" || !Number.isFinite(r))
     throw new Error(
       "聚合度量必须是有限数字，不能隐式转换；小数文本请显式选择 decimal"
     );
   return r;
 }
-function A(r, e) {
+function v(r, e) {
   return e && Object.prototype.hasOwnProperty.call(r, e) ? r[e] : void 0;
 }
-function Q(r) {
-  let e = 0, t = 0, n = 0, i = 0, c = 1 / 0, o = -1 / 0;
+function tr(r) {
+  let e = 0, t = 0, n = 0, o = 0, c = 1 / 0, i = -1 / 0;
   const a = (s) => {
-    const f = s - n, u = t + f;
-    n = u - t - f, t = u;
+    const f = s - n, l = t + f;
+    n = l - t - f, t = l;
   };
   return {
     add(s) {
-      const f = A(s, r.field);
+      const f = v(s, r.field);
       if (r.op === "count") {
         (!r.field || f != null) && e++;
         return;
       }
       if (f == null) return;
-      const u = _(f), C = r.op === "weightedAvg" ? A(s, r.weightField) : 1;
-      if (C == null) return;
-      const N = _(C);
-      if (r.op === "weightedAvg" && N < 0)
+      const l = I(f), g = r.op === "weightedAvg" ? v(s, r.weightField) : 1;
+      if (g == null) return;
+      const x = I(g);
+      if (r.op === "weightedAvg" && x < 0)
         throw new Error("加权平均的权重不能为负数");
-      ["sum", "avg", "weightedAvg"].includes(r.op) && a(u * N), i += N, c = Math.min(c, u), o = Math.max(o, u), e++;
+      ["sum", "avg", "weightedAvg"].includes(r.op) && a(l * x), o += x, c = Math.min(c, l), i = Math.max(i, l), e++;
     },
     value() {
       if (r.op === "count") return e;
       if (!e) return null;
-      const s = r.op === "min" ? c : r.op === "max" ? o : r.op === "avg" ? t / e : r.op === "weightedAvg" ? i === 0 ? null : t / i : t;
+      const s = r.op === "min" ? c : r.op === "max" ? i : r.op === "avg" ? t / e : r.op === "weightedAvg" ? o === 0 ? null : t / o : t;
       if (s !== null && !Number.isFinite(s))
         throw new Error("聚合计算溢出");
       return s;
     }
   };
 }
-function q(r) {
-  let e = 0, t = l("0"), n = l("0"), i, c;
+function nr(r) {
+  let e = 0, t = u("0"), n = u("0"), o, c;
   return {
-    add(o) {
-      const a = A(o, r.field);
+    add(i) {
+      const a = v(i, r.field);
       if (r.op === "count") {
         (!r.field || a != null) && e++;
         return;
       }
       if (a == null) return;
-      const s = r.op === "weightedAvg" ? A(o, r.weightField) : "1";
+      const s = r.op === "weightedAvg" ? v(i, r.weightField) : "1";
       if (s == null) return;
-      const f = l(a), u = l(s);
-      if (r.op === "weightedAvg" && u.coefficient < 0n)
+      const f = u(a), l = u(s);
+      if (r.op === "weightedAvg" && l.coefficient < 0n)
         throw new Error("加权平均的权重不能为负数");
-      ["sum", "avg", "weightedAvg"].includes(r.op) && (t = E(t, Y(f, u))), r.op === "weightedAvg" && (n = E(n, u)), (!i || b(f, i) < 0) && (i = f), (!c || b(f, c) > 0) && (c = f), e++;
+      ["sum", "avg", "weightedAvg"].includes(r.op) && (t = O(t, P(f, l))), r.op === "weightedAvg" && (n = O(n, l)), (!o || A(f, o) < 0) && (o = f), (!c || A(f, c) > 0) && (c = f), e++;
     },
     value() {
       if (r.op === "count") return e;
       if (!e || r.op === "weightedAvg" && n.coefficient === 0n)
         return null;
-      let o = r.op === "min" ? i : r.op === "max" ? c : t;
-      return r.op === "avg" && (o = j(t, l(e), r.digits)), r.op === "weightedAvg" && (o = j(t, n, r.digits)), S(o, r.digits);
+      let i = r.op === "min" ? o : r.op === "max" ? c : t;
+      return r.op === "avg" && (i = k(t, u(e), r.digits)), r.op === "weightedAvg" && (i = k(t, n, r.digits)), F(i, r.digits);
     }
   };
 }
-function rr(r) {
-  if (r.digits !== void 0 && w(r.digits), r.numeric !== void 0 && r.numeric !== "number" && r.numeric !== "decimal")
+function C(r) {
+  if (r.digits !== void 0 && h(r.digits), r.numeric !== void 0 && r.numeric !== "number" && r.numeric !== "decimal")
     throw new Error("未知聚合数值模式");
-  if (!H.includes(r.op)) throw new Error("未知聚合操作");
+  if (!er.includes(r.op)) throw new Error("未知聚合操作");
   if (r.op !== "count" && !r.field)
     throw new Error("聚合需要度量字段");
   if (r.op === "weightedAvg" && !r.weightField)
     throw new Error("加权平均需要权重字段");
-  return r.numeric === "decimal" ? q(r) : Q(r);
+  return r.numeric === "decimal" ? nr(r) : tr(r);
 }
-function $(r, e) {
-  const t = rr(e);
+function U(r, e) {
+  const t = C(e);
   for (const n of r) t.add(n);
   return t.value();
 }
-const Z = /* @__PURE__ */ new Set(["__proto__", "prototype", "constructor"]);
-function K(r) {
+const Q = /* @__PURE__ */ new Set(["__proto__", "prototype", "constructor"]);
+function q(r) {
   if (!r || typeof r != "object" || Array.isArray(r) || ![Object.prototype, null].includes(Object.getPrototypeOf(r))) throw new Error("条件应为普通声明式对象");
-  for (const [e, t] of Object.entries(Object.getOwnPropertyDescriptors(r))) if (Z.has(e) || !Object.prototype.hasOwnProperty.call(t, "value")) throw new Error("条件不允许访问器或不安全属性");
+  for (const [e, t] of Object.entries(Object.getOwnPropertyDescriptors(r))) if (Q.has(e) || !Object.prototype.hasOwnProperty.call(t, "value")) throw new Error("条件不允许访问器或不安全属性");
 }
-function T(r) {
-  if (typeof r != "string" || !r.trim() || r.length > 512 || Z.has(r)) throw new Error("条件字段应为安全的非空字段名");
+function V(r) {
+  if (typeof r != "string" || !r.trim() || r.length > 512 || Q.has(r)) throw new Error("条件字段应为安全的非空字段名");
 }
 function M(r) {
   if (r !== null && typeof r != "boolean" && typeof r != "string" && !(typeof r == "number" && Number.isFinite(r))) throw new Error("条件常量应为有限 JSON 标量");
   if (typeof r == "string" && r.length > 16384) throw new Error("条件文本超出预算");
 }
-function F(r) {
+function R(r) {
   if (typeof r != "string" || !/^\d{4}-\d{2}-\d{2}$/.test(r)) throw new Error("日期条件使用 YYYY-MM-DD 日历日");
-  const [e, t, n] = r.split("-").map(Number), i = /* @__PURE__ */ new Date(0);
-  if (i.setUTCFullYear(e, t - 1, n), i.setUTCHours(0, 0, 0, 0), i.getUTCFullYear() !== e || i.getUTCMonth() !== t - 1 || i.getUTCDate() !== n) throw new Error("无效日历日");
+  const [e, t, n] = r.split("-").map(Number), o = /* @__PURE__ */ new Date(0);
+  if (o.setUTCFullYear(e, t - 1, n), o.setUTCHours(0, 0, 0, 0), o.getUTCFullYear() !== e || o.getUTCMonth() !== t - 1 || o.getUTCDate() !== n) throw new Error("无效日历日");
   return r;
 }
-function B(r) {
+function W(r) {
   return ["string", "boolean"].includes(typeof r) || typeof r == "number" && Number.isFinite(r);
 }
-function U(r) {
+function z(r) {
   return r == null || r === "";
 }
-function er(r) {
+function or(r) {
   const e = r.values?.[0] ?? (r.right && "value" in r.right ? r.right.value : r.value);
   return r.valueType ?? r.numeric ?? (typeof e == "number" ? "decimal" : typeof e == "boolean" ? "boolean" : "text");
 }
-function h(r, e, t) {
-  if (U(r) || U(e)) return;
-  const n = er(t);
+function y(r, e, t) {
+  if (z(r) || z(e)) return;
+  const n = or(t);
   try {
-    if (n === "decimal") return b(l(r), l(e));
+    if (n === "decimal") return A(u(r), u(e));
     if (n === "number")
-      return !["number", "string"].includes(typeof r) || !["number", "string"].includes(typeof e) ? void 0 : b(l(r), l(e));
-    if (n === "date" && (r = F(r), e = F(e)), n === "boolean" && (typeof r != "boolean" || typeof e != "boolean") || n === "text" && (!B(r) || !B(e))) return;
-    const i = String(r), c = String(e);
-    return i < c ? -1 : i > c ? 1 : 0;
+      return !["number", "string"].includes(typeof r) || !["number", "string"].includes(typeof e) ? void 0 : A(u(r), u(e));
+    if (n === "date" && (r = R(r), e = R(e)), n === "boolean" && (typeof r != "boolean" || typeof e != "boolean") || n === "text" && (!W(r) || !W(e))) return;
+    const o = String(r), c = String(e);
+    return o < c ? -1 : o > c ? 1 : 0;
   } catch {
     return;
   }
 }
-function tr(r) {
-  if (T(r.field), ![">", ">=", "<", "<=", "==", "!=", "between", "contains", "isNull", "isNotNull"].includes(r.op)) throw new Error("未知条件运算符");
+function ir(r) {
+  if (V(r.field), ![">", ">=", "<", "<=", "==", "!=", "between", "contains", "isNull", "isNotNull"].includes(r.op)) throw new Error("未知条件运算符");
   if (r.numeric !== void 0 && !["number", "decimal"].includes(r.numeric)) throw new Error("未知条件数值模式");
   if (r.valueType !== void 0 && !["number", "decimal", "text", "date", "boolean"].includes(r.valueType)) throw new Error("未知条件值类型");
   if (!(r.op === "isNull" || r.op === "isNotNull"))
     if (r.op === "between") {
       if (!Array.isArray(r.values) || r.values.length !== 2 || Object.keys(r.values).length !== 2) throw new Error("范围条件需要两个明确边界");
       r.values.forEach(M);
-      const e = h(r.values[0], r.values[1], r);
+      const e = y(r.values[0], r.values[1], r);
       if (e === void 0 || e > 0) throw new Error("范围边界无效或顺序颠倒");
     } else if (r.right !== void 0) {
-      if (K(r.right), Object.keys(r.right).length !== 1) throw new Error("条件 right 只能指定一个 field 或 value");
-      if ("field" in r.right ? T(r.right.field) : M(r.right.value), r.value !== void 0) throw new Error("条件不能同时指定 value 和 right");
+      if (q(r.right), Object.keys(r.right).length !== 1) throw new Error("条件 right 只能指定一个 field 或 value");
+      if ("field" in r.right ? V(r.right.field) : M(r.right.value), r.value !== void 0) throw new Error("条件不能同时指定 value 和 right");
     } else M(r.value);
 }
 function D(r, e) {
@@ -241,45 +253,45 @@ function D(r, e) {
       return !1;
   }
 }
-function nr(r) {
-  tr(r), r = { ...r, right: r.right ? { ...r.right } : void 0, values: r.values ? [r.values[0], r.values[1]] : void 0 };
+function cr(r) {
+  ir(r), r = { ...r, right: r.right ? { ...r.right } : void 0, values: r.values ? [r.values[0], r.values[1]] : void 0 };
   const e = (t, n) => Object.prototype.hasOwnProperty.call(t, n) ? t[n] : void 0;
   return (t) => {
     const n = e(t, r.field);
     if (r.op === "isNull") return n == null;
     if (r.op === "isNotNull") return n != null;
-    if (r.op === "between") return D(">=", h(n, r.values[0], r)) && D("<=", h(n, r.values[1], r));
-    const i = r.right ? "field" in r.right ? e(t, r.right.field) : r.right.value : r.value;
-    return r.op === "contains" ? typeof n == "string" && typeof i == "string" && n.includes(i) : D(r.op, h(n, i, r));
+    if (r.op === "between") return D(">=", y(n, r.values[0], r)) && D("<=", y(n, r.values[1], r));
+    const o = r.right ? "field" in r.right ? e(t, r.right.field) : r.right.value : r.value;
+    return r.op === "contains" ? typeof n == "string" && typeof o == "string" && n.includes(o) : D(r.op, y(n, o, r));
   };
 }
-function p(r, e = { nodes: 0 }, t = 0) {
+function w(r, e = { nodes: 0 }, t = 0) {
   if (++e.nodes > 256 || t > 16) throw new Error("条件超出深度或节点预算");
-  if (K(r), ["all", "any", "not", "field"].filter((i) => Object.prototype.hasOwnProperty.call(r, i)).length !== 1) throw new Error("条件只能指定一种组合或比较");
+  if (q(r), ["all", "any", "not", "field"].filter((o) => Object.prototype.hasOwnProperty.call(r, o)).length !== 1) throw new Error("条件只能指定一种组合或比较");
   if ("not" in r) {
-    const i = p(r.not, e, t + 1);
-    return (c) => !i(c);
+    const o = w(r.not, e, t + 1);
+    return (c) => !o(c);
   }
   if ("all" in r || "any" in r) {
-    const i = "all" in r ? r.all : r.any;
-    if (!Array.isArray(i) || i.length < 1 || i.length > 256 || Object.keys(i).length !== i.length) throw new Error("组合条件需要有界、无空位的非空数组");
-    const c = i.map((o) => p(o, e, t + 1));
-    return "all" in r ? (o) => c.every((a) => a(o)) : (o) => c.some((a) => a(o));
+    const o = "all" in r ? r.all : r.any;
+    if (!Array.isArray(o) || o.length < 1 || o.length > 256 || Object.keys(o).length !== o.length) throw new Error("组合条件需要有界、无空位的非空数组");
+    const c = o.map((i) => w(i, e, t + 1));
+    return "all" in r ? (i) => c.every((a) => a(i)) : (i) => c.some((a) => a(i));
   }
-  return nr(r);
+  return cr(r);
 }
-function xr(r, e) {
-  return p(e)(r);
+function Yr(r, e) {
+  return w(e)(r);
 }
-function ir(r) {
-  p(r);
+function ar(r) {
+  w(r);
   const e = /* @__PURE__ */ new Set();
   function t(n) {
     "all" in n ? n.all.forEach(t) : "any" in n ? n.any.forEach(t) : "not" in n ? t(n.not) : (e.add(n.field), n.right && "field" in n.right && e.add(n.right.field));
   }
   return t(r), [...e];
 }
-const or = [
+const sr = [
   { name: "add", minArgs: 2, maxArgs: 256, input: "numeric", output: "numeric", example: "add(quantity, adjustment)" },
   { name: "subtract", minArgs: 2, maxArgs: 2, input: "numeric", output: "numeric", example: "subtract(input, output)" },
   { name: "multiply", minArgs: 2, maxArgs: 256, input: "numeric", output: "numeric", example: "multiply(quantity, price)" },
@@ -295,55 +307,55 @@ const or = [
   { name: "dateYear", minArgs: 1, maxArgs: 1, input: "YYYY-MM-DD", output: "number", example: "dateYear(reportDate)" },
   { name: "dateMonth", minArgs: 1, maxArgs: 1, input: "YYYY-MM-DD", output: "number", example: "dateMonth(reportDate)" },
   { name: "dateDay", minArgs: 1, maxArgs: 1, input: "YYYY-MM-DD", output: "number", example: "dateDay(reportDate)" }
-], x = Object.freeze(or.map((r) => Object.freeze(r)));
-function cr(r, e, t, n, i) {
+], T = Object.freeze(sr.map((r) => Object.freeze(r)));
+function fr(r, e, t, n, o) {
   if (e.some((a) => a == null)) {
-    if (i === "error") throw new Error("函数参数包含空值");
+    if (o === "error") throw new Error("函数参数包含空值");
     return null;
   }
-  if (r === "round" || r === "abs") return ar(r, e, t, n);
+  if (r === "round" || r === "abs") return lr(r, e, t, n);
   if (r.startsWith("date")) {
-    const a = F(e[0]);
+    const a = R(e[0]);
     return Number(a.slice(r === "dateYear" ? 0 : r === "dateMonth" ? 5 : 8, r === "dateYear" ? 4 : r === "dateMonth" ? 7 : 10));
   }
   if (e.some((a) => typeof a != "string")) throw new Error("文本函数只接受文本，不隐式转换数字或空值");
   if (e.reduce((a, s) => a + s.length, 0) > 1e6) throw new Error("计算文本超出长度预算");
-  const c = e[0], o = r === "concat" ? e.join("") : r === "trim" ? c.trim() : r === "upper" ? c.toUpperCase() : c.toLowerCase();
-  if (o.length > 1e6) throw new Error("计算文本超出长度预算");
-  return o;
-}
-function ar(r, e, t, n) {
-  const i = e[0];
-  if (t !== "decimal" && (typeof i != "number" || !Number.isFinite(i))) throw new Error("普通数值函数需要有限数字");
-  const c = l(i);
+  const c = e[0], i = r === "concat" ? e.join("") : r === "trim" ? c.trim() : r === "upper" ? c.toUpperCase() : c.toLowerCase();
+  if (i.length > 1e6) throw new Error("计算文本超出长度预算");
+  return i;
+}
+function lr(r, e, t, n) {
+  const o = e[0];
+  if (t !== "decimal" && (typeof o != "number" || !Number.isFinite(o))) throw new Error("普通数值函数需要有限数字");
+  const c = u(o);
   r === "abs" && (c.coefficient = c.coefficient < 0n ? -c.coefficient : c.coefficient);
-  const o = r === "round" ? e.length === 2 ? e[1] : n ?? 0 : n;
-  if (o !== void 0) {
-    if (typeof o != "number") throw new Error("小数位必须为数字");
-    w(o);
+  const i = r === "round" ? e.length === 2 ? e[1] : n ?? 0 : n;
+  if (i !== void 0) {
+    if (typeof i != "number") throw new Error("小数位必须为数字");
+    h(i);
   }
-  const a = S(c, o), s = Number(a);
+  const a = F(c, i), s = Number(a);
   if (t !== "decimal" && !Number.isFinite(s)) throw new Error("计算结果不是有限数字");
   return t === "decimal" ? a : s;
 }
-const sr = /* @__PURE__ */ new Set(["__proto__", "prototype", "constructor"]);
-function d(r) {
-  if (typeof r != "string" || !r.trim() || sr.has(r))
+const ur = /* @__PURE__ */ new Set(["__proto__", "prototype", "constructor"]);
+function m(r) {
+  if (typeof r != "string" || !r.trim() || ur.has(r))
     throw new Error("计算字段应为安全的非空字段名");
 }
-function I(r) {
+function Y(r) {
   return r === null || ["string", "boolean"].includes(typeof r) || typeof r == "number" && Number.isFinite(r);
 }
-function fr(r) {
+function mr(r) {
   if (r.some((e) => typeof e != "number" || !Number.isFinite(e)))
     throw new Error("算术参数必须是有限数字；空值和小数文本不会隐式转换");
   return r;
 }
-function ur(r, e) {
-  const t = fr(e);
+function gr(r, e) {
+  const t = mr(e);
   let n;
-  if (r === "add") n = t.reduce((i, c) => i + c, 0);
-  else if (r === "multiply") n = t.reduce((i, c) => i * c, 1);
+  if (r === "add") n = t.reduce((o, c) => o + c, 0);
+  else if (r === "multiply") n = t.reduce((o, c) => o * c, 1);
   else if (r === "subtract") n = t[0] - t[1];
   else {
     if (t[1] === 0) throw new Error("不能除以零");
@@ -352,19 +364,19 @@ function ur(r, e) {
   if (!Number.isFinite(n)) throw new Error("计算结果不是有限数字");
   return n;
 }
-function lr(r, e, t) {
-  const n = e.map(l);
-  let i;
-  return r === "add" ? i = n.reduce(E) : r === "multiply" ? i = n.reduce(Y) : r === "subtract" ? i = E(n[0], {
+function pr(r, e, t) {
+  const n = e.map(u);
+  let o;
+  return r === "add" ? o = n.reduce(O) : r === "multiply" ? o = n.reduce(P) : r === "subtract" ? o = O(n[0], {
     ...n[1],
     coefficient: -n[1].coefficient
-  }) : i = j(n[0], n[1], t), S(i, t);
+  }) : o = k(n[0], n[1], t), F(o, t);
 }
-function mr(r, e, t) {
-  return t.nulls !== "error" && e.some((n) => n == null) || r === "divide" && t.divisionByZero === "null" && (t.numeric === "decimal" ? l(e[1]).coefficient === 0n : e[1] === 0) ? null : t.numeric === "decimal" ? lr(r, e, t.digits) : ur(r, e);
+function dr(r, e, t) {
+  return t.nulls !== "error" && e.some((n) => n == null) || r === "divide" && t.divisionByZero === "null" && (t.numeric === "decimal" ? u(e[1]).coefficient === 0n : e[1] === 0) ? null : t.numeric === "decimal" ? pr(r, e, t.digits) : gr(r, e);
 }
-function gr(r, e) {
-  r.field !== void 0 && d(r.field), r.weightField !== void 0 && d(r.weightField);
+function wr(r, e) {
+  r.field !== void 0 && m(r.field), r.weightField !== void 0 && m(r.weightField);
   const t = {
     op: r.aggregate,
     field: r.field,
@@ -372,217 +384,282 @@ function gr(r, e) {
     numeric: e.numeric,
     digits: e.digits
   };
-  $([], t);
+  U([], t);
   const n = /* @__PURE__ */ new WeakMap();
-  return (i) => {
-    let c = n.get(i.rows);
+  return (o) => {
+    let c = n.get(o.rows);
     if (!c) {
       try {
-        c = { value: $(i.rows, t) };
-      } catch (o) {
+        c = { value: U(o.rows, t) };
+      } catch (i) {
         c = {
-          error: o instanceof Error ? o : new Error(String(o))
+          error: i instanceof Error ? i : new Error(String(i))
         };
       }
-      n.set(i.rows, c);
+      n.set(o.rows, c);
     }
     if (c.error) throw c.error;
     return c.value;
   };
 }
-function dr(r, e) {
+function hr(r, e) {
   for (const t of r) {
     const n = t(e);
     if (n != null) return n;
   }
   return null;
 }
-function P(r, e = {}, t = { nodes: 0 }, n = 0) {
+function B(r, e = {}, t = { nodes: 0 }, n = 0) {
   if (++t.nodes > 256 || n > 16)
     throw new Error("计算表达式超出深度或节点预算");
   if (!r || typeof r != "object" || Array.isArray(r))
     throw new Error("计算表达式应为声明式对象");
-  if ("aggregate" in r) return gr(r, e);
+  if ("aggregate" in r) return wr(r, e);
   if ("field" in r) {
-    d(r.field);
-    const i = r.field;
-    return ({ row: c }) => Object.prototype.hasOwnProperty.call(c, i) ? c[i] : void 0;
+    m(r.field);
+    const o = r.field;
+    return ({ row: c }) => Object.prototype.hasOwnProperty.call(c, o) ? c[o] : void 0;
   }
   if ("value" in r) {
-    if (!I(r.value))
+    if (!Y(r.value))
       throw new Error("常量应为有限 JSON 标量");
     return () => r.value;
   }
-  return pr(r, e, t, n);
+  return yr(r, e, t, n);
 }
-function pr(r, e, t, n) {
-  const i = x.find((a) => a.name === r.op);
-  if (!i || !Array.isArray(r.args)) throw new Error("未知计算操作");
+function yr(r, e, t, n) {
+  const o = T.find((a) => a.name === r.op);
+  if (!o || !Array.isArray(r.args)) throw new Error("未知计算操作");
   if (r.args.length > 256 || Object.keys(r.args).length !== r.args.length) throw new Error("计算参数超出预算或包含空位");
-  if (r.args.length < i.minArgs || r.args.length > i.maxArgs) throw new Error("运算参数数量不正确");
-  const c = r.op === "if" ? p(r.condition, t, n + 1) : void 0;
+  if (r.args.length < o.minArgs || r.args.length > o.maxArgs) throw new Error("运算参数数量不正确");
+  const c = r.op === "if" ? w(r.condition, t, n + 1) : void 0;
   if (r.op !== "if" && r.condition !== void 0) throw new Error("仅 IF 运算接受 condition");
-  const o = r.args.map(
-    (a) => P(a, e, t, n + 1)
+  const i = r.args.map(
+    (a) => B(a, e, t, n + 1)
   );
-  return c ? (a) => o[c(a.row) ? 0 : 1](a) : ["add", "subtract", "multiply", "divide", "coalesce"].includes(r.op) ? r.op === "coalesce" ? (a) => dr(o, a) : (a) => mr(
+  return c ? (a) => i[c(a.row) ? 0 : 1](a) : ["add", "subtract", "multiply", "divide", "coalesce"].includes(r.op) ? r.op === "coalesce" ? (a) => hr(i, a) : (a) => dr(
     r.op,
-    o.map((s) => s(a)),
+    i.map((s) => s(a)),
     e
-  ) : (a) => cr(r.op, o.map((s) => s(a)), e.numeric, e.digits, e.nulls);
+  ) : (a) => fr(r.op, i.map((s) => s(a)), e.numeric, e.digits, e.nulls);
 }
-function wr(r) {
-  P(r);
+function Er(r) {
+  B(r);
   const e = /* @__PURE__ */ new Set(), t = (n) => {
-    "field" in n && n.field && e.add(n.field), "aggregate" in n && n.weightField && e.add(n.weightField), "args" in n && (n.args.forEach(t), n.condition && ir(n.condition).forEach((i) => e.add(i)));
+    "field" in n && n.field && e.add(n.field), "aggregate" in n && n.weightField && e.add(n.weightField), "args" in n && (n.args.forEach(t), n.condition && ar(n.condition).forEach((o) => e.add(o)));
   };
   return t(r), [...e];
 }
-const hr = 16, k = 1024 * 1024, X = 5e5, v = /* @__PURE__ */ new WeakMap(), m = /* @__PURE__ */ Symbol("uncacheable-computation-definition");
-function y(r, e, t = 0) {
-  if (++e.nodes > 1e4 || t > 32) throw m;
+function N(r, e, t) {
+  if (r === void 0) return e;
+  if (!Number.isSafeInteger(r) || Number(r) < 1 || Number(r) > t) throw new RangeError("图表预算超出允许范围");
+  return Number(r);
+}
+function br(r) {
+  if (!r || typeof r != "object" || Array.isArray(r)) throw new TypeError("图表绑定应为对象");
+  if (m(r.dataset), m(r.categoryField), !["bar", "line", "stackedBar", "percentBar"].includes(r.type)) throw new TypeError("图表类型无效");
+  if (r.sort !== void 0 && !["asc", "desc"].includes(r.sort)) throw new TypeError("图表排序无效");
+  if (r.title !== void 0 && (typeof r.title != "string" || r.title.length > 512)) throw new TypeError("图表标题过长");
+  if (r.showValues !== void 0 && typeof r.showValues != "boolean") throw new TypeError("图表数值标签应为布尔值");
+  if (!Array.isArray(r.measures) || !r.measures.length || r.measures.length > 12) throw new RangeError("图表支持 1–12 个度量");
+  for (const e of G(r.measures, 12, "图表度量")) Ar(e);
+  N(r.maxRows, 1e5, 1e5), N(r.maxCategories, 200, 200);
+}
+function Ar(r) {
+  if (!r || typeof r != "object" || Array.isArray(r)) throw new TypeError("图表度量应为对象");
+  if (r.field !== void 0 && m(r.field), r.weightField !== void 0 && m(r.weightField), r.label !== void 0 && (typeof r.label != "string" || r.label.length > 256)) throw new TypeError("图表系列名称过长");
+  if (r.color !== void 0 && !/^#[\da-f]{6}$/i.test(r.color)) throw new TypeError("图表颜色应为 #RRGGBB");
+  C(r);
+}
+function Or(r) {
+  if (r == null) return { key: "null", label: "—" };
+  if (typeof r != "string" && typeof r != "boolean" && !(typeof r == "number" && Number.isFinite(r))) throw new TypeError("图表分类应为文本、布尔或有限数字");
+  const e = String(r);
+  if (e.length > 512) throw new RangeError("图表分类名称过长");
+  return { key: JSON.stringify([typeof r, r]), label: e };
+}
+function vr(r) {
+  if (r === null) return null;
+  const e = Number(r);
+  if (!Number.isFinite(e)) throw new RangeError("聚合结果超出图表有限数值范围");
+  return e;
+}
+function Br(r, e, t) {
+  if (t?.aborted) {
+    const a = new Error("图表数据处理已取消");
+    throw a.name = "AbortError", a;
+  }
+  br(e);
+  const n = G(e.measures, 12, "图表度量");
+  if (!Array.isArray(r) || r.length > N(e.maxRows, 1e5, 1e5)) throw new RangeError("图表数据超出行数预算");
+  const o = /* @__PURE__ */ new Map(), c = N(e.maxCategories, 200, 200);
+  for (let a = 0; a < r.length; a++) {
+    if (t?.aborted) {
+      const g = new Error("图表数据处理已取消");
+      throw g.name = "AbortError", g;
+    }
+    const s = r[a];
+    if (!s || typeof s != "object" || Array.isArray(s)) throw new TypeError("图表数据行应为对象");
+    const f = Or(Object.prototype.hasOwnProperty.call(s, e.categoryField) ? s[e.categoryField] : null);
+    let l = o.get(f.key);
+    if (!l) {
+      if (o.size >= c) throw new RangeError("图表分类超出预算，请明确筛选或聚合数据");
+      l = { label: f.label, accumulators: n.map(C) }, o.set(f.key, l);
+    }
+    l.accumulators.forEach((g) => g.add(s));
+  }
+  const i = [...o.values()];
+  return e.sort && i.sort((a, s) => (e.sort === "desc" ? -1 : 1) * (a.label < s.label ? -1 : a.label > s.label ? 1 : 0)), { categories: i.map((a) => a.label), series: n.map((a, s) => ({
+    name: a.label ?? `${a.field ?? "记录"} · ${a.op}`,
+    values: i.map((f) => vr(f.accumulators[s].value())),
+    ...a.color ? { color: a.color } : {}
+  })) };
+}
+const Nr = 16, $ = 1024 * 1024, J = 5e5, S = /* @__PURE__ */ new WeakMap(), p = /* @__PURE__ */ Symbol("uncacheable-computation-definition");
+function E(r, e, t = 0) {
+  if (++e.nodes > 1e4 || t > 32) throw p;
   if (r == null) return [String(r)];
   if (typeof r == "number") return ["number", Object.is(r, -0) ? "-0" : String(r)];
   if (typeof r == "boolean") return ["boolean", r];
   if (typeof r == "string") {
-    if (e.units += r.length, e.units > k) throw m;
+    if (e.units += r.length, e.units > $) throw p;
     return ["string", r];
   }
-  if (typeof r != "object") throw m;
+  if (typeof r != "object") throw p;
   if (Array.isArray(r)) {
-    if (Object.getPrototypeOf(r) !== Array.prototype || Object.keys(r).length !== r.length) throw m;
-    return ["array", Array.from({ length: r.length }, (n, i) => y(W(r, String(i)), e, t + 1))];
+    if (Object.getPrototypeOf(r) !== Array.prototype || Object.keys(r).length !== r.length) throw p;
+    return ["array", Array.from({ length: r.length }, (n, o) => E(K(r, String(o)), e, t + 1))];
   }
-  if (Object.getPrototypeOf(r) !== Object.prototype && Object.getPrototypeOf(r) !== null) throw m;
-  return ["object", Object.keys(r).map((n) => [y(n, e, t + 1), y(W(r, n), e, t + 1)])];
+  if (Object.getPrototypeOf(r) !== Object.prototype && Object.getPrototypeOf(r) !== null) throw p;
+  return ["object", Object.keys(r).map((n) => [E(n, e, t + 1), E(K(r, n), e, t + 1)])];
 }
-function W(r, e) {
+function K(r, e) {
   const t = Object.getOwnPropertyDescriptor(r, e);
-  if (!t || t.get || t.set) throw m;
+  if (!t || t.get || t.set) throw p;
   return t.value;
 }
-function yr(r) {
+function Sr(r) {
   try {
-    return JSON.stringify(y(r, { nodes: 0, units: 0 }));
+    return JSON.stringify(E(r, { nodes: 0, units: 0 }));
   } catch (e) {
-    if (e !== m) throw e;
+    if (e !== p) throw e;
     return;
   }
 }
-function kr(r) {
-  v.set(r, { programs: /* @__PURE__ */ new Map(), units: 0, slots: 0 });
+function _r(r) {
+  S.set(r, { programs: /* @__PURE__ */ new Map(), units: 0, slots: 0 });
 }
-function Yr(r, e) {
-  const t = v.get(r);
+function Ir(r, e) {
+  const t = S.get(r);
   if (!t) return;
   const n = { programs: /* @__PURE__ */ new Map(), units: t.units, slots: t.slots };
-  for (const [i, c] of t.programs) {
-    const o = /* @__PURE__ */ new WeakMap();
+  for (const [o, c] of t.programs) {
+    const i = /* @__PURE__ */ new WeakMap();
     e.forEach((a, s) => {
       const f = c.rows.get(r[s]);
-      f && o.set(a, f);
-    }), n.programs.set(i, { ...c, rows: o });
+      f && i.set(a, f);
+    }), n.programs.set(o, { ...c, rows: i });
   }
-  v.set(e, n);
+  S.set(e, n);
 }
-function br(r, e, t) {
-  const n = v.get(r);
+function jr(r, e, t) {
+  const n = S.get(r);
   if (!n || e.some((f) => typeof f.expression == "string")) return;
-  const i = yr(e);
-  if (i === void 0 || i.length > k) return;
-  const c = n.programs.get(i);
+  const o = Sr(e);
+  if (o === void 0 || o.length > $) return;
+  const c = n.programs.get(o);
   if (c) return c;
-  const o = t(), a = r.length * o.reduce((f, u) => f + u.dependencies.length + 1, 0), s = { fields: o, rows: /* @__PURE__ */ new WeakMap(), slots: a, cacheRows: a <= X };
+  const i = t(), a = r.length * i.reduce((f, l) => f + l.dependencies.length + 1, 0), s = { fields: i, rows: /* @__PURE__ */ new WeakMap(), slots: a, cacheRows: a <= J };
   if (!s.cacheRows) return s;
-  for (; n.programs.size >= hr || n.units + i.length > k || n.slots + a > X; ) {
+  for (; n.programs.size >= Nr || n.units + o.length > $ || n.slots + a > J; ) {
     const f = n.programs.keys().next().value;
     n.slots -= n.programs.get(f).slots, n.units -= f.length, n.programs.delete(f);
   }
-  return n.programs.set(i, s), n.units += i.length, n.slots += a, s;
+  return n.programs.set(o, s), n.units += o.length, n.slots += a, s;
 }
-function Er(r, e, t, n) {
+function Fr(r, e, t, n) {
   if ((t.definition.scope ?? "row") !== "row") return;
-  const i = r.program?.rows.get(e)?.get(t.definition.field);
-  return i?.dependencies.every((c, o) => Object.is(n[t.dependencies[o]], c)) ? i : void 0;
+  const o = r.program?.rows.get(e)?.get(t.definition.field);
+  return o?.dependencies.every((c, i) => Object.is(n[t.dependencies[i]], c)) ? o : void 0;
 }
-function Ar(r, e, t, n, i) {
+function xr(r, e, t, n, o) {
   const c = r.program;
   if (!c?.cacheRows || (t.definition.scope ?? "row") !== "row") return;
-  let o = r.writes.get(e);
-  o || (o = new Map(c.rows.get(e)), r.writes.set(e, o), c.rows.set(e, o)), o.set(t.definition.field, {
+  let i = r.writes.get(e);
+  i || (i = new Map(c.rows.get(e)), r.writes.set(e, i), c.rows.set(e, i)), i.set(t.definition.field, {
     dependencies: t.dependencies.map((a) => n[a]),
     value: n[t.definition.field],
-    ...i ? { issue: { field: i.field, message: i.message } } : {}
+    ...o ? { issue: { field: o.field, message: o.message } } : {}
   });
 }
-function vr(r) {
-  if (d(r.field), r.scope !== void 0 && !["row", "group", "dataset"].includes(r.scope))
+function Mr(r) {
+  if (m(r.field), r.scope !== void 0 && !["row", "group", "dataset"].includes(r.scope))
     throw new Error("未知计算范围");
   if (r.numeric !== void 0 && r.numeric !== "number" && r.numeric !== "decimal")
     throw new Error("未知数值模式");
-  if (r.digits !== void 0 && w(r.digits), r.nulls !== void 0 && r.nulls !== "propagate" && r.nulls !== "error")
+  if (r.digits !== void 0 && h(r.digits), r.nulls !== void 0 && r.nulls !== "propagate" && r.nulls !== "error")
     throw new Error("未知空值规则");
   if (r.divisionByZero !== void 0 && r.divisionByZero !== "null" && r.divisionByZero !== "error")
     throw new Error("未知除零规则");
   if (r.scope === "group" && (!Array.isArray(r.groupBy) || !r.groupBy.length))
     throw new Error("分组计算需要 groupBy 字段");
-  Or(r);
+  Dr(r);
 }
-function Or(r) {
+function Dr(r) {
   if (r.groupBy !== void 0) {
     if (!Array.isArray(r.groupBy) || r.groupBy.length > 16)
       throw new Error("计算分组最多 16 级");
-    r.groupBy.forEach(d);
+    r.groupBy.forEach(m);
   }
   if (r.dependsOn !== void 0) {
     if (!Array.isArray(r.dependsOn) || r.dependsOn.length > 2048)
       throw new Error("计算依赖超出预算");
-    r.dependsOn.forEach(d);
+    r.dependsOn.forEach(m);
   }
 }
-function R(r) {
+function _(r) {
   return [
     .../* @__PURE__ */ new Set([
-      ...typeof r.expression == "string" ? r.dependsOn ?? [] : wr(r.expression),
+      ...typeof r.expression == "string" ? r.dependsOn ?? [] : Er(r.expression),
       ...r.groupBy ?? []
     ])
   ];
 }
-function L(r) {
+function rr(r) {
   if (!Array.isArray(r) || r.length > 2048)
     throw new Error("计算字段应为数组且最多2048项");
   const e = /* @__PURE__ */ new Map();
-  for (const o of r) {
-    if (vr(o), e.has(o.field)) throw new Error(`计算字段重复：${o.field}`);
-    e.set(o.field, o);
+  for (const i of r) {
+    if (Mr(i), e.has(i.field)) throw new Error(`计算字段重复：${i.field}`);
+    e.set(i.field, i);
   }
-  const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = [];
-  function c(o) {
-    if (!n.has(o.field)) {
-      if (t.has(o.field))
+  const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), o = [];
+  function c(i) {
+    if (!n.has(i.field)) {
+      if (t.has(i.field))
         throw new Error(
-          `计算字段存在循环依赖：${[...t, o.field].join(" → ")}`
+          `计算字段存在循环依赖：${[...t, i.field].join(" → ")}`
         );
-      t.add(o.field);
-      for (const a of R(o)) {
+      t.add(i.field);
+      for (const a of _(i)) {
         const s = e.get(a);
         s && c(s);
       }
-      t.delete(o.field), n.add(o.field), i.push(o);
+      t.delete(i.field), n.add(i.field), o.push(i);
     }
   }
-  return r.forEach(c), i;
+  return r.forEach(c), o;
 }
-function Ir(r) {
+function Ur(r) {
   try {
-    const e = L(r);
+    const e = rr(r);
     return {
       valid: !0,
       errors: [],
       order: e.map((t) => t.field),
       fields: r.map((t) => ({
         field: t.field,
-        dependencies: R(t),
+        dependencies: _(t),
         scope: t.scope ?? "row"
       }))
     };
@@ -595,11 +672,11 @@ function Ir(r) {
     };
   }
 }
-function Pr(r = []) {
+function Vr(r = []) {
   return {
     fields: r.map((e) => ({ ...e })),
-    functions: x,
-    operations: x.map((e) => e.name),
+    functions: T,
+    operations: T.map((e) => e.name),
     aggregates: ["sum", "count", "avg", "min", "max", "weightedAvg"],
     scopes: ["row", "group", "dataset"],
     numericModes: ["number", "decimal"],
@@ -614,14 +691,14 @@ function Pr(r = []) {
     }
   };
 }
-function z(r) {
-  return L(r.fields).map((e) => {
-    const t = R(e);
+function X(r) {
+  return rr(r.fields).map((e) => {
+    const t = _(e);
     if (typeof e.expression != "string")
       return {
         definition: e,
         dependencies: t,
-        read: P(e.expression, e)
+        read: B(e.expression, e)
       };
     if (!r.formula)
       throw new Error("字符串公式需要显式配置 formula adapter");
@@ -629,39 +706,39 @@ function z(r) {
     return {
       definition: e,
       dependencies: t,
-      read: (i) => r.formula.evaluate(n, i)
+      read: (o) => r.formula.evaluate(n, o)
     };
   });
 }
-function Sr(r, e) {
+function kr(r, e) {
   return JSON.stringify(
     e.map((t) => {
       const n = Object.prototype.hasOwnProperty.call(r, t) ? r[t] : null;
-      if (n != null && !I(n))
+      if (n != null && !Y(n))
         throw new Error("分组字段应为有限 JSON 标量");
       return [typeof n, n ?? null];
     })
   );
 }
-function Nr(r, e) {
+function Rr(r, e) {
   if (e.scope === "dataset") return () => r;
   if (e.scope !== "group") {
-    const i = /* @__PURE__ */ new WeakMap();
+    const o = /* @__PURE__ */ new WeakMap();
     return (c) => {
-      let o = i.get(c);
-      return o || (o = [c], i.set(c, o)), o;
+      let i = o.get(c);
+      return i || (i = [c], o.set(c, i)), i;
     };
   }
   const t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new WeakMap();
-  for (const i of r) {
-    const c = Sr(i, e.groupBy);
-    n.set(i, c);
-    const o = t.get(c);
-    o ? o.push(i) : t.set(c, [i]);
+  for (const o of r) {
+    const c = kr(o, e.groupBy);
+    n.set(o, c);
+    const i = t.get(c);
+    i ? i.push(o) : t.set(c, [o]);
   }
-  return (i) => t.get(n.get(i));
+  return (o) => t.get(n.get(o));
 }
-function Mr(r, e) {
+function Tr(r, e) {
   const t = e.maxRows ?? 1e5, n = e.maxCells ?? 2e6;
   if (!Array.isArray(r) || !Number.isSafeInteger(t) || t < 1 || r.length > t)
     throw new Error("计算数据行数超出预算或输入不是数组");
@@ -670,70 +747,73 @@ function Mr(r, e) {
   if (!Number.isSafeInteger(n) || n < 1 || r.length * e.fields.length > n)
     throw new Error("计算单元格超出 maxCells 预算");
 }
-function G(r) {
+function Z(r) {
   if (r?.aborted) {
     const e = new Error("数据计算已取消");
     throw e.name = "AbortError", e;
   }
 }
-function Dr(r, e, t, n, i, c) {
+function $r(r, e, t, n, o, c) {
   try {
-    const o = r.read({ row: e, rowIndex: t, rows: n });
-    if (o !== void 0 && !I(o))
+    const i = r.read({ row: e, rowIndex: t, rows: n });
+    if (i !== void 0 && !Y(i))
       throw new Error("计算结果应为有限 JSON 标量，异步公式请先在数据源中求值");
-    e[r.definition.field] = o ?? null;
-  } catch (o) {
-    const a = o instanceof Error ? o.message : String(o);
-    if (i.onError !== "null")
+    e[r.definition.field] = i ?? null;
+  } catch (i) {
+    const a = i instanceof Error ? i.message : String(i);
+    if (o.onError !== "null")
       throw Object.assign(
         new Error(`第 ${t + 1} 行 ${r.definition.field}：${a}`),
-        { cause: o }
+        { cause: i }
       );
     e[r.definition.field] = null, c.push({ rowIndex: t, field: r.definition.field, message: a });
   }
 }
-function jr(r, e, t, n, i, c, o, a) {
-  const s = Er(r, e, t, n);
-  if (s && (!s.issue || o.onError === "null")) {
-    n[t.definition.field] = s.value, s.issue && a.push({ ...s.issue, rowIndex: i });
+function Pr(r, e, t, n, o, c, i, a) {
+  const s = Fr(r, e, t, n);
+  if (s && (!s.issue || i.onError === "null")) {
+    n[t.definition.field] = s.value, s.issue && a.push({ ...s.issue, rowIndex: o });
     return;
   }
   const f = a.length;
-  Dr(t, n, i, c, o, a), Ar(r, e, t, n, a.length > f ? a[a.length - 1] : void 0);
+  $r(t, n, o, c, i, a), xr(r, e, t, n, a.length > f ? a[a.length - 1] : void 0);
 }
-function Rr(r, e) {
-  Mr(r, e), G(e.signal);
-  const t = br(r, e.fields, () => z(e)), n = { program: t, writes: /* @__PURE__ */ new WeakMap() }, i = t?.fields ?? z(e), c = [], o = r.map((a, s) => {
+function Wr(r, e) {
+  Tr(r, e), Z(e.signal);
+  const t = jr(r, e.fields, () => X(e)), n = { program: t, writes: /* @__PURE__ */ new WeakMap() }, o = t?.fields ?? X(e), c = [], i = r.map((a, s) => {
     if (!a || typeof a != "object" || Array.isArray(a))
       throw new Error(`第 ${s + 1} 行应为对象`);
     return { ...a };
   });
-  for (const a of i) {
-    const s = Nr(o, a.definition);
-    o.forEach((f, u) => {
-      G(e.signal), jr(n, r[u], a, f, u, s(f), e, c);
+  for (const a of o) {
+    const s = Rr(i, a.definition);
+    i.forEach((f, l) => {
+      Z(e.signal), Pr(n, r[l], a, f, l, s(f), e, c);
     });
   }
-  return { rows: o, issues: c };
+  return { rows: i, issues: c };
 }
 export {
-  E as a,
-  $ as b,
-  rr as c,
-  b as d,
-  Rr as e,
-  w as f,
-  j as g,
-  Fr as h,
-  Pr as i,
-  S as j,
-  p as k,
-  xr as l,
-  Y as m,
-  d as n,
+  O as a,
+  U as b,
+  C as c,
+  A as d,
+  Wr as e,
+  Br as f,
+  h as g,
+  k as h,
+  Cr as i,
+  Vr as j,
+  F as k,
+  br as l,
+  P as m,
+  w as n,
   Yr as o,
-  l as p,
-  kr as q,
-  ir as r,
-  Ir as v
+  u as p,
+  m as q,
+  ar as r,
+  Ir as s,
+  _r as t,
+  G as u,
+  Ur as v
 };