react-semaphor 0.1.537 → 0.1.539

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

@@ -1,5 +1,6 @@
 import { z as t } from "zod";
-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";
+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 = {
   answerSummary: "string",
   responseDetail: "responseDetail",
@@ -87,7 +88,7 @@ function at(e, n, a = {}) {
     status: a.status ?? et[e]
   };
 }
-function rn(e) {
+function sn(e) {
   if (!e || typeof e != "object") return;
   const n = e.refusal ?? e;
   if (!n || typeof n != "object") return;
@@ -109,7 +110,7 @@ const rt = {
   budget_exceeded: { message: "The query exceeds this view’s limits.", nextStep: "Request fewer rows, columns or measures." },
   cancelled: { message: "The query was cancelled.", nextStep: "Reload the view when ready." }
 };
-function sn(e) {
+function on(e) {
   const n = rt[e.code], a = at(e.code, n.message, { nextStep: n.nextStep, status: e.status }), r = e.retryable ?? a.retryable;
   return {
     ...a,
@@ -121,19 +122,19 @@ const st = [
   ...me,
   "stale_cursor",
   "source_truncated"
-], on = Object.freeze({
+], cn = Object.freeze({
   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 g(e, n, a) {
+function f(e, n, a) {
   e.addIssue({ code: "custom", path: n, message: a });
 }
 function v(e, n, a) {
-  new Set(e).size !== e.length && g(n, a, "Duplicate identity.");
+  new Set(e).size !== e.length && f(n, a, "Duplicate identity.");
 }
 const it = t.object({
   id: y,
-  axis: ce,
+  axis: ue,
   parent: k,
   position: t.union([
     t.object({ kind: t.literal("first") }).strict(),
@@ -152,7 +153,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 && g(n, [], "Request at least one page or block."), v(
+  !e.pages.length && !e.blocks.length && f(n, [], "Request at least one page or block."), v(
     [...e.pages, ...e.blocks].map((a) => a.id),
     n,
     []
@@ -163,13 +164,13 @@ const it = t.object({
       for (const s of a[r].pageIds)
         e.pages.some(
           (c) => c.id === s && c.axis === r
-        ) || g(
+        ) || f(
           n,
           ["blocks", a.id, r],
           "Page reference must name a page on this axis in this operation."
         );
   }
-}), cn = t.object({ spec: B, request: pe }).strict().superRefine(({ spec: e, request: n }, a) => {
+}), ln = t.object({ spec: G, request: pe }).strict().superRefine(({ spec: e, request: n }, a) => {
   for (const r of n.pages)
     ee(
       e,
@@ -178,53 +179,53 @@ const it = t.object({
       a,
       ["pages", r.id],
       !0
-    ), r.parent.length >= e[r.axis].length && g(
+    ), r.parent.length >= e[r.axis].length && f(
       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)) && g(a, ["blocks", r.id], "Unknown block measure.");
+    r.measureIds.some((s) => !e.measures.some((c) => c.id === s)) && f(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]);
   }
 }), lt = t.object({
   requestId: y,
-  axis: ce,
+  axis: ue,
   parent: k,
   members: t.array(t.object({ path: k }).strict()).readonly(),
   before: y.nullable(),
   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") && g(n, ["parent"], "Others has no children.");
+  e.parent.some((r) => r.member.kind === "others") && f(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 && 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(
+  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(
     e.members.map(
       (r) => {
         var s;
         return (s = r.path[r.path.length - 1]) == null ? void 0 : s.levelId;
       }
     )
-  ).size > 1 && g(n, ["members"], "One page must contain one child level."), v(
+  ).size > 1 && f(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)) && g(n, ["members"], "Page members must be immediate children.");
+    (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.");
 }), he = t.object({
   rowPaths: t.array(k).readonly(),
   columnPaths: t.array(k).readonly(),
   measureIds: t.array(O).readonly()
 }).strict();
-function ge(e, n) {
+function fe(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 };
 }
@@ -232,10 +233,10 @@ const ut = t.object({
   requestId: y,
   coverage: he,
   cells: t.array(
-    je.extend({ value: K }).strict()
+    Ze.extend({ value: $ }).strict()
   ).readonly()
 }).strict().superRefine((e, n) => {
-  const { rows: a, columns: r } = ge(e.coverage, n), s = new Set(a), c = new Set(r), i = new Set(e.coverage.measureIds);
+  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([
@@ -248,30 +249,30 @@ 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)) && g(n, ["cells"], "Cell is outside certified coverage.");
+    (!s.has(A(l.rowPath)) || !c.has(A(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,
   values: t.array(
-    t.tuple([q, q, q, K]).readonly()
+    t.tuple([q, q, q, $]).readonly()
   ).readonly()
 }).strict().superRefine((e, n) => {
-  ge(e.coverage, n);
+  fe(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) {
-      g(n, ["values"], "Cell is outside certified coverage.");
+      f(n, ["values"], "Cell is outside certified coverage.");
       continue;
     }
     const o = `${i},${l},${m}`;
-    c.has(o) && g(n, ["values"], "Duplicate identity."), c.add(o);
+    c.has(o) && f(n, ["values"], "Duplicate identity."), c.add(o);
   }
 }), ne = t.object({
   id: O,
-  column: Le,
+  column: je,
   nativeDataType: y,
-  semanticFormat: Fe.optional()
-}).strict(), fe = t.object({
+  semanticFormat: Ke.optional()
+}).strict(), ge = t.object({
   levels: t.array(ne).readonly(),
   measures: t.array(ne).readonly()
 }).strict(), Y = t.object({
@@ -288,13 +289,13 @@ const ut = t.object({
     t.object({ kind: t.enum(["page", "block"]), requestId: y }).strict()
   ])
 }).strict(), mt = t.object({
-  dialect: t.enum(["postgres", "clickhouse", "duckdb"]),
-  aggregates: t.array(Ue).readonly()
+  dialect: t.enum(["postgres", "clickhouse", "duckdb", "snowflake"]),
+  aggregates: t.array($e).readonly()
 }).strict();
 function ye(e) {
   return t.object({
     queryIdentity: y,
-    descriptors: fe,
+    descriptors: ge,
     capabilities: mt,
     pages: t.array(lt).readonly(),
     blocks: t.array(e).readonly(),
@@ -309,12 +310,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)) && g(
+      c.push(...i.coverage.rowPaths, ...i.coverage.columnPaths), i.coverage.measureIds.some((l) => !s.has(l)) && f(
         a,
         ["blocks", i.requestId],
         "Coverage references an unknown measure descriptor."
       );
-    c.some((i) => i.some((l) => !r.has(l.levelId))) && g(
+    c.some((i) => i.some((l) => !r.has(l.levelId))) && f(
       a,
       ["descriptors"],
       "Acquired paths require level descriptors."
@@ -337,7 +338,7 @@ function ye(e) {
     );
     for (const i of n.failures)
       if (i.scope.kind === "operation")
-        g(
+        f(
           a,
           ["failures"],
           "Operation failure cannot accompany acquired data."
@@ -346,7 +347,7 @@ function ye(e) {
         const l = i.scope.requestId;
         [...n.pages, ...n.blocks].some(
           (m) => m.requestId === l
-        ) && g(
+        ) && f(
           a,
           ["failures"],
           "A requested unit cannot both succeed and fail."
@@ -370,16 +371,16 @@ function be(e) {
     const r = n;
     if (r.status === "failed") return;
     const { window: s } = r;
-    !s.pages.length && !s.blocks.length && g(
+    !s.pages.length && !s.blocks.length && f(
       a,
       ["window"],
       "A window outcome requires successful acquired work."
-    ), r.status === "success" != (s.failures.length === 0) && g(a, ["status"], "Status must match failure coverage.");
+    ), r.status === "success" != (s.failures.length === 0) && f(a, ["status"], "Status must match failure coverage.");
   });
 }
-const ln = be(
+const un = be(
   Se
-), un = be(
+), dn = be(
   pt
 );
 function ht(e) {
@@ -395,7 +396,7 @@ function ht(e) {
     })
   };
 }
-function gt(e) {
+function ft(e) {
   const { rowPaths: n, columnPaths: a, measureIds: r } = e.coverage;
   return {
     requestId: e.requestId,
@@ -408,14 +409,14 @@ function gt(e) {
     }))
   };
 }
-function ft(e) {
+function gt(e) {
   return { ...e, blocks: e.blocks.map(ht) };
 }
-function dn(e) {
-  return { ...e, blocks: e.blocks.map(gt) };
-}
 function mn(e) {
-  return e.status === "failed" ? e : { status: e.status, window: ft(e.window) };
+  return { ...e, blocks: e.blocks.map(ft) };
+}
+function pn(e) {
+  return e.status === "failed" ? e : { status: e.status, window: gt(e.window) };
 }
 const Ae = t.object({
   kind: t.literal("matrix"),
@@ -432,11 +433,11 @@ const Ae = t.object({
   }).strict()
 ]), St = t.object({
   columns: t.array(yt).readonly(),
-  descriptors: fe
+  descriptors: ge
 }).strict(), ae = t.union([
   t.object({
     kind: t.literal("value"),
-    value: K.refine(
+    value: $.refine(
       (e) => e !== null
     )
   }).strict(),
@@ -454,7 +455,7 @@ const Ae = t.object({
     columnPath: k,
     values: t.array(ae).readonly()
   }).strict()
-]), pn = t.discriminatedUnion("kind", [
+]), hn = t.discriminatedUnion("kind", [
   t.object({
     kind: t.literal("layout"),
     layout: St,
@@ -466,10 +467,10 @@ const Ae = t.object({
     next: y.nullable()
   }).strict()
 ]), At = t.union([
+  Fe,
+  Le,
+  Ue,
   qe,
-  De,
-  Me,
-  Ge,
   Ae
 ]), It = t.object({
   status: t.enum([
@@ -515,7 +516,7 @@ const Ae = t.object({
       queryId: t.string().optional(),
       summary: t.string(),
       evidenceIds: t.array(t.string()).optional(),
-      fieldsUsed: t.array(Z).optional()
+      fieldsUsed: t.array(K).optional()
     }).passthrough()
   ),
   blocked: t.array(
@@ -542,11 +543,11 @@ const Ae = t.object({
   ).optional()
 }).passthrough(), we = t.object({
   scope: t.literal("filtered_query"),
-  measures: t.record(Be)
+  measures: t.record(De)
 }).passthrough(), ke = t.object({
   answeredObligations: t.array(t.string()),
   missingObligations: t.array(t.string()),
-  warnings: t.array(ze).optional()
+  warnings: t.array(Me).optional()
 }).passthrough(), ve = t.object({
   intentId: t.string().optional(),
   queryId: t.string().optional(),
@@ -562,9 +563,9 @@ const Ae = t.object({
   ]).optional(),
   intent: t.unknown().optional(),
   compiledQuery: t.unknown().optional(),
-  fieldsUsed: t.array(Z).optional(),
+  fieldsUsed: t.array(K).optional(),
   result: At.optional(),
-  validation: le,
+  validation: ce,
   coverage: ke.optional(),
   missingFields: t.array(t.string()).optional(),
   warnings: t.array(t.string()).optional(),
@@ -578,13 +579,13 @@ function wt(e) {
     case "boolean":
       return t.boolean().optional();
     case "compactExecutionFieldArray":
-      return t.array(Xe).optional();
+      return t.array(ze).optional();
     case "coverage":
       return ke.optional();
     case "diagnosticFeedback":
       return _e.optional();
     case "executionFieldArray":
-      return t.array(Z).optional();
+      return t.array(K).optional();
     case "executionResult":
       return _t.optional();
     case "number":
@@ -592,9 +593,9 @@ function wt(e) {
     case "population":
       return we.optional();
     case "record":
-      return We.optional();
+      return Ge.optional();
     case "recordArray":
-      return Ve.optional();
+      return Be.optional();
     case "responseDetail":
       return t.enum(["compact", "standard", "debug"]).optional();
     case "string":
@@ -606,7 +607,7 @@ function wt(e) {
     case "unknownArray":
       return t.array(t.unknown()).optional();
     case "validationResult":
-      return le.optional();
+      return ce.optional();
   }
 }
 const kt = Object.fromEntries(
@@ -616,7 +617,7 @@ const kt = Object.fromEntries(
 ), vt = t.object(kt).strict(), Tt = new Set(
   Object.keys(H)
 );
-function hn() {
+function fn() {
   return Object.keys(
     H
   );
@@ -644,13 +645,13 @@ function Re(e) {
     e.sourceField ?? ""
   ].join("::");
 }
-function fn(e) {
+function yn(e) {
   return `${F}${e}`;
 }
 function Et(e) {
   return e.startsWith(F) && e.length > F.length;
 }
-function yn(e) {
+function Sn(e) {
   return Et(e) ? e.slice(F.length) : void 0;
 }
 function Ee(e) {
@@ -688,7 +689,7 @@ function oe(e) {
     e.conditions.map(z).sort()
   );
 }
-function Sn(e) {
+function bn(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.");
@@ -713,16 +714,16 @@ function Sn(e) {
 function D(e, n) {
   return e < n ? -1 : e > n ? 1 : 0;
 }
-function bn(e, n) {
+function An(e, n) {
   return se(e) === se(n);
 }
 const Nt = "(Blank)";
-function An(e) {
+function In(e) {
   return e.conditions.map((n) => n.label ? n.label : n.operator === "isNull" || n.value === null ? Nt : String(n.value)).join(" · ");
 }
 const Ot = t.union([
-  $e,
-  Ke
+  Ve,
+  We
 ]), xt = t.object({
   name: t.string().min(1),
   source: Ot,
@@ -733,7 +734,7 @@ const Ot = t.union([
   operator: t.enum(["=", "isNull"]),
   value: t.union([t.string(), t.number().finite(), t.null()]),
   label: t.string().optional(),
-  temporalBucket: ue.optional()
+  temporalBucket: le.optional()
 }).strict().superRefine((e, n) => {
   e.operator === "isNull" != (e.value === null) && n.addIssue({
     code: t.ZodIssueCode.custom,
@@ -749,15 +750,15 @@ const Ot = t.union([
     message: "A tuple holds one condition per field.",
     path: ["conditions"]
   });
-}), In = t.object({
+}), _n = t.object({
   kind: t.literal("selection"),
   sourceCardId: t.string().min(1),
   tuples: t.array(jt).min(1).max(Te)
 }).strict(), Ft = t.object({
-  field: Ze,
+  field: Xe,
   operator: t.enum(["=", "isNull"]),
   value: t.union([t.string(), t.number().finite(), t.null()]),
-  temporalBucket: ue.optional()
+  temporalBucket: le.optional()
 }).strict().superRefine((e, n) => {
   e.operator === "isNull" != (e.value === null) && n.addIssue({
     code: t.ZodIssueCode.custom,
@@ -777,7 +778,7 @@ const Ot = t.union([
       path: ["conditions", a, "field"]
     });
   }
-}), _n = t.object({
+}), wn = t.object({
   id: t.string().min(1),
   tuples: t.array(Lt).min(1).max(Te)
 }).strict(), Ut = t.object({ key: t.string().min(1), nativeText: t.string().nullable() }).strict(), qt = t.object({
@@ -789,7 +790,7 @@ const Ot = t.union([
   (e) => new Set(e.dataAnchors.map((n) => n.key)).size === e.dataAnchors.length,
   { message: "dataAnchors keys must be unique", path: ["dataAnchors"] }
 );
-function wn(e) {
+function kn(e) {
   if (e == null) return;
   const n = qt.safeParse(e);
   return n.success ? n.data : void 0;
@@ -864,7 +865,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 Gt = /* @__PURE__ */ new Set([
+const Bt = /* @__PURE__ */ new Set([
   "NULLIF",
   "COALESCE",
   "IFNULL",
@@ -879,7 +880,7 @@ const Gt = /* @__PURE__ */ new Set([
   "CAST",
   "TRY_CAST",
   "SAFE_CAST"
-]), Bt = /* @__PURE__ */ new Set(["DECIMAL", "NUMERIC", "INTEGER", "INT", "BIGINT", "FLOAT", "DOUBLE", "REAL", "VARCHAR", "TEXT"]), ie = /[A-Za-z_]/, zt = /[A-Za-z0-9_]/;
+]), Gt = /* @__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 +945,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 f = P(e, p);
-        const I = f - 1;
-        let E = f;
-        const T = e.slice(p + 1, f - 1);
+        let g = P(e, p);
+        const I = g - 1;
+        let E = g;
+        const T = e.slice(p + 1, g - 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 +956,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, f);
+          const h = j(e, g);
           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] === "(") {
-              f = P(e, w), E = f;
+              g = P(e, w), E = g;
               continue;
             }
           }
           if ((R === "FILTER" || R === "OVER") && e[u] === "(") {
-            b = b || R === "OVER", _ = _ || R === "FILTER", f = P(e, u);
+            b = b || R === "OVER", _ = _ || R === "FILTER", g = P(e, u);
             continue;
           }
           break;
@@ -976,11 +977,11 @@ function W(e, n = /* @__PURE__ */ new Set()) {
           kind: Ne(d, C),
           distinct: C,
           windowed: b,
-          tokens: Wt(e.slice(p, f)),
+          tokens: Wt(e.slice(p, g)),
           span: { start: l, end: E, argumentStart: p + 1, argumentEnd: I },
           argumentCount: x,
           filtered: _
-        }), c += `@${a.length - 1}`, l = f;
+        }), c += `@${a.length - 1}`, l = g;
         continue;
       }
       c += e.slice(l, o), l = o;
@@ -1032,9 +1033,9 @@ function Xt(e, n) {
     }
     if (o.startsWith("@") || o === "'S'" || ["NULL", "TRUE", "FALSE"].includes(o) || /^[0-9.]/.test(o))
       return s++, !0;
-    if (!Gt.has(o) || (s++, !c("(") || !i())) return !1;
+    if (!Bt.has(o) || (s++, !c("(") || !i())) return !1;
     if (["CAST", "TRY_CAST", "SAFE_CAST"].includes(o)) {
-      if (!c("AS") || !Bt.has(a[s++]) || (c("PRECISION"), c("(") && (!/^\d+$/.test(a[s++] || "") || c(",") && !/^\d+$/.test(a[s++] || "") || !c(")"))))
+      if (!c("AS") || !Gt.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;
@@ -1042,7 +1043,7 @@ function Xt(e, n) {
   };
   return i() && s === a.length;
 }
-function $t(e) {
+function Zt(e) {
   const n = [];
   let a = 0;
   for (; a < e.length; ) {
@@ -1087,7 +1088,7 @@ function $t(e) {
   return n;
 }
 function Kt(e) {
-  const n = $t(e), a = n.some((o) => o.type === "op" && o.value === "/");
+  const n = Zt(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;
@@ -1099,9 +1100,9 @@ function Kt(e) {
         if (!(I && I.type === "op" && (I.value === "+" || I.value === "-"))) break;
         r += 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;
+      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;
     }
     return { degree: d ?? 0, units: o };
   }, i = () => {
@@ -1163,7 +1164,7 @@ function xe(e) {
       return { kind: "none", reason: "other" };
   }
 }
-function Zt(e) {
+function $t(e) {
   var n, a;
   return ((n = e.derivedField) == null ? void 0 : n.computeStage) || ((a = e.calculatedFormula) == null ? void 0 : a.computeStage);
 }
@@ -1177,7 +1178,7 @@ const Q = {
   identity: "unresolved",
   unresolved: !0
 }, Pe = { ...Q, stage: "row" };
-function $(e) {
+function Z(e) {
   return {
     stage: "row",
     outer: e,
@@ -1190,7 +1191,7 @@ function $(e) {
     unresolved: !1
   };
 }
-function G(e, n) {
+function B(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" } };
@@ -1202,7 +1203,7 @@ function Ht(e, n) {
     return r === "row_input" ? "raw" : r.unresolved || r.stage === "aggregate" || r.outer ? r : "raw";
   }
   const a = X(e.aggregate);
-  return a ? $(a) : "raw";
+  return a ? Z(a) : "raw";
 }
 const Yt = 12;
 function J(e, n) {
@@ -1210,8 +1211,8 @@ function J(e, n) {
   if (n > Yt) return Q;
   const a = typeof e.expression == "string" ? e.expression.trim() : "";
   if (!a)
-    return G(
-      $(X(e.aggregate) ?? "sum"),
+    return B(
+      Z(X(e.aggregate) ?? "sum"),
       e
     );
   const r = W(a), s = ((R = e.calculatedFormula) == null ? void 0 : R.inputFields) || [], c = (u) => {
@@ -1229,17 +1230,17 @@ function J(e, n) {
     })
   ), m = Array.from(i.values()).filter(
     (u) => u !== "raw"
-  ), o = Array.from(i.values()).some((u) => u === "raw"), d = r.calls.length > 0 || m.length > 0 || Zt(e) === "aggregate" || !!e.isPreAggregated, p = new Set(
+  ), o = Array.from(i.values()).some((u) => u === "raw"), d = r.calls.length > 0 || m.length > 0 || $t(e) === "aggregate" || !!e.isPreAggregated, p = new Set(
     [...i].filter(
       ([u, S]) => S === "raw" ? !d && !!c(u) : !S.unresolved
     ).map(([u]) => u)
-  ), f = W(a, p).aggregateInputsComplete;
+  ), g = W(a, p).aggregateInputsComplete;
   if (!d) {
-    if (!f) return Pe;
+    if (!g) return Pe;
     const u = X(e.aggregate);
-    return u ? G($(u), e) : "row_input";
+    return u ? B(Z(u), e) : "row_input";
   }
-  const I = !f || o || r.nestedAggregate || l || m.some((u) => u.unresolved) || r.calls.length === 0 && m.length === 0, E = [
+  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 })),
     ...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 +1265,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 G(
+  return B(
     {
       stage: "aggregate",
       calls: E,
@@ -1278,7 +1279,7 @@ function J(e, n) {
     e
   );
 }
-function kn(e) {
+function vn(e) {
   const n = J(e, 0);
   return n === "row_input" ? Pe : n;
 }
@@ -1286,10 +1287,10 @@ const Qt = t.object({
   intent: Je,
   matrixWindowRequest: pe
 }).strict(), Jt = t.object({
-  runtimeFilters: B.innerType().shape.filters,
-  runtimeSorts: B.innerType().shape.sorts.optional()
+  runtimeFilters: G.innerType().shape.filters,
+  runtimeSorts: G.innerType().shape.sorts.optional()
 });
-function vn(e) {
+function Tn(e) {
   return Jt.parse(e);
 }
 const en = {
@@ -1299,39 +1300,39 @@ const en = {
   resultShape: t.literal("matrix"),
   result: Ae.optional(),
   metadata: t.object({ rowLimitExceeded: t.boolean(), matrixFailure: Y.optional() }).passthrough()
-}, tn = ve.extend(en), Tn = tn.superRefine((e, n) => {
+}, 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,
-  bn as B,
-  An as C,
+  An as B,
+  In as C,
   xt as D,
   Pt as E,
   jt as F,
   Ft as G,
   Lt as H,
   qt as I,
-  wn as J,
+  kn as J,
   Mt as K,
   Ne as L,
   W as M,
   Kt as N,
-  kn as O,
+  vn as O,
   me as P,
   nt as Q,
   at as R,
   H as S,
-  rn as T,
-  sn as U,
+  sn as T,
+  on as U,
   st as V,
-  on as W,
+  cn as W,
   it as X,
   te as Y,
   ct as Z,
-  cn as _,
-  _n as a,
+  ln as _,
+  wn as a,
   ut as a0,
   dt as a1,
   ne as a2,
@@ -1339,28 +1340,28 @@ export {
   mt as a4,
   Se as a5,
   pt as a6,
-  ln as a7,
-  un as a8,
+  un as a7,
+  dn as a8,
   ht as a9,
-  gt as aa,
-  ft as ab,
-  dn as ac,
-  mn as ad,
+  ft as aa,
+  gt as ab,
+  mn as ac,
+  pn as ad,
   yt as ae,
   St as af,
   ae as ag,
   bt as ah,
-  pn as ai,
+  hn as ai,
   Jt as aj,
-  vn as ak,
-  Tn as al,
+  Tn as ak,
+  Rn as al,
   Qt as am,
-  yn as b,
-  Sn as c,
+  Sn as b,
+  bn as c,
   At as d,
   It as e,
   _e as f,
-  hn as g,
+  fn as g,
   we as h,
   Rt as i,
   ke as j,
@@ -1372,9 +1373,9 @@ export {
   gn as p,
   Ae as q,
   Te as r,
-  In as s,
+  _n as s,
   Re as t,
-  fn as u,
+  yn as u,
   Et as v,
   Ee as w,
   Ct as x,