@agile-team/mach-report 2.21.1 → 2.22.0

package/dist/template-serialization-CU4n_Miu.js

@@ -0,0 +1,307 @@
+import { e as V, c as v } from "./computed-C8NRZQss.js";
+function c(e) {
+  return !!e && typeof e == "object" && !Array.isArray(e);
+}
+function a(e, r, i) {
+  typeof e == "string" ? i.push({ field: e, path: r }) : Array.isArray(e) && e.forEach((n, t) => a(n, `${r}[${t}]`, i));
+}
+function w(e, r, i) {
+  if (Array.isArray(e)) {
+    e.forEach((n, t) => w(n, `${r}[${t}]`, i));
+    return;
+  }
+  if (c(e))
+    for (const [n, t] of Object.entries(e))
+      ["field", "weightField"].includes(n) ? a(t, `${r}.${n}`, i) : n !== "value" && n !== "style" && w(t, `${r}.${n}`, i);
+}
+function p(e, r, i) {
+  Array.isArray(e) && e.forEach((n, t) => {
+    if (!c(n)) return;
+    typeof n.field == "string" && n.valueField !== void 0 && n.valueField !== n.field && i.summaries.add(n.field);
+    const o = n.valueField === void 0 ? "field" : "valueField";
+    a(n[o], `${r}[${t}].${o}`, i.fields), n.valueField !== void 0 && n.valueField === n.field && a(n.field, `${r}[${t}].field`, i.fields), a(n.weightField, `${r}[${t}].weightField`, i.fields);
+  });
+}
+function j(e, r, i) {
+  for (const t of ["rowKey", "revisionField", "sourceTokenField"]) a(e[t], `${r}.${t}`, i.fields);
+  if (!e.matrix && Array.isArray(e.columns) && e.columns.forEach((t, o) => {
+    c(t) && (typeof t.field == "string" && i.fields.push({ field: t.field, path: `${r}.columns[${o}].field`, summary: !0 }), w(t.rules, `${r}.columns[${o}].rules`, i.fields), w(t.visibleWhen, `${r}.columns[${o}].visibleWhen`, i.fields));
+  }), w(e.rowVisibleWhen, `${r}.rowVisibleWhen`, i.fields), Array.isArray(e.computed) && e.computed.forEach((t, o) => {
+    c(t) && (typeof t.field == "string" && i.generated.add(t.field), w(t.expression, `${r}.computed[${o}].expression`, i.fields), a(t.dependsOn, `${r}.computed[${o}].dependsOn`, i.fields), a(t.groupBy, `${r}.computed[${o}].groupBy`, i.fields));
+  }), (Array.isArray(e.groups) ? e.groups.map((t, o) => ({ group: t, path: `${r}.groups[${o}]` })) : e.groupBy ? [{ group: e.groupBy, path: `${r}.groupBy` }] : []).forEach(({ group: t, path: o }) => {
+    c(t) && (a(t.field, `${o}.field`, i.fields), a(t.subtotal, `${o}.subtotal`, i.fields), p(t.aggregates, `${o}.aggregates`, i));
+  }), c(e.grandTotal) && (a(e.grandTotal.fields, `${r}.grandTotal.fields`, i.fields), p(e.grandTotal.aggregates, `${r}.grandTotal.aggregates`, i)), c(e.matrix) && (a(e.matrix.rowFields, `${r}.matrix.rowFields`, i.fields), a(e.matrix.columnFields, `${r}.matrix.columnFields`, i.fields), p(e.matrix.measures, `${r}.matrix.measures`, i)), c(e.tree)) {
+    for (const t of ["idField", "parentField", "labelField"]) a(e.tree[t], `${r}.tree.${t}`, i.fields);
+    p(e.tree.aggregates, `${r}.tree.aggregates`, i);
+  }
+  c(e.detail) && a(e.detail.parentKey, `${r}.detail.parentKey`, i.fields);
+}
+function U(e) {
+  const r = [], i = e.repeat, n = i ? { dataset: i.dataset, path: "$.template.repeat", fields: [], generated: /* @__PURE__ */ new Set(), summaries: /* @__PURE__ */ new Set() } : void 0;
+  n && i && (a(i.rowKey, "$.template.repeat.rowKey", n.fields), typeof i.copies == "object" && a(i.copies.field, "$.template.repeat.copies.field", n.fields), r.push(n));
+  function t(o, s) {
+    if (Array.isArray(o)) {
+      o.forEach((f, l) => t(f, `${s}[${l}]`));
+      return;
+    }
+    if (c(o)) {
+      if (n && c(o.binding) && a(o.binding.field, `${s}.binding.field`, n.fields), c(o.chartBinding) && typeof o.chartBinding.dataset == "string") {
+        const f = `${s}.chartBinding`, l = o.chartBinding, d = { dataset: l.dataset, path: f, fields: [], generated: /* @__PURE__ */ new Set(), summaries: /* @__PURE__ */ new Set() };
+        a(l.categoryField, `${f}.categoryField`, d.fields), w(l.measures, `${f}.measures`, d.fields), r.push(d);
+      }
+      if (typeof o.dataset == "string" && Array.isArray(o.columns)) {
+        const f = { dataset: o.dataset, path: s, fields: [], generated: /* @__PURE__ */ new Set(), summaries: /* @__PURE__ */ new Set() };
+        j(o, s, f), typeof o.foreignKey == "string" && a(o.foreignKey, `${s}.foreignKey`, f.fields), r.push(f);
+      }
+      for (const [f, l] of Object.entries(o)) t(l, `${s}.${f}`);
+    }
+  }
+  return t(e, "$.template"), r;
+}
+class K extends Error {
+  constructor(r) {
+    super(`树节点超出行数预算 ${r}`), this.limit = r, this.code = "tree-row-limit", this.name = "TreeRowLimitError";
+  }
+}
+function E(e, r, i, n) {
+  const t = e ?? r;
+  if (!Number.isInteger(t) || t < 1 || t > i) throw new Error(`${n}应为 1–${i} 的整数`);
+  return t;
+}
+function b(e) {
+  return { rows: E(e.maxRows, 1e5, 1e6, "树行数预算"), depth: E(e.maxDepth, 64, 256, "树深度预算"), visits: E(e.maxAggregationVisits, 1e6, 1e7, "树聚合访问预算") };
+}
+function M(e) {
+  return typeof e == "string" && !!e.trim();
+}
+function g(e) {
+  return M(e) && !["__proto__", "prototype", "constructor"].includes(e);
+}
+function N(e) {
+  if (M(e) || typeof e == "number" && Number.isFinite(e)) return e;
+  throw new Error("树节点业务键应为非空字符串或有限数字");
+}
+function S(e) {
+  return JSON.stringify([typeof e, e]);
+}
+function x(e) {
+  return [e.idField, ...e.input === "flat" ? [e.parentField ?? ""] : [e.childrenField ?? "children"]];
+}
+function R(e, r) {
+  const i = x(e);
+  if (r?.some((n) => n.scope && n.scope !== "row" || i.includes(n.field))) throw new Error("树形布局仅支持不覆盖结构键的当前行计算");
+}
+function m(e) {
+  if (!e?.aborted) return;
+  const r = new Error("树报表处理已取消");
+  throw r.name = "AbortError", r;
+}
+function I(e) {
+  const r = e.aggregates ?? [];
+  if (!Array.isArray(r) || r.length > 32) throw new Error("树聚合最多 32 项");
+  if (e.parentValues !== "leaf-aggregate" && r.length) throw new Error("树聚合需显式选择 leaf-aggregate 父级取值策略");
+  if (e.parentValues === "leaf-aggregate" && !r.length) throw new Error("叶子聚合策略至少需要一个聚合字段");
+  const i = /* @__PURE__ */ new Set();
+  for (const n of r) {
+    if (!n || !g(n.field) || i.has(n.field)) throw new Error("树聚合输出字段应安全、非空且唯一");
+    for (const t of [n.valueField, n.weightField]) if (t !== void 0 && !g(t)) throw new Error("树聚合来源字段应安全且非空");
+    if ([...x(e), e.labelField].includes(n.field)) throw new Error("树聚合不能覆盖结构键或标签字段");
+    i.add(n.field), v({ ...n, field: n.valueField ?? n.field });
+  }
+}
+function _(e) {
+  if (!g(e.idField) || !g(e.labelField)) throw new Error("树需要安全的业务键和标签字段");
+  if (e.input === "flat" && (!g(e.parentField) || e.parentField === e.idField)) throw new Error("扁平树需要独立的父键字段");
+  if (e.childrenField !== void 0 && !g(e.childrenField)) throw new Error("子节点字段应安全且非空");
+  if (e.input === "nested" && [e.idField, e.labelField].includes(e.childrenField ?? "children")) throw new Error("子节点字段不能覆盖业务键或标签字段");
+}
+function W(e) {
+  if (!e || typeof e != "object" || !["flat", "nested"].includes(e.input)) throw new Error("树输入应为 flat 或 nested");
+  if (_(e), e.orphan !== void 0 && !["error", "root"].includes(e.orphan)) throw new Error("树孤儿策略应为 error 或 root");
+  if (e.parentValues !== void 0 && !["source", "leaf-aggregate"].includes(e.parentValues)) throw new Error("未知树父级取值策略");
+  if (e.indentMm !== void 0 && (!Number.isFinite(e.indentMm) || e.indentMm < 0 || e.indentMm > 20)) throw new Error("树每级缩进应为 0–20 mm");
+  b(e), I(e);
+}
+function C(e, r, i, n) {
+  if (!e || typeof e != "object" || Array.isArray(e)) throw new Error("树节点应为对象");
+  if (i.size >= n.rows) throw new K(n.rows);
+  const t = N(e[r.idField]), o = S(t);
+  if (i.has(o)) throw new Error(`树节点业务键重复：${String(t)}`);
+  const s = { original: e, row: e, key: t, depth: 0, children: [] };
+  return i.set(o, s), s;
+}
+function D(e, r, i, n, t) {
+  for (const s of e)
+    m(t), C(s, r, i, n);
+  const o = [];
+  for (const s of i.values()) {
+    m(t);
+    const f = s.row[r.parentField];
+    if (f == null) {
+      o.push(s);
+      continue;
+    }
+    const l = i.get(S(N(f)));
+    if (!l) {
+      if (r.orphan !== "root") throw new Error(`树节点 ${String(s.key)} 的父节点不存在`);
+      o.push(s);
+      continue;
+    }
+    if (l === s) throw new Error("树节点不能以自身为父节点");
+    s.parent = l, l.children.push(s);
+  }
+  return o;
+}
+function J(e, r, i, n, t) {
+  const o = [], s = [{ rows: e, next: 0 }];
+  for (; s.length; ) {
+    m(t);
+    const f = s[s.length - 1];
+    if (f.next >= f.rows.length) {
+      s.pop();
+      continue;
+    }
+    const l = C(f.rows[f.next++], r, i, n);
+    if (l.parent = f.parent, l.depth = s.length - 1, s.length > n.depth) throw new Error(`树节点超出深度预算 ${n.depth}`);
+    (f.parent?.children ?? o).push(l);
+    const d = l.row[r.childrenField ?? "children"];
+    if (d != null) {
+      if (!Array.isArray(d)) throw new Error("嵌套树 children 字段应为数组");
+      d.length && s.push({ rows: d, next: 0, parent: l });
+    }
+  }
+  return o;
+}
+function L(e, r, i, n) {
+  const t = [], o = [{ nodes: e, next: 0 }];
+  for (; o.length; ) {
+    m(n);
+    const s = o[o.length - 1];
+    if (s.next >= s.nodes.length) {
+      o.pop();
+      continue;
+    }
+    if (o.length > i.depth) throw new Error(`树节点超出深度预算 ${i.depth}`);
+    const f = s.nodes[s.next++];
+    f.depth = o.length - 1, t.push(f), f.children.length && o.push({ nodes: f.children, next: 0 });
+  }
+  if (t.length !== r) throw new Error("树父子关系存在循环");
+  return t;
+}
+function z(e, r, i, n) {
+  if (r.parentValues !== "leaf-aggregate") return;
+  const t = r.aggregates, o = /* @__PURE__ */ new Map();
+  for (const f of e) f.children.length && o.set(f, t.map((l) => v({ ...l, field: l.valueField ?? l.field })));
+  let s = 0;
+  for (const f of e)
+    if (!f.children.length)
+      for (let l = f.parent; l; l = l.parent) {
+        if (m(n), s += t.length, s > i.visits) throw new Error(`树聚合超出访问预算 ${i.visits}`);
+        for (const d of o.get(l)) d.add(f.row);
+      }
+  for (const [f, l] of o)
+    f.row = { ...f.row }, t.forEach((d, u) => {
+      f.row[d.field] = l[u].value();
+    });
+}
+function O(e, r, i) {
+  if (W(r), m(i), !Array.isArray(e)) throw new Error("树数据应为节点数组");
+  const n = b(r), t = /* @__PURE__ */ new Map(), o = r.input === "flat" ? D(e, r, t, n, i) : J(e, r, t, n, i);
+  return L(o, t.size, n, i);
+}
+function Y(e, r, i) {
+  return O(e, r, i).map((n) => n.original);
+}
+function Z(e, r, i = {}) {
+  const n = O(e, r, i.signal);
+  if (R(r, i.computed?.fields), i.computed?.fields.length) {
+    const t = V(n.map((o) => o.row), { ...i.computed, signal: i.signal }).rows;
+    n.forEach((o, s) => {
+      o.row = t[s];
+    });
+  }
+  return z(n, r, b(r), i.signal), { rows: n.map((t) => t.row), entries: n.map((t) => ({ row: t.row, original: t.original, key: t.key, depth: t.depth, hasChildren: !!t.children.length })), leaves: n.filter((t) => !t.children.length).map((t) => t.row) };
+}
+const H = /^#[0-9a-f]{6}$/i;
+function X(e) {
+  if (!e || typeof e != "object" || Array.isArray(e)) return !1;
+  const r = e;
+  return r.kind !== "colorScale" && r.kind !== "dataBar" || r.field !== void 0 && (typeof r.field != "string" || !r.field.trim()) || r.numeric !== void 0 && !["number", "decimal"].includes(r.numeric) || [r.min, r.max].some((i) => i !== void 0 && (typeof i != "number" || !Number.isFinite(i))) || r.min !== void 0 && r.max !== void 0 && r.min > r.max ? !1 : Object.entries(r).every(([i, n]) => !["color", "negativeColor", "lowColor", "highColor"].includes(i) || typeof n == "string" && H.test(n));
+}
+function B(e, r) {
+  if (typeof e == "number") return Number.isFinite(e) ? e : void 0;
+  if (r !== "decimal" || typeof e != "string" || e.length > 1024 || !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)(?:[eE][+-]?\d+)?$/.test(e)) return;
+  const i = Number(e);
+  return Number.isFinite(i) ? i : void 0;
+}
+function q(e, r, i) {
+  let n = "#";
+  for (const t of [1, 3, 5]) {
+    const o = parseInt(e.slice(t, t + 2), 16), s = parseInt(r.slice(t, t + 2), 16);
+    n += Math.round(o + (s - o) * i).toString(16).padStart(2, "0");
+  }
+  return n;
+}
+function A(e, r, i) {
+  if (r === i) return e < r ? 0 : e > i ? 1 : 0.5;
+  if (e <= r) return 0;
+  if (e >= i) return 1;
+  const n = i - r;
+  return Number.isFinite(n) ? (e - r) / n : (e / 2 - r / 2) / (i / 2 - r / 2);
+}
+function G(e, r, i, n) {
+  const t = /* @__PURE__ */ new WeakMap();
+  return { apply(o, s) {
+    const f = B(s[r], e.numeric);
+    if (f === void 0) return;
+    if (e.kind === "dataBar") {
+      const h = Math.min(i, 0), $ = Math.max(n, 0), F = A(0, h, $), k = h === $ ? F : A(f, h, $);
+      o.dataBar = { start: Math.min(F, k), end: Math.max(F, k), color: f < 0 ? e.negativeColor ?? "#f3bcc3" : e.color ?? "#bad8fa" };
+      return;
+    }
+    const l = q(e.lowColor ?? "#f0f7ff", e.highColor ?? "#8bbcf1", A(f, i, n)), d = o.style ?? {}, u = t.get(d) ?? /* @__PURE__ */ new Map();
+    t.set(d, u);
+    let y = u.get(l);
+    y || (y = { ...d, backgroundColor: l }, u.set(l, y)), o.style = y;
+  } };
+}
+function ee(e, r, i) {
+  return e.map((n) => {
+    T(i);
+    const t = n.visual;
+    if (!t) return;
+    if (!X(t)) throw new TypeError("Invalid column visual rule");
+    const o = t.field ?? n.field;
+    let s = 1 / 0, f = -1 / 0, l = 0;
+    if (t.min === void 0 || t.max === void 0) for (const y of r) {
+      (l++ & 1023) === 0 && T(i);
+      const h = B(y[o], t.numeric);
+      h !== void 0 && (s = Math.min(s, h), f = Math.max(f, h));
+    }
+    let d = t.min ?? s, u = t.max ?? f;
+    if (!(!Number.isFinite(d) || !Number.isFinite(u)))
+      return d > u && (t.min !== void 0 ? u = d : d = u), G(t, o, d, u);
+  });
+}
+function T(e) {
+  if (e?.aborted) throw e.reason ?? new DOMException("Aborted", "AbortError");
+}
+const P = 1e7;
+function re(e) {
+  const r = JSON.stringify(e, null, 2);
+  if (r.length > P)
+    throw new RangeError("模板 JSON 超过 1000 万字符的导出/导入上限");
+  return r;
+}
+export {
+  P as M,
+  K as T,
+  W as a,
+  U as b,
+  Z as c,
+  R as d,
+  ee as e,
+  Y as f,
+  re as s,
+  X as v
+};

