trace-viz 0.3.0

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,YAAY,EAAE,WAAW,EAAE,iBAAiB,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAGrF,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACrE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACvH,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAC7D,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC1F,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACxG,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC9H,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACtF,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACpF,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAClG,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC9D,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAChG,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACjD,YAAY,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAE7C,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACnF,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACzD,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACjF,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AACxD,YAAY,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACtE,YAAY,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAE9C,OAAO,EACL,eAAe,EACf,YAAY,EACZ,aAAa,EACb,cAAc,EACd,SAAS,EACT,OAAO,EACP,SAAS,EACT,KAAK,EACL,SAAS,EACT,aAAa,EACb,WAAW,GACZ,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAEnD,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AACzE,YAAY,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AACxF,YAAY,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAE7C,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACvF,YAAY,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAEvD,YAAY,EACV,KAAK,EACL,SAAS,EACT,SAAS,EACT,SAAS,EACT,WAAW,EACX,QAAQ,EACR,QAAQ,EACR,aAAa,EACb,YAAY,EACZ,YAAY,GACb,MAAM,YAAY,CAAC;AAGpB,cAAc,kBAAkB,CAAC"}

package/dist/index.js

@@ -0,0 +1,34 @@
+/**
+ * tracelight - visualize service topologies as animated particle flows.
+ *
+ * @example
+ * ```ts
+ * import { TraceLight, authChallengeScenario } from 'tracelight';
+ *
+ * const tl = new TraceLight(document.querySelector('#map')!, { theme: 'auto' });
+ * tl.setGraph(authChallengeScenario(5000));
+ * ```
+ */
+export { TraceLight } from './renderer.js';
+// --- the dimensional framework --------------------------------------------
+export { describeTable, endpointDims, fieldValue } from './model.js';
+export { project, nodeIdFor, isMeasure } from './project.js';
+export { sceneFromGraph } from './scene.js';
+export { CHANNELS, styleScene, couplingFor, CATEGORICAL, ERROR_FLOOR, ERROR_CEIL } from './channels.js';
+export { COMPONENTS, pickComponent, defaultTier, TIER_LABELS } from './components.js';
+export { layoutWorld, fitCamera, project3, worldExtent, defaultWorldLayout } from './layout3d.js';
+export { propagateFailure, emptyFailure } from './failure.js';
+export { proposeSpec, validateSpec, heuristicSpec, buildPrompt, extractJson } from './agent.js';
+export { generateMesh } from './mesh.js';
+export { generateEstate } from './estate.js';
+export { resolveGraph, safeResolveGraph, GraphValidationError } from './schema.js';
+export { layoutGraph, defaultLayout } from './layout.js';
+export { EdgeStream, mulberry32 } from './particles.js';
+export { edgePath, borderPoint, distanceToPath } from './geometry.js';
+export { defaultEncoding, emissionRate, particleSpeed, particleRadius, edgeWidth, logNorm, rpsDomain, clamp, formatRps, formatLatency, formatBytes, } from './scales.js';
+export { themes, lightTheme, darkTheme, resolveTheme } from './theme.js';
+export { generateSeedGraph, authChallengeScenario, tokenAuthScenario } from './seed.js';
+export { fromObject, fromUrl, fromEventSource, pollSource } from './adapters/index.js';
+// Atlas: the map-style navigator for large estates.
+export * from './atlas/index.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAG3C,6EAA6E;AAC7E,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAErE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAE7D,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAExG,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAEtF,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAElG,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE9D,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEhG,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAI7C,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACnF,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAEzD,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAExD,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAGtE,OAAO,EACL,eAAe,EACf,YAAY,EACZ,aAAa,EACb,cAAc,EACd,SAAS,EACT,OAAO,EACP,SAAS,EACT,KAAK,EACL,SAAS,EACT,aAAa,EACb,WAAW,GACZ,MAAM,aAAa,CAAC;AAGrB,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAGzE,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAGxF,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAgBvF,oDAAoD;AACpD,cAAc,kBAAkB,CAAC"}

