@agile-team/mach-report 2.15.0 → 2.17.0

package/dist/matrix-JLAXlux-.js

@@ -0,0 +1,302 @@
+import { c as g } from "./computed-BW5a8QFk.js";
+function x(e, r) {
+  const l = () => r.measures.map((i) => g(i)), t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), a = r.totals ? l() : void 0, s = (i, c) => i?.forEach((u) => u.add(c));
+  for (const i of e) {
+    const c = r.row(i), u = r.column(i);
+    n.has(u.key) || n.set(u.key, u.label);
+    let f = t.get(c.key);
+    f || (f = { label: c.label, cells: /* @__PURE__ */ new Map(), ...r.totals ? { totals: l() } : {} }, t.set(c.key, f)), r.check(t.size, n.size);
+    let d = f.cells.get(u.key);
+    if (d || (d = l(), f.cells.set(u.key, d)), s(d, i), !r.totals) continue;
+    let w = o.get(u.key);
+    w || (w = l(), o.set(u.key, w)), s(f.totals, i), s(w, i), s(a, i);
+  }
+  return { groups: t, columns: n, columnTotals: o, totals: a };
+}
+function h(e, r) {
+  return JSON.stringify([e.slice(0, r.length), r.map((l) => [l === null ? "null" : typeof l, l])]);
+}
+function M(e, r) {
+  return r.map((l) => {
+    const t = Object.prototype.hasOwnProperty.call(e, l) ? e[l] : null;
+    if (t == null) return null;
+    if (typeof t == "string" || typeof t == "boolean" || typeof t == "number" && Number.isFinite(t)) return t;
+    throw new Error("矩阵维度必须是有限 JSON 标量");
+  });
+}
+function C(e, r, l) {
+  if (!e || typeof e != "object" || Array.isArray(e)) throw new Error("矩阵层级应为对象");
+  for (const t of [e.emptyLabel, e.subtotalLabel, e.totalLabel]) if (t !== void 0 && typeof t != "string") throw new Error("矩阵层级标签应为字符串");
+  b(e.row, r.length), b(e.column, l.length);
+}
+function b(e, r) {
+  if (e !== void 0) {
+    if (!e || typeof e != "object" || Array.isArray(e)) throw new Error("矩阵轴配置应为对象");
+    if (e.labels !== void 0 && (!Array.isArray(e.labels) || e.labels.length !== r || e.labels.some((l) => typeof l != "string"))) throw new Error("矩阵维度标签必须与维度字段一一对应");
+    if (e.sort !== void 0 && (!Array.isArray(e.sort) || e.sort.length > r || e.sort.some((l) => !["source", "asc", "desc"].includes(l)))) throw new Error("矩阵维度排序应为 source、asc 或 desc");
+    if (e.subtotals !== void 0 && (!Array.isArray(e.subtotals) || new Set(e.subtotals).size !== e.subtotals.length || e.subtotals.some((l) => !Number.isInteger(l) || l < 1 || l >= r))) throw new Error("矩阵小计深度应唯一且位于 1 至末级之前");
+  }
+}
+function k(e, r, l) {
+  return { fields: e, options: r ?? {}, hierarchy: l, root: { values: [], children: /* @__PURE__ */ new Map() }, leaves: 0, expanded: 0 };
+}
+function F(e, r) {
+  const l = M(r, e.fields);
+  let t = e.root;
+  for (let n = 1; n <= l.length; n++) {
+    const o = l.slice(0, n), a = h(e.fields, o);
+    let s = t.children.get(a);
+    s || (s = { values: o, children: /* @__PURE__ */ new Map() }, t.children.set(a, s), n === l.length ? (e.leaves++, e.expanded++) : e.options.subtotals?.includes(n) && e.expanded++), t = s;
+  }
+}
+function N(e, r) {
+  if (e === r) return 0;
+  if (e === null) return -1;
+  if (r === null) return 1;
+  if (typeof e == "number" && typeof r == "number") return e - r;
+  const l = `${typeof e}:${e}`, t = `${typeof r}:${r}`;
+  return l < t ? -1 : 1;
+}
+function L(e, r) {
+  const l = [...e.children.values()];
+  return r && r !== "source" && l.sort((t, n) => N(t.values[t.values.length - 1], n.values[n.values.length - 1]) * (r === "desc" ? -1 : 1)), l;
+}
+function y(e, r, l) {
+  return {
+    key: h(e.fields, r),
+    kind: l,
+    depth: r.length,
+    fields: e.fields.slice(0, r.length),
+    values: r,
+    labels: r.map((t) => t === null ? e.hierarchy.emptyLabel ?? "（空）" : String(t))
+  };
+}
+function A(e, r) {
+  const l = [];
+  function t(n) {
+    for (const o of L(n, e.options.sort?.[n.values.length]))
+      o.children.size ? (t(o), e.options.subtotals?.includes(o.values.length) && l.push(y(e, o.values, "subtotal"))) : l.push(y(e, o.values, "member"));
+  }
+  return t(e.root), r && e.leaves && l.push(y(e, [], "total")), l;
+}
+function E(e, r, l) {
+  const t = M(r, e.fields), n = [h(e.fields, t), ...(e.options.subtotals ?? []).map((o) => h(e.fields, t.slice(0, o)))];
+  return l && n.push(h(e.fields, [])), n;
+}
+function R(e, r, l) {
+  if (!(e.kind !== "member" && r > e.depth))
+    return e.kind === "total" ? { key: "total", text: l.totalLabel ?? "合计", rowSpan: 0 } : e.kind === "subtotal" && r === e.depth ? { key: e.key, text: l.subtotalLabel ?? "小计", rowSpan: 0 } : { key: JSON.stringify(e.values.slice(0, r + 1).map((t) => [typeof t, t])), text: e.labels[r], rowSpan: 1 };
+}
+function z(e, r) {
+  const l = e.columnFields.length + 1, t = e.rowFields.length, n = Array.from({ length: l }, () => Array(t + r.length).fill(null));
+  for (let o = 0; o < e.columnFields.length; o++) {
+    let a;
+    r.forEach((s, i) => {
+      const c = R(s, o, e.hierarchy);
+      if (!c) {
+        a = void 0;
+        return;
+      }
+      if (a?.key === c.key) {
+        a.cell.colSpan = (a.cell.colSpan ?? 1) + 1;
+        return;
+      }
+      const u = { text: c.text, rowSpan: c.rowSpan || e.columnFields.length - o, editable: !1, derived: !0 };
+      n[o][t + i] = u, a = { key: c.key, cell: u };
+    });
+  }
+  return e.rowFields.forEach((o, a) => {
+    n[0][a] = { text: e.hierarchy.row?.labels?.[a] ?? o, rowSpan: l, editable: !1, derived: !0 };
+  }), r.forEach((o, a) => {
+    const s = e.measures[o.measure];
+    n[l - 1][t + a] = { text: s.label ?? `${s.field} (${s.op})`, editable: !1, derived: !0 };
+  }), {
+    cells: n.map((o) => o.filter((a) => a !== null)),
+    colWidthsMm: [...e.rowFields.map(() => e.rowWidthMm ?? 40), ...r.map(() => e.columnWidthMm ?? 28)]
+  };
+}
+function v(e, r, l, t) {
+  const n = +(!!r.totals && e > 0), o = l.expanded + n, a = (t.expanded + n) * r.measures.length + r.rowFields.length;
+  if (o > (r.maxRows ?? 1e3) || t.expanded + n > (r.maxColumns ?? 200)) throw new Error("矩阵层级展开数量超出预算（包含小计/总计）");
+  if (o * a > (r.maxCells ?? 2e6)) throw new Error("矩阵输出超出 maxCells 预算");
+  return { rowCount: o, columnCount: a, cells: o * a };
+}
+function $(e, r) {
+  if (!Array.isArray(e) || e.length > (r.maxInputRows ?? 1e5)) throw new Error("矩阵输入超出预算");
+  const l = k(r.rowFields, r.hierarchy.row, r.hierarchy), t = k(r.columnFields, r.hierarchy.column, r.hierarchy);
+  if (e.length * (1 + (l.options.subtotals?.length ?? 0) + +!!r.totals) * (1 + (t.options.subtotals?.length ?? 0) + +!!r.totals) * r.measures.length > (r.maxAggregateUpdates ?? 1e7)) throw new Error("矩阵聚合更新超出 maxAggregateUpdates 预算");
+  let o = v(0, r, l, t);
+  for (const a of e) {
+    if (!a || typeof a != "object" || Array.isArray(a)) throw new Error("矩阵数据行应为对象");
+    F(l, a), F(t, a), o = v(e.length, r, l, t);
+  }
+  return { row: l, column: t, shape: o };
+}
+function j(e, r) {
+  return $(e, r).shape;
+}
+function O(e, r, l) {
+  const t = /* @__PURE__ */ new Map();
+  for (const n of e) {
+    const o = E(l.row, n, !!r.totals), a = E(l.column, n, !!r.totals);
+    for (const s of o) {
+      let i = t.get(s);
+      i || (i = /* @__PURE__ */ new Map(), t.set(s, i));
+      for (const c of a) {
+        let u = i.get(c);
+        u || (u = r.measures.map((f) => g({ ...f, field: f.valueField ?? f.field })), i.set(c, u)), u.forEach((f) => f.add(n));
+      }
+    }
+  }
+  return t;
+}
+function p(e, r) {
+  return e.flatMap((l, t) => r.measures.map((n, o) => ({
+    ...l,
+    field: l.kind === "total" ? `total_${o}` : `c${t}_${o}`,
+    measure: o,
+    measureField: n.field,
+    valueField: n.valueField ?? n.field,
+    operation: n.op
+  })));
+}
+function H(e, r) {
+  return e.kind === "total" ? r.hierarchy.totalLabel ?? "合计" : [...e.labels, ...e.kind === "subtotal" ? [r.hierarchy.subtotalLabel ?? "小计"] : []].join(" / ");
+}
+function I(e, r) {
+  return [
+    ...r.rowFields.map((l, t) => ({ field: `r${t}`, header: r.hierarchy.row?.labels?.[t] ?? l, semanticRole: "dimension" })),
+    ...e.map((l) => {
+      const t = r.measures[l.measure];
+      return {
+        field: l.field,
+        header: `${H(l, r)} · ${t.label ?? `${t.field} (${t.op})`}`,
+        semanticRole: "measure",
+        ...t.digits === void 0 ? {} : { format: { kind: "number", digits: t.digits } }
+      };
+    })
+  ];
+}
+function K(e, r, l, t) {
+  return e.map((n) => {
+    const o = {};
+    l.rowFields.forEach((a, s) => {
+      o[`r${s}`] = n.kind === "total" ? s === 0 ? l.hierarchy.totalLabel ?? "合计" : null : n.labels[s] ?? (s === n.depth ? l.hierarchy.subtotalLabel ?? "小计" : null);
+    });
+    for (const a of r) o[a.field] = t.get(n.key)?.get(a.key)?.[a.measure]?.value() ?? (l.measures[a.measure].op === "count" ? 0 : null);
+    return o;
+  });
+}
+function _(e, r) {
+  const l = $(e, r), t = A(l.row, !!r.totals), n = p(A(l.column, !!r.totals), r), o = O(e, r, l);
+  return { columns: I(n, r), rows: K(t, n, r, o), headerGrid: z(r, n), metadata: {
+    rowFields: [...r.rowFields],
+    rowLabels: [...r.hierarchy.row?.labels ?? r.rowFields],
+    columnFields: [...r.columnFields],
+    columnLabels: [...r.hierarchy.column?.labels ?? r.columnFields],
+    rows: t,
+    columns: n
+  } };
+}
+function m(e, r) {
+  const l = r.map(
+    (t) => Object.prototype.hasOwnProperty.call(e, t) ? e[t] : null
+  );
+  if (l.some(
+    (t) => t != null && typeof t != "string" && typeof t != "boolean" && !(typeof t == "number" && Number.isFinite(t))
+  ))
+    throw new Error("矩阵维度必须是有限 JSON 标量");
+  return {
+    key: JSON.stringify(l.map((t) => [typeof t, t ?? null])),
+    label: l.map((t) => t == null ? "" : String(t)).join(" / ")
+  };
+}
+function J(e) {
+  for (const r of [
+    "maxRows",
+    "maxColumns",
+    "maxInputRows",
+    "maxCells",
+    "maxAggregateUpdates"
+  ])
+    if (e[r] !== void 0 && (!Number.isSafeInteger(e[r]) || e[r] < 1))
+      throw new Error("矩阵预算应为正安全整数");
+  for (const r of ["columnWidthMm", "rowWidthMm"])
+    if (e[r] !== void 0 && (!Number.isFinite(e[r]) || e[r] <= 0))
+      throw new Error("矩阵列宽应为正数");
+}
+function S(e) {
+  if (!e || !Array.isArray(e.rowFields) || !Array.isArray(e.columnFields) || !Array.isArray(e.measures))
+    throw new Error("矩阵需要行维度、列维度和度量数组");
+  for (const l of [e.rowFields, e.columnFields])
+    if (l.some((t) => typeof t != "string" || !t.trim()) || new Set(l).size !== l.length)
+      throw new Error("矩阵维度字段应非空且唯一");
+  if (J(e), !e.rowFields.length || !e.columnFields.length || e.rowFields.length > 16 || e.columnFields.length > 16)
+    throw new Error("矩阵需要 1–16 个行/列维度");
+  if (!e.measures.length || e.measures.length > 32)
+    throw new Error("矩阵需要 1–32 个度量");
+  if (e.measures.map((l) => {
+    if (!l || typeof l != "object") throw new Error("矩阵度量应为对象");
+    if (g({
+      ...l,
+      field: l.valueField ?? l.field
+    }), l.label !== void 0 && typeof l.label != "string")
+      throw new Error("矩阵度量标签应为字符串");
+    return l.field;
+  }).some((l) => typeof l != "string" || !l.trim()))
+    throw new Error("矩阵度量字段应非空");
+  e.hierarchy !== void 0 && C(e.hierarchy, e.rowFields, e.columnFields);
+}
+function W(e, r) {
+  if (S(r), r.hierarchy) return j(e, r);
+  if (!Array.isArray(e) || e.length > (r.maxInputRows ?? 1e5))
+    throw new Error("矩阵输入超出预算");
+  const l = /* @__PURE__ */ new Set(), t = /* @__PURE__ */ new Set();
+  for (const a of e) {
+    if (!a || typeof a != "object" || Array.isArray(a))
+      throw new Error("矩阵数据行应为对象");
+    if (l.add(m(a, r.rowFields).key), t.add(m(a, r.columnFields).key), l.size > (r.maxRows ?? 1e3) || t.size > (r.maxColumns ?? 200))
+      throw new Error("矩阵维度数量超出预算");
+    if ((l.size + +!!r.totals) * ((t.size + +!!r.totals) * r.measures.length + 1) > (r.maxCells ?? 2e6))
+      throw new Error("矩阵输出超出 maxCells 预算");
+  }
+  const n = l.size + +(!!r.totals && e.length > 0), o = (t.size + +!!r.totals) * r.measures.length + 1;
+  return { rowCount: n, columnCount: o, cells: n * o };
+}
+function T(e, r) {
+  if (r?.hierarchy)
+    return S(r), _(e, r);
+  W(e, r);
+  const l = x(e, {
+    row: (a) => m(a, r.rowFields),
+    column: (a) => m(a, r.columnFields),
+    measures: r.measures.map((a) => ({ ...a, field: a.valueField ?? a.field })),
+    totals: r.totals,
+    check: () => {
+    }
+    // Cardinality/budgets were checked before allocating accumulators.
+  }), t = [...l.groups.values()].map((a) => ({ rowLabel: a.label })), n = [{ field: "rowLabel", header: r.rowHeader ?? r.rowFields.join(" / "), semanticRole: "dimension" }], o = { rowLabel: "合计" };
+  return r.measures.forEach((a, s) => {
+    const i = [...l.columns.entries()].map(([c, u], f) => ({ key: c, label: u, field: `c${f}_${s}` }));
+    r.totals && i.push({ key: "", label: "合计", field: `total_${s}` });
+    for (const c of i) {
+      const u = c.field === `total_${s}`;
+      n.push({
+        field: c.field,
+        header: `${c.label} · ${a.label ?? `${a.field} (${a.op})`}`,
+        semanticRole: "measure",
+        ...a.digits === void 0 ? {} : { format: { kind: "number", digits: a.digits } }
+      });
+      let f = 0;
+      for (const d of l.groups.values())
+        t[f++][c.field] = (u ? d.totals?.[s] : d.cells.get(c.key)?.[s])?.value() ?? (a.op === "count" ? 0 : null);
+      o[c.field] = (u ? l.totals?.[s] : l.columnTotals.get(c.key)?.[s])?.value() ?? (a.op === "count" ? 0 : null);
+    }
+  }), r.totals && e.length && t.push(o), { rows: t, columns: n };
+}
+export {
+  x as a,
+  T as c,
+  W as e,
+  S as v
+};