package/dist/template-serialization-CgqBo6s-.cjs

@@ -0,0 +1 @@
+"use strict";const b=require("./computed-4TnxzgIh.cjs");function c(e){return!!e&&typeof e=="object"&&!Array.isArray(e)}function a(e,r,i){typeof e=="string"?i.push({field:e,path:r}):Array.isArray(e)&&e.forEach((n,t)=>a(n,`${r}[${t}]`,i))}function w(e,r,i){if(Array.isArray(e)){e.forEach((n,t)=>w(n,`${r}[${t}]`,i));return}if(c(e))for(const[n,t]of Object.entries(e))["field","weightField"].includes(n)?a(t,`${r}.${n}`,i):n!=="value"&&n!=="style"&&w(t,`${r}.${n}`,i)}function p(e,r,i){Array.isArray(e)&&e.forEach((n,t)=>{if(!c(n))return;typeof n.field=="string"&&n.valueField!==void 0&&n.valueField!==n.field&&i.summaries.add(n.field);const o=n.valueField===void 0?"field":"valueField";a(n[o],`${r}[${t}].${o}`,i.fields),n.valueField!==void 0&&n.valueField===n.field&&a(n.field,`${r}[${t}].field`,i.fields),a(n.weightField,`${r}[${t}].weightField`,i.fields)})}function I(e,r,i){for(const t of["rowKey","revisionField","sourceTokenField"])a(e[t],`${r}.${t}`,i.fields);if(!e.matrix&&Array.isArray(e.columns)&&e.columns.forEach((t,o)=>{c(t)&&(typeof t.field=="string"&&i.fields.push({field:t.field,path:`${r}.columns[${o}].field`,summary:!0}),w(t.rules,`${r}.columns[${o}].rules`,i.fields),w(t.visibleWhen,`${r}.columns[${o}].visibleWhen`,i.fields))}),w(e.rowVisibleWhen,`${r}.rowVisibleWhen`,i.fields),Array.isArray(e.computed)&&e.computed.forEach((t,o)=>{c(t)&&(typeof t.field=="string"&&i.generated.add(t.field),w(t.expression,`${r}.computed[${o}].expression`,i.fields),a(t.dependsOn,`${r}.computed[${o}].dependsOn`,i.fields),a(t.groupBy,`${r}.computed[${o}].groupBy`,i.fields))}),(Array.isArray(e.groups)?e.groups.map((t,o)=>({group:t,path:`${r}.groups[${o}]`})):e.groupBy?[{group:e.groupBy,path:`${r}.groupBy`}]:[]).forEach(({group:t,path:o})=>{c(t)&&(a(t.field,`${o}.field`,i.fields),a(t.subtotal,`${o}.subtotal`,i.fields),p(t.aggregates,`${o}.aggregates`,i))}),c(e.grandTotal)&&(a(e.grandTotal.fields,`${r}.grandTotal.fields`,i.fields),p(e.grandTotal.aggregates,`${r}.grandTotal.aggregates`,i)),c(e.matrix)&&(a(e.matrix.rowFields,`${r}.matrix.rowFields`,i.fields),a(e.matrix.columnFields,`${r}.matrix.columnFields`,i.fields),p(e.matrix.measures,`${r}.matrix.measures`,i)),c(e.tree)){for(const t of["idField","parentField","labelField"])a(e.tree[t],`${r}.tree.${t}`,i.fields);p(e.tree.aggregates,`${r}.tree.aggregates`,i)}c(e.detail)&&a(e.detail.parentKey,`${r}.detail.parentKey`,i.fields)}function L(e){const r=[],i=e.repeat,n=i?{dataset:i.dataset,path:"$.template.repeat",fields:[],generated:new Set,summaries:new Set}:void 0;n&&i&&(a(i.rowKey,"$.template.repeat.rowKey",n.fields),typeof i.copies=="object"&&a(i.copies.field,"$.template.repeat.copies.field",n.fields),r.push(n));function t(o,s){if(Array.isArray(o)){o.forEach((f,l)=>t(f,`${s}[${l}]`));return}if(c(o)){if(n&&c(o.binding)&&a(o.binding.field,`${s}.binding.field`,n.fields),c(o.chartBinding)&&typeof o.chartBinding.dataset=="string"){const f=`${s}.chartBinding`,l=o.chartBinding,d={dataset:l.dataset,path:f,fields:[],generated:new Set,summaries:new Set};a(l.categoryField,`${f}.categoryField`,d.fields),w(l.measures,`${f}.measures`,d.fields),r.push(d)}if(typeof o.dataset=="string"&&Array.isArray(o.columns)){const f={dataset:o.dataset,path:s,fields:[],generated:new Set,summaries:new Set};I(o,s,f),typeof o.foreignKey=="string"&&a(o.foreignKey,`${s}.foreignKey`,f.fields),r.push(f)}for(const[f,l]of Object.entries(o))t(l,`${s}.${f}`)}}return t(e,"$.template"),r}class M extends Error{constructor(r){super(`树节点超出行数预算 ${r}`),this.limit=r,this.code="tree-row-limit",this.name="TreeRowLimitError"}}function F(e,r,i,n){const t=e??r;if(!Number.isInteger(t)||t<1||t>i)throw new Error(`${n}应为 1–${i} 的整数`);return t}function T(e){return{rows:F(e.maxRows,1e5,1e6,"树行数预算"),depth:F(e.maxDepth,64,256,"树深度预算"),visits:F(e.maxAggregationVisits,1e6,1e7,"树聚合访问预算")}}function S(e){return typeof e=="string"&&!!e.trim()}function m(e){return S(e)&&!["__proto__","prototype","constructor"].includes(e)}function C(e){if(S(e)||typeof e=="number"&&Number.isFinite(e))return e;throw new Error("树节点业务键应为非空字符串或有限数字")}function N(e){return JSON.stringify([typeof e,e])}function O(e){return[e.idField,...e.input==="flat"?[e.parentField??""]:[e.childrenField??"children"]]}function V(e,r){const i=O(e);if(r?.some(n=>n.scope&&n.scope!=="row"||i.includes(n.field)))throw new Error("树形布局仅支持不覆盖结构键的当前行计算")}function g(e){if(!e?.aborted)return;const r=new Error("树报表处理已取消");throw r.name="AbortError",r}function D(e){const r=e.aggregates??[];if(!Array.isArray(r)||r.length>32)throw new Error("树聚合最多 32 项");if(e.parentValues!=="leaf-aggregate"&&r.length)throw new Error("树聚合需显式选择 leaf-aggregate 父级取值策略");if(e.parentValues==="leaf-aggregate"&&!r.length)throw new Error("叶子聚合策略至少需要一个聚合字段");const i=new Set;for(const n of r){if(!n||!m(n.field)||i.has(n.field))throw new Error("树聚合输出字段应安全、非空且唯一");for(const t of[n.valueField,n.weightField])if(t!==void 0&&!m(t))throw new Error("树聚合来源字段应安全且非空");if([...O(e),e.labelField].includes(n.field))throw new Error("树聚合不能覆盖结构键或标签字段");i.add(n.field),b.createAggregateAccumulator({...n,field:n.valueField??n.field})}}function J(e){if(!m(e.idField)||!m(e.labelField))throw new Error("树需要安全的业务键和标签字段");if(e.input==="flat"&&(!m(e.parentField)||e.parentField===e.idField))throw new Error("扁平树需要独立的父键字段");if(e.childrenField!==void 0&&!m(e.childrenField))throw new Error("子节点字段应安全且非空");if(e.input==="nested"&&[e.idField,e.labelField].includes(e.childrenField??"children"))throw new Error("子节点字段不能覆盖业务键或标签字段")}function x(e){if(!e||typeof e!="object"||!["flat","nested"].includes(e.input))throw new Error("树输入应为 flat 或 nested");if(J(e),e.orphan!==void 0&&!["error","root"].includes(e.orphan))throw new Error("树孤儿策略应为 error 或 root");if(e.parentValues!==void 0&&!["source","leaf-aggregate"].includes(e.parentValues))throw new Error("未知树父级取值策略");if(e.indentMm!==void 0&&(!Number.isFinite(e.indentMm)||e.indentMm<0||e.indentMm>20))throw new Error("树每级缩进应为 0–20 mm");T(e),D(e)}function B(e,r,i,n){if(!e||typeof e!="object"||Array.isArray(e))throw new Error("树节点应为对象");if(i.size>=n.rows)throw new M(n.rows);const t=C(e[r.idField]),o=N(t);if(i.has(o))throw new Error(`树节点业务键重复：${String(t)}`);const s={original:e,row:e,key:t,depth:0,children:[]};return i.set(o,s),s}function W(e,r,i,n,t){for(const s of e)g(t),B(s,r,i,n);const o=[];for(const s of i.values()){g(t);const f=s.row[r.parentField];if(f==null){o.push(s);continue}const l=i.get(N(C(f)));if(!l){if(r.orphan!=="root")throw new Error(`树节点 ${String(s.key)} 的父节点不存在`);o.push(s);continue}if(l===s)throw new Error("树节点不能以自身为父节点");s.parent=l,l.children.push(s)}return o}function z(e,r,i,n,t){const o=[],s=[{rows:e,next:0}];for(;s.length;){g(t);const f=s[s.length-1];if(f.next>=f.rows.length){s.pop();continue}const l=B(f.rows[f.next++],r,i,n);if(l.parent=f.parent,l.depth=s.length-1,s.length>n.depth)throw new Error(`树节点超出深度预算 ${n.depth}`);(f.parent?.children??o).push(l);const d=l.row[r.childrenField??"children"];if(d!=null){if(!Array.isArray(d))throw new Error("嵌套树 children 字段应为数组");d.length&&s.push({rows:d,next:0,parent:l})}}return o}function H(e,r,i,n){const t=[],o=[{nodes:e,next:0}];for(;o.length;){g(n);const s=o[o.length-1];if(s.next>=s.nodes.length){o.pop();continue}if(o.length>i.depth)throw new Error(`树节点超出深度预算 ${i.depth}`);const f=s.nodes[s.next++];f.depth=o.length-1,t.push(f),f.children.length&&o.push({nodes:f.children,next:0})}if(t.length!==r)throw new Error("树父子关系存在循环");return t}function X(e,r,i,n){if(r.parentValues!=="leaf-aggregate")return;const t=r.aggregates,o=new Map;for(const f of e)f.children.length&&o.set(f,t.map(l=>b.createAggregateAccumulator({...l,field:l.valueField??l.field})));let s=0;for(const f of e)if(!f.children.length)for(let l=f.parent;l;l=l.parent){if(g(n),s+=t.length,s>i.visits)throw new Error(`树聚合超出访问预算 ${i.visits}`);for(const d of o.get(l))d.add(f.row)}for(const[f,l]of o)f.row={...f.row},t.forEach((d,u)=>{f.row[d.field]=l[u].value()})}function R(e,r,i){if(x(r),g(i),!Array.isArray(e))throw new Error("树数据应为节点数组");const n=T(r),t=new Map,o=r.input==="flat"?W(e,r,t,n,i):z(e,r,t,n,i);return H(o,t.size,n,i)}function q(e,r,i){return R(e,r,i).map(n=>n.original)}function P(e,r,i={}){const n=R(e,r,i.signal);if(V(r,i.computed?.fields),i.computed?.fields.length){const t=b.computeDataset(n.map(o=>o.row),{...i.computed,signal:i.signal}).rows;n.forEach((o,s)=>{o.row=t[s]})}return X(n,r,T(r),i.signal),{rows:n.map(t=>t.row),entries:n.map(t=>({row:t.row,original:t.original,key:t.key,depth:t.depth,hasChildren:!!t.children.length})),leaves:n.filter(t=>!t.children.length).map(t=>t.row)}}const G=/^#[0-9a-f]{6}$/i;function j(e){if(!e||typeof e!="object"||Array.isArray(e))return!1;const r=e;return r.kind!=="colorScale"&&r.kind!=="dataBar"||r.field!==void 0&&(typeof r.field!="string"||!r.field.trim())||r.numeric!==void 0&&!["number","decimal"].includes(r.numeric)||[r.min,r.max].some(i=>i!==void 0&&(typeof i!="number"||!Number.isFinite(i)))||r.min!==void 0&&r.max!==void 0&&r.min>r.max?!1:Object.entries(r).every(([i,n])=>!["color","negativeColor","lowColor","highColor"].includes(i)||typeof n=="string"&&G.test(n))}function _(e,r){if(typeof e=="number")return Number.isFinite(e)?e:void 0;if(r!=="decimal"||typeof e!="string"||e.length>1024||!/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)(?:[eE][+-]?\d+)?$/.test(e))return;const i=Number(e);return Number.isFinite(i)?i:void 0}function Q(e,r,i){let n="#";for(const t of[1,3,5]){const o=parseInt(e.slice(t,t+2),16),s=parseInt(r.slice(t,t+2),16);n+=Math.round(o+(s-o)*i).toString(16).padStart(2,"0")}return n}function A(e,r,i){if(r===i)return e<r?0:e>i?1:.5;if(e<=r)return 0;if(e>=i)return 1;const n=i-r;return Number.isFinite(n)?(e-r)/n:(e/2-r/2)/(i/2-r/2)}function U(e,r,i,n){const t=new WeakMap;return{apply(o,s){const f=_(s[r],e.numeric);if(f===void 0)return;if(e.kind==="dataBar"){const h=Math.min(i,0),$=Math.max(n,0),E=A(0,h,$),v=h===$?E:A(f,h,$);o.dataBar={start:Math.min(E,v),end:Math.max(E,v),color:f<0?e.negativeColor??"#f3bcc3":e.color??"#bad8fa"};return}const l=Q(e.lowColor??"#f0f7ff",e.highColor??"#8bbcf1",A(f,i,n)),d=o.style??{},u=t.get(d)??new Map;t.set(d,u);let y=u.get(l);y||(y={...d,backgroundColor:l},u.set(l,y)),o.style=y}}}function Y(e,r,i){return e.map(n=>{k(i);const t=n.visual;if(!t)return;if(!j(t))throw new TypeError("Invalid column visual rule");const o=t.field??n.field;let s=1/0,f=-1/0,l=0;if(t.min===void 0||t.max===void 0)for(const y of r){(l++&1023)===0&&k(i);const h=_(y[o],t.numeric);h!==void 0&&(s=Math.min(s,h),f=Math.max(f,h))}let d=t.min??s,u=t.max??f;if(!(!Number.isFinite(d)||!Number.isFinite(u)))return d>u&&(t.min!==void 0?u=d:d=u),U(t,o,d,u)})}function k(e){if(e?.aborted)throw e.reason??new DOMException("Aborted","AbortError")}const K=1e7;function Z(e){const r=JSON.stringify(e,null,2);if(r.length>K)throw new RangeError("模板 JSON 超过 1000 万字符的导出/导入上限");return r}exports.MAX_TEMPLATE_JSON_CHARACTERS=K;exports.TreeRowLimitError=M;exports.collectTemplateDatasetBindings=L;exports.createColumnVisualResolvers=Y;exports.createTreeTable=P;exports.flattenTreeInput=q;exports.stringifyValidatedTemplate=Z;exports.validColumnVisual=j;exports.validateTreeComputed=V;exports.validateTreeOptions=x;