package/dist/layout.d.ts

@@ -0,0 +1,66 @@
+/** The minimum a graph must expose to be laid out. Both a flat graph and a projected scene satisfy it. */
+export interface LayoutInput {
+    nodes: {
+        id: string;
+        layer?: number;
+        x?: number;
+        y?: number;
+    }[];
+    edges: {
+        from: string;
+        to: string;
+        kind?: string;
+        id?: string;
+    }[];
+}
+export interface Point {
+    x: number;
+    y: number;
+}
+export interface LayoutNode extends Point {
+    id: string;
+    layer: number;
+    width: number;
+    height: number;
+}
+export interface LayoutOptions {
+    width: number;
+    height: number;
+    padding: number;
+    nodeWidth: number;
+    nodeHeight: number;
+    /** Extra separation between layers, on top of what fitting requires. */
+    layerGap: number;
+    rowGap: number;
+    /**
+     * 0..1 pull per edge, from the distance channel. Ordering within a column
+     * weights neighbours by it, so a service ends up beside the thing it sends
+     * most of its traffic to, not merely beside something it calls.
+     */
+    weightOf?: (edgeId: string) => number;
+    /**
+     * Override the crossing-minimising row order inside each column with an
+     * explicit key - by name, or by traffic - when a stable, scannable order
+     * matters more than fewer crossings.
+     */
+    rowKey?: (nodeId: string) => string | number;
+}
+export declare const defaultLayout: LayoutOptions;
+/**
+ * Layered left-to-right layout ("Sugiyama-lite").
+ *
+ * Deliberately simple and fully deterministic: same graph in, same picture
+ * out, every reload. A force layout would look organic and make it impossible
+ * to compare two screenshots, which is exactly what this tool is for.
+ *
+ * 1. Assign layers by longest path from a source, ignoring back-edges so that
+ *    a response or retry edge does not push its target rightwards.
+ * 2. Order within each layer by the barycentre of already-placed neighbours,
+ *    a couple of sweeps. Good enough to remove most crossings.
+ * 3. Distribute evenly in the available box.
+ *
+ * Nodes with explicit `x`/`y` are honoured verbatim; nodes with an explicit
+ * `layer` skip step 1.
+ */
+export declare function layoutGraph(graph: LayoutInput, options?: Partial<LayoutOptions>): Map<string, LayoutNode>;
+//# sourceMappingURL=layout.d.ts.map

package/dist/layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../src/layout.ts"],"names":[],"mappings":"AAAA,0GAA0G;AAC1G,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAChE,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,EAAE,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CACnE;AAED,MAAM,WAAW,KAAK;IACpB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,UAAW,SAAQ,KAAK;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,wEAAwE;IACxE,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;IACtC;;;;OAIG;IACH,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,GAAG,MAAM,CAAC;CAC9C;AAED,eAAO,MAAM,aAAa,EAAE,aAQ3B,CAAC;AAEF;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,WAAW,EAClB,OAAO,GAAE,OAAO,CAAC,aAAa,CAAM,GACnC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAiJzB"}

package/dist/layout.js

