@agile-team/mach-report 2.21.1 → 2.23.0

package/dist/{json-snapshot-Kgn459Oj.js → json-snapshot-OqkPyUk5.js}

@@ -1,18 +1,16 @@
-import { R as be } from "./component-tree-1_QCiQJX.js";
-import { r as re, a as ne, L as ve, c as Vt, j as Jt, g as j, D as Ve } from "./grid-geometry-D3SJgWFv.js";
-import { w as _, h as Je } from "./textwrap-CkGjRFT3.js";
-import { e as Me, k as H, b as Se, n as K, o as zt, q as _t } from "./computed-C8NRZQss.js";
-import { c as ze, R as I, g as _e, b as qt, i as Ut, l as xe, t as qe, h as Ue, f as Xe, j as Xt, k as Yt } from "./record-bindings-VZGS-Qd8.js";
-import { a as Qt, c as Zt } from "./charts-Dlv8j2AG.js";
-import { b as er, c as tr, e as rr } from "./matrix-Dy-tyY7E.js";
-import { f as Ye, b as nr, d as or, c as Qe } from "./template-serialization-Cc3h-miv.js";
-import { i as ar, r as sr, j as ir, b as Ze, v as cr, R as lr } from "./template-registry-DhBqoD7W.js";
-import { g as dr } from "./report-params-D9tBuM9B.js";
-import { a as Ae } from "./param-validation-CnDEd2l-.js";
-import { f as ur, i as fr } from "./number-format-BA_KwrZe.js";
-import { v as et, d as mr } from "./dataset-DL83majE.js";
-const hr = 4096, Ne = 128 * 1024;
-function gr(e) {
+import { r as te, a as re, L as ye, b as Wt, R as be, j as Vt, m as j, D as We } from "./progress-ByiOxUD3.js";
+import { w as _, h as Ve } from "./textwrap-BIjtEWmq.js";
+import { e as ve, n as H, b as Me, q as N, s as zt, t as Jt } from "./computed-f3pOqWLX.js";
+import { d as ze, R as $, f as W, k as Je, b as _t, i as qt, v as Se, c as Ut, P as Y, l as xe, t as _e, m as qe, h as Ue, n as Xt, o as Yt, D as Qt, e as fe } from "./record-bindings-DatJZv_e.js";
+import { c as Zt, e as er } from "./matrix-C6e_r_vp.js";
+import { f as Xe, d as tr, e as rr, c as Ye } from "./template-serialization-CWmHq7lX.js";
+import { j as nr, r as or, k as ar, b as Qe, v as sr, R as ir } from "./template-registry-O0hNIOfB.js";
+import { g as cr } from "./report-params-D9tBuM9B.js";
+import { a as Oe } from "./param-validation-CnDEd2l-.js";
+import { f as lr, i as dr } from "./number-format-BA_KwrZe.js";
+import { v as Ze, d as ur } from "./dataset-DL83majE.js";
+const fr = 4096, Ae = 128 * 1024;
+function mr(e) {
   const t = /* @__PURE__ */ new Map();
   let r = 0;
   return { measureMm(n, o) {
@@ -20,8 +18,8 @@ function gr(e) {
     if (s !== void 0)
       return t.delete(a), t.set(a, s), s;
     const i = e.measureMm(n, o);
-    if (Number.isFinite(i) && a.length <= Ne) {
-      for (; t.size >= hr || r + a.length > Ne; ) {
+    if (Number.isFinite(i) && a.length <= Ae) {
+      for (; t.size >= fr || r + a.length > Ae; ) {
         const c = t.keys().next().value;
         r -= c.length, t.delete(c);
       }
@@ -30,48 +28,10 @@ function gr(e) {
     return i;
   } };
 }
-class W extends Error {
-  constructor(t, r) {
-    super(`报表页数超出上限 ${t}（至少 ${r} 页）`), this.limit = t, this.actual = r, this.code = "page-limit", this.name = "PaginatePageLimitError";
-  }
-}
-class Y extends Error {
-  constructor(t, r) {
-    super(`报表单元格数量超出上限 ${t}（至少 ${r} 格）`), this.limit = t, this.actual = r, this.code = "cell-limit", this.name = "PaginateCellLimitError";
-  }
-}
-class Q extends Error {
-  constructor(t, r) {
-    super(`报表图表图元数量预计超出上限 ${t}（本次估算 ${r}）`), this.limit = t, this.estimated = r, this.code = "chart-component-limit", this.name = "PaginateChartComponentLimitError";
-  }
-}
-const Ce = 5e4;
-function oe(e = Ce) {
-  if (!Number.isSafeInteger(e) || e < 1 || e > 1e6) throw new RangeError("maxChartComponents 应为 1..1000000 的安全整数");
-}
-function pr(e, t, r) {
-  const n = e.chartBinding;
-  if (e.kind !== "chart" || e.grid || e.imageData || e.binding || e.pageAnchor) throw new TypeError("绑定图表不能同时设置图片、网格、记录绑定或页眉页脚");
-  const o = Object.prototype.hasOwnProperty.call(t, n.dataset) ? t[n.dataset] : void 0;
-  if (!Array.isArray(o)) throw new TypeError(`图表数据集 ${n.dataset} 未提供`);
-  return { ...er(o, n, r), type: n.type, leftMm: e.leftMm, topMm: e.topMm, widthMm: e.widthMm, heightMm: e.heightMm, title: n.title, showValues: n.showValues };
-}
-function wr(e, t, r = Ce) {
-  oe(r);
-  let n = 0;
-  return Object.assign((a) => {
-    if (!a.chartBinding) return [a];
-    const s = pr(a, e, t), i = n + (s.categories.length ? Qt(s) : 1);
-    if (!Number.isSafeInteger(i)) throw new RangeError("图表图元估算应为有限安全整数");
-    if (i > r) throw new Q(r, i);
-    const c = s.categories.length ? Zt(s) : [{ kind: "text", leftMm: a.leftMm, topMm: a.topMm, widthMm: a.widthMm, heightMm: a.heightMm, text: "—", style: { align: "center", verticalAlign: "middle", color: "#94a3b8", fontSize: 10 } }];
-    return n += c.length, c;
-  }, { used: () => n });
-}
-function yr(e, t) {
+function hr(e, t) {
   return { member: "body", subtotal: "subtotal", total: "grand-total" }[e?.rows.get(t)?.kind ?? "member"];
 }
-function br(e) {
+function gr(e) {
   const t = e.matrix;
   if (!t.hierarchy) return t;
   const r = new Map(e.columns.map((o) => [o.field, o.header])), n = { sum: "求和", count: "计数", avg: "平均", min: "最小", max: "最大", weightedAvg: "加权平均" };
@@ -84,10 +44,10 @@ function br(e) {
     return o.label === void 0 && a ? { ...o, label: `${a}（${n[o.op]}）` } : o;
   }) };
 }
-function vr(e, t) {
+function pr(e, t) {
   if (!e.matrix) return { list: e, rows: t };
   if (e.detail || e.groupBy || e.groups?.length || e.grandTotal) throw new Error("矩阵不能同时配置普通分组、总计或主从明细");
-  const r = tr(t, br(e)), n = r.columns.map((i) => ({ ...i, widthMm: i.semanticRole === "dimension" ? e.matrix.rowWidthMm ?? 40 : e.matrix.columnWidthMm ?? 28, editable: !1, align: i.semanticRole === "dimension" ? "center" : "right" })), o = { ...e, columns: n, headerGrid: r.headerGrid, rowKey: void 0, revisionField: void 0, sourceTokenField: void 0 };
+  const r = Zt(t, gr(e)), n = r.columns.map((i) => ({ ...i, widthMm: i.semanticRole === "dimension" ? e.matrix.rowWidthMm ?? 40 : e.matrix.columnWidthMm ?? 28, editable: !1, align: i.semanticRole === "dimension" ? "center" : "right" })), o = { ...e, columns: n, headerGrid: r.headerGrid, rowKey: void 0, revisionField: void 0, sourceTokenField: void 0 };
   e.layout === "wide" && (o.widthMm = n.reduce((i, c) => i + c.widthMm, 0));
   const a = r.metadata, s = a ? { rows: new WeakMap(r.rows.map((i, c) => [i, a.rows[c]])), header: {
     columns: a.columns,
@@ -98,37 +58,37 @@ function vr(e, t) {
   } } : void 0;
   return { list: o, rows: r.rows, ...s ? { matrix: s } : {} };
 }
-function Mr(e, t) {
+function wr(e, t) {
   if (!e.matrix?.hierarchy || !e.headerGrid) return e.headerGrid;
-  const r = e.paddingMm ?? 1, n = e.headerGrid.cells.map(() => e.rowHeightMm ?? 0), o = e.columns.map((c) => c.widthMm), a = re({ ...e.headerGrid, colWidthsMm: o }, o.reduce((c, l) => c + l, 0), n.length), s = /* @__PURE__ */ new WeakMap();
-  for (const { cell: c, ci: l, ri: d, widthMm: f } of a.cells) {
-    const u = { ...ze(e, e.columns[l]), ...c.style }, h = ne(u).fontSizePt, v = (_(c.text ?? "", Math.max(1, f - r * 2), { fontSizePt: h, fontFamily: u.fontFamily, bold: u.bold, italic: u.italic, letterSpacingPt: u.letterSpacing }, t).length * h * (u.lineHeight ?? ve) * 25.4 / 72 + r * 2) / (c.rowSpan ?? 1);
-    for (let y = d; y < d + (c.rowSpan ?? 1); y++) n[y] = Math.max(n[y] ?? 0, v);
-    s.set(c, u);
+  const r = e.paddingMm ?? 1, n = e.headerGrid.cells.map(() => e.rowHeightMm ?? 0), o = e.columns.map((c) => c.widthMm), a = te({ ...e.headerGrid, colWidthsMm: o }, o.reduce((c, l) => c + l, 0), n.length), s = /* @__PURE__ */ new WeakMap();
+  for (const { cell: c, ci: l, ri: u, widthMm: f } of a.cells) {
+    const d = { ...ze(e, e.columns[l]), ...c.style }, h = re(d).fontSizePt, v = (_(c.text ?? "", Math.max(1, f - r * 2), { fontSizePt: h, fontFamily: d.fontFamily, bold: d.bold, italic: d.italic, letterSpacingPt: d.letterSpacing }, t).length * h * (d.lineHeight ?? ye) * 25.4 / 72 + r * 2) / (c.rowSpan ?? 1);
+    for (let p = u; p < u + (c.rowSpan ?? 1); p++) n[p] = Math.max(n[p] ?? 0, v);
+    s.set(c, d);
   }
   const i = e.headerGrid.cells.map((c) => c.map((l) => l ? { ...l, style: s.get(l) } : null));
   return { ...e.headerGrid, cells: i, rowHeightsMm: n };
 }
-function Sr(e, t, r) {
+function yr(e, t, r) {
   const n = /* @__PURE__ */ new Set(), o = e.cells.map((a, s) => {
     const i = [];
     let c = 0;
     for (const l of a) {
       for (; n.has(`${s}:${c}`); ) c++;
-      const d = l?.colSpan ?? 1, f = l?.rowSpan ?? 1;
-      let u = 0;
-      for (let h = c; h < c + d; h++) {
-        t.has(h) && u++;
+      const u = l?.colSpan ?? 1, f = l?.rowSpan ?? 1;
+      let d = 0;
+      for (let h = c; h < c + u; h++) {
+        t.has(h) && d++;
         for (let m = s + 1; m < s + f; m++)
           n.add(`${m}:${h}`);
       }
-      u && i.push(l ? { ...l, colSpan: u } : null), c += d;
+      d && i.push(l ? { ...l, colSpan: d } : null), c += u;
     }
     return i;
   });
   return { ...e, cells: o, colWidthsMm: r };
 }
-function xr(e) {
+function br(e) {
   if (!e.columns.some((n) => n.hidden)) return e;
   const t = /* @__PURE__ */ new Set(), r = e.columns.filter((n, o) => n.hidden ? !1 : (t.add(o), !0));
   if (!r.length) throw new Error("列表至少需要一列可见列");
@@ -136,7 +96,7 @@ function xr(e) {
     ...e,
     columns: r,
     ...e.headerGrid ? {
-      headerGrid: Sr(
+      headerGrid: yr(
         e.headerGrid,
         t,
         r.map((n) => n.widthMm)
@@ -144,34 +104,34 @@ function xr(e) {
     } : {}
   };
 }
-function* Cr(e) {
+function* vr(e) {
   const { page: t } = e;
-  ar(t.components, t.flow);
+  nr(t.components, t.flow);
   let r = 0, n = 0;
-  for (const o of sr(t.components, t.flow)) {
+  for (const o of or(t.components, t.flow)) {
     e.active();
-    const a = o.band, s = o.components.some((d) => d.kind === "list" && d.cardinality !== "record"), i = s ? 0 : o.components.reduce((d, f) => Math.max(d, f.topMm - a.topMm + (f.kind === "list" ? e.height(f) : f.heightMm)), a.heightMm);
+    const a = o.band, s = o.components.some((u) => u.kind === "list" && u.cardinality !== "record"), i = s ? 0 : o.components.reduce((u, f) => Math.max(u, f.topMm - a.topMm + (f.kind === "list" ? e.height(f) : f.heightMm)), a.heightMm);
     let c = Math.max(e.top(), n + a.topMm - r);
     if (!s && i > e.bottom() - e.top() + 1e-3) throw new Error(`静态区域 ${a.componentIds.join(",")} 高度超出单页可用范围`);
     !s && c + i > e.bottom() + 1e-3 && (e.nextPage(), yield* e.takePages(), e.active(), c = e.top());
     let l = c + i;
-    for (const d of o.components) {
-      const f = c + d.topMm - a.topMm;
-      d.kind === "list" ? (yield* e.list(d, f, (u) => {
-        l = s ? u : Math.max(l, u);
-      }), e.active()) : e.append({ ...d, topMm: f });
+    for (const u of o.components) {
+      const f = c + u.topMm - a.topMm;
+      u.kind === "list" ? (yield* e.list(u, f, (d) => {
+        l = s ? d : Math.max(l, d);
+      }), e.active()) : e.append({ ...u, topMm: f });
     }
     n = l, r = a.topMm + a.heightMm;
   }
 }
-function kr(e) {
+function Mr(e) {
   return !!(e.computed?.length || e.groups?.length || e.groupBy || e.grandTotal || e.rowVisibleWhen || e.matrix || e.tree || e.detail || e.columns.some((t) => t.rules?.length || t.visibleWhen || t.visual));
 }
-function ke(e) {
-  return e.pages.some((t) => t.components.some((r) => r.kind === "list" ? kr(r) : !!r.chartBinding));
+function Ce(e) {
+  return e.pages.some((t) => t.components.some((r) => r.kind === "list" ? Mr(r) : !!r.chartBinding));
 }
-const Tr = 512, je = 256 * 1024;
-function Pr() {
+const Sr = 512, Ke = 256 * 1024;
+function xr() {
   const e = /* @__PURE__ */ new Map();
   let t = 0, r;
   return (n, o, a, s) => {
@@ -179,109 +139,109 @@ function Pr() {
     const i = JSON.stringify([n, o, a.fontSizePt, a.fontFamily, a.bold, a.italic, a.letterSpacingPt]), c = e.get(i);
     if (c)
       return e.delete(i), e.set(i, c), c.lines.slice();
-    const l = _(n, o, a, s), d = i.length + l.reduce((f, u) => f + u.length, 0);
-    if (d <= je) {
-      for (; e.size >= Tr || t + d > je; ) {
+    const l = _(n, o, a, s), u = i.length + l.reduce((f, d) => f + d.length, 0);
+    if (u <= Ke) {
+      for (; e.size >= Sr || t + u > Ke; ) {
         const f = e.keys().next().value;
         t -= e.get(f).units, e.delete(f);
       }
-      e.set(i, { lines: l.slice(), units: d }), t += d;
+      e.set(i, { lines: l.slice(), units: u }), t += u;
     }
     return l;
   };
 }
-const Er = 1e4, Ke = 25e4;
-function Te(e) {
+const Cr = 1e4, je = 25e4;
+function ke(e) {
   if (e?.aborted) throw e.reason ?? new DOMException("标签生成已取消", "AbortError");
 }
-function tt(e, t, r) {
-  const n = typeof e.copies == "object" ? _e(t, e.copies.field, r) : e.copies ?? 1;
-  if (typeof n != "number" || !Number.isSafeInteger(n) || n < 1 || n > 1e3) throw new I(`$.datasets.${r.dataset}[${r.rowIndex}]`, "每条记录复制数必须是 1..1000 的数值型整数", r.rowIndex, typeof e.copies == "object" ? e.copies.field : void 0);
+function et(e, t, r) {
+  const n = typeof e.copies == "object" ? Je(t, e.copies.field, r) : e.copies ?? 1;
+  if (typeof n != "number" || !Number.isSafeInteger(n) || n < 1 || n > 1e3) throw new $(`$.datasets.${r.dataset}[${r.rowIndex}]`, "每条记录复制数必须是 1..1000 的数值型整数", r.rowIndex, typeof e.copies == "object" ? e.copies.field : void 0);
   return n;
 }
-function rt(e, t, r) {
+function tt(e, t, r) {
   if (e.rowKey === void 0) return;
-  const n = _e(t, e.rowKey, r);
+  const n = Je(t, e.rowKey, r);
   if (typeof n == "string" && n.trim() || typeof n == "number" && Number.isFinite(n)) return n;
-  throw new I(`$.datasets.${r.dataset}[${r.rowIndex}].${e.rowKey}`, "业务主键必须是非空字符串或有限数字", r.rowIndex, e.rowKey);
+  throw new $(`$.datasets.${r.dataset}[${r.rowIndex}].${e.rowKey}`, "业务主键必须是非空字符串或有限数字", r.rowIndex, e.rowKey);
 }
-function Rr(e) {
+function kr(e) {
   const t = (r) => 1 + (r.grid?.cells.reduce((n, o) => n + 1 + o.length + o.reduce((a, s) => a + (s?.children?.reduce((i, c) => i + t(c), 0) ?? 0), 0), 0) ?? 0);
   return e.pages.reduce((r, n) => r + n.components.reduce((o, a) => o + t(a), 0), 0);
 }
-function $r(e, t, r) {
+function Tr(e, t, r) {
   const n = e.repeat, o = Object.prototype.hasOwnProperty.call(t, n.dataset) ? t[n.dataset] : void 0;
-  if (!Array.isArray(o)) throw new I(`$.datasets.${n.dataset}`, "逐记录标签数据集缺失，应提供对象数组（允许空数组）");
-  const a = /* @__PURE__ */ new Set(), s = r.maxPages ?? Er, i = Rr(e);
+  if (!Array.isArray(o)) throw new $(`$.datasets.${n.dataset}`, "逐记录标签数据集缺失，应提供对象数组（允许空数组）");
+  const a = /* @__PURE__ */ new Set(), s = r.maxPages ?? Cr, i = kr(e);
   let c = 0, l = 0;
-  for (const [d, f] of o.entries()) {
-    if (Te(r.signal), !f || typeof f != "object" || Array.isArray(f)) throw new I(`$.datasets.${n.dataset}[${d}]`, "标签记录应为对象", d);
-    const u = { rowIndex: d, dataset: n.dataset }, h = rt(n, f, u);
+  for (const [u, f] of o.entries()) {
+    if (ke(r.signal), !f || typeof f != "object" || Array.isArray(f)) throw new $(`$.datasets.${n.dataset}[${u}]`, "标签记录应为对象", u);
+    const d = { rowIndex: u, dataset: n.dataset }, h = tt(n, f, d);
     if (h !== void 0) {
       const v = JSON.stringify([typeof h, h]);
-      if (a.has(v)) throw new I(`$.datasets.${n.dataset}[${d}].${n.rowKey}`, "业务主键重复；请先确认记录来源，避免重复打印标签", d, n.rowKey);
+      if (a.has(v)) throw new $(`$.datasets.${n.dataset}[${u}].${n.rowKey}`, "业务主键重复；请先确认记录来源，避免重复打印标签", u, n.rowKey);
       a.add(v);
     }
-    const m = tt(n, f, u);
+    const m = et(n, f, d);
     if (c += m * e.pages.length, l += m * i, c > s) throw new W(s, c);
-    if (l > Ke) throw new I("$.repeat", `标签组件总量（含网格行、槽位及嵌套组件）超过安全预算 ${Ke}，请分批生成`, d);
+    if (l > je) throw new $("$.repeat", `标签组件总量（含网格行、槽位及嵌套组件）超过安全预算 ${je}，请分批生成`, u);
   }
   return o;
 }
-function Ir(e, t, r) {
+function Pr(e, t, r) {
   if (!e.binding) return e;
-  const { binding: n, ...o } = e, a = qt(n, t.row, t);
+  const { binding: n, ...o } = e, a = _t(n, t.row, t);
   if (e.kind === "image") {
     if (!a) return;
-    if (!Ut(a)) throw new I(`${r}.binding`, "图片字段只接受 PNG/JPEG base64 data URL；业务 URL 应由宿主安全加载后转换", t.rowIndex, n.field);
+    if (!qt(a)) throw new $(`${r}.binding`, "图片字段只接受 PNG/JPEG base64 data URL；业务 URL 应由宿主安全加载后转换", t.rowIndex, n.field);
     return { ...o, imageData: a };
   }
   return e.kind === "barcode" || e.kind === "qrcode" ? (delete o.imageData, { ...o, code: { ...o.code, value: a }, fallbackText: a }) : (delete o.lines, delete o.richParagraphs, { ...o, text: a });
 }
-function Fr(e, t, r) {
+function Er(e, t, r) {
   if (e.kind !== "text" || e.grid || e.richParagraphs?.length) return e;
-  const n = e.style ?? {}, o = ne(n).fontSizePt, a = e.text ?? e.lines?.join(`
+  const n = e.style ?? {}, o = re(n).fontSizePt, a = e.text ?? e.lines?.join(`
 `) ?? "";
-  if (a.length > 16384) throw new I(r, "标签文本超过 16384 字符预算，请缩小字段内容", t.rowIndex);
-  const s = t.wrapText(a, e.widthMm, { fontSizePt: o, bold: n.bold, italic: n.italic, fontFamily: n.fontFamily, letterSpacingPt: n.letterSpacing }, t.options.measurer ?? Je), i = s.length * o * Vt(n) * 25.4 / 72;
-  if (i > e.heightMm + 0.05) throw new I(r, `标签文字需要约 ${i.toFixed(2)}mm 高，超出 ${e.heightMm}mm；请增大文本区域、减少内容或调整字号`, t.rowIndex, e.binding?.field);
+  if (a.length > 16384) throw new $(r, "标签文本超过 16384 字符预算，请缩小字段内容", t.rowIndex);
+  const s = t.wrapText(a, e.widthMm, { fontSizePt: o, bold: n.bold, italic: n.italic, fontFamily: n.fontFamily, letterSpacingPt: n.letterSpacing }, t.options.measurer ?? Ve), i = s.length * o * Wt(n) * 25.4 / 72;
+  if (i > e.heightMm + 0.05) throw new $(r, `标签文字需要约 ${i.toFixed(2)}mm 高，超出 ${e.heightMm}mm；请增大文本区域、减少内容或调整字号`, t.rowIndex, e.binding?.field);
   return { ...e, lines: s };
 }
-function nt(e, t, r) {
-  Te(t.options.signal);
-  const n = Ir(e, t, r);
+function rt(e, t, r) {
+  ke(t.options.signal);
+  const n = Pr(e, t, r);
   if (!n) return;
   let o = n.grid;
-  return o && (o = { ...o, cells: o.cells.map((a, s) => a.map((i, c) => i?.children?.length ? { ...i, children: i.children.flatMap((l, d) => {
-    const f = nt(l, t, `${r}.grid.cells.${s}.${c}.children.${d}`);
+  return o && (o = { ...o, cells: o.cells.map((a, s) => a.map((i, c) => i?.children?.length ? { ...i, children: i.children.flatMap((l, u) => {
+    const f = rt(l, t, `${r}.grid.cells.${s}.${c}.children.${u}`);
     return f ? [f] : [];
-  }) } : i)) }), Fr(o === n.grid ? n : { ...n, grid: o }, t, r);
+  }) } : i)) }), Er(o === n.grid ? n : { ...n, grid: o }, t, r);
 }
-function Or(e, t, r, n, o, a) {
+function Rr(e, t, r, n, o, a) {
   return {
     ...e,
     components: e.components.flatMap((s, i) => {
-      const c = nt(s, r, `$.pages.${t}.components.${i}`);
+      const c = rt(s, r, `$.pages.${t}.components.${i}`);
       return c ? [{ ...c, meta: { ...c.meta, labelSource: { pageIndex: t, componentIndex: i } } }] : [];
     }),
     meta: { ...e.meta, record: { dataset: r.dataset, rowIndex: r.rowIndex, ...a === void 0 ? {} : { rowKey: a }, copyIndex: n, copyCount: o, templatePageIndex: t } }
   };
 }
-function* Ar(e, t, r) {
+function* Ir(e, t, r) {
   const n = [];
-  if (ir(e, n), n.length) throw new I(n[0].path, n[0].message);
+  if (ar(e, n), n.length) throw new $(n[0].path, n[0].message);
   if (!e.repeat) {
     for (const [i, c] of e.pages.entries()) yield { page: c, pageIndex: i };
     return;
   }
-  const o = e.repeat, a = $r(e, t, r), s = Pr();
+  const o = e.repeat, a = Tr(e, t, r), s = xr();
   for (const [i, c] of a.entries()) {
-    const l = { row: c, rowIndex: i, dataset: o.dataset, options: r, wrapText: s }, d = tt(o, c, l), f = rt(o, c, l);
-    for (let u = 0; u < d; u++) for (const [h, m] of e.pages.entries())
-      Te(r.signal), yield { page: Or(m, h, l, u, d, f), pageIndex: h };
+    const l = { row: c, rowIndex: i, dataset: o.dataset, options: r, wrapText: s }, u = et(o, c, l), f = tt(o, c, l);
+    for (let d = 0; d < u; d++) for (const [h, m] of e.pages.entries())
+      ke(r.signal), yield { page: Rr(m, h, l, d, u, f), pageIndex: h };
   }
 }
-function Nr(e) {
+function $r(e) {
   return {
     widthMm: e.widthMm,
     heightMm: e.heightMm,
@@ -292,119 +252,119 @@ function Nr(e) {
     components: []
   };
 }
-function Z(e, t) {
+function Q(e, t) {
   const r = t.heightMm - (e.layout === "wide" ? t.marginBottomMm : e.marginBottomMm ?? t.marginBottomMm);
   return e.components.reduce((n, o) => o.kind !== "list" && o.pageAnchor === "footer" ? Math.min(n, o.topMm) : n, r);
 }
 function V(e) {
   return e.components.reduce((t, r) => r.kind !== "list" && r.pageAnchor === "header" ? Math.max(t, r.topMm + r.heightMm) : t, 0);
 }
-function ot(e, t) {
+function nt(e, t) {
   let r = e.textMetrics.get(t);
   if (!r) {
-    const n = ne(t).fontSizePt;
+    const n = re(t).fontSizePt;
     r = {
       measureOptions: {
         fontSizePt: n,
-        fontFamily: t.fontFamily ?? Ve,
+        fontFamily: t.fontFamily ?? We,
         italic: t.italic,
         bold: t.bold,
         letterSpacingPt: t.letterSpacing
       },
-      lineMm: n * (t.lineHeight ?? ve) * 25.4 / 72
+      lineMm: n * (t.lineHeight ?? ye) * 25.4 / 72
     }, e.textMetrics.set(t, r);
   }
   return r;
 }
-function jr(e) {
+function Fr(e) {
   if (e === null || typeof e == "string" || typeof e == "boolean" || typeof e == "number" && Number.isFinite(e)) return e;
 }
-function Pe(e, t, r = [], n) {
-  const o = e.fontSizePt ?? Jt, a = e.paddingMm ?? 1, s = e.columns.map((g) => g.align ?? g.style?.align ?? e.align ?? "left"), i = e.columns.map((g, w) => ({
+function Te(e, t, r = [], n) {
+  const o = e.fontSizePt ?? Vt, a = e.paddingMm ?? 1, s = e.columns.map((w) => w.align ?? w.style?.align ?? e.align ?? "left"), i = e.columns.map((w, y) => ({
     ...j({
       fontSize: o,
       verticalAlign: "middle"
-    }, g.style),
-    align: s[w] === "auto" ? "left" : s[w]
-  })), c = i.map((g, w) => s[w] === "auto" ? { left: g, center: { ...g, align: "center" }, right: { ...g, align: "right" } } : void 0), l = e.columns.map((g, w) => g.rules?.map((x) => {
-    const E = c[w];
-    if (E) return {
-      left: j(E.left, x.style),
-      center: j(E.center, x.style),
-      right: j(E.right, x.style)
+    }, w.style),
+    align: s[y] === "auto" ? "left" : s[y]
+  })), c = i.map((w, y) => s[y] === "auto" ? { left: w, center: { ...w, align: "center" }, right: { ...w, align: "right" } } : void 0), l = e.columns.map((w, y) => w.rules?.map((x) => {
+    const k = c[y];
+    if (k) return {
+      left: j(k.left, x.style),
+      center: j(k.center, x.style),
+      right: j(k.right, x.style)
     };
-    const k = j(i[w], x.style);
-    return { left: k, center: k, right: k };
-  })), d = e.columns.map((g) => ze(e, g)), f = e.columns.map((g) => g.header);
-  let u = e.rowHeightMm ?? 0;
-  for (let g = 0; g < f.length; g++) {
-    const w = d[g], x = ne(w).fontSizePt, E = _(
-      f[g],
-      e.columns[g].widthMm - a * 2,
-      { fontSizePt: x, fontFamily: w.fontFamily ?? Ve, italic: w.italic, bold: w.bold, letterSpacingPt: w.letterSpacing },
+    const T = j(i[y], x.style);
+    return { left: T, center: T, right: T };
+  })), u = e.columns.map((w) => ze(e, w)), f = e.columns.map((w) => w.header);
+  let d = e.rowHeightMm ?? 0;
+  for (let w = 0; w < f.length; w++) {
+    const y = u[w], x = re(y).fontSizePt, k = _(
+      f[w],
+      e.columns[w].widthMm - a * 2,
+      { fontSizePt: x, fontFamily: y.fontFamily ?? We, italic: y.italic, bold: y.bold, letterSpacingPt: y.letterSpacing },
       t
-    ), k = x * (w.lineHeight ?? ve) * 25.4 / 72;
-    u = Math.max(u, Math.max(E.length, 1) * k + a * 2);
+    ), T = x * (y.lineHeight ?? ye) * 25.4 / 72;
+    d = Math.max(d, Math.max(k.length, 1) * T + a * 2);
   }
-  const h = f.map((g, w) => ({
-    text: g,
-    style: d[w]
-  })), m = e.border === !1 ? { borderTop: !1, borderRight: !1, borderBottom: !1, borderLeft: !1 } : { borderBottom: !0, borderLeft: !0, borderRight: !0, borderTop: !0 }, v = e.columns.map((g) => g.widthMm), y = Kr(Mr(e, t), v, {
+  const h = f.map((w, y) => ({
+    text: w,
+    style: u[y]
+  })), m = e.border === !1 ? { borderTop: !1, borderRight: !1, borderBottom: !1, borderLeft: !1 } : { borderBottom: !0, borderLeft: !0, borderRight: !0, borderTop: !0 }, v = e.columns.map((w) => w.widthMm), p = Or(wr(e, t), v, {
     cells: [h],
     colWidthsMm: v,
-    rowHeightsMm: [u],
+    rowHeightsMm: [d],
     paddingMm: a
   });
   return {
     fontSizePt: o,
     paddingMm: a,
-    visuals: or(e.columns, r, n),
-    visibility: e.columns.map((g) => g.visibleWhen ? H(g.visibleWhen) : void 0),
-    ruleReaders: e.columns.map((g) => g.rules?.map((w) => H(w.when))),
+    visuals: rr(e.columns, r, n),
+    visibility: e.columns.map((w) => w.visibleWhen ? H(w.visibleWhen) : void 0),
+    ruleReaders: e.columns.map((w) => w.rules?.map((y) => H(y.when))),
     cellStyles: i,
     autoStyles: c,
     ruleStyles: l,
     textMetrics: /* @__PURE__ */ new WeakMap(),
-    numberFormats: e.columns.map((g) => qe(g.format)),
-    derivedFields: new Set(e.computed?.map((g) => g.field)),
+    numberFormats: e.columns.map((w) => _e(w.format)),
+    derivedFields: new Set(e.computed?.map((w) => w.field)),
     borderStyle: m,
-    headerHeightMm: y.rowHeightsMm.reduce((g, w) => g + w, 0),
-    headerGrid: y,
+    headerHeightMm: p.rowHeightsMm.reduce((w, y) => w + y, 0),
+    headerGrid: p,
     colWidthsMm: v,
     columns: e.columns
   };
 }
-function Kr(e, t, r) {
+function Or(e, t, r) {
   if (!e) return r;
   if (!e.cells.length) throw new Error("自定义列表表头至少需要一行");
   const n = e.rowHeightsMm ?? e.cells.map(() => r.rowHeightsMm[0]);
   if (n.length !== e.cells.length || n.some((o) => !Number.isFinite(o) || o <= 0)) throw new Error("自定义列表表头行高无效");
   return { ...e, colWidthsMm: t, rowHeightsMm: n };
 }
-function Lr(e, t, r) {
+function Ar(e, t, r) {
   const n = t.format?.kind === "number" || t.format?.kind === "percent";
   t.valueType !== void 0 ? e.valueType = t.valueType : n && (e.valueType = "number"), t.editable !== void 0 && (e.editable = t.editable), (typeof e.value == "number" || e.value == null) && r !== void 0 && (e.numberFormat = r);
 }
-function J(e, t, r) {
+function z(e, t, r) {
   const n = e.columns, o = e.tree?.rows.get(t);
   let a = e.rowHeightFloorMm;
   const s = new Array(n.length);
   for (let i = 0; i < n.length; i++) {
-    const c = n[i], l = e.visibility[i]?.(t) !== !1, d = l ? t[c.field] : null, f = e.autoStyles[i] ? Ue(d, c.format, c.semanticRole) : "left";
-    let u = e.autoStyles[i]?.[f] ?? e.cellStyles[i];
+    const c = n[i], l = e.visibility[i]?.(t) !== !1, u = l ? t[c.field] : null, f = e.autoStyles[i] ? qe(u, c.format, c.semanticRole) : "left";
+    let d = e.autoStyles[i]?.[f] ?? e.cellStyles[i];
     if (c.rules) {
       for (let x = 0; x < c.rules.length; x++)
         if (e.ruleReaders[i][x](t)) {
-          u = e.ruleStyles[i][x][f];
+          d = e.ruleStyles[i][x][f];
           break;
         }
     }
-    const h = c.format ? Xe(d, c.format) : xe(d), m = Hr(e, c, o);
-    u = Dr(e, c, u, o);
-    const v = ot(e, u), y = _(h, Math.max(1, c.widthMm - e.paddingMm * 2 - m), v.measureOptions, r);
-    a = Math.max(a, y.length * v.lineMm + e.paddingMm * 2);
-    const g = jr(d), w = { text: h, style: u };
-    d != null && e.visuals[i]?.apply(w, t), g !== void 0 && (w.value = g), Lr(w, c, e.numberFormats[i]), Br(w, c, e, o, m), e.derivedFields.has(c.field) && (w.derived = !0, w.editable = !1), l || (w.editable = !1), s[i] = w;
+    const h = c.format ? Ue(u, c.format) : xe(u), m = Kr(e, c, o);
+    d = jr(e, c, d, o);
+    const v = nt(e, d), p = _(h, Math.max(1, c.widthMm - e.paddingMm * 2 - m), v.measureOptions, r);
+    a = Math.max(a, p.length * v.lineMm + e.paddingMm * 2);
+    const w = Fr(u), y = { text: h, style: d };
+    u != null && e.visuals[i]?.apply(y, t), w !== void 0 && (y.value = w), Ar(y, c, e.numberFormats[i]), Nr(y, c, e, o, m), e.derivedFields.has(c.field) && (y.derived = !0, y.editable = !1), l || (y.editable = !1), s[i] = y;
   }
   return {
     grid: { cells: [s], colWidthsMm: e.colWidthsMm, rowHeightsMm: [a], paddingMm: e.paddingMm },
@@ -412,20 +372,20 @@ function J(e, t, r) {
     ...e.matrix ? { meta: { matrix: { row: e.matrix.rows.get(t) } } } : {}
   };
 }
-function Hr(e, t, r) {
+function Kr(e, t, r) {
   return !r || t.field !== e.tree.list.tree.labelField ? 0 : Xt(e.tree.list, t, r, e.paddingMm);
 }
-function Dr(e, t, r, n) {
+function jr(e, t, r, n) {
   return !n || t.field !== e.tree.list.tree.labelField || r.align === "left" ? r : { ...r, align: "left" };
 }
-function Br(e, t, r, n, o = 0) {
+function Nr(e, t, r, n, o = 0) {
   n && (o && (e.indentMm = o), Yt(e, t, n, r.tree.list));
 }
-function at(e) {
+function ot(e) {
   if (e != null && typeof e != "string" && typeof e != "boolean" && !(typeof e == "number" && Number.isFinite(e))) throw new Error("分组字段应为有限 JSON 标量");
   return JSON.stringify([typeof e, e ?? null]);
 }
-function* st(e, t, r = 0) {
+function* at(e, t, r = 0) {
   const n = t[r];
   if (!n) {
     for (const a of e) yield { kind: "row", row: a };
@@ -433,54 +393,54 @@ function* st(e, t, r = 0) {
   }
   const o = /* @__PURE__ */ new Map();
   for (const a of e) {
-    const s = at(a[n.field]), i = o.get(s);
+    const s = ot(a[n.field]), i = o.get(s);
     i ? i.push(a) : o.set(s, [a]);
   }
   for (const a of o.values())
-    yield { kind: "groupHeader", label: (n.headerTemplate ?? "{value}").replace(/\{value\}/g, xe(a[0][n.field])), firstRow: a[0], group: n, depth: r, rows: a }, yield* st(a, t, r + 1), (n.subtotal?.length || n.aggregates?.length) && (yield { kind: "subtotal", label: n.subtotalLabel ?? "小计", rows: a, group: n, depth: r }), yield { kind: "groupEnd", depth: r };
+    yield { kind: "groupHeader", label: (n.headerTemplate ?? "{value}").replace(/\{value\}/g, xe(a[0][n.field])), firstRow: a[0], group: n, depth: r, rows: a }, yield* at(a, t, r + 1), (n.subtotal?.length || n.aggregates?.length) && (yield { kind: "subtotal", label: n.subtotalLabel ?? "小计", rows: a, group: n, depth: r }), yield { kind: "groupEnd", depth: r };
 }
-function it(e, t, r, n = []) {
+function st(e, t, r, n = []) {
   const o = [...r.filter((a) => !n.some((s) => s.field === a)).map((a) => ({ field: a, op: "sum" })), ...n];
   return new Map(o.map((a) => {
-    const s = e.find((c) => c.field === a.field)?.format ?? { kind: "number", thousands: !0 }, i = Se(t, { ...a, field: a.valueField ?? a.field });
-    return [a.field, { text: Xe(i, s), ...i === null ? {} : { value: i }, ...typeof i == "number" ? { numberFormat: qe(s) } : {} }];
+    const s = e.find((c) => c.field === a.field)?.format ?? { kind: "number", thousands: !0 }, i = Me(t, { ...a, field: a.valueField ?? a.field });
+    return [a.field, { text: Ue(i, s), ...i === null ? {} : { value: i }, ...typeof i == "number" ? { numberFormat: _e(s) } : {} }];
   }));
 }
-function ct(e, t) {
+function it(e, t) {
   const r = e.findIndex((n) => t.includes(n.field));
   return r < 0 ? 1 : r;
 }
 function G(e, t, r, n, o, a) {
   const s = [], i = Math.max(0, Math.min(a, e.columns.length)), c = j({ fontSize: e.fontSizePt }, o);
   i && s.push({ text: r, colSpan: i, style: { bold: !0, ...c } });
-  for (let u = i; u < e.columns.length; u++) {
-    const h = e.columns[u], m = n.get(h.field), v = e.autoStyles[u]?.[Ue(m?.value, h.format)] ?? e.cellStyles[u];
+  for (let d = i; d < e.columns.length; d++) {
+    const h = e.columns[d], m = n.get(h.field), v = e.autoStyles[d]?.[qe(m?.value, h.format)] ?? e.cellStyles[d];
     s.push({ ...m, text: m?.text ?? "", style: j(v, o) });
   }
-  const l = { text: r, colSpan: e.columns.length, style: { bold: !0, ...c } }, d = i ? [s] : [[l], s], f = d.map((u) => Gr(e, u, t));
+  const l = { text: r, colSpan: e.columns.length, style: { bold: !0, ...c } }, u = i ? [s] : [[l], s], f = u.map((d) => Lr(e, d, t));
   return {
-    grid: { cells: d, colWidthsMm: e.colWidthsMm, rowHeightsMm: f, paddingMm: e.paddingMm },
-    heightMm: f.reduce((u, h) => u + h, 0)
+    grid: { cells: u, colWidthsMm: e.colWidthsMm, rowHeightsMm: f, paddingMm: e.paddingMm },
+    heightMm: f.reduce((d, h) => d + h, 0)
   };
 }
-function Gr(e, t, r) {
+function Lr(e, t, r) {
   let n = e.rowHeightFloorMm, o = 0;
   for (const a of t) {
     let s = 0;
     const i = o + (a.colSpan ?? 1);
     for (; o < i; o++) s += e.colWidthsMm[o] ?? 0;
-    const c = ot(e, a.style), l = _(a.text ?? "", s - e.paddingMm * 2, c.measureOptions, r);
+    const c = nt(e, a.style), l = _(a.text ?? "", s - e.paddingMm * 2, c.measureOptions, r);
     n = Math.max(n, l.length * c.lineMm + e.paddingMm * 2);
   }
   return n;
 }
-function Wr(e, t, r) {
-  const { templatePage: n, current: o, warnings: a, nextId: s, pushCurrent: i } = r, c = () => Z(n, o), l = Math.max(o.marginTopMm, V(n)), d = n.layout === "wide" ? V(n) : l, f = {
+function Hr(e, t, r) {
+  const { templatePage: n, current: o, warnings: a, nextId: s, pushCurrent: i } = r, c = () => Q(n, o), l = Math.max(o.marginTopMm, V(n)), u = n.layout === "wide" ? V(n) : l, f = {
     id: r.tableId,
-    columnKeys: e.columns.map((p) => p.field),
+    columnKeys: e.columns.map((g) => g.field),
     ...e.layout === void 0 ? {} : { layout: e.layout },
     ...e.title === void 0 ? {} : { title: e.title }
-  }, u = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map(), m = {
+  }, d = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map(), m = {
     kind: "rect",
     leftMm: e.leftMm,
     topMm: 0,
@@ -491,53 +451,53 @@ function Wr(e, t, r) {
     table: { ...f, role: "header", rowIndex: -1 },
     style: t.borderStyle,
     ...e.meta || t.matrix ? { meta: { ...e.meta, ...t.matrix ? { matrix: t.matrix.header } : {} } } : {}
-  }, v = (p) => o.components.push({ ...m, topMm: p });
+  }, v = (g) => o.components.push({ ...m, topMm: g });
   if (r.flow && e.header !== !1 && t.headerHeightMm > c() - l + 1e-3) throw new Error(`流式列表 ${e.id ?? e.dataset} 的表头高度超出单页可用范围`);
-  let y = Math.max(r.startTop ?? e.topMm, l);
-  e.header !== !1 && (v(y), y += t.headerHeightMm + r.mmPerRow);
-  function g() {
-    const p = Math.max(r.flow || n.layout === "wide" ? 0 : e.topMm, d);
-    return (e.header !== !1 && e.headerEveryPage !== !1 ? p + t.headerHeightMm : d) + [...h.values()].reduce((S, P) => S + P.heightMm, 0);
-  }
+  let p = Math.max(r.startTop ?? e.topMm, l);
+  e.header !== !1 && (v(p), p += t.headerHeightMm + r.mmPerRow);
   function w() {
-    const p = n.layout === "wide" ? 0 : o.marginBottomMm;
-    return Math.min(n.heightMm - p, Z(n, o)) - g();
+    const g = Math.max(r.flow || n.layout === "wide" ? 0 : e.topMm, u);
+    return (e.header !== !1 && e.headerEveryPage !== !1 ? g + t.headerHeightMm : u) + [...h.values()].reduce((S, E) => S + E.heightMm, 0);
   }
-  function x(p) {
-    if (y + p <= c()) return;
+  function y() {
+    const g = n.layout === "wide" ? 0 : o.marginBottomMm;
+    return Math.min(n.heightMm - g, Q(n, o)) - w();
+  }
+  function x(g) {
+    if (p + g <= c()) return;
     i(), o.components = [], o.heightMm = n.heightMm, n.layout === "wide" && (o.marginTopMm = 0, o.marginBottomMm = 0);
-    const b = Math.max(r.flow || n.layout === "wide" ? 0 : e.topMm, d);
-    e.header !== !1 && e.headerEveryPage !== !1 ? (v(b), y = b + t.headerHeightMm) : y = d;
-    for (const S of h.values()) k(S, "listgr", "group-header");
-  }
-  function E(p, b, S, P) {
-    const T = w();
-    if (r.flow && p.heightMm > T + 1e-3) throw new Error(`流式列表 ${e.id ?? e.dataset} 的单行高度超出单页可用范围`);
-    p.heightMm > T && a.push(`列表 ${e.id ?? e.dataset} 行高 ${p.heightMm.toFixed(2)}mm 超出单页可用高度 ${T.toFixed(2)}mm，预览与打印可能截断内容`), x(p.heightMm), k(p, b, S, P);
-  }
-  function k(p, b, S, P) {
-    const T = p.table?.id ?? f.id, R = S === "header" ? -1 : u.get(T) ?? 0;
-    S !== "header" && u.set(T, R + p.grid.cells.length), o.components.push({
+    const b = Math.max(r.flow || n.layout === "wide" ? 0 : e.topMm, u);
+    e.header !== !1 && e.headerEveryPage !== !1 ? (v(b), p = b + t.headerHeightMm) : p = u;
+    for (const S of h.values()) T(S, "listgr", "group-header");
+  }
+  function k(g, b, S, E) {
+    const P = y();
+    if (r.flow && g.heightMm > P + 1e-3) throw new Error(`流式列表 ${e.id ?? e.dataset} 的单行高度超出单页可用范围`);
+    g.heightMm > P && a.push(`列表 ${e.id ?? e.dataset} 行高 ${g.heightMm.toFixed(2)}mm 超出单页可用高度 ${P.toFixed(2)}mm，预览与打印可能截断内容`), x(g.heightMm), T(g, b, S, E);
+  }
+  function T(g, b, S, E) {
+    const P = g.table?.id ?? f.id, R = S === "header" ? -1 : d.get(P) ?? 0;
+    S !== "header" && d.set(P, R + g.grid.cells.length), o.components.push({
       kind: "rect",
       leftMm: e.leftMm,
-      topMm: y,
+      topMm: p,
       widthMm: e.widthMm,
-      heightMm: p.heightMm,
-      grid: p.grid,
+      heightMm: g.heightMm,
+      grid: g.grid,
       nid: s(b),
-      table: { ...f, ...p.table, role: S, rowIndex: R, ...P ? { source: P } : {} },
+      table: { ...f, ...g.table, role: S, rowIndex: R, ...E ? { source: E } : {} },
       style: t.borderStyle,
-      ...e.meta || p.meta ? { meta: { ...e.meta, ...p.meta } } : {}
-    }), y += p.heightMm;
+      ...e.meta || g.meta ? { meta: { ...e.meta, ...g.meta } } : {}
+    }), p += g.heightMm;
   }
-  function O(p) {
-    p <= w() && x(p);
+  function O(g) {
+    g <= y() && x(g);
   }
-  return { keepTogether: O, placeGridRow: E, setGroupHeader: (p, b) => {
-    b ? h.set(p, b) : h.delete(p);
-  }, bottom: () => y };
+  return { keepTogether: O, placeGridRow: k, setGroupHeader: (g, b) => {
+    b ? h.set(g, b) : h.delete(g);
+  }, bottom: () => p };
 }
-function Vr(e, t) {
+function Dr(e, t) {
   if (!e.rowKey) return;
   const r = t[e.rowKey];
   if ((typeof r != "string" || !r.trim()) && !(typeof r == "number" && Number.isFinite(r)))
@@ -547,168 +507,168 @@ function Vr(e, t) {
   if (o !== void 0 && typeof o != "string") throw new Error("来源令牌应为字符串");
   return { datasetId: e.dataset, rowKey: r, ...n === void 0 ? {} : { revision: n }, ...o === void 0 ? {} : { sourceToken: o } };
 }
-function ae(e, t) {
+function ne(e, t) {
   const r = /* @__PURE__ */ new Map();
   if (!e.rowKey) return r;
   const n = /* @__PURE__ */ new Set();
   for (const o of t) {
-    const a = Vr(e, o), s = JSON.stringify(a.rowKey);
+    const a = Dr(e, o), s = JSON.stringify(a.rowKey);
     if (n.has(s)) throw new Error(`数据集 ${e.dataset} 的业务主键重复：${String(a.rowKey)}`);
     n.add(s), r.set(o, a);
   }
   return r;
 }
-function Jr(e, t, r, n, o) {
+function Br(e, t, r, n, o) {
   if (!e.grandTotal) return;
-  const a = typeof e.grandTotal == "object" ? e.grandTotal : void 0, s = se(e)[0], i = a?.fields ?? s?.subtotal ?? [], c = a?.aggregates ?? s?.aggregates ?? [];
+  const a = typeof e.grandTotal == "object" ? e.grandTotal : void 0, s = oe(e)[0], i = a?.fields ?? s?.subtotal ?? [], c = a?.aggregates ?? s?.aggregates ?? [];
   if (i.length === 0 && c.length === 0) {
     n.warnings.push(`列表 ${e.id ?? ""} 配置了 grandTotal 但未提供合计字段（groupBy.subtotal 或 grandTotal.fields）`);
     return;
   }
-  const l = G(r, n.measurer, a?.label ?? "合计", it(e.columns, t, i, c), a?.style ?? {}, ct(e.columns, [...i, ...c.map((d) => d.field)]));
+  const l = G(r, n.measurer, a?.label ?? "合计", st(e.columns, t, i, c), a?.style ?? {}, it(e.columns, [...i, ...c.map((u) => u.field)]));
   o.placeGridRow(l, "listgt", "grand-total");
 }
-function N(e) {
+function K(e) {
   if (e?.aborted) {
     const t = new Error("报表排版已取消");
     throw t.name = "AbortError", t;
   }
 }
-function se(e) {
+function oe(e) {
   const t = e.groups ?? (e.groupBy ? [e.groupBy] : []);
   if (t.length > 16) throw new Error("列表最多支持 16 级分组");
   return t;
 }
-function Ee(e) {
-  const t = xr(e), r = t.columns.reduce((o, a) => o + a.widthMm, 0), n = r > t.widthMm ? t.widthMm / r : 1;
+function Pe(e) {
+  const t = br(e), r = t.columns.reduce((o, a) => o + a.widthMm, 0), n = r > t.widthMm ? t.widthMm / r : 1;
   return n === 1 ? t : { ...t, columns: t.columns.map((o) => ({ ...o, widthMm: o.widthMm * n })) };
 }
-function zr(e, t, r) {
+function Gr(e, t, r) {
   const n = e.detail;
   if (!n) return;
   const o = /* @__PURE__ */ new Set();
   for (const l of t) {
-    const d = he(l[n.parentKey]);
-    if (o.has(d)) throw new Error("主从明细的主表关联键重复");
-    o.add(d);
+    const u = me(l[n.parentKey]);
+    if (o.has(u)) throw new Error("主从明细的主表关联键重复");
+    o.add(u);
   }
   const a = r.datasets[n.dataset] ?? [], s = /* @__PURE__ */ new Map(), i = [];
   for (const l of a) {
-    const d = l[n.foreignKey];
-    if (!lt(d) && n.unmatched === "ignore") continue;
-    const f = he(d);
+    const u = l[n.foreignKey];
+    if (!ct(u) && n.unmatched === "ignore") continue;
+    const f = me(u);
     if (!o.has(f)) {
       if (n.unmatched !== "ignore") throw new Error(`明细数据集 ${n.dataset} 存在未关联的业务键`);
       continue;
     }
-    const u = s.get(f);
-    u ? u.push(l) : s.set(f, [l]), i.push(l);
+    const d = s.get(f);
+    d ? d.push(l) : s.set(f, [l]), i.push(l);
   }
-  const c = Ee({ ...e, id: `${e.id ?? e.dataset}:detail`, dataset: n.dataset, rowKey: n.rowKey, revisionField: n.revisionField, sourceTokenField: n.sourceTokenField, computed: void 0, columns: n.columns, headerGrid: void 0, rowHeightMm: n.rowHeightMm ?? e.rowHeightMm, detail: void 0 });
-  return { list: c, inter: { ...Pe(c, r.measurer, i, r.signal), rowHeightFloorMm: c.rowHeightMm ?? 0 }, rows: s, sources: ae(c, i) };
+  const c = Pe({ ...e, id: `${e.id ?? e.dataset}:detail`, dataset: n.dataset, rowKey: n.rowKey, revisionField: n.revisionField, sourceTokenField: n.sourceTokenField, computed: void 0, columns: n.columns, headerGrid: void 0, rowHeightMm: n.rowHeightMm ?? e.rowHeightMm, detail: void 0 });
+  return { list: c, inter: { ...Te(c, r.measurer, i, r.signal), rowHeightFloorMm: c.rowHeightMm ?? 0 }, rows: s, sources: ne(c, i) };
 }
-function lt(e) {
+function ct(e) {
   return typeof e == "string" && !!e.trim() || typeof e == "number" && Number.isFinite(e);
 }
-function he(e) {
-  if (!lt(e)) throw new Error("主从关联键必须是非空字符串或有限数字");
-  return at(e);
+function me(e) {
+  if (!ct(e)) throw new Error("主从关联键必须是非空字符串或有限数字");
+  return ot(e);
 }
-function* _r(e, t, r, n, o) {
+function* Wr(e, t, r, n, o) {
   if (!r) return;
-  const a = r.rows.get(he(t[e.detail.parentKey])) ?? [];
+  const a = r.rows.get(me(t[e.detail.parentKey])) ?? [];
   if (!a.length) return;
   const s = { id: `${n.tableId}:detail`, columnKeys: r.list.columns.map((i) => i.field), title: e.detail.label };
   e.detail.label && o.placeGridRow({ ...G(r.inter, n.measurer, e.detail.label, /* @__PURE__ */ new Map(), {}, r.list.columns.length), table: s }, "listdl", "group-header"), e.detail.header !== !1 && o.placeGridRow({ grid: r.inter.headerGrid, heightMm: r.inter.headerHeightMm, table: s }, "listdh", "header"), yield* n.takePages();
   for (const i of a)
-    N(n.signal), o.placeGridRow({ ...J(r.inter, i, n.measurer), table: s }, "listdr", "body", r.sources.get(i)), yield* n.takePages();
+    K(n.signal), o.placeGridRow({ ...z(r.inter, i, n.measurer), table: s }, "listdr", "body", r.sources.get(i)), yield* n.takePages();
 }
-function dt(e) {
+function lt(e) {
   if (e.matrix || e.detail || e.groups?.length || e.groupBy || e.rowVisibleWhen) throw new Error("树形布局不能同时配置普通分组、矩阵、主从或行可见条件");
   if (e.rowKey && e.rowKey !== e.tree.idField) throw new Error("树形布局的 rowKey 应与 idField 一致");
   if (!e.columns.some((t) => t.field === e.tree.labelField && !t.hidden)) throw new Error("树形布局需要可见的标签列");
-  nr(e.tree, e.computed);
+  tr(e.tree, e.computed);
 }
-function qr(e, t, r) {
-  dt(e);
-  const n = Qe(t, e.tree, { signal: r.signal, computed: e.computed?.length ? { fields: e.computed, formula: r.formula } : void 0 }), o = { ...e, rowKey: e.tree.idField }, a = ae(o, n.entries.map((c) => c.original)), s = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new WeakMap();
+function Vr(e, t, r) {
+  lt(e);
+  const n = Ye(t, e.tree, { signal: r.signal, computed: e.computed?.length ? { fields: e.computed, formula: r.formula } : void 0 }), o = { ...e, rowKey: e.tree.idField }, a = ne(o, n.entries.map((c) => c.original)), s = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new WeakMap();
   for (const c of n.entries)
     s.set(c.row, a.get(c.original)), i.set(c.row, c);
   return { list: o, rows: n.rows, sources: s, treeRows: i, totalRows: n.leaves };
 }
-function Ur(e, t) {
+function zr(e, t) {
   if (e.cardinality === "record") {
     if (t.length > 1) throw new Error(`单记录区域 ${e.id ?? e.dataset} 仅允许 0 或 1 行数据`);
     if (e.tree || e.matrix || e.detail || e.groups?.length || e.groupBy || e.grandTotal || e.rowVisibleWhen) throw new Error("单记录区域不能配置树、矩阵、主从、分组、总计或行过滤");
     if (!t.length) return { list: { ...e, columns: e.columns.map((r) => ({ ...r, editable: !1 })) }, rows: [{}], sources: /* @__PURE__ */ new Map() };
   }
 }
-function ut(e, t, r) {
+function dt(e, t, r) {
   const n = r.prepared.get(e);
   if (n) return n;
-  const o = Ur(e, t);
+  const o = zr(e, t);
   if (o)
     return r.prepared.set(e, o), o;
   if (e.tree) {
-    const c = qr(e, t, r);
+    const c = Vr(e, t, r);
     return r.prepared.set(e, c), c;
   }
-  let a = e.computed?.length ? Me(t, { fields: e.computed, signal: r.signal, formula: r.formula }).rows : t;
+  let a = e.computed?.length ? ve(t, { fields: e.computed, signal: r.signal, formula: r.formula }).rows : t;
   const s = a === t ? void 0 : new Map(a.map((c, l) => [c, t[l]]));
   e.rowVisibleWhen && (a = a.filter(H(e.rowVisibleWhen)));
-  const i = vr(e, a);
+  const i = pr(e, a);
   if (!e.matrix) {
-    const c = ae(e, s ? a.map((l) => s.get(l)) : a);
+    const c = ne(e, s ? a.map((l) => s.get(l)) : a);
     i.sources = s ? new Map(a.map((l) => [l, c.get(s.get(l))])) : c;
   }
   return r.prepared.set(e, i), i;
 }
-function Xr(e, t, r, n) {
+function Jr(e, t, r, n) {
   if (!n.flow) return;
-  const { current: o, templatePage: a } = n, s = Math.max(o.marginTopMm, V(a)), i = Math.max(n.startTop ?? e.topMm, s), c = (e.header === !1 ? 0 : t.headerHeightMm) + (r[0] ? J(t, r[0], n.measurer).heightMm : 0);
-  i + c <= Z(a, o) + 1e-3 || i <= s + 1e-3 || (n.pushCurrent(), o.components = [], o.heightMm = a.heightMm, a.layout === "wide" && (o.marginTopMm = 0, o.marginBottomMm = 0), n.startTop = Math.max(o.marginTopMm, V(a)));
+  const { current: o, templatePage: a } = n, s = Math.max(o.marginTopMm, V(a)), i = Math.max(n.startTop ?? e.topMm, s), c = (e.header === !1 ? 0 : t.headerHeightMm) + (r[0] ? z(t, r[0], n.measurer).heightMm : 0);
+  i + c <= Q(a, o) + 1e-3 || i <= s + 1e-3 || (n.pushCurrent(), o.components = [], o.heightMm = a.heightMm, a.layout === "wide" && (o.marginTopMm = 0, o.marginBottomMm = 0), n.startTop = Math.max(o.marginTopMm, V(a)));
 }
-function* Yr(e, t, r) {
-  const n = ut(e, t, r), o = n.rows;
+function* _r(e, t, r) {
+  const n = dt(e, t, r), o = n.rows;
   e = n.list, e.layout === "wide" && (r.current.widthMm = Math.max(r.current.widthMm, e.leftMm + e.widthMm + r.current.marginRightMm));
-  const a = n.sources ?? ae(e, o), s = Ee(e), i = se(s), c = { ...Pe(s, r.measurer, o, r.signal), rowHeightFloorMm: s.rowHeightMm ?? 0, matrix: n.matrix, ...n.treeRows ? { tree: { list: s, rows: n.treeRows } } : {} };
-  Xr(s, c, o, r);
-  const l = Wr(s, c, r), d = zr(s, o, r);
+  const a = n.sources ?? ne(e, o), s = Pe(e), i = oe(s), c = { ...Te(s, r.measurer, o, r.signal), rowHeightFloorMm: s.rowHeightMm ?? 0, matrix: n.matrix, ...n.treeRows ? { tree: { list: s, rows: n.treeRows } } : {} };
+  Jr(s, c, o, r);
+  const l = Hr(s, c, r), u = Gr(s, o, r);
   let f;
-  for (const u of st(o, i)) {
-    if (N(r.signal), u.kind === "row")
-      l.placeGridRow(f ?? J(c, u.row, r.measurer), "listr", yr(n.matrix, u.row), a.get(u.row)), f = void 0, yield* r.takePages(), yield* _r(s, u.row, d, r, l);
-    else if (u.kind === "groupHeader") {
-      const h = G(c, r.measurer, u.label, /* @__PURE__ */ new Map(), u.group.headerStyle ?? {}, s.columns.length);
-      f ??= J(c, u.firstRow, r.measurer);
-      const m = i.slice(u.depth + 1).reduce((v, y) => v + G(c, r.measurer, (y.headerTemplate ?? "{value}").replace(/\{value\}/g, xe(u.firstRow[y.field])), /* @__PURE__ */ new Map(), y.headerStyle ?? {}, s.columns.length).heightMm, 0);
-      u.group.keepWithNext !== !1 && l.keepTogether(h.heightMm + m + f.heightMm), l.placeGridRow(h, "listg", "group-header"), u.group.repeatHeader && l.setGroupHeader(u.depth, h);
-    } else if (u.kind === "subtotal") {
-      const h = u.group.subtotal ?? [], m = u.group.aggregates ?? [], v = G(c, r.measurer, u.label, it(s.columns, u.rows, h, m), u.group.subtotalStyle ?? {}, ct(s.columns, [...h, ...m.map((y) => y.field)]));
+  for (const d of at(o, i)) {
+    if (K(r.signal), d.kind === "row")
+      l.placeGridRow(f ?? z(c, d.row, r.measurer), "listr", hr(n.matrix, d.row), a.get(d.row)), f = void 0, yield* r.takePages(), yield* Wr(s, d.row, u, r, l);
+    else if (d.kind === "groupHeader") {
+      const h = G(c, r.measurer, d.label, /* @__PURE__ */ new Map(), d.group.headerStyle ?? {}, s.columns.length);
+      f ??= z(c, d.firstRow, r.measurer);
+      const m = i.slice(d.depth + 1).reduce((v, p) => v + G(c, r.measurer, (p.headerTemplate ?? "{value}").replace(/\{value\}/g, xe(d.firstRow[p.field])), /* @__PURE__ */ new Map(), p.headerStyle ?? {}, s.columns.length).heightMm, 0);
+      d.group.keepWithNext !== !1 && l.keepTogether(h.heightMm + m + f.heightMm), l.placeGridRow(h, "listg", "group-header"), d.group.repeatHeader && l.setGroupHeader(d.depth, h);
+    } else if (d.kind === "subtotal") {
+      const h = d.group.subtotal ?? [], m = d.group.aggregates ?? [], v = G(c, r.measurer, d.label, st(s.columns, d.rows, h, m), d.group.subtotalStyle ?? {}, it(s.columns, [...h, ...m.map((p) => p.field)]));
       l.placeGridRow(v, "listst", "subtotal");
-    } else l.setGroupHeader(u.depth);
+    } else l.setGroupHeader(d.depth);
     yield* r.takePages();
   }
-  Jr(s, n.totalRows ?? o, c, r, l), r.finished?.(l.bottom()), yield* r.takePages();
+  Br(s, n.totalRows ?? o, c, r, l), r.finished?.(l.bottom()), yield* r.takePages();
 }
-function ie(e) {
+function ae(e) {
   return e.kind !== "list" && (e.pageAnchor !== void 0 || e.kind === "text" && typeof e.text == "string" && (e.text.includes("{page}") || e.text.includes("{totalPages}")));
 }
-function ce(e, t) {
+function se(e, t) {
   return {
     ...e,
     ...e.text === void 0 ? {} : { text: t(e.text) },
     ...e.lines ? { lines: e.lines.map(t) } : {},
     ...e.richParagraphs ? { richParagraphs: e.richParagraphs.map((r) => ({ ...r, segments: r.segments.map((n) => ({ ...n, ...n.text === void 0 ? {} : { text: t(n.text) } })) })) } : {},
-    ...e.grid ? { grid: { ...e.grid, cells: e.grid.cells.map((r) => r.map((n) => n ? { ...n, ...n.text === void 0 ? {} : { text: t(n.text) }, ...n.children ? { children: n.children.map((o) => ce(o, t)) } : {} } : null)) } } : {}
+    ...e.grid ? { grid: { ...e.grid, cells: e.grid.cells.map((r) => r.map((n) => n ? { ...n, ...n.text === void 0 ? {} : { text: t(n.text) }, ...n.children ? { children: n.children.map((o) => se(o, t)) } : {} } : null)) } } : {}
   };
 }
-function Qr(e) {
+function qr(e) {
   let t = !1;
-  for (const r of e.pages) for (const n of r.components) ie(n) && ce(n, (o) => (o.includes("{totalPages}") && (t = !0), o));
+  for (const r of e.pages) for (const n of r.components) ae(n) && se(n, (o) => (o.includes("{totalPages}") && (t = !0), o));
   return t;
 }
-function Zr(e, t, r, n, o, a) {
+function Ur(e, t, r, n, o, a) {
   const s = {
     pageWidthMm: t.widthMm,
     pageHeightMm: t.heightMm,
@@ -723,38 +683,38 @@ function Zr(e, t, r, n, o, a) {
     const l = c.replace(/\{page\}/g, String(n));
     return a === void 0 ? l : l.replace(/\{totalPages\}/g, String(a));
   };
-  for (const c of r) s.components.push(ce(c, i));
+  for (const c of r) s.components.push(se(c, i));
   if (e.layout === "wide") {
-    const c = s.components.reduce((l, d) => Math.max(l, d.topMm + d.heightMm), 0);
+    const c = s.components.reduce((l, u) => Math.max(l, u.topMm + u.heightMm), 0);
     s.marginBottomMm = o ? e.marginBottomMm ?? 0 : 0, s.pageHeightMm = Math.max(1, c + s.marginBottomMm);
   }
   return s;
 }
-function Re(e) {
-  return e.cells.reduce((t, r) => t + r.reduce((n, o) => n + (o ? 1 + (o.children?.reduce((a, s) => a + ft(s), 0) ?? 0) : 0), 0), 0);
+function Ee(e) {
+  return e.cells.reduce((t, r) => t + r.reduce((n, o) => n + (o ? 1 + (o.children?.reduce((a, s) => a + ut(s), 0) ?? 0) : 0), 0), 0);
 }
-function ft(e) {
-  return e.grid ? Re(e.grid) : 0;
+function ut(e) {
+  return e.grid ? Ee(e.grid) : 0;
 }
-function le(e) {
+function ie(e) {
   for (const t of ["maxPages", "maxCells", "knownTotalPages"]) if (e[t] !== void 0 && (!Number.isSafeInteger(e[t]) || e[t] < 1)) throw new RangeError(`${t} 应为正安全整数`);
-  oe(e.maxChartComponents);
+  Se(e.maxChartComponents);
 }
-function en(e, t) {
-  const r = ut(e, t.datasets[e.dataset] ?? [], t), n = Ee(r.list), o = { ...Pe(n, t.measurer, r.rows, t.signal), rowHeightFloorMm: n.rowHeightMm ?? 0 };
-  return (n.header === !1 ? 0 : o.headerHeightMm) + r.rows.reduce((a, s) => a + J(o, s, t.measurer).heightMm, 0);
+function Xr(e, t) {
+  const r = dt(e, t.datasets[e.dataset] ?? [], t), n = Pe(r.list), o = { ...Te(n, t.measurer, r.rows, t.signal), rowHeightFloorMm: n.rowHeightMm ?? 0 };
+  return (n.header === !1 ? 0 : o.headerHeightMm) + r.rows.reduce((a, s) => a + z(o, s, t.measurer).heightMm, 0);
 }
-function* tn(e) {
+function* Yr(e) {
   const { templatePage: t, current: r } = e, n = new Map(t.components.map((a, s) => [a, s])), o = (a, s, i) => {
     const c = e.datasets[a.dataset];
-    return Array.isArray(c) || e.warnings.push(`数据集 ${a.dataset} 未提供数据，列表 ${a.id ?? ""} 输出为空`), Yr(a, Array.isArray(c) ? c : [], { ...e, tableId: `${e.tableId}:${n.get(a)}`, startTop: s, finished: i, flow: !!t.flow });
+    return Array.isArray(c) || e.warnings.push(`数据集 ${a.dataset} 未提供数据，列表 ${a.id ?? ""} 输出为空`), _r(a, Array.isArray(c) ? c : [], { ...e, tableId: `${e.tableId}:${n.get(a)}`, startTop: s, finished: i, flow: !!t.flow });
   };
   if (t.flow) {
-    yield* Cr({
+    yield* vr({
       page: t,
-      active: () => N(e.signal),
+      active: () => K(e.signal),
       top: () => Math.max(r.marginTopMm, V(t)),
-      bottom: () => Z(t, r),
+      bottom: () => Q(t, r),
       append: (a) => {
         r.components.push(...e.resolveChart(a));
       },
@@ -762,173 +722,173 @@ function* tn(e) {
         e.pushCurrent(), r.components = [], r.heightMm = t.heightMm, t.layout === "wide" && (r.marginTopMm = 0, r.marginBottomMm = 0);
       },
       takePages: e.takePages,
-      height: (a) => en(a, e),
+      height: (a) => Xr(a, e),
       list: o
     });
     return;
   }
   for (const a of t.components)
-    ie(a) || (a.kind === "list" ? yield* o(a) : r.components.push(...e.resolveChart(a)));
+    ae(a) || (a.kind === "list" ? yield* o(a) : r.components.push(...e.resolveChart(a)));
 }
-function* z(e, t, r, n, o, a = /* @__PURE__ */ new WeakMap(), s) {
+function* J(e, t, r, n, o, a = /* @__PURE__ */ new WeakMap(), s) {
   let i = 0, c = 0, l = 0;
-  const d = gr(r.measurer ?? Je), f = wr(t, r.signal, r.maxChartComponents), u = (h) => `${h}_${(++i).toString(36)}`;
-  for (const { pageIndex: h, page: m } of Ar(e, t, r)) {
-    N(r.signal);
-    const v = Nr(m), y = m.components.filter(ie);
-    let g = [];
-    const w = (E = !1) => {
-      if (N(r.signal), r.maxPages !== void 0 && c >= r.maxPages) throw new W(r.maxPages, c + 1);
-      if (r.maxCells !== void 0 && (l += [...v.components, ...y].reduce((k, O) => k + ft(O), 0), l > r.maxCells))
+  const u = mr(r.measurer ?? Ve), f = Ut(t, r.signal, r.maxChartComponents), d = (h) => `${h}_${(++i).toString(36)}`;
+  for (const { pageIndex: h, page: m } of Ir(e, t, r)) {
+    K(r.signal);
+    const v = $r(m), p = m.components.filter(ae);
+    let w = [];
+    const y = (k = !1) => {
+      if (K(r.signal), r.maxPages !== void 0 && c >= r.maxPages) throw new W(r.maxPages, c + 1);
+      if (r.maxCells !== void 0 && (l += [...v.components, ...p].reduce((T, O) => T + ut(O), 0), l > r.maxCells))
         throw new Y(r.maxCells, l);
-      g.push(Zr(m, v, y, ++c, E, o));
+      w.push(Ur(m, v, p, ++c, k, o));
     }, x = () => {
-      const E = g;
-      return g = [], E;
+      const k = w;
+      return w = [], k;
     };
-    yield* tn({
+    yield* Yr({
       templatePage: m,
       current: v,
       warnings: n,
-      nextId: u,
-      pushCurrent: w,
+      nextId: d,
+      pushCurrent: y,
       takePages: x,
       datasets: t,
       resolveChart: f,
       signal: r.signal,
       formula: r.formula,
       prepared: a,
-      measurer: d,
+      measurer: u,
       mmPerRow: r.mmPerRow ?? 0,
       tableId: `table:${h}`
-    }), w(!0), yield* x();
+    }), y(!0), yield* x();
   }
   s && (s.chartComponents = f.used());
 }
-function mo(e, t, r = {}) {
-  le(r);
+function lo(e, t, r = {}) {
+  ie(r);
   let n = 0;
-  for (const o of z(e, t, { ...r, onWarning: void 0 }, [])) n++;
+  for (const o of J(e, t, { ...r, onWarning: void 0 }, [])) n++;
   return n;
 }
-function* ho(e, t, r = {}) {
-  yield* rn(e, t, r);
+function* uo(e, t, r = {}) {
+  yield* Qr(e, t, r);
 }
-function* rn(e, t, r, n) {
-  le(r);
-  const o = Qr(e), a = /* @__PURE__ */ new WeakMap();
+function* Qr(e, t, r, n) {
+  ie(r);
+  const o = qr(e), a = /* @__PURE__ */ new WeakMap();
   let s = r.knownTotalPages;
   if (o && s === void 0) {
     s = 0;
-    for (const l of z(e, t, r, [], void 0, a)) s++;
+    for (const l of J(e, t, r, [], void 0, a)) s++;
   }
   const i = [];
   let c = 0;
-  for (const l of z(e, t, r, i, s, a, n)) {
+  for (const l of J(e, t, r, i, s, a, n)) {
     for (; c < i.length; c++) r.onWarning?.(i[c]);
     yield l;
   }
 }
-function mt(e, t, r = {}) {
+function ft(e, t, r = {}) {
   const n = typeof r == "number" ? { mmPerRow: r } : r;
-  le(n);
-  const o = [], a = { chartComponents: 0 }, s = [...z(e, t, n, o, n.knownTotalPages, void 0, a)];
-  return gt(e, n, s, o, a);
+  ie(n);
+  const o = [], a = { chartComponents: 0 }, s = [...J(e, t, n, o, n.knownTotalPages, void 0, a)];
+  return ht(e, n, s, o, a);
 }
-async function ht(e, t, r = {}) {
-  le(r), N(r.signal);
+async function mt(e, t, r = {}) {
+  ie(r), K(r.signal);
   const n = [], o = [], a = { chartComponents: 0 };
   let s = performance.now(), i = 0;
-  for (const c of z(e, t, r, n, r.knownTotalPages, void 0, a))
-    o.push(c), (++i >= 8 || performance.now() - s >= 8) && (await new Promise((l) => setTimeout(l, 0)), N(r.signal), s = performance.now(), i = 0);
-  return N(r.signal), gt(e, r, o, n, a);
+  for (const c of J(e, t, r, n, r.knownTotalPages, void 0, a))
+    o.push(c), (++i >= 8 || performance.now() - s >= 8) && (await new Promise((l) => setTimeout(l, 0)), K(r.signal), s = performance.now(), i = 0);
+  return K(r.signal), ht(e, r, o, n, a);
 }
-function gt(e, t, r, n, o) {
-  for (const a of r) a.components = a.components.map((s) => ie(s) ? ce(s, (i) => i.replace(/\{totalPages\}/g, String(r.length))) : s);
-  return n.forEach((a) => t.onWarning?.(a)), { plan: { schemaVersion: be, ...ke(e) ? { requiresRecalculation: !0 } : {}, pages: r }, warnings: n, ...o };
+function ht(e, t, r, n, o) {
+  for (const a of r) a.components = a.components.map((s) => ae(s) ? se(s, (i) => i.replace(/\{totalPages\}/g, String(r.length))) : s);
+  return n.forEach((a) => t.onWarning?.(a)), { plan: { schemaVersion: be, ...Ce(e) ? { requiresRecalculation: !0 } : {}, pages: r }, warnings: n, ...o };
 }
-function nn(e) {
+function Zr(e) {
   const t = e.columns.find((a) => !a.hidden)?.field;
   if (!t) return { groups: 0, total: 0 };
-  const r = se(e), n = (a = [], s = []) => a.includes(t) || s.some((i) => i.field === t), o = typeof e.grandTotal == "object" ? e.grandTotal : void 0;
+  const r = oe(e), n = (a = [], s = []) => a.includes(t) || s.some((i) => i.field === t), o = typeof e.grandTotal == "object" ? e.grandTotal : void 0;
   return { groups: r.filter((a) => n(a.subtotal, a.aggregates)).length, total: Number(n(o?.fields ?? r[0]?.subtotal, o?.aggregates ?? r[0]?.aggregates)) };
 }
-function on(e, t, r) {
-  dt(e);
-  const n = Ye(t[e.dataset] ?? [], e.tree, r), o = e.columns.filter((s) => !s.hidden).length, a = e.header === !1 ? 0 : e.headerGrid ? Re(e.headerGrid) : o;
+function en(e, t, r) {
+  lt(e);
+  const n = Xe(t[e.dataset] ?? [], e.tree, r), o = e.columns.filter((s) => !s.hidden).length, a = e.header === !1 ? 0 : e.headerGrid ? Ee(e.headerGrid) : o;
   return n.length * o + a + +!!e.grandTotal * 2 * o;
 }
-function go(e, t, r = {}) {
-  if (e.tree) return on(e, t, r.signal);
+function fo(e, t, r = {}) {
+  if (e.tree) return en(e, t, r.signal);
   if (e.matrix) {
     let c = t[e.dataset] ?? [];
-    e.computed?.length && (c = Me(c, { fields: e.computed, ...r }).rows), e.rowVisibleWhen && (c = c.filter(H(e.rowVisibleWhen)));
-    const l = rr(c, e.matrix);
+    e.computed?.length && (c = ve(c, { fields: e.computed, ...r }).rows), e.rowVisibleWhen && (c = c.filter(H(e.rowVisibleWhen)));
+    const l = er(c, e.matrix);
     return l.cells + (e.header === !1 ? 0 : l.columnCount * (e.matrix.hierarchy ? e.matrix.columnFields.length + 1 : 1));
   }
-  const n = t[e.dataset]?.length ?? 0, o = e.columns.filter((c) => !c.hidden).length, a = se(e).length, s = nn(e);
+  const n = t[e.dataset]?.length ?? 0, o = e.columns.filter((c) => !c.hidden).length, a = oe(e).length, s = Zr(e);
   let i = (n * (1 + 2 * a + s.groups) + +!!e.grandTotal * (1 + s.total)) * o;
-  if (i += e.header === !1 ? 0 : e.headerGrid ? Re(e.headerGrid) : o, e.cardinality === "record" && n === 0 && (i += o), e.detail) {
-    const c = t[e.detail.dataset]?.length ?? 0, l = e.detail.columns.filter((d) => !d.hidden).length;
+  if (i += e.header === !1 ? 0 : e.headerGrid ? Ee(e.headerGrid) : o, e.cardinality === "record" && n === 0 && (i += o), e.detail) {
+    const c = t[e.detail.dataset]?.length ?? 0, l = e.detail.columns.filter((u) => !u.hidden).length;
     i += (c + n * (+(e.detail.header !== !1) + +!!e.detail.label)) * l;
   }
   if (!Number.isSafeInteger(i)) throw new RangeError("报表单元格估算超出安全整数预算");
   return i;
 }
-class an extends Error {
+class tn extends Error {
   constructor(t) {
     super(t.map((r) => r.message).join("；")), this.issues = t, this.name = "ReportValidationError";
   }
 }
-function Le(e, t, r) {
+function Ne(e, t, r) {
   if (!Number.isSafeInteger(e) || e < 1 || e > r) throw new Error(`校验 ${t} 超出预算`);
   return e;
 }
-function sn(e) {
+function rn(e) {
   if (e.aggregates && e.scope !== "dataset") throw new Error("仅数据集规则允许汇总");
   if (e.aggregates && (!Array.isArray(e.aggregates) || e.aggregates.length > 64)) throw new Error("校验汇总最多 64 项");
   const t = /* @__PURE__ */ new Set();
   for (const r of e.aggregates ?? []) {
-    if (K(r.field), t.has(r.field)) throw new Error("校验汇总字段重复");
-    t.add(r.field), r.valueField !== void 0 && K(r.valueField), r.weightField !== void 0 && K(r.weightField), Se([], { ...r, field: r.valueField ?? r.field });
+    if (N(r.field), t.has(r.field)) throw new Error("校验汇总字段重复");
+    t.add(r.field), r.valueField !== void 0 && N(r.valueField), r.weightField !== void 0 && N(r.weightField), Me([], { ...r, field: r.valueField ?? r.field });
   }
 }
-function pt(e) {
+function gt(e) {
   if (!Array.isArray(e) || e.length > 256 || Object.keys(e).length !== e.length) throw new Error("校验规则最多 256 条且不允许空位");
   const t = /* @__PURE__ */ new Set();
   return e.map((r) => {
     if (!r || typeof r != "object") throw new Error("校验规则应为声明式对象");
-    if (K(r.id), t.has(r.id)) throw new Error("校验规则 id 重复");
-    if (t.add(r.id), r.field !== void 0 && K(r.field), r.dataset !== void 0 && K(r.dataset), typeof r.message != "string" || !r.message.trim() || r.message.length > 2048) throw new Error("校验规则需要有界提示文案");
+    if (N(r.id), t.has(r.id)) throw new Error("校验规则 id 重复");
+    if (t.add(r.id), r.field !== void 0 && N(r.field), r.dataset !== void 0 && N(r.dataset), typeof r.message != "string" || !r.message.trim() || r.message.length > 2048) throw new Error("校验规则需要有界提示文案");
     if (r.severity !== void 0 && !["error", "warning"].includes(r.severity)) throw new Error("未知校验严重程度");
     if (r.scope !== void 0 && !["row", "dataset"].includes(r.scope)) throw new Error("未知校验范围");
-    sn(r);
+    rn(r);
     const n = { nodes: 0 }, o = H(r.assert, n), a = r.when ? H(r.when, n) : void 0;
     return { rule: r, assert: o, when: a, checks: n.nodes };
   });
 }
-function He(e) {
+function Le(e) {
   if (e?.aborted) {
     const t = new Error("报表校验已取消");
     throw t.name = "AbortError", t;
   }
 }
-function cn(e, t, r, n) {
+function nn(e, t, r, n) {
   const o = n && Object.prototype.hasOwnProperty.call(t, n) ? t[n] : void 0;
   if (o !== void 0 && typeof o != "string" && !(typeof o == "number" && Number.isFinite(o))) throw new Error("校验定位需要稳定的文本或数值业务键");
   return { ruleId: e.id, rowIndex: r, ...o === void 0 ? {} : { rowKey: o }, field: e.field, severity: e.severity ?? "error", message: e.message };
 }
-function ln(e, t) {
+function on(e, t) {
   const r = t.computed?.length ? { fields: t.computed, formula: t.formula, signal: t.signal } : void 0;
   if (t.tree) {
-    const o = Qe(e, t.tree, { signal: t.signal, computed: r });
+    const o = Ye(e, t.tree, { signal: t.signal, computed: r });
     if (o.rows.length > 1e5) throw new Error("校验展开后数据最多 100000 行");
     return { rows: o.rows, summaryRows: o.leaves, rowKey: t.tree.idField };
   }
-  const n = r ? Me(e, r).rows : e;
+  const n = r ? ve(e, r).rows : e;
   return { rows: n, summaryRows: n, rowKey: t.rowKey };
 }
-function dn(e, t) {
+function an(e, t) {
   const r = /* @__PURE__ */ new Set();
   e.forEach((n) => {
     if (!n || typeof n != "object" || Array.isArray(n)) throw new Error("校验数据行应为对象");
@@ -939,49 +899,49 @@ function dn(e, t) {
     r.add(o);
   });
 }
-function po(e, t) {
-  return wt(e, t, { checks: 0 });
+function mo(e, t) {
+  return pt(e, t, { checks: 0 });
 }
-function wt(e, t, r) {
+function pt(e, t, r) {
   if (!Array.isArray(e) || e.length > 1e5) throw new Error("校验数据最多 100000 行");
-  He(t.signal);
-  const n = Le(t.maxChecks ?? 2e6, "maxChecks", 1e7), o = Le(t.maxIssues ?? 1e3, "maxIssues", 1e4);
-  t.rowKey !== void 0 && K(t.rowKey);
-  const a = ln(e, t), { rows: s, summaryRows: i, rowKey: c } = a;
-  dn(s, c);
-  const l = pt(t.rules), d = l.reduce((u, h) => u + (h.rule.scope === "dataset" ? h.checks + i.length * (h.rule.aggregates?.length ?? 0) : s.length * h.checks), 0);
-  if (r.checks += d, r.checks > n) throw new Error("整批校验超出 maxChecks 预算");
+  Le(t.signal);
+  const n = Ne(t.maxChecks ?? 2e6, "maxChecks", 1e7), o = Ne(t.maxIssues ?? 1e3, "maxIssues", 1e4);
+  t.rowKey !== void 0 && N(t.rowKey);
+  const a = on(e, t), { rows: s, summaryRows: i, rowKey: c } = a;
+  an(s, c);
+  const l = gt(t.rules), u = l.reduce((d, h) => d + (h.rule.scope === "dataset" ? h.checks + i.length * (h.rule.aggregates?.length ?? 0) : s.length * h.checks), 0);
+  if (r.checks += u, r.checks > n) throw new Error("整批校验超出 maxChecks 预算");
   const f = [];
-  for (const u of l)
-    (u.rule.scope === "dataset" ? [Object.fromEntries((u.rule.aggregates ?? []).map((m) => [m.field, Se(i, { ...m, field: m.valueField ?? m.field })]))] : s).forEach((m, v) => {
-      if (He(t.signal), !m || typeof m != "object" || Array.isArray(m)) throw new Error("校验数据行应为对象");
-      if (!(u.when && !u.when(m) || u.assert(m))) {
+  for (const d of l)
+    (d.rule.scope === "dataset" ? [Object.fromEntries((d.rule.aggregates ?? []).map((m) => [m.field, Me(i, { ...m, field: m.valueField ?? m.field })]))] : s).forEach((m, v) => {
+      if (Le(t.signal), !m || typeof m != "object" || Array.isArray(m)) throw new Error("校验数据行应为对象");
+      if (!(d.when && !d.when(m) || d.assert(m))) {
         if (f.length >= o) throw new Error("校验问题超出 maxIssues 预算，请缩小范围");
-        f.push(cn(u.rule, m, u.rule.scope === "dataset" ? void 0 : v, u.rule.scope === "dataset" ? void 0 : c));
+        f.push(nn(d.rule, m, d.rule.scope === "dataset" ? void 0 : v, d.rule.scope === "dataset" ? void 0 : c));
       }
     });
   return f;
 }
-function un(e, t = "allow") {
+function sn(e, t = "allow") {
   if (!["allow", "block"].includes(t)) throw new Error("未知校验警告策略");
   if (!Array.isArray(e) || e.length > 1e4 || e.some((r) => !r || !["error", "warning"].includes(r.severity) || typeof r.ruleId != "string" || !r.ruleId.trim() || typeof r.message != "string" || !r.message.trim())) throw new Error("校验问题结构无效");
-  if (e.some((r) => r.severity === "error" || t === "block")) throw new an(e);
+  if (e.some((r) => r.severity === "error" || t === "block")) throw new tn(e);
 }
-function De(e, t, r) {
+function He(e, t, r) {
   const n = e.get(t);
   if (n && JSON.stringify(n) !== JSON.stringify(r)) throw new Error("同一数据集的校验计算/业务键存在歧义，请统一绑定");
   e.set(t, r);
 }
-function fn(e, t, r, n = []) {
-  pt(t.rules);
+function cn(e, t, r, n = []) {
+  gt(t.rules);
   const o = [], a = { checks: 0 };
   for (const [i, c] of e.entries()) {
     const l = /* @__PURE__ */ new Map();
-    for (const d of c.template.pages) for (const f of d.components)
-      f.kind === "list" && (De(l, f.dataset, { rowKey: f.tree?.idField ?? f.rowKey, computed: f.computed, tree: f.tree }), f.detail && De(l, f.detail.dataset, { rowKey: f.detail.rowKey }));
-    for (const [d, f] of l) {
-      const u = t.rules.filter((h) => !h.dataset || h.dataset === d);
-      if (u.length && (o.push(...wt(c.datasets[d] ?? [], { ...t, rules: u, ...f, formula: n[i], signal: r }, a).map((h) => ({ ...h, dataset: d, sourceScope: c.sourceScope }))), o.length > (t.maxIssues ?? 1e3)))
+    for (const u of c.template.pages) for (const f of u.components)
+      f.kind === "list" && (He(l, f.dataset, { rowKey: f.tree?.idField ?? f.rowKey, computed: f.computed, tree: f.tree }), f.detail && He(l, f.detail.dataset, { rowKey: f.detail.rowKey }));
+    for (const [u, f] of l) {
+      const d = t.rules.filter((h) => !h.dataset || h.dataset === u);
+      if (d.length && (o.push(...pt(c.datasets[u] ?? [], { ...t, rules: d, ...f, formula: n[i], signal: r }, a).map((h) => ({ ...h, dataset: u, sourceScope: c.sourceScope }))), o.length > (t.maxIssues ?? 1e3)))
         throw new Error("整批候选校验问题超出 maxIssues 预算");
     }
   }
@@ -989,31 +949,31 @@ function fn(e, t, r, n = []) {
   if (t.rules.some((i) => i.dataset && !s.has(i.dataset))) throw new Error("校验目标数据集不存在");
   return o;
 }
-function yt(e) {
+function wt(e) {
   return !e || typeof e != "object" ? !1 : [e.pageIndex, e.componentIndex, e.rowIndex, e.columnIndex].every((t) => Number.isInteger(t) && t >= 0);
 }
-function bt(e, t, r) {
+function yt(e, t, r) {
   const n = e.grid;
   if (!n) return null;
   const o = n.cells[t];
   if (!o) return null;
-  const s = re(n, e.widthMm, e.heightMm).cells.filter((c) => c.ri === t).findIndex((c) => c.ci === r), i = o[s];
+  const s = te(n, e.widthMm, e.heightMm).cells.filter((c) => c.ri === t).findIndex((c) => c.ci === r), i = o[s];
   return i ? { cell: i, sourceColumnIndex: s } : null;
 }
-function mn(e) {
+function ln(e) {
   return e.value !== void 0 ? e.value : e.rawText ?? e.text ?? null;
 }
-function hn(e, t) {
+function dn(e, t) {
   return e.valueType ? e.valueType : typeof t == "number" ? "number" : typeof t == "boolean" ? "boolean" : t === null && e.numberFormat && /[0#?]/.test(e.numberFormat) ? "number" : "text";
 }
-function gn(e, t) {
+function un(e, t) {
   if (e.derived) return "derived";
   if (e.editable === !1) return "cell";
   if (e.formula !== void 0) return "formula";
   if (e.children?.length || e.richParagraphs?.length) return "complex";
   if (t.table && t.table.role !== "body" && e.editable !== !0) return "structure";
 }
-function pn(e, t) {
+function fn(e, t) {
   const r = e.table;
   if (r)
     return {
@@ -1023,45 +983,45 @@ function pn(e, t) {
       columnKey: r.columnKeys[t.columnIndex]
     };
 }
-function wn(e, t, r) {
+function mn(e, t, r) {
   if (e.derived) return;
   if (e.source) return { ...e.source };
   const n = t.table?.source, o = t.table?.columnKeys[r.columnIndex];
   if (!(!n || n.rowKey === void 0 || o === void 0))
     return { ...n, rowKey: n.rowKey, field: o };
 }
-function vt(e, t, r) {
-  const n = mn(r), o = gn(r, e);
+function bt(e, t, r) {
+  const n = ln(r), o = un(r, e);
   return {
     address: { ...t },
     cell: r,
     component: e,
     value: n,
-    valueType: hn(r, n),
-    table: pn(e, t),
-    source: wn(r, e, t),
+    valueType: dn(r, n),
+    table: fn(e, t),
+    source: mn(r, e, t),
     editable: o === void 0,
     readOnlyReason: o
   };
 }
-function $e(e, t) {
-  if (!yt(t)) return null;
+function Re(e, t) {
+  if (!wt(t)) return null;
   const r = e.pages[t.pageIndex]?.components[t.componentIndex];
   if (!r) return null;
-  const n = bt(r, t.rowIndex, t.columnIndex);
-  return n ? vt(r, t, n.cell) : null;
+  const n = yt(r, t.rowIndex, t.columnIndex);
+  return n ? bt(r, t, n.cell) : null;
 }
 function D(e) {
   const t = /* @__PURE__ */ new Map();
   return (r) => {
-    if (!yt(r)) return null;
+    if (!wt(r)) return null;
     const n = e.pages[r.pageIndex]?.components[r.componentIndex];
     if (!n?.grid) return null;
     let o = t.get(n);
     if (!o) {
       const s = /* @__PURE__ */ new Map();
       o = /* @__PURE__ */ new Map();
-      for (const i of re(n.grid, n.widthMm, n.heightMm).cells) {
+      for (const i of te(n.grid, n.widthMm, n.heightMm).cells) {
         const c = s.get(i.ri) ?? 0;
         s.set(i.ri, c + 1);
         const l = n.grid.cells[i.ri]?.[c];
@@ -1070,7 +1030,7 @@ function D(e) {
       t.set(n, o);
     }
     const a = o.get(`${r.rowIndex}:${r.columnIndex}`);
-    return a ? vt(n, r, a) : null;
+    return a ? bt(n, r, a) : null;
   };
 }
 class M extends Error {
@@ -1078,20 +1038,20 @@ class M extends Error {
     super(`Invalid report cell edit: ${t}`), this.code = t, this.name = "ReportCellEditError";
   }
 }
-function yn(e, t) {
+function hn(e, t) {
   let r = e.trim();
   const n = t && r.endsWith("%");
   if (n && (r = r.slice(0, -1).trim()), /^[+-]?\d{1,3}(?:,\d{3})+(?:\.\d*)?(?:[eE][+-]?\d+)?$/.test(r) && (r = r.replace(/,/g, "")), !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)(?:[eE][+-]?\d+)?$/.test(r)) throw new M("number");
   return Number(r) / (n ? 100 : 1);
 }
-function bn(e, t) {
+function gn(e, t) {
   if (e === null || typeof e == "string" && e.trim() === "") return null;
   if (typeof e != "string" && typeof e != "number") throw new M("number");
-  const r = typeof e == "number" ? e : yn(e, fr(t.cell.numberFormat));
+  const r = typeof e == "number" ? e : hn(e, dr(t.cell.numberFormat));
   if (!Number.isFinite(r) || Number.isInteger(r) && !Number.isSafeInteger(r)) throw new M("number");
   return r;
 }
-function vn(e) {
+function pn(e) {
   if (e === null || typeof e == "string" && e.trim() === "") return null;
   if (typeof e == "boolean") return e;
   const t = String(e).trim().toLowerCase();
@@ -1099,24 +1059,24 @@ function vn(e) {
   if (["false", "no", "否", "0"].includes(t)) return !1;
   throw new M("boolean");
 }
-function Mt(e, t) {
-  return e.valueType === "number" ? bn(t, e) : e.valueType === "boolean" ? vn(t) : t === null ? null : String(t);
+function vt(e, t) {
+  return e.valueType === "number" ? gn(t, e) : e.valueType === "boolean" ? pn(t) : t === null ? null : String(t);
 }
-function Mn(e, t) {
+function wn(e, t) {
   const r = t.cell.text, o = [["是", "否"], ["TRUE", "FALSE"], ["True", "False"], ["true", "false"], ["1", "0"]].find((a) => a.includes(r ?? ""));
   return o ? o[e ? 0 : 1] : String(e);
 }
 function q(e, t) {
-  return t === null ? "" : typeof t == "boolean" ? Mn(t, e) : typeof t == "number" ? ur(t, e.cell.numberFormat) : String(t);
+  return t === null ? "" : typeof t == "boolean" ? wn(t, e) : typeof t == "number" ? lr(t, e.cell.numberFormat) : String(t);
 }
-function wo(e, t, r) {
-  const n = $e(e, t);
+function ho(e, t, r) {
+  const n = Re(e, t);
   if (!n) throw new M("missing");
   return U(n, r);
 }
 function U(e, t) {
   if (!e.editable) throw new M("readonly");
-  const r = Mt(e, t);
+  const r = vt(e, t);
   return {
     address: { ...e.address },
     table: e.table,
@@ -1127,33 +1087,33 @@ function U(e, t) {
     text: q(e, r)
   };
 }
-function Sn(e, t) {
+function yn(e, t) {
   const r = e.table, n = t.table;
   return !r || !n || r.columnKey === void 0 ? !1 : r.id === n.id && r.rowIndex === n.rowIndex && r.role === n.role && r.columnKey === n.columnKey;
 }
-function St(e, t, r) {
-  const n = e.grid, { rowIndex: o, columnIndex: a } = t.address, s = bt(e, o, a), i = [...n.cells], c = [...i[o]], l = q(t, r.value), d = { ...s.cell, value: r.value, text: l, rawText: l };
-  return c[s.sourceColumnIndex] = d, i[o] = c, { ...e, grid: { ...n, cells: i } };
+function Mt(e, t, r) {
+  const n = e.grid, { rowIndex: o, columnIndex: a } = t.address, s = yt(e, o, a), i = [...n.cells], c = [...i[o]], l = q(t, r.value), u = { ...s.cell, value: r.value, text: l, rawText: l };
+  return c[s.sourceColumnIndex] = u, i[o] = c, { ...e, grid: { ...n, cells: i } };
 }
-function xn(e, t) {
+function bn(e, t) {
   const r = e.table?.columnKeys, n = t.table?.columnKey;
   return r && n !== void 0 ? r.flatMap((o, a) => o === n ? [a] : []) : [];
 }
-function Cn(e, t, r, n, o, a) {
+function vn(e, t, r, n, o, a) {
   const s = t.table, i = o.table;
   if (!s || !i || s.id !== i.id || s.role !== i.role || !t.grid) return t;
   const c = i.rowIndex - s.rowIndex;
   if (c < 0 || c >= t.grid.cells.length) return t;
   let l = t;
-  for (const d of xn(t, o)) {
-    const f = $e(e, { pageIndex: r, componentIndex: n, rowIndex: c, columnIndex: d });
-    f?.editable && Sn(o, f) && (l = St(l, f, a));
+  for (const u of bn(t, o)) {
+    const f = Re(e, { pageIndex: r, componentIndex: n, rowIndex: c, columnIndex: u });
+    f?.editable && yn(o, f) && (l = Mt(l, f, a));
   }
   return l;
 }
-function kn(e, t, r, n, o, a) {
+function Mn(e, t, r, n, o, a) {
   const s = o.address;
-  return o.table?.columnKey !== void 0 ? Cn(e, t, r, n, o, a) : s.pageIndex === r && s.componentIndex === n ? St(t, o, a) : t;
+  return o.table?.columnKey !== void 0 ? vn(e, t, r, n, o, a) : s.pageIndex === r && s.componentIndex === n ? Mt(t, o, a) : t;
 }
 function Ie(e, t) {
   const r = t.source;
@@ -1161,21 +1121,21 @@ function Ie(e, t) {
   const n = e.source;
   return !n || ["sourceScope", "datasetId", "rowKey", "field", "revision", "sourceToken"].some((o) => !Object.is(n[o], r[o]));
 }
-function yo(e, t) {
-  const r = $e(e, t.address);
+function go(e, t) {
+  const r = Re(e, t.address);
   if (!r) throw new M("missing");
   if (!r.editable) throw new M("readonly");
   if (Ie(r, t)) throw new M("conflict");
   if (!Object.is(r.value, t.previousValue) || (r.cell.text ?? "") !== t.previousText) throw new M("conflict");
-  const n = Mt(r, t.value), o = { ...t, value: n, text: q(r, n) };
+  const n = vt(r, t.value), o = { ...t, value: n, text: q(r, n) };
   if (Object.is(n, r.value) && o.text === r.cell.text) return e;
   const a = e.pages.map((s, i) => {
-    const c = s.components.map((l, d) => kn(e, l, i, d, r, o));
-    return c.every((l, d) => l === s.components[d]) ? s : { ...s, components: c };
+    const c = s.components.map((l, u) => Mn(e, l, i, u, r, o));
+    return c.every((l, u) => l === s.components[u]) ? s : { ...s, components: c };
   });
   return { ...e, pages: a };
 }
-function xt(e) {
+function St(e) {
   const t = [];
   for (const r of e.template.pages) for (const n of r.components)
     n.kind === "list" && (t.push(n.tree ? { ...n, rowKey: n.tree.idField } : n), n.detail && t.push({ ...n.detail, relation: { detail: n.detail, parentRows: e.datasets[n.dataset] ?? [] } }));
@@ -1184,34 +1144,34 @@ function xt(e) {
 function B(e) {
   return JSON.stringify([e.sourceScope, e.datasetId]);
 }
-function Be(e) {
+function De(e) {
   return JSON.stringify([e.sourceScope, e.datasetId, e.rowKey]);
 }
-function Ct(e) {
+function xt(e) {
   const t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set();
   return e.forEach((n, o) => {
-    for (const a of xt(n)) {
+    for (const a of St(n)) {
       if (!a.rowKey) continue;
       const s = a.relation, i = s ? new Set(s.parentRows.map((c) => JSON.stringify(c[s.detail.parentKey]))) : void 0;
       (n.datasets[a.dataset] ?? []).forEach((c, l) => {
         if (s && !i.has(JSON.stringify(c[s.detail.foreignKey]))) return;
-        const d = c[a.rowKey];
-        if (typeof d != "string" && typeof d != "number") return;
+        const u = c[a.rowKey];
+        if (typeof u != "string" && typeof u != "number") return;
         const f = `${o}:${a.dataset}:${l}:${a.rowKey}`;
         if (r.has(f)) return;
         r.add(f);
-        const u = Be({ sourceScope: n.sourceScope, datasetId: a.dataset, rowKey: d }), h = t.get(u) ?? [];
-        h.push({ partIndex: o, dataset: a.dataset, rowIndex: l, row: c, binding: a }), t.set(u, h);
+        const d = De({ sourceScope: n.sourceScope, datasetId: a.dataset, rowKey: u }), h = t.get(d) ?? [];
+        h.push({ partIndex: o, dataset: a.dataset, rowIndex: l, row: c, binding: a }), t.set(d, h);
       });
     }
   }), (n) => {
-    const o = t.get(Be(n));
+    const o = t.get(De(n));
     if (!o?.length) throw new M("missing");
     if (new Set(o.map((a) => `${a.partIndex}:${a.dataset}`)).size !== o.length) throw new M("conflict");
     return o;
   };
 }
-function kt(e, t) {
+function Ct(e, t) {
   const r = e.map((o) => ({ ...o, datasets: { ...o.datasets } })), n = /* @__PURE__ */ new Set();
   for (const { row: o, field: a, value: s } of t) {
     const i = r[o.partIndex], c = JSON.stringify([o.partIndex, o.dataset]);
@@ -1223,26 +1183,26 @@ function kt(e, t) {
   }
   return r;
 }
-function Tn(e, t, r) {
+function Sn(e, t, r) {
   const n = [], o = /* @__PURE__ */ new Set();
   return e.forEach((a, s) => {
-    for (const i of xt(a))
+    for (const i of St(a))
       t.has(B({ sourceScope: a.sourceScope, datasetId: i.dataset })) && (a.datasets[i.dataset] ?? []).forEach((c, l) => {
-        const d = { partIndex: s, dataset: i.dataset, rowIndex: l, row: c, binding: i };
-        for (const [f, u] of [[i.revisionField, r.revision], [i.sourceTokenField, r.sourceToken]]) {
-          if (!f || u === void 0) continue;
+        const u = { partIndex: s, dataset: i.dataset, rowIndex: l, row: c, binding: i };
+        for (const [f, d] of [[i.revisionField, r.revision], [i.sourceTokenField, r.sourceToken]]) {
+          if (!f || d === void 0) continue;
           const h = `${s}:${i.dataset}:${l}:${f}`;
-          o.has(h) || (o.add(h), n.push({ row: d, field: f, value: u }));
+          o.has(h) || (o.add(h), n.push({ row: u, field: f, value: d }));
         }
       });
   }), n;
 }
-function Pn(e, t, r) {
+function xn(e, t, r) {
   if (!r || r.revision === void 0 && r.sourceToken === void 0) return e;
   const n = new Set(t.edits.flatMap((o) => o.source ? [B(o.source)] : []));
-  return Tt(e, new Map([...n].map((o) => [o, r])));
+  return kt(e, new Map([...n].map((o) => [o, r])));
 }
-function Tt(e, t) {
+function kt(e, t) {
   if (!t.size) return e;
   function r(a) {
     const s = a.datasetId && t.get(B({ ...a, datasetId: a.datasetId }));
@@ -1250,14 +1210,14 @@ function Tt(e, t) {
   }
   function n(a) {
     const s = a.map((i) => {
-      const c = i.table?.source ? r(i.table.source) : void 0, l = i.table && c !== i.table.source ? { ...i.table, source: c } : i.table, d = i.grid?.cells.map((u) => {
-        const h = u.map((m) => {
+      const c = i.table?.source ? r(i.table.source) : void 0, l = i.table && c !== i.table.source ? { ...i.table, source: c } : i.table, u = i.grid?.cells.map((d) => {
+        const h = d.map((m) => {
           if (!m) return m;
-          const v = m.source ? r(m.source) : void 0, y = m.children ? n(m.children) : void 0;
-          return v === m.source && y === m.children ? m : { ...m, source: v, children: y };
+          const v = m.source ? r(m.source) : void 0, p = m.children ? n(m.children) : void 0;
+          return v === m.source && p === m.children ? m : { ...m, source: v, children: p };
         });
-        return h.some((m, v) => m !== u[v]) ? h : u;
-      }), f = i.grid && d?.some((u, h) => u !== i.grid.cells[h]) ? { ...i.grid, cells: d } : i.grid;
+        return h.some((m, v) => m !== d[v]) ? h : d;
+      }), f = i.grid && u?.some((d, h) => d !== i.grid.cells[h]) ? { ...i.grid, cells: u } : i.grid;
       return l !== i.table || f !== i.grid ? { ...i, table: l, grid: f } : i;
     });
     return s.some((i, c) => i !== a[c]) ? s : a;
@@ -1268,33 +1228,33 @@ function Tt(e, t) {
   });
   return o.some((a, s) => a !== e.pages[s]) ? { ...e, pages: o } : e;
 }
-function En(e) {
+function Cn(e) {
   return JSON.stringify([e.pageIndex, e.componentIndex, e.rowIndex, e.columnIndex]);
 }
-function Ge(e) {
+function Be(e) {
   const t = e.table;
-  return t?.columnKey !== void 0 ? JSON.stringify([t.id, t.role, t.rowIndex, t.columnKey]) : En(e.address);
+  return t?.columnKey !== void 0 ? JSON.stringify([t.id, t.role, t.rowIndex, t.columnKey]) : Cn(e.address);
 }
-function Rn(e, t) {
+function kn(e, t) {
   if (!t.length) return e;
-  const r = new Map(t.map((c) => [Ge(c), c])), n = new Set(t.flatMap((c) => c.table ? [c.table.id] : [])), o = new Set(t.map((c) => `${c.address.pageIndex}:${c.address.componentIndex}`)), a = D(e);
-  function s(c, l, d) {
+  const r = new Map(t.map((c) => [Be(c), c])), n = new Set(t.flatMap((c) => c.table ? [c.table.id] : [])), o = new Set(t.map((c) => `${c.address.pageIndex}:${c.address.componentIndex}`)), a = D(e);
+  function s(c, l, u) {
     const f = c.grid;
-    if (!f || !o.has(`${l}:${d}`) && !n.has(c.table?.id ?? "")) return c;
-    const u = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map();
-    for (const m of re(f, c.widthMm, c.heightMm).cells) {
+    if (!f || !o.has(`${l}:${u}`) && !n.has(c.table?.id ?? "")) return c;
+    const d = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Map();
+    for (const m of te(f, c.widthMm, c.heightMm).cells) {
       const v = h.get(m.ri) ?? 0;
       h.set(m.ri, v + 1);
-      const y = a({ pageIndex: l, componentIndex: d, rowIndex: m.ri, columnIndex: m.ci }), g = y && r.get(Ge(y));
-      if (!g || !y.editable) continue;
-      const w = u.get(m.ri) ?? [...f.cells[m.ri]], x = q(y, g.value);
-      Object.is(y.value, g.value) && x === y.cell.text || (w[v] = { ...m.cell, value: g.value, text: x, rawText: x }, u.set(m.ri, w));
+      const p = a({ pageIndex: l, componentIndex: u, rowIndex: m.ri, columnIndex: m.ci }), w = p && r.get(Be(p));
+      if (!w || !p.editable) continue;
+      const y = d.get(m.ri) ?? [...f.cells[m.ri]], x = q(p, w.value);
+      Object.is(p.value, w.value) && x === p.cell.text || (y[v] = { ...m.cell, value: w.value, text: x, rawText: x }, d.set(m.ri, y));
     }
-    return u.size ? { ...c, grid: { ...f, cells: f.cells.map((m, v) => u.get(v) ?? m) } } : c;
+    return d.size ? { ...c, grid: { ...f, cells: f.cells.map((m, v) => d.get(v) ?? m) } } : c;
   }
   const i = e.pages.map((c, l) => {
-    const d = c.components.map((f, u) => s(f, l, u));
-    return d.every((f, u) => f === c.components[u]) ? c : { ...c, components: d };
+    const u = c.components.map((f, d) => s(f, l, d));
+    return u.every((f, d) => f === c.components[d]) ? c : { ...c, components: u };
   });
   return i.every((c, l) => c === e.pages[l]) ? e : { ...e, pages: i };
 }
@@ -1306,19 +1266,19 @@ function F(e) {
   const n = e.address;
   return JSON.stringify([n.pageIndex, n.componentIndex, n.rowIndex, n.columnIndex]);
 }
-function bo(e, t, r) {
+function po(e, t, r) {
   if (typeof r != "string" || !r.trim() || !Array.isArray(t)) throw new M("missing");
   if (t.length > 1e4) throw new M("limit");
   const n = /* @__PURE__ */ new Set(), o = D(e), a = t.map(({ address: s, value: i }) => {
     const c = o(s);
     if (!c) throw new M("missing");
-    const l = U(c, i), d = F(l);
-    if (n.has(d)) throw new M("duplicate");
-    return n.add(d), l;
+    const l = U(c, i), u = F(l);
+    if (n.has(u)) throw new M("duplicate");
+    return n.add(u), l;
   });
   return { requestId: r, edits: a };
 }
-function vo(e, t) {
+function wo(e, t) {
   if (t.edits.length > 1e4) throw new M("limit");
   const r = D(e), n = /* @__PURE__ */ new Set(), o = t.edits.map((a) => {
     const s = r(a.address);
@@ -1328,9 +1288,9 @@ function vo(e, t) {
     if (n.add(i), Ie(s, a) || !Object.is(s.value, a.previousValue) || (s.cell.text ?? "") !== a.previousText) throw new M("conflict");
     return U(s, a.value);
   });
-  return Rn(e, o);
+  return kn(e, o);
 }
-function Mo(e) {
+function yo(e) {
   const t = /* @__PURE__ */ new Map();
   for (const r of e) {
     const n = F(r), o = t.get(n), a = o ? { ...r, previousValue: o.previousValue, previousText: o.previousText } : { ...r };
@@ -1338,7 +1298,7 @@ function Mo(e) {
   }
   return [...t.values()];
 }
-function Pt(e) {
+function Tt(e) {
   const t = /* @__PURE__ */ new Map(), r = D(e);
   return e.pages.forEach((n, o) => n.components.forEach((a, s) => {
     if (!(!a.grid || a.table?.role !== "body"))
@@ -1348,23 +1308,23 @@ function Pt(e) {
       }
   })), t;
 }
-function So(e, t, r) {
-  const n = Pt(e), o = D(e);
+function bo(e, t, r) {
+  const n = Tt(e), o = D(e);
   return t.map((a) => {
     const s = a.source ? n.get(F(a)) : o(a.address);
     if (!s || F(s) !== F(a)) throw new M("missing");
     return { address: { ...s.address }, value: a[r] };
   });
 }
-function Et(e, t) {
+function Pt(e, t) {
   if (++e.nodes > 1e6 || t > 128) throw new M("limit");
 }
-function ee(e, t) {
+function Z(e, t) {
   const r = Object.getOwnPropertyDescriptor(e, t);
   if (!r || r.get || r.set) throw new M("conflict");
   return r.value;
 }
-function Fe(e) {
+function $e(e) {
   if (Object.getOwnPropertyDescriptor(e, "toJSON")) throw new M("conflict");
   const t = Object.getPrototypeOf(e);
   if (Array.isArray(e) && (t !== Array.prototype || Object.keys(e).length !== e.length)) throw new M("conflict");
@@ -1375,12 +1335,12 @@ function Fe(e) {
       if (e instanceof Date || Array.isArray(e) && !/^(0|[1-9]\d*)$/.test(r)) throw new M("conflict");
     }
 }
-function Rt(e, t, r, n, o) {
-  if (Et(n, o), typeof e == "function" || typeof e == "symbol") throw new M("conflict");
+function Et(e, t, r, n, o) {
+  if (Pt(n, o), typeof e == "function" || typeof e == "symbol") throw new M("conflict");
   if (e === null || typeof e != "object") return;
-  if (Fe(e), r.has(e)) throw new M("conflict");
+  if ($e(e), r.has(e)) throw new M("conflict");
   r.add(e);
-  const a = Object.keys(e), s = a.map((i) => ee(e, i));
+  const a = Object.keys(e), s = a.map((i) => Z(e, i));
   t.push({
     object: e,
     prototype: Object.getPrototypeOf(e),
@@ -1389,56 +1349,56 @@ function Rt(e, t, r, n, o) {
     ...e instanceof Date ? { date: Date.prototype.getTime.call(e) } : {},
     ...Array.isArray(e) ? { length: e.length } : {}
   });
-  for (const i of s) Rt(i, t, r, n, o + 1);
+  for (const i of s) Et(i, t, r, n, o + 1);
   r.delete(e);
 }
-function $n(e) {
+function Tn(e) {
   const { object: t, keys: r, values: n } = e;
-  if (Fe(t), Object.getPrototypeOf(t) !== e.prototype || Object.getOwnPropertyDescriptor(t, "toJSON") || e.date !== void 0 && !Object.is(Date.prototype.getTime.call(t), e.date) || e.length !== void 0 && t.length !== e.length) return !1;
+  if ($e(t), Object.getPrototypeOf(t) !== e.prototype || Object.getOwnPropertyDescriptor(t, "toJSON") || e.date !== void 0 && !Object.is(Date.prototype.getTime.call(t), e.date) || e.length !== void 0 && t.length !== e.length) return !1;
   const o = Object.keys(t);
-  return o.length === r.length && r.every((a, s) => o[s] === a && Object.is(ee(t, a), n[s]));
+  return o.length === r.length && r.every((a, s) => o[s] === a && Object.is(Z(t, a), n[s]));
 }
-function In(e) {
+function Pn(e) {
   const t = [];
-  return Rt(e, t, /* @__PURE__ */ new Set(), { nodes: 0 }, 0), () => {
+  return Et(e, t, /* @__PURE__ */ new Set(), { nodes: 0 }, 0), () => {
     try {
-      return t.every($n);
+      return t.every(Tn);
     } catch {
       return !1;
     }
   };
 }
-function te(e, t, r, n = !1) {
-  if (Et(t, r), n) {
+function ee(e, t, r, n = !1) {
+  if (Pt(t, r), n) {
     if (typeof e == "function" || typeof e == "symbol") throw new M("conflict");
-    e !== null && typeof e == "object" && Fe(e);
+    e !== null && typeof e == "object" && $e(e);
   }
   if (e === null || typeof e != "object") return e;
   if (e instanceof Date) return new Date(Date.prototype.getTime.call(e));
   if (Array.isArray(e)) {
     const o = [];
-    for (let a = 0; a < e.length; a++) o[a] = te(ee(e, String(a)), t, r + 1, n);
+    for (let a = 0; a < e.length; a++) o[a] = ee(Z(e, String(a)), t, r + 1, n);
     return o;
   }
-  return Object.fromEntries(Object.keys(e).map((o) => [o, te(ee(e, o), t, r + 1, n)]));
+  return Object.fromEntries(Object.keys(e).map((o) => [o, ee(Z(e, o), t, r + 1, n)]));
 }
-function Fn(e) {
-  return te(e, { nodes: 0 }, 0, !0);
+function En(e) {
+  return ee(e, { nodes: 0 }, 0, !0);
 }
-function On(e) {
-  const t = te(e, { nodes: 0 }, 0);
-  for (const r of t) for (const n of Object.values(r.datasets)) _t(n);
+function Rn(e) {
+  const t = ee(e, { nodes: 0 }, 0);
+  for (const r of t) for (const n of Object.values(r.datasets)) Jt(n);
   return t;
 }
-async function An(e, t, r = {}) {
-  return (await $t(e, t, r)).plan;
+async function In(e, t, r = {}) {
+  return (await Rt(e, t, r)).plan;
 }
-async function $t(e, t, r = {}) {
-  return ht(e, t, { ...r, knownTotalPages: void 0 });
+async function Rt(e, t, r = {}) {
+  return mt(e, t, { ...r, knownTotalPages: void 0 });
 }
-const ge = /* @__PURE__ */ new WeakMap();
-function xo(e) {
-  return ge.get(e);
+const he = /* @__PURE__ */ new WeakMap();
+function vo(e) {
+  return he.get(e);
 }
 function X(e) {
   if (e?.aborted) {
@@ -1449,7 +1409,7 @@ function X(e) {
 function It(e, t) {
   return e[t] === void 0 ? "" : e[t];
 }
-function Nn(e, t) {
+function $n(e, t) {
   if (t.edits.length > 1e4) throw new M("limit");
   const r = D(e), n = /* @__PURE__ */ new Set(), o = [], a = t.edits.map((s) => {
     const i = r(s.address);
@@ -1461,8 +1421,8 @@ function Nn(e, t) {
   });
   return { batch: { requestId: t.requestId, edits: a }, contexts: o };
 }
-function jn(e, t) {
-  const r = Ct(e);
+function Fn(e, t) {
+  const r = xt(e);
   return t.flatMap((n) => {
     if (!n.source) throw new M("missing");
     return r(n.source).map((o) => {
@@ -1472,16 +1432,16 @@ function jn(e, t) {
     });
   });
 }
-function fe(e, t, r) {
+function de(e, t, r) {
   const n = { ...e, value: t, source: { ...e.source, ...r?.revision === void 0 ? {} : { revision: r.revision }, ...r?.sourceToken === void 0 ? {} : { sourceToken: r.sourceToken } } };
   return n.cell = { ...e.cell, value: n.value, text: q(n, n.value) }, n;
 }
-function Kn(e, t, r) {
+function On(e, t, r) {
   if (!r || r.revision === void 0 && r.sourceToken === void 0) return [...e];
   const n = new Set(t.edits.flatMap((o) => o.source ? [B(o.source)] : []));
-  return kt(e, Tn(e, n, r));
+  return Ct(e, Sn(e, n, r));
 }
-function Ln(e, t, r) {
+function An(e, t, r) {
   const n = new Set(t.edits.map((o) => B(o.source)));
   for (const o of n) e.set(o, {
     ...e.get(o),
@@ -1490,74 +1450,74 @@ function Ln(e, t, r) {
   });
   return n;
 }
-function Ft(e, t) {
+function $t(e, t) {
   let r = t.parts;
   const n = t.rebuild, o = [...t.validationFormulas ?? []];
-  let a = In(r), s = e, i;
+  let a = Pn(r), s = e, i;
   const c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Map();
-  function d(h) {
+  function u(h) {
     if (h !== s) throw new M("conflict");
     if (i) return i;
     if (!a?.()) throw new M("conflict");
-    return On(r);
-  }
-  async function f(h, m, v, y = {}) {
-    X(y.signal), m = { requestId: m.requestId, edits: m.edits.map((b) => ({ ...b, address: { ...b.address }, source: b.source ? { ...b.source } : void 0, table: b.table ? { ...b.table } : void 0 })) }, v = v.map((b) => ({ ...b, address: { ...b.address }, source: b.source ? { ...b.source } : void 0, table: b.table ? { ...b.table } : void 0, cell: { ...b.cell } })), await new Promise((b) => setTimeout(b, 0)), X(y.signal);
-    const g = d(h), w = kt(g, jn(g, m.edits)), x = Tt(await n(w, y.signal), l);
-    X(y.signal);
-    let E = !1, k = [], O = "allow", A = !1;
-    function p(b) {
-      return A = !0, k = Object.freeze(fn(w, b, y.signal, o).map((S) => Object.freeze({ ...S }))), A = !1, O = b.warningPolicy ?? "allow", k;
+    return Rn(r);
+  }
+  async function f(h, m, v, p = {}) {
+    X(p.signal), m = { requestId: m.requestId, edits: m.edits.map((b) => ({ ...b, address: { ...b.address }, source: b.source ? { ...b.source } : void 0, table: b.table ? { ...b.table } : void 0 })) }, v = v.map((b) => ({ ...b, address: { ...b.address }, source: b.source ? { ...b.source } : void 0, table: b.table ? { ...b.table } : void 0, cell: { ...b.cell } })), await new Promise((b) => setTimeout(b, 0)), X(p.signal);
+    const w = u(h), y = Ct(w, Fn(w, m.edits)), x = kt(await n(y, p.signal), l);
+    X(p.signal);
+    let k = !1, T = [], O = "allow", A = !1;
+    function g(b) {
+      return A = !0, T = Object.freeze(cn(y, b, p.signal, o).map((S) => Object.freeze({ ...S }))), A = !1, O = b.warningPolicy ?? "allow", T;
     }
-    return y.validation && p(y.validation), { plan: x, get validationIssues() {
-      return k;
-    }, validate: p, commit(b) {
-      if (X(y.signal), E || s !== h) throw new M("conflict");
+    return p.validation && g(p.validation), { plan: x, get validationIssues() {
+      return T;
+    }, validate: g, commit(b) {
+      if (X(p.signal), k || s !== h) throw new M("conflict");
       if (b?.conflicts?.length) throw new M("conflict");
       if (A) throw new Error("候选规则校验未完成，不能提交");
-      un(k, O);
-      const S = Kn(w, m, b), P = Pn(x, m, b);
+      sn(T, O);
+      const S = On(y, m, b), E = xn(x, m, b);
       if (b) {
-        const T = Ln(l, m, b);
-        for (const [R, L] of c) T.has(B(L.source)) && c.set(R, fe(L, L.value, b));
+        const P = An(l, m, b);
+        for (const [R, L] of c) P.has(B(L.source)) && c.set(R, de(L, L.value, b));
       }
-      return v.forEach((T, R) => c.set(F(T), fe(T, m.edits[R].value, b))), E = !0, i = S, r = void 0, a = void 0, s = P, ge.set(s, u), s;
+      return v.forEach((P, R) => c.set(F(P), de(P, m.edits[R].value, b))), k = !0, i = S, r = void 0, a = void 0, s = E, he.set(s, d), s;
     } };
   }
-  const u = {
+  const d = {
     get plan() {
       return s;
     },
     async prepare(h, m, v) {
-      const y = Nn(h, m);
-      return f(h, y.batch, y.contexts, v);
+      const p = $n(h, m);
+      return f(h, p.batch, p.contexts, v);
     },
-    async prepareHistory(h, m, v, y, g) {
-      if (!y.trim() || m.length > 1e4) throw new M("limit");
-      const w = d(h), x = Ct(w), E = Pt(h), k = /* @__PURE__ */ new Set(), A = m.map((S) => {
+    async prepareHistory(h, m, v, p, w) {
+      if (!p.trim() || m.length > 1e4) throw new M("limit");
+      const y = u(h), x = xt(y), k = Tt(h), T = /* @__PURE__ */ new Set(), A = m.map((S) => {
         if (!S.source) throw new M("missing");
-        const P = F(S);
-        if (k.has(P)) throw new M("duplicate");
-        k.add(P);
-        const T = E.get(P) ?? c.get(P);
-        if (!T?.source) throw new M("missing");
-        const R = x(T.source)[0];
-        return fe(T, It(R.row, T.source.field));
-      }).map((S, P) => ({ context: S, edit: U(S, m[P][v]) })).filter(({ edit: S }) => !Object.is(S.previousValue, S.value)), p = { requestId: y, edits: A.map(({ edit: S }) => S) }, b = A.map(({ context: S }) => S);
-      return { batch: p, contexts: b, prepared: await f(h, p, b, g) };
+        const E = F(S);
+        if (T.has(E)) throw new M("duplicate");
+        T.add(E);
+        const P = k.get(E) ?? c.get(E);
+        if (!P?.source) throw new M("missing");
+        const R = x(P.source)[0];
+        return de(P, It(R.row, P.source.field));
+      }).map((S, E) => ({ context: S, edit: U(S, m[E][v]) })).filter(({ edit: S }) => !Object.is(S.previousValue, S.value)), g = { requestId: p, edits: A.map(({ edit: S }) => S) }, b = A.map(({ context: S }) => S);
+      return { batch: g, contexts: b, prepared: await f(h, g, b, w) };
     }
   };
-  return ge.set(e, u), u;
+  return he.set(e, d), d;
 }
-function Co(e) {
-  const t = mt(e.template, e.datasets, e.pagination).plan;
-  return Ft(t, { validationFormulas: [e.pagination?.formula], parts: [{ template: e.template, datasets: e.datasets }], rebuild: (r, n) => An(r[0].template, r[0].datasets, { ...e.pagination, signal: n }) });
+function Mo(e) {
+  const t = ft(e.template, e.datasets, e.pagination).plan;
+  return $t(t, { validationFormulas: [e.pagination?.formula], parts: [{ template: e.template, datasets: e.datasets }], rebuild: (r, n) => In(r[0].template, r[0].datasets, { ...e.pagination, signal: n }) });
 }
-let Hn = 0;
-function Dn() {
-  return `report-${Date.now()}-${++Hn}`;
+let Kn = 0;
+function jn() {
+  return `report-${Date.now()}-${++Kn}`;
 }
-function We(e, t, r) {
+function Ge(e, t, r) {
   if (!r?.aborted)
     try {
       const n = e?.({ ...t });
@@ -1566,14 +1526,14 @@ function We(e, t, r) {
     } catch {
     }
 }
-function Bn(e) {
-  const t = e.taskId ?? Dn(), r = (n, o, a) => {
-    We(e.onEvent, { taskId: t, ...e.correlationId === void 0 ? {} : { correlationId: e.correlationId }, stage: n, status: o, ...a === void 0 ? {} : { reportId: a } }, e.signal);
+function Nn(e) {
+  const t = e.taskId ?? jn(), r = (n, o, a) => {
+    Ge(e.onEvent, { taskId: t, ...e.correlationId === void 0 ? {} : { correlationId: e.correlationId }, stage: n, status: o, ...a === void 0 ? {} : { reportId: a } }, e.signal);
   };
   return {
     taskId: t,
     progress(n, o, a) {
-      We(e.onEvent, { taskId: t, ...e.correlationId === void 0 ? {} : { correlationId: e.correlationId }, stage: n, status: "started", completed: o, total: a }, e.signal);
+      Ge(e.onEvent, { taskId: t, ...e.correlationId === void 0 ? {} : { correlationId: e.correlationId }, stage: n, status: "started", completed: o, total: a }, e.signal);
     },
     async run(n, o, a) {
       r(n, "started", a);
@@ -1595,25 +1555,25 @@ function Bn(e) {
     }
   };
 }
-function Ot(e) {
+function Ft(e) {
   if (!e || typeof e != "object" || Array.isArray(e)) return !1;
   const t = e, r = (n) => typeof n == "string" && n.trim().length > 0 && n.length <= 256;
   return !r(t.datasetId) || !r(t.field) || t.tableId !== void 0 && !r(t.tableId) || t.reportScope !== void 0 && (typeof t.reportScope != "string" || !t.reportScope.trim() || t.reportScope.length > 4096) ? !1 : t.rowKey === void 0 ? !0 : typeof t.rowKey == "string" ? t.rowKey.trim().length > 0 && t.rowKey.length <= 1024 : typeof t.rowKey == "number" && Number.isFinite(t.rowKey);
 }
-function Gn(e) {
+function Ln(e) {
   return e === "missing-source" || e === "not-applicable" || e === "not-calculable";
 }
-function Wn(e) {
-  return e.target !== void 0 && !Ot(e.target) ? !1 : e.valueState === void 0 || Gn(e.valueState) && e.target !== void 0;
+function Hn(e) {
+  return e.target !== void 0 && !Ft(e.target) ? !1 : e.valueState === void 0 || Ln(e.valueState) && e.target !== void 0;
 }
-function ko(e, t) {
-  if (et([], e), !Ot(t)) throw new Error("数据说明目标无效");
+function So(e, t) {
+  if (Ze([], e), !Ft(t)) throw new Error("数据说明目标无效");
   const r = e.fields.find((o) => o.field === t.field);
   if (!r) throw new Error("数据说明字段未在契约中声明");
   const n = [];
   return r.description && n.push({ code: "field-definition", severity: "info", message: r.description, target: { ...t } }), r.calculation && n.push({ code: "field-calculation", severity: "info", message: r.calculation.description, target: { ...t } }), n;
 }
-function At(e, t, r = {}) {
+function Ot(e, t, r = {}) {
   const n = /* @__PURE__ */ new Map();
   for (const a of e.pages) for (const s of a.components) {
     if (s.kind !== "list" || s.tree?.input !== "nested") continue;
@@ -1625,26 +1585,26 @@ function At(e, t, r = {}) {
   const o = { ...t };
   for (const [a, s] of n) {
     const i = Math.min(s.maxRows ?? 1e5, r.maxRows ?? 1 / 0);
-    o[a] = Ye(t[a] ?? [], { ...s, maxRows: i }, r.signal);
+    o[a] = Xe(t[a] ?? [], { ...s, maxRows: i }, r.signal);
   }
   return o;
 }
-function To(e, t, r = {}) {
-  return Object.values(At(e, t, r)).reduce((n, o) => n + o.length, 0);
+function xo(e, t, r = {}) {
+  return Object.values(Ot(e, t, r)).reduce((n, o) => n + o.length, 0);
 }
-function Po(e, t, r) {
-  const n = mr(r), o = e?.pages.flatMap((i) => i.components).find((i) => i.kind === "list" && i.dataset === t && i.tree?.input === "nested");
+function Co(e, t, r) {
+  const n = ur(r), o = e?.pages.flatMap((i) => i.components).find((i) => i.kind === "list" && i.dataset === t && i.tree?.input === "nested");
   if (!o || o.kind !== "list" || !o.tree) return n;
   const a = n.items, s = o.tree.childrenField ?? "children";
   return { ...n, items: { $ref: "#/$defs/treeNode" }, $defs: { treeNode: { ...a, properties: { ...a.properties, [s]: { anyOf: [{ type: "null" }, { type: "array", items: { $ref: "#/$defs/treeNode" } }] } } } } };
 }
-function Nt(e, t) {
+function At(e, t) {
   return JSON.stringify([e, t]);
 }
-function jt(e, t, r) {
-  return r === void 0 ? Nt(e, t) : JSON.stringify(["shared", r]);
-}
 function Kt(e, t, r) {
+  return r === void 0 ? At(e, t) : JSON.stringify(["shared", r]);
+}
+function jt(e, t, r) {
   return e.map((n) => {
     const o = n.table ? {
       ...n.table,
@@ -1653,7 +1613,7 @@ function Kt(e, t, r) {
     } : void 0, a = n.grid?.cells.map((s) => s.map((i) => !i || !i.source && !i.children ? i : {
       ...i,
       ...i.source ? { source: { ...i.source, sourceScope: t } } : {},
-      ...i.children ? { children: Kt(i.children, t, r) } : {}
+      ...i.children ? { children: jt(i.children, t, r) } : {}
     }));
     return o || a ? {
       ...n,
@@ -1662,51 +1622,51 @@ function Kt(e, t, r) {
     } : n;
   });
 }
-function pe(e) {
-  return oe(e.maxChartComponents), { maxPages: e.maxPages, maxCells: e.maxCells, maxChartComponents: e.maxChartComponents ?? Ce, usedPages: 0, usedCells: 0, usedChartComponents: 0 };
+function ge(e) {
+  return Se(e.maxChartComponents), { maxPages: e.maxPages, maxCells: e.maxCells, maxChartComponents: e.maxChartComponents ?? Qt, usedPages: 0, usedCells: 0, usedChartComponents: 0 };
 }
-function Vn(e, t) {
+function Dn(e, t) {
   if (!e.repeat) return !1;
   const r = Object.prototype.hasOwnProperty.call(t, e.repeat.dataset) ? t[e.repeat.dataset] : void 0;
   return Array.isArray(r) && r.length === 0;
 }
-function Jn(e) {
+function Bn(e) {
   const t = (r) => r.grid?.cells.reduce((n, o) => n + o.reduce((a, s) => a + (s ? 1 + (s.children?.reduce((i, c) => i + t(c), 0) ?? 0) : 0), 0), 0) ?? 0;
   return e.pages.reduce((r, n) => r + n.components.reduce((o, a) => o + t(a), 0), 0);
 }
-function we(e, t) {
+function pe(e, t) {
   return e === void 0 ? void 0 : e - t;
 }
-function me(e, t) {
+function ue(e, t) {
   return e === void 0 ? t : Math.max(1, Math.min(e, t ?? e));
 }
-function Lt(e, t, r, n, o) {
-  oe(e?.maxChartComponents);
-  const a = we(t.maxPages, t.usedPages), s = t.maxChartComponents - t.usedChartComponents;
-  if (a !== void 0 && a < 1 && r.pages.length && !Vn(r, n)) throw new W(0, 1);
-  if (s < 1 && r.pages.some((i) => i.components.some((c) => c.kind !== "list" && c.chartBinding))) throw new Q(s, 1);
+function Nt(e, t, r, n, o) {
+  Se(e?.maxChartComponents);
+  const a = pe(t.maxPages, t.usedPages), s = t.maxChartComponents - t.usedChartComponents;
+  if (a !== void 0 && a < 1 && r.pages.length && !Dn(r, n)) throw new W(0, 1);
+  if (s < 1 && r.pages.some((i) => i.components.some((c) => c.kind !== "list" && c.chartBinding))) throw new fe(s, 1);
   return {
     ...e,
     signal: o ?? e?.signal,
-    maxPages: me(a, e?.maxPages),
-    maxCells: me(we(t.maxCells, t.usedCells), e?.maxCells),
-    maxChartComponents: me(s, e?.maxChartComponents)
+    maxPages: ue(a, e?.maxPages),
+    maxCells: ue(pe(t.maxCells, t.usedCells), e?.maxCells),
+    maxChartComponents: ue(s, e?.maxChartComponents)
   };
 }
-function Ht(e, t) {
-  const r = Jn(t.plan), n = we(e.maxCells, e.usedCells);
+function Lt(e, t) {
+  const r = Bn(t.plan), n = pe(e.maxCells, e.usedCells);
   if (n !== void 0 && r > n) throw new Y(n, r);
   e.usedPages += t.plan.pages.length, e.usedCells += r, e.usedChartComponents += t.chartComponents;
 }
-function Dt(e, t) {
-  return e instanceof W && t.maxPages !== void 0 && (e.limit === t.maxPages - t.usedPages || e.limit === 0) ? new W(t.maxPages, t.usedPages + e.actual) : e instanceof Y && t.maxCells !== void 0 ? new Y(t.maxCells, t.usedCells + e.actual) : e instanceof Q && e.limit === t.maxChartComponents - t.usedChartComponents ? new Q(t.maxChartComponents, t.usedChartComponents + e.estimated) : e;
+function Ht(e, t) {
+  return e instanceof W && t.maxPages !== void 0 && (e.limit === t.maxPages - t.usedPages || e.limit === 0) ? new W(t.maxPages, t.usedPages + e.actual) : e instanceof Y && t.maxCells !== void 0 ? new Y(t.maxCells, t.usedCells + e.actual) : e instanceof fe && e.limit === t.maxChartComponents - t.usedChartComponents ? new fe(t.maxChartComponents, t.usedChartComponents + e.estimated) : e;
 }
-function Eo(e) {
+function ko(e) {
   if (!("mapData" in e)) return e;
   const { load: t, mapData: r, ...n } = e;
   return { ...n, load: async (o) => {
     const a = await t(o);
-    $(o.signal);
+    I(o.signal);
     try {
       return r(a, o);
     } catch (s) {
@@ -1719,17 +1679,17 @@ class C extends Error {
     super(r), this.name = "ReportSourceError", this.code = t, this.cause = n;
   }
 }
-function de(e) {
+function ce(e) {
   const t = new Error("报表加载已取消");
   return t.name = "AbortError", Object.defineProperty(t, "cause", { value: e.reason }), t;
 }
-function $(e) {
-  if (e?.aborted) throw de(e);
+function I(e) {
+  if (e?.aborted) throw ce(e);
 }
-function ye(e, t) {
+function we(e, t) {
   return t ? new Promise((r, n) => {
     const o = () => t.removeEventListener("abort", a), a = () => {
-      o(), n(de(t));
+      o(), n(ce(t));
     };
     t.addEventListener("abort", a, { once: !0 }), t.aborted && a(), Promise.resolve(e).then(
       (s) => {
@@ -1741,111 +1701,111 @@ function ye(e, t) {
     );
   }) : Promise.resolve(e);
 }
-function zn(e, t) {
+function Gn(e, t) {
   if (!e || typeof e != "object" || Array.isArray(e))
     throw new C("validate", `报表 ${t} 的数据集应为对象`);
   for (const [r, n] of Object.entries(e))
     if (!Array.isArray(n) || n.some((o) => !o || typeof o != "object" || Array.isArray(o)))
       throw new C("validate", `报表 ${t} 的数据集 ${r} 应为对象数组`);
 }
-async function _n(e, t, r) {
+async function Wn(e, t, r) {
   const { reportId: n, signal: o } = t;
   try {
-    const a = await ye(e(t), o);
-    $(o);
-    const s = cr(a);
+    const a = await we(e(t), o);
+    I(o);
+    const s = sr(a);
     if (!s.ok)
       throw new C("validate", `报表 ${n} 模板校验失败：${s.errors.slice(0, 3).map((i) => `${i.path}: ${i.message}`).join("; ")}`);
     return r.push(...s.warnings.map((i) => `${n}: ${i.path}: ${i.message}`)), a;
   } catch (a) {
-    throw o?.aborted ? de(o) : a instanceof C ? a : a instanceof lr ? new C("validate", `报表 ${n} 模板校验失败：${a.message}`, a) : new C("fetch", `报表 ${n} 模板加载失败：${a instanceof Error ? a.message : String(a)}`, a);
+    throw o?.aborted ? ce(o) : a instanceof C ? a : a instanceof ir ? new C("validate", `报表 ${n} 模板校验失败：${a.message}`, a) : new C("fetch", `报表 ${n} 模板加载失败：${a instanceof Error ? a.message : String(a)}`, a);
   }
 }
-async function qn(e, t, r, n) {
+async function Vn(e, t, r, n) {
   const o = t.signal;
   let a;
   try {
-    if (e.load) a = await ye(e.load(t), o);
+    if (e.load) a = await we(e.load(t), o);
     else if (e.provider) {
-      const s = await ye(e.provider.query(t), o);
-      $(o), Un(s, r), a = s.datasets, n?.(r, s);
+      const s = await we(e.provider.query(t), o);
+      I(o), zn(s, r), a = s.datasets, n?.(r, s);
     } else a = e.datasets ?? {};
   } catch (s) {
-    throw o?.aborted ? de(o) : s instanceof C ? s : new C("fetch", `报表 ${r} 取数失败：${s instanceof Error ? s.message : String(s)}`, s);
+    throw o?.aborted ? ce(o) : s instanceof C ? s : new C("fetch", `报表 ${r} 取数失败：${s instanceof Error ? s.message : String(s)}`, s);
   }
-  return $(o), a;
+  return I(o), a;
 }
-function Un(e, t) {
+function zn(e, t) {
   if (!e || typeof e != "object" || Array.isArray(e)) throw new C("validate", `报表 ${t} Provider 应返回 datasets 结果对象`);
   for (const r of ["revision", "sourceToken"])
     if (e[r] !== void 0 && typeof e[r] != "string") throw new C("validate", `报表 ${t} Provider ${r} 应为字符串`);
   if (e.diagnostics !== void 0 && (!Array.isArray(e.diagnostics) || e.diagnostics.some((r) => !r || typeof r.code != "string" || typeof r.message != "string" || !["info", "warning", "error"].includes(r.severity))))
     throw new C("validate", `报表 ${t} Provider diagnostics 不符合结构化诊断契约`);
-  if (e.diagnostics?.some((r) => !Wn(r)))
+  if (e.diagnostics?.some((r) => !Hn(r)))
     throw new C("validate", `报表 ${t} Provider 数据说明缺少有效的字段身份或值状态`);
 }
-function Xn(e, t, r, n, o) {
+function Jn(e, t, r, n, o) {
   try {
-    t = At(n, t, { maxRows: e.dataValidation?.maxRows, signal: o });
+    t = Ot(n, t, { maxRows: e.dataValidation?.maxRows, signal: o });
   } catch (a) {
     throw new C("validate", `报表 ${r} 树形数据无效：${a instanceof Error ? a.message : String(a)}`, a);
   }
   for (const [a, s] of Object.entries(e.dataSchema ?? {})) {
     let i;
     try {
-      i = et(Object.prototype.hasOwnProperty.call(t, a) ? t[a] : void 0, s, { ...e.dataValidation, path: `$.datasets.${a}` });
+      i = Ze(Object.prototype.hasOwnProperty.call(t, a) ? t[a] : void 0, s, { ...e.dataValidation, path: `$.datasets.${a}` });
     } catch (c) {
       throw new C("config", `报表 ${r} 数据集 ${a} 字段契约配置无效`, c);
     }
     if (!i.ok) throw new C("validate", `报表 ${r} 数据集 ${a} 不符合字段契约：${i.issues[0]?.message}`, { issues: i.issues });
   }
 }
-async function Yn(e, t, r, n, o) {
+async function _n(e, t, r, n, o) {
   try {
     let a;
     try {
-      a = Fn(e);
+      a = En(e);
     } catch {
     }
-    const s = a ?? e, i = Lt(t.pagination, n, s.template, s.datasets, o), c = a ? await ht(s.template, s.datasets, i) : mt(s.template, s.datasets, i);
-    return Ht(n, c), { result: c, part: s };
+    const s = a ?? e, i = Nt(t.pagination, n, s.template, s.datasets, o), c = a ? await mt(s.template, s.datasets, i) : ft(s.template, s.datasets, i);
+    return Lt(n, c), { result: c, part: s };
   } catch (a) {
-    $(o);
-    const s = Dt(a, n);
+    I(o);
+    const s = Ht(a, n);
     throw new C("validate", `报表 ${r} 排版失败：${s instanceof Error ? s.message : String(s)}`, s);
   }
 }
-function Bt(e, t, r, n, o) {
+function Dt(e, t, r, n, o) {
   const a = /* @__PURE__ */ new Map(), s = (i) => {
     let c = a.get(i);
     return c === void 0 && (c = JSON.stringify([r, n, i]), a.set(i, c)), c;
   };
   for (const i of t.pages) e.push({
     ...i,
-    meta: { ...i.meta, reportScope: Nt(r, n) },
-    components: Kt(i.components, o ?? jt(r, n), s)
+    meta: { ...i.meta, reportScope: At(r, n) },
+    components: jt(i.components, o ?? Kt(r, n), s)
   });
 }
-async function Qn(e, t, r, n, o) {
-  const a = [], s = pe(n);
-  for (const [l, d] of e.entries()) {
-    $(o);
+async function qn(e, t, r, n, o) {
+  const a = [], s = ge(n);
+  for (const [l, u] of e.entries()) {
+    I(o);
     try {
-      const f = await $t(d.template, d.datasets, Lt(t[l]?.pagination, s, d.template, d.datasets, o));
-      Ht(s, f), Bt(a, f.plan, l, r[l], d.sourceScope);
+      const f = await Rt(u.template, u.datasets, Nt(t[l]?.pagination, s, u.template, u.datasets, o));
+      Lt(s, f), Dt(a, f.plan, l, r[l], u.sourceScope);
     } catch (f) {
-      throw Dt(f, s);
+      throw Ht(f, s);
     }
   }
-  const i = { schemaVersion: be, ...e.some((l) => ke(l.template)) ? { requiresRecalculation: !0 } : {}, pages: a }, c = Ze(i);
+  const i = { schemaVersion: be, ...e.some((l) => Ce(l.template)) ? { requiresRecalculation: !0 } : {}, pages: a }, c = Qe(i);
   if (!c.ok) throw new C("validate", `重算渲染计划校验失败：${c.errors[0]?.message}`);
   return i;
 }
-function Ro(e, t = {}) {
+function To(e, t = {}) {
   if (t.maxPages !== void 0 && (!Number.isSafeInteger(t.maxPages) || t.maxPages < 1)) throw new C("config", "maxPages 应为正安全整数");
   if (t.maxCells !== void 0 && (!Number.isSafeInteger(t.maxCells) || t.maxCells < 1)) throw new C("config", "maxCells 应为正安全整数");
   try {
-    pe(t);
+    ge(t);
   } catch (o) {
     throw new C("config", "maxChartComponents 应为 1..1000000 的安全整数", o);
   }
@@ -1856,128 +1816,155 @@ function Ro(e, t = {}) {
     return a;
   }
   return Object.assign(async ({ reportIds: o, params: a, signal: s, onWarning: i, onQueryResult: c, ...l }) => {
-    $(s);
-    const d = Bn({ ...l, signal: s }), f = [...o], u = { ...a };
+    I(s);
+    const u = Nn({ ...l, signal: s }), f = [...o], d = { ...a };
     if (f.length === 0) throw new C("config", "缺少报表 ID");
-    const h = f.map(r), m = d.runSync("validate", () => h.map((p) => Ae(
-      p.params ?? (typeof p.template == "function" ? [] : p.template.params) ?? [],
-      u
-    ))), v = [], y = [], g = pe(t), w = [];
-    for (const [p, b] of h.entries()) {
-      $(s);
-      const S = f[p], P = { reportId: S, params: m[p], signal: s }, T = typeof b.template == "function" ? await d.run("query", () => _n(b.template, P, w), S) : b.template;
-      P.params = d.runSync("validate", () => Ae(b.params ?? T.params ?? [], P.params), S);
-      const R = await d.run("query", () => qn(b, P, S, (ue, Wt) => c?.(ue, Wt, p)), S);
-      d.runSync("validate", () => {
-        zn(R, S), t.onDatasets?.(S, R, T), Xn(b, R, S, T, s);
-      }, S), $(s);
-      const L = jt(p, S, b.sourceScope), { result: Oe, part: Gt } = await d.run("layout", () => Yn({ template: T, datasets: R, sourceScope: L }, b, S, g, s), S);
-      y.push(Gt), Bt(v, Oe.plan, p, S, L), w.push(...Oe.warnings.map((ue) => `${S}: ${ue}`));
+    const h = f.map(r), m = u.runSync("validate", () => h.map((g) => Oe(
+      g.params ?? (typeof g.template == "function" ? [] : g.template.params) ?? [],
+      d
+    ))), v = [], p = [], w = ge(t), y = [];
+    for (const [g, b] of h.entries()) {
+      I(s);
+      const S = f[g], E = { reportId: S, params: m[g], signal: s }, P = typeof b.template == "function" ? await u.run("query", () => Wn(b.template, E, y), S) : b.template;
+      E.params = u.runSync("validate", () => Oe(b.params ?? P.params ?? [], E.params), S);
+      const R = await u.run("query", () => Vn(b, E, S, (le, Gt) => c?.(le, Gt, g)), S);
+      u.runSync("validate", () => {
+        Gn(R, S), t.onDatasets?.(S, R, P), Jn(b, R, S, P, s);
+      }, S), I(s);
+      const L = Kt(g, S, b.sourceScope), { result: Fe, part: Bt } = await u.run("layout", () => _n({ template: P, datasets: R, sourceScope: L }, b, S, w, s), S);
+      p.push(Bt), Dt(v, Fe.plan, g, S, L), y.push(...Fe.warnings.map((le) => `${S}: ${le}`));
     }
-    $(s);
-    const x = { schemaVersion: be, ...y.some((p) => ke(p.template)) ? { requiresRecalculation: !0 } : {}, pages: v }, E = d.runSync("validate", () => {
-      const p = Ze(x);
-      if (!p.ok) throw new C("validate", `渲染计划校验失败：${p.errors.slice(0, 3).map((b) => `${b.path}: ${b.message}`).join("; ")}`);
-      return p;
+    I(s);
+    const x = { schemaVersion: be, ...p.some((g) => Ce(g.template)) ? { requiresRecalculation: !0 } : {}, pages: v }, k = u.runSync("validate", () => {
+      const g = Qe(x);
+      if (!g.ok) throw new C("validate", `渲染计划校验失败：${g.errors.slice(0, 3).map((b) => `${b.path}: ${b.message}`).join("; ")}`);
+      return g;
     });
-    w.push(...E.warnings.map((p) => `${p.path}: ${p.message}`));
-    const k = h.map((p) => ({ ...p, pagination: { ...p.pagination } })), O = { maxPages: t.maxPages, maxCells: t.maxCells, maxChartComponents: t.maxChartComponents };
+    y.push(...k.warnings.map((g) => `${g.path}: ${g.message}`));
+    const T = h.map((g) => ({ ...g, pagination: { ...g.pagination } })), O = { maxPages: t.maxPages, maxCells: t.maxCells, maxChartComponents: t.maxChartComponents };
     try {
-      Ft(x, { parts: y, validationFormulas: k.map((p) => p.pagination?.formula), rebuild: (p, b) => Qn(p, k, f, O, b) });
+      $t(x, { parts: p, validationFormulas: T.map((g) => g.pagination?.formula), rebuild: (g, b) => qn(g, T, f, O, b) });
     } catch {
-      w.push("来源数据无法建立本地重算口径；当前预览仅支持计划内编辑，请使用可序列化模板数据启用规则重算");
+      y.push("来源数据无法建立本地重算口径；当前预览仅支持计划内编辑，请使用可序列化模板数据启用规则重算");
     }
-    const A = i ?? t.onWarning ?? ((p) => console.warn("[mach-report]", p));
-    for (const p of w)
-      $(s), A(p);
-    return $(s), x;
+    const A = i ?? t.onWarning ?? ((g) => console.warn("[mach-report]", g));
+    for (const g of y)
+      I(s), A(g);
+    return I(s), x;
   }, {
-    getParamDefs: (o) => dr(e, o)
+    getParamDefs: (o) => cr(e, o)
   });
 }
-function $o(e, t) {
+const Un = /* @__PURE__ */ new Set([8, 9, 10, 12, 13]);
+function Xn(e, t) {
+  const r = Array.isArray(e), n = Object.getPrototypeOf(e);
+  if (n !== (r ? Array.prototype : Object.prototype) && !(n === null && !r) || Object.getOwnPropertySymbols(e).length) throw t("input", "快照应为普通 JSON 对象");
+  const o = Object.getOwnPropertyNames(e).filter((a) => !(r && a === "length"));
+  if (r && (o.length !== e.length || o.some((a, s) => a !== String(s)))) throw t("input", "快照数组应为连续数组");
+  return { array: r, keys: o };
+}
+function Yn(e) {
+  if (/^[\u0020-\u007e]*$/.test(e) && !/["\\]/.test(e)) return e.length + 2;
+  let t = 2;
+  for (let r = 0; r < e.length; r++) {
+    const n = e.charCodeAt(r);
+    if (n < 32) t += Un.has(n) ? 2 : 6;
+    else if (n === 34 || n === 92) t += 2;
+    else if (n < 128) t++;
+    else if (n < 2048) t += 2;
+    else if (n >= 55296 && n <= 57343) {
+      const o = e.charCodeAt(r + 1);
+      n <= 56319 && o >= 56320 && o <= 57343 ? (t += 4, r++) : t += 6;
+    } else t += 3;
+  }
+  return t;
+}
+function Po(e, t) {
   const r = t.maxNodes ?? 1e6;
   if (![t.maxBytes, r].every((d) => Number.isSafeInteger(d) && d > 0)) throw t.error("budget", "快照预算应为正安全整数");
   let n = 0, o = 0;
-  const a = /* @__PURE__ */ new Set();
-  function s(d) {
+  const a = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map();
+  function i(d) {
+    if (d.length + 2 > t.maxBytes - o) throw t.error("budget", "快照超过字节预算");
+    const h = s.get(d);
+    if (h !== void 0) return h;
+    const m = Yn(d);
+    return d.length <= 256 && s.size < 4096 && s.set(d, m), m;
+  }
+  function c(d) {
     if (o += d, o > t.maxBytes) throw t.error("budget", "快照超过字节预算");
   }
-  function i(d, f) {
-    if (++n > r || f > 64) throw t.error("budget", "快照节点或深度超过预算");
+  function l(d, h) {
+    if (++n > r || h > 64) throw t.error("budget", "快照节点或深度超过预算");
     if (n % 1024 === 0 && t.check?.(), typeof d == "string")
-      return s(d.length + 2), d;
+      return c(i(d)), d;
     if (d === null || typeof d == "boolean" || typeof d == "number" && Number.isFinite(d))
-      return s(String(d).length), d;
+      return c(String(d).length), typeof d == "number" && Object.is(d, -0) ? 0 : d;
     if (!d || typeof d != "object" || a.has(d)) throw t.error("input", "快照应为无循环的有限 JSON 值");
-    return c(d, f);
-  }
-  function c(d, f) {
-    const u = Array.isArray(d), h = Object.getPrototypeOf(d);
-    if (h !== (u ? Array.prototype : Object.prototype) && !(h === null && !u) || Object.getOwnPropertySymbols(d).length) throw t.error("input", "快照应为普通 JSON 对象");
-    const m = Object.getOwnPropertyNames(d).filter((g) => !(u && g === "length"));
-    if (u && (m.length !== d.length || m.some((g, w) => g !== String(w)))) throw t.error("input", "快照数组应为连续数组");
-    a.add(d), s(2);
-    const v = /* @__PURE__ */ Object.create(null);
-    let y = 0;
-    for (const g of m) {
-      const w = Object.getOwnPropertyDescriptor(d, g);
-      if (w.get || w.set || !w.enumerable || ["__proto__", "constructor", "prototype"].includes(g)) throw t.error("input", "快照不允许访问器或危险键");
-      w.value === void 0 && !u || (s((y++ ? 1 : 0) + (u ? 0 : g.length + 3)), v[g] = i(w.value === void 0 ? null : w.value, f + 1));
+    return u(d, h);
+  }
+  function u(d, h) {
+    const { array: m, keys: v } = Xn(d, t.error);
+    a.add(d), c(2);
+    const p = m ? [] : {};
+    let w = 0;
+    for (const y of v) {
+      const x = Object.getOwnPropertyDescriptor(d, y);
+      if (x.get || x.set || !x.enumerable || ["__proto__", "constructor", "prototype"].includes(y)) throw t.error("input", "快照不允许访问器或危险键");
+      if (x.value === void 0 && !m) continue;
+      c((w++ ? 1 : 0) + (m ? 0 : i(y) + 1));
+      const k = l(x.value === void 0 ? null : x.value, h + 1);
+      y in p ? Object.defineProperty(p, y, { value: k, enumerable: !0, configurable: !0, writable: !0 }) : p[y] = k;
     }
-    return a.delete(d), u ? m.map((g) => v[g]) : v;
+    return a.delete(d), p;
   }
   t.check?.();
-  const l = JSON.stringify(i(e, 0));
-  if (new TextEncoder().encode(l).byteLength > t.maxBytes) throw t.error("budget", "快照超过字节预算");
-  return JSON.parse(l);
+  const f = l(e, 0);
+  return t.check?.(), f;
 }
 export {
-  mt as A,
-  ho as B,
-  xr as C,
-  Er as D,
-  Ft as E,
-  So as F,
-  F as G,
-  Mo as H,
-  po as I,
-  We as J,
-  At as K,
-  To as L,
-  jt as M,
-  Ie as N,
-  U as O,
-  Y as P,
-  Bn as Q,
+  br as A,
+  $t as B,
+  bo as C,
+  Cr as D,
+  F as E,
+  yo as F,
+  mo as G,
+  Ge as H,
+  Ot as I,
+  xo as J,
+  Kt as K,
+  Ie as L,
+  U as M,
+  Nn as N,
+  Co as O,
+  jn as P,
+  At as Q,
   C as R,
-  Po as S,
-  Dn as T,
-  Nt as U,
   M as a,
-  Q as b,
-  W as c,
-  Eo as d,
-  an as e,
-  yo as f,
-  vo as g,
-  Pn as h,
-  Tt as i,
-  un as j,
-  mo as k,
-  wo as l,
-  bo as m,
-  D as n,
-  Co as o,
-  Mt as p,
-  Ro as q,
-  go as r,
-  $o as s,
-  ko as t,
-  q as u,
-  $e as v,
-  xo as w,
-  Wn as x,
-  Ot as y,
-  Gn as z
+  tn as b,
+  go as c,
+  ko as d,
+  wo as e,
+  xn as f,
+  kt as g,
+  sn as h,
+  lo as i,
+  ho as j,
+  po as k,
+  D as l,
+  Mo as m,
+  To as n,
+  fo as o,
+  vt as p,
+  So as q,
+  q as r,
+  Po as s,
+  Re as t,
+  vo as u,
+  Hn as v,
+  Ft as w,
+  Ln as x,
+  ft as y,
+  uo as z
 };