@agile-team/mach-report 2.10.0 → 2.11.1

package/dist/matrix-BbXarwyk.js

@@ -1,661 +0,0 @@
-import { d as B, p as h, a as E, m as L, b as O, e as _, c as x } from "./decimal-CI1OAczk.js";
-const P = [
-  "sum",
-  "count",
-  "avg",
-  "min",
-  "max",
-  "weightedAvg"
-];
-function M(r) {
-  if (typeof r != "number" || !Number.isFinite(r))
-    throw new Error(
-      "聚合度量必须是有限数字，不能隐式转换；小数文本请显式选择 decimal"
-    );
-  return r;
-}
-function v(r, e) {
-  return e && Object.prototype.hasOwnProperty.call(r, e) ? r[e] : void 0;
-}
-function T(r) {
-  let e = 0, t = 0, n = 0, o = 0, l = 1 / 0, i = -1 / 0;
-  const u = (a) => {
-    const f = a - n, d = t + f;
-    n = d - t - f, t = d;
-  };
-  return {
-    add(a) {
-      const f = v(a, r.field);
-      if (r.op === "count") {
-        (!r.field || f != null) && e++;
-        return;
-      }
-      if (f == null) return;
-      const d = M(f), c = r.op === "weightedAvg" ? v(a, r.weightField) : 1;
-      if (c == null) return;
-      const s = M(c);
-      if (r.op === "weightedAvg" && s < 0)
-        throw new Error("加权平均的权重不能为负数");
-      ["sum", "avg", "weightedAvg"].includes(r.op) && u(d * s), o += s, l = Math.min(l, d), i = Math.max(i, d), e++;
-    },
-    value() {
-      if (r.op === "count") return e;
-      if (!e) return null;
-      const a = r.op === "min" ? l : r.op === "max" ? i : 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 W(r) {
-  let e = 0, t = h("0"), n = h("0"), o, l;
-  return {
-    add(i) {
-      const u = v(i, r.field);
-      if (r.op === "count") {
-        (!r.field || u != null) && e++;
-        return;
-      }
-      if (u == null) return;
-      const a = r.op === "weightedAvg" ? v(i, r.weightField) : "1";
-      if (a == null) return;
-      const f = h(u), d = h(a);
-      if (r.op === "weightedAvg" && d.coefficient < 0n)
-        throw new Error("加权平均的权重不能为负数");
-      ["sum", "avg", "weightedAvg"].includes(r.op) && (t = E(t, L(f, d))), r.op === "weightedAvg" && (n = E(n, d)), (!o || x(f, o) < 0) && (o = f), (!l || x(f, l) > 0) && (l = f), 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" ? l : t;
-      return r.op === "avg" && (i = O(t, h(e), r.digits)), r.op === "weightedAvg" && (i = O(t, n, r.digits)), _(i, r.digits);
-    }
-  };
-}
-function N(r) {
-  if (r.digits !== void 0 && B(r.digits), r.numeric !== void 0 && r.numeric !== "number" && r.numeric !== "decimal")
-    throw new Error("未知聚合数值模式");
-  if (!P.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" ? W(r) : T(r);
-}
-function C(r, e) {
-  const t = N(e);
-  for (const n of r) t.add(n);
-  return t.value();
-}
-function b(r, e) {
-  return Object.prototype.hasOwnProperty.call(r, e) ? r[e] : void 0;
-}
-function R(r) {
-  if (r == null) return "null";
-  if (typeof r != "string" && typeof r != "boolean" && !(typeof r == "number" && Number.isFinite(r)))
-    throw new Error("交叉表维度应为字符串、布尔、有限数字或空值");
-  return JSON.stringify([typeof r, r]);
-}
-function j(r) {
-  return r == null ? "" : String(r);
-}
-function p(r, e) {
-  const t = r ?? e;
-  if (!Number.isInteger(t) || t < 1)
-    throw new Error("交叉表预算应为正整数");
-  return t;
-}
-function Z(r, e, t, n) {
-  const o = t ? 1 : 0;
-  if ((r + o) * (e + 1 + o) > n)
-    throw new Error(
-      "交叉表输出单元格超出 maxCells 预算，请减少维度或服务端预聚合"
-    );
-}
-function H(r, e) {
-  if (!Array.isArray(r)) throw new Error("交叉表数据应为对象数组");
-  const t = e.aggregate ?? "sum";
-  if (!["sum", "count", "avg", "min", "max", "weightedAvg"].includes(t))
-    throw new Error("未知交叉表聚合类型");
-  if (!e.rowField || !e.columnField || t !== "count" && !e.valueField)
-    throw new Error("交叉表需要明确的行维度、列维度和度量字段");
-  if (r.length > p(e.maxInputRows, 1e5))
-    throw new Error("交叉表输入超出预算，请在服务端预聚合");
-  const n = p(e.maxRows, 1e3), o = p(e.maxColumns, 200), l = p(e.maxCells, 2e6), i = () => N({
-    op: t,
-    field: t === "count" && e.countMode !== "nonNull" ? void 0 : e.valueField,
-    weightField: e.weightField,
-    numeric: e.numeric,
-    digits: e.digits
-  }), u = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map(), d = i();
-  for (const s of r) {
-    const m = R(b(s, e.rowField)), w = R(b(s, e.columnField));
-    if (u.has(w) || u.set(w, j(b(s, e.columnField))), a.has(m) || a.set(m, {
-      label: j(b(s, e.rowField)),
-      cells: /* @__PURE__ */ new Map(),
-      total: i()
-    }), u.size > o || a.size > n)
-      throw new Error("交叉表维度数量超出预算");
-    Z(a.size, u.size, e.totals, l);
-    const g = a.get(m);
-    g.cells.has(w) || g.cells.set(w, i()), f.has(w) || f.set(w, i());
-    for (const F of [
-      g.cells.get(w),
-      g.total,
-      f.get(w),
-      d
-    ])
-      F.add(s);
-  }
-  const c = {
-    columns: [
-      {
-        header: e.rowHeader ?? e.rowField,
-        field: "rowLabel",
-        semanticRole: "dimension"
-      },
-      ...[...u.values()].map(
-        (s, m) => ({
-          header: s,
-          field: `c${m}`,
-          semanticRole: "measure"
-        })
-      )
-    ],
-    rows: [...a.values()].map((s) => ({
-      rowLabel: s.label,
-      ...Object.fromEntries(
-        [...u.keys()].map((m, w) => [
-          `c${w}`,
-          s.cells.get(m)?.value() ?? (t === "count" ? 0 : null)
-        ])
-      ),
-      ...e.totals ? { total: s.total.value() } : {}
-    }))
-  };
-  return e.totals && (c.columns.push({
-    header: "合计",
-    field: "total",
-    semanticRole: "measure"
-  }), r.length && c.rows.push({
-    rowLabel: "合计",
-    ...Object.fromEntries(
-      [...u.keys()].map((s, m) => [
-        `c${m}`,
-        f.get(s)?.value() ?? (t === "count" ? 0 : null)
-      ])
-    ),
-    total: d.value()
-  })), c;
-}
-const K = /* @__PURE__ */ new Set(["__proto__", "prototype", "constructor"]);
-function y(r) {
-  if (typeof r != "string" || !r.trim() || K.has(r))
-    throw new Error("计算字段应为安全的非空字段名");
-}
-function S(r) {
-  return r === null || ["string", "boolean"].includes(typeof r) || typeof r == "number" && Number.isFinite(r);
-}
-function U(r) {
-  if (r.some((e) => typeof e != "number" || !Number.isFinite(e)))
-    throw new Error("算术参数必须是有限数字；空值和小数文本不会隐式转换");
-  return r;
-}
-function V(r, e) {
-  const t = U(e);
-  let n;
-  if (r === "add") n = t.reduce((o, l) => o + l, 0);
-  else if (r === "multiply") n = t.reduce((o, l) => o * l, 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 G(r, e, t) {
-  const n = e.map(h);
-  let o;
-  return r === "add" ? o = n.reduce(E) : r === "multiply" ? o = n.reduce(L) : r === "subtract" ? o = E(n[0], {
-    ...n[1],
-    coefficient: -n[1].coefficient
-  }) : o = O(n[0], n[1], t), _(o, t);
-}
-function Q(r, e, t) {
-  return t.nulls !== "error" && e.some((n) => n == null) || r === "divide" && t.divisionByZero === "null" && (t.numeric === "decimal" ? h(e[1]).coefficient === 0n : e[1] === 0) ? null : t.numeric === "decimal" ? G(r, e, t.digits) : V(r, e);
-}
-function X(r, e) {
-  r.field !== void 0 && y(r.field), r.weightField !== void 0 && y(r.weightField);
-  const t = {
-    op: r.aggregate,
-    field: r.field,
-    weightField: r.weightField,
-    numeric: e.numeric,
-    digits: e.digits
-  };
-  C([], t);
-  const n = /* @__PURE__ */ new WeakMap();
-  return (o) => {
-    let l = n.get(o.rows);
-    if (!l) {
-      try {
-        l = { value: C(o.rows, t) };
-      } catch (i) {
-        l = {
-          error: i instanceof Error ? i : new Error(String(i))
-        };
-      }
-      n.set(o.rows, l);
-    }
-    if (l.error) throw l.error;
-    return l.value;
-  };
-}
-function Y(r, e) {
-  for (const t of r) {
-    const n = t(e);
-    if (n != null) return n;
-  }
-  return null;
-}
-function k(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 X(r, e);
-  if ("field" in r) {
-    y(r.field);
-    const o = r.field;
-    return ({ row: l }) => Object.prototype.hasOwnProperty.call(l, o) ? l[o] : void 0;
-  }
-  if ("value" in r) {
-    if (!S(r.value))
-      throw new Error("常量应为有限 JSON 标量");
-    return () => r.value;
-  }
-  return q(r, e, t, n);
-}
-function q(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(
-    (l) => k(l, e, t, n + 1)
-  );
-  return r.op === "coalesce" ? (l) => Y(o, l) : (l) => Q(
-    r.op,
-    o.map((i) => i(l)),
-    e
-  );
-}
-function rr(r) {
-  k(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];
-}
-function er(r) {
-  if (y(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 && B(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 字段");
-  tr(r);
-}
-function tr(r) {
-  if (r.groupBy !== void 0) {
-    if (!Array.isArray(r.groupBy) || r.groupBy.length > 16)
-      throw new Error("计算分组最多 16 级");
-    r.groupBy.forEach(y);
-  }
-  if (r.dependsOn !== void 0) {
-    if (!Array.isArray(r.dependsOn) || r.dependsOn.length > 2048)
-      throw new Error("计算依赖超出预算");
-    r.dependsOn.forEach(y);
-  }
-}
-function D(r) {
-  return [
-    .../* @__PURE__ */ new Set([
-      ...typeof r.expression == "string" ? r.dependsOn ?? [] : rr(r.expression),
-      ...r.groupBy ?? []
-    ])
-  ];
-}
-function I(r) {
-  if (!Array.isArray(r) || r.length > 2048)
-    throw new Error("计算字段应为数组且最多2048项");
-  const e = /* @__PURE__ */ new Map();
-  for (const i of r) {
-    if (er(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 l(i) {
-    if (!n.has(i.field)) {
-      if (t.has(i.field))
-        throw new Error(
-          `计算字段存在循环依赖：${[...t, i.field].join(" → ")}`
-        );
-      t.add(i.field);
-      for (const u of D(i)) {
-        const a = e.get(u);
-        a && l(a);
-      }
-      t.delete(i.field), n.add(i.field), o.push(i);
-    }
-  }
-  return r.forEach(l), o;
-}
-function mr(r) {
-  try {
-    const e = I(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 dr(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 nr(r) {
-  return I(r.fields).map((e) => {
-    if (typeof e.expression != "string")
-      return {
-        definition: e,
-        read: k(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 ir(r, e) {
-  return JSON.stringify(
-    e.map((t) => {
-      const n = Object.prototype.hasOwnProperty.call(r, t) ? r[t] : null;
-      if (n != null && !S(n))
-        throw new Error("分组字段应为有限 JSON 标量");
-      return [typeof n, n ?? null];
-    })
-  );
-}
-function or(r, e) {
-  if (e.scope === "dataset") return () => r;
-  if (e.scope !== "group") {
-    const o = /* @__PURE__ */ new WeakMap();
-    return (l) => {
-      let i = o.get(l);
-      return i || (i = [l], o.set(l, i)), i;
-    };
-  }
-  const t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new WeakMap();
-  for (const o of r) {
-    const l = ir(o, e.groupBy);
-    n.set(o, l);
-    const i = t.get(l);
-    i ? i.push(o) : t.set(l, [o]);
-  }
-  return (o) => t.get(n.get(o));
-}
-function lr(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 z(r) {
-  if (r?.aborted) {
-    const e = new Error("数据计算已取消");
-    throw e.name = "AbortError", e;
-  }
-}
-function ar(r, e, t, n, o, l) {
-  try {
-    const i = r.read({ row: e, rowIndex: t, rows: n });
-    if (i !== void 0 && !S(i))
-      throw new Error("计算结果应为有限 JSON 标量，异步公式请先在数据源中求值");
-    e[r.definition.field] = i ?? null;
-  } catch (i) {
-    const u = i instanceof Error ? i.message : String(i);
-    if (o.onError !== "null")
-      throw Object.assign(
-        new Error(`第 ${t + 1} 行 ${r.definition.field}：${u}`),
-        { cause: i }
-      );
-    e[r.definition.field] = null, l.push({ rowIndex: t, field: r.definition.field, message: u });
-  }
-}
-function wr(r, e) {
-  lr(r, e), z(e.signal);
-  const t = nr(e), n = [], o = r.map((l, i) => {
-    if (!l || typeof l != "object" || Array.isArray(l))
-      throw new Error(`第 ${i + 1} 行应为对象`);
-    return { ...l };
-  });
-  for (const l of t) {
-    const i = or(o, l.definition);
-    o.forEach((u, a) => {
-      z(e.signal), ar(l, u, a, i(u), e, n);
-    });
-  }
-  return { rows: o, issues: n };
-}
-function A(r, e) {
-  const t = e.map(
-    (n) => Object.prototype.hasOwnProperty.call(r, n) ? r[n] : null
-  );
-  if (t.some(
-    (n) => n != null && typeof n != "string" && typeof n != "boolean" && !(typeof n == "number" && Number.isFinite(n))
-  ))
-    throw new Error("矩阵维度必须是有限 JSON 标量");
-  return {
-    key: JSON.stringify(t.map((n) => [typeof n, n ?? null])),
-    label: t.map((n) => n == null ? "" : String(n)).join(" / ")
-  };
-}
-function cr(r) {
-  for (const e of [
-    "maxRows",
-    "maxColumns",
-    "maxInputRows",
-    "maxCells"
-  ])
-    if (r[e] !== void 0 && (!Number.isSafeInteger(r[e]) || r[e] < 1))
-      throw new Error("矩阵预算应为正安全整数");
-  for (const e of ["columnWidthMm", "rowWidthMm"])
-    if (r[e] !== void 0 && (!Number.isFinite(r[e]) || r[e] <= 0))
-      throw new Error("矩阵列宽应为正数");
-}
-function ur(r) {
-  if (!r || !Array.isArray(r.rowFields) || !Array.isArray(r.columnFields) || !Array.isArray(r.measures))
-    throw new Error("矩阵需要行维度、列维度和度量数组");
-  for (const t of [r.rowFields, r.columnFields])
-    if (t.some((n) => typeof n != "string" || !n.trim()) || new Set(t).size !== t.length)
-      throw new Error("矩阵维度字段应非空且唯一");
-  if (cr(r), !r.rowFields.length || !r.columnFields.length || r.rowFields.length > 16 || r.columnFields.length > 16)
-    throw new Error("矩阵需要 1–16 个行/列维度");
-  if (!r.measures.length || r.measures.length > 32)
-    throw new Error("矩阵需要 1–32 个度量");
-  if (r.measures.map((t) => {
-    if (!t || typeof t != "object") throw new Error("矩阵度量应为对象");
-    if (N({
-      ...t,
-      field: t.valueField ?? t.field
-    }), t.label !== void 0 && typeof t.label != "string")
-      throw new Error("矩阵度量标签应为字符串");
-    return t.field;
-  }).some((t) => typeof t != "string" || !t.trim()))
-    throw new Error("矩阵度量字段应非空");
-}
-function sr(r, e) {
-  if (ur(e), !Array.isArray(r) || r.length > (e.maxInputRows ?? 1e5))
-    throw new Error("矩阵输入超出预算");
-  const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
-  for (const i of r) {
-    if (!i || typeof i != "object" || Array.isArray(i))
-      throw new Error("矩阵数据行应为对象");
-    if (t.add(A(i, e.rowFields).key), n.add(A(i, e.columnFields).key), t.size > (e.maxRows ?? 1e3) || n.size > (e.maxColumns ?? 200))
-      throw new Error("矩阵维度数量超出预算");
-    if ((t.size + +!!e.totals) * ((n.size + +!!e.totals) * e.measures.length + 1) > (e.maxCells ?? 2e6))
-      throw new Error("矩阵输出超出 maxCells 预算");
-  }
-  const o = t.size + +(!!e.totals && r.length > 0), l = (n.size + +!!e.totals) * e.measures.length + 1;
-  return { rowCount: o, columnCount: l, cells: o * l };
-}
-function $(r, e) {
-  let t = e;
-  for (; r.some((n) => Object.prototype.hasOwnProperty.call(n, t)); )
-    t += "_";
-  return t;
-}
-function gr(r, e) {
-  sr(r, e);
-  const t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), o = $(r, "__matrix_row"), l = $(r, "__matrix_column"), i = r.map((c) => {
-    const s = A(c, e.rowFields), m = A(c, e.columnFields);
-    return t.set(s.key, s.label), n.set(m.key, m.label), { ...c, [o]: s.key, [l]: m.key };
-  }), u = e.maxCells ?? 2e6;
-  if ((t.size + +!!e.totals) * ((n.size + +!!e.totals) * e.measures.length + 1) > u)
-    throw new Error("矩阵输出超出 maxCells 预算");
-  const a = e.measures.map(
-    (c) => H(i, {
-      rowField: o,
-      columnField: l,
-      valueField: c.valueField ?? c.field,
-      aggregate: c.op,
-      countMode: "nonNull",
-      weightField: c.weightField,
-      numeric: c.numeric,
-      digits: c.digits,
-      totals: e.totals,
-      maxRows: e.maxRows,
-      maxColumns: e.maxColumns,
-      maxInputRows: e.maxInputRows,
-      maxCells: u
-    })
-  ), f = a[0].rows.map(
-    (c) => ({
-      rowLabel: t.get(String(c.rowLabel)) ?? String(c.rowLabel)
-    })
-  ), d = [
-    {
-      field: "rowLabel",
-      header: e.rowHeader ?? e.rowFields.join(" / "),
-      semanticRole: "dimension"
-    }
-  ];
-  for (let c = 0; c < a.length; c++) {
-    const s = a[c], m = e.measures[c];
-    for (const w of s.columns.slice(1)) {
-      const g = `${w.field}_${c}`;
-      d.push({
-        ...w,
-        field: g,
-        ...m.digits === void 0 ? {} : { format: { kind: "number", digits: m.digits } },
-        header: `${n.get(w.header) ?? w.header} · ${m.label ?? `${m.field} (${m.op})`}`
-      }), s.rows.forEach((F, J) => {
-        f[J][g] = F[w.field];
-      });
-    }
-  }
-  return { rows: f, columns: d };
-}
-export {
-  C as a,
-  N as b,
-  wr as c,
-  H as d,
-  gr as e,
-  sr as f,
-  dr as g,
-  ur as h,
-  mr as v
-};