@agile-team/mach-report 2.11.2 → 2.12.0

package/dist/{template-review-BdcXSYbx.js → template-review-BzpcI-tR.js}

@@ -1,40 +1,40 @@
-import { R as Z } from "./render-plan-Ck6koX9L.js";
-import { c as Ee } from "./validate-7s0yn6ii.js";
-import { g as mt } from "./report-params-B44imUd4.js";
-import { e as gt, r as ht, v as pt, a as wt, p as le } from "./template-registry-WNXdkiET.js";
-import { a as Se, d as yt } from "./param-validation-BlHHXs6u.js";
-import { r as me } from "./grid-geometry-BNptEcMm.js";
-import { f as bt, i as vt } from "./number-format-BA_KwrZe.js";
-import { c as Mt } from "./task-events-Dpsvf_t2.js";
-import { d as $t, v as Fe } from "./dataset-H5pFuQGU.js";
-import { c as xt, D as Ie, L as Ae } from "./defaults-DXhiM1ZD.js";
-import { h as St, w as ge } from "./textwrap-DE1kgcJB.js";
-import { e as W, l as he, b as Tt, t as Oe, d as Ke, f as je, g as kt, h as Pt } from "./list-cell-ClFra1zS.js";
-import { d as Ne, b as Rt } from "./computed-Bvk0W15F.js";
-import { e as Ct, a as Et } from "./matrix-yZsGnldA.js";
-import { f as He, a as Ft, c as It } from "./tree-CqcQ99NM.js";
-import { e as K, r as Be } from "./style-CQ1PK8ZB.js";
-import { i as At } from "./capabilities-CK_7hizc.js";
-function Ot(e, t, r) {
+import { R as ee } from "./render-plan-Ck6koX9L.js";
+import { c as Oe } from "./validate-DbgEM1Hh.js";
+import { g as $t } from "./report-params-B44imUd4.js";
+import { e as xt, r as St, f as Tt, v as It, R as Pt, p as de } from "./template-registry-BjE1VS6g.js";
+import { a as Pe, d as kt } from "./param-validation-BlHHXs6u.js";
+import { r as pe } from "./grid-geometry-BNptEcMm.js";
+import { f as Rt, i as Et } from "./number-format-BA_KwrZe.js";
+import { c as Ct } from "./task-events-Dpsvf_t2.js";
+import { d as Ft, v as Ke } from "./dataset-H5pFuQGU.js";
+import { c as At, D as je, L as Ne } from "./defaults-DXhiM1ZD.js";
+import { w as te, h as Le } from "./assets-Q0wUwNrV.js";
+import { R as F, g as He, b as Ot, i as Kt, e as D, l as he, c as jt, t as Be, h as We, f as De, j as Nt, k as Lt } from "./record-bindings-D-5jQlTj.js";
+import { d as Ve, b as Ht } from "./computed-Bvk0W15F.js";
+import { e as Bt, a as Wt } from "./matrix-yZsGnldA.js";
+import { f as Ge, a as Dt, c as Vt } from "./tree-CqcQ99NM.js";
+import { r as we, b as Gt, e as j } from "./style-CQ1PK8ZB.js";
+import { i as zt } from "./capabilities-CK_7hizc.js";
+function Jt(e, t, r) {
   const n = /* @__PURE__ */ new Set(), o = e.cells.map((a, s) => {
-    const l = [];
+    const c = [];
     let i = 0;
-    for (const c of a) {
+    for (const l of a) {
       for (; n.has(`${s}:${i}`); ) i++;
-      const d = c?.colSpan ?? 1, u = c?.rowSpan ?? 1;
+      const d = l?.colSpan ?? 1, u = l?.rowSpan ?? 1;
       let f = 0;
       for (let m = i; m < i + d; m++) {
         t.has(m) && f++;
         for (let w = s + 1; w < s + u; w++)
           n.add(`${w}:${m}`);
       }
-      f && l.push(c ? { ...c, colSpan: f } : null), i += d;
+      f && c.push(l ? { ...l, colSpan: f } : null), i += d;
     }
-    return l;
+    return c;
   });
   return { ...e, cells: o, colWidthsMm: r };
 }
-function Kt(e) {
+function qt(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("列表至少需要一列可见列");
@@ -42,7 +42,7 @@ function Kt(e) {
     ...e,
     columns: r,
     ...e.headerGrid ? {
-      headerGrid: Ot(
+      headerGrid: Jt(
         e.headerGrid,
         t,
         r.map((n) => n.widthMm)
@@ -50,33 +50,33 @@ function Kt(e) {
     } : {}
   };
 }
-function* jt(e) {
+function* _t(e) {
   const { page: t } = e;
-  gt(t.components, t.flow);
+  xt(t.components, t.flow);
   let r = 0, n = 0;
-  for (const o of ht(t.components, t.flow)) {
+  for (const o of St(t.components, t.flow)) {
     e.active();
-    const a = o.band, s = o.components.some((d) => d.kind === "list" && d.cardinality !== "record"), l = s ? 0 : o.components.reduce((d, u) => Math.max(d, u.topMm - a.topMm + (u.kind === "list" ? e.height(u) : u.heightMm)), a.heightMm);
+    const a = o.band, s = o.components.some((d) => d.kind === "list" && d.cardinality !== "record"), c = s ? 0 : o.components.reduce((d, u) => Math.max(d, u.topMm - a.topMm + (u.kind === "list" ? e.height(u) : u.heightMm)), a.heightMm);
     let i = Math.max(e.top(), n + a.topMm - r);
-    if (!s && l > e.bottom() - e.top() + 1e-3) throw new Error(`静态区域 ${a.componentIds.join(",")} 高度超出单页可用范围`);
-    !s && i + l > e.bottom() + 1e-3 && (e.nextPage(), yield* e.takePages(), e.active(), i = e.top());
-    let c = i + l;
+    if (!s && c > e.bottom() - e.top() + 1e-3) throw new Error(`静态区域 ${a.componentIds.join(",")} 高度超出单页可用范围`);
+    !s && i + c > e.bottom() + 1e-3 && (e.nextPage(), yield* e.takePages(), e.active(), i = e.top());
+    let l = i + c;
     for (const d of o.components) {
       const u = i + d.topMm - a.topMm;
       d.kind === "list" ? (yield* e.list(d, u, (f) => {
-        c = s ? f : Math.max(c, f);
+        l = s ? f : Math.max(l, f);
       }), e.active()) : e.append({ ...d, topMm: u });
     }
-    n = c, r = a.topMm + a.heightMm;
+    n = l, r = a.topMm + a.heightMm;
   }
 }
-function Nt(e) {
+function Ut(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));
 }
-function ee(e) {
-  return e.pages.some((t) => t.components.some((r) => r.kind === "list" && Nt(r)));
+function re(e) {
+  return e.pages.some((t) => t.components.some((r) => r.kind === "list" && Ut(r)));
 }
-class L extends Error {
+class H extends Error {
   constructor(t, r) {
     super(`报表页数超出上限 ${t}（至少 ${r} 页）`), this.limit = t, this.actual = r, this.code = "page-limit", this.name = "PaginatePageLimitError";
   }
@@ -86,7 +86,98 @@ class V extends Error {
     super(`报表单元格数量超出上限 ${t}（至少 ${r} 格）`), this.limit = t, this.actual = r, this.code = "cell-limit", this.name = "PaginateCellLimitError";
   }
 }
-function Ht(e) {
+const Yt = 1e4, ke = 25e4;
+function ye(e) {
+  if (e?.aborted) throw e.reason ?? new DOMException("标签生成已取消", "AbortError");
+}
+function ze(e, t, r) {
+  const n = typeof e.copies == "object" ? He(t, e.copies.field, r) : e.copies ?? 1;
+  if (typeof n != "number" || !Number.isSafeInteger(n) || n < 1 || n > 1e3) throw new F(`$.datasets.${r.dataset}[${r.rowIndex}]`, "每条记录复制数必须是 1..1000 的数值型整数", r.rowIndex, typeof e.copies == "object" ? e.copies.field : void 0);
+  return n;
+}
+function Je(e, t, r) {
+  if (e.rowKey === void 0) return;
+  const n = He(t, e.rowKey, r);
+  if (typeof n == "string" && n.trim() || typeof n == "number" && Number.isFinite(n)) return n;
+  throw new F(`$.datasets.${r.dataset}[${r.rowIndex}].${e.rowKey}`, "业务主键必须是非空字符串或有限数字", r.rowIndex, e.rowKey);
+}
+function Xt(e) {
+  const t = (r) => 1 + (r.grid?.cells.reduce((n, o) => n + 1 + o.length + o.reduce((a, s) => a + (s?.children?.reduce((c, i) => c + t(i), 0) ?? 0), 0), 0) ?? 0);
+  return e.pages.reduce((r, n) => r + n.components.reduce((o, a) => o + t(a), 0), 0);
+}
+function Qt(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 F(`$.datasets.${n.dataset}`, "逐记录标签数据集缺失，应提供对象数组（允许空数组）");
+  const a = /* @__PURE__ */ new Set(), s = r.maxPages ?? Yt, c = Xt(e);
+  let i = 0, l = 0;
+  for (const [d, u] of o.entries()) {
+    if (ye(r.signal), !u || typeof u != "object" || Array.isArray(u)) throw new F(`$.datasets.${n.dataset}[${d}]`, "标签记录应为对象", d);
+    const f = { rowIndex: d, dataset: n.dataset }, m = Je(n, u, f);
+    if (m !== void 0) {
+      const g = JSON.stringify([typeof m, m]);
+      if (a.has(g)) throw new F(`$.datasets.${n.dataset}[${d}].${n.rowKey}`, "业务主键重复；请先确认记录来源，避免重复打印标签", d, n.rowKey);
+      a.add(g);
+    }
+    const w = ze(n, u, f);
+    if (i += w * e.pages.length, l += w * c, i > s) throw new H(s, i);
+    if (l > ke) throw new F("$.repeat", `标签组件总量（含网格行、槽位及嵌套组件）超过安全预算 ${ke}，请分批生成`, d);
+  }
+  return o;
+}
+function Zt(e, t, r) {
+  if (!e.binding) return e;
+  const { binding: n, ...o } = e, a = Ot(n, t.row, t);
+  if (e.kind === "image") {
+    if (!a) return;
+    if (!Kt(a)) throw new F(`${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 er(e, t, r) {
+  if (e.kind !== "text" || e.grid || e.richParagraphs?.length) return e;
+  const n = e.style ?? {}, o = we(n).fontSizePt, a = e.text ?? e.lines?.join(`
+`) ?? "";
+  if (a.length > 16384) throw new F(r, "标签文本超过 16384 字符预算，请缩小字段内容", t.rowIndex);
+  const s = te(a, e.widthMm, { fontSizePt: o, bold: n.bold, italic: n.italic, fontFamily: n.fontFamily, letterSpacingPt: n.letterSpacing }, t.options.measurer ?? Le), c = s.length * o * Gt(n) * 25.4 / 72;
+  if (c > e.heightMm + 0.05) throw new F(r, `标签文字需要约 ${c.toFixed(2)}mm 高，超出 ${e.heightMm}mm；请增大文本区域、减少内容或调整字号`, t.rowIndex, e.binding?.field);
+  return { ...e, lines: s };
+}
+function qe(e, t, r) {
+  ye(t.options.signal);
+  const n = Zt(e, t, r);
+  if (!n) return;
+  let o = n.grid;
+  return o && (o = { ...o, cells: o.cells.map((a, s) => a.map((c, i) => c?.children?.length ? { ...c, children: c.children.flatMap((l, d) => {
+    const u = qe(l, t, `${r}.grid.cells.${s}.${i}.children.${d}`);
+    return u ? [u] : [];
+  }) } : c)) }), er(o === n.grid ? n : { ...n, grid: o }, t, r);
+}
+function tr(e, t, r, n, o, a) {
+  return {
+    ...e,
+    components: e.components.flatMap((s, c) => {
+      const i = qe(s, r, `$.pages.${t}.components.${c}`);
+      return i ? [{ ...i, meta: { ...i.meta, labelSource: { pageIndex: t, componentIndex: c } } }] : [];
+    }),
+    meta: { ...e.meta, record: { dataset: r.dataset, rowIndex: r.rowIndex, ...a === void 0 ? {} : { rowKey: a }, copyIndex: n, copyCount: o, templatePageIndex: t } }
+  };
+}
+function* rr(e, t, r) {
+  const n = [];
+  if (Tt(e, n), n.length) throw new F(n[0].path, n[0].message);
+  if (!e.repeat) {
+    for (const [s, c] of e.pages.entries()) yield { page: c, pageIndex: s };
+    return;
+  }
+  const o = e.repeat, a = Qt(e, t, r);
+  for (const [s, c] of a.entries()) {
+    const i = { row: c, rowIndex: s, dataset: o.dataset, options: r }, l = ze(o, c, i), d = Je(o, c, i);
+    for (let u = 0; u < l; u++) for (const [f, m] of e.pages.entries())
+      ye(r.signal), yield { page: tr(m, f, i, u, l, d), pageIndex: f };
+  }
+}
+function nr(e) {
   return {
     widthMm: e.widthMm,
     heightMm: e.heightMm,
@@ -101,60 +192,60 @@ 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 D(e) {
+function z(e) {
   return e.components.reduce((t, r) => r.kind !== "list" && r.pageAnchor === "header" ? Math.max(t, r.topMm + r.heightMm) : t, 0);
 }
-function We(e, t) {
+function _e(e, t) {
   let r = e.textMetrics.get(t);
   if (!r) {
-    const n = Be(t).fontSizePt;
+    const n = we(t).fontSizePt;
     r = {
       measureOptions: {
         fontSizePt: n,
-        fontFamily: t.fontFamily ?? Ie,
+        fontFamily: t.fontFamily ?? je,
         italic: t.italic,
         bold: t.bold,
         letterSpacingPt: t.letterSpacing
       },
-      lineMm: n * (t.lineHeight ?? Ae) * 25.4 / 72
+      lineMm: n * (t.lineHeight ?? Ne) * 25.4 / 72
     }, e.textMetrics.set(t, r);
   }
   return r;
 }
-function Bt(e) {
+function or(e) {
   if (e === null || typeof e == "string" || typeof e == "boolean" || typeof e == "number" && Number.isFinite(e)) return e;
 }
-function pe(e, t) {
-  const r = e.fontSizePt ?? xt, n = e.paddingMm ?? 1, o = e.columns.map((g) => g.align ?? g.style?.align ?? e.align ?? "left"), a = e.columns.map((g, h) => ({
-    ...K({
+function be(e, t) {
+  const r = e.fontSizePt ?? At, n = e.paddingMm ?? 1, o = e.columns.map((g) => g.align ?? g.style?.align ?? e.align ?? "left"), a = e.columns.map((g, p) => ({
+    ...j({
       fontSize: r,
       verticalAlign: "middle"
     }, g.style),
-    align: o[h] === "auto" ? "left" : o[h]
-  })), s = a.map((g, h) => o[h] === "auto" ? { left: g, center: { ...g, align: "center" }, right: { ...g, align: "right" } } : void 0), l = e.columns.map((g, h) => g.rules?.map((v) => {
-    const M = s[h];
+    align: o[p] === "auto" ? "left" : o[p]
+  })), s = a.map((g, p) => o[p] === "auto" ? { left: g, center: { ...g, align: "center" }, right: { ...g, align: "right" } } : void 0), c = e.columns.map((g, p) => g.rules?.map((v) => {
+    const M = s[p];
     if (M) return {
-      left: K(M.left, v.style),
-      center: K(M.center, v.style),
-      right: K(M.right, v.style)
+      left: j(M.left, v.style),
+      center: j(M.center, v.style),
+      right: j(M.right, v.style)
     };
-    const y = K(a[h], v.style);
+    const y = j(a[p], v.style);
     return { left: y, center: y, right: y };
-  })), i = e.columns.map((g) => Tt(e, g)), c = e.columns.map((g) => g.header);
+  })), i = e.columns.map((g) => jt(e, g)), l = e.columns.map((g) => g.header);
   let d = e.rowHeightMm ?? 0;
-  for (let g = 0; g < c.length; g++) {
-    const h = i[g], v = Be(h).fontSizePt, M = ge(
-      c[g],
+  for (let g = 0; g < l.length; g++) {
+    const p = i[g], v = we(p).fontSizePt, M = te(
+      l[g],
       e.columns[g].widthMm - n * 2,
-      { fontSizePt: v, fontFamily: h.fontFamily ?? Ie, italic: h.italic, bold: h.bold, letterSpacingPt: h.letterSpacing },
+      { fontSizePt: v, fontFamily: p.fontFamily ?? je, italic: p.italic, bold: p.bold, letterSpacingPt: p.letterSpacing },
       t
-    ), y = v * (h.lineHeight ?? Ae) * 25.4 / 72;
+    ), y = v * (p.lineHeight ?? Ne) * 25.4 / 72;
     d = Math.max(d, Math.max(M.length, 1) * y + n * 2);
   }
-  const u = c.map((g, h) => ({
+  const u = l.map((g, p) => ({
     text: g,
-    style: i[h]
-  })), f = e.border === !1 ? { borderTop: !1, borderRight: !1, borderBottom: !1, borderLeft: !1 } : { borderBottom: !0, borderLeft: !0, borderRight: !0, borderTop: !0 }, m = e.columns.map((g) => g.widthMm), w = Wt(e.headerGrid, m, {
+    style: i[p]
+  })), f = e.border === !1 ? { borderTop: !1, borderRight: !1, borderBottom: !1, borderLeft: !1 } : { borderBottom: !0, borderLeft: !0, borderRight: !0, borderTop: !0 }, m = e.columns.map((g) => g.widthMm), w = ar(e.headerGrid, m, {
     cells: [u],
     colWidthsMm: m,
     rowHeightsMm: [d],
@@ -165,69 +256,69 @@ function pe(e, t) {
     paddingMm: n,
     cellStyles: a,
     autoStyles: s,
-    ruleStyles: l,
+    ruleStyles: c,
     textMetrics: /* @__PURE__ */ new WeakMap(),
-    numberFormats: e.columns.map((g) => Oe(g.format)),
+    numberFormats: e.columns.map((g) => Be(g.format)),
     derivedFields: new Set(e.computed?.map((g) => g.field)),
     borderStyle: f,
-    headerHeightMm: w.rowHeightsMm.reduce((g, h) => g + h, 0),
+    headerHeightMm: w.rowHeightsMm.reduce((g, p) => g + p, 0),
     headerGrid: w,
     colWidthsMm: m,
     columns: e.columns
   };
 }
-function Wt(e, t, r) {
+function ar(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 Lt(e, t, r) {
+function sr(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 z(e, t, r) {
+function J(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 l = 0; l < n.length; l++) {
-    const i = n[l], c = i.visibleWhen && !W(t, i.visibleWhen) ? null : t[i.field], d = e.autoStyles[l] ? Ke(c, i.format, i.semanticRole) : "left";
-    let u = e.autoStyles[l]?.[d] ?? e.cellStyles[l];
+  for (let c = 0; c < n.length; c++) {
+    const i = n[c], l = i.visibleWhen && !D(t, i.visibleWhen) ? null : t[i.field], d = e.autoStyles[c] ? We(l, i.format, i.semanticRole) : "left";
+    let u = e.autoStyles[c]?.[d] ?? e.cellStyles[c];
     if (i.rules)
       for (let M = 0; M < i.rules.length; M++) {
         const y = i.rules[M];
-        if (W(t, y.when)) {
-          u = e.ruleStyles[l][M][d];
+        if (D(t, y.when)) {
+          u = e.ruleStyles[c][M][d];
           break;
         }
       }
-    const f = i.format ? je(c, i.format) : he(c), m = Vt(e, i, o);
-    u = Gt(e, i, u, o);
-    const w = We(e, u), g = ge(f, Math.max(1, i.widthMm - e.paddingMm * 2 - m), w.measureOptions, r);
+    const f = i.format ? De(l, i.format) : he(l), m = ir(e, i, o);
+    u = cr(e, i, u, o);
+    const w = _e(e, u), g = te(f, Math.max(1, i.widthMm - e.paddingMm * 2 - m), w.measureOptions, r);
     a = Math.max(a, g.length * w.lineMm + e.paddingMm * 2);
-    const h = Bt(c), v = { text: f, style: u };
-    h !== void 0 && (v.value = h), Lt(v, i, e.numberFormats[l]), Dt(v, i, e, o, m), e.derivedFields.has(i.field) && (v.derived = !0, v.editable = !1), i.visibleWhen && c === null && !W(t, i.visibleWhen) && (v.editable = !1), s[l] = v;
+    const p = or(l), v = { text: f, style: u };
+    p !== void 0 && (v.value = p), sr(v, i, e.numberFormats[c]), lr(v, i, e, o, m), e.derivedFields.has(i.field) && (v.derived = !0, v.editable = !1), i.visibleWhen && l === null && !D(t, i.visibleWhen) && (v.editable = !1), s[c] = v;
   }
   return {
     grid: { cells: [s], colWidthsMm: e.colWidthsMm, rowHeightsMm: [a], paddingMm: e.paddingMm },
     heightMm: a
   };
 }
-function Vt(e, t, r) {
-  return !r || t.field !== e.tree.list.tree.labelField ? 0 : kt(e.tree.list, t, r, e.paddingMm);
+function ir(e, t, r) {
+  return !r || t.field !== e.tree.list.tree.labelField ? 0 : Nt(e.tree.list, t, r, e.paddingMm);
 }
-function Gt(e, t, r, n) {
+function cr(e, t, r, n) {
   return !n || t.field !== e.tree.list.tree.labelField || r.align === "left" ? r : { ...r, align: "left" };
 }
-function Dt(e, t, r, n, o = 0) {
-  n && (o && (e.indentMm = o), Pt(e, t, n, r.tree.list));
+function lr(e, t, r, n, o = 0) {
+  n && (o && (e.indentMm = o), Lt(e, t, n, r.tree.list));
 }
-function Le(e) {
+function Ue(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* Ve(e, t, r = 0) {
+function* Ye(e, t, r = 0) {
   const n = t[r];
   if (!n) {
     for (const a of e) yield { kind: "row", row: a };
@@ -235,51 +326,51 @@ function* Ve(e, t, r = 0) {
   }
   const o = /* @__PURE__ */ new Map();
   for (const a of e) {
-    const s = Le(a[n.field]), l = o.get(s);
-    l ? l.push(a) : o.set(s, [a]);
+    const s = Ue(a[n.field]), c = o.get(s);
+    c ? c.push(a) : o.set(s, [a]);
   }
   for (const a of o.values())
-    yield { kind: "groupHeader", label: (n.headerTemplate ?? "{value}").replace(/\{value\}/g, he(a[0][n.field])), firstRow: a[0], group: n, depth: r, rows: a }, yield* Ve(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, he(a[0][n.field])), firstRow: a[0], group: n, depth: r, rows: a }, yield* Ye(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 Ge(e, t, r, n = []) {
+function Xe(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((i) => i.field === a.field)?.format ?? { kind: "number", thousands: !0 }, l = Rt(t, { ...a, field: a.valueField ?? a.field });
-    return [a.field, { text: je(l, s), ...l === null ? {} : { value: l }, ...typeof l == "number" ? { numberFormat: Oe(s) } : {} }];
+    const s = e.find((i) => i.field === a.field)?.format ?? { kind: "number", thousands: !0 }, c = Ht(t, { ...a, field: a.valueField ?? a.field });
+    return [a.field, { text: De(c, s), ...c === null ? {} : { value: c }, ...typeof c == "number" ? { numberFormat: Be(s) } : {} }];
   }));
 }
-function De(e, t) {
+function Qe(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 = [], l = Math.max(0, Math.min(a, e.columns.length)), i = K({ fontSize: e.fontSizePt }, o);
-  l && s.push({ text: r, colSpan: l, style: { bold: !0, ...i } });
-  for (let f = l; f < e.columns.length; f++) {
-    const m = e.columns[f], w = n.get(m.field), g = e.autoStyles[f]?.[Ke(w?.value, m.format)] ?? e.cellStyles[f];
-    s.push({ ...w, text: w?.text ?? "", style: K(g, o) });
+  const s = [], c = Math.max(0, Math.min(a, e.columns.length)), i = j({ fontSize: e.fontSizePt }, o);
+  c && s.push({ text: r, colSpan: c, style: { bold: !0, ...i } });
+  for (let f = c; f < e.columns.length; f++) {
+    const m = e.columns[f], w = n.get(m.field), g = e.autoStyles[f]?.[We(w?.value, m.format)] ?? e.cellStyles[f];
+    s.push({ ...w, text: w?.text ?? "", style: j(g, o) });
   }
-  const c = { text: r, colSpan: e.columns.length, style: { bold: !0, ...i } }, d = l ? [s] : [[c], s], u = d.map((f) => zt(e, f, t));
+  const l = { text: r, colSpan: e.columns.length, style: { bold: !0, ...i } }, d = c ? [s] : [[l], s], u = d.map((f) => dr(e, f, t));
   return {
     grid: { cells: d, colWidthsMm: e.colWidthsMm, rowHeightsMm: u, paddingMm: e.paddingMm },
     heightMm: u.reduce((f, m) => f + m, 0)
   };
 }
-function zt(e, t, r) {
+function dr(e, t, r) {
   let n = e.rowHeightFloorMm, o = 0;
   for (const a of t) {
     let s = 0;
-    const l = o + (a.colSpan ?? 1);
-    for (; o < l; o++) s += e.colWidthsMm[o] ?? 0;
-    const i = We(e, a.style), c = ge(a.text ?? "", s - e.paddingMm * 2, i.measureOptions, r);
-    n = Math.max(n, c.length * i.lineMm + e.paddingMm * 2);
+    const c = o + (a.colSpan ?? 1);
+    for (; o < c; o++) s += e.colWidthsMm[o] ?? 0;
+    const i = _e(e, a.style), l = te(a.text ?? "", s - e.paddingMm * 2, i.measureOptions, r);
+    n = Math.max(n, l.length * i.lineMm + e.paddingMm * 2);
   }
   return n;
 }
-function qt(e, t, r) {
-  const { templatePage: n, current: o, warnings: a, nextId: s, pushCurrent: l } = r, i = () => Q(n, o), c = Math.max(o.marginTopMm, D(n)), d = n.layout === "wide" ? D(n) : c, u = {
+function ur(e, t, r) {
+  const { templatePage: n, current: o, warnings: a, nextId: s, pushCurrent: c } = r, i = () => Q(n, o), l = Math.max(o.marginTopMm, z(n)), d = n.layout === "wide" ? z(n) : l, u = {
     id: r.tableId,
-    columnKeys: e.columns.map((p) => p.field),
+    columnKeys: e.columns.map((h) => h.field),
     ...e.layout === void 0 ? {} : { layout: e.layout },
     ...e.title === void 0 ? {} : { title: e.title }
   }, f = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Map(), w = {
@@ -293,53 +384,53 @@ function qt(e, t, r) {
     table: { ...u, role: "header", rowIndex: -1 },
     style: t.borderStyle,
     ...e.meta ? { meta: e.meta } : {}
-  }, g = (p) => o.components.push({ ...w, topMm: p });
-  if (r.flow && e.header !== !1 && t.headerHeightMm > i() - c + 1e-3) throw new Error(`流式列表 ${e.id ?? e.dataset} 的表头高度超出单页可用范围`);
-  let h = Math.max(r.startTop ?? e.topMm, c);
-  e.header !== !1 && (g(h), h += t.headerHeightMm + r.mmPerRow);
+  }, g = (h) => o.components.push({ ...w, topMm: h });
+  if (r.flow && e.header !== !1 && t.headerHeightMm > i() - l + 1e-3) throw new Error(`流式列表 ${e.id ?? e.dataset} 的表头高度超出单页可用范围`);
+  let p = Math.max(r.startTop ?? e.topMm, l);
+  e.header !== !1 && (g(p), p += t.headerHeightMm + r.mmPerRow);
   function v() {
-    const p = Math.max(r.flow || n.layout === "wide" ? 0 : e.topMm, d);
-    return (e.header !== !1 && e.headerEveryPage !== !1 ? p + t.headerHeightMm : d) + [...m.values()].reduce((x, k) => x + k.heightMm, 0);
+    const h = Math.max(r.flow || n.layout === "wide" ? 0 : e.topMm, d);
+    return (e.header !== !1 && e.headerEveryPage !== !1 ? h + t.headerHeightMm : d) + [...m.values()].reduce((x, I) => x + I.heightMm, 0);
   }
   function M() {
-    const p = n.layout === "wide" ? 0 : o.marginBottomMm;
-    return Math.min(n.heightMm - p, Q(n, o)) - v();
+    const h = n.layout === "wide" ? 0 : o.marginBottomMm;
+    return Math.min(n.heightMm - h, Q(n, o)) - v();
   }
-  function y(p) {
-    if (h + p <= i()) return;
-    l(), o.components = [], o.heightMm = n.heightMm, n.layout === "wide" && (o.marginTopMm = 0, o.marginBottomMm = 0);
+  function y(h) {
+    if (p + h <= i()) return;
+    c(), o.components = [], o.heightMm = n.heightMm, n.layout === "wide" && (o.marginTopMm = 0, o.marginBottomMm = 0);
     const $ = Math.max(r.flow || n.layout === "wide" ? 0 : e.topMm, d);
-    e.header !== !1 && e.headerEveryPage !== !1 ? (g($), h = $ + t.headerHeightMm) : h = d;
-    for (const x of m.values()) A(x, "listgr", "group-header");
+    e.header !== !1 && e.headerEveryPage !== !1 ? (g($), p = $ + t.headerHeightMm) : p = d;
+    for (const x of m.values()) O(x, "listgr", "group-header");
   }
-  function j(p, $, x, k) {
+  function N(h, $, x, I) {
     const P = M();
-    if (r.flow && p.heightMm > P + 1e-3) throw new Error(`流式列表 ${e.id ?? e.dataset} 的单行高度超出单页可用范围`);
-    p.heightMm > P && a.push(`列表 ${e.id ?? e.dataset} 行高 ${p.heightMm.toFixed(2)}mm 超出单页可用高度 ${P.toFixed(2)}mm，预览与打印可能截断内容`), y(p.heightMm), A(p, $, x, k);
+    if (r.flow && h.heightMm > P + 1e-3) throw new Error(`流式列表 ${e.id ?? e.dataset} 的单行高度超出单页可用范围`);
+    h.heightMm > P && a.push(`列表 ${e.id ?? e.dataset} 行高 ${h.heightMm.toFixed(2)}mm 超出单页可用高度 ${P.toFixed(2)}mm，预览与打印可能截断内容`), y(h.heightMm), O(h, $, x, I);
   }
-  function A(p, $, x, k) {
-    const P = p.table?.id ?? u.id, O = x === "header" ? -1 : f.get(P) ?? 0;
-    x !== "header" && f.set(P, O + p.grid.cells.length), o.components.push({
+  function O(h, $, x, I) {
+    const P = h.table?.id ?? u.id, K = x === "header" ? -1 : f.get(P) ?? 0;
+    x !== "header" && f.set(P, K + h.grid.cells.length), o.components.push({
       kind: "rect",
       leftMm: e.leftMm,
-      topMm: h,
+      topMm: p,
       widthMm: e.widthMm,
-      heightMm: p.heightMm,
-      grid: p.grid,
+      heightMm: h.heightMm,
+      grid: h.grid,
       nid: s($),
-      table: { ...u, ...p.table, role: x, rowIndex: O, ...k ? { source: k } : {} },
+      table: { ...u, ...h.table, role: x, rowIndex: K, ...I ? { source: I } : {} },
       style: t.borderStyle,
       ...e.meta ? { meta: e.meta } : {}
-    }), h += p.heightMm;
+    }), p += h.heightMm;
   }
-  function R(p) {
-    p <= M() && y(p);
+  function k(h) {
+    h <= M() && y(h);
   }
-  return { keepTogether: R, placeGridRow: j, setGroupHeader: (p, $) => {
-    $ ? m.set(p, $) : m.delete(p);
-  }, bottom: () => h };
+  return { keepTogether: k, placeGridRow: N, setGroupHeader: (h, $) => {
+    $ ? m.set(h, $) : m.delete(h);
+  }, bottom: () => p };
 }
-function Jt(e, t) {
+function fr(e, t) {
   if (!e.rowKey) return;
   const r = t[e.rowKey];
   if ((typeof r != "string" || !r.trim()) && !(typeof r == "number" && Number.isFinite(r)))
@@ -349,26 +440,26 @@ function Jt(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 te(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 = Jt(e, o), s = JSON.stringify(a.rowKey);
+    const a = fr(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 _t(e, t, r, n, o) {
+function mr(e, t, r, n, o) {
   if (!e.grandTotal) return;
-  const a = typeof e.grandTotal == "object" ? e.grandTotal : void 0, s = re(e)[0], l = a?.fields ?? s?.subtotal ?? [], i = a?.aggregates ?? s?.aggregates ?? [];
-  if (l.length === 0 && i.length === 0) {
+  const a = typeof e.grandTotal == "object" ? e.grandTotal : void 0, s = oe(e)[0], c = a?.fields ?? s?.subtotal ?? [], i = a?.aggregates ?? s?.aggregates ?? [];
+  if (c.length === 0 && i.length === 0) {
     n.warnings.push(`列表 ${e.id ?? ""} 配置了 grandTotal 但未提供合计字段（groupBy.subtotal 或 grandTotal.fields）`);
     return;
   }
-  const c = G(r, n.measurer, a?.label ?? "合计", Ge(e.columns, t, l, i), a?.style ?? {}, De(e.columns, [...l, ...i.map((d) => d.field)]));
-  o.placeGridRow(c, "listgt", "grand-total");
+  const l = G(r, n.measurer, a?.label ?? "合计", Xe(e.columns, t, c, i), a?.style ?? {}, Qe(e.columns, [...c, ...i.map((d) => d.field)]));
+  o.placeGridRow(l, "listgt", "grand-total");
 }
 function q(e) {
   if (e?.aborted) {
@@ -376,147 +467,147 @@ function q(e) {
     throw t.name = "AbortError", t;
   }
 }
-function re(e) {
+function oe(e) {
   const t = e.groups ?? (e.groupBy ? [e.groupBy] : []);
   if (t.length > 16) throw new Error("列表最多支持 16 级分组");
   return t;
 }
-function we(e) {
-  const t = Kt(e), r = t.columns.reduce((o, a) => o + a.widthMm, 0), n = r > t.widthMm ? t.widthMm / r : 1;
+function ve(e) {
+  const t = qt(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 Ut(e, t, r) {
+function gr(e, t, r) {
   const n = e.detail;
   if (!n) return;
   const o = /* @__PURE__ */ new Set();
-  for (const c of t) {
-    const d = ce(c[n.parentKey]);
+  for (const l of t) {
+    const d = ue(l[n.parentKey]);
     if (o.has(d)) throw new Error("主从明细的主表关联键重复");
     o.add(d);
   }
-  const a = r.datasets[n.dataset] ?? [], s = /* @__PURE__ */ new Map(), l = [];
-  for (const c of a) {
-    const d = c[n.foreignKey];
-    if (!ze(d) && n.unmatched === "ignore") continue;
-    const u = ce(d);
+  const a = r.datasets[n.dataset] ?? [], s = /* @__PURE__ */ new Map(), c = [];
+  for (const l of a) {
+    const d = l[n.foreignKey];
+    if (!Ze(d) && n.unmatched === "ignore") continue;
+    const u = ue(d);
     if (!o.has(u)) {
       if (n.unmatched !== "ignore") throw new Error(`明细数据集 ${n.dataset} 存在未关联的业务键`);
       continue;
     }
     const f = s.get(u);
-    f ? f.push(c) : s.set(u, [c]), l.push(c);
+    f ? f.push(l) : s.set(u, [l]), c.push(l);
   }
-  const i = we({ ...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: i, inter: { ...pe(i, r.measurer), rowHeightFloorMm: i.rowHeightMm ?? 0 }, rows: s, sources: te(i, l) };
+  const i = ve({ ...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: i, inter: { ...be(i, r.measurer), rowHeightFloorMm: i.rowHeightMm ?? 0 }, rows: s, sources: ne(i, c) };
 }
-function ze(e) {
+function Ze(e) {
   return typeof e == "string" && !!e.trim() || typeof e == "number" && Number.isFinite(e);
 }
-function ce(e) {
-  if (!ze(e)) throw new Error("主从关联键必须是非空字符串或有限数字");
-  return Le(e);
+function ue(e) {
+  if (!Ze(e)) throw new Error("主从关联键必须是非空字符串或有限数字");
+  return Ue(e);
 }
-function* Yt(e, t, r, n, o) {
+function* pr(e, t, r, n, o) {
   if (!r) return;
-  const a = r.rows.get(ce(t[e.detail.parentKey])) ?? [];
+  const a = r.rows.get(ue(t[e.detail.parentKey])) ?? [];
   if (!a.length) return;
-  const s = { id: `${n.tableId}:detail`, columnKeys: r.list.columns.map((l) => l.field), title: e.detail.label };
+  const s = { id: `${n.tableId}:detail`, columnKeys: r.list.columns.map((c) => c.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 l of a)
-    q(n.signal), o.placeGridRow({ ...z(r.inter, l, n.measurer), table: s }, "listdr", "body", r.sources.get(l)), yield* n.takePages();
+  for (const c of a)
+    q(n.signal), o.placeGridRow({ ...J(r.inter, c, n.measurer), table: s }, "listdr", "body", r.sources.get(c)), yield* n.takePages();
 }
-function Qt(e, t) {
+function hr(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 = Et(t, e.matrix), n = r.columns.map((a, s) => ({ ...a, widthMm: s === 0 ? e.matrix.rowWidthMm ?? 40 : e.matrix.columnWidthMm ?? 28, editable: !1, align: s === 0 ? "center" : "right" })), o = { ...e, columns: n, headerGrid: void 0, rowKey: void 0, revisionField: void 0, sourceTokenField: void 0 };
+  const r = Wt(t, e.matrix), n = r.columns.map((a, s) => ({ ...a, widthMm: s === 0 ? e.matrix.rowWidthMm ?? 40 : e.matrix.columnWidthMm ?? 28, editable: !1, align: s === 0 ? "center" : "right" })), o = { ...e, columns: n, headerGrid: void 0, rowKey: void 0, revisionField: void 0, sourceTokenField: void 0 };
   return e.layout === "wide" && (o.widthMm = n.reduce((a, s) => a + s.widthMm, 0)), { list: o, rows: r.rows };
 }
-function qe(e) {
+function et(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("树形布局需要可见的标签列");
-  Ft(e.tree, e.computed);
+  Dt(e.tree, e.computed);
 }
-function Xt(e, t, r) {
-  qe(e);
-  const n = It(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 = te(o, n.entries.map((i) => i.original)), s = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new WeakMap();
+function wr(e, t, r) {
+  et(e);
+  const n = Vt(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((i) => i.original)), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new WeakMap();
   for (const i of n.entries)
-    s.set(i.row, a.get(i.original)), l.set(i.row, i);
-  return { list: o, rows: n.rows, sources: s, treeRows: l, totalRows: n.leaves };
+    s.set(i.row, a.get(i.original)), c.set(i.row, i);
+  return { list: o, rows: n.rows, sources: s, treeRows: c, totalRows: n.leaves };
 }
-function Zt(e, t) {
+function yr(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 Je(e, t, r) {
+function tt(e, t, r) {
   const n = r.prepared.get(e);
   if (n) return n;
-  const o = Zt(e, t);
+  const o = yr(e, t);
   if (o)
     return r.prepared.set(e, o), o;
   if (e.tree) {
-    const i = Xt(e, t, r);
+    const i = wr(e, t, r);
     return r.prepared.set(e, i), i;
   }
-  let a = e.computed?.length ? Ne(t, { fields: e.computed, signal: r.signal, formula: r.formula }).rows : t;
-  const s = a === t ? void 0 : new Map(a.map((i, c) => [i, t[c]]));
-  e.rowVisibleWhen && (a = a.filter((i) => W(i, e.rowVisibleWhen)));
-  const l = Qt(e, a);
+  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((i, l) => [i, t[l]]));
+  e.rowVisibleWhen && (a = a.filter((i) => D(i, e.rowVisibleWhen)));
+  const c = hr(e, a);
   if (!e.matrix) {
-    const i = te(e, s ? a.map((c) => s.get(c)) : a);
-    l.sources = s ? new Map(a.map((c) => [c, i.get(s.get(c))])) : i;
+    const i = ne(e, s ? a.map((l) => s.get(l)) : a);
+    c.sources = s ? new Map(a.map((l) => [l, i.get(s.get(l))])) : i;
   }
-  return r.prepared.set(e, l), l;
+  return r.prepared.set(e, c), c;
 }
-function er(e, t, r, n) {
+function br(e, t, r, n) {
   if (!n.flow) return;
-  const { current: o, templatePage: a } = n, s = Math.max(o.marginTopMm, D(a)), l = Math.max(n.startTop ?? e.topMm, s), i = (e.header === !1 ? 0 : t.headerHeightMm) + (r[0] ? z(t, r[0], n.measurer).heightMm : 0);
-  l + i <= Q(a, o) + 1e-3 || l <= 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, D(a)));
+  const { current: o, templatePage: a } = n, s = Math.max(o.marginTopMm, z(a)), c = Math.max(n.startTop ?? e.topMm, s), i = (e.header === !1 ? 0 : t.headerHeightMm) + (r[0] ? J(t, r[0], n.measurer).heightMm : 0);
+  c + i <= Q(a, o) + 1e-3 || c <= 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, z(a)));
 }
-function* tr(e, t, r) {
-  const n = Je(e, t, r), o = n.rows;
+function* vr(e, t, r) {
+  const n = tt(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 ?? te(e, o), s = we(e), l = re(s), i = { ...pe(s, r.measurer), rowHeightFloorMm: s.rowHeightMm ?? 0, ...n.treeRows ? { tree: { list: s, rows: n.treeRows } } : {} };
-  er(s, i, o, r);
-  const c = qt(s, i, r), d = Ut(s, o, r);
+  const a = n.sources ?? ne(e, o), s = ve(e), c = oe(s), i = { ...be(s, r.measurer), rowHeightFloorMm: s.rowHeightMm ?? 0, ...n.treeRows ? { tree: { list: s, rows: n.treeRows } } : {} };
+  br(s, i, o, r);
+  const l = ur(s, i, r), d = gr(s, o, r);
   let u;
-  for (const f of Ve(o, l)) {
+  for (const f of Ye(o, c)) {
     if (q(r.signal), f.kind === "row")
-      c.placeGridRow(u ?? z(i, f.row, r.measurer), "listr", "body", a.get(f.row)), u = void 0, yield* r.takePages(), yield* Yt(s, f.row, d, r, c);
+      l.placeGridRow(u ?? J(i, f.row, r.measurer), "listr", "body", a.get(f.row)), u = void 0, yield* r.takePages(), yield* pr(s, f.row, d, r, l);
     else if (f.kind === "groupHeader") {
       const m = G(i, r.measurer, f.label, /* @__PURE__ */ new Map(), f.group.headerStyle ?? {}, s.columns.length);
-      u ??= z(i, f.firstRow, r.measurer);
-      const w = l.slice(f.depth + 1).reduce((g, h) => g + G(i, r.measurer, (h.headerTemplate ?? "{value}").replace(/\{value\}/g, he(f.firstRow[h.field])), /* @__PURE__ */ new Map(), h.headerStyle ?? {}, s.columns.length).heightMm, 0);
-      f.group.keepWithNext !== !1 && c.keepTogether(m.heightMm + w + u.heightMm), c.placeGridRow(m, "listg", "group-header"), f.group.repeatHeader && c.setGroupHeader(f.depth, m);
+      u ??= J(i, f.firstRow, r.measurer);
+      const w = c.slice(f.depth + 1).reduce((g, p) => g + G(i, r.measurer, (p.headerTemplate ?? "{value}").replace(/\{value\}/g, he(f.firstRow[p.field])), /* @__PURE__ */ new Map(), p.headerStyle ?? {}, s.columns.length).heightMm, 0);
+      f.group.keepWithNext !== !1 && l.keepTogether(m.heightMm + w + u.heightMm), l.placeGridRow(m, "listg", "group-header"), f.group.repeatHeader && l.setGroupHeader(f.depth, m);
     } else if (f.kind === "subtotal") {
-      const m = f.group.subtotal ?? [], w = f.group.aggregates ?? [], g = G(i, r.measurer, f.label, Ge(s.columns, f.rows, m, w), f.group.subtotalStyle ?? {}, De(s.columns, [...m, ...w.map((h) => h.field)]));
-      c.placeGridRow(g, "listst", "subtotal");
-    } else c.setGroupHeader(f.depth);
+      const m = f.group.subtotal ?? [], w = f.group.aggregates ?? [], g = G(i, r.measurer, f.label, Xe(s.columns, f.rows, m, w), f.group.subtotalStyle ?? {}, Qe(s.columns, [...m, ...w.map((p) => p.field)]));
+      l.placeGridRow(g, "listst", "subtotal");
+    } else l.setGroupHeader(f.depth);
     yield* r.takePages();
   }
-  _t(s, n.totalRows ?? o, i, r, c), r.finished?.(c.bottom()), yield* r.takePages();
+  mr(s, n.totalRows ?? o, i, r, l), r.finished?.(l.bottom()), yield* r.takePages();
 }
-function ne(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 oe(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) => oe(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 rr(e) {
+function Mr(e) {
   let t = !1;
-  for (const r of e.pages) for (const n of r.components) ne(n) && oe(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 nr(e, t, r, n, o, a) {
+function $r(e, t, r, n, o, a) {
   const s = {
     pageWidthMm: t.widthMm,
     pageHeightMm: t.heightMm,
@@ -527,40 +618,40 @@ function nr(e, t, r, n, o, a) {
     marginRightMm: t.marginRightMm,
     components: t.components,
     ...e.meta ? { meta: e.meta } : {}
-  }, l = (i) => {
-    const c = i.replace(/\{page\}/g, String(n));
-    return a === void 0 ? c : c.replace(/\{totalPages\}/g, String(a));
+  }, c = (i) => {
+    const l = i.replace(/\{page\}/g, String(n));
+    return a === void 0 ? l : l.replace(/\{totalPages\}/g, String(a));
   };
-  for (const i of r) s.components.push(oe(i, l));
+  for (const i of r) s.components.push(se(i, c));
   if (e.layout === "wide") {
-    const i = s.components.reduce((c, d) => Math.max(c, d.topMm + d.heightMm), 0);
+    const i = s.components.reduce((l, d) => Math.max(l, d.topMm + d.heightMm), 0);
     s.marginBottomMm = o ? e.marginBottomMm ?? 0 : 0, s.pageHeightMm = Math.max(1, i + s.marginBottomMm);
   }
   return s;
 }
-function ye(e) {
-  return e.cells.reduce((t, r) => t + r.reduce((n, o) => n + (o ? 1 + (o.children?.reduce((a, s) => a + _e(s), 0) ?? 0) : 0), 0), 0);
+function Me(e) {
+  return e.cells.reduce((t, r) => t + r.reduce((n, o) => n + (o ? 1 + (o.children?.reduce((a, s) => a + rt(s), 0) ?? 0) : 0), 0), 0);
 }
-function _e(e) {
-  return e.grid ? ye(e.grid) : 0;
+function rt(e) {
+  return e.grid ? Me(e.grid) : 0;
 }
-function be(e) {
+function $e(e) {
   for (const t of ["maxPages", "maxCells", "knownTotalPages"]) if (e[t] !== void 0 && (!Number.isSafeInteger(e[t]) || e[t] < 1)) throw new RangeError(`${t} 应为正安全整数`);
 }
-function or(e, t) {
-  const r = Je(e, t.datasets[e.dataset] ?? [], t), n = we(r.list), o = { ...pe(n, t.measurer), 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 xr(e, t) {
+  const r = tt(e, t.datasets[e.dataset] ?? [], t), n = ve(r.list), o = { ...be(n, t.measurer), 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* ar(e) {
-  const { templatePage: t, current: r } = e, n = new Map(t.components.map((a, s) => [a, s])), o = (a, s, l) => {
+function* Sr(e) {
+  const { templatePage: t, current: r } = e, n = new Map(t.components.map((a, s) => [a, s])), o = (a, s, c) => {
     const i = e.datasets[a.dataset];
-    return Array.isArray(i) || e.warnings.push(`数据集 ${a.dataset} 未提供数据，列表 ${a.id ?? ""} 输出为空`), tr(a, Array.isArray(i) ? i : [], { ...e, tableId: `${e.tableId}:${n.get(a)}`, startTop: s, finished: l, flow: !!t.flow });
+    return Array.isArray(i) || e.warnings.push(`数据集 ${a.dataset} 未提供数据，列表 ${a.id ?? ""} 输出为空`), vr(a, Array.isArray(i) ? i : [], { ...e, tableId: `${e.tableId}:${n.get(a)}`, startTop: s, finished: c, flow: !!t.flow });
   };
   if (t.flow) {
-    yield* jt({
+    yield* _t({
       page: t,
       active: () => q(e.signal),
-      top: () => Math.max(r.marginTopMm, D(t)),
+      top: () => Math.max(r.marginTopMm, z(t)),
       bottom: () => Q(t, r),
       append: (a) => {
         r.components.push(a);
@@ -569,128 +660,128 @@ function* ar(e) {
         e.pushCurrent(), r.components = [], r.heightMm = t.heightMm, t.layout === "wide" && (r.marginTopMm = 0, r.marginBottomMm = 0);
       },
       takePages: e.takePages,
-      height: (a) => or(a, e),
+      height: (a) => xr(a, e),
       list: o
     });
     return;
   }
   for (const a of t.components)
-    ne(a) || (a.kind === "list" ? yield* o(a) : r.components.push(a));
+    ae(a) || (a.kind === "list" ? yield* o(a) : r.components.push(a));
 }
-function* X(e, t, r, n, o, a = /* @__PURE__ */ new WeakMap()) {
-  let s = 0, l = 0, i = 0;
-  const c = (d) => `${d}_${(++s).toString(36)}`;
-  for (const [d, u] of e.pages.entries()) {
+function* Z(e, t, r, n, o, a = /* @__PURE__ */ new WeakMap()) {
+  let s = 0, c = 0, i = 0;
+  const l = (d) => `${d}_${(++s).toString(36)}`;
+  for (const { pageIndex: d, page: u } of rr(e, t, r)) {
     q(r.signal);
-    const f = Ht(u), m = u.components.filter(ne);
+    const f = nr(u), m = u.components.filter(ae);
     let w = [];
     const g = (v = !1) => {
-      if (q(r.signal), r.maxPages !== void 0 && l >= r.maxPages) throw new L(r.maxPages, l + 1);
-      if (r.maxCells !== void 0 && (i += [...f.components, ...m].reduce((M, y) => M + _e(y), 0), i > r.maxCells))
+      if (q(r.signal), r.maxPages !== void 0 && c >= r.maxPages) throw new H(r.maxPages, c + 1);
+      if (r.maxCells !== void 0 && (i += [...f.components, ...m].reduce((M, y) => M + rt(y), 0), i > r.maxCells))
         throw new V(r.maxCells, i);
-      w.push(nr(u, f, m, ++l, v, o));
-    }, h = () => {
+      w.push($r(u, f, m, ++c, v, o));
+    }, p = () => {
       const v = w;
       return w = [], v;
     };
-    yield* ar({
+    yield* Sr({
       templatePage: u,
       current: f,
       warnings: n,
-      nextId: c,
+      nextId: l,
       pushCurrent: g,
-      takePages: h,
+      takePages: p,
       datasets: t,
       signal: r.signal,
       formula: r.formula,
       prepared: a,
-      measurer: r.measurer ?? St,
+      measurer: r.measurer ?? Le,
       mmPerRow: r.mmPerRow ?? 0,
       tableId: `table:${d}`
-    }), g(!0), yield* h();
+    }), g(!0), yield* p();
   }
 }
-function fn(e, t, r = {}) {
-  be(r);
+function Fn(e, t, r = {}) {
+  $e(r);
   let n = 0;
-  for (const o of X(e, t, { ...r }, [])) n++;
+  for (const o of Z(e, t, { ...r, onWarning: void 0 }, [])) n++;
   return n;
 }
-function* sr(e, t, r = {}) {
-  be(r);
-  const n = rr(e), o = /* @__PURE__ */ new WeakMap();
+function* Tr(e, t, r = {}) {
+  $e(r);
+  const n = Mr(e), o = /* @__PURE__ */ new WeakMap();
   let a = r.knownTotalPages;
   if (n && a === void 0) {
     a = 0;
-    for (const i of X(e, t, r, [], void 0, o)) a++;
+    for (const i of Z(e, t, r, [], void 0, o)) a++;
   }
   const s = [];
-  let l = 0;
-  for (const i of X(e, t, r, s, a, o)) {
-    for (; l < s.length; l++) r.onWarning?.(s[l]);
+  let c = 0;
+  for (const i of Z(e, t, r, s, a, o)) {
+    for (; c < s.length; c++) r.onWarning?.(s[c]);
     yield i;
   }
 }
-function ve(e, t, r = {}) {
+function xe(e, t, r = {}) {
   const n = typeof r == "number" ? { mmPerRow: r } : r;
-  be(n);
-  const o = [], a = [...X(e, t, n, o, n.knownTotalPages)];
-  for (const s of a) s.components = s.components.map((l) => ne(l) ? oe(l, (i) => i.replace(/\{totalPages\}/g, String(a.length))) : l);
-  return o.forEach((s) => n.onWarning?.(s)), { plan: { schemaVersion: Z, ...ee(e) ? { requiresRecalculation: !0 } : {}, pages: a }, warnings: o };
+  $e(n);
+  const o = [], a = [...Z(e, t, n, o, n.knownTotalPages)];
+  for (const s of a) s.components = s.components.map((c) => ae(c) ? se(c, (i) => i.replace(/\{totalPages\}/g, String(a.length))) : c);
+  return o.forEach((s) => n.onWarning?.(s)), { plan: { schemaVersion: ee, ...re(e) ? { requiresRecalculation: !0 } : {}, pages: a }, warnings: o };
 }
-function ir(e) {
+function Ir(e) {
   const t = e.columns.find((a) => !a.hidden)?.field;
   if (!t) return { groups: 0, total: 0 };
-  const r = re(e), n = (a = [], s = []) => a.includes(t) || s.some((l) => l.field === t), o = typeof e.grandTotal == "object" ? e.grandTotal : void 0;
+  const r = oe(e), n = (a = [], s = []) => a.includes(t) || s.some((c) => c.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 lr(e, t, r) {
-  qe(e);
-  const n = He(t[e.dataset] ?? [], e.tree, r), o = e.columns.filter((s) => !s.hidden).length, a = e.header === !1 ? 0 : e.headerGrid ? ye(e.headerGrid) : o;
+function Pr(e, t, r) {
+  et(e);
+  const n = Ge(t[e.dataset] ?? [], e.tree, r), o = e.columns.filter((s) => !s.hidden).length, a = e.header === !1 ? 0 : e.headerGrid ? Me(e.headerGrid) : o;
   return n.length * o + a + +!!e.grandTotal * 2 * o;
 }
-function mn(e, t, r = {}) {
-  if (e.tree) return lr(e, t, r.signal);
+function An(e, t, r = {}) {
+  if (e.tree) return Pr(e, t, r.signal);
   if (e.matrix) {
     let i = t[e.dataset] ?? [];
-    e.computed?.length && (i = Ne(i, { fields: e.computed, ...r }).rows), e.rowVisibleWhen && (i = i.filter((d) => W(d, e.rowVisibleWhen)));
-    const c = Ct(i, e.matrix);
-    return c.cells + c.columnCount;
+    e.computed?.length && (i = Ve(i, { fields: e.computed, ...r }).rows), e.rowVisibleWhen && (i = i.filter((d) => D(d, e.rowVisibleWhen)));
+    const l = Bt(i, e.matrix);
+    return l.cells + l.columnCount;
   }
-  const n = t[e.dataset]?.length ?? 0, o = e.columns.filter((i) => !i.hidden).length, a = re(e).length, s = ir(e);
-  let l = (n * (1 + 2 * a + s.groups) + +!!e.grandTotal * (1 + s.total)) * o;
-  if (l += e.header === !1 ? 0 : e.headerGrid ? ye(e.headerGrid) : o, e.cardinality === "record" && n === 0 && (l += o), e.detail) {
-    const i = t[e.detail.dataset]?.length ?? 0, c = e.detail.columns.filter((d) => !d.hidden).length;
-    l += (i + n * (+(e.detail.header !== !1) + +!!e.detail.label)) * c;
+  const n = t[e.dataset]?.length ?? 0, o = e.columns.filter((i) => !i.hidden).length, a = oe(e).length, s = Ir(e);
+  let c = (n * (1 + 2 * a + s.groups) + +!!e.grandTotal * (1 + s.total)) * o;
+  if (c += e.header === !1 ? 0 : e.headerGrid ? Me(e.headerGrid) : o, e.cardinality === "record" && n === 0 && (c += o), e.detail) {
+    const i = t[e.detail.dataset]?.length ?? 0, l = e.detail.columns.filter((d) => !d.hidden).length;
+    c += (i + n * (+(e.detail.header !== !1) + +!!e.detail.label)) * l;
   }
-  if (!Number.isSafeInteger(l)) throw new RangeError("报表单元格估算超出安全整数预算");
-  return l;
+  if (!Number.isSafeInteger(c)) throw new RangeError("报表单元格估算超出安全整数预算");
+  return c;
 }
-function Ue(e) {
+function nt(e) {
   return !e || typeof e != "object" ? !1 : [e.pageIndex, e.componentIndex, e.rowIndex, e.columnIndex].every((t) => Number.isInteger(t) && t >= 0);
 }
-function Ye(e, t, r) {
+function ot(e, t, r) {
   const n = e.grid;
   if (!n) return null;
   const o = n.cells[t];
   if (!o) return null;
-  const s = me(n, e.widthMm, e.heightMm).cells.filter((i) => i.ri === t).findIndex((i) => i.ci === r), l = o[s];
-  return l ? { cell: l, sourceColumnIndex: s } : null;
+  const s = pe(n, e.widthMm, e.heightMm).cells.filter((i) => i.ri === t).findIndex((i) => i.ci === r), c = o[s];
+  return c ? { cell: c, sourceColumnIndex: s } : null;
 }
-function cr(e) {
+function kr(e) {
   return e.value !== void 0 ? e.value : e.rawText ?? e.text ?? null;
 }
-function dr(e, t) {
+function Rr(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 ur(e, t) {
+function Er(e, t) {
   if (e.derived) return "derived";
   if (e.editable === !1) return "cell";
   if (e.formula !== void 0) return "formula";
   if (e.children?.length) return "complex";
   if (t.table && t.table.role !== "body" && e.editable !== !0) return "structure";
 }
-function fr(e, t) {
+function Cr(e, t) {
   const r = e.table;
   if (r)
     return {
@@ -700,54 +791,54 @@ function fr(e, t) {
       columnKey: r.columnKeys[t.columnIndex]
     };
 }
-function mr(e, t, r) {
+function Fr(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 Qe(e, t, r) {
-  const n = cr(r), o = ur(r, e);
+function at(e, t, r) {
+  const n = kr(r), o = Er(r, e);
   return {
     address: { ...t },
     cell: r,
     component: e,
     value: n,
-    valueType: dr(r, n),
-    table: fr(e, t),
-    source: mr(r, e, t),
+    valueType: Rr(r, n),
+    table: Cr(e, t),
+    source: Fr(r, e, t),
     editable: o === void 0,
     readOnlyReason: o
   };
 }
-function Me(e, t) {
-  if (!Ue(t)) return null;
+function Se(e, t) {
+  if (!nt(t)) return null;
   const r = e.pages[t.pageIndex]?.components[t.componentIndex];
   if (!r) return null;
-  const n = Ye(r, t.rowIndex, t.columnIndex);
-  return n ? Qe(r, t, n.cell) : null;
+  const n = ot(r, t.rowIndex, t.columnIndex);
+  return n ? at(r, t, n.cell) : null;
 }
-function B(e) {
+function W(e) {
   const t = /* @__PURE__ */ new Map();
   return (r) => {
-    if (!Ue(r)) return null;
+    if (!nt(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 l of me(n.grid, n.widthMm, n.heightMm).cells) {
-        const i = s.get(l.ri) ?? 0;
-        s.set(l.ri, i + 1);
-        const c = n.grid.cells[l.ri]?.[i];
-        c && o.set(`${l.ri}:${l.ci}`, c);
+      for (const c of pe(n.grid, n.widthMm, n.heightMm).cells) {
+        const i = s.get(c.ri) ?? 0;
+        s.set(c.ri, i + 1);
+        const l = n.grid.cells[c.ri]?.[i];
+        l && o.set(`${c.ri}:${c.ci}`, l);
       }
       t.set(n, o);
     }
     const a = o.get(`${r.rowIndex}:${r.columnIndex}`);
-    return a ? Qe(n, r, a) : null;
+    return a ? at(n, r, a) : null;
   };
 }
 class b extends Error {
@@ -755,20 +846,20 @@ class b extends Error {
     super(`Invalid report cell edit: ${t}`), this.code = t, this.name = "ReportCellEditError";
   }
 }
-function gr(e, t) {
+function Ar(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 b("number");
   return Number(r) / (n ? 100 : 1);
 }
-function hr(e, t) {
+function Or(e, t) {
   if (e === null || typeof e == "string" && e.trim() === "") return null;
   if (typeof e != "string" && typeof e != "number") throw new b("number");
-  const r = typeof e == "number" ? e : gr(e, vt(t.cell.numberFormat));
+  const r = typeof e == "number" ? e : Ar(e, Et(t.cell.numberFormat));
   if (!Number.isFinite(r) || Number.isInteger(r) && !Number.isSafeInteger(r)) throw new b("number");
   return r;
 }
-function pr(e) {
+function Kr(e) {
   if (e === null || typeof e == "string" && e.trim() === "") return null;
   if (typeof e == "boolean") return e;
   const t = String(e).trim().toLowerCase();
@@ -776,24 +867,24 @@ function pr(e) {
   if (["false", "no", "否", "0"].includes(t)) return !1;
   throw new b("boolean");
 }
-function Xe(e, t) {
-  return e.valueType === "number" ? hr(t, e) : e.valueType === "boolean" ? pr(t) : t === null ? null : String(t);
+function st(e, t) {
+  return e.valueType === "number" ? Or(t, e) : e.valueType === "boolean" ? Kr(t) : t === null ? null : String(t);
 }
-function wr(e, t) {
+function jr(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 J(e, t) {
-  return t === null ? "" : typeof t == "boolean" ? wr(t, e) : typeof t == "number" ? bt(t, e.cell.numberFormat) : String(t);
+function _(e, t) {
+  return t === null ? "" : typeof t == "boolean" ? jr(t, e) : typeof t == "number" ? Rt(t, e.cell.numberFormat) : String(t);
 }
-function gn(e, t, r) {
-  const n = Me(e, t);
+function On(e, t, r) {
+  const n = Se(e, t);
   if (!n) throw new b("missing");
-  return _(n, r);
+  return U(n, r);
 }
-function _(e, t) {
+function U(e, t) {
   if (!e.editable) throw new b("readonly");
-  const r = Xe(e, t);
+  const r = st(e, t);
   return {
     address: { ...e.address },
     table: e.table,
@@ -801,58 +892,58 @@ function _(e, t) {
     previousValue: e.value,
     previousText: e.cell.text ?? "",
     value: r,
-    text: J(e, r)
+    text: _(e, r)
   };
 }
-function yr(e, t) {
+function Nr(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 Ze(e, t, r) {
-  const n = e.grid, { rowIndex: o, columnIndex: a } = t.address, s = Ye(e, o, a), l = [...n.cells], i = [...l[o]], c = J(t, r.value), d = { ...s.cell, value: r.value, text: c, rawText: c };
-  return i[s.sourceColumnIndex] = d, l[o] = i, { ...e, grid: { ...n, cells: l } };
+function it(e, t, r) {
+  const n = e.grid, { rowIndex: o, columnIndex: a } = t.address, s = ot(e, o, a), c = [...n.cells], i = [...c[o]], l = _(t, r.value), d = { ...s.cell, value: r.value, text: l, rawText: l };
+  return i[s.sourceColumnIndex] = d, c[o] = i, { ...e, grid: { ...n, cells: c } };
 }
-function br(e, t) {
+function Lr(e, t) {
   const r = e.table?.columnKeys, n = t.table?.columnKey;
   return r && n !== void 0 ? r.flatMap((o, a) => o === n ? [a] : []) : [];
 }
-function vr(e, t, r, n, o, a) {
-  const s = t.table, l = o.table;
-  if (!s || !l || s.id !== l.id || s.role !== l.role || !t.grid) return t;
-  const i = l.rowIndex - s.rowIndex;
+function Hr(e, t, r, n, o, a) {
+  const s = t.table, c = o.table;
+  if (!s || !c || s.id !== c.id || s.role !== c.role || !t.grid) return t;
+  const i = c.rowIndex - s.rowIndex;
   if (i < 0 || i >= t.grid.cells.length) return t;
-  let c = t;
-  for (const d of br(t, o)) {
-    const u = Me(e, { pageIndex: r, componentIndex: n, rowIndex: i, columnIndex: d });
-    u?.editable && yr(o, u) && (c = Ze(c, u, a));
+  let l = t;
+  for (const d of Lr(t, o)) {
+    const u = Se(e, { pageIndex: r, componentIndex: n, rowIndex: i, columnIndex: d });
+    u?.editable && Nr(o, u) && (l = it(l, u, a));
   }
-  return c;
+  return l;
 }
-function Mr(e, t, r, n, o, a) {
+function Br(e, t, r, n, o, a) {
   const s = o.address;
-  return o.table?.columnKey !== void 0 ? vr(e, t, r, n, o, a) : s.pageIndex === r && s.componentIndex === n ? Ze(t, o, a) : t;
+  return o.table?.columnKey !== void 0 ? Hr(e, t, r, n, o, a) : s.pageIndex === r && s.componentIndex === n ? it(t, o, a) : t;
 }
-function $e(e, t) {
+function Te(e, t) {
   const r = t.source;
   if (!r) return !1;
   const n = e.source;
   return !n || ["datasetId", "rowKey", "field", "revision", "sourceToken"].some((o) => !Object.is(n[o], r[o]));
 }
-function hn(e, t) {
-  const r = Me(e, t.address);
+function Kn(e, t) {
+  const r = Se(e, t.address);
   if (!r) throw new b("missing");
   if (!r.editable) throw new b("readonly");
-  if ($e(r, t)) throw new b("conflict");
+  if (Te(r, t)) throw new b("conflict");
   if (!Object.is(r.value, t.previousValue) || (r.cell.text ?? "") !== t.previousText) throw new b("conflict");
-  const n = Xe(r, t.value), o = { ...t, value: n, text: J(r, n) };
+  const n = st(r, t.value), o = { ...t, value: n, text: _(r, n) };
   if (Object.is(n, r.value) && o.text === r.cell.text) return e;
-  const a = e.pages.map((s, l) => {
-    const i = s.components.map((c, d) => Mr(e, c, l, d, r, o));
-    return i.every((c, d) => c === s.components[d]) ? s : { ...s, components: i };
+  const a = e.pages.map((s, c) => {
+    const i = s.components.map((l, d) => Br(e, l, c, d, r, o));
+    return i.every((l, d) => l === s.components[d]) ? s : { ...s, components: i };
   });
   return { ...e, pages: a };
 }
-function $r(e, t, r) {
+function Wr(e, t, r) {
   if (!r || r.revision === void 0 && r.sourceToken === void 0) return e;
   const n = new Set(t.edits.flatMap((s) => s.source ? [s.source.datasetId] : []));
   if (!n.size) return e;
@@ -860,52 +951,52 @@ function $r(e, t, r) {
     return !s.datasetId || !n.has(s.datasetId) || (r.revision === void 0 || Object.is(r.revision, s.revision)) && (r.sourceToken === void 0 || r.sourceToken === s.sourceToken) ? s : { ...s, ...r.revision !== void 0 ? { revision: r.revision } : {}, ...r.sourceToken !== void 0 ? { sourceToken: r.sourceToken } : {} };
   }
   const a = e.pages.map((s) => {
-    const l = s.components.map((i) => {
-      const c = i.table?.source ? o(i.table.source) : void 0, d = i.table && c !== i.table.source ? { ...i.table, source: c } : i.table, u = i.grid?.cells.map((m) => {
+    const c = s.components.map((i) => {
+      const l = i.table?.source ? o(i.table.source) : void 0, d = i.table && l !== i.table.source ? { ...i.table, source: l } : i.table, u = i.grid?.cells.map((m) => {
         const w = m.map((g) => {
           if (!g?.source) return g;
-          const h = o(g.source);
-          return h === g.source ? g : { ...g, source: h };
+          const p = o(g.source);
+          return p === g.source ? g : { ...g, source: p };
         });
-        return w.some((g, h) => g !== m[h]) ? w : m;
+        return w.some((g, p) => g !== m[p]) ? w : m;
       }), f = i.grid && u?.some((m, w) => m !== i.grid.cells[w]) ? { ...i.grid, cells: u } : i.grid;
       return d !== i.table || f !== i.grid ? { ...i, table: d, grid: f } : i;
     });
-    return l.some((i, c) => i !== s.components[c]) ? { ...s, components: l } : s;
+    return c.some((i, l) => i !== s.components[l]) ? { ...s, components: c } : s;
   });
-  return a.some((s, l) => s !== e.pages[l]) ? { ...e, pages: a } : e;
+  return a.some((s, c) => s !== e.pages[c]) ? { ...e, pages: a } : e;
 }
-function xr(e) {
+function Dr(e) {
   return JSON.stringify([e.pageIndex, e.componentIndex, e.rowIndex, e.columnIndex]);
 }
-function Te(e) {
+function Re(e) {
   const t = e.table;
-  return t?.columnKey !== void 0 ? JSON.stringify([t.id, t.role, t.rowIndex, t.columnKey]) : xr(e.address);
+  return t?.columnKey !== void 0 ? JSON.stringify([t.id, t.role, t.rowIndex, t.columnKey]) : Dr(e.address);
 }
-function Sr(e, t) {
+function Vr(e, t) {
   if (!t.length) return e;
-  const r = new Map(t.map((i) => [Te(i), i])), n = new Set(t.flatMap((i) => i.table ? [i.table.id] : [])), o = new Set(t.map((i) => `${i.address.pageIndex}:${i.address.componentIndex}`)), a = B(e);
-  function s(i, c, d) {
+  const r = new Map(t.map((i) => [Re(i), i])), n = new Set(t.flatMap((i) => i.table ? [i.table.id] : [])), o = new Set(t.map((i) => `${i.address.pageIndex}:${i.address.componentIndex}`)), a = W(e);
+  function s(i, l, d) {
     const u = i.grid;
-    if (!u || !o.has(`${c}:${d}`) && !n.has(i.table?.id ?? "")) return i;
+    if (!u || !o.has(`${l}:${d}`) && !n.has(i.table?.id ?? "")) return i;
     const f = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Map();
-    for (const w of me(u, i.widthMm, i.heightMm).cells) {
+    for (const w of pe(u, i.widthMm, i.heightMm).cells) {
       const g = m.get(w.ri) ?? 0;
       m.set(w.ri, g + 1);
-      const h = a({ pageIndex: c, componentIndex: d, rowIndex: w.ri, columnIndex: w.ci }), v = h && r.get(Te(h));
-      if (!v || !h.editable) continue;
-      const M = f.get(w.ri) ?? [...u.cells[w.ri]], y = J(h, v.value);
-      Object.is(h.value, v.value) && y === h.cell.text || (M[g] = { ...w.cell, value: v.value, text: y, rawText: y }, f.set(w.ri, M));
+      const p = a({ pageIndex: l, componentIndex: d, rowIndex: w.ri, columnIndex: w.ci }), v = p && r.get(Re(p));
+      if (!v || !p.editable) continue;
+      const M = f.get(w.ri) ?? [...u.cells[w.ri]], y = _(p, v.value);
+      Object.is(p.value, v.value) && y === p.cell.text || (M[g] = { ...w.cell, value: v.value, text: y, rawText: y }, f.set(w.ri, M));
     }
     return f.size ? { ...i, grid: { ...u, cells: u.cells.map((w, g) => f.get(g) ?? w) } } : i;
   }
-  const l = e.pages.map((i, c) => {
-    const d = i.components.map((u, f) => s(u, c, f));
+  const c = e.pages.map((i, l) => {
+    const d = i.components.map((u, f) => s(u, l, f));
     return d.every((u, f) => u === i.components[f]) ? i : { ...i, components: d };
   });
-  return l.every((i, c) => i === e.pages[c]) ? e : { ...e, pages: l };
+  return c.every((i, l) => i === e.pages[l]) ? e : { ...e, pages: c };
 }
-function I(e) {
+function A(e) {
   const t = e.source;
   if (t) return JSON.stringify([t.datasetId, t.rowKey, t.field]);
   const r = e.table;
@@ -913,80 +1004,80 @@ function I(e) {
   const n = e.address;
   return JSON.stringify([n.pageIndex, n.componentIndex, n.rowIndex, n.columnIndex]);
 }
-function pn(e, t, r) {
+function jn(e, t, r) {
   if (typeof r != "string" || !r.trim() || !Array.isArray(t)) throw new b("missing");
   if (t.length > 1e4) throw new b("limit");
-  const n = /* @__PURE__ */ new Set(), o = B(e), a = t.map(({ address: s, value: l }) => {
+  const n = /* @__PURE__ */ new Set(), o = W(e), a = t.map(({ address: s, value: c }) => {
     const i = o(s);
     if (!i) throw new b("missing");
-    const c = _(i, l), d = I(c);
+    const l = U(i, c), d = A(l);
     if (n.has(d)) throw new b("duplicate");
-    return n.add(d), c;
+    return n.add(d), l;
   });
   return { requestId: r, edits: a };
 }
-function wn(e, t) {
+function Nn(e, t) {
   if (t.edits.length > 1e4) throw new b("limit");
-  const r = B(e), n = /* @__PURE__ */ new Set(), o = t.edits.map((a) => {
+  const r = W(e), n = /* @__PURE__ */ new Set(), o = t.edits.map((a) => {
     const s = r(a.address);
     if (!s) throw new b("missing");
-    const l = I(a);
-    if (n.has(l)) throw new b("duplicate");
-    if (n.add(l), $e(s, a) || !Object.is(s.value, a.previousValue) || (s.cell.text ?? "") !== a.previousText) throw new b("conflict");
-    return _(s, a.value);
+    const c = A(a);
+    if (n.has(c)) throw new b("duplicate");
+    if (n.add(c), Te(s, a) || !Object.is(s.value, a.previousValue) || (s.cell.text ?? "") !== a.previousText) throw new b("conflict");
+    return U(s, a.value);
   });
-  return Sr(e, o);
+  return Vr(e, o);
 }
-function yn(e) {
+function Ln(e) {
   const t = /* @__PURE__ */ new Map();
   for (const r of e) {
-    const n = I(r), o = t.get(n), a = o ? { ...r, previousValue: o.previousValue, previousText: o.previousText } : { ...r };
+    const n = A(r), o = t.get(n), a = o ? { ...r, previousValue: o.previousValue, previousText: o.previousText } : { ...r };
     Object.is(a.previousValue, a.value) ? t.delete(n) : t.set(n, a);
   }
   return [...t.values()];
 }
-function H(e, t) {
+function B(e, t) {
   for (let r = 0; r < t.length; r++) {
     const n = t.charCodeAt(r);
     e.first = Math.imul(e.first ^ n, 16777619), e.second = Math.imul(e.second, 33) ^ n, e.count++;
   }
 }
-function Tr(e, t, r) {
+function Gr(e, t, r) {
   const n = Object.getOwnPropertyDescriptor(e, t);
   if (!n || n.get || n.set) throw new b("conflict");
-  H(r, `${t.length}:${t}`), et(n.value, r);
+  B(r, `${t.length}:${t}`), ct(n.value, r);
 }
-function kr(e, t) {
+function zr(e, t) {
   if (Object.getOwnPropertyDescriptor(e, "toJSON")) throw new b("conflict");
   if (t.active.has(e)) throw new b("conflict");
-  if (t.active.add(e), e instanceof Date) H(t, `date:${Date.prototype.getTime.call(e)};`);
+  if (t.active.add(e), e instanceof Date) B(t, `date:${Date.prototype.getTime.call(e)};`);
   else {
     const r = Object.getPrototypeOf(e);
     if (!Array.isArray(e) && r !== Object.prototype && r !== null) throw new b("conflict");
     const n = Object.keys(e);
-    H(t, `${Array.isArray(e) ? "array" : "object"}:${Array.isArray(e) ? e.length : n.length}:{`), n.forEach((o) => Tr(e, o, t)), H(t, "}");
+    B(t, `${Array.isArray(e) ? "array" : "object"}:${Array.isArray(e) ? e.length : n.length}:{`), n.forEach((o) => Gr(e, o, t)), B(t, "}");
   }
   t.active.delete(e);
 }
-function et(e, t) {
+function ct(e, t) {
   if (++t.nodes > 1e6) throw new b("limit");
   if (e === null) {
-    H(t, "null;");
+    B(t, "null;");
     return;
   }
   if (typeof e == "object") {
-    kr(e, t);
+    zr(e, t);
     return;
   }
   if (typeof e == "function" || typeof e == "symbol") throw new b("conflict");
   const r = String(e);
-  H(t, `${typeof e}:${r.length}:${r};`);
+  B(t, `${typeof e}:${r.length}:${r};`);
 }
-function ke(e) {
+function Ee(e) {
   const t = { first: 2166136261, second: 5381, count: 0, nodes: 0, active: /* @__PURE__ */ new Set() };
-  return et(e, t), `${t.count}:${t.first >>> 0}:${t.second >>> 0}`;
+  return ct(e, t), `${t.count}:${t.first >>> 0}:${t.second >>> 0}`;
 }
-function de(e, t, r) {
+function fe(e, t, r) {
   if (++r.nodes > 1e6) throw new b("limit");
   if (typeof e == "string" && (r.text += e.length, r.text > 32 * 1024 * 1024))
     throw new b("limit");
@@ -994,165 +1085,165 @@ function de(e, t, r) {
   if (t.has(e)) throw new b("conflict");
   if (e instanceof Date) return new Date(Date.prototype.getTime.call(e));
   t.add(e);
-  const n = Array.isArray(e) ? e.map((o) => de(o, t, r)) : Object.fromEntries(Object.entries(e).map(([o, a]) => [o, de(a, t, r)]));
+  const n = Array.isArray(e) ? e.map((o) => fe(o, t, r)) : Object.fromEntries(Object.entries(e).map(([o, a]) => [o, fe(a, t, r)]));
   return t.delete(e), n;
 }
-function Pr(e) {
-  return de(e, /* @__PURE__ */ new Set(), { nodes: 0, text: 0 });
+function Jr(e) {
+  return fe(e, /* @__PURE__ */ new Set(), { nodes: 0, text: 0 });
 }
-function tt(e) {
+function lt(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] ?? [] } }));
   return t;
 }
-function Pe(e) {
+function Ce(e) {
   return JSON.stringify([e.datasetId, e.rowKey]);
 }
-function rt(e) {
+function dt(e) {
   const t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set();
   return e.forEach((n, o) => {
-    for (const a of tt(n)) {
+    for (const a of lt(n)) {
       if (!a.rowKey) continue;
-      const s = a.relation, l = s ? new Set(s.parentRows.map((i) => JSON.stringify(i[s.detail.parentKey]))) : void 0;
-      (n.datasets[a.dataset] ?? []).forEach((i, c) => {
-        if (s && !l.has(JSON.stringify(i[s.detail.foreignKey]))) return;
+      const s = a.relation, c = s ? new Set(s.parentRows.map((i) => JSON.stringify(i[s.detail.parentKey]))) : void 0;
+      (n.datasets[a.dataset] ?? []).forEach((i, l) => {
+        if (s && !c.has(JSON.stringify(i[s.detail.foreignKey]))) return;
         const d = i[a.rowKey];
         if (typeof d != "string" && typeof d != "number") return;
-        const u = `${o}:${a.dataset}:${c}:${a.rowKey}`;
+        const u = `${o}:${a.dataset}:${l}:${a.rowKey}`;
         if (r.has(u)) return;
         r.add(u);
-        const f = Pe({ datasetId: a.dataset, rowKey: d }), m = t.get(f) ?? [];
-        m.push({ partIndex: o, dataset: a.dataset, rowIndex: c, row: i, binding: a }), t.set(f, m);
+        const f = Ce({ datasetId: a.dataset, rowKey: d }), m = t.get(f) ?? [];
+        m.push({ partIndex: o, dataset: a.dataset, rowIndex: l, row: i, binding: a }), t.set(f, m);
       });
     }
   }), (n) => {
-    const o = t.get(Pe(n));
+    const o = t.get(Ce(n));
     if (!o?.length) throw new b("missing");
     if (new Set(o.map((a) => `${a.partIndex}:${a.dataset}`)).size !== o.length) throw new b("conflict");
     return o;
   };
 }
-function nt(e, t) {
+function ut(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 l = r[o.partIndex], i = `${o.partIndex}:${o.dataset}`;
-    n.has(i) || (l.datasets[o.dataset] = [...l.datasets[o.dataset]], n.add(i)), l.datasets[o.dataset][o.rowIndex] = { ...l.datasets[o.dataset][o.rowIndex], [a]: s };
+    const c = r[o.partIndex], i = `${o.partIndex}:${o.dataset}`;
+    n.has(i) || (c.datasets[o.dataset] = [...c.datasets[o.dataset]], n.add(i)), c.datasets[o.dataset][o.rowIndex] = { ...c.datasets[o.dataset][o.rowIndex], [a]: s };
   }
   return r;
 }
-function Rr(e, t, r) {
+function qr(e, t, r) {
   const n = [], o = /* @__PURE__ */ new Set();
   return e.forEach((a, s) => {
-    for (const l of tt(a))
-      t.has(l.dataset) && (a.datasets[l.dataset] ?? []).forEach((i, c) => {
-        const d = { partIndex: s, dataset: l.dataset, rowIndex: c, row: i, binding: l };
-        for (const [u, f] of [[l.revisionField, r.revision], [l.sourceTokenField, r.sourceToken]]) {
+    for (const c of lt(a))
+      t.has(c.dataset) && (a.datasets[c.dataset] ?? []).forEach((i, l) => {
+        const d = { partIndex: s, dataset: c.dataset, rowIndex: l, row: i, binding: c };
+        for (const [u, f] of [[c.revisionField, r.revision], [c.sourceTokenField, r.sourceToken]]) {
           if (!u || f === void 0) continue;
-          const m = `${s}:${l.dataset}:${c}:${u}`;
+          const m = `${s}:${c.dataset}:${l}:${u}`;
           o.has(m) || (o.add(m), n.push({ row: d, field: u, value: f }));
         }
       });
   }), n;
 }
-function ot(e) {
-  const t = /* @__PURE__ */ new Map(), r = B(e);
+function ft(e) {
+  const t = /* @__PURE__ */ new Map(), r = W(e);
   return e.pages.forEach((n, o) => n.components.forEach((a, s) => {
     if (!(!a.grid || a.table?.role !== "body"))
-      for (let l = 0; l < a.grid.cells.length; l++) for (let i = 0; i < a.table.columnKeys.length; i++) {
-        const c = r({ pageIndex: o, componentIndex: s, rowIndex: l, columnIndex: i });
-        c?.source && c.editable && t.set(I(c), c);
+      for (let c = 0; c < a.grid.cells.length; c++) for (let i = 0; i < a.table.columnKeys.length; i++) {
+        const l = r({ pageIndex: o, componentIndex: s, rowIndex: c, columnIndex: i });
+        l?.source && l.editable && t.set(A(l), l);
       }
   })), t;
 }
-function bn(e, t, r) {
-  const n = ot(e), o = B(e);
+function Hn(e, t, r) {
+  const n = ft(e), o = W(e);
   return t.map((a) => {
-    const s = a.source ? n.get(I(a)) : o(a.address);
-    if (!s || I(s) !== I(a)) throw new b("missing");
+    const s = a.source ? n.get(A(a)) : o(a.address);
+    if (!s || A(s) !== A(a)) throw new b("missing");
     return { address: { ...s.address }, value: a[r] };
   });
 }
-async function at(e, t, r = {}) {
+async function mt(e, t, r = {}) {
   const n = [], o = { ...r, knownTotalPages: void 0 };
-  for (const a of sr(e, t, o))
+  for (const a of Tr(e, t, o))
     n.push(a), n.length % 8 === 0 && await new Promise((s) => setTimeout(s, 0));
   if (r.signal?.aborted) {
     const a = new Error("报表重算已取消");
     throw a.name = "AbortError", a;
   }
-  return { schemaVersion: Z, ...ee(e) ? { requiresRecalculation: !0 } : {}, pages: n };
+  return { schemaVersion: ee, ...re(e) ? { requiresRecalculation: !0 } : {}, pages: n };
 }
-const ue = /* @__PURE__ */ new WeakMap();
-function vn(e) {
-  return ue.get(e);
+const me = /* @__PURE__ */ new WeakMap();
+function Bn(e) {
+  return me.get(e);
 }
-function U(e) {
+function Y(e) {
   if (e?.aborted) {
     const t = new Error("报表重算已取消");
     throw t.name = "AbortError", t;
   }
 }
-function st(e, t) {
+function gt(e, t) {
   return e[t] === void 0 ? "" : e[t];
 }
-function Cr(e, t) {
+function _r(e, t) {
   if (t.edits.length > 1e4) throw new b("limit");
-  const r = B(e), n = /* @__PURE__ */ new Set(), o = [], a = t.edits.map((s) => {
-    const l = r(s.address);
-    if (!l?.source) throw new b("missing");
-    const i = I(s);
+  const r = W(e), n = /* @__PURE__ */ new Set(), o = [], a = t.edits.map((s) => {
+    const c = r(s.address);
+    if (!c?.source) throw new b("missing");
+    const i = A(s);
     if (n.has(i)) throw new b("duplicate");
-    if (n.add(i), $e(l, s) || !Object.is(l.value, s.previousValue) || (l.cell.text ?? "") !== s.previousText) throw new b("conflict");
-    return o.push(l), _(l, s.value);
+    if (n.add(i), Te(c, s) || !Object.is(c.value, s.previousValue) || (c.cell.text ?? "") !== s.previousText) throw new b("conflict");
+    return o.push(c), U(c, s.value);
   });
   return { batch: { requestId: t.requestId, edits: a }, contexts: o };
 }
-function Er(e, t) {
-  const r = rt(e);
+function Ur(e, t) {
+  const r = dt(e);
   return t.flatMap((n) => {
     if (!n.source) throw new b("missing");
     return r(n.source).map((o) => {
-      if (!Object.is(st(o.row, n.source.field), n.previousValue)) throw new b("conflict");
+      if (!Object.is(gt(o.row, n.source.field), n.previousValue)) throw new b("conflict");
       if (o.binding.rowKey === n.source.field) throw new b("readonly");
       return { row: o, field: n.source.field, value: n.value };
     });
   });
 }
-function ie(e, t, r) {
+function le(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: J(n, n.value) }, n;
+  return n.cell = { ...e.cell, value: n.value, text: _(n, n.value) }, n;
 }
-function Fr(e, t, r) {
+function Yr(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 ? [o.source.datasetId] : []));
-  return nt(e, Rr(e, n, r));
+  return ut(e, qr(e, n, r));
 }
-function it(e, t) {
+function pt(e, t) {
   let r = t.parts;
-  const n = t.rebuild, o = ke(r);
+  const n = t.rebuild, o = Ee(r);
   let a = e, s;
-  const l = /* @__PURE__ */ new Map();
+  const c = /* @__PURE__ */ new Map();
   function i(u) {
     if (u !== a) throw new b("conflict");
     if (s) return s;
-    if (ke(r) !== o) throw new b("conflict");
-    return Pr(r);
+    if (Ee(r) !== o) throw new b("conflict");
+    return Jr(r);
   }
-  async function c(u, f, m, w = {}) {
-    U(w.signal), f = { requestId: f.requestId, edits: f.edits.map((y) => ({ ...y, address: { ...y.address }, source: y.source ? { ...y.source } : void 0, table: y.table ? { ...y.table } : void 0 })) }, m = m.map((y) => ({ ...y, address: { ...y.address }, source: y.source ? { ...y.source } : void 0, table: y.table ? { ...y.table } : void 0, cell: { ...y.cell } })), await new Promise((y) => setTimeout(y, 0)), U(w.signal);
-    const g = i(u), h = nt(g, Er(g, f.edits)), v = await n(h, w.signal);
-    U(w.signal);
+  async function l(u, f, m, w = {}) {
+    Y(w.signal), f = { requestId: f.requestId, edits: f.edits.map((y) => ({ ...y, address: { ...y.address }, source: y.source ? { ...y.source } : void 0, table: y.table ? { ...y.table } : void 0 })) }, m = m.map((y) => ({ ...y, address: { ...y.address }, source: y.source ? { ...y.source } : void 0, table: y.table ? { ...y.table } : void 0, cell: { ...y.cell } })), await new Promise((y) => setTimeout(y, 0)), Y(w.signal);
+    const g = i(u), p = ut(g, Ur(g, f.edits)), v = await n(p, w.signal);
+    Y(w.signal);
     let M = !1;
     return { plan: v, commit(y) {
-      if (U(w.signal), M || a !== u) throw new b("conflict");
+      if (Y(w.signal), M || a !== u) throw new b("conflict");
       if (y?.conflicts?.length) throw new b("conflict");
-      const j = Fr(h, f, y), A = $r(v, f, y);
+      const N = Yr(p, f, y), O = Wr(v, f, y);
       if (y) {
-        const R = new Set(f.edits.map((C) => C.source.datasetId));
-        for (const [C, p] of l) R.has(p.source.datasetId) && l.set(C, ie(p, p.value, y));
+        const k = new Set(f.edits.map((R) => R.source.datasetId));
+        for (const [R, h] of c) k.has(h.source.datasetId) && c.set(R, le(h, h.value, y));
       }
-      return m.forEach((R, C) => l.set(I(R), ie(R, f.edits[C].value, y))), M = !0, s = j, r = void 0, a = A, ue.set(a, d), a;
+      return m.forEach((k, R) => c.set(A(k), le(k, f.edits[R].value, y))), M = !0, s = N, r = void 0, a = O, me.set(a, d), a;
     } };
   }
   const d = {
@@ -1160,61 +1251,61 @@ function it(e, t) {
       return a;
     },
     async prepare(u, f, m) {
-      const w = Cr(u, f);
-      return c(u, w.batch, w.contexts, m);
+      const w = _r(u, f);
+      return l(u, w.batch, w.contexts, m);
     },
     async prepareHistory(u, f, m, w, g) {
       if (!w.trim() || f.length > 1e4) throw new b("limit");
-      const h = i(u), v = rt(h), M = ot(u), y = /* @__PURE__ */ new Set(), A = f.map((p) => {
-        if (!p.source) throw new b("missing");
-        const $ = I(p);
+      const p = i(u), v = dt(p), M = ft(u), y = /* @__PURE__ */ new Set(), O = f.map((h) => {
+        if (!h.source) throw new b("missing");
+        const $ = A(h);
         if (y.has($)) throw new b("duplicate");
         y.add($);
-        const x = M.get($) ?? l.get($);
+        const x = M.get($) ?? c.get($);
         if (!x?.source) throw new b("missing");
-        const k = v(x.source)[0];
-        return ie(x, st(k.row, x.source.field));
-      }).map((p, $) => ({ context: p, edit: _(p, f[$][m]) })).filter(({ edit: p }) => !Object.is(p.previousValue, p.value)), R = { requestId: w, edits: A.map(({ edit: p }) => p) }, C = A.map(({ context: p }) => p);
-      return { batch: R, contexts: C, prepared: await c(u, R, C, g) };
+        const I = v(x.source)[0];
+        return le(x, gt(I.row, x.source.field));
+      }).map((h, $) => ({ context: h, edit: U(h, f[$][m]) })).filter(({ edit: h }) => !Object.is(h.previousValue, h.value)), k = { requestId: w, edits: O.map(({ edit: h }) => h) }, R = O.map(({ context: h }) => h);
+      return { batch: k, contexts: R, prepared: await l(u, k, R, g) };
     }
   };
-  return ue.set(e, d), d;
+  return me.set(e, d), d;
 }
-function Mn(e) {
-  const t = ve(e.template, e.datasets, e.pagination).plan;
-  return it(t, { parts: [{ template: e.template, datasets: e.datasets }], rebuild: (r, n) => at(r[0].template, r[0].datasets, { ...e.pagination, signal: n }) });
+function Wn(e) {
+  const t = xe(e.template, e.datasets, e.pagination).plan;
+  return pt(t, { parts: [{ template: e.template, datasets: e.datasets }], rebuild: (r, n) => mt(r[0].template, r[0].datasets, { ...e.pagination, signal: n }) });
 }
-function xe(e, t, r = {}) {
+function Ie(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;
-    const l = n.get(s.dataset);
-    if (l && (l.childrenField ?? "children") !== (s.tree.childrenField ?? "children")) throw new Error("同一数据集的嵌套树应使用相同 childrenField");
+    const c = n.get(s.dataset);
+    if (c && (c.childrenField ?? "children") !== (s.tree.childrenField ?? "children")) throw new Error("同一数据集的嵌套树应使用相同 childrenField");
     n.set(s.dataset, s.tree);
   }
   if (!n.size) return t;
   const o = { ...t };
   for (const [a, s] of n) {
-    const l = Math.min(s.maxRows ?? 1e5, r.maxRows ?? 1 / 0);
-    o[a] = He(t[a] ?? [], { ...s, maxRows: l }, r.signal);
+    const c = Math.min(s.maxRows ?? 1e5, r.maxRows ?? 1 / 0);
+    o[a] = Ge(t[a] ?? [], { ...s, maxRows: c }, r.signal);
   }
   return o;
 }
-function Ir(e, t, r = {}) {
-  return Object.values(xe(e, t, r)).reduce((n, o) => n + o.length, 0);
+function Xr(e, t, r = {}) {
+  return Object.values(Ie(e, t, r)).reduce((n, o) => n + o.length, 0);
 }
-function $n(e, t, r) {
-  const n = $t(r), o = e?.pages.flatMap((l) => l.components).find((l) => l.kind === "list" && l.dataset === t && l.tree?.input === "nested");
+function Dn(e, t, r) {
+  const n = Ft(r), o = e?.pages.flatMap((c) => c.components).find((c) => c.kind === "list" && c.dataset === t && c.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 xn(e) {
+function Vn(e) {
   if (!("mapData" in e)) return e;
   const { load: t, mapData: r, ...n } = e;
   return { ...n, load: async (o) => {
     const a = await t(o);
-    E(o.signal);
+    C(o.signal);
     try {
       return r(a, o);
     } catch (s) {
@@ -1227,17 +1318,17 @@ class S extends Error {
     super(r), this.name = "ReportSourceError", this.code = t, this.cause = n;
   }
 }
-function ae(e) {
+function ie(e) {
   const t = new Error("报表加载已取消");
   return t.name = "AbortError", Object.defineProperty(t, "cause", { value: e.reason }), t;
 }
-function E(e) {
-  if (e?.aborted) throw ae(e);
+function C(e) {
+  if (e?.aborted) throw ie(e);
 }
-function fe(e, t) {
+function ge(e, t) {
   return t ? new Promise((r, n) => {
     const o = () => t.removeEventListener("abort", a), a = () => {
-      o(), n(ae(t));
+      o(), n(ie(t));
     };
     t.addEventListener("abort", a, { once: !0 }), t.aborted && a(), Promise.resolve(e).then(
       (s) => {
@@ -1249,68 +1340,73 @@ function fe(e, t) {
     );
   }) : Promise.resolve(e);
 }
-function Ar(e, t) {
+function Qr(e, t) {
   if (!e || typeof e != "object" || Array.isArray(e))
     throw new S("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 S("validate", `报表 ${t} 的数据集 ${r} 应为对象数组`);
 }
-async function Or(e, t, r) {
+async function Zr(e, t, r) {
   const { reportId: n, signal: o } = t;
   try {
-    const a = await fe(e(t), o);
-    E(o);
-    const s = pt(a);
+    const a = await ge(e(t), o);
+    C(o);
+    const s = It(a);
     if (!s.ok)
-      throw new S("validate", `报表 ${n} 模板校验失败：${s.errors.slice(0, 3).map((l) => `${l.path}: ${l.message}`).join("; ")}`);
-    return r.push(...s.warnings.map((l) => `${n}: ${l.path}: ${l.message}`)), a;
+      throw new S("validate", `报表 ${n} 模板校验失败：${s.errors.slice(0, 3).map((c) => `${c.path}: ${c.message}`).join("; ")}`);
+    return r.push(...s.warnings.map((c) => `${n}: ${c.path}: ${c.message}`)), a;
   } catch (a) {
-    throw o?.aborted ? ae(o) : a instanceof S ? a : a instanceof wt ? new S("validate", `报表 ${n} 模板校验失败：${a.message}`, a) : new S("fetch", `报表 ${n} 模板加载失败：${a instanceof Error ? a.message : String(a)}`, a);
+    throw o?.aborted ? ie(o) : a instanceof S ? a : a instanceof Pt ? new S("validate", `报表 ${n} 模板校验失败：${a.message}`, a) : new S("fetch", `报表 ${n} 模板加载失败：${a instanceof Error ? a.message : String(a)}`, a);
   }
 }
-async function Kr(e, t, r, n) {
+async function en(e, t, r, n) {
   const o = t.signal;
   let a;
   try {
-    if (e.load) a = await fe(e.load(t), o);
+    if (e.load) a = await ge(e.load(t), o);
     else if (e.provider) {
-      const s = await fe(e.provider.query(t), o);
-      E(o), jr(s, r), a = s.datasets, n?.(r, s);
+      const s = await ge(e.provider.query(t), o);
+      C(o), tn(s, r), a = s.datasets, n?.(r, s);
     } else a = e.datasets ?? {};
   } catch (s) {
-    throw o?.aborted ? ae(o) : s instanceof S ? s : new S("fetch", `报表 ${r} 取数失败：${s instanceof Error ? s.message : String(s)}`, s);
+    throw o?.aborted ? ie(o) : s instanceof S ? s : new S("fetch", `报表 ${r} 取数失败：${s instanceof Error ? s.message : String(s)}`, s);
   }
-  return E(o), a;
+  return C(o), a;
 }
-function jr(e, t) {
+function tn(e, t) {
   if (!e || typeof e != "object" || Array.isArray(e)) throw new S("validate", `报表 ${t} Provider 应返回 datasets 结果对象`);
   for (const r of ["revision", "sourceToken"])
     if (e[r] !== void 0 && typeof e[r] != "string") throw new S("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 S("validate", `报表 ${t} Provider diagnostics 不符合结构化诊断契约`);
 }
-function Nr(e, t, r, n, o) {
+function rn(e, t, r, n, o) {
   try {
-    t = xe(n, t, { maxRows: e.dataValidation?.maxRows, signal: o });
+    t = Ie(n, t, { maxRows: e.dataValidation?.maxRows, signal: o });
   } catch (a) {
     throw new S("validate", `报表 ${r} 树形数据无效：${a instanceof Error ? a.message : String(a)}`, a);
   }
   for (const [a, s] of Object.entries(e.dataSchema ?? {})) {
-    let l;
+    let c;
     try {
-      l = Fe(Object.prototype.hasOwnProperty.call(t, a) ? t[a] : void 0, s, { ...e.dataValidation, path: `$.datasets.${a}` });
+      c = Ke(Object.prototype.hasOwnProperty.call(t, a) ? t[a] : void 0, s, { ...e.dataValidation, path: `$.datasets.${a}` });
     } catch (i) {
       throw new S("config", `报表 ${r} 数据集 ${a} 字段契约配置无效`, i);
     }
-    if (!l.ok) throw new S("validate", `报表 ${r} 数据集 ${a} 不符合字段契约：${l.issues[0]?.message}`, { issues: l.issues });
+    if (!c.ok) throw new S("validate", `报表 ${r} 数据集 ${a} 不符合字段契约：${c.issues[0]?.message}`, { issues: c.issues });
   }
 }
-function lt(e) {
-  const t = (r) => r.grid?.cells.reduce((n, o) => n + o.reduce((a, s) => a + (s ? 1 + (s.children?.reduce((l, i) => l + t(i), 0) ?? 0) : 0), 0), 0) ?? 0;
+function ht(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 wt(e) {
+  const t = (r) => r.grid?.cells.reduce((n, o) => n + o.reduce((a, s) => a + (s ? 1 + (s.children?.reduce((c, i) => c + t(i), 0) ?? 0) : 0), 0), 0) ?? 0;
   return e.pages.reduce((r, n) => r + n.components.reduce((o, a) => o + t(a), 0), 0);
 }
-function ct(e, t, r, n) {
+function yt(e, t, r, n) {
   return {
     ...e,
     signal: n ?? e?.signal,
@@ -1318,48 +1414,48 @@ function ct(e, t, r, n) {
     ...r === void 0 ? {} : { maxCells: Math.max(1, Math.min(r, e?.maxCells ?? r)) }
   };
 }
-function Hr(e, t, r, n, o, a) {
-  const s = o.maxPages === void 0 ? void 0 : o.maxPages - o.usedPages, l = o.maxCells === void 0 ? void 0 : o.maxCells - o.usedCells;
+function nn(e, t, r, n, o, a) {
+  const s = o.maxPages === void 0 ? void 0 : o.maxPages - o.usedPages, c = o.maxCells === void 0 ? void 0 : o.maxCells - o.usedCells;
   try {
-    if (s !== void 0 && s < 1 && e.pages.length) throw new L(0, 1);
-    const i = ct(r.pagination, s, l, a), c = ve(e, t, i), d = lt(c.plan);
-    if (l !== void 0 && d > l) throw new V(l, d);
-    return { ...c, cells: d };
+    if (s !== void 0 && s < 1 && e.pages.length && !ht(e, t)) throw new H(0, 1);
+    const i = yt(r.pagination, s, c, a), l = xe(e, t, i), d = wt(l.plan);
+    if (c !== void 0 && d > c) throw new V(c, d);
+    return { ...l, cells: d };
   } catch (i) {
-    let c = i;
-    throw i instanceof L && o.maxPages !== void 0 && i.limit === s && (c = new L(o.maxPages, o.usedPages + i.actual)), i instanceof V && o.maxCells !== void 0 && (c = new V(o.maxCells, o.usedCells + i.actual)), new S("validate", `报表 ${n} 排版失败：${c instanceof Error ? c.message : String(c)}`, c);
+    let l = i;
+    throw i instanceof H && o.maxPages !== void 0 && i.limit === s && (l = new H(o.maxPages, o.usedPages + i.actual)), i instanceof V && o.maxCells !== void 0 && (l = new V(o.maxCells, o.usedCells + i.actual)), new S("validate", `报表 ${n} 排版失败：${l instanceof Error ? l.message : String(l)}`, l);
   }
 }
-function dt(e, t, r, n) {
+function bt(e, t, r, n) {
   const o = /* @__PURE__ */ new Map(), a = (s) => {
-    let l = o.get(s);
-    return l === void 0 && (l = JSON.stringify([r, n, s]), o.set(s, l)), l;
+    let c = o.get(s);
+    return c === void 0 && (c = JSON.stringify([r, n, s]), o.set(s, c)), c;
   };
   for (const s of t.pages) e.push({
     ...s,
     ...s.meta ? { meta: { ...s.meta, reportScope: JSON.stringify([r, n]) } } : {},
-    components: s.components.map((l) => l.table ? {
-      ...l,
-      table: { ...l.table, id: a(l.table.id) }
-    } : l)
+    components: s.components.map((c) => c.table ? {
+      ...c,
+      table: { ...c.table, id: a(c.table.id) }
+    } : c)
   });
 }
-async function Br(e, t, r, n, o) {
+async function on(e, t, r, n, o) {
   const a = [];
   let s = 0;
-  for (const [c, d] of e.entries()) {
-    E(o);
+  for (const [l, d] of e.entries()) {
+    C(o);
     const u = n.maxPages === void 0 ? void 0 : n.maxPages - a.length, f = n.maxCells === void 0 ? void 0 : n.maxCells - s;
-    if (u !== void 0 && u < 1 && d.template.pages.length) throw new L(n.maxPages, a.length + 1);
-    const m = await at(d.template, d.datasets, ct(t[c]?.pagination, u, f, o));
-    if (s += lt(m), n.maxCells !== void 0 && s > n.maxCells) throw new V(n.maxCells, s);
-    dt(a, m, c, r[c]);
+    if (u !== void 0 && u < 1 && d.template.pages.length && !ht(d.template, d.datasets)) throw new H(n.maxPages, a.length + 1);
+    const m = await mt(d.template, d.datasets, yt(t[l]?.pagination, u, f, o));
+    if (s += wt(m), n.maxCells !== void 0 && s > n.maxCells) throw new V(n.maxCells, s);
+    bt(a, m, l, r[l]);
   }
-  const l = { schemaVersion: Z, ...e.some((c) => ee(c.template)) ? { requiresRecalculation: !0 } : {}, pages: a }, i = Ee(l);
+  const c = { schemaVersion: ee, ...e.some((l) => re(l.template)) ? { requiresRecalculation: !0 } : {}, pages: a }, i = Oe(c);
   if (!i.ok) throw new S("validate", `重算渲染计划校验失败：${i.errors[0]?.message}`);
-  return l;
+  return c;
 }
-function Sn(e, t = {}) {
+function Gn(e, t = {}) {
   if (t.maxPages !== void 0 && (!Number.isSafeInteger(t.maxPages) || t.maxPages < 1)) throw new S("config", "maxPages 应为正安全整数");
   if (t.maxCells !== void 0 && (!Number.isSafeInteger(t.maxCells) || t.maxCells < 1)) throw new S("config", "maxCells 应为正安全整数");
   function r(o) {
@@ -1367,57 +1463,57 @@ function Sn(e, t = {}) {
     if (!a) throw new S("config", `未注册报表 ${o}`);
     return a;
   }
-  return Object.assign(async ({ reportIds: o, params: a, signal: s, onWarning: l, onQueryResult: i, ...c }) => {
-    E(s);
-    const d = Mt({ ...c, signal: s }), u = [...o], f = { ...a };
+  return Object.assign(async ({ reportIds: o, params: a, signal: s, onWarning: c, onQueryResult: i, ...l }) => {
+    C(s);
+    const d = Ct({ ...l, signal: s }), u = [...o], f = { ...a };
     if (u.length === 0) throw new S("config", "缺少报表 ID");
-    const m = u.map(r), w = d.runSync("validate", () => m.map((p) => Se(
-      p.params ?? (typeof p.template == "function" ? [] : p.template.params) ?? [],
+    const m = u.map(r), w = d.runSync("validate", () => m.map((h) => Pe(
+      h.params ?? (typeof h.template == "function" ? [] : h.template.params) ?? [],
       f
-    ))), g = [], h = [];
+    ))), g = [], p = [];
     let v = 0;
     const M = [];
-    for (const [p, $] of m.entries()) {
-      E(s);
-      const x = u[p], k = { reportId: x, params: w[p], signal: s }, P = typeof $.template == "function" ? await d.run("query", () => Or($.template, k, M), x) : $.template;
-      k.params = d.runSync("validate", () => Se($.params ?? P.params ?? [], k.params), x);
-      const O = await d.run("query", () => Kr($, k, x, i), x);
+    for (const [h, $] of m.entries()) {
+      C(s);
+      const x = u[h], I = { reportId: x, params: w[h], signal: s }, P = typeof $.template == "function" ? await d.run("query", () => Zr($.template, I, M), x) : $.template;
+      I.params = d.runSync("validate", () => Pe($.params ?? P.params ?? [], I.params), x);
+      const K = await d.run("query", () => en($, I, x, i), x);
       d.runSync("validate", () => {
-        Ar(O, x), t.onDatasets?.(x, O, P), Nr($, O, x, P, s);
-      }, x), E(s);
-      const se = d.runSync("layout", () => Hr(P, O, $, x, { maxPages: t.maxPages, usedPages: g.length, maxCells: t.maxCells, usedCells: v }, s), x);
-      v += se.cells, h.push({ template: P, datasets: O }), dt(g, se.plan, p, x), M.push(...se.warnings.map((ft) => `${x}: ${ft}`));
+        Qr(K, x), t.onDatasets?.(x, K, P), rn($, K, x, P, s);
+      }, x), C(s);
+      const ce = d.runSync("layout", () => nn(P, K, $, x, { maxPages: t.maxPages, usedPages: g.length, maxCells: t.maxCells, usedCells: v }, s), x);
+      v += ce.cells, p.push({ template: P, datasets: K }), bt(g, ce.plan, h, x), M.push(...ce.warnings.map((Mt) => `${x}: ${Mt}`));
     }
-    E(s);
-    const y = { schemaVersion: Z, ...h.some((p) => ee(p.template)) ? { requiresRecalculation: !0 } : {}, pages: g }, j = d.runSync("validate", () => {
-      const p = Ee(y);
-      if (!p.ok) throw new S("validate", `渲染计划校验失败：${p.errors.slice(0, 3).map(($) => `${$.path}: ${$.message}`).join("; ")}`);
-      return p;
+    C(s);
+    const y = { schemaVersion: ee, ...p.some((h) => re(h.template)) ? { requiresRecalculation: !0 } : {}, pages: g }, N = d.runSync("validate", () => {
+      const h = Oe(y);
+      if (!h.ok) throw new S("validate", `渲染计划校验失败：${h.errors.slice(0, 3).map(($) => `${$.path}: ${$.message}`).join("; ")}`);
+      return h;
     });
-    M.push(...j.warnings.map((p) => `${p.path}: ${p.message}`));
-    const A = m.map((p) => ({ ...p, pagination: { ...p.pagination } })), R = { maxPages: t.maxPages, maxCells: t.maxCells };
+    M.push(...N.warnings.map((h) => `${h.path}: ${h.message}`));
+    const O = m.map((h) => ({ ...h, pagination: { ...h.pagination } })), k = { maxPages: t.maxPages, maxCells: t.maxCells };
     try {
-      it(y, { parts: h, rebuild: (p, $) => Br(p, A, u, R, $) });
+      pt(y, { parts: p, rebuild: (h, $) => on(h, O, u, k, $) });
     } catch {
       M.push("来源数据无法建立本地重算口径；当前预览仅支持计划内编辑，请使用可序列化模板数据启用规则重算");
     }
-    const C = l ?? t.onWarning ?? ((p) => console.warn("[mach-report]", p));
-    for (const p of M)
-      E(s), C(p);
-    return E(s), y;
+    const R = c ?? t.onWarning ?? ((h) => console.warn("[mach-report]", h));
+    for (const h of M)
+      C(s), R(h);
+    return C(s), y;
   }, {
-    getParamDefs: (o) => mt(e, o)
+    getParamDefs: (o) => $t(e, o)
   });
 }
-function Re(e) {
+function Fe(e) {
   if (e === void 0) return;
   const t = typeof e == "string" ? e : JSON.stringify(e);
   return t.length > 160 ? t.slice(0, 157) + "…" : t;
 }
-function Wr(e) {
-  return /\.tree\.(?:idField|parentField|childrenField|labelField|input)$/.test(e) ? "binding" : /\.tree\.parentValues$/.test(e) ? "calculation" : /\.tree\.indentMm$/.test(e) ? "format" : /\.(?:computed|computeOptions|groups|groupBy|aggregates|grandTotal)(?:\.|\[|$)/.test(e) ? "calculation" : /\.(?:dataset|field|rowKey|revisionField|sourceTokenField|foreignKey|parentKey)$/.test(e) ? "binding" : /\.(?:style|headerStyle|format|rules|align|headerAlign|semanticRole|unit)(?:\.|\[|$)/.test(e) ? "format" : e.startsWith("$.template") ? "structure" : "metadata";
+function an(e) {
+  return /\.(?:repeat|binding)(?:\.|$)/.test(e) ? /\.format(?:\.|$)/.test(e) ? "format" : "binding" : /\.tree\.(?:idField|parentField|childrenField|labelField|input)$/.test(e) ? "binding" : /\.tree\.parentValues$/.test(e) ? "calculation" : /\.tree\.indentMm$/.test(e) ? "format" : /\.(?:computed|computeOptions|groups|groupBy|aggregates|grandTotal)(?:\.|\[|$)/.test(e) ? "calculation" : /\.(?:dataset|field|rowKey|revisionField|sourceTokenField|foreignKey|parentKey)$/.test(e) ? "binding" : /\.(?:style|headerStyle|format|rules|align|headerAlign|semanticRole|unit)(?:\.|\[|$)/.test(e) ? "format" : e.startsWith("$.template") ? "structure" : "metadata";
 }
-function Ce(e) {
+function Ae(e) {
   const t = /* @__PURE__ */ new Map();
   for (const r of e) {
     if (!r || typeof r != "object" || !("field" in r) || typeof r.field != "string" || t.has(r.field)) return;
@@ -1425,157 +1521,166 @@ function Ce(e) {
   }
   return t;
 }
-function Lr(e, t, r) {
+function sn(e, t, r) {
   return !e.startsWith("$.template.params") || t === "moved" ? !1 : /\.(?:type|required|min|max|minLength|maxLength|options|defaultValue)(?:\[|$)/.test(e) ? !0 : t !== "added" ? !1 : Array.isArray(r) ? r.some((n) => !!n && typeof n == "object" && "required" in n && n.required === !0) : !!r && typeof r == "object" && "required" in r && r.required === !0;
 }
-function Vr(e, t, r = {}) {
-  const n = le(e), o = le(t), a = r.maxChanges ?? 500;
+function cn(e, t, r = {}) {
+  const n = de(e), o = de(t), a = r.maxChanges ?? 500;
   if (!Number.isSafeInteger(a) || a < 1 || a > 1e4) throw new RangeError("maxChanges must be between 1 and 10000");
   const s = { changes: [], totalChanges: 0, breakingChanges: 0, truncated: !1 };
-  function l(d, u, f, m) {
-    const w = Wr(u), g = d !== "moved" && (w === "binding" || u === "$.id" || d === "removed" && w === "structure" || Lr(u, d, m));
-    s.totalChanges++, g && s.breakingChanges++, s.changes.length < a && s.changes.push({ kind: d, category: w, path: u, before: Re(f), after: Re(m), breaking: g });
+  function c(d, u, f, m) {
+    const w = an(u), g = d !== "moved" && (w === "binding" || u === "$.id" || d === "removed" && w === "structure" || sn(u, d, m));
+    s.totalChanges++, g && s.breakingChanges++, s.changes.length < a && s.changes.push({ kind: d, category: w, path: u, before: Fe(f), after: Fe(m), breaking: g });
   }
   function i(d, u, f) {
-    const m = Ce(d), w = Ce(u);
+    const m = Ae(d), w = Ae(u);
     if (!m || !w) return !1;
-    const g = new Map(u.map((h, v) => [h.field, v]));
-    Array.from(m).forEach(([h, v], M) => {
-      const y = `${f}[${JSON.stringify(h)}]`;
-      w.has(h) ? (g.get(h) !== M && l("moved", y, M, g.get(h)), c(v, w.get(h), y)) : l("removed", y, v, void 0);
+    const g = new Map(u.map((p, v) => [p.field, v]));
+    Array.from(m).forEach(([p, v], M) => {
+      const y = `${f}[${JSON.stringify(p)}]`;
+      w.has(p) ? (g.get(p) !== M && c("moved", y, M, g.get(p)), l(v, w.get(p), y)) : c("removed", y, v, void 0);
     });
-    for (const [h, v] of w) m.has(h) || l("added", `${f}[${JSON.stringify(h)}]`, void 0, v);
+    for (const [p, v] of w) m.has(p) || c("added", `${f}[${JSON.stringify(p)}]`, void 0, v);
     return !0;
   }
-  function c(d, u, f) {
+  function l(d, u, f) {
     if (!(Object.is(d, u) || f === "$.revision")) {
       if (d === void 0 || u === void 0) {
-        l(d === void 0 ? "added" : "removed", f, d, u);
+        c(d === void 0 ? "added" : "removed", f, d, u);
         return;
       }
       if (Array.isArray(d) && Array.isArray(u)) {
         if ((f.endsWith(".columns") || f.endsWith(".params")) && i(d, u, f)) return;
-        for (let m = 0; m < Math.max(d.length, u.length); m++) c(d[m], u[m], `${f}[${m}]`);
+        for (let m = 0; m < Math.max(d.length, u.length); m++) l(d[m], u[m], `${f}[${m}]`);
       } else if (d && u && typeof d == "object" && typeof u == "object" && !Array.isArray(d) && !Array.isArray(u)) {
         const m = d, w = u;
-        for (const g of /* @__PURE__ */ new Set([...Object.keys(m), ...Object.keys(w)])) c(m[g], w[g], `${f}.${g}`);
-      } else l("modified", f, d, u);
+        for (const g of /* @__PURE__ */ new Set([...Object.keys(m), ...Object.keys(w)])) l(m[g], w[g], `${f}.${g}`);
+      } else c("modified", f, d, u);
     }
   }
-  return c(n, o, "$"), s.truncated = s.totalChanges > s.changes.length, s;
+  return l(n, o, "$"), s.truncated = s.totalChanges > s.changes.length, s;
 }
-function F(e) {
+function E(e) {
   return !!e && typeof e == "object" && !Array.isArray(e);
 }
 function T(e, t, r) {
   typeof e == "string" ? r.push({ field: e, path: t }) : Array.isArray(e) && e.forEach((n, o) => T(n, `${t}[${o}]`, r));
 }
-function N(e, t, r) {
+function L(e, t, r) {
   if (Array.isArray(e)) {
-    e.forEach((n, o) => N(n, `${t}[${o}]`, r));
+    e.forEach((n, o) => L(n, `${t}[${o}]`, r));
     return;
   }
-  if (F(e))
+  if (E(e))
     for (const [n, o] of Object.entries(e))
-      ["field", "weightField"].includes(n) ? T(o, `${t}.${n}`, r) : n !== "value" && n !== "style" && N(o, `${t}.${n}`, r);
+      ["field", "weightField"].includes(n) ? T(o, `${t}.${n}`, r) : n !== "value" && n !== "style" && L(o, `${t}.${n}`, r);
 }
-function Y(e, t, r) {
+function X(e, t, r) {
   Array.isArray(e) && e.forEach((n, o) => {
-    F(n) && (typeof n.field == "string" && n.valueField !== void 0 && n.valueField !== n.field && r.summaries.add(n.field), T(n.valueField ?? n.field, `${t}[${o}].valueField`, r.fields), T(n.weightField, `${t}[${o}].weightField`, r.fields));
+    E(n) && (typeof n.field == "string" && n.valueField !== void 0 && n.valueField !== n.field && r.summaries.add(n.field), T(n.valueField ?? n.field, `${t}[${o}].valueField`, r.fields), T(n.weightField, `${t}[${o}].weightField`, r.fields));
   });
 }
-function Gr(e, t, r) {
+function ln(e, t, r) {
   for (const o of ["rowKey", "revisionField", "sourceTokenField"]) T(e[o], `${t}.${o}`, r.fields);
   if (!e.matrix && Array.isArray(e.columns) && e.columns.forEach((o, a) => {
-    F(o) && (typeof o.field == "string" && r.fields.push({ field: o.field, path: `${t}.columns[${a}].field`, summary: !0 }), N(o.rules, `${t}.columns[${a}].rules`, r.fields), N(o.visibleWhen, `${t}.columns[${a}].visibleWhen`, r.fields));
-  }), N(e.rowVisibleWhen, `${t}.rowVisibleWhen`, r.fields), Array.isArray(e.computed) && e.computed.forEach((o, a) => {
-    F(o) && (typeof o.field == "string" && r.generated.add(o.field), N(o.expression, `${t}.computed[${a}].expression`, r.fields), T(o.dependsOn, `${t}.computed[${a}].dependsOn`, r.fields), T(o.groupBy, `${t}.computed[${a}].groupBy`, r.fields));
+    E(o) && (typeof o.field == "string" && r.fields.push({ field: o.field, path: `${t}.columns[${a}].field`, summary: !0 }), L(o.rules, `${t}.columns[${a}].rules`, r.fields), L(o.visibleWhen, `${t}.columns[${a}].visibleWhen`, r.fields));
+  }), L(e.rowVisibleWhen, `${t}.rowVisibleWhen`, r.fields), Array.isArray(e.computed) && e.computed.forEach((o, a) => {
+    E(o) && (typeof o.field == "string" && r.generated.add(o.field), L(o.expression, `${t}.computed[${a}].expression`, r.fields), T(o.dependsOn, `${t}.computed[${a}].dependsOn`, r.fields), T(o.groupBy, `${t}.computed[${a}].groupBy`, r.fields));
   }), (Array.isArray(e.groups) ? e.groups : e.groupBy ? [e.groupBy] : []).forEach((o, a) => {
-    F(o) && (T(o.field, `${t}.groups[${a}].field`, r.fields), T(o.subtotal, `${t}.groups[${a}].subtotal`, r.fields), Y(o.aggregates, `${t}.groups[${a}].aggregates`, r));
-  }), F(e.grandTotal) && (T(e.grandTotal.fields, `${t}.grandTotal.fields`, r.fields), Y(e.grandTotal.aggregates, `${t}.grandTotal.aggregates`, r)), F(e.matrix) && (T(e.matrix.rowFields, `${t}.matrix.rowFields`, r.fields), T(e.matrix.columnFields, `${t}.matrix.columnFields`, r.fields), Y(e.matrix.measures, `${t}.matrix.measures`, r)), F(e.tree)) {
+    E(o) && (T(o.field, `${t}.groups[${a}].field`, r.fields), T(o.subtotal, `${t}.groups[${a}].subtotal`, r.fields), X(o.aggregates, `${t}.groups[${a}].aggregates`, r));
+  }), E(e.grandTotal) && (T(e.grandTotal.fields, `${t}.grandTotal.fields`, r.fields), X(e.grandTotal.aggregates, `${t}.grandTotal.aggregates`, r)), E(e.matrix) && (T(e.matrix.rowFields, `${t}.matrix.rowFields`, r.fields), T(e.matrix.columnFields, `${t}.matrix.columnFields`, r.fields), X(e.matrix.measures, `${t}.matrix.measures`, r)), E(e.tree)) {
     for (const o of ["idField", "parentField", "labelField"]) T(e.tree[o], `${t}.tree.${o}`, r.fields);
-    Y(e.tree.aggregates, `${t}.tree.aggregates`, r);
+    X(e.tree.aggregates, `${t}.tree.aggregates`, r);
   }
-  F(e.detail) && T(e.detail.parentKey, `${t}.detail.parentKey`, r.fields);
+  E(e.detail) && T(e.detail.parentKey, `${t}.detail.parentKey`, r.fields);
 }
-function ut(e) {
-  const t = [];
-  function r(n, o) {
-    if (Array.isArray(n)) {
-      n.forEach((a, s) => r(a, `${o}[${s}]`));
+function vt(e) {
+  const t = [], r = e.repeat, n = r ? { dataset: r.dataset, path: "$.template.repeat", fields: [], generated: /* @__PURE__ */ new Set(), summaries: /* @__PURE__ */ new Set() } : void 0;
+  n && r && (T(r.rowKey, "$.template.repeat.rowKey", n.fields), typeof r.copies == "object" && T(r.copies.field, "$.template.repeat.copies.field", n.fields), t.push(n));
+  function o(a, s) {
+    if (Array.isArray(a)) {
+      a.forEach((c, i) => o(c, `${s}[${i}]`));
       return;
     }
-    if (F(n)) {
-      if (typeof n.dataset == "string" && Array.isArray(n.columns)) {
-        const a = { dataset: n.dataset, path: o, fields: [], generated: /* @__PURE__ */ new Set(), summaries: /* @__PURE__ */ new Set() };
-        Gr(n, o, a), typeof n.foreignKey == "string" && T(n.foreignKey, `${o}.foreignKey`, a.fields), t.push(a);
+    if (E(a)) {
+      if (n && E(a.binding) && T(a.binding.field, `${s}.binding.field`, n.fields), typeof a.dataset == "string" && Array.isArray(a.columns)) {
+        const c = { dataset: a.dataset, path: s, fields: [], generated: /* @__PURE__ */ new Set(), summaries: /* @__PURE__ */ new Set() };
+        ln(a, s, c), typeof a.foreignKey == "string" && T(a.foreignKey, `${s}.foreignKey`, c.fields), t.push(c);
       }
-      for (const [a, s] of Object.entries(n)) r(s, `${o}.${a}`);
+      for (const [c, i] of Object.entries(a)) o(i, `${s}.${c}`);
     }
   }
-  return r(e, "$.template"), t;
+  return o(e, "$.template"), t;
 }
-function Dr(e, t, r) {
-  for (const n of ut(e)) {
+function dn(e, t, r) {
+  for (const n of vt(e)) {
     const o = Object.prototype.hasOwnProperty.call(t, n.dataset) ? t[n.dataset] : void 0;
     if (!o) {
       r.push({ code: "dataset", severity: "error", path: `${n.path}.dataset`, message: `未声明数据集 ${n.dataset}` });
       continue;
     }
     const a = new Set(o.fields.map((s) => s.field));
-    n.fields.forEach(({ field: s, path: l, summary: i }) => {
-      !a.has(s) && !n.generated.has(s) && !(i && n.summaries.has(s)) && r.push({ code: "field", severity: "error", path: l, field: s, message: `数据集 ${n.dataset} 缺少字段 ${s}` });
+    n.fields.forEach(({ field: s, path: c, summary: i }) => {
+      !a.has(s) && !n.generated.has(s) && !(i && n.summaries.has(s)) && r.push({ code: "field", severity: "error", path: c, field: s, message: `数据集 ${n.dataset} 缺少字段 ${s}` });
     });
   }
 }
-function zr(e, t, r, n) {
+function un(e, t, r, n) {
   const o = r.maxSampleRows ?? 1e3;
   let a;
   try {
-    a = xe(t, e.datasets, { maxRows: o });
+    a = Ie(t, e.datasets, { maxRows: o });
   } catch (i) {
     return n.push({ code: "sample", severity: "error", path: "$.fixtures", fixture: e.name, message: i instanceof Error ? i.message : String(i) }), !1;
   }
-  const s = Object.values(a).reduce((i, c) => i + c.length, 0);
+  const s = Object.values(a).reduce((i, l) => i + l.length, 0);
   if (s > o)
     return n.push({ code: "sample", severity: "error", path: "$.fixtures", fixture: e.name, message: `样例 ${s} 行超过预算 ${o}，请显式选择验收样例` }), !1;
-  const l = new Set(ut(t).map((i) => i.dataset));
-  for (const [i, c] of Object.entries(r.dataSchemas ?? {}).filter(([d]) => l.has(d)))
+  const c = new Set(vt(t).map((i) => i.dataset));
+  for (const [i, l] of Object.entries(r.dataSchemas ?? {}).filter(([d]) => c.has(d)))
     try {
-      const d = Fe(a[i], c, { path: `$.datasets.${i}`, maxRows: o });
+      const d = Ke(a[i], l, { path: `$.datasets.${i}`, maxRows: o });
       if (n.push(...d.issues.map((u) => ({ ...u, code: "sample", severity: "error", fixture: e.name }))), !d.ok) return !1;
     } catch (d) {
       return n.push({ code: "dataset", severity: "error", path: `$.dataSchemas.${i}`, message: String(d) }), !1;
     }
   return !0;
 }
-function qr(e, t, r) {
-  const n = t.pages[r.pageIndex]?.components[r.componentIndex], o = /^table:(\d+):(\d+)(?::|$)/.exec(n?.table?.id ?? "");
-  if (o) return { path: `$.template.pages[${o[1]}].components[${o[2]}]`, pageIndex: Number(o[1]), componentIndex: Number(o[2]) };
-  for (const [a, s] of e.pages.entries()) {
-    const l = s.components.findIndex((i) => i === n || n?.nid !== void 0 && "nid" in i && i.nid === n.nid);
-    if (l >= 0) return { path: `$.template.pages[${a}].components[${l}]`, pageIndex: a, componentIndex: l };
+function fn(e, t) {
+  const r = e.pages[t.pageIndex]?.components[t.componentIndex]?.meta?.labelSource;
+  if (r && typeof r == "object" && "pageIndex" in r && "componentIndex" in r && typeof r.pageIndex == "number" && typeof r.componentIndex == "number") return { path: `$.template.pages[${r.pageIndex}].components[${r.componentIndex}]`, pageIndex: r.pageIndex, componentIndex: r.componentIndex };
+  const n = e.pages[t.pageIndex]?.meta?.record;
+  if (n && typeof n == "object" && "templatePageIndex" in n && typeof n.templatePageIndex == "number") return { path: `$.template.pages[${n.templatePageIndex}].components[${t.componentIndex}]`, pageIndex: n.templatePageIndex, componentIndex: t.componentIndex };
+}
+function mn(e, t, r) {
+  const n = fn(t, r);
+  if (n) return n;
+  const o = t.pages[r.pageIndex]?.components[r.componentIndex], a = /^table:(\d+):(\d+)(?::|$)/.exec(o?.table?.id ?? "");
+  if (a) return { path: `$.template.pages[${a[1]}].components[${a[2]}]`, pageIndex: Number(a[1]), componentIndex: Number(a[2]) };
+  for (const [s, c] of e.pages.entries()) {
+    const i = c.components.findIndex((l) => l === o || o?.nid !== void 0 && "nid" in l && l.nid === o.nid);
+    if (i >= 0) return { path: `$.template.pages[${s}].components[${i}]`, pageIndex: s, componentIndex: i };
   }
   return { path: "$.template" };
 }
-function Jr(e, t, r, n, o) {
-  const a = yt(e.template.params ?? [], t.params ?? {});
-  if (o.issues.push(...a.issues.map((s) => ({ ...s, code: "params", severity: "error", fixture: t.name, path: s.path.replace(/^\$\.params/, `$.fixtures[${r}].params`) }))), !!a.ok && zr(t, e.template, n, o.issues))
+function gn(e, t, r, n, o) {
+  const a = kt(e.template.params ?? [], t.params ?? {});
+  if (o.issues.push(...a.issues.map((s) => ({ ...s, code: "params", severity: "error", fixture: t.name, path: s.path.replace(/^\$\.params/, `$.fixtures[${r}].params`) }))), !!a.ok && un(t, e.template, n, o.issues))
     try {
-      const { plan: s, warnings: l } = ve(e.template, t.datasets, { maxPages: n.maxPages ?? 100, maxCells: n.maxCells ?? 25e4 }), i = (n.formats ?? ["pdf", "xlsx"]).flatMap((c) => At(s, c));
-      o.issues.push(...l.map((c) => ({ code: "layout", severity: "warning", path: "$.template", fixture: t.name, message: c }))), o.issues.push(...i.map((c) => ({ code: "output", severity: n.strictOutputs ? "error" : "warning", ...qr(e.template, s, c), fixture: t.name, message: `${c.format}: ${c.message}` }))), o.samples.push({ name: t.name, pages: s.pages.length, rows: Ir(e.template, t.datasets), diagnostics: i });
+      const { plan: s, warnings: c } = xe(e.template, t.datasets, { maxPages: n.maxPages ?? 100, maxCells: n.maxCells ?? 25e4 }), i = (n.formats ?? ["pdf", "xlsx"]).flatMap((l) => zt(s, l));
+      o.issues.push(...c.map((l) => ({ code: "layout", severity: "warning", path: "$.template", fixture: t.name, message: l }))), o.issues.push(...i.map((l) => ({ code: "output", severity: n.strictOutputs ? "error" : "warning", ...mn(e.template, s, l), fixture: t.name, message: `${l.format}: ${l.message}`, diagnostic: l }))), o.samples.push({ name: t.name, pages: s.pages.length, rows: Xr(e.template, t.datasets), diagnostics: i });
     } catch (s) {
       o.issues.push({ code: "layout", severity: "error", path: "$.template", fixture: t.name, message: s instanceof Error ? s.message : String(s) });
     }
 }
-function Tn(e, t = {}) {
+function zn(e, t = {}) {
   const r = { ok: !1, issues: [], samples: [] };
   try {
     for (const [o, a] of [["maxPages", t.maxPages], ["maxCells", t.maxCells], ["maxSampleRows", t.maxSampleRows]]) if (a !== void 0 && (!Number.isSafeInteger(a) || a < 1)) throw new RangeError(`${o} must be a positive safe integer`);
     if ((t.fixtures?.length ?? 0) > 20) throw new RangeError("At most 20 review fixtures are allowed");
-    const n = le(e);
-    t.previous && (r.changes = Vr(t.previous, n), r.changes.breakingChanges && !t.allowBreakingChanges && r.issues.push({ code: "compatibility", severity: "error", path: "$.template", message: `${r.changes.breakingChanges} 项字段或结构变更需要明确确认兼容性` })), t.dataSchemas && Dr(n.template, t.dataSchemas, r.issues);
-    for (const [o, a] of (t.fixtures ?? []).entries()) Jr(n, a, o, t, r);
+    const n = de(e);
+    t.previous && (r.changes = cn(t.previous, n), r.changes.breakingChanges && !t.allowBreakingChanges && r.issues.push({ code: "compatibility", severity: "error", path: "$.template", message: `${r.changes.breakingChanges} 项字段或结构变更需要明确确认兼容性` })), t.dataSchemas && dn(n.template, t.dataSchemas, r.issues);
+    for (const [o, a] of (t.fixtures ?? []).entries()) gn(n, a, o, t, r);
     t.fixtures?.length || r.issues.push({ code: "sample", severity: "warning", path: "$.fixtures", message: "未提供验收样例，仅完成结构和字段检查，尚未验证排版与输出" });
   } catch (n) {
     r.issues.push({ code: "template", severity: "error", path: "$", message: n instanceof Error ? n.message : String(n) });
@@ -1583,34 +1688,35 @@ function Tn(e, t = {}) {
   return r.ok = r.issues.every((n) => n.severity !== "error"), r;
 }
 export {
-  $n as A,
-  Ir as B,
+  Dn as A,
+  Xr as B,
+  Yt as D,
   V as P,
   b as R,
-  L as a,
+  H as a,
   S as b,
-  hn as c,
-  wn as d,
-  $r as e,
-  fn as f,
-  gn as g,
-  pn as h,
-  B as i,
-  Mn as j,
-  Sn as k,
-  xn as l,
-  Vr as m,
-  mn as n,
-  J as o,
-  Xe as p,
-  Me as q,
-  vn as r,
-  ve as s,
-  sr as t,
-  Kt as u,
-  it as v,
-  bn as w,
-  I as x,
-  Tn as y,
-  yn as z
+  Kn as c,
+  Nn as d,
+  Wr as e,
+  Fn as f,
+  On as g,
+  jn as h,
+  W as i,
+  Wn as j,
+  Gn as k,
+  Vn as l,
+  cn as m,
+  An as n,
+  _ as o,
+  st as p,
+  Se as q,
+  Bn as r,
+  xe as s,
+  Tr as t,
+  qt as u,
+  pt as v,
+  Hn as w,
+  A as x,
+  zn as y,
+  Ln as z
 };