@osmix/router 0.0.2

package/dist/test/algorithms.test.js

@@ -0,0 +1,382 @@
+import { describe, expect, it } from "bun:test";
+import { astar, bidirectional, dijkstra } from "../src/algorithms";
+/**
+ * Test suite for individual routing algorithms.
+ *
+ * These tests verify the core behavior of each algorithm in isolation,
+ * using simple mock graphs instead of full OSM data. This allows us to
+ * test specific edge cases and verify algorithm correctness.
+ */
+// ---------------------------------------------------------------------------
+// Mock Graph Helpers
+// ---------------------------------------------------------------------------
+/**
+ * Creates a simple graph function from an adjacency list.
+ * The adjacency list maps node IDs to their outgoing edges.
+ */
+function createGraph(adjacencyList) {
+    return (nodeId) => adjacencyList.get(nodeId) ?? [];
+}
+/**
+ * Simple edge weight function that uses distance.
+ */
+function distanceWeight(edge) {
+    return edge.distance;
+}
+/**
+ * Creates a mock edge with default values.
+ */
+function mockEdge(targetNodeIndex, wayIndex, distance) {
+    return {
+        targetNodeIndex: targetNodeIndex,
+        wayIndex,
+        distance,
+        time: distance / 10, // 10 m/s default speed
+    };
+}
+/**
+ * Creates a simple linear graph: 1 <-> 2 <-> 3 <-> 4
+ * Bidirectional edges for proper routing.
+ */
+function createLinearGraph() {
+    return new Map([
+        [1, [mockEdge(2, 100, 10)]],
+        [2, [mockEdge(1, 100, 10), mockEdge(3, 101, 10)]],
+        [3, [mockEdge(2, 101, 10), mockEdge(4, 102, 10)]],
+        [4, [mockEdge(3, 102, 10)]],
+    ]);
+}
+/**
+ * Creates a graph with multiple paths (bidirectional):
+ *
+ *     1 <---(way 100, dist 10)---> 2
+ *     ^                           ^
+ *     | (way 101, dist 5)         | (way 102, dist 5)
+ *     v                           v
+ *     3 <---(way 103, dist 10)---> 4
+ *
+ * Path 1->2->4 has distance 15
+ * Path 1->3->4 has distance 15
+ */
+function createSquareGraph() {
+    return new Map([
+        [1, [mockEdge(2, 100, 10), mockEdge(3, 101, 5)]],
+        [2, [mockEdge(1, 100, 10), mockEdge(4, 102, 5)]],
+        [3, [mockEdge(1, 101, 5), mockEdge(4, 103, 10)]],
+        [4, [mockEdge(2, 102, 5), mockEdge(3, 103, 10)]],
+    ]);
+}
+/**
+ * Creates a graph where shortest path is indirect (bidirectional):
+ *
+ *     1 <---(way 100, dist 100)---> 4  (direct but long)
+ *     ^
+ *     | (way 101, dist 10)
+ *     v
+ *     2 <---(way 102, dist 10)---> 3 <---(way 103, dist 10)---> 4
+ *
+ * Direct path: 100
+ * Indirect path: 30 (should be chosen)
+ */
+function createIndirectShorterGraph() {
+    return new Map([
+        [
+            1,
+            [
+                mockEdge(4, 100, 100), // Direct but long
+                mockEdge(2, 101, 10), // Indirect start
+            ],
+        ],
+        [2, [mockEdge(1, 101, 10), mockEdge(3, 102, 10)]],
+        [3, [mockEdge(2, 102, 10), mockEdge(4, 103, 10)]],
+        [4, [mockEdge(1, 100, 100), mockEdge(3, 103, 10)]],
+    ]);
+}
+/**
+ * Creates a disconnected graph where node 4 is unreachable.
+ * Nodes 1-3 are connected bidirectionally, but 4 has no edges.
+ */
+function createDisconnectedGraph() {
+    return new Map([
+        [1, [mockEdge(2, 100, 10)]],
+        [2, [mockEdge(1, 100, 10), mockEdge(3, 101, 10)]],
+        [3, [mockEdge(2, 101, 10)]],
+        [4, []], // Unreachable - no edges to/from this node
+    ]);
+}
+/**
+ * Creates a mock coordinate function for A* heuristic.
+ *
+ * The coordinates are carefully chosen so that the heuristic (straight-line
+ * distance) is admissible - it never overestimates the actual path cost.
+ * This ensures A* will find optimal paths.
+ *
+ * Node layout (not to scale):
+ *   1 ---- 2 ---- 3 ---- 4
+ *
+ * Each segment is ~5m (0.00005 degrees), so total 1->4 is ~15m.
+ * Edge weights are 10+ units, so heuristic <= actual cost (admissible).
+ */
+function createCoordFn() {
+    const coords = new Map([
+        [1, [0, 0]],
+        [2, [0.00005, 0]], // ~5m east
+        [3, [0.0001, 0]], // ~10m east
+        [4, [0.00015, 0]], // ~15m east
+    ]);
+    return (nodeId) => coords.get(nodeId);
+}
+// ---------------------------------------------------------------------------
+// Dijkstra Tests
+// ---------------------------------------------------------------------------
+describe("dijkstra", () => {
+    it("should find direct path between adjacent nodes", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = dijkstra(graph, 1, 2, distanceWeight);
+        expect(path).not.toBeNull();
+        expect(path?.length).toBe(2);
+        expect(path?.[0]?.nodeIndex).toBe(1);
+        expect(path?.[1]?.nodeIndex).toBe(2);
+        expect(path?.[1]?.wayIndex).toBe(100);
+    });
+    it("should find path through multiple nodes", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = dijkstra(graph, 1, 4, distanceWeight);
+        expect(path).not.toBeNull();
+        expect(path?.length).toBe(4);
+        // Verify node order
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        expect(nodeIds).toEqual([1, 2, 3, 4]);
+        // Verify way indexes are tracked
+        expect(path?.[1]?.wayIndex).toBe(100);
+        expect(path?.[2]?.wayIndex).toBe(101);
+        expect(path?.[3]?.wayIndex).toBe(102);
+    });
+    it("should return null when no path exists", () => {
+        const graph = createGraph(createDisconnectedGraph());
+        const path = dijkstra(graph, 1, 4, distanceWeight);
+        expect(path).toBeNull();
+    });
+    it("should handle same start and end node", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = dijkstra(graph, 1, 1, distanceWeight);
+        expect(path).not.toBeNull();
+        expect(path?.length).toBe(1);
+        expect(path?.[0]?.nodeIndex).toBe(1);
+    });
+    it("should find shortest path when indirect is shorter", () => {
+        const graph = createGraph(createIndirectShorterGraph());
+        const path = dijkstra(graph, 1, 4, distanceWeight);
+        expect(path).not.toBeNull();
+        // Should take indirect route 1->2->3->4 (cost 30) not 1->4 (cost 100)
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        expect(nodeIds).toEqual([1, 2, 3, 4]);
+        // Verify total cost
+        const lastSegment = path?.[path.length - 1];
+        expect(lastSegment?.cost).toBe(30);
+    });
+    it("should calculate correct costs", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = dijkstra(graph, 1, 4, distanceWeight);
+        expect(path).not.toBeNull();
+        // Each edge has distance 10
+        expect(path?.[0]?.cost).toBe(0); // Start node
+        expect(path?.[1]?.cost).toBe(10);
+        expect(path?.[2]?.cost).toBe(20);
+        expect(path?.[3]?.cost).toBe(30);
+    });
+    it("should track correct way indexes in path", () => {
+        const graph = createGraph(createSquareGraph());
+        const path = dijkstra(graph, 1, 4, distanceWeight);
+        expect(path).not.toBeNull();
+        // Verify way indexes are present for traversed edges
+        const wayIndexes = path?.slice(1).map((p) => p.wayIndex);
+        expect(wayIndexes?.every((idx) => idx !== undefined)).toBe(true);
+    });
+});
+// ---------------------------------------------------------------------------
+// A* Tests
+// ---------------------------------------------------------------------------
+describe("astar", () => {
+    it("should find direct path between adjacent nodes", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = astar(graph, 1, 2, distanceWeight, createCoordFn());
+        expect(path).not.toBeNull();
+        expect(path?.length).toBe(2);
+        expect(path?.[0]?.nodeIndex).toBe(1);
+        expect(path?.[1]?.nodeIndex).toBe(2);
+    });
+    it("should find path through multiple nodes", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = astar(graph, 1, 4, distanceWeight, createCoordFn());
+        expect(path).not.toBeNull();
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        expect(nodeIds).toEqual([1, 2, 3, 4]);
+    });
+    it("should return null when no path exists", () => {
+        const graph = createGraph(createDisconnectedGraph());
+        const path = astar(graph, 1, 4, distanceWeight, createCoordFn());
+        expect(path).toBeNull();
+    });
+    it("should handle same start and end node", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = astar(graph, 1, 1, distanceWeight, createCoordFn());
+        expect(path).not.toBeNull();
+        expect(path?.length).toBe(1);
+        expect(path?.[0]?.nodeIndex).toBe(1);
+    });
+    it("should find shortest path when indirect is shorter", () => {
+        const graph = createGraph(createIndirectShorterGraph());
+        const path = astar(graph, 1, 4, distanceWeight, createCoordFn());
+        expect(path).not.toBeNull();
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        expect(nodeIds).toEqual([1, 2, 3, 4]);
+    });
+    it("should use heuristic to guide search", () => {
+        // With heuristic, A* should explore fewer nodes than Dijkstra
+        // We can verify it finds the correct path
+        const graph = createGraph(createIndirectShorterGraph());
+        const path = astar(graph, 1, 4, distanceWeight, createCoordFn());
+        expect(path).not.toBeNull();
+        expect(path?.[path.length - 1]?.cost).toBe(30);
+    });
+    it("should return null when coordinate function is missing", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = astar(graph, 1, 4, distanceWeight, undefined);
+        expect(path).toBeNull();
+    });
+    it("should handle missing coordinate for node gracefully", () => {
+        const graph = createGraph(createLinearGraph());
+        // Coordinate function that only knows about nodes 1 and 4
+        const partialCoordFn = (nodeId) => {
+            if (nodeId === 1)
+                return [0, 0];
+            if (nodeId === 4)
+                return [0.001, 0.001];
+            return undefined;
+        };
+        const path = astar(graph, 1, 4, distanceWeight, partialCoordFn);
+        // A* should still find a path, using 0 heuristic for unknown nodes
+        expect(path).not.toBeNull();
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        expect(nodeIds).toEqual([1, 2, 3, 4]);
+    });
+    it("should track correct way indexes in path", () => {
+        const graph = createGraph(createSquareGraph());
+        const path = astar(graph, 1, 4, distanceWeight, createCoordFn());
+        expect(path).not.toBeNull();
+        const wayIndexes = path?.slice(1).map((p) => p.wayIndex);
+        expect(wayIndexes?.every((idx) => idx !== undefined)).toBe(true);
+    });
+});
+// ---------------------------------------------------------------------------
+// Bidirectional Tests
+// ---------------------------------------------------------------------------
+describe("bidirectional", () => {
+    it("should find direct path between adjacent nodes", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = bidirectional(graph, 1, 2, distanceWeight);
+        expect(path).not.toBeNull();
+        // Bidirectional may have different path structure but same nodes
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        expect(nodeIds).toContain(1);
+        expect(nodeIds).toContain(2);
+    });
+    it("should find path through multiple nodes", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = bidirectional(graph, 1, 4, distanceWeight);
+        expect(path).not.toBeNull();
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        // Should contain all nodes in the path
+        expect(nodeIds).toContain(1);
+        expect(nodeIds).toContain(4);
+    });
+    it("should return null when no path exists", () => {
+        const graph = createGraph(createDisconnectedGraph());
+        const path = bidirectional(graph, 1, 4, distanceWeight);
+        expect(path).toBeNull();
+    });
+    it("should handle same start and end node", () => {
+        const graph = createGraph(createLinearGraph());
+        const path = bidirectional(graph, 1, 1, distanceWeight);
+        expect(path).not.toBeNull();
+        expect(path?.some((p) => p.nodeIndex === 1)).toBe(true);
+    });
+    it("should meet in the middle correctly", () => {
+        // Create a symmetric graph where meeting in middle is clear
+        // 1 <-> 2 <-> 3 <-> 4 <-> 5
+        const symmetricGraph = new Map([
+            [1, [mockEdge(2, 100, 10)]],
+            [2, [mockEdge(1, 100, 10), mockEdge(3, 101, 10)]],
+            [3, [mockEdge(2, 101, 10), mockEdge(4, 102, 10)]],
+            [4, [mockEdge(3, 102, 10), mockEdge(5, 103, 10)]],
+            [5, [mockEdge(4, 103, 10)]],
+        ]);
+        const graph = createGraph(symmetricGraph);
+        const path = bidirectional(graph, 1, 5, distanceWeight);
+        expect(path).not.toBeNull();
+        // Should include start and end
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        expect(nodeIds).toContain(1);
+        expect(nodeIds).toContain(5);
+    });
+    it("should combine forward and backward paths properly", () => {
+        const graph = createGraph(createSquareGraph());
+        const path = bidirectional(graph, 1, 4, distanceWeight);
+        expect(path).not.toBeNull();
+        // Path should go from 1 to 4
+        const nodeIds = path?.map((p) => p.nodeIndex);
+        expect(nodeIds?.[0]).toBe(1);
+        // Last node should be 4 or path should include 4
+        expect(nodeIds).toContain(4);
+    });
+    it("should track way indexes in combined path", () => {
+        const graph = createGraph(createSquareGraph());
+        const path = bidirectional(graph, 1, 4, distanceWeight);
+        expect(path).not.toBeNull();
+        // Way indexes should be present (except possibly for start node)
+        const wayIndexes = path
+            ?.filter((p) => p.wayIndex !== undefined)
+            .map((p) => p.wayIndex);
+        expect(wayIndexes?.length).toBeGreaterThan(0);
+    });
+});
+// ---------------------------------------------------------------------------
+// Cross-Algorithm Comparison Tests
+// ---------------------------------------------------------------------------
+describe("algorithm consistency", () => {
+    it("should find same path length with all algorithms", () => {
+        const graph = createGraph(createIndirectShorterGraph());
+        const dijkstraPath = dijkstra(graph, 1, 4, distanceWeight);
+        const astarPath = astar(graph, 1, 4, distanceWeight, createCoordFn());
+        const biPath = bidirectional(graph, 1, 4, distanceWeight);
+        // All should find a path
+        expect(dijkstraPath).not.toBeNull();
+        expect(astarPath).not.toBeNull();
+        expect(biPath).not.toBeNull();
+        // Dijkstra and A* should have same final cost
+        const dijkstraCost = dijkstraPath?.[dijkstraPath.length - 1]?.cost;
+        const astarCost = astarPath?.[astarPath.length - 1]?.cost;
+        expect(dijkstraCost).toBe(astarCost);
+    });
+    it("all algorithms should return null for unreachable nodes", () => {
+        const graph = createGraph(createDisconnectedGraph());
+        expect(dijkstra(graph, 1, 4, distanceWeight)).toBeNull();
+        expect(astar(graph, 1, 4, distanceWeight, createCoordFn())).toBeNull();
+        expect(bidirectional(graph, 1, 4, distanceWeight)).toBeNull();
+    });
+    it("all algorithms should handle trivial single-node path", () => {
+        const graph = createGraph(createLinearGraph());
+        const dijkstraPath = dijkstra(graph, 1, 1, distanceWeight);
+        const astarPath = astar(graph, 1, 1, distanceWeight, createCoordFn());
+        const biPath = bidirectional(graph, 1, 1, distanceWeight);
+        expect(dijkstraPath).not.toBeNull();
+        expect(astarPath).not.toBeNull();
+        expect(biPath).not.toBeNull();
+        // All should include node 1
+        expect(dijkstraPath?.some((p) => p.nodeIndex === 1)).toBe(true);
+        expect(astarPath?.some((p) => p.nodeIndex === 1)).toBe(true);
+        expect(biPath?.some((p) => p.nodeIndex === 1)).toBe(true);
+    });
+});
+//# sourceMappingURL=algorithms.test.js.map