@@ -0,0 +1,152 @@
+export const defaultLayout = {
+    width: 960,
+    height: 540,
+    padding: 48,
+    nodeWidth: 132,
+    nodeHeight: 46,
+    layerGap: 64,
+    rowGap: 26,
+};
+/**
+ * Layered left-to-right layout ("Sugiyama-lite").
+ *
+ * Deliberately simple and fully deterministic: same graph in, same picture
+ * out, every reload. A force layout would look organic and make it impossible
+ * to compare two screenshots, which is exactly what this tool is for.
+ *
+ * 1. Assign layers by longest path from a source, ignoring back-edges so that
+ *    a response or retry edge does not push its target rightwards.
+ * 2. Order within each layer by the barycentre of already-placed neighbours,
+ *    a couple of sweeps. Good enough to remove most crossings.
+ * 3. Distribute evenly in the available box.
+ *
+ * Nodes with explicit `x`/`y` are honoured verbatim; nodes with an explicit
+ * `layer` skip step 1.
+ */
+export function layoutGraph(graph, options = {}) {
+    const opt = { ...defaultLayout, ...options };
+    const ids = graph.nodes.map((n) => n.id);
+    const index = new Map(ids.map((id, i) => [id, i]));
+    const forward = new Map(ids.map((id) => [id, []]));
+    const reverse = new Map(ids.map((id) => [id, []]));
+    const structural = graph.edges.filter((e) => e.from !== e.to && e.kind !== 'response' && e.kind !== 'challenge');
+    const edgeSource = structural.length ? structural : graph.edges.filter((e) => e.from !== e.to);
+    for (const e of edgeSource) {
+        const w = 0.15 + (opt.weightOf && e.id ? opt.weightOf(e.id) : 0.5);
+        forward.get(e.from).push({ id: e.to, w });
+        reverse.get(e.to).push({ id: e.from, w });
+    }
+    // --- 1. layers -----------------------------------------------------------
+    const layer = new Map();
+    for (const n of graph.nodes)
+        if (typeof n.layer === 'number')
+            layer.set(n.id, n.layer);
+    const state = new Map(); // 0 unvisited, 1 in-stack, 2 done
+    const depth = (id) => {
+        const pinned = layer.get(id);
+        if (pinned !== undefined && state.get(id) === 2)
+            return pinned;
+        if (state.get(id) === 1)
+            return pinned ?? 0; // cycle: stop descending
+        state.set(id, 1);
+        let d = pinned ?? 0;
+        if (pinned === undefined) {
+            for (const p of reverse.get(id) ?? [])
+                d = Math.max(d, depth(p.id) + 1);
+        }
+        layer.set(id, d);
+        state.set(id, 2);
+        return d;
+    };
+    for (const id of ids)
+        depth(id);
+    const maxLayer = Math.max(0, ...layer.values());
+    const byLayer = Array.from({ length: maxLayer + 1 }, () => []);
+    for (const id of ids)
+        byLayer[layer.get(id)].push(id);
+    // --- 2. ordering ---------------------------------------------------------
+    const order = new Map();
+    for (const column of byLayer)
+        column.forEach((id, i) => order.set(id, i));
+    const barycentre = (id, neighbours) => {
+        const ns = neighbours.get(id) ?? [];
+        if (!ns.length)
+            return order.get(id) ?? 0;
+        let sum = 0;
+        let weight = 0;
+        for (const n of ns) {
+            sum += (order.get(n.id) ?? 0) * n.w;
+            weight += n.w;
+        }
+        return sum / weight;
+    };
+    for (let sweep = 0; sweep < 4; sweep++) {
+        const neighbours = sweep % 2 === 0 ? reverse : forward;
+        const columns = sweep % 2 === 0 ? byLayer : [...byLayer].reverse();
+        for (const column of columns) {
+            const keyed = column.map((id) => ({
+                id,
+                key: barycentre(id, neighbours),
+                tie: index.get(id) ?? 0,
+            }));
+            keyed.sort((a, b) => a.key - b.key || a.tie - b.tie);
+            keyed.forEach((k, i) => order.set(k.id, i));
+            column.sort((a, b) => order.get(a) - order.get(b));
+        }
+    }
+    // An explicit row key replaces the crossing-minimised order outright.
+    if (opt.rowKey) {
+        for (const column of byLayer) {
+            column.sort((a, b) => {
+                const ka = opt.rowKey(a);
+                const kb = opt.rowKey(b);
+                return typeof ka === 'number' && typeof kb === 'number' ? kb - ka : String(ka).localeCompare(String(kb));
+            });
+        }
+    }
+    // --- 3. coordinates ------------------------------------------------------
+    const columns = byLayer.length;
+    const availW = Math.max(opt.width - opt.padding * 2, 120);
+    // Shrink the boxes when there are more layers than the canvas comfortably
+    // fits, rather than letting adjacent columns touch and read as one blob.
+    const MIN_COL_GAP = 36;
+    const nodeWidth = Math.max(64, Math.min(opt.nodeWidth, (availW - (columns - 1) * MIN_COL_GAP) / Math.max(columns, 1)));
+    // Inset by half a node so boxes at the extremes are not clipped by the edge
+    // of the canvas.
+    // The same for rows: a column of eleven services must not stack its boxes
+    // on top of each other. Shrink the box before overlapping it.
+    const MIN_ROW_GAP = 8;
+    const deepest = Math.max(1, ...byLayer.map((c) => c.length));
+    const availH = Math.max(opt.height - opt.padding * 2, 80);
+    const nodeHeight = Math.max(22, Math.min(opt.nodeHeight, (availH - (deepest - 1) * MIN_ROW_GAP) / deepest));
+    const usableW = Math.max(availW - nodeWidth, 1);
+    const usableH = Math.max(availH - nodeHeight, 1);
+    const originX = opt.padding + nodeWidth / 2;
+    const originY = opt.padding + nodeHeight / 2;
+    const colStep = columns > 1 ? usableW / (columns - 1) : 0;
+    const positions = new Map();
+    for (const [li, column] of byLayer.entries()) {
+        const rows = column.length;
+        // Fill the height when a column is deep, but do not fling two nodes to
+        // opposite corners just because there is room.
+        const step = rows > 1
+            ? Math.min(usableH / (rows - 1), Math.max(nodeHeight + opt.rowGap, usableH * 0.55))
+            : 0;
+        const blockH = step * (rows - 1);
+        const top = originY + (usableH - blockH) / 2;
+        for (const [ri, id] of column.entries()) {
+            const node = graph.nodes[index.get(id)];
+            positions.set(id, {
+                id,
+                layer: li,
+                x: node.x ?? (columns > 1 ? originX + li * colStep : opt.width / 2),
+                y: node.y ?? (rows > 1 ? top + ri * step : opt.height / 2),
+                width: nodeWidth,
+                height: nodeHeight,
+            });
+        }
+    }
+    void opt.layerGap;
+    return positions;
+}
+//# sourceMappingURL=layout.js.map

