@unpunnyfuns/conduit 0.1.0

package/dist/layout/layout.js

@@ -0,0 +1,94 @@
+import { canvasFor, union } from "./bounds.js";
+import { relieveCongestion } from "./congestion.js";
+import { BADGE_HEIGHT, BADGE_RISE, DEFAULT_CARD_HEIGHTS, DIAGRAM_MARGIN, } from "./design.js";
+import { curveBounds, pathOf, shiftCurve, transposeCurve } from "./edges.js";
+import { ConduitLayoutError } from "./errors.js";
+import { frameFor } from "./frame.js";
+import { roundCoord, transposeBox } from "./geometry.js";
+import { placeLabelPills } from "./labels.js";
+import { findView, resolveScope } from "./scope.js";
+const WHOLE_DOCUMENT = { kind: "all" };
+const requireView = (views, id) => {
+    const view = findView(views, id);
+    if (view === undefined)
+        throw new ConduitLayoutError("UNKNOWN_VIEW", `this document has no view '${id}'`);
+    return view;
+};
+const shiftBox = (box, canvas) => ({
+    x: roundCoord(box.x + canvas.shiftX),
+    y: roundCoord(box.y + canvas.shiftY),
+    width: roundCoord(box.width),
+    height: roundCoord(box.height),
+});
+const badgeStrip = (placed) => placed.node.badges.length === 0
+    ? undefined
+    : {
+        x: placed.box.x,
+        y: placed.box.y - BADGE_RISE,
+        width: placed.box.width,
+        height: BADGE_HEIGHT,
+    };
+/**
+ * A document in, every box out. Nothing here reads a clock, a font or a
+ * random number: the same document and options produce the same geometry,
+ * so a diagram never rearranges itself between two renders that barely
+ * changed anything.
+ */
+export const layout = (doc, options = {}) => {
+    const heights = { ...DEFAULT_CARD_HEIGHTS, ...options.cardHeights };
+    const view = options.view === undefined ? undefined : requireView(doc.views, options.view);
+    const graph = resolveScope(doc, view?.scope ?? WHOLE_DOCUMENT);
+    if (graph.nodes.length === 0)
+        throw new ConduitLayoutError("NOTHING_TO_RENDER", "no nodes are in scope for this view");
+    const frame = frameFor(doc.direction, graph, heights);
+    const { layout: placed, routed } = relieveCongestion(graph, frame);
+    const swapped = frame.direction === "down";
+    const pills = placeLabelPills(routed, swapped);
+    const orient = (box) => (swapped ? transposeBox(box) : box);
+    const orientCurve = (curve) => (swapped ? transposeCurve(curve) : curve);
+    const lanesOnScreen = placed.lanes.map((lane) => ({ ...lane, box: orient(lane.box) }));
+    const nodesOnScreen = placed.nodes.map((node) => ({ ...node, box: orient(node.box) }));
+    const curves = new Map(routed.map(({ edge, curve }) => [edge.id, orientCurve(curve)]));
+    const pillBoxes = new Map([...pills].map(([id, box]) => [id, orient(box)]));
+    const extent = swapped ? { width: placed.height, height: placed.width } : placed;
+    const drawn = [
+        ...lanesOnScreen.map(({ box }) => box),
+        ...nodesOnScreen.flatMap((node) => {
+            const strip = badgeStrip(node);
+            return strip === undefined ? [node.box] : [node.box, strip];
+        }),
+        ...pillBoxes.values(),
+        ...[...curves.values()].map(curveBounds),
+    ];
+    const canvas = canvasFor(extent, union(drawn), DIAGRAM_MARGIN);
+    const lanes = lanesOnScreen.map((lane) => ({ ...lane, box: shiftBox(lane.box, canvas) }));
+    const nodes = nodesOnScreen.map((node) => ({ ...node, box: shiftBox(node.box, canvas) }));
+    const edgeBoxes = {};
+    const edges = routed.map(({ edge }) => {
+        const curve = curves.get(edge.id) ?? { from: { x: 0, y: 0 }, segments: [] };
+        edgeBoxes[edge.id] = shiftBox(curveBounds(curve), canvas);
+        const pill = pillBoxes.get(edge.id);
+        return {
+            edge,
+            path: pathOf(shiftCurve(curve, canvas.shiftX, canvas.shiftY)),
+            tone: edge.status,
+            ...(pill === undefined || edge.label === undefined
+                ? {}
+                : { label: { text: edge.label, box: shiftBox(pill, canvas) } }),
+        };
+    });
+    return {
+        width: canvas.width,
+        height: canvas.height,
+        direction: doc.direction,
+        lanes,
+        nodes,
+        edges,
+        atlas: {
+            lanes: Object.fromEntries(lanes.map(({ lane, box }) => [lane.id, box])),
+            nodes: Object.fromEntries(nodes.map(({ node, box }) => [node.id, box])),
+            edges: edgeBoxes,
+        },
+    };
+};
+//# sourceMappingURL=layout.js.map

