labre-mcp 0.1.0

package/dist/frameworks/wardley/chain/_legacy/write/chain/lib/layout/compute-visibility.mjs

@@ -0,0 +1,298 @@
+// Step 3 of the write:chain:* pipeline — deterministic Y (visibility) for
+// a value-chain DAG with one or more anchors.
+//
+// Hard rule (DSL semantics): every dependency edge `A -> B` produces
+// `Y(A) > Y(B)` strictly. Y is the only visual cue for the dependency
+// direction in OWM, so two connected nodes can NEVER share a horizontal
+// line and their order on Y is fixed by the link orientation.
+//
+// Algorithm — per-branch reasoning rooted at the anchor(s):
+//
+//   1. Build the merged DAG (multi-source: every component with role
+//      'anchor' is a source). Compute, for each non-anchor component,
+//      depth(c) = length of the LONGEST path from any anchor to c. The
+//      longest-path choice means each parent ends up strictly above each
+//      child by construction — no separate enforcement pass is needed.
+//
+//   2. Pick a step that uses the full canvas height [Y_MIN, ANCHOR_VISIBILITY]:
+//        L           = max depth(c) over reachable non-anchor components
+//        L_effective = max(L, MIN_EFFECTIVE_L)        // floor so L=1/L=2 stay
+//                                                    // visually compact near
+//                                                    // the anchor instead of
+//                                                    // stretching across the
+//                                                    // whole canvas.
+//        step        = (ANCHOR_VISIBILITY − Y_MIN) / L_effective
+//
+//   3. Y_nominal(c) = ANCHOR_VISIBILITY − depth(c) × step.
+//
+//   4. Semantic jitter (deterministic, NOT random) to avoid the rigid
+//      "all-same-depth nodes on a perfect horizontal line" look:
+//
+//        chain_through(c) = longestIn(c) + longestOut(c)
+//        ratio(c)         = chain_through(c) / L          // ∈ [0, 1]
+//        band_half        = min(BAND_MAX, (step − EDGE_MIN_GAP) / 2)
+//        offset(c)        = (2 × ratio(c) − 1) × band_half
+//        Y(c)             = clamp(Y_nominal(c) + offset(c), Y_MIN, ANCHOR_VISIBILITY)
+//
+//      Components on the longest chain (ratio=1) are pushed up by
+//      band_half. Components on short chains are pushed down. The cap on
+//      band_half guarantees worst-case parent − worst-case child ≥
+//      EDGE_MIN_GAP, so the strict edge-direction rule still holds.
+//
+//   5. Anchors:
+//        anchor_depth(A) = max(0, min(depth(c) for c ∈ children(A)) − 1)
+//        if anchor_depth(A) = 0 :  Y(A) = ANCHOR_VISIBILITY
+//        else                  :  Y(A) = ANCHOR_VISIBILITY
+//                                          − (anchor_depth(A) + SECONDARY_ANCHOR_OFFSET)
+//                                          × step
+//
+//      A "secondary" anchor (one whose first reachable child sits deep in
+//      another anchor's chain) lands between two integer depth levels
+//      thanks to SECONDARY_ANCHOR_OFFSET, avoiding a Y collision with the
+//      regular components at depth(child)−1.
+//
+//   6. Canvas height — when the longest chain exceeds DENSITY_LIMIT_L,
+//      the vertical step would drop below 0.1 / 3, breaking visual
+//      readability in the renderer's default canvas. We keep the
+//      normalised Y values in [Y_MIN, ANCHOR_VISIBILITY] and instead
+//      scale the OWM canvas height proportionally so the per-step pixel
+//      gap stays roughly constant. Canvas WIDTH is computed by step 4
+//      (adjust-x) based on horizontal density.
+//
+//   7. Orphans (components unreachable from any anchor) receive
+//      Y = ORPHAN_FALLBACK_Y (mid-canvas) and X = INITIAL_EVOLUTION_PLACEHOLDER
+//      (overwritten by step 4 — adjust-x — using the LLM xHint or a
+//      uniform per-Y-level fallback).
+// ─── Constants ──────────────────────────────────────────────────────────
+export const ANCHOR_VISIBILITY = 0.95;
+export const Y_MIN = 0.10;
+/** Floor on the effective chain length used to derive `step`. Ensures that
+ *  short graphs (L=1, L=2) keep components close to the anchor instead of
+ *  spreading them across the full canvas. */
+export const MIN_EFFECTIVE_L = 3;
+/** Half-amplitude cap of the semantic jitter (so peak-to-peak ≤ 0.10). */
+export const BAND_MAX = 0.05;
+/** Minimum visible gap between a parent and its child after jitter. */
+export const EDGE_MIN_GAP = 0.01;
+/** Sub-step push applied to secondary anchors so they don't collide with
+ *  regular components at depth(child) − 1. */
+export const SECONDARY_ANCHOR_OFFSET = 0.3;
+/** Y placeholder for components unreachable from any anchor. */
+export const ORPHAN_FALLBACK_Y = 0.50;
+/** X placeholder seeded by this step for every non-anchor component. The
+ *  value is overwritten by step 4 (adjust-x) using `xHint` or a uniform
+ *  per-Y-level fallback, so it carries no semantic meaning. */
+export const INITIAL_EVOLUTION_PLACEHOLDER = 0.5;
+// ─── Canvas sizing ──────────────────────────────────────────────────────
+export const BASE_CANVAS_HEIGHT = 650;
+/** Strict threshold on L above which the canvas height is scaled. */
+export const DENSITY_LIMIT_L = 24;
+/** Reference chain length used to compute the height scale factor. */
+export const DENSITY_REFERENCE_L = 25;
+function buildAdjacency(names, links) {
+    const children = new Map();
+    const parents = new Map();
+    for (const n of names) {
+        children.set(n, []);
+        parents.set(n, []);
+    }
+    for (const { from, to } of links) {
+        children.get(from)?.push(to);
+        parents.get(to)?.push(from);
+    }
+    return { children, parents };
+}
+/** Kahn-style topological order. The graph is acyclic by upstream contract
+ *  (cycle detection happens in step 2 — generate-chain validation). */
+function topologicalOrder(names, children, parents) {
+    const inDegree = new Map();
+    for (const n of names)
+        inDegree.set(n, parents.get(n)?.length ?? 0);
+    const queue = names.filter(n => (inDegree.get(n) ?? 0) === 0);
+    const order = [];
+    while (queue.length > 0) {
+        const u = queue.shift();
+        order.push(u);
+        for (const v of children.get(u) ?? []) {
+            const d = (inDegree.get(v) ?? 0) - 1;
+            inDegree.set(v, d);
+            if (d === 0)
+                queue.push(v);
+        }
+    }
+    return order;
+}
+/** Multi-source longest path. Sources (anchors) start at 0; everything
+ *  else starts at -∞. Returns -∞ for components unreachable from any
+ *  anchor. */
+function longestFromAnchors(anchorNames, topoOrder, children) {
+    const depth = new Map();
+    for (const n of topoOrder)
+        depth.set(n, Number.NEGATIVE_INFINITY);
+    for (const a of anchorNames)
+        depth.set(a, 0);
+    for (const u of topoOrder) {
+        const du = depth.get(u);
+        if (du === undefined || du === Number.NEGATIVE_INFINITY)
+            continue;
+        for (const v of children.get(u) ?? []) {
+            const candidate = du + 1;
+            if (candidate > (depth.get(v) ?? Number.NEGATIVE_INFINITY)) {
+                depth.set(v, candidate);
+            }
+        }
+    }
+    return depth;
+}
+/** Longest path from each node to any leaf (a leaf has no outgoing edges). */
+function longestToLeaf(topoOrder, children) {
+    const depth = new Map();
+    // Initialize leaves to 0; everything else accumulates from descendants.
+    for (const n of topoOrder) {
+        depth.set(n, (children.get(n) ?? []).length === 0 ? 0 : Number.NEGATIVE_INFINITY);
+    }
+    for (const u of [...topoOrder].reverse()) {
+        for (const v of children.get(u) ?? []) {
+            const dv = depth.get(v);
+            if (dv === undefined || dv === Number.NEGATIVE_INFINITY)
+                continue;
+            const candidate = dv + 1;
+            if (candidate > (depth.get(u) ?? Number.NEGATIVE_INFINITY)) {
+                depth.set(u, candidate);
+            }
+        }
+        // If u still has -Infinity (no descendant reaches a leaf, e.g.
+        // disconnected sub-DAG), treat it as a leaf with depth 0.
+        if (depth.get(u) === Number.NEGATIVE_INFINITY)
+            depth.set(u, 0);
+    }
+    return depth;
+}
+// ─── Canvas height ──────────────────────────────────────────────────────
+/** Compute the OWM canvas height for the given longest-chain length.
+ *  Height is scaled when L > DENSITY_LIMIT_L so the per-step pixel gap
+ *  remains readable. Width is the responsibility of step 4 (adjust-x). */
+export function computeMapHeight(L) {
+    if (L <= DENSITY_LIMIT_L)
+        return BASE_CANVAS_HEIGHT;
+    return Math.ceil((BASE_CANVAS_HEIGHT * L) / DENSITY_REFERENCE_L);
+}
+// ─── Misc helpers ───────────────────────────────────────────────────────
+function clamp(x, lo, hi) {
+    if (x < lo)
+        return lo;
+    if (x > hi)
+        return hi;
+    return x;
+}
+function emptyLabel() {
+    return { dx: 0, dy: 0 };
+}
+/**
+ * Compute the Y coordinate for every component plus the OWM canvas size.
+ *
+ * Returns a `PositionedValueChain` where:
+ *   - `visibility` respects the strict edge-direction rule,
+ *   - `evolution` is seeded with `INITIAL_EVOLUTION_PLACEHOLDER` (overwritten by step 4 — adjust-x),
+ *   - `label` is the placeholder `{ dx: 0, dy: 0 }` (filled by step 5 — place-labels).
+ *
+ * Throws when no anchor (`role === 'anchor'`) is present.
+ */
+export function computeVisibility(raw) {
+    const anchors = raw.components.filter(c => c.role === 'anchor');
+    if (anchors.length === 0) {
+        throw new Error('computeVisibility: no anchor component found (role="anchor")');
+    }
+    const names = raw.components.map(c => c.name);
+    const anchorNames = anchors.map(a => a.name);
+    const { children, parents } = buildAdjacency(names, raw.links);
+    const topoOrder = topologicalOrder(names, children, parents);
+    const dIn = longestFromAnchors(anchorNames, topoOrder, children);
+    const dOut = longestToLeaf(topoOrder, children);
+    // L = longest chain measured on non-anchor reachable components.
+    let L = 0;
+    for (const c of raw.components) {
+        if (c.role === 'anchor')
+            continue;
+        const d = dIn.get(c.name);
+        if (d === undefined || d === Number.NEGATIVE_INFINITY)
+            continue;
+        if (d > L)
+            L = d;
+    }
+    const lEffective = Math.max(L, MIN_EFFECTIVE_L);
+    const step = (ANCHOR_VISIBILITY - Y_MIN) / lEffective;
+    const bandHalf = Math.max(0, Math.min(BAND_MAX, (step - EDGE_MIN_GAP) / 2));
+    // For ratio in jitter — division by L (not lEffective): when L < 3 we
+    // intentionally don't compress further, but ratio is bounded in [0, 1]
+    // regardless because chain_through ≤ L by construction.
+    const ratioDenominator = L > 0 ? L : 1;
+    // ── Place anchors ────────────────────────────────────────────────────
+    const yByName = new Map();
+    for (const a of anchors) {
+        const childNames = children.get(a.name) ?? [];
+        let minChildDepth = Number.POSITIVE_INFINITY;
+        for (const cn of childNames) {
+            const d = dIn.get(cn);
+            if (d === undefined || d === Number.NEGATIVE_INFINITY)
+                continue;
+            if (d < minChildDepth)
+                minChildDepth = d;
+        }
+        if (minChildDepth === Number.POSITIVE_INFINITY) {
+            // No reachable child — anchor sits at the top.
+            yByName.set(a.name, ANCHOR_VISIBILITY);
+            continue;
+        }
+        const anchorDepth = Math.max(0, minChildDepth - 1);
+        if (anchorDepth === 0) {
+            yByName.set(a.name, ANCHOR_VISIBILITY);
+        }
+        else {
+            const y = ANCHOR_VISIBILITY - (anchorDepth + SECONDARY_ANCHOR_OFFSET) * step;
+            yByName.set(a.name, clamp(y, Y_MIN, ANCHOR_VISIBILITY));
+        }
+    }
+    // ── Place non-anchor reachable components ───────────────────────────
+    for (const c of raw.components) {
+        if (c.role === 'anchor')
+            continue;
+        const d = dIn.get(c.name);
+        if (d === undefined || d === Number.NEGATIVE_INFINITY)
+            continue;
+        const yNominal = ANCHOR_VISIBILITY - d * step;
+        const out = dOut.get(c.name) ?? 0;
+        const chainThrough = d + out;
+        const ratio = chainThrough / ratioDenominator;
+        const offset = (2 * ratio - 1) * bandHalf;
+        yByName.set(c.name, clamp(yNominal + offset, Y_MIN, ANCHOR_VISIBILITY));
+    }
+    // ── Assemble PositionedComponents ───────────────────────────────────
+    const positioned = raw.components.map((c) => {
+        const y = yByName.get(c.name);
+        if (y !== undefined) {
+            return {
+                ...c,
+                visibility: y,
+                evolution: INITIAL_EVOLUTION_PLACEHOLDER,
+                label: emptyLabel(),
+            };
+        }
+        // Orphan — unreachable from any anchor.
+        return {
+            ...c,
+            visibility: ORPHAN_FALLBACK_Y,
+            evolution: INITIAL_EVOLUTION_PLACEHOLDER,
+            label: emptyLabel(),
+        };
+    });
+    return {
+        chain: {
+            metadata: raw.metadata,
+            components: positioned,
+            links: raw.links,
+        },
+        mapSize: { height: computeMapHeight(L) },
+    };
+}
+//# sourceMappingURL=compute-visibility.mjs.map

