@agile-team/mach-report 2.9.1 → 2.11.0

package/dist/tree-BX380Rr7.cjs

@@ -0,0 +1 @@
+"use strict";const s=require("./computed-CGV2a809.cjs");class g extends Error{constructor(r){super(`树节点超出行数预算 ${r}`),this.limit=r,this.code="tree-row-limit",this.name="TreeRowLimitError"}}function u(e,r,i,t){const n=e??r;if(!Number.isInteger(n)||n<1||n>i)throw new Error(`${t}应为 1–${i} 的整数`);return n}function w(e){return{rows:u(e.maxRows,1e5,1e6,"树行数预算"),depth:u(e.maxDepth,64,256,"树深度预算"),visits:u(e.maxAggregationVisits,1e6,1e7,"树聚合访问预算")}}function m(e){return typeof e=="string"&&!!e.trim()}function c(e){return m(e)&&!["__proto__","prototype","constructor"].includes(e)}function E(e){if(m(e)||typeof e=="number"&&Number.isFinite(e))return e;throw new Error("树节点业务键应为非空字符串或有限数字")}function p(e){return JSON.stringify([typeof e,e])}function F(e){return[e.idField,...e.input==="flat"?[e.parentField??""]:[e.childrenField??"children"]]}function y(e,r){const i=F(e);if(r?.some(t=>t.scope&&t.scope!=="row"||i.includes(t.field)))throw new Error("树形布局仅支持不覆盖结构键的当前行计算")}function h(e){if(!e?.aborted)return;const r=new Error("树报表处理已取消");throw r.name="AbortError",r}function k(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 t of r){if(!t||!c(t.field)||i.has(t.field))throw new Error("树聚合输出字段应安全、非空且唯一");for(const n of[t.valueField,t.weightField])if(n!==void 0&&!c(n))throw new Error("树聚合来源字段应安全且非空");if([...F(e),e.labelField].includes(t.field))throw new Error("树聚合不能覆盖结构键或标签字段");i.add(t.field),s.createAggregateAccumulator({...t,field:t.valueField??t.field})}}function N(e){if(!c(e.idField)||!c(e.labelField))throw new Error("树需要安全的业务键和标签字段");if(e.input==="flat"&&(!c(e.parentField)||e.parentField===e.idField))throw new Error("扁平树需要独立的父键字段");if(e.childrenField!==void 0&&!c(e.childrenField))throw new Error("子节点字段应安全且非空");if(e.input==="nested"&&[e.idField,e.labelField].includes(e.childrenField??"children"))throw new Error("子节点字段不能覆盖业务键或标签字段")}function v(e){if(!e||typeof e!="object"||!["flat","nested"].includes(e.input))throw new Error("树输入应为 flat 或 nested");if(N(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");w(e),k(e)}function A(e,r,i,t){if(!e||typeof e!="object"||Array.isArray(e))throw new Error("树节点应为对象");if(i.size>=t.rows)throw new g(t.rows);const n=E(e[r.idField]),l=p(n);if(i.has(l))throw new Error(`树节点业务键重复：${String(n)}`);const o={original:e,row:e,key:n,depth:0,children:[]};return i.set(l,o),o}function $(e,r,i,t,n){for(const o of e)h(n),A(o,r,i,t);const l=[];for(const o of i.values()){h(n);const a=o.row[r.parentField];if(a==null){l.push(o);continue}const d=i.get(p(E(a)));if(!d){if(r.orphan!=="root")throw new Error(`树节点 ${String(o.key)} 的父节点不存在`);l.push(o);continue}if(d===o)throw new Error("树节点不能以自身为父节点");o.parent=d,d.children.push(o)}return l}function M(e,r,i,t,n){const l=[],o=[{rows:e,next:0}];for(;o.length;){h(n);const a=o[o.length-1];if(a.next>=a.rows.length){o.pop();continue}const d=A(a.rows[a.next++],r,i,t);if(d.parent=a.parent,d.depth=o.length-1,o.length>t.depth)throw new Error(`树节点超出深度预算 ${t.depth}`);(a.parent?.children??l).push(d);const f=d.row[r.childrenField??"children"];if(f!=null){if(!Array.isArray(f))throw new Error("嵌套树 children 字段应为数组");f.length&&o.push({rows:f,next:0,parent:d})}}return l}function V(e,r,i,t){const n=[],l=[{nodes:e,next:0}];for(;l.length;){h(t);const o=l[l.length-1];if(o.next>=o.nodes.length){l.pop();continue}if(l.length>i.depth)throw new Error(`树节点超出深度预算 ${i.depth}`);const a=o.nodes[o.next++];a.depth=l.length-1,n.push(a),a.children.length&&l.push({nodes:a.children,next:0})}if(n.length!==r)throw new Error("树父子关系存在循环");return n}function S(e,r,i,t){if(r.parentValues!=="leaf-aggregate")return;const n=r.aggregates,l=new Map;for(const a of e)a.children.length&&l.set(a,n.map(d=>s.createAggregateAccumulator({...d,field:d.valueField??d.field})));let o=0;for(const a of e)if(!a.children.length)for(let d=a.parent;d;d=d.parent){if(h(t),o+=n.length,o>i.visits)throw new Error(`树聚合超出访问预算 ${i.visits}`);for(const f of l.get(d))f.add(a.row)}for(const[a,d]of l)a.row={...a.row},n.forEach((f,T)=>{a.row[f.field]=d[T].value()})}function b(e,r,i){if(v(r),h(i),!Array.isArray(e))throw new Error("树数据应为节点数组");const t=w(r),n=new Map,l=r.input==="flat"?$(e,r,n,t,i):M(e,r,n,t,i);return V(l,n.size,t,i)}function x(e,r,i){return b(e,r,i).map(t=>t.original)}function O(e,r,i={}){const t=b(e,r,i.signal);if(y(r,i.computed?.fields),i.computed?.fields.length){const n=s.computeDataset(t.map(l=>l.row),{...i.computed,signal:i.signal}).rows;t.forEach((l,o)=>{l.row=n[o]})}return S(t,r,w(r),i.signal),{rows:t.map(n=>n.row),entries:t.map(n=>({row:n.row,original:n.original,key:n.key,depth:n.depth,hasChildren:!!n.children.length})),leaves:t.filter(n=>!n.children.length).map(n=>n.row)}}exports.TreeRowLimitError=g;exports.createTreeTable=O;exports.flattenTreeInput=x;exports.validateTreeComputed=y;exports.validateTreeOptions=v;

package/dist/tree-CqcQ99NM.js

@@ -0,0 +1,172 @@
+import { d as A, e as w } from "./computed-Bvk0W15F.js";
+class b extends Error {
+  constructor(r) {
+    super(`树节点超出行数预算 ${r}`), this.limit = r, this.code = "tree-row-limit", this.name = "TreeRowLimitError";
+  }
+}
+function s(e, r, i, t) {
+  const n = e ?? r;
+  if (!Number.isInteger(n) || n < 1 || n > i) throw new Error(`${t}应为 1–${i} 的整数`);
+  return n;
+}
+function u(e) {
+  return { rows: s(e.maxRows, 1e5, 1e6, "树行数预算"), depth: s(e.maxDepth, 64, 256, "树深度预算"), visits: s(e.maxAggregationVisits, 1e6, 1e7, "树聚合访问预算") };
+}
+function g(e) {
+  return typeof e == "string" && !!e.trim();
+}
+function c(e) {
+  return g(e) && !["__proto__", "prototype", "constructor"].includes(e);
+}
+function m(e) {
+  if (g(e) || typeof e == "number" && Number.isFinite(e)) return e;
+  throw new Error("树节点业务键应为非空字符串或有限数字");
+}
+function E(e) {
+  return JSON.stringify([typeof e, e]);
+}
+function p(e) {
+  return [e.idField, ...e.input === "flat" ? [e.parentField ?? ""] : [e.childrenField ?? "children"]];
+}
+function k(e, r) {
+  const i = p(e);
+  if (r?.some((t) => t.scope && t.scope !== "row" || i.includes(t.field))) throw new Error("树形布局仅支持不覆盖结构键的当前行计算");
+}
+function h(e) {
+  if (!e?.aborted) return;
+  const r = new Error("树报表处理已取消");
+  throw r.name = "AbortError", r;
+}
+function N(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 t of r) {
+    if (!t || !c(t.field) || i.has(t.field)) throw new Error("树聚合输出字段应安全、非空且唯一");
+    for (const n of [t.valueField, t.weightField]) if (n !== void 0 && !c(n)) throw new Error("树聚合来源字段应安全且非空");
+    if ([...p(e), e.labelField].includes(t.field)) throw new Error("树聚合不能覆盖结构键或标签字段");
+    i.add(t.field), w({ ...t, field: t.valueField ?? t.field });
+  }
+}
+function T(e) {
+  if (!c(e.idField) || !c(e.labelField)) throw new Error("树需要安全的业务键和标签字段");
+  if (e.input === "flat" && (!c(e.parentField) || e.parentField === e.idField)) throw new Error("扁平树需要独立的父键字段");
+  if (e.childrenField !== void 0 && !c(e.childrenField)) throw new Error("子节点字段应安全且非空");
+  if (e.input === "nested" && [e.idField, e.labelField].includes(e.childrenField ?? "children")) throw new Error("子节点字段不能覆盖业务键或标签字段");
+}
+function $(e) {
+  if (!e || typeof e != "object" || !["flat", "nested"].includes(e.input)) throw new Error("树输入应为 flat 或 nested");
+  if (T(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");
+  u(e), N(e);
+}
+function F(e, r, i, t) {
+  if (!e || typeof e != "object" || Array.isArray(e)) throw new Error("树节点应为对象");
+  if (i.size >= t.rows) throw new b(t.rows);
+  const n = m(e[r.idField]), l = E(n);
+  if (i.has(l)) throw new Error(`树节点业务键重复：${String(n)}`);
+  const o = { original: e, row: e, key: n, depth: 0, children: [] };
+  return i.set(l, o), o;
+}
+function M(e, r, i, t, n) {
+  for (const o of e)
+    h(n), F(o, r, i, t);
+  const l = [];
+  for (const o of i.values()) {
+    h(n);
+    const a = o.row[r.parentField];
+    if (a == null) {
+      l.push(o);
+      continue;
+    }
+    const f = i.get(E(m(a)));
+    if (!f) {
+      if (r.orphan !== "root") throw new Error(`树节点 ${String(o.key)} 的父节点不存在`);
+      l.push(o);
+      continue;
+    }
+    if (f === o) throw new Error("树节点不能以自身为父节点");
+    o.parent = f, f.children.push(o);
+  }
+  return l;
+}
+function V(e, r, i, t, n) {
+  const l = [], o = [{ rows: e, next: 0 }];
+  for (; o.length; ) {
+    h(n);
+    const a = o[o.length - 1];
+    if (a.next >= a.rows.length) {
+      o.pop();
+      continue;
+    }
+    const f = F(a.rows[a.next++], r, i, t);
+    if (f.parent = a.parent, f.depth = o.length - 1, o.length > t.depth) throw new Error(`树节点超出深度预算 ${t.depth}`);
+    (a.parent?.children ?? l).push(f);
+    const d = f.row[r.childrenField ?? "children"];
+    if (d != null) {
+      if (!Array.isArray(d)) throw new Error("嵌套树 children 字段应为数组");
+      d.length && o.push({ rows: d, next: 0, parent: f });
+    }
+  }
+  return l;
+}
+function x(e, r, i, t) {
+  const n = [], l = [{ nodes: e, next: 0 }];
+  for (; l.length; ) {
+    h(t);
+    const o = l[l.length - 1];
+    if (o.next >= o.nodes.length) {
+      l.pop();
+      continue;
+    }
+    if (l.length > i.depth) throw new Error(`树节点超出深度预算 ${i.depth}`);
+    const a = o.nodes[o.next++];
+    a.depth = l.length - 1, n.push(a), a.children.length && l.push({ nodes: a.children, next: 0 });
+  }
+  if (n.length !== r) throw new Error("树父子关系存在循环");
+  return n;
+}
+function S(e, r, i, t) {
+  if (r.parentValues !== "leaf-aggregate") return;
+  const n = r.aggregates, l = /* @__PURE__ */ new Map();
+  for (const a of e) a.children.length && l.set(a, n.map((f) => w({ ...f, field: f.valueField ?? f.field })));
+  let o = 0;
+  for (const a of e)
+    if (!a.children.length)
+      for (let f = a.parent; f; f = f.parent) {
+        if (h(t), o += n.length, o > i.visits) throw new Error(`树聚合超出访问预算 ${i.visits}`);
+        for (const d of l.get(f)) d.add(a.row);
+      }
+  for (const [a, f] of l)
+    a.row = { ...a.row }, n.forEach((d, v) => {
+      a.row[d.field] = f[v].value();
+    });
+}
+function y(e, r, i) {
+  if ($(r), h(i), !Array.isArray(e)) throw new Error("树数据应为节点数组");
+  const t = u(r), n = /* @__PURE__ */ new Map(), l = r.input === "flat" ? M(e, r, n, t, i) : V(e, r, n, t, i);
+  return x(l, n.size, t, i);
+}
+function O(e, r, i) {
+  return y(e, r, i).map((t) => t.original);
+}
+function R(e, r, i = {}) {
+  const t = y(e, r, i.signal);
+  if (k(r, i.computed?.fields), i.computed?.fields.length) {
+    const n = A(t.map((l) => l.row), { ...i.computed, signal: i.signal }).rows;
+    t.forEach((l, o) => {
+      l.row = n[o];
+    });
+  }
+  return S(t, r, u(r), i.signal), { rows: t.map((n) => n.row), entries: t.map((n) => ({ row: n.row, original: n.original, key: n.key, depth: n.depth, hasChildren: !!n.children.length })), leaves: t.filter((n) => !n.children.length).map((n) => n.row) };
+}
+export {
+  b as T,
+  k as a,
+  R as c,
+  O as f,
+  $ as v
+};

package/dist/useLocalDraft-C07SYRnC.js

@@ -0,0 +1,11 @@
+import { ref as c, computed as s } from "vue";
+function r(o) {
+  const n = c(""), t = () => JSON.stringify(o()), a = s(() => n.value !== "" && t() !== n.value);
+  function e() {
+    n.value = t();
+  }
+  return e(), { pending: a, snapshot: t, accept: e };
+}
+export {
+  r as u
+};

package/dist/useLocalDraft-Yiw1wFgI.cjs

@@ -0,0 +1 @@
+"use strict";const c=require("vue");function a(s){const e=c.ref(""),t=()=>JSON.stringify(s()),u=c.computed(()=>e.value!==""&&t()!==e.value);function n(){e.value=t()}return n(),{pending:u,snapshot:t,accept:n}}exports.useLocalDraft=a;

package/dist/{validate-DWPF7icl.js → validate-7s0yn6ii.js}

@@ -1,8 +1,8 @@
 function c(e, i, s) {
   e.editable !== void 0 && typeof e.editable != "boolean" && s.push({ path: `${i}.editable`, message: "编辑控制应为布尔值" }), e.valueType !== void 0 && !["text", "number", "boolean"].includes(e.valueType) && s.push({ path: `${i}.valueType`, message: "编辑类型应为 text、number 或 boolean" });
 }
-function l(e, i, s) {
-  c(e, i, s), g(e.source, `${i}.source`, s, !0), e.formula !== void 0 && typeof e.formula != "string" && s.push({ path: `${i}.formula`, message: "单元格公式应为字符串" });
+function y(e, i, s) {
+  c(e, i, s), e.indentMm !== void 0 && (typeof e.indentMm != "number" || !Number.isFinite(e.indentMm) || e.indentMm < 0) && s.push({ path: `${i}.indentMm`, message: "单元格缩进应为有限非负数" }), e.derived !== void 0 && typeof e.derived != "boolean" && s.push({ path: `${i}.derived`, message: "派生结果标记应为布尔值" }), g(e.source, `${i}.source`, s, !0), e.formula !== void 0 && typeof e.formula != "string" && s.push({ path: `${i}.formula`, message: "单元格公式应为字符串" });
 }
 function g(e, i, s, t = !1) {
   if (e === void 0) return;
@@ -19,7 +19,7 @@ function g(e, i, s, t = !1) {
   }
   n.sourceToken !== void 0 && typeof n.sourceToken != "string" && s.push({ path: `${i}.sourceToken`, message: "来源令牌应为字符串" });
 }
-const y = /* @__PURE__ */ new Set([
+const $ = /* @__PURE__ */ new Set([
   "text",
   "image",
   "barcode",
@@ -29,17 +29,17 @@ const y = /* @__PURE__ */ new Set([
   "rect",
   "ellipse"
 ]);
-function f(e) {
+function u(e) {
   return typeof e == "object" && e !== null && !Array.isArray(e);
 }
-function $(e, i, s, t) {
+function l(e, i, s, t) {
   const n = e[i];
   (typeof n != "number" || !Number.isFinite(n)) && t.push({ path: `${s}.${i}`, message: `应为有限数字，实际 ${JSON.stringify(n)}` });
 }
-function A(e, i, s) {
+function v(e, i, s) {
   if (e !== void 0) {
     const t = `${i}.table`;
-    if (!f(e)) s.push({ path: t, message: "逻辑表来源应为对象" });
+    if (!u(e)) s.push({ path: t, message: "逻辑表来源应为对象" });
     else {
       g(e.source, `${t}.source`, s), (typeof e.id != "string" || !e.id.trim()) && s.push({ path: `${t}.id`, message: "逻辑表 ID 应为非空字符串" });
       const n = e.role;
@@ -49,9 +49,9 @@ function A(e, i, s) {
     }
   }
 }
-function v(e, i, s, t) {
+function A(e, i, s, t) {
   if (e !== void 0)
-    if (!f(e) || !Array.isArray(e.cells))
+    if (!u(e) || !Array.isArray(e.cells))
       s.push({ path: `${i}.grid.cells`, message: "grid.cells 应为二维数组" });
     else {
       const n = e.paddingMm;
@@ -60,15 +60,15 @@ function v(e, i, s, t) {
           s.push({ path: `${i}.grid.cells.${o}`, message: "行应为数组" });
           return;
         }
-        a.forEach((u, h) => {
-          if (u == null) return;
-          const d = `${i}.grid.cells.${o}.${h}`;
-          if (!f(u)) {
-            s.push({ path: d, message: "网格单元格应为对象或 null" });
+        a.forEach((f, d) => {
+          if (f == null) return;
+          const h = `${i}.grid.cells.${o}.${d}`;
+          if (!u(f)) {
+            s.push({ path: h, message: "网格单元格应为对象或 null" });
             return;
           }
-          l(u, d, s), Array.isArray(u.children) && u.children.forEach((p, m) => {
-            r(p, `${i}.grid.cells.${o}.${h}.children.${m}`, s, t);
+          y(f, h, s), Array.isArray(f.children) && f.children.forEach((m, p) => {
+            r(m, `${i}.grid.cells.${o}.${d}.children.${p}`, s, t);
           });
         });
       });
@@ -76,28 +76,28 @@ function v(e, i, s, t) {
 }
 function b(e, i, s) {
   e !== void 0 && (Array.isArray(e) ? e.forEach((t, n) => {
-    (!f(t) || !Array.isArray(t.segments)) && s.push({ path: `${i}.richParagraphs.${n}`, message: "段落缺少 segments 数组" });
+    (!u(t) || !Array.isArray(t.segments)) && s.push({ path: `${i}.richParagraphs.${n}`, message: "段落缺少 segments 数组" });
   }) : s.push({ path: `${i}.richParagraphs`, message: "richParagraphs 应为数组" }));
 }
 function r(e, i, s, t = []) {
-  if (!f(e)) {
+  if (!u(e)) {
     s.push({ path: i, message: "组件应为对象" });
     return;
   }
   const n = e.kind;
-  typeof n != "string" ? s.push({ path: `${i}.kind`, message: "组件缺少 kind 字符串" }) : y.has(n) || t.push({
+  typeof n != "string" ? s.push({ path: `${i}.kind`, message: "组件缺少 kind 字符串" }) : $.has(n) || t.push({
     path: `${i}.kind`,
     message: `未知组件类型 ${JSON.stringify(n)}，将以兜底方式渲染`
   });
   for (const a of ["leftMm", "topMm", "widthMm", "heightMm"])
-    $(e, a, i, s);
+    l(e, a, i, s);
   typeof e.leftMm == "number" && e.leftMm < -100 && s.push({ path: `${i}.leftMm`, message: "几何数值异常（leftMm<-100）" });
   for (const a of ["widthMm", "heightMm"])
     typeof e[a] == "number" && e[a] < 0 && s.push({ path: `${i}.${a}`, message: "组件尺寸不能为负数" });
-  A(e.table, i, s), e.pageAnchor !== void 0 && !["header", "footer"].includes(e.pageAnchor) && s.push({ path: `${i}.pageAnchor`, message: "页面锚点应为 header 或 footer" }), e.lineDirection !== void 0 && !["down", "up"].includes(e.lineDirection) && s.push({ path: `${i}.lineDirection`, message: "线段方向应为 down 或 up" }), v(e.grid, i, s, t), b(e.richParagraphs, i, s);
+  v(e.table, i, s), e.pageAnchor !== void 0 && !["header", "footer"].includes(e.pageAnchor) && s.push({ path: `${i}.pageAnchor`, message: "页面锚点应为 header 或 footer" }), e.lineDirection !== void 0 && !["down", "up"].includes(e.lineDirection) && s.push({ path: `${i}.lineDirection`, message: "线段方向应为 down 或 up" }), A(e.grid, i, s, t), b(e.richParagraphs, i, s);
 }
 function M(e, i, s, t = []) {
-  if (!f(e)) {
+  if (!u(e)) {
     s.push({ path: i, message: "页应为对象" });
     return;
   }
@@ -105,12 +105,12 @@ function M(e, i, s, t = []) {
   (typeof n != "number" || !Number.isFinite(n) || n <= 0) && s.push({ path: `${i}.pageWidthMm`, message: `页宽非法: ${JSON.stringify(n)}` }), (typeof a != "number" || !(a > 0 && a < 5e3)) && s.push({ path: `${i}.pageHeightMm`, message: `页高非法: ${JSON.stringify(a)}` }), e.layout !== void 0 && e.layout !== "page" && e.layout !== "wide" && s.push({ path: `${i}.layout`, message: "布局应为 page 或 wide" });
   const o = e.components;
   Array.isArray(o) ? Array.isArray(o) && o.forEach(
-    (u, h) => r(u, `${i}.components.${h}`, s, t)
+    (f, d) => r(f, `${i}.components.${d}`, s, t)
   ) : s.push({ path: `${i}.components`, message: "components 应为数组" });
 }
 function w(e) {
-  const i = [], s = [], t = f(e) ? e.pages : void 0;
-  if (!Array.isArray(t))
+  const i = [], s = [], t = u(e) ? e.pages : void 0;
+  if (u(e) && e.requiresRecalculation !== void 0 && typeof e.requiresRecalculation != "boolean" && i.push({ path: "$.requiresRecalculation", message: "重算能力要求应为布尔值" }), !Array.isArray(t))
     i.push({
       path: "$.pages",
       message: e == null ? "渲染计划为空" : "渲染计划缺少 pages 数组"
@@ -121,7 +121,7 @@ function w(e) {
       message: `页数异常大（${t.length} 页），渲染与打印耗时可能显著增加`
     });
     const n = t.reduce(
-      (a, o) => a + (f(o) && Array.isArray(o.components) ? o.components.length : 0),
+      (a, o) => a + (u(o) && Array.isArray(o.components) ? o.components.length : 0),
       0
     );
     n > 5e4 && s.push({

package/dist/validate-DsRiNw8h.cjs

@@ -0,0 +1 @@
+"use strict";function g(e,s,i){e.editable!==void 0&&typeof e.editable!="boolean"&&i.push({path:`${s}.editable`,message:"编辑控制应为布尔值"}),e.valueType!==void 0&&!["text","number","boolean"].includes(e.valueType)&&i.push({path:`${s}.valueType`,message:"编辑类型应为 text、number 或 boolean"})}function $(e,s,i){g(e,s,i),e.indentMm!==void 0&&(typeof e.indentMm!="number"||!Number.isFinite(e.indentMm)||e.indentMm<0)&&i.push({path:`${s}.indentMm`,message:"单元格缩进应为有限非负数"}),e.derived!==void 0&&typeof e.derived!="boolean"&&i.push({path:`${s}.derived`,message:"派生结果标记应为布尔值"}),m(e.source,`${s}.source`,i,!0),e.formula!==void 0&&typeof e.formula!="string"&&i.push({path:`${s}.formula`,message:"单元格公式应为字符串"})}function m(e,s,i,t=!1){if(e===void 0)return;if(!e||typeof e!="object"||Array.isArray(e)){i.push({path:s,message:"业务来源应为对象"});return}const a=e;for(const n of["datasetId",...t?["field"]:[]])(typeof a[n]!="string"||!a[n].trim())&&i.push({path:`${s}.${n}`,message:"业务标识应为非空字符串"});for(const n of["rowKey","revision"]){const o=a[n];o===void 0&&!(t&&n==="rowKey")||typeof o!="string"&&!(typeof o=="number"&&Number.isFinite(o))&&i.push({path:`${s}.${n}`,message:"业务键及修订号应为字符串或有限数字"})}a.sourceToken!==void 0&&typeof a.sourceToken!="string"&&i.push({path:`${s}.sourceToken`,message:"来源令牌应为字符串"})}const v=new Set(["text","image","barcode","qrcode","chart","line","rect","ellipse"]);function u(e){return typeof e=="object"&&e!==null&&!Array.isArray(e)}function A(e,s,i,t){const a=e[s];(typeof a!="number"||!Number.isFinite(a))&&t.push({path:`${i}.${s}`,message:`应为有限数字，实际 ${JSON.stringify(a)}`})}function b(e,s,i){if(e!==void 0){const t=`${s}.table`;if(!u(e))i.push({path:t,message:"逻辑表来源应为对象"});else{m(e.source,`${t}.source`,i),(typeof e.id!="string"||!e.id.trim())&&i.push({path:`${t}.id`,message:"逻辑表 ID 应为非空字符串"});const a=e.role;["header","body","group-header","subtotal","grand-total"].includes(a)||i.push({path:`${t}.role`,message:"未知逻辑表行角色"});const n=e.rowIndex;(typeof n!="number"||!Number.isInteger(n)||(a==="header"?n!==-1:n<0))&&i.push({path:`${t}.rowIndex`,message:"表头索引应为 -1，内容行索引应为非负整数"}),(!Array.isArray(e.columnKeys)||e.columnKeys.some(o=>typeof o!="string"))&&i.push({path:`${t}.columnKeys`,message:"逻辑列字段应为字符串数组"}),e.layout!==void 0&&e.layout!=="page"&&e.layout!=="wide"&&i.push({path:`${t}.layout`,message:"布局应为 page 或 wide"}),e.title!==void 0&&typeof e.title!="string"&&i.push({path:`${t}.title`,message:"逻辑表名称应为字符串"})}}}function M(e,s,i,t){if(e!==void 0)if(!u(e)||!Array.isArray(e.cells))i.push({path:`${s}.grid.cells`,message:"grid.cells 应为二维数组"});else{const a=e.paddingMm;a!==void 0&&(typeof a!="number"||!Number.isFinite(a)||a<0)&&i.push({path:`${s}.grid.paddingMm`,message:"单元格内距应为有限非负数"}),e.cells.forEach((n,o)=>{if(!Array.isArray(n)){i.push({path:`${s}.grid.cells.${o}`,message:"行应为数组"});return}n.forEach((f,d)=>{if(f==null)return;const r=`${s}.grid.cells.${o}.${d}`;if(!u(f)){i.push({path:r,message:"网格单元格应为对象或 null"});return}$(f,r,i),Array.isArray(f.children)&&f.children.forEach((l,y)=>{h(l,`${s}.grid.cells.${o}.${d}.children.${y}`,i,t)})})})}}function w(e,s,i){e!==void 0&&(Array.isArray(e)?e.forEach((t,a)=>{(!u(t)||!Array.isArray(t.segments))&&i.push({path:`${s}.richParagraphs.${a}`,message:"段落缺少 segments 数组"})}):i.push({path:`${s}.richParagraphs`,message:"richParagraphs 应为数组"}))}function h(e,s,i,t=[]){if(!u(e)){i.push({path:s,message:"组件应为对象"});return}const a=e.kind;typeof a!="string"?i.push({path:`${s}.kind`,message:"组件缺少 kind 字符串"}):v.has(a)||t.push({path:`${s}.kind`,message:`未知组件类型 ${JSON.stringify(a)}，将以兜底方式渲染`});for(const n of["leftMm","topMm","widthMm","heightMm"])A(e,n,s,i);typeof e.leftMm=="number"&&e.leftMm<-100&&i.push({path:`${s}.leftMm`,message:"几何数值异常（leftMm<-100）"});for(const n of["widthMm","heightMm"])typeof e[n]=="number"&&e[n]<0&&i.push({path:`${s}.${n}`,message:"组件尺寸不能为负数"});b(e.table,s,i),e.pageAnchor!==void 0&&!["header","footer"].includes(e.pageAnchor)&&i.push({path:`${s}.pageAnchor`,message:"页面锚点应为 header 或 footer"}),e.lineDirection!==void 0&&!["down","up"].includes(e.lineDirection)&&i.push({path:`${s}.lineDirection`,message:"线段方向应为 down 或 up"}),M(e.grid,s,i,t),w(e.richParagraphs,s,i)}function p(e,s,i,t=[]){if(!u(e)){i.push({path:s,message:"页应为对象"});return}const a=e.pageWidthMm,n=e.pageHeightMm;(typeof a!="number"||!Number.isFinite(a)||a<=0)&&i.push({path:`${s}.pageWidthMm`,message:`页宽非法: ${JSON.stringify(a)}`}),(typeof n!="number"||!(n>0&&n<5e3))&&i.push({path:`${s}.pageHeightMm`,message:`页高非法: ${JSON.stringify(n)}`}),e.layout!==void 0&&e.layout!=="page"&&e.layout!=="wide"&&i.push({path:`${s}.layout`,message:"布局应为 page 或 wide"});const o=e.components;Array.isArray(o)?Array.isArray(o)&&o.forEach((f,d)=>h(f,`${s}.components.${d}`,i,t)):i.push({path:`${s}.components`,message:"components 应为数组"})}function c(e){const s=[],i=[],t=u(e)?e.pages:void 0;if(u(e)&&e.requiresRecalculation!==void 0&&typeof e.requiresRecalculation!="boolean"&&s.push({path:"$.requiresRecalculation",message:"重算能力要求应为布尔值"}),!Array.isArray(t))s.push({path:"$.pages",message:e==null?"渲染计划为空":"渲染计划缺少 pages 数组"});else{t.forEach((n,o)=>p(n,`$.pages.${o}`,s,i)),t.length>2e3&&i.push({path:"$.pages",message:`页数异常大（${t.length} 页），渲染与打印耗时可能显著增加`});const a=t.reduce((n,o)=>n+(u(o)&&Array.isArray(o.components)?o.components.length:0),0);a>5e4&&i.push({path:"$.pages",message:`组件总数异常大（${a} 个），可能触发浏览器性能限制`})}return{ok:s.length===0,errors:s,warnings:i}}function k(e){const s=c(e);if(!s.ok){const i=s.errors.slice(0,3).map(t=>`${t.path}: ${t.message}`).join("; ");throw new Error(`渲染计划校验失败(${s.errors.length} 处): ${i}`)}return e.pages}exports.assertRenderPlan=k;exports.validateComponent=h;exports.validateEditableMetadata=g;exports.validatePage=p;exports.validateRenderPlan=c;