package/dist/layout/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../src/layout/layout.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,KAAK,EAAe,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,EACL,YAAY,EACZ,UAAU,EACV,oBAAoB,EACpB,cAAc,GAEf,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,cAAc,EAAc,MAAM,YAAY,CAAC;AACzF,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAY,MAAM,eAAe,CAAC;AACnE,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAgCpD,MAAM,cAAc,GAAc,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAElD,MAAM,WAAW,GAAG,CAAC,KAAsB,EAAE,EAAU,EAAQ,EAAE;IAC/D,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACjC,IAAI,IAAI,KAAK,SAAS;QACpB,MAAM,IAAI,kBAAkB,CAAC,cAAc,EAAE,8BAA8B,EAAE,GAAG,CAAC,CAAC;IACpF,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,CAAC,GAAQ,EAAE,MAAc,EAAO,EAAE,CAAC,CAAC;IACnD,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACpC,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACpC,KAAK,EAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC;IAC5B,MAAM,EAAE,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC;CAC/B,CAAC,CAAC;AAEH,MAAM,UAAU,GAAG,CAAC,MAAkB,EAAmB,EAAE,CACzD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;IAC7B,CAAC,CAAC,SAAS;IACX,CAAC,CAAC;QACE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACf,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU;QAC5B,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK;QACvB,MAAM,EAAE,YAAY;KACrB,CAAC;AAER;;;;;GAKG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,GAAoB,EAAE,OAAO,GAAkB,EAAE,EAAU,EAAE;IAClF,MAAM,OAAO,GAAgB,EAAE,GAAG,oBAAoB,EAAE,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACjF,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3F,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,IAAI,cAAc,CAAC,CAAC;IAC/D,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM,IAAI,kBAAkB,CAAC,mBAAmB,EAAE,qCAAqC,CAAC,CAAC;IAE3F,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACtD,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAEnE,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,KAAK,MAAM,CAAC;IAC3C,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAE/C,MAAM,MAAM,GAAG,CAAC,GAAQ,EAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACtE,MAAM,WAAW,GAAG,CAAC,KAAY,EAAS,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvF,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvF,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IAEjF,MAAM,KAAK,GAAU;QACnB,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC;QACtC,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAChC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YAC/B,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC9D,CAAC,CAAC;QACF,GAAG,SAAS,CAAC,MAAM,EAAE;QACrB,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC;KACzC,CAAC;IACF,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC,CAAC;IAE/D,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1F,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1F,MAAM,SAAS,GAAwB,EAAE,CAAC;IAC1C,MAAM,KAAK,GAAiB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QAC5E,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpC,OAAO;YACL,IAAI;YACJ,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YAC7D,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;gBAChD,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;SAClE,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK,EAAE;YACL,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YACvE,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YACvE,KAAK,EAAE,SAAS;SACjB;KACF,CAAC;AACJ,CAAC,CAAC"}

package/dist/layout/rank.d.ts

@@ -0,0 +1,14 @@
+import type { Edge, ConduitNode } from "../schema/document.js";
+/**
+ * Layer index per node: how far down the diagram it sits.
+ *
+ * Longest path from a source, so an arrow always points at a node below the
+ * one it left. Real dependency graphs contain cycles, and a cycle has no
+ * such ordering, so the edges that close one are dropped first — the arrow
+ * still gets drawn, it just runs back up the page.
+ *
+ * `hints` are explicit rows, applied as a floor rather than an answer: a hint
+ * can push a node further down, never above something that feeds it.
+ */
+export declare const rankNodes: (nodes: readonly ConduitNode[], edges: readonly Edge[], hints: Readonly<Record<string, number>>) => Map<string, number>;
+//# sourceMappingURL=rank.d.ts.map

package/dist/layout/rank.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank.d.ts","sourceRoot":"","sources":["../../src/layout/rank.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAE/D;;;;;;;;;;GAUG;AACH,eAAO,MAAM,SAAS,UACb,SAAS,WAAW,EAAE,SACtB,SAAS,IAAI,EAAE,SACf,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KACtC,GAAG,CAAC,MAAM,EAAE,MAAM,CA6BpB,CAAC"}

package/dist/layout/rank.js