package/dist/frameworks/wardley/chain/_legacy/write/chain/lib/layout/compute-visibility.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"compute-visibility.mjs","sourceRoot":"","sources":["../../../../../../../../../src/frameworks/wardley/chain/_legacy/write/chain/lib/layout/compute-visibility.mts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,8CAA8C;AAC9C,EAAE;AACF,qEAAqE;AACrE,sEAAsE;AACtE,wEAAwE;AACxE,8DAA8D;AAC9D,EAAE;AACF,4DAA4D;AAC5D,EAAE;AACF,qEAAqE;AACrE,sEAAsE;AACtE,uEAAuE;AACvE,yEAAyE;AACzE,uEAAuE;AACvE,EAAE;AACF,gFAAgF;AAChF,yEAAyE;AACzE,+EAA+E;AAC/E,8EAA8E;AAC9E,8EAA8E;AAC9E,8EAA8E;AAC9E,sEAAsE;AACtE,iEAAiE;AACjE,EAAE;AACF,2DAA2D;AAC3D,EAAE;AACF,sEAAsE;AACtE,iEAAiE;AACjE,EAAE;AACF,yDAAyD;AACzD,sEAAsE;AACtE,qEAAqE;AACrE,2DAA2D;AAC3D,sFAAsF;AACtF,EAAE;AACF,kEAAkE;AAClE,yEAAyE;AACzE,mEAAmE;AACnE,oEAAoE;AACpE,EAAE;AACF,gBAAgB;AAChB,yEAAyE;AACzE,4DAA4D;AAC5D,2DAA2D;AAC3D,yFAAyF;AACzF,kDAAkD;AAClD,EAAE;AACF,0EAA0E;AAC1E,sEAAsE;AACtE,0EAA0E;AAC1E,6CAA6C;AAC7C,EAAE;AACF,uEAAuE;AACvE,mEAAmE;AACnE,iEAAiE;AACjE,qEAAqE;AACrE,wEAAwE;AACxE,sEAAsE;AACtE,+CAA+C;AAC/C,EAAE;AACF,gEAAgE;AAChE,gFAAgF;AAChF,oEAAoE;AACpE,sCAAsC;AAWtC,2EAA2E;AAE3E,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AACtC,MAAM,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC;AAC1B;;6CAE6C;AAC7C,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC;AACjC,0EAA0E;AAC1E,MAAM,CAAC,MAAM,QAAQ,GAAG,IAAI,CAAC;AAC7B,uEAAuE;AACvE,MAAM,CAAC,MAAM,YAAY,GAAG,IAAI,CAAC;AACjC;8CAC8C;AAC9C,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAC3C,gEAAgE;AAChE,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AACtC;;+DAE+D;AAC/D,MAAM,CAAC,MAAM,6BAA6B,GAAG,GAAG,CAAC;AAEjD,2EAA2E;AAE3E,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAC;AACtC,qEAAqE;AACrE,MAAM,CAAC,MAAM,eAAe,GAAG,EAAE,CAAC;AAClC,sEAAsE;AACtE,MAAM,CAAC,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAStC,SAAS,cAAc,CACrB,KAAwB,EACxB,KAAgC;IAEhC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACpB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACrB,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,KAAK,EAAE,CAAC;QACjC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;AAC/B,CAAC;AAED;uEACuE;AACvE,SAAS,gBAAgB,CACvB,KAAwB,EACxB,QAA+B,EAC/B,OAA8B;IAE9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;IAEpE,MAAM,KAAK,GAAa,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACxE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACrC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;cAEc;AACd,SAAS,kBAAkB,CACzB,WAA8B,EAC9B,SAA4B,EAC5B,QAA+B;IAE/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAClE,KAAK,MAAM,CAAC,IAAI,WAAW;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE7C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,MAAM,CAAC,iBAAiB;YAAE,SAAS;QAClE,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,MAAM,SAAS,GAAG,EAAE,GAAG,CAAC,CAAC;YACzB,IAAI,SAAS,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC,EAAE,CAAC;gBAC3D,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,SAAS,aAAa,CACpB,SAA4B,EAC5B,QAA+B;IAE/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,wEAAwE;IACxE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IACpF,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,MAAM,CAAC,iBAAiB;gBAAE,SAAS;YAClE,MAAM,SAAS,GAAG,EAAE,GAAG,CAAC,CAAC;YACzB,IAAI,SAAS,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC,EAAE,CAAC;gBAC3D,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,+DAA+D;QAC/D,0DAA0D;QAC1D,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,iBAAiB;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,2EAA2E;AAE3E;;0EAE0E;AAC1E,MAAM,UAAU,gBAAgB,CAAC,CAAS;IACxC,IAAI,CAAC,IAAI,eAAe;QAAE,OAAO,kBAAkB,CAAC;IACpD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,kBAAkB,GAAG,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC;AACnE,CAAC;AAED,2EAA2E;AAE3E,SAAS,KAAK,CAAC,CAAS,EAAE,EAAU,EAAE,EAAU;IAC9C,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IACtB,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IACtB,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,UAAU;IACjB,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;AAC1B,CAAC;AASD;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAkB;IAClD,MAAM,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IAChE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,KAAK,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC9C,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7C,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IAE7D,MAAM,GAAG,GAAG,kBAAkB,CAAC,WAAW,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACjE,MAAM,IAAI,GAAG,aAAa,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAEhD,iEAAiE;IACjE,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS;QAClC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,MAAM,CAAC,iBAAiB;YAAE,SAAS;QAChE,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;IAChD,MAAM,IAAI,GAAG,CAAC,iBAAiB,GAAG,KAAK,CAAC,GAAG,UAAU,CAAC;IACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE5E,sEAAsE;IACtE,uEAAuE;IACvE,wDAAwD;IACxD,MAAM,gBAAgB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvC,wEAAwE;IACxE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAI,aAAa,GAAG,MAAM,CAAC,iBAAiB,CAAC;QAC7C,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,MAAM,CAAC,iBAAiB;gBAAE,SAAS;YAChE,IAAI,CAAC,GAAG,aAAa;gBAAE,aAAa,GAAG,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,aAAa,KAAK,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC/C,+CAA+C;YAC/C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;YACvC,SAAS;QACX,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;QACnD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;QACzC,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,iBAAiB,GAAG,CAAC,WAAW,GAAG,uBAAuB,CAAC,GAAG,IAAI,CAAC;YAC7E,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS;QAClC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,MAAM,CAAC,iBAAiB;YAAE,SAAS;QAEhE,MAAM,QAAQ,GAAG,iBAAiB,GAAG,CAAC,GAAG,IAAI,CAAC;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,YAAY,GAAG,CAAC,GAAG,GAAG,CAAC;QAC7B,MAAM,KAAK,GAAG,YAAY,GAAG,gBAAgB,CAAC;QAC9C,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;QAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,GAAG,MAAM,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,uEAAuE;IACvE,MAAM,UAAU,GAA0B,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAsB,EAAE,EAAE;QACtF,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,OAAO;gBACL,GAAG,CAAC;gBACJ,UAAU,EAAE,CAAC;gBACb,SAAS,EAAE,6BAA6B;gBACxC,KAAK,EAAE,UAAU,EAAE;aACpB,CAAC;QACJ,CAAC;QACD,wCAAwC;QACxC,OAAO;YACL,GAAG,CAAC;YACJ,UAAU,EAAE,iBAAiB;YAC7B,SAAS,EAAE,6BAA6B;YACxC,KAAK,EAAE,UAAU,EAAE;SACpB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,KAAK,EAAE;YACL,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,UAAU,EAAE,UAAU;YACtB,KAAK,EAAE,GAAG,CAAC,KAAK;SACjB;QACD,OAAO,EAAE,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAAE;KACzC,CAAC;AACJ,CAAC"}

