@kgdiff/layout 0.0.0-stage → 0.2.0

package/dist/init.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Deterministic initial placement (docs/algorithms.md §12 "Simulation").
+ *
+ * Fresh components start on a phyllotaxis (sunflower) spiral filled in BFS order from the
+ * highest-degree node, so graph distance ≈ radial distance and the simulation never starts from
+ * a hairball. Each BFS layer occupies a contiguous run of spiral slots; within that annulus the
+ * nodes are assigned to slots by angle, aligned with the angle of their BFS parent, so subtrees
+ * start in the same sector as their parent and parent–child links start out short and uncrossed.
+ *
+ * Nodes added around fixed ones start at the barycenter of their placed neighbours (or next to
+ * their merge / split partner), and a lone new leaf sprouts on the open side of its neighbour.
+ */
+import type { LayoutGraph } from './graph.js';
+import { type Random } from './prng.js';
+/** Merge / split partners of every node, both directions, ascending. */
+export declare function partnerLists(graph: LayoutGraph): readonly (readonly number[])[];
+/**
+ * Place one component (ascending indices) on a seeded, BFS-ordered phyllotaxis spiral around the
+ * origin. `visited` is shared across components (they are disjoint).
+ */
+export declare function placeOnSpiral(graph: LayoutGraph, partners: readonly (readonly number[])[], members: readonly number[], spacing: number, random: Random, visited: Uint8Array, x: Float64Array, y: Float64Array): void;
+/**
+ * Give every unplaced node of `members` that is connected to a placed one a start position,
+ * layer by layer outwards from the placed set. Within a layer, positions depend only on earlier
+ * layers and on the node's own id, never on processing order.
+ */
+export declare function placeAroundFixed(graph: LayoutGraph, partners: readonly (readonly number[])[], members: readonly number[], placed: Uint8Array, x: Float64Array, y: Float64Array, linkDistance: number, seed: number): void;
+//# sourceMappingURL=init.d.ts.map

package/dist/init.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"init.d.ts","sourceRoot":"","sources":["../src/init.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,OAAO,EAAc,KAAK,MAAM,EAAmB,MAAM,WAAW,CAAC;AAQrE,wEAAwE;AACxE,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,GAAG,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAQ/E;AAYD;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,WAAW,EAClB,QAAQ,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,EACxC,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,UAAU,EACnB,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,GACd,IAAI,CA0EN;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,WAAW,EAClB,QAAQ,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,EACxC,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,MAAM,EAAE,UAAU,EAClB,CAAC,EAAE,YAAY,EACf,CAAC,EAAE,YAAY,EACf,YAAY,EAAE,MAAM,EACpB,IAAI,EAAE,MAAM,GACX,IAAI,CA6BN"}

package/dist/init.js

