@graphty/graphty-element 2.3.1 → 2.4.1

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

@@ -1,7 +1,7 @@
-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 { Graph as _e, accelerated as X } from "@graphty/algorithms";
+import { c as he, G as y, S as Ie } from "./pluginRegistry-MaTIDh6l.js";
+import { K as Te, f as Me } from "./types-C_c53VgR.js";
+import { b as _e } from "./GraphtyLogger-kbOx2zq3.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";
 const _ = he({
@@ -9,9 +9,9 @@ const _ = he({
   idOf: (e) => e.descriptor.id,
   descriptorOf: (e) => e.descriptor,
   implementationOf: (e) => e.compute,
-  builtInIds: () => Me
+  builtInIds: () => Te
 });
-function yn(e, t) {
+function bn(e, t) {
   const n = e.descriptor;
   if (n === void 0 || typeof n != "object")
     throw new y({
@@ -43,16 +43,16 @@ function yn(e, t) {
     });
   _.register(e, t);
 }
-function bn() {
+function wn() {
   return _.descriptors();
 }
-function wn(e) {
+function vn(e) {
   return _.byId(e);
 }
-function vn() {
+function On() {
   _.clearForTesting();
 }
-const ze = ["forceAtlas2", "fruchtermanReingold", "springElectrical", "release"], xe = [
+const Ce = ["forceAtlas2", "fruchtermanReingold", "springElectrical", "release"], xe = [
   "pageRank",
   "sssp",
   "breadthFirstSearch",
@@ -60,17 +60,17 @@ const ze = ["forceAtlas2", "fruchtermanReingold", "springElectrical", "release"]
   "weaklyConnectedComponents",
   "minimumSpanningTree"
 ];
-function On(e) {
+function kn(e) {
   const t = {
     kind: e.backend
   };
-  for (const n of ze) {
+  for (const n of Ce) {
     const r = e[n];
     typeof r == "function" && (t[n] = r.bind(e));
   }
   return t;
 }
-function Ce(e) {
+function je(e) {
   const t = {
     kind: e.backend
   };
@@ -80,18 +80,23 @@ function Ce(e) {
   }
   return t;
 }
-const je = ["auto", "off", "required"], kn = "auto";
-function Nn(e) {
-  return typeof e == "string" && je.includes(e);
+const Pe = ["auto", "off", "required"], Nn = "auto";
+function Sn(e) {
+  return typeof e == "string" && Pe.includes(e);
 }
-const Pe = "f64", Sn = "f32", An = "acceleration.minNodes", $n = 0, z = he({
+const Le = "f64", An = "f32", $n = "acceleration.minNodes", Rn = 0, En = "RTX 4070 SUPER, headless Chromium, 2026-09-25", Fn = 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) {
+function De(e, t) {
   if (e.descriptor.key !== e.type)
     throw new y({
       code: "E_BAD_COMMAND",
@@ -107,13 +112,13 @@ function Le(e, t) {
     });
   z.register(e, t);
 }
-function Rn() {
+function In() {
   return z.descriptors();
 }
-function Fn(e) {
+function Tn(e) {
   return z.byId(e);
 }
-function En() {
+function Mn() {
   z.clearForTesting();
 }
 class b extends Error {
@@ -126,7 +131,7 @@ class b extends Error {
     super(`Option '${t}': ${n}`), this.optionKey = t, this.name = "OptionValidationError";
   }
 }
-function De(e, t, n) {
+function Ge(e, t, n) {
   if (t == null) {
     if (n.required)
       throw new b(e, "is required but was not provided");
@@ -148,7 +153,7 @@ function De(e, t, n) {
         throw new b(e, `must be a string, got ${typeof t}`);
       break;
     case "select":
-      Ge(e, t, n);
+      Ue(e, t, n);
       break;
     case "nodeId":
       if (typeof t != "string" && typeof t != "number")
@@ -172,7 +177,7 @@ function Q(e, t, n, r) {
   if (n.max !== void 0 && t > n.max)
     throw new b(e, `must be <= ${n.max}, got ${t}`);
 }
-function Ge(e, t, n) {
+function Ue(e, t, n) {
   if (!n.options || n.options.length === 0)
     throw new b(e, "is a select type but has no options defined");
   if (!n.options.map((i) => i.value).includes(t)) {
@@ -184,23 +189,23 @@ function He(e, t) {
   const n = {};
   for (const [r, i] of Object.entries(e)) {
     const o = t?.[r] ?? i.default;
-    De(r, o, i), n[r] = o;
+    Ge(r, o, i), n[r] = o;
   }
   return n;
 }
-function In(e) {
+function _n(e) {
   return e;
 }
-function Ue(e, t) {
+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 Be(i, t);
+  return Ve(i, t);
 }
-function Mn(e) {
+function zn(e) {
   const t = e.getSnapshot();
   return t.flags.multigraph ? t.edgeCount - t.simplified({ weights: "sum" }).snapshot.edgeCount : 0;
 }
-function Be(e, t) {
-  const n = new _e({
+function Ve(e, t) {
+  const n = new ze({
     directed: t !== "undirected"
   }), { ids: r } = e;
   for (let a = 0; a < e.nodeCount; a++)
@@ -212,8 +217,8 @@ function Be(e, t) {
   }
   return n;
 }
-const F = /* @__PURE__ */ new Map();
-function Ve(e, t) {
+const E = new Ie("algorithm");
+function Je(e, t) {
   if (t === null)
     return e;
   if (e === null)
@@ -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 Be(this.graph.getDataManager(), t);
   }
   /**
    * The route an algorithm with an accelerated implementation takes.
@@ -287,13 +292,13 @@ const Z = class Z {
     const r = this.graph.getDataManager(), i = r.getSnapshot(), s = n === "undirected" ? r.undirected(i) : null, o = s === null ? i : s.snapshot, a = o.flags.multigraph ? o.simplified({ weights: "sum" }) : null, u = a === null ? o : a.snapshot, c = this.graph.acceleration, h = { capability: t, nodeCount: u.nodeCount };
     return {
       snapshot: u,
-      edgeRemap: Ve(s?.edgeRemap ?? null, a?.edgeRemap ?? null),
+      edgeRemap: Je(s?.edgeRemap ?? null, a?.edgeRemap ?? null),
       run: async (p) => {
         const l = await c.run(
           h,
-          (d) => p(X(Ce(d)), u)
+          (d) => p(X(je(d)), u)
         );
-        return l.accelerated ? { value: l.value, precision: l.precision } : { value: await p(X(null), u), precision: Pe };
+        return l.accelerated ? { value: l.value, precision: l.precision } : { value: await p(X(null), u), precision: Le };
       }
     };
   }
@@ -381,14 +386,15 @@ const Z = class Z {
    * @returns The registered algorithm class
    */
   static register(t) {
-    const n = t, r = String(n.type), i = String(n.namespace), { descriptor: s, cost: o, version: a } = n;
-    return s !== void 0 && Le({
+    const n = t, r = String(n.type), i = String(n.namespace), { descriptor: s, cost: o, costUnits: a, version: u } = n;
+    return s !== void 0 && De({
       descriptor: s,
       namespace: i,
       type: r,
       ...o === void 0 ? {} : { cost: o },
-      ...a === void 0 ? {} : { version: a }
-    }), F.set(`${i}:${r}`, t), t;
+      ...a === void 0 ? {} : { costUnits: a },
+      ...u === void 0 ? {} : { version: u }
+    }), E.set(`${i}:${r}`, t), t;
   }
   /**
    * Gets an algorithm instance from the registry
@@ -399,7 +405,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 +415,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 +454,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();
   }
@@ -474,11 +480,11 @@ const ee = 3, qe = 0.1;
 function m(e, t) {
   return Number.isInteger(e) ? e.toLocaleString(t) : Number(e.toFixed(ee)).toLocaleString(t, { maximumFractionDigits: ee });
 }
-function Je(e, t, n) {
+function Ye(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}`;
 }
@@ -489,19 +495,19 @@ function R(e, t) {
 function We(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 Ke(e, t, n) {
+  const { locale: r, audience: i } = n, s = Ye(e, "value", i), o = We(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) {
+function Ze(e, t, n) {
   const { locale: r } = n, i = t.groups ?? [];
   if (i.length === 0)
     return "Nothing was grouped, so there are no groups to report.";
@@ -511,62 +517,62 @@ function Ke(e, t, n) {
   ], a = R(e, "modularity");
   return a !== void 0 && o.push(`Modularity is ${m(a, r)}.`), o.join(" ");
 }
-function Ze(e, t) {
+function Xe(e, t) {
   const { locale: n } = t, r = R(e, "hops"), i = R(e, "cost");
   if (r === void 0 && i === void 0)
     return "No route was found.";
   const s = [];
   return r !== void 0 && s.push(`The route runs ${m(r, n)} ${r === 1 ? "hop" : "hops"}.`), i !== void 0 && s.push(`Its total cost is ${m(i, n)}.`), s.join(" ");
 }
-function Xe(e, t, n) {
+function Qe(e, t, n) {
   const { locale: r } = n, i = R(e, "count") ?? t.measured, s = e.shape === "edge-set" ? "edge" : "node";
   return i === 0 ? `No ${s}s were selected.` : `${m(i, r)} ${i === 1 ? s : `${s}s`} were selected.`;
 }
-function Qe(e, t) {
+function et(e, t) {
   const { pairs: n } = e.graph, r = Array.isArray(n) ? n.length : 0;
   return r === 0 ? "No pairs were found." : `${m(r, t.locale)} ${r === 1 ? "pair was" : "pairs were"} found.`;
 }
-function et(e, t) {
+function tt(e, t) {
   const n = R(e, "steps");
   return n === void 0 || n === 0 ? "The series is empty." : `The series covers ${m(n, t.locale)} ${n === 1 ? "step" : "steps"}.`;
 }
 function te(e, t) {
   return e.measured === 0 ? "The run produced no values." : `The run covered ${m(e.measured, t.locale)} of ${m(e.count, t.locale)}.`;
 }
-function tt(e, t) {
+function nt(e, t) {
   const n = e.summary(), { shape: r } = e;
   switch (r) {
     case "node-metric":
     case "edge-metric":
-      return Ye(e, n, t);
+      return Ke(e, n, t);
     case "community":
     case "layered-grouping":
     case "category-table":
-      return Ke(e, n, t);
+      return Ze(e, n, t);
     case "path":
-      return Ze(e, t);
+      return Xe(e, t);
     case "node-set":
     case "edge-set":
-      return Xe(e, n, t);
+      return Qe(e, n, t);
     case "pair-list":
-      return Qe(e, t);
-    case "temporal":
       return et(e, t);
+    case "temporal":
+      return tt(e, t);
     case "fact":
       return te(n, t);
     default:
       return te(n, t);
   }
 }
-function Tn(e, t) {
+function Cn(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,
-    has: i ?? ((o, a) => nt(r(o, a))),
+    has: i ?? ((o, a) => rt(r(o, a))),
     idOf: s ?? null
   };
 }
-function nt(e) {
+function rt(e) {
   return e != null;
 }
 function I(e) {
@@ -594,7 +600,7 @@ function f(e, t, n, r = {}) {
     details: { ...r, position: n, where: t }
   });
 }
-const rt = Object.freeze({
+const it = Object.freeze({
   "[": "index, slice, wildcard and filter expressions",
   "]": "index, slice, wildcard and filter expressions",
   "{": "multi-select hashes",
@@ -603,14 +609,14 @@ const rt = Object.freeze({
   "*": "wildcards",
   "@": "the current-node reference",
   ":": "slices"
-}), it = ["&&", "||", "==", "!=", "<=", ">=", "!", "<", ">", ".", "(", ")"];
+}), st = ["&&", "||", "==", "!=", "<=", ">=", "!", "<", ">", ".", "(", ")"];
 function fe(e) {
   return /[A-Za-z_]/.test(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++;
@@ -621,7 +627,7 @@ function C(e, t, n) {
   }
   throw f(`A ${n} is opened and never closed`, e, t, { delimiter: n });
 }
-function st(e) {
+function ot(e) {
   let t = "";
   for (let n = 0; n < e.length; n++) {
     if (e[n] === "\\" && (e[n + 1] === "'" || e[n + 1] === "\\")) {
@@ -632,7 +638,7 @@ function st(e) {
   }
   return t;
 }
-function ot(e, t, n) {
+function at(e, t, n) {
   const r = n.replace(/\\`/g, "`");
   try {
     return JSON.parse(r);
@@ -645,7 +651,7 @@ function ot(e, t, n) {
     );
   }
 }
-function at(e, t, n) {
+function ct(e, t, n) {
   try {
     const r = JSON.parse(n);
     if (typeof r == "string")
@@ -659,7 +665,7 @@ function at(e, t, n) {
     { name: n }
   );
 }
-function ct(e) {
+function ut(e) {
   const t = [];
   let n = 0;
   for (; n < e.length; ) {
@@ -668,7 +674,7 @@ function ct(e) {
       n++;
       continue;
     }
-    const i = rt[r];
+    const i = it[r];
     if (i !== void 0)
       throw f(`A selector does not support ${i}`, e, n, { construct: i });
     if (r === "|" && e.charAt(n + 1) !== "|")
@@ -677,24 +683,24 @@ function ct(e) {
       throw f("A selector does not support expression references", e, n, {
         construct: "expression references"
       });
-    const s = it.find((o) => e.startsWith(o, n));
+    const s = st.find((o) => e.startsWith(o, n));
     if (s !== void 0) {
       t.push({ kind: "operator", text: s, at: n }), n += s.length;
       continue;
     }
     if (r === "`") {
-      const o = C(e, n, "`");
-      t.push({ kind: "literal", text: "", value: ot(e, n, e.slice(n + 1, o)), at: n }), n = o + 1;
+      const o = x(e, n, "`");
+      t.push({ kind: "literal", text: "", value: at(e, n, e.slice(n + 1, o)), at: n }), n = o + 1;
       continue;
     }
     if (r === "'") {
-      const o = C(e, n, "'");
-      t.push({ kind: "literal", text: "", value: st(e.slice(n + 1, o)), at: n }), n = o + 1;
+      const o = x(e, n, "'");
+      t.push({ kind: "literal", text: "", value: ot(e.slice(n + 1, o)), at: n }), n = o + 1;
       continue;
     }
     if (r === '"') {
-      const o = C(e, n, '"');
-      t.push({ kind: "identifier", text: at(e, n, e.slice(n, o + 1)), at: n }), n = o + 1;
+      const o = x(e, n, '"');
+      t.push({ kind: "identifier", text: ct(e, n, e.slice(n, o + 1)), at: n }), n = o + 1;
       continue;
     }
     if (fe(r)) {
@@ -715,7 +721,7 @@ function ct(e) {
   }
   return t.push({ kind: "end", text: "", at: e.length }), t;
 }
-const ut = Object.freeze({
+const lt = Object.freeze({
   "!=": "!=",
   "<": "<",
   "<=": "<=",
@@ -730,7 +736,7 @@ function S(e, t) {
   const n = N(e);
   return n.kind === "operator" && n.text === t;
 }
-function lt(e) {
+function dt(e) {
   const t = N(e), n = [];
   for (; ; ) {
     const r = N(e);
@@ -755,12 +761,12 @@ function lt(e) {
     e.index++;
   }
 }
-function dt(e) {
+function pt(e) {
   const t = N(e);
   if (t.kind === "literal")
     return e.index++, { kind: "literal", value: t.value };
   if (t.kind === "identifier")
-    return lt(e);
+    return dt(e);
   if (S(e, "(")) {
     e.index++;
     const n = ye(e);
@@ -774,12 +780,12 @@ function dt(e) {
     t.at
   );
 }
-function H(e) {
+function U(e) {
   if (!S(e, "!"))
-    return dt(e);
+    return pt(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 +796,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" ? lt[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);
@@ -805,8 +811,8 @@ function ye(e) {
     e.index++, t = { kind: "or", left: t, right: ie(e) };
   return t;
 }
-function pt(e) {
-  const t = { where: e, tokens: ct(e), index: 0 }, n = ye(t), r = N(t);
+function ht(e) {
+  const t = { where: e, tokens: ut(e), index: 0 }, n = ye(t), r = N(t);
   if (r.kind !== "end")
     throw f(
       `${JSON.stringify(r.text)} is left over at the end of the selector`,
@@ -869,21 +875,21 @@ function w(e, t) {
       };
     }
     default:
-      return ft(e.operator, e.left, e.right, t);
+      return gt(e.operator, e.left, e.right, t);
   }
 }
-const ht = Object.freeze({
+const mt = Object.freeze({
   "<": (e, t) => e < t,
   "<=": (e, t) => e <= t,
   ">": (e, t) => e > t,
   ">=": (e, t) => e >= t
 });
-function mt(e, t) {
+function ft(e, t) {
   return e.kind === "literal" ? e : t.kind === "literal" ? t : null;
 }
-function ft(e, t, n, r) {
+function gt(e, t, n, r) {
   if (e === "==" || e === "!=") {
-    const a = e === "==", u = t.kind === "literal", c = mt(t, n), h = u ? n : t;
+    const a = e === "==", u = t.kind === "literal", c = ft(t, n), h = u ? n : t;
     if (c !== null && c.value === null && h.kind === "path") {
       const { path: d } = h, { has: v } = r;
       return (k) => v(k, d) !== a;
@@ -895,7 +901,7 @@ function ft(e, t, n, r) {
     }
     return (d) => G(p(d), l(d)) === a;
   }
-  const i = w(t, r), s = w(n, r), o = ht[e];
+  const i = w(t, r), s = w(n, r), o = mt[e];
   return (a) => {
     const u = i(a), c = s(a);
     return typeof u == "number" && typeof c == "number" ? o(u, c) : null;
@@ -924,10 +930,10 @@ function A(e, t) {
     }
   }
 }
-function gt(e) {
-  return e.split(".").map((t) => yt(t) ? t : JSON.stringify(t)).join(".");
-}
 function yt(e) {
+  return e.split(".").map((t) => bt(t) ? t : JSON.stringify(t)).join(".");
+}
+function bt(e) {
   if (e === "" || !fe(e[0]))
     return !1;
   for (let t = 1; t < e.length; t++)
@@ -935,11 +941,11 @@ function yt(e) {
       return !1;
   return !0;
 }
-function _n(e, t) {
+function xn(e, t) {
   const { has: n } = e;
   return (r) => n(r, t);
 }
-function zn(e, t) {
+function jn(e, t) {
   const { idOf: n } = e;
   if (n === null)
     throw new y({
@@ -950,7 +956,7 @@ function zn(e, t) {
     });
   return (r) => t.has(n(r));
 }
-function xn(e, t, n) {
+function Pn(e, t, n) {
   const { value: r } = e;
   return (i) => {
     const s = n();
@@ -960,8 +966,8 @@ function xn(e, t, n) {
     return typeof o == "number" && Number.isFinite(o) && o >= s;
   };
 }
-function Cn(e, t) {
-  const n = pt(e), r = [];
+function Ln(e, t) {
+  const n = ht(e), r = [];
   if ($(n, r), r.length === 0) {
     let i = n;
     for (; i.kind === "group"; )
@@ -976,9 +982,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", wt = "$";
+function T(e, t) {
+  return t === void 0 ? `${H}.${e}` : `${H}.${e}.${t}`;
 }
 const be = {
   // -- per element ---------------------------------------------------------------------
@@ -1148,7 +1154,7 @@ const be = {
     scope: "graph",
     types: ["number"]
   }
-}, jn = Object.keys(be), q = {
+}, Dn = Object.keys(be), J = {
   "node-metric": {
     shape: "node-metric",
     primaryField: "value",
@@ -1266,13 +1272,13 @@ const be = {
   }
 };
 function B(e) {
-  return q[e];
+  return J[e];
 }
-function Pn(e) {
-  return q[e].layer === "highlight";
+function Gn(e) {
+  return J[e].layer === "highlight";
 }
-function Ln(e, t) {
-  const n = q[e], r = [], i = [
+function Un(e, t) {
+  const n = J[e], r = [], i = [
     { names: n.nodeFields, kind: "node" },
     { names: n.edgeFields, kind: "edge" },
     { names: n.graphFields, kind: "graph" }
@@ -1295,18 +1301,18 @@ function Ln(e, t) {
         reason: `${o} field "${a}" is typed "${u.type}", not ${c.map((h) => `"${h}"`).join(" or ")}`
       });
     }
-  return n.headlineScalar && !wt(n, t) && r.push({
+  return n.headlineScalar && !vt(n, t) && r.push({
     field: null,
     kind: "graph",
     reason: `shape "${e}" requires one graph-level scalar of its own beside "count"`
   }), r;
 }
-function wt(e, t) {
+function vt(e, t) {
   const n = [...e.graphFields, ...e.optionalGraphFields];
   return t.some((r) => r.kind === "graph" && !n.includes(r.name));
 }
-const vt = 3;
-function Ot(e, t) {
+const Ot = 3;
+function kt(e, t) {
   if (e === t)
     return 0;
   const n = new Uint32Array(t.length + 1), r = new Uint32Array(t.length + 1);
@@ -1322,23 +1328,23 @@ function Ot(e, t) {
   }
   return n[t.length];
 }
-function kt(e, t, n = vt) {
+function Nt(e, t, n = Ot) {
   const r = e.toLowerCase(), i = t.map((s) => ({
     candidate: s,
-    distance: Ot(r, s.toLowerCase())
+    distance: kt(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 Nt(e) {
+function St(e) {
   return typeof e == "string" ? void 0 : e.shape;
 }
-function St(e, t) {
+function At(e, t) {
   return e.fields.some((n) => n.name === t) || t in e.graph;
 }
-class At {
+class $t {
   #e;
   /**
    * Build the API over a registry.
@@ -1361,9 +1367,9 @@ class At {
   path(t, n) {
     const r = se(t);
     if (n !== void 0)
-      return M(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 T(r, n);
+    const i = St(t) ?? this.#e.entry(r)?.shape, s = i === void 0 ? null : B(i).primaryField;
+    return s === null ? T(r) : T(r, s);
   }
   /**
    * The same field, written so a selector expression can read it.
@@ -1378,7 +1384,7 @@ class At {
    * @returns The path with every segment quoted that needs it.
    */
   term(t, n) {
-    return gt(n === void 0 ? this.path(t) : this.path(t, n));
+    return yt(n === void 0 ? this.path(t) : this.path(t, n));
   }
   /**
    * One run's result.
@@ -1400,7 +1406,7 @@ class At {
    */
   has(t, n) {
     const r = this.get(t);
-    return r === void 0 ? !1 : n === void 0 || St(r, n);
+    return r === void 0 ? !1 : n === void 0 || At(r, n);
   }
   /**
    * Every run that has published a result, as an expression editor reads them.
@@ -1413,20 +1419,20 @@ class At {
     return Object.freeze(t);
   }
 }
-function Dn(e) {
-  return new At(e);
+function Hn(e) {
+  return new $t(e);
 }
-const $t = 20, j = 100, Rt = 100, Ft = Object.freeze([]), Et = Object.freeze(["max", "min-max", "none"]);
+const Rt = 20, j = 100, Et = 100, Ft = Object.freeze([]), It = Object.freeze(["max", "min-max", "none"]);
 function we(e) {
-  return typeof e == "string" && Et.includes(e);
+  return typeof e == "string" && It.includes(e);
 }
-function Gn(e) {
+function Bn(e) {
   return {
     length: e.length,
     get: (t) => e[t]
   };
 }
-const It = Object.freeze({
+const Tt = Object.freeze({
   measured: 0,
   min: Number.NaN,
   max: Number.NaN,
@@ -1443,7 +1449,7 @@ function ve(e) {
     Number.isFinite(d) && (n[r] = d, r++);
   }
   if (r === 0)
-    return { length: t, ...It };
+    return { length: t, ...Tt };
   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];
@@ -1477,7 +1483,7 @@ function Oe(e) {
     median: t.median
   }), statistics: t };
 }
-function J(e) {
+function q(e) {
   const t = e.filter((o) => Number.isFinite(o.value)).map((o) => ({ entry: o, label: String(o.id) }));
   t.sort((o, a) => o.entry.value !== a.entry.value ? a.entry.value - o.entry.value : o.label === a.label ? 0 : o.label < a.label ? -1 : 1);
   const n = t.length, r = [];
@@ -1512,17 +1518,17 @@ function Mt(e, t) {
     reason: o
   });
 }
-function Tt(e) {
+function _t(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 _t(e) {
-  return e.measured === 0 || !(e.median > 0) || e.max / e.median <= Rt ? "linear" : Tt(e) ? "log" : "linear";
+function zt(e) {
+  return e.measured === 0 || !(e.median > 0) || e.max / e.median <= Et ? "linear" : _t(e) ? "log" : "linear";
 }
-function zt(e, t, n, r) {
+function Ct(e, t, n, r) {
   if (!(t > e))
     return { binCount: 1, indexOf: () => 0, rangeOf: () => [e, t] };
   if (r) {
@@ -1576,9 +1582,9 @@ function xt(e, t, n, r, i) {
     }
   };
 }
-function Ct(e) {
+function jt(e) {
   if (e === void 0)
-    return $t;
+    return Rt;
   if (!Number.isInteger(e) || e < 1 || e > j)
     throw new y({
       code: "E_OPTION_RANGE",
@@ -1588,7 +1594,7 @@ function Ct(e) {
     });
   return e;
 }
-function jt(e, t) {
+function Pt(e, t) {
   const n = /* @__PURE__ */ new Map();
   for (let r = 0; r < e.length; r++) {
     const i = e.get(r);
@@ -1605,8 +1611,8 @@ 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);
+function Lt(e, t) {
+  const n = jt(t?.bins), r = t?.integerValued ?? !1, i = ve(e), s = zt(i), o = Pt(e, n);
   if (o !== null) {
     if (o.size === 0)
       return Object.freeze({
@@ -1629,7 +1635,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" ? 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);
   for (let p = 0; p < e.length; p++) {
     const l = e.get(p);
     Number.isFinite(l) && (h[c.indexOf(l)] += 1);
@@ -1648,7 +1654,7 @@ function Pt(e, t) {
     binning: "banded"
   });
 }
-const Lt = 10, Dt = 10;
+const Dt = 10, Gt = 10;
 function oe(e) {
   const t = { ids: [], records: [], index: /* @__PURE__ */ new Map() };
   if (e === void 0)
@@ -1670,13 +1676,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 +1691,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;
 }
@@ -1700,7 +1706,7 @@ function Se(e, t) {
   const n = String(e), r = String(t);
   return n === r ? 0 : n < r ? -1 : 1;
 }
-function Gt(e) {
+function Ut(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)));
 }
@@ -1710,9 +1716,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 q(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 +1726,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));
+  g(t, i, s.size), g(t, "sizes", Ut(s));
 }
 function Ht(e, t) {
-  for (const r of J(W(e, "score"))) {
+  for (const r of q(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 +1741,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 +1753,7 @@ function ue(e, t) {
     r[t] !== void 0 && n++;
   return n;
 }
-function Ut(e, t, n, r, i) {
+function Bt(e, t, n, r, i) {
   switch (e) {
     case "node-metric":
       ae(t, r, i);
@@ -1765,17 +1771,17 @@ function Ut(e, t, n, r, i) {
       Ht(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;
   }
 }
-function Bt(e) {
+function Vt(e) {
   switch (e) {
     case "node-metric":
     case "edge-metric":
@@ -1788,7 +1794,7 @@ function Bt(e) {
       return null;
   }
 }
-function Vt(e, t) {
+function Jt(e, t) {
   if (!Array.isArray(e))
     return;
   const n = [];
@@ -1796,7 +1802,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);
@@ -1821,7 +1827,7 @@ class qt {
    */
   constructor(t, n, r, i) {
     this.runId = t.runId, this.shape = t.shape, this.fields = Object.freeze([...t.fields]), this.measured = Object.freeze({ nodes: t.measured.nodes, edges: t.measured.edges }), this.graph = i, this.#e = n, this.#t = r, this.#n = t.caveats, this.#r = t.durationMs, this.#i = t.labelOf ?? (() => {
-    }), this.#s = t.reading ?? tt;
+    }), this.#s = t.reading ?? nt;
   }
   /**
    * One node's fields.
@@ -1922,7 +1928,7 @@ class qt {
    */
   histogram(t, n) {
     const r = this.#d(t), i = r.kind === "edge" ? this.#t : this.#e;
-    return Pt(V(i, t), {
+    return Lt(V(i, t), {
       ...n,
       integerValued: r.type === "integer"
     });
@@ -1978,7 +1984,7 @@ class qt {
         code: "E_UNKNOWN_ATTRIBUTE",
         source: "run",
         message: `Run "${this.runId}" published no field named "${t}".`,
-        details: { field: t, available: i, candidates: kt(t, i) },
+        details: { field: t, available: i, candidates: Nt(t, i) },
         target: { kind: "run", id: this.runId }
       });
     if (!P(r))
@@ -2020,7 +2026,7 @@ class qt {
    * @throws A GraphtyError naming what went wrong.
    */
   #f(t) {
-    const n = J(W(this.#p(t), t));
+    const n = q(Y(this.#p(t), t));
     return this.#a.set(t, n), n;
   }
   /**
@@ -2028,7 +2034,7 @@ class qt {
    * @returns The summary.
    */
   #g() {
-    const t = Bt(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, Lt).map(
+    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(
       (c) => Object.freeze({
         id: c.id,
         label: this.#i(c.id) ?? String(c.id),
@@ -2048,7 +2054,7 @@ class qt {
       top: Object.freeze(s),
       caveats: this.#n,
       durationMs: this.#r
-    }, a = this.graph.sizes ?? this.graph.categories, u = Vt(a, Dt);
+    }, a = this.graph.sizes ?? this.graph.categories, u = Jt(a, Gt);
     return Object.freeze(u === void 0 ? o : { ...o, groups: u });
   }
   /**
@@ -2085,9 +2091,9 @@ class qt {
     return we(n) ? n : t === null ? "none" : Ae(this.fields, t);
   }
 }
-function Jt(e) {
+function Yt(e) {
   const t = oe(e.nodes), n = oe(e.edges), r = { ...e.graph };
-  Ut(e.shape, t, n, r, e.fields);
+  Bt(e.shape, t, n, r, e.fields);
   for (const i of t.records)
     Object.freeze(i);
   for (const i of n.records)
@@ -2104,11 +2110,11 @@ function Wt(e) {
     return typeof i == "string" || typeof i == "number" ? String(i) : void 0;
   };
 }
-function Hn(e) {
+function Vn(e) {
   return { exact: !0, precision: "f64", notes: [], ...e };
 }
-const Yt = 1024, Kt = 16;
-function Zt() {
+const Kt = 1024, Zt = 16;
+function Xt() {
   return {
     signal: new AbortController().signal,
     report: () => {
@@ -2118,27 +2124,27 @@ function Zt() {
     })
   };
 }
-async function Un(e, t, n, r) {
+async function Jn(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 % 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);
   e.signal.throwIfAborted(), e.report({ phase: t, completed: i, total: i });
 }
-function Xt(e, t, n) {
+function Qt(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,
     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;
   /**
@@ -2162,7 +2168,7 @@ class Bn extends D {
    */
   resolveOptions(t) {
     const { descriptor: n } = this.constructor;
-    return n === void 0 ? super.resolveOptions(t) : Ie(n.options, t ?? {}, {
+    return n === void 0 ? super.resolveOptions(t) : _e(n.options, t ?? {}, {
       kind: "algorithm",
       id: n.key
     });
@@ -2189,7 +2195,7 @@ class Bn extends D {
    * @returns A promise that settles when the result has been published.
    */
   async run() {
-    await this.computeRun(Zt(), this.type);
+    await this.computeRun(Xt(), this.type);
   }
   /**
    * Compute on behalf of a run, and hand the result back.
@@ -2224,11 +2230,11 @@ 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 = Wt(this.graph), u = Yt({
       ...a === void 0 ? {} : { labelOf: a },
       runId: n,
       shape: s.shape,
-      fields: s.fields.map((c) => Xt(c, n, r)),
+      fields: s.fields.map((c) => Qt(c, n, r)),
       measured: { nodes: o.nodes.size, edges: o.edges.size },
       graph: s.graph,
       nodes: s.nodes,
@@ -2239,7 +2245,7 @@ class Bn extends D {
     return this.#e = u, u;
   }
 }
-function Vn(e, t = "number") {
+function Yn(e, t = "number") {
   return [
     { name: "value", kind: e, type: t },
     { name: "rank", kind: e, type: "integer" },
@@ -2259,15 +2265,15 @@ const le = [
   { name: "groupCount", kind: "graph", type: "integer" },
   { name: "sizes", kind: "graph", type: "table" }
 ];
-function qn(e) {
+function Wn(e) {
   return e ? [...le, { name: "modularity", kind: "graph", type: "number" }] : le;
 }
-const Jn = [
+const Kn = [
   { 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 = [
+], Zn = [
   { name: "onPath", kind: "node", type: "boolean" },
   { name: "order", kind: "node", type: "integer" },
   { name: "onPath", kind: "edge", type: "boolean" },
@@ -2275,18 +2281,18 @@ const Jn = [
   { name: "cost", kind: "graph", type: "number" },
   { name: "hops", kind: "graph", type: "integer" }
 ];
-function Yn(e, t) {
+function Xn(e, t) {
   return [
     { name: "in", kind: e, type: "boolean" },
     { name: "count", kind: "graph", type: "integer" },
     { ...t, kind: "graph" }
   ];
 }
-const Qt = `${U}.${bt}`;
+const en = `${H}.${wt}`;
 function O(e) {
-  return { ...e, path: `${Qt}.${e.name}` };
+  return { ...e, path: `${en}.${e.name}` };
 }
-function Kn(e) {
+function Qn(e) {
   return [
     O({
       name: "value",
@@ -2331,28 +2337,28 @@ function Kn(e) {
     })
   ];
 }
-const en = 12;
-function Zn(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];
+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];
     return o === void 0 ? s : { ...s, ...o };
   });
 }
-function tn(e) {
+function nn(e) {
   return typeof e != "object" || e === null ? !1 : "_zod" in e || "_def" in e;
 }
-function nn(e) {
+function rn(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 rn(e) {
+function sn(e) {
   const t = Object.entries(e), n = {};
   for (const [s, o] of t)
     n[s] = o.schema;
-  const r = sn(n), i = r?.properties;
+  const r = on(n), i = r?.properties;
   return t.map(([s, o]) => {
     const a = i?.[s];
     return r === null || a === void 0 ? {
@@ -2370,7 +2376,7 @@ function $e(e) {
     return null;
   }
 }
-function sn(e) {
+function on(e) {
   try {
     return $e(me.object(e));
   } catch {
@@ -2385,8 +2391,8 @@ function Re(e, t) {
   const r = n.slice(de.length).replaceAll("~1", "/").replaceAll("~0", "~");
   return t.$defs?.[r] ?? e;
 }
-function on(e, t, n) {
-  const r = Fe(t, 0), i = cn(r), s = {
+function an(e, t, n) {
+  const r = Ee(t, 0), i = un(r), s = {
     name: e,
     plainName: n.label ?? K(e),
     technicalName: e,
@@ -2401,7 +2407,7 @@ function on(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 an(e, t, n) {
+function cn(e, t, n) {
   const r = {
     name: e,
     plainName: t.label ?? K(e),
@@ -2411,8 +2417,8 @@ 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) {
-  if (t >= en)
+function Ee(e, t) {
+  if (t >= tn)
     return { arms: [], nullable: !1, unresolvedRef: !0 };
   if (e.$ref !== void 0)
     return { arms: [], nullable: !1, unresolvedRef: !0 };
@@ -2421,12 +2427,12 @@ 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;
 }
-function cn(e) {
+function un(e) {
   if (e.arms.length === 0)
     return e.unresolvedRef ? {
       type: "unknown",
@@ -2435,19 +2441,19 @@ function cn(e) {
       type: "unknown",
       unsupportedReason: e.nullable ? "the only value the schema accepts is null" : "the schema declares no value type"
     };
-  const t = ln(e.arms);
+  const t = dn(e.arms);
   if (t !== void 0)
     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));
+    return ln(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 un(e) {
-  switch (Ee(e)) {
+function ln(e) {
+  switch (Fe(e)) {
     case "integer":
       return { type: "integer", node: e };
     case "number":
@@ -2476,7 +2482,7 @@ function un(e) {
       };
   }
 }
-function ln(e) {
+function dn(e) {
   const t = [];
   for (const r of e)
     if (r.enum !== void 0)
@@ -2496,7 +2502,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 +2515,59 @@ function K(e) {
   return t === "" ? e : t.split(/\s+/u).map((n) => n.charAt(0).toUpperCase() + n.slice(1)).join(" ");
 }
 export {
+  Hn as $,
   D as A,
-  Fn as B,
-  Pe as C,
-  Sn as D,
-  On as E,
-  wn as F,
+  Tn as B,
+  Le as C,
+  An as D,
+  kn as E,
+  vn as F,
   Wt as G,
-  Jt as H,
-  $n as I,
-  An as J,
-  ve as K,
-  Jn as L,
-  Gn as M,
-  Cn as N,
+  Yt as H,
+  Rn as I,
+  $n as J,
+  Fn as K,
+  Kn as L,
+  En 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,
-  Kt as Y,
-  Dn as Z,
-  Mn as _,
-  Bn as a,
-  En as b,
-  Ln as c,
-  vn as d,
-  qn as e,
-  Hn as f,
-  In as g,
-  Un as h,
-  Vn as i,
-  Rn as j,
-  bn as k,
+  Zn as P,
+  Bn as Q,
+  Dn as R,
+  Ln as S,
+  Cn 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,
   He as l,
   O as m,
-  Kn as n,
-  Zn as o,
-  je as p,
-  kn as q,
-  yn as r,
-  Yn as s,
-  U as t,
-  q as u,
-  De as v,
-  tt as w,
-  Nn as x,
-  gt as y,
-  M as z
+  Qn as n,
+  er as o,
+  Pe as p,
+  Nn as q,
+  bn as r,
+  Xn as s,
+  H as t,
+  J as u,
+  Ge as v,
+  nt as w,
+  Sn as x,
+  yt as y,
+  T as z
 };