package/dist/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../src/layout.ts"],"names":[],"mappings":"AAyCA,MAAM,CAAC,MAAM,aAAa,GAAkB;IAC1C,KAAK,EAAE,GAAG;IACV,MAAM,EAAE,GAAG;IACX,OAAO,EAAE,EAAE;IACX,SAAS,EAAE,GAAG;IACd,UAAU,EAAE,EAAE;IACd,QAAQ,EAAE,EAAE;IACZ,MAAM,EAAE,EAAE;CACX,CAAC;AAEF;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,WAAW,CACzB,KAAkB,EAClB,UAAkC,EAAE;IAEpC,MAAM,GAAG,GAAG,EAAE,GAAG,aAAa,EAAE,GAAG,OAAO,EAAE,CAAC;IAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAKnD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW,CAC1E,CAAC;IACF,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/F,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACnE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,4EAA4E;IAC5E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC,CAAC,kCAAkC;IAC9E,MAAM,KAAK,GAAG,CAAC,EAAU,EAAU,EAAE;QACnC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAC/D,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,OAAO,MAAM,IAAI,CAAC,CAAC,CAAC,yBAAyB;QACtE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;QACpB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;gBAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1E,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,KAAK,MAAM,EAAE,IAAI,GAAG;QAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IAEhC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAChD,MAAM,OAAO,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC3E,KAAK,MAAM,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAExD,4EAA4E;IAC5E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,OAAO;QAAE,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAE1E,MAAM,UAAU,GAAG,CAAC,EAAU,EAAE,UAA+B,EAAU,EAAE;QACzE,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,EAAE,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,OAAO,GAAG,GAAG,MAAM,CAAC;IACtB,CAAC,CAAC;IAEF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACvC,MAAM,UAAU,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QACvD,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QACnE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBAChC,EAAE;gBACF,GAAG,EAAE,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC;gBAC/B,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;aACxB,CAAC,CAAC,CAAC;YACJ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACrD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACf,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACnB,MAAM,EAAE,GAAG,GAAG,CAAC,MAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,EAAE,GAAG,GAAG,CAAC,MAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,OAAO,OAAO,EAAE,KAAK,QAAQ,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3G,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,OAAO,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IAE1D,0EAA0E;IAC1E,yEAAyE;IACzE,MAAM,WAAW,GAAG,EAAE,CAAC;IACvB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CACxB,EAAE,EACF,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,MAAM,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CACvF,CAAC;IAEF,4EAA4E;IAC5E,iBAAiB;IACjB,0EAA0E;IAC1E,8DAA8D;IAC9D,MAAM,WAAW,GAAG,CAAC,CAAC;IACtB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,OAAO,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CACzB,EAAE,EACF,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,MAAM,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,OAAO,CAAC,CAC3E,CAAC;IAEF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,GAAG,UAAU,GAAG,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAsB,CAAC;IAChD,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;QAC3B,uEAAuE;QACvE,+CAA+C;QAC/C,MAAM,IAAI,GACR,IAAI,GAAG,CAAC;YACN,CAAC,CAAC,IAAI,CAAC,GAAG,CACN,OAAO,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,EACpB,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,OAAO,GAAG,IAAI,CAAC,CAClD;YACH,CAAC,CAAC,CAAC,CAAC;QACR,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC7C,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAE,CAAC;YAC1C,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE;gBAChB,EAAE;gBACF,KAAK,EAAE,EAAE;gBACT,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;gBACnE,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC1D,KAAK,EAAE,SAAS;gBAChB,MAAM,EAAE,UAAU;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,KAAK,GAAG,CAAC,QAAQ,CAAC;IAClB,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/layout3d.d.ts