package/dist/matrix-gTHpDTGm.cjs

@@ -0,0 +1 @@
+"use strict";const g=require("./computed-C2GD3XcE.cjs");function $(e,r){const l=()=>r.measures.map(i=>g.createAggregateAccumulator(i)),t=new Map,n=new Map,o=new Map,a=r.totals?l():void 0,s=(i,c)=>i?.forEach(u=>u.add(c));for(const i of e){const c=r.row(i),u=r.column(i);n.has(u.key)||n.set(u.key,u.label);let f=t.get(c.key);f||(f={label:c.label,cells:new Map,...r.totals?{totals:l()}:{}},t.set(c.key,f)),r.check(t.size,n.size);let d=f.cells.get(u.key);if(d||(d=l(),f.cells.set(u.key,d)),s(d,i),!r.totals)continue;let w=o.get(u.key);w||(w=l(),o.set(u.key,w)),s(f.totals,i),s(w,i),s(a,i)}return{groups:t,columns:n,columnTotals:o,totals:a}}function h(e,r){return JSON.stringify([e.slice(0,r.length),r.map(l=>[l===null?"null":typeof l,l])])}function S(e,r){return r.map(l=>{const t=Object.prototype.hasOwnProperty.call(e,l)?e[l]:null;if(t==null)return null;if(typeof t=="string"||typeof t=="boolean"||typeof t=="number"&&Number.isFinite(t))return t;throw new Error("矩阵维度必须是有限 JSON 标量")})}function N(e,r,l){if(!e||typeof e!="object"||Array.isArray(e))throw new Error("矩阵层级应为对象");for(const t of[e.emptyLabel,e.subtotalLabel,e.totalLabel])if(t!==void 0&&typeof t!="string")throw new Error("矩阵层级标签应为字符串");k(e.row,r.length),k(e.column,l.length)}function k(e,r){if(e!==void 0){if(!e||typeof e!="object"||Array.isArray(e))throw new Error("矩阵轴配置应为对象");if(e.labels!==void 0&&(!Array.isArray(e.labels)||e.labels.length!==r||e.labels.some(l=>typeof l!="string")))throw new Error("矩阵维度标签必须与维度字段一一对应");if(e.sort!==void 0&&(!Array.isArray(e.sort)||e.sort.length>r||e.sort.some(l=>!["source","asc","desc"].includes(l))))throw new Error("矩阵维度排序应为 source、asc 或 desc");if(e.subtotals!==void 0&&(!Array.isArray(e.subtotals)||new Set(e.subtotals).size!==e.subtotals.length||e.subtotals.some(l=>!Number.isInteger(l)||l<1||l>=r)))throw new Error("矩阵小计深度应唯一且位于 1 至末级之前")}}function A(e,r,l){return{fields:e,options:r??{},hierarchy:l,root:{values:[],children:new Map},leaves:0,expanded:0}}function F(e,r){const l=S(r,e.fields);let t=e.root;for(let n=1;n<=l.length;n++){const o=l.slice(0,n),a=h(e.fields,o);let s=t.children.get(a);s||(s={values:o,children:new Map},t.children.set(a,s),n===l.length?(e.leaves++,e.expanded++):e.options.subtotals?.includes(n)&&e.expanded++),t=s}}function L(e,r){if(e===r)return 0;if(e===null)return-1;if(r===null)return 1;if(typeof e=="number"&&typeof r=="number")return e-r;const l=`${typeof e}:${e}`,t=`${typeof r}:${r}`;return l<t?-1:1}function R(e,r){const l=[...e.children.values()];return r&&r!=="source"&&l.sort((t,n)=>L(t.values[t.values.length-1],n.values[n.values.length-1])*(r==="desc"?-1:1)),l}function y(e,r,l){return{key:h(e.fields,r),kind:l,depth:r.length,fields:e.fields.slice(0,r.length),values:r,labels:r.map(t=>t===null?e.hierarchy.emptyLabel??"（空）":String(t))}}function E(e,r){const l=[];function t(n){for(const o of R(n,e.options.sort?.[n.values.length]))o.children.size?(t(o),e.options.subtotals?.includes(o.values.length)&&l.push(y(e,o.values,"subtotal"))):l.push(y(e,o.values,"member"))}return t(e.root),r&&e.leaves&&l.push(y(e,[],"total")),l}function v(e,r,l){const t=S(r,e.fields),n=[h(e.fields,t),...(e.options.subtotals??[]).map(o=>h(e.fields,t.slice(0,o)))];return l&&n.push(h(e.fields,[])),n}function z(e,r,l){if(!(e.kind!=="member"&&r>e.depth))return e.kind==="total"?{key:"total",text:l.totalLabel??"合计",rowSpan:0}:e.kind==="subtotal"&&r===e.depth?{key:e.key,text:l.subtotalLabel??"小计",rowSpan:0}:{key:JSON.stringify(e.values.slice(0,r+1).map(t=>[typeof t,t])),text:e.labels[r],rowSpan:1}}function O(e,r){const l=e.columnFields.length+1,t=e.rowFields.length,n=Array.from({length:l},()=>Array(t+r.length).fill(null));for(let o=0;o<e.columnFields.length;o++){let a;r.forEach((s,i)=>{const c=z(s,o,e.hierarchy);if(!c){a=void 0;return}if(a?.key===c.key){a.cell.colSpan=(a.cell.colSpan??1)+1;return}const u={text:c.text,rowSpan:c.rowSpan||e.columnFields.length-o,editable:!1,derived:!0};n[o][t+i]=u,a={key:c.key,cell:u}})}return e.rowFields.forEach((o,a)=>{n[0][a]={text:e.hierarchy.row?.labels?.[a]??o,rowSpan:l,editable:!1,derived:!0}}),r.forEach((o,a)=>{const s=e.measures[o.measure];n[l-1][t+a]={text:s.label??`${s.field} (${s.op})`,editable:!1,derived:!0}}),{cells:n.map(o=>o.filter(a=>a!==null)),colWidthsMm:[...e.rowFields.map(()=>e.rowWidthMm??40),...r.map(()=>e.columnWidthMm??28)]}}function M(e,r,l,t){const n=+(!!r.totals&&e>0),o=l.expanded+n,a=(t.expanded+n)*r.measures.length+r.rowFields.length;if(o>(r.maxRows??1e3)||t.expanded+n>(r.maxColumns??200))throw new Error("矩阵层级展开数量超出预算（包含小计/总计）");if(o*a>(r.maxCells??2e6))throw new Error("矩阵输出超出 maxCells 预算");return{rowCount:o,columnCount:a,cells:o*a}}function x(e,r){if(!Array.isArray(e)||e.length>(r.maxInputRows??1e5))throw new Error("矩阵输入超出预算");const l=A(r.rowFields,r.hierarchy.row,r.hierarchy),t=A(r.columnFields,r.hierarchy.column,r.hierarchy);if(e.length*(1+(l.options.subtotals?.length??0)+ +!!r.totals)*(1+(t.options.subtotals?.length??0)+ +!!r.totals)*r.measures.length>(r.maxAggregateUpdates??1e7))throw new Error("矩阵聚合更新超出 maxAggregateUpdates 预算");let o=M(0,r,l,t);for(const a of e){if(!a||typeof a!="object"||Array.isArray(a))throw new Error("矩阵数据行应为对象");F(l,a),F(t,a),o=M(e.length,r,l,t)}return{row:l,column:t,shape:o}}function j(e,r){return x(e,r).shape}function p(e,r,l){const t=new Map;for(const n of e){const o=v(l.row,n,!!r.totals),a=v(l.column,n,!!r.totals);for(const s of o){let i=t.get(s);i||(i=new Map,t.set(s,i));for(const c of a){let u=i.get(c);u||(u=r.measures.map(f=>g.createAggregateAccumulator({...f,field:f.valueField??f.field})),i.set(c,u)),u.forEach(f=>f.add(n))}}}return t}function H(e,r){return e.flatMap((l,t)=>r.measures.map((n,o)=>({...l,field:l.kind==="total"?`total_${o}`:`c${t}_${o}`,measure:o,measureField:n.field,valueField:n.valueField??n.field,operation:n.op})))}function I(e,r){return e.kind==="total"?r.hierarchy.totalLabel??"合计":[...e.labels,...e.kind==="subtotal"?[r.hierarchy.subtotalLabel??"小计"]:[]].join(" / ")}function K(e,r){return[...r.rowFields.map((l,t)=>({field:`r${t}`,header:r.hierarchy.row?.labels?.[t]??l,semanticRole:"dimension"})),...e.map(l=>{const t=r.measures[l.measure];return{field:l.field,header:`${I(l,r)} · ${t.label??`${t.field} (${t.op})`}`,semanticRole:"measure",...t.digits===void 0?{}:{format:{kind:"number",digits:t.digits}}}})]}function T(e,r,l,t){return e.map(n=>{const o={};l.rowFields.forEach((a,s)=>{o[`r${s}`]=n.kind==="total"?s===0?l.hierarchy.totalLabel??"合计":null:n.labels[s]??(s===n.depth?l.hierarchy.subtotalLabel??"小计":null)});for(const a of r)o[a.field]=t.get(n.key)?.get(a.key)?.[a.measure]?.value()??(l.measures[a.measure].op==="count"?0:null);return o})}function _(e,r){const l=x(e,r),t=E(l.row,!!r.totals),n=H(E(l.column,!!r.totals),r),o=p(e,r,l);return{columns:K(n,r),rows:T(t,n,r,o),headerGrid:O(r,n),metadata:{rowFields:[...r.rowFields],rowLabels:[...r.hierarchy.row?.labels??r.rowFields],columnFields:[...r.columnFields],columnLabels:[...r.hierarchy.column?.labels??r.columnFields],rows:t,columns:n}}}function m(e,r){const l=r.map(t=>Object.prototype.hasOwnProperty.call(e,t)?e[t]:null);if(l.some(t=>t!=null&&typeof t!="string"&&typeof t!="boolean"&&!(typeof t=="number"&&Number.isFinite(t))))throw new Error("矩阵维度必须是有限 JSON 标量");return{key:JSON.stringify(l.map(t=>[typeof t,t??null])),label:l.map(t=>t==null?"":String(t)).join(" / ")}}function J(e){for(const r of["maxRows","maxColumns","maxInputRows","maxCells","maxAggregateUpdates"])if(e[r]!==void 0&&(!Number.isSafeInteger(e[r])||e[r]<1))throw new Error("矩阵预算应为正安全整数");for(const r of["columnWidthMm","rowWidthMm"])if(e[r]!==void 0&&(!Number.isFinite(e[r])||e[r]<=0))throw new Error("矩阵列宽应为正数")}function b(e){if(!e||!Array.isArray(e.rowFields)||!Array.isArray(e.columnFields)||!Array.isArray(e.measures))throw new Error("矩阵需要行维度、列维度和度量数组");for(const l of[e.rowFields,e.columnFields])if(l.some(t=>typeof t!="string"||!t.trim())||new Set(l).size!==l.length)throw new Error("矩阵维度字段应非空且唯一");if(J(e),!e.rowFields.length||!e.columnFields.length||e.rowFields.length>16||e.columnFields.length>16)throw new Error("矩阵需要 1–16 个行/列维度");if(!e.measures.length||e.measures.length>32)throw new Error("矩阵需要 1–32 个度量");if(e.measures.map(l=>{if(!l||typeof l!="object")throw new Error("矩阵度量应为对象");if(g.createAggregateAccumulator({...l,field:l.valueField??l.field}),l.label!==void 0&&typeof l.label!="string")throw new Error("矩阵度量标签应为字符串");return l.field}).some(l=>typeof l!="string"||!l.trim()))throw new Error("矩阵度量字段应非空");e.hierarchy!==void 0&&N(e.hierarchy,e.rowFields,e.columnFields)}function C(e,r){if(b(r),r.hierarchy)return j(e,r);if(!Array.isArray(e)||e.length>(r.maxInputRows??1e5))throw new Error("矩阵输入超出预算");const l=new Set,t=new Set;for(const a of e){if(!a||typeof a!="object"||Array.isArray(a))throw new Error("矩阵数据行应为对象");if(l.add(m(a,r.rowFields).key),t.add(m(a,r.columnFields).key),l.size>(r.maxRows??1e3)||t.size>(r.maxColumns??200))throw new Error("矩阵维度数量超出预算");if((l.size+ +!!r.totals)*((t.size+ +!!r.totals)*r.measures.length+1)>(r.maxCells??2e6))throw new Error("矩阵输出超出 maxCells 预算")}const n=l.size+ +(!!r.totals&&e.length>0),o=(t.size+ +!!r.totals)*r.measures.length+1;return{rowCount:n,columnCount:o,cells:n*o}}function P(e,r){if(r?.hierarchy)return b(r),_(e,r);C(e,r);const l=$(e,{row:a=>m(a,r.rowFields),column:a=>m(a,r.columnFields),measures:r.measures.map(a=>({...a,field:a.valueField??a.field})),totals:r.totals,check:()=>{}}),t=[...l.groups.values()].map(a=>({rowLabel:a.label})),n=[{field:"rowLabel",header:r.rowHeader??r.rowFields.join(" / "),semanticRole:"dimension"}],o={rowLabel:"合计"};return r.measures.forEach((a,s)=>{const i=[...l.columns.entries()].map(([c,u],f)=>({key:c,label:u,field:`c${f}_${s}`}));r.totals&&i.push({key:"",label:"合计",field:`total_${s}`});for(const c of i){const u=c.field===`total_${s}`;n.push({field:c.field,header:`${c.label} · ${a.label??`${a.field} (${a.op})`}`,semanticRole:"measure",...a.digits===void 0?{}:{format:{kind:"number",digits:a.digits}}});let f=0;for(const d of l.groups.values())t[f++][c.field]=(u?d.totals?.[s]:d.cells.get(c.key)?.[s])?.value()??(a.op==="count"?0:null);o[c.field]=(u?l.totals?.[s]:l.columnTotals.get(c.key)?.[s])?.value()??(a.op==="count"?0:null)}}),r.totals&&e.length&&t.push(o),{rows:t,columns:n}}exports.accumulatePivotRows=$;exports.createMatrixTable=P;exports.estimateMatrixTable=C;exports.validateMatrixOptions=b;