@agile-team/mach-report 2.10.0 → 2.11.0

package/dist/batch-mRqhhhjt.js

@@ -0,0 +1,364 @@
+class m extends Error {
+  constructor(t, n, r) {
+    super(n), this.code = t, this.path = r, this.name = "ReportRuntimeError";
+  }
+}
+function S(e) {
+  if (!e?.aborted) return;
+  if (e.reason instanceof m) throw e.reason;
+  const t = new Error("报表执行已取消");
+  throw t.name = "AbortError", Object.defineProperty(t, "cause", { value: e.reason }), t;
+}
+function Z(e, t, n) {
+  if (!Number.isFinite(n) || n < 0) throw new m("budget", `${t} 的执行统计无效`, `$.budget.${t}`);
+  const r = e[t];
+  if (r !== void 0 && n > r) throw new m("budget", `${t} 超出预算 ${r}（实际 ${n}）`, `$.budget.${t}`);
+}
+function F(e) {
+  for (const [t, n] of Object.entries(e)) {
+    if (n !== void 0 && (!Number.isFinite(n) || n <= 0)) throw new m("budget", `${t} 应为正有限数字`, `$.budget.${t}`);
+    if (t !== "maxDurationMs" && n !== void 0 && !Number.isSafeInteger(n)) throw new m("budget", `${t} 应为正安全整数`, `$.budget.${t}`);
+    if (t === "maxDurationMs" && n !== void 0 && n > 2147483647) throw new m("budget", "maxDurationMs 不能超过 2147483647", `$.budget.${t}`);
+  }
+}
+async function V(e, t, n) {
+  const r = new AbortController(), s = () => r.abort(e?.reason);
+  e?.addEventListener("abort", s, { once: !0 }), e?.aborted && s();
+  const a = Date.now(), c = t === void 0 ? void 0 : setTimeout(() => r.abort(new m("timeout", `报表执行超过 ${t}ms`)), t);
+  let d;
+  try {
+    S(r.signal);
+    const g = new Promise((u, i) => {
+      d = () => {
+        try {
+          S(r.signal);
+        } catch (w) {
+          i(w);
+        }
+      }, r.signal.addEventListener("abort", d, { once: !0 });
+    }), o = await Promise.race([n(r.signal), g]);
+    if (S(r.signal), t !== void 0 && Date.now() - a > t) throw new m("timeout", `报表执行超过 ${t}ms`);
+    return o;
+  } finally {
+    c !== void 0 && clearTimeout(c), d && r.signal.removeEventListener("abort", d), e?.removeEventListener("abort", s);
+  }
+}
+const B = new Uint32Array([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), y = (e, t) => e >>> t | e << 32 - t;
+function E(e, t, n) {
+  const r = new DataView(e.buffer, e.byteOffset + t, 64);
+  for (let s = 0; s < 16; s++) n[s] = r.getUint32(s * 4);
+  for (let s = 16; s < 64; s++) {
+    const a = n[s - 15], c = n[s - 2], d = y(a, 7) ^ y(a, 18) ^ a >>> 3, g = y(c, 17) ^ y(c, 19) ^ c >>> 10;
+    n[s] = n[s - 16] + d + n[s - 7] + g;
+  }
+}
+function O(e, t) {
+  let n = e[0], r = e[1], s = e[2], a = e[3], c = e[4], d = e[5], g = e[6], o = e[7];
+  for (let u = 0; u < 64; u++) {
+    const i = y(c, 6) ^ y(c, 11) ^ y(c, 25), w = c & d ^ ~c & g, f = o + i + w + B[u] + t[u] >>> 0, b = y(n, 2) ^ y(n, 13) ^ y(n, 22), h = n & r ^ n & s ^ r & s, A = b + h >>> 0;
+    o = g, g = d, d = c, c = a + f >>> 0, a = s, s = r, r = n, n = f + A >>> 0;
+  }
+  e[0] = e[0] + n, e[1] = e[1] + r, e[2] = e[2] + s, e[3] = e[3] + a, e[4] = e[4] + c, e[5] = e[5] + d, e[6] = e[6] + g, e[7] = e[7] + o;
+}
+function j(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 J = () => new Uint32Array([1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]), $ = (e) => Array.from(e, (t) => t.toString(16).padStart(8, "0")).join("");
+async function I(e) {
+  const t = j(e), n = J(), r = new Uint32Array(64);
+  for (let s = 0; s < t.length; s += 64)
+    s > 0 && s % 262144 === 0 && await new Promise((a) => setTimeout(a, 0)), E(t, s, r), O(n, r);
+  return $(n);
+}
+function q(e = {}) {
+  const t = {
+    maxRecords: e.maxRecords ?? 1e4,
+    maxBytes: e.maxBytes ?? 67108864,
+    maxResultBytes: e.maxResultBytes ?? 262144,
+    controlReserveBytes: e.controlReserveBytes ?? 4096,
+    maxTombstones: e.maxTombstones ?? 1e4,
+    maxTombstoneBytes: e.maxTombstoneBytes ?? 16777216
+  };
+  if (!Object.values(t).every((n) => Number.isSafeInteger(n) && n > 0) || t.controlReserveBytes < 4096) throw new l("input", "任务容量应为正整数，控制状态预留至少4096字节");
+  return t;
+}
+function v(e) {
+  return new TextEncoder().encode(p(e)).byteLength;
+}
+function N(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 }, r = { ...e };
+  delete r.result;
+  const s = e.result === void 0 ? 0 : v(e.result);
+  if (s > t.maxResultBytes) throw new l("capacity", "任务结果超过独立预算，请保存文件引用");
+  return Math.max(v(n) + t.controlReserveBytes, v(r)) + s;
+}
+function R(e) {
+  return e.status !== "queued" && e.status !== "running";
+}
+function T(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 l("input", "终态清理时间应为不超过当前时间的非负整数");
+  if (![t.tombstoneRetentionMs, t.limit].every((n) => Number.isSafeInteger(n) && n > 0) || !Number.isSafeInteger(t.now + t.tombstoneRetentionMs)) throw new l("input", "幂等保留期与清理批量应为正整数");
+  return t;
+}
+async function D(e) {
+  const t = new TextEncoder().encode(p(e)), n = globalThis.crypto?.subtle;
+  if (!n) return I(t);
+  const r = await n.digest("SHA-256", t);
+  return Array.from(new Uint8Array(r), (s) => s.toString(16).padStart(2, "0")).join("");
+}
+async function L(e, t) {
+  if (!R(e)) throw new l("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 D(e.request), expiresAt: t };
+}
+class l extends Error {
+  constructor(t, n) {
+    super(n), this.code = t, this.name = "ReportJobError";
+  }
+}
+function P(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 l("input", "任务范围应非空，ID应为1–128位安全标识");
+}
+function M(e) {
+  const t = Array.isArray(e), n = Object.getPrototypeOf(e), r = Object.keys(e);
+  if (n !== (t ? Array.prototype : Object.prototype) && !(n === null && !t)) throw new l("input", "任务对象应为普通 JSON 对象");
+  if (Object.getOwnPropertySymbols(e).length) throw new l("input", "任务不能包含Symbol");
+  if (Object.getOwnPropertyNames(e).filter((a) => !(t && a === "length")).length !== r.length) throw new l("input", "任务不能包含不可枚举属性");
+  if (t && (r.length !== e.length || r.some((a) => a !== String(Number(a)) || !Number.isSafeInteger(Number(a)) || Number(a) < 0 || Number(a) >= e.length))) throw new l("input", "任务数组不能稀疏或包含额外属性");
+  return r.sort();
+}
+function C(e, t) {
+  const n = Object.getOwnPropertyDescriptor(e, t);
+  if (["__proto__", "prototype", "constructor"].includes(t) || n.get || n.set) throw new l("input", "任务不能包含危险键或访问器");
+  return n.value;
+}
+function p(e, t = {}) {
+  const n = t.maxNodes ?? 2e4, r = t.maxCharacters ?? 1e6;
+  if (!Number.isSafeInteger(n) || n < 1 || n > 2e4 || !Number.isSafeInteger(r) || r < 1 || r > 1e6) throw new l("input", "任务JSON预算无效");
+  let s = 0, a = 0;
+  const c = /* @__PURE__ */ new Set();
+  function d(o, u) {
+    if (++s > n || u > 32) throw new l("input", "任务数据超过节点或深度预算");
+    if (typeof o == "string") {
+      if (a += o.length, a > r) throw new l("input", "任务文本超过预算");
+      return o;
+    }
+    if (o === null || typeof o == "boolean" || typeof o == "number" && Number.isFinite(o)) return o;
+    if (!o || typeof o != "object" || c.has(o)) throw new l("input", "任务只允许无循环的有限 JSON 值");
+    const i = Array.isArray(o), w = M(o);
+    c.add(o);
+    const f = /* @__PURE__ */ Object.create(null);
+    for (const b of w) {
+      if (a += b.length, a > r) throw new l("input", "任务文本超过预算");
+      f[b] = d(C(o, b), u + 1);
+    }
+    return c.delete(o), i ? Array.from({ length: o.length }, (b, h) => f[String(h)]) : f;
+  }
+  const g = JSON.stringify(d(e, 0));
+  if (g.length > r) throw new l("input", "任务序列化数据超过字符预算");
+  return g;
+}
+function x(e) {
+  return JSON.parse(JSON.stringify(e));
+}
+function U(e, t, n, r) {
+  if (P(t, n), e.scope !== t || e.id !== n || e.revision !== (r ?? 0) + 1 || !Number.isSafeInteger(e.revision)) throw new l("input", "任务身份或修订不匹配");
+  if (![e.createdAt, e.updatedAt, e.attempt].every((s) => Number.isSafeInteger(s) && s >= 0) || !["queued", "running", "completed", "failed", "cancelled"].includes(e.status)) throw new l("input", "任务状态无效");
+  if (e.lease && (!e.lease.owner || !Number.isSafeInteger(e.lease.expiresAt))) throw new l("input", "任务租约无效");
+  if (!e.request || typeof e.request.kind != "string" || !e.request.kind.trim() || e.request.kind.length > 128) throw new l("input", "任务类型无效");
+  p(e.request.payload, { maxNodes: 19e3, maxCharacters: 75e4 }), p(e);
+}
+function z(e, t) {
+  if (e && (e.createdAt !== t.createdAt || p(e.request) !== p(t.request))) throw new l("input", "任务创建时间与请求不可变更，请使用新任务ID");
+}
+function _(e, t) {
+  return e.status === "queued" || e.status === "running" && (e.lease?.expiresAt ?? 0) <= t;
+}
+function K(e = {}) {
+  const t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = q(e);
+  let s = 0, a = 0, c = Promise.resolve();
+  const d = (o, u) => JSON.stringify([o, u]), g = (o) => {
+    const u = c.then(o);
+    return c = u.then(() => {
+    }, () => {
+    }), u;
+  };
+  return {
+    read: async (o, u) => {
+      await c;
+      const i = t.get(d(o, u));
+      return i ? x(i) : void 0;
+    },
+    readTombstone: async (o, u) => {
+      await c;
+      const i = n.get(d(o, u));
+      return i ? x(i) : void 0;
+    },
+    candidates: async (o, u) => (await c, Array.from(t.values()).filter((i) => _(i, o)).sort((i, w) => i.createdAt - w.createdAt).slice(0, u).map(x)),
+    compareAndSwap: async (o, u, i, w) => {
+      U(w, o, u, i);
+      const f = x(w);
+      return g(async () => {
+        const b = d(o, u), h = t.get(b);
+        if ((h?.revision ?? null) !== i || n.has(b)) return !1;
+        z(h, f);
+        const A = s - (h ? N(h, r) : 0) + N(f, r);
+        if (A > r.maxBytes || !h && t.size >= r.maxRecords) throw new l("capacity", "任务容量已满，请清理终态任务或扩大显式预算");
+        return t.set(b, f), s = A, !0;
+      });
+    },
+    prune: async (o) => {
+      const u = T(o);
+      return g(async () => {
+        const i = { archived: 0, expired: 0 };
+        for (const [w, f] of n)
+          f.expiresAt > u.now || i.expired >= u.limit || (n.delete(w), a -= v(f), i.expired++);
+        for (const [w, f] of t) {
+          if (!R(f) || f.updatedAt > u.terminalBefore || i.archived + i.expired >= u.limit) continue;
+          const b = await L(f, u.now + u.tombstoneRetentionMs), h = v(b);
+          if (n.size >= r.maxTombstones || a + h > r.maxTombstoneBytes) break;
+          n.set(w, b), a += h, t.delete(w), s -= N(f, r), i.archived++;
+        }
+        return i;
+      });
+    }
+  };
+}
+function k(e, t = 100) {
+  if (!Number.isSafeInteger(t) || t < 1 || t > 1e3 || !Array.isArray(e) || e.length > t) throw new RangeError("批量参数应包含 1–maxCases 条，maxCases 最大为 1000");
+  const n = JSON.parse(p(e)), r = /* @__PURE__ */ new Set();
+  for (const s of n) {
+    if (!s || typeof s.id != "string" || s.id !== s.id.trim() || !/^[a-zA-Z0-9][a-zA-Z0-9_.:-]{0,127}$/.test(s.id) || r.has(s.id)) throw new TypeError("批量行 ID 应唯一且为安全标识");
+    if (!s.params || Array.isArray(s.params) || typeof s.params != "object" || Object.values(s.params).some((a) => typeof a != "string")) throw new TypeError("批量参数应为字符串字典");
+    r.add(s.id);
+  }
+  return n;
+}
+function H(e, t) {
+  if (!t) return;
+  const n = { completed: 0, total: e.length, failed: 0, cancelled: 0 };
+  for (const r of e)
+    r && (n.completed++, r.status === "failed" && n.failed++, r.status === "cancelled" && n.cancelled++);
+  try {
+    t(n);
+  } catch {
+  }
+}
+async function W(e, t, n = {}) {
+  const r = n.concurrency ?? 2;
+  if (!Number.isSafeInteger(r) || r < 1 || r > 16) throw new RangeError("批量并发应为 1–16");
+  if (n.failure !== void 0 && n.failure !== "continue" && n.failure !== "stop") throw new TypeError("批量失败策略无效");
+  const s = k(e, n.maxCases ?? 100);
+  if (!s.length) throw new RangeError("批量生成至少需要一组参数");
+  const a = Array.from({ length: s.length }), c = new AbortController(), d = () => c.abort(n.signal?.reason);
+  n.signal?.addEventListener("abort", d, { once: !0 }), n.signal?.aborted && d();
+  let g = 0, o = !1;
+  async function u() {
+    for (; g < s.length; ) {
+      const i = g++, w = s[i], f = { id: w.id, index: i };
+      if (o || c.signal.aborted) a[i] = { ...f, status: "cancelled" };
+      else
+        try {
+          S(c.signal);
+          const b = await t(w, { index: i, signal: c.signal });
+          a[i] = { ...f, status: "completed", value: b };
+        } catch (b) {
+          c.signal.aborted ? a[i] = { ...f, status: "cancelled" } : (a[i] = { ...f, status: "failed", error: { name: b instanceof Error ? b.name : "Error", message: b instanceof Error ? b.message : String(b) } }, n.failure === "stop" && (o = !0));
+        }
+      H(a, n.onProgress);
+    }
+  }
+  try {
+    await Promise.all(Array.from({ length: Math.min(r, s.length) }, u));
+  } finally {
+    n.signal?.removeEventListener("abort", d);
+  }
+  return a;
+}
+export {
+  m as R,
+  Z as a,
+  l as b,
+  V as c,
+  P as d,
+  x as e,
+  D as f,
+  K as g,
+  _ as h,
+  k as i,
+  v as j,
+  U as k,
+  z as l,
+  W as r,
+  p as s,
+  S as t,
+  F as v
+};