@kgdiff/layout 0.0.0-stage → 0.2.0

package/dist/forces/collide-rect.d.ts

@@ -0,0 +1,50 @@
+import type { SimNode } from '../simulate.js';
+export interface CollisionBoxes {
+    /** Half extents of each node's box, by `SimNode.index`. */
+    readonly halfWidth: Float64Array;
+    readonly halfHeight: Float64Array;
+    /** Box center minus node center (labels sit below, so usually positive). */
+    readonly offsetY: Float64Array;
+    /** 0 = immovable (fixed node). */
+    readonly invMass: Float64Array;
+}
+/** Reusable buffers for one node set. */
+export interface CollisionScratch {
+    readonly indices: readonly number[];
+    readonly cx: Float64Array;
+    readonly cy: Float64Array;
+    readonly posX: Float64Array;
+    readonly negX: Float64Array;
+    readonly posY: Float64Array;
+    readonly negY: Float64Array;
+}
+export declare function collisionScratch(n: number): CollisionScratch;
+/**
+ * Collision as a simulation force: overlapping boxes (at predicted positions x + vx) get their
+ * velocities pushed apart by `strength` × the penetration along the separating axis.
+ */
+export declare function collideVelocities(nodes: readonly SimNode[], boxes: CollisionBoxes, padding: number, strength: number, scratch?: CollisionScratch): void;
+export interface OverlapResult {
+    readonly passes: number;
+    /** 1 for nodes that took part in an overlap in the last pass. */
+    readonly unresolved: Uint8Array;
+}
+/**
+ * Separate overlapping boxes by moving positions, pass after pass, until none overlap or
+ * `maxPasses` is reached. Each pass is a Jacobi step: every node moves by its largest push in
+ * each direction (not the sum, which would overshoot when several neighbours push the same way).
+ * Only nodes that moved in the previous pass (or `active` ones, initially) are queried; the
+ * quadtree is rebuilt only when some node has drifted more than a few units since the last build
+ * (the query is widened by that drift), so late passes over a few stubborn pairs are cheap.
+ *
+ * Local pushes clear scattered overlaps in a few passes but diffuse slowly through a jam (a
+ * crowded region that needs more area). When nothing is fixed and the overlap count stalls, the
+ * layout is scaled up about its centroid (by 3–15%, more for heavier jams; every 3 passes by up
+ * to 25% while more pairs than half the nodes overlap): uniform scaling keeps the picture and
+ * frees room everywhere. With fixed nodes, overlaps may remain (a free node wedged between fixed
+ * ones is left to the caller).
+ *
+ * Returns the passes used and the nodes still involved in an overlap (empty when all clear).
+ */
+export declare function removeOverlaps(nodes: readonly SimNode[], boxes: CollisionBoxes, padding: number, maxPasses: number, initiallyActive?: Uint8Array): OverlapResult;
+//# sourceMappingURL=collide-rect.d.ts.map

package/dist/forces/collide-rect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collide-rect.d.ts","sourceRoot":"","sources":["../../src/forces/collide-rect.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAE9C,MAAM,WAAW,cAAc;IAC7B,2DAA2D;IAC3D,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,UAAU,EAAE,YAAY,CAAC;IAClC,4EAA4E;IAC5E,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,kCAAkC;IAClC,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;CAChC;AAkJD,yCAAyC;AACzC,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,EAAE,EAAE,YAAY,CAAC;IAC1B,QAAQ,CAAC,EAAE,EAAE,YAAY,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;CAC7B;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,gBAAgB,CAU5D;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,SAAS,OAAO,EAAE,EACzB,KAAK,EAAE,cAAc,EACrB,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE,gBAAiD,GACzD,IAAI,CA2BN;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,iEAAiE;IACjE,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;CACjC;AASD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,SAAS,OAAO,EAAE,EACzB,KAAK,EAAE,cAAc,EACrB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,eAAe,CAAC,EAAE,UAAU,GAC3B,aAAa,CAkGf"}

package/dist/forces/collide-rect.js