@@ -0,0 +1,196 @@
+import { pseudoAngle, pseudoAngleDistance } from './math.js';
+import { nodeRandom, randomDirection } from './prng.js';
+/** Golden angle π(3 − √5) as exact literals: the spiral is built by rotation, without trig. */
+const COS_GOLDEN = -0.7373688780783197;
+const SIN_GOLDEN = 0.6754902942615238;
+/** Offsets tried when aligning a BFS layer with its parents (more are sampled with a stride). */
+const MAX_ALIGN_OFFSETS = 48;
+/** Merge / split partners of every node, both directions, ascending. */
+export function partnerLists(graph) {
+    const lists = Array.from({ length: graph.n }, () => []);
+    for (const { mover, anchor } of graph.partners) {
+        lists[mover].push(anchor);
+        lists[anchor].push(mover);
+    }
+    for (const list of lists)
+        list.sort((a, b) => a - b);
+    return lists;
+}
+function forEachNeighbour(graph, partners, u, visit) {
+    for (let k = graph.offsets[u]; k < graph.offsets[u + 1]; k++)
+        visit(graph.adjacency[k]);
+    for (const v of partners[u])
+        visit(v);
+}
+/**
+ * Place one component (ascending indices) on a seeded, BFS-ordered phyllotaxis spiral around the
+ * origin. `visited` is shared across components (they are disjoint).
+ */
+export function placeOnSpiral(graph, partners, members, spacing, random, visited, x, y) {
+    let root = members[0];
+    if (root === undefined)
+        return;
+    for (const m of members)
+        if (graph.degree[m] > graph.degree[root])
+            root = m;
+    // The whole spiral is rotated by a seeded angle and each slot jittered a little, so different
+    // seeds give different (equally good) layouts.
+    const phase = randomDirection(random);
+    let c = phase.x;
+    let s = phase.y;
+    const jitter = spacing * 0.3;
+    let slot = 1;
+    visited[root] = 1;
+    x[root] = 0;
+    y[root] = 0;
+    let layer = [root];
+    while (layer.length > 0) {
+        const next = [];
+        const parentAngle = [];
+        for (const u of layer) {
+            const children = [];
+            forEachNeighbour(graph, partners, u, (v) => {
+                if (!visited[v]) {
+                    visited[v] = 1;
+                    children.push(v);
+                }
+            });
+            children.sort((a, b) => graph.degree[b] - graph.degree[a] || a - b);
+            const angle = pseudoAngle(x[u], y[u]);
+            for (const v of children) {
+                next.push(v);
+                parentAngle.push(angle);
+            }
+        }
+        if (next.length === 0)
+            break;
+        const slots = [];
+        for (let j = 0; j < next.length; j++, slot++) {
+            const r = spacing * Math.sqrt(slot);
+            slots.push({ x: r * c, y: r * s, angle: pseudoAngle(c, s) });
+            const cr = c * COS_GOLDEN - s * SIN_GOLDEN;
+            s = c * SIN_GOLDEN + s * COS_GOLDEN;
+            c = cr;
+        }
+        slots.sort((a, b) => a.angle - b.angle);
+        const count = next.length;
+        const stride = Math.max(1, Math.ceil(count / MAX_ALIGN_OFFSETS));
+        let bestOffset = 0;
+        let bestCost = Number.POSITIVE_INFINITY;
+        for (let o = 0; o < count; o += stride) {
+            let cost = 0;
+            for (let i = 0; i < count; i++) {
+                cost += pseudoAngleDistance(parentAngle[i], slots[(i + o) % count].angle);
+            }
+            if (cost < bestCost) {
+                bestCost = cost;
+                bestOffset = o;
+            }
+        }
+        for (let i = 0; i < count; i++) {
+            const v = next[i];
+            const target = slots[(i + bestOffset) % count];
+            x[v] = target.x + (random() - 0.5) * jitter;
+            y[v] = target.y + (random() - 0.5) * jitter;
+        }
+        layer = next
+            .map((v) => ({ v, angle: pseudoAngle(x[v], y[v]) }))
+            .sort((a, b) => a.angle - b.angle || a.v - b.v)
+            .map((e) => e.v);
+    }
+}
+/**
+ * Give every unplaced node of `members` that is connected to a placed one a start position,
+ * layer by layer outwards from the placed set. Within a layer, positions depend only on earlier
+ * layers and on the node's own id, never on processing order.
+ */
+export function placeAroundFixed(graph, partners, members, placed, x, y, linkDistance, seed) {
+    const hasPlacedNeighbour = (u) => {
+        let found = false;
+        forEachNeighbour(graph, partners, u, (v) => {
+            if (placed[v])
+                found = true;
+        });
+        return found;
+    };
+    let layer = members.filter((u) => !placed[u] && hasPlacedNeighbour(u));
+    while (layer.length > 0) {
+        const starts = layer.map((u) => startNear(graph, partners, u, placed, x, y, linkDistance, seed));
+        const queued = new Set();
+        for (let i = 0; i < layer.length; i++) {
+            const u = layer[i];
+            const p = starts[i];
+            x[u] = p.x;
+            y[u] = p.y;
+            placed[u] = 1;
+        }
+        for (const u of layer) {
+            forEachNeighbour(graph, partners, u, (v) => {
+                if (!placed[v])
+                    queued.add(v);
+            });
+        }
+        layer = [...queued].sort((a, b) => a - b);
+    }
+}
+function startNear(graph, partners, u, placed, x, y, linkDistance, seed) {
+    const random = nodeRandom(seed, graph.nodes[u].id);
+    const centroid = (list) => {
+        let sx = 0;
+        let sy = 0;
+        for (const v of list) {
+            sx += x[v];
+            sy += y[v];
+        }
+        return { x: sx / list.length, y: sy / list.length };
+    };
+    const placedPartners = partners[u].filter((v) => placed[v]);
+    if (placedPartners.length > 0) {
+        const base = centroid(placedPartners);
+        const dir = randomDirection(random);
+        return { x: base.x + dir.x * linkDistance * 0.5, y: base.y + dir.y * linkDistance * 0.5 };
+    }
+    const neighbours = [];
+    for (let k = graph.offsets[u]; k < graph.offsets[u + 1]; k++) {
+        const v = graph.adjacency[k];
+        if (placed[v])
+            neighbours.push(v);
+    }
+    if (neighbours.length >= 2) {
+        const base = centroid(neighbours);
+        const dir = randomDirection(random);
+        return { x: base.x + dir.x * linkDistance * 0.25, y: base.y + dir.y * linkDistance * 0.25 };
+    }
+    // A single placed neighbour p: sprout on p's open side (away from p's other placed
+    // neighbours), turned by up to ±55° so siblings fan out.
+    const p = neighbours[0];
+    const others = [];
+    for (let k = graph.offsets[p]; k < graph.offsets[p + 1]; k++) {
+        const v = graph.adjacency[k];
+        if (v !== u && placed[v])
+            others.push(v);
+    }
+    let ax = 0;
+    let ay = 0;
+    if (others.length > 0) {
+        const o = centroid(others);
+        ax = x[p] - o.x;
+        ay = y[p] - o.y;
+    }
+    const len = Math.sqrt(ax * ax + ay * ay);
+    if (len < 1e-9) {
+        const dir = randomDirection(random);
+        ax = dir.x;
+        ay = dir.y;
+    }
+    else {
+        ax /= len;
+        ay /= len;
+    }
+    const sin = (random() * 2 - 1) * 0.82;
+    const cos = Math.sqrt(1 - sin * sin);
+    const dx = ax * cos - ay * sin;
+    const dy = ax * sin + ay * cos;
+    return { x: x[p] + dx * linkDistance, y: y[p] + dy * linkDistance };
+}
+//# sourceMappingURL=init.js.map