@@ -0,0 +1,98 @@
+import type { Scene, SceneNode } from './scene.js';
+/**
+ * World layout: a real three-dimensional arrangement, not a stack of flat rows.
+ *
+ * Tiers are planes on the vertical axis - services on one, datastores below -
+ * and each plane is a two-dimensional field the nodes are free to move around
+ * in. That second in-plane axis is what makes clustering legible: services that
+ * call each other constantly end up genuinely adjacent, and you can rotate the
+ * camera to see round a cluster instead of squinting at crossing lines.
+ *
+ * The projection is **orthographic**, deliberately. Perspective would make far
+ * things smaller, and size already means something here - it is the instance
+ * count. Two encodings cannot share one channel.
+ */
+export interface WorldNode {
+    id: string;
+    /** World coordinates. y is up; tier 0 sits highest. */
+    x: number;
+    y: number;
+    z: number;
+    tier: number;
+    w: number;
+    h: number;
+}
+export interface Camera {
+    yaw: number;
+    tilt: number;
+    /** Horizontal world-to-pixel scale. */
+    scale: number;
+    /**
+     * Vertical scale, allowed to differ from the horizontal one.
+     *
+     * Bodies are drawn at a fixed pixel size, so stretching the *arrangement* to
+     * fill a wide canvas distorts nothing that carries meaning - and a uniform
+     * scale would otherwise leave a third of the width empty whenever the tier
+     * stack is the binding constraint. Bounded, so clustering stays readable.
+     */
+    scaleY: number;
+    cx: number;
+    cy: number;
+}
+export interface Projected {
+    x: number;
+    y: number;
+    depth: number;
+}
+export declare function project3(p: {
+    x: number;
+    y: number;
+    z: number;
+}, cam: Camera): Projected;
+export interface WorldLayoutOptions {
+    /** Which plane each node sits on. */
+    tierOf: (node: SceneNode) => number;
+    /** 0..1 pull between two connected nodes. */
+    attractionOf: (edgeId: string) => number;
+    /** Optional categorical grouping: nodes sharing a value are pulled together. */
+    groupOf?: (node: SceneNode) => string | undefined;
+    /** Vertical separation between planes, in world units. */
+    tierGap: number;
+    nodeWidth: number;
+    nodeHeight: number;
+    iterations: number;
+    seed: number;
+    /** Must match the camera's tilt: separation is measured in projected space. */
+    tilt: number;
+    /** Minimum projected gap between two bodies on the same plane, in world units. */
+    gap: number;
+    /** Screen size of each body, so separation can be done in pixels where it matters. */
+    sizeOf?: (node: SceneNode) => {
+        w: number;
+        h: number;
+    };
+    /** Canvas the world has to fit. Given it, separation runs against the real camera. */
+    viewport?: {
+        width: number;
+        height: number;
+        yaw: number;
+    };
+    /** Pixels to keep clear around a body, including its label block. */
+    labelSpace: number;
+}
+export declare const defaultWorldLayout: WorldLayoutOptions;
+/**
+ * Place nodes in the world.
+ *
+ * A short deterministic relaxation, not a live force simulation: same scene in,
+ * same world out, so two screenshots are comparable and a re-render does not
+ * shuffle everything the user had just learned to read.
+ */
+export declare function layoutWorld(scene: Scene, options?: Partial<WorldLayoutOptions>): Map<string, WorldNode>;
+/** How far the planes reach, so the ground can be drawn under everything on it. */
+export declare function worldExtent(world: Map<string, WorldNode>, margin?: number): number;
+/** Fit the projected world into a box, leaving room for labels under each body. */
+export declare function fitCamera(world: Map<string, WorldNode>, width: number, height: number, yaw: number, tilt?: number, padding?: number, 
+/** Include the tier planes in the fit, so the ground is not clipped. */
+extent?: number): Camera;
+//# sourceMappingURL=layout3d.d.ts.map