@@ -0,0 +1,310 @@
+/**
+ * Rectangle-vs-rectangle collision over node + label boxes, accelerated with a quadtree.
+ *
+ * Every node owns one axis-aligned box (its circle plus the label block centered below it).
+ * Overlapping pairs are separated along the axis of least penetration (the minimum translation
+ * vector), shared in proportion to inverse mass so hubs and fixed nodes stay put. Wide label
+ * boxes therefore slide sideways past each other while stacked nodes separate vertically.
+ *
+ * Box centers go into a d3 quadtree; every quadtree cell records the largest half extents below
+ * it, so a query for box i only descends into cells whose content could reach it. Traversal uses
+ * an explicit, reused stack (no per-cell allocation, unlike `quadtree.visit`).
+ *
+ * Two entry points share the pair search:
+ *  - `collideVelocities`: a force acting on predicted positions (x + vx) during the simulation;
+ *  - `removeOverlaps`: position-level passes after the simulation until no pair overlaps.
+ */
+import { quadtree } from 'd3-quadtree';
+const isLeaf = (cell) => 'data' in cell;
+/** Post-order: record max half extents on every cell. */
+function prepare(cell, hw, hh) {
+    let mw = 0;
+    let mh = 0;
+    if (isLeaf(cell)) {
+        let leaf = cell;
+        while (leaf !== undefined) {
+            mw = Math.max(mw, hw[leaf.data]);
+            mh = Math.max(mh, hh[leaf.data]);
+            leaf = leaf.next;
+        }
+    }
+    else {
+        for (let k = 0; k < 4; k++) {
+            const child = cell[k];
+            if (child === undefined)
+                continue;
+            prepare(child, hw, hh);
+            mw = Math.max(mw, child.mw ?? 0);
+            mh = Math.max(mh, child.mh ?? 0);
+        }
+    }
+    cell.mw = mw;
+    cell.mh = mh;
+}
+function buildIndex(indices, cx, cy, boxes) {
+    const tree = quadtree()
+        .x((i) => cx[i])
+        .y((i) => cy[i])
+        .addAll(indices);
+    const root = tree.root();
+    const extent = tree.extent();
+    if (root === undefined || extent === undefined)
+        return undefined;
+    prepare(root, boxes.halfWidth, boxes.halfHeight);
+    return { root, x0: extent[0][0], y0: extent[0][1], x1: extent[1][0], y1: extent[1][1] };
+}
+/** Reused traversal stacks (no allocation per query). */
+const cellStack = [];
+const rectStack = [];
+/**
+ * Visit every pair (i, j) whose padded boxes overlap, each pair once. Box centers are the
+ * current `cx`, `cy`; `index` may have been built from older centers, in which case `slack` must
+ * bound how far any center has moved since (it widens the pruning test, so the search stays
+ * exact). With `active`, only pairs with at least one active node are visited.
+ */
+function forEachOverlap(index, n, cx, cy, boxes, padding, slack, visit, active) {
+    const { halfWidth: hw, halfHeight: hh } = boxes;
+    const cells = cellStack;
+    const rect = rectStack;
+    for (let i = 0; i < n; i++) {
+        if (active !== undefined && !active[i])
+            continue;
+        const xi = cx[i];
+        const yi = cy[i];
+        const hwi = hw[i] + padding;
+        const hhi = hh[i] + padding;
+        cells.push(index.root);
+        rect.push(index.x0, index.y0, index.x1, index.y1);
+        while (cells.length > 0) {
+            const cell = cells.pop();
+            const y1 = rect.pop();
+            const x1 = rect.pop();
+            const y0 = rect.pop();
+            const x0 = rect.pop();
+            if (isLeaf(cell)) {
+                let leaf = cell;
+                while (leaf !== undefined) {
+                    const j = leaf.data;
+                    leaf = leaf.next;
+                    // Each pair once: from its lower index, or from its only active member.
+                    if (j === i || (j < i && (active === undefined || active[j])))
+                        continue;
+                    const dx = cx[j] - xi;
+                    const ox = hwi + hw[j] - Math.abs(dx);
+                    if (ox <= 0)
+                        continue;
+                    const dy = cy[j] - yi;
+                    const oy = hhi + hh[j] - Math.abs(dy);
+                    if (oy <= 0)
+                        continue;
+                    visit(i, j, ox, oy, dx, dy);
+                }
+                continue;
+            }
+            const rx = hwi + (cell.mw ?? 0) + slack;
+            const ry = hhi + (cell.mh ?? 0) + slack;
+            if (x0 > xi + rx || x1 < xi - rx || y0 > yi + ry || y1 < yi - ry)
+                continue;
+            const xm = (x0 + x1) / 2;
+            const ym = (y0 + y1) / 2;
+            const c0 = cell[0];
+            const c1 = cell[1];
+            const c2 = cell[2];
+            const c3 = cell[3];
+            if (c0 !== undefined) {
+                cells.push(c0);
+                rect.push(x0, y0, xm, ym);
+            }
+            if (c1 !== undefined) {
+                cells.push(c1);
+                rect.push(xm, y0, x1, ym);
+            }
+            if (c2 !== undefined) {
+                cells.push(c2);
+                rect.push(x0, ym, xm, y1);
+            }
+            if (c3 !== undefined) {
+                cells.push(c3);
+                rect.push(xm, ym, x1, y1);
+            }
+        }
+    }
+}
+export function collisionScratch(n) {
+    return {
+        indices: Array.from({ length: n }, (_, i) => i),
+        cx: new Float64Array(n),
+        cy: new Float64Array(n),
+        posX: new Float64Array(n),
+        negX: new Float64Array(n),
+        posY: new Float64Array(n),
+        negY: new Float64Array(n),
+    };
+}
+/**
+ * Collision as a simulation force: overlapping boxes (at predicted positions x + vx) get their
+ * velocities pushed apart by `strength` × the penetration along the separating axis.
+ */
+export function collideVelocities(nodes, boxes, padding, strength, scratch = collisionScratch(nodes.length)) {
+    const { cx, cy } = scratch;
+    const { invMass, offsetY } = boxes;
+    for (const node of nodes) {
+        cx[node.index] = node.x + node.vx;
+        cy[node.index] = node.y + node.vy + offsetY[node.index];
+    }
+    const index = buildIndex(scratch.indices, cx, cy, boxes);
+    if (index === undefined)
+        return;
+    forEachOverlap(index, nodes.length, cx, cy, boxes, padding, 0, (i, j, ox, oy, dx, dy) => {
+        const total = invMass[i] + invMass[j];
+        if (total === 0)
+            return;
+        const shareI = invMass[i] / total;
+        const shareJ = invMass[j] / total;
+        const a = nodes[i];
+        const b = nodes[j];
+        // Push along the axis of least penetration; coincident centers: i goes left / up.
+        if (ox < oy) {
+            const push = (dx < 0 ? -ox : ox) * strength;
+            a.vx -= push * shareI;
+            b.vx += push * shareJ;
+        }
+        else {
+            const push = (dy < 0 ? -oy : oy) * strength;
+            a.vy -= push * shareI;
+            b.vy += push * shareJ;
+        }
+    });
+}
+/** Jacobi passes between two checks for a stalled jam. */
+const STALL_WINDOW = 8;
+/** Passes between two expansions while the jam is heavy. */
+const HEAVY_WINDOW = 3;
+/** Rebuild the quadtree once some node has drifted this far since the last build. */
+const REBUILD_DRIFT = 8;
+/**
+ * Separate overlapping boxes by moving positions, pass after pass, until none overlap or
+ * `maxPasses` is reached. Each pass is a Jacobi step: every node moves by its largest push in
+ * each direction (not the sum, which would overshoot when several neighbours push the same way).
+ * Only nodes that moved in the previous pass (or `active` ones, initially) are queried; the
+ * quadtree is rebuilt only when some node has drifted more than a few units since the last build
+ * (the query is widened by that drift), so late passes over a few stubborn pairs are cheap.
+ *
+ * Local pushes clear scattered overlaps in a few passes but diffuse slowly through a jam (a
+ * crowded region that needs more area). When nothing is fixed and the overlap count stalls, the
+ * layout is scaled up about its centroid (by 3–15%, more for heavier jams; every 3 passes by up
+ * to 25% while more pairs than half the nodes overlap): uniform scaling keeps the picture and
+ * frees room everywhere. With fixed nodes, overlaps may remain (a free node wedged between fixed
+ * ones is left to the caller).
+ *
+ * Returns the passes used and the nodes still involved in an overlap (empty when all clear).
+ */
+export function removeOverlaps(nodes, boxes, padding, maxPasses, initiallyActive) {
+    const n = nodes.length;
+    const scratch = collisionScratch(n);
+    const { cx, cy, posX, negX, posY, negY } = scratch;
+    const { invMass, offsetY } = boxes;
+    const expandable = invMass.every((m) => m > 0);
+    let active = initiallyActive ?? new Uint8Array(n).fill(1);
+    let moved = new Uint8Array(n);
+    const drift = new Float64Array(n);
+    let slack = 0;
+    let index;
+    let lastCheck = Number.POSITIVE_INFINITY;
+    // A hair more than the overlap, so rounding to 0.01 cannot leave boxes touching.
+    const epsilon = 0.02;
+    for (let pass = 0; pass < maxPasses; pass++) {
+        for (const node of nodes) {
+            cx[node.index] = node.x;
+            cy[node.index] = node.y + offsetY[node.index];
+        }
+        if (index === undefined || slack > REBUILD_DRIFT) {
+            index = buildIndex(scratch.indices, cx, cy, boxes);
+            if (index === undefined)
+                return { passes: pass, unresolved: new Uint8Array(n) };
+            drift.fill(0);
+            slack = 0;
+        }
+        posX.fill(0);
+        negX.fill(0);
+        posY.fill(0);
+        negY.fill(0);
+        let overlaps = 0;
+        forEachOverlap(index, n, cx, cy, boxes, padding, slack, (i, j, ox, oy, dx, dy) => {
+            const total = invMass[i] + invMass[j];
+            if (total === 0)
+                return;
+            overlaps++;
+            const shareI = invMass[i] / total;
+            const shareJ = invMass[j] / total;
+            if (ox < oy) {
+                const push = ox + epsilon;
+                // j right of i (or coincident and i < j): i moves left, j moves right.
+                const jRight = dx > 0 || (dx === 0 && i < j);
+                const left = jRight ? i : j;
+                const right = jRight ? j : i;
+                negX[left] = Math.min(negX[left], -push * (left === i ? shareI : shareJ));
+                posX[right] = Math.max(posX[right], push * (right === i ? shareI : shareJ));
+            }
+            else {
+                const push = oy + epsilon;
+                const jDown = dy > 0 || (dy === 0 && i < j);
+                const up = jDown ? i : j;
+                const down = jDown ? j : i;
+                negY[up] = Math.min(negY[up], -push * (up === i ? shareI : shareJ));
+                posY[down] = Math.max(posY[down], push * (down === i ? shareI : shareJ));
+            }
+        }, active);
+        if (overlaps === 0)
+            return { passes: pass, unresolved: new Uint8Array(n) };
+        moved.fill(0);
+        for (const node of nodes) {
+            const k = node.index;
+            // Pushes from opposite sides may cancel: the node is still involved, so it stays active.
+            if (posX[k] !== 0 || negX[k] !== 0 || posY[k] !== 0 || negY[k] !== 0) {
+                const mx = posX[k] + negX[k];
+                const my = posY[k] + negY[k];
+                node.x += mx;
+                node.y += my;
+                moved[k] = 1;
+                const d = drift[k] + Math.max(Math.abs(mx), Math.abs(my));
+                drift[k] = d;
+                if (d > slack)
+                    slack = d;
+            }
+        }
+        [active, moved] = [moved, active];
+        if (expandable && overlaps > n / 2 && (pass + 1) % HEAVY_WINDOW === 0) {
+            // A heavy jam (more overlapping pairs than half the nodes): do not wait for a stall.
+            expand(nodes, 1 + Math.min(0.25, (0.05 * overlaps) / n));
+            active.fill(1);
+            index = undefined;
+            lastCheck = Number.POSITIVE_INFINITY;
+        }
+        else if ((pass + 1) % STALL_WINDOW === 0) {
+            // A jam: local moves stopped making progress.
+            if (expandable && overlaps > 0.7 * lastCheck) {
+                expand(nodes, 1 + Math.min(0.15, Math.max(0.03, (0.05 * overlaps) / n)));
+                active.fill(1);
+                index = undefined;
+            }
+            lastCheck = overlaps;
+        }
+    }
+    return { passes: maxPasses, unresolved: active };
+}
+function expand(nodes, factor) {
+    let mx = 0;
+    let my = 0;
+    for (const node of nodes) {
+        mx += node.x;
+        my += node.y;
+    }
+    mx /= nodes.length;
+    my /= nodes.length;
+    for (const node of nodes) {
+        node.x = mx + (node.x - mx) * factor;
+        node.y = my + (node.y - my) * factor;
+    }
+}
+//# sourceMappingURL=collide-rect.js.map