@@ -0,0 +1,78 @@
+/**
+ * Layer index per node: how far down the diagram it sits.
+ *
+ * Longest path from a source, so an arrow always points at a node below the
+ * one it left. Real dependency graphs contain cycles, and a cycle has no
+ * such ordering, so the edges that close one are dropped first — the arrow
+ * still gets drawn, it just runs back up the page.
+ *
+ * `hints` are explicit rows, applied as a floor rather than an answer: a hint
+ * can push a node further down, never above something that feeds it.
+ */
+export const rankNodes = (nodes, edges, hints) => {
+    const forward = new Map();
+    const backward = new Map();
+    for (const node of nodes) {
+        forward.set(node.id, []);
+        backward.set(node.id, []);
+    }
+    const withinGraph = edges.filter((edge) => edge.from !== edge.to && forward.has(edge.from) && forward.has(edge.to));
+    for (const edge of withinGraph)
+        forward.get(edge.from)?.push(edge.to);
+    for (const [from, to] of forwardEdgesWithoutCycles(nodes, forward))
+        backward.get(to)?.push(from);
+    const ranks = new Map();
+    const settle = (id) => {
+        const known = ranks.get(id);
+        if (known !== undefined)
+            return known;
+        let rank = hints[id] ?? 0;
+        for (const predecessor of backward.get(id) ?? [])
+            rank = Math.max(rank, settle(predecessor) + 1);
+        ranks.set(id, rank);
+        return rank;
+    };
+    for (const node of nodes)
+        settle(node.id);
+    return ranks;
+};
+/**
+ * Depth-first from every node in document order, dropping any edge that
+ * reaches a node still open on the stack. Which edge closes a cycle depends
+ * on where the walk started, so the walk order is fixed by the document
+ * rather than by iteration order of a map.
+ */
+const forwardEdgesWithoutCycles = (nodes, forward) => {
+    const kept = [];
+    const open = new Set();
+    const closed = new Set();
+    for (const root of nodes) {
+        if (closed.has(root.id))
+            continue;
+        const stack = [{ id: root.id, next: 0 }];
+        open.add(root.id);
+        while (stack.length > 0) {
+            const frame = stack[stack.length - 1];
+            if (frame === undefined)
+                break;
+            const successors = forward.get(frame.id) ?? [];
+            if (frame.next >= successors.length) {
+                open.delete(frame.id);
+                closed.add(frame.id);
+                stack.pop();
+                continue;
+            }
+            const successor = successors[frame.next];
+            frame.next += 1;
+            if (successor === undefined || open.has(successor))
+                continue;
+            kept.push([frame.id, successor]);
+            if (closed.has(successor))
+                continue;
+            open.add(successor);
+            stack.push({ id: successor, next: 0 });
+        }
+    }
+    return kept;
+};
+//# sourceMappingURL=rank.js.map

package/dist/layout/rank.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rank.js","sourceRoot":"","sources":["../../src/layout/rank.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAA6B,EAC7B,KAAsB,EACtB,KAAuC,EAClB,EAAE;IACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAClF,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,WAAW;QAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEtE,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,yBAAyB,CAAC,KAAK,EAAE,OAAO,CAAC;QAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAEjG,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,MAAM,GAAG,CAAC,EAAU,EAAU,EAAE;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAEtC,IAAI,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC1B,KAAK,MAAM,WAAW,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YAC9C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,yBAAyB,GAAG,CAChC,KAA6B,EAC7B,OAA+C,EAC3B,EAAE;IACtB,MAAM,IAAI,GAAuB,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IAEjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAElC,MAAM,KAAK,GAAmC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QACzE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAElB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,KAAK,KAAK,SAAS;gBAAE,MAAM;YAE/B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC/C,IAAI,KAAK,CAAC,IAAI,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;gBACpC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACrB,KAAK,CAAC,GAAG,EAAE,CAAC;gBACZ,SAAS;YACX,CAAC;YAED,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;YAChB,IAAI,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,SAAS;YAE7D,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;YACjC,IAAI,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,SAAS;YAEpC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC,CAAC"}

package/dist/layout/scope.d.ts

