@graphty/graphty-element 2.3.1 → 2.4.0

package/dist/chunks/{optionsFromZod-17lkrAJs.js → optionsFromZod-BuTOFgVM.js}

@@ -1,6 +1,6 @@
-import { q as he, b as Ie } from "./GraphtyLogger-5KEttFUo.js";
-import { K as Me, f as Te } from "./types-B7bX5c0K.js";
-import { G as y } from "./GraphtyError-BwcnblTH.js";
+import { q as he, b as Ie } from "./GraphtyLogger-CqOVV13Y.js";
+import { K as Te, f as Me } from "./types-C_c53VgR.js";
+import { G as y } from "./GraphtyError-B93WRH3e.js";
 import { Graph as _e, accelerated as X } from "@graphty/algorithms";
 import { INVALID_INDEX as L } from "@graphty/graph-format";
 import { z as me } from "zod/v4";
@@ -9,7 +9,7 @@ const _ = he({
   idOf: (e) => e.descriptor.id,
   descriptorOf: (e) => e.descriptor,
   implementationOf: (e) => e.compute,
-  builtInIds: () => Me
+  builtInIds: () => Te
 });
 function yn(e, t) {
   const n = e.descriptor;
@@ -52,7 +52,7 @@ function wn(e) {
 function vn() {
   _.clearForTesting();
 }
-const ze = ["forceAtlas2", "fruchtermanReingold", "springElectrical", "release"], xe = [
+const ze = ["forceAtlas2", "fruchtermanReingold", "springElectrical", "release"], Ce = [
   "pageRank",
   "sssp",
   "breadthFirstSearch",
@@ -70,11 +70,11 @@ function On(e) {
   }
   return t;
 }
-function Ce(e) {
+function xe(e) {
   const t = {
     kind: e.backend
   };
-  for (const n of xe) {
+  for (const n of Ce) {
     const r = e[n];
     typeof r == "function" && (t[n] = r.bind(e));
   }
@@ -84,12 +84,17 @@ const je = ["auto", "off", "required"], kn = "auto";
 function Nn(e) {
   return typeof e == "string" && je.includes(e);
 }
-const Pe = "f64", Sn = "f32", An = "acceleration.minNodes", $n = 0, z = he({
+const Pe = "f64", Sn = "f32", An = "acceleration.minNodes", $n = 0, Rn = "RTX 4070 SUPER, headless Chromium, 2026-09-25", En = Object.freeze({
+  breadthFirstSearch: 3e5,
+  sssp: 3e5,
+  pageRank: 5e3,
+  connectedComponents: 5e4
+}), z = he({
   kind: "algorithm",
   idOf: (e) => e.descriptor.key,
   descriptorOf: (e) => e.descriptor,
   implementationOf: (e) => e.descriptor,
-  builtInIds: () => Te
+  builtInIds: () => Me
 });
 function Le(e, t) {
   if (e.descriptor.key !== e.type)
@@ -107,13 +112,13 @@ function Le(e, t) {
     });
   z.register(e, t);
 }
-function Rn() {
+function Fn() {
   return z.descriptors();
 }
-function Fn(e) {
+function In(e) {
   return z.byId(e);
 }
-function En() {
+function Tn() {
   z.clearForTesting();
 }
 class b extends Error {
@@ -180,7 +185,7 @@ function Ge(e, t, n) {
     throw new b(e, `must be one of [${i}], got '${String(t)}'`);
   }
 }
-function He(e, t) {
+function Ue(e, t) {
   const n = {};
   for (const [r, i] of Object.entries(e)) {
     const o = t?.[r] ?? i.default;
@@ -188,14 +193,14 @@ function He(e, t) {
   }
   return n;
 }
-function In(e) {
+function Mn(e) {
   return e;
 }
-function Ue(e, t) {
+function He(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 Be(i, t);
 }
-function Mn(e) {
+function _n(e) {
   const t = e.getSnapshot();
   return t.flags.multigraph ? t.edgeCount - t.simplified({ weights: "sum" }).snapshot.edgeCount : 0;
 }
@@ -212,7 +217,7 @@ function Be(e, t) {
   }
   return n;
 }
-const F = /* @__PURE__ */ new Map();
+const E = /* @__PURE__ */ new Map();
 function Ve(e, t) {
   if (t === null)
     return e;
@@ -255,7 +260,7 @@ const Z = class Z {
    * @returns a freshly built Graph for the algorithm package
    */
   algorithmGraph(t) {
-    return Ue(this.graph.getDataManager(), t);
+    return He(this.graph.getDataManager(), t);
   }
   /**
    * The route an algorithm with an accelerated implementation takes.
@@ -291,7 +296,7 @@ const Z = class Z {
       run: async (p) => {
         const l = await c.run(
           h,
-          (d) => p(X(Ce(d)), u)
+          (d) => p(X(xe(d)), u)
         );
         return l.accelerated ? { value: l.value, precision: l.precision } : { value: await p(X(null), u), precision: Pe };
       }
@@ -328,7 +333,7 @@ const Z = class Z {
    */
   resolveOptions(t) {
     const n = this.constructor.optionsSchema;
-    return Object.keys(n).length === 0 ? {} : He(n, t);
+    return Object.keys(n).length === 0 ? {} : Ue(n, t);
   }
   /**
    * Gets the algorithm type
@@ -388,7 +393,7 @@ const Z = class Z {
       type: r,
       ...o === void 0 ? {} : { cost: o },
       ...a === void 0 ? {} : { version: a }
-    }), F.set(`${i}:${r}`, t), t;
+    }), E.set(`${i}:${r}`, t), t;
   }
   /**
    * Gets an algorithm instance from the registry
@@ -399,7 +404,7 @@ const Z = class Z {
    * @returns A new instance of the algorithm, or null if not found
    */
   static get(t, n, r, i) {
-    const s = F.get(`${n}:${r}`);
+    const s = E.get(`${n}:${r}`);
     return s ? new s(t, i) : null;
   }
   /**
@@ -409,7 +414,7 @@ const Z = class Z {
    * @returns The algorithm class, or null if not found
    */
   static getClass(t, n) {
-    return F.get(`${t}:${n}`) ?? null;
+    return E.get(`${t}:${n}`) ?? null;
   }
   /**
    * Get the options schema for this algorithm
@@ -448,7 +453,7 @@ const Z = class Z {
    */
   static getRegisteredAlgorithms(t) {
     const n = [];
-    for (const r of F.keys())
+    for (const r of E.keys())
       (!t || r.startsWith(`${t}:`)) && n.push(r);
     return n.sort();
   }
@@ -478,7 +483,7 @@ function Je(e, t, n) {
   const r = e.fields.find((i) => i.name === t);
   return r === void 0 ? t : n === "technical" ? r.technicalName : r.plainName.toLowerCase();
 }
-function x(e, t, n) {
+function C(e, t, n) {
   const r = e.fields.find((i) => i.name === t)?.unit;
   return r === void 0 ? "" : n === 1 && r.endsWith("s") ? ` ${r.slice(0, -1)}` : ` ${r}`;
 }
@@ -486,19 +491,19 @@ function R(e, t) {
   const n = e.graph[t];
   return typeof n == "number" && Number.isFinite(n) ? n : void 0;
 }
-function We(e) {
+function Ye(e) {
   return e[0];
 }
-function Ye(e, t, n) {
-  const { locale: r, audience: i } = n, s = Je(e, "value", i), o = We(t.top);
+function We(e, t, n) {
+  const { locale: r, audience: i } = n, s = Je(e, "value", i), o = Ye(t.top);
   if (o === void 0 || t.median === null)
     return `Nothing was measured, so there is no ${s} to report.`;
   const a = [
-    `${o.label} has the highest ${s}, at ${m(o.value, r)}${x(e, "value", o.value)}.`,
-    `The typical element sits at ${m(t.median, r)}${x(e, "value", t.median)}.`
+    `${o.label} has the highest ${s}, at ${m(o.value, r)}${C(e, "value", o.value)}.`,
+    `The typical element sits at ${m(t.median, r)}${C(e, "value", t.median)}.`
   ];
   return t.measured > 0 && t.tiedAtMin / t.measured >= qe && t.min !== null && a.push(
-    `${m(t.tiedAtMin, r)} of ${m(t.measured, r)} sit at the lowest value, ${m(t.min, r)}${x(e, "value", t.min)}.`
+    `${m(t.tiedAtMin, r)} of ${m(t.measured, r)} sit at the lowest value, ${m(t.min, r)}${C(e, "value", t.min)}.`
   ), t.count > t.measured && a.push(`${m(t.count - t.measured, r)} were not measured.`), a.join(" ");
 }
 function Ke(e, t, n) {
@@ -538,7 +543,7 @@ function tt(e, t) {
   switch (r) {
     case "node-metric":
     case "edge-metric":
-      return Ye(e, n, t);
+      return We(e, n, t);
     case "community":
     case "layered-grouping":
     case "category-table":
@@ -558,7 +563,7 @@ function tt(e, t) {
       return te(n, t);
   }
 }
-function Tn(e, t) {
+function zn(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,
@@ -610,7 +615,7 @@ function fe(e) {
 function ge(e) {
   return /[A-Za-z0-9_]/.test(e);
 }
-function C(e, t, n) {
+function x(e, t, n) {
   for (let r = t + 1; r < e.length; r++) {
     if (e[r] === "\\") {
       r++;
@@ -683,17 +688,17 @@ function ct(e) {
       continue;
     }
     if (r === "`") {
-      const o = C(e, n, "`");
+      const o = x(e, n, "`");
       t.push({ kind: "literal", text: "", value: ot(e, n, e.slice(n + 1, o)), at: n }), n = o + 1;
       continue;
     }
     if (r === "'") {
-      const o = C(e, n, "'");
+      const o = x(e, n, "'");
       t.push({ kind: "literal", text: "", value: st(e.slice(n + 1, o)), at: n }), n = o + 1;
       continue;
     }
     if (r === '"') {
-      const o = C(e, n, '"');
+      const o = x(e, n, '"');
       t.push({ kind: "identifier", text: at(e, n, e.slice(n, o + 1)), at: n }), n = o + 1;
       continue;
     }
@@ -774,12 +779,12 @@ function dt(e) {
     t.at
   );
 }
-function H(e) {
+function U(e) {
   if (!S(e, "!"))
     return dt(e);
   const t = N(e);
   e.index++;
-  const n = H(e);
+  const n = U(e);
   if (n.kind === "path" && n.path.includes("."))
     throw f(
       `In JMESPath \`!\` binds tighter than \`.\`, so !${n.path} means (!${n.path.split(".")[0]})${n.path.slice(n.path.indexOf("."))} rather than the opposite of ${n.path}. Write !(${n.path}) for that`,
@@ -790,8 +795,8 @@ function H(e) {
   return { kind: "not", operand: n };
 }
 function re(e) {
-  const t = H(e), n = N(e), r = n.kind === "operator" ? ut[n.text] : void 0;
-  return r === void 0 ? t : (e.index++, { kind: "compare", operator: r, left: t, right: H(e) });
+  const t = U(e), n = N(e), r = n.kind === "operator" ? ut[n.text] : void 0;
+  return r === void 0 ? t : (e.index++, { kind: "compare", operator: r, left: t, right: U(e) });
 }
 function ie(e) {
   let t = re(e);
@@ -935,11 +940,11 @@ function yt(e) {
       return !1;
   return !0;
 }
-function _n(e, t) {
+function Cn(e, t) {
   const { has: n } = e;
   return (r) => n(r, t);
 }
-function zn(e, t) {
+function xn(e, t) {
   const { idOf: n } = e;
   if (n === null)
     throw new y({
@@ -950,7 +955,7 @@ function zn(e, t) {
     });
   return (r) => t.has(n(r));
 }
-function xn(e, t, n) {
+function jn(e, t, n) {
   const { value: r } = e;
   return (i) => {
     const s = n();
@@ -960,7 +965,7 @@ function xn(e, t, n) {
     return typeof o == "number" && Number.isFinite(o) && o >= s;
   };
 }
-function Cn(e, t) {
+function Pn(e, t) {
   const n = pt(e), r = [];
   if ($(n, r), r.length === 0) {
     let i = n;
@@ -976,9 +981,9 @@ function Cn(e, t) {
   }
   return { paths: Object.freeze(r), test: A(n, t) };
 }
-const U = "results", bt = "$";
-function M(e, t) {
-  return t === void 0 ? `${U}.${e}` : `${U}.${e}.${t}`;
+const H = "results", bt = "$";
+function T(e, t) {
+  return t === void 0 ? `${H}.${e}` : `${H}.${e}.${t}`;
 }
 const be = {
   // -- per element ---------------------------------------------------------------------
@@ -1148,7 +1153,7 @@ const be = {
     scope: "graph",
     types: ["number"]
   }
-}, jn = Object.keys(be), q = {
+}, Ln = Object.keys(be), q = {
   "node-metric": {
     shape: "node-metric",
     primaryField: "value",
@@ -1268,10 +1273,10 @@ const be = {
 function B(e) {
   return q[e];
 }
-function Pn(e) {
+function Dn(e) {
   return q[e].layer === "highlight";
 }
-function Ln(e, t) {
+function Gn(e, t) {
   const n = q[e], r = [], i = [
     { names: n.nodeFields, kind: "node" },
     { names: n.edgeFields, kind: "edge" },
@@ -1361,9 +1366,9 @@ class At {
   path(t, n) {
     const r = se(t);
     if (n !== void 0)
-      return M(r, n);
+      return T(r, n);
     const i = Nt(t) ?? this.#e.entry(r)?.shape, s = i === void 0 ? null : B(i).primaryField;
-    return s === null ? M(r) : M(r, s);
+    return s === null ? T(r) : T(r, s);
   }
   /**
    * The same field, written so a selector expression can read it.
@@ -1413,14 +1418,14 @@ class At {
     return Object.freeze(t);
   }
 }
-function Dn(e) {
+function Un(e) {
   return new At(e);
 }
-const $t = 20, j = 100, Rt = 100, Ft = Object.freeze([]), Et = Object.freeze(["max", "min-max", "none"]);
+const $t = 20, j = 100, Rt = 100, Et = Object.freeze([]), Ft = Object.freeze(["max", "min-max", "none"]);
 function we(e) {
-  return typeof e == "string" && Et.includes(e);
+  return typeof e == "string" && Ft.includes(e);
 }
-function Gn(e) {
+function Hn(e) {
   return {
     length: e.length,
     get: (t) => e[t]
@@ -1495,7 +1500,7 @@ function J(e) {
   }
   return Object.freeze(r);
 }
-function Mt(e, t) {
+function Tt(e, t) {
   let n = Math.min(t, e.length);
   for (; n > 0 && n < e.length && e[n].rank === e[n - 1].rank; )
     n--;
@@ -1512,7 +1517,7 @@ function Mt(e, t) {
     reason: o
   });
 }
-function Tt(e) {
+function Mt(e) {
   const { smallestPositive: t } = e;
   if (e.measured === 0 || !(e.max > 0) || t === null)
     return !1;
@@ -1520,7 +1525,7 @@ function Tt(e) {
   return Math.log10(e.max) > Math.log10(n);
 }
 function _t(e) {
-  return e.measured === 0 || !(e.median > 0) || e.max / e.median <= Rt ? "linear" : Tt(e) ? "log" : "linear";
+  return e.measured === 0 || !(e.median > 0) || e.max / e.median <= Rt ? "linear" : Mt(e) ? "log" : "linear";
 }
 function zt(e, t, n, r) {
   if (!(t > e))
@@ -1546,7 +1551,7 @@ function zt(e, t, n, r) {
     ]
   };
 }
-function xt(e, t, n, r, i) {
+function Ct(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;
@@ -1576,7 +1581,7 @@ function xt(e, t, n, r, i) {
     }
   };
 }
-function Ct(e) {
+function xt(e) {
   if (e === void 0)
     return $t;
   if (!Number.isInteger(e) || e < 1 || e > j)
@@ -1606,11 +1611,11 @@ function jt(e, t) {
   return n;
 }
 function Pt(e, t) {
-  const n = Ct(t?.bins), r = t?.integerValued ?? !1, i = ve(e), s = _t(i), o = jt(e, n);
+  const n = xt(t?.bins), r = t?.integerValued ?? !1, i = ve(e), s = _t(i), o = jt(e, n);
   if (o !== null) {
     if (o.size === 0)
       return Object.freeze({
-        bins: Ft,
+        bins: Et,
         // 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.
@@ -1629,7 +1634,7 @@ function Pt(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 ?? zt(i.min, i.max, n, r), h = new Array(c.binCount).fill(0);
+  const u = t?.scale === "log" || t?.scale === "auto" && s === "log" ? Ct(i.min, i.max, i.smallestPositive, n, r) : null, c = u ?? zt(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);
@@ -1670,13 +1675,13 @@ function V(e, t) {
     get: (r) => ke(n[r][t])
   };
 }
-function W(e, t) {
+function Y(e, t) {
   return e.ids.map((n, r) => ({ id: n, value: ke(e.records[r][t]) }));
 }
 function ke(e) {
   return typeof e == "number" ? e : Number.NaN;
 }
-function Y(e) {
+function W(e) {
   return typeof e == "string" || typeof e == "number";
 }
 function P(e) {
@@ -1685,14 +1690,14 @@ function P(e) {
 function g(e, t, n) {
   e[t] === void 0 && (e[t] = n);
 }
-function T(e, t, n) {
+function M(e, t, n) {
   e[t] === void 0 && (e[t] = n);
 }
 function Ne(e, t) {
   const n = /* @__PURE__ */ new Map();
   for (const r of e.records) {
     const i = r[t];
-    Y(i) && n.set(i, (n.get(i) ?? 0) + 1);
+    W(i) && n.set(i, (n.get(i) ?? 0) + 1);
   }
   return n;
 }
@@ -1710,9 +1715,9 @@ function Ae(e, t) {
 }
 function ae(e, t, n) {
   const { statistics: r } = Oe(V(e, "value"));
-  for (const i of J(W(e, "value"))) {
+  for (const i of J(Y(e, "value"))) {
     const s = e.index.get(i.id);
-    s !== void 0 && (T(e.records[s], "rank", i.rank), T(e.records[s], "percentile", i.percentile));
+    s !== void 0 && (M(e.records[s], "rank", i.rank), M(e.records[s], "percentile", i.percentile));
   }
   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"));
 }
@@ -1720,14 +1725,14 @@ function ce(e, t, n, r, i) {
   const s = Ne(e, n);
   for (const o of e.records) {
     const a = o[n];
-    Y(a) && T(o, r, s.get(a));
+    W(a) && M(o, r, s.get(a));
   }
   g(t, i, s.size), g(t, "sizes", Gt(s));
 }
-function Ht(e, t) {
-  for (const r of J(W(e, "score"))) {
+function Ut(e, t) {
+  for (const r of J(Y(e, "score"))) {
     const i = e.index.get(r.id);
-    i !== void 0 && T(e.records[i], "rank", r.rank);
+    i !== void 0 && M(e.records[i], "rank", r.rank);
   }
   const n = [...Ne(e, "category").entries()].map(([r, i]) => ({
     category: String(r),
@@ -1735,7 +1740,7 @@ function Ht(e, t) {
   }));
   n.sort((r, i) => i.count - r.count || Se(r.category, i.category)), g(t, "categories", Object.freeze(n.map((r) => Object.freeze(r))));
 }
-function E(e, t) {
+function F(e, t) {
   let n = 0;
   for (const r of e.records)
     r[t] === !0 && n++;
@@ -1747,7 +1752,7 @@ function ue(e, t) {
     r[t] !== void 0 && n++;
   return n;
 }
-function Ut(e, t, n, r, i) {
+function Ht(e, t, n, r, i) {
   switch (e) {
     case "node-metric":
       ae(t, r, i);
@@ -1762,16 +1767,16 @@ function Ut(e, t, n, r, i) {
       ce(t, r, "level", "levelSize", "levelCount");
       break;
     case "category-table":
-      Ht(t, r);
+      Ut(t, r);
       break;
     case "path":
-      g(r, "length", E(t, "onPath")), g(r, "hops", E(n, "onPath"));
+      g(r, "length", F(t, "onPath")), g(r, "hops", F(n, "onPath"));
       break;
     case "node-set":
-      g(r, "count", E(t, "in"));
+      g(r, "count", F(t, "in"));
       break;
     case "edge-set":
-      g(r, "count", E(n, "in"));
+      g(r, "count", F(n, "in"));
       break;
   }
 }
@@ -1796,7 +1801,7 @@ function Vt(e, t) {
     if (typeof r != "object" || r === null)
       continue;
     const i = r, s = i.group ?? i.category, o = i.size ?? i.count;
-    if (Y(s) && typeof o == "number" && n.push(Object.freeze({ group: s, size: o })), n.length === t)
+    if (W(s) && typeof o == "number" && n.push(Object.freeze({ group: s, size: o })), n.length === t)
       break;
   }
   return Object.freeze(n);
@@ -1887,7 +1892,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 = Tt(this.ranking(t), this.#l(n, "n"));
     return this.#c.set(r, s), s;
   }
   /**
@@ -2020,7 +2025,7 @@ class qt {
    * @throws A GraphtyError naming what went wrong.
    */
   #f(t) {
-    const n = J(W(this.#p(t), t));
+    const n = J(Y(this.#p(t), t));
     return this.#a.set(t, n), n;
   }
   /**
@@ -2087,14 +2092,14 @@ class qt {
 }
 function Jt(e) {
   const t = oe(e.nodes), n = oe(e.edges), r = { ...e.graph };
-  Ut(e.shape, t, n, r, e.fields);
+  Ht(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));
 }
-function Wt(e) {
+function Yt(e) {
   const t = e.styles?.config.data.knownFields.nodeLabelPath ?? null;
   if (t === null)
     return;
@@ -2104,10 +2109,10 @@ function Wt(e) {
     return typeof i == "string" || typeof i == "number" ? String(i) : void 0;
   };
 }
-function Hn(e) {
+function Bn(e) {
   return { exact: !0, precision: "f64", notes: [], ...e };
 }
-const Yt = 1024, Kt = 16;
+const Wt = 1024, Kt = 16;
 function Zt() {
   return {
     signal: new AbortController().signal,
@@ -2118,12 +2123,12 @@ function Zt() {
     })
   };
 }
-async function Un(e, t, n, r) {
+async function Vn(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 % Yt === 0 && (e.signal.throwIfAborted(), e.report({ phase: t, completed: o, total: i }), performance.now() - s >= Kt && (await e.yieldNow(), s = performance.now())), r(n[o], o);
+    o > 0 && o % Wt === 0 && (e.signal.throwIfAborted(), e.report({ phase: t, completed: o, total: i }), performance.now() - s >= Kt && (await e.yieldNow(), s = performance.now())), r(n[o], o);
   e.signal.throwIfAborted(), e.report({ phase: t, completed: i, total: i });
 }
 function Xt(e, t, n) {
@@ -2133,12 +2138,12 @@ function Xt(e, t, n) {
     technicalName: r?.technicalName ?? e.name,
     kind: e.kind,
     type: e.type,
-    path: M(t, e.name),
+    path: T(t, e.name),
     ...r?.unit === void 0 ? {} : { unit: r.unit }
   };
   return e.normalization === void 0 ? i : { ...i, normalization: e.normalization };
 }
-class Bn extends D {
+class qn extends D {
   /** What the last run published, kept so a caller holding the algorithm can read the result. */
   #e;
   /**
@@ -2224,7 +2229,7 @@ class Bn 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 = Jt({
+    const o = this.graph.getDataManager(), a = Yt(this.graph), u = Jt({
       ...a === void 0 ? {} : { labelOf: a },
       runId: n,
       shape: s.shape,
@@ -2239,7 +2244,7 @@ class Bn extends D {
     return this.#e = u, u;
   }
 }
-function Vn(e, t = "number") {
+function Jn(e, t = "number") {
   return [
     { name: "value", kind: e, type: t },
     { name: "rank", kind: e, type: "integer" },
@@ -2259,15 +2264,15 @@ const le = [
   { name: "groupCount", kind: "graph", type: "integer" },
   { name: "sizes", kind: "graph", type: "table" }
 ];
-function qn(e) {
+function Yn(e) {
   return e ? [...le, { name: "modularity", kind: "graph", type: "number" }] : le;
 }
-const Jn = [
+const Wn = [
   { name: "level", kind: "node", type: "integer" },
   { name: "levelSize", kind: "node", type: "integer" },
   { name: "levelCount", kind: "graph", type: "integer" },
   { name: "sizes", kind: "graph", type: "table" }
-], Wn = [
+], Kn = [
   { name: "onPath", kind: "node", type: "boolean" },
   { name: "order", kind: "node", type: "integer" },
   { name: "onPath", kind: "edge", type: "boolean" },
@@ -2275,18 +2280,18 @@ const Jn = [
   { name: "cost", kind: "graph", type: "number" },
   { name: "hops", kind: "graph", type: "integer" }
 ];
-function Yn(e, t) {
+function Zn(e, t) {
   return [
     { name: "in", kind: e, type: "boolean" },
     { name: "count", kind: "graph", type: "integer" },
     { ...t, kind: "graph" }
   ];
 }
-const Qt = `${U}.${bt}`;
+const Qt = `${H}.${bt}`;
 function O(e) {
   return { ...e, path: `${Qt}.${e.name}` };
 }
-function Kn(e) {
+function Xn(e) {
   return [
     O({
       name: "value",
@@ -2332,7 +2337,7 @@ function Kn(e) {
   ];
 }
 const en = 12;
-function Zn(e, t = {}) {
+function Qn(e, t = {}) {
   return (tn(e) ? nn(e) : rn(e)).map((r) => {
     const i = { ...r.meta, ...t.meta?.[r.name] }, s = r.node === null ? an(r.name, i, r.failure ?? "the schema could not be converted") : on(r.name, r.node, i), o = t.overrides?.[r.name];
     return o === void 0 ? s : { ...s, ...o };
@@ -2386,7 +2391,7 @@ function Re(e, t) {
   return t.$defs?.[r] ?? e;
 }
 function on(e, t, n) {
-  const r = Fe(t, 0), i = cn(r), s = {
+  const r = Ee(t, 0), i = cn(r), s = {
     name: e,
     plainName: n.label ?? K(e),
     technicalName: e,
@@ -2411,7 +2416,7 @@ function an(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 Fe(e, t) {
+function Ee(e, t) {
   if (t >= en)
     return { arms: [], nullable: !1, unresolvedRef: !0 };
   if (e.$ref !== void 0)
@@ -2421,7 +2426,7 @@ function Fe(e, t) {
     return e.type === "null" ? { arms: [], nullable: !0, unresolvedRef: !1 } : { arms: [e], nullable: !1, unresolvedRef: !1 };
   const r = { arms: [], nullable: !1, unresolvedRef: !1 };
   for (const i of n) {
-    const s = Fe(i, t + 1);
+    const s = Ee(i, t + 1);
     r.arms.push(...s.arms), r.nullable = r.nullable || s.nullable, r.unresolvedRef = r.unresolvedRef || s.unresolvedRef;
   }
   return r;
@@ -2440,14 +2445,14 @@ function cn(e) {
     return { type: "enum", node: e.arms[0], values: t };
   if (e.arms.length === 1)
     return un(e.arms[0]);
-  const n = e.arms.map((r) => Ee(r));
+  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 un(e) {
-  switch (Ee(e)) {
+  switch (Fe(e)) {
     case "integer":
       return { type: "integer", node: e };
     case "number":
@@ -2496,7 +2501,7 @@ function ln(e) {
   }
   return n;
 }
-function Ee(e) {
+function Fe(e) {
   const { type: t } = e;
   return typeof t == "string" ? t : Array.isArray(t) && t.length > 0 ? t[0] : "none";
 }
@@ -2509,57 +2514,59 @@ function K(e) {
   return t === "" ? e : t.split(/\s+/u).map((n) => n.charAt(0).toUpperCase() + n.slice(1)).join(" ");
 }
 export {
+  Un as $,
   D as A,
-  Fn as B,
+  In as B,
   Pe as C,
   Sn as D,
   On as E,
   wn as F,
-  Wt as G,
+  Yt as G,
   Jt as H,
   $n as I,
   An as J,
-  ve as K,
-  Jn as L,
-  Gn as M,
-  Cn as N,
+  En as K,
+  Wn as L,
+  Rn as M,
+  ve as N,
   b as O,
-  Wn as P,
-  Tn as Q,
-  jn as R,
-  B as S,
-  kt as T,
-  xn as U,
-  zn as V,
-  _n as W,
-  Pn as X,
+  Kn as P,
+  Hn as Q,
+  Ln as R,
+  Pn as S,
+  zn as T,
+  B as U,
+  kt as V,
+  jn as W,
+  xn as X,
   Kt as Y,
-  Dn as Z,
-  Mn as _,
-  Bn as a,
-  En as b,
-  Ln as c,
+  Cn as Z,
+  Dn as _,
+  qn as a,
+  _n as a0,
+  Tn as b,
+  Gn as c,
   vn as d,
-  qn as e,
-  Hn as f,
-  In as g,
-  Un as h,
-  Vn as i,
-  Rn as j,
+  Yn as e,
+  Bn as f,
+  Mn as g,
+  Vn as h,
+  Jn as i,
+  Fn as j,
   bn as k,
-  He as l,
+  Ue as l,
   O as m,
-  Kn as n,
-  Zn as o,
+  Xn as n,
+  Qn as o,
   je as p,
   kn as q,
   yn as r,
-  Yn as s,
-  U as t,
+  Zn as s,
+  H as t,
   q as u,
   De as v,
   tt as w,
   Nn as x,
   gt as y,
-  M as z
+  T as z
 };