package/dist/test/algorithms.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"algorithms.test.js","sourceRoot":"","sources":["../../test/algorithms.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,UAAU,CAAA;AAC/C,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAA;AAGlE;;;;;;GAMG;AAEH,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,WAAW,CACnB,aAAuC;IAEvC,OAAO,CAAC,MAAc,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAA;AAC3D,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,IAAe;IACtC,OAAO,IAAI,CAAC,QAAQ,CAAA;AACrB,CAAC;AAED;;GAEG;AACH,SAAS,QAAQ,CAChB,eAAuB,EACvB,QAAgB,EAChB,QAAgB;IAEhB,OAAO;QACN,eAAe,EAAE,eAAe;QAChC,QAAQ;QACR,QAAQ;QACR,IAAI,EAAE,QAAQ,GAAG,EAAE,EAAE,uBAAuB;KAC5C,CAAA;AACF,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB;IACzB,OAAO,IAAI,GAAG,CAAC;QACd,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;KAC3B,CAAC,CAAA;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,iBAAiB;IACzB,OAAO,IAAI,GAAG,CAAC;QACd,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;KAChD,CAAC,CAAA;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,0BAA0B;IAClC,OAAO,IAAI,GAAG,CAAC;QACd;YACC,CAAC;YACD;gBACC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,kBAAkB;gBACzC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,iBAAiB;aACvC;SACD;QACD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;KAClD,CAAC,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,uBAAuB;IAC/B,OAAO,IAAI,GAAG,CAAC;QACd,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,2CAA2C;KACpD,CAAC,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,aAAa;IACrB,MAAM,MAAM,GAAG,IAAI,GAAG,CAA2B;QAChD,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACX,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW;QAC9B,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY;QAC9B,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY;KAC/B,CAAC,CAAA;IACF,OAAO,CAAC,MAAc,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;AAC9C,CAAC;AAED,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;IACzB,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAElD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACtC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAElD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAE5B,oBAAoB;QACpB,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAErC,iCAAiC;QACjC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACrC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACrC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACtC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,WAAW,CAAC,uBAAuB,EAAE,CAAC,CAAA;QACpD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAElD,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAA;IACxB,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAElD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,WAAW,CAAC,0BAA0B,EAAE,CAAC,CAAA;QACvD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAElD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAE3B,sEAAsE;QACtE,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAErC,oBAAoB;QACpB,MAAM,WAAW,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC3C,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACnC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAElD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAE3B,4BAA4B;QAC5B,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,aAAa;QAC7C,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACjC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAElD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAE3B,qDAAqD;QACrD,MAAM,UAAU,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;QACxD,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACjE,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,WAAW;AACX,8EAA8E;AAE9E,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;IACtB,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QAEhE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QAEhE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACtC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,WAAW,CAAC,uBAAuB,EAAE,CAAC,CAAA;QACpD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QAEhE,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAA;IACxB,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QAEhE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,WAAW,CAAC,0BAA0B,EAAE,CAAC,CAAA;QACvD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QAEhE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACtC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,8DAA8D;QAC9D,0CAA0C;QAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,0BAA0B,EAAE,CAAC,CAAA;QACvD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QAEhE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC/C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,SAAS,CAAC,CAAA;QAE1D,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAA;IACxB,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,0DAA0D;QAC1D,MAAM,cAAc,GAAG,CAAC,MAAc,EAAE,EAAE;YACzC,IAAI,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAqB,CAAA;YACnD,IAAI,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,KAAK,EAAE,KAAK,CAAqB,CAAA;YAC3D,OAAO,SAAS,CAAA;QACjB,CAAC,CAAA;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,cAAc,CAAC,CAAA;QAE/D,mEAAmE;QACnE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACtC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QAEhE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,UAAU,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;QACxD,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACjE,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEvD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,iEAAiE;QACjE,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IAC7B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEvD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,uCAAuC;QACvC,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IAC7B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,WAAW,CAAC,uBAAuB,EAAE,CAAC,CAAA;QACpD,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEvD,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAA;IACxB,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEvD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACxD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC9C,4DAA4D;QAC5D,4BAA4B;QAC5B,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC;YAC9B,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3B,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACjD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACjD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACjD,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;SAC3B,CAAC,CAAA;QAEF,MAAM,KAAK,GAAG,WAAW,CAAC,cAAc,CAAC,CAAA;QACzC,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEvD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC3B,+BAA+B;QAC/B,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IAC7B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEvD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAE3B,6BAA6B;QAC7B,MAAM,OAAO,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5B,iDAAiD;QACjD,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IAC7B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAC9C,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEvD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAE3B,iEAAiE;QACjE,MAAM,UAAU,GAAG,IAAI;YACtB,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC;aACxC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;QACxB,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,mCAAmC;AACnC,8EAA8E;AAE9E,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACtC,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,WAAW,CAAC,0BAA0B,EAAE,CAAC,CAAA;QAEvD,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAC1D,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QACrE,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEzD,yBAAyB;QACzB,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QACnC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAE7B,8CAA8C;QAC9C,MAAM,YAAY,GAAG,YAAY,EAAE,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAA;QAClE,MAAM,SAAS,GAAG,SAAS,EAAE,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAA;QAEzD,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAAG,WAAW,CAAC,uBAAuB,EAAE,CAAC,CAAA;QAEpD,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;QACxD,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;QACtE,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;IAC9D,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAChE,MAAM,KAAK,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAA;QAE9C,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAC1D,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC,CAAA;QACrE,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAA;QAEzD,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QACnC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;QAE7B,4BAA4B;QAC5B,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC/D,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC5D,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC1D,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA"}

