@steffolino/diagram-kit-core 0.1.1 → 0.2.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@steffolino/diagram-kit-core",
-  "version": "0.1.1",
+  "version": "0.2.1",
   "description": "Normalized graph model, auto-layout, and theme tokens shared by every diagram-kit renderer and adapter.",
   "license": "MIT",
   "author": "Stefan Stretz",

package/dist/graph.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=graph.test.d.ts.map

package/dist/graph.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.test.d.ts","sourceRoot":"","sources":["../src/graph.test.ts"],"names":[],"mappings":""}

package/dist/graph.test.js

@@ -1,33 +0,0 @@
-import { describe, expect, it } from 'vitest';
-import { createGraph, validateGraph, GraphValidationError } from './graph.js';
-describe('createGraph', () => {
-    it('defaults to empty nodes/edges', () => {
-        const graph = createGraph();
-        expect(graph.nodes).toEqual([]);
-        expect(graph.edges).toEqual([]);
-    });
-    it('carries through provided nodes/edges/metadata', () => {
-        const graph = createGraph([{ id: 'a', label: 'A' }], [], { source: 'test' });
-        expect(graph.nodes).toHaveLength(1);
-        expect(graph.metadata).toEqual({ source: 'test' });
-    });
-});
-describe('validateGraph', () => {
-    it('accepts a graph with consistent nodes/edges', () => {
-        const graph = createGraph([{ id: 'a', label: 'A' }, { id: 'b', label: 'B' }], [{ id: 'a->b', source: 'a', target: 'b' }]);
-        expect(() => validateGraph(graph)).not.toThrow();
-    });
-    it('rejects duplicate node ids', () => {
-        const graph = createGraph([{ id: 'a', label: 'A' }, { id: 'a', label: 'A2' }]);
-        expect(() => validateGraph(graph)).toThrow(GraphValidationError);
-    });
-    it('rejects an edge referencing a missing source node', () => {
-        const graph = createGraph([{ id: 'b', label: 'B' }], [{ id: 'a->b', source: 'a', target: 'b' }]);
-        expect(() => validateGraph(graph)).toThrow(/missing source node "a"/);
-    });
-    it('rejects an edge referencing a missing target node', () => {
-        const graph = createGraph([{ id: 'a', label: 'A' }], [{ id: 'a->b', source: 'a', target: 'b' }]);
-        expect(() => validateGraph(graph)).toThrow(/missing target node "b"/);
-    });
-});
-//# sourceMappingURL=graph.test.js.map

package/dist/graph.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.test.js","sourceRoot":"","sources":["../src/graph.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AAC7C,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAA;AAE7E,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG,WAAW,EAAE,CAAA;QAC3B,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;QAC/B,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;IACjC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;QAC5E,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACnC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;IACpD,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,WAAW,CACvB,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAClD,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAC3C,CAAA;QACD,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAA;IAClD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;QAC9E,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAA;IAClE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QAChG,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAA;IACvE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;QAChG,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAA;IACvE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/layout.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=layout.test.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"layout.test.d.ts","sourceRoot":"","sources":["../src/layout.test.ts"],"names":[],"mappings":""}

package/dist/layout.test.js