@@ -0,0 +1,20 @@
+import type { Edge, Lane, ConduitDocument, ConduitNode, View, ViewScope } from "../schema/document.js";
+/** The slice of a document one SVG draws. */
+export type ScopedGraph = {
+    lanes: Lane[];
+    nodes: ConduitNode[];
+    edges: Edge[];
+};
+export declare const findView: (views: readonly View[], id: string) => View | undefined;
+export declare const flattenViews: (views: readonly View[]) => View[];
+/**
+ * Turns a view's scope into the elements to draw.
+ *
+ * A selection pulls in what its members need to make sense: the lanes its
+ * nodes sit in, and both ends of every edge it names, since half an arrow is
+ * worse than none. Edges are the one place the author keeps full control —
+ * name any and exactly those are drawn, name none and the connections between
+ * the selected nodes come along.
+ */
+export declare const resolveScope: (doc: ConduitDocument, scope: ViewScope) => ScopedGraph;
+//# sourceMappingURL=scope.d.ts.map

package/dist/layout/scope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.d.ts","sourceRoot":"","sources":["../../src/layout/scope.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,IAAI,EACJ,IAAI,EACJ,eAAe,EACf,WAAW,EACX,IAAI,EACJ,SAAS,EACV,MAAM,uBAAuB,CAAC;AAG/B,6CAA6C;AAC7C,MAAM,MAAM,WAAW,GAAG;IACxB,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,KAAK,EAAE,IAAI,EAAE,CAAC;CACf,CAAC;AAEF,eAAO,MAAM,QAAQ,UAAW,SAAS,IAAI,EAAE,MAAM,MAAM,KAAG,IAAI,GAAG,SAOpE,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,SAAS,IAAI,EAAE,KAAG,IAAI,EACO,CAAC;AAElE;;;;;;;;GAQG;AACH,eAAO,MAAM,YAAY,QAAS,eAAe,SAAS,SAAS,KAAG,WA8BrE,CAAC"}

package/dist/layout/scope.js

@@ -0,0 +1,52 @@
+import { assertNever } from "../assert.js";
+export const findView = (views, id) => {
+    for (const view of views) {
+        if (view.id === id)
+            return view;
+        const nested = findView(view.children, id);
+        if (nested)
+            return nested;
+    }
+    return undefined;
+};
+export const flattenViews = (views) => views.flatMap((view) => [view, ...flattenViews(view.children)]);
+/**
+ * Turns a view's scope into the elements to draw.
+ *
+ * A selection pulls in what its members need to make sense: the lanes its
+ * nodes sit in, and both ends of every edge it names, since half an arrow is
+ * worse than none. Edges are the one place the author keeps full control —
+ * name any and exactly those are drawn, name none and the connections between
+ * the selected nodes come along.
+ */
+export const resolveScope = (doc, scope) => {
+    switch (scope.kind) {
+        case "all":
+            return { lanes: [...doc.lanes], nodes: [...doc.nodes], edges: [...doc.edges] };
+        case "selection": {
+            const selectedLanes = new Set(scope.lanes);
+            const selectedEdges = new Set(scope.edges);
+            const nodeIds = new Set(scope.nodes);
+            for (const node of doc.nodes)
+                if (selectedLanes.has(node.lane))
+                    nodeIds.add(node.id);
+            for (const edge of doc.edges) {
+                if (!selectedEdges.has(edge.id))
+                    continue;
+                nodeIds.add(edge.from);
+                nodeIds.add(edge.to);
+            }
+            const nodes = doc.nodes.filter((node) => nodeIds.has(node.id));
+            const edges = scope.edges.length > 0
+                ? doc.edges.filter((edge) => selectedEdges.has(edge.id))
+                : doc.edges.filter((edge) => nodeIds.has(edge.from) && nodeIds.has(edge.to));
+            const laneIds = new Set(scope.lanes);
+            for (const node of nodes)
+                laneIds.add(node.lane);
+            return { lanes: doc.lanes.filter((lane) => laneIds.has(lane.id)), nodes, edges };
+        }
+        default:
+            return assertNever(scope, "Unhandled view scope");
+    }
+};
+//# sourceMappingURL=scope.js.map

package/dist/layout/scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../../src/layout/scope.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAS3C,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAsB,EAAE,EAAU,EAAoB,EAAE;IAC/E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC3C,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;IAC5B,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAsB,EAAU,EAAE,CAC7D,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AAElE;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,GAAoB,EAAE,KAAgB,EAAe,EAAE;IAClF,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,KAAK;YACR,OAAO,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACjF,KAAK,WAAW,EAAE,CAAC;YACjB,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAE3C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,KAAK,CAAC,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK;gBAAE,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrF,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;gBAC7B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC1C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvB,CAAC;YAED,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/D,MAAM,KAAK,GACT,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;gBACpB,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxD,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAEjF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,KAAK,CAAC,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,KAAK;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEjD,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACnF,CAAC;QACD;YACE,OAAO,WAAW,CAAC,KAAK,EAAE,sBAAsB,CAAC,CAAC;IACtD,CAAC;AACH,CAAC,CAAC"}

