@graphty/graphty-element 2.5.0 → 2.5.1

package/dist/chunks/{optionsFromZod-DHLLiX_8.js → optionsFromZod-B9RncoTX.js}

@@ -1,6 +1,6 @@
-import { c as he, G as y, S as Ie } from "./pluginRegistry-MaTIDh6l.js";
+import { c as he, G as y, S as Ie } from "./pluginRegistry-Bs8bEkz9.js";
 import { K as Te, f as Me } from "./types-C_c53VgR.js";
-import { b as _e } from "./GraphtyLogger-kbOx2zq3.js";
+import { b as _e } from "./GraphtyLogger-DOTwCiMR.js";
 import { Graph as ze, accelerated as X } from "@graphty/algorithms";
 import { INVALID_INDEX as L } from "@graphty/graph-format";
 import { z as me } from "zod/v4";
@@ -11,7 +11,7 @@ const _ = he({
   implementationOf: (e) => e.compute,
   builtInIds: () => Te
 });
-function bn(e, t) {
+function wn(e, t) {
   const n = e.descriptor;
   if (n === void 0 || typeof n != "object")
     throw new y({
@@ -43,13 +43,13 @@ function bn(e, t) {
     });
   _.register(e, t);
 }
-function wn() {
+function vn() {
   return _.descriptors();
 }
-function vn(e) {
+function On(e) {
   return _.byId(e);
 }
-function On() {
+function kn() {
   _.clearForTesting();
 }
 const Ce = ["forceAtlas2", "fruchtermanReingold", "springElectrical", "release"], xe = [
@@ -60,7 +60,7 @@ const Ce = ["forceAtlas2", "fruchtermanReingold", "springElectrical", "release"]
   "weaklyConnectedComponents",
   "minimumSpanningTree"
 ];
-function kn(e) {
+function Nn(e) {
   const t = {
     kind: e.backend
   };
@@ -80,11 +80,11 @@ function je(e) {
   }
   return t;
 }
-const Pe = ["auto", "off", "required"], Nn = "auto";
-function Sn(e) {
+const Pe = ["auto", "off", "required"], Sn = "auto";
+function An(e) {
   return typeof e == "string" && Pe.includes(e);
 }
-const Le = "f64", An = "f32", $n = "acceleration.minNodes", Rn = 0, En = "RTX 4070 SUPER, headless Chromium, 2026-09-25", Fn = Object.freeze({
+const Le = "f64", $n = "f32", Rn = "acceleration.minNodes", En = 0, Fn = "RTX 4070 SUPER, headless Chromium, 2026-09-25", In = Object.freeze({
   breadthFirstSearch: 3e5,
   sssp: 3e5,
   pageRank: 5e3,
@@ -112,13 +112,13 @@ function De(e, t) {
     });
   z.register(e, t);
 }
-function In() {
+function Tn() {
   return z.descriptors();
 }
-function Tn(e) {
+function Mn(e) {
   return z.byId(e);
 }
-function Mn() {
+function _n() {
   z.clearForTesting();
 }
 class b extends Error {
@@ -193,14 +193,14 @@ function He(e, t) {
   }
   return n;
 }
-function _n(e) {
+function zn(e) {
   return e;
 }
 function Be(e, t) {
   const n = e.getSnapshot(), r = t === "directed" ? n : e.undirected(n).snapshot, i = r.flags.multigraph ? r.simplified({ weights: "sum" }).snapshot : r;
   return Ve(i, t);
 }
-function zn(e) {
+function Cn(e) {
   const t = e.getSnapshot();
   return t.flags.multigraph ? t.edgeCount - t.simplified({ weights: "sum" }).snapshot.edgeCount : 0;
 }
@@ -564,7 +564,7 @@ function nt(e, t) {
       return te(n, t);
   }
 }
-function Cn(e, t) {
+function xn(e, t) {
   const n = t === "node", r = n ? e.nodeValue : e.edgeValue, i = n ? e.nodeHas : e.edgeHas, s = n ? e.nodeIdOf : e.edgeIdOf;
   return {
     value: r,
@@ -941,11 +941,11 @@ function bt(e) {
       return !1;
   return !0;
 }
-function xn(e, t) {
+function jn(e, t) {
   const { has: n } = e;
   return (r) => n(r, t);
 }
-function jn(e, t) {
+function Pn(e, t) {
   const { idOf: n } = e;
   if (n === null)
     throw new y({
@@ -956,7 +956,7 @@ function jn(e, t) {
     });
   return (r) => t.has(n(r));
 }
-function Pn(e, t, n) {
+function Ln(e, t, n) {
   const { value: r } = e;
   return (i) => {
     const s = n();
@@ -966,7 +966,7 @@ function Pn(e, t, n) {
     return typeof o == "number" && Number.isFinite(o) && o >= s;
   };
 }
-function Ln(e, t) {
+function Dn(e, t) {
   const n = ht(e), r = [];
   if ($(n, r), r.length === 0) {
     let i = n;
@@ -986,7 +986,14 @@ const H = "results", wt = "$";
 function T(e, t) {
   return t === void 0 ? `${H}.${e}` : `${H}.${e}.${t}`;
 }
-const be = {
+function vt(e) {
+  return `Group ${String(e)}`;
+}
+function be(e, t) {
+  const n = Number(e), r = Number(t);
+  return Number.isFinite(n) && Number.isFinite(r) && String(n) === String(e) && String(r) === String(t) ? n - r : String(e).localeCompare(String(t));
+}
+const we = {
   // -- per element ---------------------------------------------------------------------
   value: {
     meaning: "The number this metric measured for this element.",
@@ -1154,7 +1161,7 @@ const be = {
     scope: "graph",
     types: ["number"]
   }
-}, Dn = Object.keys(be), J = {
+}, Gn = Object.keys(we), J = {
   "node-metric": {
     shape: "node-metric",
     primaryField: "value",
@@ -1274,10 +1281,10 @@ const be = {
 function B(e) {
   return J[e];
 }
-function Gn(e) {
+function Un(e) {
   return J[e].layer === "highlight";
 }
-function Un(e, t) {
+function Hn(e, t) {
   const n = J[e], r = [], i = [
     { names: n.nodeFields, kind: "node" },
     { names: n.edgeFields, kind: "edge" },
@@ -1294,25 +1301,25 @@ function Un(e, t) {
         });
         continue;
       }
-      const c = be[a].types;
+      const c = we[a].types;
       c.includes(u.type) || r.push({
         field: a,
         kind: o,
         reason: `${o} field "${a}" is typed "${u.type}", not ${c.map((h) => `"${h}"`).join(" or ")}`
       });
     }
-  return n.headlineScalar && !vt(n, t) && r.push({
+  return n.headlineScalar && !Ot(n, t) && r.push({
     field: null,
     kind: "graph",
     reason: `shape "${e}" requires one graph-level scalar of its own beside "count"`
   }), r;
 }
-function vt(e, t) {
+function Ot(e, t) {
   const n = [...e.graphFields, ...e.optionalGraphFields];
   return t.some((r) => r.kind === "graph" && !n.includes(r.name));
 }
-const Ot = 3;
-function kt(e, t) {
+const kt = 3;
+function Nt(e, t) {
   if (e === t)
     return 0;
   const n = new Uint32Array(t.length + 1), r = new Uint32Array(t.length + 1);
@@ -1328,23 +1335,23 @@ function kt(e, t) {
   }
   return n[t.length];
 }
-function Nt(e, t, n = Ot) {
+function St(e, t, n = kt) {
   const r = e.toLowerCase(), i = t.map((s) => ({
     candidate: s,
-    distance: kt(r, s.toLowerCase())
+    distance: Nt(r, s.toLowerCase())
   }));
   return i.sort((s, o) => s.distance - o.distance || s.candidate.localeCompare(o.candidate)), Object.freeze(i.slice(0, Math.max(n, 0)).map((s) => s.candidate));
 }
 function se(e) {
   return typeof e == "string" ? e : "runId" in e ? e.runId : e.id;
 }
-function St(e) {
+function At(e) {
   return typeof e == "string" ? void 0 : e.shape;
 }
-function At(e, t) {
+function $t(e, t) {
   return e.fields.some((n) => n.name === t) || t in e.graph;
 }
-class $t {
+class Rt {
   #e;
   /**
    * Build the API over a registry.
@@ -1368,7 +1375,7 @@ class $t {
     const r = se(t);
     if (n !== void 0)
       return T(r, n);
-    const i = St(t) ?? this.#e.entry(r)?.shape, s = i === void 0 ? null : B(i).primaryField;
+    const i = At(t) ?? this.#e.entry(r)?.shape, s = i === void 0 ? null : B(i).primaryField;
     return s === null ? T(r) : T(r, s);
   }
   /**
@@ -1406,7 +1413,7 @@ class $t {
    */
   has(t, n) {
     const r = this.get(t);
-    return r === void 0 ? !1 : n === void 0 || At(r, n);
+    return r === void 0 ? !1 : n === void 0 || $t(r, n);
   }
   /**
    * Every run that has published a result, as an expression editor reads them.
@@ -1419,20 +1426,20 @@ class $t {
     return Object.freeze(t);
   }
 }
-function Hn(e) {
-  return new $t(e);
+function Bn(e) {
+  return new Rt(e);
 }
-const Rt = 20, j = 100, Et = 100, Ft = Object.freeze([]), It = Object.freeze(["max", "min-max", "none"]);
-function we(e) {
-  return typeof e == "string" && It.includes(e);
+const Et = 20, j = 100, Ft = 100, It = Object.freeze([]), Tt = Object.freeze(["max", "min-max", "none"]);
+function ve(e) {
+  return typeof e == "string" && Tt.includes(e);
 }
-function Bn(e) {
+function Vn(e) {
   return {
     length: e.length,
     get: (t) => e[t]
   };
 }
-const Tt = Object.freeze({
+const Mt = Object.freeze({
   measured: 0,
   min: Number.NaN,
   max: Number.NaN,
@@ -1441,7 +1448,7 @@ const Tt = Object.freeze({
   tiedAtMin: 0,
   smallestPositive: null
 });
-function ve(e) {
+function Oe(e) {
   const { length: t } = e, n = new Float64Array(t);
   let r = 0;
   for (let l = 0; l < t; l++) {
@@ -1449,7 +1456,7 @@ function ve(e) {
     Number.isFinite(d) && (n[r] = d, r++);
   }
   if (r === 0)
-    return { length: t, ...Tt };
+    return { length: t, ...Mt };
   let i = Number.POSITIVE_INFINITY, s = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY, a = 0, u = 0;
   for (let l = 0; l < r; l++) {
     const d = n[l];
@@ -1472,8 +1479,8 @@ function ve(e) {
     smallestPositive: Number.isFinite(o) ? o : null
   };
 }
-function Oe(e) {
-  const t = ve(e);
+function ke(e) {
+  const t = Oe(e);
   return { view: Object.freeze({
     length: e.length,
     get: (r) => e.get(r),
@@ -1501,7 +1508,7 @@ function q(e) {
   }
   return Object.freeze(r);
 }
-function Mt(e, t) {
+function _t(e, t) {
   let n = Math.min(t, e.length);
   for (; n > 0 && n < e.length && e[n].rank === e[n - 1].rank; )
     n--;
@@ -1518,17 +1525,17 @@ function Mt(e, t) {
     reason: o
   });
 }
-function _t(e) {
+function zt(e) {
   const { smallestPositive: t } = e;
   if (e.measured === 0 || !(e.max > 0) || t === null)
     return !1;
   const n = e.min > 0 ? e.min : t;
   return Math.log10(e.max) > Math.log10(n);
 }
-function zt(e) {
-  return e.measured === 0 || !(e.median > 0) || e.max / e.median <= Et ? "linear" : _t(e) ? "log" : "linear";
+function Ct(e) {
+  return e.measured === 0 || !(e.median > 0) || e.max / e.median <= Ft ? "linear" : zt(e) ? "log" : "linear";
 }
-function Ct(e, t, n, r) {
+function xt(e, t, n, r) {
   if (!(t > e))
     return { binCount: 1, indexOf: () => 0, rangeOf: () => [e, t] };
   if (r) {
@@ -1552,7 +1559,7 @@ function Ct(e, t, n, r) {
     ]
   };
 }
-function xt(e, t, n, r, i) {
+function jt(e, t, n, r, i) {
   const s = e > 0 ? 0 : 1, o = s === 0 ? e : n;
   if (!(t > 0) || o === null || !(o > 0))
     return null;
@@ -1582,9 +1589,9 @@ function xt(e, t, n, r, i) {
     }
   };
 }
-function jt(e) {
+function Pt(e) {
   if (e === void 0)
-    return Rt;
+    return Et;
   if (!Number.isInteger(e) || e < 1 || e > j)
     throw new y({
       code: "E_OPTION_RANGE",
@@ -1594,7 +1601,7 @@ function jt(e) {
     });
   return e;
 }
-function Pt(e, t) {
+function Lt(e, t) {
   const n = /* @__PURE__ */ new Map();
   for (let r = 0; r < e.length; r++) {
     const i = e.get(r);
@@ -1611,12 +1618,12 @@ function Pt(e, t) {
   }
   return n;
 }
-function Lt(e, t) {
-  const n = jt(t?.bins), r = t?.integerValued ?? !1, i = ve(e), s = zt(i), o = Pt(e, n);
+function Dt(e, t) {
+  const n = Pt(t?.bins), r = t?.integerValued ?? !1, i = Oe(e), s = Ct(i), o = Lt(e, n);
   if (o !== null) {
     if (o.size === 0)
       return Object.freeze({
-        bins: Ft,
+        bins: It,
         // Nothing was measured, so nothing is on any axis. Reported as linear rather
         // than as the request, because "log scale" over an empty chart is the same false
         // caption this whole return type exists to prevent.
@@ -1635,7 +1642,7 @@ function Lt(e, t) {
       binning: "per-value"
     });
   }
-  const u = t?.scale === "log" || t?.scale === "auto" && s === "log" ? xt(i.min, i.max, i.smallestPositive, n, r) : null, c = u ?? Ct(i.min, i.max, n, r), h = new Array(c.binCount).fill(0);
+  const u = t?.scale === "log" || t?.scale === "auto" && s === "log" ? jt(i.min, i.max, i.smallestPositive, n, r) : null, c = u ?? xt(i.min, i.max, n, r), h = new Array(c.binCount).fill(0);
   for (let p = 0; p < e.length; p++) {
     const l = e.get(p);
     Number.isFinite(l) && (h[c.indexOf(l)] += 1);
@@ -1654,7 +1661,7 @@ function Lt(e, t) {
     binning: "banded"
   });
 }
-const Dt = 10, Gt = 10;
+const Gt = 10, Ut = 10;
 function oe(e) {
   const t = { ids: [], records: [], index: /* @__PURE__ */ new Map() };
   if (e === void 0)
@@ -1673,13 +1680,13 @@ function V(e, t) {
   const { records: n } = e;
   return {
     length: n.length,
-    get: (r) => ke(n[r][t])
+    get: (r) => Ne(n[r][t])
   };
 }
 function Y(e, t) {
-  return e.ids.map((n, r) => ({ id: n, value: ke(e.records[r][t]) }));
+  return e.ids.map((n, r) => ({ id: n, value: Ne(e.records[r][t]) }));
 }
-function ke(e) {
+function Ne(e) {
   return typeof e == "number" ? e : Number.NaN;
 }
 function W(e) {
@@ -1694,7 +1701,7 @@ function g(e, t, n) {
 function M(e, t, n) {
   e[t] === void 0 && (e[t] = n);
 }
-function Ne(e, t) {
+function Se(e, t) {
   const n = /* @__PURE__ */ new Map();
   for (const r of e.records) {
     const i = r[t];
@@ -1702,20 +1709,16 @@ function Ne(e, t) {
   }
   return n;
 }
-function Se(e, t) {
-  const n = String(e), r = String(t);
-  return n === r ? 0 : n < r ? -1 : 1;
-}
-function Ut(e) {
+function Ht(e) {
   const t = [...e.entries()].map(([n, r]) => ({ group: n, size: r }));
-  return t.sort((n, r) => r.size - n.size || Se(n.group, r.group)), Object.freeze(t.map((n) => Object.freeze(n)));
+  return t.sort((n, r) => r.size - n.size || be(n.group, r.group)), Object.freeze(t.map((n) => Object.freeze(n)));
 }
 function Ae(e, t) {
   const n = e.find((r) => r.name === t)?.normalization;
-  return we(n) ? n : "none";
+  return ve(n) ? n : "none";
 }
 function ae(e, t, n) {
-  const { statistics: r } = Oe(V(e, "value"));
+  const { statistics: r } = ke(V(e, "value"));
   for (const i of q(Y(e, "value"))) {
     const s = e.index.get(i.id);
     s !== void 0 && (M(e.records[s], "rank", i.rank), M(e.records[s], "percentile", i.percentile));
@@ -1723,23 +1726,23 @@ function ae(e, t, n) {
   r.measured > 0 && (g(t, "min", r.min), g(t, "max", r.max), g(t, "median", r.median), g(t, "mean", r.mean)), g(t, "measured", r.measured), g(t, "tiedAtMin", r.tiedAtMin), g(t, "normalization", Ae(n, "value"));
 }
 function ce(e, t, n, r, i) {
-  const s = Ne(e, n);
+  const s = Se(e, n);
   for (const o of e.records) {
     const a = o[n];
     W(a) && M(o, r, s.get(a));
   }
-  g(t, i, s.size), g(t, "sizes", Ut(s));
+  g(t, i, s.size), g(t, "sizes", Ht(s));
 }
-function Ht(e, t) {
+function Bt(e, t) {
   for (const r of q(Y(e, "score"))) {
     const i = e.index.get(r.id);
     i !== void 0 && M(e.records[i], "rank", r.rank);
   }
-  const n = [...Ne(e, "category").entries()].map(([r, i]) => ({
+  const n = [...Se(e, "category").entries()].map(([r, i]) => ({
     category: String(r),
     count: i
   }));
-  n.sort((r, i) => i.count - r.count || Se(r.category, i.category)), g(t, "categories", Object.freeze(n.map((r) => Object.freeze(r))));
+  n.sort((r, i) => i.count - r.count || be(r.category, i.category)), g(t, "categories", Object.freeze(n.map((r) => Object.freeze(r))));
 }
 function F(e, t) {
   let n = 0;
@@ -1753,7 +1756,7 @@ function ue(e, t) {
     r[t] !== void 0 && n++;
   return n;
 }
-function Bt(e, t, n, r, i) {
+function Vt(e, t, n, r, i) {
   switch (e) {
     case "node-metric":
       ae(t, r, i);
@@ -1768,7 +1771,7 @@ function Bt(e, t, n, r, i) {
       ce(t, r, "level", "levelSize", "levelCount");
       break;
     case "category-table":
-      Ht(t, r);
+      Bt(t, r);
       break;
     case "path":
       g(r, "length", F(t, "onPath")), g(r, "hops", F(n, "onPath"));
@@ -1781,7 +1784,7 @@ function Bt(e, t, n, r, i) {
       break;
   }
 }
-function Vt(e) {
+function Jt(e) {
   switch (e) {
     case "node-metric":
     case "edge-metric":
@@ -1794,20 +1797,20 @@ function Vt(e) {
       return null;
   }
 }
-function Jt(e, t) {
+function qt(e, t, n) {
   if (!Array.isArray(e))
     return;
-  const n = [];
-  for (const r of e) {
-    if (typeof r != "object" || r === null)
+  const r = [];
+  for (const i of e) {
+    if (typeof i != "object" || i === null)
       continue;
-    const i = r, s = i.group ?? i.category, o = i.size ?? i.count;
-    if (W(s) && typeof o == "number" && n.push(Object.freeze({ group: s, size: o })), n.length === t)
+    const s = i, o = s.group ?? s.category, a = s.size ?? s.count;
+    if (W(o) && typeof a == "number" && r.push(Object.freeze(n ? { group: o, size: a, name: vt(r.length + 1) } : { group: o, size: a })), r.length === t)
       break;
   }
-  return Object.freeze(n);
+  return Object.freeze(r);
 }
-class qt {
+class Yt {
   #e;
   #t;
   #n;
@@ -1893,7 +1896,7 @@ class qt {
     const r = `${String(n)}:${t}`, i = this.#c.get(r);
     if (i !== void 0)
       return i;
-    const s = Mt(this.ranking(t), this.#l(n, "n"));
+    const s = _t(this.ranking(t), this.#l(n, "n"));
     return this.#c.set(r, s), s;
   }
   /**
@@ -1928,7 +1931,7 @@ class qt {
    */
   histogram(t, n) {
     const r = this.#d(t), i = r.kind === "edge" ? this.#t : this.#e;
-    return Lt(V(i, t), {
+    return Dt(V(i, t), {
       ...n,
       integerValued: r.type === "integer"
     });
@@ -1984,7 +1987,7 @@ class qt {
         code: "E_UNKNOWN_ATTRIBUTE",
         source: "run",
         message: `Run "${this.runId}" published no field named "${t}".`,
-        details: { field: t, available: i, candidates: Nt(t, i) },
+        details: { field: t, available: i, candidates: St(t, i) },
         target: { kind: "run", id: this.runId }
       });
     if (!P(r))
@@ -2016,7 +2019,7 @@ class qt {
     const n = this.#o.get(t);
     if (n !== void 0)
       return n;
-    const r = Oe(V(this.#p(t), t));
+    const r = ke(V(this.#p(t), t));
     return this.#o.set(t, r), r;
   }
   /**
@@ -2034,7 +2037,7 @@ class qt {
    * @returns The summary.
    */
   #g() {
-    const t = Vt(this.shape), n = t === null || this.#m(t) === null ? null : t, r = n === null ? null : this.#h(n).statistics, i = r !== null && r.measured > 0 ? r : null, s = n === null ? [] : this.ranking(n, Dt).map(
+    const t = Jt(this.shape), n = t === null || this.#m(t) === null ? null : t, r = n === null ? null : this.#h(n).statistics, i = r !== null && r.measured > 0 ? r : null, s = n === null ? [] : this.ranking(n, Gt).map(
       (c) => Object.freeze({
         id: c.id,
         label: this.#i(c.id) ?? String(c.id),
@@ -2054,7 +2057,7 @@ class qt {
       top: Object.freeze(s),
       caveats: this.#n,
       durationMs: this.#r
-    }, a = this.graph.sizes ?? this.graph.categories, u = Jt(a, Gt);
+    }, a = this.graph.sizes ?? this.graph.categories, u = qt(a, Ut, this.shape === "community");
     return Object.freeze(u === void 0 ? o : { ...o, groups: u });
   }
   /**
@@ -2088,19 +2091,19 @@ class qt {
    */
   #w(t) {
     const n = this.graph.normalization;
-    return we(n) ? n : t === null ? "none" : Ae(this.fields, t);
+    return ve(n) ? n : t === null ? "none" : Ae(this.fields, t);
   }
 }
-function Yt(e) {
+function Wt(e) {
   const t = oe(e.nodes), n = oe(e.edges), r = { ...e.graph };
-  Bt(e.shape, t, n, r, e.fields);
+  Vt(e.shape, t, n, r, e.fields);
   for (const i of t.records)
     Object.freeze(i);
   for (const i of n.records)
     Object.freeze(i);
-  return new qt(e, t, n, Object.freeze(r));
+  return new Yt(e, t, n, Object.freeze(r));
 }
-function Wt(e) {
+function Kt(e) {
   const t = e.styles?.config.data.knownFields.nodeLabelPath ?? null;
   if (t === null)
     return;
@@ -2110,11 +2113,11 @@ function Wt(e) {
     return typeof i == "string" || typeof i == "number" ? String(i) : void 0;
   };
 }
-function Vn(e) {
+function Jn(e) {
   return { exact: !0, precision: "f64", notes: [], ...e };
 }
-const Kt = 1024, Zt = 16;
-function Xt() {
+const Zt = 1024, Xt = 16;
+function Qt() {
   return {
     signal: new AbortController().signal,
     report: () => {
@@ -2124,15 +2127,15 @@ function Xt() {
     })
   };
 }
-async function Jn(e, t, n, r) {
+async function qn(e, t, n, r) {
   const i = n.length;
   e.report({ phase: t, completed: 0, total: i });
   let s = performance.now();
   for (let o = 0; o < i; o++)
-    o > 0 && o % Kt === 0 && (e.signal.throwIfAborted(), e.report({ phase: t, completed: o, total: i }), performance.now() - s >= Zt && (await e.yieldNow(), s = performance.now())), r(n[o], o);
+    o > 0 && o % Zt === 0 && (e.signal.throwIfAborted(), e.report({ phase: t, completed: o, total: i }), performance.now() - s >= Xt && (await e.yieldNow(), s = performance.now())), r(n[o], o);
   e.signal.throwIfAborted(), e.report({ phase: t, completed: i, total: i });
 }
-function Qt(e, t, n) {
+function en(e, t, n) {
   const r = n?.find((s) => s.name === e.name && s.kind === e.kind), i = {
     name: e.name,
     plainName: r?.plainName ?? e.name,
@@ -2144,7 +2147,7 @@ function Qt(e, t, n) {
   };
   return e.normalization === void 0 ? i : { ...i, normalization: e.normalization };
 }
-class qn extends D {
+class Yn extends D {
   /** What the last run published, kept so a caller holding the algorithm can read the result. */
   #e;
   /**
@@ -2195,7 +2198,7 @@ class qn extends D {
    * @returns A promise that settles when the result has been published.
    */
   async run() {
-    await this.computeRun(Xt(), this.type);
+    await this.computeRun(Qt(), this.type);
   }
   /**
    * Compute on behalf of a run, and hand the result back.
@@ -2230,11 +2233,11 @@ class qn extends D {
     const i = Date.now(), s = await this.compute(t);
     if (s === null)
       return;
-    const o = this.graph.getDataManager(), a = Wt(this.graph), u = Yt({
+    const o = this.graph.getDataManager(), a = Kt(this.graph), u = Wt({
       ...a === void 0 ? {} : { labelOf: a },
       runId: n,
       shape: s.shape,
-      fields: s.fields.map((c) => Qt(c, n, r)),
+      fields: s.fields.map((c) => en(c, n, r)),
       measured: { nodes: o.nodes.size, edges: o.edges.size },
       graph: s.graph,
       nodes: s.nodes,
@@ -2245,7 +2248,7 @@ class qn extends D {
     return this.#e = u, u;
   }
 }
-function Yn(e, t = "number") {
+function Wn(e, t = "number") {
   return [
     { name: "value", kind: e, type: t },
     { name: "rank", kind: e, type: "integer" },
@@ -2265,15 +2268,15 @@ const le = [
   { name: "groupCount", kind: "graph", type: "integer" },
   { name: "sizes", kind: "graph", type: "table" }
 ];
-function Wn(e) {
+function Kn(e) {
   return e ? [...le, { name: "modularity", kind: "graph", type: "number" }] : le;
 }
-const Kn = [
+const Zn = [
   { name: "level", kind: "node", type: "integer" },
   { name: "levelSize", kind: "node", type: "integer" },
   { name: "levelCount", kind: "graph", type: "integer" },
   { name: "sizes", kind: "graph", type: "table" }
-], Zn = [
+], Xn = [
   { name: "onPath", kind: "node", type: "boolean" },
   { name: "order", kind: "node", type: "integer" },
   { name: "onPath", kind: "edge", type: "boolean" },
@@ -2281,18 +2284,18 @@ const Kn = [
   { name: "cost", kind: "graph", type: "number" },
   { name: "hops", kind: "graph", type: "integer" }
 ];
-function Xn(e, t) {
+function Qn(e, t) {
   return [
     { name: "in", kind: e, type: "boolean" },
     { name: "count", kind: "graph", type: "integer" },
     { ...t, kind: "graph" }
   ];
 }
-const en = `${H}.${wt}`;
+const tn = `${H}.${wt}`;
 function O(e) {
-  return { ...e, path: `${en}.${e.name}` };
+  return { ...e, path: `${tn}.${e.name}` };
 }
-function Qn(e) {
+function er(e) {
   return [
     O({
       name: "value",
@@ -2337,28 +2340,28 @@ function Qn(e) {
     })
   ];
 }
-const tn = 12;
-function er(e, t = {}) {
-  return (nn(e) ? rn(e) : sn(e)).map((r) => {
-    const i = { ...r.meta, ...t.meta?.[r.name] }, s = r.node === null ? cn(r.name, i, r.failure ?? "the schema could not be converted") : an(r.name, r.node, i), o = t.overrides?.[r.name];
+const nn = 12;
+function tr(e, t = {}) {
+  return (rn(e) ? sn(e) : on(e)).map((r) => {
+    const i = { ...r.meta, ...t.meta?.[r.name] }, s = r.node === null ? un(r.name, i, r.failure ?? "the schema could not be converted") : cn(r.name, r.node, i), o = t.overrides?.[r.name];
     return o === void 0 ? s : { ...s, ...o };
   });
 }
-function nn(e) {
+function rn(e) {
   return typeof e != "object" || e === null ? !1 : "_zod" in e || "_def" in e;
 }
-function rn(e) {
+function sn(e) {
   const t = $e(e);
   if (t === null)
     return [];
   const { properties: n } = t;
   return n === void 0 ? [] : Object.entries(n).map(([r, i]) => ({ name: r, node: Re(i, t) }));
 }
-function sn(e) {
+function on(e) {
   const t = Object.entries(e), n = {};
   for (const [s, o] of t)
     n[s] = o.schema;
-  const r = on(n), i = r?.properties;
+  const r = an(n), i = r?.properties;
   return t.map(([s, o]) => {
     const a = i?.[s];
     return r === null || a === void 0 ? {
@@ -2376,7 +2379,7 @@ function $e(e) {
     return null;
   }
 }
-function on(e) {
+function an(e) {
   try {
     return $e(me.object(e));
   } catch {
@@ -2391,8 +2394,8 @@ function Re(e, t) {
   const r = n.slice(de.length).replaceAll("~1", "/").replaceAll("~0", "~");
   return t.$defs?.[r] ?? e;
 }
-function an(e, t, n) {
-  const r = Ee(t, 0), i = un(r), s = {
+function cn(e, t, n) {
+  const r = Ee(t, 0), i = ln(r), s = {
     name: e,
     plainName: n.label ?? K(e),
     technicalName: e,
@@ -2407,7 +2410,7 @@ function an(e, t, n) {
   const u = n.step ?? a?.multipleOf;
   return u !== void 0 && (s.step = u), i.values !== void 0 && (s.values = i.values), n.group !== void 0 && (s.group = n.group), n.advanced !== void 0 && (s.advanced = n.advanced), i.unsupportedReason !== void 0 && (s.unsupportedReason = i.unsupportedReason), s;
 }
-function cn(e, t, n) {
+function un(e, t, n) {
   const r = {
     name: e,
     plainName: t.label ?? K(e),
@@ -2418,7 +2421,7 @@ function cn(e, t, n) {
   return t.description !== void 0 && (r.description = t.description), t.step !== void 0 && (r.step = t.step), t.group !== void 0 && (r.group = t.group), t.advanced !== void 0 && (r.advanced = t.advanced), r;
 }
 function Ee(e, t) {
-  if (t >= tn)
+  if (t >= nn)
     return { arms: [], nullable: !1, unresolvedRef: !0 };
   if (e.$ref !== void 0)
     return { arms: [], nullable: !1, unresolvedRef: !0 };
@@ -2432,7 +2435,7 @@ function Ee(e, t) {
   }
   return r;
 }
-function un(e) {
+function ln(e) {
   if (e.arms.length === 0)
     return e.unresolvedRef ? {
       type: "unknown",
@@ -2441,18 +2444,18 @@ function un(e) {
       type: "unknown",
       unsupportedReason: e.nullable ? "the only value the schema accepts is null" : "the schema declares no value type"
     };
-  const t = dn(e.arms);
+  const t = pn(e.arms);
   if (t !== void 0)
     return { type: "enum", node: e.arms[0], values: t };
   if (e.arms.length === 1)
-    return ln(e.arms[0]);
+    return dn(e.arms[0]);
   const n = e.arms.map((r) => Fe(r));
   return n.length === 2 && n.includes("string") && n.includes("number") ? { type: "node-id" } : {
     type: "unknown",
     unsupportedReason: `the schema is a union of ${n.join(" and ")}, which has no single control`
   };
 }
-function ln(e) {
+function dn(e) {
   switch (Fe(e)) {
     case "integer":
       return { type: "integer", node: e };
@@ -2482,7 +2485,7 @@ function ln(e) {
       };
   }
 }
-function dn(e) {
+function pn(e) {
   const t = [];
   for (const r of e)
     if (r.enum !== void 0)
@@ -2515,59 +2518,61 @@ function K(e) {
   return t === "" ? e : t.split(/\s+/u).map((n) => n.charAt(0).toUpperCase() + n.slice(1)).join(" ");
 }
 export {
-  Hn as $,
+  vt as $,
   D as A,
-  Tn as B,
+  Mn as B,
   Le as C,
-  An as D,
-  kn as E,
-  vn as F,
-  Wt as G,
-  Yt as H,
-  Rn as I,
-  $n as J,
-  Fn as K,
-  Kn as L,
-  En as M,
-  ve as N,
+  $n as D,
+  Nn as E,
+  On as F,
+  Kt as G,
+  Wt as H,
+  En as I,
+  Rn as J,
+  In as K,
+  Zn as L,
+  Fn as M,
+  Oe as N,
   b as O,
-  Zn as P,
-  Bn as Q,
-  Dn as R,
-  Ln as S,
-  Cn as T,
+  Xn as P,
+  Vn as Q,
+  Gn as R,
+  Dn as S,
+  xn as T,
   B as U,
-  Nt as V,
-  Pn as W,
-  jn as X,
-  Zt as Y,
-  xn as Z,
-  Gn as _,
-  qn as a,
-  zn as a0,
-  Mn as b,
-  Un as c,
-  On as d,
-  Wn as e,
-  Vn as f,
-  _n as g,
-  Jn as h,
-  Yn as i,
-  In as j,
-  wn as k,
+  be as V,
+  St as W,
+  Ln as X,
+  Xt as Y,
+  Pn as Z,
+  jn as _,
+  Yn as a,
+  Un as a0,
+  Bn as a1,
+  Cn as a2,
+  _n as b,
+  Hn as c,
+  kn as d,
+  Kn as e,
+  Jn as f,
+  zn as g,
+  qn as h,
+  Wn as i,
+  Tn as j,
+  vn as k,
   He as l,
   O as m,
-  Qn as n,
-  er as o,
+  er as n,
+  tr as o,
   Pe as p,
-  Nn as q,
-  bn as r,
-  Xn as s,
+  Sn as q,
+  wn as r,
+  Qn as s,
   H as t,
   J as u,
   Ge as v,
   nt as w,
-  Sn as x,
+  An as x,
   yt as y,
   T as z
 };