@@ -1,72 +0,0 @@
-import { describe, expect, it } from 'vitest';
-import { createGraph } from './graph.js';
-import { layoutGraph } from './layout.js';
-describe('layoutGraph', () => {
-    it('positions every node and preserves edge count', () => {
-        const graph = createGraph([
-            { id: 'a', label: 'A' },
-            { id: 'b', label: 'B' },
-            { id: 'c', label: 'C' },
-        ], [
-            { id: 'a->b', source: 'a', target: 'b' },
-            { id: 'b->c', source: 'b', target: 'c' },
-        ]);
-        const positioned = layoutGraph(graph);
-        expect(positioned.nodes).toHaveLength(3);
-        expect(positioned.edges).toHaveLength(2);
-        for (const node of positioned.nodes) {
-            expect(Number.isFinite(node.x)).toBe(true);
-            expect(Number.isFinite(node.y)).toBe(true);
-            expect(node.width).toBeGreaterThan(0);
-            expect(node.height).toBeGreaterThan(0);
-        }
-        expect(positioned.width).toBeGreaterThan(0);
-        expect(positioned.height).toBeGreaterThan(0);
-    });
-    it('routes a top-to-bottom layout with later ranks below earlier ones', () => {
-        const graph = createGraph([
-            { id: 'a', label: 'A' },
-            { id: 'b', label: 'B' },
-        ], [{ id: 'a->b', source: 'a', target: 'b' }]);
-        const positioned = layoutGraph(graph, { direction: 'TB' });
-        const a = positioned.nodes.find((n) => n.id === 'a');
-        const b = positioned.nodes.find((n) => n.id === 'b');
-        expect(b.y).toBeGreaterThan(a.y);
-    });
-    it('handles a graph with no edges', () => {
-        const graph = createGraph([{ id: 'solo', label: 'Solo' }]);
-        const positioned = layoutGraph(graph);
-        expect(positioned.nodes).toHaveLength(1);
-        expect(positioned.edges).toHaveLength(0);
-    });
-    it('grows node width to fit a long label beyond the default minimum', () => {
-        const graph = createGraph([
-            { id: 'short', label: 'A' },
-            { id: 'long', label: 'A Much Much Longer Node Label Than The Default Width' },
-        ]);
-        const positioned = layoutGraph(graph);
-        const short = positioned.nodes.find((n) => n.id === 'short');
-        const long = positioned.nodes.find((n) => n.id === 'long');
-        expect(long.width).toBeGreaterThan(short.width);
-    });
-    it('clamps node width to nodeWidth in "fixed" sizing mode regardless of label length', () => {
-        const graph = createGraph([
-            { id: 'long', label: 'A Much Much Longer Node Label Than The Default Width' },
-        ]);
-        const positioned = layoutGraph(graph, { nodeSizing: 'fixed', nodeWidth: 160 });
-        expect(positioned.nodes[0].width).toBe(160);
-    });
-    it('supports multiple parallel edges between the same two nodes (multigraph)', () => {
-        const graph = createGraph([
-            { id: 'a', label: 'A' },
-            { id: 'b', label: 'B' },
-        ], [
-            { id: 'edge1', source: 'a', target: 'b' },
-            { id: 'edge2', source: 'a', target: 'b' },
-        ]);
-        expect(() => layoutGraph(graph)).not.toThrow();
-        const positioned = layoutGraph(graph);
-        expect(positioned.edges).toHaveLength(2);
-    });
-});
-//# sourceMappingURL=layout.test.js.map

package/dist/layout.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"layout.test.js","sourceRoot":"","sources":["../src/layout.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AACxC,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAEzC,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,KAAK,GAAG,WAAW,CACvB;YACE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;SACxB,EACD;YACE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;YACxC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;SACzC,CACF,CAAA;QACD,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,CAAA;QAErC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACxC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACxC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC1C,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAA;YACrC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAA;QACxC,CAAC;QACD,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAA;QAC3C,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,KAAK,GAAG,WAAW,CACvB;YACE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;SACxB,EACD,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAC3C,CAAA;QACD,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QAC1D,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAA;QACrD,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAA;QACrD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;QAC1D,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,CAAA;QACrC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACxC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,KAAK,GAAG,WAAW,CAAC;YACxB,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE;YAC3B,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,sDAAsD,EAAE;SAC9E,CAAC,CAAA;QACF,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,CAAA;QACrC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAE,CAAA;QAC7D,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAE,CAAA;QAC3D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;QAC1F,MAAM,KAAK,GAAG,WAAW,CAAC;YACxB,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,sDAAsD,EAAE;SAC9E,CAAC,CAAA;QACF,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAA;QAC9E,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0EAA0E,EAAE,GAAG,EAAE;QAClF,MAAM,KAAK,GAAG,WAAW,CACvB;YACE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;SACxB,EACD;YACE,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;YACzC,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;SAC1C,CACF,CAAA;QACD,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAA;QAC9C,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,CAAA;QACrC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/stackLayout.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=stackLayout.test.d.ts.map

package/dist/stackLayout.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"stackLayout.test.d.ts","sourceRoot":"","sources":["../src/stackLayout.test.ts"],"names":[],"mappings":""}

package/dist/stackLayout.test.js