package/dist/forces/collide-rect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collide-rect.js","sourceRoot":"","sources":["../../src/forces/collide-rect.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,EAAgD,QAAQ,EAAE,MAAM,aAAa,CAAC;AAqBrF,MAAM,MAAM,GAAG,CAAC,IAAU,EAAgB,EAAE,CAAC,MAAM,IAAI,IAAI,CAAC;AAE5D,yDAAyD;AACzD,SAAS,OAAO,CAAC,IAAU,EAAE,EAAgB,EAAE,EAAgB;IAC7D,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACjB,IAAI,IAAI,GAAqC,IAAI,CAAC;QAClD,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;YAC1B,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,CAAC;YAClC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,CAAC;YAClC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAqB,CAAC;YAC1C,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,OAAO,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACvB,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YACjC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;AACf,CAAC;AAWD,SAAS,UAAU,CACjB,OAA0B,EAC1B,EAAgB,EAChB,EAAgB,EAChB,KAAqB;IAErB,MAAM,IAAI,GAAG,QAAQ,EAAU;SAC5B,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAE,CAAC;SAChB,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAE,CAAC;SAChB,MAAM,CAAC,OAAmB,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAsB,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjE,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IACjD,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC1F,CAAC;AAED,yDAAyD;AACzD,MAAM,SAAS,GAAW,EAAE,CAAC;AAC7B,MAAM,SAAS,GAAa,EAAE,CAAC;AAE/B;;;;;GAKG;AACH,SAAS,cAAc,CACrB,KAAe,EACf,CAAS,EACT,EAAgB,EAChB,EAAgB,EAChB,KAAqB,EACrB,OAAe,EACf,KAAa,EACb,KAAqF,EACrF,MAAmB;IAEnB,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IAChD,MAAM,KAAK,GAAG,SAAS,CAAC;IACxB,MAAM,IAAI,GAAG,SAAS,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAAE,SAAS;QACjD,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;QAClB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;QAClB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC;QAC7B,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAClD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAG,CAAC;YACvB,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjB,IAAI,IAAI,GAAqC,IAAI,CAAC;gBAClD,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;oBACpB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBACjB,wEAAwE;oBACxE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;wBAAE,SAAS;oBACxE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC;oBACvB,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACvC,IAAI,EAAE,IAAI,CAAC;wBAAE,SAAS;oBACtB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC;oBACvB,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACvC,IAAI,EAAE,IAAI,CAAC;wBAAE,SAAS;oBACtB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC9B,CAAC;gBACD,SAAS;YACX,CAAC;YACD,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;YACxC,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;YACxC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;gBAAE,SAAS;YAC3E,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YACzB,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAqB,CAAC;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAqB,CAAC;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAqB,CAAC;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAqB,CAAC;YACvC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5B,CAAC;YACD,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5B,CAAC;YACD,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5B,CAAC;YACD,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAaD,MAAM,UAAU,gBAAgB,CAAC,CAAS;IACxC,OAAO;QACL,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/C,EAAE,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QACvB,EAAE,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QACvB,IAAI,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QACzB,IAAI,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QACzB,IAAI,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;QACzB,IAAI,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC;KAC1B,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAyB,EACzB,KAAqB,EACrB,OAAe,EACf,QAAgB,EAChB,OAAO,GAAqB,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC;IAE1D,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC;IAC3B,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;QAClC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;IAC3D,CAAC;IACD,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;IACzD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO;IAChC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;QACtF,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACxC,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO;QACxB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC;QACnC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC;QACnC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,kFAAkF;QAClF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC5C,CAAC,CAAC,EAAE,IAAI,IAAI,GAAG,MAAM,CAAC;YACtB,CAAC,CAAC,EAAE,IAAI,IAAI,GAAG,MAAM,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC5C,CAAC,CAAC,EAAE,IAAI,IAAI,GAAG,MAAM,CAAC;YACtB,CAAC,CAAC,EAAE,IAAI,IAAI,GAAG,MAAM,CAAC;QACxB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AAQD,0DAA0D;AAC1D,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,4DAA4D;AAC5D,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,qFAAqF;AACrF,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAyB,EACzB,KAAqB,EACrB,OAAe,EACf,SAAiB,EACjB,eAA4B;IAE5B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;IACnD,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACnC,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,IAAI,MAAM,GAAe,eAAe,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtE,IAAI,KAAK,GAAe,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAE1C,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAA2B,CAAC;IAChC,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACzC,iFAAiF;IACjF,MAAM,OAAO,GAAG,IAAI,CAAC;IACrB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACxB,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;QACjD,CAAC;QACD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,aAAa,EAAE,CAAC;YACjD,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAChF,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,cAAc,CACZ,KAAK,EACL,CAAC,EACD,EAAE,EACF,EAAE,EACF,KAAK,EACL,OAAO,EACP,KAAK,EACL,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;YACvB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;YACxC,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO;YACxB,QAAQ,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC;YACnC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC;YACnC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;gBACZ,MAAM,IAAI,GAAG,EAAE,GAAG,OAAO,CAAC;gBAC1B,uEAAuE;gBACvE,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7C,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,EAAE,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAE,EAAE,IAAI,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC/E,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,EAAE,GAAG,OAAO,CAAC;gBAC1B,MAAM,KAAK,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5C,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,EAAE,CAAC,IAAI,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;gBACrE,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,EAAE,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC,EACD,MAAM,CACP,CAAC;QACF,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3E,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;YACrB,yFAAyF;YACzF,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrE,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;gBAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;gBAC/B,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBACb,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBACb,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACb,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC3D,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACb,IAAI,CAAC,GAAG,KAAK;oBAAE,KAAK,GAAG,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAClC,IAAI,UAAU,IAAI,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,KAAK,CAAC,EAAE,CAAC;YACtE,qFAAqF;YACrF,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,GAAG,SAAS,CAAC;YAClB,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACvC,CAAC;aAAM,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,KAAK,CAAC,EAAE,CAAC;YAC3C,8CAA8C;YAC9C,IAAI,UAAU,IAAI,QAAQ,GAAG,GAAG,GAAG,SAAS,EAAE,CAAC;gBAC7C,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACf,KAAK,GAAG,SAAS,CAAC;YACpB,CAAC;YACD,SAAS,GAAG,QAAQ,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AACnD,CAAC;AAED,SAAS,MAAM,CAAC,KAAyB,EAAE,MAAc;IACvD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;QACb,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;IACf,CAAC;IACD,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;IACnB,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;IACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;QACrC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;IACvC,CAAC;AACH,CAAC"}

