@graphty/graphty-element 2.5.1 → 2.6.0

package/dist/chunks/{paletteRegistry-Kt-6CeoN.js → paletteRegistry-BCFSwJGK.js}

@@ -1,32 +1,32 @@
-import { c as b, G as g, S as T } from "./pluginRegistry-Bs8bEkz9.js";
-import { a as F, b as D, d as k } from "./types-C_c53VgR.js";
-import { remapArray as S, INVALID_INDEX as N } from "@graphty/graph-format";
+import { c as E, G as g, S as _ } from "./pluginRegistry-Bs8bEkz9.js";
+import { a as F, b as D, d as k } from "./types-DFchv4Ny.js";
+import { remapArray as S, INVALID_INDEX as w, maskTest as v } from "@graphty/graph-format";
 import { z as O } from "zod/v4";
-import { G as v } from "./GraphtyLogger-DOTwCiMR.js";
+import { G as $ } from "./GraphtyLogger-B_O67a6c.js";
 import { c as L } from "./common-DWNKjpH_.js";
-const f = b({
+const f = E({
   kind: "format",
-  idOf: (i) => i.descriptor.id,
-  descriptorOf: (i) => i.descriptor,
-  implementationOf: (i) => i.descriptor,
+  idOf: (s) => s.descriptor.id,
+  descriptorOf: (s) => s.descriptor,
+  implementationOf: (s) => s.descriptor,
   builtInIds: () => F
 });
-function st(i, t) {
-  f.register(i, t);
+function rt(s, t) {
+  f.register(s, t);
 }
-function rt() {
+function nt() {
   return f.entries();
 }
-function $() {
+function R() {
   return f.descriptors();
 }
-function j(i) {
-  return f.byId(i);
+function M(s) {
+  return f.byId(s);
 }
-function nt() {
+function ot() {
   f.clearForTesting();
 }
-const M = {
+const j = {
   "edge-list": "Edge List",
   "node-list": "Node List",
   "adjacency-list": "Adjacency List",
@@ -34,7 +34,7 @@ const M = {
   gephi: "Gephi Export",
   cytoscape: "Cytoscape Export",
   generic: "Generic"
-}, R = [
+}, z = [
   {
     name: "delimiter",
     plainName: "Column Separator",
@@ -47,7 +47,7 @@ const M = {
     plainName: "File Shape",
     technicalName: "variant",
     type: "enum",
-    values: Object.entries(M).map(([i, t]) => ({ value: i, label: t })),
+    values: Object.entries(j).map(([s, t]) => ({ value: s, label: t })),
     description: "Which CSV shape to read. Worked out from the header row when it is not set."
   },
   {
@@ -72,7 +72,7 @@ const M = {
     type: "string",
     description: "Where to find the node an edge ends at. Left unset, the element looks for target, then dst, then to."
   }
-], z = [
+], B = [
   {
     name: "nodeIdPath",
     plainName: "Node Id Field",
@@ -80,7 +80,7 @@ const M = {
     type: "string",
     description: "An expression selecting each node's identity out of the node record."
   }
-], _ = [
+], T = [
   {
     id: "json",
     plainName: "JSON",
@@ -88,7 +88,7 @@ const M = {
     mimeTypes: ["application/json"],
     canImport: !0,
     canExport: !1,
-    options: [...z, ...h]
+    options: [...B, ...h]
   },
   {
     id: "csv",
@@ -97,7 +97,7 @@ const M = {
     mimeTypes: ["text/csv", "text/tab-separated-values", "text/plain"],
     canImport: !0,
     canExport: !1,
-    options: [...R, ...h]
+    options: [...z, ...h]
   },
   {
     id: "graphml",
@@ -149,7 +149,7 @@ const M = {
     canExport: !1,
     options: h
   }
-], ot = [
+], at = [
   {
     id: "sif",
     reason: "No data source reads the Cytoscape simple interaction format. The name is deprecated and is removed at the next major release unless a reader lands."
@@ -159,59 +159,59 @@ const M = {
     reason: "No data source reads the Cytoscape Exchange format. The name is deprecated and is removed at the next major release unless a reader lands."
   }
 ];
-function at(i) {
-  return _.find((t) => t.id === i) ?? j(i)?.descriptor;
+function lt(s) {
+  return T.find((t) => t.id === s) ?? M(s)?.descriptor;
 }
-function lt(i) {
-  const t = i.toLowerCase();
-  return [..._, ...$()].filter(
+function ct(s) {
+  const t = s.toLowerCase();
+  return [...T, ...R()].filter(
     (e) => e.extensions.includes(t)
   );
 }
-const m = b({
+const y = E({
   kind: "layout",
-  idOf: (i) => i.descriptor.id,
-  descriptorOf: (i) => i.descriptor,
-  implementationOf: (i) => i.descriptor,
+  idOf: (s) => s.descriptor.id,
+  descriptorOf: (s) => s.descriptor,
+  implementationOf: (s) => s.descriptor,
   builtInIds: () => D
 });
-function B(i, t) {
-  m.register(i, t);
+function C(s, t) {
+  y.register(s, t);
 }
-function ct() {
-  return m.descriptors();
+function ht() {
+  return y.descriptors();
 }
-function ht(i) {
-  return m.byId(i);
+function dt(s) {
+  return y.byId(s);
 }
-function dt() {
-  m.clearForTesting();
+function ut() {
+  y.clearForTesting();
 }
-const o = 3, C = 1024;
-function p(i, t) {
-  if (!Number.isInteger(i) || i < 0)
-    throw new RangeError(`ElementPositions: ${t} must be a non-negative integer, found ${String(i)}`);
-  return i;
+const a = 3, W = 1024;
+function p(s, t) {
+  if (!Number.isInteger(s) || s < 0)
+    throw new RangeError(`ElementPositions: ${t} must be a non-negative integer, found ${String(s)}`);
+  return s;
 }
-function d(i) {
-  return Number.isFinite(Math.fround(i));
+function d(s) {
+  return Number.isFinite(Math.fround(s));
 }
 class x {
   /**
    * Allocate the backing array, every row unplaced and unpinned.
    * @param capacity - rows to reserve before the first growth; a non-negative integer
    */
-  constructor(t = C) {
-    this.components = o, this.rows = 0, p(t, "capacity");
+  constructor(t = W) {
+    this.components = a, this.rows = 0, p(t, "capacity");
     const e = Math.max(1, t);
-    this.array = new Float32Array(o * e), this.array.fill(Number.NaN), this.pins = new Uint8Array(e);
+    this.array = new Float32Array(a * e), this.array.fill(Number.NaN), this.pins = new Uint8Array(e);
   }
   /**
    * Rows the backing array can hold without reallocating.
    * @returns the current capacity in rows
    */
   get capacity() {
-    return this.array.length / o;
+    return this.array.length / a;
   }
   /**
    * Rows currently in use. Equals the last snapshot's nodeCount.
@@ -242,7 +242,7 @@ class x {
    */
   get placedCount() {
     let t = 0;
-    for (let e = 0; e < o * this.rows; e += o)
+    for (let e = 0; e < a * this.rows; e += a)
       this.hasStorableX(e) && t++;
     return t;
   }
@@ -264,7 +264,7 @@ class x {
       throw new RangeError(
         `ElementPositions: view(${t}) needs ${t} live rows but only ${this.rows} exist; call grow(${t}) first`
       );
-    return this.array.subarray(0, o * t);
+    return this.array.subarray(0, a * t);
   }
   /**
    * Prefix-stable growth: existing rows keep their coordinates, EVERY row at or above the new
@@ -278,11 +278,11 @@ class x {
    */
   grow(t) {
     if (p(t, "nodeCount"), t > this.capacity) {
-      const e = Math.max(this.capacity * 2, t), s = new Float32Array(o * e);
-      s.set(this.array), s.fill(Number.NaN, o * this.rows), this.array = s;
+      const e = Math.max(this.capacity * 2, t), i = new Float32Array(a * e);
+      i.set(this.array), i.fill(Number.NaN, a * this.rows), this.array = i;
       const r = new Uint8Array(e);
       r.set(this.pins), r.fill(0, this.rows), this.pins = r;
-    } else t > this.rows ? (this.array.fill(Number.NaN, o * this.rows, o * t), this.pins.fill(0, this.rows, t)) : t < this.rows && (this.array.fill(Number.NaN, o * t, o * this.rows), this.pins.fill(0, t, this.rows));
+    } else t > this.rows ? (this.array.fill(Number.NaN, a * this.rows, a * t), this.pins.fill(0, this.rows, t)) : t < this.rows && (this.array.fill(Number.NaN, a * t, a * this.rows), this.pins.fill(0, t, this.rows));
     this.rows = t;
   }
   /**
@@ -298,7 +298,7 @@ class x {
    * @throws RangeError when `nodeCount` is not a non-negative integer
    */
   remap(t, e) {
-    p(e, "nodeCount"), this.array = S(this.array, t, e, Number.NaN, o), this.pins = S(this.pins, t, e, 0, 1), this.rows = e;
+    p(e, "nodeCount"), this.array = S(this.array, t, e, Number.NaN, a), this.pins = S(this.pins, t, e, 0, 1), this.rows = e;
   }
   /**
    * Whether the reader has fixed this row's node in place.
@@ -330,7 +330,7 @@ class x {
    * @returns true when the lane was written, false when the index names no row
    */
   setPinned(t, e) {
-    return t === N || !Number.isInteger(t) || t < 0 ? !1 : (t >= this.rows && this.grow(t + 1), this.pins[t] = e ? 1 : 0, !0);
+    return t === w || !Number.isInteger(t) || t < 0 ? !1 : (t >= this.rows && this.grow(t + 1), this.pins[t] = e ? 1 : 0, !0);
   }
   /**
    * How many live rows are pinned.
@@ -369,7 +369,7 @@ class x {
    * @returns true when the row is inside the live count AND carries a storable x
    */
   isPlaced(t) {
-    return !Number.isInteger(t) || t < 0 || t >= this.rows ? !1 : this.hasStorableX(o * t);
+    return !Number.isInteger(t) || t < 0 || t >= this.rows ? !1 : this.hasStorableX(a * t);
   }
   /**
    * Read one row into a caller-supplied object (14.4 rule 7: never return a shared vector).
@@ -381,8 +381,8 @@ class x {
    * @throws RangeError when `index` is not an integer in `[0, count)`
    */
   read(t, e) {
-    const s = this.rowBase(t);
-    e.x = this.array[s] ?? Number.NaN, e.y = this.array[s + 1] ?? Number.NaN, e.z = this.array[s + 2] ?? Number.NaN;
+    const i = this.rowBase(t);
+    e.x = this.array[i] ?? Number.NaN, e.y = this.array[i + 1] ?? Number.NaN, e.z = this.array[i + 2] ?? Number.NaN;
   }
   /**
    * Write one row.
@@ -402,13 +402,13 @@ class x {
    *     last freeze has no row yet: freeze first (which grows this array), then write
    * @throws RangeError when any component is NaN, an infinity, or a double that overflows f32
    */
-  write(t, e, s, r) {
+  write(t, e, i, r) {
     const n = this.rowBase(t);
-    if (!d(e) || !d(s) || !d(r))
+    if (!d(e) || !d(i) || !d(r))
       throw new RangeError(
-        `ElementPositions: row ${String(t)} was written the unstorable coordinate (${String(e)}, ${String(s)}, ${String(r)}); NaN is this class's UNPLACED marker, and an infinity -- including one an f32 overflow produces -- poisons the scene bounds`
+        `ElementPositions: row ${String(t)} was written the unstorable coordinate (${String(e)}, ${String(i)}, ${String(r)}); NaN is this class's UNPLACED marker, and an infinity -- including one an f32 overflow produces -- poisons the scene bounds`
       );
-    this.array[n] = e, this.array[n + 1] = s, this.array[n + 2] = r;
+    this.array[n] = e, this.array[n + 1] = i, this.array[n + 2] = r;
   }
   /**
    * Write a row ONLY when it is unplaced. This is how importer-seeded coordinates reach a new
@@ -426,9 +426,9 @@ class x {
    * @throws RangeError when any component is NaN, an infinity, or a double that overflows f32,
    *     through `write()`
    */
-  fillUnplaced(t, e, s, r) {
+  fillUnplaced(t, e, i, r) {
     const n = this.rowBase(t);
-    return this.hasStorableX(n) ? !1 : (this.write(t, e, s, r), !0);
+    return this.hasStorableX(n) ? !1 : (this.write(t, e, i, r), !0);
   }
   /**
    * Whether the row at this offset carries a storable x, which is the one test "placed" means.
@@ -446,12 +446,12 @@ class x {
   rowBase(t) {
     if (!Number.isInteger(t) || t < 0 || t >= this.rows)
       throw new RangeError(
-        t === N ? "ElementPositions: INVALID_INDEX is the graph-format 'no node' sentinel, not a row" : `ElementPositions: row ${String(t)} is outside the live range [0, ${this.rows})`
+        t === w ? "ElementPositions: INVALID_INDEX is the graph-format 'no node' sentinel, not a row" : `ElementPositions: row ${String(t)} is outside the live range [0, ${this.rows})`
       );
-    return o * t;
+    return a * t;
   }
 }
-const l = new T("layout"), W = Object.freeze([
+const c = new _("layout"), G = Object.freeze([
   "arf",
   "bfs",
   "bipartite",
@@ -471,22 +471,22 @@ const l = new T("layout"), W = Object.freeze([
   "spiral",
   "spring",
   "spring-electrical"
-]), G = v.getLogger(["graphty", "layout"]), P = 1e-6;
-function U(i, t) {
-  return JSON.stringify([i, t]);
+]), U = $.getLogger(["graphty", "layout"]), P = 1e-6;
+function V(s, t) {
+  return JSON.stringify([s, t]);
 }
-const V = 10;
-function A(i) {
+const X = 10;
+function A(s) {
   return new g({
     code: "E_DUPLICATE_PLUGIN",
-    message: `"${i}" is a layout engine the element ships, and a built-in name may not be taken: a saved document that named it yesterday has to mean the same thing today`,
+    message: `"${s}" is a layout engine the element ships, and a built-in name may not be taken: a saved document that named it yesterday has to mean the same thing today`,
     source: "registry",
-    details: { kind: "layout", name: i, builtIn: !0 }
+    details: { kind: "layout", name: s, builtIn: !0 }
   });
 }
-const E = class E {
+const m = class m {
   constructor() {
-    this.positionArrayAttached = !1;
+    this.positionArrayAttached = !1, this.hold = null, this.holdRows = 0;
   }
   /**
    * Add multiple nodes to the layout engine
@@ -534,7 +534,7 @@ const E = class E {
    * @param _nodes - the nodes that have just arrived
    */
   updatePositions(t) {
-    for (let e = 0; e < V; e++) {
+    for (let e = 0; e < X; e++) {
       if (this.isSettled)
         return;
       this.step();
@@ -570,6 +570,37 @@ const E = class E {
   attachPositions(t) {
     this.positionArray = t, this.positionArrayAttached = !0;
   }
+  /**
+   * Hold the nodes a scoped layout may not move, or release them all with null.
+   *
+   * The element calls this on an engine whose class declares `static scoped = true`, after
+   * `init()` and after every renumbering of the graph. A set bit is a held row. A row at or past
+   * `rows` belongs to a node that arrived after the scope was captured, and is held too: the
+   * members of a scoped layout are the ones it started with. An engine that overrides this calls
+   * `super.setHoldMask` first and then fixes held nodes in its own state (see
+   * {@link LayoutEngineStatics.scoped}).
+   * @param mask - One bit per row, set for a row to hold; null holds nothing.
+   * @param rows - How many rows the mask covers.
+   */
+  setHoldMask(t, e) {
+    this.hold = t, this.holdRows = t === null ? 0 : e;
+  }
+  /**
+   * The hold mask the element last handed this engine, or null when nothing is held.
+   * @returns The mask, which the caller must not change.
+   */
+  get holdMask() {
+    return this.hold;
+  }
+  /**
+   * Whether the element is holding this row still for a scoped layout.
+   * @param index - The node's row, or `INVALID_INDEX`.
+   * @returns True while a hold is set and the row is held or newer than the hold.
+   */
+  isHeld(t) {
+    const { hold: e } = this;
+    return e === null ? !1 : t >= this.holdRows || !Number.isInteger(t) || t < 0 || v(e, t);
+  }
   /**
    * Copy every node's current coordinates out of the engine and into the position array.
    *
@@ -600,8 +631,8 @@ const E = class E {
    * @returns true when the node has a placed row
    */
   readNodePosition(t, e) {
-    const s = this.positionsFor(t);
-    return s.isPlaced(t.index) ? (s.read(t.index, e), !0) : !1;
+    const i = this.positionsFor(t);
+    return i.isPlaced(t.index) ? (i.read(t.index, e), !0) : !1;
   }
   /**
    * Publish one node's coordinates, growing the array to reach its row.
@@ -641,12 +672,12 @@ const E = class E {
    * @param intent - `"layout"` for a simulation step, `"placement"` for a drag or a replay
    * @returns true when the row was written
    */
-  writeNodePosition(t, e, s, r, n = "layout") {
-    const { index: a } = t;
-    if (a === N || !Number.isInteger(a) || a < 0 || !d(e) || !d(s) || !d(r))
+  writeNodePosition(t, e, i, r, n = "layout") {
+    const { index: o } = t;
+    if (o === w || !Number.isInteger(o) || o < 0 || !d(e) || !d(i) || !d(r))
       return !1;
-    const c = this.positionsFor(t);
-    return n === "layout" && c.isPinned(a) ? !1 : (a >= c.count && c.grow(a + 1), c.write(a, e, s, r), !0);
+    const l = this.positionsFor(t);
+    return n === "layout" && (l.isPinned(o) || this.isHeld(o) && l.isPlaced(o)) ? !1 : (o >= l.count && l.grow(o + 1), l.write(o, e, i, r), !0);
   }
   /**
    * The weight of every ordered endpoint pair this batch of edges covers, or null when the
@@ -682,16 +713,16 @@ const E = class E {
   pairWeights(t) {
     if (t.length === 0)
       return null;
-    const s = t[0].parentGraph?.getDataManager?.()?.getSnapshot?.()?.edgeList().weights ?? null;
-    if (s === null)
+    const i = t[0].parentGraph?.getDataManager?.()?.getSnapshot?.()?.edgeList().weights ?? null;
+    if (i === null)
       return null;
     const r = /* @__PURE__ */ new Map();
     let n = !1;
-    for (const a of t) {
-      const c = a.index >= 0 && a.index < s.length ? s[a.index] : 1;
-      c !== 1 && (n = !0);
-      const I = U(a.srcId, a.dstId);
-      r.set(I, (r.get(I) ?? 0) + c);
+    for (const o of t) {
+      const l = o.index >= 0 && o.index < i.length ? i[o.index] : 1;
+      l !== 1 && (n = !0);
+      const I = V(o.srcId, o.dstId);
+      r.set(I, (r.get(I) ?? 0) + l);
     }
     return n ? r : null;
   }
@@ -708,12 +739,12 @@ const E = class E {
    * @param weights - the pair weights about to be handed to the layout function
    */
   reportClampedWeights(t, e) {
-    let s = 0;
+    let i = 0;
     for (const r of e.values())
-      r < P && s++;
-    s > 0 && G.warn("Edge weights at or below zero were clamped before the layout read them", {
+      r < P && i++;
+    i > 0 && U.warn("Edge weights at or below zero were clamped before the layout read them", {
       layout: t,
-      clamped: s,
+      clamped: i,
       epsilon: P
     });
   }
@@ -762,42 +793,46 @@ const E = class E {
    * `E_DUPLICATE_PLUGIN` when the name or the descriptor id is one the element itself ships.
    */
   static register(t) {
-    const e = t, { type: s, descriptor: r } = e;
-    if (typeof s != "string" || s === "")
+    const e = t, { type: i, descriptor: r } = e;
+    if (typeof i != "string" || i === "")
       throw new g({
         code: "E_BAD_COMMAND",
         message: "a layout engine is filed under its `static type`, and this class declares none",
         source: "registry",
         details: { kind: "layout", field: "type" }
       });
-    if (l.get(s) === t)
+    if (c.get(i) === t)
       return t;
-    const n = W.includes(s);
+    const n = G.includes(i);
     if (r === void 0) {
       if (!n)
         throw new g({
           code: "E_BAD_COMMAND",
-          message: `the layout "${s}" declares no \`static descriptor\`, so nothing could offer it: a picker reads the catalogue, and an engine the catalogue does not carry is reachable only by a consumer who already knows its name`,
+          message: `the layout "${i}" declares no \`static descriptor\`, so nothing could offer it: a picker reads the catalogue, and an engine the catalogue does not carry is reachable only by a consumer who already knows its name`,
           source: "registry",
-          details: { kind: "layout", name: s, field: "descriptor" }
+          details: { kind: "layout", name: i, field: "descriptor" }
         });
-      if (l.hasOwn(s))
-        throw A(s);
-      return l.set(s, t), t;
+      if (c.hasOwn(i))
+        throw A(i);
+      return c.set(i, t), t;
     }
     if (n)
-      throw A(s);
-    if (r.id !== s)
+      throw A(i);
+    if (r.id !== i)
       throw new g({
         code: "E_BAD_COMMAND",
-        message: `the layout "${s}" describes itself as "${r.id}". A layout has ONE key: the name \`setLayout\` takes and the name the catalogue publishes are the same string, so nothing has to be named twice and a saved document means one thing`,
+        message: `the layout "${i}" describes itself as "${r.id}". A layout has ONE key: the name \`setLayout\` takes and the name the catalogue publishes are the same string, so nothing has to be named twice and a saved document means one thing`,
         source: "registry",
-        details: { kind: "layout", name: s, field: "descriptor.id", id: r.id }
+        details: { kind: "layout", name: i, field: "descriptor.id", id: r.id }
       });
-    return B({
-      descriptor: { ...r, honoursWeights: e.honoursWeights ?? !1 },
-      type: s
-    }), l.set(s, t), t;
+    return C({
+      descriptor: {
+        ...r,
+        honoursWeights: e.honoursWeights ?? !1,
+        scoped: e.scoped ?? !1
+      },
+      type: i
+    }), c.set(i, t), t;
   }
   /**
    * Get a layout engine instance by type
@@ -806,8 +841,8 @@ const E = class E {
    * @returns A new layout engine instance or null if type not found
    */
   static get(t, e = {}) {
-    const s = l.get(t);
-    return s ? new s(e) : null;
+    const i = c.get(t);
+    return i ? new i(e) : null;
   }
   /**
    * Get dimension-specific options for this layout
@@ -824,8 +859,8 @@ const E = class E {
    * @returns Options object for the dimension or null if type not found or unsupported
    */
   static getOptionsForDimensionByType(t, e) {
-    const s = l.get(t);
-    return s ? s.getOptionsForDimension(e) : null;
+    const i = c.get(t);
+    return i ? i.getOptionsForDimension(e) : null;
   }
   /**
    * Get the Zod-based options schema for this layout
@@ -846,7 +881,7 @@ const E = class E {
    * @returns Array of registered layout type identifiers
    */
   static getRegisteredTypes() {
-    return Array.from(l.keys());
+    return Array.from(c.keys());
   }
   /**
    * Get a layout class by type
@@ -854,22 +889,22 @@ const E = class E {
    * @returns The layout engine class or null if not found
    */
   static getClass(t) {
-    return l.get(t) ?? null;
+    return c.get(t) ?? null;
   }
 };
-E.honoursWeights = !1;
-let w = E;
-const X = O.looseObject({
+m.honoursWeights = !1, m.scoped = !1;
+let b = m;
+const H = O.looseObject({
   scalingFactor: O.number().default(100)
 });
-class ut extends w {
+class pt extends b {
   /**
    * Create a simple layout engine
    * @param opts - Configuration options including scalingFactor
    */
   constructor(t = {}) {
     super(), this._nodes = [], this._edges = [], this.stale = !0, this.positions = {}, this.scalingFactor = 100, this.isSettled = !0;
-    const e = X.parse(t);
+    const e = H.parse(t);
     this.scalingFactor = e.scalingFactor;
   }
   /**
@@ -929,8 +964,8 @@ class ut extends w {
    * @param p - where it moved to
    */
   setNodePosition(t, e) {
-    const s = e.z ?? 0;
-    this.writeNodePosition(t, e.x, e.y, s, "placement"), this.positions[t.id] = [e.x / this.scalingFactor, e.y / this.scalingFactor, s / this.scalingFactor];
+    const i = e.z ?? 0;
+    this.writeNodePosition(t, e.x, e.y, i, "placement"), this.positions[t.id] = [e.x / this.scalingFactor, e.y / this.scalingFactor, i / this.scalingFactor];
   }
   /**
    * Get the position of an edge based on its endpoints
@@ -1057,105 +1092,105 @@ class ut extends w {
    * @returns a fresh coordinate triple
    */
   publishedOr(t, e) {
-    const s = { x: 0, y: 0, z: 0 };
-    return t !== void 0 && this.readNodePosition(t, s) ? s : K(this.positions[e], this.scalingFactor);
+    const i = { x: 0, y: 0, z: 0 };
+    return t !== void 0 && this.readNodePosition(t, i) ? i : K(this.positions[e], this.scalingFactor);
   }
 }
-function K(i, t) {
-  if (!i || i.length === 0)
+function K(s, t) {
+  if (!s || s.length === 0)
     return { x: 0, y: 0, z: 0 };
-  const e = i[0] * t, s = i[1] * t, r = (i[2] ?? 0) * t;
-  return { x: e, y: s, z: r };
+  const e = s[0] * t, i = s[1] * t, r = (s[2] ?? 0) * t;
+  return { x: e, y: i, z: r };
 }
-const H = /^#[0-9a-f]{6}$/i;
-function q(i) {
-  if (typeof i != "string" || i.trim() === "")
+const q = /^#[0-9a-f]{6}$/i;
+function J(s) {
+  if (typeof s != "string" || s.trim() === "")
     return null;
   try {
-    const t = L(i.trim());
+    const t = L(s.trim());
     if (t === void 0)
       return null;
     const e = t.length === 9 ? t.slice(0, 7) : t;
-    return H.test(e) ? e.toUpperCase() : null;
+    return q.test(e) ? e.toUpperCase() : null;
   } catch {
     return null;
   }
 }
-function J(i) {
-  return JSON.stringify([i.id, i.kind, i.colors, i.capacity, i.colorblindSafe]);
+function Y(s) {
+  return JSON.stringify([s.id, s.kind, s.colors, s.capacity, s.colorblindSafe]);
 }
-const y = b({
+const N = E({
   kind: "palette",
-  idOf: (i) => i.id,
-  descriptorOf: (i) => i,
-  implementationOf: J,
+  idOf: (s) => s.id,
+  descriptorOf: (s) => s,
+  implementationOf: Y,
   builtInIds: () => k
 });
-function u(i, t, e) {
+function u(s, t, e) {
   throw new g({
     code: "E_BAD_COMMAND",
     message: e,
     source: "registry",
-    details: { kind: "palette", name: typeof i == "string" ? i : "", field: t }
+    details: { kind: "palette", name: typeof s == "string" ? s : "", field: t }
   });
 }
-function pt(i, t) {
-  typeof i != "object" && u("", "descriptor", "registerPalette takes a palette descriptor"), (i.plainName === void 0 || i.plainName === "") && u(i.id, "plainName", `the palette "${String(i.id)}" was registered without a plain name`), i.kind !== "sequential" && i.kind !== "diverging" && i.kind !== "categorical" && u(
-    i.id,
+function gt(s, t) {
+  typeof s != "object" && u("", "descriptor", "registerPalette takes a palette descriptor"), (s.plainName === void 0 || s.plainName === "") && u(s.id, "plainName", `the palette "${String(s.id)}" was registered without a plain name`), s.kind !== "sequential" && s.kind !== "diverging" && s.kind !== "categorical" && u(
+    s.id,
     "kind",
-    `the palette "${String(i.id)}" must be sequential, diverging or categorical`
-  ), (!Array.isArray(i.colors) || i.colors.length === 0) && u(i.id, "colors", `the palette "${String(i.id)}" was registered with no colours`);
+    `the palette "${String(s.id)}" must be sequential, diverging or categorical`
+  ), (!Array.isArray(s.colors) || s.colors.length === 0) && u(s.id, "colors", `the palette "${String(s.id)}" was registered with no colours`);
   const e = [];
-  for (const r of i.colors) {
-    const n = q(r);
-    n === null && u(i.id, "colors", `"${String(r)}" in the palette "${String(i.id)}" is not a colour`), e.push(n);
+  for (const r of s.colors) {
+    const n = J(r);
+    n === null && u(s.id, "colors", `"${String(r)}" in the palette "${String(s.id)}" is not a colour`), e.push(n);
   }
-  const s = i.kind === "categorical" ? e.length : null;
-  i.capacity !== void 0 && i.capacity !== s && u(
-    i.id,
+  const i = s.kind === "categorical" ? e.length : null;
+  s.capacity !== void 0 && s.capacity !== i && u(
+    s.id,
     "capacity",
-    `the palette "${String(i.id)}" is ${i.kind}, so its capacity is ${s === null ? "null" : String(s)} rather than ${String(i.capacity)}`
-  ), y.register(
+    `the palette "${String(s.id)}" is ${s.kind}, so its capacity is ${i === null ? "null" : String(i)} rather than ${String(s.capacity)}`
+  ), N.register(
     Object.freeze({
-      ...i,
+      ...s,
       colors: Object.freeze(e),
-      capacity: s,
-      colorblindSafe: Object.freeze(i.colorblindSafe ?? [])
+      capacity: i,
+      colorblindSafe: Object.freeze(s.colorblindSafe ?? [])
     }),
     t
   );
 }
-function gt() {
-  return y.descriptors();
+function ft() {
+  return N.descriptors();
 }
-function ft(i) {
-  return y.byId(i);
+function mt(s) {
+  return N.byId(s);
 }
-function mt() {
-  y.clearForTesting();
+function yt() {
+  N.clearForTesting();
 }
 export {
   x as E,
-  _ as F,
-  w as L,
-  o as P,
-  X as S,
-  ot as U,
+  T as F,
+  b as L,
+  a as P,
+  H as S,
+  at as U,
   P as W,
-  ut as a,
-  dt as b,
-  nt as c,
-  mt as d,
-  $ as e,
-  ct as f,
-  gt as g,
-  rt as h,
-  at as i,
-  lt as j,
-  U as k,
-  ht as l,
-  ft as m,
+  pt as a,
+  ut as b,
+  ot as c,
+  yt as d,
+  R as e,
+  ht as f,
+  ft as g,
+  nt as h,
+  lt as i,
+  ct as j,
+  V as k,
+  dt as l,
+  mt as m,
   d as n,
-  st as p,
-  pt as r
+  rt as p,
+  gt as r
 };