react-semaphor 0.1.533 → 0.1.534

package/dist/chunks/{matrix-operation-contract-BotZ-6zT.js → matrix-operation-contract-BKupLHXL.js}

@@ -1,5 +1,5 @@
 import { z as t } from "zod";
-import { a5 as k, $ as ce, aa as G, bl as ee, B as A, a6 as je, bf as K, bm as Fe, aX as Le, a0 as Ue, b0 as qe, b1 as De, b4 as Me, b5 as Be, aQ as U, aV as Z, aK as Ge, a_ as ze, a$ as le, aH as Ve, aG as We, aW as Xe, aN as $e, aO as Ke, w as ue, aS as Ze, s as He, q as de, E as Ye, A as Qe, m as Je } from "./validators-BS521dum.js";
+import { a5 as k, $ as ce, aa as B, bm as ee, E as A, a6 as je, bg as K, bn as Fe, aX as Le, a0 as Ue, b0 as qe, b1 as De, b4 as Me, b5 as Ge, aQ as U, aV as Z, aK as Be, a_ as ze, a$ as le, aH as Ve, aG as We, aW as Xe, aN as $e, aO as Ke, w as ue, aS as Ze, s as He, q as de, F as Ye, A as Qe, m as Je } from "./validators-DMSH81OM.js";
 const H = {
   answerSummary: "string",
   responseDetail: "responseDetail",
@@ -125,11 +125,11 @@ const st = [
   coordinates: 2e4,
   responseBytes: 5 * 1024 * 1024
 }), O = t.string().uuid(), y = t.string().min(1), ot = t.number().int().positive().max(Number.MAX_SAFE_INTEGER);