package/dist/forces/free-spot.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Final placement touches that look for free spots instead of pushing.
+ *
+ * - `dockPartners`: the weak partner springs (docs/algorithms.md §12) bring merge sources towards
+ *   their target, but many-body repulsion and label boxes keep the pair roughly an edge length
+ *   apart. For replay (sources travel into the target, split targets emerge from their source)
+ *   and for reading the overlay (the ghost sits right next to what it became), a mover farther
+ *   than `maxDistance` from its anchor moves to the best free spot around the anchor.
+ * - `settleOverlapping`: around fixed nodes, a free node can end up wedged where pushing cannot
+ *   free it. It moves to the free spot nearest to its neighbours instead.
+ *
+ * Both test candidate spots (16 directions × a few rings) against the boxes near the searched
+ * area, collected once per node; they only run for the few nodes that need them.
+ */
+import type { SimNode } from '../simulate.js';
+import type { CollisionBoxes } from './collide-rect.js';
+import type { Spring } from './springs.js';
+/**
+ * Dock merge sources / split targets (`mover`) farther than `maxDistance` from their partner.
+ * Candidate spots touch the anchor's box in 16 directions, on 5 rings; the winner minimizes the
+ * distance to the anchor plus 0.3 × the distance travelled (so the mover stays on the side its
+ * edges come from). A spot occupied only by movable nodes competes with a penalty of
+ * 0.4 × `maxDistance`; when it wins, the caller pushes those nodes aside (`removeOverlaps` with
+ * docked pairs pinned). Only spots closer to the anchor than the mover's current position count.
+ *
+ * Returns the sim indices of docked movers and their anchors (to pin while making room).
+ */
+export declare function dockPartners(nodes: readonly SimNode[], springs: readonly Spring[], boxes: CollisionBoxes, padding: number, maxDistance: number): number[];
+/**
+ * Move every movable node whose box still overlaps another to the free spot nearest to `home(k)`
+ * (its neighbours' barycenter). Candidates lie on square rings of a lattice around home (spacing
+ * ≈ the node's box height, so gaps between neighbours are found at any radius; exact arithmetic
+ * only); the first ring with a free spot wins, and on it the spot closest to home. Nodes are
+ * processed in index order.
+ */
+export declare function settleOverlapping(nodes: readonly SimNode[], boxes: CollisionBoxes, padding: number, home: (index: number) => {
+    readonly x: number;
+    readonly y: number;
+}): void;
+//# sourceMappingURL=free-spot.d.ts.map