package/dist/init.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"init.js","sourceRoot":"","sources":["../src/init.ts"],"names":[],"mappings":"AAaA,OAAO,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAe,eAAe,EAAE,MAAM,WAAW,CAAC;AAErE,+FAA+F;AAC/F,MAAM,UAAU,GAAG,CAAC,kBAAkB,CAAC;AACvC,MAAM,UAAU,GAAG,kBAAkB,CAAC;AACtC,iGAAiG;AACjG,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAE7B,wEAAwE;AACxE,MAAM,UAAU,YAAY,CAAC,KAAkB;IAC7C,MAAM,KAAK,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACpE,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC/C,KAAK,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,KAAK,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAkB,EAClB,QAAwC,EACxC,CAAS,EACT,KAA0B;IAE1B,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC;IAC3F,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAE;QAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAkB,EAClB,QAAwC,EACxC,OAA0B,EAC1B,OAAe,EACf,MAAc,EACd,OAAmB,EACnB,CAAe,EACf,CAAe;IAEf,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO;IAC/B,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAE;YAAE,IAAI,GAAG,CAAC,CAAC;IAE9E,8FAA8F;IAC9F,+CAA+C;IAC/C,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAChB,MAAM,MAAM,GAAG,OAAO,GAAG,GAAG,CAAC;IAC7B,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,gBAAgB,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;gBACzC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACf,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC,CAAC,CAAC;YACH,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACb,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAE7B,MAAM,KAAK,GAA8C,EAAE,CAAC;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7D,MAAM,EAAE,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC,GAAG,UAAU,CAAC;YAC3C,CAAC,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC,GAAG,UAAU,CAAC;YACpC,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAExC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC;QACjE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,QAAQ,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;YACvC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,IAAI,mBAAmB,CAAC,WAAW,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAE,CAAC,KAAK,CAAC,CAAC;YAC9E,CAAC;YACD,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;gBACpB,QAAQ,GAAG,IAAI,CAAC;gBAChB,UAAU,GAAG,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YACnB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,KAAK,CAAE,CAAC;YAChD,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC;YAC5C,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC;QAC9C,CAAC;QAED,KAAK,GAAG,IAAI;aACT,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;aACrD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAC9C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAkB,EAClB,QAAwC,EACxC,OAA0B,EAC1B,MAAkB,EAClB,CAAe,EACf,CAAe,EACf,YAAoB,EACpB,IAAY;IAEZ,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAW,EAAE;QAChD,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,gBAAgB,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;YACzC,IAAI,MAAM,CAAC,CAAC,CAAC;gBAAE,KAAK,GAAG,IAAI,CAAC;QAC9B,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IACF,IAAI,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7B,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,CAChE,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACpB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACrB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACX,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,gBAAgB,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;gBACzC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC;QACL,CAAC;QACD,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAChB,KAAkB,EAClB,QAAwC,EACxC,CAAS,EACT,MAAkB,EAClB,CAAe,EACf,CAAe,EACf,YAAoB,EACpB,IAAY;IAEZ,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;IACpD,MAAM,QAAQ,GAAG,CAAC,IAAuB,EAA4B,EAAE;QACrE,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC;YACZ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC;QACd,CAAC;QACD,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IACtD,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACpC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,YAAY,GAAG,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,YAAY,GAAG,GAAG,EAAE,CAAC;IAC5F,CAAC;IAED,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/D,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,CAAC,CAAC;YAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACpC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,YAAY,GAAG,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,YAAY,GAAG,IAAI,EAAE,CAAC;IAC9F,CAAC;IAED,mFAAmF;IACnF,yDAAyD;IACzD,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;IACzB,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/D,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC3B,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACzC,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACpC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QACX,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,CAAC;SAAM,CAAC;QACN,EAAE,IAAI,GAAG,CAAC;QACV,EAAE,IAAI,GAAG,CAAC;IACZ,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IACtC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;IACrC,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;IAC/B,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;IAC/B,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,GAAG,EAAE,GAAG,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,GAAG,EAAE,GAAG,YAAY,EAAE,CAAC;AACxE,CAAC"}

