@agile-team/mach-report 2.11.2 → 2.12.0

package/dist/server-node.js

@@ -1,8 +1,8 @@
-import { parentPort as C, Worker as H } from "node:worker_threads";
-import { randomUUID as q, createHash as W } from "node:crypto";
-import { promises as l } from "node:fs";
-import v from "node:path";
-function K(e, t, n) {
+import { parentPort as H, Worker as K } 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)
     try {
       const o = e?.({ ...t });
@@ -11,13 +11,13 @@ function K(e, t, n) {
     } catch {
     }
 }
-function V(e, t, n) {
+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 G(e, t, n) {
-  V(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: "派生结果标记应为布尔值" }), F(e.source, `${t}.source`, n, !0), e.formula !== void 0 && typeof e.formula != "string" && n.push({ path: `${t}.formula`, message: "单元格公式应为字符串" });
+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 F(e, t, n, o = !1) {
+function U(e, t, n, o = !1) {
   if (e === void 0) return;
   if (!e || typeof e != "object" || Array.isArray(e)) {
     n.push({ path: t, message: "业务来源应为对象" });
@@ -32,7 +32,22 @@ function F(e, t, n, o = !1) {
   }
   r.sourceToken !== void 0 && typeof r.sourceToken != "string" && n.push({ path: `${t}.sourceToken`, message: "来源令牌应为字符串" });
 }
-const X = /* @__PURE__ */ new Set([
+function G(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 Y(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 ee = /* @__PURE__ */ new Set([
   "text",
   "image",
   "barcode",
@@ -42,19 +57,19 @@ const X = /* @__PURE__ */ new Set([
   "rect",
   "ellipse"
 ]);
-function N(e) {
+function A(e) {
   return typeof e == "object" && e !== null && !Array.isArray(e);
 }
-function Z(e, t, n, o) {
+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 Q(e, t, n) {
+function ne(e, t, n) {
   if (e !== void 0) {
     const o = `${t}.table`;
-    if (!N(e)) n.push({ path: o, message: "逻辑表来源应为对象" });
+    if (!A(e)) n.push({ path: o, message: "逻辑表来源应为对象" });
     else {
-      F(e.source, `${o}.source`, n), (typeof e.id != "string" || !e.id.trim()) && n.push({ path: `${o}.id`, message: "逻辑表 ID 应为非空字符串" });
+      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: "未知逻辑表行角色" });
       const s = e.rowIndex;
@@ -62,9 +77,9 @@ function Q(e, t, n) {
     }
   }
 }
-function Y(e, t, n, o) {
+function re(e, t, n, o) {
   if (e !== void 0)
-    if (!N(e) || !Array.isArray(e.cells))
+    if (!A(e) || !Array.isArray(e.cells))
       n.push({ path: `${t}.grid.cells`, message: "grid.cells 应为二维数组" });
     else {
       const r = e.paddingMm;
@@ -73,68 +88,82 @@ function Y(e, t, n, o) {
           n.push({ path: `${t}.grid.cells.${i}`, message: "行应为数组" });
           return;
         }
-        s.forEach((m, h) => {
-          if (m == null) return;
-          const u = `${t}.grid.cells.${i}.${h}`;
-          if (!N(m)) {
+        s.forEach((d, y) => {
+          if (d == null) return;
+          const u = `${t}.grid.cells.${i}.${y}`;
+          if (!A(d)) {
             n.push({ path: u, message: "网格单元格应为对象或 null" });
             return;
           }
-          G(m, u, n), Array.isArray(m.children) && m.children.forEach((b, k) => {
-            D(b, `${t}.grid.cells.${i}.${h}.children.${k}`, n, o);
+          V(d, u, n), Array.isArray(d.children) && d.children.forEach((b, k) => {
+            C(b, `${t}.grid.cells.${i}.${y}.children.${k}`, n, o);
           });
         });
       });
     }
 }
-function ee(e, t, n) {
+function oe(e, t, n) {
   e !== void 0 && (Array.isArray(e) ? e.forEach((o, r) => {
-    (!N(o) || !Array.isArray(o.segments)) && n.push({ path: `${t}.richParagraphs.${r}`, message: "段落缺少 segments 数组" });
+    (!A(o) || !Array.isArray(o.segments)) && n.push({ path: `${t}.richParagraphs.${r}`, message: "段落缺少 segments 数组" });
   }) : n.push({ path: `${t}.richParagraphs`, message: "richParagraphs 应为数组" }));
 }
-function D(e, t, n, o = []) {
-  if (!N(e)) {
+function C(e, t, n, o = []) {
+  if (!A(e)) {
     n.push({ path: t, message: "组件应为对象" });
     return;
   }
   const r = e.kind;
-  typeof r != "string" ? n.push({ path: `${t}.kind`, message: "组件缺少 kind 字符串" }) : X.has(r) || o.push({
+  typeof r != "string" ? n.push({ path: `${t}.kind`, message: "组件缺少 kind 字符串" }) : ee.has(r) || o.push({
     path: `${t}.kind`,
     message: `未知组件类型 ${JSON.stringify(r)}，将以兜底方式渲染`
   });
   for (const s of ["leftMm", "topMm", "widthMm", "heightMm"])
-    Z(e, s, t, n);
+    te(e, s, t, n);
   typeof e.leftMm == "number" && e.leftMm < -100 && n.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: "组件尺寸不能为负数" });
-  Q(e.table, 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" }), Y(e.grid, t, n, o), ee(e.richParagraphs, t, n);
+  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);
 }
-function te(e, t, n, o = []) {
-  if (!N(e)) {
+function se(e, t, n, o) {
+  if (e !== void 0)
+    for (const r of Y(e, t)) o.push({ path: `${n}.code${r.path ? `.${r.path}` : ""}`, message: r.message });
+}
+function F(e, t, n) {
+  if (!A(e)) return;
+  e.binding !== void 0 && n.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));
+    });
+  });
+}
+function ie(e, t, n, o = []) {
+  if (!A(e)) {
     n.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 i = e.components;
-  Array.isArray(i) ? Array.isArray(i) && i.forEach(
-    (m, h) => D(m, `${t}.components.${h}`, n, o)
-  ) : n.push({ path: `${t}.components`, message: "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 应为数组" });
 }
-function ne(e) {
-  const t = [], n = [], o = N(e) ? e.pages : void 0;
-  if (N(e) && e.requiresRecalculation !== void 0 && typeof e.requiresRecalculation != "boolean" && t.push({ path: "$.requiresRecalculation", message: "重算能力要求应为布尔值" }), !Array.isArray(o))
+function ae(e) {
+  const t = [], n = [], 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) => te(s, `$.pages.${i}`, t, n)), o.length > 2e3 && n.push({
+    o.forEach((s, i) => ie(s, `$.pages.${i}`, t, n)), o.length > 2e3 && n.push({
       path: "$.pages",
       message: `页数异常大（${o.length} 页），渲染与打印耗时可能显著增加`
     });
     const r = o.reduce(
-      (s, i) => s + (N(i) && Array.isArray(i.components) ? i.components.length : 0),
+      (s, i) => s + (A(i) && Array.isArray(i.components) ? i.components.length : 0),
       0
     );
     r > 5e4 && n.push({
@@ -144,7 +173,7 @@ function ne(e) {
   }
   return { ok: t.length === 0, errors: t, warnings: n };
 }
-const E = "mach-report-worker/1";
+const M = "mach-report-worker/1";
 class B extends Error {
   constructor(t) {
     super(t.message), this.name = t.name, this.code = t.code, this.path = t.path, this.issues = t.issues, this.diagnostics = t.diagnostics;
@@ -153,22 +182,22 @@ class B extends Error {
 function R(e) {
   return !!e && typeof e == "object" && !Array.isArray(e);
 }
-function re(e) {
+function ce(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 oe(e) {
+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 se(e) {
+function ue(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 ie(e, t) {
-  if (!R(e) || !re(e.stats) || !oe(e.diagnostics) || !se(e.revisions)) return !1;
-  if (t === "prepare") return ne(e.plan).ok;
+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 U(e) {
+function D(e) {
   if (!e || typeof e != "object") return { message: String(e) };
   const t = {};
   for (const n of ["code", "path", "field", "message"]) {
@@ -177,14 +206,14 @@ function U(e) {
   }
   return t;
 }
-function ae(e) {
-  const t = U(e);
+function de(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;
 }
-function ce(e) {
+function me(e) {
   if (!(e instanceof Error)) return { name: "Error", message: String(e) };
   const t = e;
   return {
@@ -192,89 +221,89 @@ function ce(e) {
     message: e.message,
     ...typeof t.code == "string" ? { code: t.code } : {},
     ...typeof t.path == "string" ? { path: t.path } : {},
-    ...Array.isArray(t.issues) ? { issues: t.issues.map(U) } : {},
-    ...Array.isArray(t.diagnostics) ? { diagnostics: t.diagnostics.map(ae) } : {}
+    ...Array.isArray(t.issues) ? { issues: t.issues.map(D) } : {},
+    ...Array.isArray(t.diagnostics) ? { diagnostics: t.diagnostics.map(de) } : {}
   };
 }
-function fe(e) {
+function ye(e) {
   if (!e || typeof e != "object") return !1;
   const t = e;
-  return t.protocol === E && 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.input && typeof t.input == "object";
 }
-async function ue(e, t, n) {
+async function le(e, t, n) {
   try {
     const o = t.operation === "prepare" ? await e.prepare({ ...t.input, onEvent: n }) : await e.export({ ...t.input, onEvent: n });
-    return { protocol: E, id: t.id, result: o };
+    return { protocol: M, id: t.id, result: o };
   } catch (o) {
-    return { protocol: E, id: t.id, error: ce(o) };
+    return { protocol: M, id: t.id, error: me(o) };
   }
 }
-function pe(e) {
+function he(e) {
   const t = e.result;
   return !t || !("bytes" in t) || !(t.bytes.buffer instanceof ArrayBuffer) ? [] : [t.bytes.buffer];
 }
-function de(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", "encode"].includes(e.stage) || !["started", "completed", "failed"].includes(e.status)) return !1;
+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;
   return e.completed === void 0 || e.total === void 0 || e.completed <= e.total;
 }
-let me = 0;
-function P(e) {
+let we = 0;
+function J(e) {
   const t = new Error("报表 Worker 任务已取消");
   return t.name = "AbortError", Object.defineProperty(t, "cause", { value: e }), t;
 }
-function ye(e, t) {
+function be(e, t) {
   if (!e || typeof e != "object") return;
   const n = e;
-  return n.protocol === E && n.id === t ? n : void 0;
+  return n.protocol === M && n.id === t ? n : void 0;
 }
-function le(e, t = {}) {
+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, m) => i?.aborted ? Promise.reject(P(i.reason)) : new Promise((h, u) => {
+  const o = (r, s, i, d) => i?.aborted ? Promise.reject(J(i.reason)) : new Promise((y, u) => {
     let b;
     try {
       b = e();
-    } catch (y) {
-      u(y);
+    } catch (l) {
+      u(l);
       return;
     }
-    const k = `mach-report-${Date.now()}-${++me}`;
+    const k = `mach-report-${Date.now()}-${++we}`;
     let p = !1, f = () => {
     }, c;
-    const d = (y, w) => {
+    const m = (l, w) => {
       p || (p = !0, c && clearTimeout(c), f(), i?.removeEventListener("abort", g), Promise.resolve().then(() => b.terminate()).then(
-        () => y === void 0 ? h(w) : u(y),
-        ($) => u(y ?? $)
+        () => l === void 0 ? y(w) : u(l),
+        (N) => u(l ?? N)
       ));
-    }, g = () => d(P(i?.reason)), A = (y) => {
-      const w = ye(y, k);
+    }, g = () => m(J(i?.reason)), x = (l) => {
+      const w = be(l, k);
       if (!(!w || p)) {
         if ("type" in w && w.type === "event") {
-          const $ = "event" in w ? w.event : void 0;
-          de($, s) ? K(m, $, i) : d(new Error("报表 Worker 返回无效阶段事件"));
+          const N = "event" in w ? w.event : void 0;
+          ge(N, s) ? Z(d, N, i) : m(new Error("报表 Worker 返回无效阶段事件"));
           return;
         }
-        w.error && typeof w.error.name == "string" && typeof w.error.message == "string" ? d(new B(w.error)) : ie(w.result, r) && (r !== "export" || "format" in w.result && "format" in s && w.result.format === s.format) ? d(void 0, w.result) : d(new Error("报表 Worker 返回无效响应"));
+        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 返回无效响应"));
       }
     };
     try {
-      if (f = b.subscribe(A, (y) => d(y ?? new Error("报表 Worker 执行失败"))), p) {
+      if (f = b.subscribe(x, (l) => m(l ?? new Error("报表 Worker 执行失败"))), p) {
         f();
         return;
       }
-      if (i?.addEventListener("abort", g, { once: !0 }), c = setTimeout(() => d(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 执行超过 ${n}ms` })), n), i?.aborted) g();
       else {
-        const { onEvent: y, signal: w, ...$ } = s;
-        b.postMessage({ protocol: E, id: k, operation: r, input: $ });
+        const { onEvent: l, signal: w, ...N } = s;
+        b.postMessage({ protocol: M, id: k, operation: r, input: N });
       }
-    } catch (y) {
-      d(y);
+    } catch (l) {
+      m(l);
     }
   });
   return { prepare: (r, s, i) => o("prepare", r, s, i), export: (r, s, i) => o("export", r, s, i) };
 }
-const he = new Uint32Array([
+const xe = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -339,35 +368,35 @@ const he = new Uint32Array([
   2756734187,
   3204031479,
   3329325298
-]), x = (e, t) => e >>> t | e << 32 - t;
-function ge(e, t, n) {
+]), $ = (e, t) => e >>> t | e << 32 - t;
+function $e(e, t, n) {
   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], m = x(s, 7) ^ x(s, 18) ^ s >>> 3, h = x(i, 17) ^ x(i, 19) ^ i >>> 10;
-    n[r] = n[r - 16] + m + n[r - 7] + h;
+    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;
   }
 }
-function we(e, t) {
-  let n = e[0], o = e[1], r = e[2], s = e[3], i = e[4], m = e[5], h = e[6], u = e[7];
+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];
   for (let b = 0; b < 64; b++) {
-    const k = x(i, 6) ^ x(i, 11) ^ x(i, 25), p = i & m ^ ~i & h, f = u + k + p + he[b] + t[b] >>> 0, c = x(n, 2) ^ x(n, 13) ^ x(n, 22), d = n & o ^ n & r ^ o & r, g = c + d >>> 0;
-    u = h, h = m, m = 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 + 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;
   }
-  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] + m, e[6] = e[6] + h, e[7] = e[7] + u;
+  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;
 }
-function be(e) {
+function Ne(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 Ae = () => new Uint32Array([1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]), xe = (e) => Array.from(e, (t) => t.toString(16).padStart(8, "0")).join("");
-async function ke(e) {
-  const t = be(e), n = Ae(), o = new Uint32Array(64);
+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)), ge(t, r, o), we(n, o);
-  return xe(n);
+    r > 0 && r % 262144 === 0 && await new Promise((s) => setTimeout(s, 0)), $e(t, r, o), ke(n, o);
+  return Se(n);
 }
 class a extends Error {
   constructor(t, n) {
@@ -377,7 +406,7 @@ class a extends Error {
 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 $e(e) {
+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 对象");
   if (Object.getOwnPropertySymbols(e).length) throw new a("input", "任务不能包含Symbol");
@@ -385,17 +414,17 @@ function $e(e) {
   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 Ne(e, t) {
+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 S(e, t = {}) {
+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;
   const i = /* @__PURE__ */ new Set();
-  function m(u, b) {
+  function d(u, b) {
     if (++r > n || b > 32) throw new a("input", "任务数据超过节点或深度预算");
     if (typeof u == "string") {
       if (s += u.length, s > o) throw new a("input", "任务文本超过预算");
@@ -403,36 +432,36 @@ function S(e, t = {}) {
     }
     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 = $e(u);
+    const k = Array.isArray(u), p = Me(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] = m(Ne(u, c), b + 1);
+      f[c] = d(Ee(u, c), b + 1);
     }
-    return i.delete(u), k ? Array.from({ length: u.length }, (c, d) => f[String(d)]) : f;
+    return i.delete(u), k ? Array.from({ length: u.length }, (c, m) => f[String(m)]) : f;
   }
-  const h = JSON.stringify(m(e, 0));
-  if (h.length > o) throw new a("input", "任务序列化数据超过字符预算");
-  return h;
+  const y = JSON.stringify(d(e, 0));
+  if (y.length > o) throw new a("input", "任务序列化数据超过字符预算");
+  return y;
 }
 function j(e) {
   return JSON.parse(JSON.stringify(e));
 }
-function z(e, t, n, o) {
+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", "任务状态无效");
   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", "任务类型无效");
-  S(e.request.payload, { maxNodes: 19e3, maxCharacters: 75e4 }), S(e);
+  v(e.request.payload, { maxNodes: 19e3, maxCharacters: 75e4 }), v(e);
 }
-function Se(e, t) {
-  if (e && (e.createdAt !== t.createdAt || S(e.request) !== S(t.request))) throw new a("input", "任务创建时间与请求不可变更，请使用新任务ID");
+function Oe(e, t) {
+  if (e && (e.createdAt !== t.createdAt || v(e.request) !== v(t.request))) throw new a("input", "任务创建时间与请求不可变更，请使用新任务ID");
 }
-function ve(e, t) {
+function Ie(e, t) {
   return e.status === "queued" || e.status === "running" && (e.lease?.expiresAt ?? 0) <= t;
 }
-function Re(e = {}) {
+function Te(e = {}) {
   const t = {
     maxRecords: e.maxRecords ?? 1e4,
     maxBytes: e.maxBytes ?? 67108864,
@@ -444,36 +473,36 @@ function Re(e = {}) {
   if (!Object.values(t).every((n) => Number.isSafeInteger(n) && n > 0) || t.controlReserveBytes < 4096) throw new a("input", "任务容量应为正整数，控制状态预留至少4096字节");
   return t;
 }
-function M(e) {
-  return new TextEncoder().encode(S(e)).byteLength;
+function E(e) {
+  return new TextEncoder().encode(v(e)).byteLength;
 }
-function L(e, t) {
+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 };
   delete o.result;
-  const r = e.result === void 0 ? 0 : M(e.result);
+  const r = e.result === void 0 ? 0 : E(e.result);
   if (r > t.maxResultBytes) throw new a("capacity", "任务结果超过独立预算，请保存文件引用");
-  return Math.max(M(n) + t.controlReserveBytes, M(o)) + r;
+  return Math.max(E(n) + t.controlReserveBytes, E(o)) + r;
 }
 function _(e) {
   return e.status !== "queued" && e.status !== "running";
 }
-function Ee(e) {
+function je(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", "幂等保留期与清理批量应为正整数");
   return t;
 }
-async function Me(e) {
-  const t = new TextEncoder().encode(S(e)), n = globalThis.crypto?.subtle;
-  if (!n) return ke(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 Oe(e, t) {
+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 Me(e.request), expiresAt: t };
+  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 };
 }
-function Ie(e) {
+function Je(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", "任务幂等摘要时间或修订无效");
 }
@@ -483,16 +512,16 @@ function I(e) {
 function O(e, t) {
   return W("sha256").update(JSON.stringify([e, t])).digest("hex") + ".json";
 }
-async function J(e) {
+async function q(e) {
   try {
-    return await l.readFile(e, "utf8");
+    return await h.readFile(e, "utf8");
   } catch (t) {
     if (I(t) === "ENOENT") return;
     throw t;
   }
 }
-async function Te(e, t) {
-  const n = await J(e);
+async function Pe(e, t) {
+  const n = await q(e);
   if (n === void 0) return;
   let o;
   try {
@@ -505,110 +534,110 @@ async function Te(e, t) {
     process.kill(o.pid, 0);
   } catch (r) {
     if (I(r) === "ESRCH") {
-      await l.unlink(e);
+      await h.unlink(e);
       return;
     }
     throw r;
   }
   throw new a("conflict", "任务目录的写入进程仍在运行");
 }
-async function je(e, t) {
+async function We(e, t) {
   if (!t) throw new a("conflict", "任务目录已有写入进程；多实例请使用数据库CAS适配器");
   const n = e + ".recovery";
   let o;
   try {
-    o = await l.open(n, "wx", 384);
+    o = await h.open(n, "wx", 384);
   } catch (r) {
     throw I(r) === "EEXIST" ? new a("conflict", "任务目录恢复正在进行，请稍后重试") : r;
   }
   try {
-    return await o.writeFile(JSON.stringify({ pid: process.pid })), await Te(e, !0), await l.open(e, "wx", 384);
+    return await o.writeFile(JSON.stringify({ pid: process.pid })), await Pe(e, !0), await h.open(e, "wx", 384);
   } finally {
-    await o.close(), await l.unlink(n);
+    await o.close(), await h.unlink(n);
   }
 }
-async function Je(e, t) {
-  const n = v.join(e, ".writer-lock"), o = q();
+async function Ue(e, t) {
+  const n = S.join(e, ".writer-lock"), o = P();
   let r;
   try {
-    r = await l.open(n, "wx", 384);
+    r = await h.open(n, "wx", 384);
   } catch (s) {
     if (I(s) !== "EEXIST") throw s;
-    r = await je(n, t);
+    r = await We(n, t);
   }
   try {
     await r.writeFile(JSON.stringify({ pid: process.pid, token: o })), await r.sync();
   } catch (s) {
-    throw await r.close(), await l.unlink(n).catch(() => {
+    throw await r.close(), await h.unlink(n).catch(() => {
     }), s;
   }
   return { file: n, token: o, handle: r };
 }
-function Be(e, t, n, o) {
+function Ce(e, t, n, o) {
   if ("tombstone" in n) {
     const r = n.tombstone;
-    if (Ie(r), T(r.scope, r.id), O(r.scope, r.id) !== t) throw new a("input", "持久任务摘要身份不匹配");
-    const s = M(r);
+    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 });
   } else {
-    if (z(n, n.scope, n.id, n.revision - 1), O(n.scope, n.id) !== t) throw new a("input", "持久任务文件身份不匹配");
-    const r = L(n, o);
+    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 (e.bytes > o.maxBytes || e.records.size > o.maxRecords || e.tombstoneBytes > o.maxTombstoneBytes || e.tombstones.size > o.maxTombstones) throw new a("capacity", "持久任务及控制状态预留超过目录预算");
 }
-async function Pe(e, t) {
-  const n = await l.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 l.unlink(v.join(e, s));
+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));
   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 };
   for (const s of o) {
-    const i = v.join(e, s);
-    if ((await l.stat(i)).size > 4e6) throw new a("capacity", "持久任务文件超过单文件预算");
-    Be(r, s, JSON.parse(await l.readFile(i, "utf8")), t);
+    const i = S.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);
   }
   return r;
 }
-async function qe(e, t, n) {
-  const o = v.join(e, `.pending-${q()}`);
+async function De(e, t, n) {
+  const o = S.join(e, `.pending-${P()}`);
   try {
-    const r = await l.open(o, "wx", 384);
+    const r = await h.open(o, "wx", 384);
     try {
       await r.writeFile(n), await r.sync();
     } finally {
       await r.close();
     }
-    await l.rename(o, v.join(e, t));
-    const s = await l.open(e, "r");
+    await h.rename(o, S.join(e, t));
+    const s = await h.open(e, "r");
     try {
       await s.sync();
     } finally {
       await s.close();
     }
   } finally {
-    await l.unlink(o).catch((r) => {
+    await h.unlink(o).catch((r) => {
       if (I(r) !== "ENOENT") throw r;
     });
   }
 }
-async function ze(e) {
-  const t = v.resolve(e.directory), n = Re(e);
-  await l.mkdir(t, { recursive: !0, mode: 448 });
-  const o = await Je(t, e.recoverDeadOwner ?? !1);
+async function Ke(e) {
+  const t = S.resolve(e.directory), n = Te(e);
+  await h.mkdir(t, { recursive: !0, mode: 448 });
+  const o = await Ue(t, e.recoverDeadOwner ?? !1);
   let r;
   try {
-    r = await Pe(t, n);
+    r = await Fe(t, n);
   } catch (p) {
-    throw await o.handle.close(), await l.unlink(o.file), p;
+    throw await o.handle.close(), await h.unlink(o.file), p;
   }
   let s = !1, i = Promise.resolve();
-  const m = () => {
+  const d = () => {
     if (s) throw new a("closed", "持久任务存储已关闭");
-  }, h = (p) => {
-    m();
+  }, y = (p) => {
+    d();
     const f = i.then(async () => {
-      if (JSON.parse(await l.readFile(o.file, "utf8")).token !== o.token) throw new a("closed", "持久任务存储写入锁已失效");
+      if (JSON.parse(await h.readFile(o.file, "utf8")).token !== o.token) throw new a("closed", "持久任务存储写入锁已失效");
       return p();
     });
     return i = f.then(() => {
@@ -616,57 +645,57 @@ async function ze(e) {
     }), f;
   }, u = async (p, f, c) => {
     try {
-      await qe(t, p, f);
-    } catch (d) {
-      throw await J(v.join(t, p)) === f && c(), d;
+      await De(t, p, f);
+    } catch (m) {
+      throw await q(S.join(t, p)) === f && c(), m;
     }
     c();
   };
   return {
     read: async (p, f) => {
-      m(), T(p, f), await i;
+      d(), T(p, f), await i;
       const c = r.records.get(O(p, f));
       return c ? j(c.record) : void 0;
     },
     readTombstone: async (p, f) => {
-      m(), T(p, f), await i;
+      d(), T(p, f), await i;
       const c = r.tombstones.get(O(p, f));
       return c ? j(c.value) : void 0;
     },
-    candidates: async (p, f) => (m(), await i, Array.from(r.records.values(), (c) => c.record).filter((c) => ve(c, p)).sort((c, d) => c.createdAt - d.createdAt).slice(0, f).map(j)),
-    compareAndSwap: async (p, f, c, d) => {
-      const g = JSON.parse(S(d));
-      return z(g, p, f, c), h(async () => {
-        const A = O(p, f), y = r.records.get(A);
-        if ((y?.record.revision ?? null) !== c || r.tombstones.has(A)) return !1;
-        Se(y?.record, g);
-        const w = L(g, n), $ = r.bytes - (y?.bytes ?? 0) + w;
-        if ($ > n.maxBytes || !y && r.records.size >= n.maxRecords) throw new a("capacity", "持久任务容量已满，请清理终态任务或扩大显式预算");
-        return await u(A, S(g), () => {
-          r.records.set(A, { record: g, bytes: w }), r.bytes = $;
+    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)),
+    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;
         }), !0;
       });
     },
     prune: async (p) => {
-      const f = Ee(p);
-      return h(async () => {
+      const f = je(p);
+      return y(async () => {
         const c = { archived: 0, expired: 0 };
-        for (const [d, g] of r.tombstones)
-          g.value.expiresAt > f.now || c.expired >= f.limit || (await l.unlink(v.join(t, d)), r.tombstones.delete(d), r.tombstoneBytes -= g.bytes, c.expired++);
-        for (const [d, g] of r.records) {
+        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 A = await Oe(g.record, f.now + f.tombstoneRetentionMs), y = M(A);
-          if (r.tombstones.size >= n.maxTombstones || r.tombstoneBytes + y > n.maxTombstoneBytes) break;
-          await u(d, S({ tombstone: A }), () => {
-            r.tombstones.set(d, { value: A, bytes: y }), r.tombstoneBytes += y, r.records.delete(d), r.bytes -= g.bytes;
+          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;
           }), c.archived++;
         }
         if (c.expired) {
-          const d = await l.open(t, "r");
+          const m = await h.open(t, "r");
           try {
-            await d.sync();
+            await m.sync();
           } finally {
-            await d.close();
+            await m.close();
           }
         }
         return c;
@@ -675,16 +704,16 @@ async function ze(e) {
     close: async () => {
       if (s) return;
       s = !0, await i, await o.handle.close();
-      const p = await J(o.file);
-      p && JSON.parse(p).token === o.token && await l.unlink(o.file);
+      const p = await q(o.file);
+      p && JSON.parse(p).token === o.token && await h.unlink(o.file);
     }
   };
 }
-function Le(e) {
+function Ze(e) {
   const t = e.filename ?? e.workerUrl;
   if (!t || e.filename && e.workerUrl) throw new TypeError("请且仅请指定 filename 或 workerUrl");
-  return le(() => {
-    const n = new H(t, e.workerOptions);
+  return Ae(() => {
+    const n = new K(t, e.workerOptions);
     return {
       postMessage: (o) => n.postMessage(o),
       terminate: () => n.terminate(),
@@ -697,21 +726,21 @@ function Le(e) {
     };
   }, e);
 }
-function _e(e) {
-  const t = C;
+function Qe(e) {
+  const t = H;
   if (!t) throw new Error("serveNodeReportWorker 只能在 worker_threads 中调用");
   const n = (o) => {
-    fe(o) && ue(e, o, (r) => t.postMessage({ protocol: E, id: o.id, type: "event", event: r })).then((r) => t.postMessage(r, pe(r)));
+    ye(o) && le(e, o, (r) => t.postMessage({ protocol: M, id: o.id, type: "event", event: r })).then((r) => t.postMessage(r, he(r)));
   };
   return t.on("message", n), () => t.off("message", n);
 }
-function Ce(e) {
+function Ve(e) {
   return W("sha256").update(e).digest("hex");
 }
 export {
   B as ReportWorkerError,
-  Le as createNodeReportExecutor,
-  ze as openFileReportJobStore,
-  Ce as reportArtifactSha256,
-  _e as serveNodeReportWorker
+  Ze as createNodeReportExecutor,
+  Ke as openFileReportJobStore,
+  Ve as reportArtifactSha256,
+  Qe as serveNodeReportWorker
 };