package/dist/layout/seating.d.ts

@@ -0,0 +1,27 @@
+import type { Edge, Lane, ConduitNode } from "../schema/document.js";
+/** One occupied row of one lane: a single card, or two side by side. */
+export type SeatedRow = {
+    grid: number;
+    nodes: ConduitNode[];
+};
+export type Seating = {
+    rowsByLane: Map<string, SeatedRow[]>;
+    rowCount: number;
+};
+/**
+ * Where every card sits: a row grid shared across all lanes.
+ *
+ * A node with an explicit `row` claims that grid row outright. Everything
+ * else is ranked by its connections — longest path from a source — so an
+ * arrow always points at a node below the one it left, and then falls to
+ * the next row its lane has not already claimed. Seating reads connections,
+ * explicit rows and document order, never a label, so a rename moves nothing.
+ *
+ * When no row is explicit, the ranks in use are compressed onto contiguous
+ * rows, so a lane that enters the story late does not leave a hole above it.
+ * Once any row is explicit the grid is absolute — an automatic node sits at
+ * its rank — because a compressed row could land above the pinned card that
+ * feeds it, and an arrow running back up the page is worse than a gap.
+ */
+export declare const seatNodes: (orderedLanes: readonly Lane[], nodes: readonly ConduitNode[], edges: readonly Edge[]) => Seating;
+//# sourceMappingURL=seating.d.ts.map

package/dist/layout/seating.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"seating.d.ts","sourceRoot":"","sources":["../../src/layout/seating.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAIrE,wEAAwE;AACxE,MAAM,MAAM,SAAS,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,WAAW,EAAE,CAAA;CAAE,CAAC;AAE/D,MAAM,MAAM,OAAO,GAAG;IACpB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IACrC,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,SAAS,iBACN,SAAS,IAAI,EAAE,SACtB,SAAS,WAAW,EAAE,SACtB,SAAS,IAAI,EAAE,KACrB,OAoCF,CAAC"}

package/dist/layout/seating.js

