@agile-team/mach-report 2.12.0 → 2.14.0

package/dist/server-node.js

@@ -1,9 +1,9 @@
-import { parentPort as H, Worker as K } from "node:worker_threads";
+import { parentPort as _, Worker as H } from "node:worker_threads";
 import { randomUUID as P, createHash as W } from "node:crypto";
 import { promises as h } from "node:fs";
-import S from "node:path";
-function Z(e, t, n) {
-  if (!n?.aborted)
+import v from "node:path";
+function Z(e, t, r) {
+  if (!r?.aborted)
     try {
       const o = e?.({ ...t });
       o && typeof o.then == "function" && Promise.resolve(o).catch(() => {
@@ -11,43 +11,54 @@ function Z(e, t, n) {
     } catch {
     }
 }
-function Q(e, t, n) {
-  e.editable !== void 0 && typeof e.editable != "boolean" && n.push({ path: `${t}.editable`, message: "编辑控制应为布尔值" }), e.valueType !== void 0 && !["text", "number", "boolean"].includes(e.valueType) && n.push({ path: `${t}.valueType`, message: "编辑类型应为 text、number 或 boolean" });
+function Q(e) {
+  if (!e || typeof e != "object" || Array.isArray(e)) return !1;
+  const t = e, r = (o) => typeof o == "string" && o.trim().length > 0 && o.length <= 256;
+  return !r(t.datasetId) || !r(t.field) || t.tableId !== void 0 && !r(t.tableId) ? !1 : t.rowKey === void 0 ? !0 : typeof t.rowKey == "string" ? t.rowKey.trim().length > 0 && t.rowKey.length <= 1024 : typeof t.rowKey == "number" && Number.isFinite(t.rowKey);
 }
-function V(e, t, n) {
-  Q(e, t, n), e.indentMm !== void 0 && (typeof e.indentMm != "number" || !Number.isFinite(e.indentMm) || e.indentMm < 0) && n.push({ path: `${t}.indentMm`, message: "单元格缩进应为有限非负数" }), e.derived !== void 0 && typeof e.derived != "boolean" && n.push({ path: `${t}.derived`, message: "派生结果标记应为布尔值" }), U(e.source, `${t}.source`, n, !0), e.formula !== void 0 && typeof e.formula != "string" && n.push({ path: `${t}.formula`, message: "单元格公式应为字符串" });
+function V(e) {
+  return e === "missing-source" || e === "not-applicable" || e === "not-calculable";
 }
-function U(e, t, n, o = !1) {
+function G(e) {
+  return e.target !== void 0 && !Q(e.target) ? !1 : e.valueState === void 0 || V(e.valueState) && e.target !== void 0;
+}
+function X(e, t, r) {
+  e.editable !== void 0 && typeof e.editable != "boolean" && r.push({ path: `${t}.editable`, message: "编辑控制应为布尔值" }), e.valueType !== void 0 && !["text", "number", "boolean"].includes(e.valueType) && r.push({ path: `${t}.valueType`, message: "编辑类型应为 text、number 或 boolean" });
+}
+function Y(e, t, r) {
+  X(e, t, r), e.indentMm !== void 0 && (typeof e.indentMm != "number" || !Number.isFinite(e.indentMm) || e.indentMm < 0) && r.push({ path: `${t}.indentMm`, message: "单元格缩进应为有限非负数" }), e.derived !== void 0 && typeof e.derived != "boolean" && r.push({ path: `${t}.derived`, message: "派生结果标记应为布尔值" }), F(e.source, `${t}.source`, r, !0), e.formula !== void 0 && typeof e.formula != "string" && r.push({ path: `${t}.formula`, message: "单元格公式应为字符串" });
+}
+function F(e, t, r, o = !1) {
   if (e === void 0) return;
   if (!e || typeof e != "object" || Array.isArray(e)) {
-    n.push({ path: t, message: "业务来源应为对象" });
+    r.push({ path: t, message: "业务来源应为对象" });
     return;
   }
-  const r = e;
+  const n = e;
   for (const s of ["datasetId", ...o ? ["field"] : []])
-    (typeof r[s] != "string" || !r[s].trim()) && n.push({ path: `${t}.${s}`, message: "业务标识应为非空字符串" });
+    (typeof n[s] != "string" || !n[s].trim()) && r.push({ path: `${t}.${s}`, message: "业务标识应为非空字符串" });
   for (const s of ["rowKey", "revision"]) {
-    const i = r[s];
-    i === void 0 && !(o && s === "rowKey") || typeof i != "string" && !(typeof i == "number" && Number.isFinite(i)) && n.push({ path: `${t}.${s}`, message: "业务键及修订号应为字符串或有限数字" });
+    const i = n[s];
+    i === void 0 && !(o && s === "rowKey") || typeof i != "string" && !(typeof i == "number" && Number.isFinite(i)) && r.push({ path: `${t}.${s}`, message: "业务键及修订号应为字符串或有限数字" });
   }
-  r.sourceToken !== void 0 && typeof r.sourceToken != "string" && n.push({ path: `${t}.sourceToken`, message: "来源令牌应为字符串" });
+  n.sourceToken !== void 0 && typeof n.sourceToken != "string" && r.push({ path: `${t}.sourceToken`, message: "来源令牌应为字符串" });
 }
-function G(e) {
+function ee(e) {
   const t = [];
   return e.value !== void 0 && typeof e.value != "string" && t.push({ path: "value", message: "Symbol value must be a string." }), e.symbology !== void 0 && !["code128", "code39", "ean13", "ean8"].includes(e.symbology) && t.push({ path: "symbology", message: "Unsupported barcode symbology." }), e.errorCorrection !== void 0 && !["L", "M", "Q", "H"].includes(e.errorCorrection) && t.push({ path: "errorCorrection", message: "Unsupported QR error correction." }), e.showText !== void 0 && typeof e.showText != "boolean" && t.push({ path: "showText", message: "showText must be a boolean." }), t;
 }
-function X(e, t) {
-  const n = [];
-  return t !== "barcode" && t !== "qrcode" && n.push({ path: "", message: "code is only supported by barcode and qrcode components." }), t === "qrcode" && e.symbology !== void 0 && n.push({ path: "symbology", message: "QR components do not use a linear symbology." }), t === "qrcode" && e.showText === !0 && n.push({ path: "showText", message: "Use a separate text component below a QR code." }), t === "barcode" && e.errorCorrection !== void 0 && n.push({ path: "errorCorrection", message: "Linear barcodes do not use QR error correction." }), n;
+function te(e, t) {
+  const r = [];
+  return t !== "barcode" && t !== "qrcode" && r.push({ path: "", message: "code is only supported by barcode and qrcode components." }), t === "qrcode" && e.symbology !== void 0 && r.push({ path: "symbology", message: "QR components do not use a linear symbology." }), t === "qrcode" && e.showText === !0 && r.push({ path: "showText", message: "Use a separate text component below a QR code." }), t === "barcode" && e.errorCorrection !== void 0 && r.push({ path: "errorCorrection", message: "Linear barcodes do not use QR error correction." }), r;
 }
-function Y(e, t) {
+function re(e, t) {
   if (typeof e != "object" || e === null || Array.isArray(e)) return [{ path: "", message: "code must be an object." }];
-  const n = e, o = [...G(n), ...X(n, t)];
-  for (const i of Object.keys(n)) ["value", "symbology", "errorCorrection", "quietZoneModules", "showText"].includes(i) || o.push({ path: i, message: "Unknown symbol option." });
-  const r = n.symbology === "ean13" || n.symbology === "ean8", s = t === "qrcode" ? 4 : r ? 11 : 10;
-  return n.quietZoneModules !== void 0 && (!Number.isSafeInteger(n.quietZoneModules) || Number(n.quietZoneModules) < s || Number(n.quietZoneModules) > 64) && o.push({ path: "quietZoneModules", message: `Quiet zone must contain ${s}–64 whole modules.` }), o;
+  const r = e, o = [...ee(r), ...te(r, t)];
+  for (const i of Object.keys(r)) ["value", "symbology", "errorCorrection", "quietZoneModules", "showText"].includes(i) || o.push({ path: i, message: "Unknown symbol option." });
+  const n = r.symbology === "ean13" || r.symbology === "ean8", s = t === "qrcode" ? 4 : n ? 11 : 10;
+  return r.quietZoneModules !== void 0 && (!Number.isSafeInteger(r.quietZoneModules) || Number(r.quietZoneModules) < s || Number(r.quietZoneModules) > 64) && o.push({ path: "quietZoneModules", message: `Quiet zone must contain ${s}–64 whole modules.` }), o;
 }
-const ee = /* @__PURE__ */ new Set([
+const ne = /* @__PURE__ */ new Set([
   "text",
   "image",
   "barcode",
@@ -60,118 +71,118 @@ const ee = /* @__PURE__ */ new Set([
 function A(e) {
   return typeof e == "object" && e !== null && !Array.isArray(e);
 }
-function te(e, t, n, o) {
-  const r = e[t];
-  (typeof r != "number" || !Number.isFinite(r)) && o.push({ path: `${n}.${t}`, message: `应为有限数字，实际 ${JSON.stringify(r)}` });
+function oe(e, t, r, o) {
+  const n = e[t];
+  (typeof n != "number" || !Number.isFinite(n)) && o.push({ path: `${r}.${t}`, message: `应为有限数字，实际 ${JSON.stringify(n)}` });
 }
-function ne(e, t, n) {
+function se(e, t, r) {
   if (e !== void 0) {
     const o = `${t}.table`;
-    if (!A(e)) n.push({ path: o, message: "逻辑表来源应为对象" });
+    if (!A(e)) r.push({ path: o, message: "逻辑表来源应为对象" });
     else {
-      U(e.source, `${o}.source`, n), (typeof e.id != "string" || !e.id.trim()) && n.push({ path: `${o}.id`, message: "逻辑表 ID 应为非空字符串" });
-      const r = e.role;
-      ["header", "body", "group-header", "subtotal", "grand-total"].includes(r) || n.push({ path: `${o}.role`, message: "未知逻辑表行角色" });
+      F(e.source, `${o}.source`, r), (typeof e.id != "string" || !e.id.trim()) && r.push({ path: `${o}.id`, message: "逻辑表 ID 应为非空字符串" });
+      const n = e.role;
+      ["header", "body", "group-header", "subtotal", "grand-total"].includes(n) || r.push({ path: `${o}.role`, message: "未知逻辑表行角色" });
       const s = e.rowIndex;
-      (typeof s != "number" || !Number.isInteger(s) || (r === "header" ? s !== -1 : s < 0)) && n.push({ path: `${o}.rowIndex`, message: "表头索引应为 -1，内容行索引应为非负整数" }), (!Array.isArray(e.columnKeys) || e.columnKeys.some((i) => typeof i != "string")) && n.push({ path: `${o}.columnKeys`, message: "逻辑列字段应为字符串数组" }), e.layout !== void 0 && e.layout !== "page" && e.layout !== "wide" && n.push({ path: `${o}.layout`, message: "布局应为 page 或 wide" }), e.title !== void 0 && typeof e.title != "string" && n.push({ path: `${o}.title`, message: "逻辑表名称应为字符串" });
+      (typeof s != "number" || !Number.isInteger(s) || (n === "header" ? s !== -1 : s < 0)) && r.push({ path: `${o}.rowIndex`, message: "表头索引应为 -1，内容行索引应为非负整数" }), (!Array.isArray(e.columnKeys) || e.columnKeys.some((i) => typeof i != "string")) && r.push({ path: `${o}.columnKeys`, message: "逻辑列字段应为字符串数组" }), e.layout !== void 0 && e.layout !== "page" && e.layout !== "wide" && r.push({ path: `${o}.layout`, message: "布局应为 page 或 wide" }), e.title !== void 0 && typeof e.title != "string" && r.push({ path: `${o}.title`, message: "逻辑表名称应为字符串" });
     }
   }
 }
-function re(e, t, n, o) {
+function ie(e, t, r, o) {
   if (e !== void 0)
     if (!A(e) || !Array.isArray(e.cells))
-      n.push({ path: `${t}.grid.cells`, message: "grid.cells 应为二维数组" });
+      r.push({ path: `${t}.grid.cells`, message: "grid.cells 应为二维数组" });
     else {
-      const r = e.paddingMm;
-      r !== void 0 && (typeof r != "number" || !Number.isFinite(r) || r < 0) && n.push({ path: `${t}.grid.paddingMm`, message: "单元格内距应为有限非负数" }), e.cells.forEach((s, i) => {
+      const n = e.paddingMm;
+      n !== void 0 && (typeof n != "number" || !Number.isFinite(n) || n < 0) && r.push({ path: `${t}.grid.paddingMm`, message: "单元格内距应为有限非负数" }), e.cells.forEach((s, i) => {
         if (!Array.isArray(s)) {
-          n.push({ path: `${t}.grid.cells.${i}`, message: "行应为数组" });
+          r.push({ path: `${t}.grid.cells.${i}`, message: "行应为数组" });
           return;
         }
         s.forEach((d, y) => {
           if (d == null) return;
           const u = `${t}.grid.cells.${i}.${y}`;
           if (!A(d)) {
-            n.push({ path: u, message: "网格单元格应为对象或 null" });
+            r.push({ path: u, message: "网格单元格应为对象或 null" });
             return;
           }
-          V(d, u, n), Array.isArray(d.children) && d.children.forEach((b, k) => {
-            C(b, `${t}.grid.cells.${i}.${y}.children.${k}`, n, o);
+          Y(d, u, r), Array.isArray(d.children) && d.children.forEach((b, k) => {
+            U(b, `${t}.grid.cells.${i}.${y}.children.${k}`, r, o);
           });
         });
       });
     }
 }
-function oe(e, t, n) {
-  e !== void 0 && (Array.isArray(e) ? e.forEach((o, r) => {
-    (!A(o) || !Array.isArray(o.segments)) && n.push({ path: `${t}.richParagraphs.${r}`, message: "段落缺少 segments 数组" });
-  }) : n.push({ path: `${t}.richParagraphs`, message: "richParagraphs 应为数组" }));
+function ae(e, t, r) {
+  e !== void 0 && (Array.isArray(e) ? e.forEach((o, n) => {
+    (!A(o) || !Array.isArray(o.segments)) && r.push({ path: `${t}.richParagraphs.${n}`, message: "段落缺少 segments 数组" });
+  }) : r.push({ path: `${t}.richParagraphs`, message: "richParagraphs 应为数组" }));
 }
-function C(e, t, n, o = []) {
+function U(e, t, r, o = []) {
   if (!A(e)) {
-    n.push({ path: t, message: "组件应为对象" });
+    r.push({ path: t, message: "组件应为对象" });
     return;
   }
-  const r = e.kind;
-  typeof r != "string" ? n.push({ path: `${t}.kind`, message: "组件缺少 kind 字符串" }) : ee.has(r) || o.push({
+  const n = e.kind;
+  typeof n != "string" ? r.push({ path: `${t}.kind`, message: "组件缺少 kind 字符串" }) : ne.has(n) || o.push({
     path: `${t}.kind`,
-    message: `未知组件类型 ${JSON.stringify(r)}，将以兜底方式渲染`
+    message: `未知组件类型 ${JSON.stringify(n)}，将以兜底方式渲染`
   });
   for (const s of ["leftMm", "topMm", "widthMm", "heightMm"])
-    te(e, s, t, n);
-  typeof e.leftMm == "number" && e.leftMm < -100 && n.push({ path: `${t}.leftMm`, message: "几何数值异常（leftMm<-100）" });
+    oe(e, s, t, r);
+  typeof e.leftMm == "number" && e.leftMm < -100 && r.push({ path: `${t}.leftMm`, message: "几何数值异常（leftMm<-100）" });
   for (const s of ["widthMm", "heightMm"])
-    typeof e[s] == "number" && e[s] < 0 && n.push({ path: `${t}.${s}`, message: "组件尺寸不能为负数" });
-  ne(e.table, t, n), se(e.code, r, t, n), e.pageAnchor !== void 0 && !["header", "footer"].includes(e.pageAnchor) && n.push({ path: `${t}.pageAnchor`, message: "页面锚点应为 header 或 footer" }), e.lineDirection !== void 0 && !["down", "up"].includes(e.lineDirection) && n.push({ path: `${t}.lineDirection`, message: "线段方向应为 down 或 up" }), re(e.grid, t, n, o), oe(e.richParagraphs, t, n);
+    typeof e[s] == "number" && e[s] < 0 && r.push({ path: `${t}.${s}`, message: "组件尺寸不能为负数" });
+  se(e.table, t, r), ce(e.code, n, t, r), e.pageAnchor !== void 0 && !["header", "footer"].includes(e.pageAnchor) && r.push({ path: `${t}.pageAnchor`, message: "页面锚点应为 header 或 footer" }), e.lineDirection !== void 0 && !["down", "up"].includes(e.lineDirection) && r.push({ path: `${t}.lineDirection`, message: "线段方向应为 down 或 up" }), ie(e.grid, t, r, o), ae(e.richParagraphs, t, r);
 }
-function se(e, t, n, o) {
+function ce(e, t, r, o) {
   if (e !== void 0)
-    for (const r of Y(e, t)) o.push({ path: `${n}.code${r.path ? `.${r.path}` : ""}`, message: r.message });
+    for (const n of re(e, t)) o.push({ path: `${r}.code${n.path ? `.${n.path}` : ""}`, message: n.message });
 }
-function F(e, t, n) {
+function C(e, t, r) {
   if (!A(e)) return;
-  e.binding !== void 0 && n.push({ path: `${t}.binding`, message: "渲染计划不允许未解析字段绑定" });
+  e.binding !== void 0 && r.push({ path: `${t}.binding`, message: "渲染计划不允许未解析字段绑定" });
   const o = e.grid;
-  !A(o) || !Array.isArray(o.cells) || o.cells.forEach((r, s) => {
-    Array.isArray(r) && r.forEach((i, d) => {
-      !A(i) || !Array.isArray(i.children) || i.children.forEach((y, u) => F(y, `${t}.grid.cells.${s}.${d}.children.${u}`, n));
+  !A(o) || !Array.isArray(o.cells) || o.cells.forEach((n, s) => {
+    Array.isArray(n) && n.forEach((i, d) => {
+      !A(i) || !Array.isArray(i.children) || i.children.forEach((y, u) => C(y, `${t}.grid.cells.${s}.${d}.children.${u}`, r));
     });
   });
 }
-function ie(e, t, n, o = []) {
+function fe(e, t, r, o = []) {
   if (!A(e)) {
-    n.push({ path: t, message: "页应为对象" });
+    r.push({ path: t, message: "页应为对象" });
     return;
   }
-  const r = e.pageWidthMm, s = e.pageHeightMm;
-  (typeof r != "number" || !Number.isFinite(r) || r <= 0) && n.push({ path: `${t}.pageWidthMm`, message: `页宽非法: ${JSON.stringify(r)}` }), (typeof s != "number" || !(s > 0 && s < 5e3)) && n.push({ path: `${t}.pageHeightMm`, message: `页高非法: ${JSON.stringify(s)}` }), e.layout !== void 0 && e.layout !== "page" && e.layout !== "wide" && n.push({ path: `${t}.layout`, message: "布局应为 page 或 wide" });
+  const n = e.pageWidthMm, s = e.pageHeightMm;
+  (typeof n != "number" || !Number.isFinite(n) || n <= 0) && r.push({ path: `${t}.pageWidthMm`, message: `页宽非法: ${JSON.stringify(n)}` }), (typeof s != "number" || !(s > 0 && s < 5e3)) && r.push({ path: `${t}.pageHeightMm`, message: `页高非法: ${JSON.stringify(s)}` }), e.layout !== void 0 && e.layout !== "page" && e.layout !== "wide" && r.push({ path: `${t}.layout`, message: "布局应为 page 或 wide" });
   const i = e.components;
   Array.isArray(i) ? Array.isArray(i) && i.forEach((d, y) => {
-    C(d, `${t}.components.${y}`, n, o), F(d, `${t}.components.${y}`, n);
-  }) : n.push({ path: `${t}.components`, message: "components 应为数组" });
+    U(d, `${t}.components.${y}`, r, o), C(d, `${t}.components.${y}`, r);
+  }) : r.push({ path: `${t}.components`, message: "components 应为数组" });
 }
-function ae(e) {
-  const t = [], n = [], o = A(e) ? e.pages : void 0;
+function ue(e) {
+  const t = [], r = [], o = A(e) ? e.pages : void 0;
   if (A(e) && e.requiresRecalculation !== void 0 && typeof e.requiresRecalculation != "boolean" && t.push({ path: "$.requiresRecalculation", message: "重算能力要求应为布尔值" }), !Array.isArray(o))
     t.push({
       path: "$.pages",
       message: e == null ? "渲染计划为空" : "渲染计划缺少 pages 数组"
     });
   else {
-    o.forEach((s, i) => ie(s, `$.pages.${i}`, t, n)), o.length > 2e3 && n.push({
+    o.forEach((s, i) => fe(s, `$.pages.${i}`, t, r)), o.length > 2e3 && r.push({
       path: "$.pages",
       message: `页数异常大（${o.length} 页），渲染与打印耗时可能显著增加`
     });
-    const r = o.reduce(
+    const n = o.reduce(
       (s, i) => s + (A(i) && Array.isArray(i.components) ? i.components.length : 0),
       0
     );
-    r > 5e4 && n.push({
+    n > 5e4 && r.push({
       path: "$.pages",
-      message: `组件总数异常大（${r} 个），可能触发浏览器性能限制`
+      message: `组件总数异常大（${n} 个），可能触发浏览器性能限制`
     });
   }
-  return { ok: t.length === 0, errors: t, warnings: n };
+  return { ok: t.length === 0, errors: t, warnings: r };
 }
 const M = "mach-report-worker/1";
 class B extends Error {
@@ -182,38 +193,41 @@ class B extends Error {
 function R(e) {
   return !!e && typeof e == "object" && !Array.isArray(e);
 }
-function ce(e) {
+function pe(e) {
   return R(e) ? ["rows", "pages", "cells"].every((t) => typeof e[t] == "number" && Number.isSafeInteger(e[t]) && e[t] >= 0) && typeof e.durationMs == "number" && Number.isFinite(e.durationMs) && e.durationMs >= 0 : !1;
 }
-function fe(e) {
-  return Array.isArray(e) && e.every((t) => R(t) && typeof t.code == "string" && typeof t.message == "string" && ["info", "warning", "error"].includes(t.severity));
+function de(e) {
+  return Array.isArray(e) && e.every((t) => R(t) && typeof t.code == "string" && typeof t.message == "string" && ["info", "warning", "error"].includes(t.severity) && G(t));
 }
-function ue(e) {
+function me(e) {
   return R(e) && Object.values(e).every((t) => R(t) && (t.revision === void 0 || typeof t.revision == "string") && (t.sourceToken === void 0 || typeof t.sourceToken == "string"));
 }
-function pe(e, t) {
-  if (!R(e) || !ce(e.stats) || !fe(e.diagnostics) || !ue(e.revisions)) return !1;
-  if (t === "prepare") return ae(e.plan).ok;
-  const n = e.format === "pdf" ? "application/pdf" : "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet";
-  return e.bytes instanceof Uint8Array && (e.format === "pdf" || e.format === "xlsx") && e.contentType === n;
+function ye(e) {
+  return e === void 0 ? !0 : R(e) && ["heuristic", "provided", "font-bytes"].includes(e.textMetrics) && (e.fontFingerprint === void 0 || typeof e.fontFingerprint == "string" && /^[a-f0-9]{64}$/.test(e.fontFingerprint));
+}
+function le(e, t) {
+  if (!R(e) || !pe(e.stats) || !de(e.diagnostics) || !me(e.revisions) || !ye(e.layout)) return !1;
+  if (t === "prepare") return ue(e.plan).ok;
+  const r = e.format === "pdf" ? "application/pdf" : "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet";
+  return e.bytes instanceof Uint8Array && (e.format === "pdf" || e.format === "xlsx") && e.contentType === r;
 }
 function D(e) {
   if (!e || typeof e != "object") return { message: String(e) };
   const t = {};
-  for (const n of ["code", "path", "field", "message"]) {
-    const o = e[n];
-    typeof o == "string" && (t[n] = o);
+  for (const r of ["code", "path", "field", "message"]) {
+    const o = e[r];
+    typeof o == "string" && (t[r] = o);
   }
   return t;
 }
-function de(e) {
+function he(e) {
   const t = D(e);
   if (!R(e)) return t;
-  for (const n of ["format", "severity", "kind", "nid"]) typeof e[n] == "string" && (t[n] = e[n]);
-  for (const n of ["pageIndex", "componentIndex"]) Number.isSafeInteger(e[n]) && e[n] >= 0 && (t[n] = e[n]);
-  return Array.isArray(e.componentPath) && e.componentPath.every((n) => Number.isSafeInteger(n) && n >= 0) && (t.componentPath = e.componentPath), t;
+  for (const r of ["format", "severity", "kind", "nid"]) typeof e[r] == "string" && (t[r] = e[r]);
+  for (const r of ["pageIndex", "componentIndex"]) Number.isSafeInteger(e[r]) && e[r] >= 0 && (t[r] = e[r]);
+  return Array.isArray(e.componentPath) && e.componentPath.every((r) => Number.isSafeInteger(r) && r >= 0) && (t.componentPath = e.componentPath), t;
 }
-function me(e) {
+function ge(e) {
   if (!(e instanceof Error)) return { name: "Error", message: String(e) };
   const t = e;
   return {
@@ -222,45 +236,45 @@ function me(e) {
     ...typeof t.code == "string" ? { code: t.code } : {},
     ...typeof t.path == "string" ? { path: t.path } : {},
     ...Array.isArray(t.issues) ? { issues: t.issues.map(D) } : {},
-    ...Array.isArray(t.diagnostics) ? { diagnostics: t.diagnostics.map(de) } : {}
+    ...Array.isArray(t.diagnostics) ? { diagnostics: t.diagnostics.map(he) } : {}
   };
 }
-function ye(e) {
+function we(e) {
   if (!e || typeof e != "object") return !1;
   const t = e;
-  return t.protocol === M && typeof t.id == "string" && (t.operation === "prepare" || t.operation === "export") && !!t.input && typeof t.input == "object";
+  return t.protocol === M && typeof t.id == "string" && (t.operation === "prepare" || t.operation === "export" || t.operation === "exportPrepared") && !!t.input && typeof t.input == "object";
 }
-async function le(e, t, n) {
+async function be(e, t, r) {
   try {
-    const o = t.operation === "prepare" ? await e.prepare({ ...t.input, onEvent: n }) : await e.export({ ...t.input, onEvent: n });
+    const o = t.operation === "prepare" ? await e.prepare({ ...t.input, onEvent: r }) : t.operation === "exportPrepared" ? await e.exportPrepared({ ...t.input, onEvent: r }) : await e.export({ ...t.input, onEvent: r });
     return { protocol: M, id: t.id, result: o };
   } catch (o) {
-    return { protocol: M, id: t.id, error: me(o) };
+    return { protocol: M, id: t.id, error: ge(o) };
   }
 }
-function he(e) {
+function Ae(e) {
   const t = e.result;
   return !t || !("bytes" in t) || !(t.bytes.buffer instanceof ArrayBuffer) ? [] : [t.bytes.buffer];
 }
-function ge(e, t) {
-  if (!R(e) || typeof e.taskId != "string" || !e.taskId || t.taskId !== void 0 && e.taskId !== t.taskId || e.correlationId !== t.correlationId || e.reportId !== void 0 && (typeof e.reportId != "string" || !t.reportIds.includes(e.reportId)) || !["query", "validate", "layout", "assets", "encode"].includes(e.stage) || !["started", "completed", "failed"].includes(e.status)) return !1;
-  for (const n of ["completed", "total"]) if (e[n] !== void 0 && (typeof e[n] != "number" || !Number.isFinite(e[n]) || e[n] < 0)) return !1;
+function xe(e, t) {
+  if (!R(e) || typeof e.taskId != "string" || !e.taskId || t.taskId !== void 0 && e.taskId !== t.taskId || e.correlationId !== t.correlationId || e.reportId !== void 0 && (typeof e.reportId != "string" || !("reportIds" in t && t.reportIds.includes(e.reportId))) || !["query", "validate", "layout", "assets", "encode"].includes(e.stage) || !["started", "completed", "failed"].includes(e.status)) return !1;
+  for (const r of ["completed", "total"]) if (e[r] !== void 0 && (typeof e[r] != "number" || !Number.isFinite(e[r]) || e[r] < 0)) return !1;
   return e.completed === void 0 || e.total === void 0 || e.completed <= e.total;
 }
-let we = 0;
+let $e = 0;
 function J(e) {
   const t = new Error("报表 Worker 任务已取消");
   return t.name = "AbortError", Object.defineProperty(t, "cause", { value: e }), t;
 }
-function be(e, t) {
+function ke(e, t) {
   if (!e || typeof e != "object") return;
-  const n = e;
-  return n.protocol === M && n.id === t ? n : void 0;
+  const r = e;
+  return r.protocol === M && r.id === t ? r : void 0;
 }
-function Ae(e, t = {}) {
-  const n = t.timeoutMs ?? 12e4;
-  if (!Number.isFinite(n) || n <= 0 || n > 2147483647) throw new RangeError("Worker timeoutMs 应为正有限数字，且不能超过 2147483647");
-  const o = (r, s, i, d) => i?.aborted ? Promise.reject(J(i.reason)) : new Promise((y, u) => {
+function Ne(e, t = {}) {
+  const r = t.timeoutMs ?? 12e4;
+  if (!Number.isFinite(r) || r <= 0 || r > 2147483647) throw new RangeError("Worker timeoutMs 应为正有限数字，且不能超过 2147483647");
+  const o = (n, s, i, d) => i?.aborted ? Promise.reject(J(i.reason)) : new Promise((y, u) => {
     let b;
     try {
       b = e();
@@ -268,7 +282,7 @@ function Ae(e, t = {}) {
       u(l);
       return;
     }
-    const k = `mach-report-${Date.now()}-${++we}`;
+    const k = `mach-report-${Date.now()}-${++$e}`;
     let p = !1, f = () => {
     }, c;
     const m = (l, w) => {
@@ -277,14 +291,14 @@ function Ae(e, t = {}) {
         (N) => u(l ?? N)
       ));
     }, g = () => m(J(i?.reason)), x = (l) => {
-      const w = be(l, k);
+      const w = ke(l, k);
       if (!(!w || p)) {
         if ("type" in w && w.type === "event") {
           const N = "event" in w ? w.event : void 0;
-          ge(N, s) ? Z(d, N, i) : m(new Error("报表 Worker 返回无效阶段事件"));
+          xe(N, s) ? Z(d, N, i) : m(new Error("报表 Worker 返回无效阶段事件"));
           return;
         }
-        w.error && typeof w.error.name == "string" && typeof w.error.message == "string" ? m(new B(w.error)) : pe(w.result, r) && (r !== "export" || "format" in w.result && "format" in s && w.result.format === s.format) ? m(void 0, w.result) : m(new Error("报表 Worker 返回无效响应"));
+        w.error && typeof w.error.name == "string" && typeof w.error.message == "string" ? m(new B(w.error)) : le(w.result, n) && (n === "prepare" || "format" in w.result && "format" in s && w.result.format === s.format) ? m(void 0, w.result) : m(new Error("报表 Worker 返回无效响应"));
       }
     };
     try {
@@ -292,18 +306,18 @@ function Ae(e, t = {}) {
         f();
         return;
       }
-      if (i?.addEventListener("abort", g, { once: !0 }), c = setTimeout(() => m(new B({ name: "ReportRuntimeError", code: "timeout", message: `报表 Worker 执行超过 ${n}ms` })), n), i?.aborted) g();
+      if (i?.addEventListener("abort", g, { once: !0 }), c = setTimeout(() => m(new B({ name: "ReportRuntimeError", code: "timeout", message: `报表 Worker 执行超过 ${r}ms` })), r), i?.aborted) g();
       else {
         const { onEvent: l, signal: w, ...N } = s;
-        b.postMessage({ protocol: M, id: k, operation: r, input: N });
+        b.postMessage({ protocol: M, id: k, operation: n, input: N });
       }
     } catch (l) {
       m(l);
     }
   });
-  return { prepare: (r, s, i) => o("prepare", r, s, i), export: (r, s, i) => o("export", r, s, i) };
+  return { exportPrepared: (n, s, i) => o("exportPrepared", n, s, i), prepare: (n, s, i) => o("prepare", n, s, i), export: (n, s, i) => o("export", n, s, i) };
 }
-const xe = new Uint32Array([
+const Se = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -369,75 +383,75 @@ const xe = new Uint32Array([
   3204031479,
   3329325298
 ]), $ = (e, t) => e >>> t | e << 32 - t;
-function $e(e, t, n) {
+function ve(e, t, r) {
   const o = new DataView(e.buffer, e.byteOffset + t, 64);
-  for (let r = 0; r < 16; r++) n[r] = o.getUint32(r * 4);
-  for (let r = 16; r < 64; r++) {
-    const s = n[r - 15], i = n[r - 2], d = $(s, 7) ^ $(s, 18) ^ s >>> 3, y = $(i, 17) ^ $(i, 19) ^ i >>> 10;
-    n[r] = n[r - 16] + d + n[r - 7] + y;
+  for (let n = 0; n < 16; n++) r[n] = o.getUint32(n * 4);
+  for (let n = 16; n < 64; n++) {
+    const s = r[n - 15], i = r[n - 2], d = $(s, 7) ^ $(s, 18) ^ s >>> 3, y = $(i, 17) ^ $(i, 19) ^ i >>> 10;
+    r[n] = r[n - 16] + d + r[n - 7] + y;
   }
 }
-function ke(e, t) {
-  let n = e[0], o = e[1], r = e[2], s = e[3], i = e[4], d = e[5], y = e[6], u = e[7];
+function Re(e, t) {
+  let r = e[0], o = e[1], n = e[2], s = e[3], i = e[4], d = e[5], y = e[6], u = e[7];
   for (let b = 0; b < 64; b++) {
-    const k = $(i, 6) ^ $(i, 11) ^ $(i, 25), p = i & d ^ ~i & y, f = u + k + p + xe[b] + t[b] >>> 0, c = $(n, 2) ^ $(n, 13) ^ $(n, 22), m = n & o ^ n & r ^ o & r, g = c + m >>> 0;
-    u = y, y = d, d = i, i = s + f >>> 0, s = r, r = o, o = n, n = f + g >>> 0;
+    const k = $(i, 6) ^ $(i, 11) ^ $(i, 25), p = i & d ^ ~i & y, f = u + k + p + Se[b] + t[b] >>> 0, c = $(r, 2) ^ $(r, 13) ^ $(r, 22), m = r & o ^ r & n ^ o & n, g = c + m >>> 0;
+    u = y, y = d, d = i, i = s + f >>> 0, s = n, n = o, o = r, r = f + g >>> 0;
   }
-  e[0] = e[0] + n, e[1] = e[1] + o, e[2] = e[2] + r, e[3] = e[3] + s, e[4] = e[4] + i, e[5] = e[5] + d, e[6] = e[6] + y, e[7] = e[7] + u;
+  e[0] = e[0] + r, e[1] = e[1] + o, e[2] = e[2] + n, e[3] = e[3] + s, e[4] = e[4] + i, e[5] = e[5] + d, e[6] = e[6] + y, e[7] = e[7] + u;
 }
-function Ne(e) {
+function Me(e) {
   const t = new Uint8Array(Math.ceil((e.byteLength + 9) / 64) * 64);
   t.set(e), t[e.byteLength] = 128;
-  const n = new DataView(t.buffer);
-  return n.setUint32(t.length - 8, Math.floor(e.byteLength / 536870912)), n.setUint32(t.length - 4, e.byteLength * 8 >>> 0), t;
+  const r = new DataView(t.buffer);
+  return r.setUint32(t.length - 8, Math.floor(e.byteLength / 536870912)), r.setUint32(t.length - 4, e.byteLength * 8 >>> 0), t;
 }
-const ve = () => new Uint32Array([1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]), Se = (e) => Array.from(e, (t) => t.toString(16).padStart(8, "0")).join("");
-async function Re(e) {
-  const t = Ne(e), n = ve(), o = new Uint32Array(64);
-  for (let r = 0; r < t.length; r += 64)
-    r > 0 && r % 262144 === 0 && await new Promise((s) => setTimeout(s, 0)), $e(t, r, o), ke(n, o);
-  return Se(n);
+const Ee = () => new Uint32Array([1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]), Ie = (e) => Array.from(e, (t) => t.toString(16).padStart(8, "0")).join("");
+async function Oe(e) {
+  const t = Me(e), r = Ee(), o = new Uint32Array(64);
+  for (let n = 0; n < t.length; n += 64)
+    n > 0 && n % 262144 === 0 && await new Promise((s) => setTimeout(s, 0)), ve(t, n, o), Re(r, o);
+  return Ie(r);
 }
 class a extends Error {
-  constructor(t, n) {
-    super(n), this.code = t, this.name = "ReportJobError";
+  constructor(t, r) {
+    super(r), this.code = t, this.name = "ReportJobError";
   }
 }
 function T(e, t) {
   if (typeof e != "string" || !e.trim() || e.length > 256 || typeof t != "string" || t !== t.trim() || !/^[a-zA-Z0-9][a-zA-Z0-9_.:-]{0,127}$/.test(t)) throw new a("input", "任务范围应非空，ID应为1–128位安全标识");
 }
-function Me(e) {
-  const t = Array.isArray(e), n = Object.getPrototypeOf(e), o = Object.keys(e);
-  if (n !== (t ? Array.prototype : Object.prototype) && !(n === null && !t)) throw new a("input", "任务对象应为普通 JSON 对象");
+function Te(e) {
+  const t = Array.isArray(e), r = Object.getPrototypeOf(e), o = Object.keys(e);
+  if (r !== (t ? Array.prototype : Object.prototype) && !(r === null && !t)) throw new a("input", "任务对象应为普通 JSON 对象");
   if (Object.getOwnPropertySymbols(e).length) throw new a("input", "任务不能包含Symbol");
   if (Object.getOwnPropertyNames(e).filter((s) => !(t && s === "length")).length !== o.length) throw new a("input", "任务不能包含不可枚举属性");
   if (t && (o.length !== e.length || o.some((s) => s !== String(Number(s)) || !Number.isSafeInteger(Number(s)) || Number(s) < 0 || Number(s) >= e.length))) throw new a("input", "任务数组不能稀疏或包含额外属性");
   return o.sort();
 }
-function Ee(e, t) {
-  const n = Object.getOwnPropertyDescriptor(e, t);
-  if (["__proto__", "prototype", "constructor"].includes(t) || n.get || n.set) throw new a("input", "任务不能包含危险键或访问器");
-  return n.value;
+function je(e, t) {
+  const r = Object.getOwnPropertyDescriptor(e, t);
+  if (["__proto__", "prototype", "constructor"].includes(t) || r.get || r.set) throw new a("input", "任务不能包含危险键或访问器");
+  return r.value;
 }
-function v(e, t = {}) {
-  const n = t.maxNodes ?? 2e4, o = t.maxCharacters ?? 1e6;
-  if (!Number.isSafeInteger(n) || n < 1 || n > 2e4 || !Number.isSafeInteger(o) || o < 1 || o > 1e6) throw new a("input", "任务JSON预算无效");
-  let r = 0, s = 0;
+function S(e, t = {}) {
+  const r = t.maxNodes ?? 2e4, o = t.maxCharacters ?? 1e6;
+  if (!Number.isSafeInteger(r) || r < 1 || r > 2e4 || !Number.isSafeInteger(o) || o < 1 || o > 1e6) throw new a("input", "任务JSON预算无效");
+  let n = 0, s = 0;
   const i = /* @__PURE__ */ new Set();
   function d(u, b) {
-    if (++r > n || b > 32) throw new a("input", "任务数据超过节点或深度预算");
+    if (++n > r || b > 32) throw new a("input", "任务数据超过节点或深度预算");
     if (typeof u == "string") {
       if (s += u.length, s > o) throw new a("input", "任务文本超过预算");
       return u;
     }
     if (u === null || typeof u == "boolean" || typeof u == "number" && Number.isFinite(u)) return u;
     if (!u || typeof u != "object" || i.has(u)) throw new a("input", "任务只允许无循环的有限 JSON 值");
-    const k = Array.isArray(u), p = Me(u);
+    const k = Array.isArray(u), p = Te(u);
     i.add(u);
     const f = /* @__PURE__ */ Object.create(null);
     for (const c of p) {
       if (s += c.length, s > o) throw new a("input", "任务文本超过预算");
-      f[c] = d(Ee(u, c), b + 1);
+      f[c] = d(je(u, c), b + 1);
     }
     return i.delete(u), k ? Array.from({ length: u.length }, (c, m) => f[String(m)]) : f;
   }
@@ -448,20 +462,20 @@ function v(e, t = {}) {
 function j(e) {
   return JSON.parse(JSON.stringify(e));
 }
-function L(e, t, n, o) {
-  if (T(t, n), e.scope !== t || e.id !== n || e.revision !== (o ?? 0) + 1 || !Number.isSafeInteger(e.revision)) throw new a("input", "任务身份或修订不匹配");
-  if (![e.createdAt, e.updatedAt, e.attempt].every((r) => Number.isSafeInteger(r) && r >= 0) || !["queued", "running", "completed", "failed", "cancelled"].includes(e.status)) throw new a("input", "任务状态无效");
+function K(e, t, r, o) {
+  if (T(t, r), e.scope !== t || e.id !== r || e.revision !== (o ?? 0) + 1 || !Number.isSafeInteger(e.revision)) throw new a("input", "任务身份或修订不匹配");
+  if (![e.createdAt, e.updatedAt, e.attempt].every((n) => Number.isSafeInteger(n) && n >= 0) || !["queued", "running", "completed", "failed", "cancelled"].includes(e.status)) throw new a("input", "任务状态无效");
   if (e.lease && (!e.lease.owner || !Number.isSafeInteger(e.lease.expiresAt))) throw new a("input", "任务租约无效");
   if (!e.request || typeof e.request.kind != "string" || !e.request.kind.trim() || e.request.kind.length > 128) throw new a("input", "任务类型无效");
-  v(e.request.payload, { maxNodes: 19e3, maxCharacters: 75e4 }), v(e);
+  S(e.request.payload, { maxNodes: 19e3, maxCharacters: 75e4 }), S(e);
 }
-function Oe(e, t) {
-  if (e && (e.createdAt !== t.createdAt || v(e.request) !== v(t.request))) throw new a("input", "任务创建时间与请求不可变更，请使用新任务ID");
+function qe(e, t) {
+  if (e && (e.createdAt !== t.createdAt || S(e.request) !== S(t.request))) throw new a("input", "任务创建时间与请求不可变更，请使用新任务ID");
 }
-function Ie(e, t) {
+function Be(e, t) {
   return e.status === "queued" || e.status === "running" && (e.lease?.expiresAt ?? 0) <= t;
 }
-function Te(e = {}) {
+function Je(e = {}) {
   const t = {
     maxRecords: e.maxRecords ?? 1e4,
     maxBytes: e.maxBytes ?? 67108864,
@@ -470,145 +484,145 @@ function Te(e = {}) {
     maxTombstones: e.maxTombstones ?? 1e4,
     maxTombstoneBytes: e.maxTombstoneBytes ?? 16777216
   };
-  if (!Object.values(t).every((n) => Number.isSafeInteger(n) && n > 0) || t.controlReserveBytes < 4096) throw new a("input", "任务容量应为正整数，控制状态预留至少4096字节");
+  if (!Object.values(t).every((r) => Number.isSafeInteger(r) && r > 0) || t.controlReserveBytes < 4096) throw new a("input", "任务容量应为正整数，控制状态预留至少4096字节");
   return t;
 }
 function E(e) {
-  return new TextEncoder().encode(v(e)).byteLength;
+  return new TextEncoder().encode(S(e)).byteLength;
 }
-function z(e, t) {
-  const n = { scope: e.scope, id: e.id, revision: 1, request: e.request, status: "queued", createdAt: e.createdAt, updatedAt: e.createdAt, attempt: 0 }, o = { ...e };
+function L(e, t) {
+  const r = { scope: e.scope, id: e.id, revision: 1, request: e.request, status: "queued", createdAt: e.createdAt, updatedAt: e.createdAt, attempt: 0 }, o = { ...e };
   delete o.result;
-  const r = e.result === void 0 ? 0 : E(e.result);
-  if (r > t.maxResultBytes) throw new a("capacity", "任务结果超过独立预算，请保存文件引用");
-  return Math.max(E(n) + t.controlReserveBytes, E(o)) + r;
+  const n = e.result === void 0 ? 0 : E(e.result);
+  if (n > t.maxResultBytes) throw new a("capacity", "任务结果超过独立预算，请保存文件引用");
+  return Math.max(E(r) + t.controlReserveBytes, E(o)) + n;
 }
-function _(e) {
+function z(e) {
   return e.status !== "queued" && e.status !== "running";
 }
-function je(e) {
+function Pe(e) {
   const t = { ...e, tombstoneRetentionMs: e.tombstoneRetentionMs ?? 6048e5, limit: e.limit ?? 100 };
-  if (![t.now, t.terminalBefore].every((n) => Number.isSafeInteger(n) && n >= 0) || t.terminalBefore > t.now) throw new a("input", "终态清理时间应为不超过当前时间的非负整数");
-  if (![t.tombstoneRetentionMs, t.limit].every((n) => Number.isSafeInteger(n) && n > 0) || !Number.isSafeInteger(t.now + t.tombstoneRetentionMs)) throw new a("input", "幂等保留期与清理批量应为正整数");
+  if (![t.now, t.terminalBefore].every((r) => Number.isSafeInteger(r) && r >= 0) || t.terminalBefore > t.now) throw new a("input", "终态清理时间应为不超过当前时间的非负整数");
+  if (![t.tombstoneRetentionMs, t.limit].every((r) => Number.isSafeInteger(r) && r > 0) || !Number.isSafeInteger(t.now + t.tombstoneRetentionMs)) throw new a("input", "幂等保留期与清理批量应为正整数");
   return t;
 }
-async function qe(e) {
-  const t = new TextEncoder().encode(v(e)), n = globalThis.crypto?.subtle;
-  if (!n) return Re(t);
-  const o = await n.digest("SHA-256", t);
-  return Array.from(new Uint8Array(o), (r) => r.toString(16).padStart(2, "0")).join("");
+async function We(e) {
+  const t = new TextEncoder().encode(S(e)), r = globalThis.crypto?.subtle;
+  if (!r) return Oe(t);
+  const o = await r.digest("SHA-256", t);
+  return Array.from(new Uint8Array(o), (n) => n.toString(16).padStart(2, "0")).join("");
 }
-async function Be(e, t) {
-  if (!_(e)) throw new a("input", "只能归档终态任务");
-  return { scope: e.scope, id: e.id, revision: e.revision, status: e.status, createdAt: e.createdAt, updatedAt: e.updatedAt, attempt: e.attempt, requestHash: await qe(e.request), expiresAt: t };
+async function Fe(e, t) {
+  if (!z(e)) throw new a("input", "只能归档终态任务");
+  return { scope: e.scope, id: e.id, revision: e.revision, status: e.status, createdAt: e.createdAt, updatedAt: e.updatedAt, attempt: e.attempt, requestHash: await We(e.request), expiresAt: t };
 }
-function Je(e) {
+function Ue(e) {
   if (!e || !["completed", "failed", "cancelled"].includes(e.status) || !/^[a-f0-9]{64}$/.test(e.requestHash)) throw new a("input", "任务幂等摘要无效");
   if (![e.revision, e.createdAt, e.updatedAt, e.attempt, e.expiresAt].every((t) => Number.isSafeInteger(t) && t >= 0) || e.revision < 1) throw new a("input", "任务幂等摘要时间或修订无效");
 }
-function I(e) {
+function O(e) {
   return e?.code;
 }
-function O(e, t) {
+function I(e, t) {
   return W("sha256").update(JSON.stringify([e, t])).digest("hex") + ".json";
 }
 async function q(e) {
   try {
     return await h.readFile(e, "utf8");
   } catch (t) {
-    if (I(t) === "ENOENT") return;
+    if (O(t) === "ENOENT") return;
     throw t;
   }
 }
-async function Pe(e, t) {
-  const n = await q(e);
-  if (n === void 0) return;
+async function Ce(e, t) {
+  const r = await q(e);
+  if (r === void 0) return;
   let o;
   try {
-    o = JSON.parse(n);
+    o = JSON.parse(r);
   } catch {
     throw new a("conflict", "任务锁尚未完整写入或已损坏，拒绝自动移除");
   }
   if (!o || !Number.isSafeInteger(o.pid) || o.pid < 1) throw new a("conflict", "任务锁身份无效，拒绝自动移除");
   try {
     process.kill(o.pid, 0);
-  } catch (r) {
-    if (I(r) === "ESRCH") {
+  } catch (n) {
+    if (O(n) === "ESRCH") {
       await h.unlink(e);
       return;
     }
-    throw r;
+    throw n;
   }
   throw new a("conflict", "任务目录的写入进程仍在运行");
 }
-async function We(e, t) {
+async function De(e, t) {
   if (!t) throw new a("conflict", "任务目录已有写入进程；多实例请使用数据库CAS适配器");
-  const n = e + ".recovery";
+  const r = e + ".recovery";
   let o;
   try {
-    o = await h.open(n, "wx", 384);
-  } catch (r) {
-    throw I(r) === "EEXIST" ? new a("conflict", "任务目录恢复正在进行，请稍后重试") : r;
+    o = await h.open(r, "wx", 384);
+  } catch (n) {
+    throw O(n) === "EEXIST" ? new a("conflict", "任务目录恢复正在进行，请稍后重试") : n;
   }
   try {
-    return await o.writeFile(JSON.stringify({ pid: process.pid })), await Pe(e, !0), await h.open(e, "wx", 384);
+    return await o.writeFile(JSON.stringify({ pid: process.pid })), await Ce(e, !0), await h.open(e, "wx", 384);
   } finally {
-    await o.close(), await h.unlink(n);
+    await o.close(), await h.unlink(r);
   }
 }
-async function Ue(e, t) {
-  const n = S.join(e, ".writer-lock"), o = P();
-  let r;
+async function Ke(e, t) {
+  const r = v.join(e, ".writer-lock"), o = P();
+  let n;
   try {
-    r = await h.open(n, "wx", 384);
+    n = await h.open(r, "wx", 384);
   } catch (s) {
-    if (I(s) !== "EEXIST") throw s;
-    r = await We(n, t);
+    if (O(s) !== "EEXIST") throw s;
+    n = await De(r, t);
   }
   try {
-    await r.writeFile(JSON.stringify({ pid: process.pid, token: o })), await r.sync();
+    await n.writeFile(JSON.stringify({ pid: process.pid, token: o })), await n.sync();
   } catch (s) {
-    throw await r.close(), await h.unlink(n).catch(() => {
+    throw await n.close(), await h.unlink(r).catch(() => {
     }), s;
   }
-  return { file: n, token: o, handle: r };
-}
-function Ce(e, t, n, o) {
-  if ("tombstone" in n) {
-    const r = n.tombstone;
-    if (Je(r), T(r.scope, r.id), O(r.scope, r.id) !== t) throw new a("input", "持久任务摘要身份不匹配");
-    const s = E(r);
-    e.tombstoneBytes += s, e.tombstones.set(t, { value: r, bytes: s });
+  return { file: r, token: o, handle: n };
+}
+function Le(e, t, r, o) {
+  if ("tombstone" in r) {
+    const n = r.tombstone;
+    if (Ue(n), T(n.scope, n.id), I(n.scope, n.id) !== t) throw new a("input", "持久任务摘要身份不匹配");
+    const s = E(n);
+    e.tombstoneBytes += s, e.tombstones.set(t, { value: n, bytes: s });
   } else {
-    if (L(n, n.scope, n.id, n.revision - 1), O(n.scope, n.id) !== t) throw new a("input", "持久任务文件身份不匹配");
-    const r = z(n, o);
-    e.bytes += r, e.records.set(t, { record: n, bytes: r });
+    if (K(r, r.scope, r.id, r.revision - 1), I(r.scope, r.id) !== t) throw new a("input", "持久任务文件身份不匹配");
+    const n = L(r, o);
+    e.bytes += n, e.records.set(t, { record: r, bytes: n });
   }
   if (e.bytes > o.maxBytes || e.records.size > o.maxRecords || e.tombstoneBytes > o.maxTombstoneBytes || e.tombstones.size > o.maxTombstones) throw new a("capacity", "持久任务及控制状态预留超过目录预算");
 }
-async function Fe(e, t) {
-  const n = await h.readdir(e);
-  for (const s of n.filter((i) => /^\.pending-[a-f0-9]{8}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{12}$/.test(i))) await h.unlink(S.join(e, s));
-  const o = n.filter((s) => /^[a-f0-9]{64}\.json$/.test(s));
+async function ze(e, t) {
+  const r = await h.readdir(e);
+  for (const s of r.filter((i) => /^\.pending-[a-f0-9]{8}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{12}$/.test(i))) await h.unlink(v.join(e, s));
+  const o = r.filter((s) => /^[a-f0-9]{64}\.json$/.test(s));
   if (o.length > t.maxRecords + t.maxTombstones) throw new a("capacity", "持久任务数量超过目录预算");
-  const r = { records: /* @__PURE__ */ new Map(), tombstones: /* @__PURE__ */ new Map(), bytes: 0, tombstoneBytes: 0 };
+  const n = { records: /* @__PURE__ */ new Map(), tombstones: /* @__PURE__ */ new Map(), bytes: 0, tombstoneBytes: 0 };
   for (const s of o) {
-    const i = S.join(e, s);
+    const i = v.join(e, s);
     if ((await h.stat(i)).size > 4e6) throw new a("capacity", "持久任务文件超过单文件预算");
-    Ce(r, s, JSON.parse(await h.readFile(i, "utf8")), t);
+    Le(n, s, JSON.parse(await h.readFile(i, "utf8")), t);
   }
-  return r;
+  return n;
 }
-async function De(e, t, n) {
-  const o = S.join(e, `.pending-${P()}`);
+async function _e(e, t, r) {
+  const o = v.join(e, `.pending-${P()}`);
   try {
-    const r = await h.open(o, "wx", 384);
+    const n = await h.open(o, "wx", 384);
     try {
-      await r.writeFile(n), await r.sync();
+      await n.writeFile(r), await n.sync();
     } finally {
-      await r.close();
+      await n.close();
     }
-    await h.rename(o, S.join(e, t));
+    await h.rename(o, v.join(e, t));
     const s = await h.open(e, "r");
     try {
       await s.sync();
@@ -616,18 +630,18 @@ async function De(e, t, n) {
       await s.close();
     }
   } finally {
-    await h.unlink(o).catch((r) => {
-      if (I(r) !== "ENOENT") throw r;
+    await h.unlink(o).catch((n) => {
+      if (O(n) !== "ENOENT") throw n;
     });
   }
 }
-async function Ke(e) {
-  const t = S.resolve(e.directory), n = Te(e);
+async function Ge(e) {
+  const t = v.resolve(e.directory), r = Je(e);
   await h.mkdir(t, { recursive: !0, mode: 448 });
-  const o = await Ue(t, e.recoverDeadOwner ?? !1);
-  let r;
+  const o = await Ke(t, e.recoverDeadOwner ?? !1);
+  let n;
   try {
-    r = await Fe(t, n);
+    n = await ze(t, r);
   } catch (p) {
     throw await o.handle.close(), await h.unlink(o.file), p;
   }
@@ -645,49 +659,49 @@ async function Ke(e) {
     }), f;
   }, u = async (p, f, c) => {
     try {
-      await De(t, p, f);
+      await _e(t, p, f);
     } catch (m) {
-      throw await q(S.join(t, p)) === f && c(), m;
+      throw await q(v.join(t, p)) === f && c(), m;
     }
     c();
   };
   return {
     read: async (p, f) => {
       d(), T(p, f), await i;
-      const c = r.records.get(O(p, f));
+      const c = n.records.get(I(p, f));
       return c ? j(c.record) : void 0;
     },
     readTombstone: async (p, f) => {
       d(), T(p, f), await i;
-      const c = r.tombstones.get(O(p, f));
+      const c = n.tombstones.get(I(p, f));
       return c ? j(c.value) : void 0;
     },
-    candidates: async (p, f) => (d(), await i, Array.from(r.records.values(), (c) => c.record).filter((c) => Ie(c, p)).sort((c, m) => c.createdAt - m.createdAt).slice(0, f).map(j)),
+    candidates: async (p, f) => (d(), await i, Array.from(n.records.values(), (c) => c.record).filter((c) => Be(c, p)).sort((c, m) => c.createdAt - m.createdAt).slice(0, f).map(j)),
     compareAndSwap: async (p, f, c, m) => {
-      const g = JSON.parse(v(m));
-      return L(g, p, f, c), y(async () => {
-        const x = O(p, f), l = r.records.get(x);
-        if ((l?.record.revision ?? null) !== c || r.tombstones.has(x)) return !1;
-        Oe(l?.record, g);
-        const w = z(g, n), N = r.bytes - (l?.bytes ?? 0) + w;
-        if (N > n.maxBytes || !l && r.records.size >= n.maxRecords) throw new a("capacity", "持久任务容量已满，请清理终态任务或扩大显式预算");
-        return await u(x, v(g), () => {
-          r.records.set(x, { record: g, bytes: w }), r.bytes = N;
+      const g = JSON.parse(S(m));
+      return K(g, p, f, c), y(async () => {
+        const x = I(p, f), l = n.records.get(x);
+        if ((l?.record.revision ?? null) !== c || n.tombstones.has(x)) return !1;
+        qe(l?.record, g);
+        const w = L(g, r), N = n.bytes - (l?.bytes ?? 0) + w;
+        if (N > r.maxBytes || !l && n.records.size >= r.maxRecords) throw new a("capacity", "持久任务容量已满，请清理终态任务或扩大显式预算");
+        return await u(x, S(g), () => {
+          n.records.set(x, { record: g, bytes: w }), n.bytes = N;
         }), !0;
       });
     },
     prune: async (p) => {
-      const f = je(p);
+      const f = Pe(p);
       return y(async () => {
         const c = { archived: 0, expired: 0 };
-        for (const [m, g] of r.tombstones)
-          g.value.expiresAt > f.now || c.expired >= f.limit || (await h.unlink(S.join(t, m)), r.tombstones.delete(m), r.tombstoneBytes -= g.bytes, c.expired++);
-        for (const [m, g] of r.records) {
-          if (!_(g.record) || g.record.updatedAt > f.terminalBefore || c.archived + c.expired >= f.limit) continue;
-          const x = await Be(g.record, f.now + f.tombstoneRetentionMs), l = E(x);
-          if (r.tombstones.size >= n.maxTombstones || r.tombstoneBytes + l > n.maxTombstoneBytes) break;
-          await u(m, v({ tombstone: x }), () => {
-            r.tombstones.set(m, { value: x, bytes: l }), r.tombstoneBytes += l, r.records.delete(m), r.bytes -= g.bytes;
+        for (const [m, g] of n.tombstones)
+          g.value.expiresAt > f.now || c.expired >= f.limit || (await h.unlink(v.join(t, m)), n.tombstones.delete(m), n.tombstoneBytes -= g.bytes, c.expired++);
+        for (const [m, g] of n.records) {
+          if (!z(g.record) || g.record.updatedAt > f.terminalBefore || c.archived + c.expired >= f.limit) continue;
+          const x = await Fe(g.record, f.now + f.tombstoneRetentionMs), l = E(x);
+          if (n.tombstones.size >= r.maxTombstones || n.tombstoneBytes + l > r.maxTombstoneBytes) break;
+          await u(m, S({ tombstone: x }), () => {
+            n.tombstones.set(m, { value: x, bytes: l }), n.tombstoneBytes += l, n.records.delete(m), n.bytes -= g.bytes;
           }), c.archived++;
         }
         if (c.expired) {
@@ -709,38 +723,38 @@ async function Ke(e) {
     }
   };
 }
-function Ze(e) {
+function Xe(e) {
   const t = e.filename ?? e.workerUrl;
   if (!t || e.filename && e.workerUrl) throw new TypeError("请且仅请指定 filename 或 workerUrl");
-  return Ae(() => {
-    const n = new K(t, e.workerOptions);
+  return Ne(() => {
+    const r = new H(t, e.workerOptions);
     return {
-      postMessage: (o) => n.postMessage(o),
-      terminate: () => n.terminate(),
-      subscribe: (o, r) => {
-        const s = (i) => r(new Error(`报表 Worker 在响应前退出（code ${i}）`));
-        return n.on("message", o), n.on("error", r), n.on("messageerror", r), n.on("exit", s), () => {
-          n.off("message", o), n.off("error", r), n.off("messageerror", r), n.off("exit", s);
+      postMessage: (o) => r.postMessage(o),
+      terminate: () => r.terminate(),
+      subscribe: (o, n) => {
+        const s = (i) => n(new Error(`报表 Worker 在响应前退出（code ${i}）`));
+        return r.on("message", o), r.on("error", n), r.on("messageerror", n), r.on("exit", s), () => {
+          r.off("message", o), r.off("error", n), r.off("messageerror", n), r.off("exit", s);
         };
       }
     };
   }, e);
 }
-function Qe(e) {
-  const t = H;
+function Ye(e) {
+  const t = _;
   if (!t) throw new Error("serveNodeReportWorker 只能在 worker_threads 中调用");
-  const n = (o) => {
-    ye(o) && le(e, o, (r) => t.postMessage({ protocol: M, id: o.id, type: "event", event: r })).then((r) => t.postMessage(r, he(r)));
+  const r = (o) => {
+    we(o) && be(e, o, (n) => t.postMessage({ protocol: M, id: o.id, type: "event", event: n })).then((n) => t.postMessage(n, Ae(n)));
   };
-  return t.on("message", n), () => t.off("message", n);
+  return t.on("message", r), () => t.off("message", r);
 }
-function Ve(e) {
+function et(e) {
   return W("sha256").update(e).digest("hex");
 }
 export {
   B as ReportWorkerError,
-  Ze as createNodeReportExecutor,
-  Ke as openFileReportJobStore,
-  Ve as reportArtifactSha256,
-  Qe as serveNodeReportWorker
+  Xe as createNodeReportExecutor,
+  Ge as openFileReportJobStore,
+  et as reportArtifactSha256,
+  Ye as serveNodeReportWorker
 };