package/dist/json.d.ts

@@ -0,0 +1,4 @@
+import type { LayoutJSON, LayoutResult } from './index.js';
+export declare function toJSON(layout: LayoutResult): LayoutJSON;
+export declare function fromJSON(json: LayoutJSON): LayoutResult;
+//# sourceMappingURL=json.d.ts.map

package/dist/json.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"json.d.ts","sourceRoot":"","sources":["../src/json.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAEV,UAAU,EACV,YAAY,EAGb,MAAM,YAAY,CAAC;AAiBpB,wBAAgB,MAAM,CAAC,MAAM,EAAE,YAAY,GAAG,UAAU,CAevD;AAiCD,wBAAgB,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,YAAY,CAuDvD"}

package/dist/json.js

@@ -0,0 +1,112 @@
+/**
+ * Deterministic JSON transport for layouts (no timing information).
+ */
+import { KgdiffError } from '@kgdiff/core';
+import { round2 } from './math.js';
+const byKey = ([a], [b]) => a < b ? -1 : a > b ? 1 : 0;
+function sortedEntries(entries) {
+    return [...entries].sort(byKey);
+}
+const rect = (r) => ({
+    x: round2(r.x),
+    y: round2(r.y),
+    width: round2(r.width),
+    height: round2(r.height),
+});
+export function toJSON(layout) {
+    return {
+        format: 'kgdiff.layout',
+        version: 1,
+        strategy: layout.stats.strategy,
+        scope: layout.scope,
+        iterations: layout.stats.iterations,
+        positions: Object.fromEntries(sortedEntries(layout.positions).map(([id, p]) => [id, [round2(p.x), round2(p.y)]])),
+        radii: Object.fromEntries(sortedEntries(layout.radii).map(([id, r]) => [id, round2(r)])),
+        hidden: Object.fromEntries(sortedEntries(layout.hidden)),
+        bounds: rect(layout.bounds),
+        components: layout.components.map((c) => ({ nodes: [...c.nodes], bounds: rect(c.bounds) })),
+    };
+}
+function fail(message, details) {
+    throw new KgdiffError('invalid-input', `layoutFromJSON: ${message}`, details);
+}
+const isObject = (v) => typeof v === 'object' && v !== null && !Array.isArray(v);
+const finite = (v) => typeof v === 'number' && Number.isFinite(v);
+function readRect(value, where) {
+    if (!isObject(value) || ![value.x, value.y, value.width, value.height].every(finite)) {
+        fail(`${where} must be a rectangle`, { where });
+    }
+    return Object.freeze({
+        x: value.x,
+        y: value.y,
+        width: value.width,
+        height: value.height,
+    });
+}
+function readNumbers(value, where) {
+    if (!isObject(value))
+        fail(`${where} must be an object`, { where });
+    const out = new Map();
+    for (const [id, n] of sortedEntries(Object.entries(value))) {
+        if (!finite(n))
+            fail(`${where}["${id}"] must be a finite number`, { where, id });
+        out.set(id, n);
+    }
+    return out;
+}
+export function fromJSON(json) {
+    const raw = json;
+    if (!isObject(raw) || raw.format !== 'kgdiff.layout')
+        fail('not a kgdiff.layout document');
+    if (raw.version !== 1) {
+        throw new KgdiffError('unsupported-version', `Unsupported kgdiff.layout version ${String(raw.version)}`, {
+            version: raw.version,
+        });
+    }
+    const strategy = raw.strategy;
+    if (strategy !== 'union' && strategy !== 'anchored')
+        fail('strategy must be union or anchored');
+    const scope = raw.scope;
+    if (scope !== 'all' && scope !== 'changes')
+        fail('scope must be all or changes');
+    const iterations = raw.iterations;
+    if (!finite(iterations) || iterations < 0)
+        fail('iterations must be a number ≥ 0');
+    if (!isObject(raw.positions))
+        fail('positions must be an object');
+    const positions = new Map();
+    for (const [id, p] of sortedEntries(Object.entries(raw.positions))) {
+        if (!Array.isArray(p) || p.length !== 2 || !finite(p[0]) || !finite(p[1])) {
+            fail(`positions["${id}"] must be [x, y]`, { id });
+        }
+        positions.set(id, Object.freeze({ x: p[0], y: p[1] }));
+    }
+    const radii = readNumbers(raw.radii, 'radii');
+    const hidden = readNumbers(raw.hidden, 'hidden');
+    if (!Array.isArray(raw.components))
+        fail('components must be an array');
+    const components = raw.components.map((c, k) => {
+        if (!isObject(c) || !Array.isArray(c.nodes) || !c.nodes.every((id) => typeof id === 'string')) {
+            fail(`components[${k}] must have a nodes array`, { index: k });
+        }
+        return Object.freeze({
+            nodes: Object.freeze([...c.nodes]),
+            bounds: readRect(c.bounds, `components[${k}].bounds`),
+        });
+    });
+    return Object.freeze({
+        positions,
+        radii,
+        bounds: readRect(raw.bounds, 'bounds'),
+        scope: scope,
+        hidden,
+        components: Object.freeze(components),
+        stats: Object.freeze({
+            strategy: strategy,
+            iterations,
+            nodes: positions.size,
+            ms: 0,
+        }),
+    });
+}
+//# sourceMappingURL=json.js.map