package/dist/layout3d.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout3d.d.ts","sourceRoot":"","sources":["../src/layout3d.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAEnD;;;;;;;;;;;;GAYG;AAEH,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,uDAAuD;IACvD,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,MAAM;IACrB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,uCAAuC;IACvC,KAAK,EAAE,MAAM,CAAC;IACd;;;;;;;OAOG;IACH,MAAM,EAAE,MAAM,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,SAAS;IACxB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;CACf;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EAAE,GAAG,EAAE,MAAM,GAAG,SAAS,CAUvF;AAED,MAAM,WAAW,kBAAkB;IACjC,qCAAqC;IACrC,MAAM,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,MAAM,CAAC;IACpC,6CAA6C;IAC7C,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;IACzC,gFAAgF;IAChF,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,MAAM,GAAG,SAAS,CAAC;IAClD,0DAA0D;IAC1D,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,+EAA+E;IAC/E,IAAI,EAAE,MAAM,CAAC;IACb,kFAAkF;IAClF,GAAG,EAAE,MAAM,CAAC;IACZ,sFAAsF;IACtF,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACvD,sFAAsF;IACtF,QAAQ,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IAC1D,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,eAAO,MAAM,kBAAkB,EAAE,kBAWhC,CAAC;AAEF;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,OAAO,CAAC,kBAAkB,CAAM,GACxC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAkLxB;AA2ED,mFAAmF;AACnF,wBAAgB,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,SAAO,GAAG,MAAM,CAIhF;AAoDD,mFAAmF;AACnF,wBAAgB,SAAS,CACvB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,EAC7B,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,MAAM,EACX,IAAI,SAAM,EACV,OAAO,SAAK;AACZ,wEAAwE;AACxE,MAAM,CAAC,EAAE,MAAM,GACd,MAAM,CAmCR"}