react-semaphor 0.1.541 → 0.1.542

package/dist/chunks/{matrix-member-presentation-BNPSDKBG.js → matrix-member-presentation-CQGdVks6.js}

@@ -1,4 +1,4 @@
-import { w as d } from "./validators-Ej1DdCXa.js";
+import { w as d } from "./validators-DMHTpf7a.js";
 const h = [
   "=",
   "!=",

package/dist/chunks/{matrix-operation-contract-B8PBF1Gd.js → matrix-operation-contract-8OIO4gob.js}

@@ -1,7 +1,7 @@
 import { z as t } from "zod";
-import { z as je, E as Fe, F as Le, I as Ue, J as qe, s as U, x as K, n as De, C as Me, D as ce, f as Be, r as Ge, y as ze, m as Ve, o as We, t as le, u as Xe } from "./analytics-base-schemas-BFAoRlkU.js";
-import { Z as k, T as ue, a2 as G, aH as ee, w as A, _ as Ze, aB as $, aI as Ke, U as $e, s as He, q as de, B as Ye, v as Qe, m as Je } from "./validators-Ej1DdCXa.js";
-const H = {
+import { z as je, E as Fe, F as Le, I as Ue, J as qe, s as U, x as Z, n as De, C as Me, D as ce, f as Be, r as Ge, y as ze, m as Ve, o as We, t as le, u as Xe } from "./analytics-base-schemas-BFAoRlkU.js";
+import { X as k, Q as ue, a0 as G, aH as ee, w as b, Y as Ke, aA as $, aI as Ze, R as $e, s as Ye, q as de, z as He, v as Qe, m as Je } from "./validators-DMHTpf7a.js";
+const Y = {
   answerSummary: "string",
   responseDetail: "responseDetail",
   mode: "string",
@@ -214,34 +214,34 @@ const it = t.object({
       }
     )
   ).size > 1 && f(n, ["members"], "One page must contain one child level."), v(
-    e.members.map((r) => A(r.path)),
+    e.members.map((r) => b(r.path)),
     n,
     ["members"]
   );
   for (const r of e.members)
-    (r.path.length !== e.parent.length + 1 || A(r.path.slice(0, -1)) !== A(e.parent)) && f(n, ["members"], "Page members must be immediate children.");
+    (r.path.length !== e.parent.length + 1 || b(r.path.slice(0, -1)) !== b(e.parent)) && f(n, ["members"], "Page members must be immediate children.");
 }), he = t.object({
   rowPaths: t.array(k).readonly(),
   columnPaths: t.array(k).readonly(),
   measureIds: t.array(O).readonly()
 }).strict();
 function fe(e, n) {
-  const a = e.rowPaths.map(A), r = e.columnPaths.map(A);
+  const a = e.rowPaths.map(b), r = e.columnPaths.map(b);
   return v(a, n, ["coverage", "rowPaths"]), v(r, n, ["coverage", "columnPaths"]), v(e.measureIds, n, ["coverage", "measureIds"]), { rows: a, columns: r };
 }
 const ut = t.object({
   requestId: y,
   coverage: he,
   cells: t.array(
-    Ze.extend({ value: $ }).strict()
+    Ke.extend({ value: $ }).strict()
   ).readonly()
 }).strict().superRefine((e, n) => {
   const { rows: a, columns: r } = fe(e.coverage, n), s = new Set(a), c = new Set(r), i = new Set(e.coverage.measureIds);
   v(
     e.cells.map(
       (l) => JSON.stringify([
-        A(l.rowPath),
-        A(l.columnPath),
+        b(l.rowPath),
+        b(l.columnPath),
         l.measureId
       ])
     ),
@@ -249,7 +249,7 @@ const ut = t.object({
     ["cells"]
   );
   for (const l of e.cells)
-    (!s.has(A(l.rowPath)) || !c.has(A(l.columnPath)) || !i.has(l.measureId)) && f(n, ["cells"], "Cell is outside certified coverage.");
+    (!s.has(b(l.rowPath)) || !c.has(b(l.columnPath)) || !i.has(l.measureId)) && f(n, ["cells"], "Cell is outside certified coverage.");
 }), q = t.number().int().nonnegative(), dt = t.object({
   requestId: y,
   coverage: he,
@@ -271,11 +271,11 @@ const ut = t.object({
   id: O,
   column: je,
   nativeDataType: y,
-  semanticFormat: Ke.optional()
+  semanticFormat: Ze.optional()
 }).strict(), ge = t.object({
   levels: t.array(ne).readonly(),
   measures: t.array(ne).readonly()
-}).strict(), Y = t.object({
+}).strict(), H = t.object({
   code: t.enum(st),
   message: y,
   /** Technical cause for dashboard owners; never shown as the primary copy. */
@@ -299,7 +299,7 @@ function ye(e) {
     capabilities: mt,
     pages: t.array(lt).readonly(),
     blocks: t.array(e).readonly(),
-    failures: t.array(Y).readonly()
+    failures: t.array(H).readonly()
   }).strict().superRefine((n, a) => {
     const r = new Set(
       n.descriptors.levels.map((i) => i.id)
@@ -360,13 +360,13 @@ const Se = ye(
 ), pt = ye(
   dt
 );
-function be(e) {
+function Ae(e) {
   return t.union([
     t.object({
       status: t.enum(["success", "partial"]),
       window: e
     }).strict(),
-    t.object({ status: t.literal("failed"), failure: Y }).strict()
+    t.object({ status: t.literal("failed"), failure: H }).strict()
   ]).superRefine((n, a) => {
     const r = n;
     if (r.status === "failed") return;
@@ -378,18 +378,18 @@ function be(e) {
     ), r.status === "success" != (s.failures.length === 0) && f(a, ["status"], "Status must match failure coverage.");
   });
 }
-const un = be(
+const un = Ae(
   Se
-), dn = be(
+), dn = Ae(
   pt
 );
 function ht(e) {
-  const { rowPaths: n, columnPaths: a, measureIds: r } = e.coverage, s = (m) => new Map(m.map((o, d) => [o, d])), c = s(n.map(A)), i = s(a.map(A)), l = s(r);
+  const { rowPaths: n, columnPaths: a, measureIds: r } = e.coverage, s = (m) => new Map(m.map((o, d) => [o, d])), c = s(n.map(b)), i = s(a.map(b)), l = s(r);
   return {
     requestId: e.requestId,
     coverage: e.coverage,
     values: e.cells.map((m) => {
-      const o = c.get(A(m.rowPath)), d = i.get(A(m.columnPath)), p = l.get(m.measureId);
+      const o = c.get(b(m.rowPath)), d = i.get(b(m.columnPath)), p = l.get(m.measureId);
       if (o === void 0 || d === void 0 || p === void 0)
         throw new Error("Cell is outside certified coverage.");
       return [o, d, p, m.value];
@@ -418,7 +418,7 @@ function mn(e) {
 function pn(e) {
   return e.status === "failed" ? e : { status: e.status, window: gt(e.window) };
 }
-const Ae = t.object({
+const be = t.object({
   kind: t.literal("matrix"),
   window: Se
 }).strict(), Ie = t.enum(["member", "subtotal", "grand_total"]), yt = t.discriminatedUnion("kind", [
@@ -442,7 +442,7 @@ const Ae = t.object({
     )
   }).strict(),
   t.object({ kind: t.enum(["null", "empty"]) }).strict()
-]), bt = t.discriminatedUnion("kind", [
+]), At = t.discriminatedUnion("kind", [
   t.object({
     kind: t.literal("layout"),
     rowPath: k,
@@ -463,15 +463,15 @@ const Ae = t.object({
   }).strict(),
   t.object({
     kind: t.literal("rows"),
-    rows: t.array(bt).readonly(),
+    rows: t.array(At).readonly(),
     next: y.nullable()
   }).strict()
-]), At = t.union([
+]), bt = t.union([
   Fe,
   Le,
   Ue,
   qe,
-  Ae
+  be
 ]), It = t.object({
   status: t.enum([
     "not_required",
@@ -516,7 +516,7 @@ const Ae = t.object({
       queryId: t.string().optional(),
       summary: t.string(),
       evidenceIds: t.array(t.string()).optional(),
-      fieldsUsed: t.array(K).optional()
+      fieldsUsed: t.array(Z).optional()
     }).passthrough()
   ),
   blocked: t.array(
@@ -563,8 +563,8 @@ const Ae = t.object({
   ]).optional(),
   intent: t.unknown().optional(),
   compiledQuery: t.unknown().optional(),
-  fieldsUsed: t.array(K).optional(),
-  result: At.optional(),
+  fieldsUsed: t.array(Z).optional(),
+  result: bt.optional(),
   validation: ce,
   coverage: ke.optional(),
   missingFields: t.array(t.string()).optional(),
@@ -585,7 +585,7 @@ function wt(e) {
     case "diagnosticFeedback":
       return _e.optional();
     case "executionFieldArray":
-      return t.array(K).optional();
+      return t.array(Z).optional();
     case "executionResult":
       return _t.optional();
     case "number":
@@ -611,15 +611,15 @@ function wt(e) {
   }
 }
 const kt = Object.fromEntries(
-  Object.entries(H).map(
+  Object.entries(Y).map(
     ([e, n]) => [e, wt(n)]
   )
 ), vt = t.object(kt).strict(), Tt = new Set(
-  Object.keys(H)
+  Object.keys(Y)
 );
 function fn() {
   return Object.keys(
-    H
+    Y
   );
 }
 function Rt(e) {
@@ -641,7 +641,7 @@ const Te = 100, F = "selection:";
 function Re(e) {
   return [
     de(e.source),
-    Ye(e.name),
+    He(e.name),
     e.sourceField ?? ""
   ].join("::");
 }
@@ -689,7 +689,7 @@ function oe(e) {
     e.conditions.map(z).sort()
   );
 }
-function bn(e) {
+function An(e) {
   const n = e.map((a) => a.id);
   if (new Set(n).size !== n.length)
     throw new Error("Data App selections require one active selection per id.");
@@ -714,7 +714,7 @@ function bn(e) {
 function D(e, n) {
   return e < n ? -1 : e > n ? 1 : 0;
 }
-function An(e, n) {
+function bn(e, n) {
   return se(e) === se(n);
 }
 const Nt = "(Blank)";
@@ -771,7 +771,7 @@ const Ot = t.union([
   for (let a = 0; a < e.conditions.length; a += 1) {
     const r = e.conditions[a];
     e.conditions.findIndex(
-      (c, i) => i < a && He(c.field, r.field)
+      (c, i) => i < a && Ye(c.field, r.field)
     ) !== -1 && n.addIssue({
       code: t.ZodIssueCode.custom,
       message: "A selection tuple can contain only one condition per field.",
@@ -954,7 +954,7 @@ function W(e, n = /* @__PURE__ */ new Set()) {
           e[h] === "'" || e[h] === '"' ? h = V(e, h) - 1 : e[h] === "(" ? h = P(e, h) - 1 : e[h] === "," && x++;
         const C = /^\s*DISTINCT\b/i.test(T);
         W(C ? T.replace(/^\s*DISTINCT\b/i, "") : T).calls.length > 0 && (s = !0);
-        let b = !1, _ = !1;
+        let A = !1, _ = !1;
         for (; ; ) {
           const h = j(e, g);
           if (!ie.test(e[h] || "")) break;
@@ -967,7 +967,7 @@ function W(e, n = /* @__PURE__ */ new Set()) {
             }
           }
           if ((R === "FILTER" || R === "OVER") && e[u] === "(") {
-            b = b || R === "OVER", _ = _ || R === "FILTER", g = P(e, u);
+            A = A || R === "OVER", _ = _ || R === "FILTER", g = P(e, u);
             continue;
           }
           break;
@@ -976,7 +976,7 @@ function W(e, n = /* @__PURE__ */ new Set()) {
           name: d.toUpperCase(),
           kind: Ne(d, C),
           distinct: C,
-          windowed: b,
+          windowed: A,
           tokens: Wt(e.slice(p, g)),
           span: { start: l, end: E, argumentStart: p + 1, argumentEnd: I },
           argumentCount: x,
@@ -1043,7 +1043,7 @@ function Xt(e, n) {
   };
   return i() && s === a.length;
 }
-function Zt(e) {
+function Kt(e) {
   const n = [];
   let a = 0;
   for (; a < e.length; ) {
@@ -1087,8 +1087,8 @@ function Zt(e) {
   }
   return n;
 }
-function Kt(e) {
-  const n = Zt(e), a = n.some((o) => o.type === "op" && o.value === "/");
+function Zt(e) {
+  const n = Kt(e), a = n.some((o) => o.type === "op" && o.value === "/");
   if (n.some((o) => o.type === "other"))
     return { kind: "other", hasDivision: a };
   let r = 0, s = !0;
@@ -1178,7 +1178,7 @@ const Q = {
   identity: "unresolved",
   unresolved: !0
 }, Pe = { ...Q, stage: "row" };
-function Z(e) {
+function K(e) {
   return {
     stage: "row",
     outer: e,
@@ -1196,23 +1196,23 @@ function B(e, n) {
   const a = (r = n.derivedField) == null ? void 0 : r.aggregationBehavior;
   return !a || e.unresolved ? e : a === "additive" ? e.reaggregation.kind === "additive" ? e : { ...e, reaggregation: { kind: "additive" } } : { ...e, reaggregation: { kind: "none", reason: "declared" } };
 }
-function Ht(e, n) {
+function Yt(e, n) {
   if (!e) return Q;
   if (typeof e.expression == "string" && e.expression.trim()) {
     const r = J(e, n + 1);
     return r === "row_input" ? "raw" : r.unresolved || r.stage === "aggregate" || r.outer ? r : "raw";
   }
   const a = X(e.aggregate);
-  return a ? Z(a) : "raw";
+  return a ? K(a) : "raw";
 }
-const Yt = 12;
+const Ht = 12;
 function J(e, n) {
   var R;
-  if (n > Yt) return Q;
+  if (n > Ht) return Q;
   const a = typeof e.expression == "string" ? e.expression.trim() : "";
   if (!a)
     return B(
-      Z(X(e.aggregate) ?? "sum"),
+      K(X(e.aggregate) ?? "sum"),
       e
     );
   const r = W(a), s = ((R = e.calculatedFormula) == null ? void 0 : R.inputFields) || [], c = (u) => {
@@ -1220,7 +1220,7 @@ function J(e, n) {
     return S ? s[Number(S[1])] : void 0;
   }, i = /* @__PURE__ */ new Map();
   for (const u of r.tokensOutsideAggregates)
-    i.has(u) || i.set(u, Ht(c(u), n));
+    i.has(u) || i.set(u, Yt(c(u), n));
   const l = r.calls.some(
     (u) => u.tokens.some((S) => {
       const w = c(S);
@@ -1238,7 +1238,7 @@ function J(e, n) {
   if (!d) {
     if (!g) return Pe;
     const u = X(e.aggregate);
-    return u ? B(Z(u), e) : "row_input";
+    return u ? B(K(u), e) : "row_input";
   }
   const I = !g || o || r.nestedAggregate || l || m.some((u) => u.unresolved) || r.calls.length === 0 && m.length === 0, E = [
     ...r.calls.map((u) => ({ kind: u.kind, distinct: u.distinct })),
@@ -1250,21 +1250,21 @@ function J(e, n) {
     }
     const S = i.get(u.token);
     return S && S !== "raw" ? S.reaggregation : { kind: "none", reason: "unresolved" };
-  }, b = Kt(r.skeleton);
+  }, A = Zt(r.skeleton);
   let _, h, N = "numeric";
   if (I)
     _ = { kind: "none", reason: "unresolved" }, h = "unresolved";
   else if (T)
     _ = { kind: "none", reason: "window" }, h = "expression";
-  else if (b.kind === "single")
-    if (_ = C(b.unit), b.unit.kind === "call") {
-      const u = r.calls[b.unit.index];
+  else if (A.kind === "single")
+    if (_ = C(A.unit), A.unit.kind === "call") {
+      const u = r.calls[A.unit.index];
       h = u.kind, (u.kind === "min" || u.kind === "max") && (N = "input");
     } else {
-      const u = i.get(b.unit.token);
+      const u = i.get(A.unit.token);
       h = u.identity, N = u.outputType;
     }
-  else b.kind === "linear" ? (_ = b.units.every((S) => C(S).kind === "additive") ? { kind: "additive" } : { kind: "none", reason: "other" }, h = "linear") : (_ = { kind: "none", reason: b.hasDivision ? "ratio" : "other" }, h = b.hasDivision ? "ratio" : "expression");
+  else A.kind === "linear" ? (_ = A.units.every((S) => C(S).kind === "additive") ? { kind: "additive" } : { kind: "none", reason: "other" }, h = "linear") : (_ = { kind: "none", reason: A.hasDivision ? "ratio" : "other" }, h = A.hasDivision ? "ratio" : "expression");
   return B(
     {
       stage: "aggregate",
@@ -1298,15 +1298,15 @@ const en = {
   compiledQuery: t.never().optional(),
   intent: Qt.shape.intent,
   resultShape: t.literal("matrix"),
-  result: Ae.optional(),
-  metadata: t.object({ rowLimitExceeded: t.boolean(), matrixFailure: Y.optional() }).passthrough()
+  result: be.optional(),
+  metadata: t.object({ rowLimitExceeded: t.boolean(), matrixFailure: H.optional() }).passthrough()
 }, tn = ve.extend(en), Rn = tn.superRefine((e, n) => {
   e.status === "failed" == !!e.result && n.addIssue({ code: "custom", message: "Only answered or partial Matrix execution carries a window." }), e.result && e.status === "partial" != e.result.window.failures.length > 0 && n.addIssue({ code: "custom", message: "Matrix execution status must match acquired window failures." });
 });
 export {
   lt as $,
   oe as A,
-  An as B,
+  bn as B,
   In as C,
   xt as D,
   Pt as E,
@@ -1318,12 +1318,12 @@ export {
   Mt as K,
   Ne as L,
   W as M,
-  Kt as N,
+  Zt as N,
   vn as O,
   me as P,
   nt as Q,
   at as R,
-  H as S,
+  Y as S,
   sn as T,
   on as U,
   st as V,
@@ -1336,7 +1336,7 @@ export {
   ut as a0,
   dt as a1,
   ne as a2,
-  Y as a3,
+  H as a3,
   mt as a4,
   Se as a5,
   pt as a6,
@@ -1350,15 +1350,15 @@ export {
   yt as ae,
   St as af,
   ae as ag,
-  bt as ah,
+  At as ah,
   hn as ai,
   Jt as aj,
   Tn as ak,
   Rn as al,
   Qt as am,
   Sn as b,
-  bn as c,
-  At as d,
+  An as c,
+  bt as d,
   It as e,
   _e as f,
   fn as g,
@@ -1371,7 +1371,7 @@ export {
   kt as n,
   vt as o,
   gn as p,
-  Ae as q,
+  be as q,
   Te as r,
   _n as s,
   Re as t,