@nyaruka/temba-components 0.141.1 → 0.142.0

package/out-tsc/test/temba-flow-reflow.test.js

@@ -0,0 +1,472 @@
+import { expect } from '@open-wc/testing';
+import { calculateLayeredLayout, placeStickyNotes } from '../src/flow/reflow';
+// Helper to create a minimal Node with exits
+function makeNode(uuid, exits) {
+    return {
+        uuid,
+        actions: [],
+        exits: exits.map((e, i) => ({
+            uuid: `${uuid}-exit-${i}`,
+            destination_uuid: e.destination_uuid
+        }))
+    };
+}
+// Helper to return a fixed size for all nodes
+function constantSize(width, height) {
+    return () => ({ width, height });
+}
+describe('Reflow Layout', () => {
+    describe('calculateLayeredLayout', () => {
+        it('returns empty object for empty nodes', () => {
+            const result = calculateLayeredLayout([], {}, 'start', constantSize(200, 100));
+            expect(Object.keys(result)).to.have.length(0);
+        });
+        it('places a single node at the origin', () => {
+            const nodes = [makeNode('A', [])];
+            const nodeUIs = { A: { position: { left: 500, top: 500 } } };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            expect(result['A']).to.not.be.undefined;
+            expect(result['A'].left).to.equal(0);
+            expect(result['A'].top).to.equal(0);
+        });
+        it('places a linear chain vertically', () => {
+            // A -> B -> C
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }]),
+                makeNode('B', [{ destination_uuid: 'C' }]),
+                makeNode('C', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } },
+                C: { position: { left: 0, top: 400 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            // All should be at left=0 (centered under parent which is at 0)
+            // A at layer 0, B at layer 1, C at layer 2
+            expect(result['A'].top).to.equal(0);
+            expect(result['B'].top).to.be.greaterThan(result['A'].top);
+            expect(result['C'].top).to.be.greaterThan(result['B'].top);
+        });
+        it('places siblings at the same vertical level', () => {
+            // A -> B, A -> C
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }, { destination_uuid: 'C' }]),
+                makeNode('B', []),
+                makeNode('C', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } },
+                C: { position: { left: 300, top: 200 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            // B and C should be on the same layer (same top)
+            expect(result['B'].top).to.equal(result['C'].top);
+            expect(result['B'].top).to.be.greaterThan(result['A'].top);
+            // B and C should be side by side
+            expect(result['B'].left).to.not.equal(result['C'].left);
+        });
+        it('snaps all positions to grid (multiples of 20)', () => {
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }]),
+                makeNode('B', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            for (const uuid of Object.keys(result)) {
+                expect(result[uuid].left % 20).to.equal(0);
+                expect(result[uuid].top % 20).to.equal(0);
+            }
+        });
+        it('handles cycles (back-edges) without infinite loops', () => {
+            // A -> B -> A (cycle)
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }]),
+                makeNode('B', [{ destination_uuid: 'A' }])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            expect(result['A']).to.not.be.undefined;
+            expect(result['B']).to.not.be.undefined;
+            // A should be above B (layer 0 vs layer 1)
+            expect(result['A'].top).to.be.lessThan(result['B'].top);
+        });
+        it('handles diamond-shaped flows (merge nodes)', () => {
+            // A -> B, A -> C, B -> D, C -> D
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }, { destination_uuid: 'C' }]),
+                makeNode('B', [{ destination_uuid: 'D' }]),
+                makeNode('C', [{ destination_uuid: 'D' }]),
+                makeNode('D', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } },
+                C: { position: { left: 300, top: 200 } },
+                D: { position: { left: 150, top: 400 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            // D should be below both B and C (longest path assignment)
+            expect(result['D'].top).to.be.greaterThan(result['B'].top);
+            expect(result['D'].top).to.be.greaterThan(result['C'].top);
+            // B and C on same layer
+            expect(result['B'].top).to.equal(result['C'].top);
+        });
+        it('handles deduplicated exits (same destination from multiple exits)', () => {
+            // A has two exits both pointing to B
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }, { destination_uuid: 'B' }]),
+                makeNode('B', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            expect(result['A']).to.not.be.undefined;
+            expect(result['B']).to.not.be.undefined;
+            expect(result['B'].top).to.be.greaterThan(result['A'].top);
+        });
+        it('handles exits with no destination', () => {
+            const nodes = [
+                makeNode('A', [
+                    { destination_uuid: undefined },
+                    { destination_uuid: 'B' }
+                ]),
+                makeNode('B', [{ destination_uuid: undefined }])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            expect(result['A']).to.not.be.undefined;
+            expect(result['B']).to.not.be.undefined;
+        });
+        it('handles disconnected nodes', () => {
+            // A -> B, C is disconnected (no edges at all)
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }]),
+                makeNode('B', []),
+                makeNode('C', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } },
+                C: { position: { left: 300, top: 300 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            // All nodes should receive positions
+            expect(result['A']).to.not.be.undefined;
+            expect(result['B']).to.not.be.undefined;
+            expect(result['C']).to.not.be.undefined;
+            // C (no edges, inDegree 0) lands in layer 0 alongside start node
+            // but gets a 40px vertical offset since it's not the start node
+            expect(result['C'].top).to.equal(40);
+        });
+        it('positions all nodes with non-negative coordinates', () => {
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }, { destination_uuid: 'C' }]),
+                makeNode('B', [{ destination_uuid: 'D' }]),
+                makeNode('C', [{ destination_uuid: 'D' }]),
+                makeNode('D', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } },
+                C: { position: { left: 300, top: 200 } },
+                D: { position: { left: 150, top: 400 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            for (const uuid of Object.keys(result)) {
+                expect(result[uuid].left).to.be.at.least(0);
+                expect(result[uuid].top).to.be.at.least(0);
+            }
+        });
+        it('uses different node sizes for layout', () => {
+            // A -> B -> C, B is tall
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }]),
+                makeNode('B', [{ destination_uuid: 'C' }]),
+                makeNode('C', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } },
+                C: { position: { left: 0, top: 500 } }
+            };
+            const getSize = (uuid) => {
+                if (uuid === 'B')
+                    return { width: 200, height: 300 };
+                return { width: 200, height: 100 };
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', getSize);
+            // Gap between B and C should account for B's height of 300
+            const bBottom = result['B'].top + 300;
+            expect(result['C'].top).to.be.greaterThanOrEqual(bBottom);
+        });
+        it('handles a complex flow with self-loops', () => {
+            // A -> B, B -> B (self-loop), B -> C
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'B' }]),
+                makeNode('B', [{ destination_uuid: 'B' }, { destination_uuid: 'C' }]),
+                makeNode('C', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } },
+                C: { position: { left: 0, top: 400 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            expect(result['A'].top).to.equal(0);
+            expect(result['B'].top).to.be.greaterThan(result['A'].top);
+            expect(result['C'].top).to.be.greaterThan(result['B'].top);
+        });
+        it('orders sibling nodes using barycenter heuristic', () => {
+            // A -> C, B -> D, A and B on layer 0
+            // With A first, C should come before D
+            const nodes = [
+                makeNode('A', [{ destination_uuid: 'C' }]),
+                makeNode('B', [{ destination_uuid: 'D' }]),
+                makeNode('C', []),
+                makeNode('D', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 300, top: 0 } },
+                C: { position: { left: 0, top: 200 } },
+                D: { position: { left: 300, top: 200 } }
+            };
+            // A and B are both roots (no parents), so both in layer 0
+            // But A is the start node
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            // C should be left of D (follows parent order)
+            expect(result['C'].left).to.be.lessThan(result['D'].left);
+        });
+        it('non-start nodes in first layer are offset down', () => {
+            // A and B both in layer 0 (B unreachable from A but has no parents)
+            const nodes = [makeNode('A', []), makeNode('B', [])];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 300, top: 0 } }
+            };
+            // B will end up on a later layer since it's unreachable from A
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            // Start node A should be at top=0
+            expect(result['A'].top).to.equal(0);
+        });
+        it('wraps siblings to new rows when exceeding max width', () => {
+            // A -> B..H: 7 children at 200px each = 200*7 + 60*6 = 1760px
+            // Should split into rows of 4 (980px) and 3 (720px)
+            const childIds = ['B', 'C', 'D', 'E', 'F', 'G', 'H'];
+            const nodes = [
+                makeNode('A', childIds.map((id) => ({ destination_uuid: id }))),
+                ...childIds.map((id) => makeNode(id, []))
+            ];
+            const nodeUIs = { A: { position: { left: 0, top: 0 } } };
+            childIds.forEach((id, i) => {
+                nodeUIs[id] = { position: { left: i * 260, top: 200 } };
+            });
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            // All children should be below A
+            for (const id of childIds) {
+                expect(result[id].top).to.be.greaterThan(result['A'].top);
+            }
+            // Children should span multiple rows (not all the same top)
+            const tops = new Set(childIds.map((id) => result[id].top));
+            expect(tops.size).to.be.greaterThan(1);
+            // Each visual row should fit within 1200px
+            const rowsByTop = new Map();
+            for (const id of childIds) {
+                const t = result[id].top;
+                const row = rowsByTop.get(t) || [];
+                row.push(id);
+                rowsByTop.set(t, row);
+            }
+            for (const [, row] of rowsByTop) {
+                const minLeft = Math.min(...row.map((id) => result[id].left));
+                const maxRight = Math.max(...row.map((id) => result[id].left + 200));
+                expect(maxRight - minLeft).to.be.at.most(1200);
+            }
+        });
+        it('handles wider flows with multiple branches', () => {
+            // A -> B, A -> C, A -> D
+            const nodes = [
+                makeNode('A', [
+                    { destination_uuid: 'B' },
+                    { destination_uuid: 'C' },
+                    { destination_uuid: 'D' }
+                ]),
+                makeNode('B', []),
+                makeNode('C', []),
+                makeNode('D', [])
+            ];
+            const nodeUIs = {
+                A: { position: { left: 0, top: 0 } },
+                B: { position: { left: 0, top: 200 } },
+                C: { position: { left: 300, top: 200 } },
+                D: { position: { left: 600, top: 200 } }
+            };
+            const result = calculateLayeredLayout(nodes, nodeUIs, 'A', constantSize(200, 100));
+            // All three children should be on the same layer
+            expect(result['B'].top).to.equal(result['C'].top);
+            expect(result['C'].top).to.equal(result['D'].top);
+            // They should be spread horizontally with gaps
+            const lefts = [result['B'].left, result['C'].left, result['D'].left].sort((a, b) => a - b);
+            expect(lefts[1]).to.be.greaterThan(lefts[0]);
+            expect(lefts[2]).to.be.greaterThan(lefts[1]);
+        });
+    });
+    describe('placeStickyNotes', () => {
+        const makeSticky = (left, top) => ({
+            position: { left, top },
+            title: '',
+            body: '',
+            color: 'yellow'
+        });
+        it('returns empty object when no stickies', () => {
+            const result = placeStickyNotes({}, { A: { left: 0, top: 0 } }, { A: { left: 0, top: 0 } }, new Map([['A', { width: 200, height: 100 }]]), new Map(), 'A');
+            expect(Object.keys(result)).to.have.length(0);
+        });
+        it('returns empty object when no nodes', () => {
+            const result = placeStickyNotes({ s1: makeSticky(100, 100) }, {}, {}, new Map(), new Map(), 'A');
+            expect(Object.keys(result)).to.have.length(0);
+        });
+        it('places sticky to the right of its closest node', () => {
+            const stickies = { s1: makeSticky(250, 0) }; // right of node at (0,0)
+            const oldPositions = { A: { left: 0, top: 0 } };
+            const newPositions = { A: { left: 0, top: 0 } };
+            const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);
+            const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            expect(result['s1']).to.not.be.undefined;
+            // Should be placed to the right of node A
+            expect(result['s1'].left).to.be.greaterThanOrEqual(200);
+        });
+        it('places sticky to the left when it was originally left', () => {
+            // Sticky was to the left of node B (not start node)
+            const stickies = { s1: makeSticky(0, 0) }; // left of node at (300, 0)
+            const oldPositions = {
+                A: { left: 0, top: 0 },
+                B: { left: 300, top: 200 }
+            };
+            const newPositions = {
+                A: { left: 0, top: 0 },
+                B: { left: 300, top: 200 }
+            };
+            const nodeSizes = new Map([
+                ['A', { width: 200, height: 100 }],
+                ['B', { width: 200, height: 100 }]
+            ]);
+            const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            expect(result['s1']).to.not.be.undefined;
+        });
+        it('redirects left-of-start sticky to the right side', () => {
+            // Sticky was to the left of the start node — should be placed to the right
+            const stickies = { s1: makeSticky(-200, 0) }; // left of start node at (0,0)
+            const oldPositions = { A: { left: 0, top: 0 } };
+            const newPositions = { A: { left: 0, top: 0 } };
+            const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);
+            const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            expect(result['s1']).to.not.be.undefined;
+            // Should be placed to the right (not left) of the start node
+            expect(result['s1'].left).to.be.greaterThanOrEqual(200);
+        });
+        it('snaps sticky positions to grid', () => {
+            const stickies = { s1: makeSticky(250, 5) };
+            const oldPositions = { A: { left: 0, top: 0 } };
+            const newPositions = { A: { left: 0, top: 0 } };
+            const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);
+            const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            expect(result['s1'].left % 20).to.equal(0);
+            expect(result['s1'].top % 20).to.equal(0);
+        });
+        it('assigns sticky to closest node', () => {
+            // s1 is at (310, 200), closer to B at (300, 200) than A at (0, 0)
+            const stickies = { s1: makeSticky(310, 200) };
+            const oldPositions = {
+                A: { left: 0, top: 0 },
+                B: { left: 300, top: 200 }
+            };
+            const newPositions = {
+                A: { left: 0, top: 0 },
+                B: { left: 300, top: 200 }
+            };
+            const nodeSizes = new Map([
+                ['A', { width: 200, height: 100 }],
+                ['B', { width: 200, height: 100 }]
+            ]);
+            const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            expect(result['s1']).to.not.be.undefined;
+            // Should be placed near node B, not node A
+            expect(result['s1'].left).to.be.greaterThan(200);
+        });
+        it('nudges stickies to avoid collisions', () => {
+            // Two stickies both closest to node A, both on the right side
+            const stickies = {
+                s1: makeSticky(250, 0),
+                s2: makeSticky(260, 0)
+            };
+            const oldPositions = { A: { left: 0, top: 0 } };
+            const newPositions = { A: { left: 0, top: 0 } };
+            const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);
+            const stickySizes = new Map([
+                ['s1', { width: 182, height: 100 }],
+                ['s2', { width: 182, height: 100 }]
+            ]);
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            // Both stickies should be placed
+            expect(result['s1']).to.not.be.undefined;
+            expect(result['s2']).to.not.be.undefined;
+            // If they have the same left, they should be vertically separated
+            if (result['s1'].left === result['s2'].left) {
+                expect(result['s1'].top).to.not.equal(result['s2'].top);
+            }
+        });
+        it('skips stickies without position', () => {
+            const stickies = {
+                s1: { title: '', body: '', color: 'yellow' }
+            };
+            const oldPositions = { A: { left: 0, top: 0 } };
+            const newPositions = { A: { left: 0, top: 0 } };
+            const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);
+            const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            // Sticky without position should be skipped
+            expect(result['s1']).to.be.undefined;
+        });
+        it('ensures non-negative coordinates for stickies', () => {
+            const stickies = { s1: makeSticky(250, 0) };
+            const oldPositions = { A: { left: 0, top: 0 } };
+            const newPositions = { A: { left: 0, top: 0 } };
+            const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);
+            const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            expect(result['s1'].left).to.be.at.least(0);
+            expect(result['s1'].top).to.be.at.least(0);
+        });
+        it('uses default sizes when not provided', () => {
+            const stickies = { s1: makeSticky(250, 0) };
+            const oldPositions = { A: { left: 0, top: 0 } };
+            const newPositions = { A: { left: 0, top: 0 } };
+            const nodeSizes = new Map();
+            const stickySizes = new Map();
+            const result = placeStickyNotes(stickies, oldPositions, newPositions, nodeSizes, stickySizes, 'A');
+            expect(result['s1']).to.not.be.undefined;
+            expect(result['s1'].left).to.be.at.least(0);
+            expect(result['s1'].top).to.be.at.least(0);
+        });
+    });
+});
+//# sourceMappingURL=temba-flow-reflow.test.js.map

