@agile-team/mach-report 2.16.0 → 2.18.0

package/dist/computed-C8NRZQss.js

@@ -0,0 +1,739 @@
+function g(r) {
+  if (!Number.isSafeInteger(r) || r < 0 || r > 1e3 * 2)
+    throw new Error("十进制精度超出预算");
+  return 10n ** BigInt(r);
+}
+function O(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] ?? "", i = Number(t[4] ?? 0), c = n.length - i, o = BigInt(
+    `${t[1] === "-" ? "-" : ""}${t[2]}${n}`
+  );
+  return O(
+    c < 0 ? { coefficient: o * g(-c), scale: 0 } : { coefficient: o, scale: c }
+  );
+}
+function J(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] = J(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 Y(r, e) {
+  return O({
+    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 w(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),
+    scale: t
+  });
+}
+function S(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 = [
+  "sum",
+  "count",
+  "avg",
+  "min",
+  "max",
+  "weightedAvg"
+];
+function _(r) {
+  if (typeof r != "number" || !Number.isFinite(r))
+    throw new Error(
+      "聚合度量必须是有限数字，不能隐式转换；小数文本请显式选择 decimal"
+    );
+  return r;
+}
+function A(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;
+  const a = (s) => {
+    const f = s - n, u = t + f;
+    n = u - t - f, t = u;
+  };
+  return {
+    add(s) {
+      const f = A(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)
+        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++;
+    },
+    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;
+      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;
+  return {
+    add(o) {
+      const a = A(o, 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";
+      if (s == null) return;
+      const f = l(a), u = l(s);
+      if (r.op === "weightedAvg" && u.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++;
+    },
+    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);
+    }
+  };
+}
+function rr(r) {
+  if (r.digits !== void 0 && w(r.digits), r.numeric !== void 0 && r.numeric !== "number" && r.numeric !== "decimal")
+    throw new Error("未知聚合数值模式");
+  if (!H.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);
+}
+function $(r, e) {
+  const t = rr(e);
+  for (const n of r) t.add(n);
+  return t.value();
+}
+const Z = /* @__PURE__ */ new Set(["__proto__", "prototype", "constructor"]);
+function K(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("条件不允许访问器或不安全属性");
+}
+function T(r) {
+  if (typeof r != "string" || !r.trim() || r.length > 512 || Z.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) {
+  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("无效日历日");
+  return r;
+}
+function B(r) {
+  return ["string", "boolean"].includes(typeof r) || typeof r == "number" && Number.isFinite(r);
+}
+function U(r) {
+  return r == null || r === "";
+}
+function er(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);
+  try {
+    if (n === "decimal") return b(l(r), l(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;
+  } catch {
+    return;
+  }
+}
+function tr(r) {
+  if (T(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);
+      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");
+    } else M(r.value);
+}
+function D(r, e) {
+  if (e === void 0) return !1;
+  switch (r) {
+    case ">":
+      return e > 0;
+    case ">=":
+      return e >= 0;
+    case "<":
+      return e < 0;
+    case "<=":
+      return e <= 0;
+    case "==":
+      return e === 0;
+    case "!=":
+      return e !== 0;
+    default:
+      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 };
+  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));
+  };
+}
+function p(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 ("not" in r) {
+    const i = p(r.not, e, t + 1);
+    return (c) => !i(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));
+  }
+  return nr(r);
+}
+function xr(r, e) {
+  return p(e)(r);
+}
+function ir(r) {
+  p(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 = [
+  { 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)" },
+  { name: "divide", minArgs: 2, maxArgs: 2, input: "numeric", output: "numeric", example: "divide(amount, quantity)" },
+  { name: "coalesce", minArgs: 2, maxArgs: 256, input: "scalar", output: "scalar", example: "coalesce(actual, planned)" },
+  { name: "if", minArgs: 2, maxArgs: 2, input: "condition + branches", output: "scalar", example: "if(quantity > 0, divide(amount, quantity), null)" },
+  { name: "round", minArgs: 1, maxArgs: 2, input: "numeric, digits?", output: "numeric", example: "round(amount, 2)" },
+  { name: "abs", minArgs: 1, maxArgs: 1, input: "numeric", output: "numeric", example: "abs(difference)" },
+  { name: "concat", minArgs: 2, maxArgs: 256, input: "text", output: "text", example: "concat(plant, '-' , heat)" },
+  { name: "trim", minArgs: 1, maxArgs: 1, input: "text", output: "text", example: "trim(heat)" },
+  { name: "upper", minArgs: 1, maxArgs: 1, input: "text", output: "text", example: "upper(grade)" },
+  { name: "lower", minArgs: 1, maxArgs: 1, input: "text", output: "text", example: "lower(code)" },
+  { 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) {
+  if (e.some((a) => a == null)) {
+    if (i === "error") throw new Error("函数参数包含空值");
+    return null;
+  }
+  if (r === "round" || r === "abs") return ar(r, e, t, n);
+  if (r.startsWith("date")) {
+    const a = F(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);
+  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 a = S(c, o), 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))
+    throw new Error("计算字段应为安全的非空字段名");
+}
+function I(r) {
+  return r === null || ["string", "boolean"].includes(typeof r) || typeof r == "number" && Number.isFinite(r);
+}
+function fr(r) {
+  if (r.some((e) => typeof e != "number" || !Number.isFinite(e)))
+    throw new Error("算术参数必须是有限数字；空值和小数文本不会隐式转换");
+  return r;
+}
+function ur(r, e) {
+  const t = fr(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);
+  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 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], {
+    ...n[1],
+    coefficient: -n[1].coefficient
+  }) : i = j(n[0], n[1], t), S(i, 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 gr(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
+  };
+  $([], t);
+  const n = /* @__PURE__ */ new WeakMap();
+  return (i) => {
+    let c = n.get(i.rows);
+    if (!c) {
+      try {
+        c = { value: $(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 dr(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) {
+  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 ("field" in r) {
+    d(r.field);
+    const i = r.field;
+    return ({ row: c }) => Object.prototype.hasOwnProperty.call(c, i) ? c[i] : void 0;
+  }
+  if ("value" in r) {
+    if (!I(r.value))
+      throw new Error("常量应为有限 JSON 标量");
+    return () => r.value;
+  }
+  return pr(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("未知计算操作");
+  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.op !== "if" && r.condition !== void 0) throw new Error("仅 IF 运算接受 condition");
+  const o = r.args.map(
+    (a) => P(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(
+    r.op,
+    o.map((s) => s(a)),
+    e
+  ) : (a) => cr(r.op, o.map((s) => s(a)), e.numeric, e.digits, e.nulls);
+}
+function wr(r) {
+  P(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)));
+  };
+  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;
+  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;
+    return ["string", r];
+  }
+  if (typeof r != "object") throw m;
+  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) !== 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)])];
+}
+function W(r, e) {
+  const t = Object.getOwnPropertyDescriptor(r, e);
+  if (!t || t.get || t.set) throw m;
+  return t.value;
+}
+function yr(r) {
+  try {
+    return JSON.stringify(y(r, { nodes: 0, units: 0 }));
+  } catch (e) {
+    if (e !== m) throw e;
+    return;
+  }
+}
+function kr(r) {
+  v.set(r, { programs: /* @__PURE__ */ new Map(), units: 0, slots: 0 });
+}
+function Yr(r, e) {
+  const t = v.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();
+    e.forEach((a, s) => {
+      const f = c.rows.get(r[s]);
+      f && o.set(a, f);
+    }), n.programs.set(i, { ...c, rows: o });
+  }
+  v.set(e, n);
+}
+function br(r, e, t) {
+  const n = v.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);
+  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 };
+  if (!s.cacheRows) return s;
+  for (; n.programs.size >= hr || n.units + i.length > k || n.slots + a > X; ) {
+    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;
+}
+function Er(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;
+}
+function Ar(r, e, t, n, i) {
+  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, {
+    dependencies: t.dependencies.map((a) => n[a]),
+    value: n[t.definition.field],
+    ...i ? { issue: { field: i.field, message: i.message } } : {}
+  });
+}
+function vr(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 字段");
+  Or(r);
+}
+function Or(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 R(r) {
+  return [
+    .../* @__PURE__ */ new Set([
+      ...typeof r.expression == "string" ? r.dependsOn ?? [] : wr(r.expression),
+      ...r.groupBy ?? []
+    ])
+  ];
+}
+function L(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);
+  }
+  const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ 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 R(o)) {
+        const s = e.get(a);
+        s && c(s);
+      }
+      t.delete(o.field), n.add(o.field), i.push(o);
+    }
+  }
+  return r.forEach(c), i;
+}
+function Ir(r) {
+  try {
+    const e = L(r);
+    return {
+      valid: !0,
+      errors: [],
+      order: e.map((t) => t.field),
+      fields: r.map((t) => ({
+        field: t.field,
+        dependencies: R(t),
+        scope: t.scope ?? "row"
+      }))
+    };
+  } catch (e) {
+    return {
+      valid: !1,
+      errors: [e instanceof Error ? e.message : String(e)],
+      fields: [],
+      order: []
+    };
+  }
+}
+function Pr(r = []) {
+  return {
+    fields: r.map((e) => ({ ...e })),
+    functions: x,
+    operations: x.map((e) => e.name),
+    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 z(r) {
+  return L(r.fields).map((e) => {
+    const t = R(e);
+    if (typeof e.expression != "string")
+      return {
+        definition: e,
+        dependencies: t,
+        read: P(e.expression, e)
+      };
+    if (!r.formula)
+      throw new Error("字符串公式需要显式配置 formula adapter");
+    const n = e.expression;
+    return {
+      definition: e,
+      dependencies: t,
+      read: (i) => r.formula.evaluate(n, i)
+    };
+  });
+}
+function Sr(r, e) {
+  return JSON.stringify(
+    e.map((t) => {
+      const n = Object.prototype.hasOwnProperty.call(r, t) ? r[t] : null;
+      if (n != null && !I(n))
+        throw new Error("分组字段应为有限 JSON 标量");
+      return [typeof n, n ?? null];
+    })
+  );
+}
+function Nr(r, e) {
+  if (e.scope === "dataset") return () => r;
+  if (e.scope !== "group") {
+    const i = /* @__PURE__ */ new WeakMap();
+    return (c) => {
+      let o = i.get(c);
+      return o || (o = [c], i.set(c, o)), o;
+    };
+  }
+  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]);
+  }
+  return (i) => t.get(n.get(i));
+}
+function Mr(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 G(r) {
+  if (r?.aborted) {
+    const e = new Error("数据计算已取消");
+    throw e.name = "AbortError", e;
+  }
+}
+function Dr(r, e, t, n, i, c) {
+  try {
+    const o = r.read({ row: e, rowIndex: t, rows: n });
+    if (o !== void 0 && !I(o))
+      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")
+      throw Object.assign(
+        new Error(`第 ${t + 1} 行 ${r.definition.field}：${a}`),
+        { cause: o }
+      );
+    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 });
+    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);
+}
+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) => {
+    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);
+    });
+  }
+  return { rows: o, 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,
+  Yr as o,
+  l as p,
+  kr as q,
+  ir as r,
+  Ir as v
+};