package/dist/json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json.js","sourceRoot":"","sources":["../src/json.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,WAAW,EAAuC,MAAM,cAAc,CAAC;AAQhF,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEnC,MAAM,KAAK,GAAG,CAAI,CAAC,CAAC,CAAuB,EAAE,CAAC,CAAC,CAAuB,EAAU,EAAE,CAChF,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE7B,SAAS,aAAa,CAAI,OAAwC;IAChE,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,IAAI,GAAG,CAAC,CAAO,EAAQ,EAAE,CAAC,CAAC;IAC/B,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACd,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;CACzB,CAAC,CAAC;AAEH,MAAM,UAAU,MAAM,CAAC,MAAoB;IACzC,OAAO;QACL,MAAM,EAAE,eAAe;QACvB,OAAO,EAAE,CAAC;QACV,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,QAAQ;QAC/B,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU;QACnC,SAAS,EAAE,MAAM,CAAC,WAAW,CAC3B,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAU,CAAC,CAAC,CAC5F;QACD,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxF,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC3B,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;KAC5F,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAC,OAAe,EAAE,OAA2C;IACxE,MAAM,IAAI,WAAW,CAAC,eAAe,EAAE,mBAAmB,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC;AAChF,CAAC;AAED,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAgC,EAAE,CAC5D,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAE3D,MAAM,MAAM,GAAG,CAAC,CAAU,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AAExF,SAAS,QAAQ,CAAC,KAAc,EAAE,KAAa;IAC7C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QACrF,IAAI,CAAC,GAAG,KAAK,sBAAsB,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,CAAC,EAAE,KAAK,CAAC,CAAW;QACpB,CAAC,EAAE,KAAK,CAAC,CAAW;QACpB,KAAK,EAAE,KAAK,CAAC,KAAe;QAC5B,MAAM,EAAE,KAAK,CAAC,MAAgB;KAC/B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,WAAW,CAAC,KAAc,EAAE,KAAa;IAChD,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,IAAI,CAAC,GAAG,KAAK,oBAAoB,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IACpE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAmB,CAAC;IACvC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAC3D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,GAAG,KAAK,KAAK,EAAE,4BAA4B,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACjF,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,IAAgB;IACvC,MAAM,GAAG,GAAY,IAAI,CAAC;IAC1B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,eAAe;QAAE,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAC3F,IAAI,GAAG,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,WAAW,CACnB,qBAAqB,EACrB,qCAAqC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAC1D;YACE,OAAO,EAAE,GAAG,CAAC,OAAO;SACrB,CACF,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;IAC9B,IAAI,QAAQ,KAAK,OAAO,IAAI,QAAQ,KAAK,UAAU;QAAE,IAAI,CAAC,oCAAoC,CAAC,CAAC;IAChG,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IACxB,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,SAAS;QAAE,IAAI,CAAC,8BAA8B,CAAC,CAAC;IACjF,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;IAClC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC;QAAE,IAAI,CAAC,iCAAiC,CAAC,CAAC;IAEnF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;QAAE,IAAI,CAAC,6BAA6B,CAAC,CAAC;IAClE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;QACnE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1E,IAAI,CAAC,cAAc,EAAE,mBAAmB,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACpD,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAC;IAC7E,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC9C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAEjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,IAAI,CAAC,6BAA6B,CAAC,CAAC;IACxE,MAAM,UAAU,GAAsB,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAU,EAAE,CAAS,EAAE,EAAE;QACjF,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE,CAAC;YAC9F,IAAI,CAAC,cAAc,CAAC,2BAA2B,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAI,CAAC,CAAC,KAAkB,CAAC,CAAC;YAChD,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,UAAU,CAAC;SACtD,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,SAAS;QACT,KAAK;QACL,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC;QACtC,KAAK,EAAE,KAAoB;QAC3B,MAAM;QACN,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;QACrC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC;YACnB,QAAQ,EAAE,QAA0B;YACpC,UAAU;YACV,KAAK,EAAE,SAAS,CAAC,IAAI;YACrB,EAAE,EAAE,CAAC;SACN,CAAC;KACH,CAAC,CAAC;AACL,CAAC"}

package/dist/layout.d.ts