@@ -0,0 +1,135 @@
+import { ConduitLayoutError } from "./errors.js";
+import { rankNodes } from "./rank.js";
+/**
+ * Where every card sits: a row grid shared across all lanes.
+ *
+ * A node with an explicit `row` claims that grid row outright. Everything
+ * else is ranked by its connections — longest path from a source — so an
+ * arrow always points at a node below the one it left, and then falls to
+ * the next row its lane has not already claimed. Seating reads connections,
+ * explicit rows and document order, never a label, so a rename moves nothing.
+ *
+ * When no row is explicit, the ranks in use are compressed onto contiguous
+ * rows, so a lane that enters the story late does not leave a hole above it.
+ * Once any row is explicit the grid is absolute — an automatic node sits at
+ * its rank — because a compressed row could land above the pinned card that
+ * feeds it, and an arrow running back up the page is worse than a gap.
+ */
+export const seatNodes = (orderedLanes, nodes, edges) => {
+    const laneIndex = new Map(orderedLanes.map((lane, index) => [lane.id, index]));
+    const docIndex = new Map(nodes.map((node, index) => [node.id, index]));
+    const pinnedRows = {};
+    for (const node of nodes)
+        if (node.row !== undefined)
+            pinnedRows[node.id] = node.row;
+    const anyPinned = Object.keys(pinnedRows).length > 0;
+    const ranks = rankNodes(nodes, edges, pinnedRows);
+    const rowOfRank = anyPinned ? identityRows(ranks) : compressRanks(nodes, ranks);
+    const keys = barycenters(nodes, edges, ranks, laneIndex);
+    const rowsByLane = new Map();
+    let lastRow = -1;
+    for (const lane of orderedLanes) {
+        const members = nodes.filter((node) => node.lane === lane.id);
+        if (members.length === 0)
+            continue;
+        const pinned = pinRows(members.filter((node) => node.row !== undefined));
+        const claimed = new Set(pinned.map((row) => row.grid));
+        const automatic = seatLane(members.filter((node) => node.row === undefined), ranks, rowOfRank, keys, docIndex, claimed);
+        const rows = [...pinned, ...automatic].sort((a, b) => a.grid - b.grid);
+        rowsByLane.set(lane.id, rows);
+        lastRow = Math.max(lastRow, rows[rows.length - 1]?.grid ?? -1);
+    }
+    return { rowsByLane, rowCount: lastRow + 1 };
+};
+/** Rank values in use, in order, mapped onto contiguous rows. */
+const compressRanks = (nodes, ranks) => {
+    const used = [...new Set(nodes.map((node) => ranks.get(node.id) ?? 0))].sort((a, b) => a - b);
+    return new Map(used.map((rank, index) => [rank, index]));
+};
+const identityRows = (ranks) => new Map([...new Set(ranks.values())].map((rank) => [rank, rank]));
+/** Explicit rows, grouped: a row holds at most two cards, in array order. */
+const pinRows = (pinned) => {
+    const byRow = new Map();
+    for (const node of pinned) {
+        const grid = node.row ?? 0;
+        const list = byRow.get(grid) ?? [];
+        list.push(node);
+        byRow.set(grid, list);
+    }
+    return [...byRow.entries()]
+        .sort(([a], [b]) => a - b)
+        .map(([grid, members]) => {
+        if (members.length > 2)
+            throw new ConduitLayoutError("ROW_OVERFULL", `lane '${members[0]?.lane}' row ${grid} holds ${members.length} nodes; a row holds at most two`);
+        return { grid, nodes: members };
+    });
+};
+const barycenters = (nodes, edges, ranks, laneIndex) => {
+    const laneOf = new Map(nodes.map((node) => [node.id, laneIndex.get(node.lane) ?? 0]));
+    const partners = new Map(nodes.map((node) => [node.id, []]));
+    for (const edge of edges) {
+        if (edge.from === edge.to || !laneOf.has(edge.from) || !laneOf.has(edge.to))
+            continue;
+        partners.get(edge.from)?.push(edge.to);
+        partners.get(edge.to)?.push(edge.from);
+    }
+    const fall = new Map();
+    const side = new Map();
+    for (const node of nodes) {
+        const linked = partners.get(node.id) ?? [];
+        fall.set(node.id, mean(linked.map((id) => ranks.get(id) ?? 0)) ?? ranks.get(node.id) ?? 0);
+        side.set(node.id, mean(linked.map((id) => laneOf.get(id) ?? 0)) ?? laneOf.get(node.id) ?? 0);
+    }
+    return { fall, side };
+};
+const mean = (values) => values.length === 0 ? undefined : values.reduce((sum, value) => sum + value, 0) / values.length;
+/**
+ * One lane's automatic members onto the shared grid.
+ *
+ * A card sits at its rank's row unless an earlier card of the same lane
+ * already claimed it — by rank or by an explicit row — in which case it falls
+ * to the next free one. Two cards share a row only at the same rank in the
+ * same sub-group. Who falls, and who sits left in a pair, is decided by where
+ * each card's partners are, with document order as the stable tiebreak.
+ */
+const seatLane = (members, ranks, rowOfRank, keys, docIndex, claimed) => {
+    const doc = (node) => docIndex.get(node.id) ?? 0;
+    const sorted = [...members].sort((a, b) => {
+        const row = (rowOfRank.get(ranks.get(a.id) ?? 0) ?? 0) - (rowOfRank.get(ranks.get(b.id) ?? 0) ?? 0);
+        if (row !== 0)
+            return row;
+        const fall = (keys.fall.get(a.id) ?? 0) - (keys.fall.get(b.id) ?? 0);
+        if (fall !== 0)
+            return fall;
+        return doc(a) - doc(b);
+    });
+    const rows = [];
+    let previous = -1;
+    for (const node of sorted) {
+        const rank = ranks.get(node.id) ?? 0;
+        const open = rows[rows.length - 1];
+        if (open !== undefined &&
+            open.nodes.length === 1 &&
+            open.rank === rank &&
+            (open.nodes[0]?.group ?? "") === (node.group ?? "")) {
+            const first = open.nodes[0];
+            if (first !== undefined && leansLeft(node, first, keys, doc))
+                open.nodes.unshift(node);
+            else
+                open.nodes.push(node);
+            continue;
+        }
+        previous = Math.max(previous + 1, rowOfRank.get(rank) ?? 0);
+        while (claimed.has(previous))
+            previous += 1;
+        rows.push({ grid: previous, rank, nodes: [node] });
+    }
+    return rows.map(({ grid, nodes }) => ({ grid, nodes }));
+};
+const leansLeft = (node, other, keys, doc) => {
+    const side = (keys.side.get(node.id) ?? 0) - (keys.side.get(other.id) ?? 0);
+    if (side !== 0)
+        return side < 0;
+    return doc(node) < doc(other);
+};
+//# sourceMappingURL=seating.js.map