package/out-tsc/test/temba-flow-reflow.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temba-flow-reflow.test.js","sourceRoot":"","sources":["../../test/temba-flow-reflow.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAG9E,6CAA6C;AAC7C,SAAS,QAAQ,CAAC,IAAY,EAAE,KAAsC;IACpE,OAAO;QACL,IAAI;QACJ,OAAO,EAAE,EAAE;QACX,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1B,IAAI,EAAE,GAAG,IAAI,SAAS,CAAC,EAAE;YACzB,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;SACrC,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAED,8CAA8C;AAC9C,SAAS,YAAY,CAAC,KAAa,EAAE,MAAc;IACjD,OAAO,GAAG,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACtC,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC9C,MAAM,MAAM,GAAG,sBAAsB,CACnC,EAAE,EACF,EAAE,EACF,OAAO,EACP,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YAClC,MAAM,OAAO,GAAG,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,cAAc;YACd,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACvC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,gEAAgE;YAChE,2CAA2C;YAC3C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,iBAAiB;YACjB,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBACrE,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACzC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,iDAAiD;YACjD,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAClD,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3D,iCAAiC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACvD,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACvC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC5D,sBAAsB;YACtB,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;aAC3C,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACvC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,2CAA2C;YAC3C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,iCAAiC;YACjC,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBACrE,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACxC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACzC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,2DAA2D;YAC3D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3D,wBAAwB;YACxB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;YAC3E,qCAAqC;YACrC,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBACrE,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACvC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC3C,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE;oBACZ,EAAE,gBAAgB,EAAE,SAAS,EAAE;oBAC/B,EAAE,gBAAgB,EAAE,GAAG,EAAE;iBAC1B,CAAC;gBACF,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC,CAAC;aACjD,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACvC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACpC,8CAA8C;YAC9C,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACzC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,qCAAqC;YACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACxC,iEAAiE;YACjE,gEAAgE;YAChE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC3D,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBACrE,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACxC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACzC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC9C,yBAAyB;YACzB,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACvC,CAAC;YACF,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,EAAE;gBAC/B,IAAI,IAAI,KAAK,GAAG;oBAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;gBACrD,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;YACrC,CAAC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YAEpE,2DAA2D;YAC3D,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAChD,qCAAqC;YACrC,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,EAAE,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBACrE,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACvC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YACzD,qCAAqC;YACrC,uCAAuC;YACvC,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,gBAAgB,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACzC,CAAC;YACF,0DAA0D;YAC1D,0BAA0B;YAC1B,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,+CAA+C;YAC/C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACxD,oEAAoE;YACpE,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACrD,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;aACvC,CAAC;YACF,+DAA+D;YAC/D,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,kCAAkC;YAClC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC7D,8DAA8D;YAC9D,oDAAoD;YACpD,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACrD,MAAM,KAAK,GAAG;gBACZ,QAAQ,CACN,GAAG,EACH,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,gBAAgB,EAAE,EAAE,EAAE,CAAC,CAAC,CACjD;gBACD,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;aAC1C,CAAC;YACF,MAAM,OAAO,GACX,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;YAC3C,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;gBACzB,OAAO,CAAC,EAAE,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;YAC1D,CAAC,CAAC,CAAC;YACH,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,iCAAiC;YACjC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5D,CAAC;YAED,4DAA4D;YAC5D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3D,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAEvC,2CAA2C;YAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;YAC9C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;gBACzB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACnC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACb,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACxB,CAAC;YACD,KAAK,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;gBACrE,MAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,yBAAyB;YACzB,MAAM,KAAK,GAAG;gBACZ,QAAQ,CAAC,GAAG,EAAE;oBACZ,EAAE,gBAAgB,EAAE,GAAG,EAAE;oBACzB,EAAE,gBAAgB,EAAE,GAAG,EAAE;oBACzB,EAAE,gBAAgB,EAAE,GAAG,EAAE;iBAC1B,CAAC;gBACF,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC;aAClB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;gBACpC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACtC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;gBACxC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;aACzC,CAAC;YACF,MAAM,MAAM,GAAG,sBAAsB,CACnC,KAAK,EACL,OAAO,EACP,GAAG,EACH,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;YAEF,iDAAiD;YACjD,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAClD,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAElD,+CAA+C;YAC/C,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CACvE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAChB,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,GAAW,EAAc,EAAE,CAAC,CAAC;YAC7D,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE;YACvB,KAAK,EAAE,EAAE;YACT,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,QAAQ;SAChB,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC/C,MAAM,MAAM,GAAG,gBAAgB,CAC7B,EAAE,EACF,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAC1B,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAC1B,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAC7C,IAAI,GAAG,EAAE,EACT,GAAG,CACJ,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,MAAM,GAAG,gBAAgB,CAC7B,EAAE,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAC5B,EAAE,EACF,EAAE,EACF,IAAI,GAAG,EAAE,EACT,IAAI,GAAG,EAAE,EACT,GAAG,CACJ,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACxD,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,yBAAyB;YACtE,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEnE,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACzC,0CAA0C;YAC1C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAC/D,oDAAoD;YACpD,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,2BAA2B;YACtE,MAAM,YAAY,GAAG;gBACnB,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACtB,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;aAC3B,CAAC;YACF,MAAM,YAAY,GAAG;gBACnB,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACtB,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;aAC3B,CAAC;YACF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;gBACxB,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;gBAClC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;aACnC,CAAC,CAAC;YACH,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEnE,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YAC1D,2EAA2E;YAC3E,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,8BAA8B;YAC5E,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEnE,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACzC,6DAA6D;YAC7D,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACxC,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;YAC5C,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEnE,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACxC,kEAAkE;YAClE,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,YAAY,GAAG;gBACnB,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACtB,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;aAC3B,CAAC;YACF,MAAM,YAAY,GAAG;gBACnB,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACtB,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;aAC3B,CAAC;YACF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;gBACxB,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;gBAClC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;aACnC,CAAC,CAAC;YACH,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEnE,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACzC,2CAA2C;YAC3C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC7C,8DAA8D;YAC9D,MAAM,QAAQ,GAAG;gBACf,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC;gBACtB,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC;aACvB,CAAC;YACF,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;gBAC1B,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;gBACnC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;aACpC,CAAC,CAAC;YAEH,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,iCAAiC;YACjC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YAEzC,kEAAkE;YAClE,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC5C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,QAAQ,GAAG;gBACf,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,QAAiB,EAAgB;aACpE,CAAC;YACF,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEnE,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,4CAA4C;YAC5C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACvD,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;YAC5C,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEnE,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC9C,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;YAC5C,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,GAAG,EAA6C,CAAC;YACvE,MAAM,WAAW,GAAG,IAAI,GAAG,EAA6C,CAAC;YAEzE,MAAM,MAAM,GAAG,gBAAgB,CAC7B,QAAQ,EACR,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,WAAW,EACX,GAAG,CACJ,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["import { expect } from '@open-wc/testing';\nimport { calculateLayeredLayout, placeStickyNotes } from '../src/flow/reflow';\nimport { Node, StickyNote } from '../src/store/flow-definition';\n\n// Helper to create a minimal Node with exits\nfunction makeNode(uuid: string, exits: { destination_uuid?: string }[]): Node {\n  return {\n    uuid,\n    actions: [],\n    exits: exits.map((e, i) => ({\n      uuid: `${uuid}-exit-${i}`,\n      destination_uuid: e.destination_uuid\n    }))\n  };\n}\n\n// Helper to return a fixed size for all nodes\nfunction constantSize(width: number, height: number) {\n  return () => ({ width, height });\n}\n\ndescribe('Reflow Layout', () => {\n  describe('calculateLayeredLayout', () => {\n    it('returns empty object for empty nodes', () => {\n      const result = calculateLayeredLayout(\n        [],\n        {},\n        'start',\n        constantSize(200, 100)\n      );\n      expect(Object.keys(result)).to.have.length(0);\n    });\n\n    it('places a single node at the origin', () => {\n      const nodes = [makeNode('A', [])];\n      const nodeUIs = { A: { position: { left: 500, top: 500 } } };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      expect(result['A']).to.not.be.undefined;\n      expect(result['A'].left).to.equal(0);\n      expect(result['A'].top).to.equal(0);\n    });\n\n    it('places a linear chain vertically', () => {\n      // A -> B -> C\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }]),\n        makeNode('B', [{ destination_uuid: 'C' }]),\n        makeNode('C', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } },\n        C: { position: { left: 0, top: 400 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      // All should be at left=0 (centered under parent which is at 0)\n      // A at layer 0, B at layer 1, C at layer 2\n      expect(result['A'].top).to.equal(0);\n      expect(result['B'].top).to.be.greaterThan(result['A'].top);\n      expect(result['C'].top).to.be.greaterThan(result['B'].top);\n    });\n\n    it('places siblings at the same vertical level', () => {\n      // A -> B, A -> C\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }, { destination_uuid: 'C' }]),\n        makeNode('B', []),\n        makeNode('C', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } },\n        C: { position: { left: 300, top: 200 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      // B and C should be on the same layer (same top)\n      expect(result['B'].top).to.equal(result['C'].top);\n      expect(result['B'].top).to.be.greaterThan(result['A'].top);\n      // B and C should be side by side\n      expect(result['B'].left).to.not.equal(result['C'].left);\n    });\n\n    it('snaps all positions to grid (multiples of 20)', () => {\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }]),\n        makeNode('B', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      for (const uuid of Object.keys(result)) {\n        expect(result[uuid].left % 20).to.equal(0);\n        expect(result[uuid].top % 20).to.equal(0);\n      }\n    });\n\n    it('handles cycles (back-edges) without infinite loops', () => {\n      // A -> B -> A (cycle)\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }]),\n        makeNode('B', [{ destination_uuid: 'A' }])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      expect(result['A']).to.not.be.undefined;\n      expect(result['B']).to.not.be.undefined;\n      // A should be above B (layer 0 vs layer 1)\n      expect(result['A'].top).to.be.lessThan(result['B'].top);\n    });\n\n    it('handles diamond-shaped flows (merge nodes)', () => {\n      // A -> B, A -> C, B -> D, C -> D\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }, { destination_uuid: 'C' }]),\n        makeNode('B', [{ destination_uuid: 'D' }]),\n        makeNode('C', [{ destination_uuid: 'D' }]),\n        makeNode('D', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } },\n        C: { position: { left: 300, top: 200 } },\n        D: { position: { left: 150, top: 400 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      // D should be below both B and C (longest path assignment)\n      expect(result['D'].top).to.be.greaterThan(result['B'].top);\n      expect(result['D'].top).to.be.greaterThan(result['C'].top);\n      // B and C on same layer\n      expect(result['B'].top).to.equal(result['C'].top);\n    });\n\n    it('handles deduplicated exits (same destination from multiple exits)', () => {\n      // A has two exits both pointing to B\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }, { destination_uuid: 'B' }]),\n        makeNode('B', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      expect(result['A']).to.not.be.undefined;\n      expect(result['B']).to.not.be.undefined;\n      expect(result['B'].top).to.be.greaterThan(result['A'].top);\n    });\n\n    it('handles exits with no destination', () => {\n      const nodes = [\n        makeNode('A', [\n          { destination_uuid: undefined },\n          { destination_uuid: 'B' }\n        ]),\n        makeNode('B', [{ destination_uuid: undefined }])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      expect(result['A']).to.not.be.undefined;\n      expect(result['B']).to.not.be.undefined;\n    });\n\n    it('handles disconnected nodes', () => {\n      // A -> B, C is disconnected (no edges at all)\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }]),\n        makeNode('B', []),\n        makeNode('C', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } },\n        C: { position: { left: 300, top: 300 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      // All nodes should receive positions\n      expect(result['A']).to.not.be.undefined;\n      expect(result['B']).to.not.be.undefined;\n      expect(result['C']).to.not.be.undefined;\n      // C (no edges, inDegree 0) lands in layer 0 alongside start node\n      // but gets a 40px vertical offset since it's not the start node\n      expect(result['C'].top).to.equal(40);\n    });\n\n    it('positions all nodes with non-negative coordinates', () => {\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }, { destination_uuid: 'C' }]),\n        makeNode('B', [{ destination_uuid: 'D' }]),\n        makeNode('C', [{ destination_uuid: 'D' }]),\n        makeNode('D', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } },\n        C: { position: { left: 300, top: 200 } },\n        D: { position: { left: 150, top: 400 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      for (const uuid of Object.keys(result)) {\n        expect(result[uuid].left).to.be.at.least(0);\n        expect(result[uuid].top).to.be.at.least(0);\n      }\n    });\n\n    it('uses different node sizes for layout', () => {\n      // A -> B -> C, B is tall\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }]),\n        makeNode('B', [{ destination_uuid: 'C' }]),\n        makeNode('C', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } },\n        C: { position: { left: 0, top: 500 } }\n      };\n      const getSize = (uuid: string) => {\n        if (uuid === 'B') return { width: 200, height: 300 };\n        return { width: 200, height: 100 };\n      };\n      const result = calculateLayeredLayout(nodes, nodeUIs, 'A', getSize);\n\n      // Gap between B and C should account for B's height of 300\n      const bBottom = result['B'].top + 300;\n      expect(result['C'].top).to.be.greaterThanOrEqual(bBottom);\n    });\n\n    it('handles a complex flow with self-loops', () => {\n      // A -> B, B -> B (self-loop), B -> C\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'B' }]),\n        makeNode('B', [{ destination_uuid: 'B' }, { destination_uuid: 'C' }]),\n        makeNode('C', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } },\n        C: { position: { left: 0, top: 400 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      expect(result['A'].top).to.equal(0);\n      expect(result['B'].top).to.be.greaterThan(result['A'].top);\n      expect(result['C'].top).to.be.greaterThan(result['B'].top);\n    });\n\n    it('orders sibling nodes using barycenter heuristic', () => {\n      // A -> C, B -> D, A and B on layer 0\n      // With A first, C should come before D\n      const nodes = [\n        makeNode('A', [{ destination_uuid: 'C' }]),\n        makeNode('B', [{ destination_uuid: 'D' }]),\n        makeNode('C', []),\n        makeNode('D', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 300, top: 0 } },\n        C: { position: { left: 0, top: 200 } },\n        D: { position: { left: 300, top: 200 } }\n      };\n      // A and B are both roots (no parents), so both in layer 0\n      // But A is the start node\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      // C should be left of D (follows parent order)\n      expect(result['C'].left).to.be.lessThan(result['D'].left);\n    });\n\n    it('non-start nodes in first layer are offset down', () => {\n      // A and B both in layer 0 (B unreachable from A but has no parents)\n      const nodes = [makeNode('A', []), makeNode('B', [])];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 300, top: 0 } }\n      };\n      // B will end up on a later layer since it's unreachable from A\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      // Start node A should be at top=0\n      expect(result['A'].top).to.equal(0);\n    });\n\n    it('wraps siblings to new rows when exceeding max width', () => {\n      // A -> B..H: 7 children at 200px each = 200*7 + 60*6 = 1760px\n      // Should split into rows of 4 (980px) and 3 (720px)\n      const childIds = ['B', 'C', 'D', 'E', 'F', 'G', 'H'];\n      const nodes = [\n        makeNode(\n          'A',\n          childIds.map((id) => ({ destination_uuid: id }))\n        ),\n        ...childIds.map((id) => makeNode(id, []))\n      ];\n      const nodeUIs: Record<string, { position: { left: number; top: number } }> =\n        { A: { position: { left: 0, top: 0 } } };\n      childIds.forEach((id, i) => {\n        nodeUIs[id] = { position: { left: i * 260, top: 200 } };\n      });\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      // All children should be below A\n      for (const id of childIds) {\n        expect(result[id].top).to.be.greaterThan(result['A'].top);\n      }\n\n      // Children should span multiple rows (not all the same top)\n      const tops = new Set(childIds.map((id) => result[id].top));\n      expect(tops.size).to.be.greaterThan(1);\n\n      // Each visual row should fit within 1200px\n      const rowsByTop = new Map<number, string[]>();\n      for (const id of childIds) {\n        const t = result[id].top;\n        const row = rowsByTop.get(t) || [];\n        row.push(id);\n        rowsByTop.set(t, row);\n      }\n      for (const [, row] of rowsByTop) {\n        const minLeft = Math.min(...row.map((id) => result[id].left));\n        const maxRight = Math.max(...row.map((id) => result[id].left + 200));\n        expect(maxRight - minLeft).to.be.at.most(1200);\n      }\n    });\n\n    it('handles wider flows with multiple branches', () => {\n      // A -> B, A -> C, A -> D\n      const nodes = [\n        makeNode('A', [\n          { destination_uuid: 'B' },\n          { destination_uuid: 'C' },\n          { destination_uuid: 'D' }\n        ]),\n        makeNode('B', []),\n        makeNode('C', []),\n        makeNode('D', [])\n      ];\n      const nodeUIs = {\n        A: { position: { left: 0, top: 0 } },\n        B: { position: { left: 0, top: 200 } },\n        C: { position: { left: 300, top: 200 } },\n        D: { position: { left: 600, top: 200 } }\n      };\n      const result = calculateLayeredLayout(\n        nodes,\n        nodeUIs,\n        'A',\n        constantSize(200, 100)\n      );\n\n      // All three children should be on the same layer\n      expect(result['B'].top).to.equal(result['C'].top);\n      expect(result['C'].top).to.equal(result['D'].top);\n\n      // They should be spread horizontally with gaps\n      const lefts = [result['B'].left, result['C'].left, result['D'].left].sort(\n        (a, b) => a - b\n      );\n      expect(lefts[1]).to.be.greaterThan(lefts[0]);\n      expect(lefts[2]).to.be.greaterThan(lefts[1]);\n    });\n  });\n\n  describe('placeStickyNotes', () => {\n    const makeSticky = (left: number, top: number): StickyNote => ({\n      position: { left, top },\n      title: '',\n      body: '',\n      color: 'yellow'\n    });\n\n    it('returns empty object when no stickies', () => {\n      const result = placeStickyNotes(\n        {},\n        { A: { left: 0, top: 0 } },\n        { A: { left: 0, top: 0 } },\n        new Map([['A', { width: 200, height: 100 }]]),\n        new Map(),\n        'A'\n      );\n      expect(Object.keys(result)).to.have.length(0);\n    });\n\n    it('returns empty object when no nodes', () => {\n      const result = placeStickyNotes(\n        { s1: makeSticky(100, 100) },\n        {},\n        {},\n        new Map(),\n        new Map(),\n        'A'\n      );\n      expect(Object.keys(result)).to.have.length(0);\n    });\n\n    it('places sticky to the right of its closest node', () => {\n      const stickies = { s1: makeSticky(250, 0) }; // right of node at (0,0)\n      const oldPositions = { A: { left: 0, top: 0 } };\n      const newPositions = { A: { left: 0, top: 0 } };\n      const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);\n      const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      expect(result['s1']).to.not.be.undefined;\n      // Should be placed to the right of node A\n      expect(result['s1'].left).to.be.greaterThanOrEqual(200);\n    });\n\n    it('places sticky to the left when it was originally left', () => {\n      // Sticky was to the left of node B (not start node)\n      const stickies = { s1: makeSticky(0, 0) }; // left of node at (300, 0)\n      const oldPositions = {\n        A: { left: 0, top: 0 },\n        B: { left: 300, top: 200 }\n      };\n      const newPositions = {\n        A: { left: 0, top: 0 },\n        B: { left: 300, top: 200 }\n      };\n      const nodeSizes = new Map([\n        ['A', { width: 200, height: 100 }],\n        ['B', { width: 200, height: 100 }]\n      ]);\n      const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      expect(result['s1']).to.not.be.undefined;\n    });\n\n    it('redirects left-of-start sticky to the right side', () => {\n      // Sticky was to the left of the start node — should be placed to the right\n      const stickies = { s1: makeSticky(-200, 0) }; // left of start node at (0,0)\n      const oldPositions = { A: { left: 0, top: 0 } };\n      const newPositions = { A: { left: 0, top: 0 } };\n      const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);\n      const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      expect(result['s1']).to.not.be.undefined;\n      // Should be placed to the right (not left) of the start node\n      expect(result['s1'].left).to.be.greaterThanOrEqual(200);\n    });\n\n    it('snaps sticky positions to grid', () => {\n      const stickies = { s1: makeSticky(250, 5) };\n      const oldPositions = { A: { left: 0, top: 0 } };\n      const newPositions = { A: { left: 0, top: 0 } };\n      const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);\n      const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      expect(result['s1'].left % 20).to.equal(0);\n      expect(result['s1'].top % 20).to.equal(0);\n    });\n\n    it('assigns sticky to closest node', () => {\n      // s1 is at (310, 200), closer to B at (300, 200) than A at (0, 0)\n      const stickies = { s1: makeSticky(310, 200) };\n      const oldPositions = {\n        A: { left: 0, top: 0 },\n        B: { left: 300, top: 200 }\n      };\n      const newPositions = {\n        A: { left: 0, top: 0 },\n        B: { left: 300, top: 200 }\n      };\n      const nodeSizes = new Map([\n        ['A', { width: 200, height: 100 }],\n        ['B', { width: 200, height: 100 }]\n      ]);\n      const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      expect(result['s1']).to.not.be.undefined;\n      // Should be placed near node B, not node A\n      expect(result['s1'].left).to.be.greaterThan(200);\n    });\n\n    it('nudges stickies to avoid collisions', () => {\n      // Two stickies both closest to node A, both on the right side\n      const stickies = {\n        s1: makeSticky(250, 0),\n        s2: makeSticky(260, 0)\n      };\n      const oldPositions = { A: { left: 0, top: 0 } };\n      const newPositions = { A: { left: 0, top: 0 } };\n      const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);\n      const stickySizes = new Map([\n        ['s1', { width: 182, height: 100 }],\n        ['s2', { width: 182, height: 100 }]\n      ]);\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      // Both stickies should be placed\n      expect(result['s1']).to.not.be.undefined;\n      expect(result['s2']).to.not.be.undefined;\n\n      // If they have the same left, they should be vertically separated\n      if (result['s1'].left === result['s2'].left) {\n        expect(result['s1'].top).to.not.equal(result['s2'].top);\n      }\n    });\n\n    it('skips stickies without position', () => {\n      const stickies = {\n        s1: { title: '', body: '', color: 'yellow' as const } as StickyNote\n      };\n      const oldPositions = { A: { left: 0, top: 0 } };\n      const newPositions = { A: { left: 0, top: 0 } };\n      const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);\n      const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      // Sticky without position should be skipped\n      expect(result['s1']).to.be.undefined;\n    });\n\n    it('ensures non-negative coordinates for stickies', () => {\n      const stickies = { s1: makeSticky(250, 0) };\n      const oldPositions = { A: { left: 0, top: 0 } };\n      const newPositions = { A: { left: 0, top: 0 } };\n      const nodeSizes = new Map([['A', { width: 200, height: 100 }]]);\n      const stickySizes = new Map([['s1', { width: 182, height: 100 }]]);\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      expect(result['s1'].left).to.be.at.least(0);\n      expect(result['s1'].top).to.be.at.least(0);\n    });\n\n    it('uses default sizes when not provided', () => {\n      const stickies = { s1: makeSticky(250, 0) };\n      const oldPositions = { A: { left: 0, top: 0 } };\n      const newPositions = { A: { left: 0, top: 0 } };\n      const nodeSizes = new Map<string, { width: number; height: number }>();\n      const stickySizes = new Map<string, { width: number; height: number }>();\n\n      const result = placeStickyNotes(\n        stickies,\n        oldPositions,\n        newPositions,\n        nodeSizes,\n        stickySizes,\n        'A'\n      );\n\n      expect(result['s1']).to.not.be.undefined;\n      expect(result['s1'].left).to.be.at.least(0);\n      expect(result['s1'].top).to.be.at.least(0);\n    });\n  });\n});\n"]}