@agile-team/mach-report 2.17.0 → 2.18.0

package/dist/computed-BW5a8QFk.js

@@ -1,612 +0,0 @@
-function d(r) {
-  if (!Number.isSafeInteger(r) || r < 0 || r > 1e3 * 2)
-    throw new Error("十进制精度超出预算");
-  return 10n ** BigInt(r);
-}
-function A(r) {
-  if (r.coefficient.toString().length > 1e3 * 2 || r.scale > 1e3 * 2)
-    throw new Error("十进制结果超出精度预算");
-  return r;
-}
-function l(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), c = n.length - o, i = BigInt(
-    `${t[1] === "-" ? "-" : ""}${t[2]}${n}`
-  );
-  return A(
-    c < 0 ? { coefficient: i * d(-c), scale: 0 } : { coefficient: i, scale: c }
-  );
-}
-function C(r, e) {
-  const t = Math.max(r.scale, e.scale);
-  return [
-    r.coefficient * d(t - r.scale),
-    e.coefficient * d(t - e.scale),
-    t
-  ];
-}
-function j(r, e) {
-  const [t, n] = C(r, e);
-  return t < n ? -1 : t > n ? 1 : 0;
-}
-function p(r, e) {
-  const [t, n, o] = C(r, e);
-  return A({ coefficient: t + n, scale: o });
-}
-function O(r, e) {
-  return A({
-    coefficient: r.coefficient * e.coefficient,
-    scale: r.scale + e.scale
-  });
-}
-function T(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 E(r) {
-  if (!Number.isInteger(r) || r < 0 || r > 100)
-    throw new Error("十进制小数位应为 0–100 的整数");
-}
-function v(r, e, t = 20) {
-  if (E(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 A({
-    coefficient: T(o, c),
-    scale: t
-  });
-}
-function M(r, e) {
-  let t = r.coefficient, n = r.scale;
-  e !== void 0 && (E(e), t = e >= n ? t * d(e - n) : T(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 lr(r, e, t = !1, n = !1) {
-  let o = l(r);
-  n && (o = O(o, { coefficient: 100n, scale: 0 }));
-  const [c, i] = M(o, e).split(".");
-  return `${t ? c.replace(/\B(?=(\d{3})+(?!\d))/g, ",") : c}${i === void 0 ? "" : `.${i}`}${n ? "%" : ""}`;
-}
-const W = [
-  "sum",
-  "count",
-  "avg",
-  "min",
-  "max",
-  "weightedAvg"
-];
-function I(r) {
-  if (typeof r != "number" || !Number.isFinite(r))
-    throw new Error(
-      "聚合度量必须是有限数字，不能隐式转换；小数文本请显式选择 decimal"
-    );
-  return r;
-}
-function h(r, e) {
-  return e && Object.prototype.hasOwnProperty.call(r, e) ? r[e] : void 0;
-}
-function G(r) {
-  let e = 0, t = 0, n = 0, o = 0, c = 1 / 0, i = -1 / 0;
-  const a = (f) => {
-    const s = f - n, u = t + s;
-    n = u - t - s, t = u;
-  };
-  return {
-    add(f) {
-      const s = h(f, r.field);
-      if (r.op === "count") {
-        (!r.field || s != null) && e++;
-        return;
-      }
-      if (s == null) return;
-      const u = I(s), N = r.op === "weightedAvg" ? h(f, r.weightField) : 1;
-      if (N == null) return;
-      const b = I(N);
-      if (r.op === "weightedAvg" && b < 0)
-        throw new Error("加权平均的权重不能为负数");
-      ["sum", "avg", "weightedAvg"].includes(r.op) && a(u * b), o += b, c = Math.min(c, u), i = Math.max(i, u), e++;
-    },
-    value() {
-      if (r.op === "count") return e;
-      if (!e) return null;
-      const f = r.op === "min" ? c : r.op === "max" ? i : r.op === "avg" ? t / e : r.op === "weightedAvg" ? o === 0 ? null : t / o : t;
-      if (f !== null && !Number.isFinite(f))
-        throw new Error("聚合计算溢出");
-      return f;
-    }
-  };
-}
-function J(r) {
-  let e = 0, t = l("0"), n = l("0"), o, c;
-  return {
-    add(i) {
-      const a = h(i, r.field);
-      if (r.op === "count") {
-        (!r.field || a != null) && e++;
-        return;
-      }
-      if (a == null) return;
-      const f = r.op === "weightedAvg" ? h(i, r.weightField) : "1";
-      if (f == null) return;
-      const s = l(a), u = l(f);
-      if (r.op === "weightedAvg" && u.coefficient < 0n)
-        throw new Error("加权平均的权重不能为负数");
-      ["sum", "avg", "weightedAvg"].includes(r.op) && (t = p(t, O(s, u))), r.op === "weightedAvg" && (n = p(n, u)), (!o || j(s, o) < 0) && (o = s), (!c || j(s, c) > 0) && (c = s), e++;
-    },
-    value() {
-      if (r.op === "count") return e;
-      if (!e || r.op === "weightedAvg" && n.coefficient === 0n)
-        return null;
-      let i = r.op === "min" ? o : r.op === "max" ? c : t;
-      return r.op === "avg" && (i = v(t, l(e), r.digits)), r.op === "weightedAvg" && (i = v(t, n, r.digits)), M(i, r.digits);
-    }
-  };
-}
-function Z(r) {
-  if (r.digits !== void 0 && E(r.digits), r.numeric !== void 0 && r.numeric !== "number" && r.numeric !== "decimal")
-    throw new Error("未知聚合数值模式");
-  if (!W.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" ? J(r) : G(r);
-}
-function $(r, e) {
-  const t = Z(e);
-  for (const n of r) t.add(n);
-  return t.value();
-}
-const z = /* @__PURE__ */ new Set(["__proto__", "prototype", "constructor"]);
-function m(r) {
-  if (typeof r != "string" || !r.trim() || z.has(r))
-    throw new Error("计算字段应为安全的非空字段名");
-}
-function k(r) {
-  return r === null || ["string", "boolean"].includes(typeof r) || typeof r == "number" && Number.isFinite(r);
-}
-function K(r) {
-  if (r.some((e) => typeof e != "number" || !Number.isFinite(e)))
-    throw new Error("算术参数必须是有限数字；空值和小数文本不会隐式转换");
-  return r;
-}
-function V(r, e) {
-  const t = K(e);
-  let n;
-  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("不能除以零");
-    n = t[0] / t[1];
-  }
-  if (!Number.isFinite(n)) throw new Error("计算结果不是有限数字");
-  return n;
-}
-function U(r, e, t) {
-  const n = e.map(l);
-  let o;
-  return r === "add" ? o = n.reduce(p) : r === "multiply" ? o = n.reduce(O) : r === "subtract" ? o = p(n[0], {
-    ...n[1],
-    coefficient: -n[1].coefficient
-  }) : o = v(n[0], n[1], t), M(o, t);
-}
-function L(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" ? U(r, e, t.digits) : V(r, e);
-}
-function Q(r, e) {
-  r.field !== void 0 && m(r.field), r.weightField !== void 0 && m(r.weightField);
-  const t = {
-    op: r.aggregate,
-    field: r.field,
-    weightField: r.weightField,
-    numeric: e.numeric,
-    digits: e.digits
-  };
-  $([], t);
-  const n = /* @__PURE__ */ new WeakMap();
-  return (o) => {
-    let c = n.get(o.rows);
-    if (!c) {
-      try {
-        c = { value: $(o.rows, t) };
-      } catch (i) {
-        c = {
-          error: i instanceof Error ? i : new Error(String(i))
-        };
-      }
-      n.set(o.rows, c);
-    }
-    if (c.error) throw c.error;
-    return c.value;
-  };
-}
-function Y(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 Q(r, e);
-  if ("field" in r) {
-    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 (!k(r.value))
-      throw new Error("常量应为有限 JSON 标量");
-    return () => r.value;
-  }
-  return H(r, e, t, n);
-}
-function H(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(
-    (c) => F(c, e, t, n + 1)
-  );
-  return r.op === "coalesce" ? (c) => Y(o, c) : (c) => L(
-    r.op,
-    o.map((i) => i(c)),
-    e
-  );
-}
-function x(r) {
-  F(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);
-  };
-  return t(r), [...e];
-}
-const q = 16, S = 1024 * 1024, B = 5e5, y = /* @__PURE__ */ new WeakMap(), g = /* @__PURE__ */ Symbol("uncacheable-computation-definition");
-function w(r, e, t = 0) {
-  if (++e.nodes > 1e4 || t > 32) throw g;
-  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 > S) throw g;
-    return ["string", r];
-  }
-  if (typeof r != "object") throw g;
-  if (Array.isArray(r)) {
-    if (Object.getPrototypeOf(r) !== Array.prototype || Object.keys(r).length !== r.length) throw g;
-    return ["array", Array.from({ length: r.length }, (n, o) => w(R(r, String(o)), e, t + 1))];
-  }
-  if (Object.getPrototypeOf(r) !== Object.prototype && Object.getPrototypeOf(r) !== null) throw g;
-  return ["object", Object.keys(r).map((n) => [w(n, e, t + 1), w(R(r, n), e, t + 1)])];
-}
-function R(r, e) {
-  const t = Object.getOwnPropertyDescriptor(r, e);
-  if (!t || t.get || t.set) throw g;
-  return t.value;
-}
-function rr(r) {
-  try {
-    return JSON.stringify(w(r, { nodes: 0, units: 0 }));
-  } catch (e) {
-    if (e !== g) throw e;
-    return;
-  }
-}
-function gr(r) {
-  y.set(r, { programs: /* @__PURE__ */ new Map(), units: 0, slots: 0 });
-}
-function dr(r, e) {
-  const t = y.get(r);
-  if (!t) return;
-  const n = { programs: /* @__PURE__ */ new Map(), units: t.units, slots: t.slots };
-  for (const [o, c] of t.programs) {
-    const i = /* @__PURE__ */ new WeakMap();
-    e.forEach((a, f) => {
-      const s = c.rows.get(r[f]);
-      s && i.set(a, s);
-    }), n.programs.set(o, { ...c, rows: i });
-  }
-  y.set(e, n);
-}
-function er(r, e, t) {
-  const n = y.get(r);
-  if (!n || e.some((s) => typeof s.expression == "string")) return;
-  const o = rr(e);
-  if (o === void 0 || o.length > S) return;
-  const c = n.programs.get(o);
-  if (c) return c;
-  const i = t(), a = r.length * i.reduce((s, u) => s + u.dependencies.length + 1, 0), f = { fields: i, rows: /* @__PURE__ */ new WeakMap(), slots: a, cacheRows: a <= B };
-  if (!f.cacheRows) return f;
-  for (; n.programs.size >= q || n.units + o.length > S || n.slots + a > B; ) {
-    const s = n.programs.keys().next().value;
-    n.slots -= n.programs.get(s).slots, n.units -= s.length, n.programs.delete(s);
-  }
-  return n.programs.set(o, f), n.units += o.length, n.slots += a, f;
-}
-function tr(r, e, t, n) {
-  if ((t.definition.scope ?? "row") !== "row") return;
-  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 nr(r, e, t, n, o) {
-  const c = r.program;
-  if (!c?.cacheRows || (t.definition.scope ?? "row") !== "row") return;
-  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],
-    ...o ? { issue: { field: o.field, message: o.message } } : {}
-  });
-}
-function or(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 && E(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 字段");
-  ir(r);
-}
-function ir(r) {
-  if (r.groupBy !== void 0) {
-    if (!Array.isArray(r.groupBy) || r.groupBy.length > 16)
-      throw new Error("计算分组最多 16 级");
-    r.groupBy.forEach(m);
-  }
-  if (r.dependsOn !== void 0) {
-    if (!Array.isArray(r.dependsOn) || r.dependsOn.length > 2048)
-      throw new Error("计算依赖超出预算");
-    r.dependsOn.forEach(m);
-  }
-}
-function D(r) {
-  return [
-    .../* @__PURE__ */ new Set([
-      ...typeof r.expression == "string" ? r.dependsOn ?? [] : x(r.expression),
-      ...r.groupBy ?? []
-    ])
-  ];
-}
-function X(r) {
-  if (!Array.isArray(r) || r.length > 2048)
-    throw new Error("计算字段应为数组且最多2048项");
-  const e = /* @__PURE__ */ new Map();
-  for (const i of r) {
-    if (or(i), e.has(i.field)) throw new Error(`计算字段重复：${i.field}`);
-    e.set(i.field, i);
-  }
-  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, i.field].join(" → ")}`
-        );
-      t.add(i.field);
-      for (const a of D(i)) {
-        const f = e.get(a);
-        f && c(f);
-      }
-      t.delete(i.field), n.add(i.field), o.push(i);
-    }
-  }
-  return r.forEach(c), o;
-}
-function mr(r) {
-  try {
-    const e = X(r);
-    return {
-      valid: !0,
-      errors: [],
-      order: e.map((t) => t.field),
-      fields: r.map((t) => ({
-        field: t.field,
-        dependencies: D(t),
-        scope: t.scope ?? "row"
-      }))
-    };
-  } catch (e) {
-    return {
-      valid: !1,
-      errors: [e instanceof Error ? e.message : String(e)],
-      fields: [],
-      order: []
-    };
-  }
-}
-function wr(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 _(r) {
-  return X(r.fields).map((e) => {
-    const t = D(e);
-    if (typeof e.expression != "string")
-      return {
-        definition: e,
-        dependencies: t,
-        read: F(e.expression, e)
-      };
-    if (!r.formula)
-      throw new Error("字符串公式需要显式配置 formula adapter");
-    const n = e.expression;
-    return {
-      definition: e,
-      dependencies: t,
-      read: (o) => r.formula.evaluate(n, o)
-    };
-  });
-}
-function cr(r, e) {
-  return JSON.stringify(
-    e.map((t) => {
-      const n = Object.prototype.hasOwnProperty.call(r, t) ? r[t] : null;
-      if (n != null && !k(n))
-        throw new Error("分组字段应为有限 JSON 标量");
-      return [typeof n, n ?? null];
-    })
-  );
-}
-function ar(r, e) {
-  if (e.scope === "dataset") return () => r;
-  if (e.scope !== "group") {
-    const o = /* @__PURE__ */ new WeakMap();
-    return (c) => {
-      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 o of r) {
-    const c = cr(o, e.groupBy);
-    n.set(o, c);
-    const i = t.get(c);
-    i ? i.push(o) : t.set(c, [o]);
-  }
-  return (o) => t.get(n.get(o));
-}
-function fr(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 P(r) {
-  if (r?.aborted) {
-    const e = new Error("数据计算已取消");
-    throw e.name = "AbortError", e;
-  }
-}
-function sr(r, e, t, n, o, c) {
-  try {
-    const i = r.read({ row: e, rowIndex: t, rows: n });
-    if (i !== void 0 && !k(i))
-      throw new Error("计算结果应为有限 JSON 标量，异步公式请先在数据源中求值");
-    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: i }
-      );
-    e[r.definition.field] = null, c.push({ rowIndex: t, field: r.definition.field, message: a });
-  }
-}
-function ur(r, e, t, n, o, c, i, a) {
-  const f = tr(r, e, t, n);
-  if (f && (!f.issue || i.onError === "null")) {
-    n[t.definition.field] = f.value, f.issue && a.push({ ...f.issue, rowIndex: o });
-    return;
-  }
-  const s = a.length;
-  sr(t, n, o, c, i, a), nr(r, e, t, n, a.length > s ? a[a.length - 1] : void 0);
-}
-function pr(r, e) {
-  fr(r, e), P(e.signal);
-  const t = er(r, e.fields, () => _(e)), n = { program: t, writes: /* @__PURE__ */ new WeakMap() }, o = t?.fields ?? _(e), c = [], i = r.map((a, f) => {
-    if (!a || typeof a != "object" || Array.isArray(a))
-      throw new Error(`第 ${f + 1} 行应为对象`);
-    return { ...a };
-  });
-  for (const a of o) {
-    const f = ar(i, a.definition);
-    i.forEach((s, u) => {
-      P(e.signal), ur(n, r[u], a, s, u, f(s), e, c);
-    });
-  }
-  return { rows: i, issues: c };
-}
-export {
-  p as a,
-  $ as b,
-  Z as c,
-  j as d,
-  pr as e,
-  E as f,
-  v as g,
-  lr as h,
-  wr as i,
-  M as j,
-  dr as k,
-  O as m,
-  l as p,
-  gr as r,
-  mr as v
-};

package/dist/computed-C2GD3XcE.cjs

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