@@ -0,0 +1,7 @@
+/**
+ * `layoutDiff`: scope → layout graph → strategy → simulation → packing → result.
+ */
+import type { DiffResult } from '@kgdiff/core';
+import type { LayoutOptions, LayoutResult } from './index.js';
+export declare function computeLayout(diff: DiffResult, options: LayoutOptions | undefined, nodeRadius: (degree: number) => number): LayoutResult;
+//# sourceMappingURL=layout.d.ts.map

package/dist/layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../src/layout.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,EAAE,UAAU,EAAkB,MAAM,cAAc,CAAC;AAG/D,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAmC9D,wBAAgB,aAAa,CAC3B,IAAI,EAAE,UAAU,EAChB,OAAO,EAAE,aAAa,GAAG,SAAS,EAClC,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,GACrC,YAAY,CAyCd"}

package/dist/layout.js

@@ -0,0 +1,70 @@
+import { placeAnchored, placeFree } from './engine.js';
+import { buildLayoutGraph } from './graph.js';
+import { round2 } from './math.js';
+import { resolveLayoutOptions } from './options.js';
+import { assemble, now } from './result.js';
+import { selectScope } from './scope.js';
+import { buildUnionGraph } from './union.js';
+const finitePoint = (p) => p !== undefined && Number.isFinite(p.x) && Number.isFinite(p.y);
+/**
+ * Known positions, by priority: explicit pins, then the before version's `position` (the mental
+ * map the reviewer already has), then the after version's.
+ */
+function knownPositions(graph, options) {
+    const fixed = new Uint8Array(graph.n);
+    const x = new Float64Array(graph.n);
+    const y = new Float64Array(graph.n);
+    let count = 0;
+    for (let i = 0; i < graph.n; i++) {
+        const node = graph.nodes[i];
+        const candidates = [options.pinned.get(node.id), node.before?.position, node.after?.position];
+        const p = candidates.find(finitePoint);
+        if (p === undefined)
+            continue;
+        fixed[i] = 1;
+        x[i] = p.x;
+        y[i] = p.y;
+        count++;
+    }
+    return { fixed, x, y, count };
+}
+export function computeLayout(diff, options, nodeRadius) {
+    const started = now();
+    const opts = resolveLayoutOptions(options);
+    const union = buildUnionGraph(diff);
+    const scope = opts.scope ?? (union.nodes.length > opts.largeGraphThreshold ? 'changes' : 'all');
+    const selection = selectScope(union, scope, opts.contextHops, opts.hubDegree);
+    const graph = buildLayoutGraph(union, selection.visible, { fontSize: opts.fontSize, nodeRadius });
+    const known = knownPositions(graph, opts);
+    const strategy = opts.strategy ?? (known.count > 0 ? 'anchored' : 'union');
+    const anchored = strategy === 'anchored' && known.count > 0;
+    const ctx = {
+        graph,
+        options: opts,
+        x: anchored ? known.x : new Float64Array(graph.n),
+        y: anchored ? known.y : new Float64Array(graph.n),
+    };
+    const iterations = anchored ? placeAnchored(ctx, known.fixed) : placeFree(ctx);
+    const positions = new Map();
+    const radii = new Map();
+    for (let i = 0; i < graph.n; i++) {
+        const id = graph.nodes[i].id;
+        // Known positions are preserved exactly; computed ones are rounded to 0.01.
+        const exact = anchored && known.fixed[i] === 1;
+        const x = exact ? ctx.x[i] : round2(ctx.x[i]);
+        const y = exact ? ctx.y[i] : round2(ctx.y[i]);
+        positions.set(id, Object.freeze({ x, y }));
+        radii.set(id, graph.radius[i]);
+    }
+    return assemble({
+        graph,
+        positions,
+        radii,
+        hidden: selection.hidden,
+        scope,
+        strategy,
+        iterations,
+        started,
+    });
+}
+//# sourceMappingURL=layout.js.map

package/dist/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../src/layout.ts"],"names":[],"mappings":"AAIA,OAAO,EAAsB,aAAa,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAoB,MAAM,YAAY,CAAC;AAEhE,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AACnC,OAAO,EAA8B,oBAAoB,EAAE,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE7C,MAAM,WAAW,GAAG,CAAC,CAAoB,EAAc,EAAE,CACvD,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAElE;;;GAGG;AACH,SAAS,cAAc,CACrB,KAAkB,EAClB,OAA8B;IAE9B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACpC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC9F,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QAC9B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,KAAK,EAAE,CAAC;IACV,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,IAAgB,EAChB,OAAkC,EAClC,UAAsC;IAEtC,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC;IACtB,MAAM,IAAI,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAChG,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC9E,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;IAElG,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAC3E,MAAM,QAAQ,GAAG,QAAQ,KAAK,UAAU,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IAC5D,MAAM,GAAG,GAAkB;QACzB,KAAK;QACL,OAAO,EAAE,IAAI;QACb,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;QACjD,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;KAClD,CAAC;IACF,MAAM,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAE/E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAmB,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;QAC9B,4EAA4E;QAC5E,MAAM,KAAK,GAAG,QAAQ,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;QAChD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;QAChD,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,QAAQ,CAAC;QACd,KAAK;QACL,SAAS;QACT,KAAK;QACL,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,KAAK;QACL,QAAQ;QACR,UAAU;QACV,OAAO;KACR,CAAC,CAAC;AACL,CAAC"}

