@graphty/graphty-element 2.2.4 → 2.3.0

package/dist/chunks/{paletteRegistry-NrWOKT-A.js → paletteRegistry-DnWHQsAD.js}

@@ -2,13 +2,13 @@ import { z as j } from "zod/v4";
 import { b as Le, q as Z, G as De } from "./GraphtyLogger-5KEttFUo.js";
 import { A as Ce } from "./Algorithm-RQ629NLb.js";
 import { G as w } from "./GraphtyError-BwcnblTH.js";
-import { a as Ge, b as He, d as Ue } from "./types-B7bX5c0K.js";
+import { a as Ge, b as Ue, d as He } from "./types-B7bX5c0K.js";
 import { remapArray as se, INVALID_INDEX as W } from "@graphty/graph-format";
 import { c as Be } from "./common-DWNKjpH_.js";
 const We = 12;
-function $n(t, e = {}) {
+function Rn(t, e = {}) {
   return (Je(t) ? Ve(t) : qe(t)).map((r) => {
-    const i = { ...r.meta, ...e.meta?.[r.name] }, s = r.node === null ? Ke(r.name, i, r.failure ?? "the schema could not be converted") : Ye(r.name, r.node, i), o = e.overrides?.[r.name];
+    const i = { ...r.meta, ...e.meta?.[r.name] }, s = r.node === null ? Ke(r.name, i, r.failure ?? "the schema could not be converted") : Xe(r.name, r.node, i), o = e.overrides?.[r.name];
     return o === void 0 ? s : { ...s, ...o };
   });
 }
@@ -26,7 +26,7 @@ function qe(t) {
   const e = Object.entries(t), n = {};
   for (const [s, o] of e)
     n[s] = o.schema;
-  const r = Xe(n), i = r?.properties;
+  const r = Ye(n), i = r?.properties;
   return e.map(([s, o]) => {
     const a = i?.[s];
     return r === null || a === void 0 ? {
@@ -44,7 +44,7 @@ function Oe(t) {
     return null;
   }
 }
-function Xe(t) {
+function Ye(t) {
   try {
     return Oe(j.object(t));
   } catch {
@@ -59,7 +59,7 @@ function ke(t, e) {
   const r = n.slice(oe.length).replaceAll("~1", "/").replaceAll("~0", "~");
   return e.$defs?.[r] ?? t;
 }
-function Ye(t, e, n) {
+function Xe(t, e, n) {
   const r = Se(e, 0), i = Ze(r), s = {
     name: t,
     plainName: n.label ?? Q(t),
@@ -270,7 +270,7 @@ function ut(t, e) {
       return le(n, e);
   }
 }
-function Rn(t, e) {
+function _n(t, e) {
   const n = e === "node", r = n ? t.nodeValue : t.edgeValue, i = n ? t.nodeHas : t.edgeHas, s = n ? t.nodeIdOf : t.edgeIdOf;
   return {
     value: r,
@@ -281,7 +281,7 @@ function Rn(t, e) {
 function dt(t) {
   return t != null;
 }
-function P(t) {
+function M(t) {
   return t == null || t === !1 || t === "" ? !1 : Array.isArray(t) ? t.length > 0 : typeof t == "object" ? Object.keys(t).length > 0 : !0;
 }
 function J(t, e) {
@@ -322,7 +322,7 @@ function Fe(t) {
 function Ee(t) {
   return /[A-Za-z0-9_]/.test(t);
 }
-function H(t, e, n) {
+function U(t, e, n) {
   for (let r = e + 1; r < t.length; r++) {
     if (t[r] === "\\") {
       r++;
@@ -395,17 +395,17 @@ function yt(t) {
       continue;
     }
     if (r === "`") {
-      const o = H(t, n, "`");
+      const o = U(t, n, "`");
       e.push({ kind: "literal", text: "", value: mt(t, n, t.slice(n + 1, o)), at: n }), n = o + 1;
       continue;
     }
     if (r === "'") {
-      const o = H(t, n, "'");
+      const o = U(t, n, "'");
       e.push({ kind: "literal", text: "", value: ft(t.slice(n + 1, o)), at: n }), n = o + 1;
       continue;
     }
     if (r === '"') {
-      const o = H(t, n, '"');
+      const o = U(t, n, '"');
       e.push({ kind: "identifier", text: gt(t, n, t.slice(n, o + 1)), at: n }), n = o + 1;
       continue;
     }
@@ -564,20 +564,20 @@ function b(t, e) {
       return b(t.inner, e);
     case "not": {
       const n = b(t.operand, e);
-      return (r) => !P(n(r));
+      return (r) => !M(n(r));
     }
     case "and": {
       const n = b(t.left, e), r = b(t.right, e);
       return (i) => {
         const s = n(i);
-        return P(s) ? r(i) : s;
+        return M(s) ? r(i) : s;
       };
     }
     case "or": {
       const n = b(t.left, e), r = b(t.right, e);
       return (i) => {
         const s = n(i);
-        return P(s) ? s : r(i);
+        return M(s) ? s : r(i);
       };
     }
     default:
@@ -632,7 +632,7 @@ function x(t, e) {
     }
     default: {
       const n = b(t, e);
-      return (r) => P(n(r));
+      return (r) => M(n(r));
     }
   }
 }
@@ -647,11 +647,11 @@ function Ft(t) {
       return !1;
   return !0;
 }
-function _n(t, e) {
+function zn(t, e) {
   const { has: n } = t;
   return (r) => n(r, e);
 }
-function zn(t, e) {
+function Mn(t, e) {
   const { idOf: n } = t;
   if (n === null)
     throw new w({
@@ -679,7 +679,7 @@ function Pn(t, e) {
   return { paths: Object.freeze(r), test: x(n, e) };
 }
 const q = "results", Et = "$";
-function M(t, e) {
+function P(t, e) {
   return e === void 0 ? `${q}.${t}` : `${q}.${t}.${e}`;
 }
 const xe = {
@@ -850,7 +850,7 @@ const xe = {
     scope: "graph",
     types: ["number"]
   }
-}, Mn = Object.keys(xe), ee = {
+}, jn = Object.keys(xe), ee = {
   "node-metric": {
     shape: "node-metric",
     primaryField: "value",
@@ -967,13 +967,13 @@ const xe = {
     layer: "none"
   }
 };
-function X(t) {
+function Y(t) {
   return ee[t];
 }
-function jn(t) {
+function Ln(t) {
   return ee[t].layer === "highlight";
 }
-function Ln(t, e) {
+function Dn(t, e) {
   const n = ee[t], r = [], i = [
     { names: n.nodeFields, kind: "node" },
     { names: n.edgeFields, kind: "edge" },
@@ -1063,9 +1063,9 @@ class zt {
   path(e, n) {
     const r = pe(e);
     if (n !== void 0)
-      return M(r, n);
-    const i = Rt(e) ?? this.#e.entry(r)?.shape, s = i === void 0 ? null : X(i).primaryField;
-    return s === null ? M(r) : M(r, s);
+      return P(r, n);
+    const i = Rt(e) ?? this.#e.entry(r)?.shape, s = i === void 0 ? null : Y(i).primaryField;
+    return s === null ? P(r) : P(r, s);
   }
   /**
    * The same field, written so a selector expression can read it.
@@ -1115,14 +1115,14 @@ class zt {
     return Object.freeze(e);
   }
 }
-function Dn(t) {
+function Cn(t) {
   return new zt(t);
 }
-const Pt = 20, U = 100, Mt = 100, jt = Object.freeze([]), Lt = Object.freeze(["max", "min-max", "none"]);
+const Mt = 20, H = 100, Pt = 100, jt = Object.freeze([]), Lt = Object.freeze(["max", "min-max", "none"]);
 function Te(t) {
   return typeof t == "string" && Lt.includes(t);
 }
-function Cn(t) {
+function Gn(t) {
   return {
     length: t.length,
     get: (e) => t[e]
@@ -1205,9 +1205,9 @@ function Ct(t) {
   return Math.log10(t.max) > Math.log10(n);
 }
 function Gt(t) {
-  return t.measured === 0 || !(t.median > 0) || t.max / t.median <= Mt ? "linear" : Ct(t) ? "log" : "linear";
+  return t.measured === 0 || !(t.median > 0) || t.max / t.median <= Pt ? "linear" : Ct(t) ? "log" : "linear";
 }
-function Ht(t, e, n, r) {
+function Ut(t, e, n, r) {
   if (!(e > t))
     return { binCount: 1, indexOf: () => 0, rangeOf: () => [t, e] };
   if (r) {
@@ -1231,7 +1231,7 @@ function Ht(t, e, n, r) {
     ]
   };
 }
-function Ut(t, e, n, r, i) {
+function Ht(t, e, n, r, i) {
   const s = t > 0 ? 0 : 1, o = s === 0 ? t : n;
   if (!(e > 0) || o === null || !(o > 0))
     return null;
@@ -1263,13 +1263,13 @@ function Ut(t, e, n, r, i) {
 }
 function Bt(t) {
   if (t === void 0)
-    return Pt;
-  if (!Number.isInteger(t) || t < 1 || t > U)
+    return Mt;
+  if (!Number.isInteger(t) || t < 1 || t > H)
     throw new w({
       code: "E_OPTION_RANGE",
       source: "run",
-      message: `A histogram takes between 1 and ${U} bins; ${String(t)} was asked for.`,
-      details: { option: "bins", value: t, min: 1, max: U }
+      message: `A histogram takes between 1 and ${H} bins; ${String(t)} was asked for.`,
+      details: { option: "bins", value: t, min: 1, max: H }
     });
   return t;
 }
@@ -1314,7 +1314,7 @@ function Jt(t, e) {
       binning: "per-value"
     });
   }
-  const l = e?.scale === "log" || e?.scale === "auto" && s === "log" ? Ut(i.min, i.max, i.smallestPositive, n, r) : null, c = l ?? Ht(i.min, i.max, n, r), p = new Array(c.binCount).fill(0);
+  const l = e?.scale === "log" || e?.scale === "auto" && s === "log" ? Ht(i.min, i.max, i.smallestPositive, n, r) : null, c = l ?? Ut(i.min, i.max, n, r), p = new Array(c.binCount).fill(0);
   for (let h = 0; h < t.length; h++) {
     const u = t.get(h);
     Number.isFinite(u) && (p[c.indexOf(u)] += 1);
@@ -1348,7 +1348,7 @@ function fe(t) {
   }
   return e;
 }
-function Y(t, e) {
+function X(t, e) {
   const { records: n } = t;
   return {
     length: n.length,
@@ -1381,25 +1381,25 @@ function ze(t, e) {
   }
   return n;
 }
-function Pe(t, e) {
+function Me(t, e) {
   const n = String(t), r = String(e);
   return n === r ? 0 : n < r ? -1 : 1;
 }
-function Xt(t) {
+function Yt(t) {
   const e = [...t.entries()].map(([n, r]) => ({ group: n, size: r }));
-  return e.sort((n, r) => r.size - n.size || Pe(n.group, r.group)), Object.freeze(e.map((n) => Object.freeze(n)));
+  return e.sort((n, r) => r.size - n.size || Me(n.group, r.group)), Object.freeze(e.map((n) => Object.freeze(n)));
 }
-function Me(t, e) {
+function Pe(t, e) {
   const n = t.find((r) => r.name === e)?.normalization;
   return Te(n) ? n : "none";
 }
 function me(t, e, n) {
-  const { statistics: r } = Re(Y(t, "value"));
+  const { statistics: r } = Re(X(t, "value"));
   for (const i of te(ne(t, "value"))) {
     const s = t.index.get(i.id);
     s !== void 0 && (L(t.records[s], "rank", i.rank), L(t.records[s], "percentile", i.percentile));
   }
-  r.measured > 0 && (y(e, "min", r.min), y(e, "max", r.max), y(e, "median", r.median), y(e, "mean", r.mean)), y(e, "measured", r.measured), y(e, "tiedAtMin", r.tiedAtMin), y(e, "normalization", Me(n, "value"));
+  r.measured > 0 && (y(e, "min", r.min), y(e, "max", r.max), y(e, "median", r.median), y(e, "mean", r.mean)), y(e, "measured", r.measured), y(e, "tiedAtMin", r.tiedAtMin), y(e, "normalization", Pe(n, "value"));
 }
 function ge(t, e, n, r, i) {
   const s = ze(t, n);
@@ -1407,9 +1407,9 @@ function ge(t, e, n, r, i) {
     const a = o[n];
     re(a) && L(o, r, s.get(a));
   }
-  y(e, i, s.size), y(e, "sizes", Xt(s));
+  y(e, i, s.size), y(e, "sizes", Yt(s));
 }
-function Yt(t, e) {
+function Xt(t, e) {
   for (const r of te(ne(t, "score"))) {
     const i = t.index.get(r.id);
     i !== void 0 && L(t.records[i], "rank", r.rank);
@@ -1418,7 +1418,7 @@ function Yt(t, e) {
     category: String(r),
     count: i
   }));
-  n.sort((r, i) => i.count - r.count || Pe(r.category, i.category)), y(e, "categories", Object.freeze(n.map((r) => Object.freeze(r))));
+  n.sort((r, i) => i.count - r.count || Me(r.category, i.category)), y(e, "categories", Object.freeze(n.map((r) => Object.freeze(r))));
 }
 function z(t, e) {
   let n = 0;
@@ -1447,7 +1447,7 @@ function Kt(t, e, n, r, i) {
       ge(e, r, "level", "levelSize", "levelCount");
       break;
     case "category-table":
-      Yt(e, r);
+      Xt(e, r);
       break;
     case "path":
       y(r, "length", z(e, "onPath")), y(r, "hops", z(n, "onPath"));
@@ -1577,7 +1577,7 @@ class en {
    */
   histogram(e, n) {
     const r = this.#l(e), i = r.kind === "edge" ? this.#t : this.#e;
-    return Jt(Y(i, e), {
+    return Jt(X(i, e), {
       ...n,
       integerValued: r.type === "integer"
     });
@@ -1665,7 +1665,7 @@ class en {
     const n = this.#o.get(e);
     if (n !== void 0)
       return n;
-    const r = Re(Y(this.#u(e), e));
+    const r = Re(X(this.#u(e), e));
     return this.#o.set(e, r), r;
   }
   /**
@@ -1715,7 +1715,7 @@ class en {
    * @returns The count.
    */
   #m() {
-    const e = X(this.shape), n = e.nodeFields.length > 0 ? this.measured.nodes : 0, r = e.edgeFields.length > 0 ? this.measured.edges : 0;
+    const e = Y(this.shape), n = e.nodeFields.length > 0 ? this.measured.nodes : 0, r = e.edgeFields.length > 0 ? this.measured.edges : 0;
     return n + r;
   }
   /**
@@ -1723,7 +1723,7 @@ class en {
    * @returns The count.
    */
   #g() {
-    const e = X(this.shape), { primaryField: n } = e;
+    const e = Y(this.shape), { primaryField: n } = e;
     if (n === null)
       return 0;
     const r = e.nodeFields.includes(n) ? ye(this.#e, n) : 0, i = e.edgeFields.includes(n) ? ye(this.#t, n) : 0;
@@ -1737,7 +1737,7 @@ class en {
    */
   #y(e) {
     const n = this.graph.normalization;
-    return Te(n) ? n : e === null ? "none" : Me(this.fields, e);
+    return Te(n) ? n : e === null ? "none" : Pe(this.fields, e);
   }
 }
 function tn(t) {
@@ -1759,11 +1759,11 @@ function nn(t) {
     return typeof i == "string" || typeof i == "number" ? String(i) : void 0;
   };
 }
-function Gn(t) {
+function Un(t) {
   return { exact: !0, precision: "f64", notes: [], ...t };
 }
-const rn = 1024;
-function sn() {
+const rn = 1024, sn = 16;
+function on() {
   return {
     signal: new AbortController().signal,
     report: () => {
@@ -1776,23 +1776,24 @@ function sn() {
 async function Hn(t, e, n, r) {
   const i = n.length;
   t.report({ phase: e, completed: 0, total: i });
-  for (let s = 0; s < i; s++)
-    s > 0 && s % rn === 0 && (t.signal.throwIfAborted(), t.report({ phase: e, completed: s, total: i }), await t.yieldNow()), r(n[s], s);
+  let s = performance.now();
+  for (let o = 0; o < i; o++)
+    o > 0 && o % rn === 0 && (t.signal.throwIfAborted(), t.report({ phase: e, completed: o, total: i }), performance.now() - s >= sn && (await t.yieldNow(), s = performance.now())), r(n[o], o);
   t.signal.throwIfAborted(), t.report({ phase: e, completed: i, total: i });
 }
-function on(t, e, n) {
+function an(t, e, n) {
   const r = n?.find((s) => s.name === t.name && s.kind === t.kind), i = {
     name: t.name,
     plainName: r?.plainName ?? t.name,
     technicalName: r?.technicalName ?? t.name,
     kind: t.kind,
     type: t.type,
-    path: M(e, t.name),
+    path: P(e, t.name),
     ...r?.unit === void 0 ? {} : { unit: r.unit }
   };
   return t.normalization === void 0 ? i : { ...i, normalization: t.normalization };
 }
-class Un extends Ce {
+class Bn extends Ce {
   /** What the last run published, kept so a caller holding the algorithm can read the result. */
   #e;
   /**
@@ -1843,7 +1844,7 @@ class Un extends Ce {
    * @returns A promise that settles when the result has been published.
    */
   async run() {
-    await this.computeRun(sn(), this.type);
+    await this.computeRun(on(), this.type);
   }
   /**
    * Compute on behalf of a run, and hand the result back.
@@ -1882,7 +1883,7 @@ class Un extends Ce {
       ...a === void 0 ? {} : { labelOf: a },
       runId: n,
       shape: s.shape,
-      fields: s.fields.map((c) => on(c, n, r)),
+      fields: s.fields.map((c) => an(c, n, r)),
       measured: { nodes: o.nodes.size, edges: o.edges.size },
       graph: s.graph,
       nodes: s.nodes,
@@ -1893,7 +1894,7 @@ class Un extends Ce {
     return this.#e = l, l;
   }
 }
-function Bn(t, e = "number") {
+function Wn(t, e = "number") {
   return [
     { name: "value", kind: t, type: e },
     { name: "rank", kind: t, type: "integer" },
@@ -1913,15 +1914,15 @@ const be = [
   { name: "groupCount", kind: "graph", type: "integer" },
   { name: "sizes", kind: "graph", type: "table" }
 ];
-function Wn(t) {
+function Jn(t) {
   return t ? [...be, { name: "modularity", kind: "graph", type: "number" }] : be;
 }
-const Jn = [
+const Vn = [
   { name: "level", kind: "node", type: "integer" },
   { name: "levelSize", kind: "node", type: "integer" },
   { name: "levelCount", kind: "graph", type: "integer" },
   { name: "sizes", kind: "graph", type: "table" }
-], Vn = [
+], qn = [
   { name: "onPath", kind: "node", type: "boolean" },
   { name: "order", kind: "node", type: "integer" },
   { name: "onPath", kind: "edge", type: "boolean" },
@@ -1929,16 +1930,16 @@ const Jn = [
   { name: "cost", kind: "graph", type: "number" },
   { name: "hops", kind: "graph", type: "integer" }
 ];
-function qn(t, e) {
+function Yn(t, e) {
   return [
     { name: "in", kind: t, type: "boolean" },
     { name: "count", kind: "graph", type: "integer" },
     { ...e, kind: "graph" }
   ];
 }
-const an = `${q}.${Et}`;
+const cn = `${q}.${Et}`;
 function N(t) {
-  return { ...t, path: `${an}.${t.name}` };
+  return { ...t, path: `${cn}.${t.name}` };
 }
 function Xn(t) {
   return [
@@ -1992,22 +1993,22 @@ const _ = Z({
   implementationOf: (t) => t.descriptor,
   builtInIds: () => Ge
 });
-function Yn(t, e) {
+function Kn(t, e) {
   _.register(t, e);
 }
-function Kn() {
+function Zn() {
   return _.entries();
 }
-function cn() {
+function ln() {
   return _.descriptors();
 }
-function ln(t) {
+function un(t) {
   return _.byId(t);
 }
-function Zn() {
+function Qn() {
   _.clearForTesting();
 }
-const un = {
+const dn = {
   "edge-list": "Edge List",
   "node-list": "Node List",
   "adjacency-list": "Adjacency List",
@@ -2015,7 +2016,7 @@ const un = {
   gephi: "Gephi Export",
   cytoscape: "Cytoscape Export",
   generic: "Generic"
-}, dn = [
+}, hn = [
   {
     name: "delimiter",
     plainName: "Column Separator",
@@ -2028,7 +2029,7 @@ const un = {
     plainName: "File Shape",
     technicalName: "variant",
     type: "enum",
-    values: Object.entries(un).map(([t, e]) => ({ value: t, label: e })),
+    values: Object.entries(dn).map(([t, e]) => ({ value: t, label: e })),
     description: "Which CSV shape to read. Worked out from the header row when it is not set."
   },
   {
@@ -2053,7 +2054,7 @@ const un = {
     type: "string",
     description: "Where to find the node an edge ends at. Left unset, the element looks for target, then dst, then to."
   }
-], hn = [
+], pn = [
   {
     name: "nodeIdPath",
     plainName: "Node Id Field",
@@ -2069,7 +2070,7 @@ const un = {
     mimeTypes: ["application/json"],
     canImport: !0,
     canExport: !1,
-    options: [...hn, ...S]
+    options: [...pn, ...S]
   },
   {
     id: "csv",
@@ -2078,7 +2079,7 @@ const un = {
     mimeTypes: ["text/csv", "text/tab-separated-values", "text/plain"],
     canImport: !0,
     canExport: !1,
-    options: [...dn, ...S]
+    options: [...hn, ...S]
   },
   {
     id: "graphml",
@@ -2130,16 +2131,16 @@ const un = {
     canExport: !1,
     options: S
   }
-], Qn = [
+], er = [
   { id: "sif", reason: "No data source reads the Cytoscape simple interaction format." },
   { id: "cx2", reason: "No data source reads the Cytoscape Exchange format." }
 ];
-function er(t) {
-  return je.find((e) => e.id === t) ?? ln(t)?.descriptor;
-}
 function tr(t) {
+  return je.find((e) => e.id === t) ?? un(t)?.descriptor;
+}
+function nr(t) {
   const e = t.toLowerCase();
-  return [...je, ...cn()].filter(
+  return [...je, ...ln()].filter(
     (n) => n.extensions.includes(e)
   );
 }
@@ -2148,21 +2149,21 @@ const D = Z({
   idOf: (t) => t.descriptor.id,
   descriptorOf: (t) => t.descriptor,
   implementationOf: (t) => t.descriptor,
-  builtInIds: () => He
+  builtInIds: () => Ue
 });
-function pn(t, e) {
+function fn(t, e) {
   D.register(t, e);
 }
-function nr() {
+function rr() {
   return D.descriptors();
 }
-function rr(t) {
+function ir(t) {
   return D.byId(t);
 }
-function ir() {
+function sr() {
   D.clearForTesting();
 }
-const g = 3, fn = 1024;
+const g = 3, mn = 1024;
 function T(t, e) {
   if (!Number.isInteger(t) || t < 0)
     throw new RangeError(`ElementPositions: ${e} must be a non-negative integer, found ${String(t)}`);
@@ -2176,7 +2177,7 @@ class we {
    * Allocate the backing array, every row unplaced and unpinned.
    * @param capacity - rows to reserve before the first growth; a non-negative integer
    */
-  constructor(e = fn) {
+  constructor(e = mn) {
     this.components = g, this.rows = 0, T(e, "capacity");
     const n = Math.max(1, e);
     this.array = new Float32Array(g * n), this.array.fill(Number.NaN), this.pins = new Uint8Array(n);
@@ -2426,7 +2427,7 @@ class we {
     return g * e;
   }
 }
-const k = /* @__PURE__ */ new Map(), mn = Object.freeze([
+const k = /* @__PURE__ */ new Map(), gn = Object.freeze([
   "arf",
   "bfs",
   "bipartite",
@@ -2444,11 +2445,11 @@ const k = /* @__PURE__ */ new Map(), mn = Object.freeze([
   "spiral",
   "spring",
   "spring-electrical"
-]), gn = De.getLogger(["graphty", "layout"]), ve = 1e-6;
-function yn(t, e) {
+]), yn = De.getLogger(["graphty", "layout"]), ve = 1e-6;
+function bn(t, e) {
   return JSON.stringify([t, e]);
 }
-const bn = 10;
+const wn = 10;
 function Ne(t) {
   return new w({
     code: "E_DUPLICATE_PLUGIN",
@@ -2507,7 +2508,7 @@ const ie = class ie {
    * @param _nodes - the nodes that have just arrived
    */
   updatePositions(e) {
-    for (let n = 0; n < bn; n++) {
+    for (let n = 0; n < wn; n++) {
       if (this.isSettled)
         return;
       this.step();
@@ -2663,7 +2664,7 @@ const ie = class ie {
     for (const o of e) {
       const a = o.index >= 0 && o.index < r.length ? r[o.index] : 1;
       a !== 1 && (s = !0);
-      const l = yn(o.srcId, o.dstId);
+      const l = bn(o.srcId, o.dstId);
       i.set(l, (i.get(l) ?? 0) + a);
     }
     return s ? i : null;
@@ -2684,7 +2685,7 @@ const ie = class ie {
     let r = 0;
     for (const i of n.values())
       i < ve && r++;
-    r > 0 && gn.warn("Edge weights at or below zero were clamped before the layout read them", {
+    r > 0 && yn.warn("Edge weights at or below zero were clamped before the layout read them", {
       layout: e,
       clamped: r,
       epsilon: ve
@@ -2745,7 +2746,7 @@ const ie = class ie {
       });
     if (k.get(r) === e)
       return e;
-    const s = mn.includes(r);
+    const s = gn.includes(r);
     if (i === void 0) {
       if (!s)
         throw new w({
@@ -2767,7 +2768,7 @@ const ie = class ie {
         source: "registry",
         details: { kind: "layout", name: r, field: "descriptor.id", id: i.id }
       });
-    return pn({
+    return fn({
       descriptor: { ...i, honoursWeights: n.honoursWeights ?? !1 },
       type: r
     }), k.set(r, e), e;
@@ -2832,17 +2833,17 @@ const ie = class ie {
 };
 ie.honoursWeights = !1;
 let K = ie;
-const wn = j.looseObject({
+const vn = j.looseObject({
   scalingFactor: j.number().default(100)
 });
-class sr extends K {
+class or extends K {
   /**
    * Create a simple layout engine
    * @param opts - Configuration options including scalingFactor
    */
   constructor(e = {}) {
     super(), this._nodes = [], this._edges = [], this.stale = !0, this.positions = {}, this.scalingFactor = 100, this.isSettled = !0;
-    const n = wn.parse(e);
+    const n = vn.parse(e);
     this.scalingFactor = n.scalingFactor;
   }
   /**
@@ -3031,17 +3032,17 @@ class sr extends K {
    */
   publishedOr(e, n) {
     const r = { x: 0, y: 0, z: 0 };
-    return e !== void 0 && this.readNodePosition(e, r) ? r : vn(this.positions[n], this.scalingFactor);
+    return e !== void 0 && this.readNodePosition(e, r) ? r : Nn(this.positions[n], this.scalingFactor);
   }
 }
-function vn(t, e) {
+function Nn(t, e) {
   if (!t || t.length === 0)
     return { x: 0, y: 0, z: 0 };
   const n = t[0] * e, r = t[1] * e, i = (t[2] ?? 0) * e;
   return { x: n, y: r, z: i };
 }
-const Nn = /^#[0-9a-f]{6}$/i;
-function On(t) {
+const On = /^#[0-9a-f]{6}$/i;
+function kn(t) {
   if (typeof t != "string" || t.trim() === "")
     return null;
   try {
@@ -3049,20 +3050,20 @@ function On(t) {
     if (e === void 0)
       return null;
     const n = e.length === 9 ? e.slice(0, 7) : e;
-    return Nn.test(n) ? n.toUpperCase() : null;
+    return On.test(n) ? n.toUpperCase() : null;
   } catch {
     return null;
   }
 }
-function kn(t) {
+function Sn(t) {
   return JSON.stringify([t.id, t.kind, t.colors, t.capacity, t.colorblindSafe]);
 }
 const C = Z({
   kind: "palette",
   idOf: (t) => t.id,
   descriptorOf: (t) => t,
-  implementationOf: kn,
-  builtInIds: () => Ue
+  implementationOf: Sn,
+  builtInIds: () => He
 });
 function I(t, e, n) {
   throw new w({
@@ -3072,7 +3073,7 @@ function I(t, e, n) {
     details: { kind: "palette", name: typeof t == "string" ? t : "", field: e }
   });
 }
-function or(t, e) {
+function ar(t, e) {
   typeof t != "object" && I("", "descriptor", "registerPalette takes a palette descriptor"), (t.plainName === void 0 || t.plainName === "") && I(t.id, "plainName", `the palette "${String(t.id)}" was registered without a plain name`), t.kind !== "sequential" && t.kind !== "diverging" && t.kind !== "categorical" && I(
     t.id,
     "kind",
@@ -3080,7 +3081,7 @@ function or(t, e) {
   ), (!Array.isArray(t.colors) || t.colors.length === 0) && I(t.id, "colors", `the palette "${String(t.id)}" was registered with no colours`);
   const n = [];
   for (const i of t.colors) {
-    const s = On(i);
+    const s = kn(i);
     s === null && I(t.id, "colors", `"${String(i)}" in the palette "${String(t.id)}" is not a colour`), n.push(s);
   }
   const r = t.kind === "categorical" ? n.length : null;
@@ -3098,67 +3099,68 @@ function or(t, e) {
     e
   );
 }
-function ar() {
+function cr() {
   return C.descriptors();
 }
-function cr(t) {
+function lr(t) {
   return C.byId(t);
 }
-function lr() {
+function ur() {
   C.clearForTesting();
 }
 export {
-  M as A,
+  lr as $,
+  Kn as A,
   g as B,
   A as C,
-  Un as D,
+  Bn as D,
   we as E,
   je as F,
-  Pn as G,
-  Rn as H,
-  X as I,
-  $e as J,
-  Cn as K,
-  Jn as L,
+  $e as G,
+  Gn as H,
+  Pn as I,
+  _n as J,
+  Y as K,
+  Vn as L,
   $t as M,
-  zn as N,
-  _n as O,
-  Vn as P,
-  jn as Q,
-  Mn as R,
-  wn as S,
-  Dn as T,
-  Qn as U,
+  Mn as N,
+  zn as O,
+  qn as P,
+  Ln as Q,
+  jn as R,
+  vn as S,
+  Cn as T,
+  er as U,
   nn as V,
   tn as W,
-  yn as X,
-  ve as Y,
-  rr as Z,
-  cr as _,
+  bn as X,
+  sn as Y,
+  ve as Z,
+  ir as _,
   K as a,
-  sr as b,
-  Ln as c,
-  Zn as d,
-  ir as e,
-  lr as f,
-  Wn as g,
-  Gn as h,
+  or as b,
+  Dn as c,
+  Qn as d,
+  sr as e,
+  ur as f,
+  Jn as g,
+  Un as h,
   Hn as i,
-  Bn as j,
-  cn as k,
-  nr as l,
+  Wn as j,
+  ln as k,
+  rr as l,
   N as m,
   Xn as n,
-  $n as o,
-  ar as p,
-  Kn as q,
-  or as r,
-  qn as s,
-  er as t,
-  tr as u,
-  Yn as v,
-  q as w,
-  ee as x,
-  ut as y,
-  At as z
+  Rn as o,
+  cr as p,
+  Zn as q,
+  ar as r,
+  Yn as s,
+  q as t,
+  ee as u,
+  ut as v,
+  At as w,
+  P as x,
+  tr as y,
+  nr as z
 };