@@ -1,48 +0,0 @@
-import { describe, expect, it } from 'vitest';
-import { createGraph } from './graph.js';
-import { layoutStack } from './stackLayout.js';
-describe('layoutStack', () => {
-    it('produces no edges', () => {
-        const graph = createGraph([
-            { id: 'a', label: 'A' },
-            { id: 'b', label: 'B' },
-        ], [{ id: 'x', source: 'a', target: 'b' }]);
-        expect(layoutStack(graph).edges).toEqual([]);
-    });
-    it('stacks nodes vertically in graph order with increasing y', () => {
-        const graph = createGraph([
-            { id: 'a', label: 'A' },
-            { id: 'b', label: 'B' },
-            { id: 'c', label: 'C' },
-        ]);
-        const positioned = layoutStack(graph, { direction: 'vertical' });
-        const [a, b, c] = graph.nodes.map((n) => positioned.nodes.find((p) => p.id === n.id));
-        expect(b.y).toBeGreaterThan(a.y);
-        expect(c.y).toBeGreaterThan(b.y);
-    });
-    it('lays out nodes horizontally with increasing x in horizontal direction', () => {
-        const graph = createGraph([
-            { id: 'a', label: 'A' },
-            { id: 'b', label: 'B' },
-        ]);
-        const positioned = layoutStack(graph, { direction: 'horizontal' });
-        const a = positioned.nodes.find((n) => n.id === 'a');
-        const b = positioned.nodes.find((n) => n.id === 'b');
-        expect(b.x).toBeGreaterThan(a.x);
-    });
-    it('grows node width to fit a long label in responsive mode', () => {
-        const graph = createGraph([{ id: 'long', label: 'A Much Much Longer Node Label Than Default' }]);
-        const positioned = layoutStack(graph);
-        expect(positioned.nodes[0].width).toBeGreaterThan(200);
-    });
-    it('clamps node width in fixed sizing mode', () => {
-        const graph = createGraph([{ id: 'long', label: 'A Much Much Longer Node Label Than Default' }]);
-        const positioned = layoutStack(graph, { nodeSizing: 'fixed', nodeWidth: 200 });
-        expect(positioned.nodes[0].width).toBe(200);
-    });
-    it('handles an empty graph without throwing', () => {
-        const graph = createGraph([]);
-        expect(() => layoutStack(graph)).not.toThrow();
-    });
-});
-//# sourceMappingURL=stackLayout.test.js.map

package/dist/stackLayout.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"stackLayout.test.js","sourceRoot":"","sources":["../src/stackLayout.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AACxC,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAE9C,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,MAAM,KAAK,GAAG,WAAW,CACvB;YACE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;SACxB,EACD,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CACxC,CAAA;QACD,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAAG,WAAW,CAAC;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;SACxB,CAAC,CAAA;QACF,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,CAAA;QAChE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAE,CAAC,CAAA;QACtF,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAChC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,MAAM,KAAK,GAAG,WAAW,CAAC;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;SACxB,CAAC,CAAA;QACF,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,SAAS,EAAE,YAAY,EAAE,CAAC,CAAA;QAClE,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAA;QACrD,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAA;QACrD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,4CAA4C,EAAE,CAAC,CAAC,CAAA;QAChG,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,CAAA;QACrC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAA;IACzD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,4CAA4C,EAAE,CAAC,CAAC,CAAA;QAChG,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAA;QAC9E,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,WAAW,CAAC,EAAE,CAAC,CAAA;QAC7B,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAA;IAChD,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/structuralLayout.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=structuralLayout.test.d.ts.map

package/dist/structuralLayout.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"structuralLayout.test.d.ts","sourceRoot":"","sources":["../src/structuralLayout.test.ts"],"names":[],"mappings":""}

package/dist/structuralLayout.test.js