package/dist/math.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Deterministic arithmetic.
+ *
+ * ECMAScript only guarantees exact (correctly rounded) results for + − × ÷ and, in every engine
+ * in practice, `Math.sqrt`. `Math.log2`, `Math.pow`, `Math.sin`… are implementation-approximated
+ * and can differ in the last bit between V8, SpiderMonkey and JavaScriptCore. A force simulation
+ * amplifies such differences, so everything that feeds it goes through these helpers to keep
+ * layouts byte-identical between the CLI (Node) and the browser.
+ */
+export declare const clamp: (value: number, min: number, max: number) => number;
+/** Round to 0.01 (the layout's output precision); never returns `-0`. */
+export declare function round2(value: number): number;
+/** log₂(x) for x > 0, using only exactly rounded operations. Accurate to ~1e-15. */
+export declare function log2(x: number): number;
+/** bⁿ for integer n ≥ 0 by repeated squaring (exact operation sequence). */
+export declare function powInt(base: number, exponent: number): number;
+/**
+ * The per-tick factor `r` with `r^ticks = ratio` (ratio ∈ (0, 1]), found by bisection over
+ * `powInt` so it is reproducible everywhere. Used for the alpha cooling schedule.
+ */
+export declare function coolingFactor(ratio: number, ticks: number): number;
+/**
+ * Monotonic stand-in for the polar angle of (x, y), in [0, 4). Sorting by it equals sorting by
+ * `atan2` without any transcendental function.
+ */
+export declare function pseudoAngle(x: number, y: number): number;
+/** Shortest distance between two pseudo-angles on the [0, 4) circle. */
+export declare function pseudoAngleDistance(a: number, b: number): number;
+//# sourceMappingURL=math.d.ts.map

package/dist/math.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../src/math.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,eAAO,MAAM,KAAK,UAAW,MAAM,OAAO,MAAM,OAAO,MAAM,KAAG,MAC3B,CAAC;AAEtC,yEAAyE;AACzE,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAG5C;AAED,oFAAoF;AACpF,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAwBtC;AAED,4EAA4E;AAC5E,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAU7D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAUlE;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAKxD;AAED,wEAAwE;AACxE,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAGhE"}

package/dist/math.js

@@ -0,0 +1,91 @@
+/**
+ * Deterministic arithmetic.
+ *
+ * ECMAScript only guarantees exact (correctly rounded) results for + − × ÷ and, in every engine
+ * in practice, `Math.sqrt`. `Math.log2`, `Math.pow`, `Math.sin`… are implementation-approximated
+ * and can differ in the last bit between V8, SpiderMonkey and JavaScriptCore. A force simulation
+ * amplifies such differences, so everything that feeds it goes through these helpers to keep
+ * layouts byte-identical between the CLI (Node) and the browser.
+ */
+export const clamp = (value, min, max) => Math.min(max, Math.max(min, value));
+/** Round to 0.01 (the layout's output precision); never returns `-0`. */
+export function round2(value) {
+    const rounded = Math.round(value * 100) / 100;
+    return rounded === 0 ? 0 : rounded;
+}
+/** log₂(x) for x > 0, using only exactly rounded operations. Accurate to ~1e-15. */
+export function log2(x) {
+    if (!(x > 0))
+        return Number.NEGATIVE_INFINITY;
+    if (x === Number.POSITIVE_INFINITY)
+        return x;
+    // x = m·2^e with m ∈ [1, 2); scaling by 2 is exact.
+    let m = x;
+    let e = 0;
+    while (m >= 2) {
+        m /= 2;
+        e++;
+    }
+    while (m < 1) {
+        m *= 2;
+        e--;
+    }
+    // ln(m) = 2·atanh(s), s = (m − 1)/(m + 1) ∈ [0, 1/3): the series converges by 1/9 per term.
+    const s = (m - 1) / (m + 1);
+    const s2 = s * s;
+    let term = s;
+    let sum = 0;
+    for (let k = 1; k < 40; k += 2) {
+        sum += term / k;
+        term *= s2;
+    }
+    return e + (2 * sum) / Math.LN2;
+}
+/** bⁿ for integer n ≥ 0 by repeated squaring (exact operation sequence). */
+export function powInt(base, exponent) {
+    let result = 1;
+    let b = base;
+    let n = exponent;
+    while (n > 0) {
+        if (n & 1)
+            result *= b;
+        b *= b;
+        n >>>= 1;
+    }
+    return result;
+}
+/**
+ * The per-tick factor `r` with `r^ticks = ratio` (ratio ∈ (0, 1]), found by bisection over
+ * `powInt` so it is reproducible everywhere. Used for the alpha cooling schedule.
+ */
+export function coolingFactor(ratio, ticks) {
+    if (ticks <= 0 || ratio >= 1)
+        return 1;
+    let lo = 0;
+    let hi = 1;
+    for (let i = 0; i < 64; i++) {
+        const mid = (lo + hi) / 2;
+        if (powInt(mid, ticks) < ratio)
+            lo = mid;
+        else
+            hi = mid;
+    }
+    return (lo + hi) / 2;
+}
+/**
+ * Monotonic stand-in for the polar angle of (x, y), in [0, 4). Sorting by it equals sorting by
+ * `atan2` without any transcendental function.
+ */
+export function pseudoAngle(x, y) {
+    const d = Math.abs(x) + Math.abs(y);
+    if (d === 0)
+        return 0;
+    const p = x / d;
+    return y >= 0 ? 1 - p : 3 + p;
+}
+/** Shortest distance between two pseudo-angles on the [0, 4) circle. */
+export function pseudoAngleDistance(a, b) {
+    const d = Math.abs(a - b);
+    return d > 2 ? 4 - d : d;
+}
+//# sourceMappingURL=math.js.map