package/dist/forces/free-spot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"free-spot.d.ts","sourceRoot":"","sources":["../../src/forces/free-spot.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAoF3C;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,OAAO,EAAE,EACzB,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,KAAK,EAAE,cAAc,EACrB,OAAO,EAAE,MAAM,EACf,WAAW,EAAE,MAAM,GAClB,MAAM,EAAE,CAgEV;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,SAAS,OAAO,EAAE,EACzB,KAAK,EAAE,cAAc,EACrB,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK;IAAE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GAClE,IAAI,CAgDN"}

package/dist/forces/free-spot.js

@@ -0,0 +1,189 @@
+/** Unit vectors every 22.5°, starting straight down (below the anchor's label), exact literals. */
+const C1 = 0.9238795325112867;
+const S1 = 0.3826834323650898;
+const D = Math.SQRT1_2;
+const DIRECTIONS = [
+    [0, 1],
+    [S1, C1],
+    [D, D],
+    [C1, S1],
+    [1, 0],
+    [C1, -S1],
+    [D, -D],
+    [S1, -C1],
+    [0, -1],
+    [-S1, -C1],
+    [-D, -D],
+    [-C1, -S1],
+    [-1, 0],
+    [-C1, S1],
+    [-D, D],
+    [-S1, C1],
+];
+const DOCK_RINGS = [1, 1.35, 1.7, 2.1, 2.6];
+/** Extra score (× maxDistance) charged to a spot that other nodes must vacate. */
+const OCCUPIED_PENALTY = 0.4;
+/** Square lattice rings searched around a wedged node (ring k at k × step from home). */
+const SETTLE_RINGS = 32;
+const distance = (ax, ay, bx, by) => Math.sqrt((ax - bx) * (ax - bx) + (ay - by) * (ay - by));
+/**
+ * The nodes whose boxes could touch node `m`'s box anywhere within `radius` of (cx, cy): the
+ * candidate search then only tests these (O(n) once per searched node, not per candidate).
+ */
+function nearby(nodes, boxes, padding, m, cx, cy, radius) {
+    const { halfWidth: hw, halfHeight: hh, offsetY: oy } = boxes;
+    const out = [];
+    for (const other of nodes) {
+        const j = other.index;
+        if (j === m)
+            continue;
+        if (Math.abs(other.x - cx) > radius + hw[m] + hw[j] + padding)
+            continue;
+        const dy = other.y + oy[j] - (cy + oy[m]);
+        if (Math.abs(dy) > radius + hh[m] + hh[j] + padding)
+            continue;
+        out.push(other);
+    }
+    return out;
+}
+/**
+ * True when node `m`'s padded box centered at (x, y) overlaps none of `others`' boxes, or (with
+ * `blocking`) none for which `blocking(j)` holds.
+ */
+function isFree(others, boxes, padding, m, x, y, blocking) {
+    const { halfWidth: hw, halfHeight: hh, offsetY: oy } = boxes;
+    const cy = y + oy[m];
+    for (const other of others) {
+        const j = other.index;
+        if (j === m || (blocking !== undefined && !blocking(j)))
+            continue;
+        if (Math.abs(other.x - x) >= hw[m] + hw[j] + padding)
+            continue;
+        if (Math.abs(other.y + oy[j] - cy) >= hh[m] + hh[j] + padding)
+            continue;
+        return false;
+    }
+    return true;
+}
+/**
+ * Dock merge sources / split targets (`mover`) farther than `maxDistance` from their partner.
+ * Candidate spots touch the anchor's box in 16 directions, on 5 rings; the winner minimizes the
+ * distance to the anchor plus 0.3 × the distance travelled (so the mover stays on the side its
+ * edges come from). A spot occupied only by movable nodes competes with a penalty of
+ * 0.4 × `maxDistance`; when it wins, the caller pushes those nodes aside (`removeOverlaps` with
+ * docked pairs pinned). Only spots closer to the anchor than the mover's current position count.
+ *
+ * Returns the sim indices of docked movers and their anchors (to pin while making room).
+ */
+export function dockPartners(nodes, springs, boxes, padding, maxDistance) {
+    const { halfWidth: hw, halfHeight: hh, offsetY: oy, invMass } = boxes;
+    const top = (i) => oy[i] - hh[i];
+    const bottom = (i) => oy[i] + hh[i];
+    const gap = padding + 0.05;
+    const pinned = new Set();
+    const immovable = (j) => invMass[j] === 0 || pinned.has(j);
+    for (const { mover, anchor } of springs) {
+        const m = nodes[mover];
+        const a = nodes[anchor];
+        if (m === undefined || a === undefined || immovable(mover))
+            continue;
+        const current = distance(m.x, m.y, a.x, a.y);
+        if (current <= maxDistance)
+            continue;
+        const reachX = (hw[anchor] + hw[mover] + gap) * DOCK_RINGS[DOCK_RINGS.length - 1];
+        const reachY = (Math.max(bottom(anchor) - top(mover), bottom(mover) - top(anchor)) + gap) *
+            DOCK_RINGS[DOCK_RINGS.length - 1];
+        const others = nearby(nodes, boxes, padding, mover, a.x, a.y, Math.max(reachX, reachY));
+        let free;
+        let occupied;
+        for (const ring of DOCK_RINGS) {
+            for (const [ux, uy] of DIRECTIONS) {
+                const tx = ux === 0 ? Number.POSITIVE_INFINITY : (hw[anchor] + hw[mover] + gap) / Math.abs(ux);
+                const ty = uy === 0
+                    ? Number.POSITIVE_INFINITY
+                    : uy > 0
+                        ? (bottom(anchor) + gap - top(mover)) / uy
+                        : (bottom(mover) + gap - top(anchor)) / -uy;
+                const t = Math.min(tx, ty) * ring;
+                const x = a.x + ux * t;
+                const y = a.y + uy * t;
+                const toAnchor = distance(x, y, a.x, a.y);
+                if (toAnchor >= current)
+                    continue;
+                const score = toAnchor + 0.3 * distance(x, y, m.x, m.y);
+                if (isFree(others, boxes, padding, mover, x, y)) {
+                    if (free === undefined || score < free.score - 1e-9)
+                        free = { x, y, score };
+                }
+                else if ((occupied === undefined || score < occupied.score - 1e-9) &&
+                    isFree(others, boxes, padding, mover, x, y, immovable)) {
+                    occupied = { x, y, score };
+                }
+            }
+        }
+        // An occupied spot must be clearly better to be worth pushing the neighbours aside.
+        const penalty = OCCUPIED_PENALTY * maxDistance;
+        const best = occupied !== undefined && (free === undefined || occupied.score + penalty < free.score)
+            ? occupied
+            : free;
+        if (best !== undefined) {
+            m.x = best.x;
+            m.y = best.y;
+            m.vx = 0;
+            m.vy = 0;
+            pinned.add(mover);
+            pinned.add(anchor);
+        }
+    }
+    return [...pinned].sort((p, q) => p - q);
+}
+/**
+ * Move every movable node whose box still overlaps another to the free spot nearest to `home(k)`
+ * (its neighbours' barycenter). Candidates lie on square rings of a lattice around home (spacing
+ * ≈ the node's box height, so gaps between neighbours are found at any radius; exact arithmetic
+ * only); the first ring with a free spot wins, and on it the spot closest to home. Nodes are
+ * processed in index order.
+ */
+export function settleOverlapping(nodes, boxes, padding, home) {
+    const { halfHeight: hh, invMass } = boxes;
+    for (const node of nodes) {
+        const k = node.index;
+        if (invMass[k] === 0)
+            continue;
+        if (isFree(nearby(nodes, boxes, padding, k, node.x, node.y, 0), boxes, padding, k, node.x, node.y)) {
+            continue;
+        }
+        const center = home(k);
+        const step = Math.max(12, hh[k] + padding);
+        // Nearby nodes for the next 8 rings at a time, so the search stays local.
+        let others = [];
+        for (let ring = 1; ring <= SETTLE_RINGS; ring++) {
+            if ((ring - 1) % 8 === 0) {
+                others = nearby(nodes, boxes, padding, k, center.x, center.y, step * (ring + 7) * Math.SQRT2);
+            }
+            let best;
+            const consider = (x, y) => {
+                const d = distance(x, y, center.x, center.y);
+                if (best !== undefined && d >= best.d - 1e-9)
+                    return;
+                if (isFree(others, boxes, padding, k, x, y))
+                    best = { x, y, d };
+            };
+            const r = ring * step;
+            for (let i = -ring; i <= ring; i++) {
+                consider(center.x + i * step, center.y - r);
+                consider(center.x + i * step, center.y + r);
+            }
+            for (let j = 1 - ring; j < ring; j++) {
+                consider(center.x - r, center.y + j * step);
+                consider(center.x + r, center.y + j * step);
+            }
+            if (best !== undefined) {
+                node.x = best.x;
+                node.y = best.y;
+                break;
+            }
+        }
+    }
+}
+//# sourceMappingURL=free-spot.js.map