package/dist/test/router.bench.d.ts

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

package/dist/test/router.bench.d.ts.map

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

package/dist/test/router.bench.js

@@ -0,0 +1,191 @@
+import { Osm } from "@osmix/core";
+import { getFixtureFile, PBFs } from "@osmix/shared/test/fixtures";
+import { bench, group, run } from "mitata";
+import { fromPbf } from "osmix";
+import { buildGraph } from "../src";
+import { Router } from "../src/router";
+/**
+ * Router Benchmark Suite using mitata
+ *
+ * Run with: bun test/router.bench.ts
+ *
+ * These benchmarks compare the performance of different routing algorithms
+ * using both real-world OSM data (Monaco) and synthetic grid networks.
+ */
+// ---------------------------------------------------------------------------
+// Synthetic Grid Helper
+// ---------------------------------------------------------------------------
+/**
+ * Creates a synthetic grid network for benchmarking.
+ *
+ * The grid consists of nodes arranged in a square pattern with
+ * horizontal and vertical ways connecting adjacent nodes.
+ *
+ * @param size - Number of nodes in each dimension (size x size total)
+ * @param spacing - Spacing between nodes in degrees (~100m per 0.001)
+ */
+function createSyntheticGrid(size, spacing) {
+    const osm = new Osm({ id: "synthetic-grid" });
+    // Create nodes in a grid pattern
+    for (let row = 0; row < size; row++) {
+        for (let col = 0; col < size; col++) {
+            const nodeId = row * size + col + 1;
+            osm.nodes.addNode({
+                id: nodeId,
+                lat: row * spacing,
+                lon: col * spacing,
+            });
+        }
+    }
+    osm.nodes.buildIndex();
+    osm.nodes.buildSpatialIndex();
+    // Create horizontal ways (connecting nodes in each row)
+    let wayId = 1;
+    for (let row = 0; row < size; row++) {
+        const refs = [];
+        for (let col = 0; col < size; col++) {
+            refs.push(row * size + col + 1);
+        }
+        osm.ways.addWay({
+            id: wayId++,
+            refs,
+            tags: { highway: "residential" },
+        });
+    }
+    // Create vertical ways (connecting nodes in each column)
+    for (let col = 0; col < size; col++) {
+        const refs = [];
+        for (let row = 0; row < size; row++) {
+            refs.push(row * size + col + 1);
+        }
+        osm.ways.addWay({
+            id: wayId++,
+            refs,
+            tags: { highway: "residential" },
+        });
+    }
+    osm.ways.buildIndex();
+    osm.ways.buildSpatialIndex();
+    osm.buildIndexes();
+    return osm;
+}
+// ---------------------------------------------------------------------------
+// Setup
+// ---------------------------------------------------------------------------
+console.log("Setting up benchmark data...");
+// Load Monaco PBF
+const monacoPbf = PBFs["monaco"];
+const pbfData = await getFixtureFile(monacoPbf.url);
+const monacoOsm = await fromPbf(pbfData, {
+    buildSpatialIndexes: ["node", "way"],
+});
+const monacoGraph = buildGraph(monacoOsm);
+const monacoRouter = new Router(monacoOsm, monacoGraph);
+// Create synthetic grid
+const GRID_SIZE = 50;
+const GRID_SPACING = 0.001;
+const gridOsm = createSyntheticGrid(GRID_SIZE, GRID_SPACING);
+const gridGraph = buildGraph(gridOsm);
+const gridRouter = new Router(gridOsm, gridGraph);
+// Pre-snap coordinates to node indexes for benchmarking
+const monacoShortFrom = monacoGraph.findNearestRoutableNode(monacoOsm, [7.42, 43.735], 500).nodeIndex;
+const monacoShortTo = monacoGraph.findNearestRoutableNode(monacoOsm, [7.425, 43.738], 500).nodeIndex;
+const monacoLongFrom = monacoGraph.findNearestRoutableNode(monacoOsm, [7.41, 43.725], 500).nodeIndex;
+const monacoLongTo = monacoGraph.findNearestRoutableNode(monacoOsm, [7.44, 43.745], 500).nodeIndex;
+const gridShortFrom = gridGraph.findNearestRoutableNode(gridOsm, [0.01, 0.01], 200).nodeIndex;
+const gridShortTo = gridGraph.findNearestRoutableNode(gridOsm, [0.015, 0.015], 200).nodeIndex;
+const gridLongFrom = gridGraph.findNearestRoutableNode(gridOsm, [0, 0], 200).nodeIndex;
+const gridLongTo = gridGraph.findNearestRoutableNode(gridOsm, [(GRID_SIZE - 1) * GRID_SPACING, (GRID_SIZE - 1) * GRID_SPACING], 200).nodeIndex;
+console.log("Setup complete. Running benchmarks...\n");
+// ---------------------------------------------------------------------------
+// Monaco PBF Benchmarks
+// ---------------------------------------------------------------------------
+group("Monaco - Short Distance (~500m)", () => {
+    bench("Dijkstra", () => {
+        monacoRouter.route(monacoShortFrom, monacoShortTo, {
+            algorithm: "dijkstra",
+        });
+    });
+    bench("A*", () => {
+        monacoRouter.route(monacoShortFrom, monacoShortTo, {
+            algorithm: "astar",
+        });
+    });
+    bench("Bidirectional", () => {
+        monacoRouter.route(monacoShortFrom, monacoShortTo, {
+            algorithm: "bidirectional",
+        });
+    });
+});
+group("Monaco - Long Distance (~2km)", () => {
+    bench("Dijkstra", () => {
+        monacoRouter.route(monacoLongFrom, monacoLongTo, {
+            algorithm: "dijkstra",
+        });
+    });
+    bench("A*", () => {
+        monacoRouter.route(monacoLongFrom, monacoLongTo, {
+            algorithm: "astar",
+        });
+    });
+    bench("Bidirectional", () => {
+        monacoRouter.route(monacoLongFrom, monacoLongTo, {
+            algorithm: "bidirectional",
+        });
+    });
+});
+// ---------------------------------------------------------------------------
+// Synthetic Grid Benchmarks
+// ---------------------------------------------------------------------------
+group("Grid 50x50 - Short Path", () => {
+    bench("Dijkstra", () => {
+        gridRouter.route(gridShortFrom, gridShortTo, {
+            algorithm: "dijkstra",
+        });
+    });
+    bench("A*", () => {
+        gridRouter.route(gridShortFrom, gridShortTo, {
+            algorithm: "astar",
+        });
+    });
+    bench("Bidirectional", () => {
+        gridRouter.route(gridShortFrom, gridShortTo, {
+            algorithm: "bidirectional",
+        });
+    });
+});
+group("Grid 50x50 - Long Path (corner to corner)", () => {
+    bench("Dijkstra", () => {
+        gridRouter.route(gridLongFrom, gridLongTo, {
+            algorithm: "dijkstra",
+        });
+    });
+    bench("A*", () => {
+        gridRouter.route(gridLongFrom, gridLongTo, {
+            algorithm: "astar",
+        });
+    });
+    bench("Bidirectional", () => {
+        gridRouter.route(gridLongFrom, gridLongTo, {
+            algorithm: "bidirectional",
+        });
+    });
+});
+// ---------------------------------------------------------------------------
+// Router Initialization Benchmarks
+// ---------------------------------------------------------------------------
+group("Router Initialization", () => {
+    bench("Monaco OSM (14k nodes, 3k ways)", () => {
+        new Router(monacoOsm, buildGraph(monacoOsm));
+    });
+    bench("Grid 50x50 (2.5k nodes)", () => {
+        new Router(gridOsm, buildGraph(gridOsm));
+    });
+});
+// ---------------------------------------------------------------------------
+// Run benchmarks
+// ---------------------------------------------------------------------------
+await run({
+    colors: true,
+});
+//# sourceMappingURL=router.bench.js.map