@@ -1,74 +0,0 @@
-import { describe, expect, it } from 'vitest';
-import { createGraph } from './graph.js';
-import { layoutStructural } from './structuralLayout.js';
-describe('layoutStructural', () => {
-    it('produces no edges regardless of the input graph having any', () => {
-        const graph = createGraph([
-            { id: 'parent', label: 'Parent' },
-            { id: 'child', label: 'Child', parentId: 'parent' },
-        ], [{ id: 'x', source: 'parent', target: 'child' }]);
-        const positioned = layoutStructural(graph);
-        expect(positioned.edges).toEqual([]);
-    });
-    it('sizes a container to enclose its children', () => {
-        const graph = createGraph([
-            { id: 'parent', label: 'Parent' },
-            { id: 'a', label: 'A', parentId: 'parent' },
-            { id: 'b', label: 'B', parentId: 'parent' },
-        ]);
-        const positioned = layoutStructural(graph);
-        const parent = positioned.nodes.find((n) => n.id === 'parent');
-        const a = positioned.nodes.find((n) => n.id === 'a');
-        const b = positioned.nodes.find((n) => n.id === 'b');
-        const parentLeft = parent.x - parent.width / 2;
-        const parentRight = parent.x + parent.width / 2;
-        const parentTop = parent.y - parent.height / 2;
-        const parentBottom = parent.y + parent.height / 2;
-        for (const child of [a, b]) {
-            expect(child.x - child.width / 2).toBeGreaterThanOrEqual(parentLeft);
-            expect(child.x + child.width / 2).toBeLessThanOrEqual(parentRight);
-            expect(child.y - child.height / 2).toBeGreaterThanOrEqual(parentTop);
-            expect(child.y + child.height / 2).toBeLessThanOrEqual(parentBottom);
-        }
-    });
-    it('wraps children onto a new row once maxRowWidth is exceeded', () => {
-        const graph = createGraph([
-            { id: 'parent', label: 'Parent' },
-            { id: 'a', label: 'A', parentId: 'parent' },
-            { id: 'b', label: 'B', parentId: 'parent' },
-            { id: 'c', label: 'C', parentId: 'parent' },
-        ]);
-        const positioned = layoutStructural(graph, { leafWidth: 100, maxRowWidth: 250, gap: 10 });
-        const a = positioned.nodes.find((n) => n.id === 'a');
-        const c = positioned.nodes.find((n) => n.id === 'c');
-        // 3 leaves at 100 + 2 gaps of 10 = 320 > maxRowWidth 250, so the third
-        // leaf should wrap onto a second row (different y than the first).
-        expect(c.y).toBeGreaterThan(a.y);
-    });
-    it('sizes a leaf wide enough for a long label', () => {
-        const graph = createGraph([
-            { id: 'short', label: 'A' },
-            { id: 'long', label: 'A Much Much Longer Node Label' },
-        ]);
-        const positioned = layoutStructural(graph);
-        const short = positioned.nodes.find((n) => n.id === 'short');
-        const long = positioned.nodes.find((n) => n.id === 'long');
-        expect(long.width).toBeGreaterThan(short.width);
-    });
-    it('clamps leaf width in "fixed" sizing mode', () => {
-        const graph = createGraph([{ id: 'long', label: 'A Much Much Longer Node Label Than Default' }]);
-        const positioned = layoutStructural(graph, { nodeSizing: 'fixed', leafWidth: 140 });
-        expect(positioned.nodes[0].width).toBe(140);
-    });
-    it('places multiple root nodes side by side without overlapping', () => {
-        const graph = createGraph([
-            { id: 'root1', label: 'Root 1' },
-            { id: 'root2', label: 'Root 2' },
-        ]);
-        const positioned = layoutStructural(graph);
-        const root1 = positioned.nodes.find((n) => n.id === 'root1');
-        const root2 = positioned.nodes.find((n) => n.id === 'root2');
-        expect(root2.x - root2.width / 2).toBeGreaterThanOrEqual(root1.x + root1.width / 2);
-    });
-});
-//# sourceMappingURL=structuralLayout.test.js.map

package/dist/structuralLayout.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"structuralLayout.test.js","sourceRoot":"","sources":["../src/structuralLayout.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAA;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AACxC,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAA;AAExD,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,KAAK,GAAG,WAAW,CACvB;YACE,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE;YACjC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE;SACpD,EACD,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CACjD,CAAA;QACD,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAC1C,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;IACtC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,WAAW,CAAC;YACxB,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE;YACjC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE;YAC3C,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE;SAC5C,CAAC,CAAA;QACF,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAC1C,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAE,CAAA;QAC/D,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAA;QACrD,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAA;QAErD,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAA;QAC9C,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAA;QAC/C,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;QAC9C,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;QAEjD,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAA;YACpE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAA;YAClE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAA;YACpE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAA;QACtE,CAAC;IACH,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,KAAK,GAAG,WAAW,CAAC;YACxB,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE;YACjC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE;YAC3C,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE;YAC3C,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE;SAC5C,CAAC,CAAA;QACF,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAA;QACzF,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAA;QACrD,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAA;QACrD,uEAAuE;QACvE,mEAAmE;QACnE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,WAAW,CAAC;YACxB,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE;YAC3B,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,+BAA+B,EAAE;SACvD,CAAC,CAAA;QACF,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAC1C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAE,CAAA;QAC7D,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAE,CAAA;QAC3D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,4CAA4C,EAAE,CAAC,CAAC,CAAA;QAChG,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAA;QACnF,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,KAAK,GAAG,WAAW,CAAC;YACxB,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE;YAChC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE;SACjC,CAAC,CAAA;QACF,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAC1C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAE,CAAA;QAC7D,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAE,CAAA;QAC7D,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;IACrF,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}