package/dist/vue/async.d.cts

@@ -878,6 +878,7 @@ declare interface MachReportDefaults {
     toolbar?: MachReportToolbarOptions;
     interaction?: ReportInteractionOptions;
     preferences?: ReportPreferencesOptions;
+    refresh?: ReportRefreshOptions;
     /** Protect local input and drafts before replacing a report. Default true. */
     guardChanges?: boolean;
     beforeDiscard?: ReportBeforeDiscard;
@@ -921,6 +922,7 @@ declare type MachReportLogger = Pick<Console, "warn" | "info">;
  */
 /** 工具栏与状态文案（默认简体中文；出海场景覆写） */
 declare interface MachReportMessages extends Partial<ReportCalculationMessages>, Partial<ReportDataReviewMessages>, ReportPrintMessages, ReportParamOptionsMessages {
+    previousSnapshot?: string;
     reviewTools?: string;
     validationTitle?: string;
     validationError?: string;
@@ -1129,6 +1131,8 @@ declare interface MachReportPreviewOptions {
 /** 只读快照，由组件的同一套状态驱动；无需通过事件另建状态。 */
 declare interface MachReportState {
     readonly loading: boolean;
+    /** A retained previous snapshot is readable while writes/output remain blocked. */
+    readonly stale?: boolean;
     readonly hasPlan: boolean;
     readonly pageCount: number;
     readonly currentPage: number;
@@ -1175,6 +1179,8 @@ declare interface MachReportTheme {
     btnActiveBg: string;
 }
 declare interface MachReportToolbarOptions {
+    /** Reasons explain host restrictions without granting capabilities. */
+    unavailableReasons?: Partial<Record<ReportPreviewTool, string>>;
     search?: boolean;
     thumbnails?: boolean;
     zoom?: boolean;
@@ -2188,11 +2194,17 @@ declare interface ReportFetchInput extends ReportTaskMonitoring {
     onQueryResult?: (reportId: string, result: ReportQueryResult, reportIndex?: number) => void;
 }
 declare type ReportFieldAggregation = "sum" | "avg" | "min" | "max" | "count" | "none";
+declare type ReportFieldAggregation_2 = "sum" | "avg" | "min" | "max" | "count" | "none";
 declare interface ReportFieldCalculation {
     /** Business-owned explanation, never executable JavaScript or an inferred business formula. */
     description: string;
     dependsOn: readonly string[];
 }
+declare interface ReportFieldCalculation_2 {
+    /** Business-owned explanation, never executable JavaScript or an inferred business formula. */
+    description: string;
+    dependsOn: readonly string[];
+}
 declare interface ReportFieldContract extends ReportFieldSemantics {
     field: string;
     label?: string;
@@ -2207,6 +2219,20 @@ declare interface ReportFieldContract extends ReportFieldSemantics {
     semanticRole?: "identifier" | "dimension" | "measure" | "date" | "text";
     unit?: string;
 }
+declare interface ReportFieldContract_2 extends ReportFieldSemantics_2 {
+    field: string;
+    label?: string;
+    type: "text" | "number" | "boolean" | "date" | "decimal";
+    required?: boolean;
+    nullable?: boolean;
+    enum?: readonly (string | number | boolean)[];
+    min?: number;
+    max?: number;
+    minLength?: number;
+    maxLength?: number;
+    semanticRole?: "identifier" | "dimension" | "measure" | "date" | "text";
+    unit?: string;
+}
 declare interface ReportFieldSemantics {
     description?: string;
     /** Explicit meaning of null/missing; does not convert blanks into zero. */
@@ -2217,6 +2243,16 @@ declare interface ReportFieldSemantics {
     format?: ColumnFormat;
     calculation?: ReportFieldCalculation;
 }
+declare interface ReportFieldSemantics_2 {
+    description?: string;
+    /** Explicit meaning of null/missing; does not convert blanks into zero. */
+    missingMeaning?: string;
+    /** Recommended aggregation; none marks non-additive measures such as ratios. No aggregation runs implicitly. */
+    aggregation?: ReportFieldAggregation_2;
+    /** Shared presentation only; raw values and calculation precision remain unchanged. */
+    format?: ColumnFormat_3;
+    calculation?: ReportFieldCalculation_2;
+}
 declare interface ReportFieldTarget {
     field: string;
     datasetId?: string;
@@ -2410,8 +2446,8 @@ declare type ReportPredicateScalar = string | number | boolean | null;
 declare type ReportPredicateScalar_2 = string | number | boolean | null;
 declare type ReportPredicateScalar_3 = string | number | boolean | null;
 declare interface ReportPreferencesAdapter {
-    load(key: string): Partial<ReportPreviewPreferences> | null | Promise<Partial<ReportPreviewPreferences> | null>;
-    save(key: string, value: Readonly<Partial<ReportPreviewPreferences>>): void | Promise<void>;
+    load(key: string): ReportStoredPreferences | null | Promise<ReportStoredPreferences | null>;
+    save(key: string, value: Readonly<ReportStoredPreferences>): void | Promise<void>;
     remove?(key: string): void | Promise<void>;
 }
 declare interface ReportPreferencesOptions {
@@ -2509,6 +2545,17 @@ declare interface ReportQueryResult {
     sourceToken?: string;
     diagnostics?: ReportDiagnostic[];
 }
+/** Explicit refresh policy. The key identifies template/layout revisions outside query parameters. */
+declare interface ReportRefreshOptions {
+    retainPrevious?: boolean;
+    key?: string;
+    /** Host API request preceding the preview reload. Blocks edits and output without discarding drafts. */
+    pending?: boolean;
+    /** The host retained an earlier snapshot after its own query failed or was cancelled. */
+    stale?: boolean;
+    /** Retry the host HTTP query when it owns the stale snapshot. The host updates its own state. */
+    retry?(): void | Promise<void>;
+}
 declare type ReportRegistry = Record<string, ReportDefinition>;
 declare interface ReportRuntimeBudget {
     maxRows?: number;
@@ -2538,6 +2585,10 @@ declare interface ReportSaveResult {
     }>;
     diagnostics?: ReportDiagnostic[];
 }
+declare interface ReportStoredPreferences extends Partial<ReportPreviewPreferences> {
+    zoomMode?: "fit" | number;
+    wideZoomMode?: "fit" | number;
+}
 /** 阶段事件只包含可序列化值；不表示估算百分比，也不包含业务数据。 */
 declare interface ReportTaskEvent {
     taskId: string;
@@ -2556,6 +2607,8 @@ declare interface ReportTaskMonitoring {
 declare type ReportTaskObserver = (event: ReportTaskEvent) => void;
 declare interface ReportTemplate {
     schemaVersion?: string;
+    /** Optional source identity and stable field meanings for safe stored-template reuse. */
+    dataContract?: ReportTemplateDataContract;
     /** 参数定义（可选；宿主也可经 ReportPreview 的 paramDefs prop 提供，prop 优先） */
     params?: ReportParamDef[];
     /** Fixed label pages repeat in record → copy → template-page order. */
@@ -2564,12 +2617,28 @@ declare interface ReportTemplate {
 }
 declare interface ReportTemplate_2 {
     schemaVersion?: string;
+    /** Optional source identity and stable field meanings for safe stored-template reuse. */
+    dataContract?: ReportTemplateDataContract_2;
     /** 参数定义（可选；宿主也可经 ReportPreview 的 paramDefs prop 提供，prop 优先） */
     params?: ReportParamDef_2[];
     /** Fixed label pages repeat in record → copy → template-page order. */
     repeat?: ReportTemplateRepeat_2;
     pages: TemplatePage_2[];
 }
+declare interface ReportTemplateDataContract {
+    /** Host-owned report/domain identity, without a query date or tenant credentials. */
+    source?: string;
+    datasets: Readonly<Record<string, {
+        fields: readonly ReportTemplateFieldBinding[];
+    }>>;
+}
+declare interface ReportTemplateDataContract_2 {
+    /** Host-owned report/domain identity, without a query date or tenant credentials. */
+    source?: string;
+    datasets: Readonly<Record<string, {
+        fields: readonly ReportTemplateFieldBinding_2[];
+    }>>;
+}
 /** 可存入数据库/文件的纯 JSON 模板；数据、接口与鉴权仍由宿主提供。 */
 declare interface ReportTemplateDocument {
     schemaVersion: "1.0";
@@ -2580,6 +2649,22 @@ declare interface ReportTemplateDocument {
     description?: string;
     template: ReportTemplate;
 }
+/** Stable business meaning is independent of a column's position and editable caption. */
+declare interface ReportTemplateFieldBinding {
+    field: string;
+    label?: string;
+    semanticKey?: string;
+    type?: ReportFieldContract["type"];
+    unit?: string;
+}
+/** Stable business meaning is independent of a column's position and editable caption. */
+declare interface ReportTemplateFieldBinding_2 {
+    field: string;
+    label?: string;
+    semanticKey?: string;
+    type?: ReportFieldContract_2["type"];
+    unit?: string;
+}
 declare type ReportTemplateLoader = (context: ReportLoadContext) => ReportTemplate | Promise<ReportTemplate>;
 declare interface ReportTemplateProvider {
     list(context: {
@@ -2800,6 +2885,12 @@ declare type ValueFormat = ColumnFormat;
 declare type ValueFormat_2 = ColumnFormat_2;
 /** The same declarative formatting used by list columns, before any output backend. */
 declare type ValueFormat_3 = ColumnFormat_3;
+/** 可序列化的附加工作表在编码前写入，浏览器与 Worker 共用同一声明。 */
+declare interface XlsxAdditionalSheet {
+    name: string;
+    rows: readonly (readonly (string | number | boolean | null)[])[];
+    columnWidths?: readonly number[];
+}
 declare type XlsxImageOptions = ImageMediaOptions_2;
 /**
  * RenderPlan → xlsx 导出（B 端第二出口，对齐家族 @agile-team/mach-table-xlsx 路线）：
@@ -2812,6 +2903,8 @@ declare type XlsxImageOptions = ImageMediaOptions_2;
 declare interface XlsxRenderOptions extends AssetRenderOptions_2, XlsxImageOptions {
     /** 工作表命名（连续表默认使用标题，其余默认 "Sheet1" 起序）。 */
     sheetName?: (sheetIndex: number) => string;
+    /** 可序列化命名，用于 Worker；未提供的项沿用默认名称。 */
+    sheetNames?: readonly string[];
     /** auto 默认将 wide 逻辑表合并为连续 Sheet；pages 保留逐页；continuous 要求明确的表来源。 */
     sheetMode?: "auto" | "pages" | "continuous";
     /** 宽表或连续表默认 raw，其余默认 text；显式配置可覆盖默认值。 */
@@ -2820,5 +2913,7 @@ declare interface XlsxRenderOptions extends AssetRenderOptions_2, XlsxImageOptio
     maxDataBars?: number;
     /** 连续表默认不限制打印纸型；显式 A3/A4/A5 仅设置打印适配，不改变 Excel 列宽。 */
     paperSize?: "auto" | "a3" | "a4" | "a5";
+    /** 在最终编码前追加说明、审计等标量工作表，可直接交给 Worker。 */
+    additionalSheets?: readonly XlsxAdditionalSheet[];
 }
 export {};