@graphty/graphty-element 2.4.1 → 2.5.1

package/dist/chunks/{GraphSession-PFm2tJ_j.js → GraphSession-DuAhRgCd.js}

@@ -1,17 +1,17 @@
-import { INVALID_INDEX as G, GraphBuilder as Xs, remapArray as Js } from "@graphty/graph-format";
+import { INVALID_INDEX as G, GraphBuilder as Js, remapArray as Zs } from "@graphty/graph-format";
 import { z as B } from "zod/v4";
-import { G as _, A as Zs, i as zt } from "./pluginRegistry-MaTIDh6l.js";
-import { g as eo, e as to, d as no } from "./NodeStyle-CtmA7dXi.js";
-import { E as so, P as it, n as at, g as oo, f as ro, e as io, F as ao } from "./paletteRegistry-jg9uS7wo.js";
-import { B as co, C as lo, t as me, g as et, a as as, l as cs, h as Ie, m as uo } from "./algorithms-B87OPYw4.js";
-import { q as ls, I as ho, J as xe, K as fo, M as mo, D as go, N as Zt, Q as en, k as po, j as bo, B as Lt, S as us, T as ke, U as Me, z as Ft, V as tt, W as vo, X as yo, Z as wo, _ as Oo, y as Eo, t as No, $ as So } from "./optionsFromZod-DHLLiX_8.js";
-import { S as ds, L as Ao, P as hs, p as be, k as Ut, d as Co, s as _o } from "./scales-BXHmwPXC.js";
-import { G as Io, a as To, L as Po } from "./GraphtyLogger-kbOx2zq3.js";
-import { l as fs } from "./types-C_c53VgR.js";
-import { f as $o } from "./sequential-Zym81qm7.js";
-import { i as tn } from "./interpolation-DY-PNpqX.js";
-import { a as ko } from "./registry-DQeq4B2K.js";
-const Mo = [
+import { G as _, A as eo, i as jt } from "./pluginRegistry-Bs8bEkz9.js";
+import { g as to, e as no, d as so } from "./NodeStyle-CtmA7dXi.js";
+import { E as oo, P as it, n as at, g as ro, f as io, e as ao, F as co } from "./paletteRegistry-Kt-6CeoN.js";
+import { B as lo, C as uo, t as me, g as et, a as as, l as cs, h as Ie, m as ho } from "./algorithms-D-ab-Auu.js";
+import { q as ls, I as fo, J as xe, K as mo, M as go, D as po, N as Jt, Q as Zt, k as bo, j as vo, B as zt, S as us, T as ke, U as Me, V as yo, z as Lt, W as tt, X as wo, Z as Oo, _ as Eo, $ as No, t as ds, a0 as So, y as Ao, a1 as Co } from "./optionsFromZod-B9RncoTX.js";
+import { S as hs, L as _o, P as fs, p as be, k as Ft, d as Io, s as To } from "./scales-CJCRwi2J.js";
+import { G as Po, a as $o, L as ko } from "./GraphtyLogger-DOTwCiMR.js";
+import { l as ms } from "./types-C_c53VgR.js";
+import { f as Mo } from "./sequential-Zym81qm7.js";
+import { i as en } from "./interpolation-DY-PNpqX.js";
+import { a as Ro } from "./registry-BdGvyZou.js";
+const Do = [
   "keep",
   "error",
   "first",
@@ -19,7 +19,7 @@ const Mo = [
   "sum",
   "min",
   "max"
-], Ro = ["canonical", "keep"], Do = B.strictObject({
+], xo = ["canonical", "keep"], jo = B.strictObject({
   nodeIdPath: B.string().default("id"),
   // What to CALL a node, as distinct from how to address it. A result card naming the busiest
   // node, a legend row and a ranked list all want a name a reader recognises, and an id is only
@@ -51,7 +51,7 @@ const Mo = [
   // the store, so `statistics().repeatedEdgeCount` is structurally pinned at zero and there is
   // no number anywhere that disagrees with the load. Keeping them changes edge counts on any
   // multigraph, which is a change a consumer can see, measure and turn off with one word.
-  repeatedEdges: B.enum(Mo).default("keep"),
+  repeatedEdges: B.enum(Do).default("keep"),
   // graph-format design 14.4 rule 10: the element default is "weight", which is what the io
   // importers write. DataManager reads this path first and falls back to the literal "value"
   // key, because "value" is what every weighted dataset, fixture and story in this repository
@@ -76,9 +76,9 @@ const Mo = [
   // node and "keep" does not. It is declared now because this is a strictObject: a config that
   // sets a key the schema has not declared is a parse ERROR, so the key has to exist here before
   // any config is allowed to carry it.
-  idCoercion: B.enum(Ro).default("canonical")
-}), Vt = B.string().trim().min(1), ms = B.strictObject({
-  algorithm: Vt,
+  idCoercion: B.enum(xo).default("canonical")
+}), Ut = B.string().trim().min(1), gs = B.strictObject({
+  algorithm: Ut,
   params: B.record(B.string(), B.unknown()).optional(),
   style: B.union([
     B.boolean(),
@@ -86,8 +86,8 @@ const Mo = [
   ]).optional(),
   seed: B.number().optional(),
   as: B.string().min(1).optional()
-}), xo = B.union([Vt, ms]);
-function Yu(e) {
+}), zo = B.union([Ut, gs]);
+function Qu(e) {
   if (!Array.isArray(e))
     throw new _({
       code: "E_BAD_COMMAND",
@@ -96,7 +96,7 @@ function Yu(e) {
       details: { value: e }
     });
   return e.map((t, n) => {
-    const s = typeof t == "object" && t !== null ? ms.safeParse(t) : Vt.safeParse(t);
+    const s = typeof t == "object" && t !== null ? gs.safeParse(t) : Ut.safeParse(t);
     if (!s.success) {
       const o = s.error.issues[0], r = o.path.length > 0 ? ` at "${o.path.join(".")}"` : "";
       throw new _({
@@ -109,27 +109,27 @@ function Yu(e) {
     return s.data;
   });
 }
-const jo = B.strictObject({
-  algorithms: B.array(xo).optional(),
-  knownFields: Do.prefault({}),
+const Lo = B.strictObject({
+  algorithms: B.array(zo).optional(),
+  knownFields: jo.prefault({}),
   // graph-format design 14.4 rule 1: under "auto" the builder starts directed and unlocked so a
   // file header can set the direction while the builder is still empty; an explicit boolean
   // calls lockDirected(). Record-pushed data never changes the direction.
   directed: B.union([B.boolean(), B.literal("auto")]).default("auto")
-}), zo = Io.getLogger(["graphty", "acceleration"]);
-function Lo(e) {
-  return Zs.find((t) => t === e.code);
+}), Fo = Po.getLogger(["graphty", "acceleration"]);
+function Uo(e) {
+  return eo.find((t) => t === e.code);
 }
-function Fo(e) {
+function Vo(e) {
   return e instanceof Error && (e.name === "AbortError" || e.name === "TimeoutError");
 }
-function Uo(e) {
+function Bo(e) {
   return e instanceof _ && e.code === "E_SOFTWARE_ONLY";
 }
-function Vo(e, t) {
+function qo(e, t) {
   return e.policy === t.policy && e.state === t.state && e.backend === t.backend && e.vendor === t.vendor && e.architecture === t.architecture && e.device === t.device && e.reason === t.reason && e.code === t.code;
 }
-class Bo {
+class Go {
   #i;
   #e = /* @__PURE__ */ new Set();
   #t;
@@ -164,7 +164,7 @@ class Bo {
    * @param options - The policy, the threshold, the registry and the recovery behaviour.
    */
   constructor(t = {}) {
-    this.#i = t.registry ?? ko, this.#n = t.exactMaxNodes, this.#p = t.recoverOnDeviceLoss ?? !0, this.#b = t.maxRecoveryAttempts ?? 3, this.#o = t.whileRunning, this.#s = t.policy ?? ls, this.#m = t.minNodes ?? ho, this.#E = t.minNodes !== void 0, this.#d = this.#s === "off" ? "off" : "probing", this.#g = this.#D(), this.#C = Object.freeze({ acceleration: this.#g }), this.#t = this.#i.onChange(() => {
+    this.#i = t.registry ?? Ro, this.#n = t.exactMaxNodes, this.#p = t.recoverOnDeviceLoss ?? !0, this.#b = t.maxRecoveryAttempts ?? 3, this.#o = t.whileRunning, this.#s = t.policy ?? ls, this.#m = t.minNodes ?? fo, this.#E = t.minNodes !== void 0, this.#d = this.#s === "off" ? "off" : "probing", this.#g = this.#D(), this.#C = Object.freeze({ acceleration: this.#g }), this.#t = this.#i.onChange(() => {
       this.#F();
     });
   }
@@ -367,11 +367,11 @@ class Bo {
         reason: `the ${s.name} accelerator does not implement "${t.capability}"`
       };
     }
-    const o = fo[t.capability];
+    const o = mo[t.capability];
     return o !== void 0 && !this.#E && !n && t.nodeCount < o ? {
       accelerated: !1,
-      reason: `the graph has ${String(t.nodeCount)} nodes, below the ${String(o)} at which an accelerated "${t.capability}" was measured to beat the CPU path (${mo}); set ${xe} to override`
-    } : { accelerated: !0, accelerator: s, precision: s.precision ?? go };
+      reason: `the graph has ${String(t.nodeCount)} nodes, below the ${String(o)} at which an accelerated "${t.capability}" was measured to beat the CPU path (${go}); set ${xe} to override`
+    } : { accelerated: !0, accelerator: s, precision: s.precision ?? po };
   }
   /**
    * Runs one piece of work on the accelerator when {@link plan} says it belongs there.
@@ -482,7 +482,7 @@ class Bo {
           source: "acceleration",
           details: { accelerator: o.name }
         });
-        s = Lo(i) ?? s, n.push(`${o.name}: ${i.message}`);
+        s = Uo(i) ?? s, n.push(`${o.name}: ${i.message}`);
       }
     return this.#l = n.join("; "), this.#u = s, !1;
   }
@@ -502,7 +502,7 @@ class Bo {
     try {
       return { accelerator: await t({ exactMaxNodes: n, acceptSoftware: !1 }), software: !1 };
     } catch (s) {
-      if (this.#s !== "required" || this.#a || !Uo(s))
+      if (this.#s !== "required" || this.#a || !Bo(s))
         throw s;
     }
     return { accelerator: await t({ exactMaxNodes: n, acceptSoftware: !0 }), software: !0 };
@@ -642,7 +642,7 @@ class Bo {
    * @returns The error to throw.
    */
   #U(t, n, s, o) {
-    if (Fo(t))
+    if (Vo(t))
       return t;
     const r = _.wrap(t, {
       code: "E_INTERNAL",
@@ -727,13 +727,13 @@ class Bo {
   #c(t, n, s) {
     this.#d = t, this.#l = n, this.#u = s;
     const o = this.#D();
-    if (!Vo(this.#g, o)) {
+    if (!qo(this.#g, o)) {
       this.#g = o, this.#C = Object.freeze({ acceleration: o });
       for (const r of [...this.#e])
         try {
           r(o);
         } catch (i) {
-          zo.error(
+          Fo.error(
             "An acceleration status listener threw",
             i instanceof Error ? i : new Error(String(i)),
             { state: o.state }
@@ -750,30 +750,30 @@ class Bo {
     return this.#y !== void 0 && (t.backend = this.#y), this.#f !== void 0 && (this.#f.vendor !== "" && (t.vendor = this.#f.vendor), this.#f.architecture !== "" && (t.architecture = this.#f.architecture), this.#f.description !== "" && (t.device = this.#f.description)), this.#l !== void 0 && (t.reason = this.#l), this.#u !== void 0 && (t.code = this.#u), Object.freeze(t);
   }
 }
-function qo(e) {
+function Wo(e) {
   return String(e);
 }
-function gs(e) {
+function ps(e) {
   if (!/^\d+$/.test(e))
     return G;
   const t = Number(e);
   return Number.isSafeInteger(t) ? t : G;
 }
-const nn = "graphty.importPosition", Go = "graphty.edgeId", Wo = "graphty.pinned";
-class Yo {
+const tn = "graphty.importPosition", Yo = "graphty.edgeId", Ho = "graphty.pinned";
+class Ko {
   /**
    * Build the empty store: one builder, one position array, the two element columns.
    * @param options - the store's configuration and its three freeze callbacks
    */
   constructor(t) {
-    this.positions = new so(), this.undirectedCache = /* @__PURE__ */ new WeakMap(), this.cache = null, this.cachedRevision = -1, this.revision = 0, this.edgeIdCounter = 0, this.pending = null, this.pendingPositions = null, this.publishing = !1, this.disposed = !1, this.seeded = 0, this.direction = { by: "unsettled", statedBy: null }, this.options = t, this.builder = new Xs({ directed: !0, addMissingNodes: !0 }), typeof t.directed == "boolean" && (this.direction = { by: "configuration", statedBy: null }, this.builder.setDirected(t.directed), this.builder.lockDirected()), this.seedColumn = this.builder.declareNodeColumn({
-      name: nn,
+    this.positions = new oo(), this.undirectedCache = /* @__PURE__ */ new WeakMap(), this.cache = null, this.cachedRevision = -1, this.revision = 0, this.edgeIdCounter = 0, this.pending = null, this.pendingPositions = null, this.publishing = !1, this.disposed = !1, this.seeded = 0, this.direction = { by: "unsettled", statedBy: null }, this.options = t, this.builder = new Js({ directed: !0, addMissingNodes: !0 }), typeof t.directed == "boolean" && (this.direction = { by: "configuration", statedBy: null }, this.builder.setDirected(t.directed), this.builder.lockDirected()), this.seedColumn = this.builder.declareNodeColumn({
+      name: tn,
       dtype: "f32",
       components: it,
       role: "position",
       mutable: !1
     }), this.edgeIdColumn = this.builder.declareEdgeColumn({
-      name: Go,
+      name: Yo,
       dtype: "u32",
       role: "id",
       unique: !0
@@ -930,7 +930,7 @@ class Yo {
       this.positions.view(n.nodeCount),
       { dtype: "f32", components: it, role: "position", mutable: !0 },
       { replaceRole: !0 }
-    ), n.nodes.set(Wo, this.positions.pinnedView(n.nodeCount), {
+    ), n.nodes.set(Ho, this.positions.pinnedView(n.nodeCount), {
       dtype: "u8",
       mutable: !0
     }), this.pendingPositions = null;
@@ -1028,7 +1028,7 @@ class Yo {
     return this.getSnapshot(), this.seeded;
   }
   seedUnplaced(t) {
-    const n = t.nodes.requireTyped(nn, "f32"), { data: s } = n, o = this.options.positionScale();
+    const n = t.nodes.requireTyped(tn, "f32"), { data: s } = n, o = this.options.positionScale();
     let r = 0;
     for (let i = 0; i < t.nodeCount; i++) {
       if (n.isSet(i) && r++, this.positions.isPlaced(i) || !n.isSet(i))
@@ -1039,7 +1039,7 @@ class Yo {
     this.seeded = r;
   }
 }
-const Ho = 1024, Y = 1, se = 0;
+const Qo = 1024, Y = 1, se = 0;
 function ct(e, t) {
   if (!Number.isInteger(e) || e < 0)
     throw new RangeError(`ElementMask: ${t} must be a non-negative integer, found ${String(e)}`);
@@ -1054,7 +1054,7 @@ class te {
    * @param capacity - Rows to reserve before the first growth; a non-negative integer.
    * @throws A `RangeError` when `capacity` is not a non-negative integer.
    */
-  constructor(t, n = Ho) {
+  constructor(t, n = Qo) {
     this.rows = 0, this.members = 0, this.revision = 0, this.cachedIds = null, this.cachedRevision = -1, this.cachedSpace = null, ct(n, "capacity"), this.readSpace = t, this.array = new Uint8Array(Math.max(1, n));
   }
   /**
@@ -1126,7 +1126,7 @@ class te {
    * @throws A `RangeError` when `count` is not a non-negative integer.
    */
   remap(t, n) {
-    ct(n, "count"), this.array = Js(this.array, t, n, se), this.rows = n, this.members = this.countMembers(), this.revision += 1;
+    ct(n, "count"), this.array = Zs(this.array, t, n, se), this.rows = n, this.members = this.countMembers(), this.revision += 1;
   }
   /**
    * Whether one row is in the set.
@@ -1305,32 +1305,32 @@ class te {
   }
 }
 const wt = /^[a-z][a-z0-9_-]*$/;
-function Hu(e) {
+function Xu(e) {
   return typeof e == "string" && wt.test(e);
 }
-const Ko = ["queued", "running", "succeeded", "failed", "canceled"], Qo = Object.freeze(["succeeded", "failed", "canceled"]);
-function Ku(e) {
-  return typeof e == "string" && Ko.includes(e);
+const Xo = ["queued", "running", "succeeded", "failed", "canceled"], Jo = Object.freeze(["succeeded", "failed", "canceled"]);
+function Ju(e) {
+  return typeof e == "string" && Xo.includes(e);
 }
 function Ot(e) {
-  return Qo.includes(e);
+  return Jo.includes(e);
 }
-const Qu = ["queued", "start", "progress", "end"], Xu = ["append", "replace", "now"], Xo = 16777619, Jo = 2166136261, Zo = 2646966556, sn = 7, on = 36;
-function rn(e, t) {
+const Zu = ["queued", "start", "progress", "end"], ed = ["append", "replace", "now"], Zo = 16777619, er = 2166136261, tr = 2646966556, nn = 7, sn = 36;
+function on(e, t) {
   let n = t >>> 0;
   for (let s = 0; s < e.length; s++)
-    n ^= e.charCodeAt(s), n = Math.imul(n, Xo) >>> 0;
+    n ^= e.charCodeAt(s), n = Math.imul(n, Zo) >>> 0;
   return n >>> 0;
 }
-function er(e) {
-  const t = rn(e, Jo).toString(on).padStart(sn, "0"), n = rn(e, Zo).toString(on).padStart(sn, "0");
+function nr(e) {
+  const t = on(e, er).toString(sn).padStart(nn, "0"), n = on(e, tr).toString(sn).padStart(nn, "0");
   return `${t}${n}`;
 }
-function tr(e) {
+function sr(e) {
   const t = Object.getPrototypeOf(e);
   return t === null || t === Object.prototype;
 }
-function nr(e) {
+function or(e) {
   return Number.isNaN(e) ? "NaN" : e === 0 ? "0" : String(e);
 }
 function ie(e) {
@@ -1341,7 +1341,7 @@ function ie(e) {
   if (typeof e == "string")
     return JSON.stringify(e);
   if (typeof e == "number")
-    return nr(e);
+    return or(e);
   if (typeof e == "boolean")
     return e ? "true" : "false";
   if (typeof e == "bigint")
@@ -1350,7 +1350,7 @@ function ie(e) {
     return `Date(${e.toISOString()})`;
   if (Array.isArray(e))
     return `[${e.map((t) => ie(t)).join(",")}]`;
-  if (typeof e == "object" && tr(e))
+  if (typeof e == "object" && sr(e))
     return `{${Object.entries(e).filter(([, n]) => n !== void 0).sort(([n], [s]) => n < s ? -1 : 1).map(([n, s]) => `${JSON.stringify(n)}:${ie(s)}`).join(",")}}`;
   throw new _({
     code: "E_BAD_COMMAND",
@@ -1359,7 +1359,7 @@ function ie(e) {
     details: { type: typeof e }
   });
 }
-function sr(e, t) {
+function rr(e, t) {
   const n = /* @__PURE__ */ new Map();
   for (const o of t)
     o.default !== void 0 && n.set(o.name, o.default);
@@ -1370,7 +1370,7 @@ function sr(e, t) {
     s[o] = n.get(o);
   return Object.freeze(s);
 }
-function or(e) {
+function ir(e) {
   const t = e.toLowerCase().replace(/[^a-z0-9_-]+/g, "-").replace(/^[^a-z]+/, "").replace(/[-_]+$/, "");
   return t === "" ? "run" : t;
 }
@@ -1385,9 +1385,9 @@ function Et(e) {
   });
 }
 function Ge(e) {
-  return `${or(e.algorithm)}_${er(Et(e))}`;
+  return `${ir(e.algorithm)}_${nr(Et(e))}`;
 }
-function rr(e) {
+function ar(e) {
   if (!wt.test(e))
     throw new _({
       code: "E_BAD_COMMAND",
@@ -1397,30 +1397,30 @@ function rr(e) {
     });
   return e;
 }
-const ir = 1e4, Nt = 16777619, ar = 461845907, cr = 3432918353, lr = 2166136261, ur = 2246822507, an = 8;
-function dr(e, t) {
+const cr = 1e4, Nt = 16777619, lr = 461845907, ur = 3432918353, dr = 2166136261, hr = 2246822507, rn = 8;
+function fr(e, t) {
   const n = typeof e == "number" ? `#${e}` : `$${e}`;
   let s = t >>> 0;
   for (let o = 0; o < n.length; o++)
     s ^= n.charCodeAt(o), s = Math.imul(s, Nt) >>> 0;
   return s >>> 0;
 }
-function cn(e, t) {
+function an(e, t) {
   let n = 0, s = 0;
   for (const o of e) {
-    const r = dr(o, t);
+    const r = fr(o, t);
     n = (n ^ r) >>> 0, s = s + r >>> 0;
   }
   return { count: e.length, xor: n, sum: s };
 }
-function ps(e, t) {
-  const n = cn(e, ar), s = cn(t, cr);
-  let o = lr, r = Nt;
+function bs(e, t) {
+  const n = an(e, lr), s = an(t, ur);
+  let o = dr, r = Nt;
   for (const i of [n.count, n.xor, n.sum, s.count, s.xor, s.sum])
-    o = Math.imul(o ^ i >>> 0, Nt) >>> 0, r = Math.imul(r ^ o + i, ur) >>> 0;
-  return o.toString(16).padStart(an, "0") + r.toString(16).padStart(an, "0");
+    o = Math.imul(o ^ i >>> 0, Nt) >>> 0, r = Math.imul(r ^ o + i, hr) >>> 0;
+  return o.toString(16).padStart(rn, "0") + r.toString(16).padStart(rn, "0");
 }
-function Bt(e) {
+function Vt(e) {
   return {
     indexOf: (t) => e.ids.indexOf(t),
     idOf: (t) => e.ids.idOf(t)
@@ -1430,12 +1430,12 @@ function Ee(e) {
   const t = e.edges.byRole("id");
   return {
     indexOf: (n) => {
-      const s = gs(n);
+      const s = ps(n);
       return s === G ? G : e.edgeIndexOf(s);
     },
     idOf: (n) => {
       const s = t !== null && t.isSet(n) ? t.value(n) : void 0;
-      return qo(typeof s == "number" ? s : G);
+      return Wo(typeof s == "number" ? s : G);
     }
   };
 }
@@ -1447,7 +1447,7 @@ function lt(e, t) {
     details: { scope: e, needs: t }
   });
 }
-function hr(e) {
+function mr(e) {
   return new _({
     code: "E_BAD_COMMAND",
     message: 'A scope is "visible", "graph", "selection", "largest-component", { set }, { where } or { nodes }.',
@@ -1455,21 +1455,21 @@ function hr(e) {
     details: { scope: e }
   });
 }
-function ln(e) {
+function cn(e) {
   return typeof e == "object" && "where" in e;
 }
-function fr(e) {
+function gr(e) {
   return typeof e == "string" ? e === "visible" || e === "graph" || e === "selection" || e === "largest-component" : typeof e != "object" || e === null ? !1 : "set" in e ? typeof e.set == "string" : "where" in e ? typeof e.where == "string" : "nodes" in e && Array.isArray(e.nodes);
 }
 function ut(e) {
-  if (!fr(e))
-    throw hr(e);
+  if (!gr(e))
+    throw mr(e);
 }
-function mr(e) {
+function pr(e) {
   const t = e.toLowerCase().replace(/[^a-z0-9]+/g, "-").replace(/^-+/, "").replace(/-+$/, "");
   return t === "" ? "set" : t;
 }
-function gr(e) {
+function br(e) {
   const t = /* @__PURE__ */ new Map();
   let n = 0, s = null, o = "";
   const r = () => {
@@ -1479,7 +1479,7 @@ function gr(e) {
     const d = e.snapshot(), p = r();
     return (s === null || s.graph !== d || p !== o) && (o = p, s = {
       graph: d,
-      nodeSpace: Bt(d),
+      nodeSpace: Vt(d),
       edgeSpace: Ee(d),
       nodes: /* @__PURE__ */ new Map(),
       resolved: /* @__PURE__ */ new Map()
@@ -1546,7 +1546,7 @@ function gr(e) {
     const { nodeSpace: $ } = O, A = new te(() => $, Math.max(1, O.graph.nodeCount));
     A.grow(O.graph.nodeCount);
     const S = l(d, A, /* @__PURE__ */ new Set()), j = { mask: A, edgeConstraint: S };
-    return ln(d) || O.nodes.set(p, j), j;
+    return cn(d) || O.nodes.set(p, j), j;
   }, h = (d, p, O, T) => !d.mask.has(O) || !d.mask.has(T) ? !1 : d.edgeConstraint === null || d.edgeConstraint.has(p), y = (d, p) => {
     const { edgeSpace: O, graph: T } = p, $ = new te(() => O, Math.max(1, T.edgeCount));
     $.grow(T.edgeCount);
@@ -1561,9 +1561,9 @@ function gr(e) {
     const $ = g(d), A = y($, O), S = $.mask.ids(), j = A.ids(), f = {
       nodes: new Set(S),
       edges: new Set(j),
-      digest: ps(S, j)
+      digest: bs(S, j)
     };
-    return ln(d) || O.resolved.set(p, f), f;
+    return cn(d) || O.resolved.set(p, f), f;
   }, F = (d, p) => {
     const O = p.edgeList();
     let T = 0;
@@ -1616,7 +1616,7 @@ function gr(e) {
     },
     count(d, p = {}) {
       ut(d);
-      const O = p.sample ?? ir;
+      const O = p.sample ?? cr;
       if (!Number.isInteger(O) || O <= 0)
         throw new _({
           code: "E_OPTION_RANGE",
@@ -1656,7 +1656,7 @@ function gr(e) {
           target: { kind: "scope", id: p.set },
           details: { scope: p, available: [...t.keys()] }
         });
-      const T = `set_${mr(O)}`;
+      const T = `set_${pr(O)}`;
       let $ = T, A = 2;
       for (; t.has($); )
         $ = `${T}_${A}`, A += 1;
@@ -1687,7 +1687,7 @@ function gr(e) {
     }
   };
 }
-const un = 1e3, pr = 5, bs = 256, br = 1, dn = 3, vr = "all", re = Object.freeze([]), ce = Object.freeze([]);
+const ln = 1e3, vr = 5, vs = 256, yr = 1, un = 3, wr = "all", re = Object.freeze([]), ce = Object.freeze([]);
 function Te(e, t) {
   return new _({
     code: "E_UNSUPPORTED",
@@ -1704,7 +1704,7 @@ function je(e) {
     details: { target: e }
   });
 }
-function vs(e, t, n) {
+function ys(e, t, n) {
   return new _({
     code: "E_OPTION_RANGE",
     message: `A selection's ${e} is ${n}, not ${String(t)}.`,
@@ -1718,7 +1718,7 @@ function le(e, t) {
     s !== G && e.add(s);
   }
 }
-function hn(e, t, n, s) {
+function dn(e, t, n, s) {
   if (t === void 0)
     return;
   if (e.scope === void 0)
@@ -1726,7 +1726,7 @@ function hn(e, t, n, s) {
   const o = e.scope.resolveNow(t), r = ee(e);
   le(r.nodes, o.nodes), le(r.edges, o.edges), n.intersect(r.nodes), s.intersect(r.edges);
 }
-function yr(e) {
+function Or(e) {
   const t = /^([A-Za-z_][\w.]*):/.exec(e);
   if (t === null)
     return { text: e, mode: "substring" };
@@ -1737,13 +1737,13 @@ function ee(e) {
   const { graph: t, nodeSpace: n, edgeSpace: s } = e, o = new te(() => n, Math.max(1, t.nodeCount)), r = new te(() => s, Math.max(1, t.edgeCount));
   return o.grow(t.nodeCount), r.grow(t.edgeCount), { nodes: o, edges: r };
 }
-function wr(e) {
+function Er(e) {
   return "neighborsOf" in e || "depth" in e || "direction" in e;
 }
-function Or(e) {
+function Nr(e) {
   return "nodes" in e || "edges" in e;
 }
-function Er(e, t, n) {
+function Sr(e, t, n) {
   const s = e.trim(), o = [e];
   s !== e && o.push(s), s !== "" && Number.isFinite(Number(s)) && o.push(Number(s));
   for (const r of o) {
@@ -1758,14 +1758,14 @@ function Er(e, t, n) {
   }
   return !1;
 }
-function Nr(e) {
+function Ar(e) {
   if (e === void 0)
-    return br;
-  if (!Number.isInteger(e) || e < 1 || e > dn)
-    throw vs("depth", e, `a whole number of steps from 1 to ${String(dn)}`);
+    return yr;
+  if (!Number.isInteger(e) || e < 1 || e > un)
+    throw ys("depth", e, `a whole number of steps from 1 to ${String(un)}`);
   return e;
 }
-function Sr(e, t, n, s, o) {
+function Cr(e, t, n, s, o) {
   const r = o !== "in" || !t.directed, a = t.directed && o !== "out" ? t.reverse() : null;
   let c = n;
   for (let l = 0; l < s && c.length > 0; l++) {
@@ -1781,8 +1781,8 @@ function Sr(e, t, n, s, o) {
     c = g;
   }
 }
-function Ar(e, t) {
-  const { nodes: n, edges: s } = ee(t), o = Nr(e.depth), r = [];
+function _r(e, t) {
+  const { nodes: n, edges: s } = ee(t), o = Ar(e.depth), r = [];
   if (e.neighborsOf === void 0)
     for (let i = 0; i < t.selectedNodes.count; i++)
       t.selectedNodes.has(i) && n.add(i) && r.push(i);
@@ -1791,9 +1791,9 @@ function Ar(e, t) {
       const a = n.indexOf(i);
       a !== G && n.add(a) && r.push(a);
     }
-  return Sr(n, t.graph, r, o, e.direction ?? vr), { nodes: n, edges: s, unmatched: re, unresolvedPaths: ce };
+  return Cr(n, t.graph, r, o, e.direction ?? wr), { nodes: n, edges: s, unmatched: re, unresolvedPaths: ce };
 }
-function Cr(e, t, n) {
+function Ir(e, t, n) {
   const s = e.fields.find((o) => o.name === t);
   if (s === void 0 || s.kind === "graph")
     throw new _({
@@ -1804,14 +1804,14 @@ function Cr(e, t, n) {
     });
   return s.kind;
 }
-function fn(e, t, n, s) {
+function hn(e, t, n, s) {
   const { results: o } = e;
   if (o === void 0)
     throw Te("a run's result", "a results registry");
   const { nodes: r, edges: i } = ee(e), a = o.get(t);
   if (a === void 0 || !o.has(t, n))
     return { nodes: r, edges: i, unmatched: re, unresolvedPaths: Object.freeze([o.path(t, n)]) };
-  const c = Cr(a, n, o.path(t, n));
+  const c = Ir(a, n, o.path(t, n));
   for (const l of s(a))
     if (c === "edge") {
       const g = i.indexOf(String(l.id));
@@ -1822,14 +1822,14 @@ function fn(e, t, n, s) {
     }
   return { nodes: r, edges: i, unmatched: re, unresolvedPaths: ce };
 }
-function ys(e, t) {
+function ws(e, t) {
   if (typeof e != "object" || e === null)
     throw je(e);
   if ("where" in e) {
     if (t.match === void 0)
       throw Te("a predicate", "a query engine");
     const { nodes: n, edges: s } = ee(t), o = t.match(e.where);
-    return le(n, o.nodes ?? []), le(s, o.edges ?? []), hn(t, e.scope, n, s), {
+    return le(n, o.nodes ?? []), le(s, o.edges ?? []), dn(t, e.scope, n, s), {
       nodes: n,
       edges: s,
       unmatched: re,
@@ -1839,11 +1839,11 @@ function ys(e, t) {
   if ("text" in e) {
     if (e.mode === void 0 && e.text.startsWith("=")) {
       const r = e.text.slice(1);
-      return ys(e.scope === void 0 ? { where: r } : { where: r, scope: e.scope }, t);
+      return ws(e.scope === void 0 ? { where: r } : { where: r, scope: e.scope }, t);
     }
     if (t.find === void 0)
       throw Te("a text search", "a search index");
-    const { nodes: n, edges: s } = ee(t), o = e.mode === void 0 ? yr(e.text) : { text: e.text, mode: e.mode };
+    const { nodes: n, edges: s } = ee(t), o = e.mode === void 0 ? Or(e.text) : { text: e.text, mode: e.mode };
     for (const r of t.find(o.text, o.mode))
       if (r.kind === "edge") {
         const i = s.indexOf(String(r.id));
@@ -1852,12 +1852,12 @@ function ys(e, t) {
         const i = n.indexOf(r.id);
         i !== G && n.add(i);
       }
-    return hn(t, e.scope, n, s), { nodes: n, edges: s, unmatched: re, unresolvedPaths: ce };
+    return dn(t, e.scope, n, s), { nodes: n, edges: s, unmatched: re, unresolvedPaths: ce };
   }
   if ("ids" in e) {
     const { nodes: n, edges: s } = ee(t), o = [];
     for (const r of e.ids)
-      Er(r, n, s) || o.push(r);
+      Sr(r, n, s) || o.push(r);
     return { nodes: n, edges: s, unmatched: Object.freeze(o), unresolvedPaths: ce };
   }
   if ("scope" in e) {
@@ -1868,13 +1868,13 @@ function ys(e, t) {
   }
   if ("top" in e) {
     const { run: n, field: s, n: o } = e.top;
-    return fn(t, n, s, (r) => r.top(s, o).entries);
+    return hn(t, n, s, (r) => r.top(s, o).entries);
   }
   if ("above" in e) {
     const { run: n, field: s, threshold: o } = e.above;
     if (!Number.isFinite(o))
-      throw vs("threshold", o, "a finite number");
-    return fn(
+      throw ys("threshold", o, "a finite number");
+    return hn(
       t,
       n,
       s,
@@ -1895,39 +1895,39 @@ function ys(e, t) {
     const { nodes: s, edges: o } = ee(t);
     return s.fill(), s.subtract(t.selectedNodes), o.fill(), o.subtract(t.selectedEdges), { nodes: s, edges: o, unmatched: re, unresolvedPaths: ce };
   }
-  if (wr(e))
-    return Ar(e, t);
-  if (Or(e)) {
+  if (Er(e))
+    return _r(e, t);
+  if (Nr(e)) {
     const { nodes: n, edges: s } = ee(t);
     return le(n, e.nodes ?? []), le(s, e.edges ?? []), { nodes: n, edges: s, unmatched: re, unresolvedPaths: ce };
   }
   throw je(e);
 }
-const ws = 5e3, mn = 1, _r = Object.freeze([]), Ir = Object.freeze([]), dt = Object.freeze(["replace", "add", "remove", "toggle", "intersect"]);
-function gn(e) {
-  return { graph: e, nodeSpace: Bt(e), edgeSpace: Ee(e) };
+const Os = 5e3, fn = 1, Tr = Object.freeze([]), Pr = Object.freeze([]), dt = Object.freeze(["replace", "add", "remove", "toggle", "intersect"]);
+function mn(e) {
+  return { graph: e, nodeSpace: Vt(e), edgeSpace: Ee(e) };
 }
-function Tr(e, t) {
+function $r(e, t) {
   if (typeof t == "number" && Number.isFinite(t) ? e.numbers.push(t) : e.nonNumeric = !0, e.tooMany)
     return;
   const n = String(t), s = e.counts.get(n);
-  if (s === void 0 && e.counts.size >= bs) {
+  if (s === void 0 && e.counts.size >= vs) {
     e.tooMany = !0, e.counts.clear();
     return;
   }
   e.counts.set(n, (s ?? 0) + 1);
 }
-function Pr() {
+function kr() {
   return { numbers: [], counts: /* @__PURE__ */ new Map(), nonNumeric: !1, tooMany: !1 };
 }
-function $r(e) {
+function Mr(e) {
   const t = [...e].map(([n, s]) => ({ value: n, count: s }));
   return t.sort((n, s) => s.count - n.count || n.value.localeCompare(s.value)), Object.freeze(t.map((n) => Object.freeze(n)));
 }
-function kr(e, t) {
+function Rr(e, t) {
   return e > t ? "above" : e < t ? "below" : "equal";
 }
-class Mr {
+class Dr {
   #i;
   #e;
   #t;
@@ -1950,7 +1950,7 @@ class Mr {
   constructor(t) {
     this.#i = t;
     const n = t.snapshot();
-    this.#n = gn(n), this.#e = new te(() => this.#n.nodeSpace, Math.max(1, n.nodeCount)), this.#t = new te(() => this.#n.edgeSpace, Math.max(1, n.edgeCount)), this.#e.grow(n.nodeCount), this.#t.grow(n.edgeCount);
+    this.#n = mn(n), this.#e = new te(() => this.#n.nodeSpace, Math.max(1, n.nodeCount)), this.#t = new te(() => this.#n.edgeSpace, Math.max(1, n.edgeCount)), this.#e.grow(n.nodeCount), this.#t.grow(n.edgeCount);
   }
   /**
    * The selected node ids, frozen and identity-stable.
@@ -2069,8 +2069,8 @@ class Mr {
    *   `E_OPTION_RANGE` when one of the target's options is outside the permitted range.
    */
   applyNow(t, n = "replace", s = "api") {
-    this.#o(), Dr(n);
-    const o = this.#m(), r = ys(t, this.#s()), i = this.#d();
+    this.#o(), jr(n);
+    const o = this.#m(), r = ws(t, this.#s()), i = this.#d();
     return n === "replace" && (this.#e.clear(), this.#t.clear()), n === "replace" || n === "add" ? (this.#e.union(r.nodes), this.#t.union(r.edges)) : n === "remove" ? (this.#e.subtract(r.nodes), this.#t.subtract(r.edges)) : n === "toggle" ? (this.#e.symmetricDifference(r.nodes), this.#t.symmetricDifference(r.edges)) : (this.#e.intersect(r.nodes), this.#t.intersect(r.edges)), this.#b = this.#E(o), this.#l(i, r.unmatched, r.unresolvedPaths, s);
   }
   /**
@@ -2080,7 +2080,7 @@ class Mr {
   clear() {
     this.#o();
     const t = this.#d();
-    return this.#e.clear(), this.#t.clear(), this.#b = !1, this.#l(t, _r, Ir, "api");
+    return this.#e.clear(), this.#t.clear(), this.#b = !1, this.#l(t, Tr, Pr, "api");
   }
   /**
    * Keep this selection under a name, as a saved scope over its nodes.
@@ -2140,7 +2140,7 @@ class Mr {
    */
   #o() {
     const t = this.#i.snapshot();
-    t !== this.#n.graph && (this.#n = gn(t)), this.#p = !1, this.#e.count !== t.nodeCount && this.#e.grow(t.nodeCount), this.#t.count !== t.edgeCount && this.#t.grow(t.edgeCount);
+    t !== this.#n.graph && (this.#n = mn(t)), this.#p = !1, this.#e.count !== t.nodeCount && this.#e.grow(t.nodeCount), this.#t.count !== t.edgeCount && this.#t.grow(t.edgeCount);
   }
   /**
    * What a target resolution reads.
@@ -2166,7 +2166,7 @@ class Mr {
    * @throws A `GraphtyError` coded `E_OPTION_RANGE` when the session's cap is not one.
    */
   #m() {
-    const t = this.#i.cap?.() ?? ws;
+    const t = this.#i.cap?.() ?? Os;
     if (!Number.isInteger(t) || t < 0)
       throw new _({
         code: "E_OPTION_RANGE",
@@ -2216,11 +2216,11 @@ class Mr {
   #l(t, n, s, o) {
     const r = [], i = [], { nodeSpace: a, edgeSpace: c } = this.#n;
     for (let g = 0; g < this.#e.count; g++) {
-      const h = g < t.nodes.length && t.nodes[g] === mn, y = this.#e.has(g);
+      const h = g < t.nodes.length && t.nodes[g] === fn, y = this.#e.has(g);
       y && !h ? r.push(a.idOf(g)) : h && !y && i.push(a.idOf(g));
     }
     for (let g = 0; g < this.#t.count; g++) {
-      const h = g < t.edges.length && t.edges[g] === mn, y = this.#t.has(g);
+      const h = g < t.edges.length && t.edges[g] === fn, y = this.#t.has(g);
       y && !h ? r.push(c.idOf(g)) : h && !y && i.push(c.idOf(g));
     }
     const l = Object.freeze({
@@ -2257,7 +2257,7 @@ class Mr {
           if (g == null)
             continue;
           let h = s.get(l);
-          h === void 0 && (h = Pr(), s.set(l, h)), Tr(h, g);
+          h === void 0 && (h = kr(), s.set(l, h)), $r(h, g);
         }
     }
     const o = /* @__PURE__ */ new Set();
@@ -2265,7 +2265,7 @@ class Mr {
       !c.nonNumeric && c.numbers.length > 0 && o.add(a);
     const r = this.#y(t, o), i = [];
     for (const [a, c] of s)
-      i.push(Object.freeze(Rr(a, c, r.get(a))));
+      i.push(Object.freeze(xr(a, c, r.get(a))));
     return Object.freeze(i);
   }
   /**
@@ -2292,11 +2292,11 @@ class Mr {
     return s;
   }
 }
-function Rr(e, t, n) {
+function xr(e, t, n) {
   const s = { path: `data.${e}`, plainName: e };
   if (t.nonNumeric || t.numbers.length === 0)
-    return t.tooMany ? s : { ...s, distribution: $r(t.counts) };
-  const o = Zt(en(t.numbers)), r = Zt(en(n ?? t.numbers));
+    return t.tooMany ? s : { ...s, distribution: Mr(t.counts) };
+  const o = Jt(Zt(t.numbers)), r = Jt(Zt(n ?? t.numbers));
   return {
     ...s,
     mean: o.mean,
@@ -2304,10 +2304,10 @@ function Rr(e, t, n) {
     min: o.min,
     max: o.max,
     graphMean: r.mean,
-    direction: kr(o.mean, r.mean)
+    direction: Rr(o.mean, r.mean)
   };
 }
-function Dr(e) {
+function jr(e) {
   if (!dt.includes(e))
     throw new _({
       code: "E_BAD_COMMAND",
@@ -2316,10 +2316,10 @@ function Dr(e) {
       details: { op: e, available: dt }
     });
 }
-function xr(e) {
-  return new Mr(e);
+function zr(e) {
+  return new Dr(e);
 }
-const Ju = Object.freeze({
+const td = Object.freeze({
   /** Above this node count the element draws less visual detail. A shipped default, not measured. */
   largeGraphThreshold: 1e4,
   /**
@@ -2328,7 +2328,7 @@ const Ju = Object.freeze({
    */
   renderCeiling: 5e4,
   /** The most elements one selection will hold before it refuses to grow. A shipped default, not measured. */
-  selectionCap: ws,
+  selectionCap: Os,
   /**
    * The most edges the element will hold. Enforced: a load past it fails with `E_TOO_LARGE`.
    * Measured once (see the file comment), on one machine; not this machine's figure.
@@ -2341,7 +2341,7 @@ const Ju = Object.freeze({
    */
   approximateAboveNodes: 2e3
 });
-function jr(e) {
+function Lr(e) {
   const t = /* @__PURE__ */ new Map();
   for (const n of e) {
     const s = t.get(n.algorithm);
@@ -2349,8 +2349,8 @@ function jr(e) {
   }
   return t;
 }
-function zr(e) {
-  const t = jr(e.runs());
+function Fr(e) {
+  const t = Lr(e.runs());
   return Object.freeze(
     e.algorithms().map((n) => {
       const s = e.estimate(n.key), o = t.get(n.key) ?? [];
@@ -2375,7 +2375,7 @@ function Ne(e) {
   let t = null;
   return (n) => n.length === 0 ? e : (t?.from !== n && (t = { from: n, list: Object.freeze([...e, ...n]) }), t.list);
 }
-const Lr = Ne(co), Fr = Ne(lo), Ur = Ne(ao), Vr = Ne(Ao), Br = Ne(Po), qr = Ne(hs), We = Object.freeze({
+const Ur = Ne(lo), Vr = Ne(uo), Br = Ne(co), qr = Ne(_o), Gr = Ne(ko), Wr = Ne(fs), We = Object.freeze({
   /**
    * Every algorithm that can be run: the element's own, plus whatever was registered.
    *
@@ -2387,41 +2387,41 @@ const Lr = Ne(co), Fr = Ne(lo), Ur = Ne(ao), Vr = Ne(Ao), Br = Ne(Po), qr = Ne(h
    * summary, a reading, and the styling derived from a result's shape.
    * @returns the algorithm descriptors, the element's own first
    */
-  algorithms: () => Lr(bo()),
+  algorithms: () => Ur(vo()),
   /**
    * Every camera view the viewer can be put in: the element's own five, plus whatever was
    * registered.
    * @returns the camera descriptors, the element's own first
    */
-  cameras: () => Fr(po()),
+  cameras: () => Vr(bo()),
   /**
    * Every file format the element can read, plus whatever was registered.
    * @returns the format descriptors, the element's own first
    */
-  formats: () => Ur(io()),
+  formats: () => Br(ao()),
   /**
    * Every layout a graph can be arranged with: the element's own, plus whatever was registered.
    * @returns the layout descriptors, the element's own first
    */
-  layouts: () => Vr(ro()),
+  layouts: () => qr(io()),
   /**
    * Every destination log records can be delivered to, plus whatever was registered.
    * @returns the log destination descriptors, the element's own first
    */
-  logSinks: () => Br(To()),
+  logSinks: () => Gr($o()),
   /**
    * Every colour palette a layer can paint with: the element's own seventeen, plus whatever was
    * registered.
    * @returns the palette descriptors, the element's own first
    */
-  palettes: () => qr(oo()),
+  palettes: () => Wr(ro()),
   /**
    * Every scale the element ships. Static, because a scale is internal and nothing registers one.
    * @returns the scale descriptors
    */
-  scales: () => ds
+  scales: () => hs
 });
-function Gr(e) {
+function Yr(e) {
   return Object.freeze({
     ...We,
     /**
@@ -2429,29 +2429,29 @@ function Gr(e) {
      * whether it has been run.
      * @returns one entry per algorithm, in catalogue order
      */
-    metrics: () => zr(e)
+    metrics: () => Fr(e)
   });
 }
-const Wr = Object.freeze({
+const Hr = Object.freeze({
   linearElementsPerSecond: 1e6,
   iterativeElementsPerSecond: 3e6,
   heavyPairsPerSecond: 5e6,
   cubicOperationsPerSecond: 2e7
-}), ht = 10, pn = 100, bn = "maxIterations", Yr = 1 / 60, Ye = 2 ** 32 - 1, vn = 8, Hr = 1024;
+}), ht = 10, gn = 100, pn = "maxIterations", Kr = 1 / 60, Ye = 2 ** 32 - 1, bn = 8, Qr = 1024;
 function ge(e) {
   return typeof e == "number" && Number.isFinite(e) && e >= 0;
 }
 function J(e) {
   return Number.isFinite(e) ? String(Math.round(e)).replace(/\B(?=(\d{3})+(?!\d))/g, ",") : "unknown";
 }
-function Kr(e, t) {
-  const n = t?.[bn];
+function Xr(e, t) {
+  const n = t?.[pn];
   if (typeof n == "number" && Number.isFinite(n) && n > 0)
     return n;
-  const o = e?.options.find((r) => r.name === bn)?.default;
+  const o = e?.options.find((r) => r.name === pn)?.default;
   return typeof o == "number" && Number.isFinite(o) && o > 0 ? o : void 0;
 }
-function Qr(e, t, n) {
+function Jr(e, t, n) {
   const { requires: s } = e;
   if (s !== void 0) {
     if (s.directed === !0 && t.directedness === "undirected")
@@ -2466,7 +2466,7 @@ function Qr(e, t, n) {
       return "Needs hardware acceleration, and no accelerator is attached.";
   }
 }
-function yn(e, t, n, s) {
+function vn(e, t, n, s) {
   switch (e) {
     case "instant":
       return t + n;
@@ -2484,7 +2484,7 @@ function yn(e, t, n, s) {
     }
   }
 }
-const Os = {
+const Es = {
   /* One BFS per source, so n(n + m), where betweenness' class term is n * m. Measured 20M to 57M
      n(n + m) per second across random (m = 1.2n to 50n), scale-free, grid, path, tree, star and
      clique-ring graphs of 400 to 1,600 nodes, and 15.5M on the sparsest in a loaded vitest
@@ -2525,7 +2525,7 @@ const Os = {
     seconds: (e, t, n, s) => (e + t) * (Math.log2(Math.max(2, e + t)) / 6.5 + s / 35) / n.iterativeElementsPerSecond
   }
 };
-function Xr(e, t) {
+function Zr(e, t) {
   switch (e) {
     case "instant":
       return t.linearElementsPerSecond;
@@ -2543,7 +2543,7 @@ function Xr(e, t) {
     }
   }
 }
-function Jr(e, t) {
+function ei(e, t) {
   switch (e) {
     case "instant":
       return "n + m";
@@ -2573,7 +2573,7 @@ function ft(e, t, n, s) {
   };
   return Object.freeze(s ? o : { ...o, reason: n });
 }
-function Zr(e, t, n, s, o) {
+function ti(e, t, n, s, o) {
   if (!ge(e.seconds) || !ge(e.nodes) || !ge(e.edges))
     return;
   const r = t(e.nodes, e.edges, e.iterations ?? s);
@@ -2601,7 +2601,7 @@ function Re(e) {
       "The graph's size is not known yet, so nothing can be estimated.",
       !0
     );
-  const g = Qr(t, n, e.acceleratorAvailable ?? !1), h = `n=${J(c)} m=${J(l)}`;
+  const g = Jr(t, n, e.acceleratorAvailable ?? !1), h = `n=${J(c)} m=${J(l)}`;
   if (g !== void 0)
     return Object.freeze({
       seconds: Number.POSITIVE_INFINITY,
@@ -2620,7 +2620,7 @@ function Re(e) {
       `${h}; this algorithm's running time cannot be bounded before it runs.`,
       !0
     );
-  const y = Kr(t, e.params), P = y ?? pn, F = e.sample === void 0 || c === 0 ? 1 : Math.min(1, Math.max(0, e.sample / c)), U = Lt(t.key)?.costUnits, w = U?.(c, l), N = w !== void 0 && ge(w) ? w : void 0, d = a === "iterative" && y === void 0 && N === void 0, p = (N ?? yn(a, c, l, P)) * F, O = N !== void 0 && U !== void 0 ? (I, C) => U(I, C) : (I, C, v) => yn(a, I, C, v), T = r?.get(e.algorithm), A = (T === void 0 ? void 0 : Zr(T, O, p, P, o?.machine)) ?? ei(
+  const y = Xr(t, e.params), P = y ?? gn, F = e.sample === void 0 || c === 0 ? 1 : Math.min(1, Math.max(0, e.sample / c)), U = zt(t.key)?.costUnits, w = U?.(c, l), N = w !== void 0 && ge(w) ? w : void 0, d = a === "iterative" && y === void 0 && N === void 0, p = (N ?? vn(a, c, l, P)) * F, O = N !== void 0 && U !== void 0 ? (I, C) => U(I, C) : (I, C, v) => vn(a, I, C, v), T = r?.get(e.algorithm), A = (T === void 0 ? void 0 : ti(T, O, p, P, o?.machine)) ?? ni(
     t,
     a,
     c,
@@ -2632,20 +2632,20 @@ function Re(e) {
     N !== void 0
   ), S = d && A.confidence !== "modelled" ? "modelled" : A.confidence, j = Number.isFinite(A.seconds) && A.seconds >= 0 ? A.seconds : Number.POSITIVE_INFINITY, f = [
     h,
-    N === void 0 ? Os[t.key]?.term(P) ?? Jr(a, P) : "the algorithm's own work units"
+    N === void 0 ? Es[t.key]?.term(P) ?? ei(a, P) : "the algorithm's own work units"
   ];
-  return e.sample !== void 0 && f.push(`sampled at ${J(e.sample)} of ${J(c)} nodes`), s !== void 0 && s.exact === !1 && f.push("sizes scaled from the whole graph rather than counted"), d && f.push(`no iteration bound is declared, so ${J(pn)} is assumed`), f.push(A.provenance), Object.freeze({
+  return e.sample !== void 0 && f.push(`sampled at ${J(e.sample)} of ${J(c)} nodes`), s !== void 0 && s.exact === !1 && f.push("sizes scaled from the whole graph rather than counted"), d && f.push(`no iteration bound is declared, so ${J(gn)} is assumed`), f.push(A.provenance), Object.freeze({
     seconds: j,
     confidence: S,
     costClass: a,
-    blocksFrame: !i && j > Yr,
+    blocksFrame: !i && j > Kr,
     cancellable: i,
     available: !0,
     basis: f.join("; ")
   });
 }
-function ei(e, t, n, s, o, r, i, a, c) {
-  const l = c ? void 0 : Lt(e.key)?.cost ?? e.cost;
+function ni(e, t, n, s, o, r, i, a, c) {
+  const l = c ? void 0 : zt(e.key)?.cost ?? e.cost;
   if (l !== void 0) {
     const U = l(n, s);
     if (ge(U))
@@ -2655,14 +2655,14 @@ function ei(e, t, n, s, o, r, i, a, c) {
         provenance: "the algorithm's own declared cost model"
       };
   }
-  const g = a !== void 0 && a.basis === "probe", h = a?.rates ?? Wr, y = Xr(t, h);
+  const g = a !== void 0 && a.basis === "probe", h = a?.rates ?? Hr, y = Zr(t, h);
   if (!Number.isFinite(y) || y <= 0)
     return {
       seconds: Number.POSITIVE_INFINITY,
       confidence: "unknown",
       provenance: "no throughput is known for this cost class"
     };
-  const P = Os[e.key], F = P === void 0 || c ? o / y : P.seconds(n, s, h, r) * i;
+  const P = Es[e.key], F = P === void 0 || c ? o / y : P.seconds(n, s, h, r) * i;
   return g ? {
     seconds: F,
     confidence: "calibrated",
@@ -2673,33 +2673,33 @@ function ei(e, t, n, s, o, r, i, a, c) {
     provenance: a === void 0 ? "built-in rates; this device has not been calibrated" : `built-in rates; the calibration of ${a.at} could not measure this device`
   };
 }
-const ti = 30, ni = 512 * 1024 * 1024, Es = Object.freeze({
-  exactComputationSeconds: ti,
-  runColumnBudgetBytes: ni
+const si = 30, oi = 512 * 1024 * 1024, Ns = Object.freeze({
+  exactComputationSeconds: si,
+  runColumnBudgetBytes: oi
 });
-function si(e, t, n) {
+function ri(e, t, n) {
   let s = 0;
   for (const o of e.fields)
     switch (o.kind) {
       case "node":
-        s += t * vn;
+        s += t * bn;
         break;
       case "edge":
-        s += n * vn;
+        s += n * bn;
         break;
       case "graph":
-        s += Hr;
+        s += Qr;
         break;
     }
   return s;
 }
-function oi(e, t) {
+function ii(e, t) {
   if (e > Ye)
     return { kind: "nodes", count: e };
   if (t > Ye)
     return { kind: "edges", count: t };
 }
-function ri(e, t, n) {
+function ai(e, t, n) {
   const { largestSize: s } = t.components;
   if (t.components.count <= 1 || s <= 0 || t.nodeCount <= 0)
     return [];
@@ -2715,7 +2715,7 @@ function ri(e, t, n) {
     })
   ]);
 }
-function ii(e, t) {
+function ci(e, t) {
   const { statistics: n } = e, s = n.nodeCount;
   if (s <= 0)
     return;
@@ -2733,13 +2733,13 @@ function ii(e, t) {
   }
   return { nodes: i, edges: Math.round(i * o) };
 }
-function ai(e, t = {}) {
-  const n = t.limits ?? Es, s = n.exactComputationSeconds, { descriptor: o, statistics: r } = e, i = e.scope?.nodes ?? r.nodeCount, a = e.scope?.edges ?? r.edgeCount;
+function li(e, t = {}) {
+  const n = t.limits ?? Ns, s = n.exactComputationSeconds, { descriptor: o, statistics: r } = e, i = e.scope?.nodes ?? r.nodeCount, a = e.scope?.edges ?? r.edgeCount;
   if (t.exact === !0 && (t.sample ?? e.sample) !== void 0)
     return he("E_BAD_COMMAND", "A run cannot be both exact and sampled.", {
       fields: ["exact", "sample"]
     });
-  if (o === void 0 && fs(e.algorithm))
+  if (o === void 0 && ms(e.algorithm))
     return he(
       "E_UNSUPPORTED",
       `The "${e.algorithm}" algorithm is not implemented. The name is deprecated and will be removed at the next major release unless it is implemented first.`,
@@ -2749,14 +2749,14 @@ function ai(e, t = {}) {
     return he("E_UNKNOWN_ALGORITHM", `No algorithm is registered under "${e.algorithm}".`, {
       algorithm: e.algorithm
     });
-  const c = oi(i, a);
+  const c = ii(i, a);
   if (c !== void 0)
     return he(
       "E_TOO_LARGE",
       `This graph has ${J(c.count)} ${c.kind}, past the ${J(Ye)} a result column can hold. No scope or sample changes that.`,
       { limit: Ye, count: c.count, of: c.kind, graph: { nodes: i, edges: a } }
     );
-  const l = si(o, i, a);
+  const l = ri(o, i, a);
   if (l > n.runColumnBudgetBytes)
     return he(
       "E_OUT_OF_MEMORY",
@@ -2772,7 +2772,7 @@ function ai(e, t = {}) {
   if (h === void 0 && g.seconds <= s)
     return { kind: "exact", estimate: g };
   const { approximable: y } = o;
-  return y !== void 0 && t.exact !== !0 ? ci(
+  return y !== void 0 && t.exact !== !0 ? ui(
     e,
     g,
     y,
@@ -2790,12 +2790,12 @@ function ai(e, t = {}) {
       graph: { nodes: i, edges: a },
       approximable: y !== void 0,
       exactRequested: t.exact === !0,
-      scopes: ri(e, r, s),
-      fitsUpTo: ii(e, s)
+      scopes: ai(e, r, s),
+      fitsUpTo: ci(e, s)
     }
   );
 }
-function ci(e, t, n, s, o) {
+function ui(e, t, n, s, o) {
   const r = Re({ ...e, sample: s }), i = e.scope?.nodes ?? e.statistics.nodeCount, a = [
     `Sampled rather than exact: ${n.plainName} over ${J(s)} of ${J(i)} nodes.`
   ];
@@ -2820,7 +2820,7 @@ function he(e, t, n) {
     error: new _({ code: e, message: t, source: "run", details: n })
   };
 }
-function li(e) {
+function di(e) {
   if (e == null)
     return null;
   switch (typeof e) {
@@ -2834,22 +2834,22 @@ function li(e) {
       return "mixed";
   }
 }
-function ui(e, t) {
-  const n = li(t);
-  n !== null && (e.present++, e.types.add(n), typeof t == "number" && (e.min = Math.min(e.min, t), e.max = Math.max(e.max, t)), e.samples.length < pr && e.samples.push(t), e.unique !== null && (e.unique.add(t), e.unique.size > bs && (e.unique = null)));
+function hi(e, t) {
+  const n = di(t);
+  n !== null && (e.present++, e.types.add(n), typeof t == "number" && (e.min = Math.min(e.min, t), e.max = Math.max(e.max, t)), e.samples.length < vr && e.samples.push(t), e.unique !== null && (e.unique.add(t), e.unique.size > vs && (e.unique = null)));
 }
-function di(e) {
+function fi(e) {
   if (e.size === 1) {
     const [t] = e;
     return t;
   }
   return e.size === 2 && e.has("integer") && e.has("number") ? "number" : "mixed";
 }
-function hi(e, t) {
+function mi(e, t) {
   return e.unique === null || t === 0 ? !1 : e.unique.size <= Math.max(2, Math.sqrt(t));
 }
-function wn(e, t, n, s) {
-  const o = di(n.types), r = o === "number" || o === "integer", i = o === "string" && hi(n, s) ? "category" : o;
+function yn(e, t, n, s) {
+  const o = fi(n.types), r = o === "number" || o === "integer", i = o === "string" && mi(n, s) ? "category" : o;
   return Object.freeze({
     path: `data.${e}`,
     token: `[${e}]`,
@@ -2865,7 +2865,7 @@ function wn(e, t, n, s) {
     sampleValues: Object.freeze([...n.samples])
   });
 }
-function On(e, t) {
+function wn(e, t) {
   const n = /* @__PURE__ */ new Map();
   for (let s = 0; s < e; s++) {
     const o = t(s);
@@ -2879,22 +2879,22 @@ function On(e, t) {
           min: Number.POSITIVE_INFINITY,
           max: Number.NEGATIVE_INFINITY,
           samples: []
-        }, n.set(r, i)), ui(i, o[r]);
+        }, n.set(r, i)), hi(i, o[r]);
       }
   }
   return n;
 }
-function fi(e, t) {
+function gi(e, t) {
   if (t === null)
     return Object.freeze([]);
-  const n = On(e.nodeCount, (r) => t.nodeAttributes(r, e.ids.idOf(r))), s = On(e.edgeCount, (r) => t.edgeAttributes(r)), o = [];
+  const n = wn(e.nodeCount, (r) => t.nodeAttributes(r, e.ids.idOf(r))), s = wn(e.edgeCount, (r) => t.edgeAttributes(r)), o = [];
   for (const [r, i] of n)
-    o.push(wn(r, "node", i, e.nodeCount));
+    o.push(yn(r, "node", i, e.nodeCount));
   for (const [r, i] of s)
-    o.push(wn(r, "edge", i, e.edgeCount));
+    o.push(yn(r, "edge", i, e.edgeCount));
   return Object.freeze(o);
 }
-function mi(e) {
+function pi(e) {
   const { nodeCount: t, rowPtr: n, colIdx: s } = e, o = new Int32Array(t).fill(-1);
   if (t === 0)
     return { labels: o, count: 0 };
@@ -2920,17 +2920,17 @@ function mi(e) {
   }
   return { labels: o, count: a };
 }
-function gi(e, t, n) {
+function bi(e, t, n) {
   const s = new Uint32Array(n);
   for (const c of t)
     s[c]++;
   let o = 0, r = 0;
   for (const c of s)
     c > o && (o = c), c === 1 && r++;
-  const i = Array.from(s).sort((c, l) => l - c), a = i.length > un;
+  const i = Array.from(s).sort((c, l) => l - c), a = i.length > ln;
   return {
     count: n,
-    sizes: Object.freeze(a ? i.slice(0, un) : i),
+    sizes: Object.freeze(a ? i.slice(0, ln) : i),
     largestSize: o,
     isolatedCount: r,
     truncatedSizes: a,
@@ -2940,7 +2940,7 @@ function gi(e, t, n) {
     }
   };
 }
-function pi(e) {
+function vi(e) {
   const { nodeCount: t, rowPtr: n, colIdx: s, directed: o } = e;
   let r = 0, i = 0;
   for (let a = 0; a < t; a++) {
@@ -2950,7 +2950,7 @@ function pi(e) {
   }
   return o ? r + i : r / 2 + i;
 }
-function bi(e) {
+function yi(e) {
   if (e.length === 0)
     return { range: [0, 0], mean: 0 };
   let t = e[0], n = e[0], s = 0;
@@ -2958,7 +2958,7 @@ function bi(e) {
     o < t && (t = o), o > n && (n = o), s += o;
   return { range: [t, n], mean: s / e.length };
 }
-function vi(e) {
+function wi(e) {
   const { weights: t } = e;
   if (t === null)
     return !1;
@@ -2967,33 +2967,33 @@ function vi(e) {
       return !0;
   return !1;
 }
-function yi(e) {
+function Oi(e) {
   const { nodeCount: t, edgeCount: n, selfLoopCount: s, directed: o } = e;
   if (t < 2)
     return 0;
   const r = t * (t - 1), i = o ? r : r / 2;
   return Math.max(0, n - s) / i;
 }
-function wi(e, t) {
+function Ei(e, t) {
   return t === "auto" && e.nodeCount === 0 && e.edgeCount === 0 ? "unknown" : e.directed ? "directed" : "undirected";
 }
-function Oi(e, t, n) {
-  const { labels: s, count: o } = mi(e), r = bi(e.degree());
+function Ni(e, t, n) {
+  const { labels: s, count: o } = pi(e), r = yi(e.degree());
   return Object.freeze({
     nodeCount: e.nodeCount,
     edgeCount: e.edgeCount,
-    density: yi(e),
-    directedness: wi(e, t),
+    density: Oi(e),
+    directedness: Ei(e, t),
     directednessSource: Object.freeze(n),
-    weighted: vi(e),
+    weighted: wi(e),
     selfLoopCount: e.selfLoopCount,
-    repeatedEdgeCount: pi(e),
+    repeatedEdgeCount: vi(e),
     degreeRange: Object.freeze(r.range),
     meanDegree: r.mean,
-    components: Object.freeze(gi(e, s, o))
+    components: Object.freeze(bi(e, s, o))
   });
 }
-function Ei(e) {
+function Si(e) {
   let t = 2166136261, n = 16777619;
   const s = (o) => {
     t = Math.imul(t ^ o >>> 0, 16777619) >>> 0, n = Math.imul(n ^ t + o, 2246822507) >>> 0;
@@ -3015,7 +3015,7 @@ function Ei(e) {
     s(e.colIdx[o]);
   return t.toString(16).padStart(8, "0") + n.toString(16).padStart(8, "0");
 }
-class Ni {
+class Ai {
   /**
    * Build the data surface.
    * @param store - the store to read
@@ -3062,7 +3062,7 @@ class Ni {
    * @throws A `GraphtyError` with `E_DISPOSED` when the session has been disposed.
    */
   edge(t) {
-    const n = this.snapshot(), s = gs(t), o = s === G ? G : n.edgeIndexOf(s);
+    const n = this.snapshot(), s = ps(t), o = s === G ? G : n.edgeIndexOf(s);
     if (o !== G)
       return Object.freeze({
         ...this.records?.edgeAttributes(o),
@@ -3086,7 +3086,7 @@ class Ni {
    */
   attributes() {
     const t = this.derivedFor(this.snapshot());
-    return t.attributes ??= fi(t.snapshot, this.records), t.attributes;
+    return t.attributes ??= gi(t.snapshot, this.records), t.attributes;
   }
   /**
    * The graph's shape.
@@ -3095,7 +3095,7 @@ class Ni {
    */
   statistics() {
     const t = this.derivedFor(this.snapshot());
-    return t.statistics ??= Oi(t.snapshot, this.readConfig().directed, this.store.directionSettledBy), t.statistics;
+    return t.statistics ??= Ni(t.snapshot, this.readConfig().directed, this.store.directionSettledBy), t.statistics;
   }
   /**
    * A stable identity for the graph's topology.
@@ -3104,7 +3104,7 @@ class Ni {
    */
   fingerprint() {
     const t = this.derivedFor(this.snapshot());
-    return t.fingerprint ??= Ei(t.snapshot), t.fingerprint;
+    return t.fingerprint ??= Si(t.snapshot), t.fingerprint;
   }
   /**
    * Refuse every verb from here on, and let go of what was derived from the last snapshot.
@@ -3143,10 +3143,10 @@ class Ni {
       });
   }
 }
-function Zu(e) {
+function nd(e) {
   return typeof e == "object" && e !== null && e.op === "algo.run";
 }
-function Ns(e, t, n) {
+function Ss(e, t, n) {
   const s = e.statistics(), o = t.scope ?? e.defaultScope;
   let r;
   try {
@@ -3169,7 +3169,7 @@ function Ns(e, t, n) {
     }
   };
 }
-function Ss(e, t) {
+function As(e, t) {
   return Object.freeze({
     seconds: Number.POSITIVE_INFINITY,
     confidence: "unknown",
@@ -3181,21 +3181,21 @@ function Ss(e, t) {
     basis: t
   });
 }
-function qt(e, t) {
-  const n = e.algorithms().find((o) => o.key === t.algorithm), s = Ns(e, t, n);
-  return "unresolvableScope" in s ? Ss(n, s.unresolvableScope) : Re(s.input);
+function Bt(e, t) {
+  const n = e.algorithms().find((o) => o.key === t.algorithm), s = Ss(e, t, n);
+  return "unresolvableScope" in s ? As(n, s.unresolvableScope) : Re(s.input);
 }
-function Si(e, t) {
-  const n = e.algorithms().find((i) => i.key === t.algorithm), s = Ns(e, t, n);
+function Ci(e, t) {
+  const n = e.algorithms().find((i) => i.key === t.algorithm), s = Ss(e, t, n);
   if ("unresolvableScope" in s)
     return Object.freeze({
       ok: !1,
       blocked: Object.freeze({ code: "E_UNSUPPORTED", reason: s.unresolvableScope }),
-      cost: Ss(n, s.unresolvableScope),
+      cost: As(n, s.unresolvableScope),
       effect: Object.freeze({ kind: "none" }),
       caveats: e.defaultCaveats
     });
-  const o = ai(s.input, {
+  const o = li(s.input, {
     limits: e.limits,
     ...t.exact === void 0 ? {} : { exact: t.exact },
     ...t.sample === void 0 ? {} : { sample: t.sample }
@@ -3203,7 +3203,7 @@ function Si(e, t) {
   return o.kind === "refused" ? Object.freeze({
     ok: !1,
     blocked: Object.freeze({ code: o.error.code, reason: o.error.message }),
-    cost: qt(e, t),
+    cost: Bt(e, t),
     effect: r,
     caveats: e.defaultCaveats
   }) : o.kind === "exact" ? Object.freeze({
@@ -3229,7 +3229,7 @@ function Si(e, t) {
     })
   });
 }
-function Ai(e) {
+function _i(e) {
   const { elements: t } = e, n = (c, l) => us(c, ke(t, l)), s = (c, l) => {
     const g = e.snapshot(), h = l === "node" ? g.nodeCount : g.edgeCount, y = [];
     for (let P = 0; P < h; P++)
@@ -3255,14 +3255,14 @@ function Ai(e) {
     find: (c, l) => {
       const g = e.snapshot(), h = e.searchPaths();
       let y, P = h, F = !0;
-      const U = l === "attribute" ? Ci(c, h) : null;
+      const U = l === "attribute" ? Ii(c, h) : null;
       if (U !== null) {
         const N = U.value.toLowerCase();
         y = (d) => d.toLowerCase() === N, F = U.path === "id", P = F ? [] : [U.path];
       } else if (l === "exact")
         y = (N) => N === c;
       else if (l === "regex") {
-        const N = _i(c);
+        const N = Ti(c);
         y = (d) => N.test(d);
       } else {
         const N = c.toLowerCase();
@@ -3282,7 +3282,7 @@ function Ai(e) {
     }
   };
 }
-function Ci(e, t) {
+function Ii(e, t) {
   const n = e.indexOf(":");
   if (n <= 0)
     return null;
@@ -3292,7 +3292,7 @@ function Ci(e, t) {
   const r = s.startsWith("data.") ? s : `data.${s}`;
   return t.includes(r) ? { path: r, value: o } : null;
 }
-function _i(e) {
+function Ti(e) {
   try {
     return new RegExp(e);
   } catch (t) {
@@ -3309,7 +3309,7 @@ const He = Object.freeze({
   element: "1.10.0",
   algorithms: "1.4.0",
   layout: "1.3.0"
-}), Ii = Object.freeze({
+}), Pi = Object.freeze({
   setProgress: () => {
   },
   setMessage: () => {
@@ -3317,7 +3317,7 @@ const He = Object.freeze({
   setPhase: () => {
   }
 });
-class Ti {
+class $i {
   #i = 0;
   #e = [];
   #t = !1;
@@ -3367,7 +3367,7 @@ class Ti {
           const t = this.#e[0];
           t.started = !0;
           try {
-            await t.execute({ signal: t.controller.signal, progress: Ii, id: t.id });
+            await t.execute({ signal: t.controller.signal, progress: Pi, id: t.id });
           } catch {
           }
           this.#e.shift();
@@ -3378,72 +3378,72 @@ class Ti {
     }
   }
 }
-function Gt() {
-  return new Ti();
+function qt() {
+  return new $i();
 }
-const En = Object.freeze([]), Pi = Object.freeze([1, 3]), Wt = {
+const On = Object.freeze([]), ki = Object.freeze([1, 3]), Gt = {
   node: "node.color",
   edge: "edge.color"
 };
-function $i(e, t) {
+function Mi(e, t) {
   const n = [];
   for (const s of ["node", "edge"])
     e.some((o) => o.name === t && o.kind === s) && n.push(s);
   return n;
 }
-function As(e, t = !0) {
+function Cs(e, t = !0) {
   const { layer: n, primaryField: s } = Me(e.shape);
   if (n === "none" || s === null)
-    return En;
-  const o = $i(e.fields, s);
+    return On;
+  const o = Mi(e.fields, s);
   if (o.length === 0)
-    return En;
-  const r = n === "highlight" ? [Mi(e, s, o)] : o.map((c) => Cs(e, s, c)), i = Ri(e, s, r), a = ki(e, s, o, t);
+    return On;
+  const r = n === "highlight" ? [Di(e, s, o)] : o.map((c) => _s(e, s, c)), i = xi(e, s, r), a = Ri(e, s, o, t);
   return Object.freeze([...r, ...i === null ? [] : [i], ...a === null ? [] : [a]]);
 }
-function ki(e, t, n, s) {
+function Ri(e, t, n, s) {
   const o = typeof s == "object" ? s.size : void 0;
   if (o === void 0 || o === !1 || e.shape !== "node-metric" || !n.includes("node"))
     return null;
-  const [r, i] = o === !0 ? Pi : o;
+  const [r, i] = o === !0 ? ki : o;
   return {
     as: "encoding",
     channels: Object.freeze(["node.size"]),
     spec: { run: e.id, field: t, channel: "node.size", range: [r, i] }
   };
 }
-function Mi(e, t, n) {
+function Di(e, t, n) {
   return {
     as: "highlight",
-    channels: Object.freeze(n.map((s) => Wt[s])),
+    channels: Object.freeze(n.map((s) => Gt[s])),
     spec: { run: e.id, field: t }
   };
 }
-function Cs(e, t, n) {
-  const s = Wt[n];
+function _s(e, t, n) {
+  const s = Gt[n];
   return {
     as: "encoding",
     channels: Object.freeze([s]),
     spec: { run: e.id, field: t, channel: s }
   };
 }
-function Ri(e, t, n) {
-  if (n.some((o) => o.channels.includes(Wt.node)))
+function xi(e, t, n) {
+  if (n.some((o) => o.channels.includes(Gt.node)))
     return null;
   const s = e.fields.find(
     (o) => o.kind === "node" && o.type === "string" && o.name !== t
   );
-  return s === void 0 ? null : Cs(e, s.name, "node");
+  return s === void 0 ? null : _s(e, s.name, "node");
 }
-const Nn = Object.freeze({
+const En = Object.freeze({
   phase: "queued",
   determinate: !1,
   completed: 0,
   total: null,
   fraction: null,
   etaMs: null
-}), Di = 100;
-function Sn() {
+}), ji = 100;
+function Nn() {
   let e = () => {
   }, t = () => {
   };
@@ -3456,10 +3456,10 @@ function Sn() {
 function fe() {
   return performance.now();
 }
-function xi(e) {
+function zi(e) {
   return e instanceof Error && (e.name === "AbortError" || e.name === "TimeoutError");
 }
-function An(e, t) {
+function Sn(e, t) {
   if (e.aborted) {
     t.abort(e.reason);
     return;
@@ -3472,7 +3472,7 @@ function An(e, t) {
     { once: !0 }
   );
 }
-function Cn(e, t) {
+function An(e, t) {
   const n = e?.reason;
   return n instanceof DOMException ? n : new DOMException(typeof n == "string" && n !== "" ? n : t, "AbortError");
 }
@@ -3483,7 +3483,7 @@ class Ke {
    * @param surroundings - What the run asks of the session holding it.
    */
   constructor(t, n) {
-    this.journalId = null, this.statusValue = "queued", this.progressValue = Nn, this.resultValue = void 0, this.summaryValue = void 0, this.errorValue = void 0, this.startedAtValue = null, this.startedAtMs = 0, this.durationValue = null, this.partialValue = !1, this.deferred = Sn(), this.ticket = null, this.executionController = null, this.timeBoxTimer = null, this.detachSignal = null, this.queueSink = null, this.settledFlag = !1, this.cancelReason = null, this.definition = t, this.surroundings = n, this.id = t.id, this.algorithm = t.algorithm, this.params = t.params, this.seed = t.seed, this.shape = t.shape, this.engine = t.engine, this.style = t.style, this.caveatsValue = t.caveats, this.fieldsValue = t.fields, this.scopeValue = n.resolveScope();
+    this.journalId = null, this.statusValue = "queued", this.progressValue = En, this.resultValue = void 0, this.summaryValue = void 0, this.errorValue = void 0, this.startedAtValue = null, this.startedAtMs = 0, this.durationValue = null, this.partialValue = !1, this.deferred = Nn(), this.ticket = null, this.executionController = null, this.timeBoxTimer = null, this.detachSignal = null, this.queueSink = null, this.settledFlag = !1, this.cancelReason = null, this.definition = t, this.surroundings = n, this.id = t.id, this.algorithm = t.algorithm, this.params = t.params, this.seed = t.seed, this.shape = t.shape, this.engine = t.engine, this.style = t.style, this.caveatsValue = t.caveats, this.fieldsValue = t.fields, this.scopeValue = n.resolveScope();
   }
   // -- the facts ----------------------------------------------------------------------------
   /**
@@ -3646,7 +3646,7 @@ class Ke {
       return;
     const { signal: t } = this.definition;
     if (t !== void 0 && t.aborted) {
-      this.finishAsCanceled(Cn(t, `Run "${this.id}" was aborted before it started.`));
+      this.finishAsCanceled(An(t, `Run "${this.id}" was aborted before it started.`));
       return;
     }
     this.attachCallerSignal(), this.surroundings.notify?.("queued"), this.ticket = this.surroundings.enqueue(async (n) => {
@@ -3693,7 +3693,7 @@ class Ke {
    * @returns The suggestions, empty when the result is read rather than painted.
    */
   suggestEncodings() {
-    return As(this, this.style);
+    return Cs(this, this.style);
   }
   // -- execution ----------------------------------------------------------------------------
   /**
@@ -3705,9 +3705,9 @@ class Ke {
       return;
     this.queueSink = t.progress, this.statusValue = "running", this.startedAtValue = (/* @__PURE__ */ new Date()).toISOString(), this.startedAtMs = fe(), this.scopeValue = this.surroundings.resolveScope();
     const n = new AbortController();
-    this.executionController = n, An(t.signal, n);
+    this.executionController = n, Sn(t.signal, n);
     const { signal: s } = this.definition;
-    s !== void 0 && An(s, n);
+    s !== void 0 && Sn(s, n);
     const o = this.startTimeBox();
     this.surroundings.notify?.("start"), this.report({ phase: "running", completed: 0 });
     try {
@@ -3775,7 +3775,7 @@ class Ke {
   fail(t) {
     if (this.settledFlag)
       return;
-    if (xi(t)) {
+    if (zi(t)) {
       this.finishAsCanceled(t);
       return;
     }
@@ -3826,7 +3826,7 @@ class Ke {
    * @param update - What changed.
    */
   report(t) {
-    const n = this.progressValue, s = t.phase ?? n.phase, o = t.completed ?? n.completed, r = t.total === void 0 ? n.total : t.total, i = r !== null, a = r === null ? null : ji(o, r), c = t.message ?? n.message, l = Object.freeze({
+    const n = this.progressValue, s = t.phase ?? n.phase, o = t.completed ?? n.completed, r = t.total === void 0 ? n.total : t.total, i = r !== null, a = r === null ? null : Li(o, r), c = t.message ?? n.message, l = Object.freeze({
       phase: s,
       determinate: i,
       completed: o,
@@ -3844,7 +3844,7 @@ class Ke {
    */
   pushToQueue(t) {
     const n = this.queueSink;
-    n !== null && (n.setPhase(t.phase), t.message !== void 0 && n.setMessage(t.message), t.fraction !== null && n.setProgress(Math.round(t.fraction * Di)));
+    n !== null && (n.setPhase(t.phase), t.message !== void 0 && n.setMessage(t.message), t.fraction !== null && n.setProgress(Math.round(t.fraction * ji)));
   }
   /**
    * How much longer the run has, projected from how long it has taken so far.
@@ -3881,7 +3881,7 @@ class Ke {
   cancelFromSignal(t) {
     if (!this.cancellable)
       return;
-    const n = Cn(t, `Run "${this.id}" was aborted.`);
+    const n = An(t, `Run "${this.id}" was aborted.`);
     this.statusValue = "canceled", this.durationValue = this.startedAtMs === 0 ? null : Math.round(fe() - this.startedAtMs), this.settle(() => {
       this.deferred.reject(n);
     }), this.stopWork(n);
@@ -3902,13 +3902,13 @@ class Ke {
   }
   /** Put the run back the way it was before it ran, keeping its id and its definition. */
   resetForRerun() {
-    this.settledFlag = !1, this.cancelReason = null, this.deferred = Sn(), this.statusValue = "queued", this.progressValue = Nn, this.caveatsValue = this.definition.caveats, this.fieldsValue = this.definition.fields, this.resultValue = void 0, this.summaryValue = void 0, this.errorValue = void 0, this.startedAtValue = null, this.startedAtMs = 0, this.durationValue = null, this.partialValue = !1, this.ticket = null, this.executionController = null;
+    this.settledFlag = !1, this.cancelReason = null, this.deferred = Nn(), this.statusValue = "queued", this.progressValue = En, this.caveatsValue = this.definition.caveats, this.fieldsValue = this.definition.fields, this.resultValue = void 0, this.summaryValue = void 0, this.errorValue = void 0, this.startedAtValue = null, this.startedAtMs = 0, this.durationValue = null, this.partialValue = !1, this.ticket = null, this.executionController = null;
   }
 }
-function ji(e, t) {
+function Li(e, t) {
   return t <= 0 ? 1 : Math.min(1, Math.max(0, e / t));
 }
-const zi = Object.freeze({
+const Fi = Object.freeze({
   exact: !0,
   seed: null,
   direction: "as-loaded",
@@ -3916,7 +3916,7 @@ const zi = Object.freeze({
   precision: "f64",
   method: "exact",
   notes: Object.freeze([])
-}), Li = Object.freeze({
+}), Ui = Object.freeze({
   setProgress: () => {
   },
   setMessage: () => {
@@ -3924,20 +3924,20 @@ const zi = Object.freeze({
   setPhase: () => {
   }
 });
-function Fi(e) {
+function Vi(e) {
   return e instanceof Error && (e.name === "AbortError" || e.name === "TimeoutError");
 }
-function Ui(e) {
+function Bi(e) {
   return e === "visible" ? "visible" : e === "graph" ? "whole graph" : e === "selection" ? "selection" : e === "largest-component" ? "largest component" : "set" in e ? `set ${e.set}` : "where" in e ? e.where : `${e.nodes.length} nodes`;
 }
-function Vi(e) {
+function qi(e) {
   return typeof e == "string" ? e : typeof e == "number" ? String(e) : typeof e == "boolean" ? e ? "on" : "off" : e === void 0 ? "default" : ie(e);
 }
-function Bi(e, t) {
-  const n = Lt(e)?.version;
+function Gi(e, t) {
+  const n = zt(e)?.version;
   return n === void 0 ? t : Object.freeze({ ...t, plugins: Object.freeze({ [e]: n }) });
 }
-function qi(e, t, n) {
+function Wi(e, t, n) {
   if (t.values !== void 0 && t.values.length > 0 && typeof n == "string") {
     const s = t.values.map((o) => o.value);
     if (!s.includes(n))
@@ -3965,14 +3965,14 @@ function qi(e, t, n) {
       });
   }
 }
-class Gi {
+class Yi {
   /**
    * Build the runs API.
    * @param options - The queue, the catalogue, the scope resolver and the thing that does the
    * work.
    */
   constructor(t) {
-    this.runs = /* @__PURE__ */ new Map(), this.identities = /* @__PURE__ */ new Map(), this.derivedIds = /* @__PURE__ */ new Set(), this.batches = /* @__PURE__ */ new Set(), this.disposed = !1, this.options = t, this.defaultScope = t.defaultScope ?? "visible", this.defaultCaveats = t.defaultCaveats ?? zi;
+    this.runs = /* @__PURE__ */ new Map(), this.identities = /* @__PURE__ */ new Map(), this.derivedIds = /* @__PURE__ */ new Set(), this.batches = /* @__PURE__ */ new Set(), this.disposed = !1, this.options = t, this.defaultScope = t.defaultScope ?? "visible", this.defaultCaveats = t.defaultCaveats ?? Fi;
   }
   // -- starting -----------------------------------------------------------------------------
   /**
@@ -3994,12 +3994,12 @@ class Gi {
     this.checkParams(o, n);
     const r = s.scope ?? this.defaultScope, i = {
       algorithm: o.key,
-      params: sr(n, o.options),
+      params: rr(n, o.options),
       scope: r,
       seed: s.seed ?? null,
       sample: s.sample ?? null,
       exact: s.exact ?? null
-    }, a = s.as, c = a === void 0, l = a === void 0 ? Ge(i) : rr(a), g = this.runs.get(l);
+    }, a = s.as, c = a === void 0, l = a === void 0 ? Ge(i) : ar(a), g = this.runs.get(l);
     return g !== void 0 ? this.reuse(g, i) : this.create(l, i, o, r, s, c);
   }
   /**
@@ -4043,7 +4043,7 @@ class Gi {
       queuePosition: () => null,
       stale: () => null,
       resolveScope: () => this.options.resolveScope(this.defaultScope),
-      enqueue: (l) => _n(l, r),
+      enqueue: (l) => Cn(l, r),
       notify: (l) => {
         this.announce(c, l);
       }
@@ -4146,7 +4146,7 @@ class Gi {
       style: r.style ?? !0,
       shape: s.shape,
       fields: s.fields,
-      engine: Bi(s.key, this.options.engine),
+      engine: Gi(s.key, this.options.engine),
       caveats: Object.freeze({
         ...this.defaultCaveats,
         seed: n.seed,
@@ -4160,7 +4160,7 @@ class Gi {
       queuePosition: () => this.queuePositionOf(t),
       stale: () => this.staleOf(t),
       resolveScope: () => this.options.resolveScope(o),
-      enqueue: (h) => a === "now" ? _n(h, t) : this.enqueueOnQueue(t, h),
+      enqueue: (h) => a === "now" ? Cn(h, t) : this.enqueueOnQueue(t, h),
       notify: (h) => {
         this.announce(g, h), h === "end" && this.options.styling?.completed(g);
       }
@@ -4291,7 +4291,7 @@ class Gi {
     for (const o of n)
       for (const r of /* @__PURE__ */ new Set([...Object.keys(t.params), ...Object.keys(o.params)]))
         ie(t.params[r]) !== ie(o.params[r]) && s.add(r);
-    return s.size === 0 ? Ui(t.scope.spec) : [...s].sort((o, r) => o < r ? -1 : 1).map((o) => `${o} ${Vi(t.params[o])}`).join(", ");
+    return s.size === 0 ? Bi(t.scope.spec) : [...s].sort((o, r) => o < r ? -1 : 1).map((o) => `${o} ${qi(t.params[o])}`).join(", ");
   }
   // -- the catalogue ------------------------------------------------------------------------
   /**
@@ -4310,7 +4310,7 @@ class Gi {
    *   element reserves but does not run, or `E_UNKNOWN_ALGORITHM` when nothing registers that key.
    */
   descriptorFor(t) {
-    if (fs(t))
+    if (ms(t))
       throw new _({
         code: "E_UNSUPPORTED",
         message: `The "${t}" algorithm is not implemented. The name is deprecated and will be removed at the next major release unless it is implemented first.`,
@@ -4353,7 +4353,7 @@ class Gi {
               available: t.options.map((i) => i.name)
             }
           });
-        qi(t.key, r, o);
+        Wi(t.key, r, o);
       }
   }
   // -- batches ------------------------------------------------------------------------------
@@ -4429,7 +4429,7 @@ class Gi {
     try {
       return await o, { index: s, runId: o.id, ok: !0 };
     } catch (i) {
-      return { index: s, runId: o.id, ok: !1, reason: Wi(i) };
+      return { index: s, runId: o.id, ok: !1, reason: Hi(i) };
     } finally {
       t.removeEventListener("abort", r);
     }
@@ -4464,31 +4464,31 @@ class Gi {
       });
   }
 }
-function Wi(e) {
-  return Fi(e) ? "The batch was canceled." : e instanceof Error ? e.message : String(e);
+function Hi(e) {
+  return Vi(e) ? "The batch was canceled." : e instanceof Error ? e.message : String(e);
 }
-function _n(e, t) {
+function Cn(e, t) {
   const n = new AbortController();
-  return e({ signal: n.signal, progress: Li, id: `beside:${t}` }), {
+  return e({ signal: n.signal, progress: Ui, id: `beside:${t}` }), {
     cancel: () => {
       n.abort(new DOMException(`Run "${t}" was canceled.`, "AbortError"));
     }
   };
 }
-function Yi(e) {
-  return new Gi(e);
-}
-const Hi = Object.freeze(["user", "template", "plugin"]);
 function Ki(e) {
+  return new Yi(e);
+}
+const Qi = Object.freeze(["user", "template", "plugin"]);
+function Xi(e) {
   return e.as === "highlight" ? "highlight" : e.channels.join(",");
 }
-function Qi(e, t) {
-  return e.some((n) => !n.enabled || !Hi.includes(n.source.by) ? !1 : t.some((s) => {
+function Ji(e, t) {
+  return e.some((n) => !n.enabled || !Qi.includes(n.source.by) ? !1 : t.some((s) => {
     const o = n.encode?.[s], r = n.set?.[s];
     return o !== void 0 || r !== void 0;
   }));
 }
-function Xi(e) {
+function Zi(e) {
   const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Map();
   let s = 0;
   const o = (i, a) => {
@@ -4505,14 +4505,14 @@ function Xi(e) {
       return;
     const c = a.list();
     for (const l of i)
-      Qi(c, l.suggestion.channels) || o(a, l);
+      Ji(c, l.suggestion.channels) || o(a, l);
   };
   return {
     completed(i) {
       if (!(i.status !== "succeeded" || !i.style || t.has(i.id))) {
         t.add(i.id);
-        for (const a of As(i, i.style))
-          n.set(Ki(a), { runId: i.id, suggestion: a });
+        for (const a of Cs(i, i.style))
+          n.set(Xi(a), { runId: i.id, suggestion: a });
         s === 0 && r();
       }
     },
@@ -4530,8 +4530,8 @@ function Xi(e) {
 function Qe(e) {
   return typeof e == "number" && Number.isNaN(e);
 }
-const Ji = [0, 1], Zi = 5;
-function Yt(e) {
+const ea = [0, 1], ta = 5;
+function Wt(e) {
   if (typeof e == "number")
     return Number.isFinite(e) ? e : Number.NaN;
   if (typeof e == "string" && e.trim() !== "") {
@@ -4540,32 +4540,32 @@ function Yt(e) {
   }
   return Number.NaN;
 }
-function ea(e) {
+function na(e) {
   return typeof e == "string" ? e : typeof e == "boolean" ? e ? "true" : "false" : typeof e == "number" && Number.isFinite(e) ? String(e) : null;
 }
 function Be(e, t, n) {
   return Math.max(t, Math.min(n, e));
 }
-function _s(e, t) {
+function Is(e, t) {
   if (Number.isNaN(e))
     return Number.NaN;
-  const n = t.reverse === !0 ? 1 - e : e, [s, o] = t.range ?? Ji;
+  const n = t.reverse === !0 ? 1 - e : e, [s, o] = t.range ?? ea;
   return s + n * (o - s);
 }
-function ta(e, t, n, s) {
+function sa(e, t, n, s) {
   return t === n ? 0 : s !== void 0 && Number.isFinite(s) && s !== t && s !== n ? (n > t ? e <= s : e >= s) ? Be(0.5 * (e - t) / (s - t), 0, 0.5) : Be(0.5 + 0.5 * (e - s) / (n - s), 0.5, 1) : Be((e - t) / (n - t), 0, 1);
 }
-function na(e) {
+function oa(e) {
   const { exponent: t } = e;
   return t === void 0 || !Number.isFinite(t) ? 1 : t;
 }
-function Is(e, t) {
+function Ts(e, t) {
   return Math.sign(e) * Math.abs(e) ** t;
 }
-const sa = (e) => e, oa = (e) => e > 0 ? Math.log10(e) : Number.NaN, ra = (e) => e > 0 ? -Math.log10(e) : Number.NaN, ia = (e) => Is(e, 0.5), aa = (e, t) => Is(e, na(t));
+const ra = (e) => e, ia = (e) => e > 0 ? Math.log10(e) : Number.NaN, aa = (e) => e > 0 ? -Math.log10(e) : Number.NaN, ca = (e) => Ts(e, 0.5), la = (e, t) => Ts(e, oa(t));
 function Ae(e) {
   return (t, n) => {
-    const s = Yt(t);
+    const s = Wt(t);
     if (Number.isNaN(s))
       return Number.NaN;
     const o = e(s, n);
@@ -4575,21 +4575,21 @@ function Ae(e) {
     if (!Number.isFinite(r) || !Number.isFinite(i))
       return Number.NaN;
     const a = n.midpoint === void 0 ? void 0 : e(n.midpoint, n);
-    return _s(ta(o, r, i, a), n);
+    return Is(sa(o, r, i, a), n);
   };
 }
 function nt(e, t) {
   if (e === "bins") {
     const { bins: n } = t;
-    return n === void 0 || !Number.isFinite(n) ? Zi : Math.max(1, Math.floor(n));
+    return n === void 0 || !Number.isFinite(n) ? ta : Math.max(1, Math.floor(n));
   }
   return e === "quantile" ? (t.thresholds?.length ?? 0) + 1 : e === "ordinal" ? t.categories?.length ?? 0 : 0;
 }
 function Xe(e, t, n) {
-  return e < 0 || t < 1 ? Number.NaN : _s(t > 1 ? e / (t - 1) : 0, n);
+  return e < 0 || t < 1 ? Number.NaN : Is(t > 1 ? e / (t - 1) : 0, n);
 }
-const ca = (e, t) => {
-  const n = Yt(e), [s, o] = t.domain;
+const ua = (e, t) => {
+  const n = Wt(e), [s, o] = t.domain;
   if (Number.isNaN(n) || !Number.isFinite(s) || !Number.isFinite(o))
     return Number.NaN;
   const r = nt("bins", t);
@@ -4597,8 +4597,8 @@ const ca = (e, t) => {
     return Xe(0, r, t);
   const i = Be((n - s) / (o - s), 0, 1);
   return Xe(Math.min(r - 1, Math.floor(i * r)), r, t);
-}, la = (e, t) => {
-  const n = Yt(e);
+}, da = (e, t) => {
+  const n = Wt(e);
   if (Number.isNaN(n))
     return Number.NaN;
   const s = t.thresholds ?? [], o = s.length + 1;
@@ -4609,11 +4609,11 @@ const ca = (e, t) => {
     r += 1;
   }
   return Xe(Math.min(r, o - 1), o, t);
-}, ua = (e, t) => {
-  const n = t.categories ?? [], s = ea(e);
+}, ha = (e, t) => {
+  const n = t.categories ?? [], s = na(e);
   return s === null ? Number.NaN : Xe(n.indexOf(s), n.length, t);
-}, da = (e) => typeof e == "number" ? Number.isFinite(e) ? e : Number.NaN : typeof e == "string" ? e : typeof e == "boolean" ? e ? "true" : "false" : Number.NaN;
-function ha(e, t) {
+}, fa = (e) => typeof e == "number" ? Number.isFinite(e) ? e : Number.NaN : typeof e == "string" ? e : typeof e == "boolean" ? e ? "true" : "false" : Number.NaN;
+function ma(e, t) {
   const n = [...e].filter((r) => Number.isFinite(r)).sort((r, i) => r - i), s = Math.floor(t);
   if (n.length === 0 || s < 2)
     return [];
@@ -4625,19 +4625,19 @@ function ha(e, t) {
   return o;
 }
 const St = {
-  linear: Ae(sa),
-  log: Ae(oa),
-  neglog10: Ae(ra),
-  sqrt: Ae(ia),
-  pow: Ae(aa),
-  bins: ca,
-  quantile: la,
-  ordinal: ua,
-  passthrough: da
+  linear: Ae(ra),
+  log: Ae(ia),
+  neglog10: Ae(aa),
+  sqrt: Ae(ca),
+  pow: Ae(la),
+  bins: ua,
+  quantile: da,
+  ordinal: ha,
+  passthrough: fa
 };
-function Ht() {
+function Yt() {
   const e = /* @__PURE__ */ new Map(), t = St;
-  for (const n of ds) {
+  for (const n of hs) {
     const s = t[n.name];
     if (s === void 0)
       throw new _({
@@ -4681,18 +4681,18 @@ function Ht() {
     }
   };
 }
-const At = "ylorbr", Ct = "okabe-ito", fa = "linear", ma = [0, 1];
-function Ts(e) {
+const At = "ylorbr", Ct = "okabe-ito", ga = "linear", pa = [0, 1];
+function Ps(e) {
   return be(e ?? Ct)?.capacity ?? null;
 }
 function _t(e, t) {
   const { capacity: n } = e;
   return { fits: n === null || t <= n, capacity: n, distinct: t };
 }
-function ga(e) {
+function ba(e) {
   const t = be(e);
   if (t === void 0) {
-    const n = Ut();
+    const n = Ft();
     throw new _({
       code: "E_UNKNOWN_PALETTE",
       message: `There is no palette named "${e}".`,
@@ -4709,15 +4709,15 @@ function ga(e) {
     });
   return t;
 }
-function pa(e, t, n) {
+function va(e, t, n) {
   if (e.describe(t)?.domainKind !== "categorical")
     return At;
   const s = be(Ct);
-  return n === 0 || s !== void 0 && _t(s, n).fits ? Ct : [...Co("categorical")].filter((r) => _t(r, n).fits).sort(
+  return n === 0 || s !== void 0 && _t(s, n).fits ? Ct : [...Io("categorical")].filter((r) => _t(r, n).fits).sort(
     (r, i) => (r.capacity ?? Number.POSITIVE_INFINITY) - (i.capacity ?? Number.POSITIVE_INFINITY)
   )[0]?.id ?? At;
 }
-function ba(e) {
+function ya(e) {
   if (e === void 0 || e === "skip")
     return;
   const t = me(e.value);
@@ -4730,10 +4730,10 @@ function ba(e) {
     });
   return t;
 }
-function va(e) {
+function wa(e) {
   return Math.max(512, 512 * (e - 1));
 }
-function ya(e) {
+function Oa(e) {
   return e.colors.map((t) => {
     const n = me(t);
     if (n === null)
@@ -4746,8 +4746,8 @@ function ya(e) {
     return n;
   });
 }
-function wa(e, t) {
-  const { scale: n = fa, palette: s, missing: o, overflow: r, ...i } = e, a = t.require(n), c = { ...i, range: ma }, l = nt(n, c), h = ga(s ?? pa(t, n, r === "other" || r === "shape" ? 0 : l)), y = { ...c, palette: h }, P = h.kind === "categorical", F = P && l === 0 ? h.colors.length : l;
+function Ea(e, t) {
+  const { scale: n = ga, palette: s, missing: o, overflow: r, ...i } = e, a = t.require(n), c = { ...i, range: pa }, l = nt(n, c), h = ba(s ?? va(t, n, r === "other" || r === "shape" ? 0 : l)), y = { ...c, palette: h }, P = h.kind === "categorical", F = P && l === 0 ? h.colors.length : l;
   if (l > 0 && (r === void 0 || r === "other")) {
     const A = _t(h, l);
     if (!A.fits)
@@ -4758,7 +4758,7 @@ function wa(e, t) {
         details: { palette: h.id, capacity: A.capacity, groups: l, scale: n }
       });
   }
-  const U = ba(o), w = ya(h), N = va(h.colors.length), d = new Array(N + 1).fill(void 0), { colors: p } = h, O = w.length - 1, T = be(At)?.colors ?? p, $ = (A, S) => me(tn(S > 1 ? A / (S - 1) : 0, T)) ?? U;
+  const U = ya(o), w = Oa(h), N = wa(h.colors.length), d = new Array(N + 1).fill(void 0), { colors: p } = h, O = w.length - 1, T = be(At)?.colors ?? p, $ = (A, S) => me(en(S > 1 ? A / (S - 1) : 0, T)) ?? U;
   return {
     palette: h,
     scale: n,
@@ -4777,19 +4777,19 @@ function wa(e, t) {
       const j = Math.max(0, Math.min(N, Math.round(S * N))), f = d[j];
       if (f !== void 0)
         return f;
-      const I = me(tn(j / N, p));
+      const I = me(en(j / N, p));
       return I === null ? U : (d[j] = I, I);
     }
   };
 }
-const Oa = 4, Ps = Object.freeze([
+const Na = 4, $s = Object.freeze([
   "icosphere",
   "box",
   "octahedron",
   "cylinder",
   "cone",
   "torus"
-]), Ea = Object.freeze({
+]), Sa = Object.freeze({
   seen: 0,
   unreadable: 0,
   notPlottable: 0,
@@ -4800,7 +4800,7 @@ const Oa = 4, Ps = Object.freeze([
 function ne(e, t) {
   return new _({ code: "E_BAD_LAYER", message: e, source: "style", details: t });
 }
-function $s(e) {
+function ks(e) {
   const t = et(e);
   if (t === void 0)
     throw new _({
@@ -4811,10 +4811,10 @@ function $s(e) {
     });
   return t;
 }
-function Na(e) {
+function Aa(e) {
   return Object.hasOwn(St, e);
 }
-function ks(e) {
+function Ms(e) {
   if (typeof e == "number")
     return Number.isFinite(e) ? e : Number.NaN;
   if (typeof e == "string" && e.trim() !== "") {
@@ -4826,25 +4826,25 @@ function ks(e) {
 function st(e) {
   return typeof e == "string" ? e : typeof e == "boolean" ? e ? "true" : "false" : typeof e == "number" && Number.isFinite(e) ? String(e) : null;
 }
-function Ms(e, t, n) {
+function Rs(e, t, n) {
   return Math.max(t, Math.min(n, e));
 }
-function Rs(e) {
+function Ds(e) {
   return typeof e == "object" && e !== null && "r" in e && "g" in e && "b" in e;
 }
-function Ds(e) {
+function xs(e) {
   const t = (n) => nt(e, { ...n });
   return {
     categories: t({ categories: ["a"] }) !== t({ categories: ["a", "b"] }),
     thresholds: t({ thresholds: [1] }) !== t({ thresholds: [1, 2] })
   };
 }
-function Sa(e, t) {
+function Ca(e, t) {
   const n = [], s = /* @__PURE__ */ new Map();
   let o = 0, r = 0, i = 0;
   for (const a of e ?? []) {
     if (o++, t) {
-      const l = ks(a);
+      const l = Ms(a);
       if (Number.isNaN(l)) {
         r++;
         continue;
@@ -4861,13 +4861,13 @@ function Sa(e, t) {
   }
   return n.sort((a, c) => a - c), { seen: o, unreadable: r, sorted: n, nonPositive: i, categoryCounts: s };
 }
-function In(e, t) {
+function _n(e, t) {
   if (e.length === 0)
     return Number.NaN;
-  const n = (e.length - 1) * Ms(t, 0, 100) / 100, s = Math.floor(n), o = Math.min(s + 1, e.length - 1);
+  const n = (e.length - 1) * Rs(t, 0, 100) / 100, s = Math.floor(n), o = Math.min(s + 1, e.length - 1);
   return e[s] + (e[o] - e[s]) * (n - s);
 }
-function Aa(e) {
+function _a(e) {
   for (const t of e)
     if (t > 0)
       return t;
@@ -4877,7 +4877,7 @@ function It(e, t, n) {
   const s = { ...t, domain: n };
   return !Qe(e(n[0], s)) && !Qe(e(n[1], s));
 }
-function Ca(e) {
+function Ia(e) {
   const [t, n] = e;
   if (!(Number.isFinite(t) && Number.isFinite(n)) || t < 0 || n > 100 || t >= n)
     throw ne(
@@ -4887,7 +4887,7 @@ function Ca(e) {
       }
     );
 }
-function _a(e, t, n, s, o) {
+function Ta(e, t, n, s, o) {
   const { clamp: r, domain: i } = e, a = Array.isArray(i) ? [i[0], i[1]] : null;
   if (a !== null && r !== void 0)
     throw ne(
@@ -4903,21 +4903,21 @@ function _a(e, t, n, s, o) {
       departures: c ? [] : [`no value has a place between ${String(a[0])} and ${String(a[1])}`]
     };
   }
-  return Ia(r, t, n, s, o);
+  return Pa(r, t, n, s, o);
 }
-function Ia(e, t, n, s, o) {
+function Pa(e, t, n, s, o) {
   const { sorted: r } = t, i = [];
   if (r.length === 0)
     return { domain: [0, 1], notPlottable: 0, clamped: 0, departures: ["nothing measured"] };
   let a = r[0], c = r[r.length - 1], l = 0;
-  if (e !== void 0 && (Ca(e), a = In(r, e[0]), c = In(r, e[1]), l = r.filter((h) => h < a || h > c).length, i.push(`clamped at p${String(e[0])}/p${String(e[1])}`)), It(n, s, [a, c]))
+  if (e !== void 0 && (Ia(e), a = _n(r, e[0]), c = _n(r, e[1]), l = r.filter((h) => h < a || h > c).length, i.push(`clamped at p${String(e[0])}/p${String(e[1])}`)), It(n, s, [a, c]))
     return { domain: [a, c], notPlottable: 0, clamped: l, departures: i };
-  const g = Aa(r);
+  const g = _a(r);
   return g !== null && g <= c && It(n, s, [g, c]) ? (i.push(`${String(t.nonPositive)} not plottable on a ${o} scale`), { domain: [g, c], notPlottable: t.nonPositive, clamped: l, departures: i }) : (i.push(`no value is plottable on a ${o} scale`), { domain: [a, c], notPlottable: r.length, clamped: l, departures: i });
 }
-function Ta(e, t, n) {
+function $a(e, t, n) {
   const s = [...e.categoryCounts.entries()].sort(
-    (a, c) => c[1] - a[1] || a[0].localeCompare(c[0])
+    (a, c) => c[1] - a[1] || yo(a[0], c[0])
   );
   if (t === void 0 && s.length <= n)
     return { categories: s.map(([a]) => a), lumped: [], other: 0 };
@@ -4932,7 +4932,7 @@ function Ta(e, t, n) {
   }
   return { categories: o, lumped: r, other: i };
 }
-function Pa(e) {
+function ka(e) {
   const t = e.values ?? [];
   return (n) => {
     if (typeof n == "string")
@@ -4941,17 +4941,17 @@ function Pa(e) {
     return s >= 0 && s < t.length ? t[s] : void 0;
   };
 }
-function $a(e) {
+function Ma(e) {
   switch (e.accepts) {
     case "number": {
       const t = e.min ?? Number.NEGATIVE_INFINITY, n = e.max ?? Number.POSITIVE_INFINITY;
       return (s) => {
-        const o = typeof s == "number" ? s : ks(s);
-        return Number.isFinite(o) ? Ms(o, t, n) : void 0;
+        const o = typeof s == "number" ? s : Ms(s);
+        return Number.isFinite(o) ? Rs(o, t, n) : void 0;
       };
     }
     case "enum":
-      return Pa(e);
+      return ka(e);
     case "text":
       return (t) => typeof t == "string" ? t : String(t);
     case "boolean":
@@ -4962,12 +4962,12 @@ function $a(e) {
   }
 }
 function Tt(e, t) {
-  const n = typeof e == "string" || Rs(e) ? me(e) : null;
+  const n = typeof e == "string" || Ds(e) ? me(e) : null;
   if (n === null)
     throw ne(`${t} is not a colour.`, { value: e });
   return n;
 }
-function xs(e) {
+function js(e) {
   return new _({
     code: "E_UNSUPPORTED",
     message: `${e.plainName} accepts no value: ${e.caveat ?? "the element draws nothing for it."}`,
@@ -4975,7 +4975,7 @@ function xs(e) {
     details: { channel: e.channel }
   });
 }
-function Tn(e, t, n) {
+function In(e, t, n) {
   const { max: s, min: o, values: r } = e, i = r === void 0 ? `is drawn from ${o === void 0 ? "any" : String(o)} to ${s === void 0 ? "any" : String(s)}` : `takes one of ${r.join(", ")}`;
   return new _({
     code: "E_OPTION_RANGE",
@@ -4994,7 +4994,7 @@ function Je(e, t, n) {
         throw r("a number");
       const { max: i, min: a } = e;
       if (a !== void 0 && t < a || i !== void 0 && t > i)
-        throw Tn(e, t, n);
+        throw In(e, t, n);
       return t;
     }
     case "text":
@@ -5009,17 +5009,17 @@ function Je(e, t, n) {
     }
     case "enum":
       if (typeof t != "string" || !(o ?? []).includes(t))
-        throw Tn(e, t, n);
+        throw In(e, t, n);
       return t;
     case "labelStyle":
-      if (typeof t != "object" || Rs(t))
+      if (typeof t != "object" || Ds(t))
         throw r('a label style, such as { sizePx: 14, weight: "bold" }');
       return t;
     default:
-      throw xs(e);
+      throw js(e);
   }
 }
-function ka(e, t) {
+function Ra(e, t) {
   const n = Je(e, t.value, `The value written to ${e.channel}`);
   return {
     channel: e.channel,
@@ -5030,40 +5030,40 @@ function ka(e, t) {
     categories: [],
     lumped: [],
     groups: 0,
-    counts: Ea,
+    counts: Sa,
     departures: [],
     paint: () => n
   };
 }
-function Ma(e) {
+function Da(e) {
   return e === "color" || e === "number" ? "linear" : "passthrough";
 }
-function Ra(e, t, n) {
+function xa(e, t, n) {
   const { accepts: s, channel: o } = e;
   if (s === "nothing")
-    throw xs(e);
+    throw js(e);
   if (s === "labelStyle")
     throw ne(
       `${o} carries a whole label style, which no scale produces, so it is written as a value rather than bound to a path.`,
       { channel: o }
     );
-  if ((s === "text" || s === "boolean") && n && Na(t))
+  if ((s === "text" || s === "boolean") && n && Aa(t))
     throw ne(
       `The "${t}" scale answers a position, and a position is not a value ${o} carries. Read the value as it is with "passthrough", or name individual values with "map".`,
       { channel: o, scale: t }
     );
 }
-function Da(e, t, n, s) {
+function ja(e, t, n, s) {
   if (s)
     return;
-  const o = Ds(t), r = [];
+  const o = xs(t), r = [];
   if (n && (!Array.isArray(e.domain) || e.clamp !== void 0) && r.push("the extent its values span"), o.categories && r.push("the categories it numbers"), o.thresholds && r.push("the cut points it groups at"), r.length > 0)
     throw ne(
       `This binding is worked out from the values of "${e.by}" -- ${r.join(", ")} -- and none were supplied.`,
       { path: e.by, scale: t, needs: r }
     );
 }
-function xa(e, t) {
+function za(e, t) {
   if (e === void 0 || e === "skip")
     return e;
   if (typeof e.value != "string")
@@ -5073,11 +5073,11 @@ function xa(e, t) {
     });
   return { value: e.value };
 }
-function ja(e, t, n) {
+function La(e, t, n) {
   const s = /* @__PURE__ */ new Map(), { other: o } = e;
   if (t.length > 0) {
     const r = Tt(
-      o?.value ?? $o,
+      o?.value ?? Mo,
       `The colour the "other" bucket paints on ${n.channel}`
     );
     for (const i of t)
@@ -5087,7 +5087,7 @@ function ja(e, t, n) {
     s.set(r, Tt(i, `The colour "${r}" is mapped to on ${n.channel}`));
   return s.size === 0 ? null : s;
 }
-function za(e, t, n) {
+function Fa(e, t, n) {
   const { bins: s, categories: o, domain: r, exponent: i, midpoint: a, reverse: c, thresholds: l } = n.context, g = {
     bins: s,
     categories: o,
@@ -5098,9 +5098,9 @@ function za(e, t, n) {
     thresholds: l,
     scale: n.scale,
     palette: t.palette,
-    missing: xa(t.missing, e),
+    missing: za(t.missing, e),
     overflow: t.overflow
-  }, h = wa(g, n.scales), y = ja(t, n.categories.lumped, e);
+  }, h = Ea(g, n.scales), y = La(t, n.categories.lumped, e);
   return {
     palette: h.palette,
     groups: h.groups,
@@ -5110,7 +5110,7 @@ function za(e, t, n) {
     }
   };
 }
-function La(e, t, n, s) {
+function Ua(e, t, n, s) {
   if (e.accepts !== "enum") {
     const { range: i } = t;
     return i === void 0 ? n.context : { ...n.context, range: [i[0], i[1]] };
@@ -5125,12 +5125,12 @@ function La(e, t, n, s) {
     });
   return { ...n.context, range: [0, Math.max(0, r - 1)] };
 }
-function Fa(e, t) {
+function Va(e, t) {
   const { missing: n } = t;
   if (!(n === void 0 || n === "skip"))
     return Je(e, n.value, `What a missing value paints on ${e.channel}`);
 }
-function Ua(e, t, n) {
+function Ba(e, t, n) {
   const s = /* @__PURE__ */ new Map(), { other: o } = e;
   if (o !== void 0) {
     const r = `The value the "other" bucket paints on ${n.channel}`, i = Je(n, o.value, r);
@@ -5143,10 +5143,10 @@ function Ua(e, t, n) {
   }
   return s.size === 0 ? null : s;
 }
-function Va(e, t, n) {
+function qa(e, t, n) {
   if (t.overflow === "shape" && e.channel === "node.shape")
-    return Ba(t, n);
-  const s = $a(e), o = nt(n.scale, n.context), r = La(e, t, n, o), i = Fa(e, t), a = Ua(t, n.categories.lumped, e), { map: c } = n;
+    return Ga(t, n);
+  const s = Ma(e), o = nt(n.scale, n.context), r = Ua(e, t, n, o), i = Va(e, t), a = Ba(t, n.categories.lumped, e), { map: c } = n;
   return {
     palette: null,
     groups: o,
@@ -5161,9 +5161,9 @@ function Va(e, t, n) {
     }
   };
 }
-function Ba(e, t) {
-  const n = Ts(e.palette) ?? Number.POSITIVE_INFINITY, s = new Map(
-    t.categories.categories.map((o, r) => [o, Ps[Math.floor(r / n)]])
+function Ga(e, t) {
+  const n = Ps(e.palette) ?? Number.POSITIVE_INFINITY, s = new Map(
+    t.categories.categories.map((o, r) => [o, $s[Math.floor(r / n)]])
   );
   return {
     palette: null,
@@ -5174,22 +5174,22 @@ function Ba(e, t) {
     }
   };
 }
-function qa(e, t, n) {
+function Wa(e, t, n) {
   const { overflow: s } = t;
   if (s === "shape" && e.target === "edge")
     throw ne(
       `overflow "shape" draws the groups past the palette in other node shapes, and an edge has no shape, so ${e.channel} cannot use it. Use "other" or "extend".`,
       { channel: e.channel, overflow: s }
     );
-  const o = Ts(t.palette);
-  return n || o === null || s !== "other" && s !== "shape" ? Number.POSITIVE_INFINITY : s === "other" ? o : o * Ps.length;
+  const o = Ps(t.palette);
+  return n || o === null || s !== "other" && s !== "shape" ? Number.POSITIVE_INFINITY : s === "other" ? o : o * $s.length;
 }
-function Ga(e) {
+function Ya(e) {
   const t = [];
   return e.unreadable > 0 && t.push(`${String(e.unreadable)} carry no value the scale can read`), e.other > 0 && t.push(`${String(e.other)} lumped into "other"`), e.unmeasured > 0 && t.push(`not measured (${String(e.unmeasured)})`), t;
 }
-function Wa(e, t, n) {
-  const s = e.accepts === "color" ? za(e, t, n) : Va(e, t, n), o = {
+function Ha(e, t, n) {
+  const s = e.accepts === "color" ? Fa(e, t, n) : qa(e, t, n), o = {
     seen: n.facts.seen,
     unreadable: n.facts.unreadable,
     notPlottable: n.settled.notPlottable,
@@ -5207,12 +5207,12 @@ function Wa(e, t, n) {
     lumped: n.categories.lumped,
     groups: s.groups,
     counts: o,
-    departures: Object.freeze([...n.settled.departures, ...Ga(o)]),
+    departures: Object.freeze([...n.settled.departures, ...Ya(o)]),
     paint: s.paint
   };
 }
-function Ya(e, t, n) {
-  const s = t.scale ?? Ma(e.accepts), o = n.scales.require(s), r = n.scales.describe(s);
+function Ka(e, t, n) {
+  const s = t.scale ?? Da(e.accepts), o = n.scales.require(s), r = n.scales.describe(s);
   if (r === void 0)
     throw new _({
       code: "E_INTERNAL",
@@ -5221,20 +5221,20 @@ function Ya(e, t, n) {
       details: { scale: s }
     });
   const i = r.domainKind === "numeric";
-  if (Ra(e, s, i), Da(t, s, i, n.column !== void 0), i && t.other !== void 0)
+  if (xa(e, s, i), ja(t, s, i, n.column !== void 0), i && t.other !== void 0)
     throw ne(
       `An "other" bucket lumps the rarest categories together, and the "${s}" scale reads numbers rather than categories.`,
       { scale: s, other: t.other }
     );
-  const a = Sa(n.column, i), c = Ta(a, t.other, qa(e, t, i)), l = {
+  const a = Ca(n.column, i), c = $a(a, t.other, Wa(e, t, i)), l = {
     reverse: t.reverse,
     midpoint: t.midpoint,
     bins: t.bins,
     exponent: t.exponent,
     categories: c.categories,
-    thresholds: Ds(s).thresholds ? ha(a.sorted, t.bins ?? Oa) : void 0
-  }, g = i ? _a(t, a, o, l, s) : { domain: [0, 1], notPlottable: 0, clamped: 0, departures: [] };
-  return Wa(e, t, {
+    thresholds: xs(s).thresholds ? ma(a.sorted, t.bins ?? Na) : void 0
+  }, g = i ? Ta(t, a, o, l, s) : { domain: [0, 1], notPlottable: 0, clamped: 0, departures: [] };
+  return Ha(e, t, {
     scale: s,
     map: o,
     scales: n.scales,
@@ -5246,32 +5246,32 @@ function Ya(e, t, n) {
     unmeasured: n.unmeasured ?? 0
   });
 }
-function Ha(e) {
-  const t = $s(e.channel), { binding: n } = e;
-  return "value" in n ? ka(t, n) : Ya(t, n, e);
+function Qa(e) {
+  const t = ks(e.channel), { binding: n } = e;
+  return "value" in n ? Ra(t, n) : Ka(t, n, e);
 }
-const Ka = {
+const Xa = {
   community: "ordinal",
   "layered-grouping": "ordinal",
   "category-table": "ordinal"
 };
-function Qa(e, t, n, s) {
+function Ja(e, t, n, s) {
   if (s === "text" || s === "boolean")
     return "passthrough";
-  const o = n ? Ka[t] : void 0;
+  const o = n ? Xa[t] : void 0;
   return o !== void 0 ? o : e.type === "string" || e.type === "boolean" ? "ordinal" : "linear";
 }
 function pe(e, t) {
   return new _({ code: "E_BAD_COMMAND", message: e, source: "style", details: t });
 }
-function Xa(e) {
+function Za(e) {
   return typeof e == "string" ? e : "runId" in e ? e.runId : e.id;
 }
-function Ja(e, t) {
+function ec(e, t) {
   const n = t.run(e.run);
   if (n !== void 0)
     return n;
-  const s = Xa(e.run), o = t.runIds();
+  const s = Za(e.run), o = t.runIds();
   throw new _({
     code: "E_UNKNOWN_RUN",
     message: `There is no run called "${s}" in this session.`,
@@ -5279,7 +5279,7 @@ function Ja(e, t) {
     details: { run: s, available: o, candidates: tt(s, o) }
   });
 }
-function Za(e, t) {
+function tc(e, t) {
   const { layer: n } = Me(e.shape);
   if (n === "none")
     throw pe(
@@ -5292,7 +5292,7 @@ function Za(e, t) {
       { run: e.id, shape: e.shape }
     );
 }
-function ec(e, t, n) {
+function nc(e, t, n) {
   const { primaryField: s } = Me(t.shape), o = e.field ?? s;
   if (o == null)
     throw pe(`A "${t.shape}" result has no primary field, so the field to encode has to be named.`, {
@@ -5309,9 +5309,9 @@ function ec(e, t, n) {
       details: { run: t.id, field: o, available: i, candidates: tt(o, i) }
     });
   }
-  return tc(r, t, n), { field: r, primary: o === s };
+  return sc(r, t, n), { field: r, primary: o === s };
 }
-function tc(e, t, n) {
+function sc(e, t, n) {
   if (e.kind === "graph")
     throw pe(
       `"${e.name}" is one number for the whole graph, so there is nothing per element for ${n.channel} to read.`,
@@ -5329,16 +5329,16 @@ function tc(e, t, n) {
       channel: n.channel
     });
 }
-function nc(e, t, n, s) {
+function oc(e, t, n, s) {
   const o = { by: t, scale: n };
   s.accepts === "color" && e.palette !== void 0 && (o.palette = e.palette), e.domain !== void 0 && (o.domain = e.domain), e.clamp !== void 0 && (o.clamp = e.clamp), e.range !== void 0 && (o.range = e.range), e.missing !== void 0 && (o.missing = e.missing), e.reverse !== void 0 && (o.reverse = e.reverse);
-  const r = sc(e, n, s);
+  const r = rc(e, n, s);
   return r !== void 0 && (o.overflow = r), o;
 }
-function sc(e, t, n) {
-  return n.accepts !== "color" ? void 0 : e.overflow !== void 0 ? e.overflow : _o(t)?.domainKind === "categorical" && e.palette === void 0 ? "other" : void 0;
+function rc(e, t, n) {
+  return n.accepts !== "color" ? void 0 : e.overflow !== void 0 ? e.overflow : To(t)?.domainKind === "categorical" && e.palette === void 0 ? "other" : void 0;
 }
-function oc(e, t, n) {
+function ic(e, t, n) {
   if (t.overflow !== "shape")
     return {};
   if (n.target === "edge")
@@ -5349,25 +5349,25 @@ function oc(e, t, n) {
   const s = { by: t.by, scale: t.scale, overflow: "shape" };
   return t.palette !== void 0 && (s.palette = t.palette), { "node.shape": s };
 }
-function rc(e, t) {
-  const n = $s(e.channel), s = Ja(e, t), { primaryField: o } = Me(s.shape);
-  Za(s, (e.field ?? o) === o);
-  const { field: r, primary: i } = ec(e, s, n), a = Ft(s.id, r.name), c = e.scale ?? Qa(r, s.shape, i, n.accepts), l = nc(e, a, c, n);
+function ac(e, t) {
+  const n = ks(e.channel), s = ec(e, t), { primaryField: o } = Me(s.shape);
+  tc(s, (e.field ?? o) === o);
+  const { field: r, primary: i } = nc(e, s, n), a = Lt(s.id, r.name), c = e.scale ?? Ja(r, s.shape, i, n.accepts), l = oc(e, a, c, n);
   return {
     name: e.name ?? `${s.label} - ${n.plainName}`,
     target: n.target,
     kind: "encoding",
     selector: { match: "has", path: a },
-    encode: { [e.channel]: l, ...oc(e, l, n) },
+    encode: { [e.channel]: l, ...ic(e, l, n) },
     source: { by: "run", runId: s.id, algorithm: s.algorithm, params: s.params }
   };
 }
-const ic = Object.freeze({
+const cc = Object.freeze({
   merged: Object.freeze({}),
   contributions: Object.freeze([]),
   channels: Object.freeze([])
-}), Pn = Object.freeze([]);
-function $n(e) {
+}), Tn = Object.freeze([]);
+function Pn(e) {
   const t = "node" in e ? "node" : "edge", n = "node" in e ? e.node : e.edge;
   return new _({
     code: "E_BAD_COMMAND",
@@ -5376,7 +5376,7 @@ function $n(e) {
     details: { kind: t, id: n }
   });
 }
-function Pt(e, t, n) {
+function $n(e, t, n) {
   return new _({
     code: "E_BAD_COMMAND",
     message: e,
@@ -5385,33 +5385,33 @@ function Pt(e, t, n) {
     details: n
   });
 }
-function js(e, t) {
+function zs(e, t) {
   if ("node" in e) {
     const s = t.nodeIndex(e.node);
     if (s === void 0)
-      throw $n(e);
+      throw Pn(e);
     return { target: "node", index: s };
   }
   const n = t.edgeIndex(e.edge);
   if (n === void 0)
-    throw $n(e);
+    throw Pn(e);
   return { target: "edge", index: n };
 }
-function ac(e, t) {
+function lc(e, t) {
   const { layer: n, selector: s } = e;
   return !n.enabled || n.target !== t.target ? !1 : s.test === null || s.test(t.index);
 }
-function cc(e, t) {
+function uc(e, t) {
   const { layer: n, mode: s, path: o } = e;
   if (n.locked)
     return `"${n.name}" belongs to the element, so it cannot be edited. Add a layer of your own above it instead.`;
   if (s === "encoded")
     return `"${n.name}" works ${t} out from "${String(o)}", so a fixed value written here would be replaced the next time the layer paints. Resolve the rule to a fixed value first.`;
 }
-function lc(e, t) {
-  const n = js(e, t), s = ke(t.elements, n.target), o = {}, r = o, i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), c = [];
+function dc(e, t) {
+  const n = zs(e, t), s = ke(t.elements, n.target), o = {}, r = o, i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), c = [];
   for (const h of t.stack()) {
-    if (!ac(h, n))
+    if (!lc(h, n))
       continue;
     const { layer: y } = h;
     for (const P of t.encoding(y.id)) {
@@ -5425,7 +5425,7 @@ function lc(e, t) {
     }
   }
   if (c.length === 0)
-    return ic;
+    return cc;
   const l = c.map(
     (h) => ({
       layerId: h.layer.id,
@@ -5438,7 +5438,7 @@ function lc(e, t) {
     const y = i.get(h);
     if (y === void 0)
       continue;
-    const P = cc(y, h);
+    const P = uc(y, h);
     g.push({
       channel: h,
       layerId: y.layer.id,
@@ -5453,10 +5453,10 @@ function lc(e, t) {
     channels: Object.freeze(g)
   };
 }
-function uc(e) {
+function hc(e) {
   const t = e.paths;
   if (t === void 0)
-    return Pn;
+    return Tn;
   const n = [];
   for (const s of e.stack()) {
     const { layer: o, selector: r } = s, i = new Set(r.paths);
@@ -5471,9 +5471,9 @@ function uc(e) {
       needs: Object.freeze(a)
     });
   }
-  return n.length === 0 ? Pn : Object.freeze(n);
+  return n.length === 0 ? Tn : Object.freeze(n);
 }
-function dc(e) {
+function fc(e) {
   const [t] = e.categories;
   if (t !== void 0)
     return t;
@@ -5482,24 +5482,27 @@ function dc(e) {
   const [n, s] = e.domain;
   return n + (s - n) / 2;
 }
-function hc(e) {
+function mc(e) {
   return typeof e == "object" && e !== null && "hex" in e && typeof e.hex == "string" ? e.hex : e;
 }
-function fc(e, t, n) {
-  const s = js(t, n);
+function gc(e, t, n) {
+  const s = zs(t, n);
   return ke(n.elements, s.target).value(s.index, e);
 }
-function mc(e, t) {
+function pc(e, t) {
   const n = t.stack(), s = n.find((o) => o.layer.id === e);
   if (s === void 0)
-    throw Pt(`There is no style layer with the id "${e}".`, e, {
-      id: e,
-      known: n.map((o) => o.layer.id)
+    throw new _({
+      code: "E_UNKNOWN_LAYER",
+      message: `There is no style layer with the id "${e}".`,
+      source: "style",
+      target: { kind: "layer", id: e },
+      details: { id: e, known: n.map((o) => o.layer.id) }
     });
   return s.layer;
 }
-function gc(e, t, n, s) {
-  const o = mc(e, n);
+function bc(e, t, n, s) {
+  const o = pc(e, n);
   if (o.locked)
     throw new _({
       code: "E_PROTECTED",
@@ -5510,19 +5513,19 @@ function gc(e, t, n, s) {
     });
   const r = n.encoding(e).find((h) => h.channel === t && h.path !== null), i = r?.path;
   if (r === void 0 || i === null || i === void 0)
-    throw Pt(
+    throw $n(
       `"${o.name}" does not work ${t} out from the data, so there is no rule to resolve.`,
       e,
       { id: e, channel: t }
     );
-  const a = s === void 0 ? dc(r) : fc(i, s, n), c = r.paint(a);
+  const a = s === void 0 ? fc(r) : gc(i, s, n), c = r.paint(a);
   if (c === void 0)
-    throw Pt(
+    throw $n(
       `"${o.name}" paints nothing for ${t} at the value it was asked about, so there is no fixed value to take.`,
       e,
       { id: e, channel: t, value: a }
     );
-  const l = hc(c), g = {};
+  const l = mc(c), g = {};
   for (const [h, y] of Object.entries(o.encode ?? {}))
     h !== t && y !== void 0 && cs(h) && (g[h] = y);
   return {
@@ -5535,7 +5538,7 @@ function gc(e, t, n, s) {
     }
   };
 }
-const kn = Object.freeze([]), mt = ["everything", "expression", "has", "ids", "top"], pc = "results.";
+const kn = Object.freeze([]), mt = ["everything", "expression", "has", "ids", "top"], vc = "results.";
 function oe(e, t) {
   return new _({ code: "E_BAD_SELECTOR", message: e, source: "style", details: t });
 }
@@ -5560,7 +5563,7 @@ function Rn(e, t) {
       value: e[n]
     });
 }
-function bc(e) {
+function yc(e) {
   const t = e;
   if (typeof t == "string") {
     const s = t === "" ? 'The empty string matched every element, so write { match: "everything" } if that is what it meant.' : `Write { match: "expression", where: ${JSON.stringify(t)} }.`;
@@ -5593,7 +5596,7 @@ function bc(e) {
       Rn(e.nodes, "nodes"), Rn(e.edges, "edges");
       return;
     case "top":
-      if (typeof e.path != "string" || !e.path.startsWith(pc))
+      if (typeof e.path != "string" || !e.path.startsWith(vc))
         throw oe(
           `A "top" selector ranks a run's field, so its path is "results.<run>.<field>", such as "results.degree.value".`,
           { path: e.path }
@@ -5605,17 +5608,17 @@ function bc(e) {
       throw oe(`"${String(n)}" is not a selector kind.`, { match: n, kinds: mt });
   }
 }
-function vc(e, t, n) {
-  bc(e);
+function wc(e, t, n) {
+  yc(e);
   const s = ke(n, t);
   switch (e.match) {
     case "everything":
       return { match: "everything", target: t, test: null, paths: kn };
     case "has":
-      return { match: "has", target: t, test: wo(s, e.path), paths: Object.freeze([e.path]) };
+      return { match: "has", target: t, test: Eo(s, e.path), paths: Object.freeze([e.path]) };
     case "ids": {
       const o = t === "node" ? e.nodes : e.edges, r = new Set(o ?? []);
-      return { match: "ids", target: t, test: yo(s, r), paths: kn };
+      return { match: "ids", target: t, test: Oo(s, r), paths: kn };
     }
     case "top": {
       const { topCut: o } = n, { path: r, n: i } = e;
@@ -5629,7 +5632,7 @@ function vc(e, t, n) {
       return {
         match: "top",
         target: t,
-        test: vo(s, r, () => o(r, t, i)),
+        test: wo(s, r, () => o(r, t, i)),
         paths: Object.freeze([r])
       };
     }
@@ -5639,24 +5642,24 @@ function vc(e, t, n) {
     }
   }
 }
-const yc = "layer", wc = "results.", Dn = Object.freeze(["other", "shape", "extend"]), Oc = Object.freeze({ by: "user" }), Ec = Object.freeze([]), Nc = Object.freeze([]);
-function Sc(e, t) {
-  const n = e.toLowerCase().replace(/[^a-z0-9_-]+/g, "-").replace(/^[^a-z]+/, "").replace(/[-_]+$/, ""), s = n === "" ? yc : n;
+const Oc = "layer", Ec = "results.", Dn = Object.freeze(["other", "shape", "extend"]), Nc = Object.freeze({ by: "user" }), Sc = Object.freeze([]), Ac = Object.freeze([]);
+function Cc(e, t) {
+  const n = e.toLowerCase().replace(/[^a-z0-9_-]+/g, "-").replace(/^[^a-z]+/, "").replace(/[-_]+$/, ""), s = n === "" ? Oc : n;
   let o = 1, r = `${s}_${String(o)}`;
   for (; t.has(r); )
     o++, r = `${s}_${String(o)}`;
   return r;
 }
 function _e(e) {
-  return e.source ?? Oc;
+  return e.source ?? Nc;
 }
 function qe(e) {
   return e.by === "element";
 }
-function Ac(e) {
+function _c(e) {
   return e.startsWith("node.") ? "node" : e.startsWith("edge.") ? "edge" : null;
 }
-function Cc(e) {
+function Ic(e) {
   const t = /* @__PURE__ */ new Set();
   for (const n of Object.keys(e.set ?? {}))
     t.add(n);
@@ -5664,7 +5667,7 @@ function Cc(e) {
     t.add(n);
   return [...t];
 }
-function _c(e) {
+function Tc(e) {
   if (typeof e == "string")
     return e;
   if (typeof e != "object" || e === null)
@@ -5675,11 +5678,11 @@ function _c(e) {
 function Q(e, t) {
   e.problems.push(t);
 }
-function zs(e, t) {
+function Ls(e, t) {
   t !== "" && !e.paths.includes(t) && e.paths.push(t);
 }
-function Ic(e, t) {
-  if (!zt(e))
+function Pc(e, t) {
+  if (!jt(e))
     return {
       code: "E_BAD_LAYER",
       message: e instanceof Error ? e.message : String(e),
@@ -5693,22 +5696,22 @@ function Ic(e, t) {
     ...typeof n == "number" ? { position: n } : {}
   };
 }
-function Ls(e, t, n) {
+function Fs(e, t, n) {
   switch (e.accepts) {
     case "color":
-      return me(_c(t)) === null ? {
+      return me(Tc(t)) === null ? {
         code: "E_BAD_LAYER",
         message: `${e.plainName} takes a colour, such as "#ff9900" or "orange".`,
         path: n
       } : null;
     case "number":
-      return Tc(e, t, n);
+      return $c(e, t, n);
     case "text":
       return typeof t == "string" ? null : { code: "E_BAD_LAYER", message: `${e.plainName} takes text.`, path: n };
     case "boolean":
       return typeof t == "boolean" ? null : { code: "E_BAD_LAYER", message: `${e.plainName} is on or off.`, path: n };
     case "enum":
-      return Pc(e, t, n);
+      return kc(e, t, n);
     case "labelStyle":
       return typeof t == "object" && t !== null && !Array.isArray(t) ? null : {
         code: "E_BAD_LAYER",
@@ -5723,7 +5726,7 @@ function Ls(e, t, n) {
       };
   }
 }
-function Tc(e, t, n) {
+function $c(e, t, n) {
   if (typeof t != "number" || !Number.isFinite(t))
     return { code: "E_BAD_LAYER", message: `${e.plainName} takes a number.`, path: n };
   const { min: s, max: o } = e, r = s !== void 0 && t < s, i = o !== void 0 && t > o;
@@ -5736,7 +5739,7 @@ function Tc(e, t, n) {
     path: n
   };
 }
-function Pc(e, t, n) {
+function kc(e, t, n) {
   const s = e.values ?? [];
   return typeof t == "string" && s.includes(t) ? null : {
     code: "E_OPTION_RANGE",
@@ -5768,9 +5771,9 @@ function xn(e, t, n, s) {
     path: n
   }), null);
 }
-function $c(e, t, n, s, o, r) {
+function Mc(e, t, n, s, o, r) {
   if (!("by" in t)) {
-    const i = Ls(e, t.value, `${n}.value`);
+    const i = Fs(e, t.value, `${n}.value`);
     i !== null && Q(r, i);
     return;
   }
@@ -5782,7 +5785,7 @@ function $c(e, t, n, s, o, r) {
     });
     return;
   }
-  zs(r, t.by), t.scale !== void 0 && s.scales.get(t.scale) === void 0 && Q(r, {
+  Ls(r, t.by), t.scale !== void 0 && s.scales.get(t.scale) === void 0 && Q(r, {
     code: "E_UNKNOWN_SCALE",
     message: `There is no scale called "${t.scale}".`,
     path: `${n}.scale`,
@@ -5791,7 +5794,7 @@ function $c(e, t, n, s, o, r) {
     code: "E_UNKNOWN_PALETTE",
     message: `There is no palette called "${t.palette}".`,
     path: `${n}.palette`,
-    candidates: Ut()
+    candidates: Ft()
   }), t.overflow !== void 0 && !Dn.includes(t.overflow) ? Q(r, {
     code: "E_BAD_LAYER",
     message: `"${t.overflow}" is not an overflow policy.`,
@@ -5802,13 +5805,13 @@ function $c(e, t, n, s, o, r) {
     message: `overflow "shape" draws the groups past the palette in other node shapes, and an edge has no shape, so ${e.channel} cannot use it. Use "other" or "extend".`,
     path: `${n}.overflow`,
     candidates: ["other", "extend"]
-  }), o && t.by.startsWith(wc) && Q(r, {
+  }), o && t.by.startsWith(Ec) && Q(r, {
     code: "E_UNSCOPED_RUN_ENCODING",
     message: `This layer paints every ${e.target} and encodes ${e.channel} from "${t.by}", which would paint elements the run never measured. Scope it to the elements that carry the result with { match: "has", path: "${t.by}" }.`,
     path: "selector"
   });
 }
-function kc(e, t, n) {
+function Rc(e, t, n) {
   if (e.target === "node" || e.target === "edge")
     return e.target;
   if (e.target !== void 0)
@@ -5817,14 +5820,14 @@ function kc(e, t, n) {
       message: 'A layer paints "node" or "edge".',
       path: "target"
     }), null;
-  const s = new Set(t.map(Ac).filter((o) => o !== null));
+  const s = new Set(t.map(_c).filter((o) => o !== null));
   return s.size === 1 ? [...s][0] ?? null : (s.size > 1 && Q(n, {
     code: "E_BAD_LAYER",
     message: "A layer paints nodes or edges, not both. Name the target and split the layer in two.",
     path: "target"
   }), null);
 }
-function Mc(e, t, n) {
+function Dc(e, t, n) {
   (typeof e.name != "string" || e.name.trim() === "") && Q(n, {
     code: "E_BAD_LAYER",
     message: "A layer needs a name, which is what a layer list shows and what an id is built from.",
@@ -5846,35 +5849,35 @@ function Mc(e, t, n) {
       path: `encode.${s}`
     });
 }
-function Rc(e, t, n, s) {
+function xc(e, t, n, s) {
   try {
-    const o = vc(e.selector, t ?? "node", n.elements);
+    const o = wc(e.selector, t ?? "node", n.elements);
     for (const r of o.paths)
-      zs(s, r);
+      Ls(s, r);
     return o;
   } catch (o) {
-    return Q(s, Ic(o, "selector")), null;
+    return Q(s, Pc(o, "selector")), null;
   }
 }
-function Dc(e, t, n, s, o) {
+function jc(e, t, n, s, o) {
   for (const [r, i] of Object.entries(e.set ?? {})) {
     const a = `set.${r}`, c = xn(r, t, a, o);
     if (c !== null && i !== void 0) {
-      const l = Ls(c, i, a);
+      const l = Fs(c, i, a);
       l !== null && Q(o, l);
     }
   }
   for (const [r, i] of Object.entries(e.encode ?? {})) {
     const a = `encode.${r}`, c = xn(r, t, a, o);
-    c !== null && i !== void 0 && $c(c, i, a, s, n, o);
+    c !== null && i !== void 0 && Mc(c, i, a, s, n, o);
   }
 }
-function xc(e, t) {
-  const n = { problems: [], paths: [] }, s = Cc(e), o = kc(e, s, n);
-  Mc(e, s, n);
-  const r = typeof e.selector == "object" && e.selector !== null && e.selector.match === "everything", i = Rc(e, o, t, n);
-  Dc(e, o, r, t, n);
-  const a = t.paths, c = a === void 0 || o === null ? Ec : Object.freeze(n.paths.filter((l) => !a.answers(l, o)));
+function zc(e, t) {
+  const n = { problems: [], paths: [] }, s = Ic(e), o = Rc(e, s, n);
+  Dc(e, s, n);
+  const r = typeof e.selector == "object" && e.selector !== null && e.selector.match === "everything", i = xc(e, o, t, n);
+  jc(e, o, r, t, n);
+  const a = t.paths, c = a === void 0 || o === null ? Sc : Object.freeze(n.paths.filter((l) => !a.answers(l, o)));
   return n.problems.length > 0 || i === null || o === null ? {
     result: Object.freeze({
       ok: !1,
@@ -5883,11 +5886,11 @@ function xc(e, t) {
     }),
     layer: null
   } : {
-    result: Object.freeze({ ok: !0, errors: Nc, unresolvedPaths: c }),
-    layer: jc(e, t.id, o, i)
+    result: Object.freeze({ ok: !0, errors: Ac, unresolvedPaths: c }),
+    layer: Lc(e, t.id, o, i)
   };
 }
-function jc(e, t, n, s) {
+function Lc(e, t, n, s) {
   const o = _e(e), r = Object.freeze({
     id: t,
     name: e.name,
@@ -5918,34 +5921,34 @@ function jn(e) {
     ...e.userData === void 0 ? {} : { userData: e.userData }
   };
 }
-const zn = 12, zc = 7, Lc = 256, Fc = 8, Uc = Object.freeze([]);
+const zn = 12, Fc = 7, Uc = 256, Vc = 8, Bc = Object.freeze([]);
 function Oe(e) {
   if (!Number.isFinite(e) || Number.isInteger(e) && Math.abs(e) < 1e7)
     return String(e);
   const t = Math.abs(e);
   return t >= 1e7 || t > 0 && t < 1e-3 ? e.toExponential(2) : String(Number(e.toPrecision(4)));
 }
-function Vc(e) {
+function qc(e) {
   const t = e.split("."), o = (t[t.length - 1] ?? e).replace(/([a-z\d])([A-Z])/g, "$1 $2").split(/[\s_-]+/u).filter((r) => r !== "").map((r) => r.charAt(0).toUpperCase() + r.slice(1)).join(" ");
   return { plainName: o === "" ? e : o, technicalName: e };
 }
-function Bc(e, t, n) {
-  return n.field?.(e, t) ?? Vc(e);
+function Gc(e, t, n) {
+  return n.field?.(e, t) ?? qc(e);
 }
-function Fs(e) {
+function Us(e) {
   return typeof e == "object" && e !== null && "hex" in e && typeof e.hex == "string";
 }
 function $e(e) {
-  return e === void 0 ? {} : Fs(e) ? { color: e.hex } : typeof e == "number" ? { size: e } : { paints: e };
+  return e === void 0 ? {} : Us(e) ? { color: e.hex } : typeof e == "number" ? { size: e } : { paints: e };
 }
-function qc(e) {
-  return e === void 0 ? null : Fs(e) ? e.hex : typeof e == "object" ? JSON.stringify(e) : String(e);
+function Wc(e) {
+  return e === void 0 ? null : Us(e) ? e.hex : typeof e == "object" ? JSON.stringify(e) : String(e);
 }
-function Gc(e, t) {
-  const [n, s] = t, o = s - n, r = Math.max(Lc, e.groups * Fc), i = [];
+function Yc(e, t) {
+  const [n, s] = t, o = s - n, r = Math.max(Uc, e.groups * Vc), i = [];
   let a = null;
   for (let c = 0; c < r; c++) {
-    const l = o === 0 ? n : n + o * c / (r - 1), g = e.paint(l), h = qc(g);
+    const l = o === 0 ? n : n + o * c / (r - 1), g = e.paint(l), h = Wc(g);
     if (h === null || g === void 0) {
       a = null;
       continue;
@@ -5959,48 +5962,52 @@ function Gc(e, t) {
   }
   return i;
 }
-function Wc(e) {
-  const t = e.categories.map((o) => ({
-    label: o,
-    value: o,
-    ...$e(e.paint(o))
-  })), { lumped: n } = e, s = n.length > 0 ? e.paint(n[0]) : void 0;
-  return s !== void 0 && t.push({
-    label: `other: ${String(n.length)} ${n.length === 1 ? "group" : "groups"}`,
-    value: n,
-    ...$e(s)
-  }), t;
+function Hc(e) {
+  const t = e?.split(".") ?? [];
+  return t.length === 3 && t[0] === ds && t[2] === "group";
+}
+function Kc(e) {
+  const t = Hc(e.path), n = e.categories.map((r, i) => ({
+    label: t ? No(i + 1) : r,
+    value: r,
+    ...$e(e.paint(r))
+  })), { lumped: s } = e, o = s.length > 0 ? e.paint(s[0]) : void 0;
+  return o !== void 0 && n.push({
+    label: `other: ${String(s.length)} ${s.length === 1 ? "group" : "groups"}`,
+    value: s,
+    ...$e(o)
+  }), n;
 }
-function Yc(e, t) {
-  return Gc(e, t).map((n) => ({
+function Qc(e, t) {
+  return Yc(e, t).map((n) => ({
     label: n.from === n.to ? Oe(n.from) : `${Oe(n.from)} - ${Oe(n.to)}`,
     value: n.from,
     ...$e(n.painted)
   }));
 }
-function Hc(e, t) {
-  const [n, s] = t, o = s - n, r = o === 0 ? 1 : zc, i = [];
+function Xc(e, t) {
+  const [n, s] = t, o = s - n, r = o === 0 ? 1 : Fc, i = [];
   for (let a = 0; a < r; a++) {
     const c = r === 1 ? n : n + o * a / (r - 1);
     i.push({ label: Oe(c), value: c, ...$e(e.paint(c)) });
   }
   return i;
 }
-function Kc(e, t) {
+function Jc(e, t) {
   const n = e.paint(void 0);
   return n === void 0 ? [] : [{ label: t.name, value: t.set?.[e.channel], ...$e(n) }];
 }
-function Qc(e, t) {
-  return e.path === null ? Kc(e, t) : e.categories.length > 0 ? Wc(e) : e.domain === null ? [] : e.groups > 0 ? Yc(e, e.domain) : Hc(e, e.domain);
+function Zc(e, t) {
+  return e.path === null ? Jc(e, t) : e.categories.length > 0 ? Kc(e) : e.domain === null ? [] : e.groups > 0 ? Qc(e, e.domain) : Xc(e, e.domain);
 }
-function Xc(e, t) {
+function el(e, t) {
   return e.path === null ? t.kind === "highlight" ? "highlight" : "literal" : e.palette !== null ? e.palette.kind : e.categories.length > 0 ? "categorical" : "sequential";
 }
-function Jc(e, t) {
+function tl(e, t) {
   const n = e.encode?.[t];
   return n !== void 0 && "by" in n ? n : void 0;
 }
-function Zc(e, t) {
+function nl(e, t) {
   if (e.domain === null)
     return;
   const [n, s] = e.domain, o = t?.midpoint, r = t?.clamp;
@@ -6011,7 +6018,7 @@ function Zc(e, t) {
     ...r === void 0 ? {} : { clamped: { from: `p${Oe(r[0])}`, to: `p${Oe(r[1])}` } }
   };
 }
-function el(e, t, n, s) {
+function sl(e, t, n, s) {
   const o = e[t];
   for (let r = t + 1; r < e.length; r++) {
     const i = e[r], a = i.set?.[n] !== void 0 || i.encode?.[n] !== void 0;
@@ -6020,50 +6027,50 @@ function el(e, t, n, s) {
   }
   return null;
 }
-function tl(e, t, n, s) {
-  const o = el(t, n, e.channel, s);
+function ol(e, t, n, s) {
+  const o = sl(t, n, e.channel, s);
   return o === null ? e.departures : [...e.departures, `painted over by "${o}"`];
 }
-function nl(e, t, n, s, o) {
-  const { channel: r } = t, i = Jc(e, r), a = Qc(t, e), c = Math.max(0, a.length - zn), { path: l, scale: g } = t, h = Zc(t, i);
+function rl(e, t, n, s, o) {
+  const { channel: r } = t, i = tl(e, r), a = Zc(t, e), c = Math.max(0, a.length - zn), { path: l, scale: g } = t, h = nl(t, i);
   return {
     channel: r,
     layerId: e.id,
     ...e.source.by === "run" ? { runId: e.source.runId } : {},
-    kind: Xc(t, e),
-    ...l === null ? {} : { field: { ...Bc(l, e.target, o), path: l } },
+    kind: el(t, e),
+    ...l === null ? {} : { field: { ...Gc(l, e.target, o), path: l } },
     ...g === null ? {} : { scale: { kind: g, label: o.scales.describe(g)?.plainName ?? g } },
     ...h === void 0 ? {} : { domain: h },
     ...t.palette === null ? {} : { palette: { name: t.palette.id, reversed: i?.reverse === !0 } },
     swatches: Object.freeze(a.slice(0, zn)),
     ...c === 0 ? {} : { overflow: { hidden: c } },
-    departures: Object.freeze([...tl(t, n, s, o)])
+    departures: Object.freeze([...ol(t, n, s, o)])
   };
 }
-function sl(e) {
+function il(e) {
   const t = e.layers(), n = [];
   for (let s = 0; s < t.length; s++) {
     const o = t[s];
     if (!(!o.enabled || o.kind === "base"))
       for (const r of e.encoding(o.id))
-        n.push(nl(o, r, t, s, e));
+        n.push(rl(o, r, t, s, e));
   }
-  return n.length === 0 ? Uc : Object.freeze(n);
+  return n.length === 0 ? Bc : Object.freeze(n);
 }
-const $t = "graph", ol = Object.freeze([]), rl = Object.freeze([]), gt = Object.freeze([]), il = Object.freeze([]), Ln = () => {
+const Pt = "graph", al = Object.freeze([]), cl = Object.freeze([]), gt = Object.freeze([]), ll = Object.freeze([]), Ln = () => {
 }, pt = {
   color: "#D55E00",
-  edgeWidth: eo.DEFAULT_LINE_WIDTH * 3
-}, kt = 1, al = Object.freeze(["node", "edge"]), cl = Object.freeze({
+  edgeWidth: to.DEFAULT_LINE_WIDTH * 3
+}, $t = 1, ul = Object.freeze(["node", "edge"]), dl = Object.freeze({
   direction: "as-loaded",
   exact: !0,
   method: "layer-stack",
-  notes: rl,
+  notes: cl,
   precision: "f64",
   seed: null,
   weight: null
 });
-function ll() {
+function hl() {
   return Object.freeze({
     digest: "",
     edgeCount: 0,
@@ -6071,12 +6078,12 @@ function ll() {
     nodeCount: 0,
     nodes: /* @__PURE__ */ new Set(),
     resolvedAt: (/* @__PURE__ */ new Date()).toISOString(),
-    spec: $t
+    spec: Pt
   });
 }
-function ul(e, t) {
+function fl(e, t) {
   return new _({
-    code: "E_BAD_COMMAND",
+    code: "E_UNKNOWN_LAYER",
     message: `There is no style layer with the id "${e}".`,
     source: "style",
     target: { kind: "layer", id: e },
@@ -6101,19 +6108,19 @@ function ye(e, t) {
     details: { errors: t.errors, unresolvedPaths: t.unresolvedPaths }
   });
 }
-function dl(e, t) {
+function ml(e, t) {
   return e.source !== void 0 || t === void 0 ? e : { ...e, source: { by: "template", templateId: t } };
 }
-function hl(e) {
+function gl(e) {
   const { version: t } = e;
-  if (t !== kt)
-    throw Mt(
-      `This element reads style documents of version ${String(kt)}, and this one says version ${String(t)}.`,
+  if (t !== $t)
+    throw kt(
+      `This element reads style documents of version ${String($t)}, and this one says version ${String(t)}.`,
       { version: t }
     );
   const n = (e.palettes ?? []).filter((s) => be(s.id) === void 0).map((s) => s.id);
   if (n.length > 0) {
-    const s = Ut();
+    const s = Ft();
     throw new _({
       code: "E_UNKNOWN_PALETTE",
       message: `Nothing has registered the palette ${n.map((o) => `"${o}"`).join(", ")}. Register it with \`registerPalette\` before applying this document; applying it now would paint colours nobody chose.`,
@@ -6122,24 +6129,24 @@ function hl(e) {
     });
   }
 }
-function fl(e) {
+function pl(e) {
   const t = /* @__PURE__ */ new Set();
   for (const s of e)
     for (const o of Object.values(s.encode ?? {}))
       o !== void 0 && "by" in o && o.palette !== void 0 && t.add(String(o.palette));
   const n = [];
   for (const s of t) {
-    if (hs.some((r) => r.id === s))
+    if (fs.some((r) => r.id === s))
       continue;
     const o = be(s);
     o !== void 0 && n.push(o);
   }
   return n;
 }
-function Mt(e, t) {
+function kt(e, t) {
   return new _({ code: "E_BAD_COMMAND", message: e, source: "style", details: t });
 }
-function ml(e) {
+function bl(e) {
   return new _({
     code: "E_UNSUPPORTED",
     message: `This session cannot look a run up, so styles.${e}() has nothing to bind to. Add a layer of your own with styles.add() instead.`,
@@ -6147,14 +6154,14 @@ function ml(e) {
     details: { op: `styles.${e}`, reason: "no runs are reachable from this session" }
   });
 }
-function gl(e) {
+function vl(e) {
   return typeof e == "string" ? e : "runId" in e ? e.runId : e.id;
 }
-function pl(e, t) {
+function yl(e, t) {
   const n = t.run(e);
   if (n !== void 0)
     return n;
-  const s = gl(e), o = t.runIds();
+  const s = vl(e), o = t.runIds();
   throw new _({
     code: "E_UNKNOWN_RUN",
     message: `There is no run called "${s}" in this session.`,
@@ -6162,16 +6169,16 @@ function pl(e, t) {
     details: { run: s, available: o, candidates: tt(s, o) }
   });
 }
-function bl(e, t, n) {
+function wl(e, t, n) {
   if (e.kind !== "encoding")
     return !1;
   const s = e.encode?.[n];
   if (s === void 0 || !("by" in s))
     return !1;
-  const o = Ft(t);
+  const o = Lt(t);
   return s.by === o || s.by.startsWith(`${o}.`);
 }
-function vl(e, t) {
+function Ol(e, t) {
   if (e === void 0)
     return t === "node" ? { "node.color": pt.color } : { "edge.color": pt.color, "edge.width": pt.edgeWidth };
   const n = {};
@@ -6179,14 +6186,14 @@ function vl(e, t) {
     cs(s) && s.startsWith(`${t}.`) && o !== void 0 && (n[s] = o);
   return Object.keys(n).length === 0 ? null : n;
 }
-function yl(e) {
-  const t = e.queue ?? Gt(), n = e.engine ?? He, s = e.scales ?? Ht();
+function El(e) {
+  const t = e.queue ?? qt(), n = e.engine ?? He, s = e.scales ?? Yt();
   let o = Object.freeze([]), r = /* @__PURE__ */ new Map(), i = null, a = 0;
   const c = (f) => {
     o = Object.freeze([...f]), r = new Map(o.map((I) => [I.layer.id, I])), i = null;
   }, l = () => (i ??= Object.freeze(o.map((f) => f.layer)), i), g = (f) => {
     const I = r.get(f);
-    return I === void 0 || e.encoding === void 0 ? il : e.encoding(I);
+    return I === void 0 || e.encoding === void 0 ? ll : e.encoding(I);
   }, h = {
     stack: () => o,
     encoding: g,
@@ -6220,17 +6227,17 @@ function yl(e) {
       scales: s,
       ...e.paths === void 0 ? {} : { paths: e.paths }
     };
-    return xc(f, C);
+    return zc(f, C);
   }, F = () => {
     const f = new Set(r.keys());
     return (I) => {
-      const C = Sc(typeof I == "string" ? I : "", f);
+      const C = Cc(typeof I == "string" ? I : "", f);
       return f.add(C), C;
     };
   }, U = (f) => F()(f), w = (f) => {
     const I = r.get(f);
     if (I === void 0)
-      throw ul(
+      throw fl(
         f,
         o.map((C) => C.layer.id)
       );
@@ -6254,7 +6261,7 @@ function yl(e) {
     // Never stale: the stack is the session's own state, so an edit's answer cannot go on
     // describing a stack that has changed underneath it.
     stale: () => null,
-    resolveScope: () => e.resolveScope?.($t) ?? ll(),
+    resolveScope: () => e.resolveScope?.(Pt) ?? hl(),
     enqueue: (I) => {
       const C = t.queueOperation("style-edit", I, { description: f });
       return {
@@ -6267,11 +6274,11 @@ function yl(e) {
     a++;
     const k = Object.freeze({ edit: a, verb: f }), V = [b.signal, e.disposed].filter((M) => M !== void 0), u = V.length > 1 ? AbortSignal.any(V) : V[0], m = {
       algorithm: `styles.${f}`,
-      caveats: cl,
+      caveats: dl,
       engine: n,
       exact: null,
-      fields: ol,
-      id: Ge({ algorithm: `styles.${f}`, exact: null, params: k, sample: null, scope: $t, seed: null }),
+      fields: al,
+      id: Ge({ algorithm: `styles.${f}`, exact: null, params: k, sample: null, scope: Pt, seed: null }),
       params: k,
       sample: null,
       seed: null,
@@ -6314,7 +6321,7 @@ function yl(e) {
   }, $ = (f) => {
     const { runs: I } = e;
     if (I === void 0)
-      throw ml(f);
+      throw bl(f);
     return I;
   }, A = (f, I, C) => {
     const v = P(f, C);
@@ -6447,7 +6454,7 @@ function yl(e) {
     },
     encode(f, I = {}) {
       return O("encode", "add", `Encode ${f.channel}`, () => {
-        const C = rc(f, $("encode")), v = _e(C), b = v.by === "run" ? o.find((E) => bl(E.layer, v.runId, f.channel)) : void 0;
+        const C = ac(f, $("encode")), v = _e(C), b = v.by === "run" ? o.find((E) => wl(E.layer, v.runId, f.channel)) : void 0;
         if (b === void 0)
           return A(C, o.length, U(C.name));
         const { id: k } = b.layer, V = P(C, k);
@@ -6467,9 +6474,9 @@ function yl(e) {
     },
     highlight(f, I = {}) {
       return O("highlight", "add", "Highlight a result", () => {
-        const C = pl(f.run, $("highlight"));
-        if (!Oo(C.shape))
-          throw Mt(
+        const C = yl(f.run, $("highlight"));
+        if (!So(C.shape))
+          throw kt(
             `A "${C.shape}" result measures every element rather than choosing some, so it is painted with encode() rather than highlighted.`,
             { run: C.id, shape: C.shape }
           );
@@ -6489,16 +6496,16 @@ function yl(e) {
           });
         }
         const k = /* @__PURE__ */ new Map();
-        for (const D of al) {
-          const q = b.some((K) => K.kind === D) ? vl(f.set, D) : null;
+        for (const D of ul) {
+          const q = b.some((K) => K.kind === D) ? Ol(f.set, D) : null;
           q !== null && k.set(D, q);
         }
         if (k.size === 0)
-          throw Mt(
+          throw kt(
             `The style names no channel that paints the ${b.map((D) => D.kind).join(" or ")} the run "${C.id}" chose, so the highlight would paint nothing.`,
             { run: C.id, field: v, set: f.set }
           );
-        const V = Ft(C.id, v), u = f.name ?? C.label, m = F(), E = [], M = /* @__PURE__ */ new Set();
+        const V = Lt(C.id, v), u = f.name ?? C.label, m = F(), E = [], M = /* @__PURE__ */ new Set();
         for (const [D, q] of k) {
           const K = {
             name: k.size > 1 ? `${u} (${D}s)` : u,
@@ -6508,7 +6515,7 @@ function yl(e) {
             // and did not choose, so a presence test would paint the whole
             // neighbourhood of a route in the colour of the route. The value is what
             // says "chosen", so the value is what is asked about.
-            selector: { match: "expression", where: `${Eo(V)} == \`true\`` },
+            selector: { match: "expression", where: `${Ao(V)} == \`true\`` },
             set: q,
             source: { by: "run", runId: C.id, algorithm: C.algorithm, params: C.params }
           }, H = P(K, m(K.name));
@@ -6534,16 +6541,16 @@ function yl(e) {
     },
     resolveToStatic(f, I, C, v = {}) {
       return O("resolve", "update", `Fix ${I} on layer ${f}`, () => {
-        const b = gc(f, I, h, C);
+        const b = bc(f, I, h, C);
         return S(f, b.patch);
       }, v);
     },
     applyTemplate(f, I = {}) {
       return O("template", "add", "Apply a style document", () => {
-        hl(f);
+        gl(f);
         const C = F(), v = [], b = /* @__PURE__ */ new Set();
         for (const m of f.layers) {
-          const E = dl(m, I.templateId);
+          const E = ml(m, I.templateId);
           if (qe(_e(E)))
             throw new _({
               code: "E_PROTECTED",
@@ -6558,7 +6565,7 @@ function yl(e) {
             b.add(R);
           v.push({ spec: E, compiled: M.layer });
         }
-        const k = uc({
+        const k = hc({
           ...h,
           stack: () => v.map((m) => m.compiled)
         }), V = new Set(k.map((m) => m.layerId)), u = v.map((m) => {
@@ -6585,18 +6592,18 @@ function yl(e) {
       }, I);
     },
     legend() {
-      return sl(y);
+      return il(y);
     },
     settled() {
       return e.queue?.settled() ?? Promise.resolve();
     },
     explain(f) {
-      return lc(f, h);
+      return dc(f, h);
     },
     toDocument() {
-      const f = o.filter((C) => !C.layer.locked).map((C) => jn(C.layer)), I = fl(f);
+      const f = o.filter((C) => !C.layer.locked).map((C) => jn(C.layer)), I = pl(f);
       return Object.freeze({
-        version: kt,
+        version: $t,
         layers: Object.freeze(f),
         // Written only when there is something to write, so a look that uses nothing but
         // the element's own palettes saves byte for byte what it saved before.
@@ -6605,7 +6612,7 @@ function yl(e) {
     }
   };
 }
-const wl = Object.freeze({
+const Nl = Object.freeze({
   // Geometry and material: a different value is a different source mesh.
   "node.size": "mesh",
   "node.shape": "mesh",
@@ -6674,22 +6681,22 @@ const wl = Object.freeze({
 });
 function Fn(e) {
   return Object.freeze(
-    Ie(e).map((t) => t.channel).filter((t) => wl[t] === "mesh")
+    Ie(e).map((t) => t.channel).filter((t) => Nl[t] === "mesh")
   );
 }
-const Ol = Object.freeze({
+const Sl = Object.freeze({
   node: Fn("node"),
   edge: Fn("edge")
 });
 function bt(e) {
-  return Ol[e];
+  return Sl[e];
 }
-const Un = 2166136261, El = 16777619, Nl = 0, Sl = 1, Al = 2, Vn = 3, Bn = 2 ** 24, qn = 16, Us = new ArrayBuffer(8), Cl = new Float64Array(Us), Gn = new Int32Array(Us);
-function _l(e) {
+const Un = 2166136261, Al = 16777619, Cl = 0, _l = 1, Il = 2, Vn = 3, Bn = 2 ** 24, qn = 16, Vs = new ArrayBuffer(8), Tl = new Float64Array(Vs), Gn = new Int32Array(Vs);
+function Pl(e) {
   let t = e ^ e >>> 16;
   return t = Math.imul(t, 2246822507), t ^= t >>> 13, t | 0;
 }
-function Il() {
+function $l() {
   let e = new Int32Array(qn), t = 0, n = Un;
   const s = /* @__PURE__ */ new Map();
   let o = new Int32Array(qn * 8), r = 0, i = 0;
@@ -6703,7 +6710,7 @@ function Il() {
       const S = new Int32Array(e.length * 2);
       S.set(e), e = S;
     }
-    e[t] = A, t++, n = Math.imul(n ^ A, El);
+    e[t] = A, t++, n = Math.imul(n ^ A, Al);
   }, p = () => {
     t = 0, n = Un;
   }, O = (A) => {
@@ -6750,20 +6757,20 @@ function Il() {
       p();
     },
     pushAbsent() {
-      d(Nl);
+      d(Cl);
     },
     pushNumber(A) {
-      Cl[0] = Number.isNaN(A) ? Number.NaN : A + 0, d(Vn), d(Gn[0]), d(Gn[1]);
+      Tl[0] = Number.isNaN(A) ? Number.NaN : A + 0, d(Vn), d(Gn[0]), d(Gn[1]);
     },
     pushFlag(A) {
-      d(A ? Al : Sl);
+      d(A ? Il : _l);
     },
     pushText(A) {
       let S = N.get(A);
       S === void 0 && (S = N.size + Vn + 1, N.set(A, S)), d(S);
     },
     end(A) {
-      const S = _l(n), j = s.get(S);
+      const S = Pl(n), j = s.get(S);
       if (j !== void 0) {
         for (const v of j)
           if (O(v))
@@ -6789,16 +6796,16 @@ function Il() {
     }
   };
 }
-const Wn = Object.freeze({}), Le = 4096, Tl = Object.freeze([]), Yn = 8, Ce = 1024, Vs = 0, Pl = 1, Bs = 2, $l = 2147483646;
-function kl(e) {
+const Wn = Object.freeze({}), Le = 4096, kl = Object.freeze([]), Yn = 8, Ce = 1024, Bs = 0, Ml = 1, qs = 2, Rl = 2147483646;
+function Dl(e) {
   const t = et(e)?.accepts;
   return t === "number" ? "number" : t === "labelStyle" ? "merge" : t === "boolean" ? "flag" : "ref";
 }
-function Ml(e, t) {
-  const n = kl(e);
+function xl(e, t) {
+  const n = Dl(e);
   return n === "number" ? { channel: e, kind: n, values: new Float64Array(t).fill(Number.NaN) } : n === "flag" ? { channel: e, kind: n, values: new Uint8Array(t) } : { channel: e, kind: n, values: new Array(t) };
 }
-function Rl(e, t) {
+function jl(e, t) {
   if (e.kind === "number") {
     const n = new Float64Array(t).fill(Number.NaN);
     n.set(e.values), e.values = n;
@@ -6811,24 +6818,24 @@ function Rl(e, t) {
   }
   e.values.length = t;
 }
-function Rt(e, t) {
+function Mt(e, t) {
   if (e.kind === "number") {
     const n = e.values[t];
     return Number.isNaN(n) ? void 0 : n;
   }
   if (e.kind === "flag") {
     const n = e.values[t];
-    return n === Vs ? void 0 : n === Bs;
+    return n === Bs ? void 0 : n === qs;
   }
   return e.values[t];
 }
-function Dl(e, t, n) {
+function zl(e, t, n) {
   if (e.kind === "number") {
     e.values[t] = typeof n == "number" ? n : Number.NaN;
     return;
   }
   if (e.kind === "flag") {
-    e.values[t] = n === !0 ? Bs : Pl;
+    e.values[t] = n === !0 ? qs : Ml;
     return;
   }
   const s = e.values[t];
@@ -6841,23 +6848,23 @@ function Dl(e, t, n) {
   }
   e.values[t] = n;
 }
-function xl(e, t) {
+function Ll(e, t) {
   if (e.kind === "number") {
     e.values[t] = Number.NaN;
     return;
   }
   if (e.kind === "flag") {
-    e.values[t] = Vs;
+    e.values[t] = Bs;
     return;
   }
   e.values[t] = void 0;
 }
-function jl(e, t, n) {
+function Fl(e, t, n) {
   if (t === null) {
     e.pushAbsent();
     return;
   }
-  const s = Rt(t, n);
+  const s = Mt(t, n);
   if (typeof s == "number") {
     e.pushNumber(s);
     return;
@@ -6870,14 +6877,14 @@ function jl(e, t, n) {
     e.pushText(s);
     return;
   }
-  const o = uo(s);
+  const o = ho(s);
   if (o === null) {
     e.pushAbsent();
     return;
   }
   e.pushNumber(o.r), e.pushNumber(o.g), e.pushNumber(o.b), e.pushNumber(o.a);
 }
-function zl(e) {
+function Ul(e) {
   const { edits: t, stack: n, fromIndex: s } = e;
   if (t.length === 0)
     return !1;
@@ -6886,8 +6893,8 @@ function zl(e) {
       return !1;
   return s === n.length - t.length;
 }
-function Ll(e) {
-  const t = e.scales ?? Ht();
+function Vl(e) {
+  const t = e.scales ?? Yt();
   let n = /* @__PURE__ */ new WeakMap();
   const s = /* @__PURE__ */ new WeakMap();
   let o = /* @__PURE__ */ new WeakMap(), r = [], i = Promise.resolve(), a = 0;
@@ -6895,7 +6902,7 @@ function Ll(e) {
     for (const u of c)
       u();
   }, g = (u) => {
-    const m = Il(), E = bt(u).length;
+    const m = $l(), E = bt(u).length;
     m.begin();
     for (let M = 0; M < E; M++)
       m.pushAbsent();
@@ -6932,15 +6939,15 @@ function Ll(e) {
     const z = new Uint8Array(E);
     z.set(u.painted);
     for (const x of u.columns.values())
-      Rl(x, E);
+      jl(x, E);
     u.capacity = E, u.meshKeys = M, u.stamps = R, u.painted = z, u.dirty = new Uint32Array(E);
   }, P = (u, m) => {
     const E = u.columns.get(m);
     if (E !== void 0)
       return E;
-    const M = Ml(m, u.capacity);
+    const M = xl(m, u.capacity);
     return u.columns.set(m, M), M;
-  }, F = (u, m) => zt(m) ? { layerId: u, code: m.code, message: m.message } : {
+  }, F = (u, m) => jt(m) ? { layerId: u, code: m.code, message: m.message } : {
     layerId: u,
     code: "E_INTERNAL",
     message: m instanceof Error ? m.message : String(m)
@@ -6970,7 +6977,7 @@ function Ll(e) {
       M.push({
         column: P(E, q),
         path: L,
-        binding: Ha({
+        binding: Qa({
           channel: q,
           binding: W,
           scales: t,
@@ -7000,7 +7007,7 @@ function Ll(e) {
     const E = m.paths[0];
     return E === void 0 ? null : e.measured?.(E, m.target) ?? null;
   }, p = (u) => {
-    u.dirtyCount = 0, u.generation >= $l && (u.stamps = new Int32Array(u.capacity), u.generation = 0), u.generation++;
+    u.dirtyCount = 0, u.generation >= Rl && (u.stamps = new Int32Array(u.capacity), u.generation = 0), u.generation++;
   }, O = (u, m) => {
     u.stamps[m] !== u.generation && (u.stamps[m] = u.generation, u.dirty[u.dirtyCount] = m, u.dirtyCount++);
   }, T = (u) => {
@@ -7030,7 +7037,7 @@ function Ll(e) {
   }, S = (u) => {
     for (const m of u.columns.values())
       for (let E = 0; E < u.dirtyCount; E++)
-        xl(m, u.dirty[E]);
+        Ll(m, u.dirty[E]);
   }, j = async (u, m) => {
     if (performance.now() < m)
       return m;
@@ -7048,8 +7055,8 @@ function Ll(e) {
         if (!(L !== null && (ve >= u.count || u.stamps[ve] !== u.generation)) && !(z !== null && !z(ve))) {
           K[ve] = 1;
           for (let rt = 0; rt < D.length; rt++) {
-            const De = D[rt], Qs = De.path === null ? void 0 : q.value(ve, De.path), Jt = De.binding.paint(Qs);
-            Jt !== void 0 && Dl(De.column, ve, Jt);
+            const De = D[rt], Xs = De.path === null ? void 0 : q.value(ve, De.path), Xt = De.binding.paint(Xs);
+            Xt !== void 0 && zl(De.column, ve, Xt);
           }
         }
       }
@@ -7063,7 +7070,7 @@ function Ll(e) {
     const W = () => {
       const q = {}, K = q;
       for (let H = 0; H < R.length; H++) {
-        const Z = R[H], X = Z === null ? void 0 : Rt(Z, L);
+        const Z = R[H], X = Z === null ? void 0 : Mt(Z, L);
         X !== void 0 && (K[M[H]] = X);
       }
       return q;
@@ -7072,7 +7079,7 @@ function Ll(e) {
         const Z = u.dirty[H];
         z.begin();
         for (let ae = 0; ae < R.length; ae++)
-          jl(z, R[ae], Z);
+          Fl(z, R[ae], Z);
         L = Z;
         const X = z.end(W), Se = u.meshKeys[Z];
         X !== Se && (X !== 0 && z.retain(X), Se !== 0 && z.release(Se), u.meshKeys[Z] = X);
@@ -7134,7 +7141,7 @@ function Ll(e) {
           for (const E of u.edits)
             E.previous !== null && (T(E.previous), $(E.previous)), E.next !== null && T(E.next);
         },
-        zl(u) ? u.fromIndex : null
+        Ul(u) ? u.fromIndex : null
       )
     ),
     repaintAll(u, m) {
@@ -7165,7 +7172,7 @@ function Ll(e) {
         return Wn;
       const M = {}, R = M;
       for (const [z, x] of E.columns) {
-        const L = Rt(x, m);
+        const L = Mt(x, m);
         L !== void 0 && (R[z] = L);
       }
       return M;
@@ -7189,7 +7196,7 @@ function Ll(e) {
     },
     encoding(u) {
       const m = s.get(u);
-      return m === void 0 || m.channels.length === 0 ? Tl : m.channels.map((E) => E.binding);
+      return m === void 0 || m.channels.length === 0 ? kl : m.channels.map((E) => E.binding);
     },
     invalidate() {
       n = /* @__PURE__ */ new WeakMap(), h.node.painted.fill(0), h.edge.painted.fill(0);
@@ -7200,14 +7207,14 @@ function Ll(e) {
   };
 }
 const Hn = "data.";
-function qs(e, t, n) {
+function Gs(e, t, n) {
   if (n === "source")
     return e.ids.idOf(e.edgeSource(t));
   if (n === "target")
     return e.ids.idOf(e.edgeTarget(t));
 }
-const vt = `${No}.`, Kn = Object.freeze({ kind: "none", key: "", runId: "", field: "" });
-function Fl(e) {
+const vt = `${ds}.`, Kn = Object.freeze({ kind: "none", key: "", runId: "", field: "" });
+function Bl(e) {
   if (e.startsWith(vt)) {
     const n = e.indexOf(".", vt.length), s = n === -1 ? "" : e.slice(vt.length, n), o = n === -1 ? "" : e.slice(n + 1);
     return s === "" || o === "" || o.includes(".") ? Kn : { kind: "result", key: "", runId: s, field: o };
@@ -7215,8 +7222,8 @@ function Fl(e) {
   const t = e.startsWith(Hn) ? e.slice(Hn.length) : e;
   return t === "" ? Kn : { kind: "attribute", key: t, runId: "", field: "" };
 }
-const Ul = new Uint32Array(0);
-function Vl(e) {
+const ql = new Uint32Array(0);
+function Gl(e) {
   const t = Ee(e);
   return {
     graph: e,
@@ -7230,39 +7237,39 @@ function Vl(e) {
     edgeMeasured: /* @__PURE__ */ new Map()
   };
 }
-function Bl(e) {
+function Wl(e) {
   if (e === null)
     return null;
   const t = e.meta.default;
   return { column: e, defaultPresent: t != null };
 }
-function ql(e, t) {
+function Yl(e, t) {
   if (!(t < 0 || t >= e.column.length))
     return e.column.value(t);
 }
-function Gl(e, t) {
+function Hl(e, t) {
   return e.column.isSet(t) ? !0 : e.defaultPresent && t >= 0 && t < e.column.length;
 }
 function Fe(e) {
   return e != null;
 }
-function Wl(e) {
+function Kl(e) {
   const { snapshot: t, records: n } = e, s = e.results, o = /* @__PURE__ */ new Map();
   let r = null;
   const i = () => {
     const w = t();
-    return (r === null || r.graph !== w) && (r = Vl(w)), r;
+    return (r === null || r.graph !== w) && (r = Gl(w)), r;
   }, a = (w) => {
     const N = o.get(w);
     if (N !== void 0)
       return N;
-    const d = Fl(w);
+    const d = Bl(w);
     return o.set(w, d), d;
   }, c = (w, N, d) => {
     const p = N === "node" ? w.nodeColumns : w.edgeColumns, O = p.get(d);
     if (O !== void 0)
       return O;
-    const T = N === "node" ? w.graph.nodes : w.graph.edges, $ = Bl(T.get(d));
+    const T = N === "node" ? w.graph.nodes : w.graph.edges, $ = Wl(T.get(d));
     return p.set(d, $), $;
   }, l = (w, N) => {
     w.edgeIds ??= new Array(w.edgeCount);
@@ -7275,10 +7282,10 @@ function Wl(e) {
     const O = s?.(p);
     if (O !== void 0)
       return N === "node" ? d >= 0 && d < w.nodeCount ? O.node(w.graph.ids.idOf(d)) : void 0 : d >= 0 && d < w.edgeCount ? O.edge(l(w, d)) : void 0;
-  }, h = (w, N, d, p) => N === "edge" ? d < 0 || d >= w.edgeCount ? void 0 : y(w, N, d, p) ?? qs(w.graph, d, p) : y(w, N, d, p), y = (w, N, d, p) => {
+  }, h = (w, N, d, p) => N === "edge" ? d < 0 || d >= w.edgeCount ? void 0 : y(w, N, d, p) ?? Gs(w.graph, d, p) : y(w, N, d, p), y = (w, N, d, p) => {
     const O = c(w, N, p);
     if (O !== null)
-      return ql(O, d);
+      return Yl(O, d);
     if (n !== void 0) {
       if (N === "edge")
         return n.edgeAttributes(d)?.[p];
@@ -7301,10 +7308,10 @@ function Wl(e) {
     if (w === "edge" && (p.key === "source" || p.key === "target"))
       return Fe(h(O, w, N, p.key));
     const T = c(O, w, p.key);
-    return T !== null ? Gl(T, N) : Fe(h(O, w, N, p.key));
+    return T !== null ? Hl(T, N) : Fe(h(O, w, N, p.key));
   }, U = (w, N, d, p) => {
     if (p === void 0)
-      return Ul;
+      return ql;
     const O = N === "node" ? w.nodeCount : w.edgeCount, T = N === "node" ? (S) => p.node(w.graph.ids.idOf(S)) : (S) => p.edge(l(w, S)), $ = new Uint32Array(O);
     let A = 0;
     for (let S = 0; S < O; S++)
@@ -7364,7 +7371,7 @@ function ue(e, t) {
 function de(e, t) {
   return new _({ code: "E_OPTION_RANGE", message: e, source: "data", details: t });
 }
-function Dt(e, t) {
+function Rt(e, t) {
   if (typeof e != "string" || e.trim() === "")
     throw ue(`A "${t}" filter needs an attribute path, such as "data.type".`, { kind: t, attribute: e });
 }
@@ -7382,7 +7389,7 @@ function Jn(e, t, n) {
       max: t
     });
 }
-function Yl(e, t) {
+function Ql(e, t) {
   if (typeof e != "string" || e.trim() === "")
     throw new _({
       code: "E_BAD_QUERY",
@@ -7391,20 +7398,20 @@ function Yl(e, t) {
       details: { kind: t, where: e }
     });
 }
-function xt(e) {
+function Dt(e) {
   if (typeof e != "object" || e === null || typeof e.kind != "string")
     throw ue(`A filter is an object with a "kind" of ${Qn.join(", ")}.`, { filter: e });
   const { kind: t } = e;
   switch (e.kind) {
     case "expression":
     case "edges":
-      Yl(e.where, e.kind);
+      Ql(e.where, e.kind);
       return;
     case "range":
-      Dt(e.attribute, e.kind), Jn(e.min, e.max, e.kind);
+      Rt(e.attribute, e.kind), Jn(e.min, e.max, e.kind);
       return;
     case "categories":
-      if (Dt(e.attribute, e.kind), !Array.isArray(e.values))
+      if (Rt(e.attribute, e.kind), !Array.isArray(e.values))
         throw ue('A "categories" filter needs a list of values.', { values: e.values });
       return;
     case "degree":
@@ -7432,10 +7439,10 @@ function xt(e) {
       if (!Array.isArray(e.of))
         throw ue(`An "${e.kind}" filter needs a list of filters.`, { of: e.of });
       for (const n of e.of)
-        xt(n);
+        Dt(n);
       return;
     case "not":
-      xt(e.of);
+      Dt(e.of);
       return;
     default:
       throw ue(`"${t}" is not a filter kind.`, { kind: t, kinds: Qn });
@@ -7454,10 +7461,10 @@ function Pe(e) {
   }
   return null;
 }
-function Hl(e) {
+function Xl(e) {
   if (typeof e != "object" || e === null)
     throw ue("A time window is an object with an attribute, a from and a to.", { window: e });
-  Dt(e.attribute, "window");
+  Rt(e.attribute, "window");
   const t = Pe(e.from), n = Pe(e.to);
   for (const [s, o, r] of [
     ["from", e.from, t],
@@ -7479,29 +7486,29 @@ function Hl(e) {
       { step: e.step }
     );
 }
-function Gs(e, t) {
-  e !== null && xt(e), t !== null && Hl(t);
+function Ws(e, t) {
+  e !== null && Dt(e), t !== null && Xl(t);
 }
-const Kl = { node: null, edge: null };
-function Kt(e, t) {
+const Jl = { node: null, edge: null };
+function Ht(e, t) {
   const n = e.marks.get(t);
   if (n !== void 0)
     return n;
   const s = { seen: !1 };
   return e.marks.set(t, s), s;
 }
-function Qt(e, t, n, s) {
+function Kt(e, t, n, s) {
   const o = e(t, n);
   if (o != null)
     return s.seen = !0, o;
 }
-function Xt(e, t) {
+function Qt(e, t) {
   const { values: n } = e.sources;
   if (n === void 0)
     throw ot(t, "a source of attribute values");
   return n;
 }
-function Ql(e, t) {
+function Zl(e, t) {
   const { match: n, unresolvedPathsOf: s } = e.sources;
   if (n === void 0)
     throw ot("expression", "a query engine");
@@ -7514,7 +7521,7 @@ function Ql(e, t) {
   }
   return (r) => o[r] === 1;
 }
-function Xl(e, t) {
+function eu(e, t) {
   const { matchEdges: n, unresolvedPathsOf: s } = e.sources;
   if (n === void 0)
     throw ot("edges", "a query engine for edges");
@@ -7527,28 +7534,28 @@ function Xl(e, t) {
   }
   return (i) => r[i] === 1;
 }
-function Jl(e, t, n, s) {
-  const o = Xt(e, "range"), r = Kt(e, t), i = n ?? Number.NEGATIVE_INFINITY, a = s ?? Number.POSITIVE_INFINITY;
+function tu(e, t, n, s) {
+  const o = Qt(e, "range"), r = Ht(e, t), i = n ?? Number.NEGATIVE_INFINITY, a = s ?? Number.POSITIVE_INFINITY;
   return (c) => {
-    const l = Qt((g, h) => o.nodeValue(g, h), c, t, r);
+    const l = Kt((g, h) => o.nodeValue(g, h), c, t, r);
     return typeof l == "number" && Number.isFinite(l) && l >= i && l <= a;
   };
 }
-function Zl(e, t, n) {
-  const s = Xt(e, "categories"), o = Kt(e, t), r = new Set(n);
+function nu(e, t, n) {
+  const s = Qt(e, "categories"), o = Ht(e, t), r = new Set(n);
   return (i) => {
-    const a = Qt((c, l) => s.nodeValue(c, l), i, t, o);
+    const a = Kt((c, l) => s.nodeValue(c, l), i, t, o);
     return typeof a == "string" ? r.has(a) : typeof a == "number" || typeof a == "boolean" ? r.has(String(a)) : !1;
   };
 }
-function eu(e, t, n, s) {
+function su(e, t, n, s) {
   const { graph: o } = e;
   let r;
   s === "in" ? r = o.inDegree() : s === "out" ? r = o.outDegree() : r = o.degree();
   const i = t ?? Number.NEGATIVE_INFINITY, a = n ?? Number.POSITIVE_INFINITY;
   return (c) => r[c] >= i && r[c] <= a;
 }
-function tu(e, t) {
+function ou(e, t) {
   const { components: n } = e.sources;
   if (n === void 0)
     throw ot("component", "the connected components");
@@ -7560,7 +7567,7 @@ function tu(e, t) {
     });
   return (o) => s.labels[o] === t;
 }
-function nu(e, t, n) {
+function ru(e, t, n) {
   const { graph: s } = e, o = new Uint8Array(s.nodeCount);
   let r = [];
   for (const a of t) {
@@ -7594,25 +7601,25 @@ function Ze(e, t) {
     return o;
   };
 }
-function jt(e, t) {
+function xt(e, t) {
   switch (e.kind) {
     case "expression":
-      return { node: Ql(t, e.where), edge: null };
+      return { node: Zl(t, e.where), edge: null };
     case "range":
-      return { node: Jl(t, e.attribute, e.min, e.max), edge: null };
+      return { node: tu(t, e.attribute, e.min, e.max), edge: null };
     case "categories":
-      return { node: Zl(t, e.attribute, e.values), edge: null };
+      return { node: nu(t, e.attribute, e.values), edge: null };
     case "degree":
-      return { node: eu(t, e.min, e.max, e.direction), edge: null };
+      return { node: su(t, e.min, e.max, e.direction), edge: null };
     case "component":
-      return { node: tu(t, e.id), edge: null };
+      return { node: ou(t, e.id), edge: null };
     case "neighborhood":
-      return { node: nu(t, e.seeds, e.depth), edge: null };
+      return { node: ru(t, e.seeds, e.depth), edge: null };
     case "edges":
-      return { node: null, edge: Xl(t, e.where) };
+      return { node: null, edge: eu(t, e.where) };
     case "all":
     case "any": {
-      const n = e.of.map((s) => jt(s, t));
+      const n = e.of.map((s) => xt(s, t));
       return {
         node: Ze(
           n.map((s) => s.node),
@@ -7625,7 +7632,7 @@ function jt(e, t) {
       };
     }
     default: {
-      const { node: n, edge: s } = jt(e.of, t);
+      const { node: n, edge: s } = xt(e.of, t);
       return {
         node: n === null ? null : (o) => !n(o),
         edge: s === null ? null : (o) => !s(o)
@@ -7633,9 +7640,9 @@ function jt(e, t) {
     }
   }
 }
-function su(e, t) {
-  const n = Xt(t, "window"), s = Kt(t, e.attribute), o = Pe(e.from) ?? Number.NEGATIVE_INFINITY, r = Pe(e.to) ?? Number.POSITIVE_INFINITY, i = (a) => (c) => {
-    const l = Pe(Qt(a, c, e.attribute, s));
+function iu(e, t) {
+  const n = Qt(t, "window"), s = Ht(t, e.attribute), o = Pe(e.from) ?? Number.NEGATIVE_INFINITY, r = Pe(e.to) ?? Number.POSITIVE_INFINITY, i = (a) => (c) => {
+    const l = Pe(Kt(a, c, e.attribute, s));
     return l === null || l >= o && l < r;
   };
   return {
@@ -7644,15 +7651,15 @@ function su(e, t) {
   };
 }
 function Zn(e, t, n, s) {
-  Gs(t, n);
+  Ws(t, n);
   const o = {
     graph: e,
     sources: s,
     marks: /* @__PURE__ */ new Map(),
     unresolvedQueries: /* @__PURE__ */ new Set()
   }, r = [];
-  t !== null && r.push(jt(t, o)), n !== null && r.push(su(n, o));
-  const i = r.length === 0 ? Kl : {
+  t !== null && r.push(xt(t, o)), n !== null && r.push(iu(n, o));
+  const i = r.length === 0 ? Jl : {
     node: Ze(
       r.map((a) => a.node),
       "all"
@@ -7674,20 +7681,20 @@ function Zn(e, t, n, s) {
   };
 }
 const Ue = 4096, es = 8;
-function Ws(e, t, n) {
+function Ys(e, t, n) {
   const s = e.compiled.node;
   for (let o = t; o < n; o++)
     (s === null || s(o)) && e.nodes.add(o);
 }
-function Ys(e, t, n) {
+function Hs(e, t, n) {
   const s = e.compiled.edge, o = e.graph.edgeList();
   for (let r = t; r < n; r++)
     !e.nodes.has(o.src[r]) || !e.nodes.has(o.dst[r]) || (s === null || s(r)) && e.edges.add(r);
 }
-function ou(e) {
-  Ws(e, 0, e.graph.nodeCount), Ys(e, 0, e.graph.edgeCount);
+function au(e) {
+  Ys(e, 0, e.graph.nodeCount), Hs(e, 0, e.graph.edgeCount);
 }
-async function ru(e, t, n) {
+async function cu(e, t, n) {
   const { nodeCount: s } = e.graph, { edgeCount: o } = e.graph, r = s + o;
   let i = performance.now() + es;
   const a = async (c) => {
@@ -7703,15 +7710,15 @@ async function ru(e, t, n) {
     throw t.reason;
   for (let c = 0; c < s; c += Ue) {
     const l = Math.min(c + Ue, s);
-    Ws(e, c, l), await a(l);
+    Ys(e, c, l), await a(l);
   }
   for (let c = 0; c < o; c += Ue) {
     const l = Math.min(c + Ue, o);
-    Ys(e, c, l), await a(s + l);
+    Hs(e, c, l), await a(s + l);
   }
   n(r, r);
 }
-const yt = "visibility.set", ts = "graph", ns = Object.freeze([]), iu = Object.freeze([]), au = Object.freeze([]);
+const yt = "visibility.set", ts = "graph", ns = Object.freeze([]), lu = Object.freeze([]), uu = Object.freeze([]);
 function ss(e) {
   const t = new Set(e);
   for (const n of ["add", "delete", "clear"])
@@ -7730,28 +7737,28 @@ function ss(e) {
     });
   return Object.freeze(t);
 }
-function cu(e, t) {
+function du(e, t) {
   return e !== null && t !== null ? `Filter (${e.kind}) and time window` : e !== null ? `Filter (${e.kind})` : t === null ? "Show everything" : "Time window";
 }
-function lu(e, t) {
+function hu(e, t) {
   return Object.freeze({
     direction: "as-loaded",
     exact: !0,
     filterScope: e !== null,
     method: "mask",
-    notes: au,
+    notes: uu,
     precision: "f64",
     seed: null,
     weight: null,
     windowScope: t !== null
   });
 }
-function uu(e) {
-  const t = e.queue ?? Gt(), n = e.engine ?? He;
+function fu(e) {
+  const t = e.queue ?? qt(), n = e.engine ?? He;
   let s = null, o = null, r = null, i = null, a = !1, c = ns, l = null;
   const g = () => {
     const b = e.snapshot();
-    return (s === null || s.graph !== b) && (s = { graph: b, nodeSpace: Bt(b), edgeSpace: Ee(b) }), s;
+    return (s === null || s.graph !== b) && (s = { graph: b, nodeSpace: Vt(b), edgeSpace: Ee(b) }), s;
   }, h = new te(() => g().nodeSpace, 1), y = new te(() => g().edgeSpace, 1);
   let P = null, F = null, U = null, w = null, N = null, d = "", p = null, O = null;
   const T = (b) => {
@@ -7760,7 +7767,7 @@ function uu(e) {
       return;
     }
     const k = Zn(b, r, i, e);
-    ou({ compiled: k, edges: y, graph: b, nodes: h }), c = k.unresolvedPaths();
+    au({ compiled: k, edges: y, graph: b, nodes: h }), c = k.unresolvedPaths();
   }, $ = () => {
     const b = g();
     return o !== b.graph && (o = b.graph, T(b.graph)), b;
@@ -7785,7 +7792,7 @@ function uu(e) {
     for (let m = 0; m < k.graph.edgeCount; m++)
       u.push(k.edgeSpace.idOf(m));
     return O = k.graph, p = Object.freeze({
-      digest: ps(V, u),
+      digest: bs(V, u),
       edgeCount: u.length,
       edges: new Set(u),
       nodeCount: V.length,
@@ -7828,7 +7835,7 @@ function uu(e) {
       };
     }
   }), v = (b, k, V, u) => {
-    if (Gs(b, k), V.dryRun === !0)
+    if (Ws(b, k), V.dryRun === !0)
       throw new _({
         code: "E_UNSUPPORTED",
         message: 'A visibility pass cannot be a dry run. Ask what a filter would leave showing with plan({ op: "visibility.set", filter }), which performs nothing.',
@@ -7836,12 +7843,12 @@ function uu(e) {
         details: { op: yt }
       });
     l?.cancel("A newer visibility instruction replaced this one.");
-    const m = cu(b, k), E = Object.freeze({ filter: b, window: k }), M = {
+    const m = du(b, k), E = Object.freeze({ filter: b, window: k }), M = {
       algorithm: yt,
-      caveats: lu(b, k),
+      caveats: hu(b, k),
       engine: n,
       exact: null,
-      fields: iu,
+      fields: lu,
       id: Ge({
         algorithm: yt,
         exact: null,
@@ -7867,7 +7874,7 @@ function uu(e) {
           () => L.edgeSpace,
           Math.max(1, L.graph.edgeCount)
         );
-        D.grow(L.graph.nodeCount), q.grow(L.graph.edgeCount), await ru(
+        D.grow(L.graph.nodeCount), q.grow(L.graph.edgeCount), await cu(
           { compiled: W, edges: q, graph: L.graph, nodes: D },
           z.signal,
           (H, Z) => {
@@ -7936,10 +7943,10 @@ function uu(e) {
     }
   };
 }
-function du() {
-  return jo.parse({});
+function mu() {
+  return Lo.parse({});
 }
-const hu = /* @__PURE__ */ new Set(["active", "idle"]), fu = Object.freeze({
+const gu = /* @__PURE__ */ new Set(["active", "idle"]), pu = Object.freeze({
   exact: !0,
   seed: null,
   direction: "as-loaded",
@@ -7947,12 +7954,12 @@ const hu = /* @__PURE__ */ new Set(["active", "idle"]), fu = Object.freeze({
   precision: "f64",
   method: "exact",
   notes: Object.freeze([])
-}), mu = Object.freeze({
+}), bu = Object.freeze({
   ready: !1,
   counts: Object.freeze({ nodes: 0, edges: 0, visibleNodes: 0, visibleEdges: 0 }),
   directed: !1
 }), os = "data.";
-function gu(e) {
+function vu(e) {
   return Promise.reject(
     new _({
       code: "E_UNSUPPORTED",
@@ -7963,7 +7970,7 @@ function gu(e) {
     })
   );
 }
-class pu {
+class yu {
   /**
    * Assemble the session from parts the factory has already decided the ownership of.
    * @param parts - the store, the data surface, the configuration and the accelerator, each
@@ -8028,7 +8035,7 @@ class pu {
    */
   get status() {
     if (this.disposed)
-      return mu;
+      return bu;
     const t = this.store.getSnapshot(), n = this.visibility.summary;
     return Object.freeze({
       ready: !0,
@@ -8115,7 +8122,7 @@ class pu {
    * @returns The estimate.
    */
   estimate(t) {
-    return qt(this.planning, t);
+    return Bt(this.planning, t);
   }
   /**
    * What one command would do, what it would cost, and whether it would be allowed.
@@ -8128,7 +8135,7 @@ class pu {
    * @returns The plan.
    */
   plan(t) {
-    return Promise.resolve(Si(this.planning, t));
+    return Promise.resolve(Ci(this.planning, t));
   }
   /**
    * Watch the session.
@@ -8155,16 +8162,16 @@ class pu {
     this.disposed || (this.disposed = !0, this.unwatchController(), this.sessionRuns.dispose(), this.stopStyleEdits(), this.watchers.clear(), this.sessionData.dispose(), this.ownedAcceleration?.dispose(), this.ownedStore?.dispose());
   }
 }
-function bu(e) {
+function wu(e) {
   if (typeof e == "function")
     return e;
-  const t = e ?? du();
+  const t = e ?? mu();
   return () => t;
 }
-function vu(e, t, n) {
+function Ou(e, t, n) {
   if (e !== void 0)
     return { store: e, owned: null };
-  const s = new Yo({
+  const s = new Ko({
     directed: t().directed,
     // A thunk, not a value: the element mutates `data.knownFields` in place at run time, and a
     // scale captured here would be the one known field that ignored the change.
@@ -8184,22 +8191,22 @@ function vu(e, t, n) {
   });
   return { store: s, owned: s };
 }
-function yu(e, t, n) {
+function Eu(e, t, n) {
   if (e !== void 0)
     return { controller: e, owned: null };
-  const s = new Bo(n === void 0 ? { policy: t } : { policy: t, minNodes: n });
+  const s = new Go(n === void 0 ? { policy: t } : { policy: t, minNodes: n });
   return { controller: s, owned: s };
 }
-function wu(e, t) {
+function Nu(e, t) {
   const n = (s) => s.startsWith(os) ? s.slice(os.length) : s;
   return {
     nodeValue: (s, o) => e.nodeAttributes(s, t().ids.idOf(s))?.[n(o)],
     // An edge's endpoints are read from the snapshot when the record holds nothing under the
     // key, as a style selector reads them: the importer removes the keys they arrived under.
-    edgeValue: (s, o) => e.edgeAttributes(s)?.[n(o)] ?? qs(t(), s, n(o))
+    edgeValue: (s, o) => e.edgeAttributes(s)?.[n(o)] ?? Gs(t(), s, n(o))
   };
 }
-function Ou(e) {
+function Su(e) {
   let t = null, n = { labels: new Int32Array(0), count: 0 };
   return () => {
     const s = e.snapshot();
@@ -8212,7 +8219,7 @@ function Ou(e) {
     return n;
   };
 }
-function Eu(e, t) {
+function Au(e, t) {
   let n = e;
   for (const s of t.split(".")) {
     if (typeof n != "object" || n === null)
@@ -8226,12 +8233,12 @@ function rs(e, t) {
   for (const s of Ie(t)) {
     if (s.accepts === "nothing")
       continue;
-    const o = Eu(e, s.stylePath);
+    const o = Au(e, s.stylePath);
     (typeof o == "string" || typeof o == "number" || typeof o == "boolean") && (n[s.channel] = o);
   }
   return n;
 }
-function Nu() {
+function Cu() {
   return [
     {
       name: "Node defaults",
@@ -8239,7 +8246,7 @@ function Nu() {
       source: { by: "element", reason: "default" },
       target: "node",
       selector: { match: "everything" },
-      set: rs(to, "node")
+      set: rs(no, "node")
     },
     {
       name: "Edge defaults",
@@ -8247,7 +8254,7 @@ function Nu() {
       source: { by: "element", reason: "default" },
       target: "edge",
       selector: { match: "everything" },
-      set: rs(no, "edge")
+      set: rs(so, "edge")
     }
   ];
 }
@@ -8263,13 +8270,13 @@ function is(e, t, n) {
       s.includes(o) || s.push(o);
   return s;
 }
-function Su(e, t) {
+function _u(e, t) {
   return {
     answers: (n, s) => is(e, t, s).includes(n),
     candidates: (n, s) => is(e, t, s)
   };
 }
-function Au(e, t) {
+function Iu(e, t) {
   return (n, s) => {
     for (const o of e.attributes())
       if (o.path === n && o.kind === s)
@@ -8280,22 +8287,22 @@ function Au(e, t) {
           return { plainName: r.plainName, technicalName: r.technicalName };
   };
 }
-function Cu(e) {
+function Tu(e) {
   return typeof e == "string" ? e : "runId" in e ? e.runId : e.id;
 }
-function _u(e) {
+function Pu(e) {
   return {
-    run: (t) => e.get(Cu(t)),
+    run: (t) => e.get(Tu(t)),
     runIds: () => e.list().map((t) => t.id)
   };
 }
-function Iu(e) {
+function $u(e) {
   return (t) => {
     const n = e().ids.indexOf(t);
     return n === G ? void 0 : n;
   };
 }
-function Tu(e) {
+function ku(e) {
   let t = null, n = null;
   return (s) => {
     const o = e();
@@ -8304,7 +8311,7 @@ function Tu(e) {
     return r === G ? void 0 : r;
   };
 }
-function Pu(e, t) {
+function Mu(e, t) {
   let n = null, s = null;
   const o = () => {
     const r = t();
@@ -8338,30 +8345,30 @@ function Pu(e, t) {
     }
   };
 }
-function ed(e = {}) {
-  return Hs(e);
+function sd(e = {}) {
+  return Ks(e);
 }
-function td(e = {}) {
-  return Hs(e);
+function od(e = {}) {
+  return Ks(e);
 }
-function Hs(e) {
-  const t = bu(e.config?.data), n = e.acceleration?.policy ?? e.config?.acceleration?.policy ?? ls, s = e.acceleration?.minNodes ?? e.config?.acceleration?.minNodes, o = /* @__PURE__ */ new Map();
+function Ks(e) {
+  const t = wu(e.config?.data), n = e.acceleration?.policy ?? e.config?.acceleration?.policy ?? ls, s = e.acceleration?.minNodes ?? e.config?.acceleration?.minNodes, o = /* @__PURE__ */ new Map();
   let r = null, i = null, a = null, c = null;
-  const l = vu(e.store, t, {
+  const l = Ou(e.store, t, {
     nodes: (v, b) => r?.remapNodes(v, b),
     edges: (v, b) => r?.remapEdges(v, b)
-  }), g = yu(e.acceleration, n, s), h = new Ni(l.store, e.records ?? null, t), y = e.runs ?? {}, P = () => l.store.getSnapshot(), F = Ou(h), U = y.queue ?? Gt(), w = gr({
+  }), g = Eu(e.acceleration, n, s), h = new Ai(l.store, e.records ?? null, t), y = e.runs ?? {}, P = () => l.store.getSnapshot(), F = Su(h), U = y.queue ?? qt(), w = br({
     snapshot: P,
     components: F,
     // Read through a call rather than captured: both of these are built below, and the
     // resolver only reaches them when somebody resolves a scope that names them.
-    selection: { nodes: () => $u(r).nodeMembers() },
+    selection: { nodes: () => Ru(r).nodeMembers() },
     visibility: {
       nodes: () => N.masks.nodes(),
       edges: () => N.masks.edges()
     },
     match: (v) => Ve(c).nodes(v)
-  }), N = uu({
+  }), N = fu({
     snapshot: P,
     components: F,
     queue: U,
@@ -8370,15 +8377,15 @@ function Hs(e) {
     matchEdges: (v) => Ve(c).edges(v),
     unresolvedPathsOf: (v) => Ve(c).unresolvedPathsOf(v),
     ...y.engine === void 0 ? {} : { engine: y.engine },
-    ...e.records === void 0 ? {} : { values: wu(e.records, P) },
+    ...e.records === void 0 ? {} : { values: Nu(e.records, P) },
     onChange: (v) => {
       we(o, "visibility:changed", v);
     }
-  }), d = y.defaultScope ?? "visible", p = Yi({
+  }), d = y.defaultScope ?? "visible", p = Ki({
     queue: U,
     catalog: We,
     resolveScope: (v) => w.resolveNow(v),
-    execute: y.execute ?? gu,
+    execute: y.execute ?? vu,
     engine: y.engine ?? He,
     defaultScope: d,
     ...y.defaultCaveats === void 0 ? {} : { defaultCaveats: y.defaultCaveats },
@@ -8387,7 +8394,7 @@ function Hs(e) {
     // for what a shape suggests. It is handed in here rather than called at each door because
     // the console, the panel, an agent's tool call and a bare `runs.start()` all end at this
     // one API, and a decision made at the doors is a decision made more than once.
-    styling: Xi({
+    styling: Zi({
       styles: () => a ?? void 0,
       // WHERE A REFUSAL GOES WHEN NOBODY IS AWAITING IT. The element paints a run's
       // suggestion on the run's own completion, fire-and-forget, because a consumer must
@@ -8399,7 +8406,7 @@ function Hs(e) {
       onProblem: (v, b) => {
         we(o, "style:problem", {
           runId: v,
-          error: zt(b) ? b : new _({
+          error: jt(b) ? b : new _({
             code: "E_INTERNAL",
             message: `Applying the styling suggested by run "${v}" failed.`,
             source: "style",
@@ -8433,22 +8440,22 @@ function Hs(e) {
     onChange: (v) => {
       v.phase === "end" && i?.(), we(o, "run:changed", v);
     }
-  }), O = So({
-    entry: (v) => ku(p, v),
-    entries: () => p.list().map((v) => Ks(v))
-  }), T = Wl({
+  }), O = Co({
+    entry: (v) => Du(p, v),
+    entries: () => p.list().map((v) => Qs(v))
+  }), T = Kl({
     snapshot: P,
     results: (v) => p.get(v)?.result,
     ...e.records === void 0 ? {} : { records: e.records }
-  }), $ = Su(h, p);
-  c = Ai({
+  }), $ = _u(h, p);
+  c = _i({
     snapshot: P,
     elements: T,
     answers: (v, b) => $.answers(v, b),
     searchPaths: () => h.attributes().filter((v) => v.kind === "node").map((v) => v.path)
   });
   const A = c;
-  r = xr({
+  r = zr({
     snapshot: P,
     scope: w,
     results: O,
@@ -8459,8 +8466,8 @@ function Hs(e) {
       we(o, "selection:changed", v);
     }
   });
-  const S = Ht(), j = Pu(
-    Ll({
+  const S = Yt(), j = Mu(
+    Vl({
       nodeCount: () => P().nodeCount,
       edgeCount: () => P().edgeCount,
       elements: T,
@@ -8472,15 +8479,15 @@ function Hs(e) {
     P
   );
   i = j.invalidate;
-  const f = new AbortController(), I = yl({
+  const f = new AbortController(), I = El({
     elements: T,
-    base: Nu(),
+    base: Cu(),
     paths: $,
     scales: S,
-    runs: _u(p),
-    nodeIndex: Iu(P),
-    edgeIndex: Tu(P),
-    field: Au(h, p),
+    runs: Pu(p),
+    nodeIndex: $u(P),
+    edgeIndex: ku(P),
+    field: Iu(h, p),
     repaint: j.repaint,
     // What `styles.legend()` and `styles.explain()` read: the bindings the last pass actually
     // painted from. Without it both verbs fall back to "nothing is prepared" and report an
@@ -8497,23 +8504,23 @@ function Hs(e) {
     disposed: f.signal
   });
   a = I;
-  const C = Mu(
+  const C = xu(
     y,
     h,
     (v) => w.resolveNow(v),
     d,
     g.controller
   );
-  return new pu({
+  return new yu({
     store: l.store,
     ownedStore: l.owned,
     data: h,
     // THE SAME COST MODEL THE BUTTON ASKS. A metric listing quotes the number a run of that
     // metric would be estimated at, so it is produced by the estimate rather than by a second
     // model beside it: one source, consulted twice, cannot disagree with itself.
-    catalog: Gr({
+    catalog: Yr({
       algorithms: () => We.algorithms(),
-      estimate: (v) => qt(C, { algorithm: v }),
+      estimate: (v) => Bt(C, { algorithm: v }),
       runs: () => p.list()
     }),
     readData: t,
@@ -8533,7 +8540,7 @@ function Hs(e) {
     watchers: o
   });
 }
-function $u(e) {
+function Ru(e) {
   if (e === null)
     throw new _({
       code: "E_UNSUPPORTED",
@@ -8560,7 +8567,7 @@ function we(e, t, n) {
       } catch {
       }
 }
-function Ks(e) {
+function Qs(e) {
   return {
     id: e.id,
     label: e.label,
@@ -8568,48 +8575,48 @@ function Ks(e) {
     ...e.result === void 0 ? {} : { result: e.result }
   };
 }
-function ku(e, t) {
+function Du(e, t) {
   const n = e.get(t);
-  return n === void 0 ? void 0 : Ks(n);
+  return n === void 0 ? void 0 : Qs(n);
 }
-function Mu(e, t, n, s, o) {
-  const r = e.defaultCaveats ?? fu;
+function xu(e, t, n, s, o) {
+  const r = e.defaultCaveats ?? pu;
   return {
     algorithms: () => We.algorithms(),
     statistics: () => t.statistics(),
     resolveScope: n,
     defaultScope: s,
-    limits: e.limits ?? Es,
+    limits: e.limits ?? Ns,
     defaultCaveats: r,
     // "idle" counts: an accelerator IS attached and the node count is merely below the
     // threshold at which the element bothers to use it, so an algorithm that needs one can run.
-    acceleratorAvailable: () => hu.has(o.capabilities.acceleration.state),
+    acceleratorAvailable: () => gu.has(o.capabilities.acceleration.state),
     ...e.calibration === void 0 ? {} : { calibration: e.calibration },
     ...e.measurements === void 0 ? {} : { measurements: e.measurements }
   };
 }
 export {
-  Bo as A,
-  Ju as D,
-  Yo as G,
-  Xu as Q,
+  Go as A,
+  td as D,
+  Ko as G,
+  ed as Q,
   wt as R,
   dt as S,
-  Qo as T,
-  Es as a,
-  ti as b,
-  ir as c,
-  ws as d,
-  Qu as e,
-  Ko as f,
-  ed as g,
-  Hu as h,
-  Zu as i,
-  Ku as j,
+  Jo as T,
+  Ns as a,
+  si as b,
+  cr as c,
+  Os as d,
+  Zu as e,
+  Xo as f,
+  sd as g,
+  Xu as h,
+  nd as i,
+  Ju as j,
   Ot as k,
-  jo as l,
-  qo as m,
-  td as n,
-  Mo as o,
-  Yu as p
+  Lo as l,
+  Wo as m,
+  od as n,
+  Do as o,
+  Qu as p
 };