package/dist/test/router.bench.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.bench.js","sourceRoot":"","sources":["../../test/router.bench.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAA;AACjC,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,6BAA6B,CAAA;AAClE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,QAAQ,CAAA;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,OAAO,CAAA;AAC/B,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAA;AACnC,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAA;AAEtC;;;;;;;GAOG;AAEH,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E;;;;;;;;GAQG;AACH,SAAS,mBAAmB,CAAC,IAAY,EAAE,OAAe;IACzD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAA;IAE7C,iCAAiC;IACjC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACrC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;YACnC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;gBACjB,EAAE,EAAE,MAAM;gBACV,GAAG,EAAE,GAAG,GAAG,OAAO;gBAClB,GAAG,EAAE,GAAG,GAAG,OAAO;aAClB,CAAC,CAAA;QACH,CAAC;IACF,CAAC;IAED,GAAG,CAAC,KAAK,CAAC,UAAU,EAAE,CAAA;IACtB,GAAG,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAA;IAE7B,wDAAwD;IACxD,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAA;QAChC,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YACf,EAAE,EAAE,KAAK,EAAE;YACX,IAAI;YACJ,IAAI,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;SAChC,CAAC,CAAA;IACH,CAAC;IAED,yDAAyD;IACzD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAA;QAChC,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YACf,EAAE,EAAE,KAAK,EAAE;YACX,IAAI;YACJ,IAAI,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;SAChC,CAAC,CAAA;IACH,CAAC;IAED,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,CAAA;IACrB,GAAG,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAA;IAC5B,GAAG,CAAC,YAAY,EAAE,CAAA;IAElB,OAAO,GAAG,CAAA;AACX,CAAC;AAED,8EAA8E;AAC9E,QAAQ;AACR,8EAA8E;AAE9E,OAAO,CAAC,GAAG,CAAC,8BAA8B,CAAC,CAAA;AAE3C,kBAAkB;AAClB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAE,CAAA;AACjC,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;AACnD,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,OAAO,EAAE;IACxC,mBAAmB,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;CACpC,CAAC,CAAA;AACF,MAAM,WAAW,GAAG,UAAU,CAAC,SAAS,CAAC,CAAA;AACzC,MAAM,YAAY,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,CAAA;AAEvD,wBAAwB;AACxB,MAAM,SAAS,GAAG,EAAE,CAAA;AACpB,MAAM,YAAY,GAAG,KAAK,CAAA;AAC1B,MAAM,OAAO,GAAG,mBAAmB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAA;AAC5D,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,CAAA;AACrC,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;AAEjD,wDAAwD;AACxD,MAAM,eAAe,GAAG,WAAW,CAAC,uBAAuB,CAC1D,SAAS,EACT,CAAC,IAAI,EAAE,MAAM,CAAC,EACd,GAAG,CACF,CAAC,SAAS,CAAA;AACZ,MAAM,aAAa,GAAG,WAAW,CAAC,uBAAuB,CACxD,SAAS,EACT,CAAC,KAAK,EAAE,MAAM,CAAC,EACf,GAAG,CACF,CAAC,SAAS,CAAA;AACZ,MAAM,cAAc,GAAG,WAAW,CAAC,uBAAuB,CACzD,SAAS,EACT,CAAC,IAAI,EAAE,MAAM,CAAC,EACd,GAAG,CACF,CAAC,SAAS,CAAA;AACZ,MAAM,YAAY,GAAG,WAAW,CAAC,uBAAuB,CACvD,SAAS,EACT,CAAC,IAAI,EAAE,MAAM,CAAC,EACd,GAAG,CACF,CAAC,SAAS,CAAA;AAEZ,MAAM,aAAa,GAAG,SAAS,CAAC,uBAAuB,CACtD,OAAO,EACP,CAAC,IAAI,EAAE,IAAI,CAAC,EACZ,GAAG,CACF,CAAC,SAAS,CAAA;AACZ,MAAM,WAAW,GAAG,SAAS,CAAC,uBAAuB,CACpD,OAAO,EACP,CAAC,KAAK,EAAE,KAAK,CAAC,EACd,GAAG,CACF,CAAC,SAAS,CAAA;AACZ,MAAM,YAAY,GAAG,SAAS,CAAC,uBAAuB,CACrD,OAAO,EACP,CAAC,CAAC,EAAE,CAAC,CAAC,EACN,GAAG,CACF,CAAC,SAAS,CAAA;AACZ,MAAM,UAAU,GAAG,SAAS,CAAC,uBAAuB,CACnD,OAAO,EACP,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,EAChE,GAAG,CACF,CAAC,SAAS,CAAA;AAEZ,OAAO,CAAC,GAAG,CAAC,yCAAyC,CAAC,CAAA;AAEtD,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E,KAAK,CAAC,iCAAiC,EAAE,GAAG,EAAE;IAC7C,KAAK,CAAC,UAAU,EAAE,GAAG,EAAE;QACtB,YAAY,CAAC,KAAK,CAAC,eAAe,EAAE,aAAa,EAAE;YAClD,SAAS,EAAE,UAAU;SACrB,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE;QAChB,YAAY,CAAC,KAAK,CAAC,eAAe,EAAE,aAAa,EAAE;YAClD,SAAS,EAAE,OAAO;SAClB,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,eAAe,EAAE,GAAG,EAAE;QAC3B,YAAY,CAAC,KAAK,CAAC,eAAe,EAAE,aAAa,EAAE;YAClD,SAAS,EAAE,eAAe;SAC1B,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,KAAK,CAAC,+BAA+B,EAAE,GAAG,EAAE;IAC3C,KAAK,CAAC,UAAU,EAAE,GAAG,EAAE;QACtB,YAAY,CAAC,KAAK,CAAC,cAAc,EAAE,YAAY,EAAE;YAChD,SAAS,EAAE,UAAU;SACrB,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE;QAChB,YAAY,CAAC,KAAK,CAAC,cAAc,EAAE,YAAY,EAAE;YAChD,SAAS,EAAE,OAAO;SAClB,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,eAAe,EAAE,GAAG,EAAE;QAC3B,YAAY,CAAC,KAAK,CAAC,cAAc,EAAE,YAAY,EAAE;YAChD,SAAS,EAAE,eAAe;SAC1B,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,4BAA4B;AAC5B,8EAA8E;AAE9E,KAAK,CAAC,yBAAyB,EAAE,GAAG,EAAE;IACrC,KAAK,CAAC,UAAU,EAAE,GAAG,EAAE;QACtB,UAAU,CAAC,KAAK,CAAC,aAAa,EAAE,WAAW,EAAE;YAC5C,SAAS,EAAE,UAAU;SACrB,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE;QAChB,UAAU,CAAC,KAAK,CAAC,aAAa,EAAE,WAAW,EAAE;YAC5C,SAAS,EAAE,OAAO;SAClB,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,eAAe,EAAE,GAAG,EAAE;QAC3B,UAAU,CAAC,KAAK,CAAC,aAAa,EAAE,WAAW,EAAE;YAC5C,SAAS,EAAE,eAAe;SAC1B,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,KAAK,CAAC,2CAA2C,EAAE,GAAG,EAAE;IACvD,KAAK,CAAC,UAAU,EAAE,GAAG,EAAE;QACtB,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,UAAU,EAAE;YAC1C,SAAS,EAAE,UAAU;SACrB,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE;QAChB,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,UAAU,EAAE;YAC1C,SAAS,EAAE,OAAO;SAClB,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,eAAe,EAAE,GAAG,EAAE;QAC3B,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,UAAU,EAAE;YAC1C,SAAS,EAAE,eAAe;SAC1B,CAAC,CAAA;IACH,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,mCAAmC;AACnC,8EAA8E;AAE9E,KAAK,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACnC,KAAK,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC7C,IAAI,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC,CAAA;IAC7C,CAAC,CAAC,CAAA;IAEF,KAAK,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACrC,IAAI,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;AACH,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E,MAAM,GAAG,CAAC;IACT,MAAM,EAAE,IAAI;CACZ,CAAC,CAAA"}

package/dist/test/router.test.d.ts

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

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

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