package/dist/frameworks/wardley/chain/_legacy/write/chain/lib/layout/force-directed.d.mts

@@ -0,0 +1,104 @@
+import type { PositionedValueChain } from '#types/value-chain.mjs';
+import type { EmitOwmOptions } from '../emit/emit-owm.mjs';
+/** Velocity decay per iteration. Higher = slower convergence but
+ *  more oscillation-resistant. */
+export declare const DAMPING = 0.85;
+/** Spring constant pulling each label back to its seed position. */
+export declare const HOME_ATTRACTION = 0.5;
+/** Repulsion between two label rectangles (point-to-point form). */
+export declare const LABEL_REPULSION = 1000;
+/** Repulsion between a label and a foreign component circle. */
+export declare const COMPONENT_REPULSION = 800;
+/** Repulsion between a label and a foreign anchor text. */
+export declare const ANCHOR_REPULSION = 800;
+/** Repulsion between a label and a third-party edge segment
+ *  (perpendicular distance to the segment). Smaller than label/label
+ *  because edges are 1D and the visual penalty is lower. */
+export declare const EDGE_REPULSION = 400;
+/** Soft horizontal repulsion away from a phase-axis vertical line.
+ *  Lowest priority. */
+export declare const AXIS_REPULSION = 50;
+/** Linear restoring force applied when the label bbox crosses the
+ *  visible map boundary. */
+export declare const BOUNDARY_REPULSION = 5;
+/** Distance floor used in 1/d² formulas to avoid singularities. */
+export declare const EPSILON = 1;
+/** Hard cap on the simulation; converged systems usually finish in
+ *  10–25 iterations. */
+export declare const SIM_LABEL_ITERATIONS = 50;
+/** When the total kinetic energy drops below this, the system is in
+ *  equilibrium and we stop early. */
+export declare const KINETIC_ENERGY_THRESHOLD = 0.001;
+/** Hard cap on velocity magnitude per axis. Prevents the simulation
+ *  from diverging when given pathological starting positions (e.g.
+ *  a label initialised far outside the canvas). Without this cap,
+ *  the boundary repulsion can amplify to chaotic levels. */
+export declare const MAX_VELOCITY = 50;
+/** Iteration cap for the component-nudge fallback. Components should
+ *  barely move so we keep this lower than the label cap. */
+export declare const SIM_COMPONENT_ITERATIONS = 30;
+/** Stronger spring than for labels — components are upstream-decided
+ *  positions, we want them to drift only when no other option works. */
+export declare const COMPONENT_HOME_ATTRACTION = 2;
+/** Maximum number of detect → push rounds during the projection
+ *  post-pass. Bumped from 5 → 10 after a smoke test on a 14-component
+ *  Spotify chain showed 2 residual hard violations remaining when the
+ *  cascade required ≥ 6 passes to settle. */
+export declare const PROJECTION_ITERATIONS = 10;
+export interface SimulateLabelsResult {
+    chain: PositionedValueChain;
+    iterations: number;
+    modified: string[];
+    /** Final kinetic energy at termination — useful for diagnostics. */
+    finalKineticEnergy: number;
+}
+/**
+ * Run the force-directed label simulation on `chain`. Returns a new
+ * chain with updated `LabelOffset` values (rounded to integers) plus
+ * iteration / energy diagnostics. Does NOT mutate the input.
+ */
+export declare function simulateLabels(chain: PositionedValueChain, emitOpts: EmitOwmOptions, options?: {
+    iterations?: number;
+}): SimulateLabelsResult;
+export interface SimulateComponentsResult {
+    chain: PositionedValueChain;
+    iterations: number;
+    /** Names of non-anchor components whose (X, Y) actually moved. */
+    moved: string[];
+    finalKineticEnergy: number;
+}
+/**
+ * Phase 6c — force-directed simulation on non-anchor components.
+ * Same physics model as `simulateLabels` but applied to component
+ * circles, with DSL-invariant clamps after every integration step:
+ *  - anchors immobile (excluded from the particle set)
+ *  - X kept inside [LEFT_BOUND, RIGHT_BOUND] and `xHint ± BAND_HALF`
+ *  - Y kept inside [Y_MIN, ANCHOR_VISIBILITY]
+ *  - For every link `(parent, child)`: Y(parent) > Y(child) + EDGE_GAP_Y
+ *
+ * Labels are NOT re-simulated here — they ride along with their
+ * component (rigid attachment via the unchanged `LabelOffset`). The
+ * caller (`verify-layout`) is expected to re-run `simulateLabels`
+ * afterwards to settle labels around the new component positions.
+ */
+export declare function simulateComponents(chain: PositionedValueChain, emitOpts: EmitOwmOptions, options?: {
+    iterations?: number;
+}): SimulateComponentsResult;
+/**
+ * Phase 6d — deterministic post-pass that pushes labels apart, away
+ * from foreign component circles, and back inside the canvas until
+ * no hard violation remains (`unresolvedHard = 0`) or
+ * `PROJECTION_ITERATIONS` is reached.
+ *
+ * Operates on label offsets only — component circle positions are
+ * frozen at this stage (Phase 6c handled those, if needed).
+ *
+ * Internal state is kept in floating-point to avoid the rounding
+ * pitfall: a sub-pixel push (e.g. 0.4 px) rounds to 0 and the
+ * iteration makes no progress. We integrate continuously and round
+ * only at the final emission. The input chain is not mutated.
+ */
+export declare function projectHardConstraints(chain: PositionedValueChain, emitOpts: EmitOwmOptions, options?: {
+    iterations?: number;
+}): PositionedValueChain;
+//# sourceMappingURL=force-directed.d.mts.map