package/dist/layout/seating.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"seating.js","sourceRoot":"","sources":["../../src/layout/seating.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAUtC;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,YAA6B,EAC7B,KAA6B,EAC7B,KAAsB,EACb,EAAE;IACX,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAEvE,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS;YAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;IACrF,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAErD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAChF,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;IAEzD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;IAEjB,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEnC,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC;QACzE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,QAAQ,CACxB,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,SAAS,CAAC,EAChD,KAAK,EACL,SAAS,EACT,IAAI,EACJ,QAAQ,EACR,OAAO,CACR,CAAC;QAEF,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACvE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,GAAG,CAAC,EAAE,CAAC;AAC/C,CAAC,CAAC;AAEF,iEAAiE;AACjE,MAAM,aAAa,GAAG,CACpB,KAA6B,EAC7B,KAAkC,EACb,EAAE;IACvB,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9F,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CAAC,KAAkC,EAAuB,EAAE,CAC/E,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AAEpE,6EAA6E;AAC7E,MAAM,OAAO,GAAG,CAAC,MAA8B,EAAe,EAAE;IAC9D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;SACxB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SACzB,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,EAAE;QACvB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YACpB,MAAM,IAAI,kBAAkB,CAC1B,cAAc,EACd,SAAS,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,SAAS,IAAI,UAAU,OAAO,CAAC,MAAM,iCAAiC,CAChG,CAAC;QACJ,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;IAClC,CAAC,CAAC,CAAC;AACP,CAAC,CAAC;AASF,MAAM,WAAW,GAAG,CAClB,KAA6B,EAC7B,KAAsB,EACtB,KAAkC,EAClC,SAAsC,EACzB,EAAE;IACf,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAmB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QACtF,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3F,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/F,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC,CAAC;AAEF,MAAM,IAAI,GAAG,CAAC,MAAyB,EAAsB,EAAE,CAC7D,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;AAElG;;;;;;;;GAQG;AACH,MAAM,QAAQ,GAAG,CACf,OAA+B,EAC/B,KAAkC,EAClC,SAAsC,EACtC,IAAiB,EACjB,QAAqC,EACrC,OAA4B,EACf,EAAE;IACf,MAAM,GAAG,GAAG,CAAC,IAAiB,EAAU,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IACtE,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxC,MAAM,GAAG,GACP,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1F,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAC1B,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACrE,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5B,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,MAAM,IAAI,GAA2D,EAAE,CAAC;IACxE,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAElB,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEnC,IACE,IAAI,KAAK,SAAS;YAClB,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YACvB,IAAI,CAAC,IAAI,KAAK,IAAI;YAClB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,EACnD,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,KAAK,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC;gBAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;;gBAClF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,SAAS;QACX,CAAC;QAED,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5D,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,QAAQ,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrD,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAC1D,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAChB,IAAiB,EACjB,KAAkB,EAClB,IAAiB,EACjB,GAAkC,EACzB,EAAE;IACX,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5E,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,CAAC,CAAC;IAChC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;AAChC,CAAC,CAAC"}

package/dist/layout/text.d.ts

@@ -0,0 +1,12 @@
+/**
+ * The renderer never asks a font engine how wide a string is: it must produce
+ * the same geometry on a CI runner with no fonts installed as on a laptop
+ * with all of them. Widths come from a table instead, and every box is sized
+ * with enough slack that the small error against a real face stays invisible.
+ */
+export type Face = "sans" | "sans-bold" | "mono";
+export declare const SANS_STACK = "-apple-system, BlinkMacSystemFont, \"Segoe UI\", \"Noto Sans\", Helvetica, Arial, sans-serif";
+export declare const MONO_STACK = "ui-monospace, SFMono-Regular, \"SF Mono\", Menlo, Consolas, monospace";
+/** Width of `text` in user units at `fontSize`, to a hundredth of a unit. */
+export declare const measure: (text: string, face: Face, fontSize: number) => number;
+//# sourceMappingURL=text.d.ts.map

package/dist/layout/text.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"text.d.ts","sourceRoot":"","sources":["../../src/layout/text.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,MAAM,MAAM,IAAI,GAAG,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC;AAEjD,eAAO,MAAM,UAAU,iGACqE,CAAC;AAC7F,eAAO,MAAM,UAAU,0EAAwE,CAAC;AAsJhG,6EAA6E;AAC7E,eAAO,MAAM,OAAO,SAAU,MAAM,QAAQ,IAAI,YAAY,MAAM,KAAG,MAIpE,CAAC"}

package/dist/layout/text.js