package/dist/forces/free-spot.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"free-spot.js","sourceRoot":"","sources":["../../src/forces/free-spot.ts"],"names":[],"mappings":"AAkBA,mGAAmG;AACnG,MAAM,EAAE,GAAG,kBAAkB,CAAC;AAC9B,MAAM,EAAE,GAAG,kBAAkB,CAAC;AAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;AACvB,MAAM,UAAU,GAA2C;IACzD,CAAC,CAAC,EAAE,CAAC,CAAC;IACN,CAAC,EAAE,EAAE,EAAE,CAAC;IACR,CAAC,CAAC,EAAE,CAAC,CAAC;IACN,CAAC,EAAE,EAAE,EAAE,CAAC;IACR,CAAC,CAAC,EAAE,CAAC,CAAC;IACN,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IACT,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACP,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IACT,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IACV,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACR,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IACV,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACP,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;IACT,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACP,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;CACV,CAAC;AACF,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC5C,kFAAkF;AAClF,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAC7B,yFAAyF;AACzF,MAAM,YAAY,GAAG,EAAE,CAAC;AAExB,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAU,EAAE,CAC1E,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;AAE3D;;;GAGG;AACH,SAAS,MAAM,CACb,KAAyB,EACzB,KAAqB,EACrB,OAAe,EACf,CAAS,EACT,EAAU,EACV,EAAU,EACV,MAAc;IAEd,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IAC7D,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,OAAO;YAAE,SAAS;QAC1E,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC;QAC5C,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,OAAO;YAAE,SAAS;QAChE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,SAAS,MAAM,CACb,MAA0B,EAC1B,KAAqB,EACrB,OAAe,EACf,CAAS,EACT,CAAS,EACT,CAAS,EACT,QAAiC;IAEjC,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IAC7D,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;IACtB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,SAAS;QAClE,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,OAAO;YAAE,SAAS;QACjE,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,GAAG,OAAO;YAAE,SAAS;QAC3E,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAyB,EACzB,OAA0B,EAC1B,KAAqB,EACrB,OAAe,EACf,WAAmB;IAEnB,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACtE,MAAM,GAAG,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;IACnD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;IACtD,MAAM,GAAG,GAAG,OAAO,GAAG,IAAI,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE5E,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC;YAAE,SAAS;QACrE,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,OAAO,IAAI,WAAW;YAAE,SAAS;QAErC,MAAM,MAAM,GAAG,CAAC,EAAE,CAAC,MAAM,CAAE,GAAG,EAAE,CAAC,KAAK,CAAE,GAAG,GAAG,CAAC,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACrF,MAAM,MAAM,GACV,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;YAC1E,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACrC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QACxF,IAAI,IAAyD,CAAC;QAC9D,IAAI,QAA6D,CAAC;QAClE,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;gBAClC,MAAM,EAAE,GACN,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAE,GAAG,EAAE,CAAC,KAAK,CAAE,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxF,MAAM,EAAE,GACN,EAAE,KAAK,CAAC;oBACN,CAAC,CAAC,MAAM,CAAC,iBAAiB;oBAC1B,CAAC,CAAC,EAAE,GAAG,CAAC;wBACN,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE;wBAC1C,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAClD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC;gBAClC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACvB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,QAAQ,IAAI,OAAO;oBAAE,SAAS;gBAClC,MAAM,KAAK,GAAG,QAAQ,GAAG,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxD,IAAI,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBAChD,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI;wBAAE,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;gBAC9E,CAAC;qBAAM,IACL,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC;oBACzD,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,EACtD,CAAC;oBACD,QAAQ,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;QACD,oFAAoF;QACpF,MAAM,OAAO,GAAG,gBAAgB,GAAG,WAAW,CAAC;QAC/C,MAAM,IAAI,GACR,QAAQ,KAAK,SAAS,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;YACrF,CAAC,CAAC,QAAQ;YACV,CAAC,CAAC,IAAI,CAAC;QACX,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACb,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACb,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACT,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAyB,EACzB,KAAqB,EACrB,OAAe,EACf,IAAmE;IAEnE,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,SAAS;QAC/B,IACE,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAC9F,CAAC;YACD,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC,CAAC;QAC5C,0EAA0E;QAC1E,IAAI,MAAM,GAAc,EAAE,CAAC;QAC3B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,EAAE,EAAE,CAAC;YAChD,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,GAAG,MAAM,CACb,KAAK,EACL,KAAK,EACL,OAAO,EACP,CAAC,EACD,MAAM,CAAC,CAAC,EACR,MAAM,CAAC,CAAC,EACR,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAC/B,CAAC;YACJ,CAAC;YACD,IAAI,IAAqD,CAAC;YAC1D,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE;gBAC9C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI;oBAAE,OAAO;gBACrD,IAAI,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;oBAAE,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAClE,CAAC,CAAC;YACF,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5C,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC5C,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;YAC9C,CAAC;YACD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAChB,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}