package/dist/math.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.js","sourceRoot":"","sources":["../src/math.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,GAAW,EAAE,GAAW,EAAU,EAAE,CACvE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AAEtC,yEAAyE;AACzE,MAAM,UAAU,MAAM,CAAC,KAAa;IAClC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;IAC9C,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;AACrC,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,IAAI,CAAC,CAAS;IAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAAE,OAAO,MAAM,CAAC,iBAAiB,CAAC;IAC9C,IAAI,CAAC,KAAK,MAAM,CAAC,iBAAiB;QAAE,OAAO,CAAC,CAAC;IAC7C,oDAAoD;IACpD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACd,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,EAAE,CAAC;IACN,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,EAAE,CAAC;IACN,CAAC;IACD,4FAA4F;IAC5F,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC;QAChB,IAAI,IAAI,EAAE,CAAC;IACb,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;AAClC,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,MAAM,CAAC,IAAY,EAAE,QAAgB;IACnD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,CAAC,GAAG,IAAI,CAAC;IACb,IAAI,CAAC,GAAG,QAAQ,CAAC;IACjB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,CAAC,CAAC;QACvB,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,MAAM,CAAC,CAAC;IACX,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,KAAa;IACxD,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACvC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,KAAK;YAAE,EAAE,GAAG,GAAG,CAAC;;YACpC,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAChC,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,CAAS;IACtD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3B,CAAC"}

package/dist/options.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Option defaults and validation. Every default is documented on `LayoutOptions`.
+ */
+import { type Point, type UnionId } from '@kgdiff/core';
+import type { LayoutOptions, LayoutScope, LayoutStrategy } from './index.js';
+export interface ResolvedLayoutOptions {
+    /** `undefined` = choose from the data (anchored when any position is known). */
+    readonly strategy: LayoutStrategy | undefined;
+    /** `undefined` = choose from the graph size. */
+    readonly scope: LayoutScope | undefined;
+    readonly contextHops: number;
+    readonly hubDegree: number;
+    readonly largeGraphThreshold: number;
+    /** 32-bit PRNG state derived from `seed`. */
+    readonly seed: number;
+    /** `undefined` = choose from the graph size. */
+    readonly iterations: number | undefined;
+    readonly linkDistance: number;
+    readonly labelAware: boolean;
+    readonly fontSize: number;
+    readonly pinned: ReadonlyMap<UnionId, Point>;
+    readonly componentGap: number;
+}
+export declare const DEFAULTS: {
+    readonly contextHops: 1;
+    readonly hubDegree: 40;
+    readonly largeGraphThreshold: 3000;
+    readonly seed: 1;
+    readonly linkDistance: 56;
+    readonly labelAware: true;
+    readonly fontSize: 12;
+    readonly componentGap: 96;
+};
+export declare function resolveLayoutOptions(options?: LayoutOptions): ResolvedLayoutOptions;
+/**
+ * Default tick count of a simulation over `nodeCount` nodes: `clamp(300 − 25·log₂(N), 120, 300)`
+ * (docs/algorithms.md §12) up to 2000 nodes. Beyond, the per-tick cost (Barnes–Hut charge and
+ * collision, ~N log N) would blow the time budget, so the work is held at that of a 2000-node
+ * run: `max(30, 120 · 2000 / N)` ticks. Large components start from a BFS spiral and get their
+ * label room in one step (see simulate.ts), so they need fewer ticks than the formula implies.
+ */
+export declare function defaultIterations(nodeCount: number): number;
+//# sourceMappingURL=options.d.ts.map