@@ -0,0 +1,148 @@
+import { assertNever } from "../assert.js";
+export const SANS_STACK = '-apple-system, BlinkMacSystemFont, "Segoe UI", "Noto Sans", Helvetica, Arial, sans-serif';
+export const MONO_STACK = 'ui-monospace, SFMono-Regular, "SF Mono", Menlo, Consolas, monospace';
+/** Advance widths per 1000 units of em, for the regular sans face. */
+const SANS_ADVANCE = {
+    " ": 278,
+    "!": 278,
+    '"': 355,
+    "#": 556,
+    $: 556,
+    "%": 889,
+    "&": 667,
+    "'": 191,
+    "(": 333,
+    ")": 333,
+    "*": 389,
+    "+": 584,
+    ",": 278,
+    "-": 333,
+    ".": 278,
+    "/": 278,
+    "0": 556,
+    "1": 556,
+    "2": 556,
+    "3": 556,
+    "4": 556,
+    "5": 556,
+    "6": 556,
+    "7": 556,
+    "8": 556,
+    "9": 556,
+    ":": 278,
+    ";": 278,
+    "<": 584,
+    "=": 584,
+    ">": 584,
+    "?": 556,
+    "@": 1015,
+    A: 667,
+    B: 667,
+    C: 722,
+    D: 722,
+    E: 667,
+    F: 611,
+    G: 778,
+    H: 722,
+    I: 278,
+    J: 500,
+    K: 667,
+    L: 556,
+    M: 833,
+    N: 722,
+    O: 778,
+    P: 667,
+    Q: 778,
+    R: 722,
+    S: 667,
+    T: 611,
+    U: 722,
+    V: 667,
+    W: 944,
+    X: 667,
+    Y: 667,
+    Z: 611,
+    "[": 278,
+    "\\": 278,
+    "]": 278,
+    "^": 469,
+    _: 556,
+    "`": 333,
+    a: 556,
+    b: 556,
+    c: 500,
+    d: 556,
+    e: 556,
+    f: 278,
+    g: 556,
+    h: 556,
+    i: 222,
+    j: 222,
+    k: 500,
+    l: 222,
+    m: 833,
+    n: 556,
+    o: 556,
+    p: 556,
+    q: 556,
+    r: 333,
+    s: 500,
+    t: 278,
+    u: 556,
+    v: 500,
+    w: 722,
+    x: 500,
+    y: 500,
+    z: 500,
+    "{": 334,
+    "|": 260,
+    "}": 334,
+    "~": 584,
+};
+/** What a narrow character outside the table is assumed to cost, in the same units. */
+const FALLBACK_ADVANCE = 600;
+/**
+ * East Asian Wide and Fullwidth glyphs occupy a full em. Measuring them at
+ * the narrow fallback puts every CJK label about 38% short of its real width,
+ * which is enough for an edge label's plate to stop covering its own text.
+ */
+const isWide = (character) => {
+    const point = character.codePointAt(0) ?? 0;
+    return ((point >= 0x1100 && point <= 0x115f) ||
+        (point >= 0x2e80 && point <= 0xa4cf) ||
+        (point >= 0xac00 && point <= 0xd7a3) ||
+        (point >= 0xf900 && point <= 0xfaff) ||
+        (point >= 0xfe30 && point <= 0xfe6f) ||
+        (point >= 0xff00 && point <= 0xff60) ||
+        (point >= 0xffe0 && point <= 0xffe6) ||
+        (point >= 0x20000 && point <= 0x3fffd));
+};
+const FULL_WIDTH_ADVANCE = 1000;
+const fallbackAdvance = (character) => isWide(character) ? FULL_WIDTH_ADVANCE : FALLBACK_ADVANCE;
+/**
+ * The bold face of the same family runs a little wider at every weight step.
+ * One factor over the regular table is close enough for boxes that already
+ * carry padding, and it keeps a second table from drifting out of sync.
+ */
+const BOLD_WIDENING = 1.06;
+const MONO_ADVANCE = 600;
+const advanceFor = (face, character) => {
+    switch (face) {
+        case "sans":
+            return SANS_ADVANCE[character] ?? fallbackAdvance(character);
+        case "sans-bold":
+            return (SANS_ADVANCE[character] ?? fallbackAdvance(character)) * BOLD_WIDENING;
+        case "mono":
+            return MONO_ADVANCE;
+        default:
+            return assertNever(face, "Unhandled font face");
+    }
+};
+/** Width of `text` in user units at `fontSize`, to a hundredth of a unit. */
+export const measure = (text, face, fontSize) => {
+    let thousandths = 0;
+    for (const character of text)
+        thousandths += advanceFor(face, character);
+    return Math.round((thousandths / 1000) * fontSize * 100) / 100;
+};
+//# sourceMappingURL=text.js.map