-function f(e, n, a) {
+function g(e, n, a) {
   e.addIssue({ code: "custom", path: n, message: a });
 }
 function v(e, n, a) {
-  new Set(e).size !== e.length && f(n, a, "Duplicate identity.");
+  new Set(e).size !== e.length && g(n, a, "Duplicate identity.");
 }
 const it = t.object({
   id: y,
@@ -152,7 +152,7 @@ const it = t.object({
   pages: t.array(it).readonly(),
   blocks: t.array(ct).readonly()
 }).strict().superRefine((e, n) => {
-  !e.pages.length && !e.blocks.length && f(n, [], "Request at least one page or block."), v(
+  !e.pages.length && !e.blocks.length && g(n, [], "Request at least one page or block."), v(
     [...e.pages, ...e.blocks].map((a) => a.id),
     n,
     []
@@ -163,13 +163,13 @@ const it = t.object({
       for (const s of a[r].pageIds)
         e.pages.some(
           (c) => c.id === s && c.axis === r
-        ) || f(
+        ) || g(
           n,
           ["blocks", a.id, r],
           "Page reference must name a page on this axis in this operation."
         );
   }
-}), cn = t.object({ spec: G, request: pe }).strict().superRefine(({ spec: e, request: n }, a) => {
+}), cn = t.object({ spec: B, request: pe }).strict().superRefine(({ spec: e, request: n }, a) => {
   for (const r of n.pages)
     ee(
       e,
@@ -178,13 +178,13 @@ const it = t.object({
       a,
       ["pages", r.id],
       !0
-    ), r.parent.length >= e[r.axis].length && f(
+    ), r.parent.length >= e[r.axis].length && g(
       a,
       ["pages", r.id],
       "Cannot request children of a leaf or empty axis."
     );
   for (const r of n.blocks) {
-    r.measureIds.some((s) => !e.measures.some((c) => c.id === s)) && f(a, ["blocks", r.id], "Unknown block measure.");
+    r.measureIds.some((s) => !e.measures.some((c) => c.id === s)) && g(a, ["blocks", r.id], "Unknown block measure.");
     for (const s of ["rows", "columns"])
       for (const c of r[s].paths)
         ee(e, s, c, a, ["blocks", r.id, s]);
@@ -198,33 +198,33 @@ const it = t.object({
   after: y.nullable(),
   exactCount: t.number().int().nonnegative().max(Number.MAX_SAFE_INTEGER).optional()
 }).strict().superRefine((e, n) => {
-  e.parent.some((r) => r.member.kind === "others") && f(n, ["parent"], "Others has no children.");
+  e.parent.some((r) => r.member.kind === "others") && g(n, ["parent"], "Others has no children.");
   const a = e.members.filter(
     ({ path: r }) => {
       var s;
       return ((s = r[r.length - 1]) == null ? void 0 : s.member.kind) === "others";
     }
   );
-  a.length > 1 && f(n, ["members"], "A page may contain Others only once."), a.length && (e.members[e.members.length - 1] !== a[0] && f(n, ["members"], "Others must be the last page member."), e.after !== null && f(n, ["after"], "Others must end the branch.")), new Set(
+  a.length > 1 && g(n, ["members"], "A page may contain Others only once."), a.length && (e.members[e.members.length - 1] !== a[0] && g(n, ["members"], "Others must be the last page member."), e.after !== null && g(n, ["after"], "Others must end the branch.")), new Set(
     e.members.map(
       (r) => {
         var s;
         return (s = r.path[r.path.length - 1]) == null ? void 0 : s.levelId;
       }
     )
-  ).size > 1 && f(n, ["members"], "One page must contain one child level."), v(
+  ).size > 1 && g(n, ["members"], "One page must contain one child level."), v(
     e.members.map((r) => A(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 || A(r.path.slice(0, -1)) !== A(e.parent)) && g(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) {
+function ge(e, n) {
   const a = e.rowPaths.map(A), r = e.columnPaths.map(A);
   return v(a, n, ["coverage", "rowPaths"]), v(r, n, ["coverage", "columnPaths"]), v(e.measureIds, n, ["coverage", "measureIds"]), { rows: a, columns: r };
 }
@@ -235,7 +235,7 @@ const ut = t.object({
     je.extend({ value: K }).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);
+  const { rows: a, columns: r } = ge(e.coverage, n), s = new Set(a), c = new Set(r), i = new Set(e.coverage.measureIds);
   v(
     e.cells.map(
       (l) => JSON.stringify([
@@ -248,7 +248,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(A(l.rowPath)) || !c.has(A(l.columnPath)) || !i.has(l.measureId)) && g(n, ["cells"], "Cell is outside certified coverage.");
 }), q = t.number().int().nonnegative(), dt = t.object({
   requestId: y,
   coverage: he,
@@ -256,22 +256,22 @@ const ut = t.object({
     t.tuple([q, q, q, K]).readonly()
   ).readonly()
 }).strict().superRefine((e, n) => {
-  fe(e.coverage, n);
+  ge(e.coverage, n);
   const { rowPaths: a, columnPaths: r, measureIds: s } = e.coverage, c = /* @__PURE__ */ new Set();
   for (const [i, l, m] of e.values) {
     if (i >= a.length || l >= r.length || m >= s.length) {
-      f(n, ["values"], "Cell is outside certified coverage.");
+      g(n, ["values"], "Cell is outside certified coverage.");
       continue;
     }
     const o = `${i},${l},${m}`;
-    c.has(o) && f(n, ["values"], "Duplicate identity."), c.add(o);
+    c.has(o) && g(n, ["values"], "Duplicate identity."), c.add(o);
   }
 }), ne = t.object({
   id: O,
   column: Le,
   nativeDataType: y,
   semanticFormat: Fe.optional()
-}).strict(), ge = t.object({
+}).strict(), fe = t.object({
   levels: t.array(ne).readonly(),
   measures: t.array(ne).readonly()
 }).strict(), Y = t.object({
@@ -294,7 +294,7 @@ const ut = t.object({
 function ye(e) {
   return t.object({
     queryIdentity: y,
-    descriptors: ge,
+    descriptors: fe,
     capabilities: mt,
     pages: t.array(lt).readonly(),
     blocks: t.array(e).readonly(),
@@ -309,12 +309,12 @@ function ye(e) {
       ...i.members.map((l) => l.path)
     ]);
     for (const i of n.blocks)
-      c.push(...i.coverage.rowPaths, ...i.coverage.columnPaths), i.coverage.measureIds.some((l) => !s.has(l)) && f(
+      c.push(...i.coverage.rowPaths, ...i.coverage.columnPaths), i.coverage.measureIds.some((l) => !s.has(l)) && g(
         a,
         ["blocks", i.requestId],
         "Coverage references an unknown measure descriptor."
       );
-    c.some((i) => i.some((l) => !r.has(l.levelId))) && f(
+    c.some((i) => i.some((l) => !r.has(l.levelId))) && g(
       a,
       ["descriptors"],
       "Acquired paths require level descriptors."
@@ -337,7 +337,7 @@ function ye(e) {
     );
     for (const i of n.failures)
       if (i.scope.kind === "operation")
-        f(
+        g(
           a,
           ["failures"],
           "Operation failure cannot accompany acquired data."
@@ -346,7 +346,7 @@ function ye(e) {
         const l = i.scope.requestId;
         [...n.pages, ...n.blocks].some(
           (m) => m.requestId === l
-        ) && f(
+        ) && g(
           a,
           ["failures"],
           "A requested unit cannot both succeed and fail."
@@ -370,11 +370,11 @@ function be(e) {
     const r = n;
     if (r.status === "failed") return;
     const { window: s } = r;
-    !s.pages.length && !s.blocks.length && f(
+    !s.pages.length && !s.blocks.length && g(
       a,
       ["window"],
       "A window outcome requires successful acquired work."
-    ), r.status === "success" != (s.failures.length === 0) && f(a, ["status"], "Status must match failure coverage.");
+    ), r.status === "success" != (s.failures.length === 0) && g(a, ["status"], "Status must match failure coverage.");
   });
 }
 const ln = be(
@@ -395,7 +395,7 @@ function ht(e) {
     })
   };
 }
-function ft(e) {
+function gt(e) {
   const { rowPaths: n, columnPaths: a, measureIds: r } = e.coverage;
   return {
     requestId: e.requestId,
@@ -408,14 +408,14 @@ function ft(e) {
     }))
   };
 }
-function gt(e) {
+function ft(e) {
   return { ...e, blocks: e.blocks.map(ht) };
 }
 function dn(e) {
-  return { ...e, blocks: e.blocks.map(ft) };
+  return { ...e, blocks: e.blocks.map(gt) };
 }
 function mn(e) {
-  return e.status === "failed" ? e : { status: e.status, window: gt(e.window) };
+  return e.status === "failed" ? e : { status: e.status, window: ft(e.window) };
 }
 const Ae = t.object({
   kind: t.literal("matrix"),
@@ -432,7 +432,7 @@ const Ae = t.object({
   }).strict()
 ]), St = t.object({
   columns: t.array(yt).readonly(),
-  descriptors: ge
+  descriptors: fe
 }).strict(), ae = t.union([
   t.object({
     kind: t.literal("value"),
@@ -469,7 +469,7 @@ const Ae = t.object({
   qe,
   De,
   Me,
-  Be,
+  Ge,
   Ae
 ]), It = t.object({
   status: t.enum([
@@ -542,7 +542,7 @@ const Ae = t.object({
   ).optional()
 }).passthrough(), we = t.object({
   scope: t.literal("filtered_query"),
-  measures: t.record(Ge)
+  measures: t.record(Be)
 }).passthrough(), ke = t.object({
   answeredObligations: t.array(t.string()),
   missingObligations: t.array(t.string()),
@@ -624,7 +624,7 @@ function hn() {
 function Rt(e) {
   return Tt.has(e);
 }
-function fn(e) {
+function gn(e) {
   if (!e || typeof e != "object" || Array.isArray(e))
     throw new Error("Semaphor analyze result must be an object.");
   const a = Object.keys(e).filter(
@@ -644,7 +644,7 @@ function Re(e) {
     e.sourceField ?? ""
   ].join("::");
 }
-function gn(e) {
+function fn(e) {
   return `${F}${e}`;
 }
 function Et(e) {
@@ -864,7 +864,7 @@ function Ne(e, n = !1) {
   const a = Ce[e.toUpperCase()] ?? "other";
   return n ? a === "count" || a === "count_distinct" ? "count_distinct" : a === "min" || a === "max" ? a : "repeat_safe_other" : a;
 }
-const Bt = /* @__PURE__ */ new Set([
+const Gt = /* @__PURE__ */ new Set([
   "NULLIF",
   "COALESCE",
   "IFNULL",
@@ -879,7 +879,7 @@ const Bt = /* @__PURE__ */ new Set([
   "CAST",
   "TRY_CAST",
   "SAFE_CAST"
-]), Gt = /* @__PURE__ */ new Set(["DECIMAL", "NUMERIC", "INTEGER", "INT", "BIGINT", "FLOAT", "DOUBLE", "REAL", "VARCHAR", "TEXT"]), ie = /[A-Za-z_]/, zt = /[A-Za-z0-9_]/;
+]), Bt = /* @__PURE__ */ new Set(["DECIMAL", "NUMERIC", "INTEGER", "INT", "BIGINT", "FLOAT", "DOUBLE", "REAL", "VARCHAR", "TEXT"]), ie = /[A-Za-z_]/, zt = /[A-Za-z0-9_]/;
 function V(e, n) {
   const a = e[n];
   let r = n + 1;
@@ -944,10 +944,10 @@ function W(e, n = /* @__PURE__ */ new Set()) {
     if (ie.test(m)) {
       const o = M(e, l), d = e.slice(l, o), p = j(e, o);
       if (e[p] === "(" && Mt(d)) {
-        let g = P(e, p);
-        const I = g - 1;
-        let E = g;
-        const T = e.slice(p + 1, g - 1);
+        let f = P(e, p);
+        const I = f - 1;
+        let E = f;
+        const T = e.slice(p + 1, f - 1);
         let x = T.trim() ? 1 : 0;
         for (let h = p + 1; h < E - 1; h++)
           e[h] === "'" || e[h] === '"' ? h = V(e, h) - 1 : e[h] === "(" ? h = P(e, h) - 1 : e[h] === "," && x++;
@@ -955,18 +955,18 @@ function W(e, n = /* @__PURE__ */ new Set()) {
         W(C ? T.replace(/^\s*DISTINCT\b/i, "") : T).calls.length > 0 && (s = !0);
         let b = !1, _ = !1;
         for (; ; ) {
-          const h = j(e, g);
+          const h = j(e, f);
           if (!ie.test(e[h] || "")) break;
           const N = M(e, h), R = e.slice(h, N).toUpperCase(), u = j(e, N);
           if (R === "WITHIN") {
             const S = M(e, u), w = j(e, S);
             if (e.slice(u, S).toUpperCase() === "GROUP" && e[w] === "(") {
-              g = P(e, w), E = g;
+              f = P(e, w), E = f;
               continue;
             }
           }
           if ((R === "FILTER" || R === "OVER") && e[u] === "(") {
-            b = b || R === "OVER", _ = _ || R === "FILTER", g = P(e, u);
+            b = b || R === "OVER", _ = _ || R === "FILTER", f = P(e, u);
             continue;
           }
           break;
@@ -976,11 +976,11 @@ function W(e, n = /* @__PURE__ */ new Set()) {
           kind: Ne(d, C),
           distinct: C,
           windowed: b,
-          tokens: Wt(e.slice(p, g)),
+          tokens: Wt(e.slice(p, f)),
           span: { start: l, end: E, argumentStart: p + 1, argumentEnd: I },
           argumentCount: x,
           filtered: _
-        }), c += `@${a.length - 1}`, l = g;
+        }), c += `@${a.length - 1}`, l = f;
         continue;
       }
       c += e.slice(l, o), l = o;
@@ -1032,9 +1032,9 @@ function Xt(e, n) {
     }
     if (o.startsWith("@") || o === "'S'" || ["NULL", "TRUE", "FALSE"].includes(o) || /^[0-9.]/.test(o))
       return s++, !0;
-    if (!Bt.has(o) || (s++, !c("(") || !i())) return !1;
+    if (!Gt.has(o) || (s++, !c("(") || !i())) return !1;
     if (["CAST", "TRY_CAST", "SAFE_CAST"].includes(o)) {
-      if (!c("AS") || !Gt.has(a[s++]) || (c("PRECISION"), c("(") && (!/^\d+$/.test(a[s++] || "") || c(",") && !/^\d+$/.test(a[s++] || "") || !c(")"))))
+      if (!c("AS") || !Bt.has(a[s++]) || (c("PRECISION"), c("(") && (!/^\d+$/.test(a[s++] || "") || c(",") && !/^\d+$/.test(a[s++] || "") || !c(")"))))
         return !1;
     } else
       for (; c(","); ) if (!i()) return !1;
@@ -1099,9 +1099,9 @@ function Kt(e) {
         if (!(I && I.type === "op" && (I.value === "+" || I.value === "-"))) break;
         r += 1;
       }
-      const g = i();
-      if (!g) return null;
-      d === void 0 ? d = g.degree : d !== g.degree && (s = !1), o = o.concat(g.units), p = !1;
+      const f = i();
+      if (!f) return null;
+      d === void 0 ? d = f.degree : d !== f.degree && (s = !1), o = o.concat(f.units), p = !1;
     }
     return { degree: d ?? 0, units: o };
   }, i = () => {
@@ -1190,7 +1190,7 @@ function $(e) {
     unresolved: !1
   };
 }
-function B(e, n) {
+function G(e, n) {
   var r;
   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" } };
@@ -1210,7 +1210,7 @@ function J(e, n) {
   if (n > Yt) return Q;
   const a = typeof e.expression == "string" ? e.expression.trim() : "";
   if (!a)
-    return B(
+    return G(
       $(X(e.aggregate) ?? "sum"),
       e
     );
@@ -1233,13 +1233,13 @@ function J(e, n) {
     [...i].filter(
       ([u, S]) => S === "raw" ? !d && !!c(u) : !S.unresolved
     ).map(([u]) => u)
-  ), g = W(a, p).aggregateInputsComplete;
+  ), f = W(a, p).aggregateInputsComplete;
   if (!d) {
-    if (!g) return Pe;
+    if (!f) return Pe;
     const u = X(e.aggregate);
-    return u ? B($(u), e) : "row_input";
+    return u ? G($(u), e) : "row_input";
   }
-  const I = !g || o || r.nestedAggregate || l || m.some((u) => u.unresolved) || r.calls.length === 0 && m.length === 0, E = [
+  const I = !f || 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 })),
     ...m.flatMap((u) => u.calls)
   ], T = r.windowed || m.some((u) => u.windowed), x = !I && !T && E.every((u) => Oe.has(u.kind)), C = (u) => {
@@ -1264,7 +1264,7 @@ function J(e, n) {
       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");
-  return B(
+  return G(
     {
       stage: "aggregate",
       calls: E,
@@ -1286,8 +1286,8 @@ const Qt = t.object({
   intent: Je,
   matrixWindowRequest: pe
 }).strict(), Jt = t.object({
-  runtimeFilters: G.innerType().shape.filters,
-  runtimeSorts: G.innerType().shape.sorts.optional()
+  runtimeFilters: B.innerType().shape.filters,
+  runtimeSorts: B.innerType().shape.sorts.optional()
 });
 function vn(e) {
   return Jt.parse(e);
@@ -1304,12 +1304,12 @@ const en = {
 });
 export {
   lt as $,
-  bn as A,
-  An as B,
-  xt as C,
-  Pt as D,
-  jt as E,
-  In as F,
+  oe as A,
+  bn as B,
+  An as C,
+  xt as D,
+  Pt as E,
+  jt as F,
   Ft as G,
   Lt as H,
   qt as I,
@@ -1342,8 +1342,8 @@ export {
   ln as a7,
   un as a8,
   ht as a9,
-  ft as aa,
-  gt as ab,
+  gt as aa,
+  ft as ab,
   dn as ac,
   mn as ad,
   yt as ae,
@@ -1355,29 +1355,29 @@ export {
   vn as ak,
   Tn as al,
   Qt as am,
-  It as b,
+  yn as b,
   Sn as c,
-  _e as d,
-  we as e,
-  ke as f,
+  At as d,
+  It as e,
+  _e as f,
   hn as g,
-  ve as h,
+  we as h,
   Rt as i,
-  _t as j,
-  kt as k,
-  vt as l,
+  ke as j,
+  ve as k,
+  _t as l,
   pe as m,
-  Ae as n,
-  Te as o,
-  fn as p,
-  Re as q,
-  gn as r,
-  At as s,
-  Et as t,
-  yn as u,
-  Ee as v,
-  Ct as w,
-  se as x,
-  z as y,
-  oe as z
+  kt as n,
+  vt as o,
+  gn as p,
+  Ae as q,
+  Te as r,
+  In as s,
+  Re as t,
+  fn as u,
+  Et as v,
+  Ee as w,
+  Ct as x,
+  se as y,
+  z
 };

package/dist/chunks/{metric-comparison-QEkk6hqL.js → metric-comparison-BKHyvnAy.js}

@@ -1,4 +1,4 @@
-import { A as b } from "./validators-BS521dum.js";
+import { A as b } from "./validators-DMSH81OM.js";
 const g = "higher_is_better", D = {
   displayMode: "difference",
   showComparison: !0,
@@ -380,13 +380,13 @@ export {
   D as C,
   g as D,
   y as a,
-  k as b,
-  C as c,
+  _ as b,
+  k as c,
   N as d,
   M as e,
   S as f,
   A as g,
   I as r,
-  _ as v,
+  C as v,
   T as w
 };

package/dist/chunks/{numeric-presentation-D2I9znLM.js → numeric-presentation-CWu3gunq.js}

@@ -1,4 +1,4 @@
-import { K as C, M as O } from "./validators-BS521dum.js";
+import { K as C, M as O } from "./validators-DMSH81OM.js";
 import { canonicalizeSupportedLocale as E, canonicalizeSupportedCurrencyCode as h } from "../value-format-preferences/index.js";
 import { d as _ } from "./temporal-bucket-DlFuhCnT.js";
 const U = [