@agile-team/mach-report 2.9.1 → 2.11.0

package/dist/computed-Bvk0W15F.js

@@ -0,0 +1,521 @@
+function g(r) {
+  if (!Number.isSafeInteger(r) || r < 0 || r > 1e3 * 2)
+    throw new Error("十进制精度超出预算");
+  return 10n ** BigInt(r);
+}
+function h(r) {
+  if (r.coefficient.toString().length > 1e3 * 2 || r.scale > 1e3 * 2)
+    throw new Error("十进制结果超出精度预算");
+  return r;
+}
+function s(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("十进制文本超出精度预算");
+  const n = /^([+-]?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d{1,4}))?$/.exec(
+    e
+  );
+  if (!n) throw new Error("无效十进制文本");
+  const t = n[3] ?? "", o = Number(n[4] ?? 0), i = t.length - o, c = BigInt(
+    `${n[1] === "-" ? "-" : ""}${n[2]}${t}`
+  );
+  return h(
+    i < 0 ? { coefficient: c * g(-i), scale: 0 } : { coefficient: c, scale: i }
+  );
+}
+function B(r, e) {
+  const n = Math.max(r.scale, e.scale);
+  return [
+    r.coefficient * g(n - r.scale),
+    e.coefficient * g(n - e.scale),
+    n
+  ];
+}
+function O(r, e) {
+  const [n, t] = B(r, e);
+  return n < t ? -1 : n > t ? 1 : 0;
+}
+function m(r, e) {
+  const [n, t, o] = B(r, e);
+  return h({ coefficient: n + t, scale: o });
+}
+function A(r, e) {
+  return h({
+    coefficient: r.coefficient * e.coefficient,
+    scale: r.scale + e.scale
+  });
+}
+function D(r, e) {
+  const n = r / e, t = r % e, o = (i) => i < 0n ? -i : i;
+  return o(t) * 2n < o(e) ? n : n + (r < 0n == e < 0n ? 1n : -1n);
+}
+function p(r) {
+  if (!Number.isInteger(r) || r < 0 || r > 100)
+    throw new Error("十进制小数位应为 0–100 的整数");
+}
+function E(r, e, n = 20) {
+  if (p(n), e.coefficient === 0n) throw new Error("不能除以零");
+  const t = e.scale - r.scale + n, o = r.coefficient * g(Math.max(0, t)), i = e.coefficient * g(Math.max(0, -t));
+  return h({
+    coefficient: D(o, i),
+    scale: n
+  });
+}
+function v(r, e) {
+  let n = r.coefficient, t = r.scale;
+  e !== void 0 && (p(e), n = e >= t ? n * g(e - t) : D(n, g(t - e)), t = e);
+  const o = n < 0n, i = (o ? -n : n).toString().padStart(t + 1, "0");
+  let c = t ? i.slice(-t) : "";
+  return e === void 0 && (c = c.replace(/0+$/, "")), `${o ? "-" : ""}${t ? i.slice(0, -t) : i}${c ? `.${c}` : ""}`;
+}
+function q(r, e, n = !1, t = !1) {
+  let o = s(r);
+  t && (o = A(o, { coefficient: 100n, scale: 0 }));
+  const [i, c] = v(o, e).split(".");
+  return `${n ? i.replace(/\B(?=(\d{3})+(?!\d))/g, ",") : i}${c === void 0 ? "" : `.${c}`}${t ? "%" : ""}`;
+}
+const j = [
+  "sum",
+  "count",
+  "avg",
+  "min",
+  "max",
+  "weightedAvg"
+];
+function N(r) {
+  if (typeof r != "number" || !Number.isFinite(r))
+    throw new Error(
+      "聚合度量必须是有限数字，不能隐式转换；小数文本请显式选择 decimal"
+    );
+  return r;
+}
+function w(r, e) {
+  return e && Object.prototype.hasOwnProperty.call(r, e) ? r[e] : void 0;
+}
+function _(r) {
+  let e = 0, n = 0, t = 0, o = 0, i = 1 / 0, c = -1 / 0;
+  const u = (a) => {
+    const f = a - t, l = n + f;
+    t = l - n - f, n = l;
+  };
+  return {
+    add(a) {
+      const f = w(a, r.field);
+      if (r.op === "count") {
+        (!r.field || f != null) && e++;
+        return;
+      }
+      if (f == null) return;
+      const l = N(f), F = r.op === "weightedAvg" ? w(a, r.weightField) : 1;
+      if (F == null) return;
+      const y = N(F);
+      if (r.op === "weightedAvg" && y < 0)
+        throw new Error("加权平均的权重不能为负数");
+      ["sum", "avg", "weightedAvg"].includes(r.op) && u(l * y), o += y, i = Math.min(i, l), c = Math.max(c, l), e++;
+    },
+    value() {
+      if (r.op === "count") return e;
+      if (!e) return null;
+      const a = r.op === "min" ? i : r.op === "max" ? c : r.op === "avg" ? n / e : r.op === "weightedAvg" ? o === 0 ? null : n / o : n;
+      if (a !== null && !Number.isFinite(a))
+        throw new Error("聚合计算溢出");
+      return a;
+    }
+  };
+}
+function R(r) {
+  let e = 0, n = s("0"), t = s("0"), o, i;
+  return {
+    add(c) {
+      const u = w(c, r.field);
+      if (r.op === "count") {
+        (!r.field || u != null) && e++;
+        return;
+      }
+      if (u == null) return;
+      const a = r.op === "weightedAvg" ? w(c, r.weightField) : "1";
+      if (a == null) return;
+      const f = s(u), l = s(a);
+      if (r.op === "weightedAvg" && l.coefficient < 0n)
+        throw new Error("加权平均的权重不能为负数");
+      ["sum", "avg", "weightedAvg"].includes(r.op) && (n = m(n, A(f, l))), r.op === "weightedAvg" && (t = m(t, l)), (!o || O(f, o) < 0) && (o = f), (!i || O(f, i) > 0) && (i = f), e++;
+    },
+    value() {
+      if (r.op === "count") return e;
+      if (!e || r.op === "weightedAvg" && t.coefficient === 0n)
+        return null;
+      let c = r.op === "min" ? o : r.op === "max" ? i : n;
+      return r.op === "avg" && (c = E(n, s(e), r.digits)), r.op === "weightedAvg" && (c = E(n, t, r.digits)), v(c, r.digits);
+    }
+  };
+}
+function T(r) {
+  if (r.digits !== void 0 && p(r.digits), r.numeric !== void 0 && r.numeric !== "number" && r.numeric !== "decimal")
+    throw new Error("未知聚合数值模式");
+  if (!j.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" ? R(r) : _(r);
+}
+function $(r, e) {
+  const n = T(e);
+  for (const t of r) n.add(t);
+  return n.value();
+}
+const C = /* @__PURE__ */ new Set(["__proto__", "prototype", "constructor"]);
+function d(r) {
+  if (typeof r != "string" || !r.trim() || C.has(r))
+    throw new Error("计算字段应为安全的非空字段名");
+}
+function b(r) {
+  return r === null || ["string", "boolean"].includes(typeof r) || typeof r == "number" && Number.isFinite(r);
+}
+function G(r) {
+  if (r.some((e) => typeof e != "number" || !Number.isFinite(e)))
+    throw new Error("算术参数必须是有限数字；空值和小数文本不会隐式转换");
+  return r;
+}
+function X(r, e) {
+  const n = G(e);
+  let t;
+  if (r === "add") t = n.reduce((o, i) => o + i, 0);
+  else if (r === "multiply") t = n.reduce((o, i) => o * i, 1);
+  else if (r === "subtract") t = n[0] - n[1];
+  else {
+    if (n[1] === 0) throw new Error("不能除以零");
+    t = n[0] / n[1];
+  }
+  if (!Number.isFinite(t)) throw new Error("计算结果不是有限数字");
+  return t;
+}
+function Z(r, e, n) {
+  const t = e.map(s);
+  let o;
+  return r === "add" ? o = t.reduce(m) : r === "multiply" ? o = t.reduce(A) : r === "subtract" ? o = m(t[0], {
+    ...t[1],
+    coefficient: -t[1].coefficient
+  }) : o = E(t[0], t[1], n), v(o, n);
+}
+function J(r, e, n) {
+  return n.nulls !== "error" && e.some((t) => t == null) || r === "divide" && n.divisionByZero === "null" && (n.numeric === "decimal" ? s(e[1]).coefficient === 0n : e[1] === 0) ? null : n.numeric === "decimal" ? Z(r, e, n.digits) : X(r, e);
+}
+function P(r, e) {
+  r.field !== void 0 && d(r.field), r.weightField !== void 0 && d(r.weightField);
+  const n = {
+    op: r.aggregate,
+    field: r.field,
+    weightField: r.weightField,
+    numeric: e.numeric,
+    digits: e.digits
+  };
+  $([], n);
+  const t = /* @__PURE__ */ new WeakMap();
+  return (o) => {
+    let i = t.get(o.rows);
+    if (!i) {
+      try {
+        i = { value: $(o.rows, n) };
+      } catch (c) {
+        i = {
+          error: c instanceof Error ? c : new Error(String(c))
+        };
+      }
+      t.set(o.rows, i);
+    }
+    if (i.error) throw i.error;
+    return i.value;
+  };
+}
+function z(r, e) {
+  for (const n of r) {
+    const t = n(e);
+    if (t != null) return t;
+  }
+  return null;
+}
+function S(r, e = {}, n = { nodes: 0 }, t = 0) {
+  if (++n.nodes > 256 || t > 16)
+    throw new Error("计算表达式超出深度或节点预算");
+  if (!r || typeof r != "object" || Array.isArray(r))
+    throw new Error("计算表达式应为声明式对象");
+  if ("aggregate" in r) return P(r, e);
+  if ("field" in r) {
+    d(r.field);
+    const o = r.field;
+    return ({ row: i }) => Object.prototype.hasOwnProperty.call(i, o) ? i[o] : void 0;
+  }
+  if ("value" in r) {
+    if (!b(r.value))
+      throw new Error("常量应为有限 JSON 标量");
+    return () => r.value;
+  }
+  return W(r, e, n, t);
+}
+function W(r, e, n, t) {
+  if (!["add", "subtract", "multiply", "divide", "coalesce"].includes(
+    r.op
+  ) || !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 < 2 || ["subtract", "divide"].includes(r.op) && r.args.length !== 2)
+    throw new Error("运算参数数量不正确");
+  const o = r.args.map(
+    (i) => S(i, e, n, t + 1)
+  );
+  return r.op === "coalesce" ? (i) => z(o, i) : (i) => J(
+    r.op,
+    o.map((c) => c(i)),
+    e
+  );
+}
+function K(r) {
+  S(r);
+  const e = /* @__PURE__ */ new Set(), n = (t) => {
+    "field" in t && t.field && e.add(t.field), "aggregate" in t && t.weightField && e.add(t.weightField), "args" in t && t.args.forEach(n);
+  };
+  return n(r), [...e];
+}
+function Q(r) {
+  if (d(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 && p(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 字段");
+  U(r);
+}
+function U(r) {
+  if (r.groupBy !== void 0) {
+    if (!Array.isArray(r.groupBy) || r.groupBy.length > 16)
+      throw new Error("计算分组最多 16 级");
+    r.groupBy.forEach(d);
+  }
+  if (r.dependsOn !== void 0) {
+    if (!Array.isArray(r.dependsOn) || r.dependsOn.length > 2048)
+      throw new Error("计算依赖超出预算");
+    r.dependsOn.forEach(d);
+  }
+}
+function M(r) {
+  return [
+    .../* @__PURE__ */ new Set([
+      ...typeof r.expression == "string" ? r.dependsOn ?? [] : K(r.expression),
+      ...r.groupBy ?? []
+    ])
+  ];
+}
+function k(r) {
+  if (!Array.isArray(r) || r.length > 2048)
+    throw new Error("计算字段应为数组且最多2048项");
+  const e = /* @__PURE__ */ new Map();
+  for (const c of r) {
+    if (Q(c), e.has(c.field)) throw new Error(`计算字段重复：${c.field}`);
+    e.set(c.field, c);
+  }
+  const n = /* @__PURE__ */ new Set(), t = /* @__PURE__ */ new Set(), o = [];
+  function i(c) {
+    if (!t.has(c.field)) {
+      if (n.has(c.field))
+        throw new Error(
+          `计算字段存在循环依赖：${[...n, c.field].join(" → ")}`
+        );
+      n.add(c.field);
+      for (const u of M(c)) {
+        const a = e.get(u);
+        a && i(a);
+      }
+      n.delete(c.field), t.add(c.field), o.push(c);
+    }
+  }
+  return r.forEach(i), o;
+}
+function rr(r) {
+  try {
+    const e = k(r);
+    return {
+      valid: !0,
+      errors: [],
+      order: e.map((n) => n.field),
+      fields: r.map((n) => ({
+        field: n.field,
+        dependencies: M(n),
+        scope: n.scope ?? "row"
+      }))
+    };
+  } catch (e) {
+    return {
+      valid: !1,
+      errors: [e instanceof Error ? e.message : String(e)],
+      fields: [],
+      order: []
+    };
+  }
+}
+function er(r = []) {
+  return {
+    fields: r.map((e) => ({ ...e })),
+    functions: [
+      {
+        name: "add",
+        minArgs: 2,
+        maxArgs: 256,
+        input: "numeric",
+        output: "numeric"
+      },
+      {
+        name: "subtract",
+        minArgs: 2,
+        maxArgs: 2,
+        input: "numeric",
+        output: "numeric"
+      },
+      {
+        name: "multiply",
+        minArgs: 2,
+        maxArgs: 256,
+        input: "numeric",
+        output: "numeric"
+      },
+      {
+        name: "divide",
+        minArgs: 2,
+        maxArgs: 2,
+        input: "numeric",
+        output: "numeric"
+      },
+      {
+        name: "coalesce",
+        minArgs: 2,
+        maxArgs: 256,
+        input: "scalar",
+        output: "scalar"
+      }
+    ],
+    operations: ["add", "subtract", "multiply", "divide", "coalesce"],
+    aggregates: ["sum", "count", "avg", "min", "max", "weightedAvg"],
+    scopes: ["row", "group", "dataset"],
+    numericModes: ["number", "decimal"],
+    rules: {
+      nulls: "propagate",
+      aggregateNulls: "skip",
+      emptyAggregate: null,
+      countEmpty: 0,
+      divisionByZero: "error",
+      decimalOutput: "string",
+      rounding: "half-away-from-zero"
+    }
+  };
+}
+function V(r) {
+  return k(r.fields).map((e) => {
+    if (typeof e.expression != "string")
+      return {
+        definition: e,
+        read: S(e.expression, e)
+      };
+    if (!r.formula)
+      throw new Error("字符串公式需要显式配置 formula adapter");
+    const n = e.expression;
+    return {
+      definition: e,
+      read: (t) => r.formula.evaluate(n, t)
+    };
+  });
+}
+function H(r, e) {
+  return JSON.stringify(
+    e.map((n) => {
+      const t = Object.prototype.hasOwnProperty.call(r, n) ? r[n] : null;
+      if (t != null && !b(t))
+        throw new Error("分组字段应为有限 JSON 标量");
+      return [typeof t, t ?? null];
+    })
+  );
+}
+function L(r, e) {
+  if (e.scope === "dataset") return () => r;
+  if (e.scope !== "group") {
+    const o = /* @__PURE__ */ new WeakMap();
+    return (i) => {
+      let c = o.get(i);
+      return c || (c = [i], o.set(i, c)), c;
+    };
+  }
+  const n = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new WeakMap();
+  for (const o of r) {
+    const i = H(o, e.groupBy);
+    t.set(o, i);
+    const c = n.get(i);
+    c ? c.push(o) : n.set(i, [o]);
+  }
+  return (o) => n.get(t.get(o));
+}
+function Y(r, e) {
+  const n = e.maxRows ?? 1e5, t = e.maxCells ?? 2e6;
+  if (!Array.isArray(r) || !Number.isSafeInteger(n) || n < 1 || r.length > n)
+    throw new Error("计算数据行数超出预算或输入不是数组");
+  if (!Array.isArray(e.fields) || e.fields.length > 2048)
+    throw new Error("计算字段应为数组且最多2048项");
+  if (!Number.isSafeInteger(t) || t < 1 || r.length * e.fields.length > t)
+    throw new Error("计算单元格超出 maxCells 预算");
+}
+function I(r) {
+  if (r?.aborted) {
+    const e = new Error("数据计算已取消");
+    throw e.name = "AbortError", e;
+  }
+}
+function x(r, e, n, t, o, i) {
+  try {
+    const c = r.read({ row: e, rowIndex: n, rows: t });
+    if (c !== void 0 && !b(c))
+      throw new Error("计算结果应为有限 JSON 标量，异步公式请先在数据源中求值");
+    e[r.definition.field] = c ?? null;
+  } catch (c) {
+    const u = c instanceof Error ? c.message : String(c);
+    if (o.onError !== "null")
+      throw Object.assign(
+        new Error(`第 ${n + 1} 行 ${r.definition.field}：${u}`),
+        { cause: c }
+      );
+    e[r.definition.field] = null, i.push({ rowIndex: n, field: r.definition.field, message: u });
+  }
+}
+function nr(r, e) {
+  Y(r, e), I(e.signal);
+  const n = V(e), t = [], o = r.map((i, c) => {
+    if (!i || typeof i != "object" || Array.isArray(i))
+      throw new Error(`第 ${c + 1} 行应为对象`);
+    return { ...i };
+  });
+  for (const i of n) {
+    const c = L(o, i.definition);
+    o.forEach((u, a) => {
+      I(e.signal), x(i, u, a, c(u), e, t);
+    });
+  }
+  return { rows: o, issues: t };
+}
+export {
+  m as a,
+  $ as b,
+  O as c,
+  nr as d,
+  T as e,
+  p as f,
+  E as g,
+  q as h,
+  er as i,
+  v as j,
+  A as m,
+  s as p,
+  rr as v
+};

package/dist/computed-CGV2a809.cjs

@@ -0,0 +1 @@
+"use strict";function g(r){if(!Number.isSafeInteger(r)||r<0||r>1e3*2)throw new Error("十进制精度超出预算");return 10n**BigInt(r)}function y(r){if(r.coefficient.toString().length>1e3*2||r.scale>1e3*2)throw new Error("十进制结果超出精度预算");return r}function s(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("十进制文本超出精度预算");const t=/^([+-]?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d{1,4}))?$/.exec(e);if(!t)throw new Error("无效十进制文本");const n=t[3]??"",o=Number(t[4]??0),i=n.length-o,c=BigInt(`${t[1]==="-"?"-":""}${t[2]}${n}`);return y(i<0?{coefficient:c*g(-i),scale:0}:{coefficient:c,scale:i})}function I(r,e){const t=Math.max(r.scale,e.scale);return[r.coefficient*g(t-r.scale),e.coefficient*g(t-e.scale),t]}function b(r,e){const[t,n]=I(r,e);return t<n?-1:t>n?1:0}function m(r,e){const[t,n,o]=I(r,e);return y({coefficient:t+n,scale:o})}function E(r,e){return y({coefficient:r.coefficient*e.coefficient,scale:r.scale+e.scale})}function M(r,e){const t=r/e,n=r%e,o=i=>i<0n?-i:i;return o(n)*2n<o(e)?t:t+(r<0n==e<0n?1n:-1n)}function w(r){if(!Number.isInteger(r)||r<0||r>100)throw new Error("十进制小数位应为 0–100 的整数")}function h(r,e,t=20){if(w(t),e.coefficient===0n)throw new Error("不能除以零");const n=e.scale-r.scale+t,o=r.coefficient*g(Math.max(0,n)),i=e.coefficient*g(Math.max(0,-n));return y({coefficient:M(o,i),scale:t})}function A(r,e){let t=r.coefficient,n=r.scale;e!==void 0&&(w(e),t=e>=n?t*g(e-n):M(t,g(n-e)),n=e);const o=t<0n,i=(o?-t:t).toString().padStart(n+1,"0");let c=n?i.slice(-n):"";return e===void 0&&(c=c.replace(/0+$/,"")),`${o?"-":""}${n?i.slice(0,-n):i}${c?`.${c}`:""}`}function _(r,e,t=!1,n=!1){let o=s(r);n&&(o=E(o,{coefficient:100n,scale:0}));const[i,c]=A(o,e).split(".");return`${t?i.replace(/\B(?=(\d{3})+(?!\d))/g,","):i}${c===void 0?"":`.${c}`}${n?"%":""}`}const R=["sum","count","avg","min","max","weightedAvg"];function N(r){if(typeof r!="number"||!Number.isFinite(r))throw new Error("聚合度量必须是有限数字，不能隐式转换；小数文本请显式选择 decimal");return r}function p(r,e){return e&&Object.prototype.hasOwnProperty.call(r,e)?r[e]:void 0}function C(r){let e=0,t=0,n=0,o=0,i=1/0,c=-1/0;const u=a=>{const l=a-n,f=t+l;n=f-t-l,t=f};return{add(a){const l=p(a,r.field);if(r.op==="count"){(!r.field||l!=null)&&e++;return}if(l==null)return;const f=N(l),O=r.op==="weightedAvg"?p(a,r.weightField):1;if(O==null)return;const v=N(O);if(r.op==="weightedAvg"&&v<0)throw new Error("加权平均的权重不能为负数");["sum","avg","weightedAvg"].includes(r.op)&&u(f*v),o+=v,i=Math.min(i,f),c=Math.max(c,f),e++},value(){if(r.op==="count")return e;if(!e)return null;const a=r.op==="min"?i:r.op==="max"?c:r.op==="avg"?t/e:r.op==="weightedAvg"?o===0?null:t/o:t;if(a!==null&&!Number.isFinite(a))throw new Error("聚合计算溢出");return a}}}function T(r){let e=0,t=s("0"),n=s("0"),o,i;return{add(c){const u=p(c,r.field);if(r.op==="count"){(!r.field||u!=null)&&e++;return}if(u==null)return;const a=r.op==="weightedAvg"?p(c,r.weightField):"1";if(a==null)return;const l=s(u),f=s(a);if(r.op==="weightedAvg"&&f.coefficient<0n)throw new Error("加权平均的权重不能为负数");["sum","avg","weightedAvg"].includes(r.op)&&(t=m(t,E(l,f))),r.op==="weightedAvg"&&(n=m(n,f)),(!o||b(l,o)<0)&&(o=l),(!i||b(l,i)>0)&&(i=l),e++},value(){if(r.op==="count")return e;if(!e||r.op==="weightedAvg"&&n.coefficient===0n)return null;let c=r.op==="min"?o:r.op==="max"?i:t;return r.op==="avg"&&(c=h(t,s(e),r.digits)),r.op==="weightedAvg"&&(c=h(t,n,r.digits)),A(c,r.digits)}}}function B(r){if(r.digits!==void 0&&w(r.digits),r.numeric!==void 0&&r.numeric!=="number"&&r.numeric!=="decimal")throw new Error("未知聚合数值模式");if(!R.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"?T(r):C(r)}function S(r,e){const t=B(e);for(const n of r)t.add(n);return t.value()}const G=new Set(["__proto__","prototype","constructor"]);function d(r){if(typeof r!="string"||!r.trim()||G.has(r))throw new Error("计算字段应为安全的非空字段名")}function D(r){return r===null||["string","boolean"].includes(typeof r)||typeof r=="number"&&Number.isFinite(r)}function X(r){if(r.some(e=>typeof e!="number"||!Number.isFinite(e)))throw new Error("算术参数必须是有限数字；空值和小数文本不会隐式转换");return r}function Z(r,e){const t=X(e);let n;if(r==="add")n=t.reduce((o,i)=>o+i,0);else if(r==="multiply")n=t.reduce((o,i)=>o*i,1);else if(r==="subtract")n=t[0]-t[1];else{if(t[1]===0)throw new Error("不能除以零");n=t[0]/t[1]}if(!Number.isFinite(n))throw new Error("计算结果不是有限数字");return n}function J(r,e,t){const n=e.map(s);let o;return r==="add"?o=n.reduce(m):r==="multiply"?o=n.reduce(E):r==="subtract"?o=m(n[0],{...n[1],coefficient:-n[1].coefficient}):o=h(n[0],n[1],t),A(o,t)}function P(r,e,t){return t.nulls!=="error"&&e.some(n=>n==null)||r==="divide"&&t.divisionByZero==="null"&&(t.numeric==="decimal"?s(e[1]).coefficient===0n:e[1]===0)?null:t.numeric==="decimal"?J(r,e,t.digits):Z(r,e)}function z(r,e){r.field!==void 0&&d(r.field),r.weightField!==void 0&&d(r.weightField);const t={op:r.aggregate,field:r.field,weightField:r.weightField,numeric:e.numeric,digits:e.digits};S([],t);const n=new WeakMap;return o=>{let i=n.get(o.rows);if(!i){try{i={value:S(o.rows,t)}}catch(c){i={error:c instanceof Error?c:new Error(String(c))}}n.set(o.rows,i)}if(i.error)throw i.error;return i.value}}function W(r,e){for(const t of r){const n=t(e);if(n!=null)return n}return null}function F(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 z(r,e);if("field"in r){d(r.field);const o=r.field;return({row:i})=>Object.prototype.hasOwnProperty.call(i,o)?i[o]:void 0}if("value"in r){if(!D(r.value))throw new Error("常量应为有限 JSON 标量");return()=>r.value}return K(r,e,t,n)}function K(r,e,t,n){if(!["add","subtract","multiply","divide","coalesce"].includes(r.op)||!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<2||["subtract","divide"].includes(r.op)&&r.args.length!==2)throw new Error("运算参数数量不正确");const o=r.args.map(i=>F(i,e,t,n+1));return r.op==="coalesce"?i=>W(o,i):i=>P(r.op,o.map(c=>c(i)),e)}function Q(r){F(r);const e=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)};return t(r),[...e]}function U(r){if(d(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")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 字段");V(r)}function V(r){if(r.groupBy!==void 0){if(!Array.isArray(r.groupBy)||r.groupBy.length>16)throw new Error("计算分组最多 16 级");r.groupBy.forEach(d)}if(r.dependsOn!==void 0){if(!Array.isArray(r.dependsOn)||r.dependsOn.length>2048)throw new Error("计算依赖超出预算");r.dependsOn.forEach(d)}}function k(r){return[...new Set([...typeof r.expression=="string"?r.dependsOn??[]:Q(r.expression),...r.groupBy??[]])]}function j(r){if(!Array.isArray(r)||r.length>2048)throw new Error("计算字段应为数组且最多2048项");const e=new Map;for(const c of r){if(U(c),e.has(c.field))throw new Error(`计算字段重复：${c.field}`);e.set(c.field,c)}const t=new Set,n=new Set,o=[];function i(c){if(!n.has(c.field)){if(t.has(c.field))throw new Error(`计算字段存在循环依赖：${[...t,c.field].join(" → ")}`);t.add(c.field);for(const u of k(c)){const a=e.get(u);a&&i(a)}t.delete(c.field),n.add(c.field),o.push(c)}}return r.forEach(i),o}function H(r){try{const e=j(r);return{valid:!0,errors:[],order:e.map(t=>t.field),fields:r.map(t=>({field:t.field,dependencies:k(t),scope:t.scope??"row"}))}}catch(e){return{valid:!1,errors:[e instanceof Error?e.message:String(e)],fields:[],order:[]}}}function L(r=[]){return{fields:r.map(e=>({...e})),functions:[{name:"add",minArgs:2,maxArgs:256,input:"numeric",output:"numeric"},{name:"subtract",minArgs:2,maxArgs:2,input:"numeric",output:"numeric"},{name:"multiply",minArgs:2,maxArgs:256,input:"numeric",output:"numeric"},{name:"divide",minArgs:2,maxArgs:2,input:"numeric",output:"numeric"},{name:"coalesce",minArgs:2,maxArgs:256,input:"scalar",output:"scalar"}],operations:["add","subtract","multiply","divide","coalesce"],aggregates:["sum","count","avg","min","max","weightedAvg"],scopes:["row","group","dataset"],numericModes:["number","decimal"],rules:{nulls:"propagate",aggregateNulls:"skip",emptyAggregate:null,countEmpty:0,divisionByZero:"error",decimalOutput:"string",rounding:"half-away-from-zero"}}}function Y(r){return j(r.fields).map(e=>{if(typeof e.expression!="string")return{definition:e,read:F(e.expression,e)};if(!r.formula)throw new Error("字符串公式需要显式配置 formula adapter");const t=e.expression;return{definition:e,read:n=>r.formula.evaluate(t,n)}})}function x(r,e){return JSON.stringify(e.map(t=>{const n=Object.prototype.hasOwnProperty.call(r,t)?r[t]:null;if(n!=null&&!D(n))throw new Error("分组字段应为有限 JSON 标量");return[typeof n,n??null]}))}function q(r,e){if(e.scope==="dataset")return()=>r;if(e.scope!=="group"){const o=new WeakMap;return i=>{let c=o.get(i);return c||(c=[i],o.set(i,c)),c}}const t=new Map,n=new WeakMap;for(const o of r){const i=x(o,e.groupBy);n.set(o,i);const c=t.get(i);c?c.push(o):t.set(i,[o])}return o=>t.get(n.get(o))}function rr(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("计算数据行数超出预算或输入不是数组");if(!Array.isArray(e.fields)||e.fields.length>2048)throw new Error("计算字段应为数组且最多2048项");if(!Number.isSafeInteger(n)||n<1||r.length*e.fields.length>n)throw new Error("计算单元格超出 maxCells 预算")}function $(r){if(r?.aborted){const e=new Error("数据计算已取消");throw e.name="AbortError",e}}function er(r,e,t,n,o,i){try{const c=r.read({row:e,rowIndex:t,rows:n});if(c!==void 0&&!D(c))throw new Error("计算结果应为有限 JSON 标量，异步公式请先在数据源中求值");e[r.definition.field]=c??null}catch(c){const u=c instanceof Error?c.message:String(c);if(o.onError!=="null")throw Object.assign(new Error(`第 ${t+1} 行 ${r.definition.field}：${u}`),{cause:c});e[r.definition.field]=null,i.push({rowIndex:t,field:r.definition.field,message:u})}}function tr(r,e){rr(r,e),$(e.signal);const t=Y(e),n=[],o=r.map((i,c)=>{if(!i||typeof i!="object"||Array.isArray(i))throw new Error(`第 ${c+1} 行应为对象`);return{...i}});for(const i of t){const c=q(o,i.definition);o.forEach((u,a)=>{$(e.signal),er(i,u,a,c(u),e,n)})}return{rows:o,issues:n}}exports.addDecimal=m;exports.aggregateRows=S;exports.compareDecimal=b;exports.computeDataset=tr;exports.createAggregateAccumulator=B;exports.decimalDigits=w;exports.divideDecimal=h;exports.formatDecimal=_;exports.getComputationMetadata=L;exports.multiplyDecimal=E;exports.parseDecimal=s;exports.printDecimal=A;exports.validateComputedFields=H;