package/dist/frameworks/wardley/chain/_legacy/write/chain/lib/layout/force-directed.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"force-directed.d.mts","sourceRoot":"","sources":["../../../../../../../../../src/frameworks/wardley/chain/_legacy/write/chain/lib/layout/force-directed.mts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EACV,oBAAoB,EAErB,MAAM,wBAAwB,CAAC;AAChC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAqB3D;kCACkC;AAClC,eAAO,MAAM,OAAO,OAAO,CAAC;AAC5B,oEAAoE;AACpE,eAAO,MAAM,eAAe,MAAM,CAAC;AACnC,oEAAoE;AACpE,eAAO,MAAM,eAAe,OAAO,CAAC;AACpC,gEAAgE;AAChE,eAAO,MAAM,mBAAmB,MAAM,CAAC;AACvC,2DAA2D;AAC3D,eAAO,MAAM,gBAAgB,MAAM,CAAC;AACpC;;4DAE4D;AAC5D,eAAO,MAAM,cAAc,MAAM,CAAC;AAClC;uBACuB;AACvB,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC;4BAC4B;AAC5B,eAAO,MAAM,kBAAkB,IAAI,CAAC;AACpC,mEAAmE;AACnE,eAAO,MAAM,OAAO,IAAM,CAAC;AAC3B;wBACwB;AACxB,eAAO,MAAM,oBAAoB,KAAK,CAAC;AACvC;qCACqC;AACrC,eAAO,MAAM,wBAAwB,QAAO,CAAC;AAC7C;;;4DAG4D;AAC5D,eAAO,MAAM,YAAY,KAAK,CAAC;AAI/B;4DAC4D;AAC5D,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAC3C;wEACwE;AACxE,eAAO,MAAM,yBAAyB,IAAM,CAAC;AAqB7C;;;6CAG6C;AAC7C,eAAO,MAAM,qBAAqB,KAAK,CAAC;AA+CxC,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,oBAAoB,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,oEAAoE;IACpE,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,oBAAoB,EAC3B,QAAQ,EAAE,cAAc,EACxB,OAAO,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAE,GAChC,oBAAoB,CA+KtB;AAmBD,MAAM,WAAW,wBAAwB;IACvC,KAAK,EAAE,oBAAoB,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,kEAAkE;IAClE,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAmED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,oBAAoB,EAC3B,QAAQ,EAAE,cAAc,EACxB,OAAO,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAE,GAChC,wBAAwB,CAqM1B;AAoCD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,oBAAoB,EAC3B,QAAQ,EAAE,cAAc,EACxB,OAAO,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAE,GAChC